1 /* Functions related to invoking -*- C++ -*- methods and overloaded functions.
2 Copyright (C) 1987-2018 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com) and
4 modified by Brendan Kehoe (brendan@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* High-level class interface. */
27 #include "coretypes.h"
31 #include "stringpool.h"
33 #include "stor-layout.h"
34 #include "trans-mem.h"
39 #include "langhooks.h"
40 #include "c-family/c-objc.h"
41 #include "internal-fn.h"
42 #include "stringpool.h"
45 /* The various kinds of conversion. */
47 enum conversion_kind
{
64 /* The rank of the conversion. Order of the enumerals matters; better
65 conversions should come earlier in the list. */
67 enum conversion_rank
{
78 /* An implicit conversion sequence, in the sense of [over.best.ics].
79 The first conversion to be performed is at the end of the chain.
80 That conversion is always a cr_identity conversion. */
83 /* The kind of conversion represented by this step. */
85 /* The rank of this conversion. */
87 BOOL_BITFIELD user_conv_p
: 1;
88 BOOL_BITFIELD ellipsis_p
: 1;
89 BOOL_BITFIELD this_p
: 1;
90 /* True if this conversion would be permitted with a bending of
91 language standards, e.g. disregarding pointer qualifiers or
92 converting integers to pointers. */
93 BOOL_BITFIELD bad_p
: 1;
94 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
95 temporary should be created to hold the result of the
97 BOOL_BITFIELD need_temporary_p
: 1;
98 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
99 from a pointer-to-derived to pointer-to-base is being performed. */
100 BOOL_BITFIELD base_p
: 1;
101 /* If KIND is ck_ref_bind, true when either an lvalue reference is
102 being bound to an lvalue expression or an rvalue reference is
103 being bound to an rvalue expression. If KIND is ck_rvalue,
104 true when we are treating an lvalue as an rvalue (12.8p33). If
105 KIND is ck_base, always false. If ck_identity, we will be
106 binding a reference directly or decaying to a pointer. */
107 BOOL_BITFIELD rvaluedness_matches_p
: 1;
108 BOOL_BITFIELD check_narrowing
: 1;
109 /* The type of the expression resulting from the conversion. */
112 /* The next conversion in the chain. Since the conversions are
113 arranged from outermost to innermost, the NEXT conversion will
114 actually be performed before this conversion. This variant is
115 used only when KIND is neither ck_identity, ck_ambig nor
116 ck_list. Please use the next_conversion function instead
117 of using this field directly. */
119 /* The expression at the beginning of the conversion chain. This
120 variant is used only if KIND is ck_identity or ck_ambig. */
122 /* The array of conversions for an initializer_list, so this
123 variant is used only when KIN D is ck_list. */
126 /* The function candidate corresponding to this conversion
127 sequence. This field is only used if KIND is ck_user. */
128 struct z_candidate
*cand
;
131 #define CONVERSION_RANK(NODE) \
132 ((NODE)->bad_p ? cr_bad \
133 : (NODE)->ellipsis_p ? cr_ellipsis \
134 : (NODE)->user_conv_p ? cr_user \
137 #define BAD_CONVERSION_RANK(NODE) \
138 ((NODE)->ellipsis_p ? cr_ellipsis \
139 : (NODE)->user_conv_p ? cr_user \
142 static struct obstack conversion_obstack
;
143 static bool conversion_obstack_initialized
;
144 struct rejection_reason
;
146 static struct z_candidate
* tourney (struct z_candidate
*, tsubst_flags_t
);
147 static int equal_functions (tree
, tree
);
148 static int joust (struct z_candidate
*, struct z_candidate
*, bool,
150 static int compare_ics (conversion
*, conversion
*);
151 static void maybe_warn_class_memaccess (location_t
, tree
,
152 const vec
<tree
, va_gc
> *);
153 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
154 #define convert_like(CONV, EXPR, COMPLAIN) \
155 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, \
156 /*issue_conversion_warnings=*/true, \
157 /*c_cast_p=*/false, (COMPLAIN))
158 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
159 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), \
160 /*issue_conversion_warnings=*/true, \
161 /*c_cast_p=*/false, (COMPLAIN))
162 static tree
convert_like_real (conversion
*, tree
, tree
, int, bool,
163 bool, tsubst_flags_t
);
164 static void op_error (location_t
, enum tree_code
, enum tree_code
, tree
,
166 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int,
168 static void print_z_candidate (location_t
, const char *, struct z_candidate
*);
169 static void print_z_candidates (location_t
, struct z_candidate
*);
170 static tree
build_this (tree
);
171 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
172 static bool any_strictly_viable (struct z_candidate
*);
173 static struct z_candidate
*add_template_candidate
174 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
175 tree
, tree
, tree
, int, unification_kind_t
, tsubst_flags_t
);
176 static struct z_candidate
*add_template_candidate_real
177 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
178 tree
, tree
, tree
, int, tree
, unification_kind_t
, tsubst_flags_t
);
179 static void add_builtin_candidates
180 (struct z_candidate
**, enum tree_code
, enum tree_code
,
181 tree
, tree
*, int, tsubst_flags_t
);
182 static void add_builtin_candidate
183 (struct z_candidate
**, enum tree_code
, enum tree_code
,
184 tree
, tree
, tree
, tree
*, tree
*, int, tsubst_flags_t
);
185 static bool is_complete (tree
);
186 static void build_builtin_candidate
187 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
188 int, tsubst_flags_t
);
189 static struct z_candidate
*add_conv_candidate
190 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
191 tree
, tsubst_flags_t
);
192 static struct z_candidate
*add_function_candidate
193 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
194 tree
, int, tsubst_flags_t
);
195 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int,
197 static conversion
*reference_binding (tree
, tree
, tree
, bool, int,
199 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
200 static conversion
*build_list_conv (tree
, tree
, int, tsubst_flags_t
);
201 static conversion
*next_conversion (conversion
*);
202 static bool is_subseq (conversion
*, conversion
*);
203 static conversion
*maybe_handle_ref_bind (conversion
**);
204 static void maybe_handle_implicit_object (conversion
**);
205 static struct z_candidate
*add_candidate
206 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, size_t,
207 conversion
**, tree
, tree
, int, struct rejection_reason
*, int);
208 static tree
source_type (conversion
*);
209 static void add_warning (struct z_candidate
*, struct z_candidate
*);
210 static bool reference_compatible_p (tree
, tree
);
211 static conversion
*direct_reference_binding (tree
, conversion
*);
212 static bool promoted_arithmetic_type_p (tree
);
213 static conversion
*conditional_conversion (tree
, tree
, tsubst_flags_t
);
214 static char *name_as_c_string (tree
, tree
, bool *);
215 static tree
prep_operand (tree
);
216 static void add_candidates (tree
, tree
, const vec
<tree
, va_gc
> *, tree
, tree
,
217 bool, tree
, tree
, int, struct z_candidate
**,
219 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
220 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
222 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
223 NAME can take many forms... */
226 check_dtor_name (tree basetype
, tree name
)
228 /* Just accept something we've already complained about. */
229 if (name
== error_mark_node
)
232 if (TREE_CODE (name
) == TYPE_DECL
)
233 name
= TREE_TYPE (name
);
234 else if (TYPE_P (name
))
236 else if (identifier_p (name
))
238 if ((MAYBE_CLASS_TYPE_P (basetype
)
239 || TREE_CODE (basetype
) == ENUMERAL_TYPE
)
240 && name
== constructor_name (basetype
))
243 name
= get_type_value (name
);
249 template <class T> struct S { ~S(); };
253 NAME will be a class template. */
254 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
258 if (!name
|| name
== error_mark_node
)
260 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
263 /* We want the address of a function or method. We avoid creating a
264 pointer-to-member function. */
267 build_addr_func (tree function
, tsubst_flags_t complain
)
269 tree type
= TREE_TYPE (function
);
271 /* We have to do these by hand to avoid real pointer to member
273 if (TREE_CODE (type
) == METHOD_TYPE
)
275 if (TREE_CODE (function
) == OFFSET_REF
)
277 tree object
= build_address (TREE_OPERAND (function
, 0));
278 return get_member_function_from_ptrfunc (&object
,
279 TREE_OPERAND (function
, 1),
282 function
= build_address (function
);
285 function
= decay_conversion (function
, complain
, /*reject_builtin=*/false);
290 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
291 POINTER_TYPE to those. Note, pointer to member function types
292 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
293 two variants. build_call_a is the primitive taking an array of
294 arguments, while build_call_n is a wrapper that handles varargs. */
297 build_call_n (tree function
, int n
, ...)
300 return build_call_a (function
, 0, NULL
);
303 tree
*argarray
= XALLOCAVEC (tree
, n
);
308 for (i
= 0; i
< n
; i
++)
309 argarray
[i
] = va_arg (ap
, tree
);
311 return build_call_a (function
, n
, argarray
);
315 /* Update various flags in cfun and the call itself based on what is being
316 called. Split out of build_call_a so that bot_manip can use it too. */
319 set_flags_from_callee (tree call
)
322 tree decl
= get_callee_fndecl (call
);
324 /* We check both the decl and the type; a function may be known not to
325 throw without being declared throw(). */
326 nothrow
= decl
&& TREE_NOTHROW (decl
);
327 if (CALL_EXPR_FN (call
))
328 nothrow
|= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call
))));
329 else if (internal_fn_flags (CALL_EXPR_IFN (call
)) & ECF_NOTHROW
)
332 if (!nothrow
&& at_function_scope_p () && cfun
&& cp_function_chain
)
333 cp_function_chain
->can_throw
= 1;
335 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
336 current_function_returns_abnormally
= 1;
338 TREE_NOTHROW (call
) = nothrow
;
342 build_call_a (tree function
, int n
, tree
*argarray
)
349 function
= build_addr_func (function
, tf_warning_or_error
);
351 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
352 fntype
= TREE_TYPE (TREE_TYPE (function
));
353 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
354 || TREE_CODE (fntype
) == METHOD_TYPE
);
355 result_type
= TREE_TYPE (fntype
);
356 /* An rvalue has no cv-qualifiers. */
357 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
358 result_type
= cv_unqualified (result_type
);
360 function
= build_call_array_loc (input_location
,
361 result_type
, function
, n
, argarray
);
362 set_flags_from_callee (function
);
364 decl
= get_callee_fndecl (function
);
366 if (decl
&& !TREE_USED (decl
))
368 /* We invoke build_call directly for several library
369 functions. These may have been declared normally if
370 we're building libgcc, so we can't just check
372 gcc_assert (DECL_ARTIFICIAL (decl
)
373 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
378 require_complete_eh_spec_types (fntype
, decl
);
380 TREE_HAS_CONSTRUCTOR (function
) = (decl
&& DECL_CONSTRUCTOR_P (decl
));
382 /* Don't pass empty class objects by value. This is useful
383 for tags in STL, which are used to control overload resolution.
384 We don't need to handle other cases of copying empty classes. */
385 if (! decl
|| ! DECL_BUILT_IN (decl
))
386 for (i
= 0; i
< n
; i
++)
388 tree arg
= CALL_EXPR_ARG (function
, i
);
389 if (is_empty_class (TREE_TYPE (arg
))
390 && ! TREE_ADDRESSABLE (TREE_TYPE (arg
)))
392 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (arg
));
393 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (t
), arg
, t
);
394 CALL_EXPR_ARG (function
, i
) = arg
;
401 /* New overloading code. */
405 struct candidate_warning
{
407 candidate_warning
*next
;
410 /* Information for providing diagnostics about why overloading failed. */
412 enum rejection_reason_code
{
415 rr_explicit_conversion
,
416 rr_template_conversion
,
418 rr_bad_arg_conversion
,
419 rr_template_unification
,
422 rr_constraint_failure
425 struct conversion_info
{
426 /* The index of the argument, 0-based. */
428 /* The actual argument or its type. */
430 /* The type of the parameter. */
434 struct rejection_reason
{
435 enum rejection_reason_code code
;
437 /* Information about an arity mismatch. */
439 /* The expected number of arguments. */
441 /* The actual number of arguments in the call. */
443 /* Whether the call was a varargs call. */
446 /* Information about an argument conversion mismatch. */
447 struct conversion_info conversion
;
448 /* Same, but for bad argument conversions. */
449 struct conversion_info bad_conversion
;
450 /* Information about template unification failures. These are the
451 parameters passed to fn_type_unification. */
459 unification_kind_t strict
;
461 } template_unification
;
462 /* Information about template instantiation failures. These are the
463 parameters passed to instantiate_template. */
467 } template_instantiation
;
472 /* The FUNCTION_DECL that will be called if this candidate is
473 selected by overload resolution. */
475 /* If not NULL_TREE, the first argument to use when calling this
478 /* The rest of the arguments to use when calling this function. If
479 there are no further arguments this may be NULL or it may be an
481 const vec
<tree
, va_gc
> *args
;
482 /* The implicit conversion sequences for each of the arguments to
485 /* The number of implicit conversion sequences. */
487 /* If FN is a user-defined conversion, the standard conversion
488 sequence from the type returned by FN to the desired destination
490 conversion
*second_conv
;
491 struct rejection_reason
*reason
;
492 /* If FN is a member function, the binfo indicating the path used to
493 qualify the name of FN at the call site. This path is used to
494 determine whether or not FN is accessible if it is selected by
495 overload resolution. The DECL_CONTEXT of FN will always be a
496 (possibly improper) base of this binfo. */
498 /* If FN is a non-static member function, the binfo indicating the
499 subobject to which the `this' pointer should be converted if FN
500 is selected by overload resolution. The type pointed to by
501 the `this' pointer must correspond to the most derived class
502 indicated by the CONVERSION_PATH. */
503 tree conversion_path
;
506 candidate_warning
*warnings
;
510 /* The flags active in add_candidate. */
514 /* Returns true iff T is a null pointer constant in the sense of
518 null_ptr_cst_p (tree t
)
520 tree type
= TREE_TYPE (t
);
524 A null pointer constant is an integral constant expression
525 (_expr.const_) rvalue of integer type that evaluates to zero or
526 an rvalue of type std::nullptr_t. */
527 if (NULLPTR_TYPE_P (type
))
530 if (cxx_dialect
>= cxx11
)
532 STRIP_ANY_LOCATION_WRAPPER (t
);
534 /* Core issue 903 says only literal 0 is a null pointer constant. */
535 if (TREE_CODE (type
) == INTEGER_TYPE
536 && !char_type_p (type
)
537 && TREE_CODE (t
) == INTEGER_CST
539 && !TREE_OVERFLOW (t
))
542 else if (CP_INTEGRAL_TYPE_P (type
))
544 t
= fold_non_dependent_expr (t
);
546 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
553 /* Returns true iff T is a null member pointer value (4.11). */
556 null_member_pointer_value_p (tree t
)
558 tree type
= TREE_TYPE (t
);
561 else if (TYPE_PTRMEMFUNC_P (type
))
562 return (TREE_CODE (t
) == CONSTRUCTOR
563 && integer_zerop (CONSTRUCTOR_ELT (t
, 0)->value
));
564 else if (TYPE_PTRDATAMEM_P (type
))
565 return integer_all_onesp (t
);
570 /* Returns nonzero if PARMLIST consists of only default parms,
571 ellipsis, and/or undeduced parameter packs. */
574 sufficient_parms_p (const_tree parmlist
)
576 for (; parmlist
&& parmlist
!= void_list_node
;
577 parmlist
= TREE_CHAIN (parmlist
))
578 if (!TREE_PURPOSE (parmlist
)
579 && !PACK_EXPANSION_P (TREE_VALUE (parmlist
)))
584 /* Allocate N bytes of memory from the conversion obstack. The memory
585 is zeroed before being returned. */
588 conversion_obstack_alloc (size_t n
)
591 if (!conversion_obstack_initialized
)
593 gcc_obstack_init (&conversion_obstack
);
594 conversion_obstack_initialized
= true;
596 p
= obstack_alloc (&conversion_obstack
, n
);
601 /* Allocate rejection reasons. */
603 static struct rejection_reason
*
604 alloc_rejection (enum rejection_reason_code code
)
606 struct rejection_reason
*p
;
607 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
612 static struct rejection_reason
*
613 arity_rejection (tree first_arg
, int expected
, int actual
)
615 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
616 int adjust
= first_arg
!= NULL_TREE
;
617 r
->u
.arity
.expected
= expected
- adjust
;
618 r
->u
.arity
.actual
= actual
- adjust
;
622 static struct rejection_reason
*
623 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
625 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
626 int adjust
= first_arg
!= NULL_TREE
;
627 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
628 r
->u
.conversion
.from
= from
;
629 r
->u
.conversion
.to_type
= to
;
633 static struct rejection_reason
*
634 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
636 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
637 int adjust
= first_arg
!= NULL_TREE
;
638 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
639 r
->u
.bad_conversion
.from
= from
;
640 r
->u
.bad_conversion
.to_type
= to
;
644 static struct rejection_reason
*
645 explicit_conversion_rejection (tree from
, tree to
)
647 struct rejection_reason
*r
= alloc_rejection (rr_explicit_conversion
);
648 r
->u
.conversion
.n_arg
= 0;
649 r
->u
.conversion
.from
= from
;
650 r
->u
.conversion
.to_type
= to
;
654 static struct rejection_reason
*
655 template_conversion_rejection (tree from
, tree to
)
657 struct rejection_reason
*r
= alloc_rejection (rr_template_conversion
);
658 r
->u
.conversion
.n_arg
= 0;
659 r
->u
.conversion
.from
= from
;
660 r
->u
.conversion
.to_type
= to
;
664 static struct rejection_reason
*
665 template_unification_rejection (tree tmpl
, tree explicit_targs
, tree targs
,
666 const tree
*args
, unsigned int nargs
,
667 tree return_type
, unification_kind_t strict
,
670 size_t args_n_bytes
= sizeof (*args
) * nargs
;
671 tree
*args1
= (tree
*) conversion_obstack_alloc (args_n_bytes
);
672 struct rejection_reason
*r
= alloc_rejection (rr_template_unification
);
673 r
->u
.template_unification
.tmpl
= tmpl
;
674 r
->u
.template_unification
.explicit_targs
= explicit_targs
;
675 r
->u
.template_unification
.num_targs
= TREE_VEC_LENGTH (targs
);
676 /* Copy args to our own storage. */
677 memcpy (args1
, args
, args_n_bytes
);
678 r
->u
.template_unification
.args
= args1
;
679 r
->u
.template_unification
.nargs
= nargs
;
680 r
->u
.template_unification
.return_type
= return_type
;
681 r
->u
.template_unification
.strict
= strict
;
682 r
->u
.template_unification
.flags
= flags
;
686 static struct rejection_reason
*
687 template_unification_error_rejection (void)
689 return alloc_rejection (rr_template_unification
);
692 static struct rejection_reason
*
693 invalid_copy_with_fn_template_rejection (void)
695 struct rejection_reason
*r
= alloc_rejection (rr_invalid_copy
);
699 static struct rejection_reason
*
700 inherited_ctor_rejection (void)
702 struct rejection_reason
*r
= alloc_rejection (rr_inherited_ctor
);
706 // Build a constraint failure record, saving information into the
707 // template_instantiation field of the rejection. If FN is not a template
708 // declaration, the TMPL member is the FN declaration and TARGS is empty.
710 static struct rejection_reason
*
711 constraint_failure (tree fn
)
713 struct rejection_reason
*r
= alloc_rejection (rr_constraint_failure
);
714 if (tree ti
= DECL_TEMPLATE_INFO (fn
))
716 r
->u
.template_instantiation
.tmpl
= TI_TEMPLATE (ti
);
717 r
->u
.template_instantiation
.targs
= TI_ARGS (ti
);
721 r
->u
.template_instantiation
.tmpl
= fn
;
722 r
->u
.template_instantiation
.targs
= NULL_TREE
;
727 /* Dynamically allocate a conversion. */
730 alloc_conversion (conversion_kind kind
)
733 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
738 /* Make sure that all memory on the conversion obstack has been
742 validate_conversion_obstack (void)
744 if (conversion_obstack_initialized
)
745 gcc_assert ((obstack_next_free (&conversion_obstack
)
746 == obstack_base (&conversion_obstack
)));
749 /* Dynamically allocate an array of N conversions. */
752 alloc_conversions (size_t n
)
754 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
758 build_conv (conversion_kind code
, tree type
, conversion
*from
)
761 conversion_rank rank
= CONVERSION_RANK (from
);
763 /* Note that the caller is responsible for filling in t->cand for
764 user-defined conversions. */
765 t
= alloc_conversion (code
);
789 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
790 t
->bad_p
= from
->bad_p
;
795 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
796 specialization of std::initializer_list<T>, if such a conversion is
800 build_list_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
802 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
803 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
804 conversion
**subconvs
= alloc_conversions (len
);
809 /* Within a list-initialization we can have more user-defined
811 flags
&= ~LOOKUP_NO_CONVERSION
;
812 /* But no narrowing conversions. */
813 flags
|= LOOKUP_NO_NARROWING
;
815 /* Can't make an array of these types. */
816 if (TREE_CODE (elttype
) == REFERENCE_TYPE
817 || TREE_CODE (elttype
) == FUNCTION_TYPE
818 || VOID_TYPE_P (elttype
))
821 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
824 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
825 false, flags
, complain
);
832 t
= alloc_conversion (ck_list
);
834 t
->u
.list
= subconvs
;
837 for (i
= 0; i
< len
; ++i
)
839 conversion
*sub
= subconvs
[i
];
840 if (sub
->rank
> t
->rank
)
842 if (sub
->user_conv_p
)
843 t
->user_conv_p
= true;
851 /* Return the next conversion of the conversion chain (if applicable),
852 or NULL otherwise. Please use this function instead of directly
853 accessing fields of struct conversion. */
856 next_conversion (conversion
*conv
)
859 || conv
->kind
== ck_identity
860 || conv
->kind
== ck_ambig
861 || conv
->kind
== ck_list
)
866 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
867 is a valid aggregate initializer for array type ATYPE. */
870 can_convert_array (tree atype
, tree ctor
, int flags
, tsubst_flags_t complain
)
873 tree elttype
= TREE_TYPE (atype
);
874 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
876 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
878 if (TREE_CODE (elttype
) == ARRAY_TYPE
879 && TREE_CODE (val
) == CONSTRUCTOR
)
880 ok
= can_convert_array (elttype
, val
, flags
, complain
);
882 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
,
890 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
891 aggregate class, if such a conversion is possible. */
894 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
896 unsigned HOST_WIDE_INT i
= 0;
898 tree field
= next_initializable_field (TYPE_FIELDS (type
));
899 tree empty_ctor
= NULL_TREE
;
901 /* We already called reshape_init in implicit_conversion. */
903 /* The conversions within the init-list aren't affected by the enclosing
904 context; they're always simple copy-initialization. */
905 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
907 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
909 tree ftype
= TREE_TYPE (field
);
913 if (i
< CONSTRUCTOR_NELTS (ctor
))
914 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
915 else if (DECL_INITIAL (field
))
916 val
= get_nsdmi (field
, /*ctor*/false, complain
);
917 else if (TREE_CODE (ftype
) == REFERENCE_TYPE
)
918 /* Value-initialization of reference is ill-formed. */
922 if (empty_ctor
== NULL_TREE
)
923 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
928 if (TREE_CODE (ftype
) == ARRAY_TYPE
929 && TREE_CODE (val
) == CONSTRUCTOR
)
930 ok
= can_convert_array (ftype
, val
, flags
, complain
);
932 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
938 if (TREE_CODE (type
) == UNION_TYPE
)
942 if (i
< CONSTRUCTOR_NELTS (ctor
))
945 c
= alloc_conversion (ck_aggr
);
948 c
->user_conv_p
= true;
949 c
->check_narrowing
= true;
954 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
955 array type, if such a conversion is possible. */
958 build_array_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
961 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
962 tree elttype
= TREE_TYPE (type
);
967 enum conversion_rank rank
= cr_exact
;
969 /* We might need to propagate the size from the element to the array. */
970 complete_type (type
);
972 if (TYPE_DOMAIN (type
)
973 && !variably_modified_type_p (TYPE_DOMAIN (type
), NULL_TREE
))
975 unsigned HOST_WIDE_INT alen
= tree_to_uhwi (array_type_nelts_top (type
));
980 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
982 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
985 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
986 false, flags
, complain
);
990 if (sub
->rank
> rank
)
992 if (sub
->user_conv_p
)
998 c
= alloc_conversion (ck_aggr
);
1001 c
->user_conv_p
= user
;
1007 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1008 complex type, if such a conversion is possible. */
1011 build_complex_conv (tree type
, tree ctor
, int flags
,
1012 tsubst_flags_t complain
)
1015 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1016 tree elttype
= TREE_TYPE (type
);
1021 enum conversion_rank rank
= cr_exact
;
1026 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1028 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1031 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1032 false, flags
, complain
);
1036 if (sub
->rank
> rank
)
1038 if (sub
->user_conv_p
)
1044 c
= alloc_conversion (ck_aggr
);
1047 c
->user_conv_p
= user
;
1053 /* Build a representation of the identity conversion from EXPR to
1054 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1057 build_identity_conv (tree type
, tree expr
)
1061 c
= alloc_conversion (ck_identity
);
1068 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1069 were multiple user-defined conversions to accomplish the job.
1070 Build a conversion that indicates that ambiguity. */
1073 build_ambiguous_conv (tree type
, tree expr
)
1077 c
= alloc_conversion (ck_ambig
);
1085 strip_top_quals (tree t
)
1087 if (TREE_CODE (t
) == ARRAY_TYPE
)
1089 return cp_build_qualified_type (t
, 0);
1092 /* Returns the standard conversion path (see [conv]) from type FROM to type
1093 TO, if any. For proper handling of null pointer constants, you must
1094 also pass the expression EXPR to convert from. If C_CAST_P is true,
1095 this conversion is coming from a C-style cast. */
1098 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1099 int flags
, tsubst_flags_t complain
)
1101 enum tree_code fcode
, tcode
;
1103 bool fromref
= false;
1106 to
= non_reference (to
);
1107 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1110 from
= TREE_TYPE (from
);
1113 to
= strip_top_quals (to
);
1114 from
= strip_top_quals (from
);
1116 if (expr
&& type_unknown_p (expr
))
1118 if (TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1120 tsubst_flags_t tflags
= tf_conv
;
1121 expr
= instantiate_type (to
, expr
, tflags
);
1122 if (expr
== error_mark_node
)
1124 from
= TREE_TYPE (expr
);
1126 else if (TREE_CODE (to
) == BOOLEAN_TYPE
)
1128 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1129 expr
= resolve_nondeduced_context (expr
, complain
);
1130 from
= TREE_TYPE (expr
);
1134 fcode
= TREE_CODE (from
);
1135 tcode
= TREE_CODE (to
);
1137 conv
= build_identity_conv (from
, expr
);
1138 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1140 from
= type_decays_to (from
);
1141 fcode
= TREE_CODE (from
);
1142 /* Tell convert_like_real that we're using the address. */
1143 conv
->rvaluedness_matches_p
= true;
1144 conv
= build_conv (ck_lvalue
, from
, conv
);
1146 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1147 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1148 express the copy constructor call required by copy-initialization. */
1149 else if (fromref
|| (expr
&& obvalue_p (expr
)))
1154 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1157 from
= strip_top_quals (bitfield_type
);
1158 fcode
= TREE_CODE (from
);
1161 conv
= build_conv (ck_rvalue
, from
, conv
);
1162 if (flags
& LOOKUP_PREFER_RVALUE
)
1163 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1164 conv
->rvaluedness_matches_p
= true;
1167 /* Allow conversion between `__complex__' data types. */
1168 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1170 /* The standard conversion sequence to convert FROM to TO is
1171 the standard conversion sequence to perform componentwise
1173 conversion
*part_conv
= standard_conversion
1174 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
,
1179 conv
= build_conv (part_conv
->kind
, to
, conv
);
1180 conv
->rank
= part_conv
->rank
;
1188 if (same_type_p (from
, to
))
1190 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1191 conv
->type
= qualified_to
;
1196 A null pointer constant can be converted to a pointer type; ... A
1197 null pointer constant of integral type can be converted to an
1198 rvalue of type std::nullptr_t. */
1199 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1200 || NULLPTR_TYPE_P (to
))
1201 && ((expr
&& null_ptr_cst_p (expr
))
1202 || NULLPTR_TYPE_P (from
)))
1203 conv
= build_conv (ck_std
, to
, conv
);
1204 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1205 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1207 /* For backwards brain damage compatibility, allow interconversion of
1208 pointers and integers with a pedwarn. */
1209 conv
= build_conv (ck_std
, to
, conv
);
1212 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1214 /* For backwards brain damage compatibility, allow interconversion of
1215 enums and integers with a pedwarn. */
1216 conv
= build_conv (ck_std
, to
, conv
);
1219 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1220 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1225 if (tcode
== POINTER_TYPE
)
1227 to_pointee
= TREE_TYPE (to
);
1228 from_pointee
= TREE_TYPE (from
);
1230 /* Since this is the target of a pointer, it can't have function
1231 qualifiers, so any TYPE_QUALS must be for attributes const or
1232 noreturn. Strip them. */
1233 if (TREE_CODE (to_pointee
) == FUNCTION_TYPE
1234 && TYPE_QUALS (to_pointee
))
1235 to_pointee
= build_qualified_type (to_pointee
, TYPE_UNQUALIFIED
);
1236 if (TREE_CODE (from_pointee
) == FUNCTION_TYPE
1237 && TYPE_QUALS (from_pointee
))
1238 from_pointee
= build_qualified_type (from_pointee
, TYPE_UNQUALIFIED
);
1242 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1243 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1246 if (tcode
== POINTER_TYPE
1247 && same_type_ignoring_top_level_qualifiers_p (from_pointee
,
1250 else if (VOID_TYPE_P (to_pointee
)
1251 && !TYPE_PTRDATAMEM_P (from
)
1252 && TREE_CODE (from_pointee
) != FUNCTION_TYPE
)
1254 tree nfrom
= TREE_TYPE (from
);
1255 /* Don't try to apply restrict to void. */
1256 int quals
= cp_type_quals (nfrom
) & ~TYPE_QUAL_RESTRICT
;
1257 from_pointee
= cp_build_qualified_type (void_type_node
, quals
);
1258 from
= build_pointer_type (from_pointee
);
1259 conv
= build_conv (ck_ptr
, from
, conv
);
1261 else if (TYPE_PTRDATAMEM_P (from
))
1263 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1264 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1266 if (same_type_p (fbase
, tbase
))
1267 /* No base conversion needed. */;
1268 else if (DERIVED_FROM_P (fbase
, tbase
)
1269 && (same_type_ignoring_top_level_qualifiers_p
1270 (from_pointee
, to_pointee
)))
1272 from
= build_ptrmem_type (tbase
, from_pointee
);
1273 conv
= build_conv (ck_pmem
, from
, conv
);
1278 else if (CLASS_TYPE_P (from_pointee
)
1279 && CLASS_TYPE_P (to_pointee
)
1282 An rvalue of type "pointer to cv D," where D is a
1283 class type, can be converted to an rvalue of type
1284 "pointer to cv B," where B is a base class (clause
1285 _class.derived_) of D. If B is an inaccessible
1286 (clause _class.access_) or ambiguous
1287 (_class.member.lookup_) base class of D, a program
1288 that necessitates this conversion is ill-formed.
1289 Therefore, we use DERIVED_FROM_P, and do not check
1290 access or uniqueness. */
1291 && DERIVED_FROM_P (to_pointee
, from_pointee
))
1294 = cp_build_qualified_type (to_pointee
,
1295 cp_type_quals (from_pointee
));
1296 from
= build_pointer_type (from_pointee
);
1297 conv
= build_conv (ck_ptr
, from
, conv
);
1298 conv
->base_p
= true;
1301 if (same_type_p (from
, to
))
1303 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
1304 /* In a C-style cast, we ignore CV-qualification because we
1305 are allowed to perform a static_cast followed by a
1307 conv
= build_conv (ck_qual
, to
, conv
);
1308 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1309 conv
= build_conv (ck_qual
, to
, conv
);
1310 else if (expr
&& string_conv_p (to
, expr
, 0))
1311 /* converting from string constant to char *. */
1312 conv
= build_conv (ck_qual
, to
, conv
);
1313 else if (fnptr_conv_p (to
, from
))
1314 conv
= build_conv (ck_fnptr
, to
, conv
);
1315 /* Allow conversions among compatible ObjC pointer types (base
1316 conversions have been already handled above). */
1317 else if (c_dialect_objc ()
1318 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1319 conv
= build_conv (ck_ptr
, to
, conv
);
1320 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1322 conv
= build_conv (ck_ptr
, to
, conv
);
1330 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1332 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1333 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1334 tree fbase
= class_of_this_parm (fromfn
);
1335 tree tbase
= class_of_this_parm (tofn
);
1337 if (!DERIVED_FROM_P (fbase
, tbase
))
1340 tree fstat
= static_fn_type (fromfn
);
1341 tree tstat
= static_fn_type (tofn
);
1342 if (same_type_p (tstat
, fstat
)
1343 || fnptr_conv_p (tstat
, fstat
))
1348 if (!same_type_p (fbase
, tbase
))
1350 from
= build_memfn_type (fstat
,
1352 cp_type_quals (tbase
),
1353 type_memfn_rqual (tofn
));
1354 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1355 conv
= build_conv (ck_pmem
, from
, conv
);
1356 conv
->base_p
= true;
1358 if (fnptr_conv_p (tstat
, fstat
))
1359 conv
= build_conv (ck_fnptr
, to
, conv
);
1361 else if (tcode
== BOOLEAN_TYPE
)
1365 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1366 to member type can be converted to a prvalue of type bool. ...
1367 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1368 std::nullptr_t can be converted to a prvalue of type bool; */
1369 if (ARITHMETIC_TYPE_P (from
)
1370 || UNSCOPED_ENUM_P (from
)
1371 || fcode
== POINTER_TYPE
1372 || TYPE_PTRMEM_P (from
)
1373 || NULLPTR_TYPE_P (from
))
1375 conv
= build_conv (ck_std
, to
, conv
);
1376 if (fcode
== POINTER_TYPE
1377 || TYPE_PTRDATAMEM_P (from
)
1378 || (TYPE_PTRMEMFUNC_P (from
)
1379 && conv
->rank
< cr_pbool
)
1380 || NULLPTR_TYPE_P (from
))
1381 conv
->rank
= cr_pbool
;
1382 if (NULLPTR_TYPE_P (from
) && (flags
& LOOKUP_ONLYCONVERTING
))
1389 /* We don't check for ENUMERAL_TYPE here because there are no standard
1390 conversions to enum type. */
1391 /* As an extension, allow conversion to complex type. */
1392 else if (ARITHMETIC_TYPE_P (to
))
1394 if (! (INTEGRAL_CODE_P (fcode
)
1395 || (fcode
== REAL_TYPE
&& !(flags
& LOOKUP_NO_NON_INTEGRAL
)))
1396 || SCOPED_ENUM_P (from
))
1398 conv
= build_conv (ck_std
, to
, conv
);
1400 /* Give this a better rank if it's a promotion. */
1401 if (same_type_p (to
, type_promotes_to (from
))
1402 && next_conversion (conv
)->rank
<= cr_promotion
)
1403 conv
->rank
= cr_promotion
;
1405 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1406 && vector_types_convertible_p (from
, to
, false))
1407 return build_conv (ck_std
, to
, conv
);
1408 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1409 && is_properly_derived_from (from
, to
))
1411 if (conv
->kind
== ck_rvalue
)
1412 conv
= next_conversion (conv
);
1413 conv
= build_conv (ck_base
, to
, conv
);
1414 /* The derived-to-base conversion indicates the initialization
1415 of a parameter with base type from an object of a derived
1416 type. A temporary object is created to hold the result of
1417 the conversion unless we're binding directly to a reference. */
1418 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1423 if (flags
& LOOKUP_NO_NARROWING
)
1424 conv
->check_narrowing
= true;
1429 /* Returns nonzero if T1 is reference-related to T2. */
1432 reference_related_p (tree t1
, tree t2
)
1434 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1437 t1
= TYPE_MAIN_VARIANT (t1
);
1438 t2
= TYPE_MAIN_VARIANT (t2
);
1442 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1443 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1445 return (same_type_p (t1
, t2
)
1446 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1447 && DERIVED_FROM_P (t1
, t2
)));
1450 /* Returns nonzero if T1 is reference-compatible with T2. */
1453 reference_compatible_p (tree t1
, tree t2
)
1457 "cv1 T1" is reference compatible with "cv2 T2" if
1458 * T1 is reference-related to T2 or
1459 * T2 is "noexcept function" and T1 is "function", where the
1460 function types are otherwise the same,
1461 and cv1 is the same cv-qualification as, or greater cv-qualification
1463 return ((reference_related_p (t1
, t2
)
1464 || fnptr_conv_p (t1
, t2
))
1465 && at_least_as_qualified_p (t1
, t2
));
1468 /* A reference of the indicated TYPE is being bound directly to the
1469 expression represented by the implicit conversion sequence CONV.
1470 Return a conversion sequence for this binding. */
1473 direct_reference_binding (tree type
, conversion
*conv
)
1477 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
1478 gcc_assert (TREE_CODE (conv
->type
) != REFERENCE_TYPE
);
1480 t
= TREE_TYPE (type
);
1482 if (conv
->kind
== ck_identity
)
1483 /* Mark the identity conv as to not decay to rvalue. */
1484 conv
->rvaluedness_matches_p
= true;
1488 When a parameter of reference type binds directly
1489 (_dcl.init.ref_) to an argument expression, the implicit
1490 conversion sequence is the identity conversion, unless the
1491 argument expression has a type that is a derived class of the
1492 parameter type, in which case the implicit conversion sequence is
1493 a derived-to-base Conversion.
1495 If the parameter binds directly to the result of applying a
1496 conversion function to the argument expression, the implicit
1497 conversion sequence is a user-defined conversion sequence
1498 (_over.ics.user_), with the second standard conversion sequence
1499 either an identity conversion or, if the conversion function
1500 returns an entity of a type that is a derived class of the
1501 parameter type, a derived-to-base conversion. */
1502 if (is_properly_derived_from (conv
->type
, t
))
1504 /* Represent the derived-to-base conversion. */
1505 conv
= build_conv (ck_base
, t
, conv
);
1506 /* We will actually be binding to the base-class subobject in
1507 the derived class, so we mark this conversion appropriately.
1508 That way, convert_like knows not to generate a temporary. */
1509 conv
->need_temporary_p
= false;
1512 return build_conv (ck_ref_bind
, type
, conv
);
1515 /* Returns the conversion path from type FROM to reference type TO for
1516 purposes of reference binding. For lvalue binding, either pass a
1517 reference type to FROM or an lvalue expression to EXPR. If the
1518 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1519 the conversion returned. If C_CAST_P is true, this
1520 conversion is coming from a C-style cast. */
1523 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1524 tsubst_flags_t complain
)
1526 conversion
*conv
= NULL
;
1527 tree to
= TREE_TYPE (rto
);
1532 cp_lvalue_kind gl_kind
;
1535 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1537 expr
= instantiate_type (to
, expr
, tf_none
);
1538 if (expr
== error_mark_node
)
1540 from
= TREE_TYPE (expr
);
1543 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1545 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1546 /* DR 1288: Otherwise, if the initializer list has a single element
1547 of type E and ... [T's] referenced type is reference-related to E,
1548 the object or reference is initialized from that element... */
1549 if (CONSTRUCTOR_NELTS (expr
) == 1)
1551 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1552 if (error_operand_p (elt
))
1554 tree etype
= TREE_TYPE (elt
);
1555 if (reference_related_p (to
, etype
))
1562 /* Otherwise, if T is a reference type, a prvalue temporary of the
1563 type referenced by T is copy-list-initialized or
1564 direct-list-initialized, depending on the kind of initialization
1565 for the reference, and the reference is bound to that temporary. */
1566 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1567 flags
|LOOKUP_NO_TEMP_BIND
, complain
);
1571 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1573 from
= TREE_TYPE (from
);
1574 if (!TYPE_REF_IS_RVALUE (rfrom
)
1575 || TREE_CODE (from
) == FUNCTION_TYPE
)
1576 gl_kind
= clk_ordinary
;
1578 gl_kind
= clk_rvalueref
;
1581 gl_kind
= lvalue_kind (expr
);
1582 else if (CLASS_TYPE_P (from
)
1583 || TREE_CODE (from
) == ARRAY_TYPE
)
1584 gl_kind
= clk_class
;
1588 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1589 if ((flags
& LOOKUP_NO_TEMP_BIND
)
1590 && (gl_kind
& clk_class
))
1593 /* Same mask as real_lvalue_p. */
1594 is_lvalue
= gl_kind
&& !(gl_kind
& (clk_rvalueref
|clk_class
));
1597 if ((gl_kind
& clk_bitfield
) != 0)
1598 tfrom
= unlowered_expr_type (expr
);
1600 /* Figure out whether or not the types are reference-related and
1601 reference compatible. We have to do this after stripping
1602 references from FROM. */
1603 related_p
= reference_related_p (to
, tfrom
);
1604 /* If this is a C cast, first convert to an appropriately qualified
1605 type, so that we can later do a const_cast to the desired type. */
1606 if (related_p
&& c_cast_p
1607 && !at_least_as_qualified_p (to
, tfrom
))
1608 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1609 compatible_p
= reference_compatible_p (to
, tfrom
);
1611 /* Directly bind reference when target expression's type is compatible with
1612 the reference and expression is an lvalue. In DR391, the wording in
1613 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1614 const and rvalue references to rvalues of compatible class type.
1615 We should also do direct bindings for non-class xvalues. */
1616 if ((related_p
|| compatible_p
) && gl_kind
)
1620 If the initializer expression
1622 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1623 is reference-compatible with "cv2 T2,"
1625 the reference is bound directly to the initializer expression
1629 If the initializer expression is an rvalue, with T2 a class type,
1630 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1631 is bound to the object represented by the rvalue or to a sub-object
1632 within that object. */
1634 conv
= build_identity_conv (tfrom
, expr
);
1635 conv
= direct_reference_binding (rto
, conv
);
1637 if (TREE_CODE (rfrom
) == REFERENCE_TYPE
)
1638 /* Handle rvalue reference to function properly. */
1639 conv
->rvaluedness_matches_p
1640 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1642 conv
->rvaluedness_matches_p
1643 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1645 if ((gl_kind
& clk_bitfield
) != 0
1646 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1647 /* For the purposes of overload resolution, we ignore the fact
1648 this expression is a bitfield or packed field. (In particular,
1649 [over.ics.ref] says specifically that a function with a
1650 non-const reference parameter is viable even if the
1651 argument is a bitfield.)
1653 However, when we actually call the function we must create
1654 a temporary to which to bind the reference. If the
1655 reference is volatile, or isn't const, then we cannot make
1656 a temporary, so we just issue an error when the conversion
1658 conv
->need_temporary_p
= true;
1660 /* Don't allow binding of lvalues (other than function lvalues) to
1661 rvalue references. */
1662 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1663 && TREE_CODE (to
) != FUNCTION_TYPE
)
1666 /* Nor the reverse. */
1667 if (!is_lvalue
&& !TYPE_REF_IS_RVALUE (rto
)
1668 && (!CP_TYPE_CONST_NON_VOLATILE_P (to
)
1669 || (flags
& LOOKUP_NO_RVAL_BIND
))
1670 && TREE_CODE (to
) != FUNCTION_TYPE
)
1678 /* [class.conv.fct] A conversion function is never used to convert a
1679 (possibly cv-qualified) object to the (possibly cv-qualified) same
1680 object type (or a reference to it), to a (possibly cv-qualified) base
1681 class of that type (or a reference to it).... */
1682 else if (CLASS_TYPE_P (from
) && !related_p
1683 && !(flags
& LOOKUP_NO_CONVERSION
))
1687 If the initializer expression
1689 -- has a class type (i.e., T2 is a class type) can be
1690 implicitly converted to an lvalue of type "cv3 T3," where
1691 "cv1 T1" is reference-compatible with "cv3 T3". (this
1692 conversion is selected by enumerating the applicable
1693 conversion functions (_over.match.ref_) and choosing the
1694 best one through overload resolution. (_over.match_).
1696 the reference is bound to the lvalue result of the conversion
1697 in the second case. */
1698 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1701 return cand
->second_conv
;
1704 /* From this point on, we conceptually need temporaries, even if we
1705 elide them. Only the cases above are "direct bindings". */
1706 if (flags
& LOOKUP_NO_TEMP_BIND
)
1711 When a parameter of reference type is not bound directly to an
1712 argument expression, the conversion sequence is the one required
1713 to convert the argument expression to the underlying type of the
1714 reference according to _over.best.ics_. Conceptually, this
1715 conversion sequence corresponds to copy-initializing a temporary
1716 of the underlying type with the argument expression. Any
1717 difference in top-level cv-qualification is subsumed by the
1718 initialization itself and does not constitute a conversion. */
1722 Otherwise, the reference shall be an lvalue reference to a
1723 non-volatile const type, or the reference shall be an rvalue
1726 We try below to treat this as a bad conversion to improve diagnostics,
1727 but if TO is an incomplete class, we need to reject this conversion
1728 now to avoid unnecessary instantiation. */
1729 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
)
1730 && !COMPLETE_TYPE_P (to
))
1733 /* We're generating a temporary now, but don't bind any more in the
1734 conversion (specifically, don't slice the temporary returned by a
1735 conversion operator). */
1736 flags
|= LOOKUP_NO_TEMP_BIND
;
1738 /* Core issue 899: When [copy-]initializing a temporary to be bound
1739 to the first parameter of a copy constructor (12.8) called with
1740 a single argument in the context of direct-initialization,
1741 explicit conversion functions are also considered.
1743 So don't set LOOKUP_ONLYCONVERTING in that case. */
1744 if (!(flags
& LOOKUP_COPY_PARM
))
1745 flags
|= LOOKUP_ONLYCONVERTING
;
1748 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1753 if (conv
->user_conv_p
)
1755 /* If initializing the temporary used a conversion function,
1756 recalculate the second conversion sequence. */
1757 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1758 if (t
->kind
== ck_user
1759 && DECL_CONV_FN_P (t
->cand
->fn
))
1761 tree ftype
= TREE_TYPE (TREE_TYPE (t
->cand
->fn
));
1762 int sflags
= (flags
|LOOKUP_NO_CONVERSION
)&~LOOKUP_NO_TEMP_BIND
;
1763 conversion
*new_second
1764 = reference_binding (rto
, ftype
, NULL_TREE
, c_cast_p
,
1768 return merge_conversion_sequences (t
, new_second
);
1772 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1773 /* This reference binding, unlike those above, requires the
1774 creation of a temporary. */
1775 conv
->need_temporary_p
= true;
1776 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1780 Otherwise, the reference shall be an lvalue reference to a
1781 non-volatile const type, or the reference shall be an rvalue
1783 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1788 Otherwise, a temporary of type "cv1 T1" is created and
1789 initialized from the initializer expression using the rules for a
1790 non-reference copy initialization. If T1 is reference-related to
1791 T2, cv1 must be the same cv-qualification as, or greater
1792 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1793 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1799 /* Returns the implicit conversion sequence (see [over.ics]) from type
1800 FROM to type TO. The optional expression EXPR may affect the
1801 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1802 true, this conversion is coming from a C-style cast. */
1805 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1806 int flags
, tsubst_flags_t complain
)
1810 if (from
== error_mark_node
|| to
== error_mark_node
1811 || expr
== error_mark_node
)
1814 /* Other flags only apply to the primary function in overload
1815 resolution, or after we've chosen one. */
1816 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1817 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1818 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1820 /* FIXME: actually we don't want warnings either, but we can't just
1821 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1822 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1823 We really ought not to issue that warning until we've committed
1824 to that conversion. */
1825 complain
&= ~tf_error
;
1827 /* Call reshape_init early to remove redundant braces. */
1828 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
)
1829 && CLASS_TYPE_P (to
)
1830 && COMPLETE_TYPE_P (complete_type (to
))
1831 && !CLASSTYPE_NON_AGGREGATE (to
))
1833 expr
= reshape_init (to
, expr
, complain
);
1834 if (expr
== error_mark_node
)
1836 from
= TREE_TYPE (expr
);
1839 if (TREE_CODE (to
) == REFERENCE_TYPE
)
1840 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1842 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
, complain
);
1847 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1849 if (is_std_init_list (to
))
1850 return build_list_conv (to
, expr
, flags
, complain
);
1852 /* As an extension, allow list-initialization of _Complex. */
1853 if (TREE_CODE (to
) == COMPLEX_TYPE
)
1855 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1860 /* Allow conversion from an initializer-list with one element to a
1862 if (SCALAR_TYPE_P (to
))
1864 int nelts
= CONSTRUCTOR_NELTS (expr
);
1868 elt
= build_value_init (to
, tf_none
);
1869 else if (nelts
== 1)
1870 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1872 elt
= error_mark_node
;
1874 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1875 c_cast_p
, flags
, complain
);
1878 conv
->check_narrowing
= true;
1879 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1880 /* Too many levels of braces, i.e. '{{1}}'. */
1885 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1886 return build_array_conv (to
, expr
, flags
, complain
);
1889 if (expr
!= NULL_TREE
1890 && (MAYBE_CLASS_TYPE_P (from
)
1891 || MAYBE_CLASS_TYPE_P (to
))
1892 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1894 struct z_candidate
*cand
;
1896 if (CLASS_TYPE_P (to
)
1897 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
1898 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
1899 return build_aggr_conv (to
, expr
, flags
, complain
);
1901 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
1904 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
1905 && CONSTRUCTOR_NELTS (expr
) == 1
1906 && !is_list_ctor (cand
->fn
))
1908 /* "If C is not an initializer-list constructor and the
1909 initializer list has a single element of type cv U, where U is
1910 X or a class derived from X, the implicit conversion sequence
1911 has Exact Match rank if U is X, or Conversion rank if U is
1913 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1914 tree elttype
= TREE_TYPE (elt
);
1915 if (reference_related_p (to
, elttype
))
1916 return implicit_conversion (to
, elttype
, elt
,
1917 c_cast_p
, flags
, complain
);
1919 conv
= cand
->second_conv
;
1922 /* We used to try to bind a reference to a temporary here, but that
1923 is now handled after the recursive call to this function at the end
1924 of reference_binding. */
1931 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1932 functions. ARGS will not be changed until a single candidate is
1935 static struct z_candidate
*
1936 add_candidate (struct z_candidate
**candidates
,
1937 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
1938 size_t num_convs
, conversion
**convs
,
1939 tree access_path
, tree conversion_path
,
1940 int viable
, struct rejection_reason
*reason
,
1943 struct z_candidate
*cand
= (struct z_candidate
*)
1944 conversion_obstack_alloc (sizeof (struct z_candidate
));
1947 cand
->first_arg
= first_arg
;
1949 cand
->convs
= convs
;
1950 cand
->num_convs
= num_convs
;
1951 cand
->access_path
= access_path
;
1952 cand
->conversion_path
= conversion_path
;
1953 cand
->viable
= viable
;
1954 cand
->reason
= reason
;
1955 cand
->next
= *candidates
;
1956 cand
->flags
= flags
;
1962 /* Return the number of remaining arguments in the parameter list
1963 beginning with ARG. */
1966 remaining_arguments (tree arg
)
1970 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
1971 arg
= TREE_CHAIN (arg
))
1977 /* Create an overload candidate for the function or method FN called
1978 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1979 FLAGS is passed on to implicit_conversion.
1981 This does not change ARGS.
1983 CTYPE, if non-NULL, is the type we want to pretend this function
1984 comes from for purposes of overload resolution. */
1986 static struct z_candidate
*
1987 add_function_candidate (struct z_candidate
**candidates
,
1988 tree fn
, tree ctype
, tree first_arg
,
1989 const vec
<tree
, va_gc
> *args
, tree access_path
,
1990 tree conversion_path
, int flags
,
1991 tsubst_flags_t complain
)
1993 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1997 tree orig_first_arg
= first_arg
;
2000 struct rejection_reason
*reason
= NULL
;
2002 /* At this point we should not see any functions which haven't been
2003 explicitly declared, except for friend functions which will have
2004 been found using argument dependent lookup. */
2005 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
2007 /* The `this', `in_chrg' and VTT arguments to constructors are not
2008 considered in overload resolution. */
2009 if (DECL_CONSTRUCTOR_P (fn
))
2011 if (ctor_omit_inherited_parms (fn
))
2012 /* Bring back parameters omitted from an inherited ctor. */
2013 parmlist
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn
));
2015 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
2016 skip
= num_artificial_parms_for (fn
);
2017 if (skip
> 0 && first_arg
!= NULL_TREE
)
2020 first_arg
= NULL_TREE
;
2026 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
2027 convs
= alloc_conversions (len
);
2029 /* 13.3.2 - Viable functions [over.match.viable]
2030 First, to be a viable function, a candidate function shall have enough
2031 parameters to agree in number with the arguments in the list.
2033 We need to check this first; otherwise, checking the ICSes might cause
2034 us to produce an ill-formed template instantiation. */
2036 parmnode
= parmlist
;
2037 for (i
= 0; i
< len
; ++i
)
2039 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
2041 parmnode
= TREE_CHAIN (parmnode
);
2044 if ((i
< len
&& parmnode
)
2045 || !sufficient_parms_p (parmnode
))
2047 int remaining
= remaining_arguments (parmnode
);
2049 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
2052 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2053 parameter of type "reference to cv C" (including such a constructor
2054 instantiated from a template) is excluded from the set of candidate
2055 functions when used to construct an object of type D with an argument list
2056 containing a single argument if C is reference-related to D. */
2057 if (viable
&& len
== 1 && parmlist
&& DECL_CONSTRUCTOR_P (fn
)
2058 && flag_new_inheriting_ctors
2059 && DECL_INHERITED_CTOR (fn
))
2061 tree ptype
= non_reference (TREE_VALUE (parmlist
));
2062 tree dtype
= DECL_CONTEXT (fn
);
2063 tree btype
= DECL_INHERITED_CTOR_BASE (fn
);
2064 if (reference_related_p (ptype
, dtype
)
2065 && reference_related_p (btype
, ptype
))
2068 reason
= inherited_ctor_rejection ();
2072 /* Second, for a function to be viable, its constraints must be
2074 if (flag_concepts
&& viable
2075 && !constraints_satisfied_p (fn
))
2077 reason
= constraint_failure (fn
);
2081 /* When looking for a function from a subobject from an implicit
2082 copy/move constructor/operator=, don't consider anything that takes (a
2083 reference to) an unrelated type. See c++/44909 and core 1092. */
2084 if (viable
&& parmlist
&& (flags
& LOOKUP_DEFAULTED
))
2086 if (DECL_CONSTRUCTOR_P (fn
))
2088 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
2089 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
))
2095 parmnode
= chain_index (i
-1, parmlist
);
2096 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
2101 /* This only applies at the top level. */
2102 flags
&= ~LOOKUP_DEFAULTED
;
2108 /* Third, for F to be a viable function, there shall exist for each
2109 argument an implicit conversion sequence that converts that argument
2110 to the corresponding parameter of F. */
2112 parmnode
= parmlist
;
2114 for (i
= 0; i
< len
; ++i
)
2116 tree argtype
, to_type
;
2121 if (parmnode
== void_list_node
)
2124 if (i
== 0 && first_arg
!= NULL_TREE
)
2127 arg
= CONST_CAST_TREE (
2128 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
2129 argtype
= lvalue_type (arg
);
2131 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2132 && ! DECL_CONSTRUCTOR_P (fn
));
2136 tree parmtype
= TREE_VALUE (parmnode
);
2139 parmnode
= TREE_CHAIN (parmnode
);
2141 /* The type of the implicit object parameter ('this') for
2142 overload resolution is not always the same as for the
2143 function itself; conversion functions are considered to
2144 be members of the class being converted, and functions
2145 introduced by a using-declaration are considered to be
2146 members of the class that uses them.
2148 Since build_over_call ignores the ICS for the `this'
2149 parameter, we can just change the parm type. */
2150 if (ctype
&& is_this
)
2152 parmtype
= cp_build_qualified_type
2153 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
2154 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
2156 /* If the function has a ref-qualifier, the implicit
2157 object parameter has reference type. */
2158 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
2159 parmtype
= cp_build_reference_type (parmtype
, rv
);
2160 /* The special handling of 'this' conversions in compare_ics
2161 does not apply if there is a ref-qualifier. */
2166 parmtype
= build_pointer_type (parmtype
);
2167 /* We don't use build_this here because we don't want to
2168 capture the object argument until we've chosen a
2169 non-static member function. */
2170 arg
= build_address (arg
);
2171 argtype
= lvalue_type (arg
);
2175 /* Core issue 899: When [copy-]initializing a temporary to be bound
2176 to the first parameter of a copy constructor (12.8) called with
2177 a single argument in the context of direct-initialization,
2178 explicit conversion functions are also considered.
2180 So set LOOKUP_COPY_PARM to let reference_binding know that
2181 it's being called in that context. We generalize the above
2182 to handle move constructors and template constructors as well;
2183 the standardese should soon be updated similarly. */
2184 if (ctype
&& i
== 0 && (len
-skip
== 1)
2185 && DECL_CONSTRUCTOR_P (fn
)
2186 && parmtype
!= error_mark_node
2187 && (same_type_ignoring_top_level_qualifiers_p
2188 (non_reference (parmtype
), ctype
)))
2190 if (!(flags
& LOOKUP_ONLYCONVERTING
))
2191 lflags
|= LOOKUP_COPY_PARM
;
2192 /* We allow user-defined conversions within init-lists, but
2193 don't list-initialize the copy parm, as that would mean
2194 using two levels of braces for the same type. */
2195 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
2196 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
2197 lflags
|= LOOKUP_NO_CONVERSION
;
2200 lflags
|= LOOKUP_ONLYCONVERTING
;
2202 t
= implicit_conversion (parmtype
, argtype
, arg
,
2203 /*c_cast_p=*/false, lflags
, complain
);
2208 t
= build_identity_conv (argtype
, arg
);
2209 t
->ellipsis_p
= true;
2220 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
);
2227 reason
= bad_arg_conversion_rejection (first_arg
, i
, arg
, to_type
);
2232 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2233 access_path
, conversion_path
, viable
, reason
, flags
);
2236 /* Create an overload candidate for the conversion function FN which will
2237 be invoked for expression OBJ, producing a pointer-to-function which
2238 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2239 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2240 passed on to implicit_conversion.
2242 Actually, we don't really care about FN; we care about the type it
2243 converts to. There may be multiple conversion functions that will
2244 convert to that type, and we rely on build_user_type_conversion_1 to
2245 choose the best one; so when we create our candidate, we record the type
2246 instead of the function. */
2248 static struct z_candidate
*
2249 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2250 const vec
<tree
, va_gc
> *arglist
,
2251 tree access_path
, tree conversion_path
,
2252 tsubst_flags_t complain
)
2254 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2255 int i
, len
, viable
, flags
;
2256 tree parmlist
, parmnode
;
2258 struct rejection_reason
*reason
;
2260 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2261 parmlist
= TREE_TYPE (parmlist
);
2262 parmlist
= TYPE_ARG_TYPES (parmlist
);
2264 len
= vec_safe_length (arglist
) + 1;
2265 convs
= alloc_conversions (len
);
2266 parmnode
= parmlist
;
2268 flags
= LOOKUP_IMPLICIT
;
2271 /* Don't bother looking up the same type twice. */
2272 if (*candidates
&& (*candidates
)->fn
== totype
)
2275 for (i
= 0; i
< len
; ++i
)
2277 tree arg
, argtype
, convert_type
= NULL_TREE
;
2283 arg
= (*arglist
)[i
- 1];
2284 argtype
= lvalue_type (arg
);
2288 t
= build_identity_conv (argtype
, NULL_TREE
);
2289 t
= build_conv (ck_user
, totype
, t
);
2290 /* Leave the 'cand' field null; we'll figure out the conversion in
2291 convert_like_real if this candidate is chosen. */
2292 convert_type
= totype
;
2294 else if (parmnode
== void_list_node
)
2298 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2299 /*c_cast_p=*/false, flags
, complain
);
2300 convert_type
= TREE_VALUE (parmnode
);
2304 t
= build_identity_conv (argtype
, arg
);
2305 t
->ellipsis_p
= true;
2306 convert_type
= argtype
;
2316 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, arg
, convert_type
);
2323 parmnode
= TREE_CHAIN (parmnode
);
2327 || ! sufficient_parms_p (parmnode
))
2329 int remaining
= remaining_arguments (parmnode
);
2331 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2334 return add_candidate (candidates
, totype
, obj
, arglist
, len
, convs
,
2335 access_path
, conversion_path
, viable
, reason
, flags
);
2339 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2340 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2341 int flags
, tsubst_flags_t complain
)
2348 struct rejection_reason
*reason
= NULL
;
2353 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2354 convs
= alloc_conversions (num_convs
);
2356 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2357 conversion ops are allowed. We handle that here by just checking for
2358 boolean_type_node because other operators don't ask for it. COND_EXPR
2359 also does contextual conversion to bool for the first operand, but we
2360 handle that in build_conditional_expr, and type1 here is operand 2. */
2361 if (type1
!= boolean_type_node
)
2362 flags
|= LOOKUP_ONLYCONVERTING
;
2364 for (i
= 0; i
< 2; ++i
)
2369 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2370 /*c_cast_p=*/false, flags
, complain
);
2374 /* We need something for printing the candidate. */
2375 t
= build_identity_conv (types
[i
], NULL_TREE
);
2376 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2382 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, args
[i
],
2388 /* For COND_EXPR we rearranged the arguments; undo that now. */
2391 convs
[2] = convs
[1];
2392 convs
[1] = convs
[0];
2393 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2394 /*c_cast_p=*/false, flags
,
2401 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2406 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2408 /*access_path=*/NULL_TREE
,
2409 /*conversion_path=*/NULL_TREE
,
2410 viable
, reason
, flags
);
2414 is_complete (tree t
)
2416 return COMPLETE_TYPE_P (complete_type (t
));
2419 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2422 promoted_arithmetic_type_p (tree type
)
2426 In this section, the term promoted integral type is used to refer
2427 to those integral types which are preserved by integral promotion
2428 (including e.g. int and long but excluding e.g. char).
2429 Similarly, the term promoted arithmetic type refers to promoted
2430 integral types plus floating types. */
2431 return ((CP_INTEGRAL_TYPE_P (type
)
2432 && same_type_p (type_promotes_to (type
), type
))
2433 || TREE_CODE (type
) == REAL_TYPE
);
2436 /* Create any builtin operator overload candidates for the operator in
2437 question given the converted operand types TYPE1 and TYPE2. The other
2438 args are passed through from add_builtin_candidates to
2439 build_builtin_candidate.
2441 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2442 If CODE is requires candidates operands of the same type of the kind
2443 of which TYPE1 and TYPE2 are, we add both candidates
2444 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2447 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2448 enum tree_code code2
, tree fnname
, tree type1
,
2449 tree type2
, tree
*args
, tree
*argtypes
, int flags
,
2450 tsubst_flags_t complain
)
2454 case POSTINCREMENT_EXPR
:
2455 case POSTDECREMENT_EXPR
:
2456 args
[1] = integer_zero_node
;
2457 type2
= integer_type_node
;
2466 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2467 and VQ is either volatile or empty, there exist candidate operator
2468 functions of the form
2469 VQ T& operator++(VQ T&);
2470 T operator++(VQ T&, int);
2471 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2472 type other than bool, and VQ is either volatile or empty, there exist
2473 candidate operator functions of the form
2474 VQ T& operator--(VQ T&);
2475 T operator--(VQ T&, int);
2476 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2477 complete object type, and VQ is either volatile or empty, there exist
2478 candidate operator functions of the form
2479 T*VQ& operator++(T*VQ&);
2480 T*VQ& operator--(T*VQ&);
2481 T* operator++(T*VQ&, int);
2482 T* operator--(T*VQ&, int); */
2484 case POSTDECREMENT_EXPR
:
2485 case PREDECREMENT_EXPR
:
2486 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2489 case POSTINCREMENT_EXPR
:
2490 case PREINCREMENT_EXPR
:
2491 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2493 type1
= build_reference_type (type1
);
2498 /* 7 For every cv-qualified or cv-unqualified object type T, there
2499 exist candidate operator functions of the form
2503 8 For every function type T, there exist candidate operator functions of
2505 T& operator*(T*); */
2508 if (TYPE_PTR_P (type1
)
2509 && (TYPE_PTROB_P (type1
)
2510 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2514 /* 9 For every type T, there exist candidate operator functions of the form
2517 10For every promoted arithmetic type T, there exist candidate operator
2518 functions of the form
2522 case UNARY_PLUS_EXPR
: /* unary + */
2523 if (TYPE_PTR_P (type1
))
2527 if (ARITHMETIC_TYPE_P (type1
))
2531 /* 11For every promoted integral type T, there exist candidate operator
2532 functions of the form
2536 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2540 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2541 is the same type as C2 or is a derived class of C2, T is a complete
2542 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2543 there exist candidate operator functions of the form
2544 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2545 where CV12 is the union of CV1 and CV2. */
2548 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2550 tree c1
= TREE_TYPE (type1
);
2551 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2553 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2554 && (TYPE_PTRMEMFUNC_P (type2
)
2555 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2560 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2561 didate operator functions of the form
2566 bool operator<(L, R);
2567 bool operator>(L, R);
2568 bool operator<=(L, R);
2569 bool operator>=(L, R);
2570 bool operator==(L, R);
2571 bool operator!=(L, R);
2572 where LR is the result of the usual arithmetic conversions between
2575 14For every pair of types T and I, where T is a cv-qualified or cv-
2576 unqualified complete object type and I is a promoted integral type,
2577 there exist candidate operator functions of the form
2578 T* operator+(T*, I);
2579 T& operator[](T*, I);
2580 T* operator-(T*, I);
2581 T* operator+(I, T*);
2582 T& operator[](I, T*);
2584 15For every T, where T is a pointer to complete object type, there exist
2585 candidate operator functions of the form112)
2586 ptrdiff_t operator-(T, T);
2588 16For every pointer or enumeration type T, there exist candidate operator
2589 functions of the form
2590 bool operator<(T, T);
2591 bool operator>(T, T);
2592 bool operator<=(T, T);
2593 bool operator>=(T, T);
2594 bool operator==(T, T);
2595 bool operator!=(T, T);
2597 17For every pointer to member type T, there exist candidate operator
2598 functions of the form
2599 bool operator==(T, T);
2600 bool operator!=(T, T); */
2603 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2605 if (TYPE_PTROB_P (type1
)
2606 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2608 type2
= ptrdiff_type_node
;
2613 case TRUNC_DIV_EXPR
:
2614 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2620 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2621 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2623 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2628 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2640 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2642 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2644 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2645 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2647 if (TYPE_PTR_P (type1
)
2648 && null_ptr_cst_p (args
[1]))
2653 if (null_ptr_cst_p (args
[0])
2654 && TYPE_PTR_P (type2
))
2662 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2666 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2668 type1
= ptrdiff_type_node
;
2671 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2673 type2
= ptrdiff_type_node
;
2678 /* 18For every pair of promoted integral types L and R, there exist candi-
2679 date operator functions of the form
2686 where LR is the result of the usual arithmetic conversions between
2689 case TRUNC_MOD_EXPR
:
2695 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2699 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2700 type, VQ is either volatile or empty, and R is a promoted arithmetic
2701 type, there exist candidate operator functions of the form
2702 VQ L& operator=(VQ L&, R);
2703 VQ L& operator*=(VQ L&, R);
2704 VQ L& operator/=(VQ L&, R);
2705 VQ L& operator+=(VQ L&, R);
2706 VQ L& operator-=(VQ L&, R);
2708 20For every pair T, VQ), where T is any type and VQ is either volatile
2709 or empty, there exist candidate operator functions of the form
2710 T*VQ& operator=(T*VQ&, T*);
2712 21For every pair T, VQ), where T is a pointer to member type and VQ is
2713 either volatile or empty, there exist candidate operator functions of
2715 VQ T& operator=(VQ T&, T);
2717 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2718 unqualified complete object type, VQ is either volatile or empty, and
2719 I is a promoted integral type, there exist candidate operator func-
2721 T*VQ& operator+=(T*VQ&, I);
2722 T*VQ& operator-=(T*VQ&, I);
2724 23For every triple L, VQ, R), where L is an integral or enumeration
2725 type, VQ is either volatile or empty, and R is a promoted integral
2726 type, there exist candidate operator functions of the form
2728 VQ L& operator%=(VQ L&, R);
2729 VQ L& operator<<=(VQ L&, R);
2730 VQ L& operator>>=(VQ L&, R);
2731 VQ L& operator&=(VQ L&, R);
2732 VQ L& operator^=(VQ L&, R);
2733 VQ L& operator|=(VQ L&, R); */
2740 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2742 type2
= ptrdiff_type_node
;
2747 case TRUNC_DIV_EXPR
:
2748 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2752 case TRUNC_MOD_EXPR
:
2758 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2763 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2765 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2766 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2767 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2768 || ((TYPE_PTRMEMFUNC_P (type1
)
2769 || TYPE_PTR_P (type1
))
2770 && null_ptr_cst_p (args
[1])))
2780 type1
= build_reference_type (type1
);
2786 For every pair of promoted arithmetic types L and R, there
2787 exist candidate operator functions of the form
2789 LR operator?(bool, L, R);
2791 where LR is the result of the usual arithmetic conversions
2792 between types L and R.
2794 For every type T, where T is a pointer or pointer-to-member
2795 type, there exist candidate operator functions of the form T
2796 operator?(bool, T, T); */
2798 if (promoted_arithmetic_type_p (type1
)
2799 && promoted_arithmetic_type_p (type2
))
2803 /* Otherwise, the types should be pointers. */
2804 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2807 /* We don't check that the two types are the same; the logic
2808 below will actually create two candidates; one in which both
2809 parameter types are TYPE1, and one in which both parameter
2815 if (ARITHMETIC_TYPE_P (type1
))
2823 /* Make sure we don't create builtin candidates with dependent types. */
2824 bool u1
= uses_template_parms (type1
);
2825 bool u2
= type2
? uses_template_parms (type2
) : false;
2828 /* Try to recover if one of the types is non-dependent. But if
2829 there's only one type, there's nothing we can do. */
2832 /* And we lose if both are dependent. */
2835 /* Or if they have different forms. */
2836 if (TREE_CODE (type1
) != TREE_CODE (type2
))
2845 /* If we're dealing with two pointer types or two enumeral types,
2846 we need candidates for both of them. */
2847 if (type2
&& !same_type_p (type1
, type2
)
2848 && TREE_CODE (type1
) == TREE_CODE (type2
)
2849 && (TREE_CODE (type1
) == REFERENCE_TYPE
2850 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2851 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2852 || TYPE_PTRMEMFUNC_P (type1
)
2853 || MAYBE_CLASS_TYPE_P (type1
)
2854 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2856 if (TYPE_PTR_OR_PTRMEM_P (type1
))
2858 tree cptype
= composite_pointer_type (type1
, type2
,
2863 if (cptype
!= error_mark_node
)
2865 build_builtin_candidate
2866 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
2872 build_builtin_candidate
2873 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
2874 build_builtin_candidate
2875 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
2879 build_builtin_candidate
2880 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
2884 type_decays_to (tree type
)
2886 if (TREE_CODE (type
) == ARRAY_TYPE
)
2887 return build_pointer_type (TREE_TYPE (type
));
2888 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2889 return build_pointer_type (type
);
2893 /* There are three conditions of builtin candidates:
2895 1) bool-taking candidates. These are the same regardless of the input.
2896 2) pointer-pair taking candidates. These are generated for each type
2897 one of the input types converts to.
2898 3) arithmetic candidates. According to the standard, we should generate
2899 all of these, but I'm trying not to...
2901 Here we generate a superset of the possible candidates for this particular
2902 case. That is a subset of the full set the standard defines, plus some
2903 other cases which the standard disallows. add_builtin_candidate will
2904 filter out the invalid set. */
2907 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2908 enum tree_code code2
, tree fnname
, tree
*args
,
2909 int flags
, tsubst_flags_t complain
)
2913 tree type
, argtypes
[3], t
;
2914 /* TYPES[i] is the set of possible builtin-operator parameter types
2915 we will consider for the Ith argument. */
2916 vec
<tree
, va_gc
> *types
[2];
2919 for (i
= 0; i
< 3; ++i
)
2922 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2924 argtypes
[i
] = NULL_TREE
;
2929 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2930 and VQ is either volatile or empty, there exist candidate operator
2931 functions of the form
2932 VQ T& operator++(VQ T&); */
2934 case POSTINCREMENT_EXPR
:
2935 case PREINCREMENT_EXPR
:
2936 case POSTDECREMENT_EXPR
:
2937 case PREDECREMENT_EXPR
:
2942 /* 24There also exist candidate operator functions of the form
2943 bool operator!(bool);
2944 bool operator&&(bool, bool);
2945 bool operator||(bool, bool); */
2947 case TRUTH_NOT_EXPR
:
2948 build_builtin_candidate
2949 (candidates
, fnname
, boolean_type_node
,
2950 NULL_TREE
, args
, argtypes
, flags
, complain
);
2953 case TRUTH_ORIF_EXPR
:
2954 case TRUTH_ANDIF_EXPR
:
2955 build_builtin_candidate
2956 (candidates
, fnname
, boolean_type_node
,
2957 boolean_type_node
, args
, argtypes
, flags
, complain
);
2979 types
[0] = make_tree_vector ();
2980 types
[1] = make_tree_vector ();
2982 for (i
= 0; i
< 2; ++i
)
2986 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
2990 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
2993 convs
= lookup_conversions (argtypes
[i
]);
2995 if (code
== COND_EXPR
)
2997 if (lvalue_p (args
[i
]))
2998 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3000 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
3006 for (; convs
; convs
= TREE_CHAIN (convs
))
3008 type
= TREE_TYPE (convs
);
3011 && (TREE_CODE (type
) != REFERENCE_TYPE
3012 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
3015 if (code
== COND_EXPR
&& TREE_CODE (type
) == REFERENCE_TYPE
)
3016 vec_safe_push (types
[i
], type
);
3018 type
= non_reference (type
);
3019 if (i
!= 0 || ! ref1
)
3021 type
= cv_unqualified (type_decays_to (type
));
3022 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
3023 vec_safe_push (types
[i
], type
);
3024 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3025 type
= type_promotes_to (type
);
3028 if (! vec_member (type
, types
[i
]))
3029 vec_safe_push (types
[i
], type
);
3034 if (code
== COND_EXPR
&& lvalue_p (args
[i
]))
3035 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3036 type
= non_reference (argtypes
[i
]);
3037 if (i
!= 0 || ! ref1
)
3039 type
= cv_unqualified (type_decays_to (type
));
3040 if (enum_p
&& UNSCOPED_ENUM_P (type
))
3041 vec_safe_push (types
[i
], type
);
3042 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3043 type
= type_promotes_to (type
);
3045 vec_safe_push (types
[i
], type
);
3049 /* Run through the possible parameter types of both arguments,
3050 creating candidates with those parameter types. */
3051 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
3056 if (!types
[1]->is_empty ())
3057 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
3058 add_builtin_candidate
3059 (candidates
, code
, code2
, fnname
, t
,
3060 u
, args
, argtypes
, flags
, complain
);
3062 add_builtin_candidate
3063 (candidates
, code
, code2
, fnname
, t
,
3064 NULL_TREE
, args
, argtypes
, flags
, complain
);
3067 release_tree_vector (types
[0]);
3068 release_tree_vector (types
[1]);
3072 /* If TMPL can be successfully instantiated as indicated by
3073 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3075 TMPL is the template. EXPLICIT_TARGS are any explicit template
3076 arguments. ARGLIST is the arguments provided at the call-site.
3077 This does not change ARGLIST. The RETURN_TYPE is the desired type
3078 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3079 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3080 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3082 static struct z_candidate
*
3083 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
3084 tree ctype
, tree explicit_targs
, tree first_arg
,
3085 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3086 tree access_path
, tree conversion_path
,
3087 int flags
, tree obj
, unification_kind_t strict
,
3088 tsubst_flags_t complain
)
3090 int ntparms
= DECL_NTPARMS (tmpl
);
3091 tree targs
= make_tree_vec (ntparms
);
3092 unsigned int len
= vec_safe_length (arglist
);
3093 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
3094 unsigned int skip_without_in_chrg
= 0;
3095 tree first_arg_without_in_chrg
= first_arg
;
3096 tree
*args_without_in_chrg
;
3097 unsigned int nargs_without_in_chrg
;
3098 unsigned int ia
, ix
;
3100 struct z_candidate
*cand
;
3102 struct rejection_reason
*reason
= NULL
;
3105 /* We don't do deduction on the in-charge parameter, the VTT
3106 parameter or 'this'. */
3107 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
3109 if (first_arg_without_in_chrg
!= NULL_TREE
)
3110 first_arg_without_in_chrg
= NULL_TREE
;
3111 else if (return_type
&& strict
== DEDUCE_CALL
)
3112 /* We're deducing for a call to the result of a template conversion
3113 function, so the args don't contain 'this'; leave them alone. */;
3115 ++skip_without_in_chrg
;
3118 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
3119 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
3120 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
3122 if (first_arg_without_in_chrg
!= NULL_TREE
)
3123 first_arg_without_in_chrg
= NULL_TREE
;
3125 ++skip_without_in_chrg
;
3128 if (len
< skip_without_in_chrg
)
3131 if (DECL_CONSTRUCTOR_P (tmpl
) && nargs
== 2
3132 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg
),
3133 TREE_TYPE ((*arglist
)[0])))
3135 /* 12.8/6 says, "A declaration of a constructor for a class X is
3136 ill-formed if its first parameter is of type (optionally cv-qualified)
3137 X and either there are no other parameters or else all other
3138 parameters have default arguments. A member function template is never
3139 instantiated to produce such a constructor signature."
3141 So if we're trying to copy an object of the containing class, don't
3142 consider a template constructor that has a first parameter type that
3143 is just a template parameter, as we would deduce a signature that we
3144 would then reject in the code below. */
3145 if (tree firstparm
= FUNCTION_FIRST_USER_PARMTYPE (tmpl
))
3147 firstparm
= TREE_VALUE (firstparm
);
3148 if (PACK_EXPANSION_P (firstparm
))
3149 firstparm
= PACK_EXPANSION_PATTERN (firstparm
);
3150 if (TREE_CODE (firstparm
) == TEMPLATE_TYPE_PARM
)
3152 gcc_assert (!explicit_targs
);
3153 reason
= invalid_copy_with_fn_template_rejection ();
3159 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
3160 + (len
- skip_without_in_chrg
));
3161 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
3163 if (first_arg_without_in_chrg
!= NULL_TREE
)
3165 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
3168 for (ix
= skip_without_in_chrg
;
3169 vec_safe_iterate (arglist
, ix
, &arg
);
3172 args_without_in_chrg
[ia
] = arg
;
3175 gcc_assert (ia
== nargs_without_in_chrg
);
3177 errs
= errorcount
+sorrycount
;
3178 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
3179 args_without_in_chrg
,
3180 nargs_without_in_chrg
,
3181 return_type
, strict
, flags
, false,
3182 complain
& tf_decltype
);
3184 if (fn
== error_mark_node
)
3186 /* Don't repeat unification later if it already resulted in errors. */
3187 if (errorcount
+sorrycount
== errs
)
3188 reason
= template_unification_rejection (tmpl
, explicit_targs
,
3189 targs
, args_without_in_chrg
,
3190 nargs_without_in_chrg
,
3191 return_type
, strict
, flags
);
3193 reason
= template_unification_error_rejection ();
3197 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
3199 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
3200 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
3203 /* We're trying to produce a constructor with a prohibited signature,
3204 as discussed above; handle here any cases we didn't catch then,
3206 reason
= invalid_copy_with_fn_template_rejection ();
3211 if (obj
!= NULL_TREE
)
3212 /* Aha, this is a conversion function. */
3213 cand
= add_conv_candidate (candidates
, fn
, obj
, arglist
,
3214 access_path
, conversion_path
, complain
);
3216 cand
= add_function_candidate (candidates
, fn
, ctype
,
3217 first_arg
, arglist
, access_path
,
3218 conversion_path
, flags
, complain
);
3219 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
3220 /* This situation can occur if a member template of a template
3221 class is specialized. Then, instantiate_template might return
3222 an instantiation of the specialization, in which case the
3223 DECL_TI_TEMPLATE field will point at the original
3224 specialization. For example:
3226 template <class T> struct S { template <class U> void f(U);
3227 template <> void f(int) {}; };
3231 Here, TMPL will be template <class U> S<double>::f(U).
3232 And, instantiate template will give us the specialization
3233 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3234 for this will point at template <class T> template <> S<T>::f(int),
3235 so that we can find the definition. For the purposes of
3236 overload resolution, however, we want the original TMPL. */
3237 cand
->template_decl
= build_template_info (tmpl
, targs
);
3239 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3240 cand
->explicit_targs
= explicit_targs
;
3244 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3245 access_path
, conversion_path
, 0, reason
, flags
);
3249 static struct z_candidate
*
3250 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3251 tree explicit_targs
, tree first_arg
,
3252 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3253 tree access_path
, tree conversion_path
, int flags
,
3254 unification_kind_t strict
, tsubst_flags_t complain
)
3257 add_template_candidate_real (candidates
, tmpl
, ctype
,
3258 explicit_targs
, first_arg
, arglist
,
3259 return_type
, access_path
, conversion_path
,
3260 flags
, NULL_TREE
, strict
, complain
);
3263 /* Create an overload candidate for the conversion function template TMPL,
3264 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3265 pointer-to-function which will in turn be called with the argument list
3266 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3267 passed on to implicit_conversion. */
3269 static struct z_candidate
*
3270 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3272 const vec
<tree
, va_gc
> *arglist
,
3273 tree return_type
, tree access_path
,
3274 tree conversion_path
, tsubst_flags_t complain
)
3276 /* Making this work broke PR 71117, so until the committee resolves core
3277 issue 2189, let's disable this candidate if there are any viable call
3279 if (any_strictly_viable (*candidates
))
3283 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3284 NULL_TREE
, arglist
, return_type
, access_path
,
3285 conversion_path
, 0, obj
, DEDUCE_CALL
,
3289 /* The CANDS are the set of candidates that were considered for
3290 overload resolution. Return the set of viable candidates, or CANDS
3291 if none are viable. If any of the candidates were viable, set
3292 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3293 considered viable only if it is strictly viable. */
3295 static struct z_candidate
*
3296 splice_viable (struct z_candidate
*cands
,
3300 struct z_candidate
*viable
;
3301 struct z_candidate
**last_viable
;
3302 struct z_candidate
**cand
;
3303 bool found_strictly_viable
= false;
3305 /* Be strict inside templates, since build_over_call won't actually
3306 do the conversions to get pedwarns. */
3307 if (processing_template_decl
)
3311 last_viable
= &viable
;
3312 *any_viable_p
= false;
3317 struct z_candidate
*c
= *cand
;
3319 && (c
->viable
== 1 || TREE_CODE (c
->fn
) == TEMPLATE_DECL
))
3321 /* Be strict in the presence of a viable candidate. Also if
3322 there are template candidates, so that we get deduction errors
3323 for them instead of silently preferring a bad conversion. */
3325 if (viable
&& !found_strictly_viable
)
3327 /* Put any spliced near matches back onto the main list so
3328 that we see them if there is no strict match. */
3329 *any_viable_p
= false;
3330 *last_viable
= cands
;
3333 last_viable
= &viable
;
3337 if (strict_p
? c
->viable
== 1 : c
->viable
)
3342 last_viable
= &c
->next
;
3343 *any_viable_p
= true;
3345 found_strictly_viable
= true;
3351 return viable
? viable
: cands
;
3355 any_strictly_viable (struct z_candidate
*cands
)
3357 for (; cands
; cands
= cands
->next
)
3358 if (cands
->viable
== 1)
3363 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3364 words, it is about to become the "this" pointer for a member
3365 function call. Take the address of the object. */
3368 build_this (tree obj
)
3370 /* In a template, we are only concerned about the type of the
3371 expression, so we can take a shortcut. */
3372 if (processing_template_decl
)
3373 return build_address (obj
);
3375 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3378 /* Returns true iff functions are equivalent. Equivalent functions are
3379 not '==' only if one is a function-local extern function or if
3380 both are extern "C". */
3383 equal_functions (tree fn1
, tree fn2
)
3385 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3387 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3389 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3390 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3391 return decls_match (fn1
, fn2
);
3395 /* Print information about a candidate being rejected due to INFO. */
3398 print_conversion_rejection (location_t loc
, struct conversion_info
*info
)
3400 tree from
= info
->from
;
3402 from
= lvalue_type (from
);
3403 if (info
->n_arg
== -1)
3405 /* Conversion of implicit `this' argument failed. */
3406 if (!TYPE_P (info
->from
))
3407 /* A bad conversion for 'this' must be discarding cv-quals. */
3408 inform (loc
, " passing %qT as %<this%> "
3409 "argument discards qualifiers",
3412 inform (loc
, " no known conversion for implicit "
3413 "%<this%> parameter from %qH to %qI",
3414 from
, info
->to_type
);
3416 else if (!TYPE_P (info
->from
))
3418 if (info
->n_arg
>= 0)
3419 inform (loc
, " conversion of argument %d would be ill-formed:",
3421 perform_implicit_conversion (info
->to_type
, info
->from
,
3422 tf_warning_or_error
);
3424 else if (info
->n_arg
== -2)
3425 /* Conversion of conversion function return value failed. */
3426 inform (loc
, " no known conversion from %qH to %qI",
3427 from
, info
->to_type
);
3429 inform (loc
, " no known conversion for argument %d from %qH to %qI",
3430 info
->n_arg
+ 1, from
, info
->to_type
);
3433 /* Print information about a candidate with WANT parameters and we found
3437 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3439 inform_n (loc
, want
,
3440 " candidate expects %d argument, %d provided",
3441 " candidate expects %d arguments, %d provided",
3445 /* Print information about one overload candidate CANDIDATE. MSGSTR
3446 is the text to print before the candidate itself.
3448 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3449 to have been run through gettext by the caller. This wart makes
3450 life simpler in print_z_candidates and for the translators. */
3453 print_z_candidate (location_t loc
, const char *msgstr
,
3454 struct z_candidate
*candidate
)
3456 const char *msg
= (msgstr
== NULL
3458 : ACONCAT ((msgstr
, " ", NULL
)));
3459 tree fn
= candidate
->fn
;
3460 if (flag_new_inheriting_ctors
)
3461 fn
= strip_inheriting_ctors (fn
);
3462 location_t cloc
= location_of (fn
);
3464 if (identifier_p (fn
))
3467 if (candidate
->num_convs
== 3)
3468 inform (cloc
, "%s%<%D(%T, %T, %T)%> <built-in>", msg
, fn
,
3469 candidate
->convs
[0]->type
,
3470 candidate
->convs
[1]->type
,
3471 candidate
->convs
[2]->type
);
3472 else if (candidate
->num_convs
== 2)
3473 inform (cloc
, "%s%<%D(%T, %T)%> <built-in>", msg
, fn
,
3474 candidate
->convs
[0]->type
,
3475 candidate
->convs
[1]->type
);
3477 inform (cloc
, "%s%<%D(%T)%> <built-in>", msg
, fn
,
3478 candidate
->convs
[0]->type
);
3480 else if (TYPE_P (fn
))
3481 inform (cloc
, "%s%qT <conversion>", msg
, fn
);
3482 else if (candidate
->viable
== -1)
3483 inform (cloc
, "%s%#qD <near match>", msg
, fn
);
3484 else if (DECL_DELETED_FN (fn
))
3485 inform (cloc
, "%s%#qD <deleted>", msg
, fn
);
3487 inform (cloc
, "%s%#qD", msg
, fn
);
3488 if (fn
!= candidate
->fn
)
3490 cloc
= location_of (candidate
->fn
);
3491 inform (cloc
, " inherited here");
3493 /* Give the user some information about why this candidate failed. */
3494 if (candidate
->reason
!= NULL
)
3496 struct rejection_reason
*r
= candidate
->reason
;
3501 print_arity_information (cloc
, r
->u
.arity
.actual
,
3502 r
->u
.arity
.expected
);
3504 case rr_arg_conversion
:
3505 print_conversion_rejection (cloc
, &r
->u
.conversion
);
3507 case rr_bad_arg_conversion
:
3508 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
);
3510 case rr_explicit_conversion
:
3511 inform (cloc
, " return type %qT of explicit conversion function "
3512 "cannot be converted to %qT with a qualification "
3513 "conversion", r
->u
.conversion
.from
,
3514 r
->u
.conversion
.to_type
);
3516 case rr_template_conversion
:
3517 inform (cloc
, " conversion from return type %qT of template "
3518 "conversion function specialization to %qT is not an "
3519 "exact match", r
->u
.conversion
.from
,
3520 r
->u
.conversion
.to_type
);
3522 case rr_template_unification
:
3523 /* We use template_unification_error_rejection if unification caused
3524 actual non-SFINAE errors, in which case we don't need to repeat
3526 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3528 inform (cloc
, " substitution of deduced template arguments "
3529 "resulted in errors seen above");
3532 /* Re-run template unification with diagnostics. */
3533 inform (cloc
, " template argument deduction/substitution failed:");
3534 fn_type_unification (r
->u
.template_unification
.tmpl
,
3535 r
->u
.template_unification
.explicit_targs
,
3537 (r
->u
.template_unification
.num_targs
)),
3538 r
->u
.template_unification
.args
,
3539 r
->u
.template_unification
.nargs
,
3540 r
->u
.template_unification
.return_type
,
3541 r
->u
.template_unification
.strict
,
3542 r
->u
.template_unification
.flags
,
3545 case rr_invalid_copy
:
3547 " a constructor taking a single argument of its own "
3548 "class type is invalid");
3550 case rr_constraint_failure
:
3552 tree tmpl
= r
->u
.template_instantiation
.tmpl
;
3553 tree args
= r
->u
.template_instantiation
.targs
;
3554 diagnose_constraints (cloc
, tmpl
, args
);
3557 case rr_inherited_ctor
:
3558 inform (cloc
, " an inherited constructor is not a candidate for "
3559 "initialization from an expression of the same or derived "
3564 /* This candidate didn't have any issues or we failed to
3565 handle a particular code. Either way... */
3572 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3574 struct z_candidate
*cand1
;
3575 struct z_candidate
**cand2
;
3580 /* Remove non-viable deleted candidates. */
3582 for (cand2
= &cand1
; *cand2
; )
3584 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3585 && !(*cand2
)->viable
3586 && DECL_DELETED_FN ((*cand2
)->fn
))
3587 *cand2
= (*cand2
)->next
;
3589 cand2
= &(*cand2
)->next
;
3591 /* ...if there are any non-deleted ones. */
3595 /* There may be duplicates in the set of candidates. We put off
3596 checking this condition as long as possible, since we have no way
3597 to eliminate duplicates from a set of functions in less than n^2
3598 time. Now we are about to emit an error message, so it is more
3599 permissible to go slowly. */
3600 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3602 tree fn
= cand1
->fn
;
3603 /* Skip builtin candidates and conversion functions. */
3606 cand2
= &cand1
->next
;
3609 if (DECL_P ((*cand2
)->fn
)
3610 && equal_functions (fn
, (*cand2
)->fn
))
3611 *cand2
= (*cand2
)->next
;
3613 cand2
= &(*cand2
)->next
;
3617 for (; candidates
; candidates
= candidates
->next
)
3618 print_z_candidate (loc
, "candidate:", candidates
);
3621 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3622 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3623 the result of the conversion function to convert it to the final
3624 desired type. Merge the two sequences into a single sequence,
3625 and return the merged sequence. */
3628 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3631 bool bad
= user_seq
->bad_p
;
3633 gcc_assert (user_seq
->kind
== ck_user
);
3635 /* Find the end of the second conversion sequence. */
3636 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3638 /* The entire sequence is a user-conversion sequence. */
3639 (*t
)->user_conv_p
= true;
3644 /* Replace the identity conversion with the user conversion
3651 /* Handle overload resolution for initializing an object of class type from
3652 an initializer list. First we look for a suitable constructor that
3653 takes a std::initializer_list; if we don't find one, we then look for a
3654 non-list constructor.
3656 Parameters are as for add_candidates, except that the arguments are in
3657 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3658 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3661 add_list_candidates (tree fns
, tree first_arg
,
3662 const vec
<tree
, va_gc
> *args
, tree totype
,
3663 tree explicit_targs
, bool template_only
,
3664 tree conversion_path
, tree access_path
,
3666 struct z_candidate
**candidates
,
3667 tsubst_flags_t complain
)
3669 gcc_assert (*candidates
== NULL
);
3671 /* We're looking for a ctor for list-initialization. */
3672 flags
|= LOOKUP_LIST_INIT_CTOR
;
3673 /* And we don't allow narrowing conversions. We also use this flag to
3674 avoid the copy constructor call for copy-list-initialization. */
3675 flags
|= LOOKUP_NO_NARROWING
;
3677 unsigned nart
= num_artificial_parms_for (OVL_FIRST (fns
)) - 1;
3678 tree init_list
= (*args
)[nart
];
3680 /* Always use the default constructor if the list is empty (DR 990). */
3681 if (CONSTRUCTOR_NELTS (init_list
) == 0
3682 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3684 /* If the class has a list ctor, try passing the list as a single
3685 argument first, but only consider list ctors. */
3686 else if (TYPE_HAS_LIST_CTOR (totype
))
3688 flags
|= LOOKUP_LIST_ONLY
;
3689 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3690 explicit_targs
, template_only
, conversion_path
,
3691 access_path
, flags
, candidates
, complain
);
3692 if (any_strictly_viable (*candidates
))
3696 /* Expand the CONSTRUCTOR into a new argument vec. */
3697 vec
<tree
, va_gc
> *new_args
;
3698 vec_alloc (new_args
, nart
+ CONSTRUCTOR_NELTS (init_list
));
3699 for (unsigned i
= 0; i
< nart
; ++i
)
3700 new_args
->quick_push ((*args
)[i
]);
3701 for (unsigned i
= 0; i
< CONSTRUCTOR_NELTS (init_list
); ++i
)
3702 new_args
->quick_push (CONSTRUCTOR_ELT (init_list
, i
)->value
);
3704 /* We aren't looking for list-ctors anymore. */
3705 flags
&= ~LOOKUP_LIST_ONLY
;
3706 /* We allow more user-defined conversions within an init-list. */
3707 flags
&= ~LOOKUP_NO_CONVERSION
;
3709 add_candidates (fns
, first_arg
, new_args
, NULL_TREE
,
3710 explicit_targs
, template_only
, conversion_path
,
3711 access_path
, flags
, candidates
, complain
);
3714 /* Returns the best overload candidate to perform the requested
3715 conversion. This function is used for three the overloading situations
3716 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3717 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3718 per [dcl.init.ref], so we ignore temporary bindings. */
3720 static struct z_candidate
*
3721 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3722 tsubst_flags_t complain
)
3724 struct z_candidate
*candidates
, *cand
;
3726 tree ctors
= NULL_TREE
;
3727 tree conv_fns
= NULL_TREE
;
3728 conversion
*conv
= NULL
;
3729 tree first_arg
= NULL_TREE
;
3730 vec
<tree
, va_gc
> *args
= NULL
;
3737 fromtype
= TREE_TYPE (expr
);
3739 /* We represent conversion within a hierarchy using RVALUE_CONV and
3740 BASE_CONV, as specified by [over.best.ics]; these become plain
3741 constructor calls, as specified in [dcl.init]. */
3742 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3743 || !DERIVED_FROM_P (totype
, fromtype
));
3745 if (CLASS_TYPE_P (totype
))
3746 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3747 creating a garbage BASELINK; constructors can't be inherited. */
3748 ctors
= get_class_binding (totype
, complete_ctor_identifier
);
3750 /* FIXME P0135 doesn't say what to do in C++17 about list-initialization from
3751 a single element. For now, let's handle constructors as before and also
3752 consider conversion operators from the element. */
3753 if (cxx_dialect
>= cxx17
3754 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
3755 && CONSTRUCTOR_NELTS (expr
) == 1)
3756 fromtype
= TREE_TYPE (CONSTRUCTOR_ELT (expr
, 0)->value
);
3758 if (MAYBE_CLASS_TYPE_P (fromtype
))
3760 tree to_nonref
= non_reference (totype
);
3761 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3762 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3763 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3765 /* [class.conv.fct] A conversion function is never used to
3766 convert a (possibly cv-qualified) object to the (possibly
3767 cv-qualified) same object type (or a reference to it), to a
3768 (possibly cv-qualified) base class of that type (or a
3769 reference to it)... */
3772 conv_fns
= lookup_conversions (fromtype
);
3776 flags
|= LOOKUP_NO_CONVERSION
;
3777 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3778 flags
|= LOOKUP_NO_NARROWING
;
3780 /* It's OK to bind a temporary for converting constructor arguments, but
3781 not in converting the return value of a conversion operator. */
3782 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
3783 | (flags
& LOOKUP_NO_NARROWING
));
3784 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3788 int ctorflags
= flags
;
3790 first_arg
= build_dummy_object (totype
);
3792 /* We should never try to call the abstract or base constructor
3794 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors
))
3795 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors
)));
3797 args
= make_tree_vector_single (expr
);
3798 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3800 /* List-initialization. */
3801 add_list_candidates (ctors
, first_arg
, args
, totype
, NULL_TREE
,
3802 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3803 ctorflags
, &candidates
, complain
);
3807 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3808 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3809 ctorflags
, &candidates
, complain
);
3812 for (cand
= candidates
; cand
; cand
= cand
->next
)
3814 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3816 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3817 set, then this is copy-initialization. In that case, "The
3818 result of the call is then used to direct-initialize the
3819 object that is the destination of the copy-initialization."
3822 We represent this in the conversion sequence with an
3823 rvalue conversion, which means a constructor call. */
3824 if (TREE_CODE (totype
) != REFERENCE_TYPE
3825 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3827 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3833 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3834 /* FIXME see above about C++17. */
3835 first_arg
= CONSTRUCTOR_ELT (expr
, 0)->value
;
3840 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3842 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3843 struct z_candidate
*old_candidates
;
3845 /* If we are called to convert to a reference type, we are trying to
3846 find a direct binding, so don't even consider temporaries. If
3847 we don't find a direct binding, the caller will try again to
3848 look for a temporary binding. */
3849 if (TREE_CODE (totype
) == REFERENCE_TYPE
)
3850 convflags
|= LOOKUP_NO_TEMP_BIND
;
3852 old_candidates
= candidates
;
3853 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
3855 conversion_path
, TYPE_BINFO (fromtype
),
3856 flags
, &candidates
, complain
);
3858 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
3860 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
3862 = implicit_conversion (totype
,
3865 /*c_cast_p=*/false, convflags
,
3868 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3869 copy-initialization. In that case, "The result of the
3870 call is then used to direct-initialize the object that is
3871 the destination of the copy-initialization." [dcl.init]
3873 We represent this in the conversion sequence with an
3874 rvalue conversion, which means a constructor call. But
3875 don't add a second rvalue conversion if there's already
3876 one there. Which there really shouldn't be, but it's
3877 harmless since we'd add it here anyway. */
3878 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
3879 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3880 ics
= build_conv (ck_rvalue
, totype
, ics
);
3882 cand
->second_conv
= ics
;
3887 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -2,
3890 else if (DECL_NONCONVERTING_P (cand
->fn
)
3891 && ics
->rank
> cr_exact
)
3893 /* 13.3.1.5: For direct-initialization, those explicit
3894 conversion functions that are not hidden within S and
3895 yield type T or a type that can be converted to type T
3896 with a qualification conversion (4.4) are also candidate
3898 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3899 I've raised this issue with the committee. --jason 9/2011 */
3901 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
3903 else if (cand
->viable
== 1 && ics
->bad_p
)
3907 = bad_arg_conversion_rejection (NULL_TREE
, -2,
3910 else if (primary_template_specialization_p (cand
->fn
)
3911 && ics
->rank
> cr_exact
)
3913 /* 13.3.3.1.2: If the user-defined conversion is specified by
3914 a specialization of a conversion function template, the
3915 second standard conversion sequence shall have exact match
3918 cand
->reason
= template_conversion_rejection (rettype
, totype
);
3923 candidates
= splice_viable (candidates
, false, &any_viable_p
);
3927 release_tree_vector (args
);
3931 cand
= tourney (candidates
, complain
);
3934 if (complain
& tf_error
)
3936 error ("conversion from %qH to %qI is ambiguous",
3938 print_z_candidates (location_of (expr
), candidates
);
3941 cand
= candidates
; /* any one will do */
3942 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
3943 cand
->second_conv
->user_conv_p
= true;
3944 if (!any_strictly_viable (candidates
))
3945 cand
->second_conv
->bad_p
= true;
3946 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3947 ambiguous conversion is no worse than another user-defined
3954 if (!DECL_CONSTRUCTOR_P (cand
->fn
))
3955 convtype
= non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)));
3956 else if (cand
->second_conv
->kind
== ck_rvalue
)
3957 /* DR 5: [in the first step of copy-initialization]...if the function
3958 is a constructor, the call initializes a temporary of the
3959 cv-unqualified version of the destination type. */
3960 convtype
= cv_unqualified (totype
);
3963 /* Build the user conversion sequence. */
3967 build_identity_conv (TREE_TYPE (expr
), expr
));
3969 if (cand
->viable
== -1)
3972 /* Remember that this was a list-initialization. */
3973 if (flags
& LOOKUP_NO_NARROWING
)
3974 conv
->check_narrowing
= true;
3976 /* Combine it with the second conversion sequence. */
3977 cand
->second_conv
= merge_conversion_sequences (conv
,
3983 /* Wrapper for above. */
3986 build_user_type_conversion (tree totype
, tree expr
, int flags
,
3987 tsubst_flags_t complain
)
3989 struct z_candidate
*cand
;
3992 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
3993 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
3997 if (cand
->second_conv
->kind
== ck_ambig
)
3998 ret
= error_mark_node
;
4001 expr
= convert_like (cand
->second_conv
, expr
, complain
);
4002 ret
= convert_from_reference (expr
);
4008 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4012 /* Subroutine of convert_nontype_argument.
4014 EXPR is an expression used in a context that requires a converted
4015 constant-expression, such as a template non-type parameter. Do any
4016 necessary conversions (that are permitted for converted
4017 constant-expressions) to convert it to the desired type.
4019 If conversion is successful, returns the converted expression;
4020 otherwise, returns error_mark_node. */
4023 build_converted_constant_expr (tree type
, tree expr
, tsubst_flags_t complain
)
4028 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
4030 if (error_operand_p (expr
))
4031 return error_mark_node
;
4033 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4034 p
= conversion_obstack_alloc (0);
4036 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
4038 LOOKUP_IMPLICIT
, complain
);
4040 /* A converted constant expression of type T is an expression, implicitly
4041 converted to type T, where the converted expression is a constant
4042 expression and the implicit conversion sequence contains only
4044 * user-defined conversions,
4045 * lvalue-to-rvalue conversions (7.1),
4046 * array-to-pointer conversions (7.2),
4047 * function-to-pointer conversions (7.3),
4048 * qualification conversions (7.5),
4049 * integral promotions (7.6),
4050 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4051 * null pointer conversions (7.11) from std::nullptr_t,
4052 * null member pointer conversions (7.12) from std::nullptr_t, and
4053 * function pointer conversions (7.13),
4055 and where the reference binding (if any) binds directly. */
4057 for (conversion
*c
= conv
;
4058 conv
&& c
->kind
!= ck_identity
;
4059 c
= next_conversion (c
))
4063 /* A conversion function is OK. If it isn't constexpr, we'll
4064 complain later that the argument isn't constant. */
4066 /* The lvalue-to-rvalue conversion is OK. */
4068 /* Array-to-pointer and function-to-pointer. */
4070 /* Function pointer conversions. */
4072 /* Qualification conversions. */
4077 if (c
->need_temporary_p
)
4079 if (complain
& tf_error
)
4080 error_at (loc
, "initializing %qH with %qI in converted "
4081 "constant expression does not bind directly",
4082 type
, next_conversion (c
)->type
);
4091 t
= next_conversion (c
)->type
;
4092 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
)
4093 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
4094 /* Integral promotion or conversion. */
4096 if (NULLPTR_TYPE_P (t
))
4097 /* Conversion from nullptr to pointer or pointer-to-member. */
4100 if (complain
& tf_error
)
4101 error_at (loc
, "conversion from %qH to %qI in a "
4102 "converted constant expression", t
, type
);
4111 /* Avoid confusing convert_nontype_argument by introducing
4112 a redundant conversion to the same reference type. */
4113 if (conv
&& conv
->kind
== ck_ref_bind
4114 && REFERENCE_REF_P (expr
))
4116 tree ref
= TREE_OPERAND (expr
, 0);
4117 if (same_type_p (type
, TREE_TYPE (ref
)))
4122 expr
= convert_like (conv
, expr
, complain
);
4124 expr
= error_mark_node
;
4126 /* Free all the conversions we allocated. */
4127 obstack_free (&conversion_obstack
, p
);
4132 /* Do any initial processing on the arguments to a function call. */
4134 static vec
<tree
, va_gc
> *
4135 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
4140 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
4142 if (error_operand_p (arg
))
4144 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
4146 if (complain
& tf_error
)
4147 error ("invalid use of void expression");
4150 else if (invalid_nonstatic_memfn_p (input_location
, arg
, complain
))
4156 /* Perform overload resolution on FN, which is called with the ARGS.
4158 Return the candidate function selected by overload resolution, or
4159 NULL if the event that overload resolution failed. In the case
4160 that overload resolution fails, *CANDIDATES will be the set of
4161 candidates considered, and ANY_VIABLE_P will be set to true or
4162 false to indicate whether or not any of the candidates were
4165 The ARGS should already have gone through RESOLVE_ARGS before this
4166 function is called. */
4168 static struct z_candidate
*
4169 perform_overload_resolution (tree fn
,
4170 const vec
<tree
, va_gc
> *args
,
4171 struct z_candidate
**candidates
,
4172 bool *any_viable_p
, tsubst_flags_t complain
)
4174 struct z_candidate
*cand
;
4175 tree explicit_targs
;
4178 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4180 explicit_targs
= NULL_TREE
;
4184 *any_viable_p
= true;
4187 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4188 || TREE_CODE (fn
) == TEMPLATE_DECL
4189 || TREE_CODE (fn
) == OVERLOAD
4190 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
4192 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4194 explicit_targs
= TREE_OPERAND (fn
, 1);
4195 fn
= TREE_OPERAND (fn
, 0);
4199 /* Add the various candidate functions. */
4200 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
4201 explicit_targs
, template_only
,
4202 /*conversion_path=*/NULL_TREE
,
4203 /*access_path=*/NULL_TREE
,
4205 candidates
, complain
);
4207 *candidates
= splice_viable (*candidates
, false, any_viable_p
);
4209 cand
= tourney (*candidates
, complain
);
4213 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4217 /* Print an error message about being unable to build a call to FN with
4218 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4219 be located; CANDIDATES is a possibly empty list of such
4223 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
,
4224 struct z_candidate
*candidates
)
4226 tree targs
= NULL_TREE
;
4227 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4229 targs
= TREE_OPERAND (fn
, 1);
4230 fn
= TREE_OPERAND (fn
, 0);
4232 tree name
= OVL_NAME (fn
);
4233 location_t loc
= location_of (name
);
4235 name
= lookup_template_function (name
, targs
);
4237 if (!any_strictly_viable (candidates
))
4238 error_at (loc
, "no matching function for call to %<%D(%A)%>",
4239 name
, build_tree_list_vec (args
));
4241 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
4242 name
, build_tree_list_vec (args
));
4244 print_z_candidates (loc
, candidates
);
4247 /* Return an expression for a call to FN (a namespace-scope function,
4248 or a static member function) with the ARGS. This may change
4252 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
,
4253 tsubst_flags_t complain
)
4255 struct z_candidate
*candidates
, *cand
;
4260 if (args
!= NULL
&& *args
!= NULL
)
4262 *args
= resolve_args (*args
, complain
);
4264 return error_mark_node
;
4268 tm_malloc_replacement (fn
);
4270 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4271 p
= conversion_obstack_alloc (0);
4273 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
4278 if (complain
& tf_error
)
4280 // If there is a single (non-viable) function candidate,
4281 // let the error be diagnosed by cp_build_function_call_vec.
4282 if (!any_viable_p
&& candidates
&& ! candidates
->next
4283 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
4284 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
4286 // Otherwise, emit notes for non-viable candidates.
4287 print_error_for_call_failure (fn
, *args
, candidates
);
4289 result
= error_mark_node
;
4293 int flags
= LOOKUP_NORMAL
;
4294 /* If fn is template_id_expr, the call has explicit template arguments
4295 (e.g. func<int>(5)), communicate this info to build_over_call
4296 through flags so that later we can use it to decide whether to warn
4297 about peculiar null pointer conversion. */
4298 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4300 /* If overload resolution selects a specialization of a
4301 function concept for non-dependent template arguments,
4302 the expression is true if the constraints are satisfied
4303 and false otherwise.
4305 NOTE: This is an extension of Concepts Lite TS that
4306 allows constraints to be used in expressions. */
4307 if (flag_concepts
&& !processing_template_decl
)
4309 tree tmpl
= DECL_TI_TEMPLATE (cand
->fn
);
4310 tree targs
= DECL_TI_ARGS (cand
->fn
);
4311 tree decl
= DECL_TEMPLATE_RESULT (tmpl
);
4312 if (DECL_DECLARED_CONCEPT_P (decl
))
4313 return evaluate_function_concept (decl
, targs
);
4316 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4319 result
= build_over_call (cand
, flags
, complain
);
4322 /* Free all the conversions we allocated. */
4323 obstack_free (&conversion_obstack
, p
);
4328 /* Build a call to a global operator new. FNNAME is the name of the
4329 operator (either "operator new" or "operator new[]") and ARGS are
4330 the arguments provided. This may change ARGS. *SIZE points to the
4331 total number of bytes required by the allocation, and is updated if
4332 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4333 be used. If this function determines that no cookie should be
4334 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4335 is not NULL_TREE, it is evaluated before calculating the final
4336 array size, and if it fails, the array size is replaced with
4337 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4338 is non-NULL, it will be set, upon return, to the allocation
4342 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4343 tree
*size
, tree
*cookie_size
,
4344 tree align_arg
, tree size_check
,
4345 tree
*fn
, tsubst_flags_t complain
)
4347 tree original_size
= *size
;
4349 struct z_candidate
*candidates
;
4350 struct z_candidate
*cand
= NULL
;
4355 /* Set to (size_t)-1 if the size check fails. */
4356 if (size_check
!= NULL_TREE
)
4358 tree errval
= TYPE_MAX_VALUE (sizetype
);
4359 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4360 errval
= throw_bad_array_new_length ();
4361 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4362 original_size
, errval
);
4364 vec_safe_insert (*args
, 0, *size
);
4365 *args
= resolve_args (*args
, complain
);
4367 return error_mark_node
;
4373 If this lookup fails to find the name, or if the allocated type
4374 is not a class type, the allocation function's name is looked
4375 up in the global scope.
4377 we disregard block-scope declarations of "operator new". */
4378 fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/false, 0, 0);
4379 fns
= lookup_arg_dependent (fnname
, fns
, *args
);
4383 vec
<tree
, va_gc
>* align_args
4384 = vec_copy_and_insert (*args
, align_arg
, 1);
4385 cand
= perform_overload_resolution (fns
, align_args
, &candidates
,
4386 &any_viable_p
, tf_none
);
4389 /* If no aligned allocation function matches, try again without the
4393 /* Figure out what function is being called. */
4395 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
4398 /* If no suitable function could be found, issue an error message
4402 if (complain
& tf_error
)
4403 print_error_for_call_failure (fns
, *args
, candidates
);
4404 return error_mark_node
;
4407 /* If a cookie is required, add some extra space. Whether
4408 or not a cookie is required cannot be determined until
4409 after we know which function was called. */
4412 bool use_cookie
= true;
4415 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4416 /* Skip the size_t parameter. */
4417 arg_types
= TREE_CHAIN (arg_types
);
4418 /* Check the remaining parameters (if any). */
4420 && TREE_CHAIN (arg_types
) == void_list_node
4421 && same_type_p (TREE_VALUE (arg_types
),
4424 /* If we need a cookie, adjust the number of bytes allocated. */
4427 /* Update the total size. */
4428 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4431 /* Set to (size_t)-1 if the size check fails. */
4432 gcc_assert (size_check
!= NULL_TREE
);
4433 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4434 *size
, TYPE_MAX_VALUE (sizetype
));
4436 /* Update the argument list to reflect the adjusted size. */
4437 (**args
)[0] = *size
;
4440 *cookie_size
= NULL_TREE
;
4443 /* Tell our caller which function we decided to call. */
4447 /* Build the CALL_EXPR. */
4448 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4451 /* Build a new call to operator(). This may change ARGS. */
4454 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4456 struct z_candidate
*candidates
= 0, *cand
;
4457 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4459 tree result
= NULL_TREE
;
4462 obj
= mark_lvalue_use (obj
);
4464 if (error_operand_p (obj
))
4465 return error_mark_node
;
4467 tree type
= TREE_TYPE (obj
);
4469 obj
= prep_operand (obj
);
4471 if (TYPE_PTRMEMFUNC_P (type
))
4473 if (complain
& tf_error
)
4474 /* It's no good looking for an overloaded operator() on a
4475 pointer-to-member-function. */
4476 error ("pointer-to-member function %qE cannot be called without "
4477 "an object; consider using %<.*%> or %<->*%>", obj
);
4478 return error_mark_node
;
4481 if (TYPE_BINFO (type
))
4483 fns
= lookup_fnfields (TYPE_BINFO (type
), call_op_identifier
, 1);
4484 if (fns
== error_mark_node
)
4485 return error_mark_node
;
4490 if (args
!= NULL
&& *args
!= NULL
)
4492 *args
= resolve_args (*args
, complain
);
4494 return error_mark_node
;
4497 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4498 p
= conversion_obstack_alloc (0);
4502 first_mem_arg
= obj
;
4504 add_candidates (BASELINK_FUNCTIONS (fns
),
4505 first_mem_arg
, *args
, NULL_TREE
,
4507 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4508 LOOKUP_NORMAL
, &candidates
, complain
);
4511 convs
= lookup_conversions (type
);
4513 for (; convs
; convs
= TREE_CHAIN (convs
))
4515 tree totype
= TREE_TYPE (convs
);
4517 if (TYPE_PTRFN_P (totype
)
4518 || TYPE_REFFN_P (totype
)
4519 || (TREE_CODE (totype
) == REFERENCE_TYPE
4520 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4521 for (ovl_iterator
iter (TREE_VALUE (convs
)); iter
; ++iter
)
4525 if (DECL_NONCONVERTING_P (fn
))
4528 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4529 add_template_conv_candidate
4530 (&candidates
, fn
, obj
, *args
, totype
,
4531 /*access_path=*/NULL_TREE
,
4532 /*conversion_path=*/NULL_TREE
, complain
);
4534 add_conv_candidate (&candidates
, fn
, obj
,
4535 *args
, /*conversion_path=*/NULL_TREE
,
4536 /*access_path=*/NULL_TREE
, complain
);
4540 /* Be strict here because if we choose a bad conversion candidate, the
4541 errors we get won't mention the call context. */
4542 candidates
= splice_viable (candidates
, true, &any_viable_p
);
4545 if (complain
& tf_error
)
4547 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4548 build_tree_list_vec (*args
));
4549 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4551 result
= error_mark_node
;
4555 cand
= tourney (candidates
, complain
);
4558 if (complain
& tf_error
)
4560 error ("call of %<(%T) (%A)%> is ambiguous",
4561 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4562 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4564 result
= error_mark_node
;
4566 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4567 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
)
4568 && DECL_OVERLOADED_OPERATOR_IS (cand
->fn
, CALL_EXPR
))
4569 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4572 if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
4573 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
,
4577 gcc_checking_assert (TYPE_P (cand
->fn
));
4578 obj
= convert_like (cand
->convs
[0], obj
, complain
);
4580 obj
= convert_from_reference (obj
);
4581 result
= cp_build_function_call_vec (obj
, args
, complain
);
4585 /* Free all the conversions we allocated. */
4586 obstack_free (&conversion_obstack
, p
);
4591 /* Wrapper for above. */
4594 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4597 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4598 ret
= build_op_call_1 (obj
, args
, complain
);
4599 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4603 /* Called by op_error to prepare format strings suitable for the error
4604 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4605 and a suffix (controlled by NTYPES). */
4608 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4612 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4613 : G_("no match for "), errmsg
, NULL
);
4616 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4617 else if (ntypes
== 2)
4618 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4620 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4626 op_error (location_t loc
, enum tree_code code
, enum tree_code code2
,
4627 tree arg1
, tree arg2
, tree arg3
, bool match
)
4629 bool assop
= code
== MODIFY_EXPR
;
4630 const char *opname
= OVL_OP_INFO (assop
, assop
? code2
: code
)->name
;
4635 if (flag_diagnostics_show_caret
)
4636 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4638 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4640 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4641 "in %<%E ? %E : %E%>"), 3, match
),
4643 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4646 case POSTINCREMENT_EXPR
:
4647 case POSTDECREMENT_EXPR
:
4648 if (flag_diagnostics_show_caret
)
4649 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4650 opname
, TREE_TYPE (arg1
));
4652 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4654 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4658 if (flag_diagnostics_show_caret
)
4659 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4660 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4662 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4664 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4669 if (flag_diagnostics_show_caret
)
4670 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4671 opname
, TREE_TYPE (arg1
));
4673 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4674 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4679 if (flag_diagnostics_show_caret
)
4680 error_at (loc
, op_error_string (G_("%<operator%s%>"), 2, match
),
4681 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4683 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4685 opname
, arg1
, opname
, arg2
,
4686 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4688 if (flag_diagnostics_show_caret
)
4689 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4690 opname
, TREE_TYPE (arg1
));
4692 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4694 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4699 /* Return the implicit conversion sequence that could be used to
4700 convert E1 to E2 in [expr.cond]. */
4703 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4705 tree t1
= non_reference (TREE_TYPE (e1
));
4706 tree t2
= non_reference (TREE_TYPE (e2
));
4712 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4713 implicitly converted (clause _conv_) to the type "lvalue reference to
4714 T2", subject to the constraint that in the conversion the
4715 reference must bind directly (_dcl.init.ref_) to an lvalue.
4717 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4718 implicitly converted to the type "rvalue reference to T2", subject to
4719 the constraint that the reference must bind directly. */
4722 tree rtype
= cp_build_reference_type (t2
, !lvalue_p (e2
));
4723 conv
= implicit_conversion (rtype
,
4727 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4728 |LOOKUP_ONLYCONVERTING
,
4730 if (conv
&& !conv
->bad_p
)
4734 /* If E2 is a prvalue or if neither of the conversions above can be done
4735 and at least one of the operands has (possibly cv-qualified) class
4737 if (!CLASS_TYPE_P (t1
) && !CLASS_TYPE_P (t2
))
4742 If E1 and E2 have class type, and the underlying class types are
4743 the same or one is a base class of the other: E1 can be converted
4744 to match E2 if the class of T2 is the same type as, or a base
4745 class of, the class of T1, and the cv-qualification of T2 is the
4746 same cv-qualification as, or a greater cv-qualification than, the
4747 cv-qualification of T1. If the conversion is applied, E1 is
4748 changed to an rvalue of type T2 that still refers to the original
4749 source class object (or the appropriate subobject thereof). */
4750 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4751 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4753 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4755 conv
= build_identity_conv (t1
, e1
);
4756 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4757 TYPE_MAIN_VARIANT (t2
)))
4758 conv
= build_conv (ck_base
, t2
, conv
);
4760 conv
= build_conv (ck_rvalue
, t2
, conv
);
4769 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4770 converted to the type that expression E2 would have if E2 were
4771 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4772 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4773 LOOKUP_IMPLICIT
, complain
);
4776 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4777 arguments to the conditional expression. */
4780 build_conditional_expr_1 (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
4781 tsubst_flags_t complain
)
4785 tree result
= NULL_TREE
;
4786 tree result_type
= NULL_TREE
;
4787 bool is_glvalue
= true;
4788 struct z_candidate
*candidates
= 0;
4789 struct z_candidate
*cand
;
4791 tree orig_arg2
, orig_arg3
;
4793 /* As a G++ extension, the second argument to the conditional can be
4794 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4795 c'.) If the second operand is omitted, make sure it is
4796 calculated only once. */
4799 if (complain
& tf_error
)
4800 pedwarn (loc
, OPT_Wpedantic
,
4801 "ISO C++ forbids omitting the middle term of a ?: expression");
4803 if ((complain
& tf_warning
) && !truth_value_p (TREE_CODE (arg1
)))
4804 warn_for_omitted_condop (loc
, arg1
);
4806 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4807 if (lvalue_p (arg1
))
4808 arg2
= arg1
= cp_stabilize_reference (arg1
);
4810 arg2
= arg1
= cp_save_expr (arg1
);
4813 /* If something has already gone wrong, just pass that fact up the
4815 if (error_operand_p (arg1
)
4816 || error_operand_p (arg2
)
4817 || error_operand_p (arg3
))
4818 return error_mark_node
;
4823 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
4825 tree arg1_type
= TREE_TYPE (arg1
);
4827 /* If arg1 is another cond_expr choosing between -1 and 0,
4828 then we can use its comparison. It may help to avoid
4829 additional comparison, produce more accurate diagnostics
4830 and enables folding. */
4831 if (TREE_CODE (arg1
) == VEC_COND_EXPR
4832 && integer_minus_onep (TREE_OPERAND (arg1
, 1))
4833 && integer_zerop (TREE_OPERAND (arg1
, 2)))
4834 arg1
= TREE_OPERAND (arg1
, 0);
4836 arg1
= force_rvalue (arg1
, complain
);
4837 arg2
= force_rvalue (arg2
, complain
);
4838 arg3
= force_rvalue (arg3
, complain
);
4840 /* force_rvalue can return error_mark on valid arguments. */
4841 if (error_operand_p (arg1
)
4842 || error_operand_p (arg2
)
4843 || error_operand_p (arg3
))
4844 return error_mark_node
;
4846 arg2_type
= TREE_TYPE (arg2
);
4847 arg3_type
= TREE_TYPE (arg3
);
4849 if (!VECTOR_TYPE_P (arg2_type
)
4850 && !VECTOR_TYPE_P (arg3_type
))
4852 /* Rely on the error messages of the scalar version. */
4853 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
4854 orig_arg2
, orig_arg3
, complain
);
4855 if (scal
== error_mark_node
)
4856 return error_mark_node
;
4857 tree stype
= TREE_TYPE (scal
);
4858 tree ctype
= TREE_TYPE (arg1_type
);
4859 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
4860 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
4862 if (complain
& tf_error
)
4863 error_at (loc
, "inferred scalar type %qT is not an integer or "
4864 "floating point type of the same size as %qT", stype
,
4865 COMPARISON_CLASS_P (arg1
)
4866 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
4868 return error_mark_node
;
4871 tree vtype
= build_opaque_vector_type (stype
,
4872 TYPE_VECTOR_SUBPARTS (arg1_type
));
4873 /* We could pass complain & tf_warning to unsafe_conversion_p,
4874 but the warnings (like Wsign-conversion) have already been
4875 given by the scalar build_conditional_expr_1. We still check
4876 unsafe_conversion_p to forbid truncating long long -> float. */
4877 if (unsafe_conversion_p (loc
, stype
, arg2
, NULL_TREE
, false))
4879 if (complain
& tf_error
)
4880 error_at (loc
, "conversion of scalar %qH to vector %qI "
4881 "involves truncation", arg2_type
, vtype
);
4882 return error_mark_node
;
4884 if (unsafe_conversion_p (loc
, stype
, arg3
, NULL_TREE
, false))
4886 if (complain
& tf_error
)
4887 error_at (loc
, "conversion of scalar %qH to vector %qI "
4888 "involves truncation", arg3_type
, vtype
);
4889 return error_mark_node
;
4892 arg2
= cp_convert (stype
, arg2
, complain
);
4893 arg2
= save_expr (arg2
);
4894 arg2
= build_vector_from_val (vtype
, arg2
);
4896 arg3
= cp_convert (stype
, arg3
, complain
);
4897 arg3
= save_expr (arg3
);
4898 arg3
= build_vector_from_val (vtype
, arg3
);
4902 if (VECTOR_TYPE_P (arg2_type
) != VECTOR_TYPE_P (arg3_type
))
4904 enum stv_conv convert_flag
=
4905 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
4906 complain
& tf_error
);
4908 switch (convert_flag
)
4911 return error_mark_node
;
4914 arg2
= save_expr (arg2
);
4915 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
4916 arg2
= build_vector_from_val (arg3_type
, arg2
);
4917 arg2_type
= TREE_TYPE (arg2
);
4922 arg3
= save_expr (arg3
);
4923 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
4924 arg3
= build_vector_from_val (arg2_type
, arg3
);
4925 arg3_type
= TREE_TYPE (arg3
);
4933 if (!same_type_p (arg2_type
, arg3_type
)
4934 || maybe_ne (TYPE_VECTOR_SUBPARTS (arg1_type
),
4935 TYPE_VECTOR_SUBPARTS (arg2_type
))
4936 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
4938 if (complain
& tf_error
)
4940 "incompatible vector types in conditional expression: "
4941 "%qT, %qT and %qT", TREE_TYPE (arg1
),
4942 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
4943 return error_mark_node
;
4946 if (!COMPARISON_CLASS_P (arg1
))
4948 tree cmp_type
= build_same_sized_truth_vector_type (arg1_type
);
4949 arg1
= build2 (NE_EXPR
, cmp_type
, arg1
, build_zero_cst (arg1_type
));
4951 return build3_loc (loc
, VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
4956 The first expression is implicitly converted to bool (clause
4958 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
4960 if (error_operand_p (arg1
))
4961 return error_mark_node
;
4965 If either the second or the third operand has type (possibly
4966 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4967 array-to-pointer (_conv.array_), and function-to-pointer
4968 (_conv.func_) standard conversions are performed on the second
4969 and third operands. */
4970 arg2_type
= unlowered_expr_type (arg2
);
4971 arg3_type
= unlowered_expr_type (arg3
);
4972 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
4974 /* Do the conversions. We don't these for `void' type arguments
4975 since it can't have any effect and since decay_conversion
4976 does not handle that case gracefully. */
4977 if (!VOID_TYPE_P (arg2_type
))
4978 arg2
= decay_conversion (arg2
, complain
);
4979 if (!VOID_TYPE_P (arg3_type
))
4980 arg3
= decay_conversion (arg3
, complain
);
4981 arg2_type
= TREE_TYPE (arg2
);
4982 arg3_type
= TREE_TYPE (arg3
);
4986 One of the following shall hold:
4988 --The second or the third operand (but not both) is a
4989 throw-expression (_except.throw_); the result is of the
4990 type of the other and is an rvalue.
4992 --Both the second and the third operands have type void; the
4993 result is of type void and is an rvalue.
4995 We must avoid calling force_rvalue for expressions of type
4996 "void" because it will complain that their value is being
4998 if (TREE_CODE (arg2
) == THROW_EXPR
4999 && TREE_CODE (arg3
) != THROW_EXPR
)
5001 if (!VOID_TYPE_P (arg3_type
))
5003 arg3
= force_rvalue (arg3
, complain
);
5004 if (arg3
== error_mark_node
)
5005 return error_mark_node
;
5007 arg3_type
= TREE_TYPE (arg3
);
5008 result_type
= arg3_type
;
5010 else if (TREE_CODE (arg2
) != THROW_EXPR
5011 && TREE_CODE (arg3
) == THROW_EXPR
)
5013 if (!VOID_TYPE_P (arg2_type
))
5015 arg2
= force_rvalue (arg2
, complain
);
5016 if (arg2
== error_mark_node
)
5017 return error_mark_node
;
5019 arg2_type
= TREE_TYPE (arg2
);
5020 result_type
= arg2_type
;
5022 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
5023 result_type
= void_type_node
;
5026 if (complain
& tf_error
)
5028 if (VOID_TYPE_P (arg2_type
))
5029 error_at (EXPR_LOC_OR_LOC (arg3
, loc
),
5030 "second operand to the conditional operator "
5031 "is of type %<void%>, but the third operand is "
5032 "neither a throw-expression nor of type %<void%>");
5034 error_at (EXPR_LOC_OR_LOC (arg2
, loc
),
5035 "third operand to the conditional operator "
5036 "is of type %<void%>, but the second operand is "
5037 "neither a throw-expression nor of type %<void%>");
5039 return error_mark_node
;
5043 goto valid_operands
;
5047 Otherwise, if the second and third operand have different types,
5048 and either has (possibly cv-qualified) class type, or if both are
5049 glvalues of the same value category and the same type except for
5050 cv-qualification, an attempt is made to convert each of those operands
5051 to the type of the other. */
5052 else if (!same_type_p (arg2_type
, arg3_type
)
5053 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)
5054 || (same_type_ignoring_top_level_qualifiers_p (arg2_type
,
5056 && glvalue_p (arg2
) && glvalue_p (arg3
)
5057 && lvalue_p (arg2
) == lvalue_p (arg3
))))
5061 bool converted
= false;
5063 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5064 p
= conversion_obstack_alloc (0);
5066 conv2
= conditional_conversion (arg2
, arg3
, complain
);
5067 conv3
= conditional_conversion (arg3
, arg2
, complain
);
5071 If both can be converted, or one can be converted but the
5072 conversion is ambiguous, the program is ill-formed. If
5073 neither can be converted, the operands are left unchanged and
5074 further checking is performed as described below. If exactly
5075 one conversion is possible, that conversion is applied to the
5076 chosen operand and the converted operand is used in place of
5077 the original operand for the remainder of this section. */
5078 if ((conv2
&& !conv2
->bad_p
5079 && conv3
&& !conv3
->bad_p
)
5080 || (conv2
&& conv2
->kind
== ck_ambig
)
5081 || (conv3
&& conv3
->kind
== ck_ambig
))
5083 if (complain
& tf_error
)
5085 error_at (loc
, "operands to ?: have different types %qT and %qT",
5086 arg2_type
, arg3_type
);
5087 if (conv2
&& !conv2
->bad_p
&& conv3
&& !conv3
->bad_p
)
5088 inform (loc
, " and each type can be converted to the other");
5089 else if (conv2
&& conv2
->kind
== ck_ambig
)
5090 convert_like (conv2
, arg2
, complain
);
5092 convert_like (conv3
, arg3
, complain
);
5094 result
= error_mark_node
;
5096 else if (conv2
&& !conv2
->bad_p
)
5098 arg2
= convert_like (conv2
, arg2
, complain
);
5099 arg2
= convert_from_reference (arg2
);
5100 arg2_type
= TREE_TYPE (arg2
);
5101 /* Even if CONV2 is a valid conversion, the result of the
5102 conversion may be invalid. For example, if ARG3 has type
5103 "volatile X", and X does not have a copy constructor
5104 accepting a "volatile X&", then even if ARG2 can be
5105 converted to X, the conversion will fail. */
5106 if (error_operand_p (arg2
))
5107 result
= error_mark_node
;
5110 else if (conv3
&& !conv3
->bad_p
)
5112 arg3
= convert_like (conv3
, arg3
, complain
);
5113 arg3
= convert_from_reference (arg3
);
5114 arg3_type
= TREE_TYPE (arg3
);
5115 if (error_operand_p (arg3
))
5116 result
= error_mark_node
;
5120 /* Free all the conversions we allocated. */
5121 obstack_free (&conversion_obstack
, p
);
5126 /* If, after the conversion, both operands have class type,
5127 treat the cv-qualification of both operands as if it were the
5128 union of the cv-qualification of the operands.
5130 The standard is not clear about what to do in this
5131 circumstance. For example, if the first operand has type
5132 "const X" and the second operand has a user-defined
5133 conversion to "volatile X", what is the type of the second
5134 operand after this step? Making it be "const X" (matching
5135 the first operand) seems wrong, as that discards the
5136 qualification without actually performing a copy. Leaving it
5137 as "volatile X" seems wrong as that will result in the
5138 conditional expression failing altogether, even though,
5139 according to this step, the one operand could be converted to
5140 the type of the other. */
5142 && CLASS_TYPE_P (arg2_type
)
5143 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
5144 arg2_type
= arg3_type
=
5145 cp_build_qualified_type (arg2_type
,
5146 cp_type_quals (arg2_type
)
5147 | cp_type_quals (arg3_type
));
5152 If the second and third operands are glvalues of the same value
5153 category and have the same type, the result is of that type and
5155 if (((lvalue_p (arg2
) && lvalue_p (arg3
))
5156 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
5157 && same_type_p (arg2_type
, arg3_type
))
5159 result_type
= arg2_type
;
5160 if (processing_template_decl
)
5161 /* Let lvalue_kind know this was a glvalue. */
5162 result_type
= cp_build_reference_type (result_type
, xvalue_p (arg2
));
5164 arg2
= mark_lvalue_use (arg2
);
5165 arg3
= mark_lvalue_use (arg3
);
5166 goto valid_operands
;
5171 Otherwise, the result is an rvalue. If the second and third
5172 operand do not have the same type, and either has (possibly
5173 cv-qualified) class type, overload resolution is used to
5174 determine the conversions (if any) to be applied to the operands
5175 (_over.match.oper_, _over.built_). */
5177 if (!same_type_p (arg2_type
, arg3_type
)
5178 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
5184 /* Rearrange the arguments so that add_builtin_candidate only has
5185 to know about two args. In build_builtin_candidate, the
5186 arguments are unscrambled. */
5190 add_builtin_candidates (&candidates
,
5193 ovl_op_identifier (false, COND_EXPR
),
5195 LOOKUP_NORMAL
, complain
);
5199 If the overload resolution fails, the program is
5201 candidates
= splice_viable (candidates
, false, &any_viable_p
);
5204 if (complain
& tf_error
)
5205 error_at (loc
, "operands to ?: have different types %qT and %qT",
5206 arg2_type
, arg3_type
);
5207 return error_mark_node
;
5209 cand
= tourney (candidates
, complain
);
5212 if (complain
& tf_error
)
5214 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
5215 print_z_candidates (loc
, candidates
);
5217 return error_mark_node
;
5222 Otherwise, the conversions thus determined are applied, and
5223 the converted operands are used in place of the original
5224 operands for the remainder of this section. */
5225 conv
= cand
->convs
[0];
5226 arg1
= convert_like (conv
, arg1
, complain
);
5227 conv
= cand
->convs
[1];
5228 arg2
= convert_like (conv
, arg2
, complain
);
5229 arg2_type
= TREE_TYPE (arg2
);
5230 conv
= cand
->convs
[2];
5231 arg3
= convert_like (conv
, arg3
, complain
);
5232 arg3_type
= TREE_TYPE (arg3
);
5237 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5238 and function-to-pointer (_conv.func_) standard conversions are
5239 performed on the second and third operands.
5241 We need to force the lvalue-to-rvalue conversion here for class types,
5242 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5243 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5246 arg2
= force_rvalue (arg2
, complain
);
5247 if (!CLASS_TYPE_P (arg2_type
))
5248 arg2_type
= TREE_TYPE (arg2
);
5250 arg3
= force_rvalue (arg3
, complain
);
5251 if (!CLASS_TYPE_P (arg3_type
))
5252 arg3_type
= TREE_TYPE (arg3
);
5254 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5255 return error_mark_node
;
5259 After those conversions, one of the following shall hold:
5261 --The second and third operands have the same type; the result is of
5263 if (same_type_p (arg2_type
, arg3_type
))
5264 result_type
= arg2_type
;
5267 --The second and third operands have arithmetic or enumeration
5268 type; the usual arithmetic conversions are performed to bring
5269 them to a common type, and the result is of that type. */
5270 else if ((ARITHMETIC_TYPE_P (arg2_type
)
5271 || UNSCOPED_ENUM_P (arg2_type
))
5272 && (ARITHMETIC_TYPE_P (arg3_type
)
5273 || UNSCOPED_ENUM_P (arg3_type
)))
5275 /* In this case, there is always a common type. */
5276 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
5278 if (complain
& tf_warning
)
5279 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
5280 "implicit conversion from %qH to %qI to "
5281 "match other result of conditional",
5284 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5285 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
5287 if (TREE_CODE (orig_arg2
) == CONST_DECL
5288 && TREE_CODE (orig_arg3
) == CONST_DECL
5289 && DECL_CONTEXT (orig_arg2
) == DECL_CONTEXT (orig_arg3
))
5290 /* Two enumerators from the same enumeration can have different
5291 types when the enumeration is still being defined. */;
5292 else if (complain
& tf_warning
)
5293 warning_at (loc
, OPT_Wenum_compare
, "enumeral mismatch in "
5294 "conditional expression: %qT vs %qT",
5295 arg2_type
, arg3_type
);
5297 else if (extra_warnings
5298 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5299 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
5300 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
5301 && !same_type_p (arg2_type
,
5302 type_promotes_to (arg3_type
)))))
5304 if (complain
& tf_warning
)
5305 warning_at (loc
, OPT_Wextra
, "enumeral and non-enumeral type in "
5306 "conditional expression");
5309 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5310 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5314 --The second and third operands have pointer type, or one has
5315 pointer type and the other is a null pointer constant; pointer
5316 conversions (_conv.ptr_) and qualification conversions
5317 (_conv.qual_) are performed to bring them to their composite
5318 pointer type (_expr.rel_). The result is of the composite
5321 --The second and third operands have pointer to member type, or
5322 one has pointer to member type and the other is a null pointer
5323 constant; pointer to member conversions (_conv.mem_) and
5324 qualification conversions (_conv.qual_) are performed to bring
5325 them to a common type, whose cv-qualification shall match the
5326 cv-qualification of either the second or the third operand.
5327 The result is of the common type. */
5328 else if ((null_ptr_cst_p (arg2
)
5329 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
5330 || (null_ptr_cst_p (arg3
)
5331 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
5332 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
5333 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
5334 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
5336 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
5337 arg3
, CPO_CONDITIONAL_EXPR
,
5339 if (result_type
== error_mark_node
)
5340 return error_mark_node
;
5341 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5342 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5347 if (complain
& tf_error
)
5348 error_at (loc
, "operands to ?: have different types %qT and %qT",
5349 arg2_type
, arg3_type
);
5350 return error_mark_node
;
5353 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5354 return error_mark_node
;
5357 result
= build3_loc (loc
, COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
5359 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5360 warn here, because the COND_EXPR will be turned into ARG2. */
5361 if (warn_duplicated_branches
5362 && (complain
& tf_warning
)
5363 && (arg2
== arg3
|| operand_equal_p (arg2
, arg3
, 0)))
5364 warning_at (EXPR_LOCATION (result
), OPT_Wduplicated_branches
,
5365 "this condition has identical branches");
5367 /* We can't use result_type below, as fold might have returned a
5372 /* Expand both sides into the same slot, hopefully the target of
5373 the ?: expression. We used to check for TARGET_EXPRs here,
5374 but now we sometimes wrap them in NOP_EXPRs so the test would
5376 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5377 result
= get_target_expr_sfinae (result
, complain
);
5378 /* If this expression is an rvalue, but might be mistaken for an
5379 lvalue, we must add a NON_LVALUE_EXPR. */
5380 result
= rvalue (result
);
5383 result
= force_paren_expr (result
);
5388 /* Wrapper for above. */
5391 build_conditional_expr (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
5392 tsubst_flags_t complain
)
5395 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5396 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5397 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5401 /* OPERAND is an operand to an expression. Perform necessary steps
5402 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5406 prep_operand (tree operand
)
5410 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5411 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5412 /* Make sure the template type is instantiated now. */
5413 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5419 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5420 OVERLOAD) to the CANDIDATES, returning an updated list of
5421 CANDIDATES. The ARGS are the arguments provided to the call;
5422 if FIRST_ARG is non-null it is the implicit object argument,
5423 otherwise the first element of ARGS is used if needed. The
5424 EXPLICIT_TARGS are explicit template arguments provided.
5425 TEMPLATE_ONLY is true if only template functions should be
5426 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5427 add_function_candidate. */
5430 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5432 tree explicit_targs
, bool template_only
,
5433 tree conversion_path
, tree access_path
,
5435 struct z_candidate
**candidates
,
5436 tsubst_flags_t complain
)
5439 const vec
<tree
, va_gc
> *non_static_args
;
5440 bool check_list_ctor
= false;
5441 bool check_converting
= false;
5442 unification_kind_t strict
;
5447 /* Precalculate special handling of constructors and conversion ops. */
5448 tree fn
= OVL_FIRST (fns
);
5449 if (DECL_CONV_FN_P (fn
))
5451 check_list_ctor
= false;
5452 check_converting
= (flags
& LOOKUP_ONLYCONVERTING
) != 0;
5453 if (flags
& LOOKUP_NO_CONVERSION
)
5454 /* We're doing return_type(x). */
5455 strict
= DEDUCE_CONV
;
5457 /* We're doing x.operator return_type(). */
5458 strict
= DEDUCE_EXACT
;
5459 /* [over.match.funcs] For conversion functions, the function
5460 is considered to be a member of the class of the implicit
5461 object argument for the purpose of defining the type of
5462 the implicit object parameter. */
5463 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5467 if (DECL_CONSTRUCTOR_P (fn
))
5469 check_list_ctor
= (flags
& LOOKUP_LIST_ONLY
) != 0;
5470 /* For list-initialization we consider explicit constructors
5471 and complain if one is chosen. */
5473 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5474 == LOOKUP_ONLYCONVERTING
);
5476 strict
= DEDUCE_CALL
;
5477 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5481 non_static_args
= args
;
5483 /* Delay creating the implicit this parameter until it is needed. */
5484 non_static_args
= NULL
;
5486 for (lkp_iterator
iter (fns
); iter
; ++iter
)
5490 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5492 if (check_list_ctor
&& !is_list_ctor (fn
))
5495 tree fn_first_arg
= NULL_TREE
;
5496 const vec
<tree
, va_gc
> *fn_args
= args
;
5498 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5500 /* Figure out where the object arg comes from. If this
5501 function is a non-static member and we didn't get an
5502 implicit object argument, move it out of args. */
5503 if (first_arg
== NULL_TREE
)
5507 vec
<tree
, va_gc
> *tempvec
;
5508 vec_alloc (tempvec
, args
->length () - 1);
5509 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5510 tempvec
->quick_push (arg
);
5511 non_static_args
= tempvec
;
5512 first_arg
= (*args
)[0];
5515 fn_first_arg
= first_arg
;
5516 fn_args
= non_static_args
;
5519 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5520 add_template_candidate (candidates
,
5532 else if (!template_only
)
5533 add_function_candidate (candidates
,
5545 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5546 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5549 op_is_ordered (tree_code code
)
5555 return (flag_strong_eval_order
> 1 ? -1 : 0);
5559 return (flag_strong_eval_order
> 1 ? 1 : 0);
5562 // Not overloadable (yet).
5564 // Only one argument.
5571 return (flag_strong_eval_order
? 1 : 0);
5579 build_new_op_1 (location_t loc
, enum tree_code code
, int flags
, tree arg1
,
5580 tree arg2
, tree arg3
, tree
*overload
, tsubst_flags_t complain
)
5582 struct z_candidate
*candidates
= 0, *cand
;
5583 vec
<tree
, va_gc
> *arglist
;
5585 tree result
= NULL_TREE
;
5586 bool result_valid_p
= false;
5587 enum tree_code code2
= NOP_EXPR
;
5588 enum tree_code code_orig_arg1
= ERROR_MARK
;
5589 enum tree_code code_orig_arg2
= ERROR_MARK
;
5595 if (error_operand_p (arg1
)
5596 || error_operand_p (arg2
)
5597 || error_operand_p (arg3
))
5598 return error_mark_node
;
5600 bool ismodop
= code
== MODIFY_EXPR
;
5603 code2
= TREE_CODE (arg3
);
5606 tree fnname
= ovl_op_identifier (ismodop
, ismodop
? code2
: code
);
5608 arg1
= prep_operand (arg1
);
5610 bool memonly
= false;
5615 case VEC_DELETE_EXPR
:
5617 /* Use build_op_new_call and build_op_delete_call instead. */
5621 /* Use build_op_call instead. */
5624 case TRUTH_ORIF_EXPR
:
5625 case TRUTH_ANDIF_EXPR
:
5626 case TRUTH_AND_EXPR
:
5628 /* These are saved for the sake of warn_logical_operator. */
5629 code_orig_arg1
= TREE_CODE (arg1
);
5630 code_orig_arg2
= TREE_CODE (arg2
);
5638 /* These are saved for the sake of maybe_warn_bool_compare. */
5639 code_orig_arg1
= TREE_CODE (TREE_TYPE (arg1
));
5640 code_orig_arg2
= TREE_CODE (TREE_TYPE (arg2
));
5643 /* =, ->, [], () must be non-static member functions. */
5645 if (code2
!= NOP_EXPR
)
5657 arg2
= prep_operand (arg2
);
5658 arg3
= prep_operand (arg3
);
5660 if (code
== COND_EXPR
)
5661 /* Use build_conditional_expr instead. */
5663 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5664 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5667 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5668 arg2
= integer_zero_node
;
5670 vec_alloc (arglist
, 3);
5671 arglist
->quick_push (arg1
);
5672 if (arg2
!= NULL_TREE
)
5673 arglist
->quick_push (arg2
);
5674 if (arg3
!= NULL_TREE
)
5675 arglist
->quick_push (arg3
);
5677 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5678 p
= conversion_obstack_alloc (0);
5680 /* Add namespace-scope operators to the list of functions to
5684 tree fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/true, 0, 0);
5685 fns
= lookup_arg_dependent (fnname
, fns
, arglist
);
5686 add_candidates (fns
, NULL_TREE
, arglist
, NULL_TREE
,
5687 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5688 flags
, &candidates
, complain
);
5693 args
[2] = NULL_TREE
;
5695 /* Add class-member operators to the candidate set. */
5696 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5700 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5701 if (fns
== error_mark_node
)
5703 result
= error_mark_node
;
5704 goto user_defined_result_ready
;
5707 add_candidates (BASELINK_FUNCTIONS (fns
),
5708 NULL_TREE
, arglist
, NULL_TREE
,
5710 BASELINK_BINFO (fns
),
5711 BASELINK_ACCESS_BINFO (fns
),
5712 flags
, &candidates
, complain
);
5714 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5715 only non-member functions that have type T1 or reference to
5716 cv-qualified-opt T1 for the first argument, if the first argument
5717 has an enumeration type, or T2 or reference to cv-qualified-opt
5718 T2 for the second argument, if the second argument has an
5719 enumeration type. Filter out those that don't match. */
5720 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5722 struct z_candidate
**candp
, **next
;
5724 for (candp
= &candidates
; *candp
; candp
= next
)
5726 tree parmlist
, parmtype
;
5727 int i
, nargs
= (arg2
? 2 : 1);
5732 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5734 for (i
= 0; i
< nargs
; ++i
)
5736 parmtype
= TREE_VALUE (parmlist
);
5738 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
5739 parmtype
= TREE_TYPE (parmtype
);
5740 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5741 && (same_type_ignoring_top_level_qualifiers_p
5742 (TREE_TYPE (args
[i
]), parmtype
)))
5745 parmlist
= TREE_CHAIN (parmlist
);
5748 /* No argument has an appropriate type, so remove this
5749 candidate function from the list. */
5752 *candp
= cand
->next
;
5758 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5765 /* For these, the built-in candidates set is empty
5766 [over.match.oper]/3. We don't want non-strict matches
5767 because exact matches are always possible with built-in
5768 operators. The built-in candidate set for COMPONENT_REF
5769 would be empty too, but since there are no such built-in
5770 operators, we accept non-strict matches for them. */
5779 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5784 case POSTINCREMENT_EXPR
:
5785 case POSTDECREMENT_EXPR
:
5786 /* Don't try anything fancy if we're not allowed to produce
5788 if (!(complain
& tf_error
))
5789 return error_mark_node
;
5791 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5792 distinguish between prefix and postfix ++ and
5793 operator++() was used for both, so we allow this with
5797 const char *msg
= (flag_permissive
)
5798 ? G_("no %<%D(int)%> declared for postfix %qs,"
5799 " trying prefix operator instead")
5800 : G_("no %<%D(int)%> declared for postfix %qs");
5801 permerror (loc
, msg
, fnname
, OVL_OP_INFO (false, code
)->name
);
5804 if (!flag_permissive
)
5805 return error_mark_node
;
5807 if (code
== POSTINCREMENT_EXPR
)
5808 code
= PREINCREMENT_EXPR
;
5810 code
= PREDECREMENT_EXPR
;
5811 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5812 NULL_TREE
, overload
, complain
);
5815 /* The caller will deal with these. */
5820 result_valid_p
= true;
5824 if (complain
& tf_error
)
5826 /* If one of the arguments of the operator represents
5827 an invalid use of member function pointer, try to report
5828 a meaningful error ... */
5829 if (invalid_nonstatic_memfn_p (loc
, arg1
, tf_error
)
5830 || invalid_nonstatic_memfn_p (loc
, arg2
, tf_error
)
5831 || invalid_nonstatic_memfn_p (loc
, arg3
, tf_error
))
5832 /* We displayed the error message. */;
5835 /* ... Otherwise, report the more generic
5836 "no matching operator found" error */
5837 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
5838 print_z_candidates (loc
, candidates
);
5841 result
= error_mark_node
;
5847 cand
= tourney (candidates
, complain
);
5850 if (complain
& tf_error
)
5852 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
5853 print_z_candidates (loc
, candidates
);
5855 result
= error_mark_node
;
5857 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
5860 *overload
= cand
->fn
;
5862 if (resolve_args (arglist
, complain
) == NULL
)
5863 result
= error_mark_node
;
5865 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5867 if (trivial_fn_p (cand
->fn
))
5868 /* There won't be a CALL_EXPR. */;
5869 else if (result
&& result
!= error_mark_node
)
5871 tree call
= extract_call_expr (result
);
5872 CALL_EXPR_OPERATOR_SYNTAX (call
) = true;
5874 if (processing_template_decl
&& DECL_HIDDEN_FRIEND_P (cand
->fn
))
5875 /* This prevents build_new_function_call from discarding this
5876 function during instantiation of the enclosing template. */
5877 KOENIG_LOOKUP_P (call
) = 1;
5879 /* Specify evaluation order as per P0145R2. */
5880 CALL_EXPR_ORDERED_ARGS (call
) = false;
5881 switch (op_is_ordered (code
))
5884 CALL_EXPR_REVERSE_ARGS (call
) = true;
5888 CALL_EXPR_ORDERED_ARGS (call
) = true;
5898 /* Give any warnings we noticed during overload resolution. */
5899 if (cand
->warnings
&& (complain
& tf_warning
))
5901 struct candidate_warning
*w
;
5902 for (w
= cand
->warnings
; w
; w
= w
->next
)
5903 joust (cand
, w
->loser
, 1, complain
);
5906 /* Check for comparison of different enum types. */
5915 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
5916 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
5917 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
5918 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
5919 && (complain
& tf_warning
))
5921 warning (OPT_Wenum_compare
,
5922 "comparison between %q#T and %q#T",
5923 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
5930 /* We need to strip any leading REF_BIND so that bitfields
5931 don't cause errors. This should not remove any important
5932 conversions, because builtins don't apply to class
5933 objects directly. */
5934 conv
= cand
->convs
[0];
5935 if (conv
->kind
== ck_ref_bind
)
5936 conv
= next_conversion (conv
);
5937 arg1
= convert_like (conv
, arg1
, complain
);
5941 conv
= cand
->convs
[1];
5942 if (conv
->kind
== ck_ref_bind
)
5943 conv
= next_conversion (conv
);
5945 arg2
= decay_conversion (arg2
, complain
);
5947 /* We need to call warn_logical_operator before
5948 converting arg2 to a boolean_type, but after
5949 decaying an enumerator to its value. */
5950 if (complain
& tf_warning
)
5951 warn_logical_operator (loc
, code
, boolean_type_node
,
5952 code_orig_arg1
, arg1
,
5953 code_orig_arg2
, arg2
);
5955 arg2
= convert_like (conv
, arg2
, complain
);
5959 conv
= cand
->convs
[2];
5960 if (conv
->kind
== ck_ref_bind
)
5961 conv
= next_conversion (conv
);
5962 arg3
= convert_like (conv
, arg3
, complain
);
5968 user_defined_result_ready
:
5970 /* Free all the conversions we allocated. */
5971 obstack_free (&conversion_obstack
, p
);
5973 if (result
|| result_valid_p
)
5980 return cp_build_modify_expr (loc
, arg1
, code2
, arg2
, complain
);
5983 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
5985 case TRUTH_ANDIF_EXPR
:
5986 case TRUTH_ORIF_EXPR
:
5987 case TRUTH_AND_EXPR
:
5989 if (complain
& tf_warning
)
5990 warn_logical_operator (loc
, code
, boolean_type_node
,
5991 code_orig_arg1
, arg1
,
5992 code_orig_arg2
, arg2
);
6000 if ((complain
& tf_warning
)
6001 && ((code_orig_arg1
== BOOLEAN_TYPE
)
6002 ^ (code_orig_arg2
== BOOLEAN_TYPE
)))
6003 maybe_warn_bool_compare (loc
, code
, arg1
, arg2
);
6004 if (complain
& tf_warning
&& warn_tautological_compare
)
6005 warn_tautological_cmp (loc
, code
, arg1
, arg2
);
6010 case TRUNC_DIV_EXPR
:
6015 case TRUNC_MOD_EXPR
:
6019 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
6021 case UNARY_PLUS_EXPR
:
6024 case TRUTH_NOT_EXPR
:
6025 case PREINCREMENT_EXPR
:
6026 case POSTINCREMENT_EXPR
:
6027 case PREDECREMENT_EXPR
:
6028 case POSTDECREMENT_EXPR
:
6032 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
6035 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
6038 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
6042 /* The caller will deal with these. */
6054 /* Wrapper for above. */
6057 build_new_op (location_t loc
, enum tree_code code
, int flags
,
6058 tree arg1
, tree arg2
, tree arg3
,
6059 tree
*overload
, tsubst_flags_t complain
)
6062 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
6063 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
6064 overload
, complain
);
6065 timevar_cond_stop (TV_OVERLOAD
, subtime
);
6069 /* CALL was returned by some call-building function; extract the actual
6070 CALL_EXPR from any bits that have been tacked on, e.g. by
6071 convert_from_reference. */
6074 extract_call_expr (tree call
)
6076 while (TREE_CODE (call
) == COMPOUND_EXPR
)
6077 call
= TREE_OPERAND (call
, 1);
6078 if (REFERENCE_REF_P (call
))
6079 call
= TREE_OPERAND (call
, 0);
6080 if (TREE_CODE (call
) == TARGET_EXPR
)
6081 call
= TARGET_EXPR_INITIAL (call
);
6082 gcc_assert (TREE_CODE (call
) == CALL_EXPR
6083 || TREE_CODE (call
) == AGGR_INIT_EXPR
6084 || call
== error_mark_node
);
6088 /* Returns true if FN has two parameters, of which the second has type
6092 second_parm_is_size_t (tree fn
)
6094 tree t
= FUNCTION_ARG_CHAIN (fn
);
6095 if (!t
|| !same_type_p (TREE_VALUE (t
), size_type_node
))
6098 if (t
== void_list_node
)
6100 if (aligned_new_threshold
&& t
6101 && same_type_p (TREE_VALUE (t
), align_type_node
)
6102 && TREE_CHAIN (t
) == void_list_node
)
6107 /* True if T, an allocation function, has std::align_val_t as its second
6111 aligned_allocation_fn_p (tree t
)
6113 if (!aligned_new_threshold
)
6116 tree a
= FUNCTION_ARG_CHAIN (t
);
6117 return (a
&& same_type_p (TREE_VALUE (a
), align_type_node
));
6120 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6121 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6122 std::align_val_t. */
6125 aligned_deallocation_fn_p (tree t
)
6127 if (!aligned_new_threshold
)
6130 /* A template instance is never a usual deallocation function,
6131 regardless of its signature. */
6132 if (TREE_CODE (t
) == TEMPLATE_DECL
6133 || primary_template_specialization_p (t
))
6136 tree a
= FUNCTION_ARG_CHAIN (t
);
6137 if (same_type_p (TREE_VALUE (a
), align_type_node
)
6138 && TREE_CHAIN (a
) == void_list_node
)
6140 if (!same_type_p (TREE_VALUE (a
), size_type_node
))
6143 if (a
&& same_type_p (TREE_VALUE (a
), align_type_node
)
6144 && TREE_CHAIN (a
) == void_list_node
)
6149 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6150 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6153 usual_deallocation_fn_p (tree t
)
6155 /* A template instance is never a usual deallocation function,
6156 regardless of its signature. */
6157 if (TREE_CODE (t
) == TEMPLATE_DECL
6158 || primary_template_specialization_p (t
))
6161 /* If a class T has a member deallocation function named operator delete
6162 with exactly one parameter, then that function is a usual
6163 (non-placement) deallocation function. If class T does not declare
6164 such an operator delete but does declare a member deallocation
6165 function named operator delete with exactly two parameters, the second
6166 of which has type std::size_t (18.2), then this function is a usual
6167 deallocation function. */
6168 bool global
= DECL_NAMESPACE_SCOPE_P (t
);
6169 tree chain
= FUNCTION_ARG_CHAIN (t
);
6172 if (chain
== void_list_node
6173 || ((!global
|| flag_sized_deallocation
)
6174 && second_parm_is_size_t (t
)))
6176 if (aligned_deallocation_fn_p (t
))
6181 /* Build a call to operator delete. This has to be handled very specially,
6182 because the restrictions on what signatures match are different from all
6183 other call instances. For a normal delete, only a delete taking (void *)
6184 or (void *, size_t) is accepted. For a placement delete, only an exact
6185 match with the placement new is accepted.
6187 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6188 ADDR is the pointer to be deleted.
6189 SIZE is the size of the memory block to be deleted.
6190 GLOBAL_P is true if the delete-expression should not consider
6191 class-specific delete operators.
6192 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6194 If this call to "operator delete" is being generated as part to
6195 deallocate memory allocated via a new-expression (as per [expr.new]
6196 which requires that if the initialization throws an exception then
6197 we call a deallocation function), then ALLOC_FN is the allocation
6201 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
6202 bool global_p
, tree placement
,
6203 tree alloc_fn
, tsubst_flags_t complain
)
6205 tree fn
= NULL_TREE
;
6206 tree fns
, fnname
, type
, t
;
6208 if (addr
== error_mark_node
)
6209 return error_mark_node
;
6211 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
6213 fnname
= ovl_op_identifier (false, code
);
6215 if (CLASS_TYPE_P (type
)
6216 && COMPLETE_TYPE_P (complete_type (type
))
6220 If the result of the lookup is ambiguous or inaccessible, or if
6221 the lookup selects a placement deallocation function, the
6222 program is ill-formed.
6224 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6226 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
6227 if (fns
== error_mark_node
)
6228 return error_mark_node
;
6233 if (fns
== NULL_TREE
)
6234 fns
= lookup_name_nonclass (fnname
);
6236 /* Strip const and volatile from addr. */
6237 addr
= cp_convert (ptr_type_node
, addr
, complain
);
6241 /* "A declaration of a placement deallocation function matches the
6242 declaration of a placement allocation function if it has the same
6243 number of parameters and, after parameter transformations (8.3.5),
6244 all parameter types except the first are identical."
6246 So we build up the function type we want and ask instantiate_type
6247 to get it for us. */
6248 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
6249 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
6250 t
= build_function_type (void_type_node
, t
);
6252 fn
= instantiate_type (t
, fns
, tf_none
);
6253 if (fn
== error_mark_node
)
6256 fn
= MAYBE_BASELINK_FUNCTIONS (fn
);
6258 /* "If the lookup finds the two-parameter form of a usual deallocation
6259 function (3.7.4.2) and that function, considered as a placement
6260 deallocation function, would have been selected as a match for the
6261 allocation function, the program is ill-formed." */
6262 if (second_parm_is_size_t (fn
))
6264 const char *const msg1
6265 = G_("exception cleanup for this placement new selects "
6266 "non-placement operator delete");
6267 const char *const msg2
6268 = G_("%qD is a usual (non-placement) deallocation "
6269 "function in C++14 (or with -fsized-deallocation)");
6271 /* But if the class has an operator delete (void *), then that is
6272 the usual deallocation function, so we shouldn't complain
6273 about using the operator delete (void *, size_t). */
6274 if (DECL_CLASS_SCOPE_P (fn
))
6275 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
));
6279 if (usual_deallocation_fn_p (elt
)
6280 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
6283 /* Before C++14 a two-parameter global deallocation function is
6284 always a placement deallocation function, but warn if
6286 else if (!flag_sized_deallocation
)
6288 if ((complain
& tf_warning
)
6289 && warning (OPT_Wc__14_compat
, msg1
))
6290 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6294 if (complain
& tf_warning_or_error
)
6296 if (permerror (input_location
, msg1
))
6298 /* Only mention C++14 for namespace-scope delete. */
6299 if (DECL_NAMESPACE_SCOPE_P (fn
))
6300 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6302 inform (DECL_SOURCE_LOCATION (fn
),
6303 "%qD is a usual (non-placement) deallocation "
6308 return error_mark_node
;
6313 /* "Any non-placement deallocation function matches a non-placement
6314 allocation function. If the lookup finds a single matching
6315 deallocation function, that function will be called; otherwise, no
6316 deallocation function will be called." */
6317 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
)); iter
; ++iter
)
6320 if (usual_deallocation_fn_p (elt
))
6328 /* -- If the type has new-extended alignment, a function with a
6329 parameter of type std::align_val_t is preferred; otherwise a
6330 function without such a parameter is preferred. If exactly one
6331 preferred function is found, that function is selected and the
6332 selection process terminates. If more than one preferred
6333 function is found, all non-preferred functions are eliminated
6334 from further consideration. */
6335 if (aligned_new_threshold
)
6337 bool want_align
= type_has_new_extended_alignment (type
);
6338 bool fn_align
= aligned_deallocation_fn_p (fn
);
6339 bool elt_align
= aligned_deallocation_fn_p (elt
);
6341 if (elt_align
!= fn_align
)
6343 if (want_align
== elt_align
)
6349 /* -- If the deallocation functions have class scope, the one
6350 without a parameter of type std::size_t is selected. */
6352 if (DECL_CLASS_SCOPE_P (fn
))
6355 /* -- If the type is complete and if, for the second alternative
6356 (delete array) only, the operand is a pointer to a class type
6357 with a non-trivial destructor or a (possibly multi-dimensional)
6358 array thereof, the function with a parameter of type std::size_t
6361 -- Otherwise, it is unspecified whether a deallocation function
6362 with a parameter of type std::size_t is selected. */
6365 want_size
= COMPLETE_TYPE_P (type
);
6366 if (code
== VEC_DELETE_EXPR
6367 && !TYPE_VEC_NEW_USES_COOKIE (type
))
6368 /* We need a cookie to determine the array size. */
6371 bool fn_size
= second_parm_is_size_t (fn
);
6372 bool elt_size
= second_parm_is_size_t (elt
);
6373 gcc_assert (fn_size
!= elt_size
);
6374 if (want_size
== elt_size
)
6379 /* If we have a matching function, call it. */
6382 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6384 /* If the FN is a member function, make sure that it is
6386 if (BASELINK_P (fns
))
6387 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
6390 /* Core issue 901: It's ok to new a type with deleted delete. */
6391 if (DECL_DELETED_FN (fn
) && alloc_fn
)
6396 /* The placement args might not be suitable for overload
6397 resolution at this point, so build the call directly. */
6398 int nargs
= call_expr_nargs (placement
);
6399 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
6402 for (i
= 1; i
< nargs
; i
++)
6403 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
6404 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
6405 return error_mark_node
;
6406 return build_cxx_call (fn
, nargs
, argarray
, complain
);
6411 vec
<tree
, va_gc
> *args
= make_tree_vector ();
6412 args
->quick_push (addr
);
6413 if (second_parm_is_size_t (fn
))
6414 args
->quick_push (size
);
6415 if (aligned_deallocation_fn_p (fn
))
6417 tree al
= build_int_cst (align_type_node
, TYPE_ALIGN_UNIT (type
));
6418 args
->quick_push (al
);
6420 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
6421 release_tree_vector (args
);
6428 If no unambiguous matching deallocation function can be found,
6429 propagating the exception does not cause the object's memory to
6433 if ((complain
& tf_warning
)
6435 warning (0, "no corresponding deallocation function for %qD",
6440 if (complain
& tf_error
)
6441 error ("no suitable %<operator %s%> for %qT",
6442 OVL_OP_INFO (false, code
)->name
, type
);
6443 return error_mark_node
;
6446 /* If the current scope isn't allowed to access DECL along
6447 BASETYPE_PATH, give an error. The most derived class in
6448 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6449 the declaration to use in the error diagnostic. */
6452 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
6453 tsubst_flags_t complain
, access_failure_info
*afi
)
6455 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
6457 if (flag_new_inheriting_ctors
6458 && DECL_INHERITED_CTOR (decl
))
6460 /* 7.3.3/18: The additional constructors are accessible if they would be
6461 accessible when used to construct an object of the corresponding base
6463 decl
= strip_inheriting_ctors (decl
);
6464 basetype_path
= lookup_base (basetype_path
, DECL_CONTEXT (decl
),
6465 ba_any
, NULL
, complain
);
6468 if (!accessible_p (basetype_path
, decl
, true))
6470 if (complain
& tf_error
)
6472 if (flag_new_inheriting_ctors
)
6473 diag_decl
= strip_inheriting_ctors (diag_decl
);
6474 if (TREE_PRIVATE (decl
))
6476 error ("%q#D is private within this context", diag_decl
);
6477 inform (DECL_SOURCE_LOCATION (diag_decl
),
6478 "declared private here");
6480 afi
->record_access_failure (basetype_path
, diag_decl
);
6482 else if (TREE_PROTECTED (decl
))
6484 error ("%q#D is protected within this context", diag_decl
);
6485 inform (DECL_SOURCE_LOCATION (diag_decl
),
6486 "declared protected here");
6488 afi
->record_access_failure (basetype_path
, diag_decl
);
6492 error ("%q#D is inaccessible within this context", diag_decl
);
6493 inform (DECL_SOURCE_LOCATION (diag_decl
), "declared here");
6495 afi
->record_access_failure (basetype_path
, diag_decl
);
6504 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6505 bitwise or of LOOKUP_* values. If any errors are warnings are
6506 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6507 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6511 build_temp (tree expr
, tree type
, int flags
,
6512 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
6515 vec
<tree
, va_gc
> *args
;
6517 *diagnostic_kind
= DK_UNSPECIFIED
;
6519 /* If the source is a packed field, calling the copy constructor will require
6520 binding the field to the reference parameter to the copy constructor, and
6521 we'll end up with an infinite loop. If we can use a bitwise copy, then
6523 if ((lvalue_kind (expr
) & clk_packed
)
6524 && CLASS_TYPE_P (TREE_TYPE (expr
))
6525 && !type_has_nontrivial_copy_init (TREE_TYPE (expr
)))
6526 return get_target_expr_sfinae (expr
, complain
);
6528 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
6529 args
= make_tree_vector_single (expr
);
6530 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6531 &args
, type
, flags
, complain
);
6532 release_tree_vector (args
);
6533 if (warningcount
+ werrorcount
> savew
)
6534 *diagnostic_kind
= DK_WARNING
;
6535 else if (errorcount
> savee
)
6536 *diagnostic_kind
= DK_ERROR
;
6540 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6541 EXPR is implicitly converted to type TOTYPE.
6542 FN and ARGNUM are used for diagnostics. */
6545 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
6547 /* Issue warnings about peculiar, but valid, uses of NULL. */
6548 if (null_node_p (expr
) && TREE_CODE (totype
) != BOOLEAN_TYPE
6549 && ARITHMETIC_TYPE_P (totype
))
6551 source_location loc
=
6552 expansion_point_location_if_in_system_header (input_location
);
6555 warning_at (loc
, OPT_Wconversion_null
,
6556 "passing NULL to non-pointer argument %P of %qD",
6559 warning_at (loc
, OPT_Wconversion_null
,
6560 "converting to non-pointer type %qT from NULL", totype
);
6563 /* Issue warnings if "false" is converted to a NULL pointer */
6564 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
6565 && TYPE_PTR_P (totype
))
6568 warning_at (input_location
, OPT_Wconversion_null
,
6569 "converting %<false%> to pointer type for argument %P "
6570 "of %qD", argnum
, fn
);
6572 warning_at (input_location
, OPT_Wconversion_null
,
6573 "converting %<false%> to pointer type %qT", totype
);
6577 /* We gave a diagnostic during a conversion. If this was in the second
6578 standard conversion sequence of a user-defined conversion sequence, say
6579 which user-defined conversion. */
6582 maybe_print_user_conv_context (conversion
*convs
)
6584 if (convs
->user_conv_p
)
6585 for (conversion
*t
= convs
; t
; t
= next_conversion (t
))
6586 if (t
->kind
== ck_user
)
6588 print_z_candidate (0, " after user-defined conversion:",
6594 /* Locate the parameter with the given index within FNDECL.
6595 ARGNUM is zero based, -1 indicates the `this' argument of a method.
6596 Return the location of the FNDECL itself if there are problems. */
6599 get_fndecl_argument_location (tree fndecl
, int argnum
)
6604 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6605 for (i
= 0, param
= FUNCTION_FIRST_USER_PARM (fndecl
);
6606 i
< argnum
&& param
;
6607 i
++, param
= TREE_CHAIN (param
))
6610 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6611 return the location of FNDECL. */
6613 return DECL_SOURCE_LOCATION (fndecl
);
6615 return DECL_SOURCE_LOCATION (param
);
6618 /* Perform the conversions in CONVS on the expression EXPR. FN and
6619 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6620 indicates the `this' argument of a method. INNER is nonzero when
6621 being called to continue a conversion chain. It is negative when a
6622 reference binding will be applied, positive otherwise. If
6623 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6624 conversions will be emitted if appropriate. If C_CAST_P is true,
6625 this conversion is coming from a C-style cast; in that case,
6626 conversions to inaccessible bases are permitted. */
6629 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
6630 bool issue_conversion_warnings
,
6631 bool c_cast_p
, tsubst_flags_t complain
)
6633 tree totype
= convs
->type
;
6634 diagnostic_t diag_kind
;
6636 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6638 if (convs
->bad_p
&& !(complain
& tf_error
))
6639 return error_mark_node
;
6642 && convs
->kind
!= ck_user
6643 && convs
->kind
!= ck_list
6644 && convs
->kind
!= ck_ambig
6645 && (convs
->kind
!= ck_ref_bind
6646 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
6647 && (convs
->kind
!= ck_rvalue
6648 || SCALAR_TYPE_P (totype
))
6649 && convs
->kind
!= ck_base
)
6651 bool complained
= false;
6652 conversion
*t
= convs
;
6654 /* Give a helpful error if this is bad because of excess braces. */
6655 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6656 && SCALAR_TYPE_P (totype
)
6657 && CONSTRUCTOR_NELTS (expr
) > 0
6658 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
6660 complained
= permerror (loc
, "too many braces around initializer "
6662 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6663 && CONSTRUCTOR_NELTS (expr
) == 1)
6664 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6667 /* Give a helpful error if this is bad because a conversion to bool
6668 from std::nullptr_t requires direct-initialization. */
6669 if (NULLPTR_TYPE_P (TREE_TYPE (expr
))
6670 && TREE_CODE (totype
) == BOOLEAN_TYPE
)
6671 complained
= permerror (loc
, "converting to %qH from %qI requires "
6672 "direct-initialization",
6673 totype
, TREE_TYPE (expr
));
6675 for (; t
; t
= next_conversion (t
))
6677 if (t
->kind
== ck_user
&& t
->cand
->reason
)
6679 complained
= permerror (loc
, "invalid user-defined conversion "
6680 "from %qH to %qI", TREE_TYPE (expr
),
6683 print_z_candidate (loc
, "candidate is:", t
->cand
);
6684 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6685 /*issue_conversion_warnings=*/false,
6688 if (convs
->kind
== ck_ref_bind
)
6689 expr
= convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
6690 LOOKUP_NORMAL
, NULL_TREE
,
6693 expr
= cp_convert (totype
, expr
, complain
);
6694 if (complained
&& fn
)
6695 inform (DECL_SOURCE_LOCATION (fn
),
6696 " initializing argument %P of %qD", argnum
, fn
);
6699 else if (t
->kind
== ck_user
|| !t
->bad_p
)
6701 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6702 /*issue_conversion_warnings=*/false,
6707 else if (t
->kind
== ck_ambig
)
6708 return convert_like_real (t
, expr
, fn
, argnum
,
6709 /*issue_conversion_warnings=*/false,
6712 else if (t
->kind
== ck_identity
)
6716 complained
= permerror (loc
, "invalid conversion from %qH to %qI",
6717 TREE_TYPE (expr
), totype
);
6718 if (complained
&& fn
)
6719 inform (get_fndecl_argument_location (fn
, argnum
),
6720 " initializing argument %P of %qD", argnum
, fn
);
6722 return cp_convert (totype
, expr
, complain
);
6725 if (issue_conversion_warnings
&& (complain
& tf_warning
))
6726 conversion_null_warnings (totype
, expr
, fn
, argnum
);
6728 switch (convs
->kind
)
6732 struct z_candidate
*cand
= convs
->cand
;
6735 /* We chose the surrogate function from add_conv_candidate, now we
6736 actually need to build the conversion. */
6737 cand
= build_user_type_conversion_1 (totype
, expr
,
6738 LOOKUP_NO_CONVERSION
, complain
);
6740 tree convfn
= cand
->fn
;
6742 /* When converting from an init list we consider explicit
6743 constructors, but actually trying to call one is an error. */
6744 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
6745 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
6746 /* Unless this is for direct-list-initialization. */
6747 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
)
6748 /* And in C++98 a default constructor can't be explicit. */
6749 && cxx_dialect
>= cxx11
)
6751 if (!(complain
& tf_error
))
6752 return error_mark_node
;
6753 location_t loc
= location_of (expr
);
6754 if (CONSTRUCTOR_NELTS (expr
) == 0
6755 && FUNCTION_FIRST_USER_PARMTYPE (convfn
) != void_list_node
)
6757 if (pedwarn (loc
, 0, "converting to %qT from initializer list "
6758 "would use explicit constructor %qD",
6760 inform (loc
, "in C++11 and above a default constructor "
6764 error ("converting to %qT from initializer list would use "
6765 "explicit constructor %qD", totype
, convfn
);
6768 /* If we're initializing from {}, it's value-initialization. */
6769 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6770 && CONSTRUCTOR_NELTS (expr
) == 0
6771 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
6773 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
6774 if (abstract_virtuals_error_sfinae (NULL_TREE
, totype
, complain
))
6775 return error_mark_node
;
6776 expr
= build_value_init (totype
, complain
);
6777 expr
= get_target_expr_sfinae (expr
, complain
);
6778 if (expr
!= error_mark_node
)
6780 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6781 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
6786 expr
= mark_rvalue_use (expr
);
6788 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
6790 expr
= build_over_call (cand
, LOOKUP_NORMAL
|LOOKUP_NO_CONVERSION
,
6793 /* If this is a constructor or a function returning an aggr type,
6794 we need to build up a TARGET_EXPR. */
6795 if (DECL_CONSTRUCTOR_P (convfn
))
6797 expr
= build_cplus_new (totype
, expr
, complain
);
6799 /* Remember that this was list-initialization. */
6800 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
6801 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6807 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
6809 int nelts
= CONSTRUCTOR_NELTS (expr
);
6811 expr
= build_value_init (totype
, complain
);
6812 else if (nelts
== 1)
6813 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6817 expr
= mark_use (expr
, /*rvalue_p=*/!convs
->rvaluedness_matches_p
,
6818 /*read_p=*/true, UNKNOWN_LOCATION
,
6819 /*reject_builtin=*/true);
6821 if (type_unknown_p (expr
))
6822 expr
= instantiate_type (totype
, expr
, complain
);
6823 if (expr
== null_node
6824 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
6825 /* If __null has been converted to an integer type, we do not want to
6826 continue to warn about uses of EXPR as an integer, rather than as a
6828 expr
= build_int_cst (totype
, 0);
6831 /* We leave bad_p off ck_ambig because overload resolution considers
6832 it valid, it just fails when we try to perform it. So we need to
6833 check complain here, too. */
6834 if (complain
& tf_error
)
6836 /* Call build_user_type_conversion again for the error. */
6837 build_user_type_conversion (totype
, convs
->u
.expr
, LOOKUP_IMPLICIT
,
6840 inform (DECL_SOURCE_LOCATION (fn
),
6841 " initializing argument %P of %qD", argnum
, fn
);
6843 return error_mark_node
;
6847 /* Conversion to std::initializer_list<T>. */
6848 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
6849 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
6850 unsigned len
= CONSTRUCTOR_NELTS (expr
);
6851 tree array
, val
, field
;
6852 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
6855 /* Convert all the elements. */
6856 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
6858 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
6859 false, false, complain
);
6860 if (sub
== error_mark_node
)
6862 if (!BRACE_ENCLOSED_INITIALIZER_P (val
)
6863 && !check_narrowing (TREE_TYPE (sub
), val
, complain
))
6864 return error_mark_node
;
6865 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
6866 if (!TREE_CONSTANT (sub
))
6867 TREE_CONSTANT (new_ctor
) = false;
6869 /* Build up the array. */
6870 elttype
= cp_build_qualified_type
6871 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
6872 array
= build_array_of_n_type (elttype
, len
);
6873 array
= finish_compound_literal (array
, new_ctor
, complain
);
6874 /* Take the address explicitly rather than via decay_conversion
6875 to avoid the error about taking the address of a temporary. */
6876 array
= cp_build_addr_expr (array
, complain
);
6877 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
6878 if (array
== error_mark_node
)
6879 return error_mark_node
;
6881 /* Build up the initializer_list object. */
6882 totype
= complete_type (totype
);
6883 field
= next_initializable_field (TYPE_FIELDS (totype
));
6884 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
6885 field
= next_initializable_field (DECL_CHAIN (field
));
6886 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
6887 new_ctor
= build_constructor (totype
, vec
);
6888 return get_target_expr_sfinae (new_ctor
, complain
);
6892 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
6894 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6895 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
6896 real
= perform_implicit_conversion (TREE_TYPE (totype
),
6898 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
6900 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
6903 expr
= reshape_init (totype
, expr
, complain
);
6904 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
6906 if (expr
!= error_mark_node
)
6907 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6914 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
6915 convs
->kind
== ck_ref_bind
6916 ? issue_conversion_warnings
: false,
6917 c_cast_p
, complain
);
6918 if (expr
== error_mark_node
)
6919 return error_mark_node
;
6921 switch (convs
->kind
)
6924 expr
= decay_conversion (expr
, complain
);
6925 if (expr
== error_mark_node
)
6927 if (complain
& tf_error
)
6929 maybe_print_user_conv_context (convs
);
6931 inform (DECL_SOURCE_LOCATION (fn
),
6932 " initializing argument %P of %qD", argnum
, fn
);
6934 return error_mark_node
;
6937 if (! MAYBE_CLASS_TYPE_P (totype
))
6940 /* Don't introduce copies when passing arguments along to the inherited
6942 if (current_function_decl
6943 && flag_new_inheriting_ctors
6944 && DECL_INHERITED_CTOR (current_function_decl
))
6947 if (TREE_CODE (expr
) == TARGET_EXPR
6948 && TARGET_EXPR_LIST_INIT_P (expr
))
6949 /* Copy-list-initialization doesn't actually involve a copy. */
6954 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
6956 /* We are going to bind a reference directly to a base-class
6957 subobject of EXPR. */
6958 /* Build an expression for `*((base*) &expr)'. */
6959 expr
= convert_to_base (expr
, totype
,
6960 !c_cast_p
, /*nonnull=*/true, complain
);
6964 /* Copy-initialization where the cv-unqualified version of the source
6965 type is the same class as, or a derived class of, the class of the
6966 destination [is treated as direct-initialization]. [dcl.init] */
6967 flags
= LOOKUP_NORMAL
;
6968 if (convs
->user_conv_p
)
6969 /* This conversion is being done in the context of a user-defined
6970 conversion (i.e. the second step of copy-initialization), so
6971 don't allow any more. */
6972 flags
|= LOOKUP_NO_CONVERSION
;
6974 flags
|= LOOKUP_ONLYCONVERTING
;
6975 if (convs
->rvaluedness_matches_p
)
6976 /* standard_conversion got LOOKUP_PREFER_RVALUE. */
6977 flags
|= LOOKUP_PREFER_RVALUE
;
6978 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
6979 if (diag_kind
&& complain
)
6981 maybe_print_user_conv_context (convs
);
6983 inform (DECL_SOURCE_LOCATION (fn
),
6984 " initializing argument %P of %qD", argnum
, fn
);
6987 return build_cplus_new (totype
, expr
, complain
);
6991 tree ref_type
= totype
;
6993 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
6995 tree extype
= TREE_TYPE (expr
);
6996 if (TYPE_REF_IS_RVALUE (ref_type
)
6998 error_at (loc
, "cannot bind rvalue reference of type %qH to "
6999 "lvalue of type %qI", totype
, extype
);
7000 else if (!TYPE_REF_IS_RVALUE (ref_type
) && !lvalue_p (expr
)
7001 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
7002 error_at (loc
, "cannot bind non-const lvalue reference of "
7003 "type %qH to an rvalue of type %qI", totype
, extype
);
7004 else if (!reference_compatible_p (TREE_TYPE (totype
), extype
))
7005 error_at (loc
, "binding reference of type %qH to %qI "
7006 "discards qualifiers", totype
, extype
);
7009 maybe_print_user_conv_context (convs
);
7011 inform (DECL_SOURCE_LOCATION (fn
),
7012 " initializing argument %P of %qD", argnum
, fn
);
7013 return error_mark_node
;
7016 /* If necessary, create a temporary.
7018 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
7019 that need temporaries, even when their types are reference
7020 compatible with the type of reference being bound, so the
7021 upcoming call to cp_build_addr_expr doesn't fail. */
7022 if (convs
->need_temporary_p
7023 || TREE_CODE (expr
) == CONSTRUCTOR
7024 || TREE_CODE (expr
) == VA_ARG_EXPR
)
7026 /* Otherwise, a temporary of type "cv1 T1" is created and
7027 initialized from the initializer expression using the rules
7028 for a non-reference copy-initialization (8.5). */
7030 tree type
= TREE_TYPE (ref_type
);
7031 cp_lvalue_kind lvalue
= lvalue_kind (expr
);
7033 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7034 (type
, next_conversion (convs
)->type
));
7035 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
7036 && !TYPE_REF_IS_RVALUE (ref_type
))
7038 /* If the reference is volatile or non-const, we
7039 cannot create a temporary. */
7040 if (lvalue
& clk_bitfield
)
7041 error_at (loc
, "cannot bind bitfield %qE to %qT",
7043 else if (lvalue
& clk_packed
)
7044 error_at (loc
, "cannot bind packed field %qE to %qT",
7047 error_at (loc
, "cannot bind rvalue %qE to %qT",
7049 return error_mark_node
;
7051 /* If the source is a packed field, and we must use a copy
7052 constructor, then building the target expr will require
7053 binding the field to the reference parameter to the
7054 copy constructor, and we'll end up with an infinite
7055 loop. If we can use a bitwise copy, then we'll be
7057 if ((lvalue
& clk_packed
)
7058 && CLASS_TYPE_P (type
)
7059 && type_has_nontrivial_copy_init (type
))
7061 error_at (loc
, "cannot bind packed field %qE to %qT",
7063 return error_mark_node
;
7065 if (lvalue
& clk_bitfield
)
7067 expr
= convert_bitfield_to_declared_type (expr
);
7068 expr
= fold_convert (type
, expr
);
7070 expr
= build_target_expr_with_type (expr
, type
, complain
);
7073 /* Take the address of the thing to which we will bind the
7075 expr
= cp_build_addr_expr (expr
, complain
);
7076 if (expr
== error_mark_node
)
7077 return error_mark_node
;
7079 /* Convert it to a pointer to the type referred to by the
7080 reference. This will adjust the pointer if a derived to
7081 base conversion is being performed. */
7082 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
7084 /* Convert the pointer to the desired reference type. */
7085 return build_nop (ref_type
, expr
);
7089 return decay_conversion (expr
, complain
);
7092 /* ??? Should the address of a transaction-safe pointer point to the TM
7093 clone, and this conversion look up the primary function? */
7094 return build_nop (totype
, expr
);
7097 /* Warn about deprecated conversion if appropriate. */
7098 string_conv_p (totype
, expr
, 1);
7103 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
7104 /*nonnull=*/false, complain
);
7105 return build_nop (totype
, expr
);
7108 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
7109 c_cast_p
, complain
);
7115 if (convs
->check_narrowing
7116 && !check_narrowing (totype
, expr
, complain
))
7117 return error_mark_node
;
7119 if (issue_conversion_warnings
)
7120 expr
= cp_convert_and_check (totype
, expr
, complain
);
7122 expr
= cp_convert (totype
, expr
, complain
);
7127 /* ARG is being passed to a varargs function. Perform any conversions
7128 required. Return the converted value. */
7131 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
7134 location_t loc
= EXPR_LOC_OR_LOC (arg
, input_location
);
7138 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7139 standard conversions are performed. */
7140 arg
= decay_conversion (arg
, complain
);
7141 arg_type
= TREE_TYPE (arg
);
7144 If the argument has integral or enumeration type that is subject
7145 to the integral promotions (_conv.prom_), or a floating point
7146 type that is subject to the floating point promotion
7147 (_conv.fpprom_), the value of the argument is converted to the
7148 promoted type before the call. */
7149 if (TREE_CODE (arg_type
) == REAL_TYPE
7150 && (TYPE_PRECISION (arg_type
)
7151 < TYPE_PRECISION (double_type_node
))
7152 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
7154 if ((complain
& tf_warning
)
7155 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
7156 warning_at (loc
, OPT_Wdouble_promotion
,
7157 "implicit conversion from %qH to %qI when passing "
7158 "argument to function",
7159 arg_type
, double_type_node
);
7160 arg
= convert_to_real_nofold (double_type_node
, arg
);
7162 else if (NULLPTR_TYPE_P (arg_type
))
7163 arg
= null_pointer_node
;
7164 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
7166 if (SCOPED_ENUM_P (arg_type
))
7168 tree prom
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
,
7170 prom
= cp_perform_integral_promotions (prom
, complain
);
7171 if (abi_version_crosses (6)
7172 && TYPE_MODE (TREE_TYPE (prom
)) != TYPE_MODE (arg_type
)
7173 && (complain
& tf_warning
))
7174 warning_at (loc
, OPT_Wabi
, "scoped enum %qT passed through ... as "
7175 "%qT before -fabi-version=6, %qT after", arg_type
,
7176 TREE_TYPE (prom
), ENUM_UNDERLYING_TYPE (arg_type
));
7177 if (!abi_version_at_least (6))
7181 arg
= cp_perform_integral_promotions (arg
, complain
);
7184 arg
= require_complete_type_sfinae (arg
, complain
);
7185 arg_type
= TREE_TYPE (arg
);
7187 if (arg
!= error_mark_node
7188 /* In a template (or ill-formed code), we can have an incomplete type
7189 even after require_complete_type_sfinae, in which case we don't know
7190 whether it has trivial copy or not. */
7191 && COMPLETE_TYPE_P (arg_type
)
7192 && !cp_unevaluated_operand
)
7194 /* [expr.call] 5.2.2/7:
7195 Passing a potentially-evaluated argument of class type (Clause 9)
7196 with a non-trivial copy constructor or a non-trivial destructor
7197 with no corresponding parameter is conditionally-supported, with
7198 implementation-defined semantics.
7200 We support it as pass-by-invisible-reference, just like a normal
7203 If the call appears in the context of a sizeof expression,
7204 it is not potentially-evaluated. */
7205 if (type_has_nontrivial_copy_init (arg_type
)
7206 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
))
7208 arg
= force_rvalue (arg
, complain
);
7209 if (complain
& tf_warning
)
7210 warning (OPT_Wconditionally_supported
,
7211 "passing objects of non-trivially-copyable "
7212 "type %q#T through %<...%> is conditionally supported",
7214 return build1 (ADDR_EXPR
, build_reference_type (arg_type
), arg
);
7216 /* Build up a real lvalue-to-rvalue conversion in case the
7217 copy constructor is trivial but not callable. */
7218 else if (CLASS_TYPE_P (arg_type
))
7219 force_rvalue (arg
, complain
);
7226 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7229 build_x_va_arg (source_location loc
, tree expr
, tree type
)
7231 if (processing_template_decl
)
7233 tree r
= build_min (VA_ARG_EXPR
, type
, expr
);
7234 SET_EXPR_LOCATION (r
, loc
);
7238 type
= complete_type_or_else (type
, NULL_TREE
);
7240 if (expr
== error_mark_node
|| !type
)
7241 return error_mark_node
;
7243 expr
= mark_lvalue_use (expr
);
7245 if (TREE_CODE (type
) == REFERENCE_TYPE
)
7247 error ("cannot receive reference type %qT through %<...%>", type
);
7248 return error_mark_node
;
7251 if (type_has_nontrivial_copy_init (type
)
7252 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7254 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7255 it as pass by invisible reference. */
7256 warning_at (loc
, OPT_Wconditionally_supported
,
7257 "receiving objects of non-trivially-copyable type %q#T "
7258 "through %<...%> is conditionally-supported", type
);
7260 tree ref
= cp_build_reference_type (type
, false);
7261 expr
= build_va_arg (loc
, expr
, ref
);
7262 return convert_from_reference (expr
);
7265 tree ret
= build_va_arg (loc
, expr
, type
);
7266 if (CLASS_TYPE_P (type
))
7267 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7268 know how to handle it. */
7269 ret
= get_target_expr (ret
);
7273 /* TYPE has been given to va_arg. Apply the default conversions which
7274 would have happened when passed via ellipsis. Return the promoted
7275 type, or the passed type if there is no change. */
7278 cxx_type_promotes_to (tree type
)
7282 /* Perform the array-to-pointer and function-to-pointer
7284 type
= type_decays_to (type
);
7286 promote
= type_promotes_to (type
);
7287 if (same_type_p (type
, promote
))
7293 /* ARG is a default argument expression being passed to a parameter of
7294 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7295 zero-based argument number. Do any required conversions. Return
7296 the converted value. */
7298 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
7300 push_defarg_context (tree fn
)
7301 { vec_safe_push (default_arg_context
, fn
); }
7304 pop_defarg_context (void)
7305 { default_arg_context
->pop (); }
7308 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
7309 tsubst_flags_t complain
)
7314 /* See through clones. */
7315 fn
= DECL_ORIGIN (fn
);
7316 /* And inheriting ctors. */
7317 if (flag_new_inheriting_ctors
)
7318 fn
= strip_inheriting_ctors (fn
);
7320 /* Detect recursion. */
7321 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
7324 if (complain
& tf_error
)
7325 error ("recursive evaluation of default argument for %q#D", fn
);
7326 return error_mark_node
;
7329 /* If the ARG is an unparsed default argument expression, the
7330 conversion cannot be performed. */
7331 if (TREE_CODE (arg
) == DEFAULT_ARG
)
7333 if (complain
& tf_error
)
7334 error ("call to %qD uses the default argument for parameter %P, which "
7335 "is not yet defined", fn
, parmnum
);
7336 return error_mark_node
;
7339 push_defarg_context (fn
);
7341 if (fn
&& DECL_TEMPLATE_INFO (fn
))
7342 arg
= tsubst_default_argument (fn
, parmnum
, type
, arg
, complain
);
7348 The names in the expression are bound, and the semantic
7349 constraints are checked, at the point where the default
7350 expressions appears.
7352 we must not perform access checks here. */
7353 push_deferring_access_checks (dk_no_check
);
7354 /* We must make a copy of ARG, in case subsequent processing
7355 alters any part of it. */
7356 arg
= break_out_target_exprs (arg
);
7357 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
7358 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
7360 arg
= convert_for_arg_passing (type
, arg
, complain
);
7361 pop_deferring_access_checks();
7363 pop_defarg_context ();
7368 /* Returns the type which will really be used for passing an argument of
7372 type_passed_as (tree type
)
7374 /* Pass classes with copy ctors by invisible reference. */
7375 if (TREE_ADDRESSABLE (type
))
7377 type
= build_reference_type (type
);
7378 /* There are no other pointers to this temporary. */
7379 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
7381 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7382 && INTEGRAL_TYPE_P (type
)
7383 && COMPLETE_TYPE_P (type
)
7384 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7385 type
= integer_type_node
;
7390 /* Actually perform the appropriate conversion. */
7393 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
7397 /* If VAL is a bitfield, then -- since it has already been converted
7398 to TYPE -- it cannot have a precision greater than TYPE.
7400 If it has a smaller precision, we must widen it here. For
7401 example, passing "int f:3;" to a function expecting an "int" will
7402 not result in any conversion before this point.
7404 If the precision is the same we must not risk widening. For
7405 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7406 often have type "int", even though the C++ type for the field is
7407 "long long". If the value is being passed to a function
7408 expecting an "int", then no conversions will be required. But,
7409 if we call convert_bitfield_to_declared_type, the bitfield will
7410 be converted to "long long". */
7411 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
7413 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
7414 val
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
), val
);
7416 if (val
== error_mark_node
)
7418 /* Pass classes with copy ctors by invisible reference. */
7419 else if (TREE_ADDRESSABLE (type
))
7420 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
7421 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7422 && INTEGRAL_TYPE_P (type
)
7423 && COMPLETE_TYPE_P (type
)
7424 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7425 val
= cp_perform_integral_promotions (val
, complain
);
7426 if (complain
& tf_warning
)
7428 if (warn_suggest_attribute_format
)
7430 tree rhstype
= TREE_TYPE (val
);
7431 const enum tree_code coder
= TREE_CODE (rhstype
);
7432 const enum tree_code codel
= TREE_CODE (type
);
7433 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7435 && check_missing_format_attribute (type
, rhstype
))
7436 warning (OPT_Wsuggest_attribute_format
,
7437 "argument of function call might be a candidate "
7438 "for a format attribute");
7440 maybe_warn_parm_abi (type
, EXPR_LOC_OR_LOC (val
, input_location
));
7445 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7446 which just decay_conversion or no conversions at all should be done.
7447 This is true for some builtins which don't act like normal functions.
7448 Return 2 if no conversions at all should be done, 1 if just
7449 decay_conversion. Return 3 for special treatment of the 3rd argument
7450 for __builtin_*_overflow_p. */
7453 magic_varargs_p (tree fn
)
7455 if (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
7456 switch (DECL_FUNCTION_CODE (fn
))
7458 case BUILT_IN_CLASSIFY_TYPE
:
7459 case BUILT_IN_CONSTANT_P
:
7460 case BUILT_IN_NEXT_ARG
:
7461 case BUILT_IN_VA_START
:
7464 case BUILT_IN_ADD_OVERFLOW_P
:
7465 case BUILT_IN_SUB_OVERFLOW_P
:
7466 case BUILT_IN_MUL_OVERFLOW_P
:
7470 return lookup_attribute ("type generic",
7471 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
7477 /* Returns the decl of the dispatcher function if FN is a function version. */
7480 get_function_version_dispatcher (tree fn
)
7482 tree dispatcher_decl
= NULL
;
7484 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7485 && DECL_FUNCTION_VERSIONED (fn
));
7487 gcc_assert (targetm
.get_function_versions_dispatcher
);
7488 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
7490 if (dispatcher_decl
== NULL
)
7492 error_at (input_location
, "use of multiversioned function "
7493 "without a default");
7497 retrofit_lang_decl (dispatcher_decl
);
7498 gcc_assert (dispatcher_decl
!= NULL
);
7499 return dispatcher_decl
;
7502 /* fn is a function version dispatcher that is marked used. Mark all the
7503 semantically identical function versions it will dispatch as used. */
7506 mark_versions_used (tree fn
)
7508 struct cgraph_node
*node
;
7509 struct cgraph_function_version_info
*node_v
;
7510 struct cgraph_function_version_info
*it_v
;
7512 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7514 node
= cgraph_node::get (fn
);
7518 gcc_assert (node
->dispatcher_function
);
7520 node_v
= node
->function_version ();
7524 /* All semantically identical versions are chained. Traverse and mark each
7525 one of them as used. */
7526 it_v
= node_v
->next
;
7527 while (it_v
!= NULL
)
7529 mark_used (it_v
->this_node
->decl
);
7534 /* Build a call to "the copy constructor" for the type of A, even if it
7535 wouldn't be selected by normal overload resolution. Used for
7539 call_copy_ctor (tree a
, tsubst_flags_t complain
)
7541 tree ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (a
));
7542 tree binfo
= TYPE_BINFO (ctype
);
7543 tree copy
= get_copy_ctor (ctype
, complain
);
7544 copy
= build_baselink (binfo
, binfo
, copy
, NULL_TREE
);
7545 tree ob
= build_dummy_object (ctype
);
7546 vec
<tree
, va_gc
>* args
= make_tree_vector_single (a
);
7547 tree r
= build_new_method_call (ob
, copy
, &args
, NULL_TREE
,
7548 LOOKUP_NORMAL
, NULL
, complain
);
7549 release_tree_vector (args
);
7553 /* Return true iff T refers to a base field. */
7556 is_base_field_ref (tree t
)
7559 if (TREE_CODE (t
) == ADDR_EXPR
)
7560 t
= TREE_OPERAND (t
, 0);
7561 if (TREE_CODE (t
) == COMPONENT_REF
)
7562 t
= TREE_OPERAND (t
, 1);
7563 if (TREE_CODE (t
) == FIELD_DECL
)
7564 return DECL_FIELD_IS_BASE (t
);
7568 /* We can't elide a copy from a function returning by value to a base
7569 subobject, as the callee might clobber tail padding. Return true iff this
7570 could be that case. */
7573 unsafe_copy_elision_p (tree target
, tree exp
)
7575 /* Copy elision only happens with a TARGET_EXPR. */
7576 if (TREE_CODE (exp
) != TARGET_EXPR
)
7578 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
7579 /* It's safe to elide the copy for a class with no tail padding. */
7580 if (tree_int_cst_equal (TYPE_SIZE (type
), CLASSTYPE_SIZE (type
)))
7582 /* It's safe to elide the copy if we aren't initializing a base object. */
7583 if (!is_base_field_ref (target
))
7585 tree init
= TARGET_EXPR_INITIAL (exp
);
7586 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7587 while (TREE_CODE (init
) == COMPOUND_EXPR
)
7588 init
= TREE_OPERAND (init
, 1);
7589 if (TREE_CODE (init
) == COND_EXPR
)
7591 /* We'll end up copying from each of the arms of the COND_EXPR directly
7592 into the target, so look at them. */
7593 if (tree op
= TREE_OPERAND (init
, 1))
7594 if (unsafe_copy_elision_p (target
, op
))
7596 return unsafe_copy_elision_p (target
, TREE_OPERAND (init
, 2));
7598 return (TREE_CODE (init
) == AGGR_INIT_EXPR
7599 && !AGGR_INIT_VIA_CTOR_P (init
));
7602 /* Subroutine of the various build_*_call functions. Overload resolution
7603 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7604 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7605 bitmask of various LOOKUP_* flags which apply to the call itself. */
7608 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
7611 const vec
<tree
, va_gc
> *args
= cand
->args
;
7612 tree first_arg
= cand
->first_arg
;
7613 conversion
**convs
= cand
->convs
;
7615 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
7620 unsigned int arg_index
= 0;
7624 bool already_used
= false;
7626 /* In a template, there is no need to perform all of the work that
7627 is normally done. We are only interested in the type of the call
7628 expression, i.e., the return type of the function. Any semantic
7629 errors will be deferred until the template is instantiated. */
7630 if (processing_template_decl
)
7634 const tree
*argarray
;
7637 if (undeduced_auto_decl (fn
))
7638 mark_used (fn
, complain
);
7640 /* Otherwise set TREE_USED for the benefit of -Wunused-function.
7644 return_type
= TREE_TYPE (TREE_TYPE (fn
));
7645 nargs
= vec_safe_length (args
);
7646 if (first_arg
== NULL_TREE
)
7647 argarray
= args
->address ();
7655 alcarray
= XALLOCAVEC (tree
, nargs
);
7656 alcarray
[0] = build_this (first_arg
);
7657 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
7658 alcarray
[ix
+ 1] = arg
;
7659 argarray
= alcarray
;
7662 addr
= build_addr_func (fn
, complain
);
7663 if (addr
== error_mark_node
)
7664 return error_mark_node
;
7665 expr
= build_call_array_loc (input_location
, return_type
,
7666 addr
, nargs
, argarray
);
7667 if (TREE_THIS_VOLATILE (fn
) && cfun
)
7668 current_function_returns_abnormally
= 1;
7669 return convert_from_reference (expr
);
7672 /* Give any warnings we noticed during overload resolution. */
7673 if (cand
->warnings
&& (complain
& tf_warning
))
7675 struct candidate_warning
*w
;
7676 for (w
= cand
->warnings
; w
; w
= w
->next
)
7677 joust (cand
, w
->loser
, 1, complain
);
7680 /* OK, we're actually calling this inherited constructor; set its deletedness
7681 appropriately. We can get away with doing this here because calling is
7682 the only way to refer to a constructor. */
7683 if (DECL_INHERITED_CTOR (fn
))
7684 deduce_inheriting_ctor (fn
);
7686 /* Make =delete work with SFINAE. */
7687 if (DECL_DELETED_FN (fn
))
7689 if (complain
& tf_error
)
7691 return error_mark_node
;
7694 if (DECL_FUNCTION_MEMBER_P (fn
))
7697 /* If FN is a template function, two cases must be considered.
7702 template <class T> void f();
7704 template <class T> struct B {
7708 struct C : A, B<int> {
7710 using B<int>::g; // #2
7713 In case #1 where `A::f' is a member template, DECL_ACCESS is
7714 recorded in the primary template but not in its specialization.
7715 We check access of FN using its primary template.
7717 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7718 because it is a member of class template B, DECL_ACCESS is
7719 recorded in the specialization `B<int>::g'. We cannot use its
7720 primary template because `B<T>::g' and `B<int>::g' may have
7721 different access. */
7722 if (DECL_TEMPLATE_INFO (fn
)
7723 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
7724 access_fn
= DECL_TI_TEMPLATE (fn
);
7727 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
7729 return error_mark_node
;
7732 /* If we're checking for implicit delete, don't bother with argument
7734 if (flags
& LOOKUP_SPECULATIVE
)
7736 if (cand
->viable
== 1)
7738 else if (!(complain
& tf_error
))
7739 /* Reject bad conversions now. */
7740 return error_mark_node
;
7741 /* else continue to get conversion error. */
7744 /* N3276 magic doesn't apply to nested calls. */
7745 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
7746 complain
&= ~tf_decltype
;
7747 /* No-Cleanup doesn't apply to nested calls either. */
7748 tsubst_flags_t no_cleanup_complain
= complain
;
7749 complain
&= ~tf_no_cleanup
;
7751 /* Find maximum size of vector to hold converted arguments. */
7752 parmlen
= list_length (parm
);
7753 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
7754 if (parmlen
> nargs
)
7756 argarray
= XALLOCAVEC (tree
, nargs
);
7758 /* The implicit parameters to a constructor are not considered by overload
7759 resolution, and must be of the proper type. */
7760 if (DECL_CONSTRUCTOR_P (fn
))
7763 if (first_arg
!= NULL_TREE
)
7765 object_arg
= first_arg
;
7766 first_arg
= NULL_TREE
;
7770 object_arg
= (*args
)[arg_index
];
7773 argarray
[j
++] = build_this (object_arg
);
7774 parm
= TREE_CHAIN (parm
);
7775 /* We should never try to call the abstract constructor. */
7776 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
7778 if (DECL_HAS_VTT_PARM_P (fn
))
7780 argarray
[j
++] = (*args
)[arg_index
];
7782 parm
= TREE_CHAIN (parm
);
7785 if (flags
& LOOKUP_PREFER_RVALUE
)
7787 /* The implicit move specified in 15.8.3/3 fails "...if the type of
7788 the first parameter of the selected constructor is not an rvalue
7789 reference to the object’s type (possibly cv-qualified)...." */
7790 gcc_assert (!(complain
& tf_error
));
7791 tree ptype
= convs
[0]->type
;
7792 if (TREE_CODE (ptype
) != REFERENCE_TYPE
7793 || !TYPE_REF_IS_RVALUE (ptype
)
7794 || CONVERSION_RANK (convs
[0]) > cr_exact
)
7795 return error_mark_node
;
7798 /* Bypass access control for 'this' parameter. */
7799 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7801 tree parmtype
= TREE_VALUE (parm
);
7802 tree arg
= build_this (first_arg
!= NULL_TREE
7804 : (*args
)[arg_index
]);
7805 tree argtype
= TREE_TYPE (arg
);
7809 if (arg
== error_mark_node
)
7810 return error_mark_node
;
7812 if (convs
[i
]->bad_p
)
7814 if (complain
& tf_error
)
7816 if (permerror (input_location
, "passing %qT as %<this%> "
7817 "argument discards qualifiers",
7818 TREE_TYPE (argtype
)))
7819 inform (DECL_SOURCE_LOCATION (fn
), " in call to %qD", fn
);
7822 return error_mark_node
;
7825 /* See if the function member or the whole class type is declared
7826 final and the call can be devirtualized. */
7827 if (DECL_FINAL_P (fn
)
7828 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
7829 flags
|= LOOKUP_NONVIRTUAL
;
7831 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
7832 X is called for an object that is not of type X, or of a type
7833 derived from X, the behavior is undefined.
7835 So we can assume that anything passed as 'this' is non-null, and
7836 optimize accordingly. */
7837 gcc_assert (TYPE_PTR_P (parmtype
));
7838 /* Convert to the base in which the function was declared. */
7839 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
7840 converted_arg
= build_base_path (PLUS_EXPR
,
7842 cand
->conversion_path
,
7844 /* Check that the base class is accessible. */
7845 if (!accessible_base_p (TREE_TYPE (argtype
),
7846 BINFO_TYPE (cand
->conversion_path
), true))
7848 if (complain
& tf_error
)
7849 error ("%qT is not an accessible base of %qT",
7850 BINFO_TYPE (cand
->conversion_path
),
7851 TREE_TYPE (argtype
));
7853 return error_mark_node
;
7855 /* If fn was found by a using declaration, the conversion path
7856 will be to the derived class, not the base declaring fn. We
7857 must convert from derived to base. */
7858 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
7859 TREE_TYPE (parmtype
), ba_unique
,
7861 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
7862 base_binfo
, 1, complain
);
7864 argarray
[j
++] = converted_arg
;
7865 parm
= TREE_CHAIN (parm
);
7866 if (first_arg
!= NULL_TREE
)
7867 first_arg
= NULL_TREE
;
7874 gcc_assert (first_arg
== NULL_TREE
);
7875 for (; arg_index
< vec_safe_length (args
) && parm
;
7876 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
7878 tree type
= TREE_VALUE (parm
);
7879 tree arg
= (*args
)[arg_index
];
7880 bool conversion_warning
= true;
7884 /* If the argument is NULL and used to (implicitly) instantiate a
7885 template function (and bind one of the template arguments to
7886 the type of 'long int'), we don't want to warn about passing NULL
7887 to non-pointer argument.
7888 For example, if we have this template function:
7890 template<typename T> void func(T x) {}
7892 we want to warn (when -Wconversion is enabled) in this case:
7898 but not in this case:
7904 if (null_node_p (arg
)
7905 && DECL_TEMPLATE_INFO (fn
)
7906 && cand
->template_decl
7907 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
7908 conversion_warning
= false;
7910 /* Warn about initializer_list deduction that isn't currently in the
7912 if (cxx_dialect
> cxx98
7913 && flag_deduce_init_list
7914 && cand
->template_decl
7915 && is_std_init_list (non_reference (type
))
7916 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
7918 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
7919 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
7920 tree patparm
= get_pattern_parm (realparm
, tmpl
);
7921 tree pattype
= TREE_TYPE (patparm
);
7922 if (PACK_EXPANSION_P (pattype
))
7923 pattype
= PACK_EXPANSION_PATTERN (pattype
);
7924 pattype
= non_reference (pattype
);
7926 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
7927 && (cand
->explicit_targs
== NULL_TREE
7928 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
7929 <= TEMPLATE_TYPE_IDX (pattype
))))
7931 pedwarn (input_location
, 0, "deducing %qT as %qT",
7932 non_reference (TREE_TYPE (patparm
)),
7933 non_reference (type
));
7934 pedwarn (DECL_SOURCE_LOCATION (cand
->fn
), 0,
7935 " in call to %qD", cand
->fn
);
7936 pedwarn (input_location
, 0,
7937 " (you can disable this with -fno-deduce-init-list)");
7941 /* Set user_conv_p on the argument conversions, so rvalue/base handling
7942 knows not to allow any more UDCs. This needs to happen after we
7943 process cand->warnings. */
7944 if (flags
& LOOKUP_NO_CONVERSION
)
7945 conv
->user_conv_p
= true;
7947 tsubst_flags_t arg_complain
= complain
;
7948 if (!conversion_warning
)
7949 arg_complain
&= ~tf_warning
;
7951 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
7953 val
= convert_for_arg_passing (type
, val
, arg_complain
);
7955 if (val
== error_mark_node
)
7956 return error_mark_node
;
7958 argarray
[j
++] = val
;
7961 /* Default arguments */
7962 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
7964 if (TREE_VALUE (parm
) == error_mark_node
)
7965 return error_mark_node
;
7966 val
= convert_default_arg (TREE_VALUE (parm
),
7967 TREE_PURPOSE (parm
),
7970 if (val
== error_mark_node
)
7971 return error_mark_node
;
7972 argarray
[j
++] = val
;
7976 int magic
= magic_varargs_p (fn
);
7977 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
7979 tree a
= (*args
)[arg_index
];
7980 if ((magic
== 3 && arg_index
== 2) || magic
== 2)
7982 /* Do no conversions for certain magic varargs. */
7983 a
= mark_type_use (a
);
7984 if (TREE_CODE (a
) == FUNCTION_DECL
&& reject_gcc_builtin (a
))
7985 return error_mark_node
;
7987 else if (magic
!= 0)
7988 /* For other magic varargs only do decay_conversion. */
7989 a
= decay_conversion (a
, complain
);
7990 else if (DECL_CONSTRUCTOR_P (fn
)
7991 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn
),
7994 /* Avoid infinite recursion trying to call A(...). */
7995 if (complain
& tf_error
)
7996 /* Try to call the actual copy constructor for a good error. */
7997 call_copy_ctor (a
, complain
);
7998 return error_mark_node
;
8001 a
= convert_arg_to_ellipsis (a
, complain
);
8002 if (a
== error_mark_node
)
8003 return error_mark_node
;
8007 gcc_assert (j
<= nargs
);
8010 /* Avoid to do argument-transformation, if warnings for format, and for
8011 nonnull are disabled. Just in case that at least one of them is active
8012 the check_function_arguments function might warn about something. */
8014 bool warned_p
= false;
8017 || warn_suggest_attribute_format
8020 tree
*fargs
= (!nargs
? argarray
8021 : (tree
*) alloca (nargs
* sizeof (tree
)));
8022 for (j
= 0; j
< nargs
; j
++)
8024 /* For -Wformat undo the implicit passing by hidden reference
8025 done by convert_arg_to_ellipsis. */
8026 if (TREE_CODE (argarray
[j
]) == ADDR_EXPR
8027 && TREE_CODE (TREE_TYPE (argarray
[j
])) == REFERENCE_TYPE
)
8028 fargs
[j
] = TREE_OPERAND (argarray
[j
], 0);
8030 fargs
[j
] = maybe_constant_value (argarray
[j
]);
8033 warned_p
= check_function_arguments (input_location
, fn
, TREE_TYPE (fn
),
8034 nargs
, fargs
, NULL
);
8037 if (DECL_INHERITED_CTOR (fn
))
8039 /* Check for passing ellipsis arguments to an inherited constructor. We
8040 could handle this by open-coding the inherited constructor rather than
8041 defining it, but let's not bother now. */
8042 if (!cp_unevaluated_operand
8044 && cand
->convs
[cand
->num_convs
-1]->ellipsis_p
)
8046 if (complain
& tf_error
)
8048 sorry ("passing arguments to ellipsis of inherited constructor "
8050 inform (DECL_SOURCE_LOCATION (cand
->fn
), "declared here");
8052 return error_mark_node
;
8055 /* A base constructor inheriting from a virtual base doesn't get the
8056 inherited arguments, just this and __vtt. */
8057 if (ctor_omit_inherited_parms (fn
))
8061 /* Avoid actually calling copy constructors and copy assignment operators,
8064 if (! flag_elide_constructors
)
8065 /* Do things the hard way. */;
8066 else if (cand
->num_convs
== 1
8067 && (DECL_COPY_CONSTRUCTOR_P (fn
)
8068 || DECL_MOVE_CONSTRUCTOR_P (fn
))
8069 /* It's unsafe to elide the constructor when handling
8070 a noexcept-expression, it may evaluate to the wrong
8071 value (c++/53025). */
8072 && cp_noexcept_operand
== 0)
8075 tree arg
= argarray
[num_artificial_parms_for (fn
)];
8077 bool trivial
= trivial_fn_p (fn
);
8079 /* Pull out the real argument, disregarding const-correctness. */
8081 /* Strip the reference binding for the constructor parameter. */
8082 if (CONVERT_EXPR_P (targ
)
8083 && TREE_CODE (TREE_TYPE (targ
)) == REFERENCE_TYPE
)
8084 targ
= TREE_OPERAND (targ
, 0);
8085 /* But don't strip any other reference bindings; binding a temporary to a
8086 reference prevents copy elision. */
8087 while ((CONVERT_EXPR_P (targ
)
8088 && TREE_CODE (TREE_TYPE (targ
)) != REFERENCE_TYPE
)
8089 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
8090 targ
= TREE_OPERAND (targ
, 0);
8091 if (TREE_CODE (targ
) == ADDR_EXPR
)
8093 targ
= TREE_OPERAND (targ
, 0);
8094 if (!same_type_ignoring_top_level_qualifiers_p
8095 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
8104 arg
= cp_build_fold_indirect_ref (arg
);
8106 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8108 if (CHECKING_P
&& cxx_dialect
>= cxx17
)
8109 gcc_assert (TREE_CODE (arg
) != TARGET_EXPR
8110 /* It's from binding the ref parm to a packed field. */
8111 || convs
[0]->need_temporary_p
8113 /* See unsafe_copy_elision_p. */
8114 || DECL_BASE_CONSTRUCTOR_P (fn
));
8116 /* [class.copy]: the copy constructor is implicitly defined even if
8117 the implementation elided its use. */
8120 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
8121 return error_mark_node
;
8122 already_used
= true;
8125 /* If we're creating a temp and we already have one, don't create a
8126 new one. If we're not creating a temp but we get one, use
8127 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8128 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8129 temp or an INIT_EXPR otherwise. */
8131 if (is_dummy_object (fa
))
8133 if (TREE_CODE (arg
) == TARGET_EXPR
)
8136 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
8138 else if ((trivial
|| TREE_CODE (arg
) == TARGET_EXPR
)
8139 && !unsafe_copy_elision_p (fa
, arg
))
8141 tree to
= cp_stabilize_reference (cp_build_fold_indirect_ref (fa
));
8143 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
8147 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
8148 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
)
8149 && trivial_fn_p (fn
))
8151 tree to
= cp_stabilize_reference
8152 (cp_build_fold_indirect_ref (argarray
[0]));
8153 tree type
= TREE_TYPE (to
);
8154 tree as_base
= CLASSTYPE_AS_BASE (type
);
8155 tree arg
= argarray
[1];
8157 if (is_really_empty_class (type
))
8159 /* Avoid copying empty classes. */
8160 val
= build2 (COMPOUND_EXPR
, type
, arg
, to
);
8161 TREE_NO_WARNING (val
) = 1;
8163 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
8165 arg
= cp_build_fold_indirect_ref (arg
);
8166 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
8170 /* We must only copy the non-tail padding parts. */
8172 tree array_type
, alias_set
;
8174 arg2
= TYPE_SIZE_UNIT (as_base
);
8175 arg0
= cp_build_addr_expr (to
, complain
);
8177 array_type
= build_array_type (unsigned_char_type_node
,
8179 (size_binop (MINUS_EXPR
,
8180 arg2
, size_int (1))));
8181 alias_set
= build_int_cst (build_pointer_type (type
), 0);
8182 t
= build2 (MODIFY_EXPR
, void_type_node
,
8183 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
8184 build2 (MEM_REF
, array_type
, arg
, alias_set
));
8185 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
8186 TREE_NO_WARNING (val
) = 1;
8191 else if (trivial_fn_p (fn
))
8193 if (DECL_DESTRUCTOR_P (fn
))
8194 return fold_convert (void_type_node
, argarray
[0]);
8195 else if (default_ctor_p (fn
))
8197 if (is_dummy_object (argarray
[0]))
8198 return force_target_expr (DECL_CONTEXT (fn
), void_node
,
8199 no_cleanup_complain
);
8201 return cp_build_fold_indirect_ref (argarray
[0]);
8206 && !mark_used (fn
, complain
))
8207 return error_mark_node
;
8209 /* Warn if the built-in writes to an object of a non-trivial type. */
8210 if (warn_class_memaccess
8211 && vec_safe_length (args
) >= 2
8212 && DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
8213 maybe_warn_class_memaccess (input_location
, fn
, args
);
8215 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0
8216 /* Don't mess with virtual lookup in instantiate_non_dependent_expr;
8217 virtual functions can't be constexpr. */
8218 && !in_template_function ())
8221 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
8223 ba_any
, NULL
, complain
);
8224 gcc_assert (binfo
&& binfo
!= error_mark_node
);
8226 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
8228 if (TREE_SIDE_EFFECTS (argarray
[0]))
8229 argarray
[0] = save_expr (argarray
[0]);
8230 t
= build_pointer_type (TREE_TYPE (fn
));
8231 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
8236 fn
= build_addr_func (fn
, complain
);
8237 if (fn
== error_mark_node
)
8238 return error_mark_node
;
8241 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
8242 if (call
== error_mark_node
)
8244 if (cand
->flags
& LOOKUP_LIST_INIT_CTOR
)
8246 tree c
= extract_call_expr (call
);
8247 /* build_new_op_1 will clear this when appropriate. */
8248 CALL_EXPR_ORDERED_ARGS (c
) = true;
8252 tree c
= extract_call_expr (call
);
8253 if (TREE_CODE (c
) == CALL_EXPR
)
8254 TREE_NO_WARNING (c
) = 1;
8259 /* Return the DECL of the first non-public data member of class TYPE
8260 or null if none can be found. */
8263 first_non_public_field (tree type
)
8265 if (!CLASS_TYPE_P (type
))
8268 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
8270 if (TREE_CODE (field
) != FIELD_DECL
)
8272 if (TREE_STATIC (field
))
8274 if (TREE_PRIVATE (field
) || TREE_PROTECTED (field
))
8280 for (tree base_binfo
, binfo
= TYPE_BINFO (type
);
8281 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8283 tree base
= TREE_TYPE (base_binfo
);
8285 if (tree field
= first_non_public_field (base
))
8292 /* Return true if all copy and move assignment operator overloads for
8293 class TYPE are trivial and at least one of them is not deleted and,
8294 when ACCESS is set, accessible. Return false otherwise. Set
8295 HASASSIGN to true when the TYPE has a (not necessarily trivial)
8296 copy or move assignment. */
8299 has_trivial_copy_assign_p (tree type
, bool access
, bool *hasassign
)
8301 tree fns
= get_class_binding (type
, assign_op_identifier
);
8302 bool all_trivial
= true;
8304 /* Iterate over overloads of the assignment operator, checking
8305 accessible copy assignments for triviality. */
8307 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8311 /* Skip operators that aren't copy assignments. */
8315 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8316 || accessible_p (TYPE_BINFO (type
), f
, true));
8318 /* Skip template assignment operators and deleted functions. */
8319 if (TREE_CODE (f
) != FUNCTION_DECL
|| DECL_DELETED_FN (f
))
8325 if (!accessible
|| !trivial_fn_p (f
))
8326 all_trivial
= false;
8328 /* Break early when both properties have been determined. */
8329 if (*hasassign
&& !all_trivial
)
8333 /* Return true if they're all trivial and one of the expressions
8334 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
8335 tree ref
= cp_build_reference_type (type
, false);
8337 && (is_trivially_xible (MODIFY_EXPR
, type
, type
)
8338 || is_trivially_xible (MODIFY_EXPR
, type
, ref
)));
8341 /* Return true if all copy and move ctor overloads for class TYPE are
8342 trivial and at least one of them is not deleted and, when ACCESS is
8343 set, accessible. Return false otherwise. Set each element of HASCTOR[]
8344 to true when the TYPE has a (not necessarily trivial) default and copy
8345 (or move) ctor, respectively. */
8348 has_trivial_copy_p (tree type
, bool access
, bool hasctor
[2])
8350 tree fns
= get_class_binding (type
, complete_ctor_identifier
);
8351 bool all_trivial
= true;
8353 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8357 /* Skip template constructors. */
8358 if (TREE_CODE (f
) != FUNCTION_DECL
)
8361 bool cpy_or_move_ctor_p
= copy_fn_p (f
);
8363 /* Skip ctors other than default, copy, and move. */
8364 if (!cpy_or_move_ctor_p
&& !default_ctor_p (f
))
8367 if (DECL_DELETED_FN (f
))
8370 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8371 || accessible_p (TYPE_BINFO (type
), f
, true));
8374 hasctor
[cpy_or_move_ctor_p
] = true;
8376 if (cpy_or_move_ctor_p
&& (!accessible
|| !trivial_fn_p (f
)))
8377 all_trivial
= false;
8379 /* Break early when both properties have been determined. */
8380 if (hasctor
[0] && hasctor
[1] && !all_trivial
)
8387 /* Issue a warning on a call to the built-in function FNDECL if it is
8388 a raw memory write whose destination is not an object of (something
8389 like) trivial or standard layout type with a non-deleted assignment
8390 and copy ctor. Detects const correctness violations, corrupting
8391 references, virtual table pointers, and bypassing non-trivial
8395 maybe_warn_class_memaccess (location_t loc
, tree fndecl
,
8396 const vec
<tree
, va_gc
> *args
)
8398 /* Except for bcopy where it's second, the destination pointer is
8399 the first argument for all functions handled here. Compute
8400 the index of the destination and source arguments. */
8401 unsigned dstidx
= DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_BCOPY
;
8402 unsigned srcidx
= !dstidx
;
8404 tree dest
= (*args
)[dstidx
];
8405 if (!TREE_TYPE (dest
) || !POINTER_TYPE_P (TREE_TYPE (dest
)))
8408 tree srctype
= NULL_TREE
;
8410 /* Determine the type of the pointed-to object and whether it's
8411 a complete class type. */
8412 tree desttype
= TREE_TYPE (TREE_TYPE (dest
));
8414 if (!desttype
|| !COMPLETE_TYPE_P (desttype
) || !CLASS_TYPE_P (desttype
))
8417 /* Check to see if the raw memory call is made by a ctor or dtor
8418 with this as the destination argument for the destination type.
8419 If so, be more permissive. */
8420 if (current_function_decl
8421 && (DECL_CONSTRUCTOR_P (current_function_decl
)
8422 || DECL_DESTRUCTOR_P (current_function_decl
))
8423 && is_this_parameter (tree_strip_nop_conversions (dest
)))
8425 tree ctx
= DECL_CONTEXT (current_function_decl
);
8426 bool special
= same_type_ignoring_top_level_qualifiers_p (ctx
, desttype
);
8428 tree binfo
= TYPE_BINFO (ctx
);
8430 /* A ctor and dtor for a class with no bases and no virtual functions
8431 can do whatever they want. Bail early with no further checking. */
8432 if (special
&& !BINFO_VTABLE (binfo
) && !BINFO_N_BASE_BINFOS (binfo
))
8436 /* True if the class is trivial. */
8437 bool trivial
= trivial_type_p (desttype
);
8439 /* Set to true if DESTYPE has an accessible copy assignment. */
8440 bool hasassign
= false;
8441 /* True if all of the class' overloaded copy assignment operators
8442 are all trivial (and not deleted) and at least one of them is
8444 bool trivassign
= has_trivial_copy_assign_p (desttype
, true, &hasassign
);
8446 /* Set to true if DESTTYPE has an accessible default and copy ctor,
8448 bool hasctors
[2] = { false, false };
8450 /* True if all of the class' overloaded copy constructors are all
8451 trivial (and not deleted) and at least one of them is accessible. */
8452 bool trivcopy
= has_trivial_copy_p (desttype
, true, hasctors
);
8454 /* Set FLD to the first private/protected member of the class. */
8455 tree fld
= trivial
? first_non_public_field (desttype
) : NULL_TREE
;
8457 /* The warning format string. */
8458 const char *warnfmt
= NULL
;
8459 /* A suggested alternative to offer instead of the raw memory call.
8460 Empty string when none can be come up with. */
8461 const char *suggest
= "";
8462 bool warned
= false;
8464 switch (DECL_FUNCTION_CODE (fndecl
))
8466 case BUILT_IN_MEMSET
:
8467 if (!integer_zerop (maybe_constant_value ((*args
)[1])))
8469 /* Diagnose setting non-copy-assignable or non-trivial types,
8470 or types with a private member, to (potentially) non-zero
8471 bytes. Since the value of the bytes being written is unknown,
8472 suggest using assignment instead (if one exists). Also warn
8473 for writes into objects for which zero-initialization doesn't
8474 mean all bits clear (pointer-to-member data, where null is all
8475 bits set). Since the value being written is (most likely)
8476 non-zero, simply suggest assignment (but not copy assignment). */
8477 suggest
= "; use assignment instead";
8479 warnfmt
= G_("%qD writing to an object of type %#qT with "
8480 "no trivial copy-assignment");
8482 warnfmt
= G_("%qD writing to an object of non-trivial type %#qT%s");
8485 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8486 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8487 "%qD writing to an object of type %#qT with "
8489 fndecl
, desttype
, access
, fld
);
8491 else if (!zero_init_p (desttype
))
8492 warnfmt
= G_("%qD writing to an object of type %#qT containing "
8493 "a pointer to data member%s");
8499 case BUILT_IN_BZERO
:
8500 /* Similarly to the above, diagnose clearing non-trivial or non-
8501 standard layout objects, or objects of types with no assignmenmt.
8502 Since the value being written is known to be zero, suggest either
8503 copy assignment, copy ctor, or default ctor as an alternative,
8504 depending on what's available. */
8506 if (hasassign
&& hasctors
[0])
8507 suggest
= G_("; use assignment or value-initialization instead");
8509 suggest
= G_("; use assignment instead");
8510 else if (hasctors
[0])
8511 suggest
= G_("; use value-initialization instead");
8514 warnfmt
= G_("%qD clearing an object of type %#qT with "
8515 "no trivial copy-assignment%s");
8517 warnfmt
= G_("%qD clearing an object of non-trivial type %#qT%s");
8518 else if (!zero_init_p (desttype
))
8519 warnfmt
= G_("%qD clearing an object of type %#qT containing "
8520 "a pointer-to-member%s");
8523 case BUILT_IN_BCOPY
:
8524 case BUILT_IN_MEMCPY
:
8525 case BUILT_IN_MEMMOVE
:
8526 case BUILT_IN_MEMPCPY
:
8527 /* Determine the type of the source object. */
8528 srctype
= TREE_TYPE ((*args
)[srcidx
]);
8529 if (!srctype
|| !POINTER_TYPE_P (srctype
))
8530 srctype
= void_type_node
;
8532 srctype
= TREE_TYPE (srctype
);
8534 /* Since it's impossible to determine wheter the byte copy is
8535 being used in place of assignment to an existing object or
8536 as a substitute for initialization, assume it's the former.
8537 Determine the best alternative to use instead depending on
8538 what's not deleted. */
8539 if (hasassign
&& hasctors
[1])
8540 suggest
= G_("; use copy-assignment or copy-initialization instead");
8542 suggest
= G_("; use copy-assignment instead");
8543 else if (hasctors
[1])
8544 suggest
= G_("; use copy-initialization instead");
8547 warnfmt
= G_("%qD writing to an object of type %#qT with no trivial "
8548 "copy-assignment%s");
8549 else if (!trivially_copyable_p (desttype
))
8550 warnfmt
= G_("%qD writing to an object of non-trivially copyable "
8553 warnfmt
= G_("%qD writing to an object with a deleted copy constructor");
8556 && !VOID_TYPE_P (srctype
)
8557 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
8558 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
8561 /* Warn when copying into a non-trivial object from an object
8562 of a different type other than void or char. */
8563 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8564 "%qD copying an object of non-trivial type "
8565 "%#qT from an array of %#qT",
8566 fndecl
, desttype
, srctype
);
8569 && !VOID_TYPE_P (srctype
)
8570 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
8571 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
8574 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8575 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8576 "%qD copying an object of type %#qT with "
8577 "%qs member %qD from an array of %#qT; use "
8578 "assignment or copy-initialization instead",
8579 fndecl
, desttype
, access
, fld
, srctype
);
8581 else if (!trivial
&& vec_safe_length (args
) > 2)
8583 tree sz
= maybe_constant_value ((*args
)[2]);
8584 if (!tree_fits_uhwi_p (sz
))
8587 /* Finally, warn on partial copies. */
8588 unsigned HOST_WIDE_INT typesize
8589 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype
));
8590 if (unsigned HOST_WIDE_INT partial
= tree_to_uhwi (sz
) % typesize
)
8591 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8592 (typesize
- partial
> 1
8593 ? G_("%qD writing to an object of "
8594 "a non-trivial type %#qT leaves %wu "
8596 : G_("%qD writing to an object of "
8597 "a non-trivial type %#qT leaves %wu "
8599 fndecl
, desttype
, typesize
- partial
);
8603 case BUILT_IN_REALLOC
:
8605 if (!trivially_copyable_p (desttype
))
8606 warnfmt
= G_("%qD moving an object of non-trivially copyable type "
8607 "%#qT; use %<new%> and %<delete%> instead");
8609 warnfmt
= G_("%qD moving an object of type %#qT with deleted copy "
8610 "constructor; use %<new%> and %<delete%> instead");
8611 else if (!get_dtor (desttype
, tf_none
))
8612 warnfmt
= G_("%qD moving an object of type %#qT with deleted "
8616 tree sz
= maybe_constant_value ((*args
)[1]);
8617 if (TREE_CODE (sz
) == INTEGER_CST
8618 && tree_int_cst_lt (sz
, TYPE_SIZE_UNIT (desttype
)))
8619 /* Finally, warn on reallocation into insufficient space. */
8620 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8621 "%qD moving an object of non-trivial type "
8622 "%#qT and size %E into a region of size %E",
8623 fndecl
, desttype
, TYPE_SIZE_UNIT (desttype
),
8635 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8636 warnfmt
, fndecl
, desttype
, suggest
);
8638 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8639 warnfmt
, fndecl
, desttype
);
8643 inform (location_of (desttype
), "%#qT declared here", desttype
);
8646 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
8647 This function performs no overload resolution, conversion, or other
8648 high-level operations. */
8651 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
8652 tsubst_flags_t complain
)
8656 /* Remember roughly where this call is. */
8657 location_t loc
= EXPR_LOC_OR_LOC (fn
, input_location
);
8658 fn
= build_call_a (fn
, nargs
, argarray
);
8659 SET_EXPR_LOCATION (fn
, loc
);
8661 fndecl
= get_callee_fndecl (fn
);
8663 /* Check that arguments to builtin functions match the expectations. */
8665 && DECL_BUILT_IN (fndecl
)
8666 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
8670 /* We need to take care that values to BUILT_IN_NORMAL
8672 for (i
= 0; i
< nargs
; i
++)
8673 argarray
[i
] = fold_non_dependent_expr (argarray
[i
]);
8675 if (!check_builtin_function_arguments (EXPR_LOCATION (fn
), vNULL
, fndecl
,
8677 return error_mark_node
;
8680 if (VOID_TYPE_P (TREE_TYPE (fn
)))
8683 /* 5.2.2/11: If a function call is a prvalue of object type: if the
8684 function call is either the operand of a decltype-specifier or the
8685 right operand of a comma operator that is the operand of a
8686 decltype-specifier, a temporary object is not introduced for the
8687 prvalue. The type of the prvalue may be incomplete. */
8688 if (!(complain
& tf_decltype
))
8690 fn
= require_complete_type_sfinae (fn
, complain
);
8691 if (fn
== error_mark_node
)
8692 return error_mark_node
;
8694 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
8696 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
8697 maybe_warn_parm_abi (TREE_TYPE (fn
), loc
);
8700 return convert_from_reference (fn
);
8703 /* Returns the value to use for the in-charge parameter when making a
8704 call to a function with the indicated NAME.
8706 FIXME:Can't we find a neater way to do this mapping? */
8709 in_charge_arg_for_name (tree name
)
8711 if (IDENTIFIER_CTOR_P (name
))
8713 if (name
== complete_ctor_identifier
)
8714 return integer_one_node
;
8715 gcc_checking_assert (name
== base_ctor_identifier
);
8719 if (name
== complete_dtor_identifier
)
8720 return integer_two_node
;
8721 else if (name
== deleting_dtor_identifier
)
8722 return integer_three_node
;
8723 gcc_checking_assert (name
== base_dtor_identifier
);
8726 return integer_zero_node
;
8729 /* We've built up a constructor call RET. Complain if it delegates to the
8730 constructor we're currently compiling. */
8733 check_self_delegation (tree ret
)
8735 if (TREE_CODE (ret
) == TARGET_EXPR
)
8736 ret
= TARGET_EXPR_INITIAL (ret
);
8737 tree fn
= cp_get_callee_fndecl (ret
);
8738 if (fn
&& DECL_ABSTRACT_ORIGIN (fn
) == current_function_decl
)
8739 error ("constructor delegates to itself");
8742 /* Build a call to a constructor, destructor, or an assignment
8743 operator for INSTANCE, an expression with class type. NAME
8744 indicates the special member function to call; *ARGS are the
8745 arguments. ARGS may be NULL. This may change ARGS. BINFO
8746 indicates the base of INSTANCE that is to be passed as the `this'
8747 parameter to the member function called.
8749 FLAGS are the LOOKUP_* flags to use when processing the call.
8751 If NAME indicates a complete object constructor, INSTANCE may be
8752 NULL_TREE. In this case, the caller will call build_cplus_new to
8753 store the newly constructed object into a VAR_DECL. */
8756 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
8757 tree binfo
, int flags
, tsubst_flags_t complain
)
8760 /* The type of the subobject to be constructed or destroyed. */
8762 vec
<tree
, va_gc
> *allocated
= NULL
;
8765 gcc_assert (IDENTIFIER_CDTOR_P (name
) || name
== assign_op_identifier
);
8768 /* Resolve the name. */
8769 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
8770 return error_mark_node
;
8772 binfo
= TYPE_BINFO (binfo
);
8775 gcc_assert (binfo
!= NULL_TREE
);
8777 class_type
= BINFO_TYPE (binfo
);
8779 /* Handle the special case where INSTANCE is NULL_TREE. */
8780 if (name
== complete_ctor_identifier
&& !instance
)
8781 instance
= build_dummy_object (class_type
);
8784 if (IDENTIFIER_DTOR_P (name
))
8785 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
8787 /* Convert to the base class, if necessary. */
8788 if (!same_type_ignoring_top_level_qualifiers_p
8789 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
8791 if (IDENTIFIER_CDTOR_P (name
))
8792 /* For constructors and destructors, either the base is
8793 non-virtual, or it is virtual but we are doing the
8794 conversion from a constructor or destructor for the
8795 complete object. In either case, we can convert
8797 instance
= convert_to_base_statically (instance
, binfo
);
8800 /* However, for assignment operators, we must convert
8801 dynamically if the base is virtual. */
8802 gcc_checking_assert (name
== assign_op_identifier
);
8803 instance
= build_base_path (PLUS_EXPR
, instance
,
8804 binfo
, /*nonnull=*/1, complain
);
8809 gcc_assert (instance
!= NULL_TREE
);
8811 /* In C++17, "If the initializer expression is a prvalue and the
8812 cv-unqualified version of the source type is the same class as the class
8813 of the destination, the initializer expression is used to initialize the
8814 destination object." Handle that here to avoid doing overload
8816 if (cxx_dialect
>= cxx17
8817 && args
&& vec_safe_length (*args
) == 1
8818 && name
== complete_ctor_identifier
)
8820 tree arg
= (**args
)[0];
8822 /* FIXME P0135 doesn't say how to handle direct initialization from a
8823 type with a suitable conversion operator. Let's handle it like
8824 copy-initialization, but allowing explict conversions. */
8825 tsubst_flags_t sub_complain
= tf_warning
;
8826 if (!is_dummy_object (instance
))
8827 /* If we're using this to initialize a non-temporary object, don't
8828 require the destructor to be accessible. */
8829 sub_complain
|= tf_no_cleanup
;
8830 if (!reference_related_p (class_type
, TREE_TYPE (arg
)))
8831 arg
= perform_implicit_conversion_flags (class_type
, arg
,
8834 if ((TREE_CODE (arg
) == TARGET_EXPR
8835 || TREE_CODE (arg
) == CONSTRUCTOR
)
8836 && (same_type_ignoring_top_level_qualifiers_p
8837 (class_type
, TREE_TYPE (arg
))))
8839 if (is_dummy_object (instance
))
8841 else if (TREE_CODE (arg
) == TARGET_EXPR
)
8842 TARGET_EXPR_DIRECT_INIT_P (arg
) = true;
8844 if ((complain
& tf_error
)
8845 && (flags
& LOOKUP_DELEGATING_CONS
))
8846 check_self_delegation (arg
);
8847 /* Avoid change of behavior on Wunused-var-2.C. */
8848 instance
= mark_lvalue_use (instance
);
8849 return build2 (INIT_EXPR
, class_type
, instance
, arg
);
8853 fns
= lookup_fnfields (binfo
, name
, 1);
8855 /* When making a call to a constructor or destructor for a subobject
8856 that uses virtual base classes, pass down a pointer to a VTT for
8858 if ((name
== base_ctor_identifier
8859 || name
== base_dtor_identifier
)
8860 && CLASSTYPE_VBASECLASSES (class_type
))
8865 /* If the current function is a complete object constructor
8866 or destructor, then we fetch the VTT directly.
8867 Otherwise, we look it up using the VTT we were given. */
8868 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
8869 vtt
= decay_conversion (vtt
, complain
);
8870 if (vtt
== error_mark_node
)
8871 return error_mark_node
;
8872 vtt
= build_if_in_charge (vtt
, current_vtt_parm
);
8873 if (BINFO_SUBVTT_INDEX (binfo
))
8874 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
8880 allocated
= make_tree_vector ();
8884 vec_safe_insert (*args
, 0, sub_vtt
);
8887 ret
= build_new_method_call (instance
, fns
, args
,
8888 TYPE_BINFO (BINFO_TYPE (binfo
)),
8892 if (allocated
!= NULL
)
8893 release_tree_vector (allocated
);
8895 if ((complain
& tf_error
)
8896 && (flags
& LOOKUP_DELEGATING_CONS
)
8897 && name
== complete_ctor_identifier
)
8898 check_self_delegation (ret
);
8903 /* Return the NAME, as a C string. The NAME indicates a function that
8904 is a member of TYPE. *FREE_P is set to true if the caller must
8905 free the memory returned.
8907 Rather than go through all of this, we should simply set the names
8908 of constructors and destructors appropriately, and dispense with
8909 ctor_identifier, dtor_identifier, etc. */
8912 name_as_c_string (tree name
, tree type
, bool *free_p
)
8914 const char *pretty_name
;
8916 /* Assume that we will not allocate memory. */
8918 /* Constructors and destructors are special. */
8919 if (IDENTIFIER_CDTOR_P (name
))
8922 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
)));
8923 /* For a destructor, add the '~'. */
8924 if (IDENTIFIER_DTOR_P (name
))
8926 pretty_name
= concat ("~", pretty_name
, NULL
);
8927 /* Remember that we need to free the memory allocated. */
8931 else if (IDENTIFIER_CONV_OP_P (name
))
8933 pretty_name
= concat ("operator ",
8934 type_as_string_translate (TREE_TYPE (name
),
8935 TFF_PLAIN_IDENTIFIER
),
8937 /* Remember that we need to free the memory allocated. */
8941 pretty_name
= identifier_to_locale (IDENTIFIER_POINTER (name
));
8943 return CONST_CAST (char *, pretty_name
);
8946 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
8947 be set, upon return, to the function called. ARGS may be NULL.
8948 This may change ARGS. */
8951 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
8952 tree conversion_path
, int flags
,
8953 tree
*fn_p
, tsubst_flags_t complain
)
8955 struct z_candidate
*candidates
= 0, *cand
;
8956 tree explicit_targs
= NULL_TREE
;
8957 tree basetype
= NULL_TREE
;
8958 tree access_binfo
, binfo
;
8960 tree first_mem_arg
= NULL_TREE
;
8962 bool skip_first_for_error
;
8963 vec
<tree
, va_gc
> *user_args
;
8966 int template_only
= 0;
8970 vec
<tree
, va_gc
> *orig_args
= NULL
;
8973 gcc_assert (instance
!= NULL_TREE
);
8975 /* We don't know what function we're going to call, yet. */
8979 if (error_operand_p (instance
)
8980 || !fns
|| error_operand_p (fns
))
8981 return error_mark_node
;
8983 if (!BASELINK_P (fns
))
8985 if (complain
& tf_error
)
8986 error ("call to non-function %qD", fns
);
8987 return error_mark_node
;
8990 orig_instance
= instance
;
8993 /* Dismantle the baselink to collect all the information we need. */
8994 if (!conversion_path
)
8995 conversion_path
= BASELINK_BINFO (fns
);
8996 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
8997 binfo
= BASELINK_BINFO (fns
);
8998 optype
= BASELINK_OPTYPE (fns
);
8999 fns
= BASELINK_FUNCTIONS (fns
);
9000 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
9002 explicit_targs
= TREE_OPERAND (fns
, 1);
9003 fns
= TREE_OPERAND (fns
, 0);
9006 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
9007 || TREE_CODE (fns
) == TEMPLATE_DECL
9008 || TREE_CODE (fns
) == OVERLOAD
);
9009 fn
= OVL_FIRST (fns
);
9010 name
= DECL_NAME (fn
);
9012 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
9013 gcc_assert (CLASS_TYPE_P (basetype
));
9015 if (processing_template_decl
)
9017 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
9018 instance
= build_non_dependent_expr (instance
);
9020 make_args_non_dependent (*args
);
9023 user_args
= args
== NULL
? NULL
: *args
;
9024 /* Under DR 147 A::A() is an invalid constructor call,
9025 not a functional cast. */
9026 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
9028 if (! (complain
& tf_error
))
9029 return error_mark_node
;
9031 basetype
= DECL_CONTEXT (fn
);
9032 name
= constructor_name (basetype
);
9033 if (permerror (input_location
,
9034 "cannot call constructor %<%T::%D%> directly",
9036 inform (input_location
, "for a function-style cast, remove the "
9037 "redundant %<::%D%>", name
);
9038 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
9043 /* Process the argument list. */
9044 if (args
!= NULL
&& *args
!= NULL
)
9046 *args
= resolve_args (*args
, complain
);
9048 return error_mark_node
;
9051 /* Consider the object argument to be used even if we end up selecting a
9052 static member function. */
9053 instance
= mark_type_use (instance
);
9055 /* Figure out whether to skip the first argument for the error
9056 message we will display to users if an error occurs. We don't
9057 want to display any compiler-generated arguments. The "this"
9058 pointer hasn't been added yet. However, we must remove the VTT
9059 pointer if this is a call to a base-class constructor or
9061 skip_first_for_error
= false;
9062 if (IDENTIFIER_CDTOR_P (name
))
9064 /* Callers should explicitly indicate whether they want to ctor
9065 the complete object or just the part without virtual bases. */
9066 gcc_assert (name
!= ctor_identifier
);
9068 /* Remove the VTT pointer, if present. */
9069 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
9070 && CLASSTYPE_VBASECLASSES (basetype
))
9071 skip_first_for_error
= true;
9073 /* It's OK to call destructors and constructors on cv-qualified
9074 objects. Therefore, convert the INSTANCE to the unqualified
9075 type, if necessary. */
9076 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
9078 instance
= build_this (instance
);
9079 instance
= build_nop (build_pointer_type (basetype
), instance
);
9080 instance
= build_fold_indirect_ref (instance
);
9084 gcc_assert (!DECL_DESTRUCTOR_P (fn
) && !DECL_CONSTRUCTOR_P (fn
));
9086 /* For the overload resolution we need to find the actual `this`
9087 that would be captured if the call turns out to be to a
9088 non-static member function. Do not actually capture it at this
9090 if (DECL_CONSTRUCTOR_P (fn
))
9091 /* Constructors don't use the enclosing 'this'. */
9092 first_mem_arg
= instance
;
9094 first_mem_arg
= maybe_resolve_dummy (instance
, false);
9096 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9097 p
= conversion_obstack_alloc (0);
9099 /* The number of arguments artificial parms in ARGS; we subtract one because
9100 there's no 'this' in ARGS. */
9101 unsigned skip
= num_artificial_parms_for (fn
) - 1;
9103 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
9104 initializer, not T({ }). */
9105 if (DECL_CONSTRUCTOR_P (fn
)
9106 && vec_safe_length (user_args
) > skip
9107 && DIRECT_LIST_INIT_P ((*user_args
)[skip
]))
9109 tree init_list
= (*user_args
)[skip
];
9110 tree init
= NULL_TREE
;
9112 gcc_assert (user_args
->length () == skip
+ 1
9113 && !(flags
& LOOKUP_ONLYCONVERTING
));
9115 /* If the initializer list has no elements and T is a class type with
9116 a default constructor, the object is value-initialized. Handle
9117 this here so we don't need to handle it wherever we use
9118 build_special_member_call. */
9119 if (CONSTRUCTOR_NELTS (init_list
) == 0
9120 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
9121 /* For a user-provided default constructor, use the normal
9122 mechanisms so that protected access works. */
9123 && type_has_non_user_provided_default_constructor (basetype
)
9124 && !processing_template_decl
)
9125 init
= build_value_init (basetype
, complain
);
9127 /* If BASETYPE is an aggregate, we need to do aggregate
9129 else if (CP_AGGREGATE_TYPE_P (basetype
))
9131 init
= reshape_init (basetype
, init_list
, complain
);
9132 init
= digest_init (basetype
, init
, complain
);
9137 if (is_dummy_object (instance
))
9138 return get_target_expr_sfinae (init
, complain
);
9139 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
9140 TREE_SIDE_EFFECTS (init
) = true;
9144 /* Otherwise go ahead with overload resolution. */
9145 add_list_candidates (fns
, first_mem_arg
, user_args
,
9146 basetype
, explicit_targs
, template_only
,
9147 conversion_path
, access_binfo
, flags
,
9148 &candidates
, complain
);
9151 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
9152 explicit_targs
, template_only
, conversion_path
,
9153 access_binfo
, flags
, &candidates
, complain
);
9155 any_viable_p
= false;
9156 candidates
= splice_viable (candidates
, false, &any_viable_p
);
9160 if (complain
& tf_error
)
9162 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
9163 cxx_incomplete_type_error (instance
, basetype
);
9165 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9166 basetype
, optype
, build_tree_list_vec (user_args
),
9167 TREE_TYPE (instance
));
9170 tree arglist
= build_tree_list_vec (user_args
);
9171 tree errname
= name
;
9172 bool twiddle
= false;
9173 if (IDENTIFIER_CDTOR_P (errname
))
9175 twiddle
= IDENTIFIER_DTOR_P (errname
);
9176 errname
= constructor_name (basetype
);
9179 errname
= lookup_template_function (errname
, explicit_targs
);
9180 if (skip_first_for_error
)
9181 arglist
= TREE_CHAIN (arglist
);
9182 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
9183 basetype
, &"~"[!twiddle
], errname
, arglist
,
9184 TREE_TYPE (instance
));
9186 print_z_candidates (location_of (name
), candidates
);
9188 call
= error_mark_node
;
9192 cand
= tourney (candidates
, complain
);
9199 if (complain
& tf_error
)
9201 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
9202 arglist
= build_tree_list_vec (user_args
);
9203 if (skip_first_for_error
)
9204 arglist
= TREE_CHAIN (arglist
);
9205 if (!any_strictly_viable (candidates
))
9206 error ("no matching function for call to %<%s(%A)%>",
9207 pretty_name
, arglist
);
9209 error ("call of overloaded %<%s(%A)%> is ambiguous",
9210 pretty_name
, arglist
);
9211 print_z_candidates (location_of (name
), candidates
);
9215 call
= error_mark_node
;
9222 if (!(flags
& LOOKUP_NONVIRTUAL
)
9223 && DECL_PURE_VIRTUAL_P (fn
)
9224 && instance
== current_class_ref
9225 && (complain
& tf_warning
))
9227 /* This is not an error, it is runtime undefined
9229 if (!current_function_decl
)
9230 warning (0, "pure virtual %q#D called from "
9231 "non-static data member initializer", fn
);
9232 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
9233 || DECL_DESTRUCTOR_P (current_function_decl
))
9234 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
9235 ? G_("pure virtual %q#D called from constructor")
9236 : G_("pure virtual %q#D called from destructor")),
9240 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
9241 && !DECL_CONSTRUCTOR_P (fn
)
9242 && is_dummy_object (instance
))
9244 instance
= maybe_resolve_dummy (instance
, true);
9245 if (instance
== error_mark_node
)
9246 call
= error_mark_node
;
9247 else if (!is_dummy_object (instance
))
9249 /* We captured 'this' in the current lambda now that
9250 we know we really need it. */
9251 cand
->first_arg
= instance
;
9253 else if (any_dependent_bases_p ())
9254 /* We can't tell until instantiation time whether we can use
9255 *this as the implicit object argument. */;
9258 if (complain
& tf_error
)
9259 error ("cannot call member function %qD without object",
9261 call
= error_mark_node
;
9265 if (call
!= error_mark_node
)
9267 /* Optimize away vtable lookup if we know that this
9268 function can't be overridden. We need to check if
9269 the context and the type where we found fn are the same,
9270 actually FN might be defined in a different class
9271 type because of a using-declaration. In this case, we
9272 do not want to perform a non-virtual call. */
9273 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
9274 && same_type_ignoring_top_level_qualifiers_p
9275 (DECL_CONTEXT (fn
), BINFO_TYPE (binfo
))
9276 && resolves_to_fixed_type_p (instance
, 0))
9277 flags
|= LOOKUP_NONVIRTUAL
;
9279 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
9280 /* Now we know what function is being called. */
9283 /* Build the actual CALL_EXPR. */
9284 call
= build_over_call (cand
, flags
, complain
);
9285 /* In an expression of the form `a->f()' where `f' turns
9286 out to be a static member function, `a' is
9287 none-the-less evaluated. */
9288 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
9289 && !is_dummy_object (instance
)
9290 && TREE_SIDE_EFFECTS (instance
))
9292 /* But avoid the implicit lvalue-rvalue conversion when 'a'
9295 if (TREE_THIS_VOLATILE (a
))
9297 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
), a
, call
);
9299 else if (call
!= error_mark_node
9300 && DECL_DESTRUCTOR_P (cand
->fn
)
9301 && !VOID_TYPE_P (TREE_TYPE (call
)))
9302 /* An explicit call of the form "x->~X()" has type
9303 "void". However, on platforms where destructors
9304 return "this" (i.e., those where
9305 targetm.cxx.cdtor_returns_this is true), such calls
9306 will appear to have a return value of pointer type
9307 to the low-level call machinery. We do not want to
9308 change the low-level machinery, since we want to be
9309 able to optimize "delete f()" on such platforms as
9310 "operator delete(~X(f()))" (rather than generating
9311 "t = f(), ~X(t), operator delete (t)"). */
9312 call
= build_nop (void_type_node
, call
);
9317 if (processing_template_decl
&& call
!= error_mark_node
)
9319 bool cast_to_void
= false;
9321 if (TREE_CODE (call
) == COMPOUND_EXPR
)
9322 call
= TREE_OPERAND (call
, 1);
9323 else if (TREE_CODE (call
) == NOP_EXPR
)
9325 cast_to_void
= true;
9326 call
= TREE_OPERAND (call
, 0);
9328 if (INDIRECT_REF_P (call
))
9329 call
= TREE_OPERAND (call
, 0);
9330 call
= (build_min_non_dep_call_vec
9332 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
9333 orig_instance
, orig_fns
, NULL_TREE
),
9335 SET_EXPR_LOCATION (call
, input_location
);
9336 call
= convert_from_reference (call
);
9338 call
= build_nop (void_type_node
, call
);
9341 /* Free all the conversions we allocated. */
9342 obstack_free (&conversion_obstack
, p
);
9344 if (orig_args
!= NULL
)
9345 release_tree_vector (orig_args
);
9350 /* Wrapper for above. */
9353 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9354 tree conversion_path
, int flags
,
9355 tree
*fn_p
, tsubst_flags_t complain
)
9358 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
9359 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
9361 timevar_cond_stop (TV_OVERLOAD
, subtime
);
9365 /* Returns true iff standard conversion sequence ICS1 is a proper
9366 subsequence of ICS2. */
9369 is_subseq (conversion
*ics1
, conversion
*ics2
)
9371 /* We can assume that a conversion of the same code
9372 between the same types indicates a subsequence since we only get
9373 here if the types we are converting from are the same. */
9375 while (ics1
->kind
== ck_rvalue
9376 || ics1
->kind
== ck_lvalue
)
9377 ics1
= next_conversion (ics1
);
9381 while (ics2
->kind
== ck_rvalue
9382 || ics2
->kind
== ck_lvalue
)
9383 ics2
= next_conversion (ics2
);
9385 if (ics2
->kind
== ck_user
9386 || ics2
->kind
== ck_ambig
9387 || ics2
->kind
== ck_aggr
9388 || ics2
->kind
== ck_list
9389 || ics2
->kind
== ck_identity
)
9390 /* At this point, ICS1 cannot be a proper subsequence of
9391 ICS2. We can get a USER_CONV when we are comparing the
9392 second standard conversion sequence of two user conversion
9396 ics2
= next_conversion (ics2
);
9398 while (ics2
->kind
== ck_rvalue
9399 || ics2
->kind
== ck_lvalue
)
9400 ics2
= next_conversion (ics2
);
9402 if (ics2
->kind
== ics1
->kind
9403 && same_type_p (ics2
->type
, ics1
->type
)
9404 && (ics1
->kind
== ck_identity
9405 || same_type_p (next_conversion (ics2
)->type
,
9406 next_conversion (ics1
)->type
)))
9411 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
9412 be any _TYPE nodes. */
9415 is_properly_derived_from (tree derived
, tree base
)
9417 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
9420 /* We only allow proper derivation here. The DERIVED_FROM_P macro
9421 considers every class derived from itself. */
9422 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
9423 && DERIVED_FROM_P (base
, derived
));
9426 /* We build the ICS for an implicit object parameter as a pointer
9427 conversion sequence. However, such a sequence should be compared
9428 as if it were a reference conversion sequence. If ICS is the
9429 implicit conversion sequence for an implicit object parameter,
9430 modify it accordingly. */
9433 maybe_handle_implicit_object (conversion
**ics
)
9437 /* [over.match.funcs]
9439 For non-static member functions, the type of the
9440 implicit object parameter is "reference to cv X"
9441 where X is the class of which the function is a
9442 member and cv is the cv-qualification on the member
9443 function declaration. */
9444 conversion
*t
= *ics
;
9445 tree reference_type
;
9447 /* The `this' parameter is a pointer to a class type. Make the
9448 implicit conversion talk about a reference to that same class
9450 reference_type
= TREE_TYPE (t
->type
);
9451 reference_type
= build_reference_type (reference_type
);
9453 if (t
->kind
== ck_qual
)
9454 t
= next_conversion (t
);
9455 if (t
->kind
== ck_ptr
)
9456 t
= next_conversion (t
);
9457 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
9458 t
= direct_reference_binding (reference_type
, t
);
9460 t
->rvaluedness_matches_p
= 0;
9465 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
9466 and return the initial reference binding conversion. Otherwise,
9467 leave *ICS unchanged and return NULL. */
9470 maybe_handle_ref_bind (conversion
**ics
)
9472 if ((*ics
)->kind
== ck_ref_bind
)
9474 conversion
*old_ics
= *ics
;
9475 *ics
= next_conversion (old_ics
);
9476 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
9483 /* Compare two implicit conversion sequences according to the rules set out in
9484 [over.ics.rank]. Return values:
9486 1: ics1 is better than ics2
9487 -1: ics2 is better than ics1
9488 0: ics1 and ics2 are indistinguishable */
9491 compare_ics (conversion
*ics1
, conversion
*ics2
)
9497 tree deref_from_type1
= NULL_TREE
;
9498 tree deref_from_type2
= NULL_TREE
;
9499 tree deref_to_type1
= NULL_TREE
;
9500 tree deref_to_type2
= NULL_TREE
;
9501 conversion_rank rank1
, rank2
;
9503 /* REF_BINDING is nonzero if the result of the conversion sequence
9504 is a reference type. In that case REF_CONV is the reference
9505 binding conversion. */
9506 conversion
*ref_conv1
;
9507 conversion
*ref_conv2
;
9509 /* Compare badness before stripping the reference conversion. */
9510 if (ics1
->bad_p
> ics2
->bad_p
)
9512 else if (ics1
->bad_p
< ics2
->bad_p
)
9515 /* Handle implicit object parameters. */
9516 maybe_handle_implicit_object (&ics1
);
9517 maybe_handle_implicit_object (&ics2
);
9519 /* Handle reference parameters. */
9520 ref_conv1
= maybe_handle_ref_bind (&ics1
);
9521 ref_conv2
= maybe_handle_ref_bind (&ics2
);
9523 /* List-initialization sequence L1 is a better conversion sequence than
9524 list-initialization sequence L2 if L1 converts to
9525 std::initializer_list<X> for some X and L2 does not. */
9526 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
9528 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
9533 When comparing the basic forms of implicit conversion sequences (as
9534 defined in _over.best.ics_)
9536 --a standard conversion sequence (_over.ics.scs_) is a better
9537 conversion sequence than a user-defined conversion sequence
9538 or an ellipsis conversion sequence, and
9540 --a user-defined conversion sequence (_over.ics.user_) is a
9541 better conversion sequence than an ellipsis conversion sequence
9542 (_over.ics.ellipsis_). */
9543 /* Use BAD_CONVERSION_RANK because we already checked for a badness
9544 mismatch. If both ICS are bad, we try to make a decision based on
9545 what would have happened if they'd been good. This is not an
9546 extension, we'll still give an error when we build up the call; this
9547 just helps us give a more helpful error message. */
9548 rank1
= BAD_CONVERSION_RANK (ics1
);
9549 rank2
= BAD_CONVERSION_RANK (ics2
);
9553 else if (rank1
< rank2
)
9556 if (ics1
->ellipsis_p
)
9557 /* Both conversions are ellipsis conversions. */
9560 /* User-defined conversion sequence U1 is a better conversion sequence
9561 than another user-defined conversion sequence U2 if they contain the
9562 same user-defined conversion operator or constructor and if the sec-
9563 ond standard conversion sequence of U1 is better than the second
9564 standard conversion sequence of U2. */
9566 /* Handle list-conversion with the same code even though it isn't always
9567 ranked as a user-defined conversion and it doesn't have a second
9568 standard conversion sequence; it will still have the desired effect.
9569 Specifically, we need to do the reference binding comparison at the
9570 end of this function. */
9572 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
|| ics1
->kind
== ck_aggr
)
9577 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
9578 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
9579 || t1
->kind
== ck_list
)
9581 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
9582 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
9583 || t2
->kind
== ck_list
)
9586 if (t1
->kind
!= t2
->kind
)
9588 else if (t1
->kind
== ck_user
)
9590 tree f1
= t1
->cand
? t1
->cand
->fn
: t1
->type
;
9591 tree f2
= t2
->cand
? t2
->cand
->fn
: t2
->type
;
9597 /* For ambiguous or aggregate conversions, use the target type as
9598 a proxy for the conversion function. */
9599 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
9603 /* We can just fall through here, after setting up
9604 FROM_TYPE1 and FROM_TYPE2. */
9605 from_type1
= t1
->type
;
9606 from_type2
= t2
->type
;
9613 /* We're dealing with two standard conversion sequences.
9617 Standard conversion sequence S1 is a better conversion
9618 sequence than standard conversion sequence S2 if
9620 --S1 is a proper subsequence of S2 (comparing the conversion
9621 sequences in the canonical form defined by _over.ics.scs_,
9622 excluding any Lvalue Transformation; the identity
9623 conversion sequence is considered to be a subsequence of
9624 any non-identity conversion sequence */
9627 while (t1
->kind
!= ck_identity
)
9628 t1
= next_conversion (t1
);
9629 from_type1
= t1
->type
;
9632 while (t2
->kind
!= ck_identity
)
9633 t2
= next_conversion (t2
);
9634 from_type2
= t2
->type
;
9637 /* One sequence can only be a subsequence of the other if they start with
9638 the same type. They can start with different types when comparing the
9639 second standard conversion sequence in two user-defined conversion
9641 if (same_type_p (from_type1
, from_type2
))
9643 if (is_subseq (ics1
, ics2
))
9645 if (is_subseq (ics2
, ics1
))
9653 --the rank of S1 is better than the rank of S2 (by the rules
9656 Standard conversion sequences are ordered by their ranks: an Exact
9657 Match is a better conversion than a Promotion, which is a better
9658 conversion than a Conversion.
9660 Two conversion sequences with the same rank are indistinguishable
9661 unless one of the following rules applies:
9663 --A conversion that does not a convert a pointer, pointer to member,
9664 or std::nullptr_t to bool is better than one that does.
9666 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
9667 so that we do not have to check it explicitly. */
9668 if (ics1
->rank
< ics2
->rank
)
9670 else if (ics2
->rank
< ics1
->rank
)
9673 to_type1
= ics1
->type
;
9674 to_type2
= ics2
->type
;
9676 /* A conversion from scalar arithmetic type to complex is worse than a
9677 conversion between scalar arithmetic types. */
9678 if (same_type_p (from_type1
, from_type2
)
9679 && ARITHMETIC_TYPE_P (from_type1
)
9680 && ARITHMETIC_TYPE_P (to_type1
)
9681 && ARITHMETIC_TYPE_P (to_type2
)
9682 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
9683 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
9685 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
9691 if (TYPE_PTR_P (from_type1
)
9692 && TYPE_PTR_P (from_type2
)
9693 && TYPE_PTR_P (to_type1
)
9694 && TYPE_PTR_P (to_type2
))
9696 deref_from_type1
= TREE_TYPE (from_type1
);
9697 deref_from_type2
= TREE_TYPE (from_type2
);
9698 deref_to_type1
= TREE_TYPE (to_type1
);
9699 deref_to_type2
= TREE_TYPE (to_type2
);
9701 /* The rules for pointers to members A::* are just like the rules
9702 for pointers A*, except opposite: if B is derived from A then
9703 A::* converts to B::*, not vice versa. For that reason, we
9704 switch the from_ and to_ variables here. */
9705 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
9706 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
9707 || (TYPE_PTRMEMFUNC_P (from_type1
)
9708 && TYPE_PTRMEMFUNC_P (from_type2
)
9709 && TYPE_PTRMEMFUNC_P (to_type1
)
9710 && TYPE_PTRMEMFUNC_P (to_type2
)))
9712 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
9713 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
9714 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
9715 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
9718 if (deref_from_type1
!= NULL_TREE
9719 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
9720 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
9722 /* This was one of the pointer or pointer-like conversions.
9726 --If class B is derived directly or indirectly from class A,
9727 conversion of B* to A* is better than conversion of B* to
9728 void*, and conversion of A* to void* is better than
9729 conversion of B* to void*. */
9730 if (VOID_TYPE_P (deref_to_type1
)
9731 && VOID_TYPE_P (deref_to_type2
))
9733 if (is_properly_derived_from (deref_from_type1
,
9736 else if (is_properly_derived_from (deref_from_type2
,
9740 else if (VOID_TYPE_P (deref_to_type1
)
9741 || VOID_TYPE_P (deref_to_type2
))
9743 if (same_type_p (deref_from_type1
, deref_from_type2
))
9745 if (VOID_TYPE_P (deref_to_type2
))
9747 if (is_properly_derived_from (deref_from_type1
,
9751 /* We know that DEREF_TO_TYPE1 is `void' here. */
9752 else if (is_properly_derived_from (deref_from_type1
,
9757 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
9758 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
9762 --If class B is derived directly or indirectly from class A
9763 and class C is derived directly or indirectly from B,
9765 --conversion of C* to B* is better than conversion of C* to
9768 --conversion of B* to A* is better than conversion of C* to
9770 if (same_type_p (deref_from_type1
, deref_from_type2
))
9772 if (is_properly_derived_from (deref_to_type1
,
9775 else if (is_properly_derived_from (deref_to_type2
,
9779 else if (same_type_p (deref_to_type1
, deref_to_type2
))
9781 if (is_properly_derived_from (deref_from_type2
,
9784 else if (is_properly_derived_from (deref_from_type1
,
9790 else if (CLASS_TYPE_P (non_reference (from_type1
))
9791 && same_type_p (from_type1
, from_type2
))
9793 tree from
= non_reference (from_type1
);
9797 --binding of an expression of type C to a reference of type
9798 B& is better than binding an expression of type C to a
9799 reference of type A&
9801 --conversion of C to B is better than conversion of C to A, */
9802 if (is_properly_derived_from (from
, to_type1
)
9803 && is_properly_derived_from (from
, to_type2
))
9805 if (is_properly_derived_from (to_type1
, to_type2
))
9807 else if (is_properly_derived_from (to_type2
, to_type1
))
9811 else if (CLASS_TYPE_P (non_reference (to_type1
))
9812 && same_type_p (to_type1
, to_type2
))
9814 tree to
= non_reference (to_type1
);
9818 --binding of an expression of type B to a reference of type
9819 A& is better than binding an expression of type C to a
9820 reference of type A&,
9822 --conversion of B to A is better than conversion of C to A */
9823 if (is_properly_derived_from (from_type1
, to
)
9824 && is_properly_derived_from (from_type2
, to
))
9826 if (is_properly_derived_from (from_type2
, from_type1
))
9828 else if (is_properly_derived_from (from_type1
, from_type2
))
9835 --S1 and S2 differ only in their qualification conversion and yield
9836 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
9837 qualification signature of type T1 is a proper subset of the cv-
9838 qualification signature of type T2 */
9839 if (ics1
->kind
== ck_qual
9840 && ics2
->kind
== ck_qual
9841 && same_type_p (from_type1
, from_type2
))
9843 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
9850 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
9851 to an implicit object parameter of a non-static member function
9852 declared without a ref-qualifier, and either S1 binds an lvalue
9853 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
9854 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
9855 draft standard, 13.3.3.2)
9857 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
9858 types to which the references refer are the same type except for
9859 top-level cv-qualifiers, and the type to which the reference
9860 initialized by S2 refers is more cv-qualified than the type to
9861 which the reference initialized by S1 refers.
9863 DR 1328 [over.match.best]: the context is an initialization by
9864 conversion function for direct reference binding (13.3.1.6) of a
9865 reference to function type, the return type of F1 is the same kind of
9866 reference (i.e. lvalue or rvalue) as the reference being initialized,
9867 and the return type of F2 is not. */
9869 if (ref_conv1
&& ref_conv2
)
9871 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
9872 && (ref_conv1
->rvaluedness_matches_p
9873 != ref_conv2
->rvaluedness_matches_p
)
9874 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
9875 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
9876 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
9878 if (ref_conv1
->bad_p
9879 && !same_type_p (TREE_TYPE (ref_conv1
->type
),
9880 TREE_TYPE (ref_conv2
->type
)))
9881 /* Don't prefer a bad conversion that drops cv-quals to a bad
9882 conversion with the wrong rvalueness. */
9884 return (ref_conv1
->rvaluedness_matches_p
9885 - ref_conv2
->rvaluedness_matches_p
);
9888 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
9890 int q1
= cp_type_quals (TREE_TYPE (ref_conv1
->type
));
9891 int q2
= cp_type_quals (TREE_TYPE (ref_conv2
->type
));
9892 if (ref_conv1
->bad_p
)
9894 /* Prefer the one that drops fewer cv-quals. */
9895 tree ftype
= next_conversion (ref_conv1
)->type
;
9896 int fquals
= cp_type_quals (ftype
);
9900 return comp_cv_qualification (q2
, q1
);
9904 /* Neither conversion sequence is better than the other. */
9908 /* The source type for this standard conversion sequence. */
9911 source_type (conversion
*t
)
9913 for (;; t
= next_conversion (t
))
9915 if (t
->kind
== ck_user
9916 || t
->kind
== ck_ambig
9917 || t
->kind
== ck_identity
)
9923 /* Note a warning about preferring WINNER to LOSER. We do this by storing
9924 a pointer to LOSER and re-running joust to produce the warning if WINNER
9925 is actually used. */
9928 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
9930 candidate_warning
*cw
= (candidate_warning
*)
9931 conversion_obstack_alloc (sizeof (candidate_warning
));
9933 cw
->next
= winner
->warnings
;
9934 winner
->warnings
= cw
;
9937 /* Compare two candidates for overloading as described in
9938 [over.match.best]. Return values:
9940 1: cand1 is better than cand2
9941 -1: cand2 is better than cand1
9942 0: cand1 and cand2 are indistinguishable */
9945 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
9946 tsubst_flags_t complain
)
9949 int off1
= 0, off2
= 0;
9953 /* Candidates that involve bad conversions are always worse than those
9955 if (cand1
->viable
> cand2
->viable
)
9957 if (cand1
->viable
< cand2
->viable
)
9960 /* If we have two pseudo-candidates for conversions to the same type,
9961 or two candidates for the same function, arbitrarily pick one. */
9962 if (cand1
->fn
== cand2
->fn
9963 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
9966 /* Prefer a non-deleted function over an implicitly deleted move
9967 constructor or assignment operator. This differs slightly from the
9968 wording for issue 1402 (which says the move op is ignored by overload
9969 resolution), but this way produces better error messages. */
9970 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
9971 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
9972 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
9974 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
9975 && move_fn_p (cand1
->fn
))
9977 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
9978 && move_fn_p (cand2
->fn
))
9982 /* a viable function F1
9983 is defined to be a better function than another viable function F2 if
9984 for all arguments i, ICSi(F1) is not a worse conversion sequence than
9985 ICSi(F2), and then */
9987 /* for some argument j, ICSj(F1) is a better conversion sequence than
9990 /* For comparing static and non-static member functions, we ignore
9991 the implicit object parameter of the non-static function. The
9992 standard says to pretend that the static function has an object
9993 parm, but that won't work with operator overloading. */
9994 len
= cand1
->num_convs
;
9995 if (len
!= cand2
->num_convs
)
9997 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
9998 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
10000 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
10001 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
10002 /* We're comparing a near-match list constructor and a near-match
10003 non-list constructor. Just treat them as unordered. */
10006 gcc_assert (static_1
!= static_2
);
10017 for (i
= 0; i
< len
; ++i
)
10019 conversion
*t1
= cand1
->convs
[i
+ off1
];
10020 conversion
*t2
= cand2
->convs
[i
+ off2
];
10021 int comp
= compare_ics (t1
, t2
);
10025 if ((complain
& tf_warning
)
10027 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
10028 == cr_std
+ cr_promotion
)
10029 && t1
->kind
== ck_std
10030 && t2
->kind
== ck_std
10031 && TREE_CODE (t1
->type
) == INTEGER_TYPE
10032 && TREE_CODE (t2
->type
) == INTEGER_TYPE
10033 && (TYPE_PRECISION (t1
->type
)
10034 == TYPE_PRECISION (t2
->type
))
10035 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
10036 || (TREE_CODE (next_conversion (t1
)->type
)
10037 == ENUMERAL_TYPE
)))
10039 tree type
= next_conversion (t1
)->type
;
10041 struct z_candidate
*w
, *l
;
10043 type1
= t1
->type
, type2
= t2
->type
,
10044 w
= cand1
, l
= cand2
;
10046 type1
= t2
->type
, type2
= t1
->type
,
10047 w
= cand2
, l
= cand1
;
10051 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
10052 type
, type1
, type2
);
10053 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
10056 add_warning (w
, l
);
10059 if (winner
&& comp
!= winner
)
10068 /* warn about confusing overload resolution for user-defined conversions,
10069 either between a constructor and a conversion op, or between two
10071 if ((complain
& tf_warning
)
10072 && winner
&& warn_conversion
&& cand1
->second_conv
10073 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
10074 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
10076 struct z_candidate
*w
, *l
;
10077 bool give_warning
= false;
10080 w
= cand1
, l
= cand2
;
10082 w
= cand2
, l
= cand1
;
10084 /* We don't want to complain about `X::operator T1 ()'
10085 beating `X::operator T2 () const', when T2 is a no less
10086 cv-qualified version of T1. */
10087 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
10088 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
10090 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
10091 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
10093 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
10098 if (!comp_ptr_ttypes (t
, f
))
10099 give_warning
= true;
10102 give_warning
= true;
10108 tree source
= source_type (w
->convs
[0]);
10109 if (POINTER_TYPE_P (source
))
10110 source
= TREE_TYPE (source
);
10111 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
10112 && warning (OPT_Wconversion
, " for conversion from %qH to %qI",
10113 source
, w
->second_conv
->type
))
10115 inform (input_location
, " because conversion sequence for the argument is better");
10119 add_warning (w
, l
);
10125 /* DR 495 moved this tiebreaker above the template ones. */
10126 /* or, if not that,
10127 the context is an initialization by user-defined conversion (see
10128 _dcl.init_ and _over.match.user_) and the standard conversion
10129 sequence from the return type of F1 to the destination type (i.e.,
10130 the type of the entity being initialized) is a better conversion
10131 sequence than the standard conversion sequence from the return type
10132 of F2 to the destination type. */
10134 if (cand1
->second_conv
)
10136 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
10141 /* or, if not that,
10142 F1 is a non-template function and F2 is a template function
10145 if (!cand1
->template_decl
&& cand2
->template_decl
)
10147 else if (cand1
->template_decl
&& !cand2
->template_decl
)
10150 /* or, if not that,
10151 F1 and F2 are template functions and the function template for F1 is
10152 more specialized than the template for F2 according to the partial
10155 if (cand1
->template_decl
&& cand2
->template_decl
)
10157 winner
= more_specialized_fn
10158 (TI_TEMPLATE (cand1
->template_decl
),
10159 TI_TEMPLATE (cand2
->template_decl
),
10160 /* [temp.func.order]: The presence of unused ellipsis and default
10161 arguments has no effect on the partial ordering of function
10162 templates. add_function_candidate() will not have
10163 counted the "this" argument for constructors. */
10164 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
10170 // or, if not that, F1 is more constrained than F2.
10171 if (flag_concepts
&& DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
))
10173 winner
= more_constrained (cand1
->fn
, cand2
->fn
);
10178 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
10179 if (deduction_guide_p (cand1
->fn
))
10181 gcc_assert (deduction_guide_p (cand2
->fn
));
10182 /* We distinguish between candidates from an explicit deduction guide and
10183 candidates built from a constructor based on DECL_ARTIFICIAL. */
10184 int art1
= DECL_ARTIFICIAL (cand1
->fn
);
10185 int art2
= DECL_ARTIFICIAL (cand2
->fn
);
10187 return art2
- art1
;
10191 /* Prefer the special copy guide over a declared copy/move
10193 if (copy_guide_p (cand1
->fn
))
10195 if (copy_guide_p (cand2
->fn
))
10198 /* Prefer a candidate generated from a non-template constructor. */
10199 int tg1
= template_guide_p (cand1
->fn
);
10200 int tg2
= template_guide_p (cand2
->fn
);
10206 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
10207 for all arguments the corresponding parameters of F1 and F2 have the same
10208 type (CWG 2273/2277). */
10209 if (DECL_P (cand1
->fn
) && DECL_CLASS_SCOPE_P (cand1
->fn
)
10210 && !DECL_CONV_FN_P (cand1
->fn
)
10211 && DECL_P (cand2
->fn
) && DECL_CLASS_SCOPE_P (cand2
->fn
)
10212 && !DECL_CONV_FN_P (cand2
->fn
))
10214 tree base1
= DECL_CONTEXT (strip_inheriting_ctors (cand1
->fn
));
10215 tree base2
= DECL_CONTEXT (strip_inheriting_ctors (cand2
->fn
));
10217 bool used1
= false;
10218 bool used2
= false;
10219 if (base1
== base2
)
10220 /* No difference. */;
10221 else if (DERIVED_FROM_P (base1
, base2
))
10223 else if (DERIVED_FROM_P (base2
, base1
))
10226 if (int diff
= used2
- used1
)
10228 for (i
= 0; i
< len
; ++i
)
10230 conversion
*t1
= cand1
->convs
[i
+ off1
];
10231 conversion
*t2
= cand2
->convs
[i
+ off2
];
10232 if (!same_type_p (t1
->type
, t2
->type
))
10240 /* Check whether we can discard a builtin candidate, either because we
10241 have two identical ones or matching builtin and non-builtin candidates.
10243 (Pedantically in the latter case the builtin which matched the user
10244 function should not be added to the overload set, but we spot it here.
10247 ... the builtin candidates include ...
10248 - do not have the same parameter type list as any non-template
10249 non-member candidate. */
10251 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
10253 for (i
= 0; i
< len
; ++i
)
10254 if (!same_type_p (cand1
->convs
[i
]->type
,
10255 cand2
->convs
[i
]->type
))
10257 if (i
== cand1
->num_convs
)
10259 if (cand1
->fn
== cand2
->fn
)
10260 /* Two built-in candidates; arbitrarily pick one. */
10262 else if (identifier_p (cand1
->fn
))
10263 /* cand1 is built-in; prefer cand2. */
10266 /* cand2 is built-in; prefer cand1. */
10271 /* For candidates of a multi-versioned function, make the version with
10272 the highest priority win. This version will be checked for dispatching
10273 first. If this version can be inlined into the caller, the front-end
10274 will simply make a direct call to this function. */
10276 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
10277 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
10278 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
10279 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
10281 tree f1
= TREE_TYPE (cand1
->fn
);
10282 tree f2
= TREE_TYPE (cand2
->fn
);
10283 tree p1
= TYPE_ARG_TYPES (f1
);
10284 tree p2
= TYPE_ARG_TYPES (f2
);
10286 /* Check if cand1->fn and cand2->fn are versions of the same function. It
10287 is possible that cand1->fn and cand2->fn are function versions but of
10288 different functions. Check types to see if they are versions of the same
10290 if (compparms (p1
, p2
)
10291 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
10293 /* Always make the version with the higher priority, more
10294 specialized, win. */
10295 gcc_assert (targetm
.compare_version_priority
);
10296 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
10303 /* If the two function declarations represent the same function (this can
10304 happen with declarations in multiple scopes and arg-dependent lookup),
10305 arbitrarily choose one. But first make sure the default args we're
10307 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
10308 && equal_functions (cand1
->fn
, cand2
->fn
))
10310 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
10311 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
10313 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
10315 for (i
= 0; i
< len
; ++i
)
10317 /* Don't crash if the fn is variadic. */
10320 parms1
= TREE_CHAIN (parms1
);
10321 parms2
= TREE_CHAIN (parms2
);
10325 parms1
= TREE_CHAIN (parms1
);
10327 parms2
= TREE_CHAIN (parms2
);
10329 for (; parms1
; ++i
)
10331 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
10332 TREE_PURPOSE (parms2
)))
10336 if (complain
& tf_error
)
10338 if (permerror (input_location
,
10339 "default argument mismatch in "
10340 "overload resolution"))
10342 inform (DECL_SOURCE_LOCATION (cand1
->fn
),
10343 " candidate 1: %q#F", cand1
->fn
);
10344 inform (DECL_SOURCE_LOCATION (cand2
->fn
),
10345 " candidate 2: %q#F", cand2
->fn
);
10352 add_warning (cand1
, cand2
);
10355 parms1
= TREE_CHAIN (parms1
);
10356 parms2
= TREE_CHAIN (parms2
);
10364 /* Extension: If the worst conversion for one candidate is worse than the
10365 worst conversion for the other, take the first. */
10366 if (!pedantic
&& (complain
& tf_warning_or_error
))
10368 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
10369 struct z_candidate
*w
= 0, *l
= 0;
10371 for (i
= 0; i
< len
; ++i
)
10373 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
10374 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
10375 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
10376 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
10379 winner
= 1, w
= cand1
, l
= cand2
;
10381 winner
= -1, w
= cand2
, l
= cand1
;
10384 /* Don't choose a deleted function over ambiguity. */
10385 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
10389 pedwarn (input_location
, 0,
10390 "ISO C++ says that these are ambiguous, even "
10391 "though the worst conversion for the first is better than "
10392 "the worst conversion for the second:");
10393 print_z_candidate (input_location
, _("candidate 1:"), w
);
10394 print_z_candidate (input_location
, _("candidate 2:"), l
);
10397 add_warning (w
, l
);
10402 gcc_assert (!winner
);
10406 /* Given a list of candidates for overloading, find the best one, if any.
10407 This algorithm has a worst case of O(2n) (winner is last), and a best
10408 case of O(n/2) (totally ambiguous); much better than a sorting
10411 static struct z_candidate
*
10412 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
10414 struct z_candidate
*champ
= candidates
, *challenger
;
10416 int champ_compared_to_predecessor
= 0;
10418 /* Walk through the list once, comparing each current champ to the next
10419 candidate, knocking out a candidate or two with each comparison. */
10421 for (challenger
= champ
->next
; challenger
; )
10423 fate
= joust (champ
, challenger
, 0, complain
);
10425 challenger
= challenger
->next
;
10430 champ
= challenger
->next
;
10433 champ_compared_to_predecessor
= 0;
10437 champ
= challenger
;
10438 champ_compared_to_predecessor
= 1;
10441 challenger
= champ
->next
;
10445 /* Make sure the champ is better than all the candidates it hasn't yet
10446 been compared to. */
10448 for (challenger
= candidates
;
10449 challenger
!= champ
10450 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
10451 challenger
= challenger
->next
)
10453 fate
= joust (champ
, challenger
, 0, complain
);
10461 /* Returns nonzero if things of type FROM can be converted to TO. */
10464 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
10466 tree arg
= NULL_TREE
;
10467 /* implicit_conversion only considers user-defined conversions
10468 if it has an expression for the call argument list. */
10469 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
10470 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
10471 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
10474 /* Returns nonzero if things of type FROM can be converted to TO with a
10475 standard conversion. */
10478 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
10480 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
10483 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
10486 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
10487 tsubst_flags_t complain
)
10493 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10494 p
= conversion_obstack_alloc (0);
10495 /* We want to discard any access checks done for this test,
10496 as we might not be in the appropriate access context and
10497 we'll do the check again when we actually perform the
10499 push_deferring_access_checks (dk_deferred
);
10501 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10503 ok_p
= (t
&& !t
->bad_p
);
10505 /* Discard the access checks now. */
10506 pop_deferring_access_checks ();
10507 /* Free all the conversions we allocated. */
10508 obstack_free (&conversion_obstack
, p
);
10513 /* Like can_convert_arg, but allows dubious conversions as well. */
10516 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
10517 tsubst_flags_t complain
)
10522 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10523 p
= conversion_obstack_alloc (0);
10524 /* Try to perform the conversion. */
10525 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10527 /* Free all the conversions we allocated. */
10528 obstack_free (&conversion_obstack
, p
);
10533 /* Convert EXPR to TYPE. Return the converted expression.
10535 Note that we allow bad conversions here because by the time we get to
10536 this point we are committed to doing the conversion. If we end up
10537 doing a bad conversion, convert_like will complain. */
10540 perform_implicit_conversion_flags (tree type
, tree expr
,
10541 tsubst_flags_t complain
, int flags
)
10545 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
10547 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10548 expr
= mark_lvalue_use (expr
);
10550 expr
= mark_rvalue_use (expr
);
10552 if (error_operand_p (expr
))
10553 return error_mark_node
;
10555 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10556 p
= conversion_obstack_alloc (0);
10558 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
10559 /*c_cast_p=*/false,
10564 if (complain
& tf_error
)
10566 /* If expr has unknown type, then it is an overloaded function.
10567 Call instantiate_type to get good error messages. */
10568 if (TREE_TYPE (expr
) == unknown_type_node
)
10569 instantiate_type (type
, expr
, complain
);
10570 else if (invalid_nonstatic_memfn_p (loc
, expr
, complain
))
10571 /* We gave an error. */;
10573 error_at (loc
, "could not convert %qE from %qH to %qI", expr
,
10574 TREE_TYPE (expr
), type
);
10576 expr
= error_mark_node
;
10578 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
10580 /* In a template, we are only concerned about determining the
10581 type of non-dependent expressions, so we do not have to
10582 perform the actual conversion. But for initializers, we
10583 need to be able to perform it at instantiation
10584 (or instantiate_non_dependent_expr) time. */
10585 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
10586 if (!(flags
& LOOKUP_ONLYCONVERTING
))
10587 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
10590 expr
= convert_like (conv
, expr
, complain
);
10592 /* Free all the conversions we allocated. */
10593 obstack_free (&conversion_obstack
, p
);
10599 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
10601 return perform_implicit_conversion_flags (type
, expr
, complain
,
10605 /* Convert EXPR to TYPE (as a direct-initialization) if that is
10606 permitted. If the conversion is valid, the converted expression is
10607 returned. Otherwise, NULL_TREE is returned, except in the case
10608 that TYPE is a class type; in that case, an error is issued. If
10609 C_CAST_P is true, then this direct-initialization is taking
10610 place as part of a static_cast being attempted as part of a C-style
10614 perform_direct_initialization_if_possible (tree type
,
10617 tsubst_flags_t complain
)
10622 if (type
== error_mark_node
|| error_operand_p (expr
))
10623 return error_mark_node
;
10626 If the destination type is a (possibly cv-qualified) class type:
10628 -- If the initialization is direct-initialization ...,
10629 constructors are considered. ... If no constructor applies, or
10630 the overload resolution is ambiguous, the initialization is
10632 if (CLASS_TYPE_P (type
))
10634 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
10635 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
10636 &args
, type
, LOOKUP_NORMAL
, complain
);
10637 release_tree_vector (args
);
10638 return build_cplus_new (type
, expr
, complain
);
10641 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10642 p
= conversion_obstack_alloc (0);
10644 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
10646 LOOKUP_NORMAL
, complain
);
10647 if (!conv
|| conv
->bad_p
)
10649 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
10651 /* In a template, we are only concerned about determining the
10652 type of non-dependent expressions, so we do not have to
10653 perform the actual conversion. But for initializers, we
10654 need to be able to perform it at instantiation
10655 (or instantiate_non_dependent_expr) time. */
10656 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
10657 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
10660 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0,
10661 /*issue_conversion_warnings=*/false,
10665 /* Free all the conversions we allocated. */
10666 obstack_free (&conversion_obstack
, p
);
10671 /* When initializing a reference that lasts longer than a full-expression,
10672 this special rule applies:
10676 The temporary to which the reference is bound or the temporary
10677 that is the complete object to which the reference is bound
10678 persists for the lifetime of the reference.
10680 The temporaries created during the evaluation of the expression
10681 initializing the reference, except the temporary to which the
10682 reference is bound, are destroyed at the end of the
10683 full-expression in which they are created.
10685 In that case, we store the converted expression into a new
10686 VAR_DECL in a new scope.
10688 However, we want to be careful not to create temporaries when
10689 they are not required. For example, given:
10692 struct D : public B {};
10696 there is no need to copy the return value from "f"; we can just
10697 extend its lifetime. Similarly, given:
10700 struct T { operator S(); };
10704 we can extend the lifetime of the return value of the conversion
10707 The next several functions are involved in this lifetime extension. */
10709 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
10710 reference is being bound to a temporary. Create and return a new
10711 VAR_DECL with the indicated TYPE; this variable will store the value to
10712 which the reference is bound. */
10715 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
10717 tree var
= create_temporary_var (type
);
10719 /* Register the variable. */
10721 && (TREE_STATIC (decl
) || CP_DECL_THREAD_LOCAL_P (decl
)))
10723 /* Namespace-scope or local static; give it a mangled name. */
10724 /* FIXME share comdat with decl? */
10726 TREE_STATIC (var
) = TREE_STATIC (decl
);
10727 CP_DECL_THREAD_LOCAL_P (var
) = CP_DECL_THREAD_LOCAL_P (decl
);
10728 set_decl_tls_model (var
, DECL_TLS_MODEL (decl
));
10730 tree name
= mangle_ref_init_variable (decl
);
10731 DECL_NAME (var
) = name
;
10732 SET_DECL_ASSEMBLER_NAME (var
, name
);
10734 var
= pushdecl (var
);
10737 /* Create a new cleanup level if necessary. */
10738 maybe_push_cleanup_level (type
);
10743 /* EXPR is the initializer for a variable DECL of reference or
10744 std::initializer_list type. Create, push and return a new VAR_DECL
10745 for the initializer so that it will live as long as DECL. Any
10746 cleanup for the new variable is returned through CLEANUP, and the
10747 code to initialize the new variable is returned through INITP. */
10750 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
10757 /* Create the temporary variable. */
10758 type
= TREE_TYPE (expr
);
10759 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
10760 layout_decl (var
, 0);
10761 /* If the rvalue is the result of a function call it will be
10762 a TARGET_EXPR. If it is some other construct (such as a
10763 member access expression where the underlying object is
10764 itself the result of a function call), turn it into a
10765 TARGET_EXPR here. It is important that EXPR be a
10766 TARGET_EXPR below since otherwise the INIT_EXPR will
10767 attempt to make a bitwise copy of EXPR to initialize
10769 if (TREE_CODE (expr
) != TARGET_EXPR
)
10770 expr
= get_target_expr (expr
);
10772 if (TREE_CODE (decl
) == FIELD_DECL
10773 && extra_warnings
&& !TREE_NO_WARNING (decl
))
10775 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
10776 "until the constructor exits", decl
);
10777 TREE_NO_WARNING (decl
) = true;
10780 /* Recursively extend temps in this initializer. */
10781 TARGET_EXPR_INITIAL (expr
)
10782 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
10784 /* Any reference temp has a non-trivial initializer. */
10785 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
10787 /* If the initializer is constant, put it in DECL_INITIAL so we get
10788 static initialization and use in constant expressions. */
10789 init
= maybe_constant_init (expr
);
10790 if (TREE_CONSTANT (init
))
10792 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
10794 /* 5.19 says that a constant expression can include an
10795 lvalue-rvalue conversion applied to "a glvalue of literal type
10796 that refers to a non-volatile temporary object initialized
10797 with a constant expression". Rather than try to communicate
10798 that this VAR_DECL is a temporary, just mark it constexpr.
10800 Currently this is only useful for initializer_list temporaries,
10801 since reference vars can't appear in constant expressions. */
10802 DECL_DECLARED_CONSTEXPR_P (var
) = true;
10803 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
10804 TREE_CONSTANT (var
) = true;
10806 DECL_INITIAL (var
) = init
;
10810 /* Create the INIT_EXPR that will initialize the temporary
10812 init
= split_nonconstant_init (var
, expr
);
10813 if (at_function_scope_p ())
10815 add_decl_expr (var
);
10817 if (TREE_STATIC (var
))
10818 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
10821 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
10823 vec_safe_push (*cleanups
, cleanup
);
10826 /* We must be careful to destroy the temporary only
10827 after its initialization has taken place. If the
10828 initialization throws an exception, then the
10829 destructor should not be run. We cannot simply
10830 transform INIT into something like:
10832 (INIT, ({ CLEANUP_STMT; }))
10834 because emit_local_var always treats the
10835 initializer as a full-expression. Thus, the
10836 destructor would run too early; it would run at the
10837 end of initializing the reference variable, rather
10838 than at the end of the block enclosing the
10839 reference variable.
10841 The solution is to pass back a cleanup expression
10842 which the caller is responsible for attaching to
10843 the statement tree. */
10847 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
10848 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
10850 if (CP_DECL_THREAD_LOCAL_P (var
))
10851 tls_aggregates
= tree_cons (NULL_TREE
, var
,
10854 static_aggregates
= tree_cons (NULL_TREE
, var
,
10855 static_aggregates
);
10858 /* Check whether the dtor is callable. */
10859 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
10861 /* Avoid -Wunused-variable warning (c++/38958). */
10862 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
10864 TREE_USED (decl
) = DECL_READ_P (decl
) = true;
10870 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
10871 initializing a variable of that TYPE. */
10874 initialize_reference (tree type
, tree expr
,
10875 int flags
, tsubst_flags_t complain
)
10879 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
10881 if (type
== error_mark_node
|| error_operand_p (expr
))
10882 return error_mark_node
;
10884 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10885 p
= conversion_obstack_alloc (0);
10887 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
10889 if (!conv
|| conv
->bad_p
)
10891 if (complain
& tf_error
)
10894 convert_like (conv
, expr
, complain
);
10895 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
10896 && !TYPE_REF_IS_RVALUE (type
)
10897 && !lvalue_p (expr
))
10898 error_at (loc
, "invalid initialization of non-const reference of "
10899 "type %qH from an rvalue of type %qI",
10900 type
, TREE_TYPE (expr
));
10902 error_at (loc
, "invalid initialization of reference of type "
10903 "%qH from expression of type %qI", type
,
10906 return error_mark_node
;
10909 if (conv
->kind
== ck_ref_bind
)
10910 /* Perform the conversion. */
10911 expr
= convert_like (conv
, expr
, complain
);
10912 else if (conv
->kind
== ck_ambig
)
10913 /* We gave an error in build_user_type_conversion_1. */
10914 expr
= error_mark_node
;
10916 gcc_unreachable ();
10918 /* Free all the conversions we allocated. */
10919 obstack_free (&conversion_obstack
, p
);
10924 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
10925 which is bound either to a reference or a std::initializer_list. */
10928 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
10933 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
10935 TREE_OPERAND (sub
, 1)
10936 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
10939 if (TREE_CODE (sub
) != ADDR_EXPR
)
10941 /* Deal with binding to a subobject. */
10942 for (p
= &TREE_OPERAND (sub
, 0); TREE_CODE (*p
) == COMPONENT_REF
; )
10943 p
= &TREE_OPERAND (*p
, 0);
10944 if (TREE_CODE (*p
) == TARGET_EXPR
)
10946 tree subinit
= NULL_TREE
;
10947 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
10948 recompute_tree_invariant_for_addr_expr (sub
);
10950 init
= fold_convert (TREE_TYPE (init
), sub
);
10952 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
10957 /* INIT is part of the initializer for DECL. If there are any
10958 reference or initializer lists being initialized, extend their
10959 lifetime to match that of DECL. */
10962 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
10964 tree type
= TREE_TYPE (init
);
10965 if (processing_template_decl
)
10967 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10968 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
10972 if (TREE_CODE (ctor
) == TARGET_EXPR
)
10973 ctor
= TARGET_EXPR_INITIAL (ctor
);
10974 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
10976 if (is_std_init_list (type
))
10978 /* The temporary array underlying a std::initializer_list
10979 is handled like a reference temporary. */
10980 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
10981 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
10982 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
10987 constructor_elt
*p
;
10988 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (ctor
);
10989 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
10990 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
10992 recompute_constructor_flags (ctor
);
10993 if (decl_maybe_constant_var_p (decl
) && TREE_CONSTANT (ctor
))
10994 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
11001 /* Returns true iff an initializer for TYPE could contain temporaries that
11002 need to be extended because they are bound to references or
11003 std::initializer_list. */
11006 type_has_extended_temps (tree type
)
11008 type
= strip_array_types (type
);
11009 if (TREE_CODE (type
) == REFERENCE_TYPE
)
11011 if (CLASS_TYPE_P (type
))
11013 if (is_std_init_list (type
))
11015 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
11016 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
11017 if (type_has_extended_temps (TREE_TYPE (f
)))
11023 /* Returns true iff TYPE is some variant of std::initializer_list. */
11026 is_std_init_list (tree type
)
11028 if (!TYPE_P (type
))
11030 if (cxx_dialect
== cxx98
)
11032 /* Look through typedefs. */
11033 type
= TYPE_MAIN_VARIANT (type
);
11034 return (CLASS_TYPE_P (type
)
11035 && CP_TYPE_CONTEXT (type
) == std_node
11036 && init_list_identifier
== DECL_NAME (TYPE_NAME (type
)));
11039 /* Returns true iff DECL is a list constructor: i.e. a constructor which
11040 will accept an argument list of a single std::initializer_list<T>. */
11043 is_list_ctor (tree decl
)
11045 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
11048 if (!args
|| args
== void_list_node
)
11051 arg
= non_reference (TREE_VALUE (args
));
11052 if (!is_std_init_list (arg
))
11055 args
= TREE_CHAIN (args
);
11057 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
11058 /* There are more non-defaulted parms. */
11064 #include "gt-cp-call.h"