1 /* Functions related to invoking -*- C++ -*- methods and overloaded functions.
2 Copyright (C) 1987-2018 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, true if the context is
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 (location_t
, enum tree_code
, enum tree_code
, tree
,
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
))
1415 conv
= build_conv (ck_std
, to
, conv
);
1417 /* Give this a better rank if it's a promotion. */
1418 if (same_type_p (to
, type_promotes_to (from
))
1419 && next_conversion (conv
)->rank
<= cr_promotion
)
1420 conv
->rank
= cr_promotion
;
1422 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1423 && vector_types_convertible_p (from
, to
, false))
1424 return build_conv (ck_std
, to
, conv
);
1425 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1426 && is_properly_derived_from (from
, to
))
1428 if (conv
->kind
== ck_rvalue
)
1429 conv
= next_conversion (conv
);
1430 conv
= build_conv (ck_base
, to
, conv
);
1431 /* The derived-to-base conversion indicates the initialization
1432 of a parameter with base type from an object of a derived
1433 type. A temporary object is created to hold the result of
1434 the conversion unless we're binding directly to a reference. */
1435 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1436 if (flags
& LOOKUP_PREFER_RVALUE
)
1437 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1438 conv
->rvaluedness_matches_p
= true;
1443 if (flags
& LOOKUP_NO_NARROWING
)
1444 conv
->check_narrowing
= true;
1449 /* Returns nonzero if T1 is reference-related to T2. */
1452 reference_related_p (tree t1
, tree t2
)
1454 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1457 t1
= TYPE_MAIN_VARIANT (t1
);
1458 t2
= TYPE_MAIN_VARIANT (t2
);
1462 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1463 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1465 return (same_type_p (t1
, t2
)
1466 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1467 && DERIVED_FROM_P (t1
, t2
)));
1470 /* Returns nonzero if T1 is reference-compatible with T2. */
1473 reference_compatible_p (tree t1
, tree t2
)
1477 "cv1 T1" is reference compatible with "cv2 T2" if
1478 * T1 is reference-related to T2 or
1479 * T2 is "noexcept function" and T1 is "function", where the
1480 function types are otherwise the same,
1481 and cv1 is the same cv-qualification as, or greater cv-qualification
1483 return ((reference_related_p (t1
, t2
)
1484 || fnptr_conv_p (t1
, t2
))
1485 && at_least_as_qualified_p (t1
, t2
));
1488 /* A reference of the indicated TYPE is being bound directly to the
1489 expression represented by the implicit conversion sequence CONV.
1490 Return a conversion sequence for this binding. */
1493 direct_reference_binding (tree type
, conversion
*conv
)
1497 gcc_assert (TYPE_REF_P (type
));
1498 gcc_assert (!TYPE_REF_P (conv
->type
));
1500 t
= TREE_TYPE (type
);
1502 if (conv
->kind
== ck_identity
)
1503 /* Mark the identity conv as to not decay to rvalue. */
1504 conv
->rvaluedness_matches_p
= true;
1508 When a parameter of reference type binds directly
1509 (_dcl.init.ref_) to an argument expression, the implicit
1510 conversion sequence is the identity conversion, unless the
1511 argument expression has a type that is a derived class of the
1512 parameter type, in which case the implicit conversion sequence is
1513 a derived-to-base Conversion.
1515 If the parameter binds directly to the result of applying a
1516 conversion function to the argument expression, the implicit
1517 conversion sequence is a user-defined conversion sequence
1518 (_over.ics.user_), with the second standard conversion sequence
1519 either an identity conversion or, if the conversion function
1520 returns an entity of a type that is a derived class of the
1521 parameter type, a derived-to-base conversion. */
1522 if (is_properly_derived_from (conv
->type
, t
))
1524 /* Represent the derived-to-base conversion. */
1525 conv
= build_conv (ck_base
, t
, conv
);
1526 /* We will actually be binding to the base-class subobject in
1527 the derived class, so we mark this conversion appropriately.
1528 That way, convert_like knows not to generate a temporary. */
1529 conv
->need_temporary_p
= false;
1532 return build_conv (ck_ref_bind
, type
, conv
);
1535 /* Returns the conversion path from type FROM to reference type TO for
1536 purposes of reference binding. For lvalue binding, either pass a
1537 reference type to FROM or an lvalue expression to EXPR. If the
1538 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1539 the conversion returned. If C_CAST_P is true, this
1540 conversion is coming from a C-style cast. */
1543 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1544 tsubst_flags_t complain
)
1546 conversion
*conv
= NULL
;
1547 tree to
= TREE_TYPE (rto
);
1552 cp_lvalue_kind gl_kind
;
1555 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1557 expr
= instantiate_type (to
, expr
, tf_none
);
1558 if (expr
== error_mark_node
)
1560 from
= TREE_TYPE (expr
);
1563 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1565 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1566 /* DR 1288: Otherwise, if the initializer list has a single element
1567 of type E and ... [T's] referenced type is reference-related to E,
1568 the object or reference is initialized from that element... */
1569 if (CONSTRUCTOR_NELTS (expr
) == 1)
1571 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1572 if (error_operand_p (elt
))
1574 tree etype
= TREE_TYPE (elt
);
1575 if (reference_related_p (to
, etype
))
1582 /* Otherwise, if T is a reference type, a prvalue temporary of the type
1583 referenced by T is copy-list-initialized, and the reference is bound
1584 to that temporary. */
1585 CONSTRUCTOR_IS_DIRECT_INIT (expr
) = false;
1589 if (TYPE_REF_P (from
))
1591 from
= TREE_TYPE (from
);
1592 if (!TYPE_REF_IS_RVALUE (rfrom
)
1593 || TREE_CODE (from
) == FUNCTION_TYPE
)
1594 gl_kind
= clk_ordinary
;
1596 gl_kind
= clk_rvalueref
;
1599 gl_kind
= lvalue_kind (expr
);
1600 else if (CLASS_TYPE_P (from
)
1601 || TREE_CODE (from
) == ARRAY_TYPE
)
1602 gl_kind
= clk_class
;
1606 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1607 if ((flags
& LOOKUP_NO_TEMP_BIND
)
1608 && (gl_kind
& clk_class
))
1611 /* Same mask as real_lvalue_p. */
1612 is_lvalue
= gl_kind
&& !(gl_kind
& (clk_rvalueref
|clk_class
));
1615 if ((gl_kind
& clk_bitfield
) != 0)
1616 tfrom
= unlowered_expr_type (expr
);
1618 /* Figure out whether or not the types are reference-related and
1619 reference compatible. We have to do this after stripping
1620 references from FROM. */
1621 related_p
= reference_related_p (to
, tfrom
);
1622 /* If this is a C cast, first convert to an appropriately qualified
1623 type, so that we can later do a const_cast to the desired type. */
1624 if (related_p
&& c_cast_p
1625 && !at_least_as_qualified_p (to
, tfrom
))
1626 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1627 compatible_p
= reference_compatible_p (to
, tfrom
);
1629 /* Directly bind reference when target expression's type is compatible with
1630 the reference and expression is an lvalue. In DR391, the wording in
1631 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1632 const and rvalue references to rvalues of compatible class type.
1633 We should also do direct bindings for non-class xvalues. */
1634 if ((related_p
|| compatible_p
) && gl_kind
)
1638 If the initializer expression
1640 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1641 is reference-compatible with "cv2 T2,"
1643 the reference is bound directly to the initializer expression
1647 If the initializer expression is an rvalue, with T2 a class type,
1648 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1649 is bound to the object represented by the rvalue or to a sub-object
1650 within that object. */
1652 conv
= build_identity_conv (tfrom
, expr
);
1653 conv
= direct_reference_binding (rto
, conv
);
1655 if (TYPE_REF_P (rfrom
))
1656 /* Handle rvalue reference to function properly. */
1657 conv
->rvaluedness_matches_p
1658 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1660 conv
->rvaluedness_matches_p
1661 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1663 if ((gl_kind
& clk_bitfield
) != 0
1664 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1665 /* For the purposes of overload resolution, we ignore the fact
1666 this expression is a bitfield or packed field. (In particular,
1667 [over.ics.ref] says specifically that a function with a
1668 non-const reference parameter is viable even if the
1669 argument is a bitfield.)
1671 However, when we actually call the function we must create
1672 a temporary to which to bind the reference. If the
1673 reference is volatile, or isn't const, then we cannot make
1674 a temporary, so we just issue an error when the conversion
1676 conv
->need_temporary_p
= true;
1678 /* Don't allow binding of lvalues (other than function lvalues) to
1679 rvalue references. */
1680 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1681 && TREE_CODE (to
) != FUNCTION_TYPE
)
1684 /* Nor the reverse. */
1685 if (!is_lvalue
&& !TYPE_REF_IS_RVALUE (rto
)
1686 && (!CP_TYPE_CONST_NON_VOLATILE_P (to
)
1687 || (flags
& LOOKUP_NO_RVAL_BIND
))
1688 && TREE_CODE (to
) != FUNCTION_TYPE
)
1696 /* [class.conv.fct] A conversion function is never used to convert a
1697 (possibly cv-qualified) object to the (possibly cv-qualified) same
1698 object type (or a reference to it), to a (possibly cv-qualified) base
1699 class of that type (or a reference to it).... */
1700 else if (CLASS_TYPE_P (from
) && !related_p
1701 && !(flags
& LOOKUP_NO_CONVERSION
))
1705 If the initializer expression
1707 -- has a class type (i.e., T2 is a class type) can be
1708 implicitly converted to an lvalue of type "cv3 T3," where
1709 "cv1 T1" is reference-compatible with "cv3 T3". (this
1710 conversion is selected by enumerating the applicable
1711 conversion functions (_over.match.ref_) and choosing the
1712 best one through overload resolution. (_over.match_).
1714 the reference is bound to the lvalue result of the conversion
1715 in the second case. */
1716 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1719 return cand
->second_conv
;
1722 /* From this point on, we conceptually need temporaries, even if we
1723 elide them. Only the cases above are "direct bindings". */
1724 if (flags
& LOOKUP_NO_TEMP_BIND
)
1729 When a parameter of reference type is not bound directly to an
1730 argument expression, the conversion sequence is the one required
1731 to convert the argument expression to the underlying type of the
1732 reference according to _over.best.ics_. Conceptually, this
1733 conversion sequence corresponds to copy-initializing a temporary
1734 of the underlying type with the argument expression. Any
1735 difference in top-level cv-qualification is subsumed by the
1736 initialization itself and does not constitute a conversion. */
1740 Otherwise, the reference shall be an lvalue reference to a
1741 non-volatile const type, or the reference shall be an rvalue
1744 We try below to treat this as a bad conversion to improve diagnostics,
1745 but if TO is an incomplete class, we need to reject this conversion
1746 now to avoid unnecessary instantiation. */
1747 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
)
1748 && !COMPLETE_TYPE_P (to
))
1751 /* We're generating a temporary now, but don't bind any more in the
1752 conversion (specifically, don't slice the temporary returned by a
1753 conversion operator). */
1754 flags
|= LOOKUP_NO_TEMP_BIND
;
1756 /* Core issue 899: When [copy-]initializing a temporary to be bound
1757 to the first parameter of a copy constructor (12.8) called with
1758 a single argument in the context of direct-initialization,
1759 explicit conversion functions are also considered.
1761 So don't set LOOKUP_ONLYCONVERTING in that case. */
1762 if (!(flags
& LOOKUP_COPY_PARM
))
1763 flags
|= LOOKUP_ONLYCONVERTING
;
1766 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1771 if (conv
->user_conv_p
)
1773 /* If initializing the temporary used a conversion function,
1774 recalculate the second conversion sequence. */
1775 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1776 if (t
->kind
== ck_user
1777 && DECL_CONV_FN_P (t
->cand
->fn
))
1779 tree ftype
= TREE_TYPE (TREE_TYPE (t
->cand
->fn
));
1780 int sflags
= (flags
|LOOKUP_NO_CONVERSION
)&~LOOKUP_NO_TEMP_BIND
;
1781 conversion
*new_second
1782 = reference_binding (rto
, ftype
, NULL_TREE
, c_cast_p
,
1786 return merge_conversion_sequences (t
, new_second
);
1790 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1791 /* This reference binding, unlike those above, requires the
1792 creation of a temporary. */
1793 conv
->need_temporary_p
= true;
1794 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1798 Otherwise, the reference shall be an lvalue reference to a
1799 non-volatile const type, or the reference shall be an rvalue
1801 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1806 Otherwise, a temporary of type "cv1 T1" is created and
1807 initialized from the initializer expression using the rules for a
1808 non-reference copy initialization. If T1 is reference-related to
1809 T2, cv1 must be the same cv-qualification as, or greater
1810 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1811 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1817 /* Returns the implicit conversion sequence (see [over.ics]) from type
1818 FROM to type TO. The optional expression EXPR may affect the
1819 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1820 true, this conversion is coming from a C-style cast. */
1823 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1824 int flags
, tsubst_flags_t complain
)
1828 if (from
== error_mark_node
|| to
== error_mark_node
1829 || expr
== error_mark_node
)
1832 /* Other flags only apply to the primary function in overload
1833 resolution, or after we've chosen one. */
1834 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1835 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1836 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1838 /* FIXME: actually we don't want warnings either, but we can't just
1839 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1840 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1841 We really ought not to issue that warning until we've committed
1842 to that conversion. */
1843 complain
&= ~tf_error
;
1845 /* Call reshape_init early to remove redundant braces. */
1846 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
)
1847 && CLASS_TYPE_P (to
)
1848 && COMPLETE_TYPE_P (complete_type (to
))
1849 && !CLASSTYPE_NON_AGGREGATE (to
))
1851 expr
= reshape_init (to
, expr
, complain
);
1852 if (expr
== error_mark_node
)
1854 from
= TREE_TYPE (expr
);
1857 if (TYPE_REF_P (to
))
1858 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1860 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
, complain
);
1865 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1867 if (is_std_init_list (to
))
1868 return build_list_conv (to
, expr
, flags
, complain
);
1870 /* As an extension, allow list-initialization of _Complex. */
1871 if (TREE_CODE (to
) == COMPLEX_TYPE
)
1873 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1878 /* Allow conversion from an initializer-list with one element to a
1880 if (SCALAR_TYPE_P (to
))
1882 int nelts
= CONSTRUCTOR_NELTS (expr
);
1886 elt
= build_value_init (to
, tf_none
);
1887 else if (nelts
== 1)
1888 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1890 elt
= error_mark_node
;
1892 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1893 c_cast_p
, flags
, complain
);
1896 conv
->check_narrowing
= true;
1897 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1898 /* Too many levels of braces, i.e. '{{1}}'. */
1903 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1904 return build_array_conv (to
, expr
, flags
, complain
);
1907 if (expr
!= NULL_TREE
1908 && (MAYBE_CLASS_TYPE_P (from
)
1909 || MAYBE_CLASS_TYPE_P (to
))
1910 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1912 struct z_candidate
*cand
;
1914 if (CLASS_TYPE_P (to
)
1915 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
1916 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
1917 return build_aggr_conv (to
, expr
, flags
, complain
);
1919 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
1922 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
1923 && CONSTRUCTOR_NELTS (expr
) == 1
1924 && !is_list_ctor (cand
->fn
))
1926 /* "If C is not an initializer-list constructor and the
1927 initializer list has a single element of type cv U, where U is
1928 X or a class derived from X, the implicit conversion sequence
1929 has Exact Match rank if U is X, or Conversion rank if U is
1931 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1932 tree elttype
= TREE_TYPE (elt
);
1933 if (reference_related_p (to
, elttype
))
1934 return implicit_conversion (to
, elttype
, elt
,
1935 c_cast_p
, flags
, complain
);
1937 conv
= cand
->second_conv
;
1940 /* We used to try to bind a reference to a temporary here, but that
1941 is now handled after the recursive call to this function at the end
1942 of reference_binding. */
1949 /* Like implicit_conversion, but return NULL if the conversion is bad.
1951 This is not static so that check_non_deducible_conversion can call it within
1952 add_template_candidate_real as part of overload resolution; it should not be
1953 called outside of overload resolution. */
1956 good_conversion (tree to
, tree from
, tree expr
,
1957 int flags
, tsubst_flags_t complain
)
1959 conversion
*c
= implicit_conversion (to
, from
, expr
, /*cast*/false,
1966 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1967 functions. ARGS will not be changed until a single candidate is
1970 static struct z_candidate
*
1971 add_candidate (struct z_candidate
**candidates
,
1972 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
1973 size_t num_convs
, conversion
**convs
,
1974 tree access_path
, tree conversion_path
,
1975 int viable
, struct rejection_reason
*reason
,
1978 struct z_candidate
*cand
= (struct z_candidate
*)
1979 conversion_obstack_alloc (sizeof (struct z_candidate
));
1982 cand
->first_arg
= first_arg
;
1984 cand
->convs
= convs
;
1985 cand
->num_convs
= num_convs
;
1986 cand
->access_path
= access_path
;
1987 cand
->conversion_path
= conversion_path
;
1988 cand
->viable
= viable
;
1989 cand
->reason
= reason
;
1990 cand
->next
= *candidates
;
1991 cand
->flags
= flags
;
1997 /* Return the number of remaining arguments in the parameter list
1998 beginning with ARG. */
2001 remaining_arguments (tree arg
)
2005 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
2006 arg
= TREE_CHAIN (arg
))
2012 /* [over.match.copy]: When initializing a temporary object (12.2) to be bound
2013 to the first parameter of a constructor where the parameter is of type
2014 "reference to possibly cv-qualified T" and the constructor is called with a
2015 single argument in the context of direct-initialization of an object of type
2016 "cv2 T", explicit conversion functions are also considered.
2018 So set LOOKUP_COPY_PARM to let reference_binding know that
2019 it's being called in that context. */
2022 conv_flags (int i
, int nargs
, tree fn
, tree arg
, int flags
)
2026 if (i
== 0 && nargs
== 1 && DECL_CONSTRUCTOR_P (fn
)
2027 && (t
= FUNCTION_FIRST_USER_PARMTYPE (fn
))
2028 && (same_type_ignoring_top_level_qualifiers_p
2029 (non_reference (TREE_VALUE (t
)), DECL_CONTEXT (fn
))))
2031 if (!(flags
& LOOKUP_ONLYCONVERTING
))
2032 lflags
|= LOOKUP_COPY_PARM
;
2033 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
2034 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
2035 lflags
|= LOOKUP_NO_CONVERSION
;
2038 lflags
|= LOOKUP_ONLYCONVERTING
;
2043 /* Create an overload candidate for the function or method FN called
2044 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
2045 FLAGS is passed on to implicit_conversion.
2047 This does not change ARGS.
2049 CTYPE, if non-NULL, is the type we want to pretend this function
2050 comes from for purposes of overload resolution. */
2052 static struct z_candidate
*
2053 add_function_candidate (struct z_candidate
**candidates
,
2054 tree fn
, tree ctype
, tree first_arg
,
2055 const vec
<tree
, va_gc
> *args
, tree access_path
,
2056 tree conversion_path
, int flags
,
2058 tsubst_flags_t complain
)
2060 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2063 tree orig_first_arg
= first_arg
;
2066 struct rejection_reason
*reason
= NULL
;
2068 /* At this point we should not see any functions which haven't been
2069 explicitly declared, except for friend functions which will have
2070 been found using argument dependent lookup. */
2071 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
2073 /* The `this', `in_chrg' and VTT arguments to constructors are not
2074 considered in overload resolution. */
2075 if (DECL_CONSTRUCTOR_P (fn
))
2077 if (ctor_omit_inherited_parms (fn
))
2078 /* Bring back parameters omitted from an inherited ctor. */
2079 parmlist
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn
));
2081 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
2082 skip
= num_artificial_parms_for (fn
);
2083 if (skip
> 0 && first_arg
!= NULL_TREE
)
2086 first_arg
= NULL_TREE
;
2092 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
2094 convs
= alloc_conversions (len
);
2096 /* 13.3.2 - Viable functions [over.match.viable]
2097 First, to be a viable function, a candidate function shall have enough
2098 parameters to agree in number with the arguments in the list.
2100 We need to check this first; otherwise, checking the ICSes might cause
2101 us to produce an ill-formed template instantiation. */
2103 parmnode
= parmlist
;
2104 for (i
= 0; i
< len
; ++i
)
2106 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
2108 parmnode
= TREE_CHAIN (parmnode
);
2111 if ((i
< len
&& parmnode
)
2112 || !sufficient_parms_p (parmnode
))
2114 int remaining
= remaining_arguments (parmnode
);
2116 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
2119 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2120 parameter of type "reference to cv C" (including such a constructor
2121 instantiated from a template) is excluded from the set of candidate
2122 functions when used to construct an object of type D with an argument list
2123 containing a single argument if C is reference-related to D. */
2124 if (viable
&& len
== 1 && parmlist
&& DECL_CONSTRUCTOR_P (fn
)
2125 && flag_new_inheriting_ctors
2126 && DECL_INHERITED_CTOR (fn
))
2128 tree ptype
= non_reference (TREE_VALUE (parmlist
));
2129 tree dtype
= DECL_CONTEXT (fn
);
2130 tree btype
= DECL_INHERITED_CTOR_BASE (fn
);
2131 if (reference_related_p (ptype
, dtype
)
2132 && reference_related_p (btype
, ptype
))
2135 reason
= inherited_ctor_rejection ();
2139 /* Second, for a function to be viable, its constraints must be
2141 if (flag_concepts
&& viable
2142 && !constraints_satisfied_p (fn
))
2144 reason
= constraint_failure (fn
);
2148 /* When looking for a function from a subobject from an implicit
2149 copy/move constructor/operator=, don't consider anything that takes (a
2150 reference to) an unrelated type. See c++/44909 and core 1092. */
2151 if (viable
&& parmlist
&& (flags
& LOOKUP_DEFAULTED
))
2153 if (DECL_CONSTRUCTOR_P (fn
))
2155 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
2156 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
))
2162 parmnode
= chain_index (i
-1, parmlist
);
2163 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
2168 /* This only applies at the top level. */
2169 flags
&= ~LOOKUP_DEFAULTED
;
2175 /* Third, for F to be a viable function, there shall exist for each
2176 argument an implicit conversion sequence that converts that argument
2177 to the corresponding parameter of F. */
2179 parmnode
= parmlist
;
2181 for (i
= 0; i
< len
; ++i
)
2183 tree argtype
, to_type
;
2188 if (parmnode
== void_list_node
)
2193 /* Already set during deduction. */
2194 parmnode
= TREE_CHAIN (parmnode
);
2198 if (i
== 0 && first_arg
!= NULL_TREE
)
2201 arg
= CONST_CAST_TREE (
2202 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
2203 argtype
= lvalue_type (arg
);
2205 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2206 && ! DECL_CONSTRUCTOR_P (fn
));
2210 tree parmtype
= TREE_VALUE (parmnode
);
2212 parmnode
= TREE_CHAIN (parmnode
);
2214 /* The type of the implicit object parameter ('this') for
2215 overload resolution is not always the same as for the
2216 function itself; conversion functions are considered to
2217 be members of the class being converted, and functions
2218 introduced by a using-declaration are considered to be
2219 members of the class that uses them.
2221 Since build_over_call ignores the ICS for the `this'
2222 parameter, we can just change the parm type. */
2223 if (ctype
&& is_this
)
2225 parmtype
= cp_build_qualified_type
2226 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
2227 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
2229 /* If the function has a ref-qualifier, the implicit
2230 object parameter has reference type. */
2231 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
2232 parmtype
= cp_build_reference_type (parmtype
, rv
);
2233 /* The special handling of 'this' conversions in compare_ics
2234 does not apply if there is a ref-qualifier. */
2239 parmtype
= build_pointer_type (parmtype
);
2240 /* We don't use build_this here because we don't want to
2241 capture the object argument until we've chosen a
2242 non-static member function. */
2243 arg
= build_address (arg
);
2244 argtype
= lvalue_type (arg
);
2248 int lflags
= conv_flags (i
, len
-skip
, fn
, arg
, flags
);
2250 t
= implicit_conversion (parmtype
, argtype
, arg
,
2251 /*c_cast_p=*/false, lflags
, complain
);
2256 t
= build_identity_conv (argtype
, arg
);
2257 t
->ellipsis_p
= true;
2268 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
,
2269 EXPR_LOCATION (arg
));
2276 reason
= bad_arg_conversion_rejection (first_arg
, i
, arg
, to_type
,
2277 EXPR_LOCATION (arg
));
2283 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2284 access_path
, conversion_path
, viable
, reason
, flags
);
2287 /* Create an overload candidate for the conversion function FN which will
2288 be invoked for expression OBJ, producing a pointer-to-function which
2289 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2290 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2291 passed on to implicit_conversion.
2293 Actually, we don't really care about FN; we care about the type it
2294 converts to. There may be multiple conversion functions that will
2295 convert to that type, and we rely on build_user_type_conversion_1 to
2296 choose the best one; so when we create our candidate, we record the type
2297 instead of the function. */
2299 static struct z_candidate
*
2300 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2301 const vec
<tree
, va_gc
> *arglist
,
2302 tree access_path
, tree conversion_path
,
2303 tsubst_flags_t complain
)
2305 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2306 int i
, len
, viable
, flags
;
2307 tree parmlist
, parmnode
;
2309 struct rejection_reason
*reason
;
2311 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2312 parmlist
= TREE_TYPE (parmlist
);
2313 parmlist
= TYPE_ARG_TYPES (parmlist
);
2315 len
= vec_safe_length (arglist
) + 1;
2316 convs
= alloc_conversions (len
);
2317 parmnode
= parmlist
;
2319 flags
= LOOKUP_IMPLICIT
;
2322 /* Don't bother looking up the same type twice. */
2323 if (*candidates
&& (*candidates
)->fn
== totype
)
2326 for (i
= 0; i
< len
; ++i
)
2328 tree arg
, argtype
, convert_type
= NULL_TREE
;
2334 arg
= (*arglist
)[i
- 1];
2335 argtype
= lvalue_type (arg
);
2339 t
= build_identity_conv (argtype
, NULL_TREE
);
2340 t
= build_conv (ck_user
, totype
, t
);
2341 /* Leave the 'cand' field null; we'll figure out the conversion in
2342 convert_like_real if this candidate is chosen. */
2343 convert_type
= totype
;
2345 else if (parmnode
== void_list_node
)
2349 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2350 /*c_cast_p=*/false, flags
, complain
);
2351 convert_type
= TREE_VALUE (parmnode
);
2355 t
= build_identity_conv (argtype
, arg
);
2356 t
->ellipsis_p
= true;
2357 convert_type
= argtype
;
2367 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, arg
, convert_type
,
2368 EXPR_LOCATION (arg
));
2375 parmnode
= TREE_CHAIN (parmnode
);
2379 || ! sufficient_parms_p (parmnode
))
2381 int remaining
= remaining_arguments (parmnode
);
2383 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2386 return add_candidate (candidates
, totype
, obj
, arglist
, len
, convs
,
2387 access_path
, conversion_path
, viable
, reason
, flags
);
2391 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2392 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2393 int flags
, tsubst_flags_t complain
)
2400 struct rejection_reason
*reason
= NULL
;
2405 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2406 convs
= alloc_conversions (num_convs
);
2408 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2409 conversion ops are allowed. We handle that here by just checking for
2410 boolean_type_node because other operators don't ask for it. COND_EXPR
2411 also does contextual conversion to bool for the first operand, but we
2412 handle that in build_conditional_expr, and type1 here is operand 2. */
2413 if (type1
!= boolean_type_node
)
2414 flags
|= LOOKUP_ONLYCONVERTING
;
2416 for (i
= 0; i
< 2; ++i
)
2421 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2422 /*c_cast_p=*/false, flags
, complain
);
2426 /* We need something for printing the candidate. */
2427 t
= build_identity_conv (types
[i
], NULL_TREE
);
2428 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2429 types
[i
], EXPR_LOCATION (args
[i
]));
2434 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, args
[i
],
2436 EXPR_LOCATION (args
[i
]));
2441 /* For COND_EXPR we rearranged the arguments; undo that now. */
2444 convs
[2] = convs
[1];
2445 convs
[1] = convs
[0];
2446 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2447 /*c_cast_p=*/false, flags
,
2454 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2456 EXPR_LOCATION (args
[2]));
2460 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2462 /*access_path=*/NULL_TREE
,
2463 /*conversion_path=*/NULL_TREE
,
2464 viable
, reason
, flags
);
2468 is_complete (tree t
)
2470 return COMPLETE_TYPE_P (complete_type (t
));
2473 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2476 promoted_arithmetic_type_p (tree type
)
2480 In this section, the term promoted integral type is used to refer
2481 to those integral types which are preserved by integral promotion
2482 (including e.g. int and long but excluding e.g. char).
2483 Similarly, the term promoted arithmetic type refers to promoted
2484 integral types plus floating types. */
2485 return ((CP_INTEGRAL_TYPE_P (type
)
2486 && same_type_p (type_promotes_to (type
), type
))
2487 || TREE_CODE (type
) == REAL_TYPE
);
2490 /* Create any builtin operator overload candidates for the operator in
2491 question given the converted operand types TYPE1 and TYPE2. The other
2492 args are passed through from add_builtin_candidates to
2493 build_builtin_candidate.
2495 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2496 If CODE is requires candidates operands of the same type of the kind
2497 of which TYPE1 and TYPE2 are, we add both candidates
2498 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2501 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2502 enum tree_code code2
, tree fnname
, tree type1
,
2503 tree type2
, tree
*args
, tree
*argtypes
, int flags
,
2504 tsubst_flags_t complain
)
2508 case POSTINCREMENT_EXPR
:
2509 case POSTDECREMENT_EXPR
:
2510 args
[1] = integer_zero_node
;
2511 type2
= integer_type_node
;
2520 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2521 and VQ is either volatile or empty, there exist candidate operator
2522 functions of the form
2523 VQ T& operator++(VQ T&);
2524 T operator++(VQ T&, int);
2525 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2526 type other than bool, and VQ is either volatile or empty, there exist
2527 candidate operator functions of the form
2528 VQ T& operator--(VQ T&);
2529 T operator--(VQ T&, int);
2530 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2531 complete object type, and VQ is either volatile or empty, there exist
2532 candidate operator functions of the form
2533 T*VQ& operator++(T*VQ&);
2534 T*VQ& operator--(T*VQ&);
2535 T* operator++(T*VQ&, int);
2536 T* operator--(T*VQ&, int); */
2538 case POSTDECREMENT_EXPR
:
2539 case PREDECREMENT_EXPR
:
2540 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2543 case POSTINCREMENT_EXPR
:
2544 case PREINCREMENT_EXPR
:
2545 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2547 type1
= build_reference_type (type1
);
2552 /* 7 For every cv-qualified or cv-unqualified object type T, there
2553 exist candidate operator functions of the form
2557 8 For every function type T, there exist candidate operator functions of
2559 T& operator*(T*); */
2562 if (TYPE_PTR_P (type1
)
2563 && (TYPE_PTROB_P (type1
)
2564 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2568 /* 9 For every type T, there exist candidate operator functions of the form
2571 10For every promoted arithmetic type T, there exist candidate operator
2572 functions of the form
2576 case UNARY_PLUS_EXPR
: /* unary + */
2577 if (TYPE_PTR_P (type1
))
2581 if (ARITHMETIC_TYPE_P (type1
))
2585 /* 11For every promoted integral type T, there exist candidate operator
2586 functions of the form
2590 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2594 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2595 is the same type as C2 or is a derived class of C2, T is a complete
2596 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2597 there exist candidate operator functions of the form
2598 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2599 where CV12 is the union of CV1 and CV2. */
2602 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2604 tree c1
= TREE_TYPE (type1
);
2605 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2607 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2608 && (TYPE_PTRMEMFUNC_P (type2
)
2609 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2614 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2615 didate operator functions of the form
2620 bool operator<(L, R);
2621 bool operator>(L, R);
2622 bool operator<=(L, R);
2623 bool operator>=(L, R);
2624 bool operator==(L, R);
2625 bool operator!=(L, R);
2626 where LR is the result of the usual arithmetic conversions between
2629 14For every pair of types T and I, where T is a cv-qualified or cv-
2630 unqualified complete object type and I is a promoted integral type,
2631 there exist candidate operator functions of the form
2632 T* operator+(T*, I);
2633 T& operator[](T*, I);
2634 T* operator-(T*, I);
2635 T* operator+(I, T*);
2636 T& operator[](I, T*);
2638 15For every T, where T is a pointer to complete object type, there exist
2639 candidate operator functions of the form112)
2640 ptrdiff_t operator-(T, T);
2642 16For every pointer or enumeration type T, there exist candidate operator
2643 functions of the form
2644 bool operator<(T, T);
2645 bool operator>(T, T);
2646 bool operator<=(T, T);
2647 bool operator>=(T, T);
2648 bool operator==(T, T);
2649 bool operator!=(T, T);
2651 17For every pointer to member type T, there exist candidate operator
2652 functions of the form
2653 bool operator==(T, T);
2654 bool operator!=(T, T); */
2657 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2659 if (TYPE_PTROB_P (type1
)
2660 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2662 type2
= ptrdiff_type_node
;
2667 case TRUNC_DIV_EXPR
:
2668 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2674 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2675 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2677 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2682 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2694 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2696 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2698 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2699 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2701 if (TYPE_PTR_P (type1
)
2702 && null_ptr_cst_p (args
[1]))
2707 if (null_ptr_cst_p (args
[0])
2708 && TYPE_PTR_P (type2
))
2716 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2720 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2722 type1
= ptrdiff_type_node
;
2725 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2727 type2
= ptrdiff_type_node
;
2732 /* 18For every pair of promoted integral types L and R, there exist candi-
2733 date operator functions of the form
2740 where LR is the result of the usual arithmetic conversions between
2743 case TRUNC_MOD_EXPR
:
2749 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2753 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2754 type, VQ is either volatile or empty, and R is a promoted arithmetic
2755 type, there exist candidate operator functions of the form
2756 VQ L& operator=(VQ L&, R);
2757 VQ L& operator*=(VQ L&, R);
2758 VQ L& operator/=(VQ L&, R);
2759 VQ L& operator+=(VQ L&, R);
2760 VQ L& operator-=(VQ L&, R);
2762 20For every pair T, VQ), where T is any type and VQ is either volatile
2763 or empty, there exist candidate operator functions of the form
2764 T*VQ& operator=(T*VQ&, T*);
2766 21For every pair T, VQ), where T is a pointer to member type and VQ is
2767 either volatile or empty, there exist candidate operator functions of
2769 VQ T& operator=(VQ T&, T);
2771 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2772 unqualified complete object type, VQ is either volatile or empty, and
2773 I is a promoted integral type, there exist candidate operator func-
2775 T*VQ& operator+=(T*VQ&, I);
2776 T*VQ& operator-=(T*VQ&, I);
2778 23For every triple L, VQ, R), where L is an integral or enumeration
2779 type, VQ is either volatile or empty, and R is a promoted integral
2780 type, there exist candidate operator functions of the form
2782 VQ L& operator%=(VQ L&, R);
2783 VQ L& operator<<=(VQ L&, R);
2784 VQ L& operator>>=(VQ L&, R);
2785 VQ L& operator&=(VQ L&, R);
2786 VQ L& operator^=(VQ L&, R);
2787 VQ L& operator|=(VQ L&, R); */
2794 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2796 type2
= ptrdiff_type_node
;
2801 case TRUNC_DIV_EXPR
:
2802 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2806 case TRUNC_MOD_EXPR
:
2812 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2817 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2819 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2820 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2821 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2822 || ((TYPE_PTRMEMFUNC_P (type1
)
2823 || TYPE_PTR_P (type1
))
2824 && null_ptr_cst_p (args
[1])))
2834 type1
= build_reference_type (type1
);
2840 For every pair of promoted arithmetic types L and R, there
2841 exist candidate operator functions of the form
2843 LR operator?(bool, L, R);
2845 where LR is the result of the usual arithmetic conversions
2846 between types L and R.
2848 For every type T, where T is a pointer or pointer-to-member
2849 type, there exist candidate operator functions of the form T
2850 operator?(bool, T, T); */
2852 if (promoted_arithmetic_type_p (type1
)
2853 && promoted_arithmetic_type_p (type2
))
2857 /* Otherwise, the types should be pointers. */
2858 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2861 /* We don't check that the two types are the same; the logic
2862 below will actually create two candidates; one in which both
2863 parameter types are TYPE1, and one in which both parameter
2869 if (ARITHMETIC_TYPE_P (type1
))
2877 /* Make sure we don't create builtin candidates with dependent types. */
2878 bool u1
= uses_template_parms (type1
);
2879 bool u2
= type2
? uses_template_parms (type2
) : false;
2882 /* Try to recover if one of the types is non-dependent. But if
2883 there's only one type, there's nothing we can do. */
2886 /* And we lose if both are dependent. */
2889 /* Or if they have different forms. */
2890 if (TREE_CODE (type1
) != TREE_CODE (type2
))
2899 /* If we're dealing with two pointer types or two enumeral types,
2900 we need candidates for both of them. */
2901 if (type2
&& !same_type_p (type1
, type2
)
2902 && TREE_CODE (type1
) == TREE_CODE (type2
)
2903 && (TYPE_REF_P (type1
)
2904 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2905 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2906 || TYPE_PTRMEMFUNC_P (type1
)
2907 || MAYBE_CLASS_TYPE_P (type1
)
2908 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2910 if (TYPE_PTR_OR_PTRMEM_P (type1
))
2912 tree cptype
= composite_pointer_type (type1
, type2
,
2917 if (cptype
!= error_mark_node
)
2919 build_builtin_candidate
2920 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
2926 build_builtin_candidate
2927 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
2928 build_builtin_candidate
2929 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
2933 build_builtin_candidate
2934 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
2938 type_decays_to (tree type
)
2940 if (TREE_CODE (type
) == ARRAY_TYPE
)
2941 return build_pointer_type (TREE_TYPE (type
));
2942 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2943 return build_pointer_type (type
);
2947 /* There are three conditions of builtin candidates:
2949 1) bool-taking candidates. These are the same regardless of the input.
2950 2) pointer-pair taking candidates. These are generated for each type
2951 one of the input types converts to.
2952 3) arithmetic candidates. According to the standard, we should generate
2953 all of these, but I'm trying not to...
2955 Here we generate a superset of the possible candidates for this particular
2956 case. That is a subset of the full set the standard defines, plus some
2957 other cases which the standard disallows. add_builtin_candidate will
2958 filter out the invalid set. */
2961 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2962 enum tree_code code2
, tree fnname
, tree
*args
,
2963 int flags
, tsubst_flags_t complain
)
2967 tree type
, argtypes
[3], t
;
2968 /* TYPES[i] is the set of possible builtin-operator parameter types
2969 we will consider for the Ith argument. */
2970 vec
<tree
, va_gc
> *types
[2];
2973 for (i
= 0; i
< 3; ++i
)
2976 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2978 argtypes
[i
] = NULL_TREE
;
2983 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2984 and VQ is either volatile or empty, there exist candidate operator
2985 functions of the form
2986 VQ T& operator++(VQ T&); */
2988 case POSTINCREMENT_EXPR
:
2989 case PREINCREMENT_EXPR
:
2990 case POSTDECREMENT_EXPR
:
2991 case PREDECREMENT_EXPR
:
2996 /* 24There also exist candidate operator functions of the form
2997 bool operator!(bool);
2998 bool operator&&(bool, bool);
2999 bool operator||(bool, bool); */
3001 case TRUTH_NOT_EXPR
:
3002 build_builtin_candidate
3003 (candidates
, fnname
, boolean_type_node
,
3004 NULL_TREE
, args
, argtypes
, flags
, complain
);
3007 case TRUTH_ORIF_EXPR
:
3008 case TRUTH_ANDIF_EXPR
:
3009 build_builtin_candidate
3010 (candidates
, fnname
, boolean_type_node
,
3011 boolean_type_node
, args
, argtypes
, flags
, complain
);
3033 types
[0] = make_tree_vector ();
3034 types
[1] = make_tree_vector ();
3036 for (i
= 0; i
< 2; ++i
)
3040 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
3044 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
3047 convs
= lookup_conversions (argtypes
[i
]);
3049 if (code
== COND_EXPR
)
3051 if (lvalue_p (args
[i
]))
3052 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3054 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
3060 for (; convs
; convs
= TREE_CHAIN (convs
))
3062 type
= TREE_TYPE (convs
);
3065 && (!TYPE_REF_P (type
)
3066 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
3069 if (code
== COND_EXPR
&& TYPE_REF_P (type
))
3070 vec_safe_push (types
[i
], type
);
3072 type
= non_reference (type
);
3073 if (i
!= 0 || ! ref1
)
3075 type
= cv_unqualified (type_decays_to (type
));
3076 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
3077 vec_safe_push (types
[i
], type
);
3078 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3079 type
= type_promotes_to (type
);
3082 if (! vec_member (type
, types
[i
]))
3083 vec_safe_push (types
[i
], type
);
3088 if (code
== COND_EXPR
&& lvalue_p (args
[i
]))
3089 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3090 type
= non_reference (argtypes
[i
]);
3091 if (i
!= 0 || ! ref1
)
3093 type
= cv_unqualified (type_decays_to (type
));
3094 if (enum_p
&& UNSCOPED_ENUM_P (type
))
3095 vec_safe_push (types
[i
], type
);
3096 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3097 type
= type_promotes_to (type
);
3099 vec_safe_push (types
[i
], type
);
3103 /* Run through the possible parameter types of both arguments,
3104 creating candidates with those parameter types. */
3105 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
3110 if (!types
[1]->is_empty ())
3111 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
3112 add_builtin_candidate
3113 (candidates
, code
, code2
, fnname
, t
,
3114 u
, args
, argtypes
, flags
, complain
);
3116 add_builtin_candidate
3117 (candidates
, code
, code2
, fnname
, t
,
3118 NULL_TREE
, args
, argtypes
, flags
, complain
);
3121 release_tree_vector (types
[0]);
3122 release_tree_vector (types
[1]);
3126 /* If TMPL can be successfully instantiated as indicated by
3127 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3129 TMPL is the template. EXPLICIT_TARGS are any explicit template
3130 arguments. ARGLIST is the arguments provided at the call-site.
3131 This does not change ARGLIST. The RETURN_TYPE is the desired type
3132 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3133 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3134 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3136 static struct z_candidate
*
3137 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
3138 tree ctype
, tree explicit_targs
, tree first_arg
,
3139 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3140 tree access_path
, tree conversion_path
,
3141 int flags
, tree obj
, unification_kind_t strict
,
3142 tsubst_flags_t complain
)
3144 int ntparms
= DECL_NTPARMS (tmpl
);
3145 tree targs
= make_tree_vec (ntparms
);
3146 unsigned int len
= vec_safe_length (arglist
);
3147 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
3148 unsigned int skip_without_in_chrg
= 0;
3149 tree first_arg_without_in_chrg
= first_arg
;
3150 tree
*args_without_in_chrg
;
3151 unsigned int nargs_without_in_chrg
;
3152 unsigned int ia
, ix
;
3154 struct z_candidate
*cand
;
3156 struct rejection_reason
*reason
= NULL
;
3158 conversion
**convs
= NULL
;
3160 /* We don't do deduction on the in-charge parameter, the VTT
3161 parameter or 'this'. */
3162 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
3164 if (first_arg_without_in_chrg
!= NULL_TREE
)
3165 first_arg_without_in_chrg
= NULL_TREE
;
3166 else if (return_type
&& strict
== DEDUCE_CALL
)
3167 /* We're deducing for a call to the result of a template conversion
3168 function, so the args don't contain 'this'; leave them alone. */;
3170 ++skip_without_in_chrg
;
3173 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
3174 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
3175 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
3177 if (first_arg_without_in_chrg
!= NULL_TREE
)
3178 first_arg_without_in_chrg
= NULL_TREE
;
3180 ++skip_without_in_chrg
;
3183 if (len
< skip_without_in_chrg
)
3186 if (DECL_CONSTRUCTOR_P (tmpl
) && nargs
== 2
3187 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg
),
3188 TREE_TYPE ((*arglist
)[0])))
3190 /* 12.8/6 says, "A declaration of a constructor for a class X is
3191 ill-formed if its first parameter is of type (optionally cv-qualified)
3192 X and either there are no other parameters or else all other
3193 parameters have default arguments. A member function template is never
3194 instantiated to produce such a constructor signature."
3196 So if we're trying to copy an object of the containing class, don't
3197 consider a template constructor that has a first parameter type that
3198 is just a template parameter, as we would deduce a signature that we
3199 would then reject in the code below. */
3200 if (tree firstparm
= FUNCTION_FIRST_USER_PARMTYPE (tmpl
))
3202 firstparm
= TREE_VALUE (firstparm
);
3203 if (PACK_EXPANSION_P (firstparm
))
3204 firstparm
= PACK_EXPANSION_PATTERN (firstparm
);
3205 if (TREE_CODE (firstparm
) == TEMPLATE_TYPE_PARM
)
3207 gcc_assert (!explicit_targs
);
3208 reason
= invalid_copy_with_fn_template_rejection ();
3214 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
3215 + (len
- skip_without_in_chrg
));
3216 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
3218 if (first_arg_without_in_chrg
!= NULL_TREE
)
3220 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
3223 for (ix
= skip_without_in_chrg
;
3224 vec_safe_iterate (arglist
, ix
, &arg
);
3227 args_without_in_chrg
[ia
] = arg
;
3230 gcc_assert (ia
== nargs_without_in_chrg
);
3232 errs
= errorcount
+sorrycount
;
3234 convs
= alloc_conversions (nargs
);
3235 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
3236 args_without_in_chrg
,
3237 nargs_without_in_chrg
,
3238 return_type
, strict
, flags
, convs
,
3239 false, complain
& tf_decltype
);
3241 if (fn
== error_mark_node
)
3243 /* Don't repeat unification later if it already resulted in errors. */
3244 if (errorcount
+sorrycount
== errs
)
3245 reason
= template_unification_rejection (tmpl
, explicit_targs
,
3246 targs
, args_without_in_chrg
,
3247 nargs_without_in_chrg
,
3248 return_type
, strict
, flags
);
3250 reason
= template_unification_error_rejection ();
3254 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
3256 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
3257 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
3260 /* We're trying to produce a constructor with a prohibited signature,
3261 as discussed above; handle here any cases we didn't catch then,
3263 reason
= invalid_copy_with_fn_template_rejection ();
3268 if (obj
!= NULL_TREE
)
3269 /* Aha, this is a conversion function. */
3270 cand
= add_conv_candidate (candidates
, fn
, obj
, arglist
,
3271 access_path
, conversion_path
, complain
);
3273 cand
= add_function_candidate (candidates
, fn
, ctype
,
3274 first_arg
, arglist
, access_path
,
3275 conversion_path
, flags
, convs
, complain
);
3276 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
3277 /* This situation can occur if a member template of a template
3278 class is specialized. Then, instantiate_template might return
3279 an instantiation of the specialization, in which case the
3280 DECL_TI_TEMPLATE field will point at the original
3281 specialization. For example:
3283 template <class T> struct S { template <class U> void f(U);
3284 template <> void f(int) {}; };
3288 Here, TMPL will be template <class U> S<double>::f(U).
3289 And, instantiate template will give us the specialization
3290 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3291 for this will point at template <class T> template <> S<T>::f(int),
3292 so that we can find the definition. For the purposes of
3293 overload resolution, however, we want the original TMPL. */
3294 cand
->template_decl
= build_template_info (tmpl
, targs
);
3296 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3297 cand
->explicit_targs
= explicit_targs
;
3301 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3302 access_path
, conversion_path
, 0, reason
, flags
);
3306 static struct z_candidate
*
3307 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3308 tree explicit_targs
, tree first_arg
,
3309 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3310 tree access_path
, tree conversion_path
, int flags
,
3311 unification_kind_t strict
, tsubst_flags_t complain
)
3314 add_template_candidate_real (candidates
, tmpl
, ctype
,
3315 explicit_targs
, first_arg
, arglist
,
3316 return_type
, access_path
, conversion_path
,
3317 flags
, NULL_TREE
, strict
, complain
);
3320 /* Create an overload candidate for the conversion function template TMPL,
3321 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3322 pointer-to-function which will in turn be called with the argument list
3323 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3324 passed on to implicit_conversion. */
3326 static struct z_candidate
*
3327 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3329 const vec
<tree
, va_gc
> *arglist
,
3330 tree return_type
, tree access_path
,
3331 tree conversion_path
, tsubst_flags_t complain
)
3333 /* Making this work broke PR 71117 and 85118, so until the committee resolves
3334 core issue 2189, let's disable this candidate if there are any call
3340 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3341 NULL_TREE
, arglist
, return_type
, access_path
,
3342 conversion_path
, 0, obj
, DEDUCE_CALL
,
3346 /* The CANDS are the set of candidates that were considered for
3347 overload resolution. Return the set of viable candidates, or CANDS
3348 if none are viable. If any of the candidates were viable, set
3349 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3350 considered viable only if it is strictly viable. */
3352 static struct z_candidate
*
3353 splice_viable (struct z_candidate
*cands
,
3357 struct z_candidate
*viable
;
3358 struct z_candidate
**last_viable
;
3359 struct z_candidate
**cand
;
3360 bool found_strictly_viable
= false;
3362 /* Be strict inside templates, since build_over_call won't actually
3363 do the conversions to get pedwarns. */
3364 if (processing_template_decl
)
3368 last_viable
= &viable
;
3369 *any_viable_p
= false;
3374 struct z_candidate
*c
= *cand
;
3376 && (c
->viable
== 1 || TREE_CODE (c
->fn
) == TEMPLATE_DECL
))
3378 /* Be strict in the presence of a viable candidate. Also if
3379 there are template candidates, so that we get deduction errors
3380 for them instead of silently preferring a bad conversion. */
3382 if (viable
&& !found_strictly_viable
)
3384 /* Put any spliced near matches back onto the main list so
3385 that we see them if there is no strict match. */
3386 *any_viable_p
= false;
3387 *last_viable
= cands
;
3390 last_viable
= &viable
;
3394 if (strict_p
? c
->viable
== 1 : c
->viable
)
3399 last_viable
= &c
->next
;
3400 *any_viable_p
= true;
3402 found_strictly_viable
= true;
3408 return viable
? viable
: cands
;
3412 any_strictly_viable (struct z_candidate
*cands
)
3414 for (; cands
; cands
= cands
->next
)
3415 if (cands
->viable
== 1)
3420 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3421 words, it is about to become the "this" pointer for a member
3422 function call. Take the address of the object. */
3425 build_this (tree obj
)
3427 /* In a template, we are only concerned about the type of the
3428 expression, so we can take a shortcut. */
3429 if (processing_template_decl
)
3430 return build_address (obj
);
3432 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3435 /* Returns true iff functions are equivalent. Equivalent functions are
3436 not '==' only if one is a function-local extern function or if
3437 both are extern "C". */
3440 equal_functions (tree fn1
, tree fn2
)
3442 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3444 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3446 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3447 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3448 return decls_match (fn1
, fn2
);
3452 /* Print information about a candidate FN being rejected due to INFO. */
3455 print_conversion_rejection (location_t loc
, struct conversion_info
*info
,
3458 tree from
= info
->from
;
3460 from
= lvalue_type (from
);
3461 if (info
->n_arg
== -1)
3463 /* Conversion of implicit `this' argument failed. */
3464 if (!TYPE_P (info
->from
))
3465 /* A bad conversion for 'this' must be discarding cv-quals. */
3466 inform (loc
, " passing %qT as %<this%> "
3467 "argument discards qualifiers",
3470 inform (loc
, " no known conversion for implicit "
3471 "%<this%> parameter from %qH to %qI",
3472 from
, info
->to_type
);
3474 else if (!TYPE_P (info
->from
))
3476 if (info
->n_arg
>= 0)
3477 inform (loc
, " conversion of argument %d would be ill-formed:",
3479 perform_implicit_conversion (info
->to_type
, info
->from
,
3480 tf_warning_or_error
);
3482 else if (info
->n_arg
== -2)
3483 /* Conversion of conversion function return value failed. */
3484 inform (loc
, " no known conversion from %qH to %qI",
3485 from
, info
->to_type
);
3488 if (TREE_CODE (fn
) == FUNCTION_DECL
)
3489 loc
= get_fndecl_argument_location (fn
, info
->n_arg
);
3490 inform (loc
, " no known conversion for argument %d from %qH to %qI",
3491 info
->n_arg
+ 1, from
, info
->to_type
);
3495 /* Print information about a candidate with WANT parameters and we found
3499 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3501 inform_n (loc
, want
,
3502 " candidate expects %d argument, %d provided",
3503 " candidate expects %d arguments, %d provided",
3507 /* Print information about one overload candidate CANDIDATE. MSGSTR
3508 is the text to print before the candidate itself.
3510 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3511 to have been run through gettext by the caller. This wart makes
3512 life simpler in print_z_candidates and for the translators. */
3515 print_z_candidate (location_t loc
, const char *msgstr
,
3516 struct z_candidate
*candidate
)
3518 const char *msg
= (msgstr
== NULL
3520 : ACONCAT ((msgstr
, " ", NULL
)));
3521 tree fn
= candidate
->fn
;
3522 if (flag_new_inheriting_ctors
)
3523 fn
= strip_inheriting_ctors (fn
);
3524 location_t cloc
= location_of (fn
);
3526 if (identifier_p (fn
))
3529 if (candidate
->num_convs
== 3)
3530 inform (cloc
, "%s%<%D(%T, %T, %T)%> <built-in>", msg
, fn
,
3531 candidate
->convs
[0]->type
,
3532 candidate
->convs
[1]->type
,
3533 candidate
->convs
[2]->type
);
3534 else if (candidate
->num_convs
== 2)
3535 inform (cloc
, "%s%<%D(%T, %T)%> <built-in>", msg
, fn
,
3536 candidate
->convs
[0]->type
,
3537 candidate
->convs
[1]->type
);
3539 inform (cloc
, "%s%<%D(%T)%> <built-in>", msg
, fn
,
3540 candidate
->convs
[0]->type
);
3542 else if (TYPE_P (fn
))
3543 inform (cloc
, "%s%qT <conversion>", msg
, fn
);
3544 else if (candidate
->viable
== -1)
3545 inform (cloc
, "%s%#qD <near match>", msg
, fn
);
3546 else if (DECL_DELETED_FN (fn
))
3547 inform (cloc
, "%s%#qD <deleted>", msg
, fn
);
3549 inform (cloc
, "%s%#qD", msg
, fn
);
3550 if (fn
!= candidate
->fn
)
3552 cloc
= location_of (candidate
->fn
);
3553 inform (cloc
, " inherited here");
3555 /* Give the user some information about why this candidate failed. */
3556 if (candidate
->reason
!= NULL
)
3558 struct rejection_reason
*r
= candidate
->reason
;
3563 print_arity_information (cloc
, r
->u
.arity
.actual
,
3564 r
->u
.arity
.expected
);
3566 case rr_arg_conversion
:
3567 print_conversion_rejection (cloc
, &r
->u
.conversion
, fn
);
3569 case rr_bad_arg_conversion
:
3570 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
, fn
);
3572 case rr_explicit_conversion
:
3573 inform (cloc
, " return type %qT of explicit conversion function "
3574 "cannot be converted to %qT with a qualification "
3575 "conversion", r
->u
.conversion
.from
,
3576 r
->u
.conversion
.to_type
);
3578 case rr_template_conversion
:
3579 inform (cloc
, " conversion from return type %qT of template "
3580 "conversion function specialization to %qT is not an "
3581 "exact match", r
->u
.conversion
.from
,
3582 r
->u
.conversion
.to_type
);
3584 case rr_template_unification
:
3585 /* We use template_unification_error_rejection if unification caused
3586 actual non-SFINAE errors, in which case we don't need to repeat
3588 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3590 inform (cloc
, " substitution of deduced template arguments "
3591 "resulted in errors seen above");
3594 /* Re-run template unification with diagnostics. */
3595 inform (cloc
, " template argument deduction/substitution failed:");
3596 fn_type_unification (r
->u
.template_unification
.tmpl
,
3597 r
->u
.template_unification
.explicit_targs
,
3599 (r
->u
.template_unification
.num_targs
)),
3600 r
->u
.template_unification
.args
,
3601 r
->u
.template_unification
.nargs
,
3602 r
->u
.template_unification
.return_type
,
3603 r
->u
.template_unification
.strict
,
3604 r
->u
.template_unification
.flags
,
3607 case rr_invalid_copy
:
3609 " a constructor taking a single argument of its own "
3610 "class type is invalid");
3612 case rr_constraint_failure
:
3614 tree tmpl
= r
->u
.template_instantiation
.tmpl
;
3615 tree args
= r
->u
.template_instantiation
.targs
;
3616 diagnose_constraints (cloc
, tmpl
, args
);
3619 case rr_inherited_ctor
:
3620 inform (cloc
, " an inherited constructor is not a candidate for "
3621 "initialization from an expression of the same or derived "
3626 /* This candidate didn't have any issues or we failed to
3627 handle a particular code. Either way... */
3634 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3636 struct z_candidate
*cand1
;
3637 struct z_candidate
**cand2
;
3642 /* Remove non-viable deleted candidates. */
3644 for (cand2
= &cand1
; *cand2
; )
3646 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3647 && !(*cand2
)->viable
3648 && DECL_DELETED_FN ((*cand2
)->fn
))
3649 *cand2
= (*cand2
)->next
;
3651 cand2
= &(*cand2
)->next
;
3653 /* ...if there are any non-deleted ones. */
3657 /* There may be duplicates in the set of candidates. We put off
3658 checking this condition as long as possible, since we have no way
3659 to eliminate duplicates from a set of functions in less than n^2
3660 time. Now we are about to emit an error message, so it is more
3661 permissible to go slowly. */
3662 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3664 tree fn
= cand1
->fn
;
3665 /* Skip builtin candidates and conversion functions. */
3668 cand2
= &cand1
->next
;
3671 if (DECL_P ((*cand2
)->fn
)
3672 && equal_functions (fn
, (*cand2
)->fn
))
3673 *cand2
= (*cand2
)->next
;
3675 cand2
= &(*cand2
)->next
;
3679 for (; candidates
; candidates
= candidates
->next
)
3680 print_z_candidate (loc
, "candidate:", candidates
);
3683 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3684 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3685 the result of the conversion function to convert it to the final
3686 desired type. Merge the two sequences into a single sequence,
3687 and return the merged sequence. */
3690 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3693 bool bad
= user_seq
->bad_p
;
3695 gcc_assert (user_seq
->kind
== ck_user
);
3697 /* Find the end of the second conversion sequence. */
3698 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3700 /* The entire sequence is a user-conversion sequence. */
3701 (*t
)->user_conv_p
= true;
3706 if ((*t
)->rvaluedness_matches_p
)
3707 /* We're binding a reference directly to the result of the conversion.
3708 build_user_type_conversion_1 stripped the REFERENCE_TYPE from the return
3709 type, but we want it back. */
3710 user_seq
->type
= TREE_TYPE (TREE_TYPE (user_seq
->cand
->fn
));
3712 /* Replace the identity conversion with the user conversion
3719 /* Handle overload resolution for initializing an object of class type from
3720 an initializer list. First we look for a suitable constructor that
3721 takes a std::initializer_list; if we don't find one, we then look for a
3722 non-list constructor.
3724 Parameters are as for add_candidates, except that the arguments are in
3725 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3726 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3729 add_list_candidates (tree fns
, tree first_arg
,
3730 const vec
<tree
, va_gc
> *args
, tree totype
,
3731 tree explicit_targs
, bool template_only
,
3732 tree conversion_path
, tree access_path
,
3734 struct z_candidate
**candidates
,
3735 tsubst_flags_t complain
)
3737 gcc_assert (*candidates
== NULL
);
3739 /* We're looking for a ctor for list-initialization. */
3740 flags
|= LOOKUP_LIST_INIT_CTOR
;
3741 /* And we don't allow narrowing conversions. We also use this flag to
3742 avoid the copy constructor call for copy-list-initialization. */
3743 flags
|= LOOKUP_NO_NARROWING
;
3745 unsigned nart
= num_artificial_parms_for (OVL_FIRST (fns
)) - 1;
3746 tree init_list
= (*args
)[nart
];
3748 /* Always use the default constructor if the list is empty (DR 990). */
3749 if (CONSTRUCTOR_NELTS (init_list
) == 0
3750 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3752 /* If the class has a list ctor, try passing the list as a single
3753 argument first, but only consider list ctors. */
3754 else if (TYPE_HAS_LIST_CTOR (totype
))
3756 flags
|= LOOKUP_LIST_ONLY
;
3757 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3758 explicit_targs
, template_only
, conversion_path
,
3759 access_path
, flags
, candidates
, complain
);
3760 if (any_strictly_viable (*candidates
))
3764 /* Expand the CONSTRUCTOR into a new argument vec. */
3765 vec
<tree
, va_gc
> *new_args
;
3766 vec_alloc (new_args
, nart
+ CONSTRUCTOR_NELTS (init_list
));
3767 for (unsigned i
= 0; i
< nart
; ++i
)
3768 new_args
->quick_push ((*args
)[i
]);
3769 for (unsigned i
= 0; i
< CONSTRUCTOR_NELTS (init_list
); ++i
)
3770 new_args
->quick_push (CONSTRUCTOR_ELT (init_list
, i
)->value
);
3772 /* We aren't looking for list-ctors anymore. */
3773 flags
&= ~LOOKUP_LIST_ONLY
;
3774 /* We allow more user-defined conversions within an init-list. */
3775 flags
&= ~LOOKUP_NO_CONVERSION
;
3777 add_candidates (fns
, first_arg
, new_args
, NULL_TREE
,
3778 explicit_targs
, template_only
, conversion_path
,
3779 access_path
, flags
, candidates
, complain
);
3782 /* Returns the best overload candidate to perform the requested
3783 conversion. This function is used for three the overloading situations
3784 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3785 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3786 per [dcl.init.ref], so we ignore temporary bindings. */
3788 static struct z_candidate
*
3789 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3790 tsubst_flags_t complain
)
3792 struct z_candidate
*candidates
, *cand
;
3794 tree ctors
= NULL_TREE
;
3795 tree conv_fns
= NULL_TREE
;
3796 conversion
*conv
= NULL
;
3797 tree first_arg
= NULL_TREE
;
3798 vec
<tree
, va_gc
> *args
= NULL
;
3805 fromtype
= TREE_TYPE (expr
);
3807 /* We represent conversion within a hierarchy using RVALUE_CONV and
3808 BASE_CONV, as specified by [over.best.ics]; these become plain
3809 constructor calls, as specified in [dcl.init]. */
3810 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3811 || !DERIVED_FROM_P (totype
, fromtype
));
3813 if (CLASS_TYPE_P (totype
))
3814 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3815 creating a garbage BASELINK; constructors can't be inherited. */
3816 ctors
= get_class_binding (totype
, complete_ctor_identifier
);
3818 if (MAYBE_CLASS_TYPE_P (fromtype
))
3820 tree to_nonref
= non_reference (totype
);
3821 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3822 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3823 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3825 /* [class.conv.fct] A conversion function is never used to
3826 convert a (possibly cv-qualified) object to the (possibly
3827 cv-qualified) same object type (or a reference to it), to a
3828 (possibly cv-qualified) base class of that type (or a
3829 reference to it)... */
3832 conv_fns
= lookup_conversions (fromtype
);
3836 flags
|= LOOKUP_NO_CONVERSION
;
3837 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3838 flags
|= LOOKUP_NO_NARROWING
;
3840 /* It's OK to bind a temporary for converting constructor arguments, but
3841 not in converting the return value of a conversion operator. */
3842 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
3843 | (flags
& LOOKUP_NO_NARROWING
));
3844 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3848 int ctorflags
= flags
;
3850 first_arg
= build_dummy_object (totype
);
3852 /* We should never try to call the abstract or base constructor
3854 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors
))
3855 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors
)));
3857 args
= make_tree_vector_single (expr
);
3858 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3860 /* List-initialization. */
3861 add_list_candidates (ctors
, first_arg
, args
, totype
, NULL_TREE
,
3862 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3863 ctorflags
, &candidates
, complain
);
3867 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3868 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3869 ctorflags
, &candidates
, complain
);
3872 for (cand
= candidates
; cand
; cand
= cand
->next
)
3874 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3876 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3877 set, then this is copy-initialization. In that case, "The
3878 result of the call is then used to direct-initialize the
3879 object that is the destination of the copy-initialization."
3882 We represent this in the conversion sequence with an
3883 rvalue conversion, which means a constructor call. */
3884 if (!TYPE_REF_P (totype
)
3885 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3887 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3893 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3894 first_arg
= CONSTRUCTOR_ELT (expr
, 0)->value
;
3899 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3901 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3902 struct z_candidate
*old_candidates
;
3904 /* If we are called to convert to a reference type, we are trying to
3905 find a direct binding, so don't even consider temporaries. If
3906 we don't find a direct binding, the caller will try again to
3907 look for a temporary binding. */
3908 if (TYPE_REF_P (totype
))
3909 convflags
|= LOOKUP_NO_TEMP_BIND
;
3911 old_candidates
= candidates
;
3912 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
3914 conversion_path
, TYPE_BINFO (fromtype
),
3915 flags
, &candidates
, complain
);
3917 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
3919 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
3921 = implicit_conversion (totype
,
3924 /*c_cast_p=*/false, convflags
,
3927 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3928 copy-initialization. In that case, "The result of the
3929 call is then used to direct-initialize the object that is
3930 the destination of the copy-initialization." [dcl.init]
3932 We represent this in the conversion sequence with an
3933 rvalue conversion, which means a constructor call. But
3934 don't add a second rvalue conversion if there's already
3935 one there. Which there really shouldn't be, but it's
3936 harmless since we'd add it here anyway. */
3937 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
3938 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3939 ics
= build_conv (ck_rvalue
, totype
, ics
);
3941 cand
->second_conv
= ics
;
3946 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -2,
3948 EXPR_LOCATION (expr
));
3950 else if (DECL_NONCONVERTING_P (cand
->fn
)
3951 && ics
->rank
> cr_exact
)
3953 /* 13.3.1.5: For direct-initialization, those explicit
3954 conversion functions that are not hidden within S and
3955 yield type T or a type that can be converted to type T
3956 with a qualification conversion (4.4) are also candidate
3958 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3959 I've raised this issue with the committee. --jason 9/2011 */
3961 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
3963 else if (cand
->viable
== 1 && ics
->bad_p
)
3967 = bad_arg_conversion_rejection (NULL_TREE
, -2,
3969 EXPR_LOCATION (expr
));
3971 else if (primary_template_specialization_p (cand
->fn
)
3972 && ics
->rank
> cr_exact
)
3974 /* 13.3.3.1.2: If the user-defined conversion is specified by
3975 a specialization of a conversion function template, the
3976 second standard conversion sequence shall have exact match
3979 cand
->reason
= template_conversion_rejection (rettype
, totype
);
3984 candidates
= splice_viable (candidates
, false, &any_viable_p
);
3988 release_tree_vector (args
);
3992 cand
= tourney (candidates
, complain
);
3995 if (complain
& tf_error
)
3997 auto_diagnostic_group d
;
3998 error ("conversion from %qH to %qI is ambiguous",
4000 print_z_candidates (location_of (expr
), candidates
);
4003 cand
= candidates
; /* any one will do */
4004 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
4005 cand
->second_conv
->user_conv_p
= true;
4006 if (!any_strictly_viable (candidates
))
4007 cand
->second_conv
->bad_p
= true;
4008 if (flags
& LOOKUP_ONLYCONVERTING
)
4009 cand
->second_conv
->need_temporary_p
= true;
4010 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
4011 ambiguous conversion is no worse than another user-defined
4018 if (!DECL_CONSTRUCTOR_P (cand
->fn
))
4019 convtype
= non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)));
4020 else if (cand
->second_conv
->kind
== ck_rvalue
)
4021 /* DR 5: [in the first step of copy-initialization]...if the function
4022 is a constructor, the call initializes a temporary of the
4023 cv-unqualified version of the destination type. */
4024 convtype
= cv_unqualified (totype
);
4027 /* Build the user conversion sequence. */
4031 build_identity_conv (TREE_TYPE (expr
), expr
));
4033 if (cand
->viable
== -1)
4036 /* We're performing the maybe-rvalue overload resolution and
4037 a conversion function is in play. Reject converting the return
4038 value of the conversion function to a base class. */
4039 if ((flags
& LOOKUP_PREFER_RVALUE
) && !DECL_CONSTRUCTOR_P (cand
->fn
))
4040 for (conversion
*t
= cand
->second_conv
; t
; t
= next_conversion (t
))
4041 if (t
->kind
== ck_base
)
4044 /* Remember that this was a list-initialization. */
4045 if (flags
& LOOKUP_NO_NARROWING
)
4046 conv
->check_narrowing
= true;
4048 /* Combine it with the second conversion sequence. */
4049 cand
->second_conv
= merge_conversion_sequences (conv
,
4055 /* Wrapper for above. */
4058 build_user_type_conversion (tree totype
, tree expr
, int flags
,
4059 tsubst_flags_t complain
)
4061 struct z_candidate
*cand
;
4064 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4065 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
4069 if (cand
->second_conv
->kind
== ck_ambig
)
4070 ret
= error_mark_node
;
4073 expr
= convert_like (cand
->second_conv
, expr
, complain
);
4074 ret
= convert_from_reference (expr
);
4080 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4084 /* Subroutine of convert_nontype_argument.
4086 EXPR is an expression used in a context that requires a converted
4087 constant-expression, such as a template non-type parameter. Do any
4088 necessary conversions (that are permitted for converted
4089 constant-expressions) to convert it to the desired type.
4091 If conversion is successful, returns the converted expression;
4092 otherwise, returns error_mark_node. */
4095 build_converted_constant_expr (tree type
, tree expr
, tsubst_flags_t complain
)
4100 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
4102 if (error_operand_p (expr
))
4103 return error_mark_node
;
4105 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4106 p
= conversion_obstack_alloc (0);
4108 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
4110 LOOKUP_IMPLICIT
, complain
);
4112 /* A converted constant expression of type T is an expression, implicitly
4113 converted to type T, where the converted expression is a constant
4114 expression and the implicit conversion sequence contains only
4116 * user-defined conversions,
4117 * lvalue-to-rvalue conversions (7.1),
4118 * array-to-pointer conversions (7.2),
4119 * function-to-pointer conversions (7.3),
4120 * qualification conversions (7.5),
4121 * integral promotions (7.6),
4122 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4123 * null pointer conversions (7.11) from std::nullptr_t,
4124 * null member pointer conversions (7.12) from std::nullptr_t, and
4125 * function pointer conversions (7.13),
4127 and where the reference binding (if any) binds directly. */
4129 for (conversion
*c
= conv
;
4130 conv
&& c
->kind
!= ck_identity
;
4131 c
= next_conversion (c
))
4135 /* A conversion function is OK. If it isn't constexpr, we'll
4136 complain later that the argument isn't constant. */
4138 /* The lvalue-to-rvalue conversion is OK. */
4140 /* Array-to-pointer and function-to-pointer. */
4142 /* Function pointer conversions. */
4144 /* Qualification conversions. */
4149 if (c
->need_temporary_p
)
4151 if (complain
& tf_error
)
4152 error_at (loc
, "initializing %qH with %qI in converted "
4153 "constant expression does not bind directly",
4154 type
, next_conversion (c
)->type
);
4163 t
= next_conversion (c
)->type
;
4164 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
)
4165 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
4166 /* Integral promotion or conversion. */
4168 if (NULLPTR_TYPE_P (t
))
4169 /* Conversion from nullptr to pointer or pointer-to-member. */
4172 if (complain
& tf_error
)
4173 error_at (loc
, "conversion from %qH to %qI in a "
4174 "converted constant expression", t
, type
);
4183 /* Avoid confusing convert_nontype_argument by introducing
4184 a redundant conversion to the same reference type. */
4185 if (conv
&& conv
->kind
== ck_ref_bind
4186 && REFERENCE_REF_P (expr
))
4188 tree ref
= TREE_OPERAND (expr
, 0);
4189 if (same_type_p (type
, TREE_TYPE (ref
)))
4195 conv
->check_narrowing
= true;
4196 conv
->check_narrowing_const_only
= true;
4197 expr
= convert_like (conv
, expr
, complain
);
4201 if (complain
& tf_error
)
4202 error_at (loc
, "could not convert %qE from %qH to %qI", expr
,
4203 TREE_TYPE (expr
), type
);
4204 expr
= error_mark_node
;
4207 /* Free all the conversions we allocated. */
4208 obstack_free (&conversion_obstack
, p
);
4213 /* Do any initial processing on the arguments to a function call. */
4215 static vec
<tree
, va_gc
> *
4216 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
4221 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
4223 if (error_operand_p (arg
))
4225 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
4227 if (complain
& tf_error
)
4228 error ("invalid use of void expression");
4231 else if (invalid_nonstatic_memfn_p (arg
->exp
.locus
, arg
, complain
))
4237 /* Perform overload resolution on FN, which is called with the ARGS.
4239 Return the candidate function selected by overload resolution, or
4240 NULL if the event that overload resolution failed. In the case
4241 that overload resolution fails, *CANDIDATES will be the set of
4242 candidates considered, and ANY_VIABLE_P will be set to true or
4243 false to indicate whether or not any of the candidates were
4246 The ARGS should already have gone through RESOLVE_ARGS before this
4247 function is called. */
4249 static struct z_candidate
*
4250 perform_overload_resolution (tree fn
,
4251 const vec
<tree
, va_gc
> *args
,
4252 struct z_candidate
**candidates
,
4253 bool *any_viable_p
, tsubst_flags_t complain
)
4255 struct z_candidate
*cand
;
4256 tree explicit_targs
;
4259 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4261 explicit_targs
= NULL_TREE
;
4265 *any_viable_p
= true;
4268 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4269 || TREE_CODE (fn
) == TEMPLATE_DECL
4270 || TREE_CODE (fn
) == OVERLOAD
4271 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
4273 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4275 explicit_targs
= TREE_OPERAND (fn
, 1);
4276 fn
= TREE_OPERAND (fn
, 0);
4280 /* Add the various candidate functions. */
4281 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
4282 explicit_targs
, template_only
,
4283 /*conversion_path=*/NULL_TREE
,
4284 /*access_path=*/NULL_TREE
,
4286 candidates
, complain
);
4288 *candidates
= splice_viable (*candidates
, false, any_viable_p
);
4290 cand
= tourney (*candidates
, complain
);
4294 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4298 /* Print an error message about being unable to build a call to FN with
4299 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4300 be located; CANDIDATES is a possibly empty list of such
4304 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
,
4305 struct z_candidate
*candidates
)
4307 tree targs
= NULL_TREE
;
4308 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4310 targs
= TREE_OPERAND (fn
, 1);
4311 fn
= TREE_OPERAND (fn
, 0);
4313 tree name
= OVL_NAME (fn
);
4314 location_t loc
= location_of (name
);
4316 name
= lookup_template_function (name
, targs
);
4318 auto_diagnostic_group d
;
4319 if (!any_strictly_viable (candidates
))
4320 error_at (loc
, "no matching function for call to %<%D(%A)%>",
4321 name
, build_tree_list_vec (args
));
4323 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
4324 name
, build_tree_list_vec (args
));
4326 print_z_candidates (loc
, candidates
);
4329 /* Return an expression for a call to FN (a namespace-scope function,
4330 or a static member function) with the ARGS. This may change
4334 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
,
4335 tsubst_flags_t complain
)
4337 struct z_candidate
*candidates
, *cand
;
4342 if (args
!= NULL
&& *args
!= NULL
)
4344 *args
= resolve_args (*args
, complain
);
4346 return error_mark_node
;
4350 tm_malloc_replacement (fn
);
4352 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4353 p
= conversion_obstack_alloc (0);
4355 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
4360 if (complain
& tf_error
)
4362 // If there is a single (non-viable) function candidate,
4363 // let the error be diagnosed by cp_build_function_call_vec.
4364 if (!any_viable_p
&& candidates
&& ! candidates
->next
4365 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
4366 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
4368 // Otherwise, emit notes for non-viable candidates.
4369 print_error_for_call_failure (fn
, *args
, candidates
);
4371 result
= error_mark_node
;
4375 int flags
= LOOKUP_NORMAL
;
4376 /* If fn is template_id_expr, the call has explicit template arguments
4377 (e.g. func<int>(5)), communicate this info to build_over_call
4378 through flags so that later we can use it to decide whether to warn
4379 about peculiar null pointer conversion. */
4380 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4382 /* If overload resolution selects a specialization of a
4383 function concept for non-dependent template arguments,
4384 the expression is true if the constraints are satisfied
4385 and false otherwise.
4387 NOTE: This is an extension of Concepts Lite TS that
4388 allows constraints to be used in expressions. */
4389 if (flag_concepts
&& !processing_template_decl
)
4391 tree tmpl
= DECL_TI_TEMPLATE (cand
->fn
);
4392 tree targs
= DECL_TI_ARGS (cand
->fn
);
4393 tree decl
= DECL_TEMPLATE_RESULT (tmpl
);
4394 if (DECL_DECLARED_CONCEPT_P (decl
))
4395 return evaluate_function_concept (decl
, targs
);
4398 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4401 result
= build_over_call (cand
, flags
, complain
);
4404 /* Free all the conversions we allocated. */
4405 obstack_free (&conversion_obstack
, p
);
4410 /* Build a call to a global operator new. FNNAME is the name of the
4411 operator (either "operator new" or "operator new[]") and ARGS are
4412 the arguments provided. This may change ARGS. *SIZE points to the
4413 total number of bytes required by the allocation, and is updated if
4414 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4415 be used. If this function determines that no cookie should be
4416 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4417 is not NULL_TREE, it is evaluated before calculating the final
4418 array size, and if it fails, the array size is replaced with
4419 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4420 is non-NULL, it will be set, upon return, to the allocation
4424 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4425 tree
*size
, tree
*cookie_size
,
4426 tree align_arg
, tree size_check
,
4427 tree
*fn
, tsubst_flags_t complain
)
4429 tree original_size
= *size
;
4431 struct z_candidate
*candidates
;
4432 struct z_candidate
*cand
= NULL
;
4437 /* Set to (size_t)-1 if the size check fails. */
4438 if (size_check
!= NULL_TREE
)
4440 tree errval
= TYPE_MAX_VALUE (sizetype
);
4441 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4442 errval
= throw_bad_array_new_length ();
4443 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4444 original_size
, errval
);
4446 vec_safe_insert (*args
, 0, *size
);
4447 *args
= resolve_args (*args
, complain
);
4449 return error_mark_node
;
4455 If this lookup fails to find the name, or if the allocated type
4456 is not a class type, the allocation function's name is looked
4457 up in the global scope.
4459 we disregard block-scope declarations of "operator new". */
4460 fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/false, 0, 0);
4461 fns
= lookup_arg_dependent (fnname
, fns
, *args
);
4465 vec
<tree
, va_gc
>* align_args
4466 = vec_copy_and_insert (*args
, align_arg
, 1);
4467 cand
= perform_overload_resolution (fns
, align_args
, &candidates
,
4468 &any_viable_p
, tf_none
);
4471 /* If no aligned allocation function matches, try again without the
4475 /* Figure out what function is being called. */
4477 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
4480 /* If no suitable function could be found, issue an error message
4484 if (complain
& tf_error
)
4485 print_error_for_call_failure (fns
, *args
, candidates
);
4486 return error_mark_node
;
4489 /* If a cookie is required, add some extra space. Whether
4490 or not a cookie is required cannot be determined until
4491 after we know which function was called. */
4494 bool use_cookie
= true;
4497 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4498 /* Skip the size_t parameter. */
4499 arg_types
= TREE_CHAIN (arg_types
);
4500 /* Check the remaining parameters (if any). */
4502 && TREE_CHAIN (arg_types
) == void_list_node
4503 && same_type_p (TREE_VALUE (arg_types
),
4506 /* If we need a cookie, adjust the number of bytes allocated. */
4509 /* Update the total size. */
4510 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4513 /* Set to (size_t)-1 if the size check fails. */
4514 gcc_assert (size_check
!= NULL_TREE
);
4515 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4516 *size
, TYPE_MAX_VALUE (sizetype
));
4518 /* Update the argument list to reflect the adjusted size. */
4519 (**args
)[0] = *size
;
4522 *cookie_size
= NULL_TREE
;
4525 /* Tell our caller which function we decided to call. */
4529 /* Build the CALL_EXPR. */
4530 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4533 /* Build a new call to operator(). This may change ARGS. */
4536 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4538 struct z_candidate
*candidates
= 0, *cand
;
4539 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4541 tree result
= NULL_TREE
;
4544 obj
= mark_lvalue_use (obj
);
4546 if (error_operand_p (obj
))
4547 return error_mark_node
;
4549 tree type
= TREE_TYPE (obj
);
4551 obj
= prep_operand (obj
);
4553 if (TYPE_PTRMEMFUNC_P (type
))
4555 if (complain
& tf_error
)
4556 /* It's no good looking for an overloaded operator() on a
4557 pointer-to-member-function. */
4558 error ("pointer-to-member function %qE cannot be called without "
4559 "an object; consider using %<.*%> or %<->*%>", obj
);
4560 return error_mark_node
;
4563 if (TYPE_BINFO (type
))
4565 fns
= lookup_fnfields (TYPE_BINFO (type
), call_op_identifier
, 1);
4566 if (fns
== error_mark_node
)
4567 return error_mark_node
;
4572 if (args
!= NULL
&& *args
!= NULL
)
4574 *args
= resolve_args (*args
, complain
);
4576 return error_mark_node
;
4579 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4580 p
= conversion_obstack_alloc (0);
4584 first_mem_arg
= obj
;
4586 add_candidates (BASELINK_FUNCTIONS (fns
),
4587 first_mem_arg
, *args
, NULL_TREE
,
4589 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4590 LOOKUP_NORMAL
, &candidates
, complain
);
4593 convs
= lookup_conversions (type
);
4595 for (; convs
; convs
= TREE_CHAIN (convs
))
4597 tree totype
= TREE_TYPE (convs
);
4599 if (TYPE_PTRFN_P (totype
)
4600 || TYPE_REFFN_P (totype
)
4601 || (TYPE_REF_P (totype
)
4602 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4603 for (ovl_iterator
iter (TREE_VALUE (convs
)); iter
; ++iter
)
4607 if (DECL_NONCONVERTING_P (fn
))
4610 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4611 add_template_conv_candidate
4612 (&candidates
, fn
, obj
, *args
, totype
,
4613 /*access_path=*/NULL_TREE
,
4614 /*conversion_path=*/NULL_TREE
, complain
);
4616 add_conv_candidate (&candidates
, fn
, obj
,
4617 *args
, /*conversion_path=*/NULL_TREE
,
4618 /*access_path=*/NULL_TREE
, complain
);
4622 /* Be strict here because if we choose a bad conversion candidate, the
4623 errors we get won't mention the call context. */
4624 candidates
= splice_viable (candidates
, true, &any_viable_p
);
4627 if (complain
& tf_error
)
4629 auto_diagnostic_group d
;
4630 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4631 build_tree_list_vec (*args
));
4632 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4634 result
= error_mark_node
;
4638 cand
= tourney (candidates
, complain
);
4641 if (complain
& tf_error
)
4643 auto_diagnostic_group d
;
4644 error ("call of %<(%T) (%A)%> is ambiguous",
4645 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4646 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4648 result
= error_mark_node
;
4650 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4651 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
)
4652 && DECL_OVERLOADED_OPERATOR_IS (cand
->fn
, CALL_EXPR
))
4653 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4656 if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
4657 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
,
4661 gcc_checking_assert (TYPE_P (cand
->fn
));
4662 obj
= convert_like (cand
->convs
[0], obj
, complain
);
4664 obj
= convert_from_reference (obj
);
4665 result
= cp_build_function_call_vec (obj
, args
, complain
);
4669 /* Free all the conversions we allocated. */
4670 obstack_free (&conversion_obstack
, p
);
4675 /* Wrapper for above. */
4678 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4681 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4682 ret
= build_op_call_1 (obj
, args
, complain
);
4683 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4687 /* Called by op_error to prepare format strings suitable for the error
4688 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4689 and a suffix (controlled by NTYPES). */
4692 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4696 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4697 : G_("no match for "), errmsg
, NULL
);
4700 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4701 else if (ntypes
== 2)
4702 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4704 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4710 op_error (location_t loc
, enum tree_code code
, enum tree_code code2
,
4711 tree arg1
, tree arg2
, tree arg3
, bool match
)
4713 bool assop
= code
== MODIFY_EXPR
;
4714 const char *opname
= OVL_OP_INFO (assop
, assop
? code2
: code
)->name
;
4719 if (flag_diagnostics_show_caret
)
4720 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4722 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4724 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4725 "in %<%E ? %E : %E%>"), 3, match
),
4727 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4730 case POSTINCREMENT_EXPR
:
4731 case POSTDECREMENT_EXPR
:
4732 if (flag_diagnostics_show_caret
)
4733 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4734 opname
, TREE_TYPE (arg1
));
4736 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4738 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4742 if (flag_diagnostics_show_caret
)
4743 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4744 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4746 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4748 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4753 if (flag_diagnostics_show_caret
)
4754 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4755 opname
, TREE_TYPE (arg1
));
4757 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4758 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4763 if (flag_diagnostics_show_caret
)
4764 error_at (loc
, op_error_string (G_("%<operator%s%>"), 2, match
),
4765 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4767 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4769 opname
, arg1
, opname
, arg2
,
4770 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4772 if (flag_diagnostics_show_caret
)
4773 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4774 opname
, TREE_TYPE (arg1
));
4776 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4778 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4783 /* Return the implicit conversion sequence that could be used to
4784 convert E1 to E2 in [expr.cond]. */
4787 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4789 tree t1
= non_reference (TREE_TYPE (e1
));
4790 tree t2
= non_reference (TREE_TYPE (e2
));
4796 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4797 implicitly converted (clause _conv_) to the type "lvalue reference to
4798 T2", subject to the constraint that in the conversion the
4799 reference must bind directly (_dcl.init.ref_) to an lvalue.
4801 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4802 implicitly converted to the type "rvalue reference to T2", subject to
4803 the constraint that the reference must bind directly. */
4806 tree rtype
= cp_build_reference_type (t2
, !lvalue_p (e2
));
4807 conv
= implicit_conversion (rtype
,
4811 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4812 |LOOKUP_ONLYCONVERTING
,
4814 if (conv
&& !conv
->bad_p
)
4818 /* If E2 is a prvalue or if neither of the conversions above can be done
4819 and at least one of the operands has (possibly cv-qualified) class
4821 if (!CLASS_TYPE_P (t1
) && !CLASS_TYPE_P (t2
))
4826 If E1 and E2 have class type, and the underlying class types are
4827 the same or one is a base class of the other: E1 can be converted
4828 to match E2 if the class of T2 is the same type as, or a base
4829 class of, the class of T1, and the cv-qualification of T2 is the
4830 same cv-qualification as, or a greater cv-qualification than, the
4831 cv-qualification of T1. If the conversion is applied, E1 is
4832 changed to an rvalue of type T2 that still refers to the original
4833 source class object (or the appropriate subobject thereof). */
4834 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4835 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4837 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4839 conv
= build_identity_conv (t1
, e1
);
4840 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4841 TYPE_MAIN_VARIANT (t2
)))
4842 conv
= build_conv (ck_base
, t2
, conv
);
4844 conv
= build_conv (ck_rvalue
, t2
, conv
);
4853 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4854 converted to the type that expression E2 would have if E2 were
4855 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4856 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4857 LOOKUP_IMPLICIT
, complain
);
4860 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4861 arguments to the conditional expression. */
4864 build_conditional_expr_1 (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
4865 tsubst_flags_t complain
)
4869 tree result
= NULL_TREE
;
4870 tree result_type
= NULL_TREE
;
4871 bool is_glvalue
= true;
4872 struct z_candidate
*candidates
= 0;
4873 struct z_candidate
*cand
;
4875 tree orig_arg2
, orig_arg3
;
4877 /* As a G++ extension, the second argument to the conditional can be
4878 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4879 c'.) If the second operand is omitted, make sure it is
4880 calculated only once. */
4883 if (complain
& tf_error
)
4884 pedwarn (loc
, OPT_Wpedantic
,
4885 "ISO C++ forbids omitting the middle term of a ?: expression");
4887 if ((complain
& tf_warning
) && !truth_value_p (TREE_CODE (arg1
)))
4888 warn_for_omitted_condop (loc
, arg1
);
4890 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4891 if (lvalue_p (arg1
))
4892 arg2
= arg1
= cp_stabilize_reference (arg1
);
4894 arg2
= arg1
= cp_save_expr (arg1
);
4897 /* If something has already gone wrong, just pass that fact up the
4899 if (error_operand_p (arg1
)
4900 || error_operand_p (arg2
)
4901 || error_operand_p (arg3
))
4902 return error_mark_node
;
4907 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
4909 tree arg1_type
= TREE_TYPE (arg1
);
4911 /* If arg1 is another cond_expr choosing between -1 and 0,
4912 then we can use its comparison. It may help to avoid
4913 additional comparison, produce more accurate diagnostics
4914 and enables folding. */
4915 if (TREE_CODE (arg1
) == VEC_COND_EXPR
4916 && integer_minus_onep (TREE_OPERAND (arg1
, 1))
4917 && integer_zerop (TREE_OPERAND (arg1
, 2)))
4918 arg1
= TREE_OPERAND (arg1
, 0);
4920 arg1
= force_rvalue (arg1
, complain
);
4921 arg2
= force_rvalue (arg2
, complain
);
4922 arg3
= force_rvalue (arg3
, complain
);
4924 /* force_rvalue can return error_mark on valid arguments. */
4925 if (error_operand_p (arg1
)
4926 || error_operand_p (arg2
)
4927 || error_operand_p (arg3
))
4928 return error_mark_node
;
4930 arg2_type
= TREE_TYPE (arg2
);
4931 arg3_type
= TREE_TYPE (arg3
);
4933 if (!VECTOR_TYPE_P (arg2_type
)
4934 && !VECTOR_TYPE_P (arg3_type
))
4936 /* Rely on the error messages of the scalar version. */
4937 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
4938 orig_arg2
, orig_arg3
, complain
);
4939 if (scal
== error_mark_node
)
4940 return error_mark_node
;
4941 tree stype
= TREE_TYPE (scal
);
4942 tree ctype
= TREE_TYPE (arg1_type
);
4943 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
4944 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
4946 if (complain
& tf_error
)
4947 error_at (loc
, "inferred scalar type %qT is not an integer or "
4948 "floating point type of the same size as %qT", stype
,
4949 COMPARISON_CLASS_P (arg1
)
4950 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
4952 return error_mark_node
;
4955 tree vtype
= build_opaque_vector_type (stype
,
4956 TYPE_VECTOR_SUBPARTS (arg1_type
));
4957 /* We could pass complain & tf_warning to unsafe_conversion_p,
4958 but the warnings (like Wsign-conversion) have already been
4959 given by the scalar build_conditional_expr_1. We still check
4960 unsafe_conversion_p to forbid truncating long long -> float. */
4961 if (unsafe_conversion_p (loc
, stype
, arg2
, NULL_TREE
, false))
4963 if (complain
& tf_error
)
4964 error_at (loc
, "conversion of scalar %qH to vector %qI "
4965 "involves truncation", arg2_type
, vtype
);
4966 return error_mark_node
;
4968 if (unsafe_conversion_p (loc
, stype
, arg3
, NULL_TREE
, false))
4970 if (complain
& tf_error
)
4971 error_at (loc
, "conversion of scalar %qH to vector %qI "
4972 "involves truncation", arg3_type
, vtype
);
4973 return error_mark_node
;
4976 arg2
= cp_convert (stype
, arg2
, complain
);
4977 arg2
= save_expr (arg2
);
4978 arg2
= build_vector_from_val (vtype
, arg2
);
4980 arg3
= cp_convert (stype
, arg3
, complain
);
4981 arg3
= save_expr (arg3
);
4982 arg3
= build_vector_from_val (vtype
, arg3
);
4986 if (VECTOR_TYPE_P (arg2_type
) != VECTOR_TYPE_P (arg3_type
))
4988 enum stv_conv convert_flag
=
4989 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
4990 complain
& tf_error
);
4992 switch (convert_flag
)
4995 return error_mark_node
;
4998 arg2
= save_expr (arg2
);
4999 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
5000 arg2
= build_vector_from_val (arg3_type
, arg2
);
5001 arg2_type
= TREE_TYPE (arg2
);
5006 arg3
= save_expr (arg3
);
5007 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
5008 arg3
= build_vector_from_val (arg2_type
, arg3
);
5009 arg3_type
= TREE_TYPE (arg3
);
5017 if (!same_type_p (arg2_type
, arg3_type
)
5018 || maybe_ne (TYPE_VECTOR_SUBPARTS (arg1_type
),
5019 TYPE_VECTOR_SUBPARTS (arg2_type
))
5020 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
5022 if (complain
& tf_error
)
5024 "incompatible vector types in conditional expression: "
5025 "%qT, %qT and %qT", TREE_TYPE (arg1
),
5026 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
5027 return error_mark_node
;
5030 if (!COMPARISON_CLASS_P (arg1
))
5032 tree cmp_type
= build_same_sized_truth_vector_type (arg1_type
);
5033 arg1
= build2 (NE_EXPR
, cmp_type
, arg1
, build_zero_cst (arg1_type
));
5035 return build3_loc (loc
, VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
5040 The first expression is implicitly converted to bool (clause
5042 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
5044 if (error_operand_p (arg1
))
5045 return error_mark_node
;
5049 If either the second or the third operand has type (possibly
5050 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
5051 array-to-pointer (_conv.array_), and function-to-pointer
5052 (_conv.func_) standard conversions are performed on the second
5053 and third operands. */
5054 arg2_type
= unlowered_expr_type (arg2
);
5055 arg3_type
= unlowered_expr_type (arg3
);
5056 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
5060 One of the following shall hold:
5062 --The second or the third operand (but not both) is a
5063 throw-expression (_except.throw_); the result is of the type
5064 and value category of the other.
5066 --Both the second and the third operands have type void; the
5067 result is of type void and is a prvalue. */
5068 if (TREE_CODE (arg2
) == THROW_EXPR
5069 && TREE_CODE (arg3
) != THROW_EXPR
)
5071 result_type
= arg3_type
;
5072 is_glvalue
= glvalue_p (arg3
);
5074 else if (TREE_CODE (arg2
) != THROW_EXPR
5075 && TREE_CODE (arg3
) == THROW_EXPR
)
5077 result_type
= arg2_type
;
5078 is_glvalue
= glvalue_p (arg2
);
5080 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
5082 result_type
= void_type_node
;
5087 if (complain
& tf_error
)
5089 if (VOID_TYPE_P (arg2_type
))
5090 error_at (cp_expr_loc_or_loc (arg3
, loc
),
5091 "second operand to the conditional operator "
5092 "is of type %<void%>, but the third operand is "
5093 "neither a throw-expression nor of type %<void%>");
5095 error_at (cp_expr_loc_or_loc (arg2
, loc
),
5096 "third operand to the conditional operator "
5097 "is of type %<void%>, but the second operand is "
5098 "neither a throw-expression nor of type %<void%>");
5100 return error_mark_node
;
5103 goto valid_operands
;
5107 Otherwise, if the second and third operand have different types,
5108 and either has (possibly cv-qualified) class type, or if both are
5109 glvalues of the same value category and the same type except for
5110 cv-qualification, an attempt is made to convert each of those operands
5111 to the type of the other. */
5112 else if (!same_type_p (arg2_type
, arg3_type
)
5113 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)
5114 || (same_type_ignoring_top_level_qualifiers_p (arg2_type
,
5116 && glvalue_p (arg2
) && glvalue_p (arg3
)
5117 && lvalue_p (arg2
) == lvalue_p (arg3
))))
5121 bool converted
= false;
5123 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5124 p
= conversion_obstack_alloc (0);
5126 conv2
= conditional_conversion (arg2
, arg3
, complain
);
5127 conv3
= conditional_conversion (arg3
, arg2
, complain
);
5131 If both can be converted, or one can be converted but the
5132 conversion is ambiguous, the program is ill-formed. If
5133 neither can be converted, the operands are left unchanged and
5134 further checking is performed as described below. If exactly
5135 one conversion is possible, that conversion is applied to the
5136 chosen operand and the converted operand is used in place of
5137 the original operand for the remainder of this section. */
5138 if ((conv2
&& !conv2
->bad_p
5139 && conv3
&& !conv3
->bad_p
)
5140 || (conv2
&& conv2
->kind
== ck_ambig
)
5141 || (conv3
&& conv3
->kind
== ck_ambig
))
5143 if (complain
& tf_error
)
5145 error_at (loc
, "operands to ?: have different types %qT and %qT",
5146 arg2_type
, arg3_type
);
5147 if (conv2
&& !conv2
->bad_p
&& conv3
&& !conv3
->bad_p
)
5148 inform (loc
, " and each type can be converted to the other");
5149 else if (conv2
&& conv2
->kind
== ck_ambig
)
5150 convert_like (conv2
, arg2
, complain
);
5152 convert_like (conv3
, arg3
, complain
);
5154 result
= error_mark_node
;
5156 else if (conv2
&& !conv2
->bad_p
)
5158 arg2
= convert_like (conv2
, arg2
, complain
);
5159 arg2
= convert_from_reference (arg2
);
5160 arg2_type
= TREE_TYPE (arg2
);
5161 /* Even if CONV2 is a valid conversion, the result of the
5162 conversion may be invalid. For example, if ARG3 has type
5163 "volatile X", and X does not have a copy constructor
5164 accepting a "volatile X&", then even if ARG2 can be
5165 converted to X, the conversion will fail. */
5166 if (error_operand_p (arg2
))
5167 result
= error_mark_node
;
5170 else if (conv3
&& !conv3
->bad_p
)
5172 arg3
= convert_like (conv3
, arg3
, complain
);
5173 arg3
= convert_from_reference (arg3
);
5174 arg3_type
= TREE_TYPE (arg3
);
5175 if (error_operand_p (arg3
))
5176 result
= error_mark_node
;
5180 /* Free all the conversions we allocated. */
5181 obstack_free (&conversion_obstack
, p
);
5186 /* If, after the conversion, both operands have class type,
5187 treat the cv-qualification of both operands as if it were the
5188 union of the cv-qualification of the operands.
5190 The standard is not clear about what to do in this
5191 circumstance. For example, if the first operand has type
5192 "const X" and the second operand has a user-defined
5193 conversion to "volatile X", what is the type of the second
5194 operand after this step? Making it be "const X" (matching
5195 the first operand) seems wrong, as that discards the
5196 qualification without actually performing a copy. Leaving it
5197 as "volatile X" seems wrong as that will result in the
5198 conditional expression failing altogether, even though,
5199 according to this step, the one operand could be converted to
5200 the type of the other. */
5202 && CLASS_TYPE_P (arg2_type
)
5203 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
5204 arg2_type
= arg3_type
=
5205 cp_build_qualified_type (arg2_type
,
5206 cp_type_quals (arg2_type
)
5207 | cp_type_quals (arg3_type
));
5212 If the second and third operands are glvalues of the same value
5213 category and have the same type, the result is of that type and
5215 if (((lvalue_p (arg2
) && lvalue_p (arg3
))
5216 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
5217 && same_type_p (arg2_type
, arg3_type
))
5219 result_type
= arg2_type
;
5220 arg2
= mark_lvalue_use (arg2
);
5221 arg3
= mark_lvalue_use (arg3
);
5222 goto valid_operands
;
5227 Otherwise, the result is an rvalue. If the second and third
5228 operand do not have the same type, and either has (possibly
5229 cv-qualified) class type, overload resolution is used to
5230 determine the conversions (if any) to be applied to the operands
5231 (_over.match.oper_, _over.built_). */
5233 if (!same_type_p (arg2_type
, arg3_type
)
5234 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
5240 /* Rearrange the arguments so that add_builtin_candidate only has
5241 to know about two args. In build_builtin_candidate, the
5242 arguments are unscrambled. */
5246 add_builtin_candidates (&candidates
,
5249 ovl_op_identifier (false, COND_EXPR
),
5251 LOOKUP_NORMAL
, complain
);
5255 If the overload resolution fails, the program is
5257 candidates
= splice_viable (candidates
, false, &any_viable_p
);
5260 if (complain
& tf_error
)
5261 error_at (loc
, "operands to ?: have different types %qT and %qT",
5262 arg2_type
, arg3_type
);
5263 return error_mark_node
;
5265 cand
= tourney (candidates
, complain
);
5268 if (complain
& tf_error
)
5270 auto_diagnostic_group d
;
5271 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
5272 print_z_candidates (loc
, candidates
);
5274 return error_mark_node
;
5279 Otherwise, the conversions thus determined are applied, and
5280 the converted operands are used in place of the original
5281 operands for the remainder of this section. */
5282 conv
= cand
->convs
[0];
5283 arg1
= convert_like (conv
, arg1
, complain
);
5284 conv
= cand
->convs
[1];
5285 arg2
= convert_like (conv
, arg2
, complain
);
5286 arg2_type
= TREE_TYPE (arg2
);
5287 conv
= cand
->convs
[2];
5288 arg3
= convert_like (conv
, arg3
, complain
);
5289 arg3_type
= TREE_TYPE (arg3
);
5294 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5295 and function-to-pointer (_conv.func_) standard conversions are
5296 performed on the second and third operands.
5298 We need to force the lvalue-to-rvalue conversion here for class types,
5299 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5300 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5303 arg2
= force_rvalue (arg2
, complain
);
5304 if (!CLASS_TYPE_P (arg2_type
))
5305 arg2_type
= TREE_TYPE (arg2
);
5307 arg3
= force_rvalue (arg3
, complain
);
5308 if (!CLASS_TYPE_P (arg3_type
))
5309 arg3_type
= TREE_TYPE (arg3
);
5311 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5312 return error_mark_node
;
5316 After those conversions, one of the following shall hold:
5318 --The second and third operands have the same type; the result is of
5320 if (same_type_p (arg2_type
, arg3_type
))
5321 result_type
= arg2_type
;
5324 --The second and third operands have arithmetic or enumeration
5325 type; the usual arithmetic conversions are performed to bring
5326 them to a common type, and the result is of that type. */
5327 else if ((ARITHMETIC_TYPE_P (arg2_type
)
5328 || UNSCOPED_ENUM_P (arg2_type
))
5329 && (ARITHMETIC_TYPE_P (arg3_type
)
5330 || UNSCOPED_ENUM_P (arg3_type
)))
5332 /* In this case, there is always a common type. */
5333 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
5335 if (complain
& tf_warning
)
5336 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
5337 "implicit conversion from %qH to %qI to "
5338 "match other result of conditional",
5341 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5342 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
5344 if (TREE_CODE (orig_arg2
) == CONST_DECL
5345 && TREE_CODE (orig_arg3
) == CONST_DECL
5346 && DECL_CONTEXT (orig_arg2
) == DECL_CONTEXT (orig_arg3
))
5347 /* Two enumerators from the same enumeration can have different
5348 types when the enumeration is still being defined. */;
5349 else if (complain
& tf_warning
)
5350 warning_at (loc
, OPT_Wenum_compare
, "enumeral mismatch in "
5351 "conditional expression: %qT vs %qT",
5352 arg2_type
, arg3_type
);
5354 else if (extra_warnings
5355 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5356 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
5357 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
5358 && !same_type_p (arg2_type
,
5359 type_promotes_to (arg3_type
)))))
5361 if (complain
& tf_warning
)
5362 warning_at (loc
, OPT_Wextra
, "enumeral and non-enumeral type in "
5363 "conditional expression");
5366 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5367 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5371 --The second and third operands have pointer type, or one has
5372 pointer type and the other is a null pointer constant; pointer
5373 conversions (_conv.ptr_) and qualification conversions
5374 (_conv.qual_) are performed to bring them to their composite
5375 pointer type (_expr.rel_). The result is of the composite
5378 --The second and third operands have pointer to member type, or
5379 one has pointer to member type and the other is a null pointer
5380 constant; pointer to member conversions (_conv.mem_) and
5381 qualification conversions (_conv.qual_) are performed to bring
5382 them to a common type, whose cv-qualification shall match the
5383 cv-qualification of either the second or the third operand.
5384 The result is of the common type. */
5385 else if ((null_ptr_cst_p (arg2
)
5386 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
5387 || (null_ptr_cst_p (arg3
)
5388 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
5389 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
5390 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
5391 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
5393 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
5394 arg3
, CPO_CONDITIONAL_EXPR
,
5396 if (result_type
== error_mark_node
)
5397 return error_mark_node
;
5398 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5399 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5404 if (complain
& tf_error
)
5405 error_at (loc
, "operands to ?: have different types %qT and %qT",
5406 arg2_type
, arg3_type
);
5407 return error_mark_node
;
5410 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5411 return error_mark_node
;
5414 if (processing_template_decl
&& is_glvalue
)
5416 /* Let lvalue_kind know this was a glvalue. */
5417 tree arg
= (result_type
== arg2_type
? arg2
: arg3
);
5418 result_type
= cp_build_reference_type (result_type
, xvalue_p (arg
));
5421 result
= build3_loc (loc
, COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
5423 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5424 warn here, because the COND_EXPR will be turned into ARG2. */
5425 if (warn_duplicated_branches
5426 && (complain
& tf_warning
)
5427 && (arg2
== arg3
|| operand_equal_p (arg2
, arg3
, 0)))
5428 warning_at (EXPR_LOCATION (result
), OPT_Wduplicated_branches
,
5429 "this condition has identical branches");
5431 /* We can't use result_type below, as fold might have returned a
5436 /* Expand both sides into the same slot, hopefully the target of
5437 the ?: expression. We used to check for TARGET_EXPRs here,
5438 but now we sometimes wrap them in NOP_EXPRs so the test would
5440 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5441 result
= get_target_expr_sfinae (result
, complain
);
5442 /* If this expression is an rvalue, but might be mistaken for an
5443 lvalue, we must add a NON_LVALUE_EXPR. */
5444 result
= rvalue (result
);
5447 result
= force_paren_expr (result
);
5452 /* Wrapper for above. */
5455 build_conditional_expr (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
5456 tsubst_flags_t complain
)
5459 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5460 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5461 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5465 /* OPERAND is an operand to an expression. Perform necessary steps
5466 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5470 prep_operand (tree operand
)
5474 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5475 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5476 /* Make sure the template type is instantiated now. */
5477 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5483 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5484 OVERLOAD) to the CANDIDATES, returning an updated list of
5485 CANDIDATES. The ARGS are the arguments provided to the call;
5486 if FIRST_ARG is non-null it is the implicit object argument,
5487 otherwise the first element of ARGS is used if needed. The
5488 EXPLICIT_TARGS are explicit template arguments provided.
5489 TEMPLATE_ONLY is true if only template functions should be
5490 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5491 add_function_candidate. */
5494 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5496 tree explicit_targs
, bool template_only
,
5497 tree conversion_path
, tree access_path
,
5499 struct z_candidate
**candidates
,
5500 tsubst_flags_t complain
)
5503 const vec
<tree
, va_gc
> *non_static_args
;
5504 bool check_list_ctor
= false;
5505 bool check_converting
= false;
5506 unification_kind_t strict
;
5511 /* Precalculate special handling of constructors and conversion ops. */
5512 tree fn
= OVL_FIRST (fns
);
5513 if (DECL_CONV_FN_P (fn
))
5515 check_list_ctor
= false;
5516 check_converting
= (flags
& LOOKUP_ONLYCONVERTING
) != 0;
5517 if (flags
& LOOKUP_NO_CONVERSION
)
5518 /* We're doing return_type(x). */
5519 strict
= DEDUCE_CONV
;
5521 /* We're doing x.operator return_type(). */
5522 strict
= DEDUCE_EXACT
;
5523 /* [over.match.funcs] For conversion functions, the function
5524 is considered to be a member of the class of the implicit
5525 object argument for the purpose of defining the type of
5526 the implicit object parameter. */
5527 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5531 if (DECL_CONSTRUCTOR_P (fn
))
5533 check_list_ctor
= (flags
& LOOKUP_LIST_ONLY
) != 0;
5534 /* For list-initialization we consider explicit constructors
5535 and complain if one is chosen. */
5537 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5538 == LOOKUP_ONLYCONVERTING
);
5540 strict
= DEDUCE_CALL
;
5541 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5545 non_static_args
= args
;
5547 /* Delay creating the implicit this parameter until it is needed. */
5548 non_static_args
= NULL
;
5550 for (lkp_iterator
iter (fns
); iter
; ++iter
)
5554 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5556 if (check_list_ctor
&& !is_list_ctor (fn
))
5559 tree fn_first_arg
= NULL_TREE
;
5560 const vec
<tree
, va_gc
> *fn_args
= args
;
5562 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5564 /* Figure out where the object arg comes from. If this
5565 function is a non-static member and we didn't get an
5566 implicit object argument, move it out of args. */
5567 if (first_arg
== NULL_TREE
)
5571 vec
<tree
, va_gc
> *tempvec
;
5572 vec_alloc (tempvec
, args
->length () - 1);
5573 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5574 tempvec
->quick_push (arg
);
5575 non_static_args
= tempvec
;
5576 first_arg
= (*args
)[0];
5579 fn_first_arg
= first_arg
;
5580 fn_args
= non_static_args
;
5583 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5584 add_template_candidate (candidates
,
5596 else if (!template_only
)
5597 add_function_candidate (candidates
,
5610 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5611 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5614 op_is_ordered (tree_code code
)
5620 return (flag_strong_eval_order
> 1 ? -1 : 0);
5624 return (flag_strong_eval_order
> 1 ? 1 : 0);
5627 // Not overloadable (yet).
5629 // Only one argument.
5636 return (flag_strong_eval_order
? 1 : 0);
5644 build_new_op_1 (location_t loc
, enum tree_code code
, int flags
, tree arg1
,
5645 tree arg2
, tree arg3
, tree
*overload
, tsubst_flags_t complain
)
5647 struct z_candidate
*candidates
= 0, *cand
;
5648 vec
<tree
, va_gc
> *arglist
;
5650 tree result
= NULL_TREE
;
5651 bool result_valid_p
= false;
5652 enum tree_code code2
= NOP_EXPR
;
5653 enum tree_code code_orig_arg1
= ERROR_MARK
;
5654 enum tree_code code_orig_arg2
= ERROR_MARK
;
5660 if (error_operand_p (arg1
)
5661 || error_operand_p (arg2
)
5662 || error_operand_p (arg3
))
5663 return error_mark_node
;
5665 bool ismodop
= code
== MODIFY_EXPR
;
5668 code2
= TREE_CODE (arg3
);
5671 tree fnname
= ovl_op_identifier (ismodop
, ismodop
? code2
: code
);
5673 arg1
= prep_operand (arg1
);
5675 bool memonly
= false;
5680 case VEC_DELETE_EXPR
:
5682 /* Use build_op_new_call and build_op_delete_call instead. */
5686 /* Use build_op_call instead. */
5689 case TRUTH_ORIF_EXPR
:
5690 case TRUTH_ANDIF_EXPR
:
5691 case TRUTH_AND_EXPR
:
5693 /* These are saved for the sake of warn_logical_operator. */
5694 code_orig_arg1
= TREE_CODE (arg1
);
5695 code_orig_arg2
= TREE_CODE (arg2
);
5703 /* These are saved for the sake of maybe_warn_bool_compare. */
5704 code_orig_arg1
= TREE_CODE (TREE_TYPE (arg1
));
5705 code_orig_arg2
= TREE_CODE (TREE_TYPE (arg2
));
5708 /* =, ->, [], () must be non-static member functions. */
5710 if (code2
!= NOP_EXPR
)
5722 arg2
= prep_operand (arg2
);
5723 arg3
= prep_operand (arg3
);
5725 if (code
== COND_EXPR
)
5726 /* Use build_conditional_expr instead. */
5728 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5729 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5732 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5733 arg2
= integer_zero_node
;
5735 vec_alloc (arglist
, 3);
5736 arglist
->quick_push (arg1
);
5737 if (arg2
!= NULL_TREE
)
5738 arglist
->quick_push (arg2
);
5739 if (arg3
!= NULL_TREE
)
5740 arglist
->quick_push (arg3
);
5742 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5743 p
= conversion_obstack_alloc (0);
5745 /* Add namespace-scope operators to the list of functions to
5749 tree fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/true, 0, 0);
5750 fns
= lookup_arg_dependent (fnname
, fns
, arglist
);
5751 add_candidates (fns
, NULL_TREE
, arglist
, NULL_TREE
,
5752 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5753 flags
, &candidates
, complain
);
5758 args
[2] = NULL_TREE
;
5760 /* Add class-member operators to the candidate set. */
5761 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5765 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5766 if (fns
== error_mark_node
)
5768 result
= error_mark_node
;
5769 goto user_defined_result_ready
;
5772 add_candidates (BASELINK_FUNCTIONS (fns
),
5773 NULL_TREE
, arglist
, NULL_TREE
,
5775 BASELINK_BINFO (fns
),
5776 BASELINK_ACCESS_BINFO (fns
),
5777 flags
, &candidates
, complain
);
5779 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5780 only non-member functions that have type T1 or reference to
5781 cv-qualified-opt T1 for the first argument, if the first argument
5782 has an enumeration type, or T2 or reference to cv-qualified-opt
5783 T2 for the second argument, if the second argument has an
5784 enumeration type. Filter out those that don't match. */
5785 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5787 struct z_candidate
**candp
, **next
;
5789 for (candp
= &candidates
; *candp
; candp
= next
)
5791 tree parmlist
, parmtype
;
5792 int i
, nargs
= (arg2
? 2 : 1);
5797 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5799 for (i
= 0; i
< nargs
; ++i
)
5801 parmtype
= TREE_VALUE (parmlist
);
5803 if (TYPE_REF_P (parmtype
))
5804 parmtype
= TREE_TYPE (parmtype
);
5805 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5806 && (same_type_ignoring_top_level_qualifiers_p
5807 (TREE_TYPE (args
[i
]), parmtype
)))
5810 parmlist
= TREE_CHAIN (parmlist
);
5813 /* No argument has an appropriate type, so remove this
5814 candidate function from the list. */
5817 *candp
= cand
->next
;
5823 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5830 /* For these, the built-in candidates set is empty
5831 [over.match.oper]/3. We don't want non-strict matches
5832 because exact matches are always possible with built-in
5833 operators. The built-in candidate set for COMPONENT_REF
5834 would be empty too, but since there are no such built-in
5835 operators, we accept non-strict matches for them. */
5844 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5849 case POSTINCREMENT_EXPR
:
5850 case POSTDECREMENT_EXPR
:
5851 /* Don't try anything fancy if we're not allowed to produce
5853 if (!(complain
& tf_error
))
5854 return error_mark_node
;
5856 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5857 distinguish between prefix and postfix ++ and
5858 operator++() was used for both, so we allow this with
5862 const char *msg
= (flag_permissive
)
5863 ? G_("no %<%D(int)%> declared for postfix %qs,"
5864 " trying prefix operator instead")
5865 : G_("no %<%D(int)%> declared for postfix %qs");
5866 permerror (loc
, msg
, fnname
, OVL_OP_INFO (false, code
)->name
);
5869 if (!flag_permissive
)
5870 return error_mark_node
;
5872 if (code
== POSTINCREMENT_EXPR
)
5873 code
= PREINCREMENT_EXPR
;
5875 code
= PREDECREMENT_EXPR
;
5876 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5877 NULL_TREE
, overload
, complain
);
5880 /* The caller will deal with these. */
5885 result_valid_p
= true;
5889 if (complain
& tf_error
)
5891 /* If one of the arguments of the operator represents
5892 an invalid use of member function pointer, try to report
5893 a meaningful error ... */
5894 if (invalid_nonstatic_memfn_p (loc
, arg1
, tf_error
)
5895 || invalid_nonstatic_memfn_p (loc
, arg2
, tf_error
)
5896 || invalid_nonstatic_memfn_p (loc
, arg3
, tf_error
))
5897 /* We displayed the error message. */;
5900 /* ... Otherwise, report the more generic
5901 "no matching operator found" error */
5902 auto_diagnostic_group d
;
5903 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
5904 print_z_candidates (loc
, candidates
);
5907 result
= error_mark_node
;
5913 cand
= tourney (candidates
, complain
);
5916 if (complain
& tf_error
)
5918 auto_diagnostic_group d
;
5919 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
5920 print_z_candidates (loc
, candidates
);
5922 result
= error_mark_node
;
5924 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
5927 *overload
= cand
->fn
;
5929 if (resolve_args (arglist
, complain
) == NULL
)
5930 result
= error_mark_node
;
5932 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5934 if (trivial_fn_p (cand
->fn
))
5935 /* There won't be a CALL_EXPR. */;
5936 else if (result
&& result
!= error_mark_node
)
5938 tree call
= extract_call_expr (result
);
5939 CALL_EXPR_OPERATOR_SYNTAX (call
) = true;
5941 if (processing_template_decl
&& DECL_HIDDEN_FRIEND_P (cand
->fn
))
5942 /* This prevents build_new_function_call from discarding this
5943 function during instantiation of the enclosing template. */
5944 KOENIG_LOOKUP_P (call
) = 1;
5946 /* Specify evaluation order as per P0145R2. */
5947 CALL_EXPR_ORDERED_ARGS (call
) = false;
5948 switch (op_is_ordered (code
))
5951 CALL_EXPR_REVERSE_ARGS (call
) = true;
5955 CALL_EXPR_ORDERED_ARGS (call
) = true;
5965 /* Give any warnings we noticed during overload resolution. */
5966 if (cand
->warnings
&& (complain
& tf_warning
))
5968 struct candidate_warning
*w
;
5969 for (w
= cand
->warnings
; w
; w
= w
->next
)
5970 joust (cand
, w
->loser
, 1, complain
);
5973 /* Check for comparison of different enum types. */
5982 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
5983 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
5984 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
5985 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
5986 && (complain
& tf_warning
))
5988 warning (OPT_Wenum_compare
,
5989 "comparison between %q#T and %q#T",
5990 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
5997 /* We need to strip any leading REF_BIND so that bitfields
5998 don't cause errors. This should not remove any important
5999 conversions, because builtins don't apply to class
6000 objects directly. */
6001 conv
= cand
->convs
[0];
6002 if (conv
->kind
== ck_ref_bind
)
6003 conv
= next_conversion (conv
);
6004 arg1
= convert_like (conv
, arg1
, complain
);
6008 conv
= cand
->convs
[1];
6009 if (conv
->kind
== ck_ref_bind
)
6010 conv
= next_conversion (conv
);
6012 arg2
= decay_conversion (arg2
, complain
);
6014 /* We need to call warn_logical_operator before
6015 converting arg2 to a boolean_type, but after
6016 decaying an enumerator to its value. */
6017 if (complain
& tf_warning
)
6018 warn_logical_operator (loc
, code
, boolean_type_node
,
6019 code_orig_arg1
, arg1
,
6020 code_orig_arg2
, arg2
);
6022 arg2
= convert_like (conv
, arg2
, complain
);
6026 conv
= cand
->convs
[2];
6027 if (conv
->kind
== ck_ref_bind
)
6028 conv
= next_conversion (conv
);
6029 arg3
= convert_like (conv
, arg3
, complain
);
6035 user_defined_result_ready
:
6037 /* Free all the conversions we allocated. */
6038 obstack_free (&conversion_obstack
, p
);
6040 if (result
|| result_valid_p
)
6047 return cp_build_modify_expr (loc
, arg1
, code2
, arg2
, complain
);
6050 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
6052 case TRUTH_ANDIF_EXPR
:
6053 case TRUTH_ORIF_EXPR
:
6054 case TRUTH_AND_EXPR
:
6056 if (complain
& tf_warning
)
6057 warn_logical_operator (loc
, code
, boolean_type_node
,
6058 code_orig_arg1
, arg1
,
6059 code_orig_arg2
, arg2
);
6067 if ((complain
& tf_warning
)
6068 && ((code_orig_arg1
== BOOLEAN_TYPE
)
6069 ^ (code_orig_arg2
== BOOLEAN_TYPE
)))
6070 maybe_warn_bool_compare (loc
, code
, arg1
, arg2
);
6071 if (complain
& tf_warning
&& warn_tautological_compare
)
6072 warn_tautological_cmp (loc
, code
, arg1
, arg2
);
6077 case TRUNC_DIV_EXPR
:
6082 case TRUNC_MOD_EXPR
:
6086 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
6088 case UNARY_PLUS_EXPR
:
6091 case TRUTH_NOT_EXPR
:
6092 case PREINCREMENT_EXPR
:
6093 case POSTINCREMENT_EXPR
:
6094 case PREDECREMENT_EXPR
:
6095 case POSTDECREMENT_EXPR
:
6099 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
6102 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
6105 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
6109 /* The caller will deal with these. */
6121 /* Wrapper for above. */
6124 build_new_op (location_t loc
, enum tree_code code
, int flags
,
6125 tree arg1
, tree arg2
, tree arg3
,
6126 tree
*overload
, tsubst_flags_t complain
)
6129 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
6130 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
6131 overload
, complain
);
6132 timevar_cond_stop (TV_OVERLOAD
, subtime
);
6136 /* CALL was returned by some call-building function; extract the actual
6137 CALL_EXPR from any bits that have been tacked on, e.g. by
6138 convert_from_reference. */
6141 extract_call_expr (tree call
)
6143 while (TREE_CODE (call
) == COMPOUND_EXPR
)
6144 call
= TREE_OPERAND (call
, 1);
6145 if (REFERENCE_REF_P (call
))
6146 call
= TREE_OPERAND (call
, 0);
6147 if (TREE_CODE (call
) == TARGET_EXPR
)
6148 call
= TARGET_EXPR_INITIAL (call
);
6149 gcc_assert (TREE_CODE (call
) == CALL_EXPR
6150 || TREE_CODE (call
) == AGGR_INIT_EXPR
6151 || call
== error_mark_node
);
6155 /* Returns true if FN has two parameters, of which the second has type
6159 second_parm_is_size_t (tree fn
)
6161 tree t
= FUNCTION_ARG_CHAIN (fn
);
6162 if (!t
|| !same_type_p (TREE_VALUE (t
), size_type_node
))
6165 if (t
== void_list_node
)
6167 if (aligned_new_threshold
&& t
6168 && same_type_p (TREE_VALUE (t
), align_type_node
)
6169 && TREE_CHAIN (t
) == void_list_node
)
6174 /* True if T, an allocation function, has std::align_val_t as its second
6178 aligned_allocation_fn_p (tree t
)
6180 if (!aligned_new_threshold
)
6183 tree a
= FUNCTION_ARG_CHAIN (t
);
6184 return (a
&& same_type_p (TREE_VALUE (a
), align_type_node
));
6187 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6188 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6189 std::align_val_t. */
6192 aligned_deallocation_fn_p (tree t
)
6194 if (!aligned_new_threshold
)
6197 /* A template instance is never a usual deallocation function,
6198 regardless of its signature. */
6199 if (TREE_CODE (t
) == TEMPLATE_DECL
6200 || primary_template_specialization_p (t
))
6203 tree a
= FUNCTION_ARG_CHAIN (t
);
6204 if (same_type_p (TREE_VALUE (a
), align_type_node
)
6205 && TREE_CHAIN (a
) == void_list_node
)
6207 if (!same_type_p (TREE_VALUE (a
), size_type_node
))
6210 if (a
&& same_type_p (TREE_VALUE (a
), align_type_node
)
6211 && TREE_CHAIN (a
) == void_list_node
)
6216 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6217 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6220 usual_deallocation_fn_p (tree t
)
6222 /* A template instance is never a usual deallocation function,
6223 regardless of its signature. */
6224 if (TREE_CODE (t
) == TEMPLATE_DECL
6225 || primary_template_specialization_p (t
))
6228 /* If a class T has a member deallocation function named operator delete
6229 with exactly one parameter, then that function is a usual
6230 (non-placement) deallocation function. If class T does not declare
6231 such an operator delete but does declare a member deallocation
6232 function named operator delete with exactly two parameters, the second
6233 of which has type std::size_t (18.2), then this function is a usual
6234 deallocation function. */
6235 bool global
= DECL_NAMESPACE_SCOPE_P (t
);
6236 tree chain
= FUNCTION_ARG_CHAIN (t
);
6239 if (chain
== void_list_node
6240 || ((!global
|| flag_sized_deallocation
)
6241 && second_parm_is_size_t (t
)))
6243 if (aligned_deallocation_fn_p (t
))
6248 /* Build a call to operator delete. This has to be handled very specially,
6249 because the restrictions on what signatures match are different from all
6250 other call instances. For a normal delete, only a delete taking (void *)
6251 or (void *, size_t) is accepted. For a placement delete, only an exact
6252 match with the placement new is accepted.
6254 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6255 ADDR is the pointer to be deleted.
6256 SIZE is the size of the memory block to be deleted.
6257 GLOBAL_P is true if the delete-expression should not consider
6258 class-specific delete operators.
6259 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6261 If this call to "operator delete" is being generated as part to
6262 deallocate memory allocated via a new-expression (as per [expr.new]
6263 which requires that if the initialization throws an exception then
6264 we call a deallocation function), then ALLOC_FN is the allocation
6268 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
6269 bool global_p
, tree placement
,
6270 tree alloc_fn
, tsubst_flags_t complain
)
6272 tree fn
= NULL_TREE
;
6273 tree fns
, fnname
, type
, t
;
6275 if (addr
== error_mark_node
)
6276 return error_mark_node
;
6278 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
6280 fnname
= ovl_op_identifier (false, code
);
6282 if (CLASS_TYPE_P (type
)
6283 && COMPLETE_TYPE_P (complete_type (type
))
6287 If the result of the lookup is ambiguous or inaccessible, or if
6288 the lookup selects a placement deallocation function, the
6289 program is ill-formed.
6291 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6293 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
6294 if (fns
== error_mark_node
)
6295 return error_mark_node
;
6300 if (fns
== NULL_TREE
)
6301 fns
= lookup_name_nonclass (fnname
);
6303 /* Strip const and volatile from addr. */
6304 addr
= cp_convert (ptr_type_node
, addr
, complain
);
6308 /* "A declaration of a placement deallocation function matches the
6309 declaration of a placement allocation function if it has the same
6310 number of parameters and, after parameter transformations (8.3.5),
6311 all parameter types except the first are identical."
6313 So we build up the function type we want and ask instantiate_type
6314 to get it for us. */
6315 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
6316 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
6317 t
= build_function_type (void_type_node
, t
);
6319 fn
= instantiate_type (t
, fns
, tf_none
);
6320 if (fn
== error_mark_node
)
6323 fn
= MAYBE_BASELINK_FUNCTIONS (fn
);
6325 /* "If the lookup finds the two-parameter form of a usual deallocation
6326 function (3.7.4.2) and that function, considered as a placement
6327 deallocation function, would have been selected as a match for the
6328 allocation function, the program is ill-formed." */
6329 if (second_parm_is_size_t (fn
))
6331 const char *const msg1
6332 = G_("exception cleanup for this placement new selects "
6333 "non-placement operator delete");
6334 const char *const msg2
6335 = G_("%qD is a usual (non-placement) deallocation "
6336 "function in C++14 (or with -fsized-deallocation)");
6338 /* But if the class has an operator delete (void *), then that is
6339 the usual deallocation function, so we shouldn't complain
6340 about using the operator delete (void *, size_t). */
6341 if (DECL_CLASS_SCOPE_P (fn
))
6342 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
));
6346 if (usual_deallocation_fn_p (elt
)
6347 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
6350 /* Before C++14 a two-parameter global deallocation function is
6351 always a placement deallocation function, but warn if
6353 else if (!flag_sized_deallocation
)
6355 if (complain
& tf_warning
)
6357 auto_diagnostic_group d
;
6358 if (warning (OPT_Wc__14_compat
, msg1
))
6359 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6364 if (complain
& tf_warning_or_error
)
6366 auto_diagnostic_group d
;
6367 if (permerror (input_location
, msg1
))
6369 /* Only mention C++14 for namespace-scope delete. */
6370 if (DECL_NAMESPACE_SCOPE_P (fn
))
6371 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6373 inform (DECL_SOURCE_LOCATION (fn
),
6374 "%qD is a usual (non-placement) deallocation "
6379 return error_mark_node
;
6384 /* "Any non-placement deallocation function matches a non-placement
6385 allocation function. If the lookup finds a single matching
6386 deallocation function, that function will be called; otherwise, no
6387 deallocation function will be called." */
6388 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
)); iter
; ++iter
)
6391 if (usual_deallocation_fn_p (elt
))
6399 /* -- If the type has new-extended alignment, a function with a
6400 parameter of type std::align_val_t is preferred; otherwise a
6401 function without such a parameter is preferred. If exactly one
6402 preferred function is found, that function is selected and the
6403 selection process terminates. If more than one preferred
6404 function is found, all non-preferred functions are eliminated
6405 from further consideration. */
6406 if (aligned_new_threshold
)
6408 bool want_align
= type_has_new_extended_alignment (type
);
6409 bool fn_align
= aligned_deallocation_fn_p (fn
);
6410 bool elt_align
= aligned_deallocation_fn_p (elt
);
6412 if (elt_align
!= fn_align
)
6414 if (want_align
== elt_align
)
6420 /* -- If the deallocation functions have class scope, the one
6421 without a parameter of type std::size_t is selected. */
6423 if (DECL_CLASS_SCOPE_P (fn
))
6426 /* -- If the type is complete and if, for the second alternative
6427 (delete array) only, the operand is a pointer to a class type
6428 with a non-trivial destructor or a (possibly multi-dimensional)
6429 array thereof, the function with a parameter of type std::size_t
6432 -- Otherwise, it is unspecified whether a deallocation function
6433 with a parameter of type std::size_t is selected. */
6436 want_size
= COMPLETE_TYPE_P (type
);
6437 if (code
== VEC_DELETE_EXPR
6438 && !TYPE_VEC_NEW_USES_COOKIE (type
))
6439 /* We need a cookie to determine the array size. */
6442 bool fn_size
= second_parm_is_size_t (fn
);
6443 bool elt_size
= second_parm_is_size_t (elt
);
6444 gcc_assert (fn_size
!= elt_size
);
6445 if (want_size
== elt_size
)
6450 /* If we have a matching function, call it. */
6453 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6455 /* If the FN is a member function, make sure that it is
6457 if (BASELINK_P (fns
))
6458 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
6461 /* Core issue 901: It's ok to new a type with deleted delete. */
6462 if (DECL_DELETED_FN (fn
) && alloc_fn
)
6467 /* The placement args might not be suitable for overload
6468 resolution at this point, so build the call directly. */
6469 int nargs
= call_expr_nargs (placement
);
6470 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
6473 for (i
= 1; i
< nargs
; i
++)
6474 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
6475 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
6476 return error_mark_node
;
6477 return build_cxx_call (fn
, nargs
, argarray
, complain
);
6482 vec
<tree
, va_gc
> *args
= make_tree_vector ();
6483 args
->quick_push (addr
);
6484 if (second_parm_is_size_t (fn
))
6485 args
->quick_push (size
);
6486 if (aligned_deallocation_fn_p (fn
))
6488 tree al
= build_int_cst (align_type_node
, TYPE_ALIGN_UNIT (type
));
6489 args
->quick_push (al
);
6491 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
6492 release_tree_vector (args
);
6499 If no unambiguous matching deallocation function can be found,
6500 propagating the exception does not cause the object's memory to
6504 if ((complain
& tf_warning
)
6506 warning (0, "no corresponding deallocation function for %qD",
6511 if (complain
& tf_error
)
6512 error ("no suitable %<operator %s%> for %qT",
6513 OVL_OP_INFO (false, code
)->name
, type
);
6514 return error_mark_node
;
6517 /* If the current scope isn't allowed to access DECL along
6518 BASETYPE_PATH, give an error. The most derived class in
6519 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6520 the declaration to use in the error diagnostic. */
6523 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
6524 tsubst_flags_t complain
, access_failure_info
*afi
)
6526 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
6528 if (flag_new_inheriting_ctors
6529 && DECL_INHERITED_CTOR (decl
))
6531 /* 7.3.3/18: The additional constructors are accessible if they would be
6532 accessible when used to construct an object of the corresponding base
6534 decl
= strip_inheriting_ctors (decl
);
6535 basetype_path
= lookup_base (basetype_path
, DECL_CONTEXT (decl
),
6536 ba_any
, NULL
, complain
);
6539 if (!accessible_p (basetype_path
, decl
, true))
6541 if (complain
& tf_error
)
6543 if (flag_new_inheriting_ctors
)
6544 diag_decl
= strip_inheriting_ctors (diag_decl
);
6545 if (TREE_PRIVATE (decl
))
6547 error ("%q#D is private within this context", diag_decl
);
6548 inform (DECL_SOURCE_LOCATION (diag_decl
),
6549 "declared private here");
6551 afi
->record_access_failure (basetype_path
, diag_decl
);
6553 else if (TREE_PROTECTED (decl
))
6555 error ("%q#D is protected within this context", diag_decl
);
6556 inform (DECL_SOURCE_LOCATION (diag_decl
),
6557 "declared protected here");
6559 afi
->record_access_failure (basetype_path
, diag_decl
);
6563 error ("%q#D is inaccessible within this context", diag_decl
);
6564 inform (DECL_SOURCE_LOCATION (diag_decl
), "declared here");
6566 afi
->record_access_failure (basetype_path
, diag_decl
);
6575 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6576 bitwise or of LOOKUP_* values. If any errors are warnings are
6577 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6578 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6582 build_temp (tree expr
, tree type
, int flags
,
6583 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
6586 vec
<tree
, va_gc
> *args
;
6588 *diagnostic_kind
= DK_UNSPECIFIED
;
6590 /* If the source is a packed field, calling the copy constructor will require
6591 binding the field to the reference parameter to the copy constructor, and
6592 we'll end up with an infinite loop. If we can use a bitwise copy, then
6594 if ((lvalue_kind (expr
) & clk_packed
)
6595 && CLASS_TYPE_P (TREE_TYPE (expr
))
6596 && !type_has_nontrivial_copy_init (TREE_TYPE (expr
)))
6597 return get_target_expr_sfinae (expr
, complain
);
6599 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
6600 args
= make_tree_vector_single (expr
);
6601 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6602 &args
, type
, flags
, complain
);
6603 release_tree_vector (args
);
6604 if (warningcount
+ werrorcount
> savew
)
6605 *diagnostic_kind
= DK_WARNING
;
6606 else if (errorcount
> savee
)
6607 *diagnostic_kind
= DK_ERROR
;
6611 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6612 Also handle a subset of zero as null warnings.
6613 EXPR is implicitly converted to type TOTYPE.
6614 FN and ARGNUM are used for diagnostics. */
6617 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
6619 /* Issue warnings about peculiar, but valid, uses of NULL. */
6620 if (null_node_p (expr
) && TREE_CODE (totype
) != BOOLEAN_TYPE
6621 && ARITHMETIC_TYPE_P (totype
))
6623 source_location loc
=
6624 expansion_point_location_if_in_system_header (input_location
);
6627 warning_at (loc
, OPT_Wconversion_null
,
6628 "passing NULL to non-pointer argument %P of %qD",
6631 warning_at (loc
, OPT_Wconversion_null
,
6632 "converting to non-pointer type %qT from NULL", totype
);
6635 /* Issue warnings if "false" is converted to a NULL pointer */
6636 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
6637 && TYPE_PTR_P (totype
))
6640 warning_at (input_location
, OPT_Wconversion_null
,
6641 "converting %<false%> to pointer type for argument %P "
6642 "of %qD", argnum
, fn
);
6644 warning_at (input_location
, OPT_Wconversion_null
,
6645 "converting %<false%> to pointer type %qT", totype
);
6647 /* Handle zero as null pointer warnings for cases other
6648 than EQ_EXPR and NE_EXPR */
6649 else if (null_ptr_cst_p (expr
) &&
6650 (TYPE_PTR_OR_PTRMEM_P (totype
) || NULLPTR_TYPE_P (totype
)))
6652 source_location loc
=
6653 expansion_point_location_if_in_system_header (input_location
);
6654 maybe_warn_zero_as_null_pointer_constant (expr
, loc
);
6658 /* We gave a diagnostic during a conversion. If this was in the second
6659 standard conversion sequence of a user-defined conversion sequence, say
6660 which user-defined conversion. */
6663 maybe_print_user_conv_context (conversion
*convs
)
6665 if (convs
->user_conv_p
)
6666 for (conversion
*t
= convs
; t
; t
= next_conversion (t
))
6667 if (t
->kind
== ck_user
)
6669 print_z_candidate (0, " after user-defined conversion:",
6675 /* Locate the parameter with the given index within FNDECL.
6676 ARGNUM is zero based, -1 indicates the `this' argument of a method.
6677 Return the location of the FNDECL itself if there are problems. */
6680 get_fndecl_argument_location (tree fndecl
, int argnum
)
6685 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6686 for (i
= 0, param
= FUNCTION_FIRST_USER_PARM (fndecl
);
6687 i
< argnum
&& param
;
6688 i
++, param
= TREE_CHAIN (param
))
6691 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6692 return the location of FNDECL. */
6694 return DECL_SOURCE_LOCATION (fndecl
);
6696 return DECL_SOURCE_LOCATION (param
);
6699 /* Perform the conversions in CONVS on the expression EXPR. FN and
6700 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6701 indicates the `this' argument of a method. INNER is nonzero when
6702 being called to continue a conversion chain. It is negative when a
6703 reference binding will be applied, positive otherwise. If
6704 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6705 conversions will be emitted if appropriate. If C_CAST_P is true,
6706 this conversion is coming from a C-style cast; in that case,
6707 conversions to inaccessible bases are permitted. */
6710 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
6711 bool issue_conversion_warnings
,
6712 bool c_cast_p
, tsubst_flags_t complain
)
6714 tree totype
= convs
->type
;
6715 diagnostic_t diag_kind
;
6717 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
6719 if (convs
->bad_p
&& !(complain
& tf_error
))
6720 return error_mark_node
;
6723 && convs
->kind
!= ck_user
6724 && convs
->kind
!= ck_list
6725 && convs
->kind
!= ck_ambig
6726 && (convs
->kind
!= ck_ref_bind
6727 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
6728 && (convs
->kind
!= ck_rvalue
6729 || SCALAR_TYPE_P (totype
))
6730 && convs
->kind
!= ck_base
)
6732 bool complained
= false;
6733 conversion
*t
= convs
;
6735 /* Give a helpful error if this is bad because of excess braces. */
6736 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6737 && SCALAR_TYPE_P (totype
)
6738 && CONSTRUCTOR_NELTS (expr
) > 0
6739 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
6741 complained
= permerror (loc
, "too many braces around initializer "
6743 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6744 && CONSTRUCTOR_NELTS (expr
) == 1)
6745 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6748 /* Give a helpful error if this is bad because a conversion to bool
6749 from std::nullptr_t requires direct-initialization. */
6750 if (NULLPTR_TYPE_P (TREE_TYPE (expr
))
6751 && TREE_CODE (totype
) == BOOLEAN_TYPE
)
6752 complained
= permerror (loc
, "converting to %qH from %qI requires "
6753 "direct-initialization",
6754 totype
, TREE_TYPE (expr
));
6756 for (; t
; t
= next_conversion (t
))
6758 if (t
->kind
== ck_user
&& t
->cand
->reason
)
6760 auto_diagnostic_group d
;
6761 complained
= permerror (loc
, "invalid user-defined conversion "
6762 "from %qH to %qI", TREE_TYPE (expr
),
6765 print_z_candidate (loc
, "candidate is:", t
->cand
);
6766 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6767 /*issue_conversion_warnings=*/false,
6770 if (convs
->kind
== ck_ref_bind
)
6771 expr
= convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
6772 LOOKUP_NORMAL
, NULL_TREE
,
6775 expr
= cp_convert (totype
, expr
, complain
);
6776 if (complained
&& fn
)
6777 inform (DECL_SOURCE_LOCATION (fn
),
6778 " initializing argument %P of %qD", argnum
, fn
);
6781 else if (t
->kind
== ck_user
|| !t
->bad_p
)
6783 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6784 /*issue_conversion_warnings=*/false,
6789 else if (t
->kind
== ck_ambig
)
6790 return convert_like_real (t
, expr
, fn
, argnum
,
6791 /*issue_conversion_warnings=*/false,
6794 else if (t
->kind
== ck_identity
)
6799 range_label_for_type_mismatch
label (TREE_TYPE (expr
), totype
);
6800 gcc_rich_location
richloc (loc
, &label
);
6801 complained
= permerror (&richloc
,
6802 "invalid conversion from %qH to %qI",
6803 TREE_TYPE (expr
), totype
);
6805 if (complained
&& fn
)
6806 inform (get_fndecl_argument_location (fn
, argnum
),
6807 " initializing argument %P of %qD", argnum
, fn
);
6809 return cp_convert (totype
, expr
, complain
);
6812 if (issue_conversion_warnings
&& (complain
& tf_warning
))
6813 conversion_null_warnings (totype
, expr
, fn
, argnum
);
6815 switch (convs
->kind
)
6819 struct z_candidate
*cand
= convs
->cand
;
6822 /* We chose the surrogate function from add_conv_candidate, now we
6823 actually need to build the conversion. */
6824 cand
= build_user_type_conversion_1 (totype
, expr
,
6825 LOOKUP_NO_CONVERSION
, complain
);
6827 tree convfn
= cand
->fn
;
6829 /* When converting from an init list we consider explicit
6830 constructors, but actually trying to call one is an error. */
6831 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
6832 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
6833 /* Unless this is for direct-list-initialization. */
6834 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
)
6835 /* And in C++98 a default constructor can't be explicit. */
6836 && cxx_dialect
>= cxx11
)
6838 if (!(complain
& tf_error
))
6839 return error_mark_node
;
6840 location_t loc
= location_of (expr
);
6841 if (CONSTRUCTOR_NELTS (expr
) == 0
6842 && FUNCTION_FIRST_USER_PARMTYPE (convfn
) != void_list_node
)
6844 auto_diagnostic_group d
;
6845 if (pedwarn (loc
, 0, "converting to %qT from initializer list "
6846 "would use explicit constructor %qD",
6848 inform (loc
, "in C++11 and above a default constructor "
6852 error ("converting to %qT from initializer list would use "
6853 "explicit constructor %qD", totype
, convfn
);
6856 /* If we're initializing from {}, it's value-initialization. */
6857 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6858 && CONSTRUCTOR_NELTS (expr
) == 0
6859 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
6861 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
6862 if (abstract_virtuals_error_sfinae (NULL_TREE
, totype
, complain
))
6863 return error_mark_node
;
6864 expr
= build_value_init (totype
, complain
);
6865 expr
= get_target_expr_sfinae (expr
, complain
);
6866 if (expr
!= error_mark_node
)
6868 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6869 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
6874 expr
= mark_rvalue_use (expr
);
6876 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
6878 expr
= build_over_call (cand
, LOOKUP_NORMAL
|LOOKUP_NO_CONVERSION
,
6881 /* If this is a constructor or a function returning an aggr type,
6882 we need to build up a TARGET_EXPR. */
6883 if (DECL_CONSTRUCTOR_P (convfn
))
6885 expr
= build_cplus_new (totype
, expr
, complain
);
6887 /* Remember that this was list-initialization. */
6888 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
6889 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6895 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
6897 int nelts
= CONSTRUCTOR_NELTS (expr
);
6899 expr
= build_value_init (totype
, complain
);
6900 else if (nelts
== 1)
6901 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6905 expr
= mark_use (expr
, /*rvalue_p=*/!convs
->rvaluedness_matches_p
,
6906 /*read_p=*/true, UNKNOWN_LOCATION
,
6907 /*reject_builtin=*/true);
6909 if (type_unknown_p (expr
))
6910 expr
= instantiate_type (totype
, expr
, complain
);
6911 if (expr
== null_node
6912 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
6913 /* If __null has been converted to an integer type, we do not want to
6914 continue to warn about uses of EXPR as an integer, rather than as a
6916 expr
= build_int_cst (totype
, 0);
6919 /* We leave bad_p off ck_ambig because overload resolution considers
6920 it valid, it just fails when we try to perform it. So we need to
6921 check complain here, too. */
6922 if (complain
& tf_error
)
6924 /* Call build_user_type_conversion again for the error. */
6925 int flags
= (convs
->need_temporary_p
6926 ? LOOKUP_IMPLICIT
: LOOKUP_NORMAL
);
6927 build_user_type_conversion (totype
, convs
->u
.expr
, flags
, complain
);
6928 gcc_assert (seen_error ());
6930 inform (DECL_SOURCE_LOCATION (fn
),
6931 " initializing argument %P of %qD", argnum
, fn
);
6933 return error_mark_node
;
6937 /* Conversion to std::initializer_list<T>. */
6938 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
6939 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
6940 unsigned len
= CONSTRUCTOR_NELTS (expr
);
6941 tree array
, val
, field
;
6942 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
6945 /* Convert all the elements. */
6946 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
6948 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
6949 false, false, complain
);
6950 if (sub
== error_mark_node
)
6952 if (!BRACE_ENCLOSED_INITIALIZER_P (val
)
6953 && !check_narrowing (TREE_TYPE (sub
), val
, complain
))
6954 return error_mark_node
;
6955 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
6956 if (!TREE_CONSTANT (sub
))
6957 TREE_CONSTANT (new_ctor
) = false;
6959 /* Build up the array. */
6960 elttype
= cp_build_qualified_type
6961 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
6962 array
= build_array_of_n_type (elttype
, len
);
6963 array
= finish_compound_literal (array
, new_ctor
, complain
);
6964 /* Take the address explicitly rather than via decay_conversion
6965 to avoid the error about taking the address of a temporary. */
6966 array
= cp_build_addr_expr (array
, complain
);
6967 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
6968 if (array
== error_mark_node
)
6969 return error_mark_node
;
6971 /* Build up the initializer_list object. Note: fail gracefully
6972 if the object cannot be completed because, for example, no
6973 definition is provided (c++/80956). */
6974 totype
= complete_type_or_maybe_complain (totype
, NULL_TREE
, complain
);
6976 return error_mark_node
;
6977 field
= next_initializable_field (TYPE_FIELDS (totype
));
6978 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
6979 field
= next_initializable_field (DECL_CHAIN (field
));
6980 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
6981 new_ctor
= build_constructor (totype
, vec
);
6982 return get_target_expr_sfinae (new_ctor
, complain
);
6986 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
6988 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6989 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
6990 real
= perform_implicit_conversion (TREE_TYPE (totype
),
6992 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
6994 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
6997 expr
= reshape_init (totype
, expr
, complain
);
6998 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
7000 if (expr
!= error_mark_node
)
7001 TARGET_EXPR_LIST_INIT_P (expr
) = true;
7008 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
7009 convs
->kind
== ck_ref_bind
7010 ? issue_conversion_warnings
: false,
7011 c_cast_p
, complain
);
7012 if (expr
== error_mark_node
)
7013 return error_mark_node
;
7015 switch (convs
->kind
)
7018 expr
= decay_conversion (expr
, complain
);
7019 if (expr
== error_mark_node
)
7021 if (complain
& tf_error
)
7023 auto_diagnostic_group d
;
7024 maybe_print_user_conv_context (convs
);
7026 inform (DECL_SOURCE_LOCATION (fn
),
7027 " initializing argument %P of %qD", argnum
, fn
);
7029 return error_mark_node
;
7032 if (! MAYBE_CLASS_TYPE_P (totype
))
7035 /* Don't introduce copies when passing arguments along to the inherited
7037 if (current_function_decl
7038 && flag_new_inheriting_ctors
7039 && DECL_INHERITED_CTOR (current_function_decl
))
7042 if (TREE_CODE (expr
) == TARGET_EXPR
7043 && TARGET_EXPR_LIST_INIT_P (expr
))
7044 /* Copy-list-initialization doesn't actually involve a copy. */
7049 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
7051 /* We are going to bind a reference directly to a base-class
7052 subobject of EXPR. */
7053 /* Build an expression for `*((base*) &expr)'. */
7054 expr
= convert_to_base (expr
, totype
,
7055 !c_cast_p
, /*nonnull=*/true, complain
);
7059 /* Copy-initialization where the cv-unqualified version of the source
7060 type is the same class as, or a derived class of, the class of the
7061 destination [is treated as direct-initialization]. [dcl.init] */
7062 flags
= LOOKUP_NORMAL
;
7063 if (convs
->user_conv_p
)
7064 /* This conversion is being done in the context of a user-defined
7065 conversion (i.e. the second step of copy-initialization), so
7066 don't allow any more. */
7067 flags
|= LOOKUP_NO_CONVERSION
;
7069 flags
|= LOOKUP_ONLYCONVERTING
;
7070 if (convs
->rvaluedness_matches_p
)
7071 /* standard_conversion got LOOKUP_PREFER_RVALUE. */
7072 flags
|= LOOKUP_PREFER_RVALUE
;
7073 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
7074 if (diag_kind
&& complain
)
7076 auto_diagnostic_group d
;
7077 maybe_print_user_conv_context (convs
);
7079 inform (DECL_SOURCE_LOCATION (fn
),
7080 " initializing argument %P of %qD", argnum
, fn
);
7083 return build_cplus_new (totype
, expr
, complain
);
7087 tree ref_type
= totype
;
7089 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
7091 tree extype
= TREE_TYPE (expr
);
7092 auto_diagnostic_group d
;
7093 if (TYPE_REF_IS_RVALUE (ref_type
)
7095 error_at (loc
, "cannot bind rvalue reference of type %qH to "
7096 "lvalue of type %qI", totype
, extype
);
7097 else if (!TYPE_REF_IS_RVALUE (ref_type
) && !lvalue_p (expr
)
7098 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
7099 error_at (loc
, "cannot bind non-const lvalue reference of "
7100 "type %qH to an rvalue of type %qI", totype
, extype
);
7101 else if (!reference_compatible_p (TREE_TYPE (totype
), extype
))
7102 error_at (loc
, "binding reference of type %qH to %qI "
7103 "discards qualifiers", totype
, extype
);
7106 maybe_print_user_conv_context (convs
);
7108 inform (DECL_SOURCE_LOCATION (fn
),
7109 " initializing argument %P of %qD", argnum
, fn
);
7110 return error_mark_node
;
7113 /* If necessary, create a temporary.
7115 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
7116 that need temporaries, even when their types are reference
7117 compatible with the type of reference being bound, so the
7118 upcoming call to cp_build_addr_expr doesn't fail. */
7119 if (convs
->need_temporary_p
7120 || TREE_CODE (expr
) == CONSTRUCTOR
7121 || TREE_CODE (expr
) == VA_ARG_EXPR
)
7123 /* Otherwise, a temporary of type "cv1 T1" is created and
7124 initialized from the initializer expression using the rules
7125 for a non-reference copy-initialization (8.5). */
7127 tree type
= TREE_TYPE (ref_type
);
7128 cp_lvalue_kind lvalue
= lvalue_kind (expr
);
7130 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7131 (type
, next_conversion (convs
)->type
));
7132 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
7133 && !TYPE_REF_IS_RVALUE (ref_type
))
7135 /* If the reference is volatile or non-const, we
7136 cannot create a temporary. */
7137 if (lvalue
& clk_bitfield
)
7138 error_at (loc
, "cannot bind bitfield %qE to %qT",
7140 else if (lvalue
& clk_packed
)
7141 error_at (loc
, "cannot bind packed field %qE to %qT",
7144 error_at (loc
, "cannot bind rvalue %qE to %qT",
7146 return error_mark_node
;
7148 /* If the source is a packed field, and we must use a copy
7149 constructor, then building the target expr will require
7150 binding the field to the reference parameter to the
7151 copy constructor, and we'll end up with an infinite
7152 loop. If we can use a bitwise copy, then we'll be
7154 if ((lvalue
& clk_packed
)
7155 && CLASS_TYPE_P (type
)
7156 && type_has_nontrivial_copy_init (type
))
7158 error_at (loc
, "cannot bind packed field %qE to %qT",
7160 return error_mark_node
;
7162 if (lvalue
& clk_bitfield
)
7164 expr
= convert_bitfield_to_declared_type (expr
);
7165 expr
= fold_convert (type
, expr
);
7167 expr
= build_target_expr_with_type (expr
, type
, complain
);
7170 /* Take the address of the thing to which we will bind the
7172 expr
= cp_build_addr_expr (expr
, complain
);
7173 if (expr
== error_mark_node
)
7174 return error_mark_node
;
7176 /* Convert it to a pointer to the type referred to by the
7177 reference. This will adjust the pointer if a derived to
7178 base conversion is being performed. */
7179 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
7181 /* Convert the pointer to the desired reference type. */
7182 return build_nop (ref_type
, expr
);
7186 return decay_conversion (expr
, complain
);
7189 /* ??? Should the address of a transaction-safe pointer point to the TM
7190 clone, and this conversion look up the primary function? */
7191 return build_nop (totype
, expr
);
7194 /* Warn about deprecated conversion if appropriate. */
7195 string_conv_p (totype
, expr
, 1);
7200 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
7201 /*nonnull=*/false, complain
);
7202 return build_nop (totype
, expr
);
7205 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
7206 c_cast_p
, complain
);
7212 if (convs
->check_narrowing
7213 && !check_narrowing (totype
, expr
, complain
,
7214 convs
->check_narrowing_const_only
))
7215 return error_mark_node
;
7217 warning_sentinel
w (warn_zero_as_null_pointer_constant
);
7218 if (issue_conversion_warnings
)
7219 expr
= cp_convert_and_check (totype
, expr
, complain
);
7221 expr
= cp_convert (totype
, expr
, complain
);
7226 /* ARG is being passed to a varargs function. Perform any conversions
7227 required. Return the converted value. */
7230 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
7233 location_t loc
= cp_expr_loc_or_loc (arg
, input_location
);
7237 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7238 standard conversions are performed. */
7239 arg
= decay_conversion (arg
, complain
);
7240 arg_type
= TREE_TYPE (arg
);
7243 If the argument has integral or enumeration type that is subject
7244 to the integral promotions (_conv.prom_), or a floating point
7245 type that is subject to the floating point promotion
7246 (_conv.fpprom_), the value of the argument is converted to the
7247 promoted type before the call. */
7248 if (TREE_CODE (arg_type
) == REAL_TYPE
7249 && (TYPE_PRECISION (arg_type
)
7250 < TYPE_PRECISION (double_type_node
))
7251 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
7253 if ((complain
& tf_warning
)
7254 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
7255 warning_at (loc
, OPT_Wdouble_promotion
,
7256 "implicit conversion from %qH to %qI when passing "
7257 "argument to function",
7258 arg_type
, double_type_node
);
7259 arg
= convert_to_real_nofold (double_type_node
, arg
);
7261 else if (NULLPTR_TYPE_P (arg_type
))
7262 arg
= null_pointer_node
;
7263 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
7265 if (SCOPED_ENUM_P (arg_type
))
7267 tree prom
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
,
7269 prom
= cp_perform_integral_promotions (prom
, complain
);
7270 if (abi_version_crosses (6)
7271 && TYPE_MODE (TREE_TYPE (prom
)) != TYPE_MODE (arg_type
)
7272 && (complain
& tf_warning
))
7273 warning_at (loc
, OPT_Wabi
, "scoped enum %qT passed through ... as "
7274 "%qT before -fabi-version=6, %qT after", arg_type
,
7275 TREE_TYPE (prom
), ENUM_UNDERLYING_TYPE (arg_type
));
7276 if (!abi_version_at_least (6))
7280 arg
= cp_perform_integral_promotions (arg
, complain
);
7283 arg
= require_complete_type_sfinae (arg
, complain
);
7284 arg_type
= TREE_TYPE (arg
);
7286 if (arg
!= error_mark_node
7287 /* In a template (or ill-formed code), we can have an incomplete type
7288 even after require_complete_type_sfinae, in which case we don't know
7289 whether it has trivial copy or not. */
7290 && COMPLETE_TYPE_P (arg_type
)
7291 && !cp_unevaluated_operand
)
7293 /* [expr.call] 5.2.2/7:
7294 Passing a potentially-evaluated argument of class type (Clause 9)
7295 with a non-trivial copy constructor or a non-trivial destructor
7296 with no corresponding parameter is conditionally-supported, with
7297 implementation-defined semantics.
7299 We support it as pass-by-invisible-reference, just like a normal
7302 If the call appears in the context of a sizeof expression,
7303 it is not potentially-evaluated. */
7304 if (type_has_nontrivial_copy_init (arg_type
)
7305 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
))
7307 arg
= force_rvalue (arg
, complain
);
7308 if (complain
& tf_warning
)
7309 warning (OPT_Wconditionally_supported
,
7310 "passing objects of non-trivially-copyable "
7311 "type %q#T through %<...%> is conditionally supported",
7313 return build1 (ADDR_EXPR
, build_reference_type (arg_type
), arg
);
7315 /* Build up a real lvalue-to-rvalue conversion in case the
7316 copy constructor is trivial but not callable. */
7317 else if (CLASS_TYPE_P (arg_type
))
7318 force_rvalue (arg
, complain
);
7325 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7328 build_x_va_arg (source_location loc
, tree expr
, tree type
)
7330 if (processing_template_decl
)
7332 tree r
= build_min (VA_ARG_EXPR
, type
, expr
);
7333 SET_EXPR_LOCATION (r
, loc
);
7337 type
= complete_type_or_else (type
, NULL_TREE
);
7339 if (expr
== error_mark_node
|| !type
)
7340 return error_mark_node
;
7342 expr
= mark_lvalue_use (expr
);
7344 if (TYPE_REF_P (type
))
7346 error ("cannot receive reference type %qT through %<...%>", type
);
7347 return error_mark_node
;
7350 if (type_has_nontrivial_copy_init (type
)
7351 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7353 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7354 it as pass by invisible reference. */
7355 warning_at (loc
, OPT_Wconditionally_supported
,
7356 "receiving objects of non-trivially-copyable type %q#T "
7357 "through %<...%> is conditionally-supported", type
);
7359 tree ref
= cp_build_reference_type (type
, false);
7360 expr
= build_va_arg (loc
, expr
, ref
);
7361 return convert_from_reference (expr
);
7364 tree ret
= build_va_arg (loc
, expr
, type
);
7365 if (CLASS_TYPE_P (type
))
7366 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7367 know how to handle it. */
7368 ret
= get_target_expr (ret
);
7372 /* TYPE has been given to va_arg. Apply the default conversions which
7373 would have happened when passed via ellipsis. Return the promoted
7374 type, or the passed type if there is no change. */
7377 cxx_type_promotes_to (tree type
)
7381 /* Perform the array-to-pointer and function-to-pointer
7383 type
= type_decays_to (type
);
7385 promote
= type_promotes_to (type
);
7386 if (same_type_p (type
, promote
))
7392 /* ARG is a default argument expression being passed to a parameter of
7393 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7394 zero-based argument number. Do any required conversions. Return
7395 the converted value. */
7397 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
7399 push_defarg_context (tree fn
)
7400 { vec_safe_push (default_arg_context
, fn
); }
7403 pop_defarg_context (void)
7404 { default_arg_context
->pop (); }
7407 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
7408 tsubst_flags_t complain
)
7413 /* See through clones. */
7414 fn
= DECL_ORIGIN (fn
);
7415 /* And inheriting ctors. */
7416 if (flag_new_inheriting_ctors
)
7417 fn
= strip_inheriting_ctors (fn
);
7419 /* Detect recursion. */
7420 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
7423 if (complain
& tf_error
)
7424 error ("recursive evaluation of default argument for %q#D", fn
);
7425 return error_mark_node
;
7428 /* If the ARG is an unparsed default argument expression, the
7429 conversion cannot be performed. */
7430 if (TREE_CODE (arg
) == DEFAULT_ARG
)
7432 if (complain
& tf_error
)
7433 error ("call to %qD uses the default argument for parameter %P, which "
7434 "is not yet defined", fn
, parmnum
);
7435 return error_mark_node
;
7438 push_defarg_context (fn
);
7440 if (fn
&& DECL_TEMPLATE_INFO (fn
))
7441 arg
= tsubst_default_argument (fn
, parmnum
, type
, arg
, complain
);
7447 The names in the expression are bound, and the semantic
7448 constraints are checked, at the point where the default
7449 expressions appears.
7451 we must not perform access checks here. */
7452 push_deferring_access_checks (dk_no_check
);
7453 /* We must make a copy of ARG, in case subsequent processing
7454 alters any part of it. */
7455 arg
= break_out_target_exprs (arg
, /*clear location*/true);
7457 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
7458 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
7460 arg
= convert_for_arg_passing (type
, arg
, complain
);
7461 pop_deferring_access_checks();
7463 pop_defarg_context ();
7468 /* Returns the type which will really be used for passing an argument of
7472 type_passed_as (tree type
)
7474 /* Pass classes with copy ctors by invisible reference. */
7475 if (TREE_ADDRESSABLE (type
))
7477 type
= build_reference_type (type
);
7478 /* There are no other pointers to this temporary. */
7479 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
7481 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7482 && INTEGRAL_TYPE_P (type
)
7483 && COMPLETE_TYPE_P (type
)
7484 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7485 type
= integer_type_node
;
7490 /* Actually perform the appropriate conversion. */
7493 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
7497 /* If VAL is a bitfield, then -- since it has already been converted
7498 to TYPE -- it cannot have a precision greater than TYPE.
7500 If it has a smaller precision, we must widen it here. For
7501 example, passing "int f:3;" to a function expecting an "int" will
7502 not result in any conversion before this point.
7504 If the precision is the same we must not risk widening. For
7505 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7506 often have type "int", even though the C++ type for the field is
7507 "long long". If the value is being passed to a function
7508 expecting an "int", then no conversions will be required. But,
7509 if we call convert_bitfield_to_declared_type, the bitfield will
7510 be converted to "long long". */
7511 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
7513 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
7514 val
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
), val
);
7516 if (val
== error_mark_node
)
7518 /* Pass classes with copy ctors by invisible reference. */
7519 else if (TREE_ADDRESSABLE (type
))
7520 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
7521 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7522 && INTEGRAL_TYPE_P (type
)
7523 && COMPLETE_TYPE_P (type
)
7524 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7525 val
= cp_perform_integral_promotions (val
, complain
);
7526 if (complain
& tf_warning
)
7528 if (warn_suggest_attribute_format
)
7530 tree rhstype
= TREE_TYPE (val
);
7531 const enum tree_code coder
= TREE_CODE (rhstype
);
7532 const enum tree_code codel
= TREE_CODE (type
);
7533 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7535 && check_missing_format_attribute (type
, rhstype
))
7536 warning (OPT_Wsuggest_attribute_format
,
7537 "argument of function call might be a candidate "
7538 "for a format attribute");
7540 maybe_warn_parm_abi (type
, cp_expr_loc_or_loc (val
, input_location
));
7545 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7546 which just decay_conversion or no conversions at all should be done.
7547 This is true for some builtins which don't act like normal functions.
7548 Return 2 if no conversions at all should be done, 1 if just
7549 decay_conversion. Return 3 for special treatment of the 3rd argument
7550 for __builtin_*_overflow_p. */
7553 magic_varargs_p (tree fn
)
7555 if (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
7556 switch (DECL_FUNCTION_CODE (fn
))
7558 case BUILT_IN_CLASSIFY_TYPE
:
7559 case BUILT_IN_CONSTANT_P
:
7560 case BUILT_IN_NEXT_ARG
:
7561 case BUILT_IN_VA_START
:
7564 case BUILT_IN_ADD_OVERFLOW_P
:
7565 case BUILT_IN_SUB_OVERFLOW_P
:
7566 case BUILT_IN_MUL_OVERFLOW_P
:
7570 return lookup_attribute ("type generic",
7571 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
7577 /* Returns the decl of the dispatcher function if FN is a function version. */
7580 get_function_version_dispatcher (tree fn
)
7582 tree dispatcher_decl
= NULL
;
7584 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7585 && DECL_FUNCTION_VERSIONED (fn
));
7587 gcc_assert (targetm
.get_function_versions_dispatcher
);
7588 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
7590 if (dispatcher_decl
== NULL
)
7592 error_at (input_location
, "use of multiversioned function "
7593 "without a default");
7597 retrofit_lang_decl (dispatcher_decl
);
7598 gcc_assert (dispatcher_decl
!= NULL
);
7599 return dispatcher_decl
;
7602 /* fn is a function version dispatcher that is marked used. Mark all the
7603 semantically identical function versions it will dispatch as used. */
7606 mark_versions_used (tree fn
)
7608 struct cgraph_node
*node
;
7609 struct cgraph_function_version_info
*node_v
;
7610 struct cgraph_function_version_info
*it_v
;
7612 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7614 node
= cgraph_node::get (fn
);
7618 gcc_assert (node
->dispatcher_function
);
7620 node_v
= node
->function_version ();
7624 /* All semantically identical versions are chained. Traverse and mark each
7625 one of them as used. */
7626 it_v
= node_v
->next
;
7627 while (it_v
!= NULL
)
7629 mark_used (it_v
->this_node
->decl
);
7634 /* Build a call to "the copy constructor" for the type of A, even if it
7635 wouldn't be selected by normal overload resolution. Used for
7639 call_copy_ctor (tree a
, tsubst_flags_t complain
)
7641 tree ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (a
));
7642 tree binfo
= TYPE_BINFO (ctype
);
7643 tree copy
= get_copy_ctor (ctype
, complain
);
7644 copy
= build_baselink (binfo
, binfo
, copy
, NULL_TREE
);
7645 tree ob
= build_dummy_object (ctype
);
7646 vec
<tree
, va_gc
>* args
= make_tree_vector_single (a
);
7647 tree r
= build_new_method_call (ob
, copy
, &args
, NULL_TREE
,
7648 LOOKUP_NORMAL
, NULL
, complain
);
7649 release_tree_vector (args
);
7653 /* Return true iff T refers to a base field. */
7656 is_base_field_ref (tree t
)
7659 if (TREE_CODE (t
) == ADDR_EXPR
)
7660 t
= TREE_OPERAND (t
, 0);
7661 if (TREE_CODE (t
) == COMPONENT_REF
)
7662 t
= TREE_OPERAND (t
, 1);
7663 if (TREE_CODE (t
) == FIELD_DECL
)
7664 return DECL_FIELD_IS_BASE (t
);
7668 /* We can't elide a copy from a function returning by value to a base
7669 subobject, as the callee might clobber tail padding. Return true iff this
7670 could be that case. */
7673 unsafe_copy_elision_p (tree target
, tree exp
)
7675 /* Copy elision only happens with a TARGET_EXPR. */
7676 if (TREE_CODE (exp
) != TARGET_EXPR
)
7678 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
7679 /* It's safe to elide the copy for a class with no tail padding. */
7680 if (tree_int_cst_equal (TYPE_SIZE (type
), CLASSTYPE_SIZE (type
)))
7682 /* It's safe to elide the copy if we aren't initializing a base object. */
7683 if (!is_base_field_ref (target
))
7685 tree init
= TARGET_EXPR_INITIAL (exp
);
7686 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7687 while (TREE_CODE (init
) == COMPOUND_EXPR
)
7688 init
= TREE_OPERAND (init
, 1);
7689 if (TREE_CODE (init
) == COND_EXPR
)
7691 /* We'll end up copying from each of the arms of the COND_EXPR directly
7692 into the target, so look at them. */
7693 if (tree op
= TREE_OPERAND (init
, 1))
7694 if (unsafe_copy_elision_p (target
, op
))
7696 return unsafe_copy_elision_p (target
, TREE_OPERAND (init
, 2));
7698 return (TREE_CODE (init
) == AGGR_INIT_EXPR
7699 && !AGGR_INIT_VIA_CTOR_P (init
));
7702 /* True iff C is a conversion that binds a reference to a prvalue. */
7705 conv_binds_ref_to_prvalue (conversion
*c
)
7707 if (c
->kind
!= ck_ref_bind
)
7709 if (c
->need_temporary_p
)
7712 c
= next_conversion (c
);
7714 if (c
->kind
== ck_rvalue
)
7716 if (c
->kind
== ck_user
&& !TYPE_REF_P (c
->type
))
7718 if (c
->kind
== ck_identity
&& c
->u
.expr
7719 && TREE_CODE (c
->u
.expr
) == TARGET_EXPR
)
7725 /* Call the trivial destructor for INSTANCE, which can be either an lvalue of
7726 class type or a pointer to class type. */
7729 build_trivial_dtor_call (tree instance
)
7731 gcc_assert (!is_dummy_object (instance
));
7733 if (!flag_lifetime_dse
)
7736 return fold_convert (void_type_node
, instance
);
7739 if (INDIRECT_TYPE_P (TREE_TYPE (instance
)))
7741 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
7743 instance
= cp_build_fold_indirect_ref (instance
);
7746 /* A trivial destructor should still clobber the object. */
7747 tree clobber
= build_clobber (TREE_TYPE (instance
));
7748 return build2 (MODIFY_EXPR
, void_type_node
,
7752 /* Subroutine of the various build_*_call functions. Overload resolution
7753 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7754 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7755 bitmask of various LOOKUP_* flags which apply to the call itself. */
7758 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
7761 const vec
<tree
, va_gc
> *args
= cand
->args
;
7762 tree first_arg
= cand
->first_arg
;
7763 conversion
**convs
= cand
->convs
;
7765 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
7770 unsigned int arg_index
= 0;
7774 bool already_used
= false;
7776 /* In a template, there is no need to perform all of the work that
7777 is normally done. We are only interested in the type of the call
7778 expression, i.e., the return type of the function. Any semantic
7779 errors will be deferred until the template is instantiated. */
7780 if (processing_template_decl
)
7784 const tree
*argarray
;
7787 if (undeduced_auto_decl (fn
))
7788 mark_used (fn
, complain
);
7790 /* Otherwise set TREE_USED for the benefit of -Wunused-function.
7794 return_type
= TREE_TYPE (TREE_TYPE (fn
));
7795 nargs
= vec_safe_length (args
);
7796 if (first_arg
== NULL_TREE
)
7797 argarray
= args
->address ();
7805 alcarray
= XALLOCAVEC (tree
, nargs
);
7806 alcarray
[0] = build_this (first_arg
);
7807 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
7808 alcarray
[ix
+ 1] = arg
;
7809 argarray
= alcarray
;
7812 addr
= build_addr_func (fn
, complain
);
7813 if (addr
== error_mark_node
)
7814 return error_mark_node
;
7815 expr
= build_call_array_loc (input_location
, return_type
,
7816 addr
, nargs
, argarray
);
7817 if (TREE_THIS_VOLATILE (fn
) && cfun
)
7818 current_function_returns_abnormally
= 1;
7819 return convert_from_reference (expr
);
7822 /* Give any warnings we noticed during overload resolution. */
7823 if (cand
->warnings
&& (complain
& tf_warning
))
7825 struct candidate_warning
*w
;
7826 for (w
= cand
->warnings
; w
; w
= w
->next
)
7827 joust (cand
, w
->loser
, 1, complain
);
7830 /* Core issue 2327: P0135 doesn't say how to handle the case where the
7831 argument to the copy constructor ends up being a prvalue after
7832 conversion. Let's do the normal processing, but pretend we aren't
7833 actually using the copy constructor. */
7834 bool force_elide
= false;
7835 if (cxx_dialect
>= cxx17
7836 && cand
->num_convs
== 1
7837 && DECL_COMPLETE_CONSTRUCTOR_P (fn
)
7838 && (DECL_COPY_CONSTRUCTOR_P (fn
)
7839 || DECL_MOVE_CONSTRUCTOR_P (fn
))
7840 && conv_binds_ref_to_prvalue (convs
[0]))
7843 goto not_really_used
;
7846 /* OK, we're actually calling this inherited constructor; set its deletedness
7847 appropriately. We can get away with doing this here because calling is
7848 the only way to refer to a constructor. */
7849 if (DECL_INHERITED_CTOR (fn
))
7850 deduce_inheriting_ctor (fn
);
7852 /* Make =delete work with SFINAE. */
7853 if (DECL_DELETED_FN (fn
))
7855 if (complain
& tf_error
)
7857 return error_mark_node
;
7860 if (DECL_FUNCTION_MEMBER_P (fn
))
7863 /* If FN is a template function, two cases must be considered.
7868 template <class T> void f();
7870 template <class T> struct B {
7874 struct C : A, B<int> {
7876 using B<int>::g; // #2
7879 In case #1 where `A::f' is a member template, DECL_ACCESS is
7880 recorded in the primary template but not in its specialization.
7881 We check access of FN using its primary template.
7883 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7884 because it is a member of class template B, DECL_ACCESS is
7885 recorded in the specialization `B<int>::g'. We cannot use its
7886 primary template because `B<T>::g' and `B<int>::g' may have
7887 different access. */
7888 if (DECL_TEMPLATE_INFO (fn
)
7889 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
7890 access_fn
= DECL_TI_TEMPLATE (fn
);
7893 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
7895 return error_mark_node
;
7898 /* If we're checking for implicit delete, don't bother with argument
7900 if (flags
& LOOKUP_SPECULATIVE
)
7902 if (cand
->viable
== 1)
7904 else if (!(complain
& tf_error
))
7905 /* Reject bad conversions now. */
7906 return error_mark_node
;
7907 /* else continue to get conversion error. */
7912 /* N3276 magic doesn't apply to nested calls. */
7913 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
7914 complain
&= ~tf_decltype
;
7915 /* No-Cleanup doesn't apply to nested calls either. */
7916 tsubst_flags_t no_cleanup_complain
= complain
;
7917 complain
&= ~tf_no_cleanup
;
7919 /* Find maximum size of vector to hold converted arguments. */
7920 parmlen
= list_length (parm
);
7921 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
7922 if (parmlen
> nargs
)
7924 argarray
= XALLOCAVEC (tree
, nargs
);
7926 /* The implicit parameters to a constructor are not considered by overload
7927 resolution, and must be of the proper type. */
7928 if (DECL_CONSTRUCTOR_P (fn
))
7931 if (first_arg
!= NULL_TREE
)
7933 object_arg
= first_arg
;
7934 first_arg
= NULL_TREE
;
7938 object_arg
= (*args
)[arg_index
];
7941 argarray
[j
++] = build_this (object_arg
);
7942 parm
= TREE_CHAIN (parm
);
7943 /* We should never try to call the abstract constructor. */
7944 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
7946 if (DECL_HAS_VTT_PARM_P (fn
))
7948 argarray
[j
++] = (*args
)[arg_index
];
7950 parm
= TREE_CHAIN (parm
);
7953 if (flags
& LOOKUP_PREFER_RVALUE
)
7955 /* The implicit move specified in 15.8.3/3 fails "...if the type of
7956 the first parameter of the selected constructor is not an rvalue
7957 reference to the object's type (possibly cv-qualified)...." */
7958 gcc_assert (!(complain
& tf_error
));
7959 tree ptype
= convs
[0]->type
;
7960 if (!TYPE_REF_P (ptype
)
7961 || !TYPE_REF_IS_RVALUE (ptype
)
7962 || CONVERSION_RANK (convs
[0]) > cr_exact
)
7963 return error_mark_node
;
7966 /* Bypass access control for 'this' parameter. */
7967 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7969 tree parmtype
= TREE_VALUE (parm
);
7970 tree arg
= build_this (first_arg
!= NULL_TREE
7972 : (*args
)[arg_index
]);
7973 tree argtype
= TREE_TYPE (arg
);
7977 if (arg
== error_mark_node
)
7978 return error_mark_node
;
7980 if (convs
[i
]->bad_p
)
7982 if (complain
& tf_error
)
7984 auto_diagnostic_group d
;
7985 if (permerror (input_location
, "passing %qT as %<this%> "
7986 "argument discards qualifiers",
7987 TREE_TYPE (argtype
)))
7988 inform (DECL_SOURCE_LOCATION (fn
), " in call to %qD", fn
);
7991 return error_mark_node
;
7994 /* See if the function member or the whole class type is declared
7995 final and the call can be devirtualized. */
7996 if (DECL_FINAL_P (fn
)
7997 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
7998 flags
|= LOOKUP_NONVIRTUAL
;
8000 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
8001 X is called for an object that is not of type X, or of a type
8002 derived from X, the behavior is undefined.
8004 So we can assume that anything passed as 'this' is non-null, and
8005 optimize accordingly. */
8006 gcc_assert (TYPE_PTR_P (parmtype
));
8007 /* Convert to the base in which the function was declared. */
8008 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
8009 converted_arg
= build_base_path (PLUS_EXPR
,
8011 cand
->conversion_path
,
8013 /* Check that the base class is accessible. */
8014 if (!accessible_base_p (TREE_TYPE (argtype
),
8015 BINFO_TYPE (cand
->conversion_path
), true))
8017 if (complain
& tf_error
)
8018 error ("%qT is not an accessible base of %qT",
8019 BINFO_TYPE (cand
->conversion_path
),
8020 TREE_TYPE (argtype
));
8022 return error_mark_node
;
8024 /* If fn was found by a using declaration, the conversion path
8025 will be to the derived class, not the base declaring fn. We
8026 must convert from derived to base. */
8027 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
8028 TREE_TYPE (parmtype
), ba_unique
,
8030 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
8031 base_binfo
, 1, complain
);
8033 argarray
[j
++] = converted_arg
;
8034 parm
= TREE_CHAIN (parm
);
8035 if (first_arg
!= NULL_TREE
)
8036 first_arg
= NULL_TREE
;
8043 gcc_assert (first_arg
== NULL_TREE
);
8044 for (; arg_index
< vec_safe_length (args
) && parm
;
8045 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
8047 tree type
= TREE_VALUE (parm
);
8048 tree arg
= (*args
)[arg_index
];
8049 bool conversion_warning
= true;
8053 /* If the argument is NULL and used to (implicitly) instantiate a
8054 template function (and bind one of the template arguments to
8055 the type of 'long int'), we don't want to warn about passing NULL
8056 to non-pointer argument.
8057 For example, if we have this template function:
8059 template<typename T> void func(T x) {}
8061 we want to warn (when -Wconversion is enabled) in this case:
8067 but not in this case:
8073 if (null_node_p (arg
)
8074 && DECL_TEMPLATE_INFO (fn
)
8075 && cand
->template_decl
8076 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
8077 conversion_warning
= false;
8079 /* Warn about initializer_list deduction that isn't currently in the
8081 if (cxx_dialect
> cxx98
8082 && flag_deduce_init_list
8083 && cand
->template_decl
8084 && is_std_init_list (non_reference (type
))
8085 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
8087 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
8088 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
8089 tree patparm
= get_pattern_parm (realparm
, tmpl
);
8090 tree pattype
= TREE_TYPE (patparm
);
8091 if (PACK_EXPANSION_P (pattype
))
8092 pattype
= PACK_EXPANSION_PATTERN (pattype
);
8093 pattype
= non_reference (pattype
);
8095 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
8096 && (cand
->explicit_targs
== NULL_TREE
8097 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
8098 <= TEMPLATE_TYPE_IDX (pattype
))))
8100 pedwarn (input_location
, 0, "deducing %qT as %qT",
8101 non_reference (TREE_TYPE (patparm
)),
8102 non_reference (type
));
8103 pedwarn (DECL_SOURCE_LOCATION (cand
->fn
), 0,
8104 " in call to %qD", cand
->fn
);
8105 pedwarn (input_location
, 0,
8106 " (you can disable this with -fno-deduce-init-list)");
8110 /* Set user_conv_p on the argument conversions, so rvalue/base handling
8111 knows not to allow any more UDCs. This needs to happen after we
8112 process cand->warnings. */
8113 if (flags
& LOOKUP_NO_CONVERSION
)
8114 conv
->user_conv_p
= true;
8116 tsubst_flags_t arg_complain
= complain
;
8117 if (!conversion_warning
)
8118 arg_complain
&= ~tf_warning
;
8120 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
8122 val
= convert_for_arg_passing (type
, val
, arg_complain
);
8124 if (val
== error_mark_node
)
8125 return error_mark_node
;
8127 argarray
[j
++] = val
;
8130 /* Default arguments */
8131 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
8133 if (TREE_VALUE (parm
) == error_mark_node
)
8134 return error_mark_node
;
8135 val
= convert_default_arg (TREE_VALUE (parm
),
8136 TREE_PURPOSE (parm
),
8139 if (val
== error_mark_node
)
8140 return error_mark_node
;
8141 argarray
[j
++] = val
;
8145 int magic
= magic_varargs_p (fn
);
8146 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
8148 tree a
= (*args
)[arg_index
];
8149 if ((magic
== 3 && arg_index
== 2) || magic
== 2)
8151 /* Do no conversions for certain magic varargs. */
8152 a
= mark_type_use (a
);
8153 if (TREE_CODE (a
) == FUNCTION_DECL
&& reject_gcc_builtin (a
))
8154 return error_mark_node
;
8156 else if (magic
!= 0)
8157 /* For other magic varargs only do decay_conversion. */
8158 a
= decay_conversion (a
, complain
);
8159 else if (DECL_CONSTRUCTOR_P (fn
)
8160 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn
),
8163 /* Avoid infinite recursion trying to call A(...). */
8164 if (complain
& tf_error
)
8165 /* Try to call the actual copy constructor for a good error. */
8166 call_copy_ctor (a
, complain
);
8167 return error_mark_node
;
8170 a
= convert_arg_to_ellipsis (a
, complain
);
8171 if (a
== error_mark_node
)
8172 return error_mark_node
;
8176 gcc_assert (j
<= nargs
);
8179 /* Avoid to do argument-transformation, if warnings for format, and for
8180 nonnull are disabled. Just in case that at least one of them is active
8181 the check_function_arguments function might warn about something. */
8183 bool warned_p
= false;
8186 || warn_suggest_attribute_format
8189 tree
*fargs
= (!nargs
? argarray
8190 : (tree
*) alloca (nargs
* sizeof (tree
)));
8191 auto_vec
<location_t
> arglocs (nargs
);
8192 for (j
= 0; j
< nargs
; j
++)
8194 /* For -Wformat undo the implicit passing by hidden reference
8195 done by convert_arg_to_ellipsis. */
8196 if (TREE_CODE (argarray
[j
]) == ADDR_EXPR
8197 && TYPE_REF_P (TREE_TYPE (argarray
[j
])))
8198 fargs
[j
] = TREE_OPERAND (argarray
[j
], 0);
8200 fargs
[j
] = maybe_constant_value (argarray
[j
]);
8201 arglocs
.quick_push (EXPR_LOC_OR_LOC (argarray
[j
], input_location
));
8204 warned_p
= check_function_arguments (input_location
, fn
, TREE_TYPE (fn
),
8205 nargs
, fargs
, &arglocs
);
8208 if (DECL_INHERITED_CTOR (fn
))
8210 /* Check for passing ellipsis arguments to an inherited constructor. We
8211 could handle this by open-coding the inherited constructor rather than
8212 defining it, but let's not bother now. */
8213 if (!cp_unevaluated_operand
8215 && cand
->convs
[cand
->num_convs
-1]->ellipsis_p
)
8217 if (complain
& tf_error
)
8219 sorry ("passing arguments to ellipsis of inherited constructor "
8221 inform (DECL_SOURCE_LOCATION (cand
->fn
), "declared here");
8223 return error_mark_node
;
8226 /* A base constructor inheriting from a virtual base doesn't get the
8227 inherited arguments, just this and __vtt. */
8228 if (ctor_omit_inherited_parms (fn
))
8232 /* Avoid actually calling copy constructors and copy assignment operators,
8235 if (! flag_elide_constructors
&& !force_elide
)
8236 /* Do things the hard way. */;
8237 else if (cand
->num_convs
== 1
8238 && (DECL_COPY_CONSTRUCTOR_P (fn
)
8239 || DECL_MOVE_CONSTRUCTOR_P (fn
))
8240 /* It's unsafe to elide the constructor when handling
8241 a noexcept-expression, it may evaluate to the wrong
8242 value (c++/53025). */
8243 && (force_elide
|| cp_noexcept_operand
== 0))
8246 tree arg
= argarray
[num_artificial_parms_for (fn
)];
8248 bool trivial
= trivial_fn_p (fn
);
8250 /* Pull out the real argument, disregarding const-correctness. */
8252 /* Strip the reference binding for the constructor parameter. */
8253 if (CONVERT_EXPR_P (targ
)
8254 && TYPE_REF_P (TREE_TYPE (targ
)))
8255 targ
= TREE_OPERAND (targ
, 0);
8256 /* But don't strip any other reference bindings; binding a temporary to a
8257 reference prevents copy elision. */
8258 while ((CONVERT_EXPR_P (targ
)
8259 && !TYPE_REF_P (TREE_TYPE (targ
)))
8260 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
8261 targ
= TREE_OPERAND (targ
, 0);
8262 if (TREE_CODE (targ
) == ADDR_EXPR
)
8264 targ
= TREE_OPERAND (targ
, 0);
8265 if (!same_type_ignoring_top_level_qualifiers_p
8266 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
8275 arg
= cp_build_fold_indirect_ref (arg
);
8277 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8279 if (CHECKING_P
&& cxx_dialect
>= cxx17
)
8280 gcc_assert (TREE_CODE (arg
) != TARGET_EXPR
8282 /* It's from binding the ref parm to a packed field. */
8283 || convs
[0]->need_temporary_p
8285 /* See unsafe_copy_elision_p. */
8286 || DECL_BASE_CONSTRUCTOR_P (fn
));
8289 bool unsafe
= unsafe_copy_elision_p (fa
, arg
);
8290 bool eliding_temp
= (TREE_CODE (arg
) == TARGET_EXPR
&& !unsafe
);
8292 /* [class.copy]: the copy constructor is implicitly defined even if the
8293 implementation elided its use. But don't warn about deprecation when
8294 eliding a temporary, as then no copy is actually performed. */
8295 warning_sentinel
s (warn_deprecated_copy
, eliding_temp
);
8297 /* The language says this isn't called. */;
8300 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
8301 return error_mark_node
;
8302 already_used
= true;
8305 cp_warn_deprecated_use (fn
, complain
);
8307 /* If we're creating a temp and we already have one, don't create a
8308 new one. If we're not creating a temp but we get one, use
8309 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8310 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8311 temp or an INIT_EXPR otherwise. */
8312 if (is_dummy_object (fa
))
8314 if (TREE_CODE (arg
) == TARGET_EXPR
)
8317 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
8319 else if ((trivial
|| TREE_CODE (arg
) == TARGET_EXPR
)
8322 tree to
= cp_stabilize_reference (cp_build_fold_indirect_ref (fa
));
8324 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
8328 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
8329 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
)
8330 && trivial_fn_p (fn
))
8332 tree to
= cp_stabilize_reference
8333 (cp_build_fold_indirect_ref (argarray
[0]));
8334 tree type
= TREE_TYPE (to
);
8335 tree as_base
= CLASSTYPE_AS_BASE (type
);
8336 tree arg
= argarray
[1];
8337 location_t loc
= cp_expr_loc_or_loc (arg
, input_location
);
8339 if (is_really_empty_class (type
))
8341 /* Avoid copying empty classes. */
8342 val
= build2 (COMPOUND_EXPR
, type
, arg
, to
);
8343 TREE_NO_WARNING (val
) = 1;
8345 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
8347 if (is_std_init_list (type
)
8348 && conv_binds_ref_to_prvalue (convs
[1]))
8349 warning_at (loc
, OPT_Winit_list_lifetime
,
8350 "assignment from temporary initializer_list does not "
8351 "extend the lifetime of the underlying array");
8352 arg
= cp_build_fold_indirect_ref (arg
);
8353 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
8357 /* We must only copy the non-tail padding parts. */
8359 tree array_type
, alias_set
;
8361 arg2
= TYPE_SIZE_UNIT (as_base
);
8362 arg0
= cp_build_addr_expr (to
, complain
);
8364 array_type
= build_array_type (unsigned_char_type_node
,
8366 (size_binop (MINUS_EXPR
,
8367 arg2
, size_int (1))));
8368 alias_set
= build_int_cst (build_pointer_type (type
), 0);
8369 t
= build2 (MODIFY_EXPR
, void_type_node
,
8370 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
8371 build2 (MEM_REF
, array_type
, arg
, alias_set
));
8372 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
8373 TREE_NO_WARNING (val
) = 1;
8376 cp_warn_deprecated_use (fn
, complain
);
8380 else if (trivial_fn_p (fn
))
8382 if (DECL_DESTRUCTOR_P (fn
))
8383 return build_trivial_dtor_call (argarray
[0]);
8384 else if (default_ctor_p (fn
))
8386 if (is_dummy_object (argarray
[0]))
8387 return force_target_expr (DECL_CONTEXT (fn
), void_node
,
8388 no_cleanup_complain
);
8390 return cp_build_fold_indirect_ref (argarray
[0]);
8394 gcc_assert (!force_elide
);
8397 && !mark_used (fn
, complain
))
8398 return error_mark_node
;
8400 /* Warn if the built-in writes to an object of a non-trivial type. */
8401 if (warn_class_memaccess
8402 && vec_safe_length (args
) >= 2
8403 && DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
8404 maybe_warn_class_memaccess (input_location
, fn
, args
);
8406 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0)
8409 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
8411 ba_any
, NULL
, complain
);
8412 gcc_assert (binfo
&& binfo
!= error_mark_node
);
8414 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
8416 if (TREE_SIDE_EFFECTS (argarray
[0]))
8417 argarray
[0] = save_expr (argarray
[0]);
8418 t
= build_pointer_type (TREE_TYPE (fn
));
8419 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
8424 fn
= build_addr_func (fn
, complain
);
8425 if (fn
== error_mark_node
)
8426 return error_mark_node
;
8429 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
8430 if (call
== error_mark_node
)
8432 if (cand
->flags
& LOOKUP_LIST_INIT_CTOR
)
8434 tree c
= extract_call_expr (call
);
8435 /* build_new_op_1 will clear this when appropriate. */
8436 CALL_EXPR_ORDERED_ARGS (c
) = true;
8440 tree c
= extract_call_expr (call
);
8441 if (TREE_CODE (c
) == CALL_EXPR
)
8442 TREE_NO_WARNING (c
) = 1;
8450 /* Return the DECL of the first non-static subobject of class TYPE
8451 that satisfies the predicate PRED or null if none can be found. */
8453 template <class Predicate
>
8455 first_non_static_field (tree type
, Predicate pred
)
8457 if (!type
|| !CLASS_TYPE_P (type
))
8460 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
8462 if (TREE_CODE (field
) != FIELD_DECL
)
8464 if (TREE_STATIC (field
))
8472 for (tree base_binfo
, binfo
= TYPE_BINFO (type
);
8473 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8475 tree base
= TREE_TYPE (base_binfo
);
8478 if (tree field
= first_non_static_field (base
, pred
))
8485 struct NonPublicField
8487 bool operator() (const_tree t
)
8489 return DECL_P (t
) && (TREE_PRIVATE (t
) || TREE_PROTECTED (t
));
8493 /* Return the DECL of the first non-public subobject of class TYPE
8494 or null if none can be found. */
8497 first_non_public_field (tree type
)
8499 return first_non_static_field (type
, NonPublicField ());
8502 struct NonTrivialField
8504 bool operator() (const_tree t
)
8506 return !trivial_type_p (DECL_P (t
) ? TREE_TYPE (t
) : t
);
8510 /* Return the DECL of the first non-trivial subobject of class TYPE
8511 or null if none can be found. */
8514 first_non_trivial_field (tree type
)
8516 return first_non_static_field (type
, NonTrivialField ());
8519 } /* unnamed namespace */
8521 /* Return true if all copy and move assignment operator overloads for
8522 class TYPE are trivial and at least one of them is not deleted and,
8523 when ACCESS is set, accessible. Return false otherwise. Set
8524 HASASSIGN to true when the TYPE has a (not necessarily trivial)
8525 copy or move assignment. */
8528 has_trivial_copy_assign_p (tree type
, bool access
, bool *hasassign
)
8530 tree fns
= get_class_binding (type
, assign_op_identifier
);
8531 bool all_trivial
= true;
8533 /* Iterate over overloads of the assignment operator, checking
8534 accessible copy assignments for triviality. */
8536 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8540 /* Skip operators that aren't copy assignments. */
8544 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8545 || accessible_p (TYPE_BINFO (type
), f
, true));
8547 /* Skip template assignment operators and deleted functions. */
8548 if (TREE_CODE (f
) != FUNCTION_DECL
|| DECL_DELETED_FN (f
))
8554 if (!accessible
|| !trivial_fn_p (f
))
8555 all_trivial
= false;
8557 /* Break early when both properties have been determined. */
8558 if (*hasassign
&& !all_trivial
)
8562 /* Return true if they're all trivial and one of the expressions
8563 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
8564 tree ref
= cp_build_reference_type (type
, false);
8566 && (is_trivially_xible (MODIFY_EXPR
, type
, type
)
8567 || is_trivially_xible (MODIFY_EXPR
, type
, ref
)));
8570 /* Return true if all copy and move ctor overloads for class TYPE are
8571 trivial and at least one of them is not deleted and, when ACCESS is
8572 set, accessible. Return false otherwise. Set each element of HASCTOR[]
8573 to true when the TYPE has a (not necessarily trivial) default and copy
8574 (or move) ctor, respectively. */
8577 has_trivial_copy_p (tree type
, bool access
, bool hasctor
[2])
8579 tree fns
= get_class_binding (type
, complete_ctor_identifier
);
8580 bool all_trivial
= true;
8582 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8586 /* Skip template constructors. */
8587 if (TREE_CODE (f
) != FUNCTION_DECL
)
8590 bool cpy_or_move_ctor_p
= copy_fn_p (f
);
8592 /* Skip ctors other than default, copy, and move. */
8593 if (!cpy_or_move_ctor_p
&& !default_ctor_p (f
))
8596 if (DECL_DELETED_FN (f
))
8599 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8600 || accessible_p (TYPE_BINFO (type
), f
, true));
8603 hasctor
[cpy_or_move_ctor_p
] = true;
8605 if (cpy_or_move_ctor_p
&& (!accessible
|| !trivial_fn_p (f
)))
8606 all_trivial
= false;
8608 /* Break early when both properties have been determined. */
8609 if (hasctor
[0] && hasctor
[1] && !all_trivial
)
8616 /* Issue a warning on a call to the built-in function FNDECL if it is
8617 a raw memory write whose destination is not an object of (something
8618 like) trivial or standard layout type with a non-deleted assignment
8619 and copy ctor. Detects const correctness violations, corrupting
8620 references, virtual table pointers, and bypassing non-trivial
8624 maybe_warn_class_memaccess (location_t loc
, tree fndecl
,
8625 const vec
<tree
, va_gc
> *args
)
8627 /* Except for bcopy where it's second, the destination pointer is
8628 the first argument for all functions handled here. Compute
8629 the index of the destination and source arguments. */
8630 unsigned dstidx
= DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_BCOPY
;
8631 unsigned srcidx
= !dstidx
;
8633 tree dest
= (*args
)[dstidx
];
8634 if (!TREE_TYPE (dest
) || !INDIRECT_TYPE_P (TREE_TYPE (dest
)))
8637 tree srctype
= NULL_TREE
;
8639 /* Determine the type of the pointed-to object and whether it's
8640 a complete class type. */
8641 tree desttype
= TREE_TYPE (TREE_TYPE (dest
));
8643 if (!desttype
|| !COMPLETE_TYPE_P (desttype
) || !CLASS_TYPE_P (desttype
))
8646 /* Check to see if the raw memory call is made by a non-static member
8647 function with THIS as the destination argument for the destination
8648 type. If so, and if the class has no non-trivial bases or members,
8649 be more permissive. */
8650 if (current_function_decl
8651 && DECL_NONSTATIC_MEMBER_FUNCTION_P (current_function_decl
)
8652 && is_this_parameter (tree_strip_nop_conversions (dest
)))
8654 tree ctx
= DECL_CONTEXT (current_function_decl
);
8655 bool special
= same_type_ignoring_top_level_qualifiers_p (ctx
, desttype
);
8656 tree binfo
= TYPE_BINFO (ctx
);
8658 /* FIXME: The following if statement is overly permissive (see
8659 bug 84851). Remove it in GCC 9. */
8661 && !BINFO_VTABLE (binfo
)
8662 && !BINFO_N_BASE_BINFOS (binfo
)
8663 && (DECL_CONSTRUCTOR_P (current_function_decl
)
8664 || DECL_DESTRUCTOR_P (current_function_decl
)))
8668 && !BINFO_VTABLE (binfo
)
8669 && !first_non_trivial_field (desttype
))
8673 /* True if the class is trivial. */
8674 bool trivial
= trivial_type_p (desttype
);
8676 /* Set to true if DESTYPE has an accessible copy assignment. */
8677 bool hasassign
= false;
8678 /* True if all of the class' overloaded copy assignment operators
8679 are all trivial (and not deleted) and at least one of them is
8681 bool trivassign
= has_trivial_copy_assign_p (desttype
, true, &hasassign
);
8683 /* Set to true if DESTTYPE has an accessible default and copy ctor,
8685 bool hasctors
[2] = { false, false };
8687 /* True if all of the class' overloaded copy constructors are all
8688 trivial (and not deleted) and at least one of them is accessible. */
8689 bool trivcopy
= has_trivial_copy_p (desttype
, true, hasctors
);
8691 /* Set FLD to the first private/protected member of the class. */
8692 tree fld
= trivial
? first_non_public_field (desttype
) : NULL_TREE
;
8694 /* The warning format string. */
8695 const char *warnfmt
= NULL
;
8696 /* A suggested alternative to offer instead of the raw memory call.
8697 Empty string when none can be come up with. */
8698 const char *suggest
= "";
8699 bool warned
= false;
8701 switch (DECL_FUNCTION_CODE (fndecl
))
8703 case BUILT_IN_MEMSET
:
8704 if (!integer_zerop (maybe_constant_value ((*args
)[1])))
8706 /* Diagnose setting non-copy-assignable or non-trivial types,
8707 or types with a private member, to (potentially) non-zero
8708 bytes. Since the value of the bytes being written is unknown,
8709 suggest using assignment instead (if one exists). Also warn
8710 for writes into objects for which zero-initialization doesn't
8711 mean all bits clear (pointer-to-member data, where null is all
8712 bits set). Since the value being written is (most likely)
8713 non-zero, simply suggest assignment (but not copy assignment). */
8714 suggest
= "; use assignment instead";
8716 warnfmt
= G_("%qD writing to an object of type %#qT with "
8717 "no trivial copy-assignment");
8719 warnfmt
= G_("%qD writing to an object of non-trivial type %#qT%s");
8722 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8723 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8724 "%qD writing to an object of type %#qT with "
8726 fndecl
, desttype
, access
, fld
);
8728 else if (!zero_init_p (desttype
))
8729 warnfmt
= G_("%qD writing to an object of type %#qT containing "
8730 "a pointer to data member%s");
8736 case BUILT_IN_BZERO
:
8737 /* Similarly to the above, diagnose clearing non-trivial or non-
8738 standard layout objects, or objects of types with no assignmenmt.
8739 Since the value being written is known to be zero, suggest either
8740 copy assignment, copy ctor, or default ctor as an alternative,
8741 depending on what's available. */
8743 if (hasassign
&& hasctors
[0])
8744 suggest
= G_("; use assignment or value-initialization instead");
8746 suggest
= G_("; use assignment instead");
8747 else if (hasctors
[0])
8748 suggest
= G_("; use value-initialization instead");
8751 warnfmt
= G_("%qD clearing an object of type %#qT with "
8752 "no trivial copy-assignment%s");
8754 warnfmt
= G_("%qD clearing an object of non-trivial type %#qT%s");
8755 else if (!zero_init_p (desttype
))
8756 warnfmt
= G_("%qD clearing an object of type %#qT containing "
8757 "a pointer-to-member%s");
8760 case BUILT_IN_BCOPY
:
8761 case BUILT_IN_MEMCPY
:
8762 case BUILT_IN_MEMMOVE
:
8763 case BUILT_IN_MEMPCPY
:
8764 /* Determine the type of the source object. */
8765 srctype
= TREE_TYPE ((*args
)[srcidx
]);
8766 if (!srctype
|| !INDIRECT_TYPE_P (srctype
))
8767 srctype
= void_type_node
;
8769 srctype
= TREE_TYPE (srctype
);
8771 /* Since it's impossible to determine wheter the byte copy is
8772 being used in place of assignment to an existing object or
8773 as a substitute for initialization, assume it's the former.
8774 Determine the best alternative to use instead depending on
8775 what's not deleted. */
8776 if (hasassign
&& hasctors
[1])
8777 suggest
= G_("; use copy-assignment or copy-initialization instead");
8779 suggest
= G_("; use copy-assignment instead");
8780 else if (hasctors
[1])
8781 suggest
= G_("; use copy-initialization instead");
8784 warnfmt
= G_("%qD writing to an object of type %#qT with no trivial "
8785 "copy-assignment%s");
8786 else if (!trivially_copyable_p (desttype
))
8787 warnfmt
= G_("%qD writing to an object of non-trivially copyable "
8790 warnfmt
= G_("%qD writing to an object with a deleted copy constructor");
8793 && !VOID_TYPE_P (srctype
)
8794 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
8795 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
8798 /* Warn when copying into a non-trivial object from an object
8799 of a different type other than void or char. */
8800 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8801 "%qD copying an object of non-trivial type "
8802 "%#qT from an array of %#qT",
8803 fndecl
, desttype
, srctype
);
8806 && !VOID_TYPE_P (srctype
)
8807 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
8808 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
8811 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8812 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8813 "%qD copying an object of type %#qT with "
8814 "%qs member %qD from an array of %#qT; use "
8815 "assignment or copy-initialization instead",
8816 fndecl
, desttype
, access
, fld
, srctype
);
8818 else if (!trivial
&& vec_safe_length (args
) > 2)
8820 tree sz
= maybe_constant_value ((*args
)[2]);
8821 if (!tree_fits_uhwi_p (sz
))
8824 /* Finally, warn on partial copies. */
8825 unsigned HOST_WIDE_INT typesize
8826 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype
));
8827 if (unsigned HOST_WIDE_INT partial
= tree_to_uhwi (sz
) % typesize
)
8828 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8829 (typesize
- partial
> 1
8830 ? G_("%qD writing to an object of "
8831 "a non-trivial type %#qT leaves %wu "
8833 : G_("%qD writing to an object of "
8834 "a non-trivial type %#qT leaves %wu "
8836 fndecl
, desttype
, typesize
- partial
);
8840 case BUILT_IN_REALLOC
:
8842 if (!trivially_copyable_p (desttype
))
8843 warnfmt
= G_("%qD moving an object of non-trivially copyable type "
8844 "%#qT; use %<new%> and %<delete%> instead");
8846 warnfmt
= G_("%qD moving an object of type %#qT with deleted copy "
8847 "constructor; use %<new%> and %<delete%> instead");
8848 else if (!get_dtor (desttype
, tf_none
))
8849 warnfmt
= G_("%qD moving an object of type %#qT with deleted "
8853 tree sz
= maybe_constant_value ((*args
)[1]);
8854 if (TREE_CODE (sz
) == INTEGER_CST
8855 && tree_int_cst_lt (sz
, TYPE_SIZE_UNIT (desttype
)))
8856 /* Finally, warn on reallocation into insufficient space. */
8857 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8858 "%qD moving an object of non-trivial type "
8859 "%#qT and size %E into a region of size %E",
8860 fndecl
, desttype
, TYPE_SIZE_UNIT (desttype
),
8872 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8873 warnfmt
, fndecl
, desttype
, suggest
);
8875 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8876 warnfmt
, fndecl
, desttype
);
8880 inform (location_of (desttype
), "%#qT declared here", desttype
);
8883 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
8884 This function performs no overload resolution, conversion, or other
8885 high-level operations. */
8888 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
8889 tsubst_flags_t complain
)
8893 /* Remember roughly where this call is. */
8894 location_t loc
= cp_expr_loc_or_loc (fn
, input_location
);
8895 fn
= build_call_a (fn
, nargs
, argarray
);
8896 SET_EXPR_LOCATION (fn
, loc
);
8898 fndecl
= get_callee_fndecl (fn
);
8900 /* Check that arguments to builtin functions match the expectations. */
8902 && !processing_template_decl
8903 && fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
8907 /* We need to take care that values to BUILT_IN_NORMAL
8909 for (i
= 0; i
< nargs
; i
++)
8910 argarray
[i
] = maybe_constant_value (argarray
[i
]);
8912 if (!check_builtin_function_arguments (EXPR_LOCATION (fn
), vNULL
, fndecl
,
8914 return error_mark_node
;
8917 if (VOID_TYPE_P (TREE_TYPE (fn
)))
8920 /* 5.2.2/11: If a function call is a prvalue of object type: if the
8921 function call is either the operand of a decltype-specifier or the
8922 right operand of a comma operator that is the operand of a
8923 decltype-specifier, a temporary object is not introduced for the
8924 prvalue. The type of the prvalue may be incomplete. */
8925 if (!(complain
& tf_decltype
))
8927 fn
= require_complete_type_sfinae (fn
, complain
);
8928 if (fn
== error_mark_node
)
8929 return error_mark_node
;
8931 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
8933 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
8934 maybe_warn_parm_abi (TREE_TYPE (fn
), loc
);
8937 return convert_from_reference (fn
);
8940 /* Returns the value to use for the in-charge parameter when making a
8941 call to a function with the indicated NAME.
8943 FIXME:Can't we find a neater way to do this mapping? */
8946 in_charge_arg_for_name (tree name
)
8948 if (IDENTIFIER_CTOR_P (name
))
8950 if (name
== complete_ctor_identifier
)
8951 return integer_one_node
;
8952 gcc_checking_assert (name
== base_ctor_identifier
);
8956 if (name
== complete_dtor_identifier
)
8957 return integer_two_node
;
8958 else if (name
== deleting_dtor_identifier
)
8959 return integer_three_node
;
8960 gcc_checking_assert (name
== base_dtor_identifier
);
8963 return integer_zero_node
;
8966 /* We've built up a constructor call RET. Complain if it delegates to the
8967 constructor we're currently compiling. */
8970 check_self_delegation (tree ret
)
8972 if (TREE_CODE (ret
) == TARGET_EXPR
)
8973 ret
= TARGET_EXPR_INITIAL (ret
);
8974 tree fn
= cp_get_callee_fndecl_nofold (ret
);
8975 if (fn
&& DECL_ABSTRACT_ORIGIN (fn
) == current_function_decl
)
8976 error ("constructor delegates to itself");
8979 /* Build a call to a constructor, destructor, or an assignment
8980 operator for INSTANCE, an expression with class type. NAME
8981 indicates the special member function to call; *ARGS are the
8982 arguments. ARGS may be NULL. This may change ARGS. BINFO
8983 indicates the base of INSTANCE that is to be passed as the `this'
8984 parameter to the member function called.
8986 FLAGS are the LOOKUP_* flags to use when processing the call.
8988 If NAME indicates a complete object constructor, INSTANCE may be
8989 NULL_TREE. In this case, the caller will call build_cplus_new to
8990 store the newly constructed object into a VAR_DECL. */
8993 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
8994 tree binfo
, int flags
, tsubst_flags_t complain
)
8997 /* The type of the subobject to be constructed or destroyed. */
8999 vec
<tree
, va_gc
> *allocated
= NULL
;
9002 gcc_assert (IDENTIFIER_CDTOR_P (name
) || name
== assign_op_identifier
);
9004 if (error_operand_p (instance
))
9005 return error_mark_node
;
9007 if (IDENTIFIER_DTOR_P (name
))
9009 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
9010 if (!type_build_dtor_call (TREE_TYPE (instance
)))
9011 /* Shortcut to avoid lazy destructor declaration. */
9012 return build_trivial_dtor_call (instance
);
9017 /* Resolve the name. */
9018 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
9019 return error_mark_node
;
9021 binfo
= TYPE_BINFO (binfo
);
9024 gcc_assert (binfo
!= NULL_TREE
);
9026 class_type
= BINFO_TYPE (binfo
);
9028 /* Handle the special case where INSTANCE is NULL_TREE. */
9029 if (name
== complete_ctor_identifier
&& !instance
)
9030 instance
= build_dummy_object (class_type
);
9033 /* Convert to the base class, if necessary. */
9034 if (!same_type_ignoring_top_level_qualifiers_p
9035 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
9037 if (IDENTIFIER_CDTOR_P (name
))
9038 /* For constructors and destructors, either the base is
9039 non-virtual, or it is virtual but we are doing the
9040 conversion from a constructor or destructor for the
9041 complete object. In either case, we can convert
9043 instance
= convert_to_base_statically (instance
, binfo
);
9046 /* However, for assignment operators, we must convert
9047 dynamically if the base is virtual. */
9048 gcc_checking_assert (name
== assign_op_identifier
);
9049 instance
= build_base_path (PLUS_EXPR
, instance
,
9050 binfo
, /*nonnull=*/1, complain
);
9055 gcc_assert (instance
!= NULL_TREE
);
9057 /* In C++17, "If the initializer expression is a prvalue and the
9058 cv-unqualified version of the source type is the same class as the class
9059 of the destination, the initializer expression is used to initialize the
9060 destination object." Handle that here to avoid doing overload
9062 if (cxx_dialect
>= cxx17
9063 && args
&& vec_safe_length (*args
) == 1
9064 && name
== complete_ctor_identifier
)
9066 tree arg
= (**args
)[0];
9068 if (BRACE_ENCLOSED_INITIALIZER_P (arg
)
9069 && !TYPE_HAS_LIST_CTOR (class_type
)
9070 && CONSTRUCTOR_NELTS (arg
) == 1)
9071 arg
= CONSTRUCTOR_ELT (arg
, 0)->value
;
9073 if ((TREE_CODE (arg
) == TARGET_EXPR
9074 || TREE_CODE (arg
) == CONSTRUCTOR
)
9075 && (same_type_ignoring_top_level_qualifiers_p
9076 (class_type
, TREE_TYPE (arg
))))
9078 if (is_dummy_object (instance
))
9080 else if (TREE_CODE (arg
) == TARGET_EXPR
)
9081 TARGET_EXPR_DIRECT_INIT_P (arg
) = true;
9083 if ((complain
& tf_error
)
9084 && (flags
& LOOKUP_DELEGATING_CONS
))
9085 check_self_delegation (arg
);
9086 /* Avoid change of behavior on Wunused-var-2.C. */
9087 instance
= mark_lvalue_use (instance
);
9088 return build2 (INIT_EXPR
, class_type
, instance
, arg
);
9092 fns
= lookup_fnfields (binfo
, name
, 1);
9094 /* When making a call to a constructor or destructor for a subobject
9095 that uses virtual base classes, pass down a pointer to a VTT for
9097 if ((name
== base_ctor_identifier
9098 || name
== base_dtor_identifier
)
9099 && CLASSTYPE_VBASECLASSES (class_type
))
9104 /* If the current function is a complete object constructor
9105 or destructor, then we fetch the VTT directly.
9106 Otherwise, we look it up using the VTT we were given. */
9107 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
9108 vtt
= decay_conversion (vtt
, complain
);
9109 if (vtt
== error_mark_node
)
9110 return error_mark_node
;
9111 vtt
= build_if_in_charge (vtt
, current_vtt_parm
);
9112 if (BINFO_SUBVTT_INDEX (binfo
))
9113 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
9119 allocated
= make_tree_vector ();
9123 vec_safe_insert (*args
, 0, sub_vtt
);
9126 ret
= build_new_method_call (instance
, fns
, args
,
9127 TYPE_BINFO (BINFO_TYPE (binfo
)),
9131 if (allocated
!= NULL
)
9132 release_tree_vector (allocated
);
9134 if ((complain
& tf_error
)
9135 && (flags
& LOOKUP_DELEGATING_CONS
)
9136 && name
== complete_ctor_identifier
)
9137 check_self_delegation (ret
);
9142 /* Return the NAME, as a C string. The NAME indicates a function that
9143 is a member of TYPE. *FREE_P is set to true if the caller must
9144 free the memory returned.
9146 Rather than go through all of this, we should simply set the names
9147 of constructors and destructors appropriately, and dispense with
9148 ctor_identifier, dtor_identifier, etc. */
9151 name_as_c_string (tree name
, tree type
, bool *free_p
)
9153 const char *pretty_name
;
9155 /* Assume that we will not allocate memory. */
9157 /* Constructors and destructors are special. */
9158 if (IDENTIFIER_CDTOR_P (name
))
9161 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
)));
9162 /* For a destructor, add the '~'. */
9163 if (IDENTIFIER_DTOR_P (name
))
9165 pretty_name
= concat ("~", pretty_name
, NULL
);
9166 /* Remember that we need to free the memory allocated. */
9170 else if (IDENTIFIER_CONV_OP_P (name
))
9172 pretty_name
= concat ("operator ",
9173 type_as_string_translate (TREE_TYPE (name
),
9174 TFF_PLAIN_IDENTIFIER
),
9176 /* Remember that we need to free the memory allocated. */
9180 pretty_name
= identifier_to_locale (IDENTIFIER_POINTER (name
));
9182 return CONST_CAST (char *, pretty_name
);
9185 /* If CANDIDATES contains exactly one candidate, return it, otherwise
9188 static z_candidate
*
9189 single_z_candidate (z_candidate
*candidates
)
9191 if (candidates
== NULL
)
9194 if (candidates
->next
)
9200 /* If CANDIDATE is invalid due to a bad argument type, return the
9201 pertinent conversion_info.
9203 Otherwise, return NULL. */
9205 static const conversion_info
*
9206 maybe_get_bad_conversion_for_unmatched_call (const z_candidate
*candidate
)
9208 /* Must be an rr_arg_conversion or rr_bad_arg_conversion. */
9209 rejection_reason
*r
= candidate
->reason
;
9219 case rr_arg_conversion
:
9220 return &r
->u
.conversion
;
9222 case rr_bad_arg_conversion
:
9223 return &r
->u
.bad_conversion
;
9227 /* Issue an error and note complaining about a bad argument type at a
9228 callsite with a single candidate FNDECL.
9230 ARG_LOC is the location of the argument (or UNKNOWN_LOCATION, in which
9231 case input_location is used).
9232 FROM_TYPE is the type of the actual argument; TO_TYPE is the type of
9233 the formal parameter. */
9236 complain_about_bad_argument (location_t arg_loc
,
9237 tree from_type
, tree to_type
,
9238 tree fndecl
, int parmnum
)
9240 auto_diagnostic_group d
;
9241 range_label_for_type_mismatch
rhs_label (from_type
, to_type
);
9242 range_label
*label
= &rhs_label
;
9243 if (arg_loc
== UNKNOWN_LOCATION
)
9245 arg_loc
= input_location
;
9248 gcc_rich_location
richloc (arg_loc
, label
);
9250 "cannot convert %qH to %qI",
9251 from_type
, to_type
);
9252 inform (get_fndecl_argument_location (fndecl
, parmnum
),
9253 " initializing argument %P of %qD", parmnum
, fndecl
);
9256 /* Subroutine of build_new_method_call_1, for where there are no viable
9257 candidates for the call. */
9260 complain_about_no_candidates_for_method_call (tree instance
,
9261 z_candidate
*candidates
,
9262 tree explicit_targs
,
9264 tree optype
, tree name
,
9265 bool skip_first_for_error
,
9266 vec
<tree
, va_gc
> *user_args
)
9268 auto_diagnostic_group d
;
9269 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
9270 cxx_incomplete_type_error (instance
, basetype
);
9272 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9273 basetype
, optype
, build_tree_list_vec (user_args
),
9274 TREE_TYPE (instance
));
9277 /* Special-case for when there's a single candidate that's failing
9278 due to a bad argument type. */
9279 if (z_candidate
*candidate
= single_z_candidate (candidates
))
9280 if (const conversion_info
*conv
9281 = maybe_get_bad_conversion_for_unmatched_call (candidate
))
9283 complain_about_bad_argument (conv
->loc
,
9284 conv
->from
, conv
->to_type
,
9285 candidate
->fn
, conv
->n_arg
);
9289 tree arglist
= build_tree_list_vec (user_args
);
9290 tree errname
= name
;
9291 bool twiddle
= false;
9292 if (IDENTIFIER_CDTOR_P (errname
))
9294 twiddle
= IDENTIFIER_DTOR_P (errname
);
9295 errname
= constructor_name (basetype
);
9298 errname
= lookup_template_function (errname
, explicit_targs
);
9299 if (skip_first_for_error
)
9300 arglist
= TREE_CHAIN (arglist
);
9301 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
9302 basetype
, &"~"[!twiddle
], errname
, arglist
,
9303 TREE_TYPE (instance
));
9305 print_z_candidates (location_of (name
), candidates
);
9308 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
9309 be set, upon return, to the function called. ARGS may be NULL.
9310 This may change ARGS. */
9313 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9314 tree conversion_path
, int flags
,
9315 tree
*fn_p
, tsubst_flags_t complain
)
9317 struct z_candidate
*candidates
= 0, *cand
;
9318 tree explicit_targs
= NULL_TREE
;
9319 tree basetype
= NULL_TREE
;
9320 tree access_binfo
, binfo
;
9322 tree first_mem_arg
= NULL_TREE
;
9324 bool skip_first_for_error
;
9325 vec
<tree
, va_gc
> *user_args
;
9328 int template_only
= 0;
9332 vec
<tree
, va_gc
> *orig_args
= NULL
;
9335 gcc_assert (instance
!= NULL_TREE
);
9337 /* We don't know what function we're going to call, yet. */
9341 if (error_operand_p (instance
)
9342 || !fns
|| error_operand_p (fns
))
9343 return error_mark_node
;
9345 if (!BASELINK_P (fns
))
9347 if (complain
& tf_error
)
9348 error ("call to non-function %qD", fns
);
9349 return error_mark_node
;
9352 orig_instance
= instance
;
9355 /* Dismantle the baselink to collect all the information we need. */
9356 if (!conversion_path
)
9357 conversion_path
= BASELINK_BINFO (fns
);
9358 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
9359 binfo
= BASELINK_BINFO (fns
);
9360 optype
= BASELINK_OPTYPE (fns
);
9361 fns
= BASELINK_FUNCTIONS (fns
);
9362 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
9364 explicit_targs
= TREE_OPERAND (fns
, 1);
9365 fns
= TREE_OPERAND (fns
, 0);
9368 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
9369 || TREE_CODE (fns
) == TEMPLATE_DECL
9370 || TREE_CODE (fns
) == OVERLOAD
);
9371 fn
= OVL_FIRST (fns
);
9372 name
= DECL_NAME (fn
);
9374 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
9375 gcc_assert (CLASS_TYPE_P (basetype
));
9377 user_args
= args
== NULL
? NULL
: *args
;
9378 /* Under DR 147 A::A() is an invalid constructor call,
9379 not a functional cast. */
9380 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
9382 if (! (complain
& tf_error
))
9383 return error_mark_node
;
9385 basetype
= DECL_CONTEXT (fn
);
9386 name
= constructor_name (basetype
);
9387 auto_diagnostic_group d
;
9388 if (permerror (input_location
,
9389 "cannot call constructor %<%T::%D%> directly",
9391 inform (input_location
, "for a function-style cast, remove the "
9392 "redundant %<::%D%>", name
);
9393 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
9398 if (processing_template_decl
)
9400 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
9401 instance
= build_non_dependent_expr (instance
);
9403 make_args_non_dependent (*args
);
9406 /* Process the argument list. */
9407 if (args
!= NULL
&& *args
!= NULL
)
9409 *args
= resolve_args (*args
, complain
);
9411 return error_mark_node
;
9415 /* Consider the object argument to be used even if we end up selecting a
9416 static member function. */
9417 instance
= mark_type_use (instance
);
9419 /* Figure out whether to skip the first argument for the error
9420 message we will display to users if an error occurs. We don't
9421 want to display any compiler-generated arguments. The "this"
9422 pointer hasn't been added yet. However, we must remove the VTT
9423 pointer if this is a call to a base-class constructor or
9425 skip_first_for_error
= false;
9426 if (IDENTIFIER_CDTOR_P (name
))
9428 /* Callers should explicitly indicate whether they want to ctor
9429 the complete object or just the part without virtual bases. */
9430 gcc_assert (name
!= ctor_identifier
);
9432 /* Remove the VTT pointer, if present. */
9433 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
9434 && CLASSTYPE_VBASECLASSES (basetype
))
9435 skip_first_for_error
= true;
9437 /* It's OK to call destructors and constructors on cv-qualified
9438 objects. Therefore, convert the INSTANCE to the unqualified
9439 type, if necessary. */
9440 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
9442 instance
= build_this (instance
);
9443 instance
= build_nop (build_pointer_type (basetype
), instance
);
9444 instance
= build_fold_indirect_ref (instance
);
9448 gcc_assert (!DECL_DESTRUCTOR_P (fn
) && !DECL_CONSTRUCTOR_P (fn
));
9450 /* For the overload resolution we need to find the actual `this`
9451 that would be captured if the call turns out to be to a
9452 non-static member function. Do not actually capture it at this
9454 if (DECL_CONSTRUCTOR_P (fn
))
9455 /* Constructors don't use the enclosing 'this'. */
9456 first_mem_arg
= instance
;
9458 first_mem_arg
= maybe_resolve_dummy (instance
, false);
9460 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9461 p
= conversion_obstack_alloc (0);
9463 /* The number of arguments artificial parms in ARGS; we subtract one because
9464 there's no 'this' in ARGS. */
9465 unsigned skip
= num_artificial_parms_for (fn
) - 1;
9467 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
9468 initializer, not T({ }). */
9469 if (DECL_CONSTRUCTOR_P (fn
)
9470 && vec_safe_length (user_args
) > skip
9471 && DIRECT_LIST_INIT_P ((*user_args
)[skip
]))
9473 tree init_list
= (*user_args
)[skip
];
9474 tree init
= NULL_TREE
;
9476 gcc_assert (user_args
->length () == skip
+ 1
9477 && !(flags
& LOOKUP_ONLYCONVERTING
));
9479 /* If the initializer list has no elements and T is a class type with
9480 a default constructor, the object is value-initialized. Handle
9481 this here so we don't need to handle it wherever we use
9482 build_special_member_call. */
9483 if (CONSTRUCTOR_NELTS (init_list
) == 0
9484 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
9485 /* For a user-provided default constructor, use the normal
9486 mechanisms so that protected access works. */
9487 && type_has_non_user_provided_default_constructor (basetype
)
9488 && !processing_template_decl
)
9489 init
= build_value_init (basetype
, complain
);
9491 /* If BASETYPE is an aggregate, we need to do aggregate
9493 else if (CP_AGGREGATE_TYPE_P (basetype
))
9495 init
= reshape_init (basetype
, init_list
, complain
);
9496 init
= digest_init (basetype
, init
, complain
);
9501 if (is_dummy_object (instance
))
9502 return get_target_expr_sfinae (init
, complain
);
9503 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
9504 TREE_SIDE_EFFECTS (init
) = true;
9508 /* Otherwise go ahead with overload resolution. */
9509 add_list_candidates (fns
, first_mem_arg
, user_args
,
9510 basetype
, explicit_targs
, template_only
,
9511 conversion_path
, access_binfo
, flags
,
9512 &candidates
, complain
);
9515 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
9516 explicit_targs
, template_only
, conversion_path
,
9517 access_binfo
, flags
, &candidates
, complain
);
9519 any_viable_p
= false;
9520 candidates
= splice_viable (candidates
, false, &any_viable_p
);
9524 if (complain
& tf_error
)
9525 complain_about_no_candidates_for_method_call (instance
, candidates
,
9526 explicit_targs
, basetype
,
9528 skip_first_for_error
,
9530 call
= error_mark_node
;
9534 cand
= tourney (candidates
, complain
);
9541 if (complain
& tf_error
)
9543 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
9544 arglist
= build_tree_list_vec (user_args
);
9545 if (skip_first_for_error
)
9546 arglist
= TREE_CHAIN (arglist
);
9547 auto_diagnostic_group d
;
9548 if (!any_strictly_viable (candidates
))
9549 error ("no matching function for call to %<%s(%A)%>",
9550 pretty_name
, arglist
);
9552 error ("call of overloaded %<%s(%A)%> is ambiguous",
9553 pretty_name
, arglist
);
9554 print_z_candidates (location_of (name
), candidates
);
9558 call
= error_mark_node
;
9565 if (!(flags
& LOOKUP_NONVIRTUAL
)
9566 && DECL_PURE_VIRTUAL_P (fn
)
9567 && instance
== current_class_ref
9568 && (complain
& tf_warning
))
9570 /* This is not an error, it is runtime undefined
9572 if (!current_function_decl
)
9573 warning (0, "pure virtual %q#D called from "
9574 "non-static data member initializer", fn
);
9575 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
9576 || DECL_DESTRUCTOR_P (current_function_decl
))
9577 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
9578 ? G_("pure virtual %q#D called from constructor")
9579 : G_("pure virtual %q#D called from destructor")),
9583 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
9584 && !DECL_CONSTRUCTOR_P (fn
)
9585 && is_dummy_object (instance
))
9587 instance
= maybe_resolve_dummy (instance
, true);
9588 if (instance
== error_mark_node
)
9589 call
= error_mark_node
;
9590 else if (!is_dummy_object (instance
))
9592 /* We captured 'this' in the current lambda now that
9593 we know we really need it. */
9594 cand
->first_arg
= instance
;
9596 else if (any_dependent_bases_p ())
9597 /* We can't tell until instantiation time whether we can use
9598 *this as the implicit object argument. */;
9601 if (complain
& tf_error
)
9602 error ("cannot call member function %qD without object",
9604 call
= error_mark_node
;
9608 if (call
!= error_mark_node
)
9610 /* Optimize away vtable lookup if we know that this
9611 function can't be overridden. We need to check if
9612 the context and the type where we found fn are the same,
9613 actually FN might be defined in a different class
9614 type because of a using-declaration. In this case, we
9615 do not want to perform a non-virtual call. */
9616 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
9617 && same_type_ignoring_top_level_qualifiers_p
9618 (DECL_CONTEXT (fn
), BINFO_TYPE (binfo
))
9619 && resolves_to_fixed_type_p (instance
, 0))
9620 flags
|= LOOKUP_NONVIRTUAL
;
9622 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
9623 /* Now we know what function is being called. */
9626 /* Build the actual CALL_EXPR. */
9627 call
= build_over_call (cand
, flags
, complain
);
9628 /* In an expression of the form `a->f()' where `f' turns
9629 out to be a static member function, `a' is
9630 none-the-less evaluated. */
9631 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
9632 && !is_dummy_object (instance
)
9633 && TREE_SIDE_EFFECTS (instance
))
9635 /* But avoid the implicit lvalue-rvalue conversion when 'a'
9638 if (TREE_THIS_VOLATILE (a
))
9640 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
), a
, call
);
9642 else if (call
!= error_mark_node
9643 && DECL_DESTRUCTOR_P (cand
->fn
)
9644 && !VOID_TYPE_P (TREE_TYPE (call
)))
9645 /* An explicit call of the form "x->~X()" has type
9646 "void". However, on platforms where destructors
9647 return "this" (i.e., those where
9648 targetm.cxx.cdtor_returns_this is true), such calls
9649 will appear to have a return value of pointer type
9650 to the low-level call machinery. We do not want to
9651 change the low-level machinery, since we want to be
9652 able to optimize "delete f()" on such platforms as
9653 "operator delete(~X(f()))" (rather than generating
9654 "t = f(), ~X(t), operator delete (t)"). */
9655 call
= build_nop (void_type_node
, call
);
9660 if (processing_template_decl
&& call
!= error_mark_node
)
9662 bool cast_to_void
= false;
9664 if (TREE_CODE (call
) == COMPOUND_EXPR
)
9665 call
= TREE_OPERAND (call
, 1);
9666 else if (TREE_CODE (call
) == NOP_EXPR
)
9668 cast_to_void
= true;
9669 call
= TREE_OPERAND (call
, 0);
9671 if (INDIRECT_REF_P (call
))
9672 call
= TREE_OPERAND (call
, 0);
9673 call
= (build_min_non_dep_call_vec
9675 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
9676 orig_instance
, orig_fns
, NULL_TREE
),
9678 SET_EXPR_LOCATION (call
, input_location
);
9679 call
= convert_from_reference (call
);
9681 call
= build_nop (void_type_node
, call
);
9684 /* Free all the conversions we allocated. */
9685 obstack_free (&conversion_obstack
, p
);
9687 if (orig_args
!= NULL
)
9688 release_tree_vector (orig_args
);
9693 /* Wrapper for above. */
9696 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9697 tree conversion_path
, int flags
,
9698 tree
*fn_p
, tsubst_flags_t complain
)
9701 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
9702 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
9704 timevar_cond_stop (TV_OVERLOAD
, subtime
);
9708 /* Returns true iff standard conversion sequence ICS1 is a proper
9709 subsequence of ICS2. */
9712 is_subseq (conversion
*ics1
, conversion
*ics2
)
9714 /* We can assume that a conversion of the same code
9715 between the same types indicates a subsequence since we only get
9716 here if the types we are converting from are the same. */
9718 while (ics1
->kind
== ck_rvalue
9719 || ics1
->kind
== ck_lvalue
)
9720 ics1
= next_conversion (ics1
);
9724 while (ics2
->kind
== ck_rvalue
9725 || ics2
->kind
== ck_lvalue
)
9726 ics2
= next_conversion (ics2
);
9728 if (ics2
->kind
== ck_user
9729 || ics2
->kind
== ck_ambig
9730 || ics2
->kind
== ck_aggr
9731 || ics2
->kind
== ck_list
9732 || ics2
->kind
== ck_identity
)
9733 /* At this point, ICS1 cannot be a proper subsequence of
9734 ICS2. We can get a USER_CONV when we are comparing the
9735 second standard conversion sequence of two user conversion
9739 ics2
= next_conversion (ics2
);
9741 while (ics2
->kind
== ck_rvalue
9742 || ics2
->kind
== ck_lvalue
)
9743 ics2
= next_conversion (ics2
);
9745 if (ics2
->kind
== ics1
->kind
9746 && same_type_p (ics2
->type
, ics1
->type
)
9747 && (ics1
->kind
== ck_identity
9748 || same_type_p (next_conversion (ics2
)->type
,
9749 next_conversion (ics1
)->type
)))
9754 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
9755 be any _TYPE nodes. */
9758 is_properly_derived_from (tree derived
, tree base
)
9760 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
9763 /* We only allow proper derivation here. The DERIVED_FROM_P macro
9764 considers every class derived from itself. */
9765 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
9766 && DERIVED_FROM_P (base
, derived
));
9769 /* We build the ICS for an implicit object parameter as a pointer
9770 conversion sequence. However, such a sequence should be compared
9771 as if it were a reference conversion sequence. If ICS is the
9772 implicit conversion sequence for an implicit object parameter,
9773 modify it accordingly. */
9776 maybe_handle_implicit_object (conversion
**ics
)
9780 /* [over.match.funcs]
9782 For non-static member functions, the type of the
9783 implicit object parameter is "reference to cv X"
9784 where X is the class of which the function is a
9785 member and cv is the cv-qualification on the member
9786 function declaration. */
9787 conversion
*t
= *ics
;
9788 tree reference_type
;
9790 /* The `this' parameter is a pointer to a class type. Make the
9791 implicit conversion talk about a reference to that same class
9793 reference_type
= TREE_TYPE (t
->type
);
9794 reference_type
= build_reference_type (reference_type
);
9796 if (t
->kind
== ck_qual
)
9797 t
= next_conversion (t
);
9798 if (t
->kind
== ck_ptr
)
9799 t
= next_conversion (t
);
9800 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
9801 t
= direct_reference_binding (reference_type
, t
);
9803 t
->rvaluedness_matches_p
= 0;
9808 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
9809 and return the initial reference binding conversion. Otherwise,
9810 leave *ICS unchanged and return NULL. */
9813 maybe_handle_ref_bind (conversion
**ics
)
9815 if ((*ics
)->kind
== ck_ref_bind
)
9817 conversion
*old_ics
= *ics
;
9818 *ics
= next_conversion (old_ics
);
9819 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
9826 /* Compare two implicit conversion sequences according to the rules set out in
9827 [over.ics.rank]. Return values:
9829 1: ics1 is better than ics2
9830 -1: ics2 is better than ics1
9831 0: ics1 and ics2 are indistinguishable */
9834 compare_ics (conversion
*ics1
, conversion
*ics2
)
9840 tree deref_from_type1
= NULL_TREE
;
9841 tree deref_from_type2
= NULL_TREE
;
9842 tree deref_to_type1
= NULL_TREE
;
9843 tree deref_to_type2
= NULL_TREE
;
9844 conversion_rank rank1
, rank2
;
9846 /* REF_BINDING is nonzero if the result of the conversion sequence
9847 is a reference type. In that case REF_CONV is the reference
9848 binding conversion. */
9849 conversion
*ref_conv1
;
9850 conversion
*ref_conv2
;
9852 /* Compare badness before stripping the reference conversion. */
9853 if (ics1
->bad_p
> ics2
->bad_p
)
9855 else if (ics1
->bad_p
< ics2
->bad_p
)
9858 /* Handle implicit object parameters. */
9859 maybe_handle_implicit_object (&ics1
);
9860 maybe_handle_implicit_object (&ics2
);
9862 /* Handle reference parameters. */
9863 ref_conv1
= maybe_handle_ref_bind (&ics1
);
9864 ref_conv2
= maybe_handle_ref_bind (&ics2
);
9866 /* List-initialization sequence L1 is a better conversion sequence than
9867 list-initialization sequence L2 if L1 converts to
9868 std::initializer_list<X> for some X and L2 does not. */
9869 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
9871 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
9876 When comparing the basic forms of implicit conversion sequences (as
9877 defined in _over.best.ics_)
9879 --a standard conversion sequence (_over.ics.scs_) is a better
9880 conversion sequence than a user-defined conversion sequence
9881 or an ellipsis conversion sequence, and
9883 --a user-defined conversion sequence (_over.ics.user_) is a
9884 better conversion sequence than an ellipsis conversion sequence
9885 (_over.ics.ellipsis_). */
9886 /* Use BAD_CONVERSION_RANK because we already checked for a badness
9887 mismatch. If both ICS are bad, we try to make a decision based on
9888 what would have happened if they'd been good. This is not an
9889 extension, we'll still give an error when we build up the call; this
9890 just helps us give a more helpful error message. */
9891 rank1
= BAD_CONVERSION_RANK (ics1
);
9892 rank2
= BAD_CONVERSION_RANK (ics2
);
9896 else if (rank1
< rank2
)
9899 if (ics1
->ellipsis_p
)
9900 /* Both conversions are ellipsis conversions. */
9903 /* User-defined conversion sequence U1 is a better conversion sequence
9904 than another user-defined conversion sequence U2 if they contain the
9905 same user-defined conversion operator or constructor and if the sec-
9906 ond standard conversion sequence of U1 is better than the second
9907 standard conversion sequence of U2. */
9909 /* Handle list-conversion with the same code even though it isn't always
9910 ranked as a user-defined conversion and it doesn't have a second
9911 standard conversion sequence; it will still have the desired effect.
9912 Specifically, we need to do the reference binding comparison at the
9913 end of this function. */
9915 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
|| ics1
->kind
== ck_aggr
)
9920 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
9921 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
9922 || t1
->kind
== ck_list
)
9924 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
9925 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
9926 || t2
->kind
== ck_list
)
9929 if (t1
->kind
!= t2
->kind
)
9931 else if (t1
->kind
== ck_user
)
9933 tree f1
= t1
->cand
? t1
->cand
->fn
: t1
->type
;
9934 tree f2
= t2
->cand
? t2
->cand
->fn
: t2
->type
;
9940 /* For ambiguous or aggregate conversions, use the target type as
9941 a proxy for the conversion function. */
9942 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
9946 /* We can just fall through here, after setting up
9947 FROM_TYPE1 and FROM_TYPE2. */
9948 from_type1
= t1
->type
;
9949 from_type2
= t2
->type
;
9956 /* We're dealing with two standard conversion sequences.
9960 Standard conversion sequence S1 is a better conversion
9961 sequence than standard conversion sequence S2 if
9963 --S1 is a proper subsequence of S2 (comparing the conversion
9964 sequences in the canonical form defined by _over.ics.scs_,
9965 excluding any Lvalue Transformation; the identity
9966 conversion sequence is considered to be a subsequence of
9967 any non-identity conversion sequence */
9970 while (t1
->kind
!= ck_identity
)
9971 t1
= next_conversion (t1
);
9972 from_type1
= t1
->type
;
9975 while (t2
->kind
!= ck_identity
)
9976 t2
= next_conversion (t2
);
9977 from_type2
= t2
->type
;
9980 /* One sequence can only be a subsequence of the other if they start with
9981 the same type. They can start with different types when comparing the
9982 second standard conversion sequence in two user-defined conversion
9984 if (same_type_p (from_type1
, from_type2
))
9986 if (is_subseq (ics1
, ics2
))
9988 if (is_subseq (ics2
, ics1
))
9996 --the rank of S1 is better than the rank of S2 (by the rules
9999 Standard conversion sequences are ordered by their ranks: an Exact
10000 Match is a better conversion than a Promotion, which is a better
10001 conversion than a Conversion.
10003 Two conversion sequences with the same rank are indistinguishable
10004 unless one of the following rules applies:
10006 --A conversion that does not a convert a pointer, pointer to member,
10007 or std::nullptr_t to bool is better than one that does.
10009 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
10010 so that we do not have to check it explicitly. */
10011 if (ics1
->rank
< ics2
->rank
)
10013 else if (ics2
->rank
< ics1
->rank
)
10016 to_type1
= ics1
->type
;
10017 to_type2
= ics2
->type
;
10019 /* A conversion from scalar arithmetic type to complex is worse than a
10020 conversion between scalar arithmetic types. */
10021 if (same_type_p (from_type1
, from_type2
)
10022 && ARITHMETIC_TYPE_P (from_type1
)
10023 && ARITHMETIC_TYPE_P (to_type1
)
10024 && ARITHMETIC_TYPE_P (to_type2
)
10025 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
10026 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
10028 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
10034 if (TYPE_PTR_P (from_type1
)
10035 && TYPE_PTR_P (from_type2
)
10036 && TYPE_PTR_P (to_type1
)
10037 && TYPE_PTR_P (to_type2
))
10039 deref_from_type1
= TREE_TYPE (from_type1
);
10040 deref_from_type2
= TREE_TYPE (from_type2
);
10041 deref_to_type1
= TREE_TYPE (to_type1
);
10042 deref_to_type2
= TREE_TYPE (to_type2
);
10044 /* The rules for pointers to members A::* are just like the rules
10045 for pointers A*, except opposite: if B is derived from A then
10046 A::* converts to B::*, not vice versa. For that reason, we
10047 switch the from_ and to_ variables here. */
10048 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
10049 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
10050 || (TYPE_PTRMEMFUNC_P (from_type1
)
10051 && TYPE_PTRMEMFUNC_P (from_type2
)
10052 && TYPE_PTRMEMFUNC_P (to_type1
)
10053 && TYPE_PTRMEMFUNC_P (to_type2
)))
10055 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
10056 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
10057 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
10058 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
10061 if (deref_from_type1
!= NULL_TREE
10062 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
10063 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
10065 /* This was one of the pointer or pointer-like conversions.
10069 --If class B is derived directly or indirectly from class A,
10070 conversion of B* to A* is better than conversion of B* to
10071 void*, and conversion of A* to void* is better than
10072 conversion of B* to void*. */
10073 if (VOID_TYPE_P (deref_to_type1
)
10074 && VOID_TYPE_P (deref_to_type2
))
10076 if (is_properly_derived_from (deref_from_type1
,
10079 else if (is_properly_derived_from (deref_from_type2
,
10083 else if (VOID_TYPE_P (deref_to_type1
)
10084 || VOID_TYPE_P (deref_to_type2
))
10086 if (same_type_p (deref_from_type1
, deref_from_type2
))
10088 if (VOID_TYPE_P (deref_to_type2
))
10090 if (is_properly_derived_from (deref_from_type1
,
10094 /* We know that DEREF_TO_TYPE1 is `void' here. */
10095 else if (is_properly_derived_from (deref_from_type1
,
10100 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
10101 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
10105 --If class B is derived directly or indirectly from class A
10106 and class C is derived directly or indirectly from B,
10108 --conversion of C* to B* is better than conversion of C* to
10111 --conversion of B* to A* is better than conversion of C* to
10113 if (same_type_p (deref_from_type1
, deref_from_type2
))
10115 if (is_properly_derived_from (deref_to_type1
,
10118 else if (is_properly_derived_from (deref_to_type2
,
10122 else if (same_type_p (deref_to_type1
, deref_to_type2
))
10124 if (is_properly_derived_from (deref_from_type2
,
10127 else if (is_properly_derived_from (deref_from_type1
,
10133 else if (CLASS_TYPE_P (non_reference (from_type1
))
10134 && same_type_p (from_type1
, from_type2
))
10136 tree from
= non_reference (from_type1
);
10140 --binding of an expression of type C to a reference of type
10141 B& is better than binding an expression of type C to a
10142 reference of type A&
10144 --conversion of C to B is better than conversion of C to A, */
10145 if (is_properly_derived_from (from
, to_type1
)
10146 && is_properly_derived_from (from
, to_type2
))
10148 if (is_properly_derived_from (to_type1
, to_type2
))
10150 else if (is_properly_derived_from (to_type2
, to_type1
))
10154 else if (CLASS_TYPE_P (non_reference (to_type1
))
10155 && same_type_p (to_type1
, to_type2
))
10157 tree to
= non_reference (to_type1
);
10161 --binding of an expression of type B to a reference of type
10162 A& is better than binding an expression of type C to a
10163 reference of type A&,
10165 --conversion of B to A is better than conversion of C to A */
10166 if (is_properly_derived_from (from_type1
, to
)
10167 && is_properly_derived_from (from_type2
, to
))
10169 if (is_properly_derived_from (from_type2
, from_type1
))
10171 else if (is_properly_derived_from (from_type1
, from_type2
))
10178 --S1 and S2 differ only in their qualification conversion and yield
10179 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
10180 qualification signature of type T1 is a proper subset of the cv-
10181 qualification signature of type T2 */
10182 if (ics1
->kind
== ck_qual
10183 && ics2
->kind
== ck_qual
10184 && same_type_p (from_type1
, from_type2
))
10186 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
10193 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
10194 to an implicit object parameter of a non-static member function
10195 declared without a ref-qualifier, and either S1 binds an lvalue
10196 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
10197 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
10198 draft standard, 13.3.3.2)
10200 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
10201 types to which the references refer are the same type except for
10202 top-level cv-qualifiers, and the type to which the reference
10203 initialized by S2 refers is more cv-qualified than the type to
10204 which the reference initialized by S1 refers.
10206 DR 1328 [over.match.best]: the context is an initialization by
10207 conversion function for direct reference binding (13.3.1.6) of a
10208 reference to function type, the return type of F1 is the same kind of
10209 reference (i.e. lvalue or rvalue) as the reference being initialized,
10210 and the return type of F2 is not. */
10212 if (ref_conv1
&& ref_conv2
)
10214 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
10215 && (ref_conv1
->rvaluedness_matches_p
10216 != ref_conv2
->rvaluedness_matches_p
)
10217 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
10218 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
10219 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
10221 if (ref_conv1
->bad_p
10222 && !same_type_p (TREE_TYPE (ref_conv1
->type
),
10223 TREE_TYPE (ref_conv2
->type
)))
10224 /* Don't prefer a bad conversion that drops cv-quals to a bad
10225 conversion with the wrong rvalueness. */
10227 return (ref_conv1
->rvaluedness_matches_p
10228 - ref_conv2
->rvaluedness_matches_p
);
10231 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
10233 int q1
= cp_type_quals (TREE_TYPE (ref_conv1
->type
));
10234 int q2
= cp_type_quals (TREE_TYPE (ref_conv2
->type
));
10235 if (ref_conv1
->bad_p
)
10237 /* Prefer the one that drops fewer cv-quals. */
10238 tree ftype
= next_conversion (ref_conv1
)->type
;
10239 int fquals
= cp_type_quals (ftype
);
10243 return comp_cv_qualification (q2
, q1
);
10247 /* Neither conversion sequence is better than the other. */
10251 /* The source type for this standard conversion sequence. */
10254 source_type (conversion
*t
)
10256 for (;; t
= next_conversion (t
))
10258 if (t
->kind
== ck_user
10259 || t
->kind
== ck_ambig
10260 || t
->kind
== ck_identity
)
10263 gcc_unreachable ();
10266 /* Note a warning about preferring WINNER to LOSER. We do this by storing
10267 a pointer to LOSER and re-running joust to produce the warning if WINNER
10268 is actually used. */
10271 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
10273 candidate_warning
*cw
= (candidate_warning
*)
10274 conversion_obstack_alloc (sizeof (candidate_warning
));
10276 cw
->next
= winner
->warnings
;
10277 winner
->warnings
= cw
;
10280 /* Compare two candidates for overloading as described in
10281 [over.match.best]. Return values:
10283 1: cand1 is better than cand2
10284 -1: cand2 is better than cand1
10285 0: cand1 and cand2 are indistinguishable */
10288 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
10289 tsubst_flags_t complain
)
10292 int off1
= 0, off2
= 0;
10296 /* Candidates that involve bad conversions are always worse than those
10298 if (cand1
->viable
> cand2
->viable
)
10300 if (cand1
->viable
< cand2
->viable
)
10303 /* If we have two pseudo-candidates for conversions to the same type,
10304 or two candidates for the same function, arbitrarily pick one. */
10305 if (cand1
->fn
== cand2
->fn
10306 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
10309 /* Prefer a non-deleted function over an implicitly deleted move
10310 constructor or assignment operator. This differs slightly from the
10311 wording for issue 1402 (which says the move op is ignored by overload
10312 resolution), but this way produces better error messages. */
10313 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
10314 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
10315 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
10317 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
10318 && move_fn_p (cand1
->fn
))
10320 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
10321 && move_fn_p (cand2
->fn
))
10325 /* a viable function F1
10326 is defined to be a better function than another viable function F2 if
10327 for all arguments i, ICSi(F1) is not a worse conversion sequence than
10328 ICSi(F2), and then */
10330 /* for some argument j, ICSj(F1) is a better conversion sequence than
10333 /* For comparing static and non-static member functions, we ignore
10334 the implicit object parameter of the non-static function. The
10335 standard says to pretend that the static function has an object
10336 parm, but that won't work with operator overloading. */
10337 len
= cand1
->num_convs
;
10338 if (len
!= cand2
->num_convs
)
10340 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
10341 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
10343 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
10344 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
10345 /* We're comparing a near-match list constructor and a near-match
10346 non-list constructor. Just treat them as unordered. */
10349 gcc_assert (static_1
!= static_2
);
10360 for (i
= 0; i
< len
; ++i
)
10362 conversion
*t1
= cand1
->convs
[i
+ off1
];
10363 conversion
*t2
= cand2
->convs
[i
+ off2
];
10364 int comp
= compare_ics (t1
, t2
);
10368 if ((complain
& tf_warning
)
10370 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
10371 == cr_std
+ cr_promotion
)
10372 && t1
->kind
== ck_std
10373 && t2
->kind
== ck_std
10374 && TREE_CODE (t1
->type
) == INTEGER_TYPE
10375 && TREE_CODE (t2
->type
) == INTEGER_TYPE
10376 && (TYPE_PRECISION (t1
->type
)
10377 == TYPE_PRECISION (t2
->type
))
10378 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
10379 || (TREE_CODE (next_conversion (t1
)->type
)
10380 == ENUMERAL_TYPE
)))
10382 tree type
= next_conversion (t1
)->type
;
10384 struct z_candidate
*w
, *l
;
10386 type1
= t1
->type
, type2
= t2
->type
,
10387 w
= cand1
, l
= cand2
;
10389 type1
= t2
->type
, type2
= t1
->type
,
10390 w
= cand2
, l
= cand1
;
10394 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
10395 type
, type1
, type2
);
10396 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
10399 add_warning (w
, l
);
10402 if (winner
&& comp
!= winner
)
10411 /* warn about confusing overload resolution for user-defined conversions,
10412 either between a constructor and a conversion op, or between two
10414 if ((complain
& tf_warning
)
10415 && winner
&& warn_conversion
&& cand1
->second_conv
10416 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
10417 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
10419 struct z_candidate
*w
, *l
;
10420 bool give_warning
= false;
10423 w
= cand1
, l
= cand2
;
10425 w
= cand2
, l
= cand1
;
10427 /* We don't want to complain about `X::operator T1 ()'
10428 beating `X::operator T2 () const', when T2 is a no less
10429 cv-qualified version of T1. */
10430 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
10431 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
10433 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
10434 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
10436 if (TREE_CODE (t
) == TREE_CODE (f
) && INDIRECT_TYPE_P (t
))
10441 if (!comp_ptr_ttypes (t
, f
))
10442 give_warning
= true;
10445 give_warning
= true;
10451 tree source
= source_type (w
->convs
[0]);
10452 if (INDIRECT_TYPE_P (source
))
10453 source
= TREE_TYPE (source
);
10454 auto_diagnostic_group d
;
10455 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
10456 && warning (OPT_Wconversion
, " for conversion from %qH to %qI",
10457 source
, w
->second_conv
->type
))
10459 inform (input_location
, " because conversion sequence for the argument is better");
10463 add_warning (w
, l
);
10469 /* DR 495 moved this tiebreaker above the template ones. */
10470 /* or, if not that,
10471 the context is an initialization by user-defined conversion (see
10472 _dcl.init_ and _over.match.user_) and the standard conversion
10473 sequence from the return type of F1 to the destination type (i.e.,
10474 the type of the entity being initialized) is a better conversion
10475 sequence than the standard conversion sequence from the return type
10476 of F2 to the destination type. */
10478 if (cand1
->second_conv
)
10480 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
10485 /* or, if not that,
10486 F1 is a non-template function and F2 is a template function
10489 if (!cand1
->template_decl
&& cand2
->template_decl
)
10491 else if (cand1
->template_decl
&& !cand2
->template_decl
)
10494 /* or, if not that,
10495 F1 and F2 are template functions and the function template for F1 is
10496 more specialized than the template for F2 according to the partial
10499 if (cand1
->template_decl
&& cand2
->template_decl
)
10501 winner
= more_specialized_fn
10502 (TI_TEMPLATE (cand1
->template_decl
),
10503 TI_TEMPLATE (cand2
->template_decl
),
10504 /* [temp.func.order]: The presence of unused ellipsis and default
10505 arguments has no effect on the partial ordering of function
10506 templates. add_function_candidate() will not have
10507 counted the "this" argument for constructors. */
10508 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
10514 // or, if not that, F1 is more constrained than F2.
10515 if (flag_concepts
&& DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
))
10517 winner
= more_constrained (cand1
->fn
, cand2
->fn
);
10522 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
10523 if (deduction_guide_p (cand1
->fn
))
10525 gcc_assert (deduction_guide_p (cand2
->fn
));
10526 /* We distinguish between candidates from an explicit deduction guide and
10527 candidates built from a constructor based on DECL_ARTIFICIAL. */
10528 int art1
= DECL_ARTIFICIAL (cand1
->fn
);
10529 int art2
= DECL_ARTIFICIAL (cand2
->fn
);
10531 return art2
- art1
;
10535 /* Prefer the special copy guide over a declared copy/move
10537 if (copy_guide_p (cand1
->fn
))
10539 if (copy_guide_p (cand2
->fn
))
10542 /* Prefer a candidate generated from a non-template constructor. */
10543 int tg1
= template_guide_p (cand1
->fn
);
10544 int tg2
= template_guide_p (cand2
->fn
);
10550 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
10551 for all arguments the corresponding parameters of F1 and F2 have the same
10552 type (CWG 2273/2277). */
10553 if (DECL_P (cand1
->fn
) && DECL_CLASS_SCOPE_P (cand1
->fn
)
10554 && !DECL_CONV_FN_P (cand1
->fn
)
10555 && DECL_P (cand2
->fn
) && DECL_CLASS_SCOPE_P (cand2
->fn
)
10556 && !DECL_CONV_FN_P (cand2
->fn
))
10558 tree base1
= DECL_CONTEXT (strip_inheriting_ctors (cand1
->fn
));
10559 tree base2
= DECL_CONTEXT (strip_inheriting_ctors (cand2
->fn
));
10561 bool used1
= false;
10562 bool used2
= false;
10563 if (base1
== base2
)
10564 /* No difference. */;
10565 else if (DERIVED_FROM_P (base1
, base2
))
10567 else if (DERIVED_FROM_P (base2
, base1
))
10570 if (int diff
= used2
- used1
)
10572 for (i
= 0; i
< len
; ++i
)
10574 conversion
*t1
= cand1
->convs
[i
+ off1
];
10575 conversion
*t2
= cand2
->convs
[i
+ off2
];
10576 if (!same_type_p (t1
->type
, t2
->type
))
10584 /* Check whether we can discard a builtin candidate, either because we
10585 have two identical ones or matching builtin and non-builtin candidates.
10587 (Pedantically in the latter case the builtin which matched the user
10588 function should not be added to the overload set, but we spot it here.
10591 ... the builtin candidates include ...
10592 - do not have the same parameter type list as any non-template
10593 non-member candidate. */
10595 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
10597 for (i
= 0; i
< len
; ++i
)
10598 if (!same_type_p (cand1
->convs
[i
]->type
,
10599 cand2
->convs
[i
]->type
))
10601 if (i
== cand1
->num_convs
)
10603 if (cand1
->fn
== cand2
->fn
)
10604 /* Two built-in candidates; arbitrarily pick one. */
10606 else if (identifier_p (cand1
->fn
))
10607 /* cand1 is built-in; prefer cand2. */
10610 /* cand2 is built-in; prefer cand1. */
10615 /* For candidates of a multi-versioned function, make the version with
10616 the highest priority win. This version will be checked for dispatching
10617 first. If this version can be inlined into the caller, the front-end
10618 will simply make a direct call to this function. */
10620 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
10621 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
10622 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
10623 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
10625 tree f1
= TREE_TYPE (cand1
->fn
);
10626 tree f2
= TREE_TYPE (cand2
->fn
);
10627 tree p1
= TYPE_ARG_TYPES (f1
);
10628 tree p2
= TYPE_ARG_TYPES (f2
);
10630 /* Check if cand1->fn and cand2->fn are versions of the same function. It
10631 is possible that cand1->fn and cand2->fn are function versions but of
10632 different functions. Check types to see if they are versions of the same
10634 if (compparms (p1
, p2
)
10635 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
10637 /* Always make the version with the higher priority, more
10638 specialized, win. */
10639 gcc_assert (targetm
.compare_version_priority
);
10640 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
10647 /* If the two function declarations represent the same function (this can
10648 happen with declarations in multiple scopes and arg-dependent lookup),
10649 arbitrarily choose one. But first make sure the default args we're
10651 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
10652 && equal_functions (cand1
->fn
, cand2
->fn
))
10654 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
10655 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
10657 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
10659 for (i
= 0; i
< len
; ++i
)
10661 /* Don't crash if the fn is variadic. */
10664 parms1
= TREE_CHAIN (parms1
);
10665 parms2
= TREE_CHAIN (parms2
);
10669 parms1
= TREE_CHAIN (parms1
);
10671 parms2
= TREE_CHAIN (parms2
);
10673 for (; parms1
; ++i
)
10675 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
10676 TREE_PURPOSE (parms2
)))
10680 if (complain
& tf_error
)
10682 auto_diagnostic_group d
;
10683 if (permerror (input_location
,
10684 "default argument mismatch in "
10685 "overload resolution"))
10687 inform (DECL_SOURCE_LOCATION (cand1
->fn
),
10688 " candidate 1: %q#F", cand1
->fn
);
10689 inform (DECL_SOURCE_LOCATION (cand2
->fn
),
10690 " candidate 2: %q#F", cand2
->fn
);
10697 add_warning (cand1
, cand2
);
10700 parms1
= TREE_CHAIN (parms1
);
10701 parms2
= TREE_CHAIN (parms2
);
10709 /* Extension: If the worst conversion for one candidate is worse than the
10710 worst conversion for the other, take the first. */
10711 if (!pedantic
&& (complain
& tf_warning_or_error
))
10713 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
10714 struct z_candidate
*w
= 0, *l
= 0;
10716 for (i
= 0; i
< len
; ++i
)
10718 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
10719 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
10720 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
10721 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
10724 winner
= 1, w
= cand1
, l
= cand2
;
10726 winner
= -1, w
= cand2
, l
= cand1
;
10729 /* Don't choose a deleted function over ambiguity. */
10730 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
10734 auto_diagnostic_group d
;
10735 pedwarn (input_location
, 0,
10736 "ISO C++ says that these are ambiguous, even "
10737 "though the worst conversion for the first is better than "
10738 "the worst conversion for the second:");
10739 print_z_candidate (input_location
, _("candidate 1:"), w
);
10740 print_z_candidate (input_location
, _("candidate 2:"), l
);
10743 add_warning (w
, l
);
10748 gcc_assert (!winner
);
10752 /* Given a list of candidates for overloading, find the best one, if any.
10753 This algorithm has a worst case of O(2n) (winner is last), and a best
10754 case of O(n/2) (totally ambiguous); much better than a sorting
10757 static struct z_candidate
*
10758 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
10760 struct z_candidate
*champ
= candidates
, *challenger
;
10762 int champ_compared_to_predecessor
= 0;
10764 /* Walk through the list once, comparing each current champ to the next
10765 candidate, knocking out a candidate or two with each comparison. */
10767 for (challenger
= champ
->next
; challenger
; )
10769 fate
= joust (champ
, challenger
, 0, complain
);
10771 challenger
= challenger
->next
;
10776 champ
= challenger
->next
;
10779 champ_compared_to_predecessor
= 0;
10783 champ
= challenger
;
10784 champ_compared_to_predecessor
= 1;
10787 challenger
= champ
->next
;
10791 /* Make sure the champ is better than all the candidates it hasn't yet
10792 been compared to. */
10794 for (challenger
= candidates
;
10795 challenger
!= champ
10796 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
10797 challenger
= challenger
->next
)
10799 fate
= joust (champ
, challenger
, 0, complain
);
10807 /* Returns nonzero if things of type FROM can be converted to TO. */
10810 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
10812 tree arg
= NULL_TREE
;
10813 /* implicit_conversion only considers user-defined conversions
10814 if it has an expression for the call argument list. */
10815 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
10816 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
10817 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
10820 /* Returns nonzero if things of type FROM can be converted to TO with a
10821 standard conversion. */
10824 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
10826 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
10829 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
10832 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
10833 tsubst_flags_t complain
)
10839 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10840 p
= conversion_obstack_alloc (0);
10841 /* We want to discard any access checks done for this test,
10842 as we might not be in the appropriate access context and
10843 we'll do the check again when we actually perform the
10845 push_deferring_access_checks (dk_deferred
);
10847 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10849 ok_p
= (t
&& !t
->bad_p
);
10851 /* Discard the access checks now. */
10852 pop_deferring_access_checks ();
10853 /* Free all the conversions we allocated. */
10854 obstack_free (&conversion_obstack
, p
);
10859 /* Like can_convert_arg, but allows dubious conversions as well. */
10862 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
10863 tsubst_flags_t complain
)
10868 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10869 p
= conversion_obstack_alloc (0);
10870 /* Try to perform the conversion. */
10871 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10873 /* Free all the conversions we allocated. */
10874 obstack_free (&conversion_obstack
, p
);
10879 /* Convert EXPR to TYPE. Return the converted expression.
10881 Note that we allow bad conversions here because by the time we get to
10882 this point we are committed to doing the conversion. If we end up
10883 doing a bad conversion, convert_like will complain. */
10886 perform_implicit_conversion_flags (tree type
, tree expr
,
10887 tsubst_flags_t complain
, int flags
)
10891 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
10893 if (TYPE_REF_P (type
))
10894 expr
= mark_lvalue_use (expr
);
10896 expr
= mark_rvalue_use (expr
);
10898 if (error_operand_p (expr
))
10899 return error_mark_node
;
10901 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10902 p
= conversion_obstack_alloc (0);
10904 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
10905 /*c_cast_p=*/false,
10910 if (complain
& tf_error
)
10912 /* If expr has unknown type, then it is an overloaded function.
10913 Call instantiate_type to get good error messages. */
10914 if (TREE_TYPE (expr
) == unknown_type_node
)
10915 instantiate_type (type
, expr
, complain
);
10916 else if (invalid_nonstatic_memfn_p (loc
, expr
, complain
))
10917 /* We gave an error. */;
10920 range_label_for_type_mismatch
label (TREE_TYPE (expr
), type
);
10921 gcc_rich_location
rich_loc (loc
, &label
);
10922 error_at (&rich_loc
, "could not convert %qE from %qH to %qI",
10923 expr
, TREE_TYPE (expr
), type
);
10926 expr
= error_mark_node
;
10928 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
10930 /* In a template, we are only concerned about determining the
10931 type of non-dependent expressions, so we do not have to
10932 perform the actual conversion. But for initializers, we
10933 need to be able to perform it at instantiation
10934 (or instantiate_non_dependent_expr) time. */
10935 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
10936 if (!(flags
& LOOKUP_ONLYCONVERTING
))
10937 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
10940 expr
= convert_like (conv
, expr
, complain
);
10942 /* Free all the conversions we allocated. */
10943 obstack_free (&conversion_obstack
, p
);
10949 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
10951 return perform_implicit_conversion_flags (type
, expr
, complain
,
10955 /* Convert EXPR to TYPE (as a direct-initialization) if that is
10956 permitted. If the conversion is valid, the converted expression is
10957 returned. Otherwise, NULL_TREE is returned, except in the case
10958 that TYPE is a class type; in that case, an error is issued. If
10959 C_CAST_P is true, then this direct-initialization is taking
10960 place as part of a static_cast being attempted as part of a C-style
10964 perform_direct_initialization_if_possible (tree type
,
10967 tsubst_flags_t complain
)
10972 if (type
== error_mark_node
|| error_operand_p (expr
))
10973 return error_mark_node
;
10976 If the destination type is a (possibly cv-qualified) class type:
10978 -- If the initialization is direct-initialization ...,
10979 constructors are considered. ... If no constructor applies, or
10980 the overload resolution is ambiguous, the initialization is
10982 if (CLASS_TYPE_P (type
))
10984 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
10985 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
10986 &args
, type
, LOOKUP_NORMAL
, complain
);
10987 release_tree_vector (args
);
10988 return build_cplus_new (type
, expr
, complain
);
10991 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10992 p
= conversion_obstack_alloc (0);
10994 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
10996 LOOKUP_NORMAL
, complain
);
10997 if (!conv
|| conv
->bad_p
)
10999 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
11001 /* In a template, we are only concerned about determining the
11002 type of non-dependent expressions, so we do not have to
11003 perform the actual conversion. But for initializers, we
11004 need to be able to perform it at instantiation
11005 (or instantiate_non_dependent_expr) time. */
11006 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
11007 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
11010 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0,
11011 /*issue_conversion_warnings=*/false,
11015 /* Free all the conversions we allocated. */
11016 obstack_free (&conversion_obstack
, p
);
11021 /* When initializing a reference that lasts longer than a full-expression,
11022 this special rule applies:
11026 The temporary to which the reference is bound or the temporary
11027 that is the complete object to which the reference is bound
11028 persists for the lifetime of the reference.
11030 The temporaries created during the evaluation of the expression
11031 initializing the reference, except the temporary to which the
11032 reference is bound, are destroyed at the end of the
11033 full-expression in which they are created.
11035 In that case, we store the converted expression into a new
11036 VAR_DECL in a new scope.
11038 However, we want to be careful not to create temporaries when
11039 they are not required. For example, given:
11042 struct D : public B {};
11046 there is no need to copy the return value from "f"; we can just
11047 extend its lifetime. Similarly, given:
11050 struct T { operator S(); };
11054 we can extend the lifetime of the return value of the conversion
11057 The next several functions are involved in this lifetime extension. */
11059 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
11060 reference is being bound to a temporary. Create and return a new
11061 VAR_DECL with the indicated TYPE; this variable will store the value to
11062 which the reference is bound. */
11065 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
11067 tree var
= create_temporary_var (type
);
11069 /* Register the variable. */
11071 && (TREE_STATIC (decl
) || CP_DECL_THREAD_LOCAL_P (decl
)))
11073 /* Namespace-scope or local static; give it a mangled name. */
11074 /* FIXME share comdat with decl? */
11076 TREE_STATIC (var
) = TREE_STATIC (decl
);
11077 CP_DECL_THREAD_LOCAL_P (var
) = CP_DECL_THREAD_LOCAL_P (decl
);
11078 set_decl_tls_model (var
, DECL_TLS_MODEL (decl
));
11080 tree name
= mangle_ref_init_variable (decl
);
11081 DECL_NAME (var
) = name
;
11082 SET_DECL_ASSEMBLER_NAME (var
, name
);
11084 var
= pushdecl (var
);
11087 /* Create a new cleanup level if necessary. */
11088 maybe_push_cleanup_level (type
);
11093 /* EXPR is the initializer for a variable DECL of reference or
11094 std::initializer_list type. Create, push and return a new VAR_DECL
11095 for the initializer so that it will live as long as DECL. Any
11096 cleanup for the new variable is returned through CLEANUP, and the
11097 code to initialize the new variable is returned through INITP. */
11100 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
11107 /* Create the temporary variable. */
11108 type
= TREE_TYPE (expr
);
11109 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
11110 layout_decl (var
, 0);
11111 /* If the rvalue is the result of a function call it will be
11112 a TARGET_EXPR. If it is some other construct (such as a
11113 member access expression where the underlying object is
11114 itself the result of a function call), turn it into a
11115 TARGET_EXPR here. It is important that EXPR be a
11116 TARGET_EXPR below since otherwise the INIT_EXPR will
11117 attempt to make a bitwise copy of EXPR to initialize
11119 if (TREE_CODE (expr
) != TARGET_EXPR
)
11120 expr
= get_target_expr (expr
);
11122 if (TREE_CODE (decl
) == FIELD_DECL
11123 && extra_warnings
&& !TREE_NO_WARNING (decl
))
11125 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
11126 "until the constructor exits", decl
);
11127 TREE_NO_WARNING (decl
) = true;
11130 /* Recursively extend temps in this initializer. */
11131 TARGET_EXPR_INITIAL (expr
)
11132 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
11134 /* Any reference temp has a non-trivial initializer. */
11135 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
11137 /* If the initializer is constant, put it in DECL_INITIAL so we get
11138 static initialization and use in constant expressions. */
11139 init
= maybe_constant_init (expr
);
11140 /* As in store_init_value. */
11141 init
= cp_fully_fold (init
);
11142 if (TREE_CONSTANT (init
))
11144 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
11146 /* 5.19 says that a constant expression can include an
11147 lvalue-rvalue conversion applied to "a glvalue of literal type
11148 that refers to a non-volatile temporary object initialized
11149 with a constant expression". Rather than try to communicate
11150 that this VAR_DECL is a temporary, just mark it constexpr. */
11151 DECL_DECLARED_CONSTEXPR_P (var
) = true;
11152 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
11153 TREE_CONSTANT (var
) = true;
11154 TREE_READONLY (var
) = true;
11156 DECL_INITIAL (var
) = init
;
11160 /* Create the INIT_EXPR that will initialize the temporary
11162 init
= split_nonconstant_init (var
, expr
);
11163 if (at_function_scope_p ())
11165 add_decl_expr (var
);
11167 if (TREE_STATIC (var
))
11168 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
11171 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
11173 vec_safe_push (*cleanups
, cleanup
);
11176 /* We must be careful to destroy the temporary only
11177 after its initialization has taken place. If the
11178 initialization throws an exception, then the
11179 destructor should not be run. We cannot simply
11180 transform INIT into something like:
11182 (INIT, ({ CLEANUP_STMT; }))
11184 because emit_local_var always treats the
11185 initializer as a full-expression. Thus, the
11186 destructor would run too early; it would run at the
11187 end of initializing the reference variable, rather
11188 than at the end of the block enclosing the
11189 reference variable.
11191 The solution is to pass back a cleanup expression
11192 which the caller is responsible for attaching to
11193 the statement tree. */
11197 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
11198 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
11200 if (CP_DECL_THREAD_LOCAL_P (var
))
11201 tls_aggregates
= tree_cons (NULL_TREE
, var
,
11204 static_aggregates
= tree_cons (NULL_TREE
, var
,
11205 static_aggregates
);
11208 /* Check whether the dtor is callable. */
11209 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
11211 /* Avoid -Wunused-variable warning (c++/38958). */
11212 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
11214 TREE_USED (decl
) = DECL_READ_P (decl
) = true;
11220 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
11221 initializing a variable of that TYPE. */
11224 initialize_reference (tree type
, tree expr
,
11225 int flags
, tsubst_flags_t complain
)
11229 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
11231 if (type
== error_mark_node
|| error_operand_p (expr
))
11232 return error_mark_node
;
11234 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11235 p
= conversion_obstack_alloc (0);
11237 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
11239 if (!conv
|| conv
->bad_p
)
11241 if (complain
& tf_error
)
11244 convert_like (conv
, expr
, complain
);
11245 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
11246 && !TYPE_REF_IS_RVALUE (type
)
11247 && !lvalue_p (expr
))
11248 error_at (loc
, "invalid initialization of non-const reference of "
11249 "type %qH from an rvalue of type %qI",
11250 type
, TREE_TYPE (expr
));
11252 error_at (loc
, "invalid initialization of reference of type "
11253 "%qH from expression of type %qI", type
,
11256 return error_mark_node
;
11259 if (conv
->kind
== ck_ref_bind
)
11260 /* Perform the conversion. */
11261 expr
= convert_like (conv
, expr
, complain
);
11262 else if (conv
->kind
== ck_ambig
)
11263 /* We gave an error in build_user_type_conversion_1. */
11264 expr
= error_mark_node
;
11266 gcc_unreachable ();
11268 /* Free all the conversions we allocated. */
11269 obstack_free (&conversion_obstack
, p
);
11274 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
11275 which is bound either to a reference or a std::initializer_list. */
11278 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
11283 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
11285 TREE_OPERAND (sub
, 1)
11286 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
11289 if (TREE_CODE (sub
) != ADDR_EXPR
)
11291 /* Deal with binding to a subobject. */
11292 for (p
= &TREE_OPERAND (sub
, 0);
11293 (TREE_CODE (*p
) == COMPONENT_REF
11294 || TREE_CODE (*p
) == ARRAY_REF
); )
11295 p
= &TREE_OPERAND (*p
, 0);
11296 if (TREE_CODE (*p
) == TARGET_EXPR
)
11298 tree subinit
= NULL_TREE
;
11299 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
11300 recompute_tree_invariant_for_addr_expr (sub
);
11302 init
= fold_convert (TREE_TYPE (init
), sub
);
11304 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
11309 /* INIT is part of the initializer for DECL. If there are any
11310 reference or initializer lists being initialized, extend their
11311 lifetime to match that of DECL. */
11314 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
11316 tree type
= TREE_TYPE (init
);
11317 if (processing_template_decl
)
11319 if (TYPE_REF_P (type
))
11320 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
11324 if (TREE_CODE (ctor
) == TARGET_EXPR
)
11325 ctor
= TARGET_EXPR_INITIAL (ctor
);
11326 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
11328 if (is_std_init_list (type
))
11330 /* The temporary array underlying a std::initializer_list
11331 is handled like a reference temporary. */
11332 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
11333 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
11334 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
11339 constructor_elt
*p
;
11340 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (ctor
);
11341 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
11342 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
11344 recompute_constructor_flags (ctor
);
11345 if (decl_maybe_constant_var_p (decl
) && TREE_CONSTANT (ctor
))
11346 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
11353 /* Returns true iff an initializer for TYPE could contain temporaries that
11354 need to be extended because they are bound to references or
11355 std::initializer_list. */
11358 type_has_extended_temps (tree type
)
11360 type
= strip_array_types (type
);
11361 if (TYPE_REF_P (type
))
11363 if (CLASS_TYPE_P (type
))
11365 if (is_std_init_list (type
))
11367 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
11368 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
11369 if (type_has_extended_temps (TREE_TYPE (f
)))
11375 /* Returns true iff TYPE is some variant of std::initializer_list. */
11378 is_std_init_list (tree type
)
11380 if (!TYPE_P (type
))
11382 if (cxx_dialect
== cxx98
)
11384 /* Look through typedefs. */
11385 type
= TYPE_MAIN_VARIANT (type
);
11386 return (CLASS_TYPE_P (type
)
11387 && CP_TYPE_CONTEXT (type
) == std_node
11388 && init_list_identifier
== DECL_NAME (TYPE_NAME (type
)));
11391 /* Returns true iff DECL is a list constructor: i.e. a constructor which
11392 will accept an argument list of a single std::initializer_list<T>. */
11395 is_list_ctor (tree decl
)
11397 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
11400 if (!args
|| args
== void_list_node
)
11403 arg
= non_reference (TREE_VALUE (args
));
11404 if (!is_std_init_list (arg
))
11407 args
= TREE_CHAIN (args
);
11409 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
11410 /* There are more non-defaulted parms. */
11416 #include "gt-cp-call.h"