1 /* Functions related to invoking -*- C++ -*- methods and overloaded functions.
2 Copyright (C) 1987-2019 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com) and
4 modified by Brendan Kehoe (brendan@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* High-level class interface. */
27 #include "coretypes.h"
31 #include "stringpool.h"
33 #include "stor-layout.h"
34 #include "trans-mem.h"
39 #include "langhooks.h"
40 #include "c-family/c-objc.h"
41 #include "internal-fn.h"
42 #include "stringpool.h"
44 #include "gcc-rich-location.h"
46 /* The various kinds of conversion. */
48 enum conversion_kind
{
65 /* The rank of the conversion. Order of the enumerals matters; better
66 conversions should come earlier in the list. */
68 enum conversion_rank
{
79 /* An implicit conversion sequence, in the sense of [over.best.ics].
80 The first conversion to be performed is at the end of the chain.
81 That conversion is always a cr_identity conversion. */
84 /* The kind of conversion represented by this step. */
86 /* The rank of this conversion. */
88 BOOL_BITFIELD user_conv_p
: 1;
89 BOOL_BITFIELD ellipsis_p
: 1;
90 BOOL_BITFIELD this_p
: 1;
91 /* True if this conversion would be permitted with a bending of
92 language standards, e.g. disregarding pointer qualifiers or
93 converting integers to pointers. */
94 BOOL_BITFIELD bad_p
: 1;
95 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
96 temporary should be created to hold the result of the
97 conversion. If KIND is ck_ambig or ck_user, true means force
98 copy-initialization. */
99 BOOL_BITFIELD need_temporary_p
: 1;
100 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
101 from a pointer-to-derived to pointer-to-base is being performed. */
102 BOOL_BITFIELD base_p
: 1;
103 /* If KIND is ck_ref_bind, true when either an lvalue reference is
104 being bound to an lvalue expression or an rvalue reference is
105 being bound to an rvalue expression. If KIND is ck_rvalue or ck_base,
106 true when we are treating an lvalue as an rvalue (12.8p33). If
107 ck_identity, we will be binding a reference directly or decaying to
109 BOOL_BITFIELD rvaluedness_matches_p
: 1;
110 BOOL_BITFIELD check_narrowing
: 1;
111 /* Whether check_narrowing should only check TREE_CONSTANTs; used
112 in build_converted_constant_expr. */
113 BOOL_BITFIELD check_narrowing_const_only
: 1;
114 /* The type of the expression resulting from the conversion. */
117 /* The next conversion in the chain. Since the conversions are
118 arranged from outermost to innermost, the NEXT conversion will
119 actually be performed before this conversion. This variant is
120 used only when KIND is neither ck_identity, ck_ambig nor
121 ck_list. Please use the next_conversion function instead
122 of using this field directly. */
124 /* The expression at the beginning of the conversion chain. This
125 variant is used only if KIND is ck_identity or ck_ambig. */
127 /* The array of conversions for an initializer_list, so this
128 variant is used only when KIN D is ck_list. */
131 /* The function candidate corresponding to this conversion
132 sequence. This field is only used if KIND is ck_user. */
133 struct z_candidate
*cand
;
136 #define CONVERSION_RANK(NODE) \
137 ((NODE)->bad_p ? cr_bad \
138 : (NODE)->ellipsis_p ? cr_ellipsis \
139 : (NODE)->user_conv_p ? cr_user \
142 #define BAD_CONVERSION_RANK(NODE) \
143 ((NODE)->ellipsis_p ? cr_ellipsis \
144 : (NODE)->user_conv_p ? cr_user \
147 static struct obstack conversion_obstack
;
148 static bool conversion_obstack_initialized
;
149 struct rejection_reason
;
151 static struct z_candidate
* tourney (struct z_candidate
*, tsubst_flags_t
);
152 static int equal_functions (tree
, tree
);
153 static int joust (struct z_candidate
*, struct z_candidate
*, bool,
155 static int compare_ics (conversion
*, conversion
*);
156 static void maybe_warn_class_memaccess (location_t
, tree
,
157 const vec
<tree
, va_gc
> *);
158 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
159 #define convert_like(CONV, EXPR, COMPLAIN) \
160 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, \
161 /*issue_conversion_warnings=*/true, \
162 /*c_cast_p=*/false, (COMPLAIN))
163 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
164 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), \
165 /*issue_conversion_warnings=*/true, \
166 /*c_cast_p=*/false, (COMPLAIN))
167 static tree
convert_like_real (conversion
*, tree
, tree
, int, bool,
168 bool, tsubst_flags_t
);
169 static void op_error (const op_location_t
&, enum tree_code
, enum tree_code
,
170 tree
, tree
, tree
, bool);
171 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int,
173 static void print_z_candidate (location_t
, const char *, struct z_candidate
*);
174 static void print_z_candidates (location_t
, struct z_candidate
*);
175 static tree
build_this (tree
);
176 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
177 static bool any_strictly_viable (struct z_candidate
*);
178 static struct z_candidate
*add_template_candidate
179 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
180 tree
, tree
, tree
, int, unification_kind_t
, tsubst_flags_t
);
181 static struct z_candidate
*add_template_candidate_real
182 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
183 tree
, tree
, tree
, int, tree
, unification_kind_t
, tsubst_flags_t
);
184 static void add_builtin_candidates
185 (struct z_candidate
**, enum tree_code
, enum tree_code
,
186 tree
, tree
*, int, tsubst_flags_t
);
187 static void add_builtin_candidate
188 (struct z_candidate
**, enum tree_code
, enum tree_code
,
189 tree
, tree
, tree
, tree
*, tree
*, int, tsubst_flags_t
);
190 static bool is_complete (tree
);
191 static void build_builtin_candidate
192 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
193 int, tsubst_flags_t
);
194 static struct z_candidate
*add_conv_candidate
195 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
196 tree
, tsubst_flags_t
);
197 static struct z_candidate
*add_function_candidate
198 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
199 tree
, int, conversion
**, tsubst_flags_t
);
200 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int,
202 static conversion
*reference_binding (tree
, tree
, tree
, bool, int,
204 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
205 static conversion
*build_list_conv (tree
, tree
, int, tsubst_flags_t
);
206 static conversion
*next_conversion (conversion
*);
207 static bool is_subseq (conversion
*, conversion
*);
208 static conversion
*maybe_handle_ref_bind (conversion
**);
209 static void maybe_handle_implicit_object (conversion
**);
210 static struct z_candidate
*add_candidate
211 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, size_t,
212 conversion
**, tree
, tree
, int, struct rejection_reason
*, int);
213 static tree
source_type (conversion
*);
214 static void add_warning (struct z_candidate
*, struct z_candidate
*);
215 static bool reference_compatible_p (tree
, tree
);
216 static conversion
*direct_reference_binding (tree
, conversion
*);
217 static bool promoted_arithmetic_type_p (tree
);
218 static conversion
*conditional_conversion (tree
, tree
, tsubst_flags_t
);
219 static char *name_as_c_string (tree
, tree
, bool *);
220 static tree
prep_operand (tree
);
221 static void add_candidates (tree
, tree
, const vec
<tree
, va_gc
> *, tree
, tree
,
222 bool, tree
, tree
, int, struct z_candidate
**,
224 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
225 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
227 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
228 NAME can take many forms... */
231 check_dtor_name (tree basetype
, tree name
)
233 /* Just accept something we've already complained about. */
234 if (name
== error_mark_node
)
237 if (TREE_CODE (name
) == TYPE_DECL
)
238 name
= TREE_TYPE (name
);
239 else if (TYPE_P (name
))
241 else if (identifier_p (name
))
243 if ((MAYBE_CLASS_TYPE_P (basetype
)
244 || TREE_CODE (basetype
) == ENUMERAL_TYPE
)
245 && name
== constructor_name (basetype
))
248 name
= get_type_value (name
);
254 template <class T> struct S { ~S(); };
258 NAME will be a class template. */
259 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
263 if (!name
|| name
== error_mark_node
)
265 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
268 /* We want the address of a function or method. We avoid creating a
269 pointer-to-member function. */
272 build_addr_func (tree function
, tsubst_flags_t complain
)
274 tree type
= TREE_TYPE (function
);
276 /* We have to do these by hand to avoid real pointer to member
278 if (TREE_CODE (type
) == METHOD_TYPE
)
280 if (TREE_CODE (function
) == OFFSET_REF
)
282 tree object
= build_address (TREE_OPERAND (function
, 0));
283 return get_member_function_from_ptrfunc (&object
,
284 TREE_OPERAND (function
, 1),
287 function
= build_address (function
);
290 function
= decay_conversion (function
, complain
, /*reject_builtin=*/false);
295 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
296 POINTER_TYPE to those. Note, pointer to member function types
297 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
298 two variants. build_call_a is the primitive taking an array of
299 arguments, while build_call_n is a wrapper that handles varargs. */
302 build_call_n (tree function
, int n
, ...)
305 return build_call_a (function
, 0, NULL
);
308 tree
*argarray
= XALLOCAVEC (tree
, n
);
313 for (i
= 0; i
< n
; i
++)
314 argarray
[i
] = va_arg (ap
, tree
);
316 return build_call_a (function
, n
, argarray
);
320 /* Update various flags in cfun and the call itself based on what is being
321 called. Split out of build_call_a so that bot_manip can use it too. */
324 set_flags_from_callee (tree call
)
326 /* Handle both CALL_EXPRs and AGGR_INIT_EXPRs. */
327 tree decl
= cp_get_callee_fndecl_nofold (call
);
329 /* We check both the decl and the type; a function may be known not to
330 throw without being declared throw(). */
331 bool nothrow
= decl
&& TREE_NOTHROW (decl
);
332 tree callee
= cp_get_callee (call
);
334 nothrow
|= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (callee
)));
335 else if (TREE_CODE (call
) == CALL_EXPR
336 && internal_fn_flags (CALL_EXPR_IFN (call
)) & ECF_NOTHROW
)
339 if (!nothrow
&& at_function_scope_p () && cfun
&& cp_function_chain
)
340 cp_function_chain
->can_throw
= 1;
342 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
343 current_function_returns_abnormally
= 1;
345 TREE_NOTHROW (call
) = nothrow
;
349 build_call_a (tree function
, int n
, tree
*argarray
)
356 function
= build_addr_func (function
, tf_warning_or_error
);
358 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
359 fntype
= TREE_TYPE (TREE_TYPE (function
));
360 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
361 || TREE_CODE (fntype
) == METHOD_TYPE
);
362 result_type
= TREE_TYPE (fntype
);
363 /* An rvalue has no cv-qualifiers. */
364 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
365 result_type
= cv_unqualified (result_type
);
367 function
= build_call_array_loc (input_location
,
368 result_type
, function
, n
, argarray
);
369 set_flags_from_callee (function
);
371 decl
= get_callee_fndecl (function
);
373 if (decl
&& !TREE_USED (decl
))
375 /* We invoke build_call directly for several library
376 functions. These may have been declared normally if
377 we're building libgcc, so we can't just check
379 gcc_assert (DECL_ARTIFICIAL (decl
)
380 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
385 require_complete_eh_spec_types (fntype
, decl
);
387 TREE_HAS_CONSTRUCTOR (function
) = (decl
&& DECL_CONSTRUCTOR_P (decl
));
389 /* Don't pass empty class objects by value. This is useful
390 for tags in STL, which are used to control overload resolution.
391 We don't need to handle other cases of copying empty classes. */
392 if (!decl
|| !fndecl_built_in_p (decl
))
393 for (i
= 0; i
< n
; i
++)
395 tree arg
= CALL_EXPR_ARG (function
, i
);
396 if (is_empty_class (TREE_TYPE (arg
))
397 && ! TREE_ADDRESSABLE (TREE_TYPE (arg
)))
399 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (arg
));
400 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (t
), arg
, t
);
401 CALL_EXPR_ARG (function
, i
) = arg
;
408 /* New overloading code. */
412 struct candidate_warning
{
414 candidate_warning
*next
;
417 /* Information for providing diagnostics about why overloading failed. */
419 enum rejection_reason_code
{
422 rr_explicit_conversion
,
423 rr_template_conversion
,
425 rr_bad_arg_conversion
,
426 rr_template_unification
,
429 rr_constraint_failure
432 struct conversion_info
{
433 /* The index of the argument, 0-based. */
435 /* The actual argument or its type. */
437 /* The type of the parameter. */
439 /* The location of the argument. */
443 struct rejection_reason
{
444 enum rejection_reason_code code
;
446 /* Information about an arity mismatch. */
448 /* The expected number of arguments. */
450 /* The actual number of arguments in the call. */
452 /* Whether the call was a varargs call. */
455 /* Information about an argument conversion mismatch. */
456 struct conversion_info conversion
;
457 /* Same, but for bad argument conversions. */
458 struct conversion_info bad_conversion
;
459 /* Information about template unification failures. These are the
460 parameters passed to fn_type_unification. */
468 unification_kind_t strict
;
470 } template_unification
;
471 /* Information about template instantiation failures. These are the
472 parameters passed to instantiate_template. */
476 } template_instantiation
;
481 /* The FUNCTION_DECL that will be called if this candidate is
482 selected by overload resolution. */
484 /* If not NULL_TREE, the first argument to use when calling this
487 /* The rest of the arguments to use when calling this function. If
488 there are no further arguments this may be NULL or it may be an
490 const vec
<tree
, va_gc
> *args
;
491 /* The implicit conversion sequences for each of the arguments to
494 /* The number of implicit conversion sequences. */
496 /* If FN is a user-defined conversion, the standard conversion
497 sequence from the type returned by FN to the desired destination
499 conversion
*second_conv
;
500 struct rejection_reason
*reason
;
501 /* If FN is a member function, the binfo indicating the path used to
502 qualify the name of FN at the call site. This path is used to
503 determine whether or not FN is accessible if it is selected by
504 overload resolution. The DECL_CONTEXT of FN will always be a
505 (possibly improper) base of this binfo. */
507 /* If FN is a non-static member function, the binfo indicating the
508 subobject to which the `this' pointer should be converted if FN
509 is selected by overload resolution. The type pointed to by
510 the `this' pointer must correspond to the most derived class
511 indicated by the CONVERSION_PATH. */
512 tree conversion_path
;
515 candidate_warning
*warnings
;
519 /* The flags active in add_candidate. */
523 /* Returns true iff T is a null pointer constant in the sense of
527 null_ptr_cst_p (tree t
)
529 tree type
= TREE_TYPE (t
);
533 A null pointer constant is an integral constant expression
534 (_expr.const_) rvalue of integer type that evaluates to zero or
535 an rvalue of type std::nullptr_t. */
536 if (NULLPTR_TYPE_P (type
))
539 if (cxx_dialect
>= cxx11
)
541 STRIP_ANY_LOCATION_WRAPPER (t
);
543 /* Core issue 903 says only literal 0 is a null pointer constant. */
544 if (TREE_CODE (type
) == INTEGER_TYPE
545 && !char_type_p (type
)
546 && TREE_CODE (t
) == INTEGER_CST
548 && !TREE_OVERFLOW (t
))
551 else if (CP_INTEGRAL_TYPE_P (type
))
553 t
= fold_non_dependent_expr (t
, tf_none
);
555 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
562 /* Returns true iff T is a null member pointer value (4.11). */
565 null_member_pointer_value_p (tree t
)
567 tree type
= TREE_TYPE (t
);
570 else if (TYPE_PTRMEMFUNC_P (type
))
571 return (TREE_CODE (t
) == CONSTRUCTOR
572 && integer_zerop (CONSTRUCTOR_ELT (t
, 0)->value
));
573 else if (TYPE_PTRDATAMEM_P (type
))
574 return integer_all_onesp (t
);
579 /* Returns nonzero if PARMLIST consists of only default parms,
580 ellipsis, and/or undeduced parameter packs. */
583 sufficient_parms_p (const_tree parmlist
)
585 for (; parmlist
&& parmlist
!= void_list_node
;
586 parmlist
= TREE_CHAIN (parmlist
))
587 if (!TREE_PURPOSE (parmlist
)
588 && !PACK_EXPANSION_P (TREE_VALUE (parmlist
)))
593 /* Allocate N bytes of memory from the conversion obstack. The memory
594 is zeroed before being returned. */
597 conversion_obstack_alloc (size_t n
)
600 if (!conversion_obstack_initialized
)
602 gcc_obstack_init (&conversion_obstack
);
603 conversion_obstack_initialized
= true;
605 p
= obstack_alloc (&conversion_obstack
, n
);
610 /* Allocate rejection reasons. */
612 static struct rejection_reason
*
613 alloc_rejection (enum rejection_reason_code code
)
615 struct rejection_reason
*p
;
616 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
621 static struct rejection_reason
*
622 arity_rejection (tree first_arg
, int expected
, int actual
)
624 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
625 int adjust
= first_arg
!= NULL_TREE
;
626 r
->u
.arity
.expected
= expected
- adjust
;
627 r
->u
.arity
.actual
= actual
- adjust
;
631 static struct rejection_reason
*
632 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
,
635 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
636 int adjust
= first_arg
!= NULL_TREE
;
637 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
638 r
->u
.conversion
.from
= from
;
639 r
->u
.conversion
.to_type
= to
;
640 r
->u
.conversion
.loc
= loc
;
644 static struct rejection_reason
*
645 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
,
648 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
649 int adjust
= first_arg
!= NULL_TREE
;
650 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
651 r
->u
.bad_conversion
.from
= from
;
652 r
->u
.bad_conversion
.to_type
= to
;
653 r
->u
.bad_conversion
.loc
= loc
;
657 static struct rejection_reason
*
658 explicit_conversion_rejection (tree from
, tree to
)
660 struct rejection_reason
*r
= alloc_rejection (rr_explicit_conversion
);
661 r
->u
.conversion
.n_arg
= 0;
662 r
->u
.conversion
.from
= from
;
663 r
->u
.conversion
.to_type
= to
;
664 r
->u
.conversion
.loc
= UNKNOWN_LOCATION
;
668 static struct rejection_reason
*
669 template_conversion_rejection (tree from
, tree to
)
671 struct rejection_reason
*r
= alloc_rejection (rr_template_conversion
);
672 r
->u
.conversion
.n_arg
= 0;
673 r
->u
.conversion
.from
= from
;
674 r
->u
.conversion
.to_type
= to
;
675 r
->u
.conversion
.loc
= UNKNOWN_LOCATION
;
679 static struct rejection_reason
*
680 template_unification_rejection (tree tmpl
, tree explicit_targs
, tree targs
,
681 const tree
*args
, unsigned int nargs
,
682 tree return_type
, unification_kind_t strict
,
685 size_t args_n_bytes
= sizeof (*args
) * nargs
;
686 tree
*args1
= (tree
*) conversion_obstack_alloc (args_n_bytes
);
687 struct rejection_reason
*r
= alloc_rejection (rr_template_unification
);
688 r
->u
.template_unification
.tmpl
= tmpl
;
689 r
->u
.template_unification
.explicit_targs
= explicit_targs
;
690 r
->u
.template_unification
.num_targs
= TREE_VEC_LENGTH (targs
);
691 /* Copy args to our own storage. */
692 memcpy (args1
, args
, args_n_bytes
);
693 r
->u
.template_unification
.args
= args1
;
694 r
->u
.template_unification
.nargs
= nargs
;
695 r
->u
.template_unification
.return_type
= return_type
;
696 r
->u
.template_unification
.strict
= strict
;
697 r
->u
.template_unification
.flags
= flags
;
701 static struct rejection_reason
*
702 template_unification_error_rejection (void)
704 return alloc_rejection (rr_template_unification
);
707 static struct rejection_reason
*
708 invalid_copy_with_fn_template_rejection (void)
710 struct rejection_reason
*r
= alloc_rejection (rr_invalid_copy
);
714 static struct rejection_reason
*
715 inherited_ctor_rejection (void)
717 struct rejection_reason
*r
= alloc_rejection (rr_inherited_ctor
);
721 // Build a constraint failure record, saving information into the
722 // template_instantiation field of the rejection. If FN is not a template
723 // declaration, the TMPL member is the FN declaration and TARGS is empty.
725 static struct rejection_reason
*
726 constraint_failure (tree fn
)
728 struct rejection_reason
*r
= alloc_rejection (rr_constraint_failure
);
729 if (tree ti
= DECL_TEMPLATE_INFO (fn
))
731 r
->u
.template_instantiation
.tmpl
= TI_TEMPLATE (ti
);
732 r
->u
.template_instantiation
.targs
= TI_ARGS (ti
);
736 r
->u
.template_instantiation
.tmpl
= fn
;
737 r
->u
.template_instantiation
.targs
= NULL_TREE
;
742 /* Dynamically allocate a conversion. */
745 alloc_conversion (conversion_kind kind
)
748 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
753 /* Make sure that all memory on the conversion obstack has been
757 validate_conversion_obstack (void)
759 if (conversion_obstack_initialized
)
760 gcc_assert ((obstack_next_free (&conversion_obstack
)
761 == obstack_base (&conversion_obstack
)));
764 /* Dynamically allocate an array of N conversions. */
767 alloc_conversions (size_t n
)
769 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
773 build_conv (conversion_kind code
, tree type
, conversion
*from
)
776 conversion_rank rank
= CONVERSION_RANK (from
);
778 /* Note that the caller is responsible for filling in t->cand for
779 user-defined conversions. */
780 t
= alloc_conversion (code
);
804 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
805 t
->bad_p
= from
->bad_p
;
810 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
811 specialization of std::initializer_list<T>, if such a conversion is
815 build_list_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
817 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
818 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
819 conversion
**subconvs
= alloc_conversions (len
);
824 /* Within a list-initialization we can have more user-defined
826 flags
&= ~LOOKUP_NO_CONVERSION
;
827 /* But no narrowing conversions. */
828 flags
|= LOOKUP_NO_NARROWING
;
830 /* Can't make an array of these types. */
831 if (TYPE_REF_P (elttype
)
832 || TREE_CODE (elttype
) == FUNCTION_TYPE
833 || VOID_TYPE_P (elttype
))
836 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
839 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
840 false, flags
, complain
);
847 t
= alloc_conversion (ck_list
);
849 t
->u
.list
= subconvs
;
852 for (i
= 0; i
< len
; ++i
)
854 conversion
*sub
= subconvs
[i
];
855 if (sub
->rank
> t
->rank
)
857 if (sub
->user_conv_p
)
858 t
->user_conv_p
= true;
866 /* Return the next conversion of the conversion chain (if applicable),
867 or NULL otherwise. Please use this function instead of directly
868 accessing fields of struct conversion. */
871 next_conversion (conversion
*conv
)
874 || conv
->kind
== ck_identity
875 || conv
->kind
== ck_ambig
876 || conv
->kind
== ck_list
)
881 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
882 is a valid aggregate initializer for array type ATYPE. */
885 can_convert_array (tree atype
, tree ctor
, int flags
, tsubst_flags_t complain
)
888 tree elttype
= TREE_TYPE (atype
);
889 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
891 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
893 if (TREE_CODE (elttype
) == ARRAY_TYPE
894 && TREE_CODE (val
) == CONSTRUCTOR
)
895 ok
= can_convert_array (elttype
, val
, flags
, complain
);
897 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
,
905 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
906 aggregate class, if such a conversion is possible. */
909 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
911 unsigned HOST_WIDE_INT i
= 0;
913 tree field
= next_initializable_field (TYPE_FIELDS (type
));
914 tree empty_ctor
= NULL_TREE
;
916 /* We already called reshape_init in implicit_conversion. */
918 /* The conversions within the init-list aren't affected by the enclosing
919 context; they're always simple copy-initialization. */
920 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
922 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
924 tree ftype
= TREE_TYPE (field
);
928 if (i
< CONSTRUCTOR_NELTS (ctor
))
929 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
930 else if (DECL_INITIAL (field
))
931 val
= get_nsdmi (field
, /*ctor*/false, complain
);
932 else if (TYPE_REF_P (ftype
))
933 /* Value-initialization of reference is ill-formed. */
937 if (empty_ctor
== NULL_TREE
)
938 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
943 if (TREE_CODE (ftype
) == ARRAY_TYPE
944 && TREE_CODE (val
) == CONSTRUCTOR
)
945 ok
= can_convert_array (ftype
, val
, flags
, complain
);
947 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
953 if (TREE_CODE (type
) == UNION_TYPE
)
957 if (i
< CONSTRUCTOR_NELTS (ctor
))
960 c
= alloc_conversion (ck_aggr
);
963 c
->user_conv_p
= true;
964 c
->check_narrowing
= true;
969 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
970 array type, if such a conversion is possible. */
973 build_array_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
976 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
977 tree elttype
= TREE_TYPE (type
);
982 enum conversion_rank rank
= cr_exact
;
984 /* We might need to propagate the size from the element to the array. */
985 complete_type (type
);
987 if (TYPE_DOMAIN (type
)
988 && !variably_modified_type_p (TYPE_DOMAIN (type
), NULL_TREE
))
990 unsigned HOST_WIDE_INT alen
= tree_to_uhwi (array_type_nelts_top (type
));
995 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
997 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1000 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1001 false, flags
, complain
);
1005 if (sub
->rank
> rank
)
1007 if (sub
->user_conv_p
)
1013 c
= alloc_conversion (ck_aggr
);
1016 c
->user_conv_p
= user
;
1022 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1023 complex type, if such a conversion is possible. */
1026 build_complex_conv (tree type
, tree ctor
, int flags
,
1027 tsubst_flags_t complain
)
1030 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1031 tree elttype
= TREE_TYPE (type
);
1036 enum conversion_rank rank
= cr_exact
;
1041 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1043 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1046 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1047 false, flags
, complain
);
1051 if (sub
->rank
> rank
)
1053 if (sub
->user_conv_p
)
1059 c
= alloc_conversion (ck_aggr
);
1062 c
->user_conv_p
= user
;
1068 /* Build a representation of the identity conversion from EXPR to
1069 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1072 build_identity_conv (tree type
, tree expr
)
1076 c
= alloc_conversion (ck_identity
);
1083 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1084 were multiple user-defined conversions to accomplish the job.
1085 Build a conversion that indicates that ambiguity. */
1088 build_ambiguous_conv (tree type
, tree expr
)
1092 c
= alloc_conversion (ck_ambig
);
1100 strip_top_quals (tree t
)
1102 if (TREE_CODE (t
) == ARRAY_TYPE
)
1104 return cp_build_qualified_type (t
, 0);
1107 /* Returns the standard conversion path (see [conv]) from type FROM to type
1108 TO, if any. For proper handling of null pointer constants, you must
1109 also pass the expression EXPR to convert from. If C_CAST_P is true,
1110 this conversion is coming from a C-style cast. */
1113 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1114 int flags
, tsubst_flags_t complain
)
1116 enum tree_code fcode
, tcode
;
1118 bool fromref
= false;
1121 to
= non_reference (to
);
1122 if (TYPE_REF_P (from
))
1125 from
= TREE_TYPE (from
);
1128 to
= strip_top_quals (to
);
1129 from
= strip_top_quals (from
);
1131 if (expr
&& type_unknown_p (expr
))
1133 if (TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1135 tsubst_flags_t tflags
= tf_conv
;
1136 expr
= instantiate_type (to
, expr
, tflags
);
1137 if (expr
== error_mark_node
)
1139 from
= TREE_TYPE (expr
);
1141 else if (TREE_CODE (to
) == BOOLEAN_TYPE
)
1143 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1144 expr
= resolve_nondeduced_context (expr
, complain
);
1145 from
= TREE_TYPE (expr
);
1149 fcode
= TREE_CODE (from
);
1150 tcode
= TREE_CODE (to
);
1152 conv
= build_identity_conv (from
, expr
);
1153 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1155 from
= type_decays_to (from
);
1156 fcode
= TREE_CODE (from
);
1157 /* Tell convert_like_real that we're using the address. */
1158 conv
->rvaluedness_matches_p
= true;
1159 conv
= build_conv (ck_lvalue
, from
, conv
);
1161 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1162 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1163 express the copy constructor call required by copy-initialization. */
1164 else if (fromref
|| (expr
&& obvalue_p (expr
)))
1169 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1172 from
= strip_top_quals (bitfield_type
);
1173 fcode
= TREE_CODE (from
);
1176 conv
= build_conv (ck_rvalue
, from
, conv
);
1177 if (flags
& LOOKUP_PREFER_RVALUE
)
1178 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1179 conv
->rvaluedness_matches_p
= true;
1182 /* Allow conversion between `__complex__' data types. */
1183 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1185 /* The standard conversion sequence to convert FROM to TO is
1186 the standard conversion sequence to perform componentwise
1188 conversion
*part_conv
= standard_conversion
1189 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
,
1194 conv
= build_conv (part_conv
->kind
, to
, conv
);
1195 conv
->rank
= part_conv
->rank
;
1203 if (same_type_p (from
, to
))
1205 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1206 conv
->type
= qualified_to
;
1211 A null pointer constant can be converted to a pointer type; ... A
1212 null pointer constant of integral type can be converted to an
1213 rvalue of type std::nullptr_t. */
1214 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1215 || NULLPTR_TYPE_P (to
))
1216 && ((expr
&& null_ptr_cst_p (expr
))
1217 || NULLPTR_TYPE_P (from
)))
1218 conv
= build_conv (ck_std
, to
, conv
);
1219 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1220 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1222 /* For backwards brain damage compatibility, allow interconversion of
1223 pointers and integers with a pedwarn. */
1224 conv
= build_conv (ck_std
, to
, conv
);
1227 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1229 /* For backwards brain damage compatibility, allow interconversion of
1230 enums and integers with a pedwarn. */
1231 conv
= build_conv (ck_std
, to
, conv
);
1234 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1235 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1240 if (tcode
== POINTER_TYPE
)
1242 to_pointee
= TREE_TYPE (to
);
1243 from_pointee
= TREE_TYPE (from
);
1245 /* Since this is the target of a pointer, it can't have function
1246 qualifiers, so any TYPE_QUALS must be for attributes const or
1247 noreturn. Strip them. */
1248 if (TREE_CODE (to_pointee
) == FUNCTION_TYPE
1249 && TYPE_QUALS (to_pointee
))
1250 to_pointee
= build_qualified_type (to_pointee
, TYPE_UNQUALIFIED
);
1251 if (TREE_CODE (from_pointee
) == FUNCTION_TYPE
1252 && TYPE_QUALS (from_pointee
))
1253 from_pointee
= build_qualified_type (from_pointee
, TYPE_UNQUALIFIED
);
1257 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1258 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1261 if (tcode
== POINTER_TYPE
1262 && same_type_ignoring_top_level_qualifiers_p (from_pointee
,
1265 else if (VOID_TYPE_P (to_pointee
)
1266 && !TYPE_PTRDATAMEM_P (from
)
1267 && TREE_CODE (from_pointee
) != FUNCTION_TYPE
)
1269 tree nfrom
= TREE_TYPE (from
);
1270 /* Don't try to apply restrict to void. */
1271 int quals
= cp_type_quals (nfrom
) & ~TYPE_QUAL_RESTRICT
;
1272 from_pointee
= cp_build_qualified_type (void_type_node
, quals
);
1273 from
= build_pointer_type (from_pointee
);
1274 conv
= build_conv (ck_ptr
, from
, conv
);
1276 else if (TYPE_PTRDATAMEM_P (from
))
1278 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1279 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1281 if (same_type_p (fbase
, tbase
))
1282 /* No base conversion needed. */;
1283 else if (DERIVED_FROM_P (fbase
, tbase
)
1284 && (same_type_ignoring_top_level_qualifiers_p
1285 (from_pointee
, to_pointee
)))
1287 from
= build_ptrmem_type (tbase
, from_pointee
);
1288 conv
= build_conv (ck_pmem
, from
, conv
);
1293 else if (CLASS_TYPE_P (from_pointee
)
1294 && CLASS_TYPE_P (to_pointee
)
1297 An rvalue of type "pointer to cv D," where D is a
1298 class type, can be converted to an rvalue of type
1299 "pointer to cv B," where B is a base class (clause
1300 _class.derived_) of D. If B is an inaccessible
1301 (clause _class.access_) or ambiguous
1302 (_class.member.lookup_) base class of D, a program
1303 that necessitates this conversion is ill-formed.
1304 Therefore, we use DERIVED_FROM_P, and do not check
1305 access or uniqueness. */
1306 && DERIVED_FROM_P (to_pointee
, from_pointee
))
1309 = cp_build_qualified_type (to_pointee
,
1310 cp_type_quals (from_pointee
));
1311 from
= build_pointer_type (from_pointee
);
1312 conv
= build_conv (ck_ptr
, from
, conv
);
1313 conv
->base_p
= true;
1316 if (same_type_p (from
, to
))
1318 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
1319 /* In a C-style cast, we ignore CV-qualification because we
1320 are allowed to perform a static_cast followed by a
1322 conv
= build_conv (ck_qual
, to
, conv
);
1323 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1324 conv
= build_conv (ck_qual
, to
, conv
);
1325 else if (expr
&& string_conv_p (to
, expr
, 0))
1326 /* converting from string constant to char *. */
1327 conv
= build_conv (ck_qual
, to
, conv
);
1328 else if (fnptr_conv_p (to
, from
))
1329 conv
= build_conv (ck_fnptr
, to
, conv
);
1330 /* Allow conversions among compatible ObjC pointer types (base
1331 conversions have been already handled above). */
1332 else if (c_dialect_objc ()
1333 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1334 conv
= build_conv (ck_ptr
, to
, conv
);
1335 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1337 conv
= build_conv (ck_ptr
, to
, conv
);
1345 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1347 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1348 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1349 tree fbase
= class_of_this_parm (fromfn
);
1350 tree tbase
= class_of_this_parm (tofn
);
1352 if (!DERIVED_FROM_P (fbase
, tbase
))
1355 tree fstat
= static_fn_type (fromfn
);
1356 tree tstat
= static_fn_type (tofn
);
1357 if (same_type_p (tstat
, fstat
)
1358 || fnptr_conv_p (tstat
, fstat
))
1363 if (!same_type_p (fbase
, tbase
))
1365 from
= build_memfn_type (fstat
,
1367 cp_type_quals (tbase
),
1368 type_memfn_rqual (tofn
));
1369 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1370 conv
= build_conv (ck_pmem
, from
, conv
);
1371 conv
->base_p
= true;
1373 if (fnptr_conv_p (tstat
, fstat
))
1374 conv
= build_conv (ck_fnptr
, to
, conv
);
1376 else if (tcode
== BOOLEAN_TYPE
)
1380 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1381 to member type can be converted to a prvalue of type bool. ...
1382 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1383 std::nullptr_t can be converted to a prvalue of type bool; */
1384 if (ARITHMETIC_TYPE_P (from
)
1385 || UNSCOPED_ENUM_P (from
)
1386 || fcode
== POINTER_TYPE
1387 || TYPE_PTRMEM_P (from
)
1388 || NULLPTR_TYPE_P (from
))
1390 conv
= build_conv (ck_std
, to
, conv
);
1391 if (fcode
== POINTER_TYPE
1392 || TYPE_PTRDATAMEM_P (from
)
1393 || (TYPE_PTRMEMFUNC_P (from
)
1394 && conv
->rank
< cr_pbool
)
1395 || NULLPTR_TYPE_P (from
))
1396 conv
->rank
= cr_pbool
;
1397 if (NULLPTR_TYPE_P (from
) && (flags
& LOOKUP_ONLYCONVERTING
))
1399 if (flags
& LOOKUP_NO_NARROWING
)
1400 conv
->check_narrowing
= true;
1406 /* We don't check for ENUMERAL_TYPE here because there are no standard
1407 conversions to enum type. */
1408 /* As an extension, allow conversion to complex type. */
1409 else if (ARITHMETIC_TYPE_P (to
))
1411 if (! (INTEGRAL_CODE_P (fcode
)
1412 || (fcode
== REAL_TYPE
&& !(flags
& LOOKUP_NO_NON_INTEGRAL
)))
1413 || SCOPED_ENUM_P (from
))
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 bool copy_list_init
= false;
1564 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1566 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1567 /* DR 1288: Otherwise, if the initializer list has a single element
1568 of type E and ... [T's] referenced type is reference-related to E,
1569 the object or reference is initialized from that element... */
1570 if (CONSTRUCTOR_NELTS (expr
) == 1)
1572 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1573 if (error_operand_p (elt
))
1575 tree etype
= TREE_TYPE (elt
);
1576 if (reference_related_p (to
, etype
))
1583 /* Otherwise, if T is a reference type, a prvalue temporary of the type
1584 referenced by T is copy-list-initialized, and the reference is bound
1585 to that temporary. */
1586 copy_list_init
= true;
1590 if (TYPE_REF_P (from
))
1592 from
= TREE_TYPE (from
);
1593 if (!TYPE_REF_IS_RVALUE (rfrom
)
1594 || TREE_CODE (from
) == FUNCTION_TYPE
)
1595 gl_kind
= clk_ordinary
;
1597 gl_kind
= clk_rvalueref
;
1600 gl_kind
= lvalue_kind (expr
);
1601 else if (CLASS_TYPE_P (from
)
1602 || TREE_CODE (from
) == ARRAY_TYPE
)
1603 gl_kind
= clk_class
;
1607 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1608 if ((flags
& LOOKUP_NO_TEMP_BIND
)
1609 && (gl_kind
& clk_class
))
1612 /* Same mask as real_lvalue_p. */
1613 is_lvalue
= gl_kind
&& !(gl_kind
& (clk_rvalueref
|clk_class
));
1616 if ((gl_kind
& clk_bitfield
) != 0)
1617 tfrom
= unlowered_expr_type (expr
);
1619 /* Figure out whether or not the types are reference-related and
1620 reference compatible. We have to do this after stripping
1621 references from FROM. */
1622 related_p
= reference_related_p (to
, tfrom
);
1623 /* If this is a C cast, first convert to an appropriately qualified
1624 type, so that we can later do a const_cast to the desired type. */
1625 if (related_p
&& c_cast_p
1626 && !at_least_as_qualified_p (to
, tfrom
))
1627 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1628 compatible_p
= reference_compatible_p (to
, tfrom
);
1630 /* Directly bind reference when target expression's type is compatible with
1631 the reference and expression is an lvalue. In DR391, the wording in
1632 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1633 const and rvalue references to rvalues of compatible class type.
1634 We should also do direct bindings for non-class xvalues. */
1635 if ((related_p
|| compatible_p
) && gl_kind
)
1639 If the initializer expression
1641 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1642 is reference-compatible with "cv2 T2,"
1644 the reference is bound directly to the initializer expression
1648 If the initializer expression is an rvalue, with T2 a class type,
1649 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1650 is bound to the object represented by the rvalue or to a sub-object
1651 within that object. */
1653 conv
= build_identity_conv (tfrom
, expr
);
1654 conv
= direct_reference_binding (rto
, conv
);
1656 if (TYPE_REF_P (rfrom
))
1657 /* Handle rvalue reference to function properly. */
1658 conv
->rvaluedness_matches_p
1659 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1661 conv
->rvaluedness_matches_p
1662 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1664 if ((gl_kind
& clk_bitfield
) != 0
1665 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1666 /* For the purposes of overload resolution, we ignore the fact
1667 this expression is a bitfield or packed field. (In particular,
1668 [over.ics.ref] says specifically that a function with a
1669 non-const reference parameter is viable even if the
1670 argument is a bitfield.)
1672 However, when we actually call the function we must create
1673 a temporary to which to bind the reference. If the
1674 reference is volatile, or isn't const, then we cannot make
1675 a temporary, so we just issue an error when the conversion
1677 conv
->need_temporary_p
= true;
1679 /* Don't allow binding of lvalues (other than function lvalues) to
1680 rvalue references. */
1681 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1682 && TREE_CODE (to
) != FUNCTION_TYPE
)
1685 /* Nor the reverse. */
1686 if (!is_lvalue
&& !TYPE_REF_IS_RVALUE (rto
)
1687 && (!CP_TYPE_CONST_NON_VOLATILE_P (to
)
1688 || (flags
& LOOKUP_NO_RVAL_BIND
))
1689 && TREE_CODE (to
) != FUNCTION_TYPE
)
1697 /* [class.conv.fct] A conversion function is never used to convert a
1698 (possibly cv-qualified) object to the (possibly cv-qualified) same
1699 object type (or a reference to it), to a (possibly cv-qualified) base
1700 class of that type (or a reference to it).... */
1701 else if (CLASS_TYPE_P (from
) && !related_p
1702 && !(flags
& LOOKUP_NO_CONVERSION
))
1706 If the initializer expression
1708 -- has a class type (i.e., T2 is a class type) can be
1709 implicitly converted to an lvalue of type "cv3 T3," where
1710 "cv1 T1" is reference-compatible with "cv3 T3". (this
1711 conversion is selected by enumerating the applicable
1712 conversion functions (_over.match.ref_) and choosing the
1713 best one through overload resolution. (_over.match_).
1715 the reference is bound to the lvalue result of the conversion
1716 in the second case. */
1717 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1720 return cand
->second_conv
;
1723 /* From this point on, we conceptually need temporaries, even if we
1724 elide them. Only the cases above are "direct bindings". */
1725 if (flags
& LOOKUP_NO_TEMP_BIND
)
1730 When a parameter of reference type is not bound directly to an
1731 argument expression, the conversion sequence is the one required
1732 to convert the argument expression to the underlying type of the
1733 reference according to _over.best.ics_. Conceptually, this
1734 conversion sequence corresponds to copy-initializing a temporary
1735 of the underlying type with the argument expression. Any
1736 difference in top-level cv-qualification is subsumed by the
1737 initialization itself and does not constitute a conversion. */
1741 Otherwise, the reference shall be an lvalue reference to a
1742 non-volatile const type, or the reference shall be an rvalue
1745 We try below to treat this as a bad conversion to improve diagnostics,
1746 but if TO is an incomplete class, we need to reject this conversion
1747 now to avoid unnecessary instantiation. */
1748 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
)
1749 && !COMPLETE_TYPE_P (to
))
1752 /* We're generating a temporary now, but don't bind any more in the
1753 conversion (specifically, don't slice the temporary returned by a
1754 conversion operator). */
1755 flags
|= LOOKUP_NO_TEMP_BIND
;
1757 /* Core issue 899: When [copy-]initializing a temporary to be bound
1758 to the first parameter of a copy constructor (12.8) called with
1759 a single argument in the context of direct-initialization,
1760 explicit conversion functions are also considered.
1762 So don't set LOOKUP_ONLYCONVERTING in that case. */
1763 if (!(flags
& LOOKUP_COPY_PARM
))
1764 flags
|= LOOKUP_ONLYCONVERTING
;
1767 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1772 if (conv
->user_conv_p
)
1775 /* Remember this was copy-list-initialization. */
1776 conv
->need_temporary_p
= true;
1778 /* If initializing the temporary used a conversion function,
1779 recalculate the second conversion sequence. */
1780 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1781 if (t
->kind
== ck_user
1782 && DECL_CONV_FN_P (t
->cand
->fn
))
1784 tree ftype
= TREE_TYPE (TREE_TYPE (t
->cand
->fn
));
1785 int sflags
= (flags
|LOOKUP_NO_CONVERSION
)&~LOOKUP_NO_TEMP_BIND
;
1786 conversion
*new_second
1787 = reference_binding (rto
, ftype
, NULL_TREE
, c_cast_p
,
1791 return merge_conversion_sequences (t
, new_second
);
1795 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1796 /* This reference binding, unlike those above, requires the
1797 creation of a temporary. */
1798 conv
->need_temporary_p
= true;
1799 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1803 Otherwise, the reference shall be an lvalue reference to a
1804 non-volatile const type, or the reference shall be an rvalue
1806 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1811 Otherwise, a temporary of type "cv1 T1" is created and
1812 initialized from the initializer expression using the rules for a
1813 non-reference copy initialization. If T1 is reference-related to
1814 T2, cv1 must be the same cv-qualification as, or greater
1815 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1816 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1822 /* Returns the implicit conversion sequence (see [over.ics]) from type
1823 FROM to type TO. The optional expression EXPR may affect the
1824 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1825 true, this conversion is coming from a C-style cast. */
1828 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1829 int flags
, tsubst_flags_t complain
)
1833 if (from
== error_mark_node
|| to
== error_mark_node
1834 || expr
== error_mark_node
)
1837 /* Other flags only apply to the primary function in overload
1838 resolution, or after we've chosen one. */
1839 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1840 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1841 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1843 /* FIXME: actually we don't want warnings either, but we can't just
1844 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1845 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1846 We really ought not to issue that warning until we've committed
1847 to that conversion. */
1848 complain
&= ~tf_error
;
1850 /* Call reshape_init early to remove redundant braces. */
1851 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
)
1852 && CLASS_TYPE_P (to
)
1853 && COMPLETE_TYPE_P (complete_type (to
))
1854 && !CLASSTYPE_NON_AGGREGATE (to
))
1856 expr
= reshape_init (to
, expr
, complain
);
1857 if (expr
== error_mark_node
)
1859 from
= TREE_TYPE (expr
);
1862 if (TYPE_REF_P (to
))
1863 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1865 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
, complain
);
1870 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1872 if (is_std_init_list (to
))
1873 return build_list_conv (to
, expr
, flags
, complain
);
1875 /* As an extension, allow list-initialization of _Complex. */
1876 if (TREE_CODE (to
) == COMPLEX_TYPE
)
1878 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1883 /* Allow conversion from an initializer-list with one element to a
1885 if (SCALAR_TYPE_P (to
))
1887 int nelts
= CONSTRUCTOR_NELTS (expr
);
1891 elt
= build_value_init (to
, tf_none
);
1892 else if (nelts
== 1)
1893 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1895 elt
= error_mark_node
;
1897 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1898 c_cast_p
, flags
, complain
);
1901 conv
->check_narrowing
= true;
1902 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1903 /* Too many levels of braces, i.e. '{{1}}'. */
1908 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1909 return build_array_conv (to
, expr
, flags
, complain
);
1912 if (expr
!= NULL_TREE
1913 && (MAYBE_CLASS_TYPE_P (from
)
1914 || MAYBE_CLASS_TYPE_P (to
))
1915 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1917 struct z_candidate
*cand
;
1919 if (CLASS_TYPE_P (to
)
1920 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
1921 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
1922 return build_aggr_conv (to
, expr
, flags
, complain
);
1924 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
1927 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
1928 && CONSTRUCTOR_NELTS (expr
) == 1
1929 && !is_list_ctor (cand
->fn
))
1931 /* "If C is not an initializer-list constructor and the
1932 initializer list has a single element of type cv U, where U is
1933 X or a class derived from X, the implicit conversion sequence
1934 has Exact Match rank if U is X, or Conversion rank if U is
1936 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1937 tree elttype
= TREE_TYPE (elt
);
1938 if (reference_related_p (to
, elttype
))
1939 return implicit_conversion (to
, elttype
, elt
,
1940 c_cast_p
, flags
, complain
);
1942 conv
= cand
->second_conv
;
1945 /* We used to try to bind a reference to a temporary here, but that
1946 is now handled after the recursive call to this function at the end
1947 of reference_binding. */
1954 /* Like implicit_conversion, but return NULL if the conversion is bad.
1956 This is not static so that check_non_deducible_conversion can call it within
1957 add_template_candidate_real as part of overload resolution; it should not be
1958 called outside of overload resolution. */
1961 good_conversion (tree to
, tree from
, tree expr
,
1962 int flags
, tsubst_flags_t complain
)
1964 conversion
*c
= implicit_conversion (to
, from
, expr
, /*cast*/false,
1971 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1972 functions. ARGS will not be changed until a single candidate is
1975 static struct z_candidate
*
1976 add_candidate (struct z_candidate
**candidates
,
1977 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
1978 size_t num_convs
, conversion
**convs
,
1979 tree access_path
, tree conversion_path
,
1980 int viable
, struct rejection_reason
*reason
,
1983 struct z_candidate
*cand
= (struct z_candidate
*)
1984 conversion_obstack_alloc (sizeof (struct z_candidate
));
1987 cand
->first_arg
= first_arg
;
1989 cand
->convs
= convs
;
1990 cand
->num_convs
= num_convs
;
1991 cand
->access_path
= access_path
;
1992 cand
->conversion_path
= conversion_path
;
1993 cand
->viable
= viable
;
1994 cand
->reason
= reason
;
1995 cand
->next
= *candidates
;
1996 cand
->flags
= flags
;
2002 /* Return the number of remaining arguments in the parameter list
2003 beginning with ARG. */
2006 remaining_arguments (tree arg
)
2010 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
2011 arg
= TREE_CHAIN (arg
))
2017 /* [over.match.copy]: When initializing a temporary object (12.2) to be bound
2018 to the first parameter of a constructor where the parameter is of type
2019 "reference to possibly cv-qualified T" and the constructor is called with a
2020 single argument in the context of direct-initialization of an object of type
2021 "cv2 T", explicit conversion functions are also considered.
2023 So set LOOKUP_COPY_PARM to let reference_binding know that
2024 it's being called in that context. */
2027 conv_flags (int i
, int nargs
, tree fn
, tree arg
, int flags
)
2031 if (i
== 0 && nargs
== 1 && DECL_CONSTRUCTOR_P (fn
)
2032 && (t
= FUNCTION_FIRST_USER_PARMTYPE (fn
))
2033 && (same_type_ignoring_top_level_qualifiers_p
2034 (non_reference (TREE_VALUE (t
)), DECL_CONTEXT (fn
))))
2036 if (!(flags
& LOOKUP_ONLYCONVERTING
))
2037 lflags
|= LOOKUP_COPY_PARM
;
2038 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
2039 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
2040 lflags
|= LOOKUP_NO_CONVERSION
;
2043 lflags
|= LOOKUP_ONLYCONVERTING
;
2048 /* Create an overload candidate for the function or method FN called
2049 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
2050 FLAGS is passed on to implicit_conversion.
2052 This does not change ARGS.
2054 CTYPE, if non-NULL, is the type we want to pretend this function
2055 comes from for purposes of overload resolution. */
2057 static struct z_candidate
*
2058 add_function_candidate (struct z_candidate
**candidates
,
2059 tree fn
, tree ctype
, tree first_arg
,
2060 const vec
<tree
, va_gc
> *args
, tree access_path
,
2061 tree conversion_path
, int flags
,
2063 tsubst_flags_t complain
)
2065 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2068 tree orig_first_arg
= first_arg
;
2071 struct rejection_reason
*reason
= NULL
;
2073 /* At this point we should not see any functions which haven't been
2074 explicitly declared, except for friend functions which will have
2075 been found using argument dependent lookup. */
2076 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
2078 /* The `this', `in_chrg' and VTT arguments to constructors are not
2079 considered in overload resolution. */
2080 if (DECL_CONSTRUCTOR_P (fn
))
2082 if (ctor_omit_inherited_parms (fn
))
2083 /* Bring back parameters omitted from an inherited ctor. */
2084 parmlist
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn
));
2086 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
2087 skip
= num_artificial_parms_for (fn
);
2088 if (skip
> 0 && first_arg
!= NULL_TREE
)
2091 first_arg
= NULL_TREE
;
2097 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
2099 convs
= alloc_conversions (len
);
2101 /* 13.3.2 - Viable functions [over.match.viable]
2102 First, to be a viable function, a candidate function shall have enough
2103 parameters to agree in number with the arguments in the list.
2105 We need to check this first; otherwise, checking the ICSes might cause
2106 us to produce an ill-formed template instantiation. */
2108 parmnode
= parmlist
;
2109 for (i
= 0; i
< len
; ++i
)
2111 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
2113 parmnode
= TREE_CHAIN (parmnode
);
2116 if ((i
< len
&& parmnode
)
2117 || !sufficient_parms_p (parmnode
))
2119 int remaining
= remaining_arguments (parmnode
);
2121 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
2124 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2125 parameter of type "reference to cv C" (including such a constructor
2126 instantiated from a template) is excluded from the set of candidate
2127 functions when used to construct an object of type D with an argument list
2128 containing a single argument if C is reference-related to D. */
2129 if (viable
&& len
== 1 && parmlist
&& DECL_CONSTRUCTOR_P (fn
)
2130 && flag_new_inheriting_ctors
2131 && DECL_INHERITED_CTOR (fn
))
2133 tree ptype
= non_reference (TREE_VALUE (parmlist
));
2134 tree dtype
= DECL_CONTEXT (fn
);
2135 tree btype
= DECL_INHERITED_CTOR_BASE (fn
);
2136 if (reference_related_p (ptype
, dtype
)
2137 && reference_related_p (btype
, ptype
))
2140 reason
= inherited_ctor_rejection ();
2144 /* Second, for a function to be viable, its constraints must be
2146 if (flag_concepts
&& viable
2147 && !constraints_satisfied_p (fn
))
2149 reason
= constraint_failure (fn
);
2153 /* When looking for a function from a subobject from an implicit
2154 copy/move constructor/operator=, don't consider anything that takes (a
2155 reference to) an unrelated type. See c++/44909 and core 1092. */
2156 if (viable
&& parmlist
&& (flags
& LOOKUP_DEFAULTED
))
2158 if (DECL_CONSTRUCTOR_P (fn
))
2160 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
2161 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
))
2167 parmnode
= chain_index (i
-1, parmlist
);
2168 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
2173 /* This only applies at the top level. */
2174 flags
&= ~LOOKUP_DEFAULTED
;
2180 /* Third, for F to be a viable function, there shall exist for each
2181 argument an implicit conversion sequence that converts that argument
2182 to the corresponding parameter of F. */
2184 parmnode
= parmlist
;
2186 for (i
= 0; i
< len
; ++i
)
2188 tree argtype
, to_type
;
2193 if (parmnode
== void_list_node
)
2198 /* Already set during deduction. */
2199 parmnode
= TREE_CHAIN (parmnode
);
2203 if (i
== 0 && first_arg
!= NULL_TREE
)
2206 arg
= CONST_CAST_TREE (
2207 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
2208 argtype
= lvalue_type (arg
);
2210 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2211 && ! DECL_CONSTRUCTOR_P (fn
));
2215 tree parmtype
= TREE_VALUE (parmnode
);
2217 parmnode
= TREE_CHAIN (parmnode
);
2219 /* The type of the implicit object parameter ('this') for
2220 overload resolution is not always the same as for the
2221 function itself; conversion functions are considered to
2222 be members of the class being converted, and functions
2223 introduced by a using-declaration are considered to be
2224 members of the class that uses them.
2226 Since build_over_call ignores the ICS for the `this'
2227 parameter, we can just change the parm type. */
2228 if (ctype
&& is_this
)
2230 parmtype
= cp_build_qualified_type
2231 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
2232 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
2234 /* If the function has a ref-qualifier, the implicit
2235 object parameter has reference type. */
2236 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
2237 parmtype
= cp_build_reference_type (parmtype
, rv
);
2238 /* The special handling of 'this' conversions in compare_ics
2239 does not apply if there is a ref-qualifier. */
2244 parmtype
= build_pointer_type (parmtype
);
2245 /* We don't use build_this here because we don't want to
2246 capture the object argument until we've chosen a
2247 non-static member function. */
2248 arg
= build_address (arg
);
2249 argtype
= lvalue_type (arg
);
2253 int lflags
= conv_flags (i
, len
-skip
, fn
, arg
, flags
);
2255 t
= implicit_conversion (parmtype
, argtype
, arg
,
2256 /*c_cast_p=*/false, lflags
, complain
);
2261 t
= build_identity_conv (argtype
, arg
);
2262 t
->ellipsis_p
= true;
2273 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
,
2274 EXPR_LOCATION (arg
));
2281 reason
= bad_arg_conversion_rejection (first_arg
, i
, arg
, to_type
,
2282 EXPR_LOCATION (arg
));
2288 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2289 access_path
, conversion_path
, viable
, reason
, flags
);
2292 /* Create an overload candidate for the conversion function FN which will
2293 be invoked for expression OBJ, producing a pointer-to-function which
2294 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2295 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2296 passed on to implicit_conversion.
2298 Actually, we don't really care about FN; we care about the type it
2299 converts to. There may be multiple conversion functions that will
2300 convert to that type, and we rely on build_user_type_conversion_1 to
2301 choose the best one; so when we create our candidate, we record the type
2302 instead of the function. */
2304 static struct z_candidate
*
2305 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2306 const vec
<tree
, va_gc
> *arglist
,
2307 tree access_path
, tree conversion_path
,
2308 tsubst_flags_t complain
)
2310 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2311 int i
, len
, viable
, flags
;
2312 tree parmlist
, parmnode
;
2314 struct rejection_reason
*reason
;
2316 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2317 parmlist
= TREE_TYPE (parmlist
);
2318 parmlist
= TYPE_ARG_TYPES (parmlist
);
2320 len
= vec_safe_length (arglist
) + 1;
2321 convs
= alloc_conversions (len
);
2322 parmnode
= parmlist
;
2324 flags
= LOOKUP_IMPLICIT
;
2327 /* Don't bother looking up the same type twice. */
2328 if (*candidates
&& (*candidates
)->fn
== totype
)
2331 for (i
= 0; i
< len
; ++i
)
2333 tree arg
, argtype
, convert_type
= NULL_TREE
;
2339 arg
= (*arglist
)[i
- 1];
2340 argtype
= lvalue_type (arg
);
2344 t
= build_identity_conv (argtype
, NULL_TREE
);
2345 t
= build_conv (ck_user
, totype
, t
);
2346 /* Leave the 'cand' field null; we'll figure out the conversion in
2347 convert_like_real if this candidate is chosen. */
2348 convert_type
= totype
;
2350 else if (parmnode
== void_list_node
)
2354 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2355 /*c_cast_p=*/false, flags
, complain
);
2356 convert_type
= TREE_VALUE (parmnode
);
2360 t
= build_identity_conv (argtype
, arg
);
2361 t
->ellipsis_p
= true;
2362 convert_type
= argtype
;
2372 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, arg
, convert_type
,
2373 EXPR_LOCATION (arg
));
2380 parmnode
= TREE_CHAIN (parmnode
);
2384 || ! sufficient_parms_p (parmnode
))
2386 int remaining
= remaining_arguments (parmnode
);
2388 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2391 return add_candidate (candidates
, totype
, obj
, arglist
, len
, convs
,
2392 access_path
, conversion_path
, viable
, reason
, flags
);
2396 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2397 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2398 int flags
, tsubst_flags_t complain
)
2405 struct rejection_reason
*reason
= NULL
;
2410 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2411 convs
= alloc_conversions (num_convs
);
2413 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2414 conversion ops are allowed. We handle that here by just checking for
2415 boolean_type_node because other operators don't ask for it. COND_EXPR
2416 also does contextual conversion to bool for the first operand, but we
2417 handle that in build_conditional_expr, and type1 here is operand 2. */
2418 if (type1
!= boolean_type_node
)
2419 flags
|= LOOKUP_ONLYCONVERTING
;
2421 for (i
= 0; i
< 2; ++i
)
2426 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2427 /*c_cast_p=*/false, flags
, complain
);
2431 /* We need something for printing the candidate. */
2432 t
= build_identity_conv (types
[i
], NULL_TREE
);
2433 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2434 types
[i
], EXPR_LOCATION (args
[i
]));
2439 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, args
[i
],
2441 EXPR_LOCATION (args
[i
]));
2446 /* For COND_EXPR we rearranged the arguments; undo that now. */
2449 convs
[2] = convs
[1];
2450 convs
[1] = convs
[0];
2451 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2452 /*c_cast_p=*/false, flags
,
2459 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2461 EXPR_LOCATION (args
[2]));
2465 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2467 /*access_path=*/NULL_TREE
,
2468 /*conversion_path=*/NULL_TREE
,
2469 viable
, reason
, flags
);
2473 is_complete (tree t
)
2475 return COMPLETE_TYPE_P (complete_type (t
));
2478 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2481 promoted_arithmetic_type_p (tree type
)
2485 In this section, the term promoted integral type is used to refer
2486 to those integral types which are preserved by integral promotion
2487 (including e.g. int and long but excluding e.g. char).
2488 Similarly, the term promoted arithmetic type refers to promoted
2489 integral types plus floating types. */
2490 return ((CP_INTEGRAL_TYPE_P (type
)
2491 && same_type_p (type_promotes_to (type
), type
))
2492 || TREE_CODE (type
) == REAL_TYPE
);
2495 /* Create any builtin operator overload candidates for the operator in
2496 question given the converted operand types TYPE1 and TYPE2. The other
2497 args are passed through from add_builtin_candidates to
2498 build_builtin_candidate.
2500 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2501 If CODE is requires candidates operands of the same type of the kind
2502 of which TYPE1 and TYPE2 are, we add both candidates
2503 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2506 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2507 enum tree_code code2
, tree fnname
, tree type1
,
2508 tree type2
, tree
*args
, tree
*argtypes
, int flags
,
2509 tsubst_flags_t complain
)
2513 case POSTINCREMENT_EXPR
:
2514 case POSTDECREMENT_EXPR
:
2515 args
[1] = integer_zero_node
;
2516 type2
= integer_type_node
;
2525 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2526 and VQ is either volatile or empty, there exist candidate operator
2527 functions of the form
2528 VQ T& operator++(VQ T&);
2529 T operator++(VQ T&, int);
2530 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2531 type other than bool, and VQ is either volatile or empty, there exist
2532 candidate operator functions of the form
2533 VQ T& operator--(VQ T&);
2534 T operator--(VQ T&, int);
2535 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2536 complete object type, and VQ is either volatile or empty, there exist
2537 candidate operator functions of the form
2538 T*VQ& operator++(T*VQ&);
2539 T*VQ& operator--(T*VQ&);
2540 T* operator++(T*VQ&, int);
2541 T* operator--(T*VQ&, int); */
2543 case POSTDECREMENT_EXPR
:
2544 case PREDECREMENT_EXPR
:
2545 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2548 case POSTINCREMENT_EXPR
:
2549 case PREINCREMENT_EXPR
:
2550 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2552 type1
= build_reference_type (type1
);
2557 /* 7 For every cv-qualified or cv-unqualified object type T, there
2558 exist candidate operator functions of the form
2562 8 For every function type T, there exist candidate operator functions of
2564 T& operator*(T*); */
2567 if (TYPE_PTR_P (type1
)
2568 && (TYPE_PTROB_P (type1
)
2569 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2573 /* 9 For every type T, there exist candidate operator functions of the form
2576 10For every promoted arithmetic type T, there exist candidate operator
2577 functions of the form
2581 case UNARY_PLUS_EXPR
: /* unary + */
2582 if (TYPE_PTR_P (type1
))
2586 if (ARITHMETIC_TYPE_P (type1
))
2590 /* 11For every promoted integral type T, there exist candidate operator
2591 functions of the form
2595 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2599 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2600 is the same type as C2 or is a derived class of C2, T is a complete
2601 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2602 there exist candidate operator functions of the form
2603 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2604 where CV12 is the union of CV1 and CV2. */
2607 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2609 tree c1
= TREE_TYPE (type1
);
2610 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2612 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2613 && (TYPE_PTRMEMFUNC_P (type2
)
2614 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2619 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2620 didate operator functions of the form
2625 bool operator<(L, R);
2626 bool operator>(L, R);
2627 bool operator<=(L, R);
2628 bool operator>=(L, R);
2629 bool operator==(L, R);
2630 bool operator!=(L, R);
2631 where LR is the result of the usual arithmetic conversions between
2634 14For every pair of types T and I, where T is a cv-qualified or cv-
2635 unqualified complete object type and I is a promoted integral type,
2636 there exist candidate operator functions of the form
2637 T* operator+(T*, I);
2638 T& operator[](T*, I);
2639 T* operator-(T*, I);
2640 T* operator+(I, T*);
2641 T& operator[](I, T*);
2643 15For every T, where T is a pointer to complete object type, there exist
2644 candidate operator functions of the form112)
2645 ptrdiff_t operator-(T, T);
2647 16For every pointer or enumeration type T, there exist candidate operator
2648 functions of the form
2649 bool operator<(T, T);
2650 bool operator>(T, T);
2651 bool operator<=(T, T);
2652 bool operator>=(T, T);
2653 bool operator==(T, T);
2654 bool operator!=(T, T);
2656 17For every pointer to member type T, there exist candidate operator
2657 functions of the form
2658 bool operator==(T, T);
2659 bool operator!=(T, T); */
2662 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2664 if (TYPE_PTROB_P (type1
)
2665 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2667 type2
= ptrdiff_type_node
;
2672 case TRUNC_DIV_EXPR
:
2673 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2679 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2680 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2682 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2687 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2699 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2701 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2703 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2704 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2706 if (TYPE_PTR_P (type1
)
2707 && null_ptr_cst_p (args
[1]))
2712 if (null_ptr_cst_p (args
[0])
2713 && TYPE_PTR_P (type2
))
2721 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2725 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2727 type1
= ptrdiff_type_node
;
2730 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2732 type2
= ptrdiff_type_node
;
2737 /* 18For every pair of promoted integral types L and R, there exist candi-
2738 date operator functions of the form
2745 where LR is the result of the usual arithmetic conversions between
2748 case TRUNC_MOD_EXPR
:
2754 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2758 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2759 type, VQ is either volatile or empty, and R is a promoted arithmetic
2760 type, there exist candidate operator functions of the form
2761 VQ L& operator=(VQ L&, R);
2762 VQ L& operator*=(VQ L&, R);
2763 VQ L& operator/=(VQ L&, R);
2764 VQ L& operator+=(VQ L&, R);
2765 VQ L& operator-=(VQ L&, R);
2767 20For every pair T, VQ), where T is any type and VQ is either volatile
2768 or empty, there exist candidate operator functions of the form
2769 T*VQ& operator=(T*VQ&, T*);
2771 21For every pair T, VQ), where T is a pointer to member type and VQ is
2772 either volatile or empty, there exist candidate operator functions of
2774 VQ T& operator=(VQ T&, T);
2776 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2777 unqualified complete object type, VQ is either volatile or empty, and
2778 I is a promoted integral type, there exist candidate operator func-
2780 T*VQ& operator+=(T*VQ&, I);
2781 T*VQ& operator-=(T*VQ&, I);
2783 23For every triple L, VQ, R), where L is an integral or enumeration
2784 type, VQ is either volatile or empty, and R is a promoted integral
2785 type, there exist candidate operator functions of the form
2787 VQ L& operator%=(VQ L&, R);
2788 VQ L& operator<<=(VQ L&, R);
2789 VQ L& operator>>=(VQ L&, R);
2790 VQ L& operator&=(VQ L&, R);
2791 VQ L& operator^=(VQ L&, R);
2792 VQ L& operator|=(VQ L&, R); */
2799 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2801 type2
= ptrdiff_type_node
;
2806 case TRUNC_DIV_EXPR
:
2807 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2811 case TRUNC_MOD_EXPR
:
2817 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2822 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2824 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2825 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2826 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2827 || ((TYPE_PTRMEMFUNC_P (type1
)
2828 || TYPE_PTR_P (type1
))
2829 && null_ptr_cst_p (args
[1])))
2839 type1
= build_reference_type (type1
);
2845 For every pair of promoted arithmetic types L and R, there
2846 exist candidate operator functions of the form
2848 LR operator?(bool, L, R);
2850 where LR is the result of the usual arithmetic conversions
2851 between types L and R.
2853 For every type T, where T is a pointer or pointer-to-member
2854 type, there exist candidate operator functions of the form T
2855 operator?(bool, T, T); */
2857 if (promoted_arithmetic_type_p (type1
)
2858 && promoted_arithmetic_type_p (type2
))
2862 /* Otherwise, the types should be pointers. */
2863 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2866 /* We don't check that the two types are the same; the logic
2867 below will actually create two candidates; one in which both
2868 parameter types are TYPE1, and one in which both parameter
2874 if (ARITHMETIC_TYPE_P (type1
))
2882 /* Make sure we don't create builtin candidates with dependent types. */
2883 bool u1
= uses_template_parms (type1
);
2884 bool u2
= type2
? uses_template_parms (type2
) : false;
2887 /* Try to recover if one of the types is non-dependent. But if
2888 there's only one type, there's nothing we can do. */
2891 /* And we lose if both are dependent. */
2894 /* Or if they have different forms. */
2895 if (TREE_CODE (type1
) != TREE_CODE (type2
))
2904 /* If we're dealing with two pointer types or two enumeral types,
2905 we need candidates for both of them. */
2906 if (type2
&& !same_type_p (type1
, type2
)
2907 && TREE_CODE (type1
) == TREE_CODE (type2
)
2908 && (TYPE_REF_P (type1
)
2909 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2910 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2911 || TYPE_PTRMEMFUNC_P (type1
)
2912 || MAYBE_CLASS_TYPE_P (type1
)
2913 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2915 if (TYPE_PTR_OR_PTRMEM_P (type1
))
2917 tree cptype
= composite_pointer_type (type1
, type2
,
2922 if (cptype
!= error_mark_node
)
2924 build_builtin_candidate
2925 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
2931 build_builtin_candidate
2932 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
2933 build_builtin_candidate
2934 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
2938 build_builtin_candidate
2939 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
2943 type_decays_to (tree type
)
2945 if (TREE_CODE (type
) == ARRAY_TYPE
)
2946 return build_pointer_type (TREE_TYPE (type
));
2947 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2948 return build_pointer_type (type
);
2952 /* There are three conditions of builtin candidates:
2954 1) bool-taking candidates. These are the same regardless of the input.
2955 2) pointer-pair taking candidates. These are generated for each type
2956 one of the input types converts to.
2957 3) arithmetic candidates. According to the standard, we should generate
2958 all of these, but I'm trying not to...
2960 Here we generate a superset of the possible candidates for this particular
2961 case. That is a subset of the full set the standard defines, plus some
2962 other cases which the standard disallows. add_builtin_candidate will
2963 filter out the invalid set. */
2966 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2967 enum tree_code code2
, tree fnname
, tree
*args
,
2968 int flags
, tsubst_flags_t complain
)
2972 tree type
, argtypes
[3], t
;
2973 /* TYPES[i] is the set of possible builtin-operator parameter types
2974 we will consider for the Ith argument. */
2975 vec
<tree
, va_gc
> *types
[2];
2978 for (i
= 0; i
< 3; ++i
)
2981 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2983 argtypes
[i
] = NULL_TREE
;
2988 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2989 and VQ is either volatile or empty, there exist candidate operator
2990 functions of the form
2991 VQ T& operator++(VQ T&); */
2993 case POSTINCREMENT_EXPR
:
2994 case PREINCREMENT_EXPR
:
2995 case POSTDECREMENT_EXPR
:
2996 case PREDECREMENT_EXPR
:
3001 /* 24There also exist candidate operator functions of the form
3002 bool operator!(bool);
3003 bool operator&&(bool, bool);
3004 bool operator||(bool, bool); */
3006 case TRUTH_NOT_EXPR
:
3007 build_builtin_candidate
3008 (candidates
, fnname
, boolean_type_node
,
3009 NULL_TREE
, args
, argtypes
, flags
, complain
);
3012 case TRUTH_ORIF_EXPR
:
3013 case TRUTH_ANDIF_EXPR
:
3014 build_builtin_candidate
3015 (candidates
, fnname
, boolean_type_node
,
3016 boolean_type_node
, args
, argtypes
, flags
, complain
);
3038 types
[0] = make_tree_vector ();
3039 types
[1] = make_tree_vector ();
3041 for (i
= 0; i
< 2; ++i
)
3045 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
3049 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
3052 convs
= lookup_conversions (argtypes
[i
]);
3054 if (code
== COND_EXPR
)
3056 if (lvalue_p (args
[i
]))
3057 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3059 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
3065 for (; convs
; convs
= TREE_CHAIN (convs
))
3067 type
= TREE_TYPE (convs
);
3070 && (!TYPE_REF_P (type
)
3071 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
3074 if (code
== COND_EXPR
&& TYPE_REF_P (type
))
3075 vec_safe_push (types
[i
], type
);
3077 type
= non_reference (type
);
3078 if (i
!= 0 || ! ref1
)
3080 type
= cv_unqualified (type_decays_to (type
));
3081 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
3082 vec_safe_push (types
[i
], type
);
3083 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3084 type
= type_promotes_to (type
);
3087 if (! vec_member (type
, types
[i
]))
3088 vec_safe_push (types
[i
], type
);
3093 if (code
== COND_EXPR
&& lvalue_p (args
[i
]))
3094 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3095 type
= non_reference (argtypes
[i
]);
3096 if (i
!= 0 || ! ref1
)
3098 type
= cv_unqualified (type_decays_to (type
));
3099 if (enum_p
&& UNSCOPED_ENUM_P (type
))
3100 vec_safe_push (types
[i
], type
);
3101 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3102 type
= type_promotes_to (type
);
3104 vec_safe_push (types
[i
], type
);
3108 /* Run through the possible parameter types of both arguments,
3109 creating candidates with those parameter types. */
3110 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
3115 if (!types
[1]->is_empty ())
3116 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
3117 add_builtin_candidate
3118 (candidates
, code
, code2
, fnname
, t
,
3119 u
, args
, argtypes
, flags
, complain
);
3121 add_builtin_candidate
3122 (candidates
, code
, code2
, fnname
, t
,
3123 NULL_TREE
, args
, argtypes
, flags
, complain
);
3126 release_tree_vector (types
[0]);
3127 release_tree_vector (types
[1]);
3131 /* If TMPL can be successfully instantiated as indicated by
3132 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3134 TMPL is the template. EXPLICIT_TARGS are any explicit template
3135 arguments. ARGLIST is the arguments provided at the call-site.
3136 This does not change ARGLIST. The RETURN_TYPE is the desired type
3137 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3138 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3139 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3141 static struct z_candidate
*
3142 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
3143 tree ctype
, tree explicit_targs
, tree first_arg
,
3144 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3145 tree access_path
, tree conversion_path
,
3146 int flags
, tree obj
, unification_kind_t strict
,
3147 tsubst_flags_t complain
)
3149 int ntparms
= DECL_NTPARMS (tmpl
);
3150 tree targs
= make_tree_vec (ntparms
);
3151 unsigned int len
= vec_safe_length (arglist
);
3152 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
3153 unsigned int skip_without_in_chrg
= 0;
3154 tree first_arg_without_in_chrg
= first_arg
;
3155 tree
*args_without_in_chrg
;
3156 unsigned int nargs_without_in_chrg
;
3157 unsigned int ia
, ix
;
3159 struct z_candidate
*cand
;
3161 struct rejection_reason
*reason
= NULL
;
3163 conversion
**convs
= NULL
;
3165 /* We don't do deduction on the in-charge parameter, the VTT
3166 parameter or 'this'. */
3167 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
3169 if (first_arg_without_in_chrg
!= NULL_TREE
)
3170 first_arg_without_in_chrg
= NULL_TREE
;
3171 else if (return_type
&& strict
== DEDUCE_CALL
)
3172 /* We're deducing for a call to the result of a template conversion
3173 function, so the args don't contain 'this'; leave them alone. */;
3175 ++skip_without_in_chrg
;
3178 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
3179 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
3180 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
3182 if (first_arg_without_in_chrg
!= NULL_TREE
)
3183 first_arg_without_in_chrg
= NULL_TREE
;
3185 ++skip_without_in_chrg
;
3188 if (len
< skip_without_in_chrg
)
3191 if (DECL_CONSTRUCTOR_P (tmpl
) && nargs
== 2
3192 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg
),
3193 TREE_TYPE ((*arglist
)[0])))
3195 /* 12.8/6 says, "A declaration of a constructor for a class X is
3196 ill-formed if its first parameter is of type (optionally cv-qualified)
3197 X and either there are no other parameters or else all other
3198 parameters have default arguments. A member function template is never
3199 instantiated to produce such a constructor signature."
3201 So if we're trying to copy an object of the containing class, don't
3202 consider a template constructor that has a first parameter type that
3203 is just a template parameter, as we would deduce a signature that we
3204 would then reject in the code below. */
3205 if (tree firstparm
= FUNCTION_FIRST_USER_PARMTYPE (tmpl
))
3207 firstparm
= TREE_VALUE (firstparm
);
3208 if (PACK_EXPANSION_P (firstparm
))
3209 firstparm
= PACK_EXPANSION_PATTERN (firstparm
);
3210 if (TREE_CODE (firstparm
) == TEMPLATE_TYPE_PARM
)
3212 gcc_assert (!explicit_targs
);
3213 reason
= invalid_copy_with_fn_template_rejection ();
3219 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
3220 + (len
- skip_without_in_chrg
));
3221 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
3223 if (first_arg_without_in_chrg
!= NULL_TREE
)
3225 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
3228 for (ix
= skip_without_in_chrg
;
3229 vec_safe_iterate (arglist
, ix
, &arg
);
3232 args_without_in_chrg
[ia
] = arg
;
3235 gcc_assert (ia
== nargs_without_in_chrg
);
3237 errs
= errorcount
+sorrycount
;
3239 convs
= alloc_conversions (nargs
);
3240 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
3241 args_without_in_chrg
,
3242 nargs_without_in_chrg
,
3243 return_type
, strict
, flags
, convs
,
3244 false, complain
& tf_decltype
);
3246 if (fn
== error_mark_node
)
3248 /* Don't repeat unification later if it already resulted in errors. */
3249 if (errorcount
+sorrycount
== errs
)
3250 reason
= template_unification_rejection (tmpl
, explicit_targs
,
3251 targs
, args_without_in_chrg
,
3252 nargs_without_in_chrg
,
3253 return_type
, strict
, flags
);
3255 reason
= template_unification_error_rejection ();
3259 /* Now the explicit specifier might have been deduced; check if this
3260 declaration is explicit. If it is and we're ignoring non-converting
3261 constructors, don't add this function to the set of candidates. */
3262 if ((flags
& LOOKUP_ONLYCONVERTING
) && DECL_NONCONVERTING_P (fn
))
3265 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
3267 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
3268 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
3271 /* We're trying to produce a constructor with a prohibited signature,
3272 as discussed above; handle here any cases we didn't catch then,
3274 reason
= invalid_copy_with_fn_template_rejection ();
3279 if (obj
!= NULL_TREE
)
3280 /* Aha, this is a conversion function. */
3281 cand
= add_conv_candidate (candidates
, fn
, obj
, arglist
,
3282 access_path
, conversion_path
, complain
);
3284 cand
= add_function_candidate (candidates
, fn
, ctype
,
3285 first_arg
, arglist
, access_path
,
3286 conversion_path
, flags
, convs
, complain
);
3287 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
3288 /* This situation can occur if a member template of a template
3289 class is specialized. Then, instantiate_template might return
3290 an instantiation of the specialization, in which case the
3291 DECL_TI_TEMPLATE field will point at the original
3292 specialization. For example:
3294 template <class T> struct S { template <class U> void f(U);
3295 template <> void f(int) {}; };
3299 Here, TMPL will be template <class U> S<double>::f(U).
3300 And, instantiate template will give us the specialization
3301 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3302 for this will point at template <class T> template <> S<T>::f(int),
3303 so that we can find the definition. For the purposes of
3304 overload resolution, however, we want the original TMPL. */
3305 cand
->template_decl
= build_template_info (tmpl
, targs
);
3307 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3308 cand
->explicit_targs
= explicit_targs
;
3312 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3313 access_path
, conversion_path
, 0, reason
, flags
);
3317 static struct z_candidate
*
3318 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3319 tree explicit_targs
, tree first_arg
,
3320 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3321 tree access_path
, tree conversion_path
, int flags
,
3322 unification_kind_t strict
, tsubst_flags_t complain
)
3325 add_template_candidate_real (candidates
, tmpl
, ctype
,
3326 explicit_targs
, first_arg
, arglist
,
3327 return_type
, access_path
, conversion_path
,
3328 flags
, NULL_TREE
, strict
, complain
);
3331 /* Create an overload candidate for the conversion function template TMPL,
3332 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3333 pointer-to-function which will in turn be called with the argument list
3334 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3335 passed on to implicit_conversion. */
3337 static struct z_candidate
*
3338 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3340 const vec
<tree
, va_gc
> *arglist
,
3341 tree return_type
, tree access_path
,
3342 tree conversion_path
, tsubst_flags_t complain
)
3344 /* Making this work broke PR 71117 and 85118, so until the committee resolves
3345 core issue 2189, let's disable this candidate if there are any call
3351 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3352 NULL_TREE
, arglist
, return_type
, access_path
,
3353 conversion_path
, 0, obj
, DEDUCE_CALL
,
3357 /* The CANDS are the set of candidates that were considered for
3358 overload resolution. Return the set of viable candidates, or CANDS
3359 if none are viable. If any of the candidates were viable, set
3360 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3361 considered viable only if it is strictly viable. */
3363 static struct z_candidate
*
3364 splice_viable (struct z_candidate
*cands
,
3368 struct z_candidate
*viable
;
3369 struct z_candidate
**last_viable
;
3370 struct z_candidate
**cand
;
3371 bool found_strictly_viable
= false;
3373 /* Be strict inside templates, since build_over_call won't actually
3374 do the conversions to get pedwarns. */
3375 if (processing_template_decl
)
3379 last_viable
= &viable
;
3380 *any_viable_p
= false;
3385 struct z_candidate
*c
= *cand
;
3387 && (c
->viable
== 1 || TREE_CODE (c
->fn
) == TEMPLATE_DECL
))
3389 /* Be strict in the presence of a viable candidate. Also if
3390 there are template candidates, so that we get deduction errors
3391 for them instead of silently preferring a bad conversion. */
3393 if (viable
&& !found_strictly_viable
)
3395 /* Put any spliced near matches back onto the main list so
3396 that we see them if there is no strict match. */
3397 *any_viable_p
= false;
3398 *last_viable
= cands
;
3401 last_viable
= &viable
;
3405 if (strict_p
? c
->viable
== 1 : c
->viable
)
3410 last_viable
= &c
->next
;
3411 *any_viable_p
= true;
3413 found_strictly_viable
= true;
3419 return viable
? viable
: cands
;
3423 any_strictly_viable (struct z_candidate
*cands
)
3425 for (; cands
; cands
= cands
->next
)
3426 if (cands
->viable
== 1)
3431 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3432 words, it is about to become the "this" pointer for a member
3433 function call. Take the address of the object. */
3436 build_this (tree obj
)
3438 /* In a template, we are only concerned about the type of the
3439 expression, so we can take a shortcut. */
3440 if (processing_template_decl
)
3441 return build_address (obj
);
3443 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3446 /* Returns true iff functions are equivalent. Equivalent functions are
3447 not '==' only if one is a function-local extern function or if
3448 both are extern "C". */
3451 equal_functions (tree fn1
, tree fn2
)
3453 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3455 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3457 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3458 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3459 return decls_match (fn1
, fn2
);
3463 /* Print information about a candidate FN being rejected due to INFO. */
3466 print_conversion_rejection (location_t loc
, struct conversion_info
*info
,
3469 tree from
= info
->from
;
3471 from
= lvalue_type (from
);
3472 if (info
->n_arg
== -1)
3474 /* Conversion of implicit `this' argument failed. */
3475 if (!TYPE_P (info
->from
))
3476 /* A bad conversion for 'this' must be discarding cv-quals. */
3477 inform (loc
, " passing %qT as %<this%> "
3478 "argument discards qualifiers",
3481 inform (loc
, " no known conversion for implicit "
3482 "%<this%> parameter from %qH to %qI",
3483 from
, info
->to_type
);
3485 else if (!TYPE_P (info
->from
))
3487 if (info
->n_arg
>= 0)
3488 inform (loc
, " conversion of argument %d would be ill-formed:",
3490 perform_implicit_conversion (info
->to_type
, info
->from
,
3491 tf_warning_or_error
);
3493 else if (info
->n_arg
== -2)
3494 /* Conversion of conversion function return value failed. */
3495 inform (loc
, " no known conversion from %qH to %qI",
3496 from
, info
->to_type
);
3499 if (TREE_CODE (fn
) == FUNCTION_DECL
)
3500 loc
= get_fndecl_argument_location (fn
, info
->n_arg
);
3501 inform (loc
, " no known conversion for argument %d from %qH to %qI",
3502 info
->n_arg
+ 1, from
, info
->to_type
);
3506 /* Print information about a candidate with WANT parameters and we found
3510 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3512 inform_n (loc
, want
,
3513 " candidate expects %d argument, %d provided",
3514 " candidate expects %d arguments, %d provided",
3518 /* Print information about one overload candidate CANDIDATE. MSGSTR
3519 is the text to print before the candidate itself.
3521 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3522 to have been run through gettext by the caller. This wart makes
3523 life simpler in print_z_candidates and for the translators. */
3526 print_z_candidate (location_t loc
, const char *msgstr
,
3527 struct z_candidate
*candidate
)
3529 const char *msg
= (msgstr
== NULL
3531 : ACONCAT ((msgstr
, " ", NULL
)));
3532 tree fn
= candidate
->fn
;
3533 if (flag_new_inheriting_ctors
)
3534 fn
= strip_inheriting_ctors (fn
);
3535 location_t cloc
= location_of (fn
);
3537 if (identifier_p (fn
))
3540 if (candidate
->num_convs
== 3)
3541 inform (cloc
, "%s%<%D(%T, %T, %T)%> <built-in>", msg
, fn
,
3542 candidate
->convs
[0]->type
,
3543 candidate
->convs
[1]->type
,
3544 candidate
->convs
[2]->type
);
3545 else if (candidate
->num_convs
== 2)
3546 inform (cloc
, "%s%<%D(%T, %T)%> <built-in>", msg
, fn
,
3547 candidate
->convs
[0]->type
,
3548 candidate
->convs
[1]->type
);
3550 inform (cloc
, "%s%<%D(%T)%> <built-in>", msg
, fn
,
3551 candidate
->convs
[0]->type
);
3553 else if (TYPE_P (fn
))
3554 inform (cloc
, "%s%qT <conversion>", msg
, fn
);
3555 else if (candidate
->viable
== -1)
3556 inform (cloc
, "%s%#qD <near match>", msg
, fn
);
3557 else if (DECL_DELETED_FN (fn
))
3558 inform (cloc
, "%s%#qD <deleted>", msg
, fn
);
3560 inform (cloc
, "%s%#qD", msg
, fn
);
3561 if (fn
!= candidate
->fn
)
3563 cloc
= location_of (candidate
->fn
);
3564 inform (cloc
, " inherited here");
3566 /* Give the user some information about why this candidate failed. */
3567 if (candidate
->reason
!= NULL
)
3569 struct rejection_reason
*r
= candidate
->reason
;
3574 print_arity_information (cloc
, r
->u
.arity
.actual
,
3575 r
->u
.arity
.expected
);
3577 case rr_arg_conversion
:
3578 print_conversion_rejection (cloc
, &r
->u
.conversion
, fn
);
3580 case rr_bad_arg_conversion
:
3581 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
, fn
);
3583 case rr_explicit_conversion
:
3584 inform (cloc
, " return type %qT of explicit conversion function "
3585 "cannot be converted to %qT with a qualification "
3586 "conversion", r
->u
.conversion
.from
,
3587 r
->u
.conversion
.to_type
);
3589 case rr_template_conversion
:
3590 inform (cloc
, " conversion from return type %qT of template "
3591 "conversion function specialization to %qT is not an "
3592 "exact match", r
->u
.conversion
.from
,
3593 r
->u
.conversion
.to_type
);
3595 case rr_template_unification
:
3596 /* We use template_unification_error_rejection if unification caused
3597 actual non-SFINAE errors, in which case we don't need to repeat
3599 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3601 inform (cloc
, " substitution of deduced template arguments "
3602 "resulted in errors seen above");
3605 /* Re-run template unification with diagnostics. */
3606 inform (cloc
, " template argument deduction/substitution failed:");
3607 fn_type_unification (r
->u
.template_unification
.tmpl
,
3608 r
->u
.template_unification
.explicit_targs
,
3610 (r
->u
.template_unification
.num_targs
)),
3611 r
->u
.template_unification
.args
,
3612 r
->u
.template_unification
.nargs
,
3613 r
->u
.template_unification
.return_type
,
3614 r
->u
.template_unification
.strict
,
3615 r
->u
.template_unification
.flags
,
3618 case rr_invalid_copy
:
3620 " a constructor taking a single argument of its own "
3621 "class type is invalid");
3623 case rr_constraint_failure
:
3625 tree tmpl
= r
->u
.template_instantiation
.tmpl
;
3626 tree args
= r
->u
.template_instantiation
.targs
;
3627 diagnose_constraints (cloc
, tmpl
, args
);
3630 case rr_inherited_ctor
:
3631 inform (cloc
, " an inherited constructor is not a candidate for "
3632 "initialization from an expression of the same or derived "
3637 /* This candidate didn't have any issues or we failed to
3638 handle a particular code. Either way... */
3645 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3647 struct z_candidate
*cand1
;
3648 struct z_candidate
**cand2
;
3653 /* Remove non-viable deleted candidates. */
3655 for (cand2
= &cand1
; *cand2
; )
3657 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3658 && !(*cand2
)->viable
3659 && DECL_DELETED_FN ((*cand2
)->fn
))
3660 *cand2
= (*cand2
)->next
;
3662 cand2
= &(*cand2
)->next
;
3664 /* ...if there are any non-deleted ones. */
3668 /* There may be duplicates in the set of candidates. We put off
3669 checking this condition as long as possible, since we have no way
3670 to eliminate duplicates from a set of functions in less than n^2
3671 time. Now we are about to emit an error message, so it is more
3672 permissible to go slowly. */
3673 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3675 tree fn
= cand1
->fn
;
3676 /* Skip builtin candidates and conversion functions. */
3679 cand2
= &cand1
->next
;
3682 if (DECL_P ((*cand2
)->fn
)
3683 && equal_functions (fn
, (*cand2
)->fn
))
3684 *cand2
= (*cand2
)->next
;
3686 cand2
= &(*cand2
)->next
;
3690 for (; candidates
; candidates
= candidates
->next
)
3691 print_z_candidate (loc
, "candidate:", candidates
);
3694 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3695 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3696 the result of the conversion function to convert it to the final
3697 desired type. Merge the two sequences into a single sequence,
3698 and return the merged sequence. */
3701 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3704 bool bad
= user_seq
->bad_p
;
3706 gcc_assert (user_seq
->kind
== ck_user
);
3708 /* Find the end of the second conversion sequence. */
3709 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3711 /* The entire sequence is a user-conversion sequence. */
3712 (*t
)->user_conv_p
= true;
3717 if ((*t
)->rvaluedness_matches_p
)
3718 /* We're binding a reference directly to the result of the conversion.
3719 build_user_type_conversion_1 stripped the REFERENCE_TYPE from the return
3720 type, but we want it back. */
3721 user_seq
->type
= TREE_TYPE (TREE_TYPE (user_seq
->cand
->fn
));
3723 /* Replace the identity conversion with the user conversion
3730 /* Handle overload resolution for initializing an object of class type from
3731 an initializer list. First we look for a suitable constructor that
3732 takes a std::initializer_list; if we don't find one, we then look for a
3733 non-list constructor.
3735 Parameters are as for add_candidates, except that the arguments are in
3736 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3737 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3740 add_list_candidates (tree fns
, tree first_arg
,
3741 const vec
<tree
, va_gc
> *args
, tree totype
,
3742 tree explicit_targs
, bool template_only
,
3743 tree conversion_path
, tree access_path
,
3745 struct z_candidate
**candidates
,
3746 tsubst_flags_t complain
)
3748 gcc_assert (*candidates
== NULL
);
3750 /* We're looking for a ctor for list-initialization. */
3751 flags
|= LOOKUP_LIST_INIT_CTOR
;
3752 /* And we don't allow narrowing conversions. We also use this flag to
3753 avoid the copy constructor call for copy-list-initialization. */
3754 flags
|= LOOKUP_NO_NARROWING
;
3756 unsigned nart
= num_artificial_parms_for (OVL_FIRST (fns
)) - 1;
3757 tree init_list
= (*args
)[nart
];
3759 /* Always use the default constructor if the list is empty (DR 990). */
3760 if (CONSTRUCTOR_NELTS (init_list
) == 0
3761 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3763 /* If the class has a list ctor, try passing the list as a single
3764 argument first, but only consider list ctors. */
3765 else if (TYPE_HAS_LIST_CTOR (totype
))
3767 flags
|= LOOKUP_LIST_ONLY
;
3768 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3769 explicit_targs
, template_only
, conversion_path
,
3770 access_path
, flags
, candidates
, complain
);
3771 if (any_strictly_viable (*candidates
))
3775 /* Expand the CONSTRUCTOR into a new argument vec. */
3776 vec
<tree
, va_gc
> *new_args
;
3777 vec_alloc (new_args
, nart
+ CONSTRUCTOR_NELTS (init_list
));
3778 for (unsigned i
= 0; i
< nart
; ++i
)
3779 new_args
->quick_push ((*args
)[i
]);
3780 for (unsigned i
= 0; i
< CONSTRUCTOR_NELTS (init_list
); ++i
)
3781 new_args
->quick_push (CONSTRUCTOR_ELT (init_list
, i
)->value
);
3783 /* We aren't looking for list-ctors anymore. */
3784 flags
&= ~LOOKUP_LIST_ONLY
;
3785 /* We allow more user-defined conversions within an init-list. */
3786 flags
&= ~LOOKUP_NO_CONVERSION
;
3788 add_candidates (fns
, first_arg
, new_args
, NULL_TREE
,
3789 explicit_targs
, template_only
, conversion_path
,
3790 access_path
, flags
, candidates
, complain
);
3793 /* Returns the best overload candidate to perform the requested
3794 conversion. This function is used for three the overloading situations
3795 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3796 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3797 per [dcl.init.ref], so we ignore temporary bindings. */
3799 static struct z_candidate
*
3800 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3801 tsubst_flags_t complain
)
3803 struct z_candidate
*candidates
, *cand
;
3805 tree ctors
= NULL_TREE
;
3806 tree conv_fns
= NULL_TREE
;
3807 conversion
*conv
= NULL
;
3808 tree first_arg
= NULL_TREE
;
3809 vec
<tree
, va_gc
> *args
= NULL
;
3816 fromtype
= TREE_TYPE (expr
);
3818 /* We represent conversion within a hierarchy using RVALUE_CONV and
3819 BASE_CONV, as specified by [over.best.ics]; these become plain
3820 constructor calls, as specified in [dcl.init]. */
3821 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3822 || !DERIVED_FROM_P (totype
, fromtype
));
3824 if (CLASS_TYPE_P (totype
))
3825 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3826 creating a garbage BASELINK; constructors can't be inherited. */
3827 ctors
= get_class_binding (totype
, complete_ctor_identifier
);
3829 if (MAYBE_CLASS_TYPE_P (fromtype
))
3831 tree to_nonref
= non_reference (totype
);
3832 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3833 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3834 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3836 /* [class.conv.fct] A conversion function is never used to
3837 convert a (possibly cv-qualified) object to the (possibly
3838 cv-qualified) same object type (or a reference to it), to a
3839 (possibly cv-qualified) base class of that type (or a
3840 reference to it)... */
3843 conv_fns
= lookup_conversions (fromtype
);
3847 flags
|= LOOKUP_NO_CONVERSION
;
3848 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3849 flags
|= LOOKUP_NO_NARROWING
;
3851 /* It's OK to bind a temporary for converting constructor arguments, but
3852 not in converting the return value of a conversion operator. */
3853 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
3854 | (flags
& LOOKUP_NO_NARROWING
));
3855 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3859 int ctorflags
= flags
;
3861 first_arg
= build_dummy_object (totype
);
3863 /* We should never try to call the abstract or base constructor
3865 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors
))
3866 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors
)));
3868 args
= make_tree_vector_single (expr
);
3869 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3871 /* List-initialization. */
3872 add_list_candidates (ctors
, first_arg
, args
, totype
, NULL_TREE
,
3873 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3874 ctorflags
, &candidates
, complain
);
3878 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3879 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3880 ctorflags
, &candidates
, complain
);
3883 for (cand
= candidates
; cand
; cand
= cand
->next
)
3885 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3887 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3888 set, then this is copy-initialization. In that case, "The
3889 result of the call is then used to direct-initialize the
3890 object that is the destination of the copy-initialization."
3893 We represent this in the conversion sequence with an
3894 rvalue conversion, which means a constructor call. */
3895 if (!TYPE_REF_P (totype
)
3896 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3898 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3904 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3905 first_arg
= CONSTRUCTOR_ELT (expr
, 0)->value
;
3910 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3912 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3913 struct z_candidate
*old_candidates
;
3915 /* If we are called to convert to a reference type, we are trying to
3916 find a direct binding, so don't even consider temporaries. If
3917 we don't find a direct binding, the caller will try again to
3918 look for a temporary binding. */
3919 if (TYPE_REF_P (totype
))
3920 convflags
|= LOOKUP_NO_TEMP_BIND
;
3922 old_candidates
= candidates
;
3923 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
3925 conversion_path
, TYPE_BINFO (fromtype
),
3926 flags
, &candidates
, complain
);
3928 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
3930 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
3932 = implicit_conversion (totype
,
3935 /*c_cast_p=*/false, convflags
,
3938 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3939 copy-initialization. In that case, "The result of the
3940 call is then used to direct-initialize the object that is
3941 the destination of the copy-initialization." [dcl.init]
3943 We represent this in the conversion sequence with an
3944 rvalue conversion, which means a constructor call. But
3945 don't add a second rvalue conversion if there's already
3946 one there. Which there really shouldn't be, but it's
3947 harmless since we'd add it here anyway. */
3948 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
3949 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3950 ics
= build_conv (ck_rvalue
, totype
, ics
);
3952 cand
->second_conv
= ics
;
3957 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -2,
3959 EXPR_LOCATION (expr
));
3961 else if (DECL_NONCONVERTING_P (cand
->fn
)
3962 && ics
->rank
> cr_exact
)
3964 /* 13.3.1.5: For direct-initialization, those explicit
3965 conversion functions that are not hidden within S and
3966 yield type T or a type that can be converted to type T
3967 with a qualification conversion (4.4) are also candidate
3969 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3970 I've raised this issue with the committee. --jason 9/2011 */
3972 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
3974 else if (cand
->viable
== 1 && ics
->bad_p
)
3978 = bad_arg_conversion_rejection (NULL_TREE
, -2,
3980 EXPR_LOCATION (expr
));
3982 else if (primary_template_specialization_p (cand
->fn
)
3983 && ics
->rank
> cr_exact
)
3985 /* 13.3.3.1.2: If the user-defined conversion is specified by
3986 a specialization of a conversion function template, the
3987 second standard conversion sequence shall have exact match
3990 cand
->reason
= template_conversion_rejection (rettype
, totype
);
3995 candidates
= splice_viable (candidates
, false, &any_viable_p
);
3999 release_tree_vector (args
);
4003 cand
= tourney (candidates
, complain
);
4006 if (complain
& tf_error
)
4008 auto_diagnostic_group d
;
4009 error ("conversion from %qH to %qI is ambiguous",
4011 print_z_candidates (location_of (expr
), candidates
);
4014 cand
= candidates
; /* any one will do */
4015 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
4016 cand
->second_conv
->user_conv_p
= true;
4017 if (!any_strictly_viable (candidates
))
4018 cand
->second_conv
->bad_p
= true;
4019 if (flags
& LOOKUP_ONLYCONVERTING
)
4020 cand
->second_conv
->need_temporary_p
= true;
4021 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
4022 ambiguous conversion is no worse than another user-defined
4029 if (!DECL_CONSTRUCTOR_P (cand
->fn
))
4030 convtype
= non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)));
4031 else if (cand
->second_conv
->kind
== ck_rvalue
)
4032 /* DR 5: [in the first step of copy-initialization]...if the function
4033 is a constructor, the call initializes a temporary of the
4034 cv-unqualified version of the destination type. */
4035 convtype
= cv_unqualified (totype
);
4038 /* Build the user conversion sequence. */
4042 build_identity_conv (TREE_TYPE (expr
), expr
));
4044 if (cand
->viable
== -1)
4047 /* We're performing the maybe-rvalue overload resolution and
4048 a conversion function is in play. Reject converting the return
4049 value of the conversion function to a base class. */
4050 if ((flags
& LOOKUP_PREFER_RVALUE
) && !DECL_CONSTRUCTOR_P (cand
->fn
))
4051 for (conversion
*t
= cand
->second_conv
; t
; t
= next_conversion (t
))
4052 if (t
->kind
== ck_base
)
4055 /* Remember that this was a list-initialization. */
4056 if (flags
& LOOKUP_NO_NARROWING
)
4057 conv
->check_narrowing
= true;
4059 /* Combine it with the second conversion sequence. */
4060 cand
->second_conv
= merge_conversion_sequences (conv
,
4066 /* Wrapper for above. */
4069 build_user_type_conversion (tree totype
, tree expr
, int flags
,
4070 tsubst_flags_t complain
)
4072 struct z_candidate
*cand
;
4075 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4076 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
4080 if (cand
->second_conv
->kind
== ck_ambig
)
4081 ret
= error_mark_node
;
4084 expr
= convert_like (cand
->second_conv
, expr
, complain
);
4085 ret
= convert_from_reference (expr
);
4091 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4095 /* Subroutine of convert_nontype_argument.
4097 EXPR is an expression used in a context that requires a converted
4098 constant-expression, such as a template non-type parameter. Do any
4099 necessary conversions (that are permitted for converted
4100 constant-expressions) to convert it to the desired type.
4102 If conversion is successful, returns the converted expression;
4103 otherwise, returns error_mark_node. */
4106 build_converted_constant_expr (tree type
, tree expr
, tsubst_flags_t complain
)
4111 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
4113 if (error_operand_p (expr
))
4114 return error_mark_node
;
4116 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4117 p
= conversion_obstack_alloc (0);
4119 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
4121 LOOKUP_IMPLICIT
, complain
);
4123 /* A converted constant expression of type T is an expression, implicitly
4124 converted to type T, where the converted expression is a constant
4125 expression and the implicit conversion sequence contains only
4127 * user-defined conversions,
4128 * lvalue-to-rvalue conversions (7.1),
4129 * array-to-pointer conversions (7.2),
4130 * function-to-pointer conversions (7.3),
4131 * qualification conversions (7.5),
4132 * integral promotions (7.6),
4133 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4134 * null pointer conversions (7.11) from std::nullptr_t,
4135 * null member pointer conversions (7.12) from std::nullptr_t, and
4136 * function pointer conversions (7.13),
4138 and where the reference binding (if any) binds directly. */
4140 for (conversion
*c
= conv
;
4141 conv
&& c
->kind
!= ck_identity
;
4142 c
= next_conversion (c
))
4146 /* A conversion function is OK. If it isn't constexpr, we'll
4147 complain later that the argument isn't constant. */
4149 /* The lvalue-to-rvalue conversion is OK. */
4151 /* Array-to-pointer and function-to-pointer. */
4153 /* Function pointer conversions. */
4155 /* Qualification conversions. */
4160 if (c
->need_temporary_p
)
4162 if (complain
& tf_error
)
4163 error_at (loc
, "initializing %qH with %qI in converted "
4164 "constant expression does not bind directly",
4165 type
, next_conversion (c
)->type
);
4174 t
= next_conversion (c
)->type
;
4175 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
)
4176 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
4177 /* Integral promotion or conversion. */
4179 if (NULLPTR_TYPE_P (t
))
4180 /* Conversion from nullptr to pointer or pointer-to-member. */
4183 if (complain
& tf_error
)
4184 error_at (loc
, "conversion from %qH to %qI in a "
4185 "converted constant expression", t
, type
);
4194 /* Avoid confusing convert_nontype_argument by introducing
4195 a redundant conversion to the same reference type. */
4196 if (conv
&& conv
->kind
== ck_ref_bind
4197 && REFERENCE_REF_P (expr
))
4199 tree ref
= TREE_OPERAND (expr
, 0);
4200 if (same_type_p (type
, TREE_TYPE (ref
)))
4206 conv
->check_narrowing
= true;
4207 conv
->check_narrowing_const_only
= true;
4208 expr
= convert_like (conv
, expr
, complain
);
4212 if (complain
& tf_error
)
4213 error_at (loc
, "could not convert %qE from %qH to %qI", expr
,
4214 TREE_TYPE (expr
), type
);
4215 expr
= error_mark_node
;
4218 /* Free all the conversions we allocated. */
4219 obstack_free (&conversion_obstack
, p
);
4224 /* Do any initial processing on the arguments to a function call. */
4226 static vec
<tree
, va_gc
> *
4227 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
4232 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
4234 if (error_operand_p (arg
))
4236 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
4238 if (complain
& tf_error
)
4239 error ("invalid use of void expression");
4242 else if (invalid_nonstatic_memfn_p (arg
->exp
.locus
, arg
, complain
))
4248 /* Perform overload resolution on FN, which is called with the ARGS.
4250 Return the candidate function selected by overload resolution, or
4251 NULL if the event that overload resolution failed. In the case
4252 that overload resolution fails, *CANDIDATES will be the set of
4253 candidates considered, and ANY_VIABLE_P will be set to true or
4254 false to indicate whether or not any of the candidates were
4257 The ARGS should already have gone through RESOLVE_ARGS before this
4258 function is called. */
4260 static struct z_candidate
*
4261 perform_overload_resolution (tree fn
,
4262 const vec
<tree
, va_gc
> *args
,
4263 struct z_candidate
**candidates
,
4264 bool *any_viable_p
, tsubst_flags_t complain
)
4266 struct z_candidate
*cand
;
4267 tree explicit_targs
;
4270 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4272 explicit_targs
= NULL_TREE
;
4276 *any_viable_p
= true;
4279 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4280 || TREE_CODE (fn
) == TEMPLATE_DECL
4281 || TREE_CODE (fn
) == OVERLOAD
4282 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
4284 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4286 explicit_targs
= TREE_OPERAND (fn
, 1);
4287 fn
= TREE_OPERAND (fn
, 0);
4291 /* Add the various candidate functions. */
4292 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
4293 explicit_targs
, template_only
,
4294 /*conversion_path=*/NULL_TREE
,
4295 /*access_path=*/NULL_TREE
,
4297 candidates
, complain
);
4299 *candidates
= splice_viable (*candidates
, false, any_viable_p
);
4301 cand
= tourney (*candidates
, complain
);
4305 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4309 /* Print an error message about being unable to build a call to FN with
4310 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4311 be located; CANDIDATES is a possibly empty list of such
4315 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
,
4316 struct z_candidate
*candidates
)
4318 tree targs
= NULL_TREE
;
4319 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4321 targs
= TREE_OPERAND (fn
, 1);
4322 fn
= TREE_OPERAND (fn
, 0);
4324 tree name
= OVL_NAME (fn
);
4325 location_t loc
= location_of (name
);
4327 name
= lookup_template_function (name
, targs
);
4329 auto_diagnostic_group d
;
4330 if (!any_strictly_viable (candidates
))
4331 error_at (loc
, "no matching function for call to %<%D(%A)%>",
4332 name
, build_tree_list_vec (args
));
4334 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
4335 name
, build_tree_list_vec (args
));
4337 print_z_candidates (loc
, candidates
);
4340 /* Return an expression for a call to FN (a namespace-scope function,
4341 or a static member function) with the ARGS. This may change
4345 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
,
4346 tsubst_flags_t complain
)
4348 struct z_candidate
*candidates
, *cand
;
4353 if (args
!= NULL
&& *args
!= NULL
)
4355 *args
= resolve_args (*args
, complain
);
4357 return error_mark_node
;
4361 tm_malloc_replacement (fn
);
4363 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4364 p
= conversion_obstack_alloc (0);
4366 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
4371 if (complain
& tf_error
)
4373 // If there is a single (non-viable) function candidate,
4374 // let the error be diagnosed by cp_build_function_call_vec.
4375 if (!any_viable_p
&& candidates
&& ! candidates
->next
4376 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
4377 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
4379 // Otherwise, emit notes for non-viable candidates.
4380 print_error_for_call_failure (fn
, *args
, candidates
);
4382 result
= error_mark_node
;
4386 int flags
= LOOKUP_NORMAL
;
4387 /* If fn is template_id_expr, the call has explicit template arguments
4388 (e.g. func<int>(5)), communicate this info to build_over_call
4389 through flags so that later we can use it to decide whether to warn
4390 about peculiar null pointer conversion. */
4391 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4393 /* If overload resolution selects a specialization of a
4394 function concept for non-dependent template arguments,
4395 the expression is true if the constraints are satisfied
4396 and false otherwise.
4398 NOTE: This is an extension of Concepts Lite TS that
4399 allows constraints to be used in expressions. */
4400 if (flag_concepts
&& !processing_template_decl
)
4402 tree tmpl
= DECL_TI_TEMPLATE (cand
->fn
);
4403 tree targs
= DECL_TI_ARGS (cand
->fn
);
4404 tree decl
= DECL_TEMPLATE_RESULT (tmpl
);
4405 if (DECL_DECLARED_CONCEPT_P (decl
))
4406 return evaluate_function_concept (decl
, targs
);
4409 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4412 result
= build_over_call (cand
, flags
, complain
);
4415 /* Free all the conversions we allocated. */
4416 obstack_free (&conversion_obstack
, p
);
4421 /* Build a call to a global operator new. FNNAME is the name of the
4422 operator (either "operator new" or "operator new[]") and ARGS are
4423 the arguments provided. This may change ARGS. *SIZE points to the
4424 total number of bytes required by the allocation, and is updated if
4425 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4426 be used. If this function determines that no cookie should be
4427 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4428 is not NULL_TREE, it is evaluated before calculating the final
4429 array size, and if it fails, the array size is replaced with
4430 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4431 is non-NULL, it will be set, upon return, to the allocation
4435 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4436 tree
*size
, tree
*cookie_size
,
4437 tree align_arg
, tree size_check
,
4438 tree
*fn
, tsubst_flags_t complain
)
4440 tree original_size
= *size
;
4442 struct z_candidate
*candidates
;
4443 struct z_candidate
*cand
= NULL
;
4448 /* Set to (size_t)-1 if the size check fails. */
4449 if (size_check
!= NULL_TREE
)
4451 tree errval
= TYPE_MAX_VALUE (sizetype
);
4452 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4453 errval
= throw_bad_array_new_length ();
4454 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4455 original_size
, errval
);
4457 vec_safe_insert (*args
, 0, *size
);
4458 *args
= resolve_args (*args
, complain
);
4460 return error_mark_node
;
4466 If this lookup fails to find the name, or if the allocated type
4467 is not a class type, the allocation function's name is looked
4468 up in the global scope.
4470 we disregard block-scope declarations of "operator new". */
4471 fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/false, 0, 0);
4472 fns
= lookup_arg_dependent (fnname
, fns
, *args
);
4476 vec
<tree
, va_gc
>* align_args
4477 = vec_copy_and_insert (*args
, align_arg
, 1);
4478 cand
= perform_overload_resolution (fns
, align_args
, &candidates
,
4479 &any_viable_p
, tf_none
);
4482 /* If no aligned allocation function matches, try again without the
4486 /* Figure out what function is being called. */
4488 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
4491 /* If no suitable function could be found, issue an error message
4495 if (complain
& tf_error
)
4496 print_error_for_call_failure (fns
, *args
, candidates
);
4497 return error_mark_node
;
4500 /* If a cookie is required, add some extra space. Whether
4501 or not a cookie is required cannot be determined until
4502 after we know which function was called. */
4505 bool use_cookie
= true;
4508 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4509 /* Skip the size_t parameter. */
4510 arg_types
= TREE_CHAIN (arg_types
);
4511 /* Check the remaining parameters (if any). */
4513 && TREE_CHAIN (arg_types
) == void_list_node
4514 && same_type_p (TREE_VALUE (arg_types
),
4517 /* If we need a cookie, adjust the number of bytes allocated. */
4520 /* Update the total size. */
4521 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4524 /* Set to (size_t)-1 if the size check fails. */
4525 gcc_assert (size_check
!= NULL_TREE
);
4526 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4527 *size
, TYPE_MAX_VALUE (sizetype
));
4529 /* Update the argument list to reflect the adjusted size. */
4530 (**args
)[0] = *size
;
4533 *cookie_size
= NULL_TREE
;
4536 /* Tell our caller which function we decided to call. */
4540 /* Build the CALL_EXPR. */
4541 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4544 /* Build a new call to operator(). This may change ARGS. */
4547 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4549 struct z_candidate
*candidates
= 0, *cand
;
4550 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4552 tree result
= NULL_TREE
;
4555 obj
= mark_lvalue_use (obj
);
4557 if (error_operand_p (obj
))
4558 return error_mark_node
;
4560 tree type
= TREE_TYPE (obj
);
4562 obj
= prep_operand (obj
);
4564 if (TYPE_PTRMEMFUNC_P (type
))
4566 if (complain
& tf_error
)
4567 /* It's no good looking for an overloaded operator() on a
4568 pointer-to-member-function. */
4569 error ("pointer-to-member function %qE cannot be called without "
4570 "an object; consider using %<.*%> or %<->*%>", obj
);
4571 return error_mark_node
;
4574 if (TYPE_BINFO (type
))
4576 fns
= lookup_fnfields (TYPE_BINFO (type
), call_op_identifier
, 1);
4577 if (fns
== error_mark_node
)
4578 return error_mark_node
;
4583 if (args
!= NULL
&& *args
!= NULL
)
4585 *args
= resolve_args (*args
, complain
);
4587 return error_mark_node
;
4590 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4591 p
= conversion_obstack_alloc (0);
4595 first_mem_arg
= obj
;
4597 add_candidates (BASELINK_FUNCTIONS (fns
),
4598 first_mem_arg
, *args
, NULL_TREE
,
4600 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4601 LOOKUP_NORMAL
, &candidates
, complain
);
4604 convs
= lookup_conversions (type
);
4606 for (; convs
; convs
= TREE_CHAIN (convs
))
4608 tree totype
= TREE_TYPE (convs
);
4610 if (TYPE_PTRFN_P (totype
)
4611 || TYPE_REFFN_P (totype
)
4612 || (TYPE_REF_P (totype
)
4613 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4614 for (ovl_iterator
iter (TREE_VALUE (convs
)); iter
; ++iter
)
4618 if (DECL_NONCONVERTING_P (fn
))
4621 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4622 add_template_conv_candidate
4623 (&candidates
, fn
, obj
, *args
, totype
,
4624 /*access_path=*/NULL_TREE
,
4625 /*conversion_path=*/NULL_TREE
, complain
);
4627 add_conv_candidate (&candidates
, fn
, obj
,
4628 *args
, /*conversion_path=*/NULL_TREE
,
4629 /*access_path=*/NULL_TREE
, complain
);
4633 /* Be strict here because if we choose a bad conversion candidate, the
4634 errors we get won't mention the call context. */
4635 candidates
= splice_viable (candidates
, true, &any_viable_p
);
4638 if (complain
& tf_error
)
4640 auto_diagnostic_group d
;
4641 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4642 build_tree_list_vec (*args
));
4643 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4645 result
= error_mark_node
;
4649 cand
= tourney (candidates
, complain
);
4652 if (complain
& tf_error
)
4654 auto_diagnostic_group d
;
4655 error ("call of %<(%T) (%A)%> is ambiguous",
4656 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4657 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4659 result
= error_mark_node
;
4661 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4662 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
)
4663 && DECL_OVERLOADED_OPERATOR_IS (cand
->fn
, CALL_EXPR
))
4664 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4667 if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
4668 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
,
4672 gcc_checking_assert (TYPE_P (cand
->fn
));
4673 obj
= convert_like (cand
->convs
[0], obj
, complain
);
4675 obj
= convert_from_reference (obj
);
4676 result
= cp_build_function_call_vec (obj
, args
, complain
);
4680 /* Free all the conversions we allocated. */
4681 obstack_free (&conversion_obstack
, p
);
4686 /* Wrapper for above. */
4689 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4692 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4693 ret
= build_op_call_1 (obj
, args
, complain
);
4694 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4698 /* Called by op_error to prepare format strings suitable for the error
4699 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4700 and a suffix (controlled by NTYPES). */
4703 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4707 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4708 : G_("no match for "), errmsg
, NULL
);
4711 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4712 else if (ntypes
== 2)
4713 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4715 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4721 op_error (const op_location_t
&loc
,
4722 enum tree_code code
, enum tree_code code2
,
4723 tree arg1
, tree arg2
, tree arg3
, bool match
)
4725 bool assop
= code
== MODIFY_EXPR
;
4726 const char *opname
= OVL_OP_INFO (assop
, assop
? code2
: code
)->name
;
4731 if (flag_diagnostics_show_caret
)
4732 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4734 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4736 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4737 "in %<%E ? %E : %E%>"), 3, match
),
4739 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4742 case POSTINCREMENT_EXPR
:
4743 case POSTDECREMENT_EXPR
:
4744 if (flag_diagnostics_show_caret
)
4745 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4746 opname
, TREE_TYPE (arg1
));
4748 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4750 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4754 if (flag_diagnostics_show_caret
)
4755 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4756 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4758 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4760 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4765 if (flag_diagnostics_show_caret
)
4766 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4767 opname
, TREE_TYPE (arg1
));
4769 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4770 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4775 if (flag_diagnostics_show_caret
)
4777 binary_op_rich_location
richloc (loc
, arg1
, arg2
, true);
4779 op_error_string (G_("%<operator%s%>"), 2, match
),
4780 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4783 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4785 opname
, arg1
, opname
, arg2
,
4786 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4788 if (flag_diagnostics_show_caret
)
4789 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4790 opname
, TREE_TYPE (arg1
));
4792 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4794 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4799 /* Return the implicit conversion sequence that could be used to
4800 convert E1 to E2 in [expr.cond]. */
4803 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4805 tree t1
= non_reference (TREE_TYPE (e1
));
4806 tree t2
= non_reference (TREE_TYPE (e2
));
4812 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4813 implicitly converted (clause _conv_) to the type "lvalue reference to
4814 T2", subject to the constraint that in the conversion the
4815 reference must bind directly (_dcl.init.ref_) to an lvalue.
4817 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4818 implicitly converted to the type "rvalue reference to T2", subject to
4819 the constraint that the reference must bind directly. */
4822 tree rtype
= cp_build_reference_type (t2
, !lvalue_p (e2
));
4823 conv
= implicit_conversion (rtype
,
4827 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4828 |LOOKUP_ONLYCONVERTING
,
4830 if (conv
&& !conv
->bad_p
)
4834 /* If E2 is a prvalue or if neither of the conversions above can be done
4835 and at least one of the operands has (possibly cv-qualified) class
4837 if (!CLASS_TYPE_P (t1
) && !CLASS_TYPE_P (t2
))
4842 If E1 and E2 have class type, and the underlying class types are
4843 the same or one is a base class of the other: E1 can be converted
4844 to match E2 if the class of T2 is the same type as, or a base
4845 class of, the class of T1, and the cv-qualification of T2 is the
4846 same cv-qualification as, or a greater cv-qualification than, the
4847 cv-qualification of T1. If the conversion is applied, E1 is
4848 changed to an rvalue of type T2 that still refers to the original
4849 source class object (or the appropriate subobject thereof). */
4850 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4851 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4853 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4855 conv
= build_identity_conv (t1
, e1
);
4856 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4857 TYPE_MAIN_VARIANT (t2
)))
4858 conv
= build_conv (ck_base
, t2
, conv
);
4860 conv
= build_conv (ck_rvalue
, t2
, conv
);
4869 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4870 converted to the type that expression E2 would have if E2 were
4871 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4872 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4873 LOOKUP_IMPLICIT
, complain
);
4876 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4877 arguments to the conditional expression. */
4880 build_conditional_expr_1 (const op_location_t
&loc
,
4881 tree arg1
, tree arg2
, tree arg3
,
4882 tsubst_flags_t complain
)
4886 tree result
= NULL_TREE
;
4887 tree result_type
= NULL_TREE
;
4888 bool is_glvalue
= true;
4889 struct z_candidate
*candidates
= 0;
4890 struct z_candidate
*cand
;
4892 tree orig_arg2
, orig_arg3
;
4894 /* As a G++ extension, the second argument to the conditional can be
4895 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4896 c'.) If the second operand is omitted, make sure it is
4897 calculated only once. */
4900 if (complain
& tf_error
)
4901 pedwarn (loc
, OPT_Wpedantic
,
4902 "ISO C++ forbids omitting the middle term of a ?: expression");
4904 if ((complain
& tf_warning
) && !truth_value_p (TREE_CODE (arg1
)))
4905 warn_for_omitted_condop (loc
, arg1
);
4907 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4908 if (lvalue_p (arg1
))
4909 arg2
= arg1
= cp_stabilize_reference (arg1
);
4911 arg2
= arg1
= cp_save_expr (arg1
);
4914 /* If something has already gone wrong, just pass that fact up the
4916 if (error_operand_p (arg1
)
4917 || error_operand_p (arg2
)
4918 || error_operand_p (arg3
))
4919 return error_mark_node
;
4924 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
4926 tree arg1_type
= TREE_TYPE (arg1
);
4928 /* If arg1 is another cond_expr choosing between -1 and 0,
4929 then we can use its comparison. It may help to avoid
4930 additional comparison, produce more accurate diagnostics
4931 and enables folding. */
4932 if (TREE_CODE (arg1
) == VEC_COND_EXPR
4933 && integer_minus_onep (TREE_OPERAND (arg1
, 1))
4934 && integer_zerop (TREE_OPERAND (arg1
, 2)))
4935 arg1
= TREE_OPERAND (arg1
, 0);
4937 arg1
= force_rvalue (arg1
, complain
);
4938 arg2
= force_rvalue (arg2
, complain
);
4939 arg3
= force_rvalue (arg3
, complain
);
4941 /* force_rvalue can return error_mark on valid arguments. */
4942 if (error_operand_p (arg1
)
4943 || error_operand_p (arg2
)
4944 || error_operand_p (arg3
))
4945 return error_mark_node
;
4947 arg2_type
= TREE_TYPE (arg2
);
4948 arg3_type
= TREE_TYPE (arg3
);
4950 if (!VECTOR_TYPE_P (arg2_type
)
4951 && !VECTOR_TYPE_P (arg3_type
))
4953 /* Rely on the error messages of the scalar version. */
4954 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
4955 orig_arg2
, orig_arg3
, complain
);
4956 if (scal
== error_mark_node
)
4957 return error_mark_node
;
4958 tree stype
= TREE_TYPE (scal
);
4959 tree ctype
= TREE_TYPE (arg1_type
);
4960 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
4961 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
4963 if (complain
& tf_error
)
4964 error_at (loc
, "inferred scalar type %qT is not an integer or "
4965 "floating point type of the same size as %qT", stype
,
4966 COMPARISON_CLASS_P (arg1
)
4967 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
4969 return error_mark_node
;
4972 tree vtype
= build_opaque_vector_type (stype
,
4973 TYPE_VECTOR_SUBPARTS (arg1_type
));
4974 /* We could pass complain & tf_warning to unsafe_conversion_p,
4975 but the warnings (like Wsign-conversion) have already been
4976 given by the scalar build_conditional_expr_1. We still check
4977 unsafe_conversion_p to forbid truncating long long -> float. */
4978 if (unsafe_conversion_p (loc
, stype
, arg2
, NULL_TREE
, false))
4980 if (complain
& tf_error
)
4981 error_at (loc
, "conversion of scalar %qH to vector %qI "
4982 "involves truncation", arg2_type
, vtype
);
4983 return error_mark_node
;
4985 if (unsafe_conversion_p (loc
, stype
, arg3
, NULL_TREE
, false))
4987 if (complain
& tf_error
)
4988 error_at (loc
, "conversion of scalar %qH to vector %qI "
4989 "involves truncation", arg3_type
, vtype
);
4990 return error_mark_node
;
4993 arg2
= cp_convert (stype
, arg2
, complain
);
4994 arg2
= save_expr (arg2
);
4995 arg2
= build_vector_from_val (vtype
, arg2
);
4997 arg3
= cp_convert (stype
, arg3
, complain
);
4998 arg3
= save_expr (arg3
);
4999 arg3
= build_vector_from_val (vtype
, arg3
);
5003 if (VECTOR_TYPE_P (arg2_type
) != VECTOR_TYPE_P (arg3_type
))
5005 enum stv_conv convert_flag
=
5006 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
5007 complain
& tf_error
);
5009 switch (convert_flag
)
5012 return error_mark_node
;
5015 arg2
= save_expr (arg2
);
5016 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
5017 arg2
= build_vector_from_val (arg3_type
, arg2
);
5018 arg2_type
= TREE_TYPE (arg2
);
5023 arg3
= save_expr (arg3
);
5024 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
5025 arg3
= build_vector_from_val (arg2_type
, arg3
);
5026 arg3_type
= TREE_TYPE (arg3
);
5034 if (!same_type_p (arg2_type
, arg3_type
)
5035 || maybe_ne (TYPE_VECTOR_SUBPARTS (arg1_type
),
5036 TYPE_VECTOR_SUBPARTS (arg2_type
))
5037 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
5039 if (complain
& tf_error
)
5041 "incompatible vector types in conditional expression: "
5042 "%qT, %qT and %qT", TREE_TYPE (arg1
),
5043 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
5044 return error_mark_node
;
5047 if (!COMPARISON_CLASS_P (arg1
))
5049 tree cmp_type
= build_same_sized_truth_vector_type (arg1_type
);
5050 arg1
= build2 (NE_EXPR
, cmp_type
, arg1
, build_zero_cst (arg1_type
));
5052 return build3_loc (loc
, VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
5057 The first expression is implicitly converted to bool (clause
5059 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
5061 if (error_operand_p (arg1
))
5062 return error_mark_node
;
5066 If either the second or the third operand has type (possibly
5067 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
5068 array-to-pointer (_conv.array_), and function-to-pointer
5069 (_conv.func_) standard conversions are performed on the second
5070 and third operands. */
5071 arg2_type
= unlowered_expr_type (arg2
);
5072 arg3_type
= unlowered_expr_type (arg3
);
5073 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
5075 /* 'void' won't help in resolving an overloaded expression on the
5076 other side, so require it to resolve by itself. */
5077 if (arg2_type
== unknown_type_node
)
5079 arg2
= resolve_nondeduced_context_or_error (arg2
, complain
);
5080 arg2_type
= TREE_TYPE (arg2
);
5082 if (arg3_type
== unknown_type_node
)
5084 arg3
= resolve_nondeduced_context_or_error (arg3
, complain
);
5085 arg3_type
= TREE_TYPE (arg3
);
5090 One of the following shall hold:
5092 --The second or the third operand (but not both) is a
5093 throw-expression (_except.throw_); the result is of the type
5094 and value category of the other.
5096 --Both the second and the third operands have type void; the
5097 result is of type void and is a prvalue. */
5098 if (TREE_CODE (arg2
) == THROW_EXPR
5099 && TREE_CODE (arg3
) != THROW_EXPR
)
5101 result_type
= arg3_type
;
5102 is_glvalue
= glvalue_p (arg3
);
5104 else if (TREE_CODE (arg2
) != THROW_EXPR
5105 && TREE_CODE (arg3
) == THROW_EXPR
)
5107 result_type
= arg2_type
;
5108 is_glvalue
= glvalue_p (arg2
);
5110 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
5112 result_type
= void_type_node
;
5117 if (complain
& tf_error
)
5119 if (VOID_TYPE_P (arg2_type
))
5120 error_at (cp_expr_loc_or_loc (arg3
, loc
),
5121 "second operand to the conditional operator "
5122 "is of type %<void%>, but the third operand is "
5123 "neither a throw-expression nor of type %<void%>");
5125 error_at (cp_expr_loc_or_loc (arg2
, loc
),
5126 "third operand to the conditional operator "
5127 "is of type %<void%>, but the second operand is "
5128 "neither a throw-expression nor of type %<void%>");
5130 return error_mark_node
;
5133 goto valid_operands
;
5137 Otherwise, if the second and third operand have different types,
5138 and either has (possibly cv-qualified) class type, or if both are
5139 glvalues of the same value category and the same type except for
5140 cv-qualification, an attempt is made to convert each of those operands
5141 to the type of the other. */
5142 else if (!same_type_p (arg2_type
, arg3_type
)
5143 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)
5144 || (same_type_ignoring_top_level_qualifiers_p (arg2_type
,
5146 && glvalue_p (arg2
) && glvalue_p (arg3
)
5147 && lvalue_p (arg2
) == lvalue_p (arg3
))))
5151 bool converted
= false;
5153 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5154 p
= conversion_obstack_alloc (0);
5156 conv2
= conditional_conversion (arg2
, arg3
, complain
);
5157 conv3
= conditional_conversion (arg3
, arg2
, complain
);
5161 If both can be converted, or one can be converted but the
5162 conversion is ambiguous, the program is ill-formed. If
5163 neither can be converted, the operands are left unchanged and
5164 further checking is performed as described below. If exactly
5165 one conversion is possible, that conversion is applied to the
5166 chosen operand and the converted operand is used in place of
5167 the original operand for the remainder of this section. */
5168 if ((conv2
&& !conv2
->bad_p
5169 && conv3
&& !conv3
->bad_p
)
5170 || (conv2
&& conv2
->kind
== ck_ambig
)
5171 || (conv3
&& conv3
->kind
== ck_ambig
))
5173 if (complain
& tf_error
)
5175 error_at (loc
, "operands to ?: have different types %qT and %qT",
5176 arg2_type
, arg3_type
);
5177 if (conv2
&& !conv2
->bad_p
&& conv3
&& !conv3
->bad_p
)
5178 inform (loc
, " and each type can be converted to the other");
5179 else if (conv2
&& conv2
->kind
== ck_ambig
)
5180 convert_like (conv2
, arg2
, complain
);
5182 convert_like (conv3
, arg3
, complain
);
5184 result
= error_mark_node
;
5186 else if (conv2
&& !conv2
->bad_p
)
5188 arg2
= convert_like (conv2
, arg2
, complain
);
5189 arg2
= convert_from_reference (arg2
);
5190 arg2_type
= TREE_TYPE (arg2
);
5191 /* Even if CONV2 is a valid conversion, the result of the
5192 conversion may be invalid. For example, if ARG3 has type
5193 "volatile X", and X does not have a copy constructor
5194 accepting a "volatile X&", then even if ARG2 can be
5195 converted to X, the conversion will fail. */
5196 if (error_operand_p (arg2
))
5197 result
= error_mark_node
;
5200 else if (conv3
&& !conv3
->bad_p
)
5202 arg3
= convert_like (conv3
, arg3
, complain
);
5203 arg3
= convert_from_reference (arg3
);
5204 arg3_type
= TREE_TYPE (arg3
);
5205 if (error_operand_p (arg3
))
5206 result
= error_mark_node
;
5210 /* Free all the conversions we allocated. */
5211 obstack_free (&conversion_obstack
, p
);
5216 /* If, after the conversion, both operands have class type,
5217 treat the cv-qualification of both operands as if it were the
5218 union of the cv-qualification of the operands.
5220 The standard is not clear about what to do in this
5221 circumstance. For example, if the first operand has type
5222 "const X" and the second operand has a user-defined
5223 conversion to "volatile X", what is the type of the second
5224 operand after this step? Making it be "const X" (matching
5225 the first operand) seems wrong, as that discards the
5226 qualification without actually performing a copy. Leaving it
5227 as "volatile X" seems wrong as that will result in the
5228 conditional expression failing altogether, even though,
5229 according to this step, the one operand could be converted to
5230 the type of the other. */
5232 && CLASS_TYPE_P (arg2_type
)
5233 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
5234 arg2_type
= arg3_type
=
5235 cp_build_qualified_type (arg2_type
,
5236 cp_type_quals (arg2_type
)
5237 | cp_type_quals (arg3_type
));
5242 If the second and third operands are glvalues of the same value
5243 category and have the same type, the result is of that type and
5245 if (((lvalue_p (arg2
) && lvalue_p (arg3
))
5246 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
5247 && same_type_p (arg2_type
, arg3_type
))
5249 result_type
= arg2_type
;
5250 arg2
= mark_lvalue_use (arg2
);
5251 arg3
= mark_lvalue_use (arg3
);
5252 goto valid_operands
;
5257 Otherwise, the result is an rvalue. If the second and third
5258 operand do not have the same type, and either has (possibly
5259 cv-qualified) class type, overload resolution is used to
5260 determine the conversions (if any) to be applied to the operands
5261 (_over.match.oper_, _over.built_). */
5263 if (!same_type_p (arg2_type
, arg3_type
)
5264 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
5270 /* Rearrange the arguments so that add_builtin_candidate only has
5271 to know about two args. In build_builtin_candidate, the
5272 arguments are unscrambled. */
5276 add_builtin_candidates (&candidates
,
5279 ovl_op_identifier (false, COND_EXPR
),
5281 LOOKUP_NORMAL
, complain
);
5285 If the overload resolution fails, the program is
5287 candidates
= splice_viable (candidates
, false, &any_viable_p
);
5290 if (complain
& tf_error
)
5291 error_at (loc
, "operands to ?: have different types %qT and %qT",
5292 arg2_type
, arg3_type
);
5293 return error_mark_node
;
5295 cand
= tourney (candidates
, complain
);
5298 if (complain
& tf_error
)
5300 auto_diagnostic_group d
;
5301 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
5302 print_z_candidates (loc
, candidates
);
5304 return error_mark_node
;
5309 Otherwise, the conversions thus determined are applied, and
5310 the converted operands are used in place of the original
5311 operands for the remainder of this section. */
5312 conv
= cand
->convs
[0];
5313 arg1
= convert_like (conv
, arg1
, complain
);
5314 conv
= cand
->convs
[1];
5315 arg2
= convert_like (conv
, arg2
, complain
);
5316 arg2_type
= TREE_TYPE (arg2
);
5317 conv
= cand
->convs
[2];
5318 arg3
= convert_like (conv
, arg3
, complain
);
5319 arg3_type
= TREE_TYPE (arg3
);
5324 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5325 and function-to-pointer (_conv.func_) standard conversions are
5326 performed on the second and third operands.
5328 We need to force the lvalue-to-rvalue conversion here for class types,
5329 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5330 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5333 arg2
= force_rvalue (arg2
, complain
);
5334 if (!CLASS_TYPE_P (arg2_type
))
5335 arg2_type
= TREE_TYPE (arg2
);
5337 arg3
= force_rvalue (arg3
, complain
);
5338 if (!CLASS_TYPE_P (arg3_type
))
5339 arg3_type
= TREE_TYPE (arg3
);
5341 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5342 return error_mark_node
;
5346 After those conversions, one of the following shall hold:
5348 --The second and third operands have the same type; the result is of
5350 if (same_type_p (arg2_type
, arg3_type
))
5351 result_type
= arg2_type
;
5354 --The second and third operands have arithmetic or enumeration
5355 type; the usual arithmetic conversions are performed to bring
5356 them to a common type, and the result is of that type. */
5357 else if ((ARITHMETIC_TYPE_P (arg2_type
)
5358 || UNSCOPED_ENUM_P (arg2_type
))
5359 && (ARITHMETIC_TYPE_P (arg3_type
)
5360 || UNSCOPED_ENUM_P (arg3_type
)))
5362 /* In this case, there is always a common type. */
5363 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
5365 if (complain
& tf_warning
)
5366 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
5367 "implicit conversion from %qH to %qI to "
5368 "match other result of conditional",
5371 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5372 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
5374 tree stripped_orig_arg2
= tree_strip_any_location_wrapper (orig_arg2
);
5375 tree stripped_orig_arg3
= tree_strip_any_location_wrapper (orig_arg3
);
5376 if (TREE_CODE (stripped_orig_arg2
) == CONST_DECL
5377 && TREE_CODE (stripped_orig_arg3
) == CONST_DECL
5378 && (DECL_CONTEXT (stripped_orig_arg2
)
5379 == DECL_CONTEXT (stripped_orig_arg3
)))
5380 /* Two enumerators from the same enumeration can have different
5381 types when the enumeration is still being defined. */;
5382 else if (complain
& tf_warning
)
5383 warning_at (loc
, OPT_Wenum_compare
, "enumeral mismatch in "
5384 "conditional expression: %qT vs %qT",
5385 arg2_type
, arg3_type
);
5387 else if (extra_warnings
5388 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5389 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
5390 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
5391 && !same_type_p (arg2_type
,
5392 type_promotes_to (arg3_type
)))))
5394 if (complain
& tf_warning
)
5395 warning_at (loc
, OPT_Wextra
, "enumeral and non-enumeral type in "
5396 "conditional expression");
5399 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5400 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5404 --The second and third operands have pointer type, or one has
5405 pointer type and the other is a null pointer constant; pointer
5406 conversions (_conv.ptr_) and qualification conversions
5407 (_conv.qual_) are performed to bring them to their composite
5408 pointer type (_expr.rel_). The result is of the composite
5411 --The second and third operands have pointer to member type, or
5412 one has pointer to member type and the other is a null pointer
5413 constant; pointer to member conversions (_conv.mem_) and
5414 qualification conversions (_conv.qual_) are performed to bring
5415 them to a common type, whose cv-qualification shall match the
5416 cv-qualification of either the second or the third operand.
5417 The result is of the common type. */
5418 else if ((null_ptr_cst_p (arg2
)
5419 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
5420 || (null_ptr_cst_p (arg3
)
5421 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
5422 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
5423 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
5424 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
5426 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
5427 arg3
, CPO_CONDITIONAL_EXPR
,
5429 if (result_type
== error_mark_node
)
5430 return error_mark_node
;
5431 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5432 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5437 if (complain
& tf_error
)
5438 error_at (loc
, "operands to ?: have different types %qT and %qT",
5439 arg2_type
, arg3_type
);
5440 return error_mark_node
;
5443 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5444 return error_mark_node
;
5447 if (processing_template_decl
&& is_glvalue
)
5449 /* Let lvalue_kind know this was a glvalue. */
5450 tree arg
= (result_type
== arg2_type
? arg2
: arg3
);
5451 result_type
= cp_build_reference_type (result_type
, xvalue_p (arg
));
5454 result
= build3_loc (loc
, COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
5456 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5457 warn here, because the COND_EXPR will be turned into ARG2. */
5458 if (warn_duplicated_branches
5459 && (complain
& tf_warning
)
5460 && (arg2
== arg3
|| operand_equal_p (arg2
, arg3
, 0)))
5461 warning_at (EXPR_LOCATION (result
), OPT_Wduplicated_branches
,
5462 "this condition has identical branches");
5464 /* We can't use result_type below, as fold might have returned a
5469 /* Expand both sides into the same slot, hopefully the target of
5470 the ?: expression. We used to check for TARGET_EXPRs here,
5471 but now we sometimes wrap them in NOP_EXPRs so the test would
5473 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5474 result
= get_target_expr_sfinae (result
, complain
);
5475 /* If this expression is an rvalue, but might be mistaken for an
5476 lvalue, we must add a NON_LVALUE_EXPR. */
5477 result
= rvalue (result
);
5480 result
= force_paren_expr (result
);
5485 /* Wrapper for above. */
5488 build_conditional_expr (const op_location_t
&loc
,
5489 tree arg1
, tree arg2
, tree arg3
,
5490 tsubst_flags_t complain
)
5493 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5494 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5495 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5499 /* OPERAND is an operand to an expression. Perform necessary steps
5500 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5504 prep_operand (tree operand
)
5508 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5509 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5510 /* Make sure the template type is instantiated now. */
5511 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5517 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5518 OVERLOAD) to the CANDIDATES, returning an updated list of
5519 CANDIDATES. The ARGS are the arguments provided to the call;
5520 if FIRST_ARG is non-null it is the implicit object argument,
5521 otherwise the first element of ARGS is used if needed. The
5522 EXPLICIT_TARGS are explicit template arguments provided.
5523 TEMPLATE_ONLY is true if only template functions should be
5524 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5525 add_function_candidate. */
5528 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5530 tree explicit_targs
, bool template_only
,
5531 tree conversion_path
, tree access_path
,
5533 struct z_candidate
**candidates
,
5534 tsubst_flags_t complain
)
5537 const vec
<tree
, va_gc
> *non_static_args
;
5538 bool check_list_ctor
= false;
5539 bool check_converting
= false;
5540 unification_kind_t strict
;
5545 /* Precalculate special handling of constructors and conversion ops. */
5546 tree fn
= OVL_FIRST (fns
);
5547 if (DECL_CONV_FN_P (fn
))
5549 check_list_ctor
= false;
5550 check_converting
= (flags
& LOOKUP_ONLYCONVERTING
) != 0;
5551 if (flags
& LOOKUP_NO_CONVERSION
)
5552 /* We're doing return_type(x). */
5553 strict
= DEDUCE_CONV
;
5555 /* We're doing x.operator return_type(). */
5556 strict
= DEDUCE_EXACT
;
5557 /* [over.match.funcs] For conversion functions, the function
5558 is considered to be a member of the class of the implicit
5559 object argument for the purpose of defining the type of
5560 the implicit object parameter. */
5561 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5565 if (DECL_CONSTRUCTOR_P (fn
))
5567 check_list_ctor
= (flags
& LOOKUP_LIST_ONLY
) != 0;
5568 /* For list-initialization we consider explicit constructors
5569 and complain if one is chosen. */
5571 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5572 == LOOKUP_ONLYCONVERTING
);
5574 strict
= DEDUCE_CALL
;
5575 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5579 non_static_args
= args
;
5581 /* Delay creating the implicit this parameter until it is needed. */
5582 non_static_args
= NULL
;
5584 for (lkp_iterator
iter (fns
); iter
; ++iter
)
5588 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5590 if (check_list_ctor
&& !is_list_ctor (fn
))
5593 tree fn_first_arg
= NULL_TREE
;
5594 const vec
<tree
, va_gc
> *fn_args
= args
;
5596 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5598 /* Figure out where the object arg comes from. If this
5599 function is a non-static member and we didn't get an
5600 implicit object argument, move it out of args. */
5601 if (first_arg
== NULL_TREE
)
5605 vec
<tree
, va_gc
> *tempvec
;
5606 vec_alloc (tempvec
, args
->length () - 1);
5607 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5608 tempvec
->quick_push (arg
);
5609 non_static_args
= tempvec
;
5610 first_arg
= (*args
)[0];
5613 fn_first_arg
= first_arg
;
5614 fn_args
= non_static_args
;
5617 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5618 add_template_candidate (candidates
,
5630 else if (!template_only
)
5631 add_function_candidate (candidates
,
5644 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5645 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5648 op_is_ordered (tree_code code
)
5654 return (flag_strong_eval_order
> 1 ? -1 : 0);
5658 return (flag_strong_eval_order
> 1 ? 1 : 0);
5661 // Not overloadable (yet).
5663 // Only one argument.
5670 return (flag_strong_eval_order
? 1 : 0);
5678 build_new_op_1 (const op_location_t
&loc
, enum tree_code code
, int flags
,
5679 tree arg1
, tree arg2
, tree arg3
, tree
*overload
,
5680 tsubst_flags_t complain
)
5682 struct z_candidate
*candidates
= 0, *cand
;
5683 vec
<tree
, va_gc
> *arglist
;
5685 tree result
= NULL_TREE
;
5686 bool result_valid_p
= false;
5687 enum tree_code code2
= NOP_EXPR
;
5688 enum tree_code code_orig_arg1
= ERROR_MARK
;
5689 enum tree_code code_orig_arg2
= ERROR_MARK
;
5695 if (error_operand_p (arg1
)
5696 || error_operand_p (arg2
)
5697 || error_operand_p (arg3
))
5698 return error_mark_node
;
5700 bool ismodop
= code
== MODIFY_EXPR
;
5703 code2
= TREE_CODE (arg3
);
5706 tree fnname
= ovl_op_identifier (ismodop
, ismodop
? code2
: code
);
5708 arg1
= prep_operand (arg1
);
5710 bool memonly
= false;
5715 case VEC_DELETE_EXPR
:
5717 /* Use build_op_new_call and build_op_delete_call instead. */
5721 /* Use build_op_call instead. */
5724 case TRUTH_ORIF_EXPR
:
5725 case TRUTH_ANDIF_EXPR
:
5726 case TRUTH_AND_EXPR
:
5728 /* These are saved for the sake of warn_logical_operator. */
5729 code_orig_arg1
= TREE_CODE (arg1
);
5730 code_orig_arg2
= TREE_CODE (arg2
);
5738 /* These are saved for the sake of maybe_warn_bool_compare. */
5739 code_orig_arg1
= TREE_CODE (TREE_TYPE (arg1
));
5740 code_orig_arg2
= TREE_CODE (TREE_TYPE (arg2
));
5743 /* =, ->, [], () must be non-static member functions. */
5745 if (code2
!= NOP_EXPR
)
5757 arg2
= prep_operand (arg2
);
5758 arg3
= prep_operand (arg3
);
5760 if (code
== COND_EXPR
)
5761 /* Use build_conditional_expr instead. */
5763 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5764 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5767 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5768 arg2
= integer_zero_node
;
5770 vec_alloc (arglist
, 3);
5771 arglist
->quick_push (arg1
);
5772 if (arg2
!= NULL_TREE
)
5773 arglist
->quick_push (arg2
);
5774 if (arg3
!= NULL_TREE
)
5775 arglist
->quick_push (arg3
);
5777 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5778 p
= conversion_obstack_alloc (0);
5780 /* Add namespace-scope operators to the list of functions to
5784 tree fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/true, 0, 0);
5785 fns
= lookup_arg_dependent (fnname
, fns
, arglist
);
5786 add_candidates (fns
, NULL_TREE
, arglist
, NULL_TREE
,
5787 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5788 flags
, &candidates
, complain
);
5793 args
[2] = NULL_TREE
;
5795 /* Add class-member operators to the candidate set. */
5796 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5800 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5801 if (fns
== error_mark_node
)
5803 result
= error_mark_node
;
5804 goto user_defined_result_ready
;
5807 add_candidates (BASELINK_FUNCTIONS (fns
),
5808 NULL_TREE
, arglist
, NULL_TREE
,
5810 BASELINK_BINFO (fns
),
5811 BASELINK_ACCESS_BINFO (fns
),
5812 flags
, &candidates
, complain
);
5814 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5815 only non-member functions that have type T1 or reference to
5816 cv-qualified-opt T1 for the first argument, if the first argument
5817 has an enumeration type, or T2 or reference to cv-qualified-opt
5818 T2 for the second argument, if the second argument has an
5819 enumeration type. Filter out those that don't match. */
5820 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5822 struct z_candidate
**candp
, **next
;
5824 for (candp
= &candidates
; *candp
; candp
= next
)
5826 tree parmlist
, parmtype
;
5827 int i
, nargs
= (arg2
? 2 : 1);
5832 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5834 for (i
= 0; i
< nargs
; ++i
)
5836 parmtype
= TREE_VALUE (parmlist
);
5838 if (TYPE_REF_P (parmtype
))
5839 parmtype
= TREE_TYPE (parmtype
);
5840 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5841 && (same_type_ignoring_top_level_qualifiers_p
5842 (TREE_TYPE (args
[i
]), parmtype
)))
5845 parmlist
= TREE_CHAIN (parmlist
);
5848 /* No argument has an appropriate type, so remove this
5849 candidate function from the list. */
5852 *candp
= cand
->next
;
5858 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5865 /* For these, the built-in candidates set is empty
5866 [over.match.oper]/3. We don't want non-strict matches
5867 because exact matches are always possible with built-in
5868 operators. The built-in candidate set for COMPONENT_REF
5869 would be empty too, but since there are no such built-in
5870 operators, we accept non-strict matches for them. */
5879 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5884 case POSTINCREMENT_EXPR
:
5885 case POSTDECREMENT_EXPR
:
5886 /* Don't try anything fancy if we're not allowed to produce
5888 if (!(complain
& tf_error
))
5889 return error_mark_node
;
5891 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5892 distinguish between prefix and postfix ++ and
5893 operator++() was used for both, so we allow this with
5897 const char *msg
= (flag_permissive
)
5898 ? G_("no %<%D(int)%> declared for postfix %qs,"
5899 " trying prefix operator instead")
5900 : G_("no %<%D(int)%> declared for postfix %qs");
5901 permerror (loc
, msg
, fnname
, OVL_OP_INFO (false, code
)->name
);
5904 if (!flag_permissive
)
5905 return error_mark_node
;
5907 if (code
== POSTINCREMENT_EXPR
)
5908 code
= PREINCREMENT_EXPR
;
5910 code
= PREDECREMENT_EXPR
;
5911 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5912 NULL_TREE
, overload
, complain
);
5915 /* The caller will deal with these. */
5920 result_valid_p
= true;
5924 if (complain
& tf_error
)
5926 /* If one of the arguments of the operator represents
5927 an invalid use of member function pointer, try to report
5928 a meaningful error ... */
5929 if (invalid_nonstatic_memfn_p (loc
, arg1
, tf_error
)
5930 || invalid_nonstatic_memfn_p (loc
, arg2
, tf_error
)
5931 || invalid_nonstatic_memfn_p (loc
, arg3
, tf_error
))
5932 /* We displayed the error message. */;
5935 /* ... Otherwise, report the more generic
5936 "no matching operator found" error */
5937 auto_diagnostic_group d
;
5938 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
5939 print_z_candidates (loc
, candidates
);
5942 result
= error_mark_node
;
5948 cand
= tourney (candidates
, complain
);
5951 if (complain
& tf_error
)
5953 auto_diagnostic_group d
;
5954 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
5955 print_z_candidates (loc
, candidates
);
5957 result
= error_mark_node
;
5959 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
5962 *overload
= cand
->fn
;
5964 if (resolve_args (arglist
, complain
) == NULL
)
5965 result
= error_mark_node
;
5967 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5969 if (trivial_fn_p (cand
->fn
))
5970 /* There won't be a CALL_EXPR. */;
5971 else if (result
&& result
!= error_mark_node
)
5973 tree call
= extract_call_expr (result
);
5974 CALL_EXPR_OPERATOR_SYNTAX (call
) = true;
5976 if (processing_template_decl
&& DECL_HIDDEN_FRIEND_P (cand
->fn
))
5977 /* This prevents build_new_function_call from discarding this
5978 function during instantiation of the enclosing template. */
5979 KOENIG_LOOKUP_P (call
) = 1;
5981 /* Specify evaluation order as per P0145R2. */
5982 CALL_EXPR_ORDERED_ARGS (call
) = false;
5983 switch (op_is_ordered (code
))
5986 CALL_EXPR_REVERSE_ARGS (call
) = true;
5990 CALL_EXPR_ORDERED_ARGS (call
) = true;
6000 /* Give any warnings we noticed during overload resolution. */
6001 if (cand
->warnings
&& (complain
& tf_warning
))
6003 struct candidate_warning
*w
;
6004 for (w
= cand
->warnings
; w
; w
= w
->next
)
6005 joust (cand
, w
->loser
, 1, complain
);
6008 /* Check for comparison of different enum types. */
6017 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
6018 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
6019 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
6020 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
6021 && (complain
& tf_warning
))
6023 warning (OPT_Wenum_compare
,
6024 "comparison between %q#T and %q#T",
6025 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
6032 /* We need to strip any leading REF_BIND so that bitfields
6033 don't cause errors. This should not remove any important
6034 conversions, because builtins don't apply to class
6035 objects directly. */
6036 conv
= cand
->convs
[0];
6037 if (conv
->kind
== ck_ref_bind
)
6038 conv
= next_conversion (conv
);
6039 arg1
= convert_like (conv
, arg1
, complain
);
6043 conv
= cand
->convs
[1];
6044 if (conv
->kind
== ck_ref_bind
)
6045 conv
= next_conversion (conv
);
6047 arg2
= decay_conversion (arg2
, complain
);
6049 /* We need to call warn_logical_operator before
6050 converting arg2 to a boolean_type, but after
6051 decaying an enumerator to its value. */
6052 if (complain
& tf_warning
)
6053 warn_logical_operator (loc
, code
, boolean_type_node
,
6054 code_orig_arg1
, arg1
,
6055 code_orig_arg2
, arg2
);
6057 arg2
= convert_like (conv
, arg2
, complain
);
6061 conv
= cand
->convs
[2];
6062 if (conv
->kind
== ck_ref_bind
)
6063 conv
= next_conversion (conv
);
6064 arg3
= convert_like (conv
, arg3
, complain
);
6070 user_defined_result_ready
:
6072 /* Free all the conversions we allocated. */
6073 obstack_free (&conversion_obstack
, p
);
6075 if (result
|| result_valid_p
)
6082 return cp_build_modify_expr (loc
, arg1
, code2
, arg2
, complain
);
6085 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
6087 case TRUTH_ANDIF_EXPR
:
6088 case TRUTH_ORIF_EXPR
:
6089 case TRUTH_AND_EXPR
:
6091 if (complain
& tf_warning
)
6092 warn_logical_operator (loc
, code
, boolean_type_node
,
6093 code_orig_arg1
, arg1
,
6094 code_orig_arg2
, arg2
);
6102 if ((complain
& tf_warning
)
6103 && ((code_orig_arg1
== BOOLEAN_TYPE
)
6104 ^ (code_orig_arg2
== BOOLEAN_TYPE
)))
6105 maybe_warn_bool_compare (loc
, code
, arg1
, arg2
);
6106 if (complain
& tf_warning
&& warn_tautological_compare
)
6107 warn_tautological_cmp (loc
, code
, arg1
, arg2
);
6112 case TRUNC_DIV_EXPR
:
6117 case TRUNC_MOD_EXPR
:
6121 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
6123 case UNARY_PLUS_EXPR
:
6126 case TRUTH_NOT_EXPR
:
6127 case PREINCREMENT_EXPR
:
6128 case POSTINCREMENT_EXPR
:
6129 case PREDECREMENT_EXPR
:
6130 case POSTDECREMENT_EXPR
:
6134 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
6137 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
6140 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
6144 /* The caller will deal with these. */
6156 /* Wrapper for above. */
6159 build_new_op (const op_location_t
&loc
, enum tree_code code
, int flags
,
6160 tree arg1
, tree arg2
, tree arg3
,
6161 tree
*overload
, tsubst_flags_t complain
)
6164 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
6165 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
6166 overload
, complain
);
6167 timevar_cond_stop (TV_OVERLOAD
, subtime
);
6171 /* CALL was returned by some call-building function; extract the actual
6172 CALL_EXPR from any bits that have been tacked on, e.g. by
6173 convert_from_reference. */
6176 extract_call_expr (tree call
)
6178 while (TREE_CODE (call
) == COMPOUND_EXPR
)
6179 call
= TREE_OPERAND (call
, 1);
6180 if (REFERENCE_REF_P (call
))
6181 call
= TREE_OPERAND (call
, 0);
6182 if (TREE_CODE (call
) == TARGET_EXPR
)
6183 call
= TARGET_EXPR_INITIAL (call
);
6184 gcc_assert (TREE_CODE (call
) == CALL_EXPR
6185 || TREE_CODE (call
) == AGGR_INIT_EXPR
6186 || call
== error_mark_node
);
6190 /* Returns true if FN has two parameters, of which the second has type
6194 second_parm_is_size_t (tree fn
)
6196 tree t
= FUNCTION_ARG_CHAIN (fn
);
6197 if (!t
|| !same_type_p (TREE_VALUE (t
), size_type_node
))
6200 if (t
== void_list_node
)
6202 if (aligned_new_threshold
&& t
6203 && same_type_p (TREE_VALUE (t
), align_type_node
)
6204 && TREE_CHAIN (t
) == void_list_node
)
6209 /* True if T, an allocation function, has std::align_val_t as its second
6213 aligned_allocation_fn_p (tree t
)
6215 if (!aligned_new_threshold
)
6218 tree a
= FUNCTION_ARG_CHAIN (t
);
6219 return (a
&& same_type_p (TREE_VALUE (a
), align_type_node
));
6222 /* True if T is std::destroying_delete_t. */
6225 std_destroying_delete_t_p (tree t
)
6227 return (TYPE_CONTEXT (t
) == std_node
6228 && id_equal (TYPE_IDENTIFIER (t
), "destroying_delete_t"));
6231 /* A deallocation function with at least two parameters whose second parameter
6232 type is of type std::destroying_delete_t is a destroying operator delete. A
6233 destroying operator delete shall be a class member function named operator
6234 delete. [ Note: Array deletion cannot use a destroying operator
6235 delete. --end note ] */
6238 destroying_delete_p (tree t
)
6240 tree a
= TYPE_ARG_TYPES (TREE_TYPE (t
));
6241 if (!a
|| !TREE_CHAIN (a
))
6243 tree type
= TREE_VALUE (TREE_CHAIN (a
));
6244 return std_destroying_delete_t_p (type
) ? type
: NULL_TREE
;
6247 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6248 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6249 std::align_val_t. */
6252 aligned_deallocation_fn_p (tree t
)
6254 if (!aligned_new_threshold
)
6257 /* A template instance is never a usual deallocation function,
6258 regardless of its signature. */
6259 if (TREE_CODE (t
) == TEMPLATE_DECL
6260 || primary_template_specialization_p (t
))
6263 tree a
= FUNCTION_ARG_CHAIN (t
);
6264 if (destroying_delete_p (t
))
6266 if (same_type_p (TREE_VALUE (a
), align_type_node
)
6267 && TREE_CHAIN (a
) == void_list_node
)
6269 if (!same_type_p (TREE_VALUE (a
), size_type_node
))
6272 if (a
&& same_type_p (TREE_VALUE (a
), align_type_node
)
6273 && TREE_CHAIN (a
) == void_list_node
)
6278 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6279 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6282 usual_deallocation_fn_p (tree t
)
6284 /* A template instance is never a usual deallocation function,
6285 regardless of its signature. */
6286 if (TREE_CODE (t
) == TEMPLATE_DECL
6287 || primary_template_specialization_p (t
))
6290 /* If a class T has a member deallocation function named operator delete
6291 with exactly one parameter, then that function is a usual
6292 (non-placement) deallocation function. If class T does not declare
6293 such an operator delete but does declare a member deallocation
6294 function named operator delete with exactly two parameters, the second
6295 of which has type std::size_t (18.2), then this function is a usual
6296 deallocation function. */
6297 bool global
= DECL_NAMESPACE_SCOPE_P (t
);
6298 tree chain
= FUNCTION_ARG_CHAIN (t
);
6301 if (destroying_delete_p (t
))
6302 chain
= TREE_CHAIN (chain
);
6303 if (chain
== void_list_node
6304 || ((!global
|| flag_sized_deallocation
)
6305 && second_parm_is_size_t (t
)))
6307 if (aligned_deallocation_fn_p (t
))
6312 /* Build a call to operator delete. This has to be handled very specially,
6313 because the restrictions on what signatures match are different from all
6314 other call instances. For a normal delete, only a delete taking (void *)
6315 or (void *, size_t) is accepted. For a placement delete, only an exact
6316 match with the placement new is accepted.
6318 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6319 ADDR is the pointer to be deleted.
6320 SIZE is the size of the memory block to be deleted.
6321 GLOBAL_P is true if the delete-expression should not consider
6322 class-specific delete operators.
6323 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6325 If this call to "operator delete" is being generated as part to
6326 deallocate memory allocated via a new-expression (as per [expr.new]
6327 which requires that if the initialization throws an exception then
6328 we call a deallocation function), then ALLOC_FN is the allocation
6332 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
6333 bool global_p
, tree placement
,
6334 tree alloc_fn
, tsubst_flags_t complain
)
6336 tree fn
= NULL_TREE
;
6337 tree fns
, fnname
, type
, t
;
6339 if (addr
== error_mark_node
)
6340 return error_mark_node
;
6342 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
6344 fnname
= ovl_op_identifier (false, code
);
6346 if (CLASS_TYPE_P (type
)
6347 && COMPLETE_TYPE_P (complete_type (type
))
6351 If the result of the lookup is ambiguous or inaccessible, or if
6352 the lookup selects a placement deallocation function, the
6353 program is ill-formed.
6355 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6357 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
6358 if (fns
== error_mark_node
)
6359 return error_mark_node
;
6364 if (fns
== NULL_TREE
)
6365 fns
= lookup_name_nonclass (fnname
);
6367 /* Strip const and volatile from addr. */
6369 addr
= cp_convert (ptr_type_node
, addr
, complain
);
6373 /* "A declaration of a placement deallocation function matches the
6374 declaration of a placement allocation function if it has the same
6375 number of parameters and, after parameter transformations (8.3.5),
6376 all parameter types except the first are identical."
6378 So we build up the function type we want and ask instantiate_type
6379 to get it for us. */
6380 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
6381 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
6382 t
= build_function_type (void_type_node
, t
);
6384 fn
= instantiate_type (t
, fns
, tf_none
);
6385 if (fn
== error_mark_node
)
6388 fn
= MAYBE_BASELINK_FUNCTIONS (fn
);
6390 /* "If the lookup finds the two-parameter form of a usual deallocation
6391 function (3.7.4.2) and that function, considered as a placement
6392 deallocation function, would have been selected as a match for the
6393 allocation function, the program is ill-formed." */
6394 if (second_parm_is_size_t (fn
))
6396 const char *const msg1
6397 = G_("exception cleanup for this placement new selects "
6398 "non-placement operator delete");
6399 const char *const msg2
6400 = G_("%qD is a usual (non-placement) deallocation "
6401 "function in C++14 (or with -fsized-deallocation)");
6403 /* But if the class has an operator delete (void *), then that is
6404 the usual deallocation function, so we shouldn't complain
6405 about using the operator delete (void *, size_t). */
6406 if (DECL_CLASS_SCOPE_P (fn
))
6407 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
));
6411 if (usual_deallocation_fn_p (elt
)
6412 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
6415 /* Before C++14 a two-parameter global deallocation function is
6416 always a placement deallocation function, but warn if
6418 else if (!flag_sized_deallocation
)
6420 if (complain
& tf_warning
)
6422 auto_diagnostic_group d
;
6423 if (warning (OPT_Wc__14_compat
, msg1
))
6424 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6429 if (complain
& tf_warning_or_error
)
6431 auto_diagnostic_group d
;
6432 if (permerror (input_location
, msg1
))
6434 /* Only mention C++14 for namespace-scope delete. */
6435 if (DECL_NAMESPACE_SCOPE_P (fn
))
6436 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6438 inform (DECL_SOURCE_LOCATION (fn
),
6439 "%qD is a usual (non-placement) deallocation "
6444 return error_mark_node
;
6449 /* "Any non-placement deallocation function matches a non-placement
6450 allocation function. If the lookup finds a single matching
6451 deallocation function, that function will be called; otherwise, no
6452 deallocation function will be called." */
6453 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
)); iter
; ++iter
)
6456 if (usual_deallocation_fn_p (elt
))
6464 /* -- If the type has new-extended alignment, a function with a
6465 parameter of type std::align_val_t is preferred; otherwise a
6466 function without such a parameter is preferred. If exactly one
6467 preferred function is found, that function is selected and the
6468 selection process terminates. If more than one preferred
6469 function is found, all non-preferred functions are eliminated
6470 from further consideration. */
6471 if (aligned_new_threshold
)
6473 bool want_align
= type_has_new_extended_alignment (type
);
6474 bool fn_align
= aligned_deallocation_fn_p (fn
);
6475 bool elt_align
= aligned_deallocation_fn_p (elt
);
6477 if (elt_align
!= fn_align
)
6479 if (want_align
== elt_align
)
6485 /* -- If the deallocation functions have class scope, the one
6486 without a parameter of type std::size_t is selected. */
6488 if (DECL_CLASS_SCOPE_P (fn
))
6491 /* -- If the type is complete and if, for the second alternative
6492 (delete array) only, the operand is a pointer to a class type
6493 with a non-trivial destructor or a (possibly multi-dimensional)
6494 array thereof, the function with a parameter of type std::size_t
6497 -- Otherwise, it is unspecified whether a deallocation function
6498 with a parameter of type std::size_t is selected. */
6501 want_size
= COMPLETE_TYPE_P (type
);
6502 if (code
== VEC_DELETE_EXPR
6503 && !TYPE_VEC_NEW_USES_COOKIE (type
))
6504 /* We need a cookie to determine the array size. */
6507 bool fn_size
= second_parm_is_size_t (fn
);
6508 bool elt_size
= second_parm_is_size_t (elt
);
6509 gcc_assert (fn_size
!= elt_size
);
6510 if (want_size
== elt_size
)
6515 /* If we have a matching function, call it. */
6518 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6520 /* If the FN is a member function, make sure that it is
6522 if (BASELINK_P (fns
))
6523 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
6526 /* Core issue 901: It's ok to new a type with deleted delete. */
6527 if (DECL_DELETED_FN (fn
) && alloc_fn
)
6532 /* The placement args might not be suitable for overload
6533 resolution at this point, so build the call directly. */
6534 int nargs
= call_expr_nargs (placement
);
6535 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
6538 for (i
= 1; i
< nargs
; i
++)
6539 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
6540 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
6541 return error_mark_node
;
6542 return build_cxx_call (fn
, nargs
, argarray
, complain
);
6546 tree destroying
= destroying_delete_p (fn
);
6549 /* Strip const and volatile from addr but retain the type of the
6551 tree rtype
= TREE_TYPE (TREE_TYPE (oaddr
));
6552 rtype
= cv_unqualified (rtype
);
6553 rtype
= TYPE_POINTER_TO (rtype
);
6554 addr
= cp_convert (rtype
, oaddr
, complain
);
6555 destroying
= build_functional_cast (destroying
, NULL_TREE
,
6560 vec
<tree
, va_gc
> *args
= make_tree_vector ();
6561 args
->quick_push (addr
);
6563 args
->quick_push (destroying
);
6564 if (second_parm_is_size_t (fn
))
6565 args
->quick_push (size
);
6566 if (aligned_deallocation_fn_p (fn
))
6568 tree al
= build_int_cst (align_type_node
, TYPE_ALIGN_UNIT (type
));
6569 args
->quick_push (al
);
6571 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
6572 release_tree_vector (args
);
6579 If no unambiguous matching deallocation function can be found,
6580 propagating the exception does not cause the object's memory to
6584 if ((complain
& tf_warning
)
6586 warning (0, "no corresponding deallocation function for %qD",
6591 if (complain
& tf_error
)
6592 error ("no suitable %<operator %s%> for %qT",
6593 OVL_OP_INFO (false, code
)->name
, type
);
6594 return error_mark_node
;
6597 /* Issue diagnostics about a disallowed access of DECL, using DIAG_DECL
6600 If ISSUE_ERROR is true, then issue an error about the
6601 access, followed by a note showing the declaration.
6602 Otherwise, just show the note. */
6605 complain_about_access (tree decl
, tree diag_decl
, bool issue_error
)
6607 if (TREE_PRIVATE (decl
))
6610 error ("%q#D is private within this context", diag_decl
);
6611 inform (DECL_SOURCE_LOCATION (diag_decl
),
6612 "declared private here");
6614 else if (TREE_PROTECTED (decl
))
6617 error ("%q#D is protected within this context", diag_decl
);
6618 inform (DECL_SOURCE_LOCATION (diag_decl
),
6619 "declared protected here");
6624 error ("%q#D is inaccessible within this context", diag_decl
);
6625 inform (DECL_SOURCE_LOCATION (diag_decl
), "declared here");
6629 /* If the current scope isn't allowed to access DECL along
6630 BASETYPE_PATH, give an error. The most derived class in
6631 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6632 the declaration to use in the error diagnostic. */
6635 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
6636 tsubst_flags_t complain
, access_failure_info
*afi
)
6638 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
6640 if (flag_new_inheriting_ctors
6641 && DECL_INHERITED_CTOR (decl
))
6643 /* 7.3.3/18: The additional constructors are accessible if they would be
6644 accessible when used to construct an object of the corresponding base
6646 decl
= strip_inheriting_ctors (decl
);
6647 basetype_path
= lookup_base (basetype_path
, DECL_CONTEXT (decl
),
6648 ba_any
, NULL
, complain
);
6651 if (!accessible_p (basetype_path
, decl
, true))
6653 if (flag_new_inheriting_ctors
)
6654 diag_decl
= strip_inheriting_ctors (diag_decl
);
6655 if (complain
& tf_error
)
6656 complain_about_access (decl
, diag_decl
, true);
6658 afi
->record_access_failure (basetype_path
, decl
, diag_decl
);
6665 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6666 bitwise or of LOOKUP_* values. If any errors are warnings are
6667 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6668 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6672 build_temp (tree expr
, tree type
, int flags
,
6673 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
6676 vec
<tree
, va_gc
> *args
;
6678 *diagnostic_kind
= DK_UNSPECIFIED
;
6680 /* If the source is a packed field, calling the copy constructor will require
6681 binding the field to the reference parameter to the copy constructor, and
6682 we'll end up with an infinite loop. If we can use a bitwise copy, then
6684 if ((lvalue_kind (expr
) & clk_packed
)
6685 && CLASS_TYPE_P (TREE_TYPE (expr
))
6686 && !type_has_nontrivial_copy_init (TREE_TYPE (expr
)))
6687 return get_target_expr_sfinae (expr
, complain
);
6689 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
6690 args
= make_tree_vector_single (expr
);
6691 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6692 &args
, type
, flags
, complain
);
6693 release_tree_vector (args
);
6694 if (warningcount
+ werrorcount
> savew
)
6695 *diagnostic_kind
= DK_WARNING
;
6696 else if (errorcount
> savee
)
6697 *diagnostic_kind
= DK_ERROR
;
6701 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6702 Also handle a subset of zero as null warnings.
6703 EXPR is implicitly converted to type TOTYPE.
6704 FN and ARGNUM are used for diagnostics. */
6707 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
6709 /* Issue warnings about peculiar, but valid, uses of NULL. */
6710 if (null_node_p (expr
) && TREE_CODE (totype
) != BOOLEAN_TYPE
6711 && ARITHMETIC_TYPE_P (totype
))
6713 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6714 loc
= expansion_point_location_if_in_system_header (loc
);
6717 auto_diagnostic_group d
;
6718 if (warning_at (loc
, OPT_Wconversion_null
,
6719 "passing NULL to non-pointer argument %P of %qD",
6721 inform (get_fndecl_argument_location (fn
, argnum
),
6725 warning_at (loc
, OPT_Wconversion_null
,
6726 "converting to non-pointer type %qT from NULL", totype
);
6729 /* Issue warnings if "false" is converted to a NULL pointer */
6730 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
6731 && TYPE_PTR_P (totype
))
6733 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6736 auto_diagnostic_group d
;
6737 if (warning_at (loc
, OPT_Wconversion_null
,
6738 "converting %<false%> to pointer type for argument "
6739 "%P of %qD", argnum
, fn
))
6740 inform (get_fndecl_argument_location (fn
, argnum
),
6744 warning_at (loc
, OPT_Wconversion_null
,
6745 "converting %<false%> to pointer type %qT", totype
);
6747 /* Handle zero as null pointer warnings for cases other
6748 than EQ_EXPR and NE_EXPR */
6749 else if (null_ptr_cst_p (expr
) &&
6750 (TYPE_PTR_OR_PTRMEM_P (totype
) || NULLPTR_TYPE_P (totype
)))
6753 expansion_point_location_if_in_system_header (input_location
);
6754 maybe_warn_zero_as_null_pointer_constant (expr
, loc
);
6758 /* We gave a diagnostic during a conversion. If this was in the second
6759 standard conversion sequence of a user-defined conversion sequence, say
6760 which user-defined conversion. */
6763 maybe_print_user_conv_context (conversion
*convs
)
6765 if (convs
->user_conv_p
)
6766 for (conversion
*t
= convs
; t
; t
= next_conversion (t
))
6767 if (t
->kind
== ck_user
)
6769 print_z_candidate (0, " after user-defined conversion:",
6775 /* Locate the parameter with the given index within FNDECL.
6776 ARGNUM is zero based, -1 indicates the `this' argument of a method.
6777 Return the location of the FNDECL itself if there are problems. */
6780 get_fndecl_argument_location (tree fndecl
, int argnum
)
6782 /* The locations of implicitly-declared functions are likely to be
6783 more meaningful than those of their parameters. */
6784 if (DECL_ARTIFICIAL (fndecl
))
6785 return DECL_SOURCE_LOCATION (fndecl
);
6790 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6791 for (i
= 0, param
= FUNCTION_FIRST_USER_PARM (fndecl
);
6792 i
< argnum
&& param
;
6793 i
++, param
= TREE_CHAIN (param
))
6796 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6797 return the location of FNDECL. */
6799 return DECL_SOURCE_LOCATION (fndecl
);
6801 return DECL_SOURCE_LOCATION (param
);
6804 /* If FNDECL is non-NULL, issue a note highlighting ARGNUM
6805 within its declaration (or the fndecl itself if something went
6809 maybe_inform_about_fndecl_for_bogus_argument_init (tree fn
, int argnum
)
6812 inform (get_fndecl_argument_location (fn
, argnum
),
6813 " initializing argument %P of %qD", argnum
, fn
);
6816 /* Perform the conversions in CONVS on the expression EXPR. FN and
6817 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6818 indicates the `this' argument of a method. INNER is nonzero when
6819 being called to continue a conversion chain. It is negative when a
6820 reference binding will be applied, positive otherwise. If
6821 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6822 conversions will be emitted if appropriate. If C_CAST_P is true,
6823 this conversion is coming from a C-style cast; in that case,
6824 conversions to inaccessible bases are permitted. */
6827 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
6828 bool issue_conversion_warnings
,
6829 bool c_cast_p
, tsubst_flags_t complain
)
6831 tree totype
= convs
->type
;
6832 diagnostic_t diag_kind
;
6834 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
6836 if (convs
->bad_p
&& !(complain
& tf_error
))
6837 return error_mark_node
;
6840 && convs
->kind
!= ck_user
6841 && convs
->kind
!= ck_list
6842 && convs
->kind
!= ck_ambig
6843 && (convs
->kind
!= ck_ref_bind
6844 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
6845 && (convs
->kind
!= ck_rvalue
6846 || SCALAR_TYPE_P (totype
))
6847 && convs
->kind
!= ck_base
)
6849 bool complained
= false;
6850 conversion
*t
= convs
;
6852 /* Give a helpful error if this is bad because of excess braces. */
6853 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6854 && SCALAR_TYPE_P (totype
)
6855 && CONSTRUCTOR_NELTS (expr
) > 0
6856 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
6858 complained
= permerror (loc
, "too many braces around initializer "
6860 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6861 && CONSTRUCTOR_NELTS (expr
) == 1)
6862 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6865 /* Give a helpful error if this is bad because a conversion to bool
6866 from std::nullptr_t requires direct-initialization. */
6867 if (NULLPTR_TYPE_P (TREE_TYPE (expr
))
6868 && TREE_CODE (totype
) == BOOLEAN_TYPE
)
6869 complained
= permerror (loc
, "converting to %qH from %qI requires "
6870 "direct-initialization",
6871 totype
, TREE_TYPE (expr
));
6873 for (; t
; t
= next_conversion (t
))
6875 if (t
->kind
== ck_user
&& t
->cand
->reason
)
6877 auto_diagnostic_group d
;
6878 complained
= permerror (loc
, "invalid user-defined conversion "
6879 "from %qH to %qI", TREE_TYPE (expr
),
6882 print_z_candidate (loc
, "candidate is:", t
->cand
);
6883 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6884 /*issue_conversion_warnings=*/false,
6887 if (convs
->kind
== ck_ref_bind
)
6888 expr
= convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
6889 LOOKUP_NORMAL
, NULL_TREE
,
6892 expr
= cp_convert (totype
, expr
, complain
);
6894 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
6897 else if (t
->kind
== ck_user
|| !t
->bad_p
)
6899 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6900 /*issue_conversion_warnings=*/false,
6905 else if (t
->kind
== ck_ambig
)
6906 return convert_like_real (t
, expr
, fn
, argnum
,
6907 /*issue_conversion_warnings=*/false,
6910 else if (t
->kind
== ck_identity
)
6915 range_label_for_type_mismatch
label (TREE_TYPE (expr
), totype
);
6916 gcc_rich_location
richloc (loc
, &label
);
6917 complained
= permerror (&richloc
,
6918 "invalid conversion from %qH to %qI",
6919 TREE_TYPE (expr
), totype
);
6922 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
6924 return cp_convert (totype
, expr
, complain
);
6927 if (issue_conversion_warnings
&& (complain
& tf_warning
))
6928 conversion_null_warnings (totype
, expr
, fn
, argnum
);
6930 switch (convs
->kind
)
6934 struct z_candidate
*cand
= convs
->cand
;
6937 /* We chose the surrogate function from add_conv_candidate, now we
6938 actually need to build the conversion. */
6939 cand
= build_user_type_conversion_1 (totype
, expr
,
6940 LOOKUP_NO_CONVERSION
, complain
);
6942 tree convfn
= cand
->fn
;
6944 /* When converting from an init list we consider explicit
6945 constructors, but actually trying to call one is an error. */
6946 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
6947 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
6948 /* Unless this is for direct-list-initialization. */
6949 && (!CONSTRUCTOR_IS_DIRECT_INIT (expr
) || convs
->need_temporary_p
)
6950 /* And in C++98 a default constructor can't be explicit. */
6951 && cxx_dialect
>= cxx11
)
6953 if (!(complain
& tf_error
))
6954 return error_mark_node
;
6955 location_t loc
= location_of (expr
);
6956 if (CONSTRUCTOR_NELTS (expr
) == 0
6957 && FUNCTION_FIRST_USER_PARMTYPE (convfn
) != void_list_node
)
6959 auto_diagnostic_group d
;
6960 if (pedwarn (loc
, 0, "converting to %qT from initializer list "
6961 "would use explicit constructor %qD",
6963 inform (loc
, "in C++11 and above a default constructor "
6967 error ("converting to %qT from initializer list would use "
6968 "explicit constructor %qD", totype
, convfn
);
6971 /* If we're initializing from {}, it's value-initialization. */
6972 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6973 && CONSTRUCTOR_NELTS (expr
) == 0
6974 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
6976 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
6977 if (abstract_virtuals_error_sfinae (NULL_TREE
, totype
, complain
))
6978 return error_mark_node
;
6979 expr
= build_value_init (totype
, complain
);
6980 expr
= get_target_expr_sfinae (expr
, complain
);
6981 if (expr
!= error_mark_node
)
6983 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6984 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
6989 expr
= mark_rvalue_use (expr
);
6991 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
6993 expr
= build_over_call (cand
, LOOKUP_NORMAL
|LOOKUP_NO_CONVERSION
,
6996 /* If this is a constructor or a function returning an aggr type,
6997 we need to build up a TARGET_EXPR. */
6998 if (DECL_CONSTRUCTOR_P (convfn
))
7000 expr
= build_cplus_new (totype
, expr
, complain
);
7002 /* Remember that this was list-initialization. */
7003 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
7004 TARGET_EXPR_LIST_INIT_P (expr
) = true;
7010 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
7012 int nelts
= CONSTRUCTOR_NELTS (expr
);
7014 expr
= build_value_init (totype
, complain
);
7015 else if (nelts
== 1)
7016 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
7020 expr
= mark_use (expr
, /*rvalue_p=*/!convs
->rvaluedness_matches_p
,
7021 /*read_p=*/true, UNKNOWN_LOCATION
,
7022 /*reject_builtin=*/true);
7024 if (type_unknown_p (expr
))
7025 expr
= instantiate_type (totype
, expr
, complain
);
7026 if (expr
== null_node
7027 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
7028 /* If __null has been converted to an integer type, we do not want to
7029 continue to warn about uses of EXPR as an integer, rather than as a
7031 expr
= build_int_cst (totype
, 0);
7034 /* We leave bad_p off ck_ambig because overload resolution considers
7035 it valid, it just fails when we try to perform it. So we need to
7036 check complain here, too. */
7037 if (complain
& tf_error
)
7039 /* Call build_user_type_conversion again for the error. */
7040 int flags
= (convs
->need_temporary_p
7041 ? LOOKUP_IMPLICIT
: LOOKUP_NORMAL
);
7042 build_user_type_conversion (totype
, convs
->u
.expr
, flags
, complain
);
7043 gcc_assert (seen_error ());
7044 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7046 return error_mark_node
;
7050 /* Conversion to std::initializer_list<T>. */
7051 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
7052 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
7053 unsigned len
= CONSTRUCTOR_NELTS (expr
);
7054 tree array
, val
, field
;
7055 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
7058 /* Convert all the elements. */
7059 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
7061 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
7062 false, false, complain
);
7063 if (sub
== error_mark_node
)
7065 if (!BRACE_ENCLOSED_INITIALIZER_P (val
)
7066 && !check_narrowing (TREE_TYPE (sub
), val
, complain
))
7067 return error_mark_node
;
7068 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
7069 if (!TREE_CONSTANT (sub
))
7070 TREE_CONSTANT (new_ctor
) = false;
7072 /* Build up the array. */
7073 elttype
= cp_build_qualified_type
7074 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
7075 array
= build_array_of_n_type (elttype
, len
);
7076 array
= finish_compound_literal (array
, new_ctor
, complain
);
7077 /* Take the address explicitly rather than via decay_conversion
7078 to avoid the error about taking the address of a temporary. */
7079 array
= cp_build_addr_expr (array
, complain
);
7080 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
7081 if (array
== error_mark_node
)
7082 return error_mark_node
;
7084 /* Build up the initializer_list object. Note: fail gracefully
7085 if the object cannot be completed because, for example, no
7086 definition is provided (c++/80956). */
7087 totype
= complete_type_or_maybe_complain (totype
, NULL_TREE
, complain
);
7089 return error_mark_node
;
7090 field
= next_initializable_field (TYPE_FIELDS (totype
));
7091 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
7092 field
= next_initializable_field (DECL_CHAIN (field
));
7093 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
7094 new_ctor
= build_constructor (totype
, vec
);
7095 return get_target_expr_sfinae (new_ctor
, complain
);
7099 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
7101 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
7102 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
7103 real
= perform_implicit_conversion (TREE_TYPE (totype
),
7105 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
7107 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
7110 expr
= reshape_init (totype
, expr
, complain
);
7111 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
7113 if (expr
!= error_mark_node
)
7114 TARGET_EXPR_LIST_INIT_P (expr
) = true;
7121 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
7122 convs
->kind
== ck_ref_bind
7123 ? issue_conversion_warnings
: false,
7124 c_cast_p
, complain
);
7125 if (expr
== error_mark_node
)
7126 return error_mark_node
;
7128 switch (convs
->kind
)
7131 expr
= decay_conversion (expr
, complain
);
7132 if (expr
== error_mark_node
)
7134 if (complain
& tf_error
)
7136 auto_diagnostic_group d
;
7137 maybe_print_user_conv_context (convs
);
7138 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7140 return error_mark_node
;
7143 if (! MAYBE_CLASS_TYPE_P (totype
))
7146 /* Don't introduce copies when passing arguments along to the inherited
7148 if (current_function_decl
7149 && flag_new_inheriting_ctors
7150 && DECL_INHERITED_CTOR (current_function_decl
))
7153 if (TREE_CODE (expr
) == TARGET_EXPR
7154 && TARGET_EXPR_LIST_INIT_P (expr
))
7155 /* Copy-list-initialization doesn't actually involve a copy. */
7160 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
7162 /* We are going to bind a reference directly to a base-class
7163 subobject of EXPR. */
7164 /* Build an expression for `*((base*) &expr)'. */
7165 expr
= convert_to_base (expr
, totype
,
7166 !c_cast_p
, /*nonnull=*/true, complain
);
7170 /* Copy-initialization where the cv-unqualified version of the source
7171 type is the same class as, or a derived class of, the class of the
7172 destination [is treated as direct-initialization]. [dcl.init] */
7173 flags
= LOOKUP_NORMAL
;
7174 if (convs
->user_conv_p
)
7175 /* This conversion is being done in the context of a user-defined
7176 conversion (i.e. the second step of copy-initialization), so
7177 don't allow any more. */
7178 flags
|= LOOKUP_NO_CONVERSION
;
7180 flags
|= LOOKUP_ONLYCONVERTING
;
7181 if (convs
->rvaluedness_matches_p
)
7182 /* standard_conversion got LOOKUP_PREFER_RVALUE. */
7183 flags
|= LOOKUP_PREFER_RVALUE
;
7184 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
7185 if (diag_kind
&& complain
)
7187 auto_diagnostic_group d
;
7188 maybe_print_user_conv_context (convs
);
7189 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7192 return build_cplus_new (totype
, expr
, complain
);
7196 tree ref_type
= totype
;
7198 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
7200 tree extype
= TREE_TYPE (expr
);
7201 auto_diagnostic_group d
;
7202 if (TYPE_REF_IS_RVALUE (ref_type
)
7204 error_at (loc
, "cannot bind rvalue reference of type %qH to "
7205 "lvalue of type %qI", totype
, extype
);
7206 else if (!TYPE_REF_IS_RVALUE (ref_type
) && !lvalue_p (expr
)
7207 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
7208 error_at (loc
, "cannot bind non-const lvalue reference of "
7209 "type %qH to an rvalue of type %qI", totype
, extype
);
7210 else if (!reference_compatible_p (TREE_TYPE (totype
), extype
))
7211 error_at (loc
, "binding reference of type %qH to %qI "
7212 "discards qualifiers", totype
, extype
);
7215 maybe_print_user_conv_context (convs
);
7216 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7218 return error_mark_node
;
7221 /* If necessary, create a temporary.
7223 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
7224 that need temporaries, even when their types are reference
7225 compatible with the type of reference being bound, so the
7226 upcoming call to cp_build_addr_expr doesn't fail. */
7227 if (convs
->need_temporary_p
7228 || TREE_CODE (expr
) == CONSTRUCTOR
7229 || TREE_CODE (expr
) == VA_ARG_EXPR
)
7231 /* Otherwise, a temporary of type "cv1 T1" is created and
7232 initialized from the initializer expression using the rules
7233 for a non-reference copy-initialization (8.5). */
7235 tree type
= TREE_TYPE (ref_type
);
7236 cp_lvalue_kind lvalue
= lvalue_kind (expr
);
7238 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7239 (type
, next_conversion (convs
)->type
));
7240 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
7241 && !TYPE_REF_IS_RVALUE (ref_type
))
7243 /* If the reference is volatile or non-const, we
7244 cannot create a temporary. */
7245 if (lvalue
& clk_bitfield
)
7246 error_at (loc
, "cannot bind bitfield %qE to %qT",
7248 else if (lvalue
& clk_packed
)
7249 error_at (loc
, "cannot bind packed field %qE to %qT",
7252 error_at (loc
, "cannot bind rvalue %qE to %qT",
7254 return error_mark_node
;
7256 /* If the source is a packed field, and we must use a copy
7257 constructor, then building the target expr will require
7258 binding the field to the reference parameter to the
7259 copy constructor, and we'll end up with an infinite
7260 loop. If we can use a bitwise copy, then we'll be
7262 if ((lvalue
& clk_packed
)
7263 && CLASS_TYPE_P (type
)
7264 && type_has_nontrivial_copy_init (type
))
7266 error_at (loc
, "cannot bind packed field %qE to %qT",
7268 return error_mark_node
;
7270 if (lvalue
& clk_bitfield
)
7272 expr
= convert_bitfield_to_declared_type (expr
);
7273 expr
= fold_convert (type
, expr
);
7275 expr
= build_target_expr_with_type (expr
, type
, complain
);
7278 /* Take the address of the thing to which we will bind the
7280 expr
= cp_build_addr_expr (expr
, complain
);
7281 if (expr
== error_mark_node
)
7282 return error_mark_node
;
7284 /* Convert it to a pointer to the type referred to by the
7285 reference. This will adjust the pointer if a derived to
7286 base conversion is being performed. */
7287 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
7289 /* Convert the pointer to the desired reference type. */
7290 return build_nop (ref_type
, expr
);
7294 return decay_conversion (expr
, complain
);
7297 /* ??? Should the address of a transaction-safe pointer point to the TM
7298 clone, and this conversion look up the primary function? */
7299 return build_nop (totype
, expr
);
7302 /* Warn about deprecated conversion if appropriate. */
7303 string_conv_p (totype
, expr
, 1);
7308 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
7309 /*nonnull=*/false, complain
);
7310 return build_nop (totype
, expr
);
7313 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
7314 c_cast_p
, complain
);
7320 if (convs
->check_narrowing
7321 && !check_narrowing (totype
, expr
, complain
,
7322 convs
->check_narrowing_const_only
))
7323 return error_mark_node
;
7325 warning_sentinel
w (warn_zero_as_null_pointer_constant
);
7326 if (issue_conversion_warnings
)
7327 expr
= cp_convert_and_check (totype
, expr
, complain
);
7329 expr
= cp_convert (totype
, expr
, complain
);
7334 /* ARG is being passed to a varargs function. Perform any conversions
7335 required. Return the converted value. */
7338 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
7341 location_t loc
= cp_expr_loc_or_loc (arg
, input_location
);
7345 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7346 standard conversions are performed. */
7347 arg
= decay_conversion (arg
, complain
);
7348 arg_type
= TREE_TYPE (arg
);
7351 If the argument has integral or enumeration type that is subject
7352 to the integral promotions (_conv.prom_), or a floating point
7353 type that is subject to the floating point promotion
7354 (_conv.fpprom_), the value of the argument is converted to the
7355 promoted type before the call. */
7356 if (TREE_CODE (arg_type
) == REAL_TYPE
7357 && (TYPE_PRECISION (arg_type
)
7358 < TYPE_PRECISION (double_type_node
))
7359 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
7361 if ((complain
& tf_warning
)
7362 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
7363 warning_at (loc
, OPT_Wdouble_promotion
,
7364 "implicit conversion from %qH to %qI when passing "
7365 "argument to function",
7366 arg_type
, double_type_node
);
7367 arg
= convert_to_real_nofold (double_type_node
, arg
);
7369 else if (NULLPTR_TYPE_P (arg_type
))
7370 arg
= null_pointer_node
;
7371 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
7373 if (SCOPED_ENUM_P (arg_type
))
7375 tree prom
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
,
7377 prom
= cp_perform_integral_promotions (prom
, complain
);
7378 if (abi_version_crosses (6)
7379 && TYPE_MODE (TREE_TYPE (prom
)) != TYPE_MODE (arg_type
)
7380 && (complain
& tf_warning
))
7381 warning_at (loc
, OPT_Wabi
, "scoped enum %qT passed through ... as "
7382 "%qT before -fabi-version=6, %qT after", arg_type
,
7383 TREE_TYPE (prom
), ENUM_UNDERLYING_TYPE (arg_type
));
7384 if (!abi_version_at_least (6))
7388 arg
= cp_perform_integral_promotions (arg
, complain
);
7391 arg
= require_complete_type_sfinae (arg
, complain
);
7392 arg_type
= TREE_TYPE (arg
);
7394 if (arg
!= error_mark_node
7395 /* In a template (or ill-formed code), we can have an incomplete type
7396 even after require_complete_type_sfinae, in which case we don't know
7397 whether it has trivial copy or not. */
7398 && COMPLETE_TYPE_P (arg_type
)
7399 && !cp_unevaluated_operand
)
7401 /* [expr.call] 5.2.2/7:
7402 Passing a potentially-evaluated argument of class type (Clause 9)
7403 with a non-trivial copy constructor or a non-trivial destructor
7404 with no corresponding parameter is conditionally-supported, with
7405 implementation-defined semantics.
7407 We support it as pass-by-invisible-reference, just like a normal
7410 If the call appears in the context of a sizeof expression,
7411 it is not potentially-evaluated. */
7412 if (type_has_nontrivial_copy_init (arg_type
)
7413 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
))
7415 arg
= force_rvalue (arg
, complain
);
7416 if (complain
& tf_warning
)
7417 warning (OPT_Wconditionally_supported
,
7418 "passing objects of non-trivially-copyable "
7419 "type %q#T through %<...%> is conditionally supported",
7421 return build1 (ADDR_EXPR
, build_reference_type (arg_type
), arg
);
7423 /* Build up a real lvalue-to-rvalue conversion in case the
7424 copy constructor is trivial but not callable. */
7425 else if (CLASS_TYPE_P (arg_type
))
7426 force_rvalue (arg
, complain
);
7433 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7436 build_x_va_arg (location_t loc
, tree expr
, tree type
)
7438 if (processing_template_decl
)
7440 tree r
= build_min (VA_ARG_EXPR
, type
, expr
);
7441 SET_EXPR_LOCATION (r
, loc
);
7445 type
= complete_type_or_else (type
, NULL_TREE
);
7447 if (expr
== error_mark_node
|| !type
)
7448 return error_mark_node
;
7450 expr
= mark_lvalue_use (expr
);
7452 if (TYPE_REF_P (type
))
7454 error ("cannot receive reference type %qT through %<...%>", type
);
7455 return error_mark_node
;
7458 if (type_has_nontrivial_copy_init (type
)
7459 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7461 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7462 it as pass by invisible reference. */
7463 warning_at (loc
, OPT_Wconditionally_supported
,
7464 "receiving objects of non-trivially-copyable type %q#T "
7465 "through %<...%> is conditionally-supported", type
);
7467 tree ref
= cp_build_reference_type (type
, false);
7468 expr
= build_va_arg (loc
, expr
, ref
);
7469 return convert_from_reference (expr
);
7472 tree ret
= build_va_arg (loc
, expr
, type
);
7473 if (CLASS_TYPE_P (type
))
7474 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7475 know how to handle it. */
7476 ret
= get_target_expr (ret
);
7480 /* TYPE has been given to va_arg. Apply the default conversions which
7481 would have happened when passed via ellipsis. Return the promoted
7482 type, or the passed type if there is no change. */
7485 cxx_type_promotes_to (tree type
)
7489 /* Perform the array-to-pointer and function-to-pointer
7491 type
= type_decays_to (type
);
7493 promote
= type_promotes_to (type
);
7494 if (same_type_p (type
, promote
))
7500 /* ARG is a default argument expression being passed to a parameter of
7501 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7502 zero-based argument number. Do any required conversions. Return
7503 the converted value. */
7505 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
7507 push_defarg_context (tree fn
)
7508 { vec_safe_push (default_arg_context
, fn
); }
7511 pop_defarg_context (void)
7512 { default_arg_context
->pop (); }
7515 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
7516 tsubst_flags_t complain
)
7521 /* See through clones. */
7522 fn
= DECL_ORIGIN (fn
);
7523 /* And inheriting ctors. */
7524 if (flag_new_inheriting_ctors
)
7525 fn
= strip_inheriting_ctors (fn
);
7527 /* Detect recursion. */
7528 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
7531 if (complain
& tf_error
)
7532 error ("recursive evaluation of default argument for %q#D", fn
);
7533 return error_mark_node
;
7536 /* If the ARG is an unparsed default argument expression, the
7537 conversion cannot be performed. */
7538 if (TREE_CODE (arg
) == DEFAULT_ARG
)
7540 if (complain
& tf_error
)
7541 error ("call to %qD uses the default argument for parameter %P, which "
7542 "is not yet defined", fn
, parmnum
);
7543 return error_mark_node
;
7546 push_defarg_context (fn
);
7548 if (fn
&& DECL_TEMPLATE_INFO (fn
))
7549 arg
= tsubst_default_argument (fn
, parmnum
, type
, arg
, complain
);
7555 The names in the expression are bound, and the semantic
7556 constraints are checked, at the point where the default
7557 expressions appears.
7559 we must not perform access checks here. */
7560 push_deferring_access_checks (dk_no_check
);
7561 /* We must make a copy of ARG, in case subsequent processing
7562 alters any part of it. */
7563 arg
= break_out_target_exprs (arg
, /*clear location*/true);
7565 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
7566 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
7568 arg
= convert_for_arg_passing (type
, arg
, complain
);
7569 pop_deferring_access_checks();
7571 pop_defarg_context ();
7576 /* Returns the type which will really be used for passing an argument of
7580 type_passed_as (tree type
)
7582 /* Pass classes with copy ctors by invisible reference. */
7583 if (TREE_ADDRESSABLE (type
))
7585 type
= build_reference_type (type
);
7586 /* There are no other pointers to this temporary. */
7587 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
7589 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7590 && INTEGRAL_TYPE_P (type
)
7591 && COMPLETE_TYPE_P (type
)
7592 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7593 type
= integer_type_node
;
7598 /* Actually perform the appropriate conversion. */
7601 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
7605 /* If VAL is a bitfield, then -- since it has already been converted
7606 to TYPE -- it cannot have a precision greater than TYPE.
7608 If it has a smaller precision, we must widen it here. For
7609 example, passing "int f:3;" to a function expecting an "int" will
7610 not result in any conversion before this point.
7612 If the precision is the same we must not risk widening. For
7613 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7614 often have type "int", even though the C++ type for the field is
7615 "long long". If the value is being passed to a function
7616 expecting an "int", then no conversions will be required. But,
7617 if we call convert_bitfield_to_declared_type, the bitfield will
7618 be converted to "long long". */
7619 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
7621 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
7622 val
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
), val
);
7624 if (val
== error_mark_node
)
7626 /* Pass classes with copy ctors by invisible reference. */
7627 else if (TREE_ADDRESSABLE (type
))
7628 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
7629 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7630 && INTEGRAL_TYPE_P (type
)
7631 && COMPLETE_TYPE_P (type
)
7632 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7633 val
= cp_perform_integral_promotions (val
, complain
);
7634 if (complain
& tf_warning
)
7636 if (warn_suggest_attribute_format
)
7638 tree rhstype
= TREE_TYPE (val
);
7639 const enum tree_code coder
= TREE_CODE (rhstype
);
7640 const enum tree_code codel
= TREE_CODE (type
);
7641 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7643 && check_missing_format_attribute (type
, rhstype
))
7644 warning (OPT_Wsuggest_attribute_format
,
7645 "argument of function call might be a candidate "
7646 "for a format attribute");
7648 maybe_warn_parm_abi (type
, cp_expr_loc_or_loc (val
, input_location
));
7651 if (complain
& tf_warning
)
7652 warn_for_address_or_pointer_of_packed_member (type
, val
);
7657 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7658 which just decay_conversion or no conversions at all should be done.
7659 This is true for some builtins which don't act like normal functions.
7660 Return 2 if no conversions at all should be done, 1 if just
7661 decay_conversion. Return 3 for special treatment of the 3rd argument
7662 for __builtin_*_overflow_p. */
7665 magic_varargs_p (tree fn
)
7667 if (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
7668 switch (DECL_FUNCTION_CODE (fn
))
7670 case BUILT_IN_CLASSIFY_TYPE
:
7671 case BUILT_IN_CONSTANT_P
:
7672 case BUILT_IN_NEXT_ARG
:
7673 case BUILT_IN_VA_START
:
7676 case BUILT_IN_ADD_OVERFLOW_P
:
7677 case BUILT_IN_SUB_OVERFLOW_P
:
7678 case BUILT_IN_MUL_OVERFLOW_P
:
7682 return lookup_attribute ("type generic",
7683 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
7689 /* Returns the decl of the dispatcher function if FN is a function version. */
7692 get_function_version_dispatcher (tree fn
)
7694 tree dispatcher_decl
= NULL
;
7696 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7697 && DECL_FUNCTION_VERSIONED (fn
));
7699 gcc_assert (targetm
.get_function_versions_dispatcher
);
7700 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
7702 if (dispatcher_decl
== NULL
)
7704 error_at (input_location
, "use of multiversioned function "
7705 "without a default");
7709 retrofit_lang_decl (dispatcher_decl
);
7710 gcc_assert (dispatcher_decl
!= NULL
);
7711 return dispatcher_decl
;
7714 /* fn is a function version dispatcher that is marked used. Mark all the
7715 semantically identical function versions it will dispatch as used. */
7718 mark_versions_used (tree fn
)
7720 struct cgraph_node
*node
;
7721 struct cgraph_function_version_info
*node_v
;
7722 struct cgraph_function_version_info
*it_v
;
7724 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7726 node
= cgraph_node::get (fn
);
7730 gcc_assert (node
->dispatcher_function
);
7732 node_v
= node
->function_version ();
7736 /* All semantically identical versions are chained. Traverse and mark each
7737 one of them as used. */
7738 it_v
= node_v
->next
;
7739 while (it_v
!= NULL
)
7741 mark_used (it_v
->this_node
->decl
);
7746 /* Build a call to "the copy constructor" for the type of A, even if it
7747 wouldn't be selected by normal overload resolution. Used for
7751 call_copy_ctor (tree a
, tsubst_flags_t complain
)
7753 tree ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (a
));
7754 tree binfo
= TYPE_BINFO (ctype
);
7755 tree copy
= get_copy_ctor (ctype
, complain
);
7756 copy
= build_baselink (binfo
, binfo
, copy
, NULL_TREE
);
7757 tree ob
= build_dummy_object (ctype
);
7758 vec
<tree
, va_gc
>* args
= make_tree_vector_single (a
);
7759 tree r
= build_new_method_call (ob
, copy
, &args
, NULL_TREE
,
7760 LOOKUP_NORMAL
, NULL
, complain
);
7761 release_tree_vector (args
);
7765 /* Return true iff T refers to a base field. */
7768 is_base_field_ref (tree t
)
7771 if (TREE_CODE (t
) == ADDR_EXPR
)
7772 t
= TREE_OPERAND (t
, 0);
7773 if (TREE_CODE (t
) == COMPONENT_REF
)
7774 t
= TREE_OPERAND (t
, 1);
7775 if (TREE_CODE (t
) == FIELD_DECL
)
7776 return DECL_FIELD_IS_BASE (t
);
7780 /* We can't elide a copy from a function returning by value to a base
7781 subobject, as the callee might clobber tail padding. Return true iff this
7782 could be that case. */
7785 unsafe_copy_elision_p (tree target
, tree exp
)
7787 /* Copy elision only happens with a TARGET_EXPR. */
7788 if (TREE_CODE (exp
) != TARGET_EXPR
)
7790 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
7791 /* It's safe to elide the copy for a class with no tail padding. */
7792 if (tree_int_cst_equal (TYPE_SIZE (type
), CLASSTYPE_SIZE (type
)))
7794 /* It's safe to elide the copy if we aren't initializing a base object. */
7795 if (!is_base_field_ref (target
))
7797 tree init
= TARGET_EXPR_INITIAL (exp
);
7798 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7799 while (TREE_CODE (init
) == COMPOUND_EXPR
)
7800 init
= TREE_OPERAND (init
, 1);
7801 if (TREE_CODE (init
) == COND_EXPR
)
7803 /* We'll end up copying from each of the arms of the COND_EXPR directly
7804 into the target, so look at them. */
7805 if (tree op
= TREE_OPERAND (init
, 1))
7806 if (unsafe_copy_elision_p (target
, op
))
7808 return unsafe_copy_elision_p (target
, TREE_OPERAND (init
, 2));
7810 return (TREE_CODE (init
) == AGGR_INIT_EXPR
7811 && !AGGR_INIT_VIA_CTOR_P (init
));
7814 /* True iff C is a conversion that binds a reference to a prvalue. */
7817 conv_binds_ref_to_prvalue (conversion
*c
)
7819 if (c
->kind
!= ck_ref_bind
)
7821 if (c
->need_temporary_p
)
7824 c
= next_conversion (c
);
7826 if (c
->kind
== ck_rvalue
)
7828 if (c
->kind
== ck_user
&& !TYPE_REF_P (c
->type
))
7830 if (c
->kind
== ck_identity
&& c
->u
.expr
7831 && TREE_CODE (c
->u
.expr
) == TARGET_EXPR
)
7837 /* Call the trivial destructor for INSTANCE, which can be either an lvalue of
7838 class type or a pointer to class type. */
7841 build_trivial_dtor_call (tree instance
)
7843 gcc_assert (!is_dummy_object (instance
));
7845 if (!flag_lifetime_dse
)
7848 return fold_convert (void_type_node
, instance
);
7851 if (INDIRECT_TYPE_P (TREE_TYPE (instance
)))
7853 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
7855 instance
= cp_build_fold_indirect_ref (instance
);
7858 /* A trivial destructor should still clobber the object. */
7859 tree clobber
= build_clobber (TREE_TYPE (instance
));
7860 return build2 (MODIFY_EXPR
, void_type_node
,
7864 /* Subroutine of the various build_*_call functions. Overload resolution
7865 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7866 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7867 bitmask of various LOOKUP_* flags which apply to the call itself. */
7870 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
7873 const vec
<tree
, va_gc
> *args
= cand
->args
;
7874 tree first_arg
= cand
->first_arg
;
7875 conversion
**convs
= cand
->convs
;
7877 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
7882 unsigned int arg_index
= 0;
7886 bool already_used
= false;
7888 /* In a template, there is no need to perform all of the work that
7889 is normally done. We are only interested in the type of the call
7890 expression, i.e., the return type of the function. Any semantic
7891 errors will be deferred until the template is instantiated. */
7892 if (processing_template_decl
)
7896 const tree
*argarray
;
7899 if (undeduced_auto_decl (fn
))
7900 mark_used (fn
, complain
);
7902 /* Otherwise set TREE_USED for the benefit of -Wunused-function.
7906 return_type
= TREE_TYPE (TREE_TYPE (fn
));
7907 nargs
= vec_safe_length (args
);
7908 if (first_arg
== NULL_TREE
)
7909 argarray
= args
->address ();
7917 alcarray
= XALLOCAVEC (tree
, nargs
);
7918 alcarray
[0] = build_this (first_arg
);
7919 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
7920 alcarray
[ix
+ 1] = arg
;
7921 argarray
= alcarray
;
7924 addr
= build_addr_func (fn
, complain
);
7925 if (addr
== error_mark_node
)
7926 return error_mark_node
;
7927 expr
= build_call_array_loc (input_location
, return_type
,
7928 addr
, nargs
, argarray
);
7929 if (TREE_THIS_VOLATILE (fn
) && cfun
)
7930 current_function_returns_abnormally
= 1;
7931 return convert_from_reference (expr
);
7934 /* Give any warnings we noticed during overload resolution. */
7935 if (cand
->warnings
&& (complain
& tf_warning
))
7937 struct candidate_warning
*w
;
7938 for (w
= cand
->warnings
; w
; w
= w
->next
)
7939 joust (cand
, w
->loser
, 1, complain
);
7942 /* Core issue 2327: P0135 doesn't say how to handle the case where the
7943 argument to the copy constructor ends up being a prvalue after
7944 conversion. Let's do the normal processing, but pretend we aren't
7945 actually using the copy constructor. */
7946 bool force_elide
= false;
7947 if (cxx_dialect
>= cxx17
7948 && cand
->num_convs
== 1
7949 && DECL_COMPLETE_CONSTRUCTOR_P (fn
)
7950 && (DECL_COPY_CONSTRUCTOR_P (fn
)
7951 || DECL_MOVE_CONSTRUCTOR_P (fn
))
7952 && conv_binds_ref_to_prvalue (convs
[0]))
7955 goto not_really_used
;
7958 /* OK, we're actually calling this inherited constructor; set its deletedness
7959 appropriately. We can get away with doing this here because calling is
7960 the only way to refer to a constructor. */
7961 if (DECL_INHERITED_CTOR (fn
))
7962 deduce_inheriting_ctor (fn
);
7964 /* Make =delete work with SFINAE. */
7965 if (DECL_DELETED_FN (fn
))
7967 if (complain
& tf_error
)
7969 return error_mark_node
;
7972 if (DECL_FUNCTION_MEMBER_P (fn
))
7975 /* If FN is a template function, two cases must be considered.
7980 template <class T> void f();
7982 template <class T> struct B {
7986 struct C : A, B<int> {
7988 using B<int>::g; // #2
7991 In case #1 where `A::f' is a member template, DECL_ACCESS is
7992 recorded in the primary template but not in its specialization.
7993 We check access of FN using its primary template.
7995 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7996 because it is a member of class template B, DECL_ACCESS is
7997 recorded in the specialization `B<int>::g'. We cannot use its
7998 primary template because `B<T>::g' and `B<int>::g' may have
7999 different access. */
8000 if (DECL_TEMPLATE_INFO (fn
)
8001 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
8002 access_fn
= DECL_TI_TEMPLATE (fn
);
8005 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
8007 return error_mark_node
;
8010 /* If we're checking for implicit delete, don't bother with argument
8012 if (flags
& LOOKUP_SPECULATIVE
)
8014 if (cand
->viable
== 1)
8016 else if (!(complain
& tf_error
))
8017 /* Reject bad conversions now. */
8018 return error_mark_node
;
8019 /* else continue to get conversion error. */
8024 /* N3276 magic doesn't apply to nested calls. */
8025 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
8026 complain
&= ~tf_decltype
;
8027 /* No-Cleanup doesn't apply to nested calls either. */
8028 tsubst_flags_t no_cleanup_complain
= complain
;
8029 complain
&= ~tf_no_cleanup
;
8031 /* Find maximum size of vector to hold converted arguments. */
8032 parmlen
= list_length (parm
);
8033 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
8034 if (parmlen
> nargs
)
8036 argarray
= XALLOCAVEC (tree
, nargs
);
8038 /* The implicit parameters to a constructor are not considered by overload
8039 resolution, and must be of the proper type. */
8040 if (DECL_CONSTRUCTOR_P (fn
))
8043 if (first_arg
!= NULL_TREE
)
8045 object_arg
= first_arg
;
8046 first_arg
= NULL_TREE
;
8050 object_arg
= (*args
)[arg_index
];
8053 argarray
[j
++] = build_this (object_arg
);
8054 parm
= TREE_CHAIN (parm
);
8055 /* We should never try to call the abstract constructor. */
8056 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
8058 if (DECL_HAS_VTT_PARM_P (fn
))
8060 argarray
[j
++] = (*args
)[arg_index
];
8062 parm
= TREE_CHAIN (parm
);
8065 if (flags
& LOOKUP_PREFER_RVALUE
)
8067 /* The implicit move specified in 15.8.3/3 fails "...if the type of
8068 the first parameter of the selected constructor is not an rvalue
8069 reference to the object's type (possibly cv-qualified)...." */
8070 gcc_assert (!(complain
& tf_error
));
8071 tree ptype
= convs
[0]->type
;
8072 if (!TYPE_REF_P (ptype
)
8073 || !TYPE_REF_IS_RVALUE (ptype
)
8074 || CONVERSION_RANK (convs
[0]) > cr_exact
)
8075 return error_mark_node
;
8078 /* Bypass access control for 'this' parameter. */
8079 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
8081 tree parmtype
= TREE_VALUE (parm
);
8082 tree arg
= build_this (first_arg
!= NULL_TREE
8084 : (*args
)[arg_index
]);
8085 tree argtype
= TREE_TYPE (arg
);
8089 if (arg
== error_mark_node
)
8090 return error_mark_node
;
8092 if (convs
[i
]->bad_p
)
8094 if (complain
& tf_error
)
8096 auto_diagnostic_group d
;
8097 if (permerror (input_location
, "passing %qT as %<this%> "
8098 "argument discards qualifiers",
8099 TREE_TYPE (argtype
)))
8100 inform (DECL_SOURCE_LOCATION (fn
), " in call to %qD", fn
);
8103 return error_mark_node
;
8106 /* See if the function member or the whole class type is declared
8107 final and the call can be devirtualized. */
8108 if (DECL_FINAL_P (fn
)
8109 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
8110 flags
|= LOOKUP_NONVIRTUAL
;
8112 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
8113 X is called for an object that is not of type X, or of a type
8114 derived from X, the behavior is undefined.
8116 So we can assume that anything passed as 'this' is non-null, and
8117 optimize accordingly. */
8118 gcc_assert (TYPE_PTR_P (parmtype
));
8119 /* Convert to the base in which the function was declared. */
8120 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
8121 converted_arg
= build_base_path (PLUS_EXPR
,
8123 cand
->conversion_path
,
8125 /* Check that the base class is accessible. */
8126 if (!accessible_base_p (TREE_TYPE (argtype
),
8127 BINFO_TYPE (cand
->conversion_path
), true))
8129 if (complain
& tf_error
)
8130 error ("%qT is not an accessible base of %qT",
8131 BINFO_TYPE (cand
->conversion_path
),
8132 TREE_TYPE (argtype
));
8134 return error_mark_node
;
8136 /* If fn was found by a using declaration, the conversion path
8137 will be to the derived class, not the base declaring fn. We
8138 must convert from derived to base. */
8139 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
8140 TREE_TYPE (parmtype
), ba_unique
,
8142 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
8143 base_binfo
, 1, complain
);
8145 argarray
[j
++] = converted_arg
;
8146 parm
= TREE_CHAIN (parm
);
8147 if (first_arg
!= NULL_TREE
)
8148 first_arg
= NULL_TREE
;
8155 gcc_assert (first_arg
== NULL_TREE
);
8156 for (; arg_index
< vec_safe_length (args
) && parm
;
8157 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
8159 tree type
= TREE_VALUE (parm
);
8160 tree arg
= (*args
)[arg_index
];
8161 bool conversion_warning
= true;
8165 /* If the argument is NULL and used to (implicitly) instantiate a
8166 template function (and bind one of the template arguments to
8167 the type of 'long int'), we don't want to warn about passing NULL
8168 to non-pointer argument.
8169 For example, if we have this template function:
8171 template<typename T> void func(T x) {}
8173 we want to warn (when -Wconversion is enabled) in this case:
8179 but not in this case:
8185 if (null_node_p (arg
)
8186 && DECL_TEMPLATE_INFO (fn
)
8187 && cand
->template_decl
8188 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
8189 conversion_warning
= false;
8191 /* Warn about initializer_list deduction that isn't currently in the
8193 if (cxx_dialect
> cxx98
8194 && flag_deduce_init_list
8195 && cand
->template_decl
8196 && is_std_init_list (non_reference (type
))
8197 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
8199 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
8200 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
8201 tree patparm
= get_pattern_parm (realparm
, tmpl
);
8202 tree pattype
= TREE_TYPE (patparm
);
8203 if (PACK_EXPANSION_P (pattype
))
8204 pattype
= PACK_EXPANSION_PATTERN (pattype
);
8205 pattype
= non_reference (pattype
);
8207 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
8208 && (cand
->explicit_targs
== NULL_TREE
8209 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
8210 <= TEMPLATE_TYPE_IDX (pattype
))))
8212 pedwarn (input_location
, 0, "deducing %qT as %qT",
8213 non_reference (TREE_TYPE (patparm
)),
8214 non_reference (type
));
8215 pedwarn (DECL_SOURCE_LOCATION (cand
->fn
), 0,
8216 " in call to %qD", cand
->fn
);
8217 pedwarn (input_location
, 0,
8218 " (you can disable this with -fno-deduce-init-list)");
8222 /* Set user_conv_p on the argument conversions, so rvalue/base handling
8223 knows not to allow any more UDCs. This needs to happen after we
8224 process cand->warnings. */
8225 if (flags
& LOOKUP_NO_CONVERSION
)
8226 conv
->user_conv_p
= true;
8228 tsubst_flags_t arg_complain
= complain
;
8229 if (!conversion_warning
)
8230 arg_complain
&= ~tf_warning
;
8232 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
8234 val
= convert_for_arg_passing (type
, val
, arg_complain
);
8236 if (val
== error_mark_node
)
8237 return error_mark_node
;
8239 argarray
[j
++] = val
;
8242 /* Default arguments */
8243 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
8245 if (TREE_VALUE (parm
) == error_mark_node
)
8246 return error_mark_node
;
8247 val
= convert_default_arg (TREE_VALUE (parm
),
8248 TREE_PURPOSE (parm
),
8251 if (val
== error_mark_node
)
8252 return error_mark_node
;
8253 argarray
[j
++] = val
;
8257 int magic
= magic_varargs_p (fn
);
8258 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
8260 tree a
= (*args
)[arg_index
];
8261 if ((magic
== 3 && arg_index
== 2) || magic
== 2)
8263 /* Do no conversions for certain magic varargs. */
8264 a
= mark_type_use (a
);
8265 if (TREE_CODE (a
) == FUNCTION_DECL
&& reject_gcc_builtin (a
))
8266 return error_mark_node
;
8268 else if (magic
!= 0)
8269 /* For other magic varargs only do decay_conversion. */
8270 a
= decay_conversion (a
, complain
);
8271 else if (DECL_CONSTRUCTOR_P (fn
)
8272 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn
),
8275 /* Avoid infinite recursion trying to call A(...). */
8276 if (complain
& tf_error
)
8277 /* Try to call the actual copy constructor for a good error. */
8278 call_copy_ctor (a
, complain
);
8279 return error_mark_node
;
8282 a
= convert_arg_to_ellipsis (a
, complain
);
8283 if (a
== error_mark_node
)
8284 return error_mark_node
;
8288 gcc_assert (j
<= nargs
);
8291 /* Avoid to do argument-transformation, if warnings for format, and for
8292 nonnull are disabled. Just in case that at least one of them is active
8293 the check_function_arguments function might warn about something. */
8295 bool warned_p
= false;
8298 || warn_suggest_attribute_format
8301 tree
*fargs
= (!nargs
? argarray
8302 : (tree
*) alloca (nargs
* sizeof (tree
)));
8303 for (j
= 0; j
< nargs
; j
++)
8305 /* For -Wformat undo the implicit passing by hidden reference
8306 done by convert_arg_to_ellipsis. */
8307 if (TREE_CODE (argarray
[j
]) == ADDR_EXPR
8308 && TYPE_REF_P (TREE_TYPE (argarray
[j
])))
8309 fargs
[j
] = TREE_OPERAND (argarray
[j
], 0);
8311 fargs
[j
] = argarray
[j
];
8314 warned_p
= check_function_arguments (input_location
, fn
, TREE_TYPE (fn
),
8315 nargs
, fargs
, NULL
);
8318 if (DECL_INHERITED_CTOR (fn
))
8320 /* Check for passing ellipsis arguments to an inherited constructor. We
8321 could handle this by open-coding the inherited constructor rather than
8322 defining it, but let's not bother now. */
8323 if (!cp_unevaluated_operand
8325 && cand
->convs
[cand
->num_convs
-1]->ellipsis_p
)
8327 if (complain
& tf_error
)
8329 sorry ("passing arguments to ellipsis of inherited constructor "
8331 inform (DECL_SOURCE_LOCATION (cand
->fn
), "declared here");
8333 return error_mark_node
;
8336 /* A base constructor inheriting from a virtual base doesn't get the
8337 inherited arguments, just this and __vtt. */
8338 if (ctor_omit_inherited_parms (fn
))
8342 /* Avoid actually calling copy constructors and copy assignment operators,
8345 if (! flag_elide_constructors
&& !force_elide
)
8346 /* Do things the hard way. */;
8347 else if (cand
->num_convs
== 1
8348 && (DECL_COPY_CONSTRUCTOR_P (fn
)
8349 || DECL_MOVE_CONSTRUCTOR_P (fn
))
8350 /* It's unsafe to elide the constructor when handling
8351 a noexcept-expression, it may evaluate to the wrong
8352 value (c++/53025). */
8353 && (force_elide
|| cp_noexcept_operand
== 0))
8356 tree arg
= argarray
[num_artificial_parms_for (fn
)];
8358 bool trivial
= trivial_fn_p (fn
);
8360 /* Pull out the real argument, disregarding const-correctness. */
8362 /* Strip the reference binding for the constructor parameter. */
8363 if (CONVERT_EXPR_P (targ
)
8364 && TYPE_REF_P (TREE_TYPE (targ
)))
8365 targ
= TREE_OPERAND (targ
, 0);
8366 /* But don't strip any other reference bindings; binding a temporary to a
8367 reference prevents copy elision. */
8368 while ((CONVERT_EXPR_P (targ
)
8369 && !TYPE_REF_P (TREE_TYPE (targ
)))
8370 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
8371 targ
= TREE_OPERAND (targ
, 0);
8372 if (TREE_CODE (targ
) == ADDR_EXPR
)
8374 targ
= TREE_OPERAND (targ
, 0);
8375 if (!same_type_ignoring_top_level_qualifiers_p
8376 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
8385 arg
= cp_build_fold_indirect_ref (arg
);
8387 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8389 if (CHECKING_P
&& cxx_dialect
>= cxx17
)
8390 gcc_assert (TREE_CODE (arg
) != TARGET_EXPR
8392 /* It's from binding the ref parm to a packed field. */
8393 || convs
[0]->need_temporary_p
8395 /* See unsafe_copy_elision_p. */
8396 || DECL_BASE_CONSTRUCTOR_P (fn
));
8399 bool unsafe
= unsafe_copy_elision_p (fa
, arg
);
8400 bool eliding_temp
= (TREE_CODE (arg
) == TARGET_EXPR
&& !unsafe
);
8402 /* [class.copy]: the copy constructor is implicitly defined even if the
8403 implementation elided its use. But don't warn about deprecation when
8404 eliding a temporary, as then no copy is actually performed. */
8405 warning_sentinel
s (warn_deprecated_copy
, eliding_temp
);
8407 /* The language says this isn't called. */;
8410 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
8411 return error_mark_node
;
8412 already_used
= true;
8415 cp_warn_deprecated_use (fn
, complain
);
8417 /* If we're creating a temp and we already have one, don't create a
8418 new one. If we're not creating a temp but we get one, use
8419 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8420 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8421 temp or an INIT_EXPR otherwise. */
8422 if (is_dummy_object (fa
))
8424 if (TREE_CODE (arg
) == TARGET_EXPR
)
8427 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
8429 else if ((trivial
|| TREE_CODE (arg
) == TARGET_EXPR
)
8432 tree to
= cp_stabilize_reference (cp_build_fold_indirect_ref (fa
));
8434 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
8438 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
8439 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
)
8440 && trivial_fn_p (fn
))
8442 tree to
= cp_stabilize_reference
8443 (cp_build_fold_indirect_ref (argarray
[0]));
8444 tree type
= TREE_TYPE (to
);
8445 tree as_base
= CLASSTYPE_AS_BASE (type
);
8446 tree arg
= argarray
[1];
8447 location_t loc
= cp_expr_loc_or_loc (arg
, input_location
);
8449 if (is_really_empty_class (type
))
8451 /* Avoid copying empty classes. */
8452 val
= build2 (COMPOUND_EXPR
, type
, arg
, to
);
8453 TREE_NO_WARNING (val
) = 1;
8455 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
8457 if (is_std_init_list (type
)
8458 && conv_binds_ref_to_prvalue (convs
[1]))
8459 warning_at (loc
, OPT_Winit_list_lifetime
,
8460 "assignment from temporary initializer_list does not "
8461 "extend the lifetime of the underlying array");
8462 arg
= cp_build_fold_indirect_ref (arg
);
8463 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
8467 /* We must only copy the non-tail padding parts. */
8469 tree array_type
, alias_set
;
8471 arg2
= TYPE_SIZE_UNIT (as_base
);
8472 arg0
= cp_build_addr_expr (to
, complain
);
8474 array_type
= build_array_type (unsigned_char_type_node
,
8476 (size_binop (MINUS_EXPR
,
8477 arg2
, size_int (1))));
8478 alias_set
= build_int_cst (build_pointer_type (type
), 0);
8479 t
= build2 (MODIFY_EXPR
, void_type_node
,
8480 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
8481 build2 (MEM_REF
, array_type
, arg
, alias_set
));
8482 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
8483 TREE_NO_WARNING (val
) = 1;
8486 cp_warn_deprecated_use (fn
, complain
);
8490 else if (trivial_fn_p (fn
))
8492 if (DECL_DESTRUCTOR_P (fn
))
8493 return build_trivial_dtor_call (argarray
[0]);
8494 else if (default_ctor_p (fn
))
8496 if (is_dummy_object (argarray
[0]))
8497 return force_target_expr (DECL_CONTEXT (fn
), void_node
,
8498 no_cleanup_complain
);
8500 return cp_build_fold_indirect_ref (argarray
[0]);
8504 gcc_assert (!force_elide
);
8507 && !mark_used (fn
, complain
))
8508 return error_mark_node
;
8510 /* Warn if the built-in writes to an object of a non-trivial type. */
8511 if (warn_class_memaccess
8512 && vec_safe_length (args
) >= 2
8513 && DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
8514 maybe_warn_class_memaccess (input_location
, fn
, args
);
8516 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0)
8519 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
8521 ba_any
, NULL
, complain
);
8522 gcc_assert (binfo
&& binfo
!= error_mark_node
);
8524 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
8526 if (TREE_SIDE_EFFECTS (argarray
[0]))
8527 argarray
[0] = save_expr (argarray
[0]);
8528 t
= build_pointer_type (TREE_TYPE (fn
));
8529 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
8534 fn
= build_addr_func (fn
, complain
);
8535 if (fn
== error_mark_node
)
8536 return error_mark_node
;
8539 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
8540 if (call
== error_mark_node
)
8542 if (cand
->flags
& LOOKUP_LIST_INIT_CTOR
)
8544 tree c
= extract_call_expr (call
);
8545 /* build_new_op_1 will clear this when appropriate. */
8546 CALL_EXPR_ORDERED_ARGS (c
) = true;
8550 tree c
= extract_call_expr (call
);
8551 if (TREE_CODE (c
) == CALL_EXPR
)
8552 TREE_NO_WARNING (c
) = 1;
8560 /* Return the DECL of the first non-static subobject of class TYPE
8561 that satisfies the predicate PRED or null if none can be found. */
8563 template <class Predicate
>
8565 first_non_static_field (tree type
, Predicate pred
)
8567 if (!type
|| !CLASS_TYPE_P (type
))
8570 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
8572 if (TREE_CODE (field
) != FIELD_DECL
)
8574 if (TREE_STATIC (field
))
8582 for (tree base_binfo
, binfo
= TYPE_BINFO (type
);
8583 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8585 tree base
= TREE_TYPE (base_binfo
);
8588 if (tree field
= first_non_static_field (base
, pred
))
8595 struct NonPublicField
8597 bool operator() (const_tree t
)
8599 return DECL_P (t
) && (TREE_PRIVATE (t
) || TREE_PROTECTED (t
));
8603 /* Return the DECL of the first non-public subobject of class TYPE
8604 or null if none can be found. */
8607 first_non_public_field (tree type
)
8609 return first_non_static_field (type
, NonPublicField ());
8612 struct NonTrivialField
8614 bool operator() (const_tree t
)
8616 return !trivial_type_p (DECL_P (t
) ? TREE_TYPE (t
) : t
);
8620 /* Return the DECL of the first non-trivial subobject of class TYPE
8621 or null if none can be found. */
8624 first_non_trivial_field (tree type
)
8626 return first_non_static_field (type
, NonTrivialField ());
8629 } /* unnamed namespace */
8631 /* Return true if all copy and move assignment operator overloads for
8632 class TYPE are trivial and at least one of them is not deleted and,
8633 when ACCESS is set, accessible. Return false otherwise. Set
8634 HASASSIGN to true when the TYPE has a (not necessarily trivial)
8635 copy or move assignment. */
8638 has_trivial_copy_assign_p (tree type
, bool access
, bool *hasassign
)
8640 tree fns
= get_class_binding (type
, assign_op_identifier
);
8641 bool all_trivial
= true;
8643 /* Iterate over overloads of the assignment operator, checking
8644 accessible copy assignments for triviality. */
8646 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8650 /* Skip operators that aren't copy assignments. */
8654 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8655 || accessible_p (TYPE_BINFO (type
), f
, true));
8657 /* Skip template assignment operators and deleted functions. */
8658 if (TREE_CODE (f
) != FUNCTION_DECL
|| DECL_DELETED_FN (f
))
8664 if (!accessible
|| !trivial_fn_p (f
))
8665 all_trivial
= false;
8667 /* Break early when both properties have been determined. */
8668 if (*hasassign
&& !all_trivial
)
8672 /* Return true if they're all trivial and one of the expressions
8673 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
8674 tree ref
= cp_build_reference_type (type
, false);
8676 && (is_trivially_xible (MODIFY_EXPR
, type
, type
)
8677 || is_trivially_xible (MODIFY_EXPR
, type
, ref
)));
8680 /* Return true if all copy and move ctor overloads for class TYPE are
8681 trivial and at least one of them is not deleted and, when ACCESS is
8682 set, accessible. Return false otherwise. Set each element of HASCTOR[]
8683 to true when the TYPE has a (not necessarily trivial) default and copy
8684 (or move) ctor, respectively. */
8687 has_trivial_copy_p (tree type
, bool access
, bool hasctor
[2])
8689 tree fns
= get_class_binding (type
, complete_ctor_identifier
);
8690 bool all_trivial
= true;
8692 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8696 /* Skip template constructors. */
8697 if (TREE_CODE (f
) != FUNCTION_DECL
)
8700 bool cpy_or_move_ctor_p
= copy_fn_p (f
);
8702 /* Skip ctors other than default, copy, and move. */
8703 if (!cpy_or_move_ctor_p
&& !default_ctor_p (f
))
8706 if (DECL_DELETED_FN (f
))
8709 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8710 || accessible_p (TYPE_BINFO (type
), f
, true));
8713 hasctor
[cpy_or_move_ctor_p
] = true;
8715 if (cpy_or_move_ctor_p
&& (!accessible
|| !trivial_fn_p (f
)))
8716 all_trivial
= false;
8718 /* Break early when both properties have been determined. */
8719 if (hasctor
[0] && hasctor
[1] && !all_trivial
)
8726 /* Issue a warning on a call to the built-in function FNDECL if it is
8727 a raw memory write whose destination is not an object of (something
8728 like) trivial or standard layout type with a non-deleted assignment
8729 and copy ctor. Detects const correctness violations, corrupting
8730 references, virtual table pointers, and bypassing non-trivial
8734 maybe_warn_class_memaccess (location_t loc
, tree fndecl
,
8735 const vec
<tree
, va_gc
> *args
)
8737 /* Except for bcopy where it's second, the destination pointer is
8738 the first argument for all functions handled here. Compute
8739 the index of the destination and source arguments. */
8740 unsigned dstidx
= DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_BCOPY
;
8741 unsigned srcidx
= !dstidx
;
8743 tree dest
= (*args
)[dstidx
];
8744 if (!TREE_TYPE (dest
) || !INDIRECT_TYPE_P (TREE_TYPE (dest
)))
8747 tree srctype
= NULL_TREE
;
8749 /* Determine the type of the pointed-to object and whether it's
8750 a complete class type. */
8751 tree desttype
= TREE_TYPE (TREE_TYPE (dest
));
8753 if (!desttype
|| !COMPLETE_TYPE_P (desttype
) || !CLASS_TYPE_P (desttype
))
8756 /* Check to see if the raw memory call is made by a non-static member
8757 function with THIS as the destination argument for the destination
8758 type. If so, and if the class has no non-trivial bases or members,
8759 be more permissive. */
8760 if (current_function_decl
8761 && DECL_NONSTATIC_MEMBER_FUNCTION_P (current_function_decl
)
8762 && is_this_parameter (tree_strip_nop_conversions (dest
)))
8764 tree ctx
= DECL_CONTEXT (current_function_decl
);
8765 bool special
= same_type_ignoring_top_level_qualifiers_p (ctx
, desttype
);
8766 tree binfo
= TYPE_BINFO (ctx
);
8769 && !BINFO_VTABLE (binfo
)
8770 && !first_non_trivial_field (desttype
))
8774 /* True if the class is trivial. */
8775 bool trivial
= trivial_type_p (desttype
);
8777 /* Set to true if DESTYPE has an accessible copy assignment. */
8778 bool hasassign
= false;
8779 /* True if all of the class' overloaded copy assignment operators
8780 are all trivial (and not deleted) and at least one of them is
8782 bool trivassign
= has_trivial_copy_assign_p (desttype
, true, &hasassign
);
8784 /* Set to true if DESTTYPE has an accessible default and copy ctor,
8786 bool hasctors
[2] = { false, false };
8788 /* True if all of the class' overloaded copy constructors are all
8789 trivial (and not deleted) and at least one of them is accessible. */
8790 bool trivcopy
= has_trivial_copy_p (desttype
, true, hasctors
);
8792 /* Set FLD to the first private/protected member of the class. */
8793 tree fld
= trivial
? first_non_public_field (desttype
) : NULL_TREE
;
8795 /* The warning format string. */
8796 const char *warnfmt
= NULL
;
8797 /* A suggested alternative to offer instead of the raw memory call.
8798 Empty string when none can be come up with. */
8799 const char *suggest
= "";
8800 bool warned
= false;
8802 switch (DECL_FUNCTION_CODE (fndecl
))
8804 case BUILT_IN_MEMSET
:
8805 if (!integer_zerop (maybe_constant_value ((*args
)[1])))
8807 /* Diagnose setting non-copy-assignable or non-trivial types,
8808 or types with a private member, to (potentially) non-zero
8809 bytes. Since the value of the bytes being written is unknown,
8810 suggest using assignment instead (if one exists). Also warn
8811 for writes into objects for which zero-initialization doesn't
8812 mean all bits clear (pointer-to-member data, where null is all
8813 bits set). Since the value being written is (most likely)
8814 non-zero, simply suggest assignment (but not copy assignment). */
8815 suggest
= "; use assignment instead";
8817 warnfmt
= G_("%qD writing to an object of type %#qT with "
8818 "no trivial copy-assignment");
8820 warnfmt
= G_("%qD writing to an object of non-trivial type %#qT%s");
8823 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8824 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8825 "%qD writing to an object of type %#qT with "
8827 fndecl
, desttype
, access
, fld
);
8829 else if (!zero_init_p (desttype
))
8830 warnfmt
= G_("%qD writing to an object of type %#qT containing "
8831 "a pointer to data member%s");
8837 case BUILT_IN_BZERO
:
8838 /* Similarly to the above, diagnose clearing non-trivial or non-
8839 standard layout objects, or objects of types with no assignmenmt.
8840 Since the value being written is known to be zero, suggest either
8841 copy assignment, copy ctor, or default ctor as an alternative,
8842 depending on what's available. */
8844 if (hasassign
&& hasctors
[0])
8845 suggest
= G_("; use assignment or value-initialization instead");
8847 suggest
= G_("; use assignment instead");
8848 else if (hasctors
[0])
8849 suggest
= G_("; use value-initialization instead");
8852 warnfmt
= G_("%qD clearing an object of type %#qT with "
8853 "no trivial copy-assignment%s");
8855 warnfmt
= G_("%qD clearing an object of non-trivial type %#qT%s");
8856 else if (!zero_init_p (desttype
))
8857 warnfmt
= G_("%qD clearing an object of type %#qT containing "
8858 "a pointer-to-member%s");
8861 case BUILT_IN_BCOPY
:
8862 case BUILT_IN_MEMCPY
:
8863 case BUILT_IN_MEMMOVE
:
8864 case BUILT_IN_MEMPCPY
:
8865 /* Determine the type of the source object. */
8866 srctype
= TREE_TYPE ((*args
)[srcidx
]);
8867 if (!srctype
|| !INDIRECT_TYPE_P (srctype
))
8868 srctype
= void_type_node
;
8870 srctype
= TREE_TYPE (srctype
);
8872 /* Since it's impossible to determine wheter the byte copy is
8873 being used in place of assignment to an existing object or
8874 as a substitute for initialization, assume it's the former.
8875 Determine the best alternative to use instead depending on
8876 what's not deleted. */
8877 if (hasassign
&& hasctors
[1])
8878 suggest
= G_("; use copy-assignment or copy-initialization instead");
8880 suggest
= G_("; use copy-assignment instead");
8881 else if (hasctors
[1])
8882 suggest
= G_("; use copy-initialization instead");
8885 warnfmt
= G_("%qD writing to an object of type %#qT with no trivial "
8886 "copy-assignment%s");
8887 else if (!trivially_copyable_p (desttype
))
8888 warnfmt
= G_("%qD writing to an object of non-trivially copyable "
8891 warnfmt
= G_("%qD writing to an object with a deleted copy constructor");
8894 && !VOID_TYPE_P (srctype
)
8895 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
8896 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
8899 /* Warn when copying into a non-trivial object from an object
8900 of a different type other than void or char. */
8901 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8902 "%qD copying an object of non-trivial type "
8903 "%#qT from an array of %#qT",
8904 fndecl
, desttype
, srctype
);
8907 && !VOID_TYPE_P (srctype
)
8908 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
8909 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
8912 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8913 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8914 "%qD copying an object of type %#qT with "
8915 "%qs member %qD from an array of %#qT; use "
8916 "assignment or copy-initialization instead",
8917 fndecl
, desttype
, access
, fld
, srctype
);
8919 else if (!trivial
&& vec_safe_length (args
) > 2)
8921 tree sz
= maybe_constant_value ((*args
)[2]);
8922 if (!tree_fits_uhwi_p (sz
))
8925 /* Finally, warn on partial copies. */
8926 unsigned HOST_WIDE_INT typesize
8927 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype
));
8928 if (unsigned HOST_WIDE_INT partial
= tree_to_uhwi (sz
) % typesize
)
8929 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8930 (typesize
- partial
> 1
8931 ? G_("%qD writing to an object of "
8932 "a non-trivial type %#qT leaves %wu "
8934 : G_("%qD writing to an object of "
8935 "a non-trivial type %#qT leaves %wu "
8937 fndecl
, desttype
, typesize
- partial
);
8941 case BUILT_IN_REALLOC
:
8943 if (!trivially_copyable_p (desttype
))
8944 warnfmt
= G_("%qD moving an object of non-trivially copyable type "
8945 "%#qT; use %<new%> and %<delete%> instead");
8947 warnfmt
= G_("%qD moving an object of type %#qT with deleted copy "
8948 "constructor; use %<new%> and %<delete%> instead");
8949 else if (!get_dtor (desttype
, tf_none
))
8950 warnfmt
= G_("%qD moving an object of type %#qT with deleted "
8954 tree sz
= maybe_constant_value ((*args
)[1]);
8955 if (TREE_CODE (sz
) == INTEGER_CST
8956 && tree_int_cst_lt (sz
, TYPE_SIZE_UNIT (desttype
)))
8957 /* Finally, warn on reallocation into insufficient space. */
8958 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8959 "%qD moving an object of non-trivial type "
8960 "%#qT and size %E into a region of size %E",
8961 fndecl
, desttype
, TYPE_SIZE_UNIT (desttype
),
8973 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8974 warnfmt
, fndecl
, desttype
, suggest
);
8976 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8977 warnfmt
, fndecl
, desttype
);
8981 inform (location_of (desttype
), "%#qT declared here", desttype
);
8984 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
8985 This function performs no overload resolution, conversion, or other
8986 high-level operations. */
8989 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
8990 tsubst_flags_t complain
)
8994 /* Remember roughly where this call is. */
8995 location_t loc
= cp_expr_loc_or_loc (fn
, input_location
);
8996 fn
= build_call_a (fn
, nargs
, argarray
);
8997 SET_EXPR_LOCATION (fn
, loc
);
8999 fndecl
= get_callee_fndecl (fn
);
9001 /* Check that arguments to builtin functions match the expectations. */
9003 && !processing_template_decl
9004 && fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
9008 /* We need to take care that values to BUILT_IN_NORMAL
9010 for (i
= 0; i
< nargs
; i
++)
9011 argarray
[i
] = maybe_constant_value (argarray
[i
]);
9013 if (!check_builtin_function_arguments (EXPR_LOCATION (fn
), vNULL
, fndecl
,
9015 return error_mark_node
;
9018 if (VOID_TYPE_P (TREE_TYPE (fn
)))
9021 /* 5.2.2/11: If a function call is a prvalue of object type: if the
9022 function call is either the operand of a decltype-specifier or the
9023 right operand of a comma operator that is the operand of a
9024 decltype-specifier, a temporary object is not introduced for the
9025 prvalue. The type of the prvalue may be incomplete. */
9026 if (!(complain
& tf_decltype
))
9028 fn
= require_complete_type_sfinae (fn
, complain
);
9029 if (fn
== error_mark_node
)
9030 return error_mark_node
;
9032 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
9034 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
9035 maybe_warn_parm_abi (TREE_TYPE (fn
), loc
);
9038 return convert_from_reference (fn
);
9041 /* Returns the value to use for the in-charge parameter when making a
9042 call to a function with the indicated NAME.
9044 FIXME:Can't we find a neater way to do this mapping? */
9047 in_charge_arg_for_name (tree name
)
9049 if (IDENTIFIER_CTOR_P (name
))
9051 if (name
== complete_ctor_identifier
)
9052 return integer_one_node
;
9053 gcc_checking_assert (name
== base_ctor_identifier
);
9057 if (name
== complete_dtor_identifier
)
9058 return integer_two_node
;
9059 else if (name
== deleting_dtor_identifier
)
9060 return integer_three_node
;
9061 gcc_checking_assert (name
== base_dtor_identifier
);
9064 return integer_zero_node
;
9067 /* We've built up a constructor call RET. Complain if it delegates to the
9068 constructor we're currently compiling. */
9071 check_self_delegation (tree ret
)
9073 if (TREE_CODE (ret
) == TARGET_EXPR
)
9074 ret
= TARGET_EXPR_INITIAL (ret
);
9075 tree fn
= cp_get_callee_fndecl_nofold (ret
);
9076 if (fn
&& DECL_ABSTRACT_ORIGIN (fn
) == current_function_decl
)
9077 error ("constructor delegates to itself");
9080 /* Build a call to a constructor, destructor, or an assignment
9081 operator for INSTANCE, an expression with class type. NAME
9082 indicates the special member function to call; *ARGS are the
9083 arguments. ARGS may be NULL. This may change ARGS. BINFO
9084 indicates the base of INSTANCE that is to be passed as the `this'
9085 parameter to the member function called.
9087 FLAGS are the LOOKUP_* flags to use when processing the call.
9089 If NAME indicates a complete object constructor, INSTANCE may be
9090 NULL_TREE. In this case, the caller will call build_cplus_new to
9091 store the newly constructed object into a VAR_DECL. */
9094 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
9095 tree binfo
, int flags
, tsubst_flags_t complain
)
9098 /* The type of the subobject to be constructed or destroyed. */
9100 vec
<tree
, va_gc
> *allocated
= NULL
;
9103 gcc_assert (IDENTIFIER_CDTOR_P (name
) || name
== assign_op_identifier
);
9105 if (error_operand_p (instance
))
9106 return error_mark_node
;
9108 if (IDENTIFIER_DTOR_P (name
))
9110 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
9111 if (!type_build_dtor_call (TREE_TYPE (instance
)))
9112 /* Shortcut to avoid lazy destructor declaration. */
9113 return build_trivial_dtor_call (instance
);
9118 /* Resolve the name. */
9119 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
9120 return error_mark_node
;
9122 binfo
= TYPE_BINFO (binfo
);
9125 gcc_assert (binfo
!= NULL_TREE
);
9127 class_type
= BINFO_TYPE (binfo
);
9129 /* Handle the special case where INSTANCE is NULL_TREE. */
9130 if (name
== complete_ctor_identifier
&& !instance
)
9131 instance
= build_dummy_object (class_type
);
9134 /* Convert to the base class, if necessary. */
9135 if (!same_type_ignoring_top_level_qualifiers_p
9136 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
9138 if (IDENTIFIER_CDTOR_P (name
))
9139 /* For constructors and destructors, either the base is
9140 non-virtual, or it is virtual but we are doing the
9141 conversion from a constructor or destructor for the
9142 complete object. In either case, we can convert
9144 instance
= convert_to_base_statically (instance
, binfo
);
9147 /* However, for assignment operators, we must convert
9148 dynamically if the base is virtual. */
9149 gcc_checking_assert (name
== assign_op_identifier
);
9150 instance
= build_base_path (PLUS_EXPR
, instance
,
9151 binfo
, /*nonnull=*/1, complain
);
9156 gcc_assert (instance
!= NULL_TREE
);
9158 /* In C++17, "If the initializer expression is a prvalue and the
9159 cv-unqualified version of the source type is the same class as the class
9160 of the destination, the initializer expression is used to initialize the
9161 destination object." Handle that here to avoid doing overload
9163 if (cxx_dialect
>= cxx17
9164 && args
&& vec_safe_length (*args
) == 1
9165 && name
== complete_ctor_identifier
)
9167 tree arg
= (**args
)[0];
9169 if (BRACE_ENCLOSED_INITIALIZER_P (arg
)
9170 && !TYPE_HAS_LIST_CTOR (class_type
)
9171 && CONSTRUCTOR_NELTS (arg
) == 1)
9172 arg
= CONSTRUCTOR_ELT (arg
, 0)->value
;
9174 if ((TREE_CODE (arg
) == TARGET_EXPR
9175 || TREE_CODE (arg
) == CONSTRUCTOR
)
9176 && (same_type_ignoring_top_level_qualifiers_p
9177 (class_type
, TREE_TYPE (arg
))))
9179 if (is_dummy_object (instance
))
9181 else if (TREE_CODE (arg
) == TARGET_EXPR
)
9182 TARGET_EXPR_DIRECT_INIT_P (arg
) = true;
9184 if ((complain
& tf_error
)
9185 && (flags
& LOOKUP_DELEGATING_CONS
))
9186 check_self_delegation (arg
);
9187 /* Avoid change of behavior on Wunused-var-2.C. */
9188 instance
= mark_lvalue_use (instance
);
9189 return build2 (INIT_EXPR
, class_type
, instance
, arg
);
9193 fns
= lookup_fnfields (binfo
, name
, 1);
9195 /* When making a call to a constructor or destructor for a subobject
9196 that uses virtual base classes, pass down a pointer to a VTT for
9198 if ((name
== base_ctor_identifier
9199 || name
== base_dtor_identifier
)
9200 && CLASSTYPE_VBASECLASSES (class_type
))
9205 /* If the current function is a complete object constructor
9206 or destructor, then we fetch the VTT directly.
9207 Otherwise, we look it up using the VTT we were given. */
9208 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
9209 vtt
= decay_conversion (vtt
, complain
);
9210 if (vtt
== error_mark_node
)
9211 return error_mark_node
;
9212 vtt
= build_if_in_charge (vtt
, current_vtt_parm
);
9213 if (BINFO_SUBVTT_INDEX (binfo
))
9214 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
9220 allocated
= make_tree_vector ();
9224 vec_safe_insert (*args
, 0, sub_vtt
);
9227 ret
= build_new_method_call (instance
, fns
, args
,
9228 TYPE_BINFO (BINFO_TYPE (binfo
)),
9232 if (allocated
!= NULL
)
9233 release_tree_vector (allocated
);
9235 if ((complain
& tf_error
)
9236 && (flags
& LOOKUP_DELEGATING_CONS
)
9237 && name
== complete_ctor_identifier
)
9238 check_self_delegation (ret
);
9243 /* Return the NAME, as a C string. The NAME indicates a function that
9244 is a member of TYPE. *FREE_P is set to true if the caller must
9245 free the memory returned.
9247 Rather than go through all of this, we should simply set the names
9248 of constructors and destructors appropriately, and dispense with
9249 ctor_identifier, dtor_identifier, etc. */
9252 name_as_c_string (tree name
, tree type
, bool *free_p
)
9254 const char *pretty_name
;
9256 /* Assume that we will not allocate memory. */
9258 /* Constructors and destructors are special. */
9259 if (IDENTIFIER_CDTOR_P (name
))
9262 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
)));
9263 /* For a destructor, add the '~'. */
9264 if (IDENTIFIER_DTOR_P (name
))
9266 pretty_name
= concat ("~", pretty_name
, NULL
);
9267 /* Remember that we need to free the memory allocated. */
9271 else if (IDENTIFIER_CONV_OP_P (name
))
9273 pretty_name
= concat ("operator ",
9274 type_as_string_translate (TREE_TYPE (name
),
9275 TFF_PLAIN_IDENTIFIER
),
9277 /* Remember that we need to free the memory allocated. */
9281 pretty_name
= identifier_to_locale (IDENTIFIER_POINTER (name
));
9283 return CONST_CAST (char *, pretty_name
);
9286 /* If CANDIDATES contains exactly one candidate, return it, otherwise
9289 static z_candidate
*
9290 single_z_candidate (z_candidate
*candidates
)
9292 if (candidates
== NULL
)
9295 if (candidates
->next
)
9301 /* If CANDIDATE is invalid due to a bad argument type, return the
9302 pertinent conversion_info.
9304 Otherwise, return NULL. */
9306 static const conversion_info
*
9307 maybe_get_bad_conversion_for_unmatched_call (const z_candidate
*candidate
)
9309 /* Must be an rr_arg_conversion or rr_bad_arg_conversion. */
9310 rejection_reason
*r
= candidate
->reason
;
9320 case rr_arg_conversion
:
9321 return &r
->u
.conversion
;
9323 case rr_bad_arg_conversion
:
9324 return &r
->u
.bad_conversion
;
9328 /* Issue an error and note complaining about a bad argument type at a
9329 callsite with a single candidate FNDECL.
9331 ARG_LOC is the location of the argument (or UNKNOWN_LOCATION, in which
9332 case input_location is used).
9333 FROM_TYPE is the type of the actual argument; TO_TYPE is the type of
9334 the formal parameter. */
9337 complain_about_bad_argument (location_t arg_loc
,
9338 tree from_type
, tree to_type
,
9339 tree fndecl
, int parmnum
)
9341 auto_diagnostic_group d
;
9342 range_label_for_type_mismatch
rhs_label (from_type
, to_type
);
9343 range_label
*label
= &rhs_label
;
9344 if (arg_loc
== UNKNOWN_LOCATION
)
9346 arg_loc
= input_location
;
9349 gcc_rich_location
richloc (arg_loc
, label
);
9351 "cannot convert %qH to %qI",
9352 from_type
, to_type
);
9353 maybe_inform_about_fndecl_for_bogus_argument_init (fndecl
,
9357 /* Subroutine of build_new_method_call_1, for where there are no viable
9358 candidates for the call. */
9361 complain_about_no_candidates_for_method_call (tree instance
,
9362 z_candidate
*candidates
,
9363 tree explicit_targs
,
9365 tree optype
, tree name
,
9366 bool skip_first_for_error
,
9367 vec
<tree
, va_gc
> *user_args
)
9369 auto_diagnostic_group d
;
9370 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
9371 cxx_incomplete_type_error (instance
, basetype
);
9373 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9374 basetype
, optype
, build_tree_list_vec (user_args
),
9375 TREE_TYPE (instance
));
9378 /* Special-case for when there's a single candidate that's failing
9379 due to a bad argument type. */
9380 if (z_candidate
*candidate
= single_z_candidate (candidates
))
9381 if (const conversion_info
*conv
9382 = maybe_get_bad_conversion_for_unmatched_call (candidate
))
9384 complain_about_bad_argument (conv
->loc
,
9385 conv
->from
, conv
->to_type
,
9386 candidate
->fn
, conv
->n_arg
);
9390 tree arglist
= build_tree_list_vec (user_args
);
9391 tree errname
= name
;
9392 bool twiddle
= false;
9393 if (IDENTIFIER_CDTOR_P (errname
))
9395 twiddle
= IDENTIFIER_DTOR_P (errname
);
9396 errname
= constructor_name (basetype
);
9399 errname
= lookup_template_function (errname
, explicit_targs
);
9400 if (skip_first_for_error
)
9401 arglist
= TREE_CHAIN (arglist
);
9402 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
9403 basetype
, &"~"[!twiddle
], errname
, arglist
,
9404 TREE_TYPE (instance
));
9406 print_z_candidates (location_of (name
), candidates
);
9409 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
9410 be set, upon return, to the function called. ARGS may be NULL.
9411 This may change ARGS. */
9414 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9415 tree conversion_path
, int flags
,
9416 tree
*fn_p
, tsubst_flags_t complain
)
9418 struct z_candidate
*candidates
= 0, *cand
;
9419 tree explicit_targs
= NULL_TREE
;
9420 tree basetype
= NULL_TREE
;
9421 tree access_binfo
, binfo
;
9423 tree first_mem_arg
= NULL_TREE
;
9425 bool skip_first_for_error
;
9426 vec
<tree
, va_gc
> *user_args
;
9429 int template_only
= 0;
9433 vec
<tree
, va_gc
> *orig_args
= NULL
;
9436 gcc_assert (instance
!= NULL_TREE
);
9438 /* We don't know what function we're going to call, yet. */
9442 if (error_operand_p (instance
)
9443 || !fns
|| error_operand_p (fns
))
9444 return error_mark_node
;
9446 if (!BASELINK_P (fns
))
9448 if (complain
& tf_error
)
9449 error ("call to non-function %qD", fns
);
9450 return error_mark_node
;
9453 orig_instance
= instance
;
9456 /* Dismantle the baselink to collect all the information we need. */
9457 if (!conversion_path
)
9458 conversion_path
= BASELINK_BINFO (fns
);
9459 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
9460 binfo
= BASELINK_BINFO (fns
);
9461 optype
= BASELINK_OPTYPE (fns
);
9462 fns
= BASELINK_FUNCTIONS (fns
);
9463 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
9465 explicit_targs
= TREE_OPERAND (fns
, 1);
9466 fns
= TREE_OPERAND (fns
, 0);
9469 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
9470 || TREE_CODE (fns
) == TEMPLATE_DECL
9471 || TREE_CODE (fns
) == OVERLOAD
);
9472 fn
= OVL_FIRST (fns
);
9473 name
= DECL_NAME (fn
);
9475 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
9476 gcc_assert (CLASS_TYPE_P (basetype
));
9478 user_args
= args
== NULL
? NULL
: *args
;
9479 /* Under DR 147 A::A() is an invalid constructor call,
9480 not a functional cast. */
9481 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
9483 if (! (complain
& tf_error
))
9484 return error_mark_node
;
9486 basetype
= DECL_CONTEXT (fn
);
9487 name
= constructor_name (basetype
);
9488 auto_diagnostic_group d
;
9489 if (permerror (input_location
,
9490 "cannot call constructor %<%T::%D%> directly",
9492 inform (input_location
, "for a function-style cast, remove the "
9493 "redundant %<::%D%>", name
);
9494 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
9499 if (processing_template_decl
)
9501 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
9502 instance
= build_non_dependent_expr (instance
);
9504 make_args_non_dependent (*args
);
9507 /* Process the argument list. */
9508 if (args
!= NULL
&& *args
!= NULL
)
9510 *args
= resolve_args (*args
, complain
);
9512 return error_mark_node
;
9516 /* Consider the object argument to be used even if we end up selecting a
9517 static member function. */
9518 instance
= mark_type_use (instance
);
9520 /* Figure out whether to skip the first argument for the error
9521 message we will display to users if an error occurs. We don't
9522 want to display any compiler-generated arguments. The "this"
9523 pointer hasn't been added yet. However, we must remove the VTT
9524 pointer if this is a call to a base-class constructor or
9526 skip_first_for_error
= false;
9527 if (IDENTIFIER_CDTOR_P (name
))
9529 /* Callers should explicitly indicate whether they want to ctor
9530 the complete object or just the part without virtual bases. */
9531 gcc_assert (name
!= ctor_identifier
);
9533 /* Remove the VTT pointer, if present. */
9534 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
9535 && CLASSTYPE_VBASECLASSES (basetype
))
9536 skip_first_for_error
= true;
9538 /* It's OK to call destructors and constructors on cv-qualified
9539 objects. Therefore, convert the INSTANCE to the unqualified
9540 type, if necessary. */
9541 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
9543 instance
= build_this (instance
);
9544 instance
= build_nop (build_pointer_type (basetype
), instance
);
9545 instance
= build_fold_indirect_ref (instance
);
9549 gcc_assert (!DECL_DESTRUCTOR_P (fn
) && !DECL_CONSTRUCTOR_P (fn
));
9551 /* For the overload resolution we need to find the actual `this`
9552 that would be captured if the call turns out to be to a
9553 non-static member function. Do not actually capture it at this
9555 if (DECL_CONSTRUCTOR_P (fn
))
9556 /* Constructors don't use the enclosing 'this'. */
9557 first_mem_arg
= instance
;
9559 first_mem_arg
= maybe_resolve_dummy (instance
, false);
9561 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9562 p
= conversion_obstack_alloc (0);
9564 /* The number of arguments artificial parms in ARGS; we subtract one because
9565 there's no 'this' in ARGS. */
9566 unsigned skip
= num_artificial_parms_for (fn
) - 1;
9568 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
9569 initializer, not T({ }). */
9570 if (DECL_CONSTRUCTOR_P (fn
)
9571 && vec_safe_length (user_args
) > skip
9572 && DIRECT_LIST_INIT_P ((*user_args
)[skip
]))
9574 tree init_list
= (*user_args
)[skip
];
9575 tree init
= NULL_TREE
;
9577 gcc_assert (user_args
->length () == skip
+ 1
9578 && !(flags
& LOOKUP_ONLYCONVERTING
));
9580 /* If the initializer list has no elements and T is a class type with
9581 a default constructor, the object is value-initialized. Handle
9582 this here so we don't need to handle it wherever we use
9583 build_special_member_call. */
9584 if (CONSTRUCTOR_NELTS (init_list
) == 0
9585 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
9586 /* For a user-provided default constructor, use the normal
9587 mechanisms so that protected access works. */
9588 && type_has_non_user_provided_default_constructor (basetype
)
9589 && !processing_template_decl
)
9590 init
= build_value_init (basetype
, complain
);
9592 /* If BASETYPE is an aggregate, we need to do aggregate
9594 else if (CP_AGGREGATE_TYPE_P (basetype
))
9596 init
= reshape_init (basetype
, init_list
, complain
);
9597 init
= digest_init (basetype
, init
, complain
);
9602 if (is_dummy_object (instance
))
9603 return get_target_expr_sfinae (init
, complain
);
9604 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
9605 TREE_SIDE_EFFECTS (init
) = true;
9609 /* Otherwise go ahead with overload resolution. */
9610 add_list_candidates (fns
, first_mem_arg
, user_args
,
9611 basetype
, explicit_targs
, template_only
,
9612 conversion_path
, access_binfo
, flags
,
9613 &candidates
, complain
);
9616 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
9617 explicit_targs
, template_only
, conversion_path
,
9618 access_binfo
, flags
, &candidates
, complain
);
9620 any_viable_p
= false;
9621 candidates
= splice_viable (candidates
, false, &any_viable_p
);
9625 if (complain
& tf_error
)
9626 complain_about_no_candidates_for_method_call (instance
, candidates
,
9627 explicit_targs
, basetype
,
9629 skip_first_for_error
,
9631 call
= error_mark_node
;
9635 cand
= tourney (candidates
, complain
);
9642 if (complain
& tf_error
)
9644 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
9645 arglist
= build_tree_list_vec (user_args
);
9646 if (skip_first_for_error
)
9647 arglist
= TREE_CHAIN (arglist
);
9648 auto_diagnostic_group d
;
9649 if (!any_strictly_viable (candidates
))
9650 error ("no matching function for call to %<%s(%A)%>",
9651 pretty_name
, arglist
);
9653 error ("call of overloaded %<%s(%A)%> is ambiguous",
9654 pretty_name
, arglist
);
9655 print_z_candidates (location_of (name
), candidates
);
9659 call
= error_mark_node
;
9666 if (!(flags
& LOOKUP_NONVIRTUAL
)
9667 && DECL_PURE_VIRTUAL_P (fn
)
9668 && instance
== current_class_ref
9669 && (complain
& tf_warning
))
9671 /* This is not an error, it is runtime undefined
9673 if (!current_function_decl
)
9674 warning (0, "pure virtual %q#D called from "
9675 "non-static data member initializer", fn
);
9676 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
9677 || DECL_DESTRUCTOR_P (current_function_decl
))
9678 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
9679 ? G_("pure virtual %q#D called from constructor")
9680 : G_("pure virtual %q#D called from destructor")),
9684 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
9685 && !DECL_CONSTRUCTOR_P (fn
)
9686 && is_dummy_object (instance
))
9688 instance
= maybe_resolve_dummy (instance
, true);
9689 if (instance
== error_mark_node
)
9690 call
= error_mark_node
;
9691 else if (!is_dummy_object (instance
))
9693 /* We captured 'this' in the current lambda now that
9694 we know we really need it. */
9695 cand
->first_arg
= instance
;
9697 else if (any_dependent_bases_p ())
9698 /* We can't tell until instantiation time whether we can use
9699 *this as the implicit object argument. */;
9702 if (complain
& tf_error
)
9703 error ("cannot call member function %qD without object",
9705 call
= error_mark_node
;
9709 if (call
!= error_mark_node
)
9711 /* Optimize away vtable lookup if we know that this
9712 function can't be overridden. We need to check if
9713 the context and the type where we found fn are the same,
9714 actually FN might be defined in a different class
9715 type because of a using-declaration. In this case, we
9716 do not want to perform a non-virtual call. */
9717 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
9718 && same_type_ignoring_top_level_qualifiers_p
9719 (DECL_CONTEXT (fn
), BINFO_TYPE (binfo
))
9720 && resolves_to_fixed_type_p (instance
, 0))
9721 flags
|= LOOKUP_NONVIRTUAL
;
9723 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
9724 /* Now we know what function is being called. */
9727 /* Build the actual CALL_EXPR. */
9728 call
= build_over_call (cand
, flags
, complain
);
9729 /* In an expression of the form `a->f()' where `f' turns
9730 out to be a static member function, `a' is
9731 none-the-less evaluated. */
9732 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
9733 && !is_dummy_object (instance
)
9734 && TREE_SIDE_EFFECTS (instance
))
9736 /* But avoid the implicit lvalue-rvalue conversion when 'a'
9739 if (TREE_THIS_VOLATILE (a
))
9741 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
), a
, call
);
9743 else if (call
!= error_mark_node
9744 && DECL_DESTRUCTOR_P (cand
->fn
)
9745 && !VOID_TYPE_P (TREE_TYPE (call
)))
9746 /* An explicit call of the form "x->~X()" has type
9747 "void". However, on platforms where destructors
9748 return "this" (i.e., those where
9749 targetm.cxx.cdtor_returns_this is true), such calls
9750 will appear to have a return value of pointer type
9751 to the low-level call machinery. We do not want to
9752 change the low-level machinery, since we want to be
9753 able to optimize "delete f()" on such platforms as
9754 "operator delete(~X(f()))" (rather than generating
9755 "t = f(), ~X(t), operator delete (t)"). */
9756 call
= build_nop (void_type_node
, call
);
9761 if (processing_template_decl
&& call
!= error_mark_node
)
9763 bool cast_to_void
= false;
9765 if (TREE_CODE (call
) == COMPOUND_EXPR
)
9766 call
= TREE_OPERAND (call
, 1);
9767 else if (TREE_CODE (call
) == NOP_EXPR
)
9769 cast_to_void
= true;
9770 call
= TREE_OPERAND (call
, 0);
9772 if (INDIRECT_REF_P (call
))
9773 call
= TREE_OPERAND (call
, 0);
9774 call
= (build_min_non_dep_call_vec
9776 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
9777 orig_instance
, orig_fns
, NULL_TREE
),
9779 SET_EXPR_LOCATION (call
, input_location
);
9780 call
= convert_from_reference (call
);
9782 call
= build_nop (void_type_node
, call
);
9785 /* Free all the conversions we allocated. */
9786 obstack_free (&conversion_obstack
, p
);
9788 if (orig_args
!= NULL
)
9789 release_tree_vector (orig_args
);
9794 /* Wrapper for above. */
9797 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9798 tree conversion_path
, int flags
,
9799 tree
*fn_p
, tsubst_flags_t complain
)
9802 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
9803 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
9805 timevar_cond_stop (TV_OVERLOAD
, subtime
);
9809 /* Returns true iff standard conversion sequence ICS1 is a proper
9810 subsequence of ICS2. */
9813 is_subseq (conversion
*ics1
, conversion
*ics2
)
9815 /* We can assume that a conversion of the same code
9816 between the same types indicates a subsequence since we only get
9817 here if the types we are converting from are the same. */
9819 while (ics1
->kind
== ck_rvalue
9820 || ics1
->kind
== ck_lvalue
)
9821 ics1
= next_conversion (ics1
);
9825 while (ics2
->kind
== ck_rvalue
9826 || ics2
->kind
== ck_lvalue
)
9827 ics2
= next_conversion (ics2
);
9829 if (ics2
->kind
== ck_user
9830 || ics2
->kind
== ck_ambig
9831 || ics2
->kind
== ck_aggr
9832 || ics2
->kind
== ck_list
9833 || ics2
->kind
== ck_identity
)
9834 /* At this point, ICS1 cannot be a proper subsequence of
9835 ICS2. We can get a USER_CONV when we are comparing the
9836 second standard conversion sequence of two user conversion
9840 ics2
= next_conversion (ics2
);
9842 while (ics2
->kind
== ck_rvalue
9843 || ics2
->kind
== ck_lvalue
)
9844 ics2
= next_conversion (ics2
);
9846 if (ics2
->kind
== ics1
->kind
9847 && same_type_p (ics2
->type
, ics1
->type
)
9848 && (ics1
->kind
== ck_identity
9849 || same_type_p (next_conversion (ics2
)->type
,
9850 next_conversion (ics1
)->type
)))
9855 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
9856 be any _TYPE nodes. */
9859 is_properly_derived_from (tree derived
, tree base
)
9861 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
9864 /* We only allow proper derivation here. The DERIVED_FROM_P macro
9865 considers every class derived from itself. */
9866 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
9867 && DERIVED_FROM_P (base
, derived
));
9870 /* We build the ICS for an implicit object parameter as a pointer
9871 conversion sequence. However, such a sequence should be compared
9872 as if it were a reference conversion sequence. If ICS is the
9873 implicit conversion sequence for an implicit object parameter,
9874 modify it accordingly. */
9877 maybe_handle_implicit_object (conversion
**ics
)
9881 /* [over.match.funcs]
9883 For non-static member functions, the type of the
9884 implicit object parameter is "reference to cv X"
9885 where X is the class of which the function is a
9886 member and cv is the cv-qualification on the member
9887 function declaration. */
9888 conversion
*t
= *ics
;
9889 tree reference_type
;
9891 /* The `this' parameter is a pointer to a class type. Make the
9892 implicit conversion talk about a reference to that same class
9894 reference_type
= TREE_TYPE (t
->type
);
9895 reference_type
= build_reference_type (reference_type
);
9897 if (t
->kind
== ck_qual
)
9898 t
= next_conversion (t
);
9899 if (t
->kind
== ck_ptr
)
9900 t
= next_conversion (t
);
9901 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
9902 t
= direct_reference_binding (reference_type
, t
);
9904 t
->rvaluedness_matches_p
= 0;
9909 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
9910 and return the initial reference binding conversion. Otherwise,
9911 leave *ICS unchanged and return NULL. */
9914 maybe_handle_ref_bind (conversion
**ics
)
9916 if ((*ics
)->kind
== ck_ref_bind
)
9918 conversion
*old_ics
= *ics
;
9919 *ics
= next_conversion (old_ics
);
9920 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
9927 /* Compare two implicit conversion sequences according to the rules set out in
9928 [over.ics.rank]. Return values:
9930 1: ics1 is better than ics2
9931 -1: ics2 is better than ics1
9932 0: ics1 and ics2 are indistinguishable */
9935 compare_ics (conversion
*ics1
, conversion
*ics2
)
9941 tree deref_from_type1
= NULL_TREE
;
9942 tree deref_from_type2
= NULL_TREE
;
9943 tree deref_to_type1
= NULL_TREE
;
9944 tree deref_to_type2
= NULL_TREE
;
9945 conversion_rank rank1
, rank2
;
9947 /* REF_BINDING is nonzero if the result of the conversion sequence
9948 is a reference type. In that case REF_CONV is the reference
9949 binding conversion. */
9950 conversion
*ref_conv1
;
9951 conversion
*ref_conv2
;
9953 /* Compare badness before stripping the reference conversion. */
9954 if (ics1
->bad_p
> ics2
->bad_p
)
9956 else if (ics1
->bad_p
< ics2
->bad_p
)
9959 /* Handle implicit object parameters. */
9960 maybe_handle_implicit_object (&ics1
);
9961 maybe_handle_implicit_object (&ics2
);
9963 /* Handle reference parameters. */
9964 ref_conv1
= maybe_handle_ref_bind (&ics1
);
9965 ref_conv2
= maybe_handle_ref_bind (&ics2
);
9967 /* List-initialization sequence L1 is a better conversion sequence than
9968 list-initialization sequence L2 if L1 converts to
9969 std::initializer_list<X> for some X and L2 does not. */
9970 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
9972 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
9977 When comparing the basic forms of implicit conversion sequences (as
9978 defined in _over.best.ics_)
9980 --a standard conversion sequence (_over.ics.scs_) is a better
9981 conversion sequence than a user-defined conversion sequence
9982 or an ellipsis conversion sequence, and
9984 --a user-defined conversion sequence (_over.ics.user_) is a
9985 better conversion sequence than an ellipsis conversion sequence
9986 (_over.ics.ellipsis_). */
9987 /* Use BAD_CONVERSION_RANK because we already checked for a badness
9988 mismatch. If both ICS are bad, we try to make a decision based on
9989 what would have happened if they'd been good. This is not an
9990 extension, we'll still give an error when we build up the call; this
9991 just helps us give a more helpful error message. */
9992 rank1
= BAD_CONVERSION_RANK (ics1
);
9993 rank2
= BAD_CONVERSION_RANK (ics2
);
9997 else if (rank1
< rank2
)
10000 if (ics1
->ellipsis_p
)
10001 /* Both conversions are ellipsis conversions. */
10004 /* User-defined conversion sequence U1 is a better conversion sequence
10005 than another user-defined conversion sequence U2 if they contain the
10006 same user-defined conversion operator or constructor and if the sec-
10007 ond standard conversion sequence of U1 is better than the second
10008 standard conversion sequence of U2. */
10010 /* Handle list-conversion with the same code even though it isn't always
10011 ranked as a user-defined conversion and it doesn't have a second
10012 standard conversion sequence; it will still have the desired effect.
10013 Specifically, we need to do the reference binding comparison at the
10014 end of this function. */
10016 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
|| ics1
->kind
== ck_aggr
)
10021 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
10022 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
10023 || t1
->kind
== ck_list
)
10025 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
10026 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
10027 || t2
->kind
== ck_list
)
10030 if (t1
->kind
!= t2
->kind
)
10032 else if (t1
->kind
== ck_user
)
10034 tree f1
= t1
->cand
? t1
->cand
->fn
: t1
->type
;
10035 tree f2
= t2
->cand
? t2
->cand
->fn
: t2
->type
;
10041 /* For ambiguous or aggregate conversions, use the target type as
10042 a proxy for the conversion function. */
10043 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
10047 /* We can just fall through here, after setting up
10048 FROM_TYPE1 and FROM_TYPE2. */
10049 from_type1
= t1
->type
;
10050 from_type2
= t2
->type
;
10057 /* We're dealing with two standard conversion sequences.
10061 Standard conversion sequence S1 is a better conversion
10062 sequence than standard conversion sequence S2 if
10064 --S1 is a proper subsequence of S2 (comparing the conversion
10065 sequences in the canonical form defined by _over.ics.scs_,
10066 excluding any Lvalue Transformation; the identity
10067 conversion sequence is considered to be a subsequence of
10068 any non-identity conversion sequence */
10071 while (t1
->kind
!= ck_identity
)
10072 t1
= next_conversion (t1
);
10073 from_type1
= t1
->type
;
10076 while (t2
->kind
!= ck_identity
)
10077 t2
= next_conversion (t2
);
10078 from_type2
= t2
->type
;
10081 /* One sequence can only be a subsequence of the other if they start with
10082 the same type. They can start with different types when comparing the
10083 second standard conversion sequence in two user-defined conversion
10085 if (same_type_p (from_type1
, from_type2
))
10087 if (is_subseq (ics1
, ics2
))
10089 if (is_subseq (ics2
, ics1
))
10097 --the rank of S1 is better than the rank of S2 (by the rules
10100 Standard conversion sequences are ordered by their ranks: an Exact
10101 Match is a better conversion than a Promotion, which is a better
10102 conversion than a Conversion.
10104 Two conversion sequences with the same rank are indistinguishable
10105 unless one of the following rules applies:
10107 --A conversion that does not a convert a pointer, pointer to member,
10108 or std::nullptr_t to bool is better than one that does.
10110 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
10111 so that we do not have to check it explicitly. */
10112 if (ics1
->rank
< ics2
->rank
)
10114 else if (ics2
->rank
< ics1
->rank
)
10117 to_type1
= ics1
->type
;
10118 to_type2
= ics2
->type
;
10120 /* A conversion from scalar arithmetic type to complex is worse than a
10121 conversion between scalar arithmetic types. */
10122 if (same_type_p (from_type1
, from_type2
)
10123 && ARITHMETIC_TYPE_P (from_type1
)
10124 && ARITHMETIC_TYPE_P (to_type1
)
10125 && ARITHMETIC_TYPE_P (to_type2
)
10126 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
10127 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
10129 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
10135 if (TYPE_PTR_P (from_type1
)
10136 && TYPE_PTR_P (from_type2
)
10137 && TYPE_PTR_P (to_type1
)
10138 && TYPE_PTR_P (to_type2
))
10140 deref_from_type1
= TREE_TYPE (from_type1
);
10141 deref_from_type2
= TREE_TYPE (from_type2
);
10142 deref_to_type1
= TREE_TYPE (to_type1
);
10143 deref_to_type2
= TREE_TYPE (to_type2
);
10145 /* The rules for pointers to members A::* are just like the rules
10146 for pointers A*, except opposite: if B is derived from A then
10147 A::* converts to B::*, not vice versa. For that reason, we
10148 switch the from_ and to_ variables here. */
10149 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
10150 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
10151 || (TYPE_PTRMEMFUNC_P (from_type1
)
10152 && TYPE_PTRMEMFUNC_P (from_type2
)
10153 && TYPE_PTRMEMFUNC_P (to_type1
)
10154 && TYPE_PTRMEMFUNC_P (to_type2
)))
10156 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
10157 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
10158 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
10159 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
10162 if (deref_from_type1
!= NULL_TREE
10163 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
10164 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
10166 /* This was one of the pointer or pointer-like conversions.
10170 --If class B is derived directly or indirectly from class A,
10171 conversion of B* to A* is better than conversion of B* to
10172 void*, and conversion of A* to void* is better than
10173 conversion of B* to void*. */
10174 if (VOID_TYPE_P (deref_to_type1
)
10175 && VOID_TYPE_P (deref_to_type2
))
10177 if (is_properly_derived_from (deref_from_type1
,
10180 else if (is_properly_derived_from (deref_from_type2
,
10184 else if (VOID_TYPE_P (deref_to_type1
)
10185 || VOID_TYPE_P (deref_to_type2
))
10187 if (same_type_p (deref_from_type1
, deref_from_type2
))
10189 if (VOID_TYPE_P (deref_to_type2
))
10191 if (is_properly_derived_from (deref_from_type1
,
10195 /* We know that DEREF_TO_TYPE1 is `void' here. */
10196 else if (is_properly_derived_from (deref_from_type1
,
10201 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
10202 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
10206 --If class B is derived directly or indirectly from class A
10207 and class C is derived directly or indirectly from B,
10209 --conversion of C* to B* is better than conversion of C* to
10212 --conversion of B* to A* is better than conversion of C* to
10214 if (same_type_p (deref_from_type1
, deref_from_type2
))
10216 if (is_properly_derived_from (deref_to_type1
,
10219 else if (is_properly_derived_from (deref_to_type2
,
10223 else if (same_type_p (deref_to_type1
, deref_to_type2
))
10225 if (is_properly_derived_from (deref_from_type2
,
10228 else if (is_properly_derived_from (deref_from_type1
,
10234 else if (CLASS_TYPE_P (non_reference (from_type1
))
10235 && same_type_p (from_type1
, from_type2
))
10237 tree from
= non_reference (from_type1
);
10241 --binding of an expression of type C to a reference of type
10242 B& is better than binding an expression of type C to a
10243 reference of type A&
10245 --conversion of C to B is better than conversion of C to A, */
10246 if (is_properly_derived_from (from
, to_type1
)
10247 && is_properly_derived_from (from
, to_type2
))
10249 if (is_properly_derived_from (to_type1
, to_type2
))
10251 else if (is_properly_derived_from (to_type2
, to_type1
))
10255 else if (CLASS_TYPE_P (non_reference (to_type1
))
10256 && same_type_p (to_type1
, to_type2
))
10258 tree to
= non_reference (to_type1
);
10262 --binding of an expression of type B to a reference of type
10263 A& is better than binding an expression of type C to a
10264 reference of type A&,
10266 --conversion of B to A is better than conversion of C to A */
10267 if (is_properly_derived_from (from_type1
, to
)
10268 && is_properly_derived_from (from_type2
, to
))
10270 if (is_properly_derived_from (from_type2
, from_type1
))
10272 else if (is_properly_derived_from (from_type1
, from_type2
))
10279 --S1 and S2 differ only in their qualification conversion and yield
10280 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
10281 qualification signature of type T1 is a proper subset of the cv-
10282 qualification signature of type T2 */
10283 if (ics1
->kind
== ck_qual
10284 && ics2
->kind
== ck_qual
10285 && same_type_p (from_type1
, from_type2
))
10287 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
10294 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
10295 to an implicit object parameter of a non-static member function
10296 declared without a ref-qualifier, and either S1 binds an lvalue
10297 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
10298 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
10299 draft standard, 13.3.3.2)
10301 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
10302 types to which the references refer are the same type except for
10303 top-level cv-qualifiers, and the type to which the reference
10304 initialized by S2 refers is more cv-qualified than the type to
10305 which the reference initialized by S1 refers.
10307 DR 1328 [over.match.best]: the context is an initialization by
10308 conversion function for direct reference binding (13.3.1.6) of a
10309 reference to function type, the return type of F1 is the same kind of
10310 reference (i.e. lvalue or rvalue) as the reference being initialized,
10311 and the return type of F2 is not. */
10313 if (ref_conv1
&& ref_conv2
)
10315 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
10316 && (ref_conv1
->rvaluedness_matches_p
10317 != ref_conv2
->rvaluedness_matches_p
)
10318 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
10319 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
10320 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
10322 if (ref_conv1
->bad_p
10323 && !same_type_p (TREE_TYPE (ref_conv1
->type
),
10324 TREE_TYPE (ref_conv2
->type
)))
10325 /* Don't prefer a bad conversion that drops cv-quals to a bad
10326 conversion with the wrong rvalueness. */
10328 return (ref_conv1
->rvaluedness_matches_p
10329 - ref_conv2
->rvaluedness_matches_p
);
10332 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
10334 int q1
= cp_type_quals (TREE_TYPE (ref_conv1
->type
));
10335 int q2
= cp_type_quals (TREE_TYPE (ref_conv2
->type
));
10336 if (ref_conv1
->bad_p
)
10338 /* Prefer the one that drops fewer cv-quals. */
10339 tree ftype
= next_conversion (ref_conv1
)->type
;
10340 int fquals
= cp_type_quals (ftype
);
10344 return comp_cv_qualification (q2
, q1
);
10348 /* Neither conversion sequence is better than the other. */
10352 /* The source type for this standard conversion sequence. */
10355 source_type (conversion
*t
)
10357 for (;; t
= next_conversion (t
))
10359 if (t
->kind
== ck_user
10360 || t
->kind
== ck_ambig
10361 || t
->kind
== ck_identity
)
10364 gcc_unreachable ();
10367 /* Note a warning about preferring WINNER to LOSER. We do this by storing
10368 a pointer to LOSER and re-running joust to produce the warning if WINNER
10369 is actually used. */
10372 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
10374 candidate_warning
*cw
= (candidate_warning
*)
10375 conversion_obstack_alloc (sizeof (candidate_warning
));
10377 cw
->next
= winner
->warnings
;
10378 winner
->warnings
= cw
;
10381 /* Compare two candidates for overloading as described in
10382 [over.match.best]. Return values:
10384 1: cand1 is better than cand2
10385 -1: cand2 is better than cand1
10386 0: cand1 and cand2 are indistinguishable */
10389 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
10390 tsubst_flags_t complain
)
10393 int off1
= 0, off2
= 0;
10397 /* Candidates that involve bad conversions are always worse than those
10399 if (cand1
->viable
> cand2
->viable
)
10401 if (cand1
->viable
< cand2
->viable
)
10404 /* If we have two pseudo-candidates for conversions to the same type,
10405 or two candidates for the same function, arbitrarily pick one. */
10406 if (cand1
->fn
== cand2
->fn
10407 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
10410 /* Prefer a non-deleted function over an implicitly deleted move
10411 constructor or assignment operator. This differs slightly from the
10412 wording for issue 1402 (which says the move op is ignored by overload
10413 resolution), but this way produces better error messages. */
10414 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
10415 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
10416 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
10418 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
10419 && move_fn_p (cand1
->fn
))
10421 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
10422 && move_fn_p (cand2
->fn
))
10426 /* a viable function F1
10427 is defined to be a better function than another viable function F2 if
10428 for all arguments i, ICSi(F1) is not a worse conversion sequence than
10429 ICSi(F2), and then */
10431 /* for some argument j, ICSj(F1) is a better conversion sequence than
10434 /* For comparing static and non-static member functions, we ignore
10435 the implicit object parameter of the non-static function. The
10436 standard says to pretend that the static function has an object
10437 parm, but that won't work with operator overloading. */
10438 len
= cand1
->num_convs
;
10439 if (len
!= cand2
->num_convs
)
10441 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
10442 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
10444 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
10445 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
10446 /* We're comparing a near-match list constructor and a near-match
10447 non-list constructor. Just treat them as unordered. */
10450 gcc_assert (static_1
!= static_2
);
10461 for (i
= 0; i
< len
; ++i
)
10463 conversion
*t1
= cand1
->convs
[i
+ off1
];
10464 conversion
*t2
= cand2
->convs
[i
+ off2
];
10465 int comp
= compare_ics (t1
, t2
);
10469 if ((complain
& tf_warning
)
10471 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
10472 == cr_std
+ cr_promotion
)
10473 && t1
->kind
== ck_std
10474 && t2
->kind
== ck_std
10475 && TREE_CODE (t1
->type
) == INTEGER_TYPE
10476 && TREE_CODE (t2
->type
) == INTEGER_TYPE
10477 && (TYPE_PRECISION (t1
->type
)
10478 == TYPE_PRECISION (t2
->type
))
10479 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
10480 || (TREE_CODE (next_conversion (t1
)->type
)
10481 == ENUMERAL_TYPE
)))
10483 tree type
= next_conversion (t1
)->type
;
10485 struct z_candidate
*w
, *l
;
10487 type1
= t1
->type
, type2
= t2
->type
,
10488 w
= cand1
, l
= cand2
;
10490 type1
= t2
->type
, type2
= t1
->type
,
10491 w
= cand2
, l
= cand1
;
10495 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
10496 type
, type1
, type2
);
10497 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
10500 add_warning (w
, l
);
10503 if (winner
&& comp
!= winner
)
10512 /* warn about confusing overload resolution for user-defined conversions,
10513 either between a constructor and a conversion op, or between two
10515 if ((complain
& tf_warning
)
10516 && winner
&& warn_conversion
&& cand1
->second_conv
10517 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
10518 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
10520 struct z_candidate
*w
, *l
;
10521 bool give_warning
= false;
10524 w
= cand1
, l
= cand2
;
10526 w
= cand2
, l
= cand1
;
10528 /* We don't want to complain about `X::operator T1 ()'
10529 beating `X::operator T2 () const', when T2 is a no less
10530 cv-qualified version of T1. */
10531 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
10532 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
10534 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
10535 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
10537 if (TREE_CODE (t
) == TREE_CODE (f
) && INDIRECT_TYPE_P (t
))
10542 if (!comp_ptr_ttypes (t
, f
))
10543 give_warning
= true;
10546 give_warning
= true;
10552 tree source
= source_type (w
->convs
[0]);
10553 if (INDIRECT_TYPE_P (source
))
10554 source
= TREE_TYPE (source
);
10555 auto_diagnostic_group d
;
10556 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
10557 && warning (OPT_Wconversion
, " for conversion from %qH to %qI",
10558 source
, w
->second_conv
->type
))
10560 inform (input_location
, " because conversion sequence for the argument is better");
10564 add_warning (w
, l
);
10570 /* DR 495 moved this tiebreaker above the template ones. */
10571 /* or, if not that,
10572 the context is an initialization by user-defined conversion (see
10573 _dcl.init_ and _over.match.user_) and the standard conversion
10574 sequence from the return type of F1 to the destination type (i.e.,
10575 the type of the entity being initialized) is a better conversion
10576 sequence than the standard conversion sequence from the return type
10577 of F2 to the destination type. */
10579 if (cand1
->second_conv
)
10581 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
10586 /* or, if not that,
10587 F1 is a non-template function and F2 is a template function
10590 if (!cand1
->template_decl
&& cand2
->template_decl
)
10592 else if (cand1
->template_decl
&& !cand2
->template_decl
)
10595 /* or, if not that,
10596 F1 and F2 are template functions and the function template for F1 is
10597 more specialized than the template for F2 according to the partial
10600 if (cand1
->template_decl
&& cand2
->template_decl
)
10602 winner
= more_specialized_fn
10603 (TI_TEMPLATE (cand1
->template_decl
),
10604 TI_TEMPLATE (cand2
->template_decl
),
10605 /* [temp.func.order]: The presence of unused ellipsis and default
10606 arguments has no effect on the partial ordering of function
10607 templates. add_function_candidate() will not have
10608 counted the "this" argument for constructors. */
10609 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
10615 // or, if not that, F1 is more constrained than F2.
10616 if (flag_concepts
&& DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
))
10618 winner
= more_constrained (cand1
->fn
, cand2
->fn
);
10623 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
10624 if (deduction_guide_p (cand1
->fn
))
10626 gcc_assert (deduction_guide_p (cand2
->fn
));
10627 /* We distinguish between candidates from an explicit deduction guide and
10628 candidates built from a constructor based on DECL_ARTIFICIAL. */
10629 int art1
= DECL_ARTIFICIAL (cand1
->fn
);
10630 int art2
= DECL_ARTIFICIAL (cand2
->fn
);
10632 return art2
- art1
;
10636 /* Prefer the special copy guide over a declared copy/move
10638 if (copy_guide_p (cand1
->fn
))
10640 if (copy_guide_p (cand2
->fn
))
10643 /* Prefer a candidate generated from a non-template constructor. */
10644 int tg1
= template_guide_p (cand1
->fn
);
10645 int tg2
= template_guide_p (cand2
->fn
);
10651 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
10652 for all arguments the corresponding parameters of F1 and F2 have the same
10653 type (CWG 2273/2277). */
10654 if (DECL_P (cand1
->fn
) && DECL_CLASS_SCOPE_P (cand1
->fn
)
10655 && !DECL_CONV_FN_P (cand1
->fn
)
10656 && DECL_P (cand2
->fn
) && DECL_CLASS_SCOPE_P (cand2
->fn
)
10657 && !DECL_CONV_FN_P (cand2
->fn
))
10659 tree base1
= DECL_CONTEXT (strip_inheriting_ctors (cand1
->fn
));
10660 tree base2
= DECL_CONTEXT (strip_inheriting_ctors (cand2
->fn
));
10662 bool used1
= false;
10663 bool used2
= false;
10664 if (base1
== base2
)
10665 /* No difference. */;
10666 else if (DERIVED_FROM_P (base1
, base2
))
10668 else if (DERIVED_FROM_P (base2
, base1
))
10671 if (int diff
= used2
- used1
)
10673 for (i
= 0; i
< len
; ++i
)
10675 conversion
*t1
= cand1
->convs
[i
+ off1
];
10676 conversion
*t2
= cand2
->convs
[i
+ off2
];
10677 if (!same_type_p (t1
->type
, t2
->type
))
10685 /* Check whether we can discard a builtin candidate, either because we
10686 have two identical ones or matching builtin and non-builtin candidates.
10688 (Pedantically in the latter case the builtin which matched the user
10689 function should not be added to the overload set, but we spot it here.
10692 ... the builtin candidates include ...
10693 - do not have the same parameter type list as any non-template
10694 non-member candidate. */
10696 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
10698 for (i
= 0; i
< len
; ++i
)
10699 if (!same_type_p (cand1
->convs
[i
]->type
,
10700 cand2
->convs
[i
]->type
))
10702 if (i
== cand1
->num_convs
)
10704 if (cand1
->fn
== cand2
->fn
)
10705 /* Two built-in candidates; arbitrarily pick one. */
10707 else if (identifier_p (cand1
->fn
))
10708 /* cand1 is built-in; prefer cand2. */
10711 /* cand2 is built-in; prefer cand1. */
10716 /* For candidates of a multi-versioned function, make the version with
10717 the highest priority win. This version will be checked for dispatching
10718 first. If this version can be inlined into the caller, the front-end
10719 will simply make a direct call to this function. */
10721 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
10722 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
10723 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
10724 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
10726 tree f1
= TREE_TYPE (cand1
->fn
);
10727 tree f2
= TREE_TYPE (cand2
->fn
);
10728 tree p1
= TYPE_ARG_TYPES (f1
);
10729 tree p2
= TYPE_ARG_TYPES (f2
);
10731 /* Check if cand1->fn and cand2->fn are versions of the same function. It
10732 is possible that cand1->fn and cand2->fn are function versions but of
10733 different functions. Check types to see if they are versions of the same
10735 if (compparms (p1
, p2
)
10736 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
10738 /* Always make the version with the higher priority, more
10739 specialized, win. */
10740 gcc_assert (targetm
.compare_version_priority
);
10741 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
10748 /* If the two function declarations represent the same function (this can
10749 happen with declarations in multiple scopes and arg-dependent lookup),
10750 arbitrarily choose one. But first make sure the default args we're
10752 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
10753 && equal_functions (cand1
->fn
, cand2
->fn
))
10755 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
10756 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
10758 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
10760 for (i
= 0; i
< len
; ++i
)
10762 /* Don't crash if the fn is variadic. */
10765 parms1
= TREE_CHAIN (parms1
);
10766 parms2
= TREE_CHAIN (parms2
);
10770 parms1
= TREE_CHAIN (parms1
);
10772 parms2
= TREE_CHAIN (parms2
);
10774 for (; parms1
; ++i
)
10776 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
10777 TREE_PURPOSE (parms2
)))
10781 if (complain
& tf_error
)
10783 auto_diagnostic_group d
;
10784 if (permerror (input_location
,
10785 "default argument mismatch in "
10786 "overload resolution"))
10788 inform (DECL_SOURCE_LOCATION (cand1
->fn
),
10789 " candidate 1: %q#F", cand1
->fn
);
10790 inform (DECL_SOURCE_LOCATION (cand2
->fn
),
10791 " candidate 2: %q#F", cand2
->fn
);
10798 add_warning (cand1
, cand2
);
10801 parms1
= TREE_CHAIN (parms1
);
10802 parms2
= TREE_CHAIN (parms2
);
10810 /* Extension: If the worst conversion for one candidate is worse than the
10811 worst conversion for the other, take the first. */
10812 if (!pedantic
&& (complain
& tf_warning_or_error
))
10814 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
10815 struct z_candidate
*w
= 0, *l
= 0;
10817 for (i
= 0; i
< len
; ++i
)
10819 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
10820 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
10821 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
10822 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
10825 winner
= 1, w
= cand1
, l
= cand2
;
10827 winner
= -1, w
= cand2
, l
= cand1
;
10830 /* Don't choose a deleted function over ambiguity. */
10831 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
10835 auto_diagnostic_group d
;
10836 pedwarn (input_location
, 0,
10837 "ISO C++ says that these are ambiguous, even "
10838 "though the worst conversion for the first is better than "
10839 "the worst conversion for the second:");
10840 print_z_candidate (input_location
, _("candidate 1:"), w
);
10841 print_z_candidate (input_location
, _("candidate 2:"), l
);
10844 add_warning (w
, l
);
10849 gcc_assert (!winner
);
10853 /* Given a list of candidates for overloading, find the best one, if any.
10854 This algorithm has a worst case of O(2n) (winner is last), and a best
10855 case of O(n/2) (totally ambiguous); much better than a sorting
10858 static struct z_candidate
*
10859 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
10861 struct z_candidate
*champ
= candidates
, *challenger
;
10863 int champ_compared_to_predecessor
= 0;
10865 /* Walk through the list once, comparing each current champ to the next
10866 candidate, knocking out a candidate or two with each comparison. */
10868 for (challenger
= champ
->next
; challenger
; )
10870 fate
= joust (champ
, challenger
, 0, complain
);
10872 challenger
= challenger
->next
;
10877 champ
= challenger
->next
;
10880 champ_compared_to_predecessor
= 0;
10884 champ
= challenger
;
10885 champ_compared_to_predecessor
= 1;
10888 challenger
= champ
->next
;
10892 /* Make sure the champ is better than all the candidates it hasn't yet
10893 been compared to. */
10895 for (challenger
= candidates
;
10896 challenger
!= champ
10897 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
10898 challenger
= challenger
->next
)
10900 fate
= joust (champ
, challenger
, 0, complain
);
10908 /* Returns nonzero if things of type FROM can be converted to TO. */
10911 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
10913 tree arg
= NULL_TREE
;
10914 /* implicit_conversion only considers user-defined conversions
10915 if it has an expression for the call argument list. */
10916 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
10917 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
10918 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
10921 /* Returns nonzero if things of type FROM can be converted to TO with a
10922 standard conversion. */
10925 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
10927 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
10930 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
10933 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
10934 tsubst_flags_t complain
)
10940 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10941 p
= conversion_obstack_alloc (0);
10942 /* We want to discard any access checks done for this test,
10943 as we might not be in the appropriate access context and
10944 we'll do the check again when we actually perform the
10946 push_deferring_access_checks (dk_deferred
);
10948 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10950 ok_p
= (t
&& !t
->bad_p
);
10952 /* Discard the access checks now. */
10953 pop_deferring_access_checks ();
10954 /* Free all the conversions we allocated. */
10955 obstack_free (&conversion_obstack
, p
);
10960 /* Like can_convert_arg, but allows dubious conversions as well. */
10963 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
10964 tsubst_flags_t complain
)
10969 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10970 p
= conversion_obstack_alloc (0);
10971 /* Try to perform the conversion. */
10972 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10974 /* Free all the conversions we allocated. */
10975 obstack_free (&conversion_obstack
, p
);
10980 /* Convert EXPR to TYPE. Return the converted expression.
10982 Note that we allow bad conversions here because by the time we get to
10983 this point we are committed to doing the conversion. If we end up
10984 doing a bad conversion, convert_like will complain. */
10987 perform_implicit_conversion_flags (tree type
, tree expr
,
10988 tsubst_flags_t complain
, int flags
)
10992 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
10994 if (TYPE_REF_P (type
))
10995 expr
= mark_lvalue_use (expr
);
10997 expr
= mark_rvalue_use (expr
);
10999 if (error_operand_p (expr
))
11000 return error_mark_node
;
11002 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11003 p
= conversion_obstack_alloc (0);
11005 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
11006 /*c_cast_p=*/false,
11011 if (complain
& tf_error
)
11013 /* If expr has unknown type, then it is an overloaded function.
11014 Call instantiate_type to get good error messages. */
11015 if (TREE_TYPE (expr
) == unknown_type_node
)
11016 instantiate_type (type
, expr
, complain
);
11017 else if (invalid_nonstatic_memfn_p (loc
, expr
, complain
))
11018 /* We gave an error. */;
11021 range_label_for_type_mismatch
label (TREE_TYPE (expr
), type
);
11022 gcc_rich_location
rich_loc (loc
, &label
);
11023 error_at (&rich_loc
, "could not convert %qE from %qH to %qI",
11024 expr
, TREE_TYPE (expr
), type
);
11027 expr
= error_mark_node
;
11029 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
11031 /* In a template, we are only concerned about determining the
11032 type of non-dependent expressions, so we do not have to
11033 perform the actual conversion. But for initializers, we
11034 need to be able to perform it at instantiation
11035 (or instantiate_non_dependent_expr) time. */
11036 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
11037 if (!(flags
& LOOKUP_ONLYCONVERTING
))
11038 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
11039 if (flags
& LOOKUP_NO_NARROWING
)
11040 IMPLICIT_CONV_EXPR_BRACED_INIT (expr
) = true;
11043 expr
= convert_like (conv
, expr
, complain
);
11045 /* Free all the conversions we allocated. */
11046 obstack_free (&conversion_obstack
, p
);
11052 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
11054 return perform_implicit_conversion_flags (type
, expr
, complain
,
11058 /* Convert EXPR to TYPE (as a direct-initialization) if that is
11059 permitted. If the conversion is valid, the converted expression is
11060 returned. Otherwise, NULL_TREE is returned, except in the case
11061 that TYPE is a class type; in that case, an error is issued. If
11062 C_CAST_P is true, then this direct-initialization is taking
11063 place as part of a static_cast being attempted as part of a C-style
11067 perform_direct_initialization_if_possible (tree type
,
11070 tsubst_flags_t complain
)
11075 if (type
== error_mark_node
|| error_operand_p (expr
))
11076 return error_mark_node
;
11079 If the destination type is a (possibly cv-qualified) class type:
11081 -- If the initialization is direct-initialization ...,
11082 constructors are considered. ... If no constructor applies, or
11083 the overload resolution is ambiguous, the initialization is
11085 if (CLASS_TYPE_P (type
))
11087 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
11088 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
11089 &args
, type
, LOOKUP_NORMAL
, complain
);
11090 release_tree_vector (args
);
11091 return build_cplus_new (type
, expr
, complain
);
11094 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11095 p
= conversion_obstack_alloc (0);
11097 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
11099 LOOKUP_NORMAL
, complain
);
11100 if (!conv
|| conv
->bad_p
)
11102 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
11104 /* In a template, we are only concerned about determining the
11105 type of non-dependent expressions, so we do not have to
11106 perform the actual conversion. But for initializers, we
11107 need to be able to perform it at instantiation
11108 (or instantiate_non_dependent_expr) time. */
11109 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
11110 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
11113 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0,
11114 /*issue_conversion_warnings=*/false,
11118 /* Free all the conversions we allocated. */
11119 obstack_free (&conversion_obstack
, p
);
11124 /* When initializing a reference that lasts longer than a full-expression,
11125 this special rule applies:
11129 The temporary to which the reference is bound or the temporary
11130 that is the complete object to which the reference is bound
11131 persists for the lifetime of the reference.
11133 The temporaries created during the evaluation of the expression
11134 initializing the reference, except the temporary to which the
11135 reference is bound, are destroyed at the end of the
11136 full-expression in which they are created.
11138 In that case, we store the converted expression into a new
11139 VAR_DECL in a new scope.
11141 However, we want to be careful not to create temporaries when
11142 they are not required. For example, given:
11145 struct D : public B {};
11149 there is no need to copy the return value from "f"; we can just
11150 extend its lifetime. Similarly, given:
11153 struct T { operator S(); };
11157 we can extend the lifetime of the return value of the conversion
11160 The next several functions are involved in this lifetime extension. */
11162 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
11163 reference is being bound to a temporary. Create and return a new
11164 VAR_DECL with the indicated TYPE; this variable will store the value to
11165 which the reference is bound. */
11168 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
11170 tree var
= create_temporary_var (type
);
11172 /* Register the variable. */
11174 && (TREE_STATIC (decl
) || CP_DECL_THREAD_LOCAL_P (decl
)))
11176 /* Namespace-scope or local static; give it a mangled name. */
11177 /* FIXME share comdat with decl? */
11179 TREE_STATIC (var
) = TREE_STATIC (decl
);
11180 CP_DECL_THREAD_LOCAL_P (var
) = CP_DECL_THREAD_LOCAL_P (decl
);
11181 set_decl_tls_model (var
, DECL_TLS_MODEL (decl
));
11183 tree name
= mangle_ref_init_variable (decl
);
11184 DECL_NAME (var
) = name
;
11185 SET_DECL_ASSEMBLER_NAME (var
, name
);
11188 /* Create a new cleanup level if necessary. */
11189 maybe_push_cleanup_level (type
);
11191 return pushdecl (var
);
11194 /* EXPR is the initializer for a variable DECL of reference or
11195 std::initializer_list type. Create, push and return a new VAR_DECL
11196 for the initializer so that it will live as long as DECL. Any
11197 cleanup for the new variable is returned through CLEANUP, and the
11198 code to initialize the new variable is returned through INITP. */
11201 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
11208 /* Create the temporary variable. */
11209 type
= TREE_TYPE (expr
);
11210 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
11211 layout_decl (var
, 0);
11212 /* If the rvalue is the result of a function call it will be
11213 a TARGET_EXPR. If it is some other construct (such as a
11214 member access expression where the underlying object is
11215 itself the result of a function call), turn it into a
11216 TARGET_EXPR here. It is important that EXPR be a
11217 TARGET_EXPR below since otherwise the INIT_EXPR will
11218 attempt to make a bitwise copy of EXPR to initialize
11220 if (TREE_CODE (expr
) != TARGET_EXPR
)
11221 expr
= get_target_expr (expr
);
11223 if (TREE_CODE (decl
) == FIELD_DECL
11224 && extra_warnings
&& !TREE_NO_WARNING (decl
))
11226 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
11227 "until the constructor exits", decl
);
11228 TREE_NO_WARNING (decl
) = true;
11231 /* Recursively extend temps in this initializer. */
11232 TARGET_EXPR_INITIAL (expr
)
11233 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
11235 /* Any reference temp has a non-trivial initializer. */
11236 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
11238 /* If the initializer is constant, put it in DECL_INITIAL so we get
11239 static initialization and use in constant expressions. */
11240 init
= maybe_constant_init (expr
);
11241 /* As in store_init_value. */
11242 init
= cp_fully_fold (init
);
11243 if (TREE_CONSTANT (init
))
11245 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
11247 /* 5.19 says that a constant expression can include an
11248 lvalue-rvalue conversion applied to "a glvalue of literal type
11249 that refers to a non-volatile temporary object initialized
11250 with a constant expression". Rather than try to communicate
11251 that this VAR_DECL is a temporary, just mark it constexpr. */
11252 DECL_DECLARED_CONSTEXPR_P (var
) = true;
11253 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
11254 TREE_CONSTANT (var
) = true;
11255 TREE_READONLY (var
) = true;
11257 DECL_INITIAL (var
) = init
;
11261 /* Create the INIT_EXPR that will initialize the temporary
11263 init
= split_nonconstant_init (var
, expr
);
11264 if (at_function_scope_p ())
11266 add_decl_expr (var
);
11268 if (TREE_STATIC (var
))
11269 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
11272 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
11274 vec_safe_push (*cleanups
, cleanup
);
11277 /* We must be careful to destroy the temporary only
11278 after its initialization has taken place. If the
11279 initialization throws an exception, then the
11280 destructor should not be run. We cannot simply
11281 transform INIT into something like:
11283 (INIT, ({ CLEANUP_STMT; }))
11285 because emit_local_var always treats the
11286 initializer as a full-expression. Thus, the
11287 destructor would run too early; it would run at the
11288 end of initializing the reference variable, rather
11289 than at the end of the block enclosing the
11290 reference variable.
11292 The solution is to pass back a cleanup expression
11293 which the caller is responsible for attaching to
11294 the statement tree. */
11298 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
11299 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
11301 if (CP_DECL_THREAD_LOCAL_P (var
))
11302 tls_aggregates
= tree_cons (NULL_TREE
, var
,
11305 static_aggregates
= tree_cons (NULL_TREE
, var
,
11306 static_aggregates
);
11309 /* Check whether the dtor is callable. */
11310 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
11312 /* Avoid -Wunused-variable warning (c++/38958). */
11313 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
11315 TREE_USED (decl
) = DECL_READ_P (decl
) = true;
11321 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
11322 initializing a variable of that TYPE. */
11325 initialize_reference (tree type
, tree expr
,
11326 int flags
, tsubst_flags_t complain
)
11330 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
11332 if (type
== error_mark_node
|| error_operand_p (expr
))
11333 return error_mark_node
;
11335 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11336 p
= conversion_obstack_alloc (0);
11338 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
11340 if (!conv
|| conv
->bad_p
)
11342 if (complain
& tf_error
)
11345 convert_like (conv
, expr
, complain
);
11346 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
11347 && !TYPE_REF_IS_RVALUE (type
)
11348 && !lvalue_p (expr
))
11349 error_at (loc
, "invalid initialization of non-const reference of "
11350 "type %qH from an rvalue of type %qI",
11351 type
, TREE_TYPE (expr
));
11353 error_at (loc
, "invalid initialization of reference of type "
11354 "%qH from expression of type %qI", type
,
11357 return error_mark_node
;
11360 if (conv
->kind
== ck_ref_bind
)
11361 /* Perform the conversion. */
11362 expr
= convert_like (conv
, expr
, complain
);
11363 else if (conv
->kind
== ck_ambig
)
11364 /* We gave an error in build_user_type_conversion_1. */
11365 expr
= error_mark_node
;
11367 gcc_unreachable ();
11369 /* Free all the conversions we allocated. */
11370 obstack_free (&conversion_obstack
, p
);
11375 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
11376 which is bound either to a reference or a std::initializer_list. */
11379 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
11384 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
11386 TREE_OPERAND (sub
, 1)
11387 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
11390 if (TREE_CODE (sub
) != ADDR_EXPR
)
11392 /* Deal with binding to a subobject. */
11393 for (p
= &TREE_OPERAND (sub
, 0);
11394 (TREE_CODE (*p
) == COMPONENT_REF
11395 || TREE_CODE (*p
) == ARRAY_REF
); )
11396 p
= &TREE_OPERAND (*p
, 0);
11397 if (TREE_CODE (*p
) == TARGET_EXPR
)
11399 tree subinit
= NULL_TREE
;
11400 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
11401 recompute_tree_invariant_for_addr_expr (sub
);
11403 init
= fold_convert (TREE_TYPE (init
), sub
);
11405 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
11410 /* INIT is part of the initializer for DECL. If there are any
11411 reference or initializer lists being initialized, extend their
11412 lifetime to match that of DECL. */
11415 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
11417 tree type
= TREE_TYPE (init
);
11418 if (processing_template_decl
)
11420 if (TYPE_REF_P (type
))
11421 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
11425 if (TREE_CODE (ctor
) == TARGET_EXPR
)
11426 ctor
= TARGET_EXPR_INITIAL (ctor
);
11427 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
11429 if (is_std_init_list (type
))
11431 /* The temporary array underlying a std::initializer_list
11432 is handled like a reference temporary. */
11433 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
11434 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
11435 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
11440 constructor_elt
*p
;
11441 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (ctor
);
11442 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
11443 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
11445 recompute_constructor_flags (ctor
);
11446 if (decl_maybe_constant_var_p (decl
) && TREE_CONSTANT (ctor
))
11447 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
11454 /* Returns true iff an initializer for TYPE could contain temporaries that
11455 need to be extended because they are bound to references or
11456 std::initializer_list. */
11459 type_has_extended_temps (tree type
)
11461 type
= strip_array_types (type
);
11462 if (TYPE_REF_P (type
))
11464 if (CLASS_TYPE_P (type
))
11466 if (is_std_init_list (type
))
11468 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
11469 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
11470 if (type_has_extended_temps (TREE_TYPE (f
)))
11476 /* Returns true iff TYPE is some variant of std::initializer_list. */
11479 is_std_init_list (tree type
)
11481 if (!TYPE_P (type
))
11483 if (cxx_dialect
== cxx98
)
11485 /* Look through typedefs. */
11486 type
= TYPE_MAIN_VARIANT (type
);
11487 return (CLASS_TYPE_P (type
)
11488 && CP_TYPE_CONTEXT (type
) == std_node
11489 && init_list_identifier
== DECL_NAME (TYPE_NAME (type
)));
11492 /* Returns true iff DECL is a list constructor: i.e. a constructor which
11493 will accept an argument list of a single std::initializer_list<T>. */
11496 is_list_ctor (tree decl
)
11498 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
11501 if (!args
|| args
== void_list_node
)
11504 arg
= non_reference (TREE_VALUE (args
));
11505 if (!is_std_init_list (arg
))
11508 args
= TREE_CHAIN (args
);
11510 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
11511 /* There are more non-defaulted parms. */
11517 #include "gt-cp-call.h"