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
96 conversion. If KIND is ck_ambig, true if the context is
97 copy-initialization. */
98 BOOL_BITFIELD need_temporary_p
: 1;
99 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
100 from a pointer-to-derived to pointer-to-base is being performed. */
101 BOOL_BITFIELD base_p
: 1;
102 /* If KIND is ck_ref_bind, true when either an lvalue reference is
103 being bound to an lvalue expression or an rvalue reference is
104 being bound to an rvalue expression. If KIND is ck_rvalue,
105 true when we are treating an lvalue as an rvalue (12.8p33). If
106 KIND is ck_base, always false. If ck_identity, we will be
107 binding a reference directly or decaying to a pointer. */
108 BOOL_BITFIELD rvaluedness_matches_p
: 1;
109 BOOL_BITFIELD check_narrowing
: 1;
110 /* The type of the expression resulting from the conversion. */
113 /* The next conversion in the chain. Since the conversions are
114 arranged from outermost to innermost, the NEXT conversion will
115 actually be performed before this conversion. This variant is
116 used only when KIND is neither ck_identity, ck_ambig nor
117 ck_list. Please use the next_conversion function instead
118 of using this field directly. */
120 /* The expression at the beginning of the conversion chain. This
121 variant is used only if KIND is ck_identity or ck_ambig. */
123 /* The array of conversions for an initializer_list, so this
124 variant is used only when KIN D is ck_list. */
127 /* The function candidate corresponding to this conversion
128 sequence. This field is only used if KIND is ck_user. */
129 struct z_candidate
*cand
;
132 #define CONVERSION_RANK(NODE) \
133 ((NODE)->bad_p ? cr_bad \
134 : (NODE)->ellipsis_p ? cr_ellipsis \
135 : (NODE)->user_conv_p ? cr_user \
138 #define BAD_CONVERSION_RANK(NODE) \
139 ((NODE)->ellipsis_p ? cr_ellipsis \
140 : (NODE)->user_conv_p ? cr_user \
143 static struct obstack conversion_obstack
;
144 static bool conversion_obstack_initialized
;
145 struct rejection_reason
;
147 static struct z_candidate
* tourney (struct z_candidate
*, tsubst_flags_t
);
148 static int equal_functions (tree
, tree
);
149 static int joust (struct z_candidate
*, struct z_candidate
*, bool,
151 static int compare_ics (conversion
*, conversion
*);
152 static void maybe_warn_class_memaccess (location_t
, tree
,
153 const vec
<tree
, va_gc
> *);
154 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
155 #define convert_like(CONV, EXPR, COMPLAIN) \
156 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, \
157 /*issue_conversion_warnings=*/true, \
158 /*c_cast_p=*/false, (COMPLAIN))
159 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
160 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), \
161 /*issue_conversion_warnings=*/true, \
162 /*c_cast_p=*/false, (COMPLAIN))
163 static tree
convert_like_real (conversion
*, tree
, tree
, int, bool,
164 bool, tsubst_flags_t
);
165 static void op_error (location_t
, enum tree_code
, enum tree_code
, tree
,
167 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int,
169 static void print_z_candidate (location_t
, const char *, struct z_candidate
*);
170 static void print_z_candidates (location_t
, struct z_candidate
*);
171 static tree
build_this (tree
);
172 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
173 static bool any_strictly_viable (struct z_candidate
*);
174 static struct z_candidate
*add_template_candidate
175 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
176 tree
, tree
, tree
, int, unification_kind_t
, tsubst_flags_t
);
177 static struct z_candidate
*add_template_candidate_real
178 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
179 tree
, tree
, tree
, int, tree
, unification_kind_t
, tsubst_flags_t
);
180 static void add_builtin_candidates
181 (struct z_candidate
**, enum tree_code
, enum tree_code
,
182 tree
, tree
*, int, tsubst_flags_t
);
183 static void add_builtin_candidate
184 (struct z_candidate
**, enum tree_code
, enum tree_code
,
185 tree
, tree
, tree
, tree
*, tree
*, int, tsubst_flags_t
);
186 static bool is_complete (tree
);
187 static void build_builtin_candidate
188 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
189 int, tsubst_flags_t
);
190 static struct z_candidate
*add_conv_candidate
191 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
192 tree
, tsubst_flags_t
);
193 static struct z_candidate
*add_function_candidate
194 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
195 tree
, int, tsubst_flags_t
);
196 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int,
198 static conversion
*reference_binding (tree
, tree
, tree
, bool, int,
200 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
201 static conversion
*build_list_conv (tree
, tree
, int, tsubst_flags_t
);
202 static conversion
*next_conversion (conversion
*);
203 static bool is_subseq (conversion
*, conversion
*);
204 static conversion
*maybe_handle_ref_bind (conversion
**);
205 static void maybe_handle_implicit_object (conversion
**);
206 static struct z_candidate
*add_candidate
207 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, size_t,
208 conversion
**, tree
, tree
, int, struct rejection_reason
*, int);
209 static tree
source_type (conversion
*);
210 static void add_warning (struct z_candidate
*, struct z_candidate
*);
211 static bool reference_compatible_p (tree
, tree
);
212 static conversion
*direct_reference_binding (tree
, conversion
*);
213 static bool promoted_arithmetic_type_p (tree
);
214 static conversion
*conditional_conversion (tree
, tree
, tsubst_flags_t
);
215 static char *name_as_c_string (tree
, tree
, bool *);
216 static tree
prep_operand (tree
);
217 static void add_candidates (tree
, tree
, const vec
<tree
, va_gc
> *, tree
, tree
,
218 bool, tree
, tree
, int, struct z_candidate
**,
220 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
221 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
223 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
224 NAME can take many forms... */
227 check_dtor_name (tree basetype
, tree name
)
229 /* Just accept something we've already complained about. */
230 if (name
== error_mark_node
)
233 if (TREE_CODE (name
) == TYPE_DECL
)
234 name
= TREE_TYPE (name
);
235 else if (TYPE_P (name
))
237 else if (identifier_p (name
))
239 if ((MAYBE_CLASS_TYPE_P (basetype
)
240 || TREE_CODE (basetype
) == ENUMERAL_TYPE
)
241 && name
== constructor_name (basetype
))
244 name
= get_type_value (name
);
250 template <class T> struct S { ~S(); };
254 NAME will be a class template. */
255 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
259 if (!name
|| name
== error_mark_node
)
261 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
264 /* We want the address of a function or method. We avoid creating a
265 pointer-to-member function. */
268 build_addr_func (tree function
, tsubst_flags_t complain
)
270 tree type
= TREE_TYPE (function
);
272 /* We have to do these by hand to avoid real pointer to member
274 if (TREE_CODE (type
) == METHOD_TYPE
)
276 if (TREE_CODE (function
) == OFFSET_REF
)
278 tree object
= build_address (TREE_OPERAND (function
, 0));
279 return get_member_function_from_ptrfunc (&object
,
280 TREE_OPERAND (function
, 1),
283 function
= build_address (function
);
286 function
= decay_conversion (function
, complain
, /*reject_builtin=*/false);
291 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
292 POINTER_TYPE to those. Note, pointer to member function types
293 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
294 two variants. build_call_a is the primitive taking an array of
295 arguments, while build_call_n is a wrapper that handles varargs. */
298 build_call_n (tree function
, int n
, ...)
301 return build_call_a (function
, 0, NULL
);
304 tree
*argarray
= XALLOCAVEC (tree
, n
);
309 for (i
= 0; i
< n
; i
++)
310 argarray
[i
] = va_arg (ap
, tree
);
312 return build_call_a (function
, n
, argarray
);
316 /* Update various flags in cfun and the call itself based on what is being
317 called. Split out of build_call_a so that bot_manip can use it too. */
320 set_flags_from_callee (tree call
)
323 tree decl
= get_callee_fndecl (call
);
325 /* We check both the decl and the type; a function may be known not to
326 throw without being declared throw(). */
327 nothrow
= decl
&& TREE_NOTHROW (decl
);
328 if (CALL_EXPR_FN (call
))
329 nothrow
|= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call
))));
330 else if (internal_fn_flags (CALL_EXPR_IFN (call
)) & ECF_NOTHROW
)
333 if (!nothrow
&& at_function_scope_p () && cfun
&& cp_function_chain
)
334 cp_function_chain
->can_throw
= 1;
336 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
337 current_function_returns_abnormally
= 1;
339 TREE_NOTHROW (call
) = nothrow
;
343 build_call_a (tree function
, int n
, tree
*argarray
)
350 function
= build_addr_func (function
, tf_warning_or_error
);
352 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
353 fntype
= TREE_TYPE (TREE_TYPE (function
));
354 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
355 || TREE_CODE (fntype
) == METHOD_TYPE
);
356 result_type
= TREE_TYPE (fntype
);
357 /* An rvalue has no cv-qualifiers. */
358 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
359 result_type
= cv_unqualified (result_type
);
361 function
= build_call_array_loc (input_location
,
362 result_type
, function
, n
, argarray
);
363 set_flags_from_callee (function
);
365 decl
= get_callee_fndecl (function
);
367 if (decl
&& !TREE_USED (decl
))
369 /* We invoke build_call directly for several library
370 functions. These may have been declared normally if
371 we're building libgcc, so we can't just check
373 gcc_assert (DECL_ARTIFICIAL (decl
)
374 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
379 require_complete_eh_spec_types (fntype
, decl
);
381 TREE_HAS_CONSTRUCTOR (function
) = (decl
&& DECL_CONSTRUCTOR_P (decl
));
383 /* Don't pass empty class objects by value. This is useful
384 for tags in STL, which are used to control overload resolution.
385 We don't need to handle other cases of copying empty classes. */
386 if (! decl
|| ! DECL_BUILT_IN (decl
))
387 for (i
= 0; i
< n
; i
++)
389 tree arg
= CALL_EXPR_ARG (function
, i
);
390 if (is_empty_class (TREE_TYPE (arg
))
391 && ! TREE_ADDRESSABLE (TREE_TYPE (arg
)))
393 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (arg
));
394 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (t
), arg
, t
);
395 CALL_EXPR_ARG (function
, i
) = arg
;
402 /* New overloading code. */
406 struct candidate_warning
{
408 candidate_warning
*next
;
411 /* Information for providing diagnostics about why overloading failed. */
413 enum rejection_reason_code
{
416 rr_explicit_conversion
,
417 rr_template_conversion
,
419 rr_bad_arg_conversion
,
420 rr_template_unification
,
423 rr_constraint_failure
426 struct conversion_info
{
427 /* The index of the argument, 0-based. */
429 /* The actual argument or its type. */
431 /* The type of the parameter. */
435 struct rejection_reason
{
436 enum rejection_reason_code code
;
438 /* Information about an arity mismatch. */
440 /* The expected number of arguments. */
442 /* The actual number of arguments in the call. */
444 /* Whether the call was a varargs call. */
447 /* Information about an argument conversion mismatch. */
448 struct conversion_info conversion
;
449 /* Same, but for bad argument conversions. */
450 struct conversion_info bad_conversion
;
451 /* Information about template unification failures. These are the
452 parameters passed to fn_type_unification. */
460 unification_kind_t strict
;
462 } template_unification
;
463 /* Information about template instantiation failures. These are the
464 parameters passed to instantiate_template. */
468 } template_instantiation
;
473 /* The FUNCTION_DECL that will be called if this candidate is
474 selected by overload resolution. */
476 /* If not NULL_TREE, the first argument to use when calling this
479 /* The rest of the arguments to use when calling this function. If
480 there are no further arguments this may be NULL or it may be an
482 const vec
<tree
, va_gc
> *args
;
483 /* The implicit conversion sequences for each of the arguments to
486 /* The number of implicit conversion sequences. */
488 /* If FN is a user-defined conversion, the standard conversion
489 sequence from the type returned by FN to the desired destination
491 conversion
*second_conv
;
492 struct rejection_reason
*reason
;
493 /* If FN is a member function, the binfo indicating the path used to
494 qualify the name of FN at the call site. This path is used to
495 determine whether or not FN is accessible if it is selected by
496 overload resolution. The DECL_CONTEXT of FN will always be a
497 (possibly improper) base of this binfo. */
499 /* If FN is a non-static member function, the binfo indicating the
500 subobject to which the `this' pointer should be converted if FN
501 is selected by overload resolution. The type pointed to by
502 the `this' pointer must correspond to the most derived class
503 indicated by the CONVERSION_PATH. */
504 tree conversion_path
;
507 candidate_warning
*warnings
;
511 /* The flags active in add_candidate. */
515 /* Returns true iff T is a null pointer constant in the sense of
519 null_ptr_cst_p (tree t
)
521 tree type
= TREE_TYPE (t
);
525 A null pointer constant is an integral constant expression
526 (_expr.const_) rvalue of integer type that evaluates to zero or
527 an rvalue of type std::nullptr_t. */
528 if (NULLPTR_TYPE_P (type
))
531 if (cxx_dialect
>= cxx11
)
533 STRIP_ANY_LOCATION_WRAPPER (t
);
535 /* Core issue 903 says only literal 0 is a null pointer constant. */
536 if (TREE_CODE (type
) == INTEGER_TYPE
537 && !char_type_p (type
)
538 && TREE_CODE (t
) == INTEGER_CST
540 && !TREE_OVERFLOW (t
))
543 else if (CP_INTEGRAL_TYPE_P (type
))
545 t
= fold_non_dependent_expr (t
);
547 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
554 /* Returns true iff T is a null member pointer value (4.11). */
557 null_member_pointer_value_p (tree t
)
559 tree type
= TREE_TYPE (t
);
562 else if (TYPE_PTRMEMFUNC_P (type
))
563 return (TREE_CODE (t
) == CONSTRUCTOR
564 && integer_zerop (CONSTRUCTOR_ELT (t
, 0)->value
));
565 else if (TYPE_PTRDATAMEM_P (type
))
566 return integer_all_onesp (t
);
571 /* Returns nonzero if PARMLIST consists of only default parms,
572 ellipsis, and/or undeduced parameter packs. */
575 sufficient_parms_p (const_tree parmlist
)
577 for (; parmlist
&& parmlist
!= void_list_node
;
578 parmlist
= TREE_CHAIN (parmlist
))
579 if (!TREE_PURPOSE (parmlist
)
580 && !PACK_EXPANSION_P (TREE_VALUE (parmlist
)))
585 /* Allocate N bytes of memory from the conversion obstack. The memory
586 is zeroed before being returned. */
589 conversion_obstack_alloc (size_t n
)
592 if (!conversion_obstack_initialized
)
594 gcc_obstack_init (&conversion_obstack
);
595 conversion_obstack_initialized
= true;
597 p
= obstack_alloc (&conversion_obstack
, n
);
602 /* Allocate rejection reasons. */
604 static struct rejection_reason
*
605 alloc_rejection (enum rejection_reason_code code
)
607 struct rejection_reason
*p
;
608 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
613 static struct rejection_reason
*
614 arity_rejection (tree first_arg
, int expected
, int actual
)
616 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
617 int adjust
= first_arg
!= NULL_TREE
;
618 r
->u
.arity
.expected
= expected
- adjust
;
619 r
->u
.arity
.actual
= actual
- adjust
;
623 static struct rejection_reason
*
624 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
626 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
627 int adjust
= first_arg
!= NULL_TREE
;
628 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
629 r
->u
.conversion
.from
= from
;
630 r
->u
.conversion
.to_type
= to
;
634 static struct rejection_reason
*
635 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
637 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
638 int adjust
= first_arg
!= NULL_TREE
;
639 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
640 r
->u
.bad_conversion
.from
= from
;
641 r
->u
.bad_conversion
.to_type
= to
;
645 static struct rejection_reason
*
646 explicit_conversion_rejection (tree from
, tree to
)
648 struct rejection_reason
*r
= alloc_rejection (rr_explicit_conversion
);
649 r
->u
.conversion
.n_arg
= 0;
650 r
->u
.conversion
.from
= from
;
651 r
->u
.conversion
.to_type
= to
;
655 static struct rejection_reason
*
656 template_conversion_rejection (tree from
, tree to
)
658 struct rejection_reason
*r
= alloc_rejection (rr_template_conversion
);
659 r
->u
.conversion
.n_arg
= 0;
660 r
->u
.conversion
.from
= from
;
661 r
->u
.conversion
.to_type
= to
;
665 static struct rejection_reason
*
666 template_unification_rejection (tree tmpl
, tree explicit_targs
, tree targs
,
667 const tree
*args
, unsigned int nargs
,
668 tree return_type
, unification_kind_t strict
,
671 size_t args_n_bytes
= sizeof (*args
) * nargs
;
672 tree
*args1
= (tree
*) conversion_obstack_alloc (args_n_bytes
);
673 struct rejection_reason
*r
= alloc_rejection (rr_template_unification
);
674 r
->u
.template_unification
.tmpl
= tmpl
;
675 r
->u
.template_unification
.explicit_targs
= explicit_targs
;
676 r
->u
.template_unification
.num_targs
= TREE_VEC_LENGTH (targs
);
677 /* Copy args to our own storage. */
678 memcpy (args1
, args
, args_n_bytes
);
679 r
->u
.template_unification
.args
= args1
;
680 r
->u
.template_unification
.nargs
= nargs
;
681 r
->u
.template_unification
.return_type
= return_type
;
682 r
->u
.template_unification
.strict
= strict
;
683 r
->u
.template_unification
.flags
= flags
;
687 static struct rejection_reason
*
688 template_unification_error_rejection (void)
690 return alloc_rejection (rr_template_unification
);
693 static struct rejection_reason
*
694 invalid_copy_with_fn_template_rejection (void)
696 struct rejection_reason
*r
= alloc_rejection (rr_invalid_copy
);
700 static struct rejection_reason
*
701 inherited_ctor_rejection (void)
703 struct rejection_reason
*r
= alloc_rejection (rr_inherited_ctor
);
707 // Build a constraint failure record, saving information into the
708 // template_instantiation field of the rejection. If FN is not a template
709 // declaration, the TMPL member is the FN declaration and TARGS is empty.
711 static struct rejection_reason
*
712 constraint_failure (tree fn
)
714 struct rejection_reason
*r
= alloc_rejection (rr_constraint_failure
);
715 if (tree ti
= DECL_TEMPLATE_INFO (fn
))
717 r
->u
.template_instantiation
.tmpl
= TI_TEMPLATE (ti
);
718 r
->u
.template_instantiation
.targs
= TI_ARGS (ti
);
722 r
->u
.template_instantiation
.tmpl
= fn
;
723 r
->u
.template_instantiation
.targs
= NULL_TREE
;
728 /* Dynamically allocate a conversion. */
731 alloc_conversion (conversion_kind kind
)
734 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
739 /* Make sure that all memory on the conversion obstack has been
743 validate_conversion_obstack (void)
745 if (conversion_obstack_initialized
)
746 gcc_assert ((obstack_next_free (&conversion_obstack
)
747 == obstack_base (&conversion_obstack
)));
750 /* Dynamically allocate an array of N conversions. */
753 alloc_conversions (size_t n
)
755 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
759 build_conv (conversion_kind code
, tree type
, conversion
*from
)
762 conversion_rank rank
= CONVERSION_RANK (from
);
764 /* Note that the caller is responsible for filling in t->cand for
765 user-defined conversions. */
766 t
= alloc_conversion (code
);
790 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
791 t
->bad_p
= from
->bad_p
;
796 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
797 specialization of std::initializer_list<T>, if such a conversion is
801 build_list_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
803 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
804 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
805 conversion
**subconvs
= alloc_conversions (len
);
810 /* Within a list-initialization we can have more user-defined
812 flags
&= ~LOOKUP_NO_CONVERSION
;
813 /* But no narrowing conversions. */
814 flags
|= LOOKUP_NO_NARROWING
;
816 /* Can't make an array of these types. */
817 if (TREE_CODE (elttype
) == REFERENCE_TYPE
818 || TREE_CODE (elttype
) == FUNCTION_TYPE
819 || VOID_TYPE_P (elttype
))
822 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
825 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
826 false, flags
, complain
);
833 t
= alloc_conversion (ck_list
);
835 t
->u
.list
= subconvs
;
838 for (i
= 0; i
< len
; ++i
)
840 conversion
*sub
= subconvs
[i
];
841 if (sub
->rank
> t
->rank
)
843 if (sub
->user_conv_p
)
844 t
->user_conv_p
= true;
852 /* Return the next conversion of the conversion chain (if applicable),
853 or NULL otherwise. Please use this function instead of directly
854 accessing fields of struct conversion. */
857 next_conversion (conversion
*conv
)
860 || conv
->kind
== ck_identity
861 || conv
->kind
== ck_ambig
862 || conv
->kind
== ck_list
)
867 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
868 is a valid aggregate initializer for array type ATYPE. */
871 can_convert_array (tree atype
, tree ctor
, int flags
, tsubst_flags_t complain
)
874 tree elttype
= TREE_TYPE (atype
);
875 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
877 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
879 if (TREE_CODE (elttype
) == ARRAY_TYPE
880 && TREE_CODE (val
) == CONSTRUCTOR
)
881 ok
= can_convert_array (elttype
, val
, flags
, complain
);
883 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
,
891 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
892 aggregate class, if such a conversion is possible. */
895 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
897 unsigned HOST_WIDE_INT i
= 0;
899 tree field
= next_initializable_field (TYPE_FIELDS (type
));
900 tree empty_ctor
= NULL_TREE
;
902 /* We already called reshape_init in implicit_conversion. */
904 /* The conversions within the init-list aren't affected by the enclosing
905 context; they're always simple copy-initialization. */
906 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
908 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
910 tree ftype
= TREE_TYPE (field
);
914 if (i
< CONSTRUCTOR_NELTS (ctor
))
915 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
916 else if (DECL_INITIAL (field
))
917 val
= get_nsdmi (field
, /*ctor*/false, complain
);
918 else if (TREE_CODE (ftype
) == REFERENCE_TYPE
)
919 /* Value-initialization of reference is ill-formed. */
923 if (empty_ctor
== NULL_TREE
)
924 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
929 if (TREE_CODE (ftype
) == ARRAY_TYPE
930 && TREE_CODE (val
) == CONSTRUCTOR
)
931 ok
= can_convert_array (ftype
, val
, flags
, complain
);
933 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
939 if (TREE_CODE (type
) == UNION_TYPE
)
943 if (i
< CONSTRUCTOR_NELTS (ctor
))
946 c
= alloc_conversion (ck_aggr
);
949 c
->user_conv_p
= true;
950 c
->check_narrowing
= true;
955 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
956 array type, if such a conversion is possible. */
959 build_array_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
962 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
963 tree elttype
= TREE_TYPE (type
);
968 enum conversion_rank rank
= cr_exact
;
970 /* We might need to propagate the size from the element to the array. */
971 complete_type (type
);
973 if (TYPE_DOMAIN (type
)
974 && !variably_modified_type_p (TYPE_DOMAIN (type
), NULL_TREE
))
976 unsigned HOST_WIDE_INT alen
= tree_to_uhwi (array_type_nelts_top (type
));
981 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
983 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
986 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
987 false, flags
, complain
);
991 if (sub
->rank
> rank
)
993 if (sub
->user_conv_p
)
999 c
= alloc_conversion (ck_aggr
);
1002 c
->user_conv_p
= user
;
1008 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1009 complex type, if such a conversion is possible. */
1012 build_complex_conv (tree type
, tree ctor
, int flags
,
1013 tsubst_flags_t complain
)
1016 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1017 tree elttype
= TREE_TYPE (type
);
1022 enum conversion_rank rank
= cr_exact
;
1027 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1029 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1032 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1033 false, flags
, complain
);
1037 if (sub
->rank
> rank
)
1039 if (sub
->user_conv_p
)
1045 c
= alloc_conversion (ck_aggr
);
1048 c
->user_conv_p
= user
;
1054 /* Build a representation of the identity conversion from EXPR to
1055 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1058 build_identity_conv (tree type
, tree expr
)
1062 c
= alloc_conversion (ck_identity
);
1069 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1070 were multiple user-defined conversions to accomplish the job.
1071 Build a conversion that indicates that ambiguity. */
1074 build_ambiguous_conv (tree type
, tree expr
)
1078 c
= alloc_conversion (ck_ambig
);
1086 strip_top_quals (tree t
)
1088 if (TREE_CODE (t
) == ARRAY_TYPE
)
1090 return cp_build_qualified_type (t
, 0);
1093 /* Returns the standard conversion path (see [conv]) from type FROM to type
1094 TO, if any. For proper handling of null pointer constants, you must
1095 also pass the expression EXPR to convert from. If C_CAST_P is true,
1096 this conversion is coming from a C-style cast. */
1099 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1100 int flags
, tsubst_flags_t complain
)
1102 enum tree_code fcode
, tcode
;
1104 bool fromref
= false;
1107 to
= non_reference (to
);
1108 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1111 from
= TREE_TYPE (from
);
1114 to
= strip_top_quals (to
);
1115 from
= strip_top_quals (from
);
1117 if (expr
&& type_unknown_p (expr
))
1119 if (TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1121 tsubst_flags_t tflags
= tf_conv
;
1122 expr
= instantiate_type (to
, expr
, tflags
);
1123 if (expr
== error_mark_node
)
1125 from
= TREE_TYPE (expr
);
1127 else if (TREE_CODE (to
) == BOOLEAN_TYPE
)
1129 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1130 expr
= resolve_nondeduced_context (expr
, complain
);
1131 from
= TREE_TYPE (expr
);
1135 fcode
= TREE_CODE (from
);
1136 tcode
= TREE_CODE (to
);
1138 conv
= build_identity_conv (from
, expr
);
1139 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1141 from
= type_decays_to (from
);
1142 fcode
= TREE_CODE (from
);
1143 /* Tell convert_like_real that we're using the address. */
1144 conv
->rvaluedness_matches_p
= true;
1145 conv
= build_conv (ck_lvalue
, from
, conv
);
1147 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1148 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1149 express the copy constructor call required by copy-initialization. */
1150 else if (fromref
|| (expr
&& obvalue_p (expr
)))
1155 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1158 from
= strip_top_quals (bitfield_type
);
1159 fcode
= TREE_CODE (from
);
1162 conv
= build_conv (ck_rvalue
, from
, conv
);
1163 if (flags
& LOOKUP_PREFER_RVALUE
)
1164 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1165 conv
->rvaluedness_matches_p
= true;
1168 /* Allow conversion between `__complex__' data types. */
1169 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1171 /* The standard conversion sequence to convert FROM to TO is
1172 the standard conversion sequence to perform componentwise
1174 conversion
*part_conv
= standard_conversion
1175 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
,
1180 conv
= build_conv (part_conv
->kind
, to
, conv
);
1181 conv
->rank
= part_conv
->rank
;
1189 if (same_type_p (from
, to
))
1191 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1192 conv
->type
= qualified_to
;
1197 A null pointer constant can be converted to a pointer type; ... A
1198 null pointer constant of integral type can be converted to an
1199 rvalue of type std::nullptr_t. */
1200 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1201 || NULLPTR_TYPE_P (to
))
1202 && ((expr
&& null_ptr_cst_p (expr
))
1203 || NULLPTR_TYPE_P (from
)))
1204 conv
= build_conv (ck_std
, to
, conv
);
1205 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1206 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1208 /* For backwards brain damage compatibility, allow interconversion of
1209 pointers and integers with a pedwarn. */
1210 conv
= build_conv (ck_std
, to
, conv
);
1213 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1215 /* For backwards brain damage compatibility, allow interconversion of
1216 enums and integers with a pedwarn. */
1217 conv
= build_conv (ck_std
, to
, conv
);
1220 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1221 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1226 if (tcode
== POINTER_TYPE
)
1228 to_pointee
= TREE_TYPE (to
);
1229 from_pointee
= TREE_TYPE (from
);
1231 /* Since this is the target of a pointer, it can't have function
1232 qualifiers, so any TYPE_QUALS must be for attributes const or
1233 noreturn. Strip them. */
1234 if (TREE_CODE (to_pointee
) == FUNCTION_TYPE
1235 && TYPE_QUALS (to_pointee
))
1236 to_pointee
= build_qualified_type (to_pointee
, TYPE_UNQUALIFIED
);
1237 if (TREE_CODE (from_pointee
) == FUNCTION_TYPE
1238 && TYPE_QUALS (from_pointee
))
1239 from_pointee
= build_qualified_type (from_pointee
, TYPE_UNQUALIFIED
);
1243 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1244 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1247 if (tcode
== POINTER_TYPE
1248 && same_type_ignoring_top_level_qualifiers_p (from_pointee
,
1251 else if (VOID_TYPE_P (to_pointee
)
1252 && !TYPE_PTRDATAMEM_P (from
)
1253 && TREE_CODE (from_pointee
) != FUNCTION_TYPE
)
1255 tree nfrom
= TREE_TYPE (from
);
1256 /* Don't try to apply restrict to void. */
1257 int quals
= cp_type_quals (nfrom
) & ~TYPE_QUAL_RESTRICT
;
1258 from_pointee
= cp_build_qualified_type (void_type_node
, quals
);
1259 from
= build_pointer_type (from_pointee
);
1260 conv
= build_conv (ck_ptr
, from
, conv
);
1262 else if (TYPE_PTRDATAMEM_P (from
))
1264 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1265 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1267 if (same_type_p (fbase
, tbase
))
1268 /* No base conversion needed. */;
1269 else if (DERIVED_FROM_P (fbase
, tbase
)
1270 && (same_type_ignoring_top_level_qualifiers_p
1271 (from_pointee
, to_pointee
)))
1273 from
= build_ptrmem_type (tbase
, from_pointee
);
1274 conv
= build_conv (ck_pmem
, from
, conv
);
1279 else if (CLASS_TYPE_P (from_pointee
)
1280 && CLASS_TYPE_P (to_pointee
)
1283 An rvalue of type "pointer to cv D," where D is a
1284 class type, can be converted to an rvalue of type
1285 "pointer to cv B," where B is a base class (clause
1286 _class.derived_) of D. If B is an inaccessible
1287 (clause _class.access_) or ambiguous
1288 (_class.member.lookup_) base class of D, a program
1289 that necessitates this conversion is ill-formed.
1290 Therefore, we use DERIVED_FROM_P, and do not check
1291 access or uniqueness. */
1292 && DERIVED_FROM_P (to_pointee
, from_pointee
))
1295 = cp_build_qualified_type (to_pointee
,
1296 cp_type_quals (from_pointee
));
1297 from
= build_pointer_type (from_pointee
);
1298 conv
= build_conv (ck_ptr
, from
, conv
);
1299 conv
->base_p
= true;
1302 if (same_type_p (from
, to
))
1304 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
1305 /* In a C-style cast, we ignore CV-qualification because we
1306 are allowed to perform a static_cast followed by a
1308 conv
= build_conv (ck_qual
, to
, conv
);
1309 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1310 conv
= build_conv (ck_qual
, to
, conv
);
1311 else if (expr
&& string_conv_p (to
, expr
, 0))
1312 /* converting from string constant to char *. */
1313 conv
= build_conv (ck_qual
, to
, conv
);
1314 else if (fnptr_conv_p (to
, from
))
1315 conv
= build_conv (ck_fnptr
, to
, conv
);
1316 /* Allow conversions among compatible ObjC pointer types (base
1317 conversions have been already handled above). */
1318 else if (c_dialect_objc ()
1319 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1320 conv
= build_conv (ck_ptr
, to
, conv
);
1321 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1323 conv
= build_conv (ck_ptr
, to
, conv
);
1331 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1333 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1334 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1335 tree fbase
= class_of_this_parm (fromfn
);
1336 tree tbase
= class_of_this_parm (tofn
);
1338 if (!DERIVED_FROM_P (fbase
, tbase
))
1341 tree fstat
= static_fn_type (fromfn
);
1342 tree tstat
= static_fn_type (tofn
);
1343 if (same_type_p (tstat
, fstat
)
1344 || fnptr_conv_p (tstat
, fstat
))
1349 if (!same_type_p (fbase
, tbase
))
1351 from
= build_memfn_type (fstat
,
1353 cp_type_quals (tbase
),
1354 type_memfn_rqual (tofn
));
1355 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1356 conv
= build_conv (ck_pmem
, from
, conv
);
1357 conv
->base_p
= true;
1359 if (fnptr_conv_p (tstat
, fstat
))
1360 conv
= build_conv (ck_fnptr
, to
, conv
);
1362 else if (tcode
== BOOLEAN_TYPE
)
1366 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1367 to member type can be converted to a prvalue of type bool. ...
1368 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1369 std::nullptr_t can be converted to a prvalue of type bool; */
1370 if (ARITHMETIC_TYPE_P (from
)
1371 || UNSCOPED_ENUM_P (from
)
1372 || fcode
== POINTER_TYPE
1373 || TYPE_PTRMEM_P (from
)
1374 || NULLPTR_TYPE_P (from
))
1376 conv
= build_conv (ck_std
, to
, conv
);
1377 if (fcode
== POINTER_TYPE
1378 || TYPE_PTRDATAMEM_P (from
)
1379 || (TYPE_PTRMEMFUNC_P (from
)
1380 && conv
->rank
< cr_pbool
)
1381 || NULLPTR_TYPE_P (from
))
1382 conv
->rank
= cr_pbool
;
1383 if (NULLPTR_TYPE_P (from
) && (flags
& LOOKUP_ONLYCONVERTING
))
1390 /* We don't check for ENUMERAL_TYPE here because there are no standard
1391 conversions to enum type. */
1392 /* As an extension, allow conversion to complex type. */
1393 else if (ARITHMETIC_TYPE_P (to
))
1395 if (! (INTEGRAL_CODE_P (fcode
)
1396 || (fcode
== REAL_TYPE
&& !(flags
& LOOKUP_NO_NON_INTEGRAL
)))
1397 || SCOPED_ENUM_P (from
))
1399 conv
= build_conv (ck_std
, to
, conv
);
1401 /* Give this a better rank if it's a promotion. */
1402 if (same_type_p (to
, type_promotes_to (from
))
1403 && next_conversion (conv
)->rank
<= cr_promotion
)
1404 conv
->rank
= cr_promotion
;
1406 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1407 && vector_types_convertible_p (from
, to
, false))
1408 return build_conv (ck_std
, to
, conv
);
1409 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1410 && is_properly_derived_from (from
, to
))
1412 if (conv
->kind
== ck_rvalue
)
1413 conv
= next_conversion (conv
);
1414 conv
= build_conv (ck_base
, to
, conv
);
1415 /* The derived-to-base conversion indicates the initialization
1416 of a parameter with base type from an object of a derived
1417 type. A temporary object is created to hold the result of
1418 the conversion unless we're binding directly to a reference. */
1419 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1424 if (flags
& LOOKUP_NO_NARROWING
)
1425 conv
->check_narrowing
= true;
1430 /* Returns nonzero if T1 is reference-related to T2. */
1433 reference_related_p (tree t1
, tree t2
)
1435 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1438 t1
= TYPE_MAIN_VARIANT (t1
);
1439 t2
= TYPE_MAIN_VARIANT (t2
);
1443 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1444 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1446 return (same_type_p (t1
, t2
)
1447 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1448 && DERIVED_FROM_P (t1
, t2
)));
1451 /* Returns nonzero if T1 is reference-compatible with T2. */
1454 reference_compatible_p (tree t1
, tree t2
)
1458 "cv1 T1" is reference compatible with "cv2 T2" if
1459 * T1 is reference-related to T2 or
1460 * T2 is "noexcept function" and T1 is "function", where the
1461 function types are otherwise the same,
1462 and cv1 is the same cv-qualification as, or greater cv-qualification
1464 return ((reference_related_p (t1
, t2
)
1465 || fnptr_conv_p (t1
, t2
))
1466 && at_least_as_qualified_p (t1
, t2
));
1469 /* A reference of the indicated TYPE is being bound directly to the
1470 expression represented by the implicit conversion sequence CONV.
1471 Return a conversion sequence for this binding. */
1474 direct_reference_binding (tree type
, conversion
*conv
)
1478 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
1479 gcc_assert (TREE_CODE (conv
->type
) != REFERENCE_TYPE
);
1481 t
= TREE_TYPE (type
);
1483 if (conv
->kind
== ck_identity
)
1484 /* Mark the identity conv as to not decay to rvalue. */
1485 conv
->rvaluedness_matches_p
= true;
1489 When a parameter of reference type binds directly
1490 (_dcl.init.ref_) to an argument expression, the implicit
1491 conversion sequence is the identity conversion, unless the
1492 argument expression has a type that is a derived class of the
1493 parameter type, in which case the implicit conversion sequence is
1494 a derived-to-base Conversion.
1496 If the parameter binds directly to the result of applying a
1497 conversion function to the argument expression, the implicit
1498 conversion sequence is a user-defined conversion sequence
1499 (_over.ics.user_), with the second standard conversion sequence
1500 either an identity conversion or, if the conversion function
1501 returns an entity of a type that is a derived class of the
1502 parameter type, a derived-to-base conversion. */
1503 if (is_properly_derived_from (conv
->type
, t
))
1505 /* Represent the derived-to-base conversion. */
1506 conv
= build_conv (ck_base
, t
, conv
);
1507 /* We will actually be binding to the base-class subobject in
1508 the derived class, so we mark this conversion appropriately.
1509 That way, convert_like knows not to generate a temporary. */
1510 conv
->need_temporary_p
= false;
1513 return build_conv (ck_ref_bind
, type
, conv
);
1516 /* Returns the conversion path from type FROM to reference type TO for
1517 purposes of reference binding. For lvalue binding, either pass a
1518 reference type to FROM or an lvalue expression to EXPR. If the
1519 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1520 the conversion returned. If C_CAST_P is true, this
1521 conversion is coming from a C-style cast. */
1524 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1525 tsubst_flags_t complain
)
1527 conversion
*conv
= NULL
;
1528 tree to
= TREE_TYPE (rto
);
1533 cp_lvalue_kind gl_kind
;
1536 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1538 expr
= instantiate_type (to
, expr
, tf_none
);
1539 if (expr
== error_mark_node
)
1541 from
= TREE_TYPE (expr
);
1544 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1546 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1547 /* DR 1288: Otherwise, if the initializer list has a single element
1548 of type E and ... [T's] referenced type is reference-related to E,
1549 the object or reference is initialized from that element... */
1550 if (CONSTRUCTOR_NELTS (expr
) == 1)
1552 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1553 if (error_operand_p (elt
))
1555 tree etype
= TREE_TYPE (elt
);
1556 if (reference_related_p (to
, etype
))
1563 /* Otherwise, if T is a reference type, a prvalue temporary of the
1564 type referenced by T is copy-list-initialized or
1565 direct-list-initialized, depending on the kind of initialization
1566 for the reference, and the reference is bound to that temporary. */
1567 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1568 flags
|LOOKUP_NO_TEMP_BIND
, complain
);
1572 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1574 from
= TREE_TYPE (from
);
1575 if (!TYPE_REF_IS_RVALUE (rfrom
)
1576 || TREE_CODE (from
) == FUNCTION_TYPE
)
1577 gl_kind
= clk_ordinary
;
1579 gl_kind
= clk_rvalueref
;
1582 gl_kind
= lvalue_kind (expr
);
1583 else if (CLASS_TYPE_P (from
)
1584 || TREE_CODE (from
) == ARRAY_TYPE
)
1585 gl_kind
= clk_class
;
1589 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1590 if ((flags
& LOOKUP_NO_TEMP_BIND
)
1591 && (gl_kind
& clk_class
))
1594 /* Same mask as real_lvalue_p. */
1595 is_lvalue
= gl_kind
&& !(gl_kind
& (clk_rvalueref
|clk_class
));
1598 if ((gl_kind
& clk_bitfield
) != 0)
1599 tfrom
= unlowered_expr_type (expr
);
1601 /* Figure out whether or not the types are reference-related and
1602 reference compatible. We have to do this after stripping
1603 references from FROM. */
1604 related_p
= reference_related_p (to
, tfrom
);
1605 /* If this is a C cast, first convert to an appropriately qualified
1606 type, so that we can later do a const_cast to the desired type. */
1607 if (related_p
&& c_cast_p
1608 && !at_least_as_qualified_p (to
, tfrom
))
1609 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1610 compatible_p
= reference_compatible_p (to
, tfrom
);
1612 /* Directly bind reference when target expression's type is compatible with
1613 the reference and expression is an lvalue. In DR391, the wording in
1614 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1615 const and rvalue references to rvalues of compatible class type.
1616 We should also do direct bindings for non-class xvalues. */
1617 if ((related_p
|| compatible_p
) && gl_kind
)
1621 If the initializer expression
1623 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1624 is reference-compatible with "cv2 T2,"
1626 the reference is bound directly to the initializer expression
1630 If the initializer expression is an rvalue, with T2 a class type,
1631 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1632 is bound to the object represented by the rvalue or to a sub-object
1633 within that object. */
1635 conv
= build_identity_conv (tfrom
, expr
);
1636 conv
= direct_reference_binding (rto
, conv
);
1638 if (TREE_CODE (rfrom
) == REFERENCE_TYPE
)
1639 /* Handle rvalue reference to function properly. */
1640 conv
->rvaluedness_matches_p
1641 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1643 conv
->rvaluedness_matches_p
1644 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1646 if ((gl_kind
& clk_bitfield
) != 0
1647 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1648 /* For the purposes of overload resolution, we ignore the fact
1649 this expression is a bitfield or packed field. (In particular,
1650 [over.ics.ref] says specifically that a function with a
1651 non-const reference parameter is viable even if the
1652 argument is a bitfield.)
1654 However, when we actually call the function we must create
1655 a temporary to which to bind the reference. If the
1656 reference is volatile, or isn't const, then we cannot make
1657 a temporary, so we just issue an error when the conversion
1659 conv
->need_temporary_p
= true;
1661 /* Don't allow binding of lvalues (other than function lvalues) to
1662 rvalue references. */
1663 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1664 && TREE_CODE (to
) != FUNCTION_TYPE
)
1667 /* Nor the reverse. */
1668 if (!is_lvalue
&& !TYPE_REF_IS_RVALUE (rto
)
1669 && (!CP_TYPE_CONST_NON_VOLATILE_P (to
)
1670 || (flags
& LOOKUP_NO_RVAL_BIND
))
1671 && TREE_CODE (to
) != FUNCTION_TYPE
)
1679 /* [class.conv.fct] A conversion function is never used to convert a
1680 (possibly cv-qualified) object to the (possibly cv-qualified) same
1681 object type (or a reference to it), to a (possibly cv-qualified) base
1682 class of that type (or a reference to it).... */
1683 else if (CLASS_TYPE_P (from
) && !related_p
1684 && !(flags
& LOOKUP_NO_CONVERSION
))
1688 If the initializer expression
1690 -- has a class type (i.e., T2 is a class type) can be
1691 implicitly converted to an lvalue of type "cv3 T3," where
1692 "cv1 T1" is reference-compatible with "cv3 T3". (this
1693 conversion is selected by enumerating the applicable
1694 conversion functions (_over.match.ref_) and choosing the
1695 best one through overload resolution. (_over.match_).
1697 the reference is bound to the lvalue result of the conversion
1698 in the second case. */
1699 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1702 return cand
->second_conv
;
1705 /* From this point on, we conceptually need temporaries, even if we
1706 elide them. Only the cases above are "direct bindings". */
1707 if (flags
& LOOKUP_NO_TEMP_BIND
)
1712 When a parameter of reference type is not bound directly to an
1713 argument expression, the conversion sequence is the one required
1714 to convert the argument expression to the underlying type of the
1715 reference according to _over.best.ics_. Conceptually, this
1716 conversion sequence corresponds to copy-initializing a temporary
1717 of the underlying type with the argument expression. Any
1718 difference in top-level cv-qualification is subsumed by the
1719 initialization itself and does not constitute a conversion. */
1723 Otherwise, the reference shall be an lvalue reference to a
1724 non-volatile const type, or the reference shall be an rvalue
1727 We try below to treat this as a bad conversion to improve diagnostics,
1728 but if TO is an incomplete class, we need to reject this conversion
1729 now to avoid unnecessary instantiation. */
1730 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
)
1731 && !COMPLETE_TYPE_P (to
))
1734 /* We're generating a temporary now, but don't bind any more in the
1735 conversion (specifically, don't slice the temporary returned by a
1736 conversion operator). */
1737 flags
|= LOOKUP_NO_TEMP_BIND
;
1739 /* Core issue 899: When [copy-]initializing a temporary to be bound
1740 to the first parameter of a copy constructor (12.8) called with
1741 a single argument in the context of direct-initialization,
1742 explicit conversion functions are also considered.
1744 So don't set LOOKUP_ONLYCONVERTING in that case. */
1745 if (!(flags
& LOOKUP_COPY_PARM
))
1746 flags
|= LOOKUP_ONLYCONVERTING
;
1749 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1754 if (conv
->user_conv_p
)
1756 /* If initializing the temporary used a conversion function,
1757 recalculate the second conversion sequence. */
1758 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1759 if (t
->kind
== ck_user
1760 && DECL_CONV_FN_P (t
->cand
->fn
))
1762 tree ftype
= TREE_TYPE (TREE_TYPE (t
->cand
->fn
));
1763 int sflags
= (flags
|LOOKUP_NO_CONVERSION
)&~LOOKUP_NO_TEMP_BIND
;
1764 conversion
*new_second
1765 = reference_binding (rto
, ftype
, NULL_TREE
, c_cast_p
,
1769 return merge_conversion_sequences (t
, new_second
);
1773 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1774 /* This reference binding, unlike those above, requires the
1775 creation of a temporary. */
1776 conv
->need_temporary_p
= true;
1777 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1781 Otherwise, the reference shall be an lvalue reference to a
1782 non-volatile const type, or the reference shall be an rvalue
1784 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1789 Otherwise, a temporary of type "cv1 T1" is created and
1790 initialized from the initializer expression using the rules for a
1791 non-reference copy initialization. If T1 is reference-related to
1792 T2, cv1 must be the same cv-qualification as, or greater
1793 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1794 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1800 /* Returns the implicit conversion sequence (see [over.ics]) from type
1801 FROM to type TO. The optional expression EXPR may affect the
1802 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1803 true, this conversion is coming from a C-style cast. */
1806 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1807 int flags
, tsubst_flags_t complain
)
1811 if (from
== error_mark_node
|| to
== error_mark_node
1812 || expr
== error_mark_node
)
1815 /* Other flags only apply to the primary function in overload
1816 resolution, or after we've chosen one. */
1817 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1818 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1819 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1821 /* FIXME: actually we don't want warnings either, but we can't just
1822 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1823 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1824 We really ought not to issue that warning until we've committed
1825 to that conversion. */
1826 complain
&= ~tf_error
;
1828 /* Call reshape_init early to remove redundant braces. */
1829 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
)
1830 && CLASS_TYPE_P (to
)
1831 && COMPLETE_TYPE_P (complete_type (to
))
1832 && !CLASSTYPE_NON_AGGREGATE (to
))
1834 expr
= reshape_init (to
, expr
, complain
);
1835 if (expr
== error_mark_node
)
1837 from
= TREE_TYPE (expr
);
1840 if (TREE_CODE (to
) == REFERENCE_TYPE
)
1841 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1843 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
, complain
);
1848 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1850 if (is_std_init_list (to
))
1851 return build_list_conv (to
, expr
, flags
, complain
);
1853 /* As an extension, allow list-initialization of _Complex. */
1854 if (TREE_CODE (to
) == COMPLEX_TYPE
)
1856 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1861 /* Allow conversion from an initializer-list with one element to a
1863 if (SCALAR_TYPE_P (to
))
1865 int nelts
= CONSTRUCTOR_NELTS (expr
);
1869 elt
= build_value_init (to
, tf_none
);
1870 else if (nelts
== 1)
1871 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1873 elt
= error_mark_node
;
1875 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1876 c_cast_p
, flags
, complain
);
1879 conv
->check_narrowing
= true;
1880 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1881 /* Too many levels of braces, i.e. '{{1}}'. */
1886 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1887 return build_array_conv (to
, expr
, flags
, complain
);
1890 if (expr
!= NULL_TREE
1891 && (MAYBE_CLASS_TYPE_P (from
)
1892 || MAYBE_CLASS_TYPE_P (to
))
1893 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1895 struct z_candidate
*cand
;
1897 if (CLASS_TYPE_P (to
)
1898 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
1899 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
1900 return build_aggr_conv (to
, expr
, flags
, complain
);
1902 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
1905 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
1906 && CONSTRUCTOR_NELTS (expr
) == 1
1907 && !is_list_ctor (cand
->fn
))
1909 /* "If C is not an initializer-list constructor and the
1910 initializer list has a single element of type cv U, where U is
1911 X or a class derived from X, the implicit conversion sequence
1912 has Exact Match rank if U is X, or Conversion rank if U is
1914 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1915 tree elttype
= TREE_TYPE (elt
);
1916 if (reference_related_p (to
, elttype
))
1917 return implicit_conversion (to
, elttype
, elt
,
1918 c_cast_p
, flags
, complain
);
1920 conv
= cand
->second_conv
;
1923 /* We used to try to bind a reference to a temporary here, but that
1924 is now handled after the recursive call to this function at the end
1925 of reference_binding. */
1932 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1933 functions. ARGS will not be changed until a single candidate is
1936 static struct z_candidate
*
1937 add_candidate (struct z_candidate
**candidates
,
1938 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
1939 size_t num_convs
, conversion
**convs
,
1940 tree access_path
, tree conversion_path
,
1941 int viable
, struct rejection_reason
*reason
,
1944 struct z_candidate
*cand
= (struct z_candidate
*)
1945 conversion_obstack_alloc (sizeof (struct z_candidate
));
1948 cand
->first_arg
= first_arg
;
1950 cand
->convs
= convs
;
1951 cand
->num_convs
= num_convs
;
1952 cand
->access_path
= access_path
;
1953 cand
->conversion_path
= conversion_path
;
1954 cand
->viable
= viable
;
1955 cand
->reason
= reason
;
1956 cand
->next
= *candidates
;
1957 cand
->flags
= flags
;
1963 /* Return the number of remaining arguments in the parameter list
1964 beginning with ARG. */
1967 remaining_arguments (tree arg
)
1971 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
1972 arg
= TREE_CHAIN (arg
))
1978 /* Create an overload candidate for the function or method FN called
1979 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1980 FLAGS is passed on to implicit_conversion.
1982 This does not change ARGS.
1984 CTYPE, if non-NULL, is the type we want to pretend this function
1985 comes from for purposes of overload resolution. */
1987 static struct z_candidate
*
1988 add_function_candidate (struct z_candidate
**candidates
,
1989 tree fn
, tree ctype
, tree first_arg
,
1990 const vec
<tree
, va_gc
> *args
, tree access_path
,
1991 tree conversion_path
, int flags
,
1992 tsubst_flags_t complain
)
1994 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1998 tree orig_first_arg
= first_arg
;
2001 struct rejection_reason
*reason
= NULL
;
2003 /* At this point we should not see any functions which haven't been
2004 explicitly declared, except for friend functions which will have
2005 been found using argument dependent lookup. */
2006 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
2008 /* The `this', `in_chrg' and VTT arguments to constructors are not
2009 considered in overload resolution. */
2010 if (DECL_CONSTRUCTOR_P (fn
))
2012 if (ctor_omit_inherited_parms (fn
))
2013 /* Bring back parameters omitted from an inherited ctor. */
2014 parmlist
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn
));
2016 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
2017 skip
= num_artificial_parms_for (fn
);
2018 if (skip
> 0 && first_arg
!= NULL_TREE
)
2021 first_arg
= NULL_TREE
;
2027 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
2028 convs
= alloc_conversions (len
);
2030 /* 13.3.2 - Viable functions [over.match.viable]
2031 First, to be a viable function, a candidate function shall have enough
2032 parameters to agree in number with the arguments in the list.
2034 We need to check this first; otherwise, checking the ICSes might cause
2035 us to produce an ill-formed template instantiation. */
2037 parmnode
= parmlist
;
2038 for (i
= 0; i
< len
; ++i
)
2040 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
2042 parmnode
= TREE_CHAIN (parmnode
);
2045 if ((i
< len
&& parmnode
)
2046 || !sufficient_parms_p (parmnode
))
2048 int remaining
= remaining_arguments (parmnode
);
2050 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
2053 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2054 parameter of type "reference to cv C" (including such a constructor
2055 instantiated from a template) is excluded from the set of candidate
2056 functions when used to construct an object of type D with an argument list
2057 containing a single argument if C is reference-related to D. */
2058 if (viable
&& len
== 1 && parmlist
&& DECL_CONSTRUCTOR_P (fn
)
2059 && flag_new_inheriting_ctors
2060 && DECL_INHERITED_CTOR (fn
))
2062 tree ptype
= non_reference (TREE_VALUE (parmlist
));
2063 tree dtype
= DECL_CONTEXT (fn
);
2064 tree btype
= DECL_INHERITED_CTOR_BASE (fn
);
2065 if (reference_related_p (ptype
, dtype
)
2066 && reference_related_p (btype
, ptype
))
2069 reason
= inherited_ctor_rejection ();
2073 /* Second, for a function to be viable, its constraints must be
2075 if (flag_concepts
&& viable
2076 && !constraints_satisfied_p (fn
))
2078 reason
= constraint_failure (fn
);
2082 /* When looking for a function from a subobject from an implicit
2083 copy/move constructor/operator=, don't consider anything that takes (a
2084 reference to) an unrelated type. See c++/44909 and core 1092. */
2085 if (viable
&& parmlist
&& (flags
& LOOKUP_DEFAULTED
))
2087 if (DECL_CONSTRUCTOR_P (fn
))
2089 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
2090 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
))
2096 parmnode
= chain_index (i
-1, parmlist
);
2097 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
2102 /* This only applies at the top level. */
2103 flags
&= ~LOOKUP_DEFAULTED
;
2109 /* Third, for F to be a viable function, there shall exist for each
2110 argument an implicit conversion sequence that converts that argument
2111 to the corresponding parameter of F. */
2113 parmnode
= parmlist
;
2115 for (i
= 0; i
< len
; ++i
)
2117 tree argtype
, to_type
;
2122 if (parmnode
== void_list_node
)
2125 if (i
== 0 && first_arg
!= NULL_TREE
)
2128 arg
= CONST_CAST_TREE (
2129 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
2130 argtype
= lvalue_type (arg
);
2132 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2133 && ! DECL_CONSTRUCTOR_P (fn
));
2137 tree parmtype
= TREE_VALUE (parmnode
);
2140 parmnode
= TREE_CHAIN (parmnode
);
2142 /* The type of the implicit object parameter ('this') for
2143 overload resolution is not always the same as for the
2144 function itself; conversion functions are considered to
2145 be members of the class being converted, and functions
2146 introduced by a using-declaration are considered to be
2147 members of the class that uses them.
2149 Since build_over_call ignores the ICS for the `this'
2150 parameter, we can just change the parm type. */
2151 if (ctype
&& is_this
)
2153 parmtype
= cp_build_qualified_type
2154 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
2155 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
2157 /* If the function has a ref-qualifier, the implicit
2158 object parameter has reference type. */
2159 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
2160 parmtype
= cp_build_reference_type (parmtype
, rv
);
2161 /* The special handling of 'this' conversions in compare_ics
2162 does not apply if there is a ref-qualifier. */
2167 parmtype
= build_pointer_type (parmtype
);
2168 /* We don't use build_this here because we don't want to
2169 capture the object argument until we've chosen a
2170 non-static member function. */
2171 arg
= build_address (arg
);
2172 argtype
= lvalue_type (arg
);
2176 /* Core issue 899: When [copy-]initializing a temporary to be bound
2177 to the first parameter of a copy constructor (12.8) called with
2178 a single argument in the context of direct-initialization,
2179 explicit conversion functions are also considered.
2181 So set LOOKUP_COPY_PARM to let reference_binding know that
2182 it's being called in that context. We generalize the above
2183 to handle move constructors and template constructors as well;
2184 the standardese should soon be updated similarly. */
2185 if (ctype
&& i
== 0 && (len
-skip
== 1)
2186 && DECL_CONSTRUCTOR_P (fn
)
2187 && parmtype
!= error_mark_node
2188 && (same_type_ignoring_top_level_qualifiers_p
2189 (non_reference (parmtype
), ctype
)))
2191 if (!(flags
& LOOKUP_ONLYCONVERTING
))
2192 lflags
|= LOOKUP_COPY_PARM
;
2193 /* We allow user-defined conversions within init-lists, but
2194 don't list-initialize the copy parm, as that would mean
2195 using two levels of braces for the same type. */
2196 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
2197 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
2198 lflags
|= LOOKUP_NO_CONVERSION
;
2201 lflags
|= LOOKUP_ONLYCONVERTING
;
2203 t
= implicit_conversion (parmtype
, argtype
, arg
,
2204 /*c_cast_p=*/false, lflags
, complain
);
2209 t
= build_identity_conv (argtype
, arg
);
2210 t
->ellipsis_p
= true;
2221 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
);
2228 reason
= bad_arg_conversion_rejection (first_arg
, i
, arg
, to_type
);
2233 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2234 access_path
, conversion_path
, viable
, reason
, flags
);
2237 /* Create an overload candidate for the conversion function FN which will
2238 be invoked for expression OBJ, producing a pointer-to-function which
2239 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2240 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2241 passed on to implicit_conversion.
2243 Actually, we don't really care about FN; we care about the type it
2244 converts to. There may be multiple conversion functions that will
2245 convert to that type, and we rely on build_user_type_conversion_1 to
2246 choose the best one; so when we create our candidate, we record the type
2247 instead of the function. */
2249 static struct z_candidate
*
2250 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2251 const vec
<tree
, va_gc
> *arglist
,
2252 tree access_path
, tree conversion_path
,
2253 tsubst_flags_t complain
)
2255 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2256 int i
, len
, viable
, flags
;
2257 tree parmlist
, parmnode
;
2259 struct rejection_reason
*reason
;
2261 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2262 parmlist
= TREE_TYPE (parmlist
);
2263 parmlist
= TYPE_ARG_TYPES (parmlist
);
2265 len
= vec_safe_length (arglist
) + 1;
2266 convs
= alloc_conversions (len
);
2267 parmnode
= parmlist
;
2269 flags
= LOOKUP_IMPLICIT
;
2272 /* Don't bother looking up the same type twice. */
2273 if (*candidates
&& (*candidates
)->fn
== totype
)
2276 for (i
= 0; i
< len
; ++i
)
2278 tree arg
, argtype
, convert_type
= NULL_TREE
;
2284 arg
= (*arglist
)[i
- 1];
2285 argtype
= lvalue_type (arg
);
2289 t
= build_identity_conv (argtype
, NULL_TREE
);
2290 t
= build_conv (ck_user
, totype
, t
);
2291 /* Leave the 'cand' field null; we'll figure out the conversion in
2292 convert_like_real if this candidate is chosen. */
2293 convert_type
= totype
;
2295 else if (parmnode
== void_list_node
)
2299 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2300 /*c_cast_p=*/false, flags
, complain
);
2301 convert_type
= TREE_VALUE (parmnode
);
2305 t
= build_identity_conv (argtype
, arg
);
2306 t
->ellipsis_p
= true;
2307 convert_type
= argtype
;
2317 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, arg
, convert_type
);
2324 parmnode
= TREE_CHAIN (parmnode
);
2328 || ! sufficient_parms_p (parmnode
))
2330 int remaining
= remaining_arguments (parmnode
);
2332 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2335 return add_candidate (candidates
, totype
, obj
, arglist
, len
, convs
,
2336 access_path
, conversion_path
, viable
, reason
, flags
);
2340 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2341 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2342 int flags
, tsubst_flags_t complain
)
2349 struct rejection_reason
*reason
= NULL
;
2354 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2355 convs
= alloc_conversions (num_convs
);
2357 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2358 conversion ops are allowed. We handle that here by just checking for
2359 boolean_type_node because other operators don't ask for it. COND_EXPR
2360 also does contextual conversion to bool for the first operand, but we
2361 handle that in build_conditional_expr, and type1 here is operand 2. */
2362 if (type1
!= boolean_type_node
)
2363 flags
|= LOOKUP_ONLYCONVERTING
;
2365 for (i
= 0; i
< 2; ++i
)
2370 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2371 /*c_cast_p=*/false, flags
, complain
);
2375 /* We need something for printing the candidate. */
2376 t
= build_identity_conv (types
[i
], NULL_TREE
);
2377 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2383 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, args
[i
],
2389 /* For COND_EXPR we rearranged the arguments; undo that now. */
2392 convs
[2] = convs
[1];
2393 convs
[1] = convs
[0];
2394 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2395 /*c_cast_p=*/false, flags
,
2402 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2407 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2409 /*access_path=*/NULL_TREE
,
2410 /*conversion_path=*/NULL_TREE
,
2411 viable
, reason
, flags
);
2415 is_complete (tree t
)
2417 return COMPLETE_TYPE_P (complete_type (t
));
2420 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2423 promoted_arithmetic_type_p (tree type
)
2427 In this section, the term promoted integral type is used to refer
2428 to those integral types which are preserved by integral promotion
2429 (including e.g. int and long but excluding e.g. char).
2430 Similarly, the term promoted arithmetic type refers to promoted
2431 integral types plus floating types. */
2432 return ((CP_INTEGRAL_TYPE_P (type
)
2433 && same_type_p (type_promotes_to (type
), type
))
2434 || TREE_CODE (type
) == REAL_TYPE
);
2437 /* Create any builtin operator overload candidates for the operator in
2438 question given the converted operand types TYPE1 and TYPE2. The other
2439 args are passed through from add_builtin_candidates to
2440 build_builtin_candidate.
2442 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2443 If CODE is requires candidates operands of the same type of the kind
2444 of which TYPE1 and TYPE2 are, we add both candidates
2445 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2448 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2449 enum tree_code code2
, tree fnname
, tree type1
,
2450 tree type2
, tree
*args
, tree
*argtypes
, int flags
,
2451 tsubst_flags_t complain
)
2455 case POSTINCREMENT_EXPR
:
2456 case POSTDECREMENT_EXPR
:
2457 args
[1] = integer_zero_node
;
2458 type2
= integer_type_node
;
2467 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2468 and VQ is either volatile or empty, there exist candidate operator
2469 functions of the form
2470 VQ T& operator++(VQ T&);
2471 T operator++(VQ T&, int);
2472 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2473 type other than bool, and VQ is either volatile or empty, there exist
2474 candidate operator functions of the form
2475 VQ T& operator--(VQ T&);
2476 T operator--(VQ T&, int);
2477 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2478 complete object type, and VQ is either volatile or empty, there exist
2479 candidate operator functions of the form
2480 T*VQ& operator++(T*VQ&);
2481 T*VQ& operator--(T*VQ&);
2482 T* operator++(T*VQ&, int);
2483 T* operator--(T*VQ&, int); */
2485 case POSTDECREMENT_EXPR
:
2486 case PREDECREMENT_EXPR
:
2487 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2490 case POSTINCREMENT_EXPR
:
2491 case PREINCREMENT_EXPR
:
2492 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2494 type1
= build_reference_type (type1
);
2499 /* 7 For every cv-qualified or cv-unqualified object type T, there
2500 exist candidate operator functions of the form
2504 8 For every function type T, there exist candidate operator functions of
2506 T& operator*(T*); */
2509 if (TYPE_PTR_P (type1
)
2510 && (TYPE_PTROB_P (type1
)
2511 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2515 /* 9 For every type T, there exist candidate operator functions of the form
2518 10For every promoted arithmetic type T, there exist candidate operator
2519 functions of the form
2523 case UNARY_PLUS_EXPR
: /* unary + */
2524 if (TYPE_PTR_P (type1
))
2528 if (ARITHMETIC_TYPE_P (type1
))
2532 /* 11For every promoted integral type T, there exist candidate operator
2533 functions of the form
2537 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2541 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2542 is the same type as C2 or is a derived class of C2, T is a complete
2543 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2544 there exist candidate operator functions of the form
2545 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2546 where CV12 is the union of CV1 and CV2. */
2549 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2551 tree c1
= TREE_TYPE (type1
);
2552 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2554 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2555 && (TYPE_PTRMEMFUNC_P (type2
)
2556 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2561 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2562 didate operator functions of the form
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 bool operator!=(L, R);
2573 where LR is the result of the usual arithmetic conversions between
2576 14For every pair of types T and I, where T is a cv-qualified or cv-
2577 unqualified complete object type and I is a promoted integral type,
2578 there exist candidate operator functions of the form
2579 T* operator+(T*, I);
2580 T& operator[](T*, I);
2581 T* operator-(T*, I);
2582 T* operator+(I, T*);
2583 T& operator[](I, T*);
2585 15For every T, where T is a pointer to complete object type, there exist
2586 candidate operator functions of the form112)
2587 ptrdiff_t operator-(T, T);
2589 16For every pointer or enumeration type T, there exist candidate operator
2590 functions of the form
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);
2596 bool operator!=(T, T);
2598 17For every pointer to member type T, there exist candidate operator
2599 functions of the form
2600 bool operator==(T, T);
2601 bool operator!=(T, T); */
2604 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2606 if (TYPE_PTROB_P (type1
)
2607 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2609 type2
= ptrdiff_type_node
;
2614 case TRUNC_DIV_EXPR
:
2615 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2621 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2622 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2624 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2629 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2641 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2643 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2645 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2646 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2648 if (TYPE_PTR_P (type1
)
2649 && null_ptr_cst_p (args
[1]))
2654 if (null_ptr_cst_p (args
[0])
2655 && TYPE_PTR_P (type2
))
2663 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2667 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2669 type1
= ptrdiff_type_node
;
2672 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2674 type2
= ptrdiff_type_node
;
2679 /* 18For every pair of promoted integral types L and R, there exist candi-
2680 date operator functions of the form
2687 where LR is the result of the usual arithmetic conversions between
2690 case TRUNC_MOD_EXPR
:
2696 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2700 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2701 type, VQ is either volatile or empty, and R is a promoted arithmetic
2702 type, there exist candidate operator functions of the form
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);
2707 VQ L& operator-=(VQ L&, R);
2709 20For every pair T, VQ), where T is any type and VQ is either volatile
2710 or empty, there exist candidate operator functions of the form
2711 T*VQ& operator=(T*VQ&, T*);
2713 21For every pair T, VQ), where T is a pointer to member type and VQ is
2714 either volatile or empty, there exist candidate operator functions of
2716 VQ T& operator=(VQ T&, T);
2718 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2719 unqualified complete object type, VQ is either volatile or empty, and
2720 I is a promoted integral type, there exist candidate operator func-
2722 T*VQ& operator+=(T*VQ&, I);
2723 T*VQ& operator-=(T*VQ&, I);
2725 23For every triple L, VQ, R), where L is an integral or enumeration
2726 type, VQ is either volatile or empty, and R is a promoted integral
2727 type, there exist candidate operator functions of the form
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);
2734 VQ L& operator|=(VQ L&, R); */
2741 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2743 type2
= ptrdiff_type_node
;
2748 case TRUNC_DIV_EXPR
:
2749 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2753 case TRUNC_MOD_EXPR
:
2759 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2764 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2766 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2767 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2768 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2769 || ((TYPE_PTRMEMFUNC_P (type1
)
2770 || TYPE_PTR_P (type1
))
2771 && null_ptr_cst_p (args
[1])))
2781 type1
= build_reference_type (type1
);
2787 For every pair of promoted arithmetic types L and R, there
2788 exist candidate operator functions of the form
2790 LR operator?(bool, L, R);
2792 where LR is the result of the usual arithmetic conversions
2793 between types L and R.
2795 For every type T, where T is a pointer or pointer-to-member
2796 type, there exist candidate operator functions of the form T
2797 operator?(bool, T, T); */
2799 if (promoted_arithmetic_type_p (type1
)
2800 && promoted_arithmetic_type_p (type2
))
2804 /* Otherwise, the types should be pointers. */
2805 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2808 /* We don't check that the two types are the same; the logic
2809 below will actually create two candidates; one in which both
2810 parameter types are TYPE1, and one in which both parameter
2816 if (ARITHMETIC_TYPE_P (type1
))
2824 /* Make sure we don't create builtin candidates with dependent types. */
2825 bool u1
= uses_template_parms (type1
);
2826 bool u2
= type2
? uses_template_parms (type2
) : false;
2829 /* Try to recover if one of the types is non-dependent. But if
2830 there's only one type, there's nothing we can do. */
2833 /* And we lose if both are dependent. */
2836 /* Or if they have different forms. */
2837 if (TREE_CODE (type1
) != TREE_CODE (type2
))
2846 /* If we're dealing with two pointer types or two enumeral types,
2847 we need candidates for both of them. */
2848 if (type2
&& !same_type_p (type1
, type2
)
2849 && TREE_CODE (type1
) == TREE_CODE (type2
)
2850 && (TREE_CODE (type1
) == REFERENCE_TYPE
2851 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2852 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2853 || TYPE_PTRMEMFUNC_P (type1
)
2854 || MAYBE_CLASS_TYPE_P (type1
)
2855 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2857 if (TYPE_PTR_OR_PTRMEM_P (type1
))
2859 tree cptype
= composite_pointer_type (type1
, type2
,
2864 if (cptype
!= error_mark_node
)
2866 build_builtin_candidate
2867 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
2873 build_builtin_candidate
2874 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
2875 build_builtin_candidate
2876 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
2880 build_builtin_candidate
2881 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
2885 type_decays_to (tree type
)
2887 if (TREE_CODE (type
) == ARRAY_TYPE
)
2888 return build_pointer_type (TREE_TYPE (type
));
2889 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2890 return build_pointer_type (type
);
2894 /* There are three conditions of builtin candidates:
2896 1) bool-taking candidates. These are the same regardless of the input.
2897 2) pointer-pair taking candidates. These are generated for each type
2898 one of the input types converts to.
2899 3) arithmetic candidates. According to the standard, we should generate
2900 all of these, but I'm trying not to...
2902 Here we generate a superset of the possible candidates for this particular
2903 case. That is a subset of the full set the standard defines, plus some
2904 other cases which the standard disallows. add_builtin_candidate will
2905 filter out the invalid set. */
2908 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2909 enum tree_code code2
, tree fnname
, tree
*args
,
2910 int flags
, tsubst_flags_t complain
)
2914 tree type
, argtypes
[3], t
;
2915 /* TYPES[i] is the set of possible builtin-operator parameter types
2916 we will consider for the Ith argument. */
2917 vec
<tree
, va_gc
> *types
[2];
2920 for (i
= 0; i
< 3; ++i
)
2923 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2925 argtypes
[i
] = NULL_TREE
;
2930 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2931 and VQ is either volatile or empty, there exist candidate operator
2932 functions of the form
2933 VQ T& operator++(VQ T&); */
2935 case POSTINCREMENT_EXPR
:
2936 case PREINCREMENT_EXPR
:
2937 case POSTDECREMENT_EXPR
:
2938 case PREDECREMENT_EXPR
:
2943 /* 24There also exist candidate operator functions of the form
2944 bool operator!(bool);
2945 bool operator&&(bool, bool);
2946 bool operator||(bool, bool); */
2948 case TRUTH_NOT_EXPR
:
2949 build_builtin_candidate
2950 (candidates
, fnname
, boolean_type_node
,
2951 NULL_TREE
, args
, argtypes
, flags
, complain
);
2954 case TRUTH_ORIF_EXPR
:
2955 case TRUTH_ANDIF_EXPR
:
2956 build_builtin_candidate
2957 (candidates
, fnname
, boolean_type_node
,
2958 boolean_type_node
, args
, argtypes
, flags
, complain
);
2980 types
[0] = make_tree_vector ();
2981 types
[1] = make_tree_vector ();
2983 for (i
= 0; i
< 2; ++i
)
2987 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
2991 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
2994 convs
= lookup_conversions (argtypes
[i
]);
2996 if (code
== COND_EXPR
)
2998 if (lvalue_p (args
[i
]))
2999 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3001 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
3007 for (; convs
; convs
= TREE_CHAIN (convs
))
3009 type
= TREE_TYPE (convs
);
3012 && (TREE_CODE (type
) != REFERENCE_TYPE
3013 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
3016 if (code
== COND_EXPR
&& TREE_CODE (type
) == REFERENCE_TYPE
)
3017 vec_safe_push (types
[i
], type
);
3019 type
= non_reference (type
);
3020 if (i
!= 0 || ! ref1
)
3022 type
= cv_unqualified (type_decays_to (type
));
3023 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
3024 vec_safe_push (types
[i
], type
);
3025 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3026 type
= type_promotes_to (type
);
3029 if (! vec_member (type
, types
[i
]))
3030 vec_safe_push (types
[i
], type
);
3035 if (code
== COND_EXPR
&& lvalue_p (args
[i
]))
3036 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3037 type
= non_reference (argtypes
[i
]);
3038 if (i
!= 0 || ! ref1
)
3040 type
= cv_unqualified (type_decays_to (type
));
3041 if (enum_p
&& UNSCOPED_ENUM_P (type
))
3042 vec_safe_push (types
[i
], type
);
3043 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3044 type
= type_promotes_to (type
);
3046 vec_safe_push (types
[i
], type
);
3050 /* Run through the possible parameter types of both arguments,
3051 creating candidates with those parameter types. */
3052 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
3057 if (!types
[1]->is_empty ())
3058 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
3059 add_builtin_candidate
3060 (candidates
, code
, code2
, fnname
, t
,
3061 u
, args
, argtypes
, flags
, complain
);
3063 add_builtin_candidate
3064 (candidates
, code
, code2
, fnname
, t
,
3065 NULL_TREE
, args
, argtypes
, flags
, complain
);
3068 release_tree_vector (types
[0]);
3069 release_tree_vector (types
[1]);
3073 /* If TMPL can be successfully instantiated as indicated by
3074 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3076 TMPL is the template. EXPLICIT_TARGS are any explicit template
3077 arguments. ARGLIST is the arguments provided at the call-site.
3078 This does not change ARGLIST. The RETURN_TYPE is the desired type
3079 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3080 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3081 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3083 static struct z_candidate
*
3084 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
3085 tree ctype
, tree explicit_targs
, tree first_arg
,
3086 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3087 tree access_path
, tree conversion_path
,
3088 int flags
, tree obj
, unification_kind_t strict
,
3089 tsubst_flags_t complain
)
3091 int ntparms
= DECL_NTPARMS (tmpl
);
3092 tree targs
= make_tree_vec (ntparms
);
3093 unsigned int len
= vec_safe_length (arglist
);
3094 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
3095 unsigned int skip_without_in_chrg
= 0;
3096 tree first_arg_without_in_chrg
= first_arg
;
3097 tree
*args_without_in_chrg
;
3098 unsigned int nargs_without_in_chrg
;
3099 unsigned int ia
, ix
;
3101 struct z_candidate
*cand
;
3103 struct rejection_reason
*reason
= NULL
;
3106 /* We don't do deduction on the in-charge parameter, the VTT
3107 parameter or 'this'. */
3108 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
3110 if (first_arg_without_in_chrg
!= NULL_TREE
)
3111 first_arg_without_in_chrg
= NULL_TREE
;
3112 else if (return_type
&& strict
== DEDUCE_CALL
)
3113 /* We're deducing for a call to the result of a template conversion
3114 function, so the args don't contain 'this'; leave them alone. */;
3116 ++skip_without_in_chrg
;
3119 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
3120 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
3121 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
3123 if (first_arg_without_in_chrg
!= NULL_TREE
)
3124 first_arg_without_in_chrg
= NULL_TREE
;
3126 ++skip_without_in_chrg
;
3129 if (len
< skip_without_in_chrg
)
3132 if (DECL_CONSTRUCTOR_P (tmpl
) && nargs
== 2
3133 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg
),
3134 TREE_TYPE ((*arglist
)[0])))
3136 /* 12.8/6 says, "A declaration of a constructor for a class X is
3137 ill-formed if its first parameter is of type (optionally cv-qualified)
3138 X and either there are no other parameters or else all other
3139 parameters have default arguments. A member function template is never
3140 instantiated to produce such a constructor signature."
3142 So if we're trying to copy an object of the containing class, don't
3143 consider a template constructor that has a first parameter type that
3144 is just a template parameter, as we would deduce a signature that we
3145 would then reject in the code below. */
3146 if (tree firstparm
= FUNCTION_FIRST_USER_PARMTYPE (tmpl
))
3148 firstparm
= TREE_VALUE (firstparm
);
3149 if (PACK_EXPANSION_P (firstparm
))
3150 firstparm
= PACK_EXPANSION_PATTERN (firstparm
);
3151 if (TREE_CODE (firstparm
) == TEMPLATE_TYPE_PARM
)
3153 gcc_assert (!explicit_targs
);
3154 reason
= invalid_copy_with_fn_template_rejection ();
3160 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
3161 + (len
- skip_without_in_chrg
));
3162 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
3164 if (first_arg_without_in_chrg
!= NULL_TREE
)
3166 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
3169 for (ix
= skip_without_in_chrg
;
3170 vec_safe_iterate (arglist
, ix
, &arg
);
3173 args_without_in_chrg
[ia
] = arg
;
3176 gcc_assert (ia
== nargs_without_in_chrg
);
3178 errs
= errorcount
+sorrycount
;
3179 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
3180 args_without_in_chrg
,
3181 nargs_without_in_chrg
,
3182 return_type
, strict
, flags
, false,
3183 complain
& tf_decltype
);
3185 if (fn
== error_mark_node
)
3187 /* Don't repeat unification later if it already resulted in errors. */
3188 if (errorcount
+sorrycount
== errs
)
3189 reason
= template_unification_rejection (tmpl
, explicit_targs
,
3190 targs
, args_without_in_chrg
,
3191 nargs_without_in_chrg
,
3192 return_type
, strict
, flags
);
3194 reason
= template_unification_error_rejection ();
3198 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
3200 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
3201 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
3204 /* We're trying to produce a constructor with a prohibited signature,
3205 as discussed above; handle here any cases we didn't catch then,
3207 reason
= invalid_copy_with_fn_template_rejection ();
3212 if (obj
!= NULL_TREE
)
3213 /* Aha, this is a conversion function. */
3214 cand
= add_conv_candidate (candidates
, fn
, obj
, arglist
,
3215 access_path
, conversion_path
, complain
);
3217 cand
= add_function_candidate (candidates
, fn
, ctype
,
3218 first_arg
, arglist
, access_path
,
3219 conversion_path
, flags
, complain
);
3220 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
3221 /* This situation can occur if a member template of a template
3222 class is specialized. Then, instantiate_template might return
3223 an instantiation of the specialization, in which case the
3224 DECL_TI_TEMPLATE field will point at the original
3225 specialization. For example:
3227 template <class T> struct S { template <class U> void f(U);
3228 template <> void f(int) {}; };
3232 Here, TMPL will be template <class U> S<double>::f(U).
3233 And, instantiate template will give us the specialization
3234 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3235 for this will point at template <class T> template <> S<T>::f(int),
3236 so that we can find the definition. For the purposes of
3237 overload resolution, however, we want the original TMPL. */
3238 cand
->template_decl
= build_template_info (tmpl
, targs
);
3240 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3241 cand
->explicit_targs
= explicit_targs
;
3245 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3246 access_path
, conversion_path
, 0, reason
, flags
);
3250 static struct z_candidate
*
3251 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3252 tree explicit_targs
, tree first_arg
,
3253 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3254 tree access_path
, tree conversion_path
, int flags
,
3255 unification_kind_t strict
, tsubst_flags_t complain
)
3258 add_template_candidate_real (candidates
, tmpl
, ctype
,
3259 explicit_targs
, first_arg
, arglist
,
3260 return_type
, access_path
, conversion_path
,
3261 flags
, NULL_TREE
, strict
, complain
);
3264 /* Create an overload candidate for the conversion function template TMPL,
3265 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3266 pointer-to-function which will in turn be called with the argument list
3267 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3268 passed on to implicit_conversion. */
3270 static struct z_candidate
*
3271 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3273 const vec
<tree
, va_gc
> *arglist
,
3274 tree return_type
, tree access_path
,
3275 tree conversion_path
, tsubst_flags_t complain
)
3277 /* Making this work broke PR 71117, so until the committee resolves core
3278 issue 2189, let's disable this candidate if there are any viable call
3280 if (any_strictly_viable (*candidates
))
3284 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3285 NULL_TREE
, arglist
, return_type
, access_path
,
3286 conversion_path
, 0, obj
, DEDUCE_CALL
,
3290 /* The CANDS are the set of candidates that were considered for
3291 overload resolution. Return the set of viable candidates, or CANDS
3292 if none are viable. If any of the candidates were viable, set
3293 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3294 considered viable only if it is strictly viable. */
3296 static struct z_candidate
*
3297 splice_viable (struct z_candidate
*cands
,
3301 struct z_candidate
*viable
;
3302 struct z_candidate
**last_viable
;
3303 struct z_candidate
**cand
;
3304 bool found_strictly_viable
= false;
3306 /* Be strict inside templates, since build_over_call won't actually
3307 do the conversions to get pedwarns. */
3308 if (processing_template_decl
)
3312 last_viable
= &viable
;
3313 *any_viable_p
= false;
3318 struct z_candidate
*c
= *cand
;
3320 && (c
->viable
== 1 || TREE_CODE (c
->fn
) == TEMPLATE_DECL
))
3322 /* Be strict in the presence of a viable candidate. Also if
3323 there are template candidates, so that we get deduction errors
3324 for them instead of silently preferring a bad conversion. */
3326 if (viable
&& !found_strictly_viable
)
3328 /* Put any spliced near matches back onto the main list so
3329 that we see them if there is no strict match. */
3330 *any_viable_p
= false;
3331 *last_viable
= cands
;
3334 last_viable
= &viable
;
3338 if (strict_p
? c
->viable
== 1 : c
->viable
)
3343 last_viable
= &c
->next
;
3344 *any_viable_p
= true;
3346 found_strictly_viable
= true;
3352 return viable
? viable
: cands
;
3356 any_strictly_viable (struct z_candidate
*cands
)
3358 for (; cands
; cands
= cands
->next
)
3359 if (cands
->viable
== 1)
3364 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3365 words, it is about to become the "this" pointer for a member
3366 function call. Take the address of the object. */
3369 build_this (tree obj
)
3371 /* In a template, we are only concerned about the type of the
3372 expression, so we can take a shortcut. */
3373 if (processing_template_decl
)
3374 return build_address (obj
);
3376 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3379 /* Returns true iff functions are equivalent. Equivalent functions are
3380 not '==' only if one is a function-local extern function or if
3381 both are extern "C". */
3384 equal_functions (tree fn1
, tree fn2
)
3386 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3388 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3390 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3391 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3392 return decls_match (fn1
, fn2
);
3396 /* Print information about a candidate being rejected due to INFO. */
3399 print_conversion_rejection (location_t loc
, struct conversion_info
*info
)
3401 tree from
= info
->from
;
3403 from
= lvalue_type (from
);
3404 if (info
->n_arg
== -1)
3406 /* Conversion of implicit `this' argument failed. */
3407 if (!TYPE_P (info
->from
))
3408 /* A bad conversion for 'this' must be discarding cv-quals. */
3409 inform (loc
, " passing %qT as %<this%> "
3410 "argument discards qualifiers",
3413 inform (loc
, " no known conversion for implicit "
3414 "%<this%> parameter from %qH to %qI",
3415 from
, info
->to_type
);
3417 else if (!TYPE_P (info
->from
))
3419 if (info
->n_arg
>= 0)
3420 inform (loc
, " conversion of argument %d would be ill-formed:",
3422 perform_implicit_conversion (info
->to_type
, info
->from
,
3423 tf_warning_or_error
);
3425 else if (info
->n_arg
== -2)
3426 /* Conversion of conversion function return value failed. */
3427 inform (loc
, " no known conversion from %qH to %qI",
3428 from
, info
->to_type
);
3430 inform (loc
, " no known conversion for argument %d from %qH to %qI",
3431 info
->n_arg
+ 1, from
, info
->to_type
);
3434 /* Print information about a candidate with WANT parameters and we found
3438 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3440 inform_n (loc
, want
,
3441 " candidate expects %d argument, %d provided",
3442 " candidate expects %d arguments, %d provided",
3446 /* Print information about one overload candidate CANDIDATE. MSGSTR
3447 is the text to print before the candidate itself.
3449 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3450 to have been run through gettext by the caller. This wart makes
3451 life simpler in print_z_candidates and for the translators. */
3454 print_z_candidate (location_t loc
, const char *msgstr
,
3455 struct z_candidate
*candidate
)
3457 const char *msg
= (msgstr
== NULL
3459 : ACONCAT ((msgstr
, " ", NULL
)));
3460 tree fn
= candidate
->fn
;
3461 if (flag_new_inheriting_ctors
)
3462 fn
= strip_inheriting_ctors (fn
);
3463 location_t cloc
= location_of (fn
);
3465 if (identifier_p (fn
))
3468 if (candidate
->num_convs
== 3)
3469 inform (cloc
, "%s%<%D(%T, %T, %T)%> <built-in>", msg
, fn
,
3470 candidate
->convs
[0]->type
,
3471 candidate
->convs
[1]->type
,
3472 candidate
->convs
[2]->type
);
3473 else if (candidate
->num_convs
== 2)
3474 inform (cloc
, "%s%<%D(%T, %T)%> <built-in>", msg
, fn
,
3475 candidate
->convs
[0]->type
,
3476 candidate
->convs
[1]->type
);
3478 inform (cloc
, "%s%<%D(%T)%> <built-in>", msg
, fn
,
3479 candidate
->convs
[0]->type
);
3481 else if (TYPE_P (fn
))
3482 inform (cloc
, "%s%qT <conversion>", msg
, fn
);
3483 else if (candidate
->viable
== -1)
3484 inform (cloc
, "%s%#qD <near match>", msg
, fn
);
3485 else if (DECL_DELETED_FN (fn
))
3486 inform (cloc
, "%s%#qD <deleted>", msg
, fn
);
3488 inform (cloc
, "%s%#qD", msg
, fn
);
3489 if (fn
!= candidate
->fn
)
3491 cloc
= location_of (candidate
->fn
);
3492 inform (cloc
, " inherited here");
3494 /* Give the user some information about why this candidate failed. */
3495 if (candidate
->reason
!= NULL
)
3497 struct rejection_reason
*r
= candidate
->reason
;
3502 print_arity_information (cloc
, r
->u
.arity
.actual
,
3503 r
->u
.arity
.expected
);
3505 case rr_arg_conversion
:
3506 print_conversion_rejection (cloc
, &r
->u
.conversion
);
3508 case rr_bad_arg_conversion
:
3509 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
);
3511 case rr_explicit_conversion
:
3512 inform (cloc
, " return type %qT of explicit conversion function "
3513 "cannot be converted to %qT with a qualification "
3514 "conversion", r
->u
.conversion
.from
,
3515 r
->u
.conversion
.to_type
);
3517 case rr_template_conversion
:
3518 inform (cloc
, " conversion from return type %qT of template "
3519 "conversion function specialization to %qT is not an "
3520 "exact match", r
->u
.conversion
.from
,
3521 r
->u
.conversion
.to_type
);
3523 case rr_template_unification
:
3524 /* We use template_unification_error_rejection if unification caused
3525 actual non-SFINAE errors, in which case we don't need to repeat
3527 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3529 inform (cloc
, " substitution of deduced template arguments "
3530 "resulted in errors seen above");
3533 /* Re-run template unification with diagnostics. */
3534 inform (cloc
, " template argument deduction/substitution failed:");
3535 fn_type_unification (r
->u
.template_unification
.tmpl
,
3536 r
->u
.template_unification
.explicit_targs
,
3538 (r
->u
.template_unification
.num_targs
)),
3539 r
->u
.template_unification
.args
,
3540 r
->u
.template_unification
.nargs
,
3541 r
->u
.template_unification
.return_type
,
3542 r
->u
.template_unification
.strict
,
3543 r
->u
.template_unification
.flags
,
3546 case rr_invalid_copy
:
3548 " a constructor taking a single argument of its own "
3549 "class type is invalid");
3551 case rr_constraint_failure
:
3553 tree tmpl
= r
->u
.template_instantiation
.tmpl
;
3554 tree args
= r
->u
.template_instantiation
.targs
;
3555 diagnose_constraints (cloc
, tmpl
, args
);
3558 case rr_inherited_ctor
:
3559 inform (cloc
, " an inherited constructor is not a candidate for "
3560 "initialization from an expression of the same or derived "
3565 /* This candidate didn't have any issues or we failed to
3566 handle a particular code. Either way... */
3573 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3575 struct z_candidate
*cand1
;
3576 struct z_candidate
**cand2
;
3581 /* Remove non-viable deleted candidates. */
3583 for (cand2
= &cand1
; *cand2
; )
3585 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3586 && !(*cand2
)->viable
3587 && DECL_DELETED_FN ((*cand2
)->fn
))
3588 *cand2
= (*cand2
)->next
;
3590 cand2
= &(*cand2
)->next
;
3592 /* ...if there are any non-deleted ones. */
3596 /* There may be duplicates in the set of candidates. We put off
3597 checking this condition as long as possible, since we have no way
3598 to eliminate duplicates from a set of functions in less than n^2
3599 time. Now we are about to emit an error message, so it is more
3600 permissible to go slowly. */
3601 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3603 tree fn
= cand1
->fn
;
3604 /* Skip builtin candidates and conversion functions. */
3607 cand2
= &cand1
->next
;
3610 if (DECL_P ((*cand2
)->fn
)
3611 && equal_functions (fn
, (*cand2
)->fn
))
3612 *cand2
= (*cand2
)->next
;
3614 cand2
= &(*cand2
)->next
;
3618 for (; candidates
; candidates
= candidates
->next
)
3619 print_z_candidate (loc
, "candidate:", candidates
);
3622 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3623 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3624 the result of the conversion function to convert it to the final
3625 desired type. Merge the two sequences into a single sequence,
3626 and return the merged sequence. */
3629 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3632 bool bad
= user_seq
->bad_p
;
3634 gcc_assert (user_seq
->kind
== ck_user
);
3636 /* Find the end of the second conversion sequence. */
3637 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3639 /* The entire sequence is a user-conversion sequence. */
3640 (*t
)->user_conv_p
= true;
3645 /* Replace the identity conversion with the user conversion
3652 /* Handle overload resolution for initializing an object of class type from
3653 an initializer list. First we look for a suitable constructor that
3654 takes a std::initializer_list; if we don't find one, we then look for a
3655 non-list constructor.
3657 Parameters are as for add_candidates, except that the arguments are in
3658 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3659 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3662 add_list_candidates (tree fns
, tree first_arg
,
3663 const vec
<tree
, va_gc
> *args
, tree totype
,
3664 tree explicit_targs
, bool template_only
,
3665 tree conversion_path
, tree access_path
,
3667 struct z_candidate
**candidates
,
3668 tsubst_flags_t complain
)
3670 gcc_assert (*candidates
== NULL
);
3672 /* We're looking for a ctor for list-initialization. */
3673 flags
|= LOOKUP_LIST_INIT_CTOR
;
3674 /* And we don't allow narrowing conversions. We also use this flag to
3675 avoid the copy constructor call for copy-list-initialization. */
3676 flags
|= LOOKUP_NO_NARROWING
;
3678 unsigned nart
= num_artificial_parms_for (OVL_FIRST (fns
)) - 1;
3679 tree init_list
= (*args
)[nart
];
3681 /* Always use the default constructor if the list is empty (DR 990). */
3682 if (CONSTRUCTOR_NELTS (init_list
) == 0
3683 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3685 /* If the class has a list ctor, try passing the list as a single
3686 argument first, but only consider list ctors. */
3687 else if (TYPE_HAS_LIST_CTOR (totype
))
3689 flags
|= LOOKUP_LIST_ONLY
;
3690 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3691 explicit_targs
, template_only
, conversion_path
,
3692 access_path
, flags
, candidates
, complain
);
3693 if (any_strictly_viable (*candidates
))
3697 /* Expand the CONSTRUCTOR into a new argument vec. */
3698 vec
<tree
, va_gc
> *new_args
;
3699 vec_alloc (new_args
, nart
+ CONSTRUCTOR_NELTS (init_list
));
3700 for (unsigned i
= 0; i
< nart
; ++i
)
3701 new_args
->quick_push ((*args
)[i
]);
3702 for (unsigned i
= 0; i
< CONSTRUCTOR_NELTS (init_list
); ++i
)
3703 new_args
->quick_push (CONSTRUCTOR_ELT (init_list
, i
)->value
);
3705 /* We aren't looking for list-ctors anymore. */
3706 flags
&= ~LOOKUP_LIST_ONLY
;
3707 /* We allow more user-defined conversions within an init-list. */
3708 flags
&= ~LOOKUP_NO_CONVERSION
;
3710 add_candidates (fns
, first_arg
, new_args
, NULL_TREE
,
3711 explicit_targs
, template_only
, conversion_path
,
3712 access_path
, flags
, candidates
, complain
);
3715 /* Returns the best overload candidate to perform the requested
3716 conversion. This function is used for three the overloading situations
3717 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3718 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3719 per [dcl.init.ref], so we ignore temporary bindings. */
3721 static struct z_candidate
*
3722 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3723 tsubst_flags_t complain
)
3725 struct z_candidate
*candidates
, *cand
;
3727 tree ctors
= NULL_TREE
;
3728 tree conv_fns
= NULL_TREE
;
3729 conversion
*conv
= NULL
;
3730 tree first_arg
= NULL_TREE
;
3731 vec
<tree
, va_gc
> *args
= NULL
;
3738 fromtype
= TREE_TYPE (expr
);
3740 /* We represent conversion within a hierarchy using RVALUE_CONV and
3741 BASE_CONV, as specified by [over.best.ics]; these become plain
3742 constructor calls, as specified in [dcl.init]. */
3743 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3744 || !DERIVED_FROM_P (totype
, fromtype
));
3746 if (CLASS_TYPE_P (totype
))
3747 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3748 creating a garbage BASELINK; constructors can't be inherited. */
3749 ctors
= get_class_binding (totype
, complete_ctor_identifier
);
3751 /* FIXME P0135 doesn't say what to do in C++17 about list-initialization from
3752 a single element. For now, let's handle constructors as before and also
3753 consider conversion operators from the element. */
3754 if (cxx_dialect
>= cxx17
3755 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
3756 && CONSTRUCTOR_NELTS (expr
) == 1)
3757 fromtype
= TREE_TYPE (CONSTRUCTOR_ELT (expr
, 0)->value
);
3759 if (MAYBE_CLASS_TYPE_P (fromtype
))
3761 tree to_nonref
= non_reference (totype
);
3762 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3763 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3764 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3766 /* [class.conv.fct] A conversion function is never used to
3767 convert a (possibly cv-qualified) object to the (possibly
3768 cv-qualified) same object type (or a reference to it), to a
3769 (possibly cv-qualified) base class of that type (or a
3770 reference to it)... */
3773 conv_fns
= lookup_conversions (fromtype
);
3777 flags
|= LOOKUP_NO_CONVERSION
;
3778 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3779 flags
|= LOOKUP_NO_NARROWING
;
3781 /* It's OK to bind a temporary for converting constructor arguments, but
3782 not in converting the return value of a conversion operator. */
3783 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
3784 | (flags
& LOOKUP_NO_NARROWING
));
3785 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3789 int ctorflags
= flags
;
3791 first_arg
= build_dummy_object (totype
);
3793 /* We should never try to call the abstract or base constructor
3795 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors
))
3796 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors
)));
3798 args
= make_tree_vector_single (expr
);
3799 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3801 /* List-initialization. */
3802 add_list_candidates (ctors
, first_arg
, args
, totype
, NULL_TREE
,
3803 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3804 ctorflags
, &candidates
, complain
);
3808 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3809 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3810 ctorflags
, &candidates
, complain
);
3813 for (cand
= candidates
; cand
; cand
= cand
->next
)
3815 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3817 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3818 set, then this is copy-initialization. In that case, "The
3819 result of the call is then used to direct-initialize the
3820 object that is the destination of the copy-initialization."
3823 We represent this in the conversion sequence with an
3824 rvalue conversion, which means a constructor call. */
3825 if (TREE_CODE (totype
) != REFERENCE_TYPE
3826 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3828 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3834 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3835 /* FIXME see above about C++17. */
3836 first_arg
= CONSTRUCTOR_ELT (expr
, 0)->value
;
3841 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3843 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3844 struct z_candidate
*old_candidates
;
3846 /* If we are called to convert to a reference type, we are trying to
3847 find a direct binding, so don't even consider temporaries. If
3848 we don't find a direct binding, the caller will try again to
3849 look for a temporary binding. */
3850 if (TREE_CODE (totype
) == REFERENCE_TYPE
)
3851 convflags
|= LOOKUP_NO_TEMP_BIND
;
3853 old_candidates
= candidates
;
3854 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
3856 conversion_path
, TYPE_BINFO (fromtype
),
3857 flags
, &candidates
, complain
);
3859 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
3861 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
3863 = implicit_conversion (totype
,
3866 /*c_cast_p=*/false, convflags
,
3869 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3870 copy-initialization. In that case, "The result of the
3871 call is then used to direct-initialize the object that is
3872 the destination of the copy-initialization." [dcl.init]
3874 We represent this in the conversion sequence with an
3875 rvalue conversion, which means a constructor call. But
3876 don't add a second rvalue conversion if there's already
3877 one there. Which there really shouldn't be, but it's
3878 harmless since we'd add it here anyway. */
3879 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
3880 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3881 ics
= build_conv (ck_rvalue
, totype
, ics
);
3883 cand
->second_conv
= ics
;
3888 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -2,
3891 else if (DECL_NONCONVERTING_P (cand
->fn
)
3892 && ics
->rank
> cr_exact
)
3894 /* 13.3.1.5: For direct-initialization, those explicit
3895 conversion functions that are not hidden within S and
3896 yield type T or a type that can be converted to type T
3897 with a qualification conversion (4.4) are also candidate
3899 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3900 I've raised this issue with the committee. --jason 9/2011 */
3902 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
3904 else if (cand
->viable
== 1 && ics
->bad_p
)
3908 = bad_arg_conversion_rejection (NULL_TREE
, -2,
3911 else if (primary_template_specialization_p (cand
->fn
)
3912 && ics
->rank
> cr_exact
)
3914 /* 13.3.3.1.2: If the user-defined conversion is specified by
3915 a specialization of a conversion function template, the
3916 second standard conversion sequence shall have exact match
3919 cand
->reason
= template_conversion_rejection (rettype
, totype
);
3924 candidates
= splice_viable (candidates
, false, &any_viable_p
);
3928 release_tree_vector (args
);
3932 cand
= tourney (candidates
, complain
);
3935 if (complain
& tf_error
)
3937 error ("conversion from %qH to %qI is ambiguous",
3939 print_z_candidates (location_of (expr
), candidates
);
3942 cand
= candidates
; /* any one will do */
3943 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
3944 cand
->second_conv
->user_conv_p
= true;
3945 if (!any_strictly_viable (candidates
))
3946 cand
->second_conv
->bad_p
= true;
3947 if (flags
& LOOKUP_ONLYCONVERTING
)
3948 cand
->second_conv
->need_temporary_p
= true;
3949 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3950 ambiguous conversion is no worse than another user-defined
3957 if (!DECL_CONSTRUCTOR_P (cand
->fn
))
3958 convtype
= non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)));
3959 else if (cand
->second_conv
->kind
== ck_rvalue
)
3960 /* DR 5: [in the first step of copy-initialization]...if the function
3961 is a constructor, the call initializes a temporary of the
3962 cv-unqualified version of the destination type. */
3963 convtype
= cv_unqualified (totype
);
3966 /* Build the user conversion sequence. */
3970 build_identity_conv (TREE_TYPE (expr
), expr
));
3972 if (cand
->viable
== -1)
3975 /* Remember that this was a list-initialization. */
3976 if (flags
& LOOKUP_NO_NARROWING
)
3977 conv
->check_narrowing
= true;
3979 /* Combine it with the second conversion sequence. */
3980 cand
->second_conv
= merge_conversion_sequences (conv
,
3986 /* Wrapper for above. */
3989 build_user_type_conversion (tree totype
, tree expr
, int flags
,
3990 tsubst_flags_t complain
)
3992 struct z_candidate
*cand
;
3995 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
3996 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
4000 if (cand
->second_conv
->kind
== ck_ambig
)
4001 ret
= error_mark_node
;
4004 expr
= convert_like (cand
->second_conv
, expr
, complain
);
4005 ret
= convert_from_reference (expr
);
4011 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4015 /* Subroutine of convert_nontype_argument.
4017 EXPR is an expression used in a context that requires a converted
4018 constant-expression, such as a template non-type parameter. Do any
4019 necessary conversions (that are permitted for converted
4020 constant-expressions) to convert it to the desired type.
4022 If conversion is successful, returns the converted expression;
4023 otherwise, returns error_mark_node. */
4026 build_converted_constant_expr (tree type
, tree expr
, tsubst_flags_t complain
)
4031 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
4033 if (error_operand_p (expr
))
4034 return error_mark_node
;
4036 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4037 p
= conversion_obstack_alloc (0);
4039 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
4041 LOOKUP_IMPLICIT
, complain
);
4043 /* A converted constant expression of type T is an expression, implicitly
4044 converted to type T, where the converted expression is a constant
4045 expression and the implicit conversion sequence contains only
4047 * user-defined conversions,
4048 * lvalue-to-rvalue conversions (7.1),
4049 * array-to-pointer conversions (7.2),
4050 * function-to-pointer conversions (7.3),
4051 * qualification conversions (7.5),
4052 * integral promotions (7.6),
4053 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4054 * null pointer conversions (7.11) from std::nullptr_t,
4055 * null member pointer conversions (7.12) from std::nullptr_t, and
4056 * function pointer conversions (7.13),
4058 and where the reference binding (if any) binds directly. */
4060 for (conversion
*c
= conv
;
4061 conv
&& c
->kind
!= ck_identity
;
4062 c
= next_conversion (c
))
4066 /* A conversion function is OK. If it isn't constexpr, we'll
4067 complain later that the argument isn't constant. */
4069 /* The lvalue-to-rvalue conversion is OK. */
4071 /* Array-to-pointer and function-to-pointer. */
4073 /* Function pointer conversions. */
4075 /* Qualification conversions. */
4080 if (c
->need_temporary_p
)
4082 if (complain
& tf_error
)
4083 error_at (loc
, "initializing %qH with %qI in converted "
4084 "constant expression does not bind directly",
4085 type
, next_conversion (c
)->type
);
4094 t
= next_conversion (c
)->type
;
4095 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
)
4096 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
4097 /* Integral promotion or conversion. */
4099 if (NULLPTR_TYPE_P (t
))
4100 /* Conversion from nullptr to pointer or pointer-to-member. */
4103 if (complain
& tf_error
)
4104 error_at (loc
, "conversion from %qH to %qI in a "
4105 "converted constant expression", t
, type
);
4114 /* Avoid confusing convert_nontype_argument by introducing
4115 a redundant conversion to the same reference type. */
4116 if (conv
&& conv
->kind
== ck_ref_bind
4117 && REFERENCE_REF_P (expr
))
4119 tree ref
= TREE_OPERAND (expr
, 0);
4120 if (same_type_p (type
, TREE_TYPE (ref
)))
4125 expr
= convert_like (conv
, expr
, complain
);
4127 expr
= error_mark_node
;
4129 /* Free all the conversions we allocated. */
4130 obstack_free (&conversion_obstack
, p
);
4135 /* Do any initial processing on the arguments to a function call. */
4137 static vec
<tree
, va_gc
> *
4138 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
4143 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
4145 if (error_operand_p (arg
))
4147 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
4149 if (complain
& tf_error
)
4150 error ("invalid use of void expression");
4153 else if (invalid_nonstatic_memfn_p (input_location
, arg
, complain
))
4159 /* Perform overload resolution on FN, which is called with the ARGS.
4161 Return the candidate function selected by overload resolution, or
4162 NULL if the event that overload resolution failed. In the case
4163 that overload resolution fails, *CANDIDATES will be the set of
4164 candidates considered, and ANY_VIABLE_P will be set to true or
4165 false to indicate whether or not any of the candidates were
4168 The ARGS should already have gone through RESOLVE_ARGS before this
4169 function is called. */
4171 static struct z_candidate
*
4172 perform_overload_resolution (tree fn
,
4173 const vec
<tree
, va_gc
> *args
,
4174 struct z_candidate
**candidates
,
4175 bool *any_viable_p
, tsubst_flags_t complain
)
4177 struct z_candidate
*cand
;
4178 tree explicit_targs
;
4181 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4183 explicit_targs
= NULL_TREE
;
4187 *any_viable_p
= true;
4190 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4191 || TREE_CODE (fn
) == TEMPLATE_DECL
4192 || TREE_CODE (fn
) == OVERLOAD
4193 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
4195 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4197 explicit_targs
= TREE_OPERAND (fn
, 1);
4198 fn
= TREE_OPERAND (fn
, 0);
4202 /* Add the various candidate functions. */
4203 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
4204 explicit_targs
, template_only
,
4205 /*conversion_path=*/NULL_TREE
,
4206 /*access_path=*/NULL_TREE
,
4208 candidates
, complain
);
4210 *candidates
= splice_viable (*candidates
, false, any_viable_p
);
4212 cand
= tourney (*candidates
, complain
);
4216 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4220 /* Print an error message about being unable to build a call to FN with
4221 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4222 be located; CANDIDATES is a possibly empty list of such
4226 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
,
4227 struct z_candidate
*candidates
)
4229 tree targs
= NULL_TREE
;
4230 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4232 targs
= TREE_OPERAND (fn
, 1);
4233 fn
= TREE_OPERAND (fn
, 0);
4235 tree name
= OVL_NAME (fn
);
4236 location_t loc
= location_of (name
);
4238 name
= lookup_template_function (name
, targs
);
4240 if (!any_strictly_viable (candidates
))
4241 error_at (loc
, "no matching function for call to %<%D(%A)%>",
4242 name
, build_tree_list_vec (args
));
4244 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
4245 name
, build_tree_list_vec (args
));
4247 print_z_candidates (loc
, candidates
);
4250 /* Return an expression for a call to FN (a namespace-scope function,
4251 or a static member function) with the ARGS. This may change
4255 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
,
4256 tsubst_flags_t complain
)
4258 struct z_candidate
*candidates
, *cand
;
4263 if (args
!= NULL
&& *args
!= NULL
)
4265 *args
= resolve_args (*args
, complain
);
4267 return error_mark_node
;
4271 tm_malloc_replacement (fn
);
4273 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4274 p
= conversion_obstack_alloc (0);
4276 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
4281 if (complain
& tf_error
)
4283 // If there is a single (non-viable) function candidate,
4284 // let the error be diagnosed by cp_build_function_call_vec.
4285 if (!any_viable_p
&& candidates
&& ! candidates
->next
4286 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
4287 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
4289 // Otherwise, emit notes for non-viable candidates.
4290 print_error_for_call_failure (fn
, *args
, candidates
);
4292 result
= error_mark_node
;
4296 int flags
= LOOKUP_NORMAL
;
4297 /* If fn is template_id_expr, the call has explicit template arguments
4298 (e.g. func<int>(5)), communicate this info to build_over_call
4299 through flags so that later we can use it to decide whether to warn
4300 about peculiar null pointer conversion. */
4301 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4303 /* If overload resolution selects a specialization of a
4304 function concept for non-dependent template arguments,
4305 the expression is true if the constraints are satisfied
4306 and false otherwise.
4308 NOTE: This is an extension of Concepts Lite TS that
4309 allows constraints to be used in expressions. */
4310 if (flag_concepts
&& !processing_template_decl
)
4312 tree tmpl
= DECL_TI_TEMPLATE (cand
->fn
);
4313 tree targs
= DECL_TI_ARGS (cand
->fn
);
4314 tree decl
= DECL_TEMPLATE_RESULT (tmpl
);
4315 if (DECL_DECLARED_CONCEPT_P (decl
))
4316 return evaluate_function_concept (decl
, targs
);
4319 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4322 result
= build_over_call (cand
, flags
, complain
);
4325 /* Free all the conversions we allocated. */
4326 obstack_free (&conversion_obstack
, p
);
4331 /* Build a call to a global operator new. FNNAME is the name of the
4332 operator (either "operator new" or "operator new[]") and ARGS are
4333 the arguments provided. This may change ARGS. *SIZE points to the
4334 total number of bytes required by the allocation, and is updated if
4335 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4336 be used. If this function determines that no cookie should be
4337 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4338 is not NULL_TREE, it is evaluated before calculating the final
4339 array size, and if it fails, the array size is replaced with
4340 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4341 is non-NULL, it will be set, upon return, to the allocation
4345 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4346 tree
*size
, tree
*cookie_size
,
4347 tree align_arg
, tree size_check
,
4348 tree
*fn
, tsubst_flags_t complain
)
4350 tree original_size
= *size
;
4352 struct z_candidate
*candidates
;
4353 struct z_candidate
*cand
= NULL
;
4358 /* Set to (size_t)-1 if the size check fails. */
4359 if (size_check
!= NULL_TREE
)
4361 tree errval
= TYPE_MAX_VALUE (sizetype
);
4362 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4363 errval
= throw_bad_array_new_length ();
4364 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4365 original_size
, errval
);
4367 vec_safe_insert (*args
, 0, *size
);
4368 *args
= resolve_args (*args
, complain
);
4370 return error_mark_node
;
4376 If this lookup fails to find the name, or if the allocated type
4377 is not a class type, the allocation function's name is looked
4378 up in the global scope.
4380 we disregard block-scope declarations of "operator new". */
4381 fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/false, 0, 0);
4382 fns
= lookup_arg_dependent (fnname
, fns
, *args
);
4386 vec
<tree
, va_gc
>* align_args
4387 = vec_copy_and_insert (*args
, align_arg
, 1);
4388 cand
= perform_overload_resolution (fns
, align_args
, &candidates
,
4389 &any_viable_p
, tf_none
);
4392 /* If no aligned allocation function matches, try again without the
4396 /* Figure out what function is being called. */
4398 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
4401 /* If no suitable function could be found, issue an error message
4405 if (complain
& tf_error
)
4406 print_error_for_call_failure (fns
, *args
, candidates
);
4407 return error_mark_node
;
4410 /* If a cookie is required, add some extra space. Whether
4411 or not a cookie is required cannot be determined until
4412 after we know which function was called. */
4415 bool use_cookie
= true;
4418 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4419 /* Skip the size_t parameter. */
4420 arg_types
= TREE_CHAIN (arg_types
);
4421 /* Check the remaining parameters (if any). */
4423 && TREE_CHAIN (arg_types
) == void_list_node
4424 && same_type_p (TREE_VALUE (arg_types
),
4427 /* If we need a cookie, adjust the number of bytes allocated. */
4430 /* Update the total size. */
4431 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4434 /* Set to (size_t)-1 if the size check fails. */
4435 gcc_assert (size_check
!= NULL_TREE
);
4436 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4437 *size
, TYPE_MAX_VALUE (sizetype
));
4439 /* Update the argument list to reflect the adjusted size. */
4440 (**args
)[0] = *size
;
4443 *cookie_size
= NULL_TREE
;
4446 /* Tell our caller which function we decided to call. */
4450 /* Build the CALL_EXPR. */
4451 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4454 /* Build a new call to operator(). This may change ARGS. */
4457 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4459 struct z_candidate
*candidates
= 0, *cand
;
4460 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4462 tree result
= NULL_TREE
;
4465 obj
= mark_lvalue_use (obj
);
4467 if (error_operand_p (obj
))
4468 return error_mark_node
;
4470 tree type
= TREE_TYPE (obj
);
4472 obj
= prep_operand (obj
);
4474 if (TYPE_PTRMEMFUNC_P (type
))
4476 if (complain
& tf_error
)
4477 /* It's no good looking for an overloaded operator() on a
4478 pointer-to-member-function. */
4479 error ("pointer-to-member function %qE cannot be called without "
4480 "an object; consider using %<.*%> or %<->*%>", obj
);
4481 return error_mark_node
;
4484 if (TYPE_BINFO (type
))
4486 fns
= lookup_fnfields (TYPE_BINFO (type
), call_op_identifier
, 1);
4487 if (fns
== error_mark_node
)
4488 return error_mark_node
;
4493 if (args
!= NULL
&& *args
!= NULL
)
4495 *args
= resolve_args (*args
, complain
);
4497 return error_mark_node
;
4500 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4501 p
= conversion_obstack_alloc (0);
4505 first_mem_arg
= obj
;
4507 add_candidates (BASELINK_FUNCTIONS (fns
),
4508 first_mem_arg
, *args
, NULL_TREE
,
4510 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4511 LOOKUP_NORMAL
, &candidates
, complain
);
4514 convs
= lookup_conversions (type
);
4516 for (; convs
; convs
= TREE_CHAIN (convs
))
4518 tree totype
= TREE_TYPE (convs
);
4520 if (TYPE_PTRFN_P (totype
)
4521 || TYPE_REFFN_P (totype
)
4522 || (TREE_CODE (totype
) == REFERENCE_TYPE
4523 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4524 for (ovl_iterator
iter (TREE_VALUE (convs
)); iter
; ++iter
)
4528 if (DECL_NONCONVERTING_P (fn
))
4531 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4532 add_template_conv_candidate
4533 (&candidates
, fn
, obj
, *args
, totype
,
4534 /*access_path=*/NULL_TREE
,
4535 /*conversion_path=*/NULL_TREE
, complain
);
4537 add_conv_candidate (&candidates
, fn
, obj
,
4538 *args
, /*conversion_path=*/NULL_TREE
,
4539 /*access_path=*/NULL_TREE
, complain
);
4543 /* Be strict here because if we choose a bad conversion candidate, the
4544 errors we get won't mention the call context. */
4545 candidates
= splice_viable (candidates
, true, &any_viable_p
);
4548 if (complain
& tf_error
)
4550 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4551 build_tree_list_vec (*args
));
4552 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4554 result
= error_mark_node
;
4558 cand
= tourney (candidates
, complain
);
4561 if (complain
& tf_error
)
4563 error ("call of %<(%T) (%A)%> is ambiguous",
4564 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4565 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4567 result
= error_mark_node
;
4569 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4570 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
)
4571 && DECL_OVERLOADED_OPERATOR_IS (cand
->fn
, CALL_EXPR
))
4572 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4575 if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
4576 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
,
4580 gcc_checking_assert (TYPE_P (cand
->fn
));
4581 obj
= convert_like (cand
->convs
[0], obj
, complain
);
4583 obj
= convert_from_reference (obj
);
4584 result
= cp_build_function_call_vec (obj
, args
, complain
);
4588 /* Free all the conversions we allocated. */
4589 obstack_free (&conversion_obstack
, p
);
4594 /* Wrapper for above. */
4597 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4600 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4601 ret
= build_op_call_1 (obj
, args
, complain
);
4602 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4606 /* Called by op_error to prepare format strings suitable for the error
4607 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4608 and a suffix (controlled by NTYPES). */
4611 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4615 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4616 : G_("no match for "), errmsg
, NULL
);
4619 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4620 else if (ntypes
== 2)
4621 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4623 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4629 op_error (location_t loc
, enum tree_code code
, enum tree_code code2
,
4630 tree arg1
, tree arg2
, tree arg3
, bool match
)
4632 bool assop
= code
== MODIFY_EXPR
;
4633 const char *opname
= OVL_OP_INFO (assop
, assop
? code2
: code
)->name
;
4638 if (flag_diagnostics_show_caret
)
4639 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4641 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4643 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4644 "in %<%E ? %E : %E%>"), 3, match
),
4646 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4649 case POSTINCREMENT_EXPR
:
4650 case POSTDECREMENT_EXPR
:
4651 if (flag_diagnostics_show_caret
)
4652 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4653 opname
, TREE_TYPE (arg1
));
4655 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4657 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4661 if (flag_diagnostics_show_caret
)
4662 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4663 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4665 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4667 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4672 if (flag_diagnostics_show_caret
)
4673 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4674 opname
, TREE_TYPE (arg1
));
4676 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4677 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4682 if (flag_diagnostics_show_caret
)
4683 error_at (loc
, op_error_string (G_("%<operator%s%>"), 2, match
),
4684 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4686 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4688 opname
, arg1
, opname
, arg2
,
4689 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4691 if (flag_diagnostics_show_caret
)
4692 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4693 opname
, TREE_TYPE (arg1
));
4695 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4697 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4702 /* Return the implicit conversion sequence that could be used to
4703 convert E1 to E2 in [expr.cond]. */
4706 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4708 tree t1
= non_reference (TREE_TYPE (e1
));
4709 tree t2
= non_reference (TREE_TYPE (e2
));
4715 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4716 implicitly converted (clause _conv_) to the type "lvalue reference to
4717 T2", subject to the constraint that in the conversion the
4718 reference must bind directly (_dcl.init.ref_) to an lvalue.
4720 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4721 implicitly converted to the type "rvalue reference to T2", subject to
4722 the constraint that the reference must bind directly. */
4725 tree rtype
= cp_build_reference_type (t2
, !lvalue_p (e2
));
4726 conv
= implicit_conversion (rtype
,
4730 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4731 |LOOKUP_ONLYCONVERTING
,
4733 if (conv
&& !conv
->bad_p
)
4737 /* If E2 is a prvalue or if neither of the conversions above can be done
4738 and at least one of the operands has (possibly cv-qualified) class
4740 if (!CLASS_TYPE_P (t1
) && !CLASS_TYPE_P (t2
))
4745 If E1 and E2 have class type, and the underlying class types are
4746 the same or one is a base class of the other: E1 can be converted
4747 to match E2 if the class of T2 is the same type as, or a base
4748 class of, the class of T1, and the cv-qualification of T2 is the
4749 same cv-qualification as, or a greater cv-qualification than, the
4750 cv-qualification of T1. If the conversion is applied, E1 is
4751 changed to an rvalue of type T2 that still refers to the original
4752 source class object (or the appropriate subobject thereof). */
4753 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4754 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4756 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4758 conv
= build_identity_conv (t1
, e1
);
4759 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4760 TYPE_MAIN_VARIANT (t2
)))
4761 conv
= build_conv (ck_base
, t2
, conv
);
4763 conv
= build_conv (ck_rvalue
, t2
, conv
);
4772 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4773 converted to the type that expression E2 would have if E2 were
4774 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4775 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4776 LOOKUP_IMPLICIT
, complain
);
4779 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4780 arguments to the conditional expression. */
4783 build_conditional_expr_1 (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
4784 tsubst_flags_t complain
)
4788 tree result
= NULL_TREE
;
4789 tree result_type
= NULL_TREE
;
4790 bool is_glvalue
= true;
4791 struct z_candidate
*candidates
= 0;
4792 struct z_candidate
*cand
;
4794 tree orig_arg2
, orig_arg3
;
4796 /* As a G++ extension, the second argument to the conditional can be
4797 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4798 c'.) If the second operand is omitted, make sure it is
4799 calculated only once. */
4802 if (complain
& tf_error
)
4803 pedwarn (loc
, OPT_Wpedantic
,
4804 "ISO C++ forbids omitting the middle term of a ?: expression");
4806 if ((complain
& tf_warning
) && !truth_value_p (TREE_CODE (arg1
)))
4807 warn_for_omitted_condop (loc
, arg1
);
4809 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4810 if (lvalue_p (arg1
))
4811 arg2
= arg1
= cp_stabilize_reference (arg1
);
4813 arg2
= arg1
= cp_save_expr (arg1
);
4816 /* If something has already gone wrong, just pass that fact up the
4818 if (error_operand_p (arg1
)
4819 || error_operand_p (arg2
)
4820 || error_operand_p (arg3
))
4821 return error_mark_node
;
4826 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
4828 tree arg1_type
= TREE_TYPE (arg1
);
4830 /* If arg1 is another cond_expr choosing between -1 and 0,
4831 then we can use its comparison. It may help to avoid
4832 additional comparison, produce more accurate diagnostics
4833 and enables folding. */
4834 if (TREE_CODE (arg1
) == VEC_COND_EXPR
4835 && integer_minus_onep (TREE_OPERAND (arg1
, 1))
4836 && integer_zerop (TREE_OPERAND (arg1
, 2)))
4837 arg1
= TREE_OPERAND (arg1
, 0);
4839 arg1
= force_rvalue (arg1
, complain
);
4840 arg2
= force_rvalue (arg2
, complain
);
4841 arg3
= force_rvalue (arg3
, complain
);
4843 /* force_rvalue can return error_mark on valid arguments. */
4844 if (error_operand_p (arg1
)
4845 || error_operand_p (arg2
)
4846 || error_operand_p (arg3
))
4847 return error_mark_node
;
4849 arg2_type
= TREE_TYPE (arg2
);
4850 arg3_type
= TREE_TYPE (arg3
);
4852 if (!VECTOR_TYPE_P (arg2_type
)
4853 && !VECTOR_TYPE_P (arg3_type
))
4855 /* Rely on the error messages of the scalar version. */
4856 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
4857 orig_arg2
, orig_arg3
, complain
);
4858 if (scal
== error_mark_node
)
4859 return error_mark_node
;
4860 tree stype
= TREE_TYPE (scal
);
4861 tree ctype
= TREE_TYPE (arg1_type
);
4862 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
4863 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
4865 if (complain
& tf_error
)
4866 error_at (loc
, "inferred scalar type %qT is not an integer or "
4867 "floating point type of the same size as %qT", stype
,
4868 COMPARISON_CLASS_P (arg1
)
4869 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
4871 return error_mark_node
;
4874 tree vtype
= build_opaque_vector_type (stype
,
4875 TYPE_VECTOR_SUBPARTS (arg1_type
));
4876 /* We could pass complain & tf_warning to unsafe_conversion_p,
4877 but the warnings (like Wsign-conversion) have already been
4878 given by the scalar build_conditional_expr_1. We still check
4879 unsafe_conversion_p to forbid truncating long long -> float. */
4880 if (unsafe_conversion_p (loc
, stype
, arg2
, NULL_TREE
, false))
4882 if (complain
& tf_error
)
4883 error_at (loc
, "conversion of scalar %qH to vector %qI "
4884 "involves truncation", arg2_type
, vtype
);
4885 return error_mark_node
;
4887 if (unsafe_conversion_p (loc
, stype
, arg3
, NULL_TREE
, false))
4889 if (complain
& tf_error
)
4890 error_at (loc
, "conversion of scalar %qH to vector %qI "
4891 "involves truncation", arg3_type
, vtype
);
4892 return error_mark_node
;
4895 arg2
= cp_convert (stype
, arg2
, complain
);
4896 arg2
= save_expr (arg2
);
4897 arg2
= build_vector_from_val (vtype
, arg2
);
4899 arg3
= cp_convert (stype
, arg3
, complain
);
4900 arg3
= save_expr (arg3
);
4901 arg3
= build_vector_from_val (vtype
, arg3
);
4905 if (VECTOR_TYPE_P (arg2_type
) != VECTOR_TYPE_P (arg3_type
))
4907 enum stv_conv convert_flag
=
4908 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
4909 complain
& tf_error
);
4911 switch (convert_flag
)
4914 return error_mark_node
;
4917 arg2
= save_expr (arg2
);
4918 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
4919 arg2
= build_vector_from_val (arg3_type
, arg2
);
4920 arg2_type
= TREE_TYPE (arg2
);
4925 arg3
= save_expr (arg3
);
4926 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
4927 arg3
= build_vector_from_val (arg2_type
, arg3
);
4928 arg3_type
= TREE_TYPE (arg3
);
4936 if (!same_type_p (arg2_type
, arg3_type
)
4937 || maybe_ne (TYPE_VECTOR_SUBPARTS (arg1_type
),
4938 TYPE_VECTOR_SUBPARTS (arg2_type
))
4939 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
4941 if (complain
& tf_error
)
4943 "incompatible vector types in conditional expression: "
4944 "%qT, %qT and %qT", TREE_TYPE (arg1
),
4945 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
4946 return error_mark_node
;
4949 if (!COMPARISON_CLASS_P (arg1
))
4951 tree cmp_type
= build_same_sized_truth_vector_type (arg1_type
);
4952 arg1
= build2 (NE_EXPR
, cmp_type
, arg1
, build_zero_cst (arg1_type
));
4954 return build3_loc (loc
, VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
4959 The first expression is implicitly converted to bool (clause
4961 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
4963 if (error_operand_p (arg1
))
4964 return error_mark_node
;
4968 If either the second or the third operand has type (possibly
4969 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4970 array-to-pointer (_conv.array_), and function-to-pointer
4971 (_conv.func_) standard conversions are performed on the second
4972 and third operands. */
4973 arg2_type
= unlowered_expr_type (arg2
);
4974 arg3_type
= unlowered_expr_type (arg3
);
4975 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
4977 /* Do the conversions. We don't these for `void' type arguments
4978 since it can't have any effect and since decay_conversion
4979 does not handle that case gracefully. */
4980 if (!VOID_TYPE_P (arg2_type
))
4981 arg2
= decay_conversion (arg2
, complain
);
4982 if (!VOID_TYPE_P (arg3_type
))
4983 arg3
= decay_conversion (arg3
, complain
);
4984 arg2_type
= TREE_TYPE (arg2
);
4985 arg3_type
= TREE_TYPE (arg3
);
4989 One of the following shall hold:
4991 --The second or the third operand (but not both) is a
4992 throw-expression (_except.throw_); the result is of the
4993 type of the other and is an rvalue.
4995 --Both the second and the third operands have type void; the
4996 result is of type void and is an rvalue.
4998 We must avoid calling force_rvalue for expressions of type
4999 "void" because it will complain that their value is being
5001 if (TREE_CODE (arg2
) == THROW_EXPR
5002 && TREE_CODE (arg3
) != THROW_EXPR
)
5004 if (!VOID_TYPE_P (arg3_type
))
5006 arg3
= force_rvalue (arg3
, complain
);
5007 if (arg3
== error_mark_node
)
5008 return error_mark_node
;
5010 arg3_type
= TREE_TYPE (arg3
);
5011 result_type
= arg3_type
;
5013 else if (TREE_CODE (arg2
) != THROW_EXPR
5014 && TREE_CODE (arg3
) == THROW_EXPR
)
5016 if (!VOID_TYPE_P (arg2_type
))
5018 arg2
= force_rvalue (arg2
, complain
);
5019 if (arg2
== error_mark_node
)
5020 return error_mark_node
;
5022 arg2_type
= TREE_TYPE (arg2
);
5023 result_type
= arg2_type
;
5025 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
5026 result_type
= void_type_node
;
5029 if (complain
& tf_error
)
5031 if (VOID_TYPE_P (arg2_type
))
5032 error_at (EXPR_LOC_OR_LOC (arg3
, loc
),
5033 "second operand to the conditional operator "
5034 "is of type %<void%>, but the third operand is "
5035 "neither a throw-expression nor of type %<void%>");
5037 error_at (EXPR_LOC_OR_LOC (arg2
, loc
),
5038 "third operand to the conditional operator "
5039 "is of type %<void%>, but the second operand is "
5040 "neither a throw-expression nor of type %<void%>");
5042 return error_mark_node
;
5046 goto valid_operands
;
5050 Otherwise, if the second and third operand have different types,
5051 and either has (possibly cv-qualified) class type, or if both are
5052 glvalues of the same value category and the same type except for
5053 cv-qualification, an attempt is made to convert each of those operands
5054 to the type of the other. */
5055 else if (!same_type_p (arg2_type
, arg3_type
)
5056 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)
5057 || (same_type_ignoring_top_level_qualifiers_p (arg2_type
,
5059 && glvalue_p (arg2
) && glvalue_p (arg3
)
5060 && lvalue_p (arg2
) == lvalue_p (arg3
))))
5064 bool converted
= false;
5066 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5067 p
= conversion_obstack_alloc (0);
5069 conv2
= conditional_conversion (arg2
, arg3
, complain
);
5070 conv3
= conditional_conversion (arg3
, arg2
, complain
);
5074 If both can be converted, or one can be converted but the
5075 conversion is ambiguous, the program is ill-formed. If
5076 neither can be converted, the operands are left unchanged and
5077 further checking is performed as described below. If exactly
5078 one conversion is possible, that conversion is applied to the
5079 chosen operand and the converted operand is used in place of
5080 the original operand for the remainder of this section. */
5081 if ((conv2
&& !conv2
->bad_p
5082 && conv3
&& !conv3
->bad_p
)
5083 || (conv2
&& conv2
->kind
== ck_ambig
)
5084 || (conv3
&& conv3
->kind
== ck_ambig
))
5086 if (complain
& tf_error
)
5088 error_at (loc
, "operands to ?: have different types %qT and %qT",
5089 arg2_type
, arg3_type
);
5090 if (conv2
&& !conv2
->bad_p
&& conv3
&& !conv3
->bad_p
)
5091 inform (loc
, " and each type can be converted to the other");
5092 else if (conv2
&& conv2
->kind
== ck_ambig
)
5093 convert_like (conv2
, arg2
, complain
);
5095 convert_like (conv3
, arg3
, complain
);
5097 result
= error_mark_node
;
5099 else if (conv2
&& !conv2
->bad_p
)
5101 arg2
= convert_like (conv2
, arg2
, complain
);
5102 arg2
= convert_from_reference (arg2
);
5103 arg2_type
= TREE_TYPE (arg2
);
5104 /* Even if CONV2 is a valid conversion, the result of the
5105 conversion may be invalid. For example, if ARG3 has type
5106 "volatile X", and X does not have a copy constructor
5107 accepting a "volatile X&", then even if ARG2 can be
5108 converted to X, the conversion will fail. */
5109 if (error_operand_p (arg2
))
5110 result
= error_mark_node
;
5113 else if (conv3
&& !conv3
->bad_p
)
5115 arg3
= convert_like (conv3
, arg3
, complain
);
5116 arg3
= convert_from_reference (arg3
);
5117 arg3_type
= TREE_TYPE (arg3
);
5118 if (error_operand_p (arg3
))
5119 result
= error_mark_node
;
5123 /* Free all the conversions we allocated. */
5124 obstack_free (&conversion_obstack
, p
);
5129 /* If, after the conversion, both operands have class type,
5130 treat the cv-qualification of both operands as if it were the
5131 union of the cv-qualification of the operands.
5133 The standard is not clear about what to do in this
5134 circumstance. For example, if the first operand has type
5135 "const X" and the second operand has a user-defined
5136 conversion to "volatile X", what is the type of the second
5137 operand after this step? Making it be "const X" (matching
5138 the first operand) seems wrong, as that discards the
5139 qualification without actually performing a copy. Leaving it
5140 as "volatile X" seems wrong as that will result in the
5141 conditional expression failing altogether, even though,
5142 according to this step, the one operand could be converted to
5143 the type of the other. */
5145 && CLASS_TYPE_P (arg2_type
)
5146 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
5147 arg2_type
= arg3_type
=
5148 cp_build_qualified_type (arg2_type
,
5149 cp_type_quals (arg2_type
)
5150 | cp_type_quals (arg3_type
));
5155 If the second and third operands are glvalues of the same value
5156 category and have the same type, the result is of that type and
5158 if (((lvalue_p (arg2
) && lvalue_p (arg3
))
5159 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
5160 && same_type_p (arg2_type
, arg3_type
))
5162 result_type
= arg2_type
;
5163 if (processing_template_decl
)
5164 /* Let lvalue_kind know this was a glvalue. */
5165 result_type
= cp_build_reference_type (result_type
, xvalue_p (arg2
));
5167 arg2
= mark_lvalue_use (arg2
);
5168 arg3
= mark_lvalue_use (arg3
);
5169 goto valid_operands
;
5174 Otherwise, the result is an rvalue. If the second and third
5175 operand do not have the same type, and either has (possibly
5176 cv-qualified) class type, overload resolution is used to
5177 determine the conversions (if any) to be applied to the operands
5178 (_over.match.oper_, _over.built_). */
5180 if (!same_type_p (arg2_type
, arg3_type
)
5181 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
5187 /* Rearrange the arguments so that add_builtin_candidate only has
5188 to know about two args. In build_builtin_candidate, the
5189 arguments are unscrambled. */
5193 add_builtin_candidates (&candidates
,
5196 ovl_op_identifier (false, COND_EXPR
),
5198 LOOKUP_NORMAL
, complain
);
5202 If the overload resolution fails, the program is
5204 candidates
= splice_viable (candidates
, false, &any_viable_p
);
5207 if (complain
& tf_error
)
5208 error_at (loc
, "operands to ?: have different types %qT and %qT",
5209 arg2_type
, arg3_type
);
5210 return error_mark_node
;
5212 cand
= tourney (candidates
, complain
);
5215 if (complain
& tf_error
)
5217 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
5218 print_z_candidates (loc
, candidates
);
5220 return error_mark_node
;
5225 Otherwise, the conversions thus determined are applied, and
5226 the converted operands are used in place of the original
5227 operands for the remainder of this section. */
5228 conv
= cand
->convs
[0];
5229 arg1
= convert_like (conv
, arg1
, complain
);
5230 conv
= cand
->convs
[1];
5231 arg2
= convert_like (conv
, arg2
, complain
);
5232 arg2_type
= TREE_TYPE (arg2
);
5233 conv
= cand
->convs
[2];
5234 arg3
= convert_like (conv
, arg3
, complain
);
5235 arg3_type
= TREE_TYPE (arg3
);
5240 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5241 and function-to-pointer (_conv.func_) standard conversions are
5242 performed on the second and third operands.
5244 We need to force the lvalue-to-rvalue conversion here for class types,
5245 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5246 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5249 arg2
= force_rvalue (arg2
, complain
);
5250 if (!CLASS_TYPE_P (arg2_type
))
5251 arg2_type
= TREE_TYPE (arg2
);
5253 arg3
= force_rvalue (arg3
, complain
);
5254 if (!CLASS_TYPE_P (arg3_type
))
5255 arg3_type
= TREE_TYPE (arg3
);
5257 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5258 return error_mark_node
;
5262 After those conversions, one of the following shall hold:
5264 --The second and third operands have the same type; the result is of
5266 if (same_type_p (arg2_type
, arg3_type
))
5267 result_type
= arg2_type
;
5270 --The second and third operands have arithmetic or enumeration
5271 type; the usual arithmetic conversions are performed to bring
5272 them to a common type, and the result is of that type. */
5273 else if ((ARITHMETIC_TYPE_P (arg2_type
)
5274 || UNSCOPED_ENUM_P (arg2_type
))
5275 && (ARITHMETIC_TYPE_P (arg3_type
)
5276 || UNSCOPED_ENUM_P (arg3_type
)))
5278 /* In this case, there is always a common type. */
5279 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
5281 if (complain
& tf_warning
)
5282 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
5283 "implicit conversion from %qH to %qI to "
5284 "match other result of conditional",
5287 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5288 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
5290 if (TREE_CODE (orig_arg2
) == CONST_DECL
5291 && TREE_CODE (orig_arg3
) == CONST_DECL
5292 && DECL_CONTEXT (orig_arg2
) == DECL_CONTEXT (orig_arg3
))
5293 /* Two enumerators from the same enumeration can have different
5294 types when the enumeration is still being defined. */;
5295 else if (complain
& tf_warning
)
5296 warning_at (loc
, OPT_Wenum_compare
, "enumeral mismatch in "
5297 "conditional expression: %qT vs %qT",
5298 arg2_type
, arg3_type
);
5300 else if (extra_warnings
5301 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5302 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
5303 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
5304 && !same_type_p (arg2_type
,
5305 type_promotes_to (arg3_type
)))))
5307 if (complain
& tf_warning
)
5308 warning_at (loc
, OPT_Wextra
, "enumeral and non-enumeral type in "
5309 "conditional expression");
5312 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5313 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5317 --The second and third operands have pointer type, or one has
5318 pointer type and the other is a null pointer constant; pointer
5319 conversions (_conv.ptr_) and qualification conversions
5320 (_conv.qual_) are performed to bring them to their composite
5321 pointer type (_expr.rel_). The result is of the composite
5324 --The second and third operands have pointer to member type, or
5325 one has pointer to member type and the other is a null pointer
5326 constant; pointer to member conversions (_conv.mem_) and
5327 qualification conversions (_conv.qual_) are performed to bring
5328 them to a common type, whose cv-qualification shall match the
5329 cv-qualification of either the second or the third operand.
5330 The result is of the common type. */
5331 else if ((null_ptr_cst_p (arg2
)
5332 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
5333 || (null_ptr_cst_p (arg3
)
5334 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
5335 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
5336 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
5337 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
5339 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
5340 arg3
, CPO_CONDITIONAL_EXPR
,
5342 if (result_type
== error_mark_node
)
5343 return error_mark_node
;
5344 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5345 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5350 if (complain
& tf_error
)
5351 error_at (loc
, "operands to ?: have different types %qT and %qT",
5352 arg2_type
, arg3_type
);
5353 return error_mark_node
;
5356 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5357 return error_mark_node
;
5360 result
= build3_loc (loc
, COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
5362 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5363 warn here, because the COND_EXPR will be turned into ARG2. */
5364 if (warn_duplicated_branches
5365 && (complain
& tf_warning
)
5366 && (arg2
== arg3
|| operand_equal_p (arg2
, arg3
, 0)))
5367 warning_at (EXPR_LOCATION (result
), OPT_Wduplicated_branches
,
5368 "this condition has identical branches");
5370 /* We can't use result_type below, as fold might have returned a
5375 /* Expand both sides into the same slot, hopefully the target of
5376 the ?: expression. We used to check for TARGET_EXPRs here,
5377 but now we sometimes wrap them in NOP_EXPRs so the test would
5379 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5380 result
= get_target_expr_sfinae (result
, complain
);
5381 /* If this expression is an rvalue, but might be mistaken for an
5382 lvalue, we must add a NON_LVALUE_EXPR. */
5383 result
= rvalue (result
);
5386 result
= force_paren_expr (result
);
5391 /* Wrapper for above. */
5394 build_conditional_expr (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
5395 tsubst_flags_t complain
)
5398 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5399 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5400 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5404 /* OPERAND is an operand to an expression. Perform necessary steps
5405 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5409 prep_operand (tree operand
)
5413 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5414 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5415 /* Make sure the template type is instantiated now. */
5416 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5422 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5423 OVERLOAD) to the CANDIDATES, returning an updated list of
5424 CANDIDATES. The ARGS are the arguments provided to the call;
5425 if FIRST_ARG is non-null it is the implicit object argument,
5426 otherwise the first element of ARGS is used if needed. The
5427 EXPLICIT_TARGS are explicit template arguments provided.
5428 TEMPLATE_ONLY is true if only template functions should be
5429 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5430 add_function_candidate. */
5433 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5435 tree explicit_targs
, bool template_only
,
5436 tree conversion_path
, tree access_path
,
5438 struct z_candidate
**candidates
,
5439 tsubst_flags_t complain
)
5442 const vec
<tree
, va_gc
> *non_static_args
;
5443 bool check_list_ctor
= false;
5444 bool check_converting
= false;
5445 unification_kind_t strict
;
5450 /* Precalculate special handling of constructors and conversion ops. */
5451 tree fn
= OVL_FIRST (fns
);
5452 if (DECL_CONV_FN_P (fn
))
5454 check_list_ctor
= false;
5455 check_converting
= (flags
& LOOKUP_ONLYCONVERTING
) != 0;
5456 if (flags
& LOOKUP_NO_CONVERSION
)
5457 /* We're doing return_type(x). */
5458 strict
= DEDUCE_CONV
;
5460 /* We're doing x.operator return_type(). */
5461 strict
= DEDUCE_EXACT
;
5462 /* [over.match.funcs] For conversion functions, the function
5463 is considered to be a member of the class of the implicit
5464 object argument for the purpose of defining the type of
5465 the implicit object parameter. */
5466 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5470 if (DECL_CONSTRUCTOR_P (fn
))
5472 check_list_ctor
= (flags
& LOOKUP_LIST_ONLY
) != 0;
5473 /* For list-initialization we consider explicit constructors
5474 and complain if one is chosen. */
5476 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5477 == LOOKUP_ONLYCONVERTING
);
5479 strict
= DEDUCE_CALL
;
5480 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5484 non_static_args
= args
;
5486 /* Delay creating the implicit this parameter until it is needed. */
5487 non_static_args
= NULL
;
5489 for (lkp_iterator
iter (fns
); iter
; ++iter
)
5493 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5495 if (check_list_ctor
&& !is_list_ctor (fn
))
5498 tree fn_first_arg
= NULL_TREE
;
5499 const vec
<tree
, va_gc
> *fn_args
= args
;
5501 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5503 /* Figure out where the object arg comes from. If this
5504 function is a non-static member and we didn't get an
5505 implicit object argument, move it out of args. */
5506 if (first_arg
== NULL_TREE
)
5510 vec
<tree
, va_gc
> *tempvec
;
5511 vec_alloc (tempvec
, args
->length () - 1);
5512 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5513 tempvec
->quick_push (arg
);
5514 non_static_args
= tempvec
;
5515 first_arg
= (*args
)[0];
5518 fn_first_arg
= first_arg
;
5519 fn_args
= non_static_args
;
5522 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5523 add_template_candidate (candidates
,
5535 else if (!template_only
)
5536 add_function_candidate (candidates
,
5548 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5549 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5552 op_is_ordered (tree_code code
)
5558 return (flag_strong_eval_order
> 1 ? -1 : 0);
5562 return (flag_strong_eval_order
> 1 ? 1 : 0);
5565 // Not overloadable (yet).
5567 // Only one argument.
5574 return (flag_strong_eval_order
? 1 : 0);
5582 build_new_op_1 (location_t loc
, enum tree_code code
, int flags
, tree arg1
,
5583 tree arg2
, tree arg3
, tree
*overload
, tsubst_flags_t complain
)
5585 struct z_candidate
*candidates
= 0, *cand
;
5586 vec
<tree
, va_gc
> *arglist
;
5588 tree result
= NULL_TREE
;
5589 bool result_valid_p
= false;
5590 enum tree_code code2
= NOP_EXPR
;
5591 enum tree_code code_orig_arg1
= ERROR_MARK
;
5592 enum tree_code code_orig_arg2
= ERROR_MARK
;
5598 if (error_operand_p (arg1
)
5599 || error_operand_p (arg2
)
5600 || error_operand_p (arg3
))
5601 return error_mark_node
;
5603 bool ismodop
= code
== MODIFY_EXPR
;
5606 code2
= TREE_CODE (arg3
);
5609 tree fnname
= ovl_op_identifier (ismodop
, ismodop
? code2
: code
);
5611 arg1
= prep_operand (arg1
);
5613 bool memonly
= false;
5618 case VEC_DELETE_EXPR
:
5620 /* Use build_op_new_call and build_op_delete_call instead. */
5624 /* Use build_op_call instead. */
5627 case TRUTH_ORIF_EXPR
:
5628 case TRUTH_ANDIF_EXPR
:
5629 case TRUTH_AND_EXPR
:
5631 /* These are saved for the sake of warn_logical_operator. */
5632 code_orig_arg1
= TREE_CODE (arg1
);
5633 code_orig_arg2
= TREE_CODE (arg2
);
5641 /* These are saved for the sake of maybe_warn_bool_compare. */
5642 code_orig_arg1
= TREE_CODE (TREE_TYPE (arg1
));
5643 code_orig_arg2
= TREE_CODE (TREE_TYPE (arg2
));
5646 /* =, ->, [], () must be non-static member functions. */
5648 if (code2
!= NOP_EXPR
)
5660 arg2
= prep_operand (arg2
);
5661 arg3
= prep_operand (arg3
);
5663 if (code
== COND_EXPR
)
5664 /* Use build_conditional_expr instead. */
5666 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5667 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5670 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5671 arg2
= integer_zero_node
;
5673 vec_alloc (arglist
, 3);
5674 arglist
->quick_push (arg1
);
5675 if (arg2
!= NULL_TREE
)
5676 arglist
->quick_push (arg2
);
5677 if (arg3
!= NULL_TREE
)
5678 arglist
->quick_push (arg3
);
5680 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5681 p
= conversion_obstack_alloc (0);
5683 /* Add namespace-scope operators to the list of functions to
5687 tree fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/true, 0, 0);
5688 fns
= lookup_arg_dependent (fnname
, fns
, arglist
);
5689 add_candidates (fns
, NULL_TREE
, arglist
, NULL_TREE
,
5690 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5691 flags
, &candidates
, complain
);
5696 args
[2] = NULL_TREE
;
5698 /* Add class-member operators to the candidate set. */
5699 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5703 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5704 if (fns
== error_mark_node
)
5706 result
= error_mark_node
;
5707 goto user_defined_result_ready
;
5710 add_candidates (BASELINK_FUNCTIONS (fns
),
5711 NULL_TREE
, arglist
, NULL_TREE
,
5713 BASELINK_BINFO (fns
),
5714 BASELINK_ACCESS_BINFO (fns
),
5715 flags
, &candidates
, complain
);
5717 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5718 only non-member functions that have type T1 or reference to
5719 cv-qualified-opt T1 for the first argument, if the first argument
5720 has an enumeration type, or T2 or reference to cv-qualified-opt
5721 T2 for the second argument, if the second argument has an
5722 enumeration type. Filter out those that don't match. */
5723 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5725 struct z_candidate
**candp
, **next
;
5727 for (candp
= &candidates
; *candp
; candp
= next
)
5729 tree parmlist
, parmtype
;
5730 int i
, nargs
= (arg2
? 2 : 1);
5735 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5737 for (i
= 0; i
< nargs
; ++i
)
5739 parmtype
= TREE_VALUE (parmlist
);
5741 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
5742 parmtype
= TREE_TYPE (parmtype
);
5743 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5744 && (same_type_ignoring_top_level_qualifiers_p
5745 (TREE_TYPE (args
[i
]), parmtype
)))
5748 parmlist
= TREE_CHAIN (parmlist
);
5751 /* No argument has an appropriate type, so remove this
5752 candidate function from the list. */
5755 *candp
= cand
->next
;
5761 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5768 /* For these, the built-in candidates set is empty
5769 [over.match.oper]/3. We don't want non-strict matches
5770 because exact matches are always possible with built-in
5771 operators. The built-in candidate set for COMPONENT_REF
5772 would be empty too, but since there are no such built-in
5773 operators, we accept non-strict matches for them. */
5782 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5787 case POSTINCREMENT_EXPR
:
5788 case POSTDECREMENT_EXPR
:
5789 /* Don't try anything fancy if we're not allowed to produce
5791 if (!(complain
& tf_error
))
5792 return error_mark_node
;
5794 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5795 distinguish between prefix and postfix ++ and
5796 operator++() was used for both, so we allow this with
5800 const char *msg
= (flag_permissive
)
5801 ? G_("no %<%D(int)%> declared for postfix %qs,"
5802 " trying prefix operator instead")
5803 : G_("no %<%D(int)%> declared for postfix %qs");
5804 permerror (loc
, msg
, fnname
, OVL_OP_INFO (false, code
)->name
);
5807 if (!flag_permissive
)
5808 return error_mark_node
;
5810 if (code
== POSTINCREMENT_EXPR
)
5811 code
= PREINCREMENT_EXPR
;
5813 code
= PREDECREMENT_EXPR
;
5814 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5815 NULL_TREE
, overload
, complain
);
5818 /* The caller will deal with these. */
5823 result_valid_p
= true;
5827 if (complain
& tf_error
)
5829 /* If one of the arguments of the operator represents
5830 an invalid use of member function pointer, try to report
5831 a meaningful error ... */
5832 if (invalid_nonstatic_memfn_p (loc
, arg1
, tf_error
)
5833 || invalid_nonstatic_memfn_p (loc
, arg2
, tf_error
)
5834 || invalid_nonstatic_memfn_p (loc
, arg3
, tf_error
))
5835 /* We displayed the error message. */;
5838 /* ... Otherwise, report the more generic
5839 "no matching operator found" error */
5840 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
5841 print_z_candidates (loc
, candidates
);
5844 result
= error_mark_node
;
5850 cand
= tourney (candidates
, complain
);
5853 if (complain
& tf_error
)
5855 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
5856 print_z_candidates (loc
, candidates
);
5858 result
= error_mark_node
;
5860 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
5863 *overload
= cand
->fn
;
5865 if (resolve_args (arglist
, complain
) == NULL
)
5866 result
= error_mark_node
;
5868 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5870 if (trivial_fn_p (cand
->fn
))
5871 /* There won't be a CALL_EXPR. */;
5872 else if (result
&& result
!= error_mark_node
)
5874 tree call
= extract_call_expr (result
);
5875 CALL_EXPR_OPERATOR_SYNTAX (call
) = true;
5877 if (processing_template_decl
&& DECL_HIDDEN_FRIEND_P (cand
->fn
))
5878 /* This prevents build_new_function_call from discarding this
5879 function during instantiation of the enclosing template. */
5880 KOENIG_LOOKUP_P (call
) = 1;
5882 /* Specify evaluation order as per P0145R2. */
5883 CALL_EXPR_ORDERED_ARGS (call
) = false;
5884 switch (op_is_ordered (code
))
5887 CALL_EXPR_REVERSE_ARGS (call
) = true;
5891 CALL_EXPR_ORDERED_ARGS (call
) = true;
5901 /* Give any warnings we noticed during overload resolution. */
5902 if (cand
->warnings
&& (complain
& tf_warning
))
5904 struct candidate_warning
*w
;
5905 for (w
= cand
->warnings
; w
; w
= w
->next
)
5906 joust (cand
, w
->loser
, 1, complain
);
5909 /* Check for comparison of different enum types. */
5918 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
5919 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
5920 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
5921 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
5922 && (complain
& tf_warning
))
5924 warning (OPT_Wenum_compare
,
5925 "comparison between %q#T and %q#T",
5926 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
5933 /* We need to strip any leading REF_BIND so that bitfields
5934 don't cause errors. This should not remove any important
5935 conversions, because builtins don't apply to class
5936 objects directly. */
5937 conv
= cand
->convs
[0];
5938 if (conv
->kind
== ck_ref_bind
)
5939 conv
= next_conversion (conv
);
5940 arg1
= convert_like (conv
, arg1
, complain
);
5944 conv
= cand
->convs
[1];
5945 if (conv
->kind
== ck_ref_bind
)
5946 conv
= next_conversion (conv
);
5948 arg2
= decay_conversion (arg2
, complain
);
5950 /* We need to call warn_logical_operator before
5951 converting arg2 to a boolean_type, but after
5952 decaying an enumerator to its value. */
5953 if (complain
& tf_warning
)
5954 warn_logical_operator (loc
, code
, boolean_type_node
,
5955 code_orig_arg1
, arg1
,
5956 code_orig_arg2
, arg2
);
5958 arg2
= convert_like (conv
, arg2
, complain
);
5962 conv
= cand
->convs
[2];
5963 if (conv
->kind
== ck_ref_bind
)
5964 conv
= next_conversion (conv
);
5965 arg3
= convert_like (conv
, arg3
, complain
);
5971 user_defined_result_ready
:
5973 /* Free all the conversions we allocated. */
5974 obstack_free (&conversion_obstack
, p
);
5976 if (result
|| result_valid_p
)
5983 return cp_build_modify_expr (loc
, arg1
, code2
, arg2
, complain
);
5986 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
5988 case TRUTH_ANDIF_EXPR
:
5989 case TRUTH_ORIF_EXPR
:
5990 case TRUTH_AND_EXPR
:
5992 if (complain
& tf_warning
)
5993 warn_logical_operator (loc
, code
, boolean_type_node
,
5994 code_orig_arg1
, arg1
,
5995 code_orig_arg2
, arg2
);
6003 if ((complain
& tf_warning
)
6004 && ((code_orig_arg1
== BOOLEAN_TYPE
)
6005 ^ (code_orig_arg2
== BOOLEAN_TYPE
)))
6006 maybe_warn_bool_compare (loc
, code
, arg1
, arg2
);
6007 if (complain
& tf_warning
&& warn_tautological_compare
)
6008 warn_tautological_cmp (loc
, code
, arg1
, arg2
);
6013 case TRUNC_DIV_EXPR
:
6018 case TRUNC_MOD_EXPR
:
6022 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
6024 case UNARY_PLUS_EXPR
:
6027 case TRUTH_NOT_EXPR
:
6028 case PREINCREMENT_EXPR
:
6029 case POSTINCREMENT_EXPR
:
6030 case PREDECREMENT_EXPR
:
6031 case POSTDECREMENT_EXPR
:
6035 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
6038 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
6041 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
6045 /* The caller will deal with these. */
6057 /* Wrapper for above. */
6060 build_new_op (location_t loc
, enum tree_code code
, int flags
,
6061 tree arg1
, tree arg2
, tree arg3
,
6062 tree
*overload
, tsubst_flags_t complain
)
6065 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
6066 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
6067 overload
, complain
);
6068 timevar_cond_stop (TV_OVERLOAD
, subtime
);
6072 /* CALL was returned by some call-building function; extract the actual
6073 CALL_EXPR from any bits that have been tacked on, e.g. by
6074 convert_from_reference. */
6077 extract_call_expr (tree call
)
6079 while (TREE_CODE (call
) == COMPOUND_EXPR
)
6080 call
= TREE_OPERAND (call
, 1);
6081 if (REFERENCE_REF_P (call
))
6082 call
= TREE_OPERAND (call
, 0);
6083 if (TREE_CODE (call
) == TARGET_EXPR
)
6084 call
= TARGET_EXPR_INITIAL (call
);
6085 gcc_assert (TREE_CODE (call
) == CALL_EXPR
6086 || TREE_CODE (call
) == AGGR_INIT_EXPR
6087 || call
== error_mark_node
);
6091 /* Returns true if FN has two parameters, of which the second has type
6095 second_parm_is_size_t (tree fn
)
6097 tree t
= FUNCTION_ARG_CHAIN (fn
);
6098 if (!t
|| !same_type_p (TREE_VALUE (t
), size_type_node
))
6101 if (t
== void_list_node
)
6103 if (aligned_new_threshold
&& t
6104 && same_type_p (TREE_VALUE (t
), align_type_node
)
6105 && TREE_CHAIN (t
) == void_list_node
)
6110 /* True if T, an allocation function, has std::align_val_t as its second
6114 aligned_allocation_fn_p (tree t
)
6116 if (!aligned_new_threshold
)
6119 tree a
= FUNCTION_ARG_CHAIN (t
);
6120 return (a
&& same_type_p (TREE_VALUE (a
), align_type_node
));
6123 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6124 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6125 std::align_val_t. */
6128 aligned_deallocation_fn_p (tree t
)
6130 if (!aligned_new_threshold
)
6133 /* A template instance is never a usual deallocation function,
6134 regardless of its signature. */
6135 if (TREE_CODE (t
) == TEMPLATE_DECL
6136 || primary_template_specialization_p (t
))
6139 tree a
= FUNCTION_ARG_CHAIN (t
);
6140 if (same_type_p (TREE_VALUE (a
), align_type_node
)
6141 && TREE_CHAIN (a
) == void_list_node
)
6143 if (!same_type_p (TREE_VALUE (a
), size_type_node
))
6146 if (a
&& same_type_p (TREE_VALUE (a
), align_type_node
)
6147 && TREE_CHAIN (a
) == void_list_node
)
6152 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6153 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6156 usual_deallocation_fn_p (tree t
)
6158 /* A template instance is never a usual deallocation function,
6159 regardless of its signature. */
6160 if (TREE_CODE (t
) == TEMPLATE_DECL
6161 || primary_template_specialization_p (t
))
6164 /* If a class T has a member deallocation function named operator delete
6165 with exactly one parameter, then that function is a usual
6166 (non-placement) deallocation function. If class T does not declare
6167 such an operator delete but does declare a member deallocation
6168 function named operator delete with exactly two parameters, the second
6169 of which has type std::size_t (18.2), then this function is a usual
6170 deallocation function. */
6171 bool global
= DECL_NAMESPACE_SCOPE_P (t
);
6172 tree chain
= FUNCTION_ARG_CHAIN (t
);
6175 if (chain
== void_list_node
6176 || ((!global
|| flag_sized_deallocation
)
6177 && second_parm_is_size_t (t
)))
6179 if (aligned_deallocation_fn_p (t
))
6184 /* Build a call to operator delete. This has to be handled very specially,
6185 because the restrictions on what signatures match are different from all
6186 other call instances. For a normal delete, only a delete taking (void *)
6187 or (void *, size_t) is accepted. For a placement delete, only an exact
6188 match with the placement new is accepted.
6190 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6191 ADDR is the pointer to be deleted.
6192 SIZE is the size of the memory block to be deleted.
6193 GLOBAL_P is true if the delete-expression should not consider
6194 class-specific delete operators.
6195 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6197 If this call to "operator delete" is being generated as part to
6198 deallocate memory allocated via a new-expression (as per [expr.new]
6199 which requires that if the initialization throws an exception then
6200 we call a deallocation function), then ALLOC_FN is the allocation
6204 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
6205 bool global_p
, tree placement
,
6206 tree alloc_fn
, tsubst_flags_t complain
)
6208 tree fn
= NULL_TREE
;
6209 tree fns
, fnname
, type
, t
;
6211 if (addr
== error_mark_node
)
6212 return error_mark_node
;
6214 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
6216 fnname
= ovl_op_identifier (false, code
);
6218 if (CLASS_TYPE_P (type
)
6219 && COMPLETE_TYPE_P (complete_type (type
))
6223 If the result of the lookup is ambiguous or inaccessible, or if
6224 the lookup selects a placement deallocation function, the
6225 program is ill-formed.
6227 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6229 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
6230 if (fns
== error_mark_node
)
6231 return error_mark_node
;
6236 if (fns
== NULL_TREE
)
6237 fns
= lookup_name_nonclass (fnname
);
6239 /* Strip const and volatile from addr. */
6240 addr
= cp_convert (ptr_type_node
, addr
, complain
);
6244 /* "A declaration of a placement deallocation function matches the
6245 declaration of a placement allocation function if it has the same
6246 number of parameters and, after parameter transformations (8.3.5),
6247 all parameter types except the first are identical."
6249 So we build up the function type we want and ask instantiate_type
6250 to get it for us. */
6251 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
6252 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
6253 t
= build_function_type (void_type_node
, t
);
6255 fn
= instantiate_type (t
, fns
, tf_none
);
6256 if (fn
== error_mark_node
)
6259 fn
= MAYBE_BASELINK_FUNCTIONS (fn
);
6261 /* "If the lookup finds the two-parameter form of a usual deallocation
6262 function (3.7.4.2) and that function, considered as a placement
6263 deallocation function, would have been selected as a match for the
6264 allocation function, the program is ill-formed." */
6265 if (second_parm_is_size_t (fn
))
6267 const char *const msg1
6268 = G_("exception cleanup for this placement new selects "
6269 "non-placement operator delete");
6270 const char *const msg2
6271 = G_("%qD is a usual (non-placement) deallocation "
6272 "function in C++14 (or with -fsized-deallocation)");
6274 /* But if the class has an operator delete (void *), then that is
6275 the usual deallocation function, so we shouldn't complain
6276 about using the operator delete (void *, size_t). */
6277 if (DECL_CLASS_SCOPE_P (fn
))
6278 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
));
6282 if (usual_deallocation_fn_p (elt
)
6283 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
6286 /* Before C++14 a two-parameter global deallocation function is
6287 always a placement deallocation function, but warn if
6289 else if (!flag_sized_deallocation
)
6291 if ((complain
& tf_warning
)
6292 && warning (OPT_Wc__14_compat
, msg1
))
6293 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6297 if (complain
& tf_warning_or_error
)
6299 if (permerror (input_location
, msg1
))
6301 /* Only mention C++14 for namespace-scope delete. */
6302 if (DECL_NAMESPACE_SCOPE_P (fn
))
6303 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6305 inform (DECL_SOURCE_LOCATION (fn
),
6306 "%qD is a usual (non-placement) deallocation "
6311 return error_mark_node
;
6316 /* "Any non-placement deallocation function matches a non-placement
6317 allocation function. If the lookup finds a single matching
6318 deallocation function, that function will be called; otherwise, no
6319 deallocation function will be called." */
6320 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
)); iter
; ++iter
)
6323 if (usual_deallocation_fn_p (elt
))
6331 /* -- If the type has new-extended alignment, a function with a
6332 parameter of type std::align_val_t is preferred; otherwise a
6333 function without such a parameter is preferred. If exactly one
6334 preferred function is found, that function is selected and the
6335 selection process terminates. If more than one preferred
6336 function is found, all non-preferred functions are eliminated
6337 from further consideration. */
6338 if (aligned_new_threshold
)
6340 bool want_align
= type_has_new_extended_alignment (type
);
6341 bool fn_align
= aligned_deallocation_fn_p (fn
);
6342 bool elt_align
= aligned_deallocation_fn_p (elt
);
6344 if (elt_align
!= fn_align
)
6346 if (want_align
== elt_align
)
6352 /* -- If the deallocation functions have class scope, the one
6353 without a parameter of type std::size_t is selected. */
6355 if (DECL_CLASS_SCOPE_P (fn
))
6358 /* -- If the type is complete and if, for the second alternative
6359 (delete array) only, the operand is a pointer to a class type
6360 with a non-trivial destructor or a (possibly multi-dimensional)
6361 array thereof, the function with a parameter of type std::size_t
6364 -- Otherwise, it is unspecified whether a deallocation function
6365 with a parameter of type std::size_t is selected. */
6368 want_size
= COMPLETE_TYPE_P (type
);
6369 if (code
== VEC_DELETE_EXPR
6370 && !TYPE_VEC_NEW_USES_COOKIE (type
))
6371 /* We need a cookie to determine the array size. */
6374 bool fn_size
= second_parm_is_size_t (fn
);
6375 bool elt_size
= second_parm_is_size_t (elt
);
6376 gcc_assert (fn_size
!= elt_size
);
6377 if (want_size
== elt_size
)
6382 /* If we have a matching function, call it. */
6385 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6387 /* If the FN is a member function, make sure that it is
6389 if (BASELINK_P (fns
))
6390 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
6393 /* Core issue 901: It's ok to new a type with deleted delete. */
6394 if (DECL_DELETED_FN (fn
) && alloc_fn
)
6399 /* The placement args might not be suitable for overload
6400 resolution at this point, so build the call directly. */
6401 int nargs
= call_expr_nargs (placement
);
6402 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
6405 for (i
= 1; i
< nargs
; i
++)
6406 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
6407 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
6408 return error_mark_node
;
6409 return build_cxx_call (fn
, nargs
, argarray
, complain
);
6414 vec
<tree
, va_gc
> *args
= make_tree_vector ();
6415 args
->quick_push (addr
);
6416 if (second_parm_is_size_t (fn
))
6417 args
->quick_push (size
);
6418 if (aligned_deallocation_fn_p (fn
))
6420 tree al
= build_int_cst (align_type_node
, TYPE_ALIGN_UNIT (type
));
6421 args
->quick_push (al
);
6423 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
6424 release_tree_vector (args
);
6431 If no unambiguous matching deallocation function can be found,
6432 propagating the exception does not cause the object's memory to
6436 if ((complain
& tf_warning
)
6438 warning (0, "no corresponding deallocation function for %qD",
6443 if (complain
& tf_error
)
6444 error ("no suitable %<operator %s%> for %qT",
6445 OVL_OP_INFO (false, code
)->name
, type
);
6446 return error_mark_node
;
6449 /* If the current scope isn't allowed to access DECL along
6450 BASETYPE_PATH, give an error. The most derived class in
6451 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6452 the declaration to use in the error diagnostic. */
6455 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
6456 tsubst_flags_t complain
, access_failure_info
*afi
)
6458 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
6460 if (flag_new_inheriting_ctors
6461 && DECL_INHERITED_CTOR (decl
))
6463 /* 7.3.3/18: The additional constructors are accessible if they would be
6464 accessible when used to construct an object of the corresponding base
6466 decl
= strip_inheriting_ctors (decl
);
6467 basetype_path
= lookup_base (basetype_path
, DECL_CONTEXT (decl
),
6468 ba_any
, NULL
, complain
);
6471 if (!accessible_p (basetype_path
, decl
, true))
6473 if (complain
& tf_error
)
6475 if (flag_new_inheriting_ctors
)
6476 diag_decl
= strip_inheriting_ctors (diag_decl
);
6477 if (TREE_PRIVATE (decl
))
6479 error ("%q#D is private within this context", diag_decl
);
6480 inform (DECL_SOURCE_LOCATION (diag_decl
),
6481 "declared private here");
6483 afi
->record_access_failure (basetype_path
, diag_decl
);
6485 else if (TREE_PROTECTED (decl
))
6487 error ("%q#D is protected within this context", diag_decl
);
6488 inform (DECL_SOURCE_LOCATION (diag_decl
),
6489 "declared protected here");
6491 afi
->record_access_failure (basetype_path
, diag_decl
);
6495 error ("%q#D is inaccessible within this context", diag_decl
);
6496 inform (DECL_SOURCE_LOCATION (diag_decl
), "declared here");
6498 afi
->record_access_failure (basetype_path
, diag_decl
);
6507 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6508 bitwise or of LOOKUP_* values. If any errors are warnings are
6509 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6510 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6514 build_temp (tree expr
, tree type
, int flags
,
6515 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
6518 vec
<tree
, va_gc
> *args
;
6520 *diagnostic_kind
= DK_UNSPECIFIED
;
6522 /* If the source is a packed field, calling the copy constructor will require
6523 binding the field to the reference parameter to the copy constructor, and
6524 we'll end up with an infinite loop. If we can use a bitwise copy, then
6526 if ((lvalue_kind (expr
) & clk_packed
)
6527 && CLASS_TYPE_P (TREE_TYPE (expr
))
6528 && !type_has_nontrivial_copy_init (TREE_TYPE (expr
)))
6529 return get_target_expr_sfinae (expr
, complain
);
6531 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
6532 args
= make_tree_vector_single (expr
);
6533 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6534 &args
, type
, flags
, complain
);
6535 release_tree_vector (args
);
6536 if (warningcount
+ werrorcount
> savew
)
6537 *diagnostic_kind
= DK_WARNING
;
6538 else if (errorcount
> savee
)
6539 *diagnostic_kind
= DK_ERROR
;
6543 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6544 EXPR is implicitly converted to type TOTYPE.
6545 FN and ARGNUM are used for diagnostics. */
6548 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
6550 /* Issue warnings about peculiar, but valid, uses of NULL. */
6551 if (null_node_p (expr
) && TREE_CODE (totype
) != BOOLEAN_TYPE
6552 && ARITHMETIC_TYPE_P (totype
))
6554 source_location loc
=
6555 expansion_point_location_if_in_system_header (input_location
);
6558 warning_at (loc
, OPT_Wconversion_null
,
6559 "passing NULL to non-pointer argument %P of %qD",
6562 warning_at (loc
, OPT_Wconversion_null
,
6563 "converting to non-pointer type %qT from NULL", totype
);
6566 /* Issue warnings if "false" is converted to a NULL pointer */
6567 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
6568 && TYPE_PTR_P (totype
))
6571 warning_at (input_location
, OPT_Wconversion_null
,
6572 "converting %<false%> to pointer type for argument %P "
6573 "of %qD", argnum
, fn
);
6575 warning_at (input_location
, OPT_Wconversion_null
,
6576 "converting %<false%> to pointer type %qT", totype
);
6580 /* We gave a diagnostic during a conversion. If this was in the second
6581 standard conversion sequence of a user-defined conversion sequence, say
6582 which user-defined conversion. */
6585 maybe_print_user_conv_context (conversion
*convs
)
6587 if (convs
->user_conv_p
)
6588 for (conversion
*t
= convs
; t
; t
= next_conversion (t
))
6589 if (t
->kind
== ck_user
)
6591 print_z_candidate (0, " after user-defined conversion:",
6597 /* Locate the parameter with the given index within FNDECL.
6598 ARGNUM is zero based, -1 indicates the `this' argument of a method.
6599 Return the location of the FNDECL itself if there are problems. */
6602 get_fndecl_argument_location (tree fndecl
, int argnum
)
6607 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6608 for (i
= 0, param
= FUNCTION_FIRST_USER_PARM (fndecl
);
6609 i
< argnum
&& param
;
6610 i
++, param
= TREE_CHAIN (param
))
6613 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6614 return the location of FNDECL. */
6616 return DECL_SOURCE_LOCATION (fndecl
);
6618 return DECL_SOURCE_LOCATION (param
);
6621 /* Perform the conversions in CONVS on the expression EXPR. FN and
6622 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6623 indicates the `this' argument of a method. INNER is nonzero when
6624 being called to continue a conversion chain. It is negative when a
6625 reference binding will be applied, positive otherwise. If
6626 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6627 conversions will be emitted if appropriate. If C_CAST_P is true,
6628 this conversion is coming from a C-style cast; in that case,
6629 conversions to inaccessible bases are permitted. */
6632 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
6633 bool issue_conversion_warnings
,
6634 bool c_cast_p
, tsubst_flags_t complain
)
6636 tree totype
= convs
->type
;
6637 diagnostic_t diag_kind
;
6639 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6641 if (convs
->bad_p
&& !(complain
& tf_error
))
6642 return error_mark_node
;
6645 && convs
->kind
!= ck_user
6646 && convs
->kind
!= ck_list
6647 && convs
->kind
!= ck_ambig
6648 && (convs
->kind
!= ck_ref_bind
6649 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
6650 && (convs
->kind
!= ck_rvalue
6651 || SCALAR_TYPE_P (totype
))
6652 && convs
->kind
!= ck_base
)
6654 bool complained
= false;
6655 conversion
*t
= convs
;
6657 /* Give a helpful error if this is bad because of excess braces. */
6658 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6659 && SCALAR_TYPE_P (totype
)
6660 && CONSTRUCTOR_NELTS (expr
) > 0
6661 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
6663 complained
= permerror (loc
, "too many braces around initializer "
6665 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6666 && CONSTRUCTOR_NELTS (expr
) == 1)
6667 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6670 /* Give a helpful error if this is bad because a conversion to bool
6671 from std::nullptr_t requires direct-initialization. */
6672 if (NULLPTR_TYPE_P (TREE_TYPE (expr
))
6673 && TREE_CODE (totype
) == BOOLEAN_TYPE
)
6674 complained
= permerror (loc
, "converting to %qH from %qI requires "
6675 "direct-initialization",
6676 totype
, TREE_TYPE (expr
));
6678 for (; t
; t
= next_conversion (t
))
6680 if (t
->kind
== ck_user
&& t
->cand
->reason
)
6682 complained
= permerror (loc
, "invalid user-defined conversion "
6683 "from %qH to %qI", TREE_TYPE (expr
),
6686 print_z_candidate (loc
, "candidate is:", t
->cand
);
6687 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6688 /*issue_conversion_warnings=*/false,
6691 if (convs
->kind
== ck_ref_bind
)
6692 expr
= convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
6693 LOOKUP_NORMAL
, NULL_TREE
,
6696 expr
= cp_convert (totype
, expr
, complain
);
6697 if (complained
&& fn
)
6698 inform (DECL_SOURCE_LOCATION (fn
),
6699 " initializing argument %P of %qD", argnum
, fn
);
6702 else if (t
->kind
== ck_user
|| !t
->bad_p
)
6704 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6705 /*issue_conversion_warnings=*/false,
6710 else if (t
->kind
== ck_ambig
)
6711 return convert_like_real (t
, expr
, fn
, argnum
,
6712 /*issue_conversion_warnings=*/false,
6715 else if (t
->kind
== ck_identity
)
6719 complained
= permerror (loc
, "invalid conversion from %qH to %qI",
6720 TREE_TYPE (expr
), totype
);
6721 if (complained
&& fn
)
6722 inform (get_fndecl_argument_location (fn
, argnum
),
6723 " initializing argument %P of %qD", argnum
, fn
);
6725 return cp_convert (totype
, expr
, complain
);
6728 if (issue_conversion_warnings
&& (complain
& tf_warning
))
6729 conversion_null_warnings (totype
, expr
, fn
, argnum
);
6731 switch (convs
->kind
)
6735 struct z_candidate
*cand
= convs
->cand
;
6738 /* We chose the surrogate function from add_conv_candidate, now we
6739 actually need to build the conversion. */
6740 cand
= build_user_type_conversion_1 (totype
, expr
,
6741 LOOKUP_NO_CONVERSION
, complain
);
6743 tree convfn
= cand
->fn
;
6745 /* When converting from an init list we consider explicit
6746 constructors, but actually trying to call one is an error. */
6747 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
6748 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
6749 /* Unless this is for direct-list-initialization. */
6750 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
)
6751 /* And in C++98 a default constructor can't be explicit. */
6752 && cxx_dialect
>= cxx11
)
6754 if (!(complain
& tf_error
))
6755 return error_mark_node
;
6756 location_t loc
= location_of (expr
);
6757 if (CONSTRUCTOR_NELTS (expr
) == 0
6758 && FUNCTION_FIRST_USER_PARMTYPE (convfn
) != void_list_node
)
6760 if (pedwarn (loc
, 0, "converting to %qT from initializer list "
6761 "would use explicit constructor %qD",
6763 inform (loc
, "in C++11 and above a default constructor "
6767 error ("converting to %qT from initializer list would use "
6768 "explicit constructor %qD", totype
, convfn
);
6771 /* If we're initializing from {}, it's value-initialization. */
6772 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6773 && CONSTRUCTOR_NELTS (expr
) == 0
6774 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
6776 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
6777 if (abstract_virtuals_error_sfinae (NULL_TREE
, totype
, complain
))
6778 return error_mark_node
;
6779 expr
= build_value_init (totype
, complain
);
6780 expr
= get_target_expr_sfinae (expr
, complain
);
6781 if (expr
!= error_mark_node
)
6783 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6784 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
6789 expr
= mark_rvalue_use (expr
);
6791 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
6793 expr
= build_over_call (cand
, LOOKUP_NORMAL
|LOOKUP_NO_CONVERSION
,
6796 /* If this is a constructor or a function returning an aggr type,
6797 we need to build up a TARGET_EXPR. */
6798 if (DECL_CONSTRUCTOR_P (convfn
))
6800 expr
= build_cplus_new (totype
, expr
, complain
);
6802 /* Remember that this was list-initialization. */
6803 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
6804 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6810 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
6812 int nelts
= CONSTRUCTOR_NELTS (expr
);
6814 expr
= build_value_init (totype
, complain
);
6815 else if (nelts
== 1)
6816 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6820 expr
= mark_use (expr
, /*rvalue_p=*/!convs
->rvaluedness_matches_p
,
6821 /*read_p=*/true, UNKNOWN_LOCATION
,
6822 /*reject_builtin=*/true);
6824 if (type_unknown_p (expr
))
6825 expr
= instantiate_type (totype
, expr
, complain
);
6826 if (expr
== null_node
6827 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
6828 /* If __null has been converted to an integer type, we do not want to
6829 continue to warn about uses of EXPR as an integer, rather than as a
6831 expr
= build_int_cst (totype
, 0);
6834 /* We leave bad_p off ck_ambig because overload resolution considers
6835 it valid, it just fails when we try to perform it. So we need to
6836 check complain here, too. */
6837 if (complain
& tf_error
)
6839 /* Call build_user_type_conversion again for the error. */
6840 int flags
= (convs
->need_temporary_p
6841 ? LOOKUP_IMPLICIT
: LOOKUP_NORMAL
);
6842 build_user_type_conversion (totype
, convs
->u
.expr
, flags
, complain
);
6843 gcc_assert (seen_error ());
6845 inform (DECL_SOURCE_LOCATION (fn
),
6846 " initializing argument %P of %qD", argnum
, fn
);
6848 return error_mark_node
;
6852 /* Conversion to std::initializer_list<T>. */
6853 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
6854 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
6855 unsigned len
= CONSTRUCTOR_NELTS (expr
);
6856 tree array
, val
, field
;
6857 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
6860 /* Convert all the elements. */
6861 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
6863 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
6864 false, false, complain
);
6865 if (sub
== error_mark_node
)
6867 if (!BRACE_ENCLOSED_INITIALIZER_P (val
)
6868 && !check_narrowing (TREE_TYPE (sub
), val
, complain
))
6869 return error_mark_node
;
6870 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
6871 if (!TREE_CONSTANT (sub
))
6872 TREE_CONSTANT (new_ctor
) = false;
6874 /* Build up the array. */
6875 elttype
= cp_build_qualified_type
6876 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
6877 array
= build_array_of_n_type (elttype
, len
);
6878 array
= finish_compound_literal (array
, new_ctor
, complain
);
6879 /* Take the address explicitly rather than via decay_conversion
6880 to avoid the error about taking the address of a temporary. */
6881 array
= cp_build_addr_expr (array
, complain
);
6882 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
6883 if (array
== error_mark_node
)
6884 return error_mark_node
;
6886 /* Build up the initializer_list object. */
6887 totype
= complete_type (totype
);
6888 field
= next_initializable_field (TYPE_FIELDS (totype
));
6889 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
6890 field
= next_initializable_field (DECL_CHAIN (field
));
6891 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
6892 new_ctor
= build_constructor (totype
, vec
);
6893 return get_target_expr_sfinae (new_ctor
, complain
);
6897 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
6899 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6900 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
6901 real
= perform_implicit_conversion (TREE_TYPE (totype
),
6903 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
6905 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
6908 expr
= reshape_init (totype
, expr
, complain
);
6909 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
6911 if (expr
!= error_mark_node
)
6912 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6919 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
6920 convs
->kind
== ck_ref_bind
6921 ? issue_conversion_warnings
: false,
6922 c_cast_p
, complain
);
6923 if (expr
== error_mark_node
)
6924 return error_mark_node
;
6926 switch (convs
->kind
)
6929 expr
= decay_conversion (expr
, complain
);
6930 if (expr
== error_mark_node
)
6932 if (complain
& tf_error
)
6934 maybe_print_user_conv_context (convs
);
6936 inform (DECL_SOURCE_LOCATION (fn
),
6937 " initializing argument %P of %qD", argnum
, fn
);
6939 return error_mark_node
;
6942 if (! MAYBE_CLASS_TYPE_P (totype
))
6945 /* Don't introduce copies when passing arguments along to the inherited
6947 if (current_function_decl
6948 && flag_new_inheriting_ctors
6949 && DECL_INHERITED_CTOR (current_function_decl
))
6952 if (TREE_CODE (expr
) == TARGET_EXPR
6953 && TARGET_EXPR_LIST_INIT_P (expr
))
6954 /* Copy-list-initialization doesn't actually involve a copy. */
6959 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
6961 /* We are going to bind a reference directly to a base-class
6962 subobject of EXPR. */
6963 /* Build an expression for `*((base*) &expr)'. */
6964 expr
= convert_to_base (expr
, totype
,
6965 !c_cast_p
, /*nonnull=*/true, complain
);
6969 /* Copy-initialization where the cv-unqualified version of the source
6970 type is the same class as, or a derived class of, the class of the
6971 destination [is treated as direct-initialization]. [dcl.init] */
6972 flags
= LOOKUP_NORMAL
;
6973 if (convs
->user_conv_p
)
6974 /* This conversion is being done in the context of a user-defined
6975 conversion (i.e. the second step of copy-initialization), so
6976 don't allow any more. */
6977 flags
|= LOOKUP_NO_CONVERSION
;
6979 flags
|= LOOKUP_ONLYCONVERTING
;
6980 if (convs
->rvaluedness_matches_p
)
6981 /* standard_conversion got LOOKUP_PREFER_RVALUE. */
6982 flags
|= LOOKUP_PREFER_RVALUE
;
6983 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
6984 if (diag_kind
&& complain
)
6986 maybe_print_user_conv_context (convs
);
6988 inform (DECL_SOURCE_LOCATION (fn
),
6989 " initializing argument %P of %qD", argnum
, fn
);
6992 return build_cplus_new (totype
, expr
, complain
);
6996 tree ref_type
= totype
;
6998 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
7000 tree extype
= TREE_TYPE (expr
);
7001 if (TYPE_REF_IS_RVALUE (ref_type
)
7003 error_at (loc
, "cannot bind rvalue reference of type %qH to "
7004 "lvalue of type %qI", totype
, extype
);
7005 else if (!TYPE_REF_IS_RVALUE (ref_type
) && !lvalue_p (expr
)
7006 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
7007 error_at (loc
, "cannot bind non-const lvalue reference of "
7008 "type %qH to an rvalue of type %qI", totype
, extype
);
7009 else if (!reference_compatible_p (TREE_TYPE (totype
), extype
))
7010 error_at (loc
, "binding reference of type %qH to %qI "
7011 "discards qualifiers", totype
, extype
);
7014 maybe_print_user_conv_context (convs
);
7016 inform (DECL_SOURCE_LOCATION (fn
),
7017 " initializing argument %P of %qD", argnum
, fn
);
7018 return error_mark_node
;
7021 /* If necessary, create a temporary.
7023 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
7024 that need temporaries, even when their types are reference
7025 compatible with the type of reference being bound, so the
7026 upcoming call to cp_build_addr_expr doesn't fail. */
7027 if (convs
->need_temporary_p
7028 || TREE_CODE (expr
) == CONSTRUCTOR
7029 || TREE_CODE (expr
) == VA_ARG_EXPR
)
7031 /* Otherwise, a temporary of type "cv1 T1" is created and
7032 initialized from the initializer expression using the rules
7033 for a non-reference copy-initialization (8.5). */
7035 tree type
= TREE_TYPE (ref_type
);
7036 cp_lvalue_kind lvalue
= lvalue_kind (expr
);
7038 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7039 (type
, next_conversion (convs
)->type
));
7040 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
7041 && !TYPE_REF_IS_RVALUE (ref_type
))
7043 /* If the reference is volatile or non-const, we
7044 cannot create a temporary. */
7045 if (lvalue
& clk_bitfield
)
7046 error_at (loc
, "cannot bind bitfield %qE to %qT",
7048 else if (lvalue
& clk_packed
)
7049 error_at (loc
, "cannot bind packed field %qE to %qT",
7052 error_at (loc
, "cannot bind rvalue %qE to %qT",
7054 return error_mark_node
;
7056 /* If the source is a packed field, and we must use a copy
7057 constructor, then building the target expr will require
7058 binding the field to the reference parameter to the
7059 copy constructor, and we'll end up with an infinite
7060 loop. If we can use a bitwise copy, then we'll be
7062 if ((lvalue
& clk_packed
)
7063 && CLASS_TYPE_P (type
)
7064 && type_has_nontrivial_copy_init (type
))
7066 error_at (loc
, "cannot bind packed field %qE to %qT",
7068 return error_mark_node
;
7070 if (lvalue
& clk_bitfield
)
7072 expr
= convert_bitfield_to_declared_type (expr
);
7073 expr
= fold_convert (type
, expr
);
7075 expr
= build_target_expr_with_type (expr
, type
, complain
);
7078 /* Take the address of the thing to which we will bind the
7080 expr
= cp_build_addr_expr (expr
, complain
);
7081 if (expr
== error_mark_node
)
7082 return error_mark_node
;
7084 /* Convert it to a pointer to the type referred to by the
7085 reference. This will adjust the pointer if a derived to
7086 base conversion is being performed. */
7087 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
7089 /* Convert the pointer to the desired reference type. */
7090 return build_nop (ref_type
, expr
);
7094 return decay_conversion (expr
, complain
);
7097 /* ??? Should the address of a transaction-safe pointer point to the TM
7098 clone, and this conversion look up the primary function? */
7099 return build_nop (totype
, expr
);
7102 /* Warn about deprecated conversion if appropriate. */
7103 string_conv_p (totype
, expr
, 1);
7108 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
7109 /*nonnull=*/false, complain
);
7110 return build_nop (totype
, expr
);
7113 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
7114 c_cast_p
, complain
);
7120 if (convs
->check_narrowing
7121 && !check_narrowing (totype
, expr
, complain
))
7122 return error_mark_node
;
7124 if (issue_conversion_warnings
)
7125 expr
= cp_convert_and_check (totype
, expr
, complain
);
7127 expr
= cp_convert (totype
, expr
, complain
);
7132 /* ARG is being passed to a varargs function. Perform any conversions
7133 required. Return the converted value. */
7136 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
7139 location_t loc
= EXPR_LOC_OR_LOC (arg
, input_location
);
7143 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7144 standard conversions are performed. */
7145 arg
= decay_conversion (arg
, complain
);
7146 arg_type
= TREE_TYPE (arg
);
7149 If the argument has integral or enumeration type that is subject
7150 to the integral promotions (_conv.prom_), or a floating point
7151 type that is subject to the floating point promotion
7152 (_conv.fpprom_), the value of the argument is converted to the
7153 promoted type before the call. */
7154 if (TREE_CODE (arg_type
) == REAL_TYPE
7155 && (TYPE_PRECISION (arg_type
)
7156 < TYPE_PRECISION (double_type_node
))
7157 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
7159 if ((complain
& tf_warning
)
7160 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
7161 warning_at (loc
, OPT_Wdouble_promotion
,
7162 "implicit conversion from %qH to %qI when passing "
7163 "argument to function",
7164 arg_type
, double_type_node
);
7165 arg
= convert_to_real_nofold (double_type_node
, arg
);
7167 else if (NULLPTR_TYPE_P (arg_type
))
7168 arg
= null_pointer_node
;
7169 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
7171 if (SCOPED_ENUM_P (arg_type
))
7173 tree prom
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
,
7175 prom
= cp_perform_integral_promotions (prom
, complain
);
7176 if (abi_version_crosses (6)
7177 && TYPE_MODE (TREE_TYPE (prom
)) != TYPE_MODE (arg_type
)
7178 && (complain
& tf_warning
))
7179 warning_at (loc
, OPT_Wabi
, "scoped enum %qT passed through ... as "
7180 "%qT before -fabi-version=6, %qT after", arg_type
,
7181 TREE_TYPE (prom
), ENUM_UNDERLYING_TYPE (arg_type
));
7182 if (!abi_version_at_least (6))
7186 arg
= cp_perform_integral_promotions (arg
, complain
);
7189 arg
= require_complete_type_sfinae (arg
, complain
);
7190 arg_type
= TREE_TYPE (arg
);
7192 if (arg
!= error_mark_node
7193 /* In a template (or ill-formed code), we can have an incomplete type
7194 even after require_complete_type_sfinae, in which case we don't know
7195 whether it has trivial copy or not. */
7196 && COMPLETE_TYPE_P (arg_type
)
7197 && !cp_unevaluated_operand
)
7199 /* [expr.call] 5.2.2/7:
7200 Passing a potentially-evaluated argument of class type (Clause 9)
7201 with a non-trivial copy constructor or a non-trivial destructor
7202 with no corresponding parameter is conditionally-supported, with
7203 implementation-defined semantics.
7205 We support it as pass-by-invisible-reference, just like a normal
7208 If the call appears in the context of a sizeof expression,
7209 it is not potentially-evaluated. */
7210 if (type_has_nontrivial_copy_init (arg_type
)
7211 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
))
7213 arg
= force_rvalue (arg
, complain
);
7214 if (complain
& tf_warning
)
7215 warning (OPT_Wconditionally_supported
,
7216 "passing objects of non-trivially-copyable "
7217 "type %q#T through %<...%> is conditionally supported",
7219 return build1 (ADDR_EXPR
, build_reference_type (arg_type
), arg
);
7221 /* Build up a real lvalue-to-rvalue conversion in case the
7222 copy constructor is trivial but not callable. */
7223 else if (CLASS_TYPE_P (arg_type
))
7224 force_rvalue (arg
, complain
);
7231 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7234 build_x_va_arg (source_location loc
, tree expr
, tree type
)
7236 if (processing_template_decl
)
7238 tree r
= build_min (VA_ARG_EXPR
, type
, expr
);
7239 SET_EXPR_LOCATION (r
, loc
);
7243 type
= complete_type_or_else (type
, NULL_TREE
);
7245 if (expr
== error_mark_node
|| !type
)
7246 return error_mark_node
;
7248 expr
= mark_lvalue_use (expr
);
7250 if (TREE_CODE (type
) == REFERENCE_TYPE
)
7252 error ("cannot receive reference type %qT through %<...%>", type
);
7253 return error_mark_node
;
7256 if (type_has_nontrivial_copy_init (type
)
7257 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7259 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7260 it as pass by invisible reference. */
7261 warning_at (loc
, OPT_Wconditionally_supported
,
7262 "receiving objects of non-trivially-copyable type %q#T "
7263 "through %<...%> is conditionally-supported", type
);
7265 tree ref
= cp_build_reference_type (type
, false);
7266 expr
= build_va_arg (loc
, expr
, ref
);
7267 return convert_from_reference (expr
);
7270 tree ret
= build_va_arg (loc
, expr
, type
);
7271 if (CLASS_TYPE_P (type
))
7272 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7273 know how to handle it. */
7274 ret
= get_target_expr (ret
);
7278 /* TYPE has been given to va_arg. Apply the default conversions which
7279 would have happened when passed via ellipsis. Return the promoted
7280 type, or the passed type if there is no change. */
7283 cxx_type_promotes_to (tree type
)
7287 /* Perform the array-to-pointer and function-to-pointer
7289 type
= type_decays_to (type
);
7291 promote
= type_promotes_to (type
);
7292 if (same_type_p (type
, promote
))
7298 /* ARG is a default argument expression being passed to a parameter of
7299 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7300 zero-based argument number. Do any required conversions. Return
7301 the converted value. */
7303 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
7305 push_defarg_context (tree fn
)
7306 { vec_safe_push (default_arg_context
, fn
); }
7309 pop_defarg_context (void)
7310 { default_arg_context
->pop (); }
7313 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
7314 tsubst_flags_t complain
)
7319 /* See through clones. */
7320 fn
= DECL_ORIGIN (fn
);
7321 /* And inheriting ctors. */
7322 if (flag_new_inheriting_ctors
)
7323 fn
= strip_inheriting_ctors (fn
);
7325 /* Detect recursion. */
7326 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
7329 if (complain
& tf_error
)
7330 error ("recursive evaluation of default argument for %q#D", fn
);
7331 return error_mark_node
;
7334 /* If the ARG is an unparsed default argument expression, the
7335 conversion cannot be performed. */
7336 if (TREE_CODE (arg
) == DEFAULT_ARG
)
7338 if (complain
& tf_error
)
7339 error ("call to %qD uses the default argument for parameter %P, which "
7340 "is not yet defined", fn
, parmnum
);
7341 return error_mark_node
;
7344 push_defarg_context (fn
);
7346 if (fn
&& DECL_TEMPLATE_INFO (fn
))
7347 arg
= tsubst_default_argument (fn
, parmnum
, type
, arg
, complain
);
7353 The names in the expression are bound, and the semantic
7354 constraints are checked, at the point where the default
7355 expressions appears.
7357 we must not perform access checks here. */
7358 push_deferring_access_checks (dk_no_check
);
7359 /* We must make a copy of ARG, in case subsequent processing
7360 alters any part of it. */
7361 arg
= break_out_target_exprs (arg
);
7362 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
7363 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
7365 arg
= convert_for_arg_passing (type
, arg
, complain
);
7366 pop_deferring_access_checks();
7368 pop_defarg_context ();
7373 /* Returns the type which will really be used for passing an argument of
7377 type_passed_as (tree type
)
7379 /* Pass classes with copy ctors by invisible reference. */
7380 if (TREE_ADDRESSABLE (type
))
7382 type
= build_reference_type (type
);
7383 /* There are no other pointers to this temporary. */
7384 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
7386 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7387 && INTEGRAL_TYPE_P (type
)
7388 && COMPLETE_TYPE_P (type
)
7389 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7390 type
= integer_type_node
;
7395 /* Actually perform the appropriate conversion. */
7398 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
7402 /* If VAL is a bitfield, then -- since it has already been converted
7403 to TYPE -- it cannot have a precision greater than TYPE.
7405 If it has a smaller precision, we must widen it here. For
7406 example, passing "int f:3;" to a function expecting an "int" will
7407 not result in any conversion before this point.
7409 If the precision is the same we must not risk widening. For
7410 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7411 often have type "int", even though the C++ type for the field is
7412 "long long". If the value is being passed to a function
7413 expecting an "int", then no conversions will be required. But,
7414 if we call convert_bitfield_to_declared_type, the bitfield will
7415 be converted to "long long". */
7416 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
7418 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
7419 val
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
), val
);
7421 if (val
== error_mark_node
)
7423 /* Pass classes with copy ctors by invisible reference. */
7424 else if (TREE_ADDRESSABLE (type
))
7425 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
7426 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7427 && INTEGRAL_TYPE_P (type
)
7428 && COMPLETE_TYPE_P (type
)
7429 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7430 val
= cp_perform_integral_promotions (val
, complain
);
7431 if (complain
& tf_warning
)
7433 if (warn_suggest_attribute_format
)
7435 tree rhstype
= TREE_TYPE (val
);
7436 const enum tree_code coder
= TREE_CODE (rhstype
);
7437 const enum tree_code codel
= TREE_CODE (type
);
7438 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7440 && check_missing_format_attribute (type
, rhstype
))
7441 warning (OPT_Wsuggest_attribute_format
,
7442 "argument of function call might be a candidate "
7443 "for a format attribute");
7445 maybe_warn_parm_abi (type
, EXPR_LOC_OR_LOC (val
, input_location
));
7450 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7451 which just decay_conversion or no conversions at all should be done.
7452 This is true for some builtins which don't act like normal functions.
7453 Return 2 if no conversions at all should be done, 1 if just
7454 decay_conversion. Return 3 for special treatment of the 3rd argument
7455 for __builtin_*_overflow_p. */
7458 magic_varargs_p (tree fn
)
7460 if (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
7461 switch (DECL_FUNCTION_CODE (fn
))
7463 case BUILT_IN_CLASSIFY_TYPE
:
7464 case BUILT_IN_CONSTANT_P
:
7465 case BUILT_IN_NEXT_ARG
:
7466 case BUILT_IN_VA_START
:
7469 case BUILT_IN_ADD_OVERFLOW_P
:
7470 case BUILT_IN_SUB_OVERFLOW_P
:
7471 case BUILT_IN_MUL_OVERFLOW_P
:
7475 return lookup_attribute ("type generic",
7476 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
7482 /* Returns the decl of the dispatcher function if FN is a function version. */
7485 get_function_version_dispatcher (tree fn
)
7487 tree dispatcher_decl
= NULL
;
7489 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7490 && DECL_FUNCTION_VERSIONED (fn
));
7492 gcc_assert (targetm
.get_function_versions_dispatcher
);
7493 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
7495 if (dispatcher_decl
== NULL
)
7497 error_at (input_location
, "use of multiversioned function "
7498 "without a default");
7502 retrofit_lang_decl (dispatcher_decl
);
7503 gcc_assert (dispatcher_decl
!= NULL
);
7504 return dispatcher_decl
;
7507 /* fn is a function version dispatcher that is marked used. Mark all the
7508 semantically identical function versions it will dispatch as used. */
7511 mark_versions_used (tree fn
)
7513 struct cgraph_node
*node
;
7514 struct cgraph_function_version_info
*node_v
;
7515 struct cgraph_function_version_info
*it_v
;
7517 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7519 node
= cgraph_node::get (fn
);
7523 gcc_assert (node
->dispatcher_function
);
7525 node_v
= node
->function_version ();
7529 /* All semantically identical versions are chained. Traverse and mark each
7530 one of them as used. */
7531 it_v
= node_v
->next
;
7532 while (it_v
!= NULL
)
7534 mark_used (it_v
->this_node
->decl
);
7539 /* Build a call to "the copy constructor" for the type of A, even if it
7540 wouldn't be selected by normal overload resolution. Used for
7544 call_copy_ctor (tree a
, tsubst_flags_t complain
)
7546 tree ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (a
));
7547 tree binfo
= TYPE_BINFO (ctype
);
7548 tree copy
= get_copy_ctor (ctype
, complain
);
7549 copy
= build_baselink (binfo
, binfo
, copy
, NULL_TREE
);
7550 tree ob
= build_dummy_object (ctype
);
7551 vec
<tree
, va_gc
>* args
= make_tree_vector_single (a
);
7552 tree r
= build_new_method_call (ob
, copy
, &args
, NULL_TREE
,
7553 LOOKUP_NORMAL
, NULL
, complain
);
7554 release_tree_vector (args
);
7558 /* Return true iff T refers to a base field. */
7561 is_base_field_ref (tree t
)
7564 if (TREE_CODE (t
) == ADDR_EXPR
)
7565 t
= TREE_OPERAND (t
, 0);
7566 if (TREE_CODE (t
) == COMPONENT_REF
)
7567 t
= TREE_OPERAND (t
, 1);
7568 if (TREE_CODE (t
) == FIELD_DECL
)
7569 return DECL_FIELD_IS_BASE (t
);
7573 /* We can't elide a copy from a function returning by value to a base
7574 subobject, as the callee might clobber tail padding. Return true iff this
7575 could be that case. */
7578 unsafe_copy_elision_p (tree target
, tree exp
)
7580 /* Copy elision only happens with a TARGET_EXPR. */
7581 if (TREE_CODE (exp
) != TARGET_EXPR
)
7583 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
7584 /* It's safe to elide the copy for a class with no tail padding. */
7585 if (tree_int_cst_equal (TYPE_SIZE (type
), CLASSTYPE_SIZE (type
)))
7587 /* It's safe to elide the copy if we aren't initializing a base object. */
7588 if (!is_base_field_ref (target
))
7590 tree init
= TARGET_EXPR_INITIAL (exp
);
7591 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7592 while (TREE_CODE (init
) == COMPOUND_EXPR
)
7593 init
= TREE_OPERAND (init
, 1);
7594 if (TREE_CODE (init
) == COND_EXPR
)
7596 /* We'll end up copying from each of the arms of the COND_EXPR directly
7597 into the target, so look at them. */
7598 if (tree op
= TREE_OPERAND (init
, 1))
7599 if (unsafe_copy_elision_p (target
, op
))
7601 return unsafe_copy_elision_p (target
, TREE_OPERAND (init
, 2));
7603 return (TREE_CODE (init
) == AGGR_INIT_EXPR
7604 && !AGGR_INIT_VIA_CTOR_P (init
));
7607 /* Subroutine of the various build_*_call functions. Overload resolution
7608 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7609 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7610 bitmask of various LOOKUP_* flags which apply to the call itself. */
7613 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
7616 const vec
<tree
, va_gc
> *args
= cand
->args
;
7617 tree first_arg
= cand
->first_arg
;
7618 conversion
**convs
= cand
->convs
;
7620 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
7625 unsigned int arg_index
= 0;
7629 bool already_used
= false;
7631 /* In a template, there is no need to perform all of the work that
7632 is normally done. We are only interested in the type of the call
7633 expression, i.e., the return type of the function. Any semantic
7634 errors will be deferred until the template is instantiated. */
7635 if (processing_template_decl
)
7639 const tree
*argarray
;
7642 if (undeduced_auto_decl (fn
))
7643 mark_used (fn
, complain
);
7645 /* Otherwise set TREE_USED for the benefit of -Wunused-function.
7649 return_type
= TREE_TYPE (TREE_TYPE (fn
));
7650 nargs
= vec_safe_length (args
);
7651 if (first_arg
== NULL_TREE
)
7652 argarray
= args
->address ();
7660 alcarray
= XALLOCAVEC (tree
, nargs
);
7661 alcarray
[0] = build_this (first_arg
);
7662 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
7663 alcarray
[ix
+ 1] = arg
;
7664 argarray
= alcarray
;
7667 addr
= build_addr_func (fn
, complain
);
7668 if (addr
== error_mark_node
)
7669 return error_mark_node
;
7670 expr
= build_call_array_loc (input_location
, return_type
,
7671 addr
, nargs
, argarray
);
7672 if (TREE_THIS_VOLATILE (fn
) && cfun
)
7673 current_function_returns_abnormally
= 1;
7674 return convert_from_reference (expr
);
7677 /* Give any warnings we noticed during overload resolution. */
7678 if (cand
->warnings
&& (complain
& tf_warning
))
7680 struct candidate_warning
*w
;
7681 for (w
= cand
->warnings
; w
; w
= w
->next
)
7682 joust (cand
, w
->loser
, 1, complain
);
7685 /* OK, we're actually calling this inherited constructor; set its deletedness
7686 appropriately. We can get away with doing this here because calling is
7687 the only way to refer to a constructor. */
7688 if (DECL_INHERITED_CTOR (fn
))
7689 deduce_inheriting_ctor (fn
);
7691 /* Make =delete work with SFINAE. */
7692 if (DECL_DELETED_FN (fn
))
7694 if (complain
& tf_error
)
7696 return error_mark_node
;
7699 if (DECL_FUNCTION_MEMBER_P (fn
))
7702 /* If FN is a template function, two cases must be considered.
7707 template <class T> void f();
7709 template <class T> struct B {
7713 struct C : A, B<int> {
7715 using B<int>::g; // #2
7718 In case #1 where `A::f' is a member template, DECL_ACCESS is
7719 recorded in the primary template but not in its specialization.
7720 We check access of FN using its primary template.
7722 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7723 because it is a member of class template B, DECL_ACCESS is
7724 recorded in the specialization `B<int>::g'. We cannot use its
7725 primary template because `B<T>::g' and `B<int>::g' may have
7726 different access. */
7727 if (DECL_TEMPLATE_INFO (fn
)
7728 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
7729 access_fn
= DECL_TI_TEMPLATE (fn
);
7732 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
7734 return error_mark_node
;
7737 /* If we're checking for implicit delete, don't bother with argument
7739 if (flags
& LOOKUP_SPECULATIVE
)
7741 if (cand
->viable
== 1)
7743 else if (!(complain
& tf_error
))
7744 /* Reject bad conversions now. */
7745 return error_mark_node
;
7746 /* else continue to get conversion error. */
7749 /* N3276 magic doesn't apply to nested calls. */
7750 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
7751 complain
&= ~tf_decltype
;
7752 /* No-Cleanup doesn't apply to nested calls either. */
7753 tsubst_flags_t no_cleanup_complain
= complain
;
7754 complain
&= ~tf_no_cleanup
;
7756 /* Find maximum size of vector to hold converted arguments. */
7757 parmlen
= list_length (parm
);
7758 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
7759 if (parmlen
> nargs
)
7761 argarray
= XALLOCAVEC (tree
, nargs
);
7763 /* The implicit parameters to a constructor are not considered by overload
7764 resolution, and must be of the proper type. */
7765 if (DECL_CONSTRUCTOR_P (fn
))
7768 if (first_arg
!= NULL_TREE
)
7770 object_arg
= first_arg
;
7771 first_arg
= NULL_TREE
;
7775 object_arg
= (*args
)[arg_index
];
7778 argarray
[j
++] = build_this (object_arg
);
7779 parm
= TREE_CHAIN (parm
);
7780 /* We should never try to call the abstract constructor. */
7781 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
7783 if (DECL_HAS_VTT_PARM_P (fn
))
7785 argarray
[j
++] = (*args
)[arg_index
];
7787 parm
= TREE_CHAIN (parm
);
7790 if (flags
& LOOKUP_PREFER_RVALUE
)
7792 /* The implicit move specified in 15.8.3/3 fails "...if the type of
7793 the first parameter of the selected constructor is not an rvalue
7794 reference to the object’s type (possibly cv-qualified)...." */
7795 gcc_assert (!(complain
& tf_error
));
7796 tree ptype
= convs
[0]->type
;
7797 if (TREE_CODE (ptype
) != REFERENCE_TYPE
7798 || !TYPE_REF_IS_RVALUE (ptype
)
7799 || CONVERSION_RANK (convs
[0]) > cr_exact
)
7800 return error_mark_node
;
7803 /* Bypass access control for 'this' parameter. */
7804 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7806 tree parmtype
= TREE_VALUE (parm
);
7807 tree arg
= build_this (first_arg
!= NULL_TREE
7809 : (*args
)[arg_index
]);
7810 tree argtype
= TREE_TYPE (arg
);
7814 if (arg
== error_mark_node
)
7815 return error_mark_node
;
7817 if (convs
[i
]->bad_p
)
7819 if (complain
& tf_error
)
7821 if (permerror (input_location
, "passing %qT as %<this%> "
7822 "argument discards qualifiers",
7823 TREE_TYPE (argtype
)))
7824 inform (DECL_SOURCE_LOCATION (fn
), " in call to %qD", fn
);
7827 return error_mark_node
;
7830 /* See if the function member or the whole class type is declared
7831 final and the call can be devirtualized. */
7832 if (DECL_FINAL_P (fn
)
7833 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
7834 flags
|= LOOKUP_NONVIRTUAL
;
7836 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
7837 X is called for an object that is not of type X, or of a type
7838 derived from X, the behavior is undefined.
7840 So we can assume that anything passed as 'this' is non-null, and
7841 optimize accordingly. */
7842 gcc_assert (TYPE_PTR_P (parmtype
));
7843 /* Convert to the base in which the function was declared. */
7844 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
7845 converted_arg
= build_base_path (PLUS_EXPR
,
7847 cand
->conversion_path
,
7849 /* Check that the base class is accessible. */
7850 if (!accessible_base_p (TREE_TYPE (argtype
),
7851 BINFO_TYPE (cand
->conversion_path
), true))
7853 if (complain
& tf_error
)
7854 error ("%qT is not an accessible base of %qT",
7855 BINFO_TYPE (cand
->conversion_path
),
7856 TREE_TYPE (argtype
));
7858 return error_mark_node
;
7860 /* If fn was found by a using declaration, the conversion path
7861 will be to the derived class, not the base declaring fn. We
7862 must convert from derived to base. */
7863 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
7864 TREE_TYPE (parmtype
), ba_unique
,
7866 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
7867 base_binfo
, 1, complain
);
7869 argarray
[j
++] = converted_arg
;
7870 parm
= TREE_CHAIN (parm
);
7871 if (first_arg
!= NULL_TREE
)
7872 first_arg
= NULL_TREE
;
7879 gcc_assert (first_arg
== NULL_TREE
);
7880 for (; arg_index
< vec_safe_length (args
) && parm
;
7881 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
7883 tree type
= TREE_VALUE (parm
);
7884 tree arg
= (*args
)[arg_index
];
7885 bool conversion_warning
= true;
7889 /* If the argument is NULL and used to (implicitly) instantiate a
7890 template function (and bind one of the template arguments to
7891 the type of 'long int'), we don't want to warn about passing NULL
7892 to non-pointer argument.
7893 For example, if we have this template function:
7895 template<typename T> void func(T x) {}
7897 we want to warn (when -Wconversion is enabled) in this case:
7903 but not in this case:
7909 if (null_node_p (arg
)
7910 && DECL_TEMPLATE_INFO (fn
)
7911 && cand
->template_decl
7912 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
7913 conversion_warning
= false;
7915 /* Warn about initializer_list deduction that isn't currently in the
7917 if (cxx_dialect
> cxx98
7918 && flag_deduce_init_list
7919 && cand
->template_decl
7920 && is_std_init_list (non_reference (type
))
7921 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
7923 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
7924 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
7925 tree patparm
= get_pattern_parm (realparm
, tmpl
);
7926 tree pattype
= TREE_TYPE (patparm
);
7927 if (PACK_EXPANSION_P (pattype
))
7928 pattype
= PACK_EXPANSION_PATTERN (pattype
);
7929 pattype
= non_reference (pattype
);
7931 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
7932 && (cand
->explicit_targs
== NULL_TREE
7933 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
7934 <= TEMPLATE_TYPE_IDX (pattype
))))
7936 pedwarn (input_location
, 0, "deducing %qT as %qT",
7937 non_reference (TREE_TYPE (patparm
)),
7938 non_reference (type
));
7939 pedwarn (DECL_SOURCE_LOCATION (cand
->fn
), 0,
7940 " in call to %qD", cand
->fn
);
7941 pedwarn (input_location
, 0,
7942 " (you can disable this with -fno-deduce-init-list)");
7946 /* Set user_conv_p on the argument conversions, so rvalue/base handling
7947 knows not to allow any more UDCs. This needs to happen after we
7948 process cand->warnings. */
7949 if (flags
& LOOKUP_NO_CONVERSION
)
7950 conv
->user_conv_p
= true;
7952 tsubst_flags_t arg_complain
= complain
;
7953 if (!conversion_warning
)
7954 arg_complain
&= ~tf_warning
;
7956 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
7958 val
= convert_for_arg_passing (type
, val
, arg_complain
);
7960 if (val
== error_mark_node
)
7961 return error_mark_node
;
7963 argarray
[j
++] = val
;
7966 /* Default arguments */
7967 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
7969 if (TREE_VALUE (parm
) == error_mark_node
)
7970 return error_mark_node
;
7971 val
= convert_default_arg (TREE_VALUE (parm
),
7972 TREE_PURPOSE (parm
),
7975 if (val
== error_mark_node
)
7976 return error_mark_node
;
7977 argarray
[j
++] = val
;
7981 int magic
= magic_varargs_p (fn
);
7982 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
7984 tree a
= (*args
)[arg_index
];
7985 if ((magic
== 3 && arg_index
== 2) || magic
== 2)
7987 /* Do no conversions for certain magic varargs. */
7988 a
= mark_type_use (a
);
7989 if (TREE_CODE (a
) == FUNCTION_DECL
&& reject_gcc_builtin (a
))
7990 return error_mark_node
;
7992 else if (magic
!= 0)
7993 /* For other magic varargs only do decay_conversion. */
7994 a
= decay_conversion (a
, complain
);
7995 else if (DECL_CONSTRUCTOR_P (fn
)
7996 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn
),
7999 /* Avoid infinite recursion trying to call A(...). */
8000 if (complain
& tf_error
)
8001 /* Try to call the actual copy constructor for a good error. */
8002 call_copy_ctor (a
, complain
);
8003 return error_mark_node
;
8006 a
= convert_arg_to_ellipsis (a
, complain
);
8007 if (a
== error_mark_node
)
8008 return error_mark_node
;
8012 gcc_assert (j
<= nargs
);
8015 /* Avoid to do argument-transformation, if warnings for format, and for
8016 nonnull are disabled. Just in case that at least one of them is active
8017 the check_function_arguments function might warn about something. */
8019 bool warned_p
= false;
8022 || warn_suggest_attribute_format
8025 tree
*fargs
= (!nargs
? argarray
8026 : (tree
*) alloca (nargs
* sizeof (tree
)));
8027 for (j
= 0; j
< nargs
; j
++)
8029 /* For -Wformat undo the implicit passing by hidden reference
8030 done by convert_arg_to_ellipsis. */
8031 if (TREE_CODE (argarray
[j
]) == ADDR_EXPR
8032 && TREE_CODE (TREE_TYPE (argarray
[j
])) == REFERENCE_TYPE
)
8033 fargs
[j
] = TREE_OPERAND (argarray
[j
], 0);
8035 fargs
[j
] = maybe_constant_value (argarray
[j
]);
8038 warned_p
= check_function_arguments (input_location
, fn
, TREE_TYPE (fn
),
8039 nargs
, fargs
, NULL
);
8042 if (DECL_INHERITED_CTOR (fn
))
8044 /* Check for passing ellipsis arguments to an inherited constructor. We
8045 could handle this by open-coding the inherited constructor rather than
8046 defining it, but let's not bother now. */
8047 if (!cp_unevaluated_operand
8049 && cand
->convs
[cand
->num_convs
-1]->ellipsis_p
)
8051 if (complain
& tf_error
)
8053 sorry ("passing arguments to ellipsis of inherited constructor "
8055 inform (DECL_SOURCE_LOCATION (cand
->fn
), "declared here");
8057 return error_mark_node
;
8060 /* A base constructor inheriting from a virtual base doesn't get the
8061 inherited arguments, just this and __vtt. */
8062 if (ctor_omit_inherited_parms (fn
))
8066 /* Avoid actually calling copy constructors and copy assignment operators,
8069 if (! flag_elide_constructors
)
8070 /* Do things the hard way. */;
8071 else if (cand
->num_convs
== 1
8072 && (DECL_COPY_CONSTRUCTOR_P (fn
)
8073 || DECL_MOVE_CONSTRUCTOR_P (fn
))
8074 /* It's unsafe to elide the constructor when handling
8075 a noexcept-expression, it may evaluate to the wrong
8076 value (c++/53025). */
8077 && cp_noexcept_operand
== 0)
8080 tree arg
= argarray
[num_artificial_parms_for (fn
)];
8082 bool trivial
= trivial_fn_p (fn
);
8084 /* Pull out the real argument, disregarding const-correctness. */
8086 /* Strip the reference binding for the constructor parameter. */
8087 if (CONVERT_EXPR_P (targ
)
8088 && TREE_CODE (TREE_TYPE (targ
)) == REFERENCE_TYPE
)
8089 targ
= TREE_OPERAND (targ
, 0);
8090 /* But don't strip any other reference bindings; binding a temporary to a
8091 reference prevents copy elision. */
8092 while ((CONVERT_EXPR_P (targ
)
8093 && TREE_CODE (TREE_TYPE (targ
)) != REFERENCE_TYPE
)
8094 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
8095 targ
= TREE_OPERAND (targ
, 0);
8096 if (TREE_CODE (targ
) == ADDR_EXPR
)
8098 targ
= TREE_OPERAND (targ
, 0);
8099 if (!same_type_ignoring_top_level_qualifiers_p
8100 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
8109 arg
= cp_build_fold_indirect_ref (arg
);
8111 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8113 if (CHECKING_P
&& cxx_dialect
>= cxx17
)
8114 gcc_assert (TREE_CODE (arg
) != TARGET_EXPR
8115 /* It's from binding the ref parm to a packed field. */
8116 || convs
[0]->need_temporary_p
8118 /* See unsafe_copy_elision_p. */
8119 || DECL_BASE_CONSTRUCTOR_P (fn
));
8121 /* [class.copy]: the copy constructor is implicitly defined even if
8122 the implementation elided its use. */
8125 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
8126 return error_mark_node
;
8127 already_used
= true;
8130 /* If we're creating a temp and we already have one, don't create a
8131 new one. If we're not creating a temp but we get one, use
8132 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8133 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8134 temp or an INIT_EXPR otherwise. */
8136 if (is_dummy_object (fa
))
8138 if (TREE_CODE (arg
) == TARGET_EXPR
)
8141 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
8143 else if ((trivial
|| TREE_CODE (arg
) == TARGET_EXPR
)
8144 && !unsafe_copy_elision_p (fa
, arg
))
8146 tree to
= cp_stabilize_reference (cp_build_fold_indirect_ref (fa
));
8148 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
8152 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
8153 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
)
8154 && trivial_fn_p (fn
))
8156 tree to
= cp_stabilize_reference
8157 (cp_build_fold_indirect_ref (argarray
[0]));
8158 tree type
= TREE_TYPE (to
);
8159 tree as_base
= CLASSTYPE_AS_BASE (type
);
8160 tree arg
= argarray
[1];
8162 if (is_really_empty_class (type
))
8164 /* Avoid copying empty classes. */
8165 val
= build2 (COMPOUND_EXPR
, type
, arg
, to
);
8166 TREE_NO_WARNING (val
) = 1;
8168 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
8170 arg
= cp_build_fold_indirect_ref (arg
);
8171 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
8175 /* We must only copy the non-tail padding parts. */
8177 tree array_type
, alias_set
;
8179 arg2
= TYPE_SIZE_UNIT (as_base
);
8180 arg0
= cp_build_addr_expr (to
, complain
);
8182 array_type
= build_array_type (unsigned_char_type_node
,
8184 (size_binop (MINUS_EXPR
,
8185 arg2
, size_int (1))));
8186 alias_set
= build_int_cst (build_pointer_type (type
), 0);
8187 t
= build2 (MODIFY_EXPR
, void_type_node
,
8188 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
8189 build2 (MEM_REF
, array_type
, arg
, alias_set
));
8190 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
8191 TREE_NO_WARNING (val
) = 1;
8196 else if (trivial_fn_p (fn
))
8198 if (DECL_DESTRUCTOR_P (fn
))
8199 return fold_convert (void_type_node
, argarray
[0]);
8200 else if (default_ctor_p (fn
))
8202 if (is_dummy_object (argarray
[0]))
8203 return force_target_expr (DECL_CONTEXT (fn
), void_node
,
8204 no_cleanup_complain
);
8206 return cp_build_fold_indirect_ref (argarray
[0]);
8211 && !mark_used (fn
, complain
))
8212 return error_mark_node
;
8214 /* Warn if the built-in writes to an object of a non-trivial type. */
8215 if (warn_class_memaccess
8216 && vec_safe_length (args
) >= 2
8217 && DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
8218 maybe_warn_class_memaccess (input_location
, fn
, args
);
8220 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0
8221 /* Don't mess with virtual lookup in instantiate_non_dependent_expr;
8222 virtual functions can't be constexpr. */
8223 && !in_template_function ())
8226 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
8228 ba_any
, NULL
, complain
);
8229 gcc_assert (binfo
&& binfo
!= error_mark_node
);
8231 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
8233 if (TREE_SIDE_EFFECTS (argarray
[0]))
8234 argarray
[0] = save_expr (argarray
[0]);
8235 t
= build_pointer_type (TREE_TYPE (fn
));
8236 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
8241 fn
= build_addr_func (fn
, complain
);
8242 if (fn
== error_mark_node
)
8243 return error_mark_node
;
8246 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
8247 if (call
== error_mark_node
)
8249 if (cand
->flags
& LOOKUP_LIST_INIT_CTOR
)
8251 tree c
= extract_call_expr (call
);
8252 /* build_new_op_1 will clear this when appropriate. */
8253 CALL_EXPR_ORDERED_ARGS (c
) = true;
8257 tree c
= extract_call_expr (call
);
8258 if (TREE_CODE (c
) == CALL_EXPR
)
8259 TREE_NO_WARNING (c
) = 1;
8264 /* Return the DECL of the first non-public data member of class TYPE
8265 or null if none can be found. */
8268 first_non_public_field (tree type
)
8270 if (!CLASS_TYPE_P (type
))
8273 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
8275 if (TREE_CODE (field
) != FIELD_DECL
)
8277 if (TREE_STATIC (field
))
8279 if (TREE_PRIVATE (field
) || TREE_PROTECTED (field
))
8285 for (tree base_binfo
, binfo
= TYPE_BINFO (type
);
8286 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8288 tree base
= TREE_TYPE (base_binfo
);
8290 if (tree field
= first_non_public_field (base
))
8297 /* Return true if all copy and move assignment operator overloads for
8298 class TYPE are trivial and at least one of them is not deleted and,
8299 when ACCESS is set, accessible. Return false otherwise. Set
8300 HASASSIGN to true when the TYPE has a (not necessarily trivial)
8301 copy or move assignment. */
8304 has_trivial_copy_assign_p (tree type
, bool access
, bool *hasassign
)
8306 tree fns
= get_class_binding (type
, assign_op_identifier
);
8307 bool all_trivial
= true;
8309 /* Iterate over overloads of the assignment operator, checking
8310 accessible copy assignments for triviality. */
8312 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8316 /* Skip operators that aren't copy assignments. */
8320 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8321 || accessible_p (TYPE_BINFO (type
), f
, true));
8323 /* Skip template assignment operators and deleted functions. */
8324 if (TREE_CODE (f
) != FUNCTION_DECL
|| DECL_DELETED_FN (f
))
8330 if (!accessible
|| !trivial_fn_p (f
))
8331 all_trivial
= false;
8333 /* Break early when both properties have been determined. */
8334 if (*hasassign
&& !all_trivial
)
8338 /* Return true if they're all trivial and one of the expressions
8339 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
8340 tree ref
= cp_build_reference_type (type
, false);
8342 && (is_trivially_xible (MODIFY_EXPR
, type
, type
)
8343 || is_trivially_xible (MODIFY_EXPR
, type
, ref
)));
8346 /* Return true if all copy and move ctor overloads for class TYPE are
8347 trivial and at least one of them is not deleted and, when ACCESS is
8348 set, accessible. Return false otherwise. Set each element of HASCTOR[]
8349 to true when the TYPE has a (not necessarily trivial) default and copy
8350 (or move) ctor, respectively. */
8353 has_trivial_copy_p (tree type
, bool access
, bool hasctor
[2])
8355 tree fns
= get_class_binding (type
, complete_ctor_identifier
);
8356 bool all_trivial
= true;
8358 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8362 /* Skip template constructors. */
8363 if (TREE_CODE (f
) != FUNCTION_DECL
)
8366 bool cpy_or_move_ctor_p
= copy_fn_p (f
);
8368 /* Skip ctors other than default, copy, and move. */
8369 if (!cpy_or_move_ctor_p
&& !default_ctor_p (f
))
8372 if (DECL_DELETED_FN (f
))
8375 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8376 || accessible_p (TYPE_BINFO (type
), f
, true));
8379 hasctor
[cpy_or_move_ctor_p
] = true;
8381 if (cpy_or_move_ctor_p
&& (!accessible
|| !trivial_fn_p (f
)))
8382 all_trivial
= false;
8384 /* Break early when both properties have been determined. */
8385 if (hasctor
[0] && hasctor
[1] && !all_trivial
)
8392 /* Issue a warning on a call to the built-in function FNDECL if it is
8393 a raw memory write whose destination is not an object of (something
8394 like) trivial or standard layout type with a non-deleted assignment
8395 and copy ctor. Detects const correctness violations, corrupting
8396 references, virtual table pointers, and bypassing non-trivial
8400 maybe_warn_class_memaccess (location_t loc
, tree fndecl
,
8401 const vec
<tree
, va_gc
> *args
)
8403 /* Except for bcopy where it's second, the destination pointer is
8404 the first argument for all functions handled here. Compute
8405 the index of the destination and source arguments. */
8406 unsigned dstidx
= DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_BCOPY
;
8407 unsigned srcidx
= !dstidx
;
8409 tree dest
= (*args
)[dstidx
];
8410 if (!TREE_TYPE (dest
) || !POINTER_TYPE_P (TREE_TYPE (dest
)))
8413 tree srctype
= NULL_TREE
;
8415 /* Determine the type of the pointed-to object and whether it's
8416 a complete class type. */
8417 tree desttype
= TREE_TYPE (TREE_TYPE (dest
));
8419 if (!desttype
|| !COMPLETE_TYPE_P (desttype
) || !CLASS_TYPE_P (desttype
))
8422 /* Check to see if the raw memory call is made by a ctor or dtor
8423 with this as the destination argument for the destination type.
8424 If so, be more permissive. */
8425 if (current_function_decl
8426 && (DECL_CONSTRUCTOR_P (current_function_decl
)
8427 || DECL_DESTRUCTOR_P (current_function_decl
))
8428 && is_this_parameter (tree_strip_nop_conversions (dest
)))
8430 tree ctx
= DECL_CONTEXT (current_function_decl
);
8431 bool special
= same_type_ignoring_top_level_qualifiers_p (ctx
, desttype
);
8433 tree binfo
= TYPE_BINFO (ctx
);
8435 /* A ctor and dtor for a class with no bases and no virtual functions
8436 can do whatever they want. Bail early with no further checking. */
8437 if (special
&& !BINFO_VTABLE (binfo
) && !BINFO_N_BASE_BINFOS (binfo
))
8441 /* True if the class is trivial. */
8442 bool trivial
= trivial_type_p (desttype
);
8444 /* Set to true if DESTYPE has an accessible copy assignment. */
8445 bool hasassign
= false;
8446 /* True if all of the class' overloaded copy assignment operators
8447 are all trivial (and not deleted) and at least one of them is
8449 bool trivassign
= has_trivial_copy_assign_p (desttype
, true, &hasassign
);
8451 /* Set to true if DESTTYPE has an accessible default and copy ctor,
8453 bool hasctors
[2] = { false, false };
8455 /* True if all of the class' overloaded copy constructors are all
8456 trivial (and not deleted) and at least one of them is accessible. */
8457 bool trivcopy
= has_trivial_copy_p (desttype
, true, hasctors
);
8459 /* Set FLD to the first private/protected member of the class. */
8460 tree fld
= trivial
? first_non_public_field (desttype
) : NULL_TREE
;
8462 /* The warning format string. */
8463 const char *warnfmt
= NULL
;
8464 /* A suggested alternative to offer instead of the raw memory call.
8465 Empty string when none can be come up with. */
8466 const char *suggest
= "";
8467 bool warned
= false;
8469 switch (DECL_FUNCTION_CODE (fndecl
))
8471 case BUILT_IN_MEMSET
:
8472 if (!integer_zerop (maybe_constant_value ((*args
)[1])))
8474 /* Diagnose setting non-copy-assignable or non-trivial types,
8475 or types with a private member, to (potentially) non-zero
8476 bytes. Since the value of the bytes being written is unknown,
8477 suggest using assignment instead (if one exists). Also warn
8478 for writes into objects for which zero-initialization doesn't
8479 mean all bits clear (pointer-to-member data, where null is all
8480 bits set). Since the value being written is (most likely)
8481 non-zero, simply suggest assignment (but not copy assignment). */
8482 suggest
= "; use assignment instead";
8484 warnfmt
= G_("%qD writing to an object of type %#qT with "
8485 "no trivial copy-assignment");
8487 warnfmt
= G_("%qD writing to an object of non-trivial type %#qT%s");
8490 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8491 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8492 "%qD writing to an object of type %#qT with "
8494 fndecl
, desttype
, access
, fld
);
8496 else if (!zero_init_p (desttype
))
8497 warnfmt
= G_("%qD writing to an object of type %#qT containing "
8498 "a pointer to data member%s");
8504 case BUILT_IN_BZERO
:
8505 /* Similarly to the above, diagnose clearing non-trivial or non-
8506 standard layout objects, or objects of types with no assignmenmt.
8507 Since the value being written is known to be zero, suggest either
8508 copy assignment, copy ctor, or default ctor as an alternative,
8509 depending on what's available. */
8511 if (hasassign
&& hasctors
[0])
8512 suggest
= G_("; use assignment or value-initialization instead");
8514 suggest
= G_("; use assignment instead");
8515 else if (hasctors
[0])
8516 suggest
= G_("; use value-initialization instead");
8519 warnfmt
= G_("%qD clearing an object of type %#qT with "
8520 "no trivial copy-assignment%s");
8522 warnfmt
= G_("%qD clearing an object of non-trivial type %#qT%s");
8523 else if (!zero_init_p (desttype
))
8524 warnfmt
= G_("%qD clearing an object of type %#qT containing "
8525 "a pointer-to-member%s");
8528 case BUILT_IN_BCOPY
:
8529 case BUILT_IN_MEMCPY
:
8530 case BUILT_IN_MEMMOVE
:
8531 case BUILT_IN_MEMPCPY
:
8532 /* Determine the type of the source object. */
8533 srctype
= TREE_TYPE ((*args
)[srcidx
]);
8534 if (!srctype
|| !POINTER_TYPE_P (srctype
))
8535 srctype
= void_type_node
;
8537 srctype
= TREE_TYPE (srctype
);
8539 /* Since it's impossible to determine wheter the byte copy is
8540 being used in place of assignment to an existing object or
8541 as a substitute for initialization, assume it's the former.
8542 Determine the best alternative to use instead depending on
8543 what's not deleted. */
8544 if (hasassign
&& hasctors
[1])
8545 suggest
= G_("; use copy-assignment or copy-initialization instead");
8547 suggest
= G_("; use copy-assignment instead");
8548 else if (hasctors
[1])
8549 suggest
= G_("; use copy-initialization instead");
8552 warnfmt
= G_("%qD writing to an object of type %#qT with no trivial "
8553 "copy-assignment%s");
8554 else if (!trivially_copyable_p (desttype
))
8555 warnfmt
= G_("%qD writing to an object of non-trivially copyable "
8558 warnfmt
= G_("%qD writing to an object with a deleted copy constructor");
8561 && !VOID_TYPE_P (srctype
)
8562 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
8563 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
8566 /* Warn when copying into a non-trivial object from an object
8567 of a different type other than void or char. */
8568 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8569 "%qD copying an object of non-trivial type "
8570 "%#qT from an array of %#qT",
8571 fndecl
, desttype
, srctype
);
8574 && !VOID_TYPE_P (srctype
)
8575 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
8576 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
8579 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8580 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8581 "%qD copying an object of type %#qT with "
8582 "%qs member %qD from an array of %#qT; use "
8583 "assignment or copy-initialization instead",
8584 fndecl
, desttype
, access
, fld
, srctype
);
8586 else if (!trivial
&& vec_safe_length (args
) > 2)
8588 tree sz
= maybe_constant_value ((*args
)[2]);
8589 if (!tree_fits_uhwi_p (sz
))
8592 /* Finally, warn on partial copies. */
8593 unsigned HOST_WIDE_INT typesize
8594 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype
));
8595 if (unsigned HOST_WIDE_INT partial
= tree_to_uhwi (sz
) % typesize
)
8596 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8597 (typesize
- partial
> 1
8598 ? G_("%qD writing to an object of "
8599 "a non-trivial type %#qT leaves %wu "
8601 : G_("%qD writing to an object of "
8602 "a non-trivial type %#qT leaves %wu "
8604 fndecl
, desttype
, typesize
- partial
);
8608 case BUILT_IN_REALLOC
:
8610 if (!trivially_copyable_p (desttype
))
8611 warnfmt
= G_("%qD moving an object of non-trivially copyable type "
8612 "%#qT; use %<new%> and %<delete%> instead");
8614 warnfmt
= G_("%qD moving an object of type %#qT with deleted copy "
8615 "constructor; use %<new%> and %<delete%> instead");
8616 else if (!get_dtor (desttype
, tf_none
))
8617 warnfmt
= G_("%qD moving an object of type %#qT with deleted "
8621 tree sz
= maybe_constant_value ((*args
)[1]);
8622 if (TREE_CODE (sz
) == INTEGER_CST
8623 && tree_int_cst_lt (sz
, TYPE_SIZE_UNIT (desttype
)))
8624 /* Finally, warn on reallocation into insufficient space. */
8625 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8626 "%qD moving an object of non-trivial type "
8627 "%#qT and size %E into a region of size %E",
8628 fndecl
, desttype
, TYPE_SIZE_UNIT (desttype
),
8640 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8641 warnfmt
, fndecl
, desttype
, suggest
);
8643 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8644 warnfmt
, fndecl
, desttype
);
8648 inform (location_of (desttype
), "%#qT declared here", desttype
);
8651 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
8652 This function performs no overload resolution, conversion, or other
8653 high-level operations. */
8656 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
8657 tsubst_flags_t complain
)
8661 /* Remember roughly where this call is. */
8662 location_t loc
= EXPR_LOC_OR_LOC (fn
, input_location
);
8663 fn
= build_call_a (fn
, nargs
, argarray
);
8664 SET_EXPR_LOCATION (fn
, loc
);
8666 fndecl
= get_callee_fndecl (fn
);
8668 /* Check that arguments to builtin functions match the expectations. */
8670 && DECL_BUILT_IN (fndecl
)
8671 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
8675 /* We need to take care that values to BUILT_IN_NORMAL
8677 for (i
= 0; i
< nargs
; i
++)
8678 argarray
[i
] = fold_non_dependent_expr (argarray
[i
]);
8680 if (!check_builtin_function_arguments (EXPR_LOCATION (fn
), vNULL
, fndecl
,
8682 return error_mark_node
;
8685 if (VOID_TYPE_P (TREE_TYPE (fn
)))
8688 /* 5.2.2/11: If a function call is a prvalue of object type: if the
8689 function call is either the operand of a decltype-specifier or the
8690 right operand of a comma operator that is the operand of a
8691 decltype-specifier, a temporary object is not introduced for the
8692 prvalue. The type of the prvalue may be incomplete. */
8693 if (!(complain
& tf_decltype
))
8695 fn
= require_complete_type_sfinae (fn
, complain
);
8696 if (fn
== error_mark_node
)
8697 return error_mark_node
;
8699 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
8701 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
8702 maybe_warn_parm_abi (TREE_TYPE (fn
), loc
);
8705 return convert_from_reference (fn
);
8708 /* Returns the value to use for the in-charge parameter when making a
8709 call to a function with the indicated NAME.
8711 FIXME:Can't we find a neater way to do this mapping? */
8714 in_charge_arg_for_name (tree name
)
8716 if (IDENTIFIER_CTOR_P (name
))
8718 if (name
== complete_ctor_identifier
)
8719 return integer_one_node
;
8720 gcc_checking_assert (name
== base_ctor_identifier
);
8724 if (name
== complete_dtor_identifier
)
8725 return integer_two_node
;
8726 else if (name
== deleting_dtor_identifier
)
8727 return integer_three_node
;
8728 gcc_checking_assert (name
== base_dtor_identifier
);
8731 return integer_zero_node
;
8734 /* We've built up a constructor call RET. Complain if it delegates to the
8735 constructor we're currently compiling. */
8738 check_self_delegation (tree ret
)
8740 if (TREE_CODE (ret
) == TARGET_EXPR
)
8741 ret
= TARGET_EXPR_INITIAL (ret
);
8742 tree fn
= cp_get_callee_fndecl_nofold (ret
);
8743 if (fn
&& DECL_ABSTRACT_ORIGIN (fn
) == current_function_decl
)
8744 error ("constructor delegates to itself");
8747 /* Build a call to a constructor, destructor, or an assignment
8748 operator for INSTANCE, an expression with class type. NAME
8749 indicates the special member function to call; *ARGS are the
8750 arguments. ARGS may be NULL. This may change ARGS. BINFO
8751 indicates the base of INSTANCE that is to be passed as the `this'
8752 parameter to the member function called.
8754 FLAGS are the LOOKUP_* flags to use when processing the call.
8756 If NAME indicates a complete object constructor, INSTANCE may be
8757 NULL_TREE. In this case, the caller will call build_cplus_new to
8758 store the newly constructed object into a VAR_DECL. */
8761 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
8762 tree binfo
, int flags
, tsubst_flags_t complain
)
8765 /* The type of the subobject to be constructed or destroyed. */
8767 vec
<tree
, va_gc
> *allocated
= NULL
;
8770 gcc_assert (IDENTIFIER_CDTOR_P (name
) || name
== assign_op_identifier
);
8773 /* Resolve the name. */
8774 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
8775 return error_mark_node
;
8777 binfo
= TYPE_BINFO (binfo
);
8780 gcc_assert (binfo
!= NULL_TREE
);
8782 class_type
= BINFO_TYPE (binfo
);
8784 /* Handle the special case where INSTANCE is NULL_TREE. */
8785 if (name
== complete_ctor_identifier
&& !instance
)
8786 instance
= build_dummy_object (class_type
);
8789 if (IDENTIFIER_DTOR_P (name
))
8790 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
8792 /* Convert to the base class, if necessary. */
8793 if (!same_type_ignoring_top_level_qualifiers_p
8794 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
8796 if (IDENTIFIER_CDTOR_P (name
))
8797 /* For constructors and destructors, either the base is
8798 non-virtual, or it is virtual but we are doing the
8799 conversion from a constructor or destructor for the
8800 complete object. In either case, we can convert
8802 instance
= convert_to_base_statically (instance
, binfo
);
8805 /* However, for assignment operators, we must convert
8806 dynamically if the base is virtual. */
8807 gcc_checking_assert (name
== assign_op_identifier
);
8808 instance
= build_base_path (PLUS_EXPR
, instance
,
8809 binfo
, /*nonnull=*/1, complain
);
8814 gcc_assert (instance
!= NULL_TREE
);
8816 /* In C++17, "If the initializer expression is a prvalue and the
8817 cv-unqualified version of the source type is the same class as the class
8818 of the destination, the initializer expression is used to initialize the
8819 destination object." Handle that here to avoid doing overload
8821 if (cxx_dialect
>= cxx17
8822 && args
&& vec_safe_length (*args
) == 1
8823 && name
== complete_ctor_identifier
)
8825 tree arg
= (**args
)[0];
8827 /* FIXME P0135 doesn't say how to handle direct initialization from a
8828 type with a suitable conversion operator. Let's handle it like
8829 copy-initialization, but allowing explict conversions. */
8830 tsubst_flags_t sub_complain
= tf_warning
;
8831 if (!is_dummy_object (instance
))
8832 /* If we're using this to initialize a non-temporary object, don't
8833 require the destructor to be accessible. */
8834 sub_complain
|= tf_no_cleanup
;
8835 if (BRACE_ENCLOSED_INITIALIZER_P (arg
)
8836 && !CONSTRUCTOR_IS_DIRECT_INIT (arg
))
8837 /* An init-list arg needs to convert to the parm type (83937), so fall
8838 through to normal processing. */
8839 arg
= error_mark_node
;
8840 else if (!reference_related_p (class_type
, TREE_TYPE (arg
)))
8841 arg
= perform_implicit_conversion_flags (class_type
, arg
,
8844 if ((TREE_CODE (arg
) == TARGET_EXPR
8845 || TREE_CODE (arg
) == CONSTRUCTOR
)
8846 && (same_type_ignoring_top_level_qualifiers_p
8847 (class_type
, TREE_TYPE (arg
))))
8849 if (is_dummy_object (instance
))
8851 else if (TREE_CODE (arg
) == TARGET_EXPR
)
8852 TARGET_EXPR_DIRECT_INIT_P (arg
) = true;
8854 if ((complain
& tf_error
)
8855 && (flags
& LOOKUP_DELEGATING_CONS
))
8856 check_self_delegation (arg
);
8857 /* Avoid change of behavior on Wunused-var-2.C. */
8858 instance
= mark_lvalue_use (instance
);
8859 return build2 (INIT_EXPR
, class_type
, instance
, arg
);
8863 fns
= lookup_fnfields (binfo
, name
, 1);
8865 /* When making a call to a constructor or destructor for a subobject
8866 that uses virtual base classes, pass down a pointer to a VTT for
8868 if ((name
== base_ctor_identifier
8869 || name
== base_dtor_identifier
)
8870 && CLASSTYPE_VBASECLASSES (class_type
))
8875 /* If the current function is a complete object constructor
8876 or destructor, then we fetch the VTT directly.
8877 Otherwise, we look it up using the VTT we were given. */
8878 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
8879 vtt
= decay_conversion (vtt
, complain
);
8880 if (vtt
== error_mark_node
)
8881 return error_mark_node
;
8882 vtt
= build_if_in_charge (vtt
, current_vtt_parm
);
8883 if (BINFO_SUBVTT_INDEX (binfo
))
8884 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
8890 allocated
= make_tree_vector ();
8894 vec_safe_insert (*args
, 0, sub_vtt
);
8897 ret
= build_new_method_call (instance
, fns
, args
,
8898 TYPE_BINFO (BINFO_TYPE (binfo
)),
8902 if (allocated
!= NULL
)
8903 release_tree_vector (allocated
);
8905 if ((complain
& tf_error
)
8906 && (flags
& LOOKUP_DELEGATING_CONS
)
8907 && name
== complete_ctor_identifier
)
8908 check_self_delegation (ret
);
8913 /* Return the NAME, as a C string. The NAME indicates a function that
8914 is a member of TYPE. *FREE_P is set to true if the caller must
8915 free the memory returned.
8917 Rather than go through all of this, we should simply set the names
8918 of constructors and destructors appropriately, and dispense with
8919 ctor_identifier, dtor_identifier, etc. */
8922 name_as_c_string (tree name
, tree type
, bool *free_p
)
8924 const char *pretty_name
;
8926 /* Assume that we will not allocate memory. */
8928 /* Constructors and destructors are special. */
8929 if (IDENTIFIER_CDTOR_P (name
))
8932 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
)));
8933 /* For a destructor, add the '~'. */
8934 if (IDENTIFIER_DTOR_P (name
))
8936 pretty_name
= concat ("~", pretty_name
, NULL
);
8937 /* Remember that we need to free the memory allocated. */
8941 else if (IDENTIFIER_CONV_OP_P (name
))
8943 pretty_name
= concat ("operator ",
8944 type_as_string_translate (TREE_TYPE (name
),
8945 TFF_PLAIN_IDENTIFIER
),
8947 /* Remember that we need to free the memory allocated. */
8951 pretty_name
= identifier_to_locale (IDENTIFIER_POINTER (name
));
8953 return CONST_CAST (char *, pretty_name
);
8956 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
8957 be set, upon return, to the function called. ARGS may be NULL.
8958 This may change ARGS. */
8961 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
8962 tree conversion_path
, int flags
,
8963 tree
*fn_p
, tsubst_flags_t complain
)
8965 struct z_candidate
*candidates
= 0, *cand
;
8966 tree explicit_targs
= NULL_TREE
;
8967 tree basetype
= NULL_TREE
;
8968 tree access_binfo
, binfo
;
8970 tree first_mem_arg
= NULL_TREE
;
8972 bool skip_first_for_error
;
8973 vec
<tree
, va_gc
> *user_args
;
8976 int template_only
= 0;
8980 vec
<tree
, va_gc
> *orig_args
= NULL
;
8983 gcc_assert (instance
!= NULL_TREE
);
8985 /* We don't know what function we're going to call, yet. */
8989 if (error_operand_p (instance
)
8990 || !fns
|| error_operand_p (fns
))
8991 return error_mark_node
;
8993 if (!BASELINK_P (fns
))
8995 if (complain
& tf_error
)
8996 error ("call to non-function %qD", fns
);
8997 return error_mark_node
;
9000 orig_instance
= instance
;
9003 /* Dismantle the baselink to collect all the information we need. */
9004 if (!conversion_path
)
9005 conversion_path
= BASELINK_BINFO (fns
);
9006 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
9007 binfo
= BASELINK_BINFO (fns
);
9008 optype
= BASELINK_OPTYPE (fns
);
9009 fns
= BASELINK_FUNCTIONS (fns
);
9010 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
9012 explicit_targs
= TREE_OPERAND (fns
, 1);
9013 fns
= TREE_OPERAND (fns
, 0);
9016 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
9017 || TREE_CODE (fns
) == TEMPLATE_DECL
9018 || TREE_CODE (fns
) == OVERLOAD
);
9019 fn
= OVL_FIRST (fns
);
9020 name
= DECL_NAME (fn
);
9022 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
9023 gcc_assert (CLASS_TYPE_P (basetype
));
9025 if (processing_template_decl
)
9027 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
9028 instance
= build_non_dependent_expr (instance
);
9030 make_args_non_dependent (*args
);
9033 user_args
= args
== NULL
? NULL
: *args
;
9034 /* Under DR 147 A::A() is an invalid constructor call,
9035 not a functional cast. */
9036 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
9038 if (! (complain
& tf_error
))
9039 return error_mark_node
;
9041 basetype
= DECL_CONTEXT (fn
);
9042 name
= constructor_name (basetype
);
9043 if (permerror (input_location
,
9044 "cannot call constructor %<%T::%D%> directly",
9046 inform (input_location
, "for a function-style cast, remove the "
9047 "redundant %<::%D%>", name
);
9048 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
9053 /* Process the argument list. */
9054 if (args
!= NULL
&& *args
!= NULL
)
9056 *args
= resolve_args (*args
, complain
);
9058 return error_mark_node
;
9061 /* Consider the object argument to be used even if we end up selecting a
9062 static member function. */
9063 instance
= mark_type_use (instance
);
9065 /* Figure out whether to skip the first argument for the error
9066 message we will display to users if an error occurs. We don't
9067 want to display any compiler-generated arguments. The "this"
9068 pointer hasn't been added yet. However, we must remove the VTT
9069 pointer if this is a call to a base-class constructor or
9071 skip_first_for_error
= false;
9072 if (IDENTIFIER_CDTOR_P (name
))
9074 /* Callers should explicitly indicate whether they want to ctor
9075 the complete object or just the part without virtual bases. */
9076 gcc_assert (name
!= ctor_identifier
);
9078 /* Remove the VTT pointer, if present. */
9079 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
9080 && CLASSTYPE_VBASECLASSES (basetype
))
9081 skip_first_for_error
= true;
9083 /* It's OK to call destructors and constructors on cv-qualified
9084 objects. Therefore, convert the INSTANCE to the unqualified
9085 type, if necessary. */
9086 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
9088 instance
= build_this (instance
);
9089 instance
= build_nop (build_pointer_type (basetype
), instance
);
9090 instance
= build_fold_indirect_ref (instance
);
9094 gcc_assert (!DECL_DESTRUCTOR_P (fn
) && !DECL_CONSTRUCTOR_P (fn
));
9096 /* For the overload resolution we need to find the actual `this`
9097 that would be captured if the call turns out to be to a
9098 non-static member function. Do not actually capture it at this
9100 if (DECL_CONSTRUCTOR_P (fn
))
9101 /* Constructors don't use the enclosing 'this'. */
9102 first_mem_arg
= instance
;
9104 first_mem_arg
= maybe_resolve_dummy (instance
, false);
9106 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9107 p
= conversion_obstack_alloc (0);
9109 /* The number of arguments artificial parms in ARGS; we subtract one because
9110 there's no 'this' in ARGS. */
9111 unsigned skip
= num_artificial_parms_for (fn
) - 1;
9113 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
9114 initializer, not T({ }). */
9115 if (DECL_CONSTRUCTOR_P (fn
)
9116 && vec_safe_length (user_args
) > skip
9117 && DIRECT_LIST_INIT_P ((*user_args
)[skip
]))
9119 tree init_list
= (*user_args
)[skip
];
9120 tree init
= NULL_TREE
;
9122 gcc_assert (user_args
->length () == skip
+ 1
9123 && !(flags
& LOOKUP_ONLYCONVERTING
));
9125 /* If the initializer list has no elements and T is a class type with
9126 a default constructor, the object is value-initialized. Handle
9127 this here so we don't need to handle it wherever we use
9128 build_special_member_call. */
9129 if (CONSTRUCTOR_NELTS (init_list
) == 0
9130 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
9131 /* For a user-provided default constructor, use the normal
9132 mechanisms so that protected access works. */
9133 && type_has_non_user_provided_default_constructor (basetype
)
9134 && !processing_template_decl
)
9135 init
= build_value_init (basetype
, complain
);
9137 /* If BASETYPE is an aggregate, we need to do aggregate
9139 else if (CP_AGGREGATE_TYPE_P (basetype
))
9141 init
= reshape_init (basetype
, init_list
, complain
);
9142 init
= digest_init (basetype
, init
, complain
);
9147 if (is_dummy_object (instance
))
9148 return get_target_expr_sfinae (init
, complain
);
9149 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
9150 TREE_SIDE_EFFECTS (init
) = true;
9154 /* Otherwise go ahead with overload resolution. */
9155 add_list_candidates (fns
, first_mem_arg
, user_args
,
9156 basetype
, explicit_targs
, template_only
,
9157 conversion_path
, access_binfo
, flags
,
9158 &candidates
, complain
);
9161 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
9162 explicit_targs
, template_only
, conversion_path
,
9163 access_binfo
, flags
, &candidates
, complain
);
9165 any_viable_p
= false;
9166 candidates
= splice_viable (candidates
, false, &any_viable_p
);
9170 if (complain
& tf_error
)
9172 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
9173 cxx_incomplete_type_error (instance
, basetype
);
9175 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9176 basetype
, optype
, build_tree_list_vec (user_args
),
9177 TREE_TYPE (instance
));
9180 tree arglist
= build_tree_list_vec (user_args
);
9181 tree errname
= name
;
9182 bool twiddle
= false;
9183 if (IDENTIFIER_CDTOR_P (errname
))
9185 twiddle
= IDENTIFIER_DTOR_P (errname
);
9186 errname
= constructor_name (basetype
);
9189 errname
= lookup_template_function (errname
, explicit_targs
);
9190 if (skip_first_for_error
)
9191 arglist
= TREE_CHAIN (arglist
);
9192 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
9193 basetype
, &"~"[!twiddle
], errname
, arglist
,
9194 TREE_TYPE (instance
));
9196 print_z_candidates (location_of (name
), candidates
);
9198 call
= error_mark_node
;
9202 cand
= tourney (candidates
, complain
);
9209 if (complain
& tf_error
)
9211 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
9212 arglist
= build_tree_list_vec (user_args
);
9213 if (skip_first_for_error
)
9214 arglist
= TREE_CHAIN (arglist
);
9215 if (!any_strictly_viable (candidates
))
9216 error ("no matching function for call to %<%s(%A)%>",
9217 pretty_name
, arglist
);
9219 error ("call of overloaded %<%s(%A)%> is ambiguous",
9220 pretty_name
, arglist
);
9221 print_z_candidates (location_of (name
), candidates
);
9225 call
= error_mark_node
;
9232 if (!(flags
& LOOKUP_NONVIRTUAL
)
9233 && DECL_PURE_VIRTUAL_P (fn
)
9234 && instance
== current_class_ref
9235 && (complain
& tf_warning
))
9237 /* This is not an error, it is runtime undefined
9239 if (!current_function_decl
)
9240 warning (0, "pure virtual %q#D called from "
9241 "non-static data member initializer", fn
);
9242 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
9243 || DECL_DESTRUCTOR_P (current_function_decl
))
9244 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
9245 ? G_("pure virtual %q#D called from constructor")
9246 : G_("pure virtual %q#D called from destructor")),
9250 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
9251 && !DECL_CONSTRUCTOR_P (fn
)
9252 && is_dummy_object (instance
))
9254 instance
= maybe_resolve_dummy (instance
, true);
9255 if (instance
== error_mark_node
)
9256 call
= error_mark_node
;
9257 else if (!is_dummy_object (instance
))
9259 /* We captured 'this' in the current lambda now that
9260 we know we really need it. */
9261 cand
->first_arg
= instance
;
9263 else if (any_dependent_bases_p ())
9264 /* We can't tell until instantiation time whether we can use
9265 *this as the implicit object argument. */;
9268 if (complain
& tf_error
)
9269 error ("cannot call member function %qD without object",
9271 call
= error_mark_node
;
9275 if (call
!= error_mark_node
)
9277 /* Optimize away vtable lookup if we know that this
9278 function can't be overridden. We need to check if
9279 the context and the type where we found fn are the same,
9280 actually FN might be defined in a different class
9281 type because of a using-declaration. In this case, we
9282 do not want to perform a non-virtual call. */
9283 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
9284 && same_type_ignoring_top_level_qualifiers_p
9285 (DECL_CONTEXT (fn
), BINFO_TYPE (binfo
))
9286 && resolves_to_fixed_type_p (instance
, 0))
9287 flags
|= LOOKUP_NONVIRTUAL
;
9289 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
9290 /* Now we know what function is being called. */
9293 /* Build the actual CALL_EXPR. */
9294 call
= build_over_call (cand
, flags
, complain
);
9295 /* In an expression of the form `a->f()' where `f' turns
9296 out to be a static member function, `a' is
9297 none-the-less evaluated. */
9298 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
9299 && !is_dummy_object (instance
)
9300 && TREE_SIDE_EFFECTS (instance
))
9302 /* But avoid the implicit lvalue-rvalue conversion when 'a'
9305 if (TREE_THIS_VOLATILE (a
))
9307 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
), a
, call
);
9309 else if (call
!= error_mark_node
9310 && DECL_DESTRUCTOR_P (cand
->fn
)
9311 && !VOID_TYPE_P (TREE_TYPE (call
)))
9312 /* An explicit call of the form "x->~X()" has type
9313 "void". However, on platforms where destructors
9314 return "this" (i.e., those where
9315 targetm.cxx.cdtor_returns_this is true), such calls
9316 will appear to have a return value of pointer type
9317 to the low-level call machinery. We do not want to
9318 change the low-level machinery, since we want to be
9319 able to optimize "delete f()" on such platforms as
9320 "operator delete(~X(f()))" (rather than generating
9321 "t = f(), ~X(t), operator delete (t)"). */
9322 call
= build_nop (void_type_node
, call
);
9327 if (processing_template_decl
&& call
!= error_mark_node
)
9329 bool cast_to_void
= false;
9331 if (TREE_CODE (call
) == COMPOUND_EXPR
)
9332 call
= TREE_OPERAND (call
, 1);
9333 else if (TREE_CODE (call
) == NOP_EXPR
)
9335 cast_to_void
= true;
9336 call
= TREE_OPERAND (call
, 0);
9338 if (INDIRECT_REF_P (call
))
9339 call
= TREE_OPERAND (call
, 0);
9340 call
= (build_min_non_dep_call_vec
9342 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
9343 orig_instance
, orig_fns
, NULL_TREE
),
9345 SET_EXPR_LOCATION (call
, input_location
);
9346 call
= convert_from_reference (call
);
9348 call
= build_nop (void_type_node
, call
);
9351 /* Free all the conversions we allocated. */
9352 obstack_free (&conversion_obstack
, p
);
9354 if (orig_args
!= NULL
)
9355 release_tree_vector (orig_args
);
9360 /* Wrapper for above. */
9363 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9364 tree conversion_path
, int flags
,
9365 tree
*fn_p
, tsubst_flags_t complain
)
9368 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
9369 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
9371 timevar_cond_stop (TV_OVERLOAD
, subtime
);
9375 /* Returns true iff standard conversion sequence ICS1 is a proper
9376 subsequence of ICS2. */
9379 is_subseq (conversion
*ics1
, conversion
*ics2
)
9381 /* We can assume that a conversion of the same code
9382 between the same types indicates a subsequence since we only get
9383 here if the types we are converting from are the same. */
9385 while (ics1
->kind
== ck_rvalue
9386 || ics1
->kind
== ck_lvalue
)
9387 ics1
= next_conversion (ics1
);
9391 while (ics2
->kind
== ck_rvalue
9392 || ics2
->kind
== ck_lvalue
)
9393 ics2
= next_conversion (ics2
);
9395 if (ics2
->kind
== ck_user
9396 || ics2
->kind
== ck_ambig
9397 || ics2
->kind
== ck_aggr
9398 || ics2
->kind
== ck_list
9399 || ics2
->kind
== ck_identity
)
9400 /* At this point, ICS1 cannot be a proper subsequence of
9401 ICS2. We can get a USER_CONV when we are comparing the
9402 second standard conversion sequence of two user conversion
9406 ics2
= next_conversion (ics2
);
9408 while (ics2
->kind
== ck_rvalue
9409 || ics2
->kind
== ck_lvalue
)
9410 ics2
= next_conversion (ics2
);
9412 if (ics2
->kind
== ics1
->kind
9413 && same_type_p (ics2
->type
, ics1
->type
)
9414 && (ics1
->kind
== ck_identity
9415 || same_type_p (next_conversion (ics2
)->type
,
9416 next_conversion (ics1
)->type
)))
9421 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
9422 be any _TYPE nodes. */
9425 is_properly_derived_from (tree derived
, tree base
)
9427 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
9430 /* We only allow proper derivation here. The DERIVED_FROM_P macro
9431 considers every class derived from itself. */
9432 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
9433 && DERIVED_FROM_P (base
, derived
));
9436 /* We build the ICS for an implicit object parameter as a pointer
9437 conversion sequence. However, such a sequence should be compared
9438 as if it were a reference conversion sequence. If ICS is the
9439 implicit conversion sequence for an implicit object parameter,
9440 modify it accordingly. */
9443 maybe_handle_implicit_object (conversion
**ics
)
9447 /* [over.match.funcs]
9449 For non-static member functions, the type of the
9450 implicit object parameter is "reference to cv X"
9451 where X is the class of which the function is a
9452 member and cv is the cv-qualification on the member
9453 function declaration. */
9454 conversion
*t
= *ics
;
9455 tree reference_type
;
9457 /* The `this' parameter is a pointer to a class type. Make the
9458 implicit conversion talk about a reference to that same class
9460 reference_type
= TREE_TYPE (t
->type
);
9461 reference_type
= build_reference_type (reference_type
);
9463 if (t
->kind
== ck_qual
)
9464 t
= next_conversion (t
);
9465 if (t
->kind
== ck_ptr
)
9466 t
= next_conversion (t
);
9467 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
9468 t
= direct_reference_binding (reference_type
, t
);
9470 t
->rvaluedness_matches_p
= 0;
9475 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
9476 and return the initial reference binding conversion. Otherwise,
9477 leave *ICS unchanged and return NULL. */
9480 maybe_handle_ref_bind (conversion
**ics
)
9482 if ((*ics
)->kind
== ck_ref_bind
)
9484 conversion
*old_ics
= *ics
;
9485 *ics
= next_conversion (old_ics
);
9486 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
9493 /* Compare two implicit conversion sequences according to the rules set out in
9494 [over.ics.rank]. Return values:
9496 1: ics1 is better than ics2
9497 -1: ics2 is better than ics1
9498 0: ics1 and ics2 are indistinguishable */
9501 compare_ics (conversion
*ics1
, conversion
*ics2
)
9507 tree deref_from_type1
= NULL_TREE
;
9508 tree deref_from_type2
= NULL_TREE
;
9509 tree deref_to_type1
= NULL_TREE
;
9510 tree deref_to_type2
= NULL_TREE
;
9511 conversion_rank rank1
, rank2
;
9513 /* REF_BINDING is nonzero if the result of the conversion sequence
9514 is a reference type. In that case REF_CONV is the reference
9515 binding conversion. */
9516 conversion
*ref_conv1
;
9517 conversion
*ref_conv2
;
9519 /* Compare badness before stripping the reference conversion. */
9520 if (ics1
->bad_p
> ics2
->bad_p
)
9522 else if (ics1
->bad_p
< ics2
->bad_p
)
9525 /* Handle implicit object parameters. */
9526 maybe_handle_implicit_object (&ics1
);
9527 maybe_handle_implicit_object (&ics2
);
9529 /* Handle reference parameters. */
9530 ref_conv1
= maybe_handle_ref_bind (&ics1
);
9531 ref_conv2
= maybe_handle_ref_bind (&ics2
);
9533 /* List-initialization sequence L1 is a better conversion sequence than
9534 list-initialization sequence L2 if L1 converts to
9535 std::initializer_list<X> for some X and L2 does not. */
9536 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
9538 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
9543 When comparing the basic forms of implicit conversion sequences (as
9544 defined in _over.best.ics_)
9546 --a standard conversion sequence (_over.ics.scs_) is a better
9547 conversion sequence than a user-defined conversion sequence
9548 or an ellipsis conversion sequence, and
9550 --a user-defined conversion sequence (_over.ics.user_) is a
9551 better conversion sequence than an ellipsis conversion sequence
9552 (_over.ics.ellipsis_). */
9553 /* Use BAD_CONVERSION_RANK because we already checked for a badness
9554 mismatch. If both ICS are bad, we try to make a decision based on
9555 what would have happened if they'd been good. This is not an
9556 extension, we'll still give an error when we build up the call; this
9557 just helps us give a more helpful error message. */
9558 rank1
= BAD_CONVERSION_RANK (ics1
);
9559 rank2
= BAD_CONVERSION_RANK (ics2
);
9563 else if (rank1
< rank2
)
9566 if (ics1
->ellipsis_p
)
9567 /* Both conversions are ellipsis conversions. */
9570 /* User-defined conversion sequence U1 is a better conversion sequence
9571 than another user-defined conversion sequence U2 if they contain the
9572 same user-defined conversion operator or constructor and if the sec-
9573 ond standard conversion sequence of U1 is better than the second
9574 standard conversion sequence of U2. */
9576 /* Handle list-conversion with the same code even though it isn't always
9577 ranked as a user-defined conversion and it doesn't have a second
9578 standard conversion sequence; it will still have the desired effect.
9579 Specifically, we need to do the reference binding comparison at the
9580 end of this function. */
9582 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
|| ics1
->kind
== ck_aggr
)
9587 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
9588 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
9589 || t1
->kind
== ck_list
)
9591 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
9592 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
9593 || t2
->kind
== ck_list
)
9596 if (t1
->kind
!= t2
->kind
)
9598 else if (t1
->kind
== ck_user
)
9600 tree f1
= t1
->cand
? t1
->cand
->fn
: t1
->type
;
9601 tree f2
= t2
->cand
? t2
->cand
->fn
: t2
->type
;
9607 /* For ambiguous or aggregate conversions, use the target type as
9608 a proxy for the conversion function. */
9609 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
9613 /* We can just fall through here, after setting up
9614 FROM_TYPE1 and FROM_TYPE2. */
9615 from_type1
= t1
->type
;
9616 from_type2
= t2
->type
;
9623 /* We're dealing with two standard conversion sequences.
9627 Standard conversion sequence S1 is a better conversion
9628 sequence than standard conversion sequence S2 if
9630 --S1 is a proper subsequence of S2 (comparing the conversion
9631 sequences in the canonical form defined by _over.ics.scs_,
9632 excluding any Lvalue Transformation; the identity
9633 conversion sequence is considered to be a subsequence of
9634 any non-identity conversion sequence */
9637 while (t1
->kind
!= ck_identity
)
9638 t1
= next_conversion (t1
);
9639 from_type1
= t1
->type
;
9642 while (t2
->kind
!= ck_identity
)
9643 t2
= next_conversion (t2
);
9644 from_type2
= t2
->type
;
9647 /* One sequence can only be a subsequence of the other if they start with
9648 the same type. They can start with different types when comparing the
9649 second standard conversion sequence in two user-defined conversion
9651 if (same_type_p (from_type1
, from_type2
))
9653 if (is_subseq (ics1
, ics2
))
9655 if (is_subseq (ics2
, ics1
))
9663 --the rank of S1 is better than the rank of S2 (by the rules
9666 Standard conversion sequences are ordered by their ranks: an Exact
9667 Match is a better conversion than a Promotion, which is a better
9668 conversion than a Conversion.
9670 Two conversion sequences with the same rank are indistinguishable
9671 unless one of the following rules applies:
9673 --A conversion that does not a convert a pointer, pointer to member,
9674 or std::nullptr_t to bool is better than one that does.
9676 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
9677 so that we do not have to check it explicitly. */
9678 if (ics1
->rank
< ics2
->rank
)
9680 else if (ics2
->rank
< ics1
->rank
)
9683 to_type1
= ics1
->type
;
9684 to_type2
= ics2
->type
;
9686 /* A conversion from scalar arithmetic type to complex is worse than a
9687 conversion between scalar arithmetic types. */
9688 if (same_type_p (from_type1
, from_type2
)
9689 && ARITHMETIC_TYPE_P (from_type1
)
9690 && ARITHMETIC_TYPE_P (to_type1
)
9691 && ARITHMETIC_TYPE_P (to_type2
)
9692 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
9693 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
9695 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
9701 if (TYPE_PTR_P (from_type1
)
9702 && TYPE_PTR_P (from_type2
)
9703 && TYPE_PTR_P (to_type1
)
9704 && TYPE_PTR_P (to_type2
))
9706 deref_from_type1
= TREE_TYPE (from_type1
);
9707 deref_from_type2
= TREE_TYPE (from_type2
);
9708 deref_to_type1
= TREE_TYPE (to_type1
);
9709 deref_to_type2
= TREE_TYPE (to_type2
);
9711 /* The rules for pointers to members A::* are just like the rules
9712 for pointers A*, except opposite: if B is derived from A then
9713 A::* converts to B::*, not vice versa. For that reason, we
9714 switch the from_ and to_ variables here. */
9715 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
9716 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
9717 || (TYPE_PTRMEMFUNC_P (from_type1
)
9718 && TYPE_PTRMEMFUNC_P (from_type2
)
9719 && TYPE_PTRMEMFUNC_P (to_type1
)
9720 && TYPE_PTRMEMFUNC_P (to_type2
)))
9722 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
9723 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
9724 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
9725 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
9728 if (deref_from_type1
!= NULL_TREE
9729 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
9730 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
9732 /* This was one of the pointer or pointer-like conversions.
9736 --If class B is derived directly or indirectly from class A,
9737 conversion of B* to A* is better than conversion of B* to
9738 void*, and conversion of A* to void* is better than
9739 conversion of B* to void*. */
9740 if (VOID_TYPE_P (deref_to_type1
)
9741 && VOID_TYPE_P (deref_to_type2
))
9743 if (is_properly_derived_from (deref_from_type1
,
9746 else if (is_properly_derived_from (deref_from_type2
,
9750 else if (VOID_TYPE_P (deref_to_type1
)
9751 || VOID_TYPE_P (deref_to_type2
))
9753 if (same_type_p (deref_from_type1
, deref_from_type2
))
9755 if (VOID_TYPE_P (deref_to_type2
))
9757 if (is_properly_derived_from (deref_from_type1
,
9761 /* We know that DEREF_TO_TYPE1 is `void' here. */
9762 else if (is_properly_derived_from (deref_from_type1
,
9767 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
9768 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
9772 --If class B is derived directly or indirectly from class A
9773 and class C is derived directly or indirectly from B,
9775 --conversion of C* to B* is better than conversion of C* to
9778 --conversion of B* to A* is better than conversion of C* to
9780 if (same_type_p (deref_from_type1
, deref_from_type2
))
9782 if (is_properly_derived_from (deref_to_type1
,
9785 else if (is_properly_derived_from (deref_to_type2
,
9789 else if (same_type_p (deref_to_type1
, deref_to_type2
))
9791 if (is_properly_derived_from (deref_from_type2
,
9794 else if (is_properly_derived_from (deref_from_type1
,
9800 else if (CLASS_TYPE_P (non_reference (from_type1
))
9801 && same_type_p (from_type1
, from_type2
))
9803 tree from
= non_reference (from_type1
);
9807 --binding of an expression of type C to a reference of type
9808 B& is better than binding an expression of type C to a
9809 reference of type A&
9811 --conversion of C to B is better than conversion of C to A, */
9812 if (is_properly_derived_from (from
, to_type1
)
9813 && is_properly_derived_from (from
, to_type2
))
9815 if (is_properly_derived_from (to_type1
, to_type2
))
9817 else if (is_properly_derived_from (to_type2
, to_type1
))
9821 else if (CLASS_TYPE_P (non_reference (to_type1
))
9822 && same_type_p (to_type1
, to_type2
))
9824 tree to
= non_reference (to_type1
);
9828 --binding of an expression of type B to a reference of type
9829 A& is better than binding an expression of type C to a
9830 reference of type A&,
9832 --conversion of B to A is better than conversion of C to A */
9833 if (is_properly_derived_from (from_type1
, to
)
9834 && is_properly_derived_from (from_type2
, to
))
9836 if (is_properly_derived_from (from_type2
, from_type1
))
9838 else if (is_properly_derived_from (from_type1
, from_type2
))
9845 --S1 and S2 differ only in their qualification conversion and yield
9846 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
9847 qualification signature of type T1 is a proper subset of the cv-
9848 qualification signature of type T2 */
9849 if (ics1
->kind
== ck_qual
9850 && ics2
->kind
== ck_qual
9851 && same_type_p (from_type1
, from_type2
))
9853 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
9860 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
9861 to an implicit object parameter of a non-static member function
9862 declared without a ref-qualifier, and either S1 binds an lvalue
9863 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
9864 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
9865 draft standard, 13.3.3.2)
9867 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
9868 types to which the references refer are the same type except for
9869 top-level cv-qualifiers, and the type to which the reference
9870 initialized by S2 refers is more cv-qualified than the type to
9871 which the reference initialized by S1 refers.
9873 DR 1328 [over.match.best]: the context is an initialization by
9874 conversion function for direct reference binding (13.3.1.6) of a
9875 reference to function type, the return type of F1 is the same kind of
9876 reference (i.e. lvalue or rvalue) as the reference being initialized,
9877 and the return type of F2 is not. */
9879 if (ref_conv1
&& ref_conv2
)
9881 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
9882 && (ref_conv1
->rvaluedness_matches_p
9883 != ref_conv2
->rvaluedness_matches_p
)
9884 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
9885 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
9886 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
9888 if (ref_conv1
->bad_p
9889 && !same_type_p (TREE_TYPE (ref_conv1
->type
),
9890 TREE_TYPE (ref_conv2
->type
)))
9891 /* Don't prefer a bad conversion that drops cv-quals to a bad
9892 conversion with the wrong rvalueness. */
9894 return (ref_conv1
->rvaluedness_matches_p
9895 - ref_conv2
->rvaluedness_matches_p
);
9898 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
9900 int q1
= cp_type_quals (TREE_TYPE (ref_conv1
->type
));
9901 int q2
= cp_type_quals (TREE_TYPE (ref_conv2
->type
));
9902 if (ref_conv1
->bad_p
)
9904 /* Prefer the one that drops fewer cv-quals. */
9905 tree ftype
= next_conversion (ref_conv1
)->type
;
9906 int fquals
= cp_type_quals (ftype
);
9910 return comp_cv_qualification (q2
, q1
);
9914 /* Neither conversion sequence is better than the other. */
9918 /* The source type for this standard conversion sequence. */
9921 source_type (conversion
*t
)
9923 for (;; t
= next_conversion (t
))
9925 if (t
->kind
== ck_user
9926 || t
->kind
== ck_ambig
9927 || t
->kind
== ck_identity
)
9933 /* Note a warning about preferring WINNER to LOSER. We do this by storing
9934 a pointer to LOSER and re-running joust to produce the warning if WINNER
9935 is actually used. */
9938 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
9940 candidate_warning
*cw
= (candidate_warning
*)
9941 conversion_obstack_alloc (sizeof (candidate_warning
));
9943 cw
->next
= winner
->warnings
;
9944 winner
->warnings
= cw
;
9947 /* Compare two candidates for overloading as described in
9948 [over.match.best]. Return values:
9950 1: cand1 is better than cand2
9951 -1: cand2 is better than cand1
9952 0: cand1 and cand2 are indistinguishable */
9955 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
9956 tsubst_flags_t complain
)
9959 int off1
= 0, off2
= 0;
9963 /* Candidates that involve bad conversions are always worse than those
9965 if (cand1
->viable
> cand2
->viable
)
9967 if (cand1
->viable
< cand2
->viable
)
9970 /* If we have two pseudo-candidates for conversions to the same type,
9971 or two candidates for the same function, arbitrarily pick one. */
9972 if (cand1
->fn
== cand2
->fn
9973 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
9976 /* Prefer a non-deleted function over an implicitly deleted move
9977 constructor or assignment operator. This differs slightly from the
9978 wording for issue 1402 (which says the move op is ignored by overload
9979 resolution), but this way produces better error messages. */
9980 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
9981 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
9982 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
9984 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
9985 && move_fn_p (cand1
->fn
))
9987 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
9988 && move_fn_p (cand2
->fn
))
9992 /* a viable function F1
9993 is defined to be a better function than another viable function F2 if
9994 for all arguments i, ICSi(F1) is not a worse conversion sequence than
9995 ICSi(F2), and then */
9997 /* for some argument j, ICSj(F1) is a better conversion sequence than
10000 /* For comparing static and non-static member functions, we ignore
10001 the implicit object parameter of the non-static function. The
10002 standard says to pretend that the static function has an object
10003 parm, but that won't work with operator overloading. */
10004 len
= cand1
->num_convs
;
10005 if (len
!= cand2
->num_convs
)
10007 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
10008 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
10010 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
10011 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
10012 /* We're comparing a near-match list constructor and a near-match
10013 non-list constructor. Just treat them as unordered. */
10016 gcc_assert (static_1
!= static_2
);
10027 for (i
= 0; i
< len
; ++i
)
10029 conversion
*t1
= cand1
->convs
[i
+ off1
];
10030 conversion
*t2
= cand2
->convs
[i
+ off2
];
10031 int comp
= compare_ics (t1
, t2
);
10035 if ((complain
& tf_warning
)
10037 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
10038 == cr_std
+ cr_promotion
)
10039 && t1
->kind
== ck_std
10040 && t2
->kind
== ck_std
10041 && TREE_CODE (t1
->type
) == INTEGER_TYPE
10042 && TREE_CODE (t2
->type
) == INTEGER_TYPE
10043 && (TYPE_PRECISION (t1
->type
)
10044 == TYPE_PRECISION (t2
->type
))
10045 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
10046 || (TREE_CODE (next_conversion (t1
)->type
)
10047 == ENUMERAL_TYPE
)))
10049 tree type
= next_conversion (t1
)->type
;
10051 struct z_candidate
*w
, *l
;
10053 type1
= t1
->type
, type2
= t2
->type
,
10054 w
= cand1
, l
= cand2
;
10056 type1
= t2
->type
, type2
= t1
->type
,
10057 w
= cand2
, l
= cand1
;
10061 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
10062 type
, type1
, type2
);
10063 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
10066 add_warning (w
, l
);
10069 if (winner
&& comp
!= winner
)
10078 /* warn about confusing overload resolution for user-defined conversions,
10079 either between a constructor and a conversion op, or between two
10081 if ((complain
& tf_warning
)
10082 && winner
&& warn_conversion
&& cand1
->second_conv
10083 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
10084 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
10086 struct z_candidate
*w
, *l
;
10087 bool give_warning
= false;
10090 w
= cand1
, l
= cand2
;
10092 w
= cand2
, l
= cand1
;
10094 /* We don't want to complain about `X::operator T1 ()'
10095 beating `X::operator T2 () const', when T2 is a no less
10096 cv-qualified version of T1. */
10097 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
10098 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
10100 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
10101 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
10103 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
10108 if (!comp_ptr_ttypes (t
, f
))
10109 give_warning
= true;
10112 give_warning
= true;
10118 tree source
= source_type (w
->convs
[0]);
10119 if (POINTER_TYPE_P (source
))
10120 source
= TREE_TYPE (source
);
10121 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
10122 && warning (OPT_Wconversion
, " for conversion from %qH to %qI",
10123 source
, w
->second_conv
->type
))
10125 inform (input_location
, " because conversion sequence for the argument is better");
10129 add_warning (w
, l
);
10135 /* DR 495 moved this tiebreaker above the template ones. */
10136 /* or, if not that,
10137 the context is an initialization by user-defined conversion (see
10138 _dcl.init_ and _over.match.user_) and the standard conversion
10139 sequence from the return type of F1 to the destination type (i.e.,
10140 the type of the entity being initialized) is a better conversion
10141 sequence than the standard conversion sequence from the return type
10142 of F2 to the destination type. */
10144 if (cand1
->second_conv
)
10146 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
10151 /* or, if not that,
10152 F1 is a non-template function and F2 is a template function
10155 if (!cand1
->template_decl
&& cand2
->template_decl
)
10157 else if (cand1
->template_decl
&& !cand2
->template_decl
)
10160 /* or, if not that,
10161 F1 and F2 are template functions and the function template for F1 is
10162 more specialized than the template for F2 according to the partial
10165 if (cand1
->template_decl
&& cand2
->template_decl
)
10167 winner
= more_specialized_fn
10168 (TI_TEMPLATE (cand1
->template_decl
),
10169 TI_TEMPLATE (cand2
->template_decl
),
10170 /* [temp.func.order]: The presence of unused ellipsis and default
10171 arguments has no effect on the partial ordering of function
10172 templates. add_function_candidate() will not have
10173 counted the "this" argument for constructors. */
10174 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
10180 // or, if not that, F1 is more constrained than F2.
10181 if (flag_concepts
&& DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
))
10183 winner
= more_constrained (cand1
->fn
, cand2
->fn
);
10188 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
10189 if (deduction_guide_p (cand1
->fn
))
10191 gcc_assert (deduction_guide_p (cand2
->fn
));
10192 /* We distinguish between candidates from an explicit deduction guide and
10193 candidates built from a constructor based on DECL_ARTIFICIAL. */
10194 int art1
= DECL_ARTIFICIAL (cand1
->fn
);
10195 int art2
= DECL_ARTIFICIAL (cand2
->fn
);
10197 return art2
- art1
;
10201 /* Prefer the special copy guide over a declared copy/move
10203 if (copy_guide_p (cand1
->fn
))
10205 if (copy_guide_p (cand2
->fn
))
10208 /* Prefer a candidate generated from a non-template constructor. */
10209 int tg1
= template_guide_p (cand1
->fn
);
10210 int tg2
= template_guide_p (cand2
->fn
);
10216 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
10217 for all arguments the corresponding parameters of F1 and F2 have the same
10218 type (CWG 2273/2277). */
10219 if (DECL_P (cand1
->fn
) && DECL_CLASS_SCOPE_P (cand1
->fn
)
10220 && !DECL_CONV_FN_P (cand1
->fn
)
10221 && DECL_P (cand2
->fn
) && DECL_CLASS_SCOPE_P (cand2
->fn
)
10222 && !DECL_CONV_FN_P (cand2
->fn
))
10224 tree base1
= DECL_CONTEXT (strip_inheriting_ctors (cand1
->fn
));
10225 tree base2
= DECL_CONTEXT (strip_inheriting_ctors (cand2
->fn
));
10227 bool used1
= false;
10228 bool used2
= false;
10229 if (base1
== base2
)
10230 /* No difference. */;
10231 else if (DERIVED_FROM_P (base1
, base2
))
10233 else if (DERIVED_FROM_P (base2
, base1
))
10236 if (int diff
= used2
- used1
)
10238 for (i
= 0; i
< len
; ++i
)
10240 conversion
*t1
= cand1
->convs
[i
+ off1
];
10241 conversion
*t2
= cand2
->convs
[i
+ off2
];
10242 if (!same_type_p (t1
->type
, t2
->type
))
10250 /* Check whether we can discard a builtin candidate, either because we
10251 have two identical ones or matching builtin and non-builtin candidates.
10253 (Pedantically in the latter case the builtin which matched the user
10254 function should not be added to the overload set, but we spot it here.
10257 ... the builtin candidates include ...
10258 - do not have the same parameter type list as any non-template
10259 non-member candidate. */
10261 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
10263 for (i
= 0; i
< len
; ++i
)
10264 if (!same_type_p (cand1
->convs
[i
]->type
,
10265 cand2
->convs
[i
]->type
))
10267 if (i
== cand1
->num_convs
)
10269 if (cand1
->fn
== cand2
->fn
)
10270 /* Two built-in candidates; arbitrarily pick one. */
10272 else if (identifier_p (cand1
->fn
))
10273 /* cand1 is built-in; prefer cand2. */
10276 /* cand2 is built-in; prefer cand1. */
10281 /* For candidates of a multi-versioned function, make the version with
10282 the highest priority win. This version will be checked for dispatching
10283 first. If this version can be inlined into the caller, the front-end
10284 will simply make a direct call to this function. */
10286 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
10287 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
10288 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
10289 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
10291 tree f1
= TREE_TYPE (cand1
->fn
);
10292 tree f2
= TREE_TYPE (cand2
->fn
);
10293 tree p1
= TYPE_ARG_TYPES (f1
);
10294 tree p2
= TYPE_ARG_TYPES (f2
);
10296 /* Check if cand1->fn and cand2->fn are versions of the same function. It
10297 is possible that cand1->fn and cand2->fn are function versions but of
10298 different functions. Check types to see if they are versions of the same
10300 if (compparms (p1
, p2
)
10301 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
10303 /* Always make the version with the higher priority, more
10304 specialized, win. */
10305 gcc_assert (targetm
.compare_version_priority
);
10306 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
10313 /* If the two function declarations represent the same function (this can
10314 happen with declarations in multiple scopes and arg-dependent lookup),
10315 arbitrarily choose one. But first make sure the default args we're
10317 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
10318 && equal_functions (cand1
->fn
, cand2
->fn
))
10320 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
10321 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
10323 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
10325 for (i
= 0; i
< len
; ++i
)
10327 /* Don't crash if the fn is variadic. */
10330 parms1
= TREE_CHAIN (parms1
);
10331 parms2
= TREE_CHAIN (parms2
);
10335 parms1
= TREE_CHAIN (parms1
);
10337 parms2
= TREE_CHAIN (parms2
);
10339 for (; parms1
; ++i
)
10341 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
10342 TREE_PURPOSE (parms2
)))
10346 if (complain
& tf_error
)
10348 if (permerror (input_location
,
10349 "default argument mismatch in "
10350 "overload resolution"))
10352 inform (DECL_SOURCE_LOCATION (cand1
->fn
),
10353 " candidate 1: %q#F", cand1
->fn
);
10354 inform (DECL_SOURCE_LOCATION (cand2
->fn
),
10355 " candidate 2: %q#F", cand2
->fn
);
10362 add_warning (cand1
, cand2
);
10365 parms1
= TREE_CHAIN (parms1
);
10366 parms2
= TREE_CHAIN (parms2
);
10374 /* Extension: If the worst conversion for one candidate is worse than the
10375 worst conversion for the other, take the first. */
10376 if (!pedantic
&& (complain
& tf_warning_or_error
))
10378 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
10379 struct z_candidate
*w
= 0, *l
= 0;
10381 for (i
= 0; i
< len
; ++i
)
10383 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
10384 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
10385 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
10386 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
10389 winner
= 1, w
= cand1
, l
= cand2
;
10391 winner
= -1, w
= cand2
, l
= cand1
;
10394 /* Don't choose a deleted function over ambiguity. */
10395 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
10399 pedwarn (input_location
, 0,
10400 "ISO C++ says that these are ambiguous, even "
10401 "though the worst conversion for the first is better than "
10402 "the worst conversion for the second:");
10403 print_z_candidate (input_location
, _("candidate 1:"), w
);
10404 print_z_candidate (input_location
, _("candidate 2:"), l
);
10407 add_warning (w
, l
);
10412 gcc_assert (!winner
);
10416 /* Given a list of candidates for overloading, find the best one, if any.
10417 This algorithm has a worst case of O(2n) (winner is last), and a best
10418 case of O(n/2) (totally ambiguous); much better than a sorting
10421 static struct z_candidate
*
10422 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
10424 struct z_candidate
*champ
= candidates
, *challenger
;
10426 int champ_compared_to_predecessor
= 0;
10428 /* Walk through the list once, comparing each current champ to the next
10429 candidate, knocking out a candidate or two with each comparison. */
10431 for (challenger
= champ
->next
; challenger
; )
10433 fate
= joust (champ
, challenger
, 0, complain
);
10435 challenger
= challenger
->next
;
10440 champ
= challenger
->next
;
10443 champ_compared_to_predecessor
= 0;
10447 champ
= challenger
;
10448 champ_compared_to_predecessor
= 1;
10451 challenger
= champ
->next
;
10455 /* Make sure the champ is better than all the candidates it hasn't yet
10456 been compared to. */
10458 for (challenger
= candidates
;
10459 challenger
!= champ
10460 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
10461 challenger
= challenger
->next
)
10463 fate
= joust (champ
, challenger
, 0, complain
);
10471 /* Returns nonzero if things of type FROM can be converted to TO. */
10474 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
10476 tree arg
= NULL_TREE
;
10477 /* implicit_conversion only considers user-defined conversions
10478 if it has an expression for the call argument list. */
10479 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
10480 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
10481 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
10484 /* Returns nonzero if things of type FROM can be converted to TO with a
10485 standard conversion. */
10488 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
10490 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
10493 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
10496 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
10497 tsubst_flags_t complain
)
10503 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10504 p
= conversion_obstack_alloc (0);
10505 /* We want to discard any access checks done for this test,
10506 as we might not be in the appropriate access context and
10507 we'll do the check again when we actually perform the
10509 push_deferring_access_checks (dk_deferred
);
10511 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10513 ok_p
= (t
&& !t
->bad_p
);
10515 /* Discard the access checks now. */
10516 pop_deferring_access_checks ();
10517 /* Free all the conversions we allocated. */
10518 obstack_free (&conversion_obstack
, p
);
10523 /* Like can_convert_arg, but allows dubious conversions as well. */
10526 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
10527 tsubst_flags_t complain
)
10532 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10533 p
= conversion_obstack_alloc (0);
10534 /* Try to perform the conversion. */
10535 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10537 /* Free all the conversions we allocated. */
10538 obstack_free (&conversion_obstack
, p
);
10543 /* Convert EXPR to TYPE. Return the converted expression.
10545 Note that we allow bad conversions here because by the time we get to
10546 this point we are committed to doing the conversion. If we end up
10547 doing a bad conversion, convert_like will complain. */
10550 perform_implicit_conversion_flags (tree type
, tree expr
,
10551 tsubst_flags_t complain
, int flags
)
10555 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
10557 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10558 expr
= mark_lvalue_use (expr
);
10560 expr
= mark_rvalue_use (expr
);
10562 if (error_operand_p (expr
))
10563 return error_mark_node
;
10565 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10566 p
= conversion_obstack_alloc (0);
10568 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
10569 /*c_cast_p=*/false,
10574 if (complain
& tf_error
)
10576 /* If expr has unknown type, then it is an overloaded function.
10577 Call instantiate_type to get good error messages. */
10578 if (TREE_TYPE (expr
) == unknown_type_node
)
10579 instantiate_type (type
, expr
, complain
);
10580 else if (invalid_nonstatic_memfn_p (loc
, expr
, complain
))
10581 /* We gave an error. */;
10583 error_at (loc
, "could not convert %qE from %qH to %qI", expr
,
10584 TREE_TYPE (expr
), type
);
10586 expr
= error_mark_node
;
10588 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
10590 /* In a template, we are only concerned about determining the
10591 type of non-dependent expressions, so we do not have to
10592 perform the actual conversion. But for initializers, we
10593 need to be able to perform it at instantiation
10594 (or instantiate_non_dependent_expr) time. */
10595 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
10596 if (!(flags
& LOOKUP_ONLYCONVERTING
))
10597 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
10600 expr
= convert_like (conv
, expr
, complain
);
10602 /* Free all the conversions we allocated. */
10603 obstack_free (&conversion_obstack
, p
);
10609 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
10611 return perform_implicit_conversion_flags (type
, expr
, complain
,
10615 /* Convert EXPR to TYPE (as a direct-initialization) if that is
10616 permitted. If the conversion is valid, the converted expression is
10617 returned. Otherwise, NULL_TREE is returned, except in the case
10618 that TYPE is a class type; in that case, an error is issued. If
10619 C_CAST_P is true, then this direct-initialization is taking
10620 place as part of a static_cast being attempted as part of a C-style
10624 perform_direct_initialization_if_possible (tree type
,
10627 tsubst_flags_t complain
)
10632 if (type
== error_mark_node
|| error_operand_p (expr
))
10633 return error_mark_node
;
10636 If the destination type is a (possibly cv-qualified) class type:
10638 -- If the initialization is direct-initialization ...,
10639 constructors are considered. ... If no constructor applies, or
10640 the overload resolution is ambiguous, the initialization is
10642 if (CLASS_TYPE_P (type
))
10644 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
10645 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
10646 &args
, type
, LOOKUP_NORMAL
, complain
);
10647 release_tree_vector (args
);
10648 return build_cplus_new (type
, expr
, complain
);
10651 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10652 p
= conversion_obstack_alloc (0);
10654 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
10656 LOOKUP_NORMAL
, complain
);
10657 if (!conv
|| conv
->bad_p
)
10659 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
10661 /* In a template, we are only concerned about determining the
10662 type of non-dependent expressions, so we do not have to
10663 perform the actual conversion. But for initializers, we
10664 need to be able to perform it at instantiation
10665 (or instantiate_non_dependent_expr) time. */
10666 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
10667 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
10670 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0,
10671 /*issue_conversion_warnings=*/false,
10675 /* Free all the conversions we allocated. */
10676 obstack_free (&conversion_obstack
, p
);
10681 /* When initializing a reference that lasts longer than a full-expression,
10682 this special rule applies:
10686 The temporary to which the reference is bound or the temporary
10687 that is the complete object to which the reference is bound
10688 persists for the lifetime of the reference.
10690 The temporaries created during the evaluation of the expression
10691 initializing the reference, except the temporary to which the
10692 reference is bound, are destroyed at the end of the
10693 full-expression in which they are created.
10695 In that case, we store the converted expression into a new
10696 VAR_DECL in a new scope.
10698 However, we want to be careful not to create temporaries when
10699 they are not required. For example, given:
10702 struct D : public B {};
10706 there is no need to copy the return value from "f"; we can just
10707 extend its lifetime. Similarly, given:
10710 struct T { operator S(); };
10714 we can extend the lifetime of the return value of the conversion
10717 The next several functions are involved in this lifetime extension. */
10719 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
10720 reference is being bound to a temporary. Create and return a new
10721 VAR_DECL with the indicated TYPE; this variable will store the value to
10722 which the reference is bound. */
10725 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
10727 tree var
= create_temporary_var (type
);
10729 /* Register the variable. */
10731 && (TREE_STATIC (decl
) || CP_DECL_THREAD_LOCAL_P (decl
)))
10733 /* Namespace-scope or local static; give it a mangled name. */
10734 /* FIXME share comdat with decl? */
10736 TREE_STATIC (var
) = TREE_STATIC (decl
);
10737 CP_DECL_THREAD_LOCAL_P (var
) = CP_DECL_THREAD_LOCAL_P (decl
);
10738 set_decl_tls_model (var
, DECL_TLS_MODEL (decl
));
10740 tree name
= mangle_ref_init_variable (decl
);
10741 DECL_NAME (var
) = name
;
10742 SET_DECL_ASSEMBLER_NAME (var
, name
);
10744 var
= pushdecl (var
);
10747 /* Create a new cleanup level if necessary. */
10748 maybe_push_cleanup_level (type
);
10753 /* EXPR is the initializer for a variable DECL of reference or
10754 std::initializer_list type. Create, push and return a new VAR_DECL
10755 for the initializer so that it will live as long as DECL. Any
10756 cleanup for the new variable is returned through CLEANUP, and the
10757 code to initialize the new variable is returned through INITP. */
10760 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
10767 /* Create the temporary variable. */
10768 type
= TREE_TYPE (expr
);
10769 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
10770 layout_decl (var
, 0);
10771 /* If the rvalue is the result of a function call it will be
10772 a TARGET_EXPR. If it is some other construct (such as a
10773 member access expression where the underlying object is
10774 itself the result of a function call), turn it into a
10775 TARGET_EXPR here. It is important that EXPR be a
10776 TARGET_EXPR below since otherwise the INIT_EXPR will
10777 attempt to make a bitwise copy of EXPR to initialize
10779 if (TREE_CODE (expr
) != TARGET_EXPR
)
10780 expr
= get_target_expr (expr
);
10782 if (TREE_CODE (decl
) == FIELD_DECL
10783 && extra_warnings
&& !TREE_NO_WARNING (decl
))
10785 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
10786 "until the constructor exits", decl
);
10787 TREE_NO_WARNING (decl
) = true;
10790 /* Recursively extend temps in this initializer. */
10791 TARGET_EXPR_INITIAL (expr
)
10792 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
10794 /* Any reference temp has a non-trivial initializer. */
10795 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
10797 /* If the initializer is constant, put it in DECL_INITIAL so we get
10798 static initialization and use in constant expressions. */
10799 init
= maybe_constant_init (expr
);
10800 if (TREE_CONSTANT (init
))
10802 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
10804 /* 5.19 says that a constant expression can include an
10805 lvalue-rvalue conversion applied to "a glvalue of literal type
10806 that refers to a non-volatile temporary object initialized
10807 with a constant expression". Rather than try to communicate
10808 that this VAR_DECL is a temporary, just mark it constexpr.
10810 Currently this is only useful for initializer_list temporaries,
10811 since reference vars can't appear in constant expressions. */
10812 DECL_DECLARED_CONSTEXPR_P (var
) = true;
10813 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
10814 TREE_CONSTANT (var
) = true;
10816 DECL_INITIAL (var
) = init
;
10820 /* Create the INIT_EXPR that will initialize the temporary
10822 init
= split_nonconstant_init (var
, expr
);
10823 if (at_function_scope_p ())
10825 add_decl_expr (var
);
10827 if (TREE_STATIC (var
))
10828 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
10831 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
10833 vec_safe_push (*cleanups
, cleanup
);
10836 /* We must be careful to destroy the temporary only
10837 after its initialization has taken place. If the
10838 initialization throws an exception, then the
10839 destructor should not be run. We cannot simply
10840 transform INIT into something like:
10842 (INIT, ({ CLEANUP_STMT; }))
10844 because emit_local_var always treats the
10845 initializer as a full-expression. Thus, the
10846 destructor would run too early; it would run at the
10847 end of initializing the reference variable, rather
10848 than at the end of the block enclosing the
10849 reference variable.
10851 The solution is to pass back a cleanup expression
10852 which the caller is responsible for attaching to
10853 the statement tree. */
10857 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
10858 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
10860 if (CP_DECL_THREAD_LOCAL_P (var
))
10861 tls_aggregates
= tree_cons (NULL_TREE
, var
,
10864 static_aggregates
= tree_cons (NULL_TREE
, var
,
10865 static_aggregates
);
10868 /* Check whether the dtor is callable. */
10869 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
10871 /* Avoid -Wunused-variable warning (c++/38958). */
10872 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
10874 TREE_USED (decl
) = DECL_READ_P (decl
) = true;
10880 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
10881 initializing a variable of that TYPE. */
10884 initialize_reference (tree type
, tree expr
,
10885 int flags
, tsubst_flags_t complain
)
10889 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
10891 if (type
== error_mark_node
|| error_operand_p (expr
))
10892 return error_mark_node
;
10894 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10895 p
= conversion_obstack_alloc (0);
10897 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
10899 if (!conv
|| conv
->bad_p
)
10901 if (complain
& tf_error
)
10904 convert_like (conv
, expr
, complain
);
10905 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
10906 && !TYPE_REF_IS_RVALUE (type
)
10907 && !lvalue_p (expr
))
10908 error_at (loc
, "invalid initialization of non-const reference of "
10909 "type %qH from an rvalue of type %qI",
10910 type
, TREE_TYPE (expr
));
10912 error_at (loc
, "invalid initialization of reference of type "
10913 "%qH from expression of type %qI", type
,
10916 return error_mark_node
;
10919 if (conv
->kind
== ck_ref_bind
)
10920 /* Perform the conversion. */
10921 expr
= convert_like (conv
, expr
, complain
);
10922 else if (conv
->kind
== ck_ambig
)
10923 /* We gave an error in build_user_type_conversion_1. */
10924 expr
= error_mark_node
;
10926 gcc_unreachable ();
10928 /* Free all the conversions we allocated. */
10929 obstack_free (&conversion_obstack
, p
);
10934 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
10935 which is bound either to a reference or a std::initializer_list. */
10938 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
10943 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
10945 TREE_OPERAND (sub
, 1)
10946 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
10949 if (TREE_CODE (sub
) != ADDR_EXPR
)
10951 /* Deal with binding to a subobject. */
10952 for (p
= &TREE_OPERAND (sub
, 0); TREE_CODE (*p
) == COMPONENT_REF
; )
10953 p
= &TREE_OPERAND (*p
, 0);
10954 if (TREE_CODE (*p
) == TARGET_EXPR
)
10956 tree subinit
= NULL_TREE
;
10957 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
10958 recompute_tree_invariant_for_addr_expr (sub
);
10960 init
= fold_convert (TREE_TYPE (init
), sub
);
10962 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
10967 /* INIT is part of the initializer for DECL. If there are any
10968 reference or initializer lists being initialized, extend their
10969 lifetime to match that of DECL. */
10972 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
10974 tree type
= TREE_TYPE (init
);
10975 if (processing_template_decl
)
10977 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10978 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
10982 if (TREE_CODE (ctor
) == TARGET_EXPR
)
10983 ctor
= TARGET_EXPR_INITIAL (ctor
);
10984 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
10986 if (is_std_init_list (type
))
10988 /* The temporary array underlying a std::initializer_list
10989 is handled like a reference temporary. */
10990 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
10991 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
10992 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
10997 constructor_elt
*p
;
10998 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (ctor
);
10999 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
11000 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
11002 recompute_constructor_flags (ctor
);
11003 if (decl_maybe_constant_var_p (decl
) && TREE_CONSTANT (ctor
))
11004 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
11011 /* Returns true iff an initializer for TYPE could contain temporaries that
11012 need to be extended because they are bound to references or
11013 std::initializer_list. */
11016 type_has_extended_temps (tree type
)
11018 type
= strip_array_types (type
);
11019 if (TREE_CODE (type
) == REFERENCE_TYPE
)
11021 if (CLASS_TYPE_P (type
))
11023 if (is_std_init_list (type
))
11025 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
11026 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
11027 if (type_has_extended_temps (TREE_TYPE (f
)))
11033 /* Returns true iff TYPE is some variant of std::initializer_list. */
11036 is_std_init_list (tree type
)
11038 if (!TYPE_P (type
))
11040 if (cxx_dialect
== cxx98
)
11042 /* Look through typedefs. */
11043 type
= TYPE_MAIN_VARIANT (type
);
11044 return (CLASS_TYPE_P (type
)
11045 && CP_TYPE_CONTEXT (type
) == std_node
11046 && init_list_identifier
== DECL_NAME (TYPE_NAME (type
)));
11049 /* Returns true iff DECL is a list constructor: i.e. a constructor which
11050 will accept an argument list of a single std::initializer_list<T>. */
11053 is_list_ctor (tree decl
)
11055 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
11058 if (!args
|| args
== void_list_node
)
11061 arg
= non_reference (TREE_VALUE (args
));
11062 if (!is_std_init_list (arg
))
11065 args
= TREE_CHAIN (args
);
11067 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
11068 /* There are more non-defaulted parms. */
11074 #include "gt-cp-call.h"