1 /* Functions related to invoking -*- C++ -*- methods and overloaded functions.
2 Copyright (C) 1987-2017 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"
43 /* The various kinds of conversion. */
45 enum conversion_kind
{
62 /* The rank of the conversion. Order of the enumerals matters; better
63 conversions should come earlier in the list. */
65 enum conversion_rank
{
76 /* An implicit conversion sequence, in the sense of [over.best.ics].
77 The first conversion to be performed is at the end of the chain.
78 That conversion is always a cr_identity conversion. */
81 /* The kind of conversion represented by this step. */
83 /* The rank of this conversion. */
85 BOOL_BITFIELD user_conv_p
: 1;
86 BOOL_BITFIELD ellipsis_p
: 1;
87 BOOL_BITFIELD this_p
: 1;
88 /* True if this conversion would be permitted with a bending of
89 language standards, e.g. disregarding pointer qualifiers or
90 converting integers to pointers. */
91 BOOL_BITFIELD bad_p
: 1;
92 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
93 temporary should be created to hold the result of the
95 BOOL_BITFIELD need_temporary_p
: 1;
96 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
97 from a pointer-to-derived to pointer-to-base is being performed. */
98 BOOL_BITFIELD base_p
: 1;
99 /* If KIND is ck_ref_bind, true when either an lvalue reference is
100 being bound to an lvalue expression or an rvalue reference is
101 being bound to an rvalue expression. If KIND is ck_rvalue,
102 true when we should treat an lvalue as an rvalue (12.8p33). If
103 KIND is ck_base, always false. */
104 BOOL_BITFIELD rvaluedness_matches_p
: 1;
105 BOOL_BITFIELD check_narrowing
: 1;
106 /* The type of the expression resulting from the conversion. */
109 /* The next conversion in the chain. Since the conversions are
110 arranged from outermost to innermost, the NEXT conversion will
111 actually be performed before this conversion. This variant is
112 used only when KIND is neither ck_identity, ck_ambig nor
113 ck_list. Please use the next_conversion function instead
114 of using this field directly. */
116 /* The expression at the beginning of the conversion chain. This
117 variant is used only if KIND is ck_identity or ck_ambig. */
119 /* The array of conversions for an initializer_list, so this
120 variant is used only when KIN D is ck_list. */
123 /* The function candidate corresponding to this conversion
124 sequence. This field is only used if KIND is ck_user. */
125 struct z_candidate
*cand
;
128 #define CONVERSION_RANK(NODE) \
129 ((NODE)->bad_p ? cr_bad \
130 : (NODE)->ellipsis_p ? cr_ellipsis \
131 : (NODE)->user_conv_p ? cr_user \
134 #define BAD_CONVERSION_RANK(NODE) \
135 ((NODE)->ellipsis_p ? cr_ellipsis \
136 : (NODE)->user_conv_p ? cr_user \
139 static struct obstack conversion_obstack
;
140 static bool conversion_obstack_initialized
;
141 struct rejection_reason
;
143 static struct z_candidate
* tourney (struct z_candidate
*, tsubst_flags_t
);
144 static int equal_functions (tree
, tree
);
145 static int joust (struct z_candidate
*, struct z_candidate
*, bool,
147 static int compare_ics (conversion
*, conversion
*);
148 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
149 #define convert_like(CONV, EXPR, COMPLAIN) \
150 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, \
151 /*issue_conversion_warnings=*/true, \
152 /*c_cast_p=*/false, (COMPLAIN))
153 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
154 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), \
155 /*issue_conversion_warnings=*/true, \
156 /*c_cast_p=*/false, (COMPLAIN))
157 static tree
convert_like_real (conversion
*, tree
, tree
, int, bool,
158 bool, tsubst_flags_t
);
159 static void op_error (location_t
, enum tree_code
, enum tree_code
, tree
,
161 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int,
163 static void print_z_candidate (location_t
, const char *, struct z_candidate
*);
164 static void print_z_candidates (location_t
, struct z_candidate
*);
165 static tree
build_this (tree
);
166 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
167 static bool any_strictly_viable (struct z_candidate
*);
168 static struct z_candidate
*add_template_candidate
169 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
170 tree
, tree
, tree
, int, unification_kind_t
, tsubst_flags_t
);
171 static struct z_candidate
*add_template_candidate_real
172 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
173 tree
, tree
, tree
, int, tree
, unification_kind_t
, tsubst_flags_t
);
174 static void add_builtin_candidates
175 (struct z_candidate
**, enum tree_code
, enum tree_code
,
176 tree
, tree
*, int, tsubst_flags_t
);
177 static void add_builtin_candidate
178 (struct z_candidate
**, enum tree_code
, enum tree_code
,
179 tree
, tree
, tree
, tree
*, tree
*, int, tsubst_flags_t
);
180 static bool is_complete (tree
);
181 static void build_builtin_candidate
182 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
183 int, tsubst_flags_t
);
184 static struct z_candidate
*add_conv_candidate
185 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
186 tree
, tsubst_flags_t
);
187 static struct z_candidate
*add_function_candidate
188 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
189 tree
, int, tsubst_flags_t
);
190 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int,
192 static conversion
*reference_binding (tree
, tree
, tree
, bool, int,
194 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
195 static conversion
*build_list_conv (tree
, tree
, int, tsubst_flags_t
);
196 static conversion
*next_conversion (conversion
*);
197 static bool is_subseq (conversion
*, conversion
*);
198 static conversion
*maybe_handle_ref_bind (conversion
**);
199 static void maybe_handle_implicit_object (conversion
**);
200 static struct z_candidate
*add_candidate
201 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, size_t,
202 conversion
**, tree
, tree
, int, struct rejection_reason
*, int);
203 static tree
source_type (conversion
*);
204 static void add_warning (struct z_candidate
*, struct z_candidate
*);
205 static bool reference_compatible_p (tree
, tree
);
206 static conversion
*direct_reference_binding (tree
, conversion
*);
207 static bool promoted_arithmetic_type_p (tree
);
208 static conversion
*conditional_conversion (tree
, tree
, tsubst_flags_t
);
209 static char *name_as_c_string (tree
, tree
, bool *);
210 static tree
prep_operand (tree
);
211 static void add_candidates (tree
, tree
, const vec
<tree
, va_gc
> *, tree
, tree
,
212 bool, tree
, tree
, int, struct z_candidate
**,
214 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
215 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
217 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
218 NAME can take many forms... */
221 check_dtor_name (tree basetype
, tree name
)
223 /* Just accept something we've already complained about. */
224 if (name
== error_mark_node
)
227 if (TREE_CODE (name
) == TYPE_DECL
)
228 name
= TREE_TYPE (name
);
229 else if (TYPE_P (name
))
231 else if (identifier_p (name
))
233 if ((MAYBE_CLASS_TYPE_P (basetype
)
234 && name
== constructor_name (basetype
))
235 || (TREE_CODE (basetype
) == ENUMERAL_TYPE
236 && name
== TYPE_IDENTIFIER (basetype
)))
239 name
= get_type_value (name
);
245 template <class T> struct S { ~S(); };
249 NAME will be a class template. */
250 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
254 if (!name
|| name
== error_mark_node
)
256 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
259 /* We want the address of a function or method. We avoid creating a
260 pointer-to-member function. */
263 build_addr_func (tree function
, tsubst_flags_t complain
)
265 tree type
= TREE_TYPE (function
);
267 /* We have to do these by hand to avoid real pointer to member
269 if (TREE_CODE (type
) == METHOD_TYPE
)
271 if (TREE_CODE (function
) == OFFSET_REF
)
273 tree object
= build_address (TREE_OPERAND (function
, 0));
274 return get_member_function_from_ptrfunc (&object
,
275 TREE_OPERAND (function
, 1),
278 function
= build_address (function
);
281 function
= decay_conversion (function
, complain
, /*reject_builtin=*/false);
286 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
287 POINTER_TYPE to those. Note, pointer to member function types
288 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
289 two variants. build_call_a is the primitive taking an array of
290 arguments, while build_call_n is a wrapper that handles varargs. */
293 build_call_n (tree function
, int n
, ...)
296 return build_call_a (function
, 0, NULL
);
299 tree
*argarray
= XALLOCAVEC (tree
, n
);
304 for (i
= 0; i
< n
; i
++)
305 argarray
[i
] = va_arg (ap
, tree
);
307 return build_call_a (function
, n
, argarray
);
311 /* Update various flags in cfun and the call itself based on what is being
312 called. Split out of build_call_a so that bot_manip can use it too. */
315 set_flags_from_callee (tree call
)
318 tree decl
= get_callee_fndecl (call
);
320 /* We check both the decl and the type; a function may be known not to
321 throw without being declared throw(). */
322 nothrow
= decl
&& TREE_NOTHROW (decl
);
323 if (CALL_EXPR_FN (call
))
324 nothrow
|= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call
))));
325 else if (internal_fn_flags (CALL_EXPR_IFN (call
)) & ECF_NOTHROW
)
328 if (!nothrow
&& at_function_scope_p () && cfun
&& cp_function_chain
)
329 cp_function_chain
->can_throw
= 1;
331 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
332 current_function_returns_abnormally
= 1;
334 TREE_NOTHROW (call
) = nothrow
;
338 build_call_a (tree function
, int n
, tree
*argarray
)
345 function
= build_addr_func (function
, tf_warning_or_error
);
347 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
348 fntype
= TREE_TYPE (TREE_TYPE (function
));
349 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
350 || TREE_CODE (fntype
) == METHOD_TYPE
);
351 result_type
= TREE_TYPE (fntype
);
352 /* An rvalue has no cv-qualifiers. */
353 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
354 result_type
= cv_unqualified (result_type
);
356 function
= build_call_array_loc (input_location
,
357 result_type
, function
, n
, argarray
);
358 set_flags_from_callee (function
);
360 decl
= get_callee_fndecl (function
);
362 if (decl
&& !TREE_USED (decl
))
364 /* We invoke build_call directly for several library
365 functions. These may have been declared normally if
366 we're building libgcc, so we can't just check
368 gcc_assert (DECL_ARTIFICIAL (decl
)
369 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
374 require_complete_eh_spec_types (fntype
, decl
);
376 TREE_HAS_CONSTRUCTOR (function
) = (decl
&& DECL_CONSTRUCTOR_P (decl
));
378 if (current_function_decl
&& decl
379 && flag_new_inheriting_ctors
380 && DECL_INHERITED_CTOR (current_function_decl
)
381 && (DECL_INHERITED_CTOR (current_function_decl
)
382 == DECL_CLONED_FUNCTION (decl
)))
383 /* Pass arguments directly to the inherited constructor. */
384 CALL_FROM_THUNK_P (function
) = true;
386 /* Don't pass empty class objects by value. This is useful
387 for tags in STL, which are used to control overload resolution.
388 We don't need to handle other cases of copying empty classes. */
389 else if (! decl
|| ! DECL_BUILT_IN (decl
))
390 for (i
= 0; i
< n
; i
++)
392 tree arg
= CALL_EXPR_ARG (function
, i
);
393 if (is_empty_class (TREE_TYPE (arg
))
394 && ! TREE_ADDRESSABLE (TREE_TYPE (arg
)))
396 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (arg
));
397 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (t
), arg
, t
);
398 CALL_EXPR_ARG (function
, i
) = arg
;
405 /* New overloading code. */
409 struct candidate_warning
{
411 candidate_warning
*next
;
414 /* Information for providing diagnostics about why overloading failed. */
416 enum rejection_reason_code
{
419 rr_explicit_conversion
,
420 rr_template_conversion
,
422 rr_bad_arg_conversion
,
423 rr_template_unification
,
426 rr_constraint_failure
429 struct conversion_info
{
430 /* The index of the argument, 0-based. */
432 /* The actual argument or its type. */
434 /* The type of the parameter. */
438 struct rejection_reason
{
439 enum rejection_reason_code code
;
441 /* Information about an arity mismatch. */
443 /* The expected number of arguments. */
445 /* The actual number of arguments in the call. */
447 /* Whether the call was a varargs call. */
450 /* Information about an argument conversion mismatch. */
451 struct conversion_info conversion
;
452 /* Same, but for bad argument conversions. */
453 struct conversion_info bad_conversion
;
454 /* Information about template unification failures. These are the
455 parameters passed to fn_type_unification. */
463 unification_kind_t strict
;
465 } template_unification
;
466 /* Information about template instantiation failures. These are the
467 parameters passed to instantiate_template. */
471 } template_instantiation
;
476 /* The FUNCTION_DECL that will be called if this candidate is
477 selected by overload resolution. */
479 /* If not NULL_TREE, the first argument to use when calling this
482 /* The rest of the arguments to use when calling this function. If
483 there are no further arguments this may be NULL or it may be an
485 const vec
<tree
, va_gc
> *args
;
486 /* The implicit conversion sequences for each of the arguments to
489 /* The number of implicit conversion sequences. */
491 /* If FN is a user-defined conversion, the standard conversion
492 sequence from the type returned by FN to the desired destination
494 conversion
*second_conv
;
495 struct rejection_reason
*reason
;
496 /* If FN is a member function, the binfo indicating the path used to
497 qualify the name of FN at the call site. This path is used to
498 determine whether or not FN is accessible if it is selected by
499 overload resolution. The DECL_CONTEXT of FN will always be a
500 (possibly improper) base of this binfo. */
502 /* If FN is a non-static member function, the binfo indicating the
503 subobject to which the `this' pointer should be converted if FN
504 is selected by overload resolution. The type pointed to by
505 the `this' pointer must correspond to the most derived class
506 indicated by the CONVERSION_PATH. */
507 tree conversion_path
;
510 candidate_warning
*warnings
;
514 /* The flags active in add_candidate. */
518 /* Returns true iff T is a null pointer constant in the sense of
522 null_ptr_cst_p (tree t
)
524 tree type
= TREE_TYPE (t
);
528 A null pointer constant is an integral constant expression
529 (_expr.const_) rvalue of integer type that evaluates to zero or
530 an rvalue of type std::nullptr_t. */
531 if (NULLPTR_TYPE_P (type
))
534 if (cxx_dialect
>= cxx11
)
536 /* Core issue 903 says only literal 0 is a null pointer constant. */
537 if (TREE_CODE (type
) == INTEGER_TYPE
538 && !char_type_p (type
)
539 && TREE_CODE (t
) == INTEGER_CST
541 && !TREE_OVERFLOW (t
))
544 else if (CP_INTEGRAL_TYPE_P (type
))
546 t
= fold_non_dependent_expr (t
);
548 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
555 /* Returns true iff T is a null member pointer value (4.11). */
558 null_member_pointer_value_p (tree t
)
560 tree type
= TREE_TYPE (t
);
563 else if (TYPE_PTRMEMFUNC_P (type
))
564 return (TREE_CODE (t
) == CONSTRUCTOR
565 && integer_zerop (CONSTRUCTOR_ELT (t
, 0)->value
));
566 else if (TYPE_PTRDATAMEM_P (type
))
567 return integer_all_onesp (t
);
572 /* Returns nonzero if PARMLIST consists of only default parms,
573 ellipsis, and/or undeduced parameter packs. */
576 sufficient_parms_p (const_tree parmlist
)
578 for (; parmlist
&& parmlist
!= void_list_node
;
579 parmlist
= TREE_CHAIN (parmlist
))
580 if (!TREE_PURPOSE (parmlist
)
581 && !PACK_EXPANSION_P (TREE_VALUE (parmlist
)))
586 /* Allocate N bytes of memory from the conversion obstack. The memory
587 is zeroed before being returned. */
590 conversion_obstack_alloc (size_t n
)
593 if (!conversion_obstack_initialized
)
595 gcc_obstack_init (&conversion_obstack
);
596 conversion_obstack_initialized
= true;
598 p
= obstack_alloc (&conversion_obstack
, n
);
603 /* Allocate rejection reasons. */
605 static struct rejection_reason
*
606 alloc_rejection (enum rejection_reason_code code
)
608 struct rejection_reason
*p
;
609 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
614 static struct rejection_reason
*
615 arity_rejection (tree first_arg
, int expected
, int actual
)
617 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
618 int adjust
= first_arg
!= NULL_TREE
;
619 r
->u
.arity
.expected
= expected
- adjust
;
620 r
->u
.arity
.actual
= actual
- adjust
;
624 static struct rejection_reason
*
625 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
627 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
628 int adjust
= first_arg
!= NULL_TREE
;
629 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
630 r
->u
.conversion
.from
= from
;
631 r
->u
.conversion
.to_type
= to
;
635 static struct rejection_reason
*
636 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
638 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
639 int adjust
= first_arg
!= NULL_TREE
;
640 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
641 r
->u
.bad_conversion
.from
= from
;
642 r
->u
.bad_conversion
.to_type
= to
;
646 static struct rejection_reason
*
647 explicit_conversion_rejection (tree from
, tree to
)
649 struct rejection_reason
*r
= alloc_rejection (rr_explicit_conversion
);
650 r
->u
.conversion
.n_arg
= 0;
651 r
->u
.conversion
.from
= from
;
652 r
->u
.conversion
.to_type
= to
;
656 static struct rejection_reason
*
657 template_conversion_rejection (tree from
, tree to
)
659 struct rejection_reason
*r
= alloc_rejection (rr_template_conversion
);
660 r
->u
.conversion
.n_arg
= 0;
661 r
->u
.conversion
.from
= from
;
662 r
->u
.conversion
.to_type
= to
;
666 static struct rejection_reason
*
667 template_unification_rejection (tree tmpl
, tree explicit_targs
, tree targs
,
668 const tree
*args
, unsigned int nargs
,
669 tree return_type
, unification_kind_t strict
,
672 size_t args_n_bytes
= sizeof (*args
) * nargs
;
673 tree
*args1
= (tree
*) conversion_obstack_alloc (args_n_bytes
);
674 struct rejection_reason
*r
= alloc_rejection (rr_template_unification
);
675 r
->u
.template_unification
.tmpl
= tmpl
;
676 r
->u
.template_unification
.explicit_targs
= explicit_targs
;
677 r
->u
.template_unification
.num_targs
= TREE_VEC_LENGTH (targs
);
678 /* Copy args to our own storage. */
679 memcpy (args1
, args
, args_n_bytes
);
680 r
->u
.template_unification
.args
= args1
;
681 r
->u
.template_unification
.nargs
= nargs
;
682 r
->u
.template_unification
.return_type
= return_type
;
683 r
->u
.template_unification
.strict
= strict
;
684 r
->u
.template_unification
.flags
= flags
;
688 static struct rejection_reason
*
689 template_unification_error_rejection (void)
691 return alloc_rejection (rr_template_unification
);
694 static struct rejection_reason
*
695 invalid_copy_with_fn_template_rejection (void)
697 struct rejection_reason
*r
= alloc_rejection (rr_invalid_copy
);
701 static struct rejection_reason
*
702 inherited_ctor_rejection (void)
704 struct rejection_reason
*r
= alloc_rejection (rr_inherited_ctor
);
708 // Build a constraint failure record, saving information into the
709 // template_instantiation field of the rejection. If FN is not a template
710 // declaration, the TMPL member is the FN declaration and TARGS is empty.
712 static struct rejection_reason
*
713 constraint_failure (tree fn
)
715 struct rejection_reason
*r
= alloc_rejection (rr_constraint_failure
);
716 if (tree ti
= DECL_TEMPLATE_INFO (fn
))
718 r
->u
.template_instantiation
.tmpl
= TI_TEMPLATE (ti
);
719 r
->u
.template_instantiation
.targs
= TI_ARGS (ti
);
723 r
->u
.template_instantiation
.tmpl
= fn
;
724 r
->u
.template_instantiation
.targs
= NULL_TREE
;
729 /* Dynamically allocate a conversion. */
732 alloc_conversion (conversion_kind kind
)
735 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
740 /* Make sure that all memory on the conversion obstack has been
744 validate_conversion_obstack (void)
746 if (conversion_obstack_initialized
)
747 gcc_assert ((obstack_next_free (&conversion_obstack
)
748 == obstack_base (&conversion_obstack
)));
751 /* Dynamically allocate an array of N conversions. */
754 alloc_conversions (size_t n
)
756 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
760 build_conv (conversion_kind code
, tree type
, conversion
*from
)
763 conversion_rank rank
= CONVERSION_RANK (from
);
765 /* Note that the caller is responsible for filling in t->cand for
766 user-defined conversions. */
767 t
= alloc_conversion (code
);
791 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
792 t
->bad_p
= from
->bad_p
;
797 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
798 specialization of std::initializer_list<T>, if such a conversion is
802 build_list_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
804 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
805 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
806 conversion
**subconvs
= alloc_conversions (len
);
811 /* Within a list-initialization we can have more user-defined
813 flags
&= ~LOOKUP_NO_CONVERSION
;
814 /* But no narrowing conversions. */
815 flags
|= LOOKUP_NO_NARROWING
;
817 /* Can't make an array of these types. */
818 if (TREE_CODE (elttype
) == REFERENCE_TYPE
819 || TREE_CODE (elttype
) == FUNCTION_TYPE
820 || VOID_TYPE_P (elttype
))
823 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
826 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
827 false, flags
, complain
);
834 t
= alloc_conversion (ck_list
);
836 t
->u
.list
= subconvs
;
839 for (i
= 0; i
< len
; ++i
)
841 conversion
*sub
= subconvs
[i
];
842 if (sub
->rank
> t
->rank
)
844 if (sub
->user_conv_p
)
845 t
->user_conv_p
= true;
853 /* Return the next conversion of the conversion chain (if applicable),
854 or NULL otherwise. Please use this function instead of directly
855 accessing fields of struct conversion. */
858 next_conversion (conversion
*conv
)
861 || conv
->kind
== ck_identity
862 || conv
->kind
== ck_ambig
863 || conv
->kind
== ck_list
)
868 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
869 is a valid aggregate initializer for array type ATYPE. */
872 can_convert_array (tree atype
, tree ctor
, int flags
, tsubst_flags_t complain
)
875 tree elttype
= TREE_TYPE (atype
);
876 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
878 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
880 if (TREE_CODE (elttype
) == ARRAY_TYPE
881 && TREE_CODE (val
) == CONSTRUCTOR
)
882 ok
= can_convert_array (elttype
, val
, flags
, complain
);
884 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
,
892 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
893 aggregate class, if such a conversion is possible. */
896 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
898 unsigned HOST_WIDE_INT i
= 0;
900 tree field
= next_initializable_field (TYPE_FIELDS (type
));
901 tree empty_ctor
= NULL_TREE
;
903 /* We already called reshape_init in implicit_conversion. */
905 /* The conversions within the init-list aren't affected by the enclosing
906 context; they're always simple copy-initialization. */
907 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
909 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
911 tree ftype
= TREE_TYPE (field
);
915 if (i
< CONSTRUCTOR_NELTS (ctor
))
916 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
917 else if (DECL_INITIAL (field
))
918 val
= get_nsdmi (field
, /*ctor*/false);
919 else if (TREE_CODE (ftype
) == REFERENCE_TYPE
)
920 /* Value-initialization of reference is ill-formed. */
924 if (empty_ctor
== NULL_TREE
)
925 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
930 if (TREE_CODE (ftype
) == ARRAY_TYPE
931 && TREE_CODE (val
) == CONSTRUCTOR
)
932 ok
= can_convert_array (ftype
, val
, flags
, complain
);
934 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
940 if (TREE_CODE (type
) == UNION_TYPE
)
944 if (i
< CONSTRUCTOR_NELTS (ctor
))
947 c
= alloc_conversion (ck_aggr
);
950 c
->user_conv_p
= true;
951 c
->check_narrowing
= true;
956 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
957 array type, if such a conversion is possible. */
960 build_array_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
963 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
964 tree elttype
= TREE_TYPE (type
);
969 enum conversion_rank rank
= cr_exact
;
971 /* We might need to propagate the size from the element to the array. */
972 complete_type (type
);
974 if (TYPE_DOMAIN (type
)
975 && !variably_modified_type_p (TYPE_DOMAIN (type
), NULL_TREE
))
977 unsigned HOST_WIDE_INT alen
= tree_to_uhwi (array_type_nelts_top (type
));
982 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
984 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
987 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
988 false, flags
, complain
);
992 if (sub
->rank
> rank
)
994 if (sub
->user_conv_p
)
1000 c
= alloc_conversion (ck_aggr
);
1003 c
->user_conv_p
= user
;
1009 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1010 complex type, if such a conversion is possible. */
1013 build_complex_conv (tree type
, tree ctor
, int flags
,
1014 tsubst_flags_t complain
)
1017 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1018 tree elttype
= TREE_TYPE (type
);
1023 enum conversion_rank rank
= cr_exact
;
1028 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1030 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1033 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1034 false, flags
, complain
);
1038 if (sub
->rank
> rank
)
1040 if (sub
->user_conv_p
)
1046 c
= alloc_conversion (ck_aggr
);
1049 c
->user_conv_p
= user
;
1055 /* Build a representation of the identity conversion from EXPR to
1056 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1059 build_identity_conv (tree type
, tree expr
)
1063 c
= alloc_conversion (ck_identity
);
1070 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1071 were multiple user-defined conversions to accomplish the job.
1072 Build a conversion that indicates that ambiguity. */
1075 build_ambiguous_conv (tree type
, tree expr
)
1079 c
= alloc_conversion (ck_ambig
);
1087 strip_top_quals (tree t
)
1089 if (TREE_CODE (t
) == ARRAY_TYPE
)
1091 return cp_build_qualified_type (t
, 0);
1094 /* Returns the standard conversion path (see [conv]) from type FROM to type
1095 TO, if any. For proper handling of null pointer constants, you must
1096 also pass the expression EXPR to convert from. If C_CAST_P is true,
1097 this conversion is coming from a C-style cast. */
1100 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1101 int flags
, tsubst_flags_t complain
)
1103 enum tree_code fcode
, tcode
;
1105 bool fromref
= false;
1108 to
= non_reference (to
);
1109 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1112 from
= TREE_TYPE (from
);
1115 to
= strip_top_quals (to
);
1116 from
= strip_top_quals (from
);
1118 if (expr
&& type_unknown_p (expr
))
1120 if (TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1122 tsubst_flags_t tflags
= tf_conv
;
1123 expr
= instantiate_type (to
, expr
, tflags
);
1124 if (expr
== error_mark_node
)
1126 from
= TREE_TYPE (expr
);
1128 else if (TREE_CODE (to
) == BOOLEAN_TYPE
)
1130 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1131 expr
= resolve_nondeduced_context (expr
, complain
);
1132 from
= TREE_TYPE (expr
);
1136 fcode
= TREE_CODE (from
);
1137 tcode
= TREE_CODE (to
);
1139 conv
= build_identity_conv (from
, expr
);
1140 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1142 from
= type_decays_to (from
);
1143 fcode
= TREE_CODE (from
);
1144 conv
= build_conv (ck_lvalue
, from
, conv
);
1146 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1147 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1148 express the copy constructor call required by copy-initialization. */
1149 else if (fromref
|| (expr
&& obvalue_p (expr
)))
1154 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1157 from
= strip_top_quals (bitfield_type
);
1158 fcode
= TREE_CODE (from
);
1161 conv
= build_conv (ck_rvalue
, from
, conv
);
1162 if (flags
& LOOKUP_PREFER_RVALUE
)
1163 conv
->rvaluedness_matches_p
= true;
1166 /* Allow conversion between `__complex__' data types. */
1167 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1169 /* The standard conversion sequence to convert FROM to TO is
1170 the standard conversion sequence to perform componentwise
1172 conversion
*part_conv
= standard_conversion
1173 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
,
1178 conv
= build_conv (part_conv
->kind
, to
, conv
);
1179 conv
->rank
= part_conv
->rank
;
1187 if (same_type_p (from
, to
))
1189 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1190 conv
->type
= qualified_to
;
1195 A null pointer constant can be converted to a pointer type; ... A
1196 null pointer constant of integral type can be converted to an
1197 rvalue of type std::nullptr_t. */
1198 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1199 || NULLPTR_TYPE_P (to
))
1200 && ((expr
&& null_ptr_cst_p (expr
))
1201 || NULLPTR_TYPE_P (from
)))
1202 conv
= build_conv (ck_std
, to
, conv
);
1203 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1204 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1206 /* For backwards brain damage compatibility, allow interconversion of
1207 pointers and integers with a pedwarn. */
1208 conv
= build_conv (ck_std
, to
, conv
);
1211 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1213 /* For backwards brain damage compatibility, allow interconversion of
1214 enums and integers with a pedwarn. */
1215 conv
= build_conv (ck_std
, to
, conv
);
1218 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1219 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1224 if (tcode
== POINTER_TYPE
)
1226 to_pointee
= TREE_TYPE (to
);
1227 from_pointee
= TREE_TYPE (from
);
1229 /* Since this is the target of a pointer, it can't have function
1230 qualifiers, so any TYPE_QUALS must be for attributes const or
1231 noreturn. Strip them. */
1232 if (TREE_CODE (to_pointee
) == FUNCTION_TYPE
1233 && TYPE_QUALS (to_pointee
))
1234 to_pointee
= build_qualified_type (to_pointee
, TYPE_UNQUALIFIED
);
1235 if (TREE_CODE (from_pointee
) == FUNCTION_TYPE
1236 && TYPE_QUALS (from_pointee
))
1237 from_pointee
= build_qualified_type (from_pointee
, TYPE_UNQUALIFIED
);
1241 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1242 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1245 if (tcode
== POINTER_TYPE
1246 && same_type_ignoring_top_level_qualifiers_p (from_pointee
,
1249 else if (VOID_TYPE_P (to_pointee
)
1250 && !TYPE_PTRDATAMEM_P (from
)
1251 && TREE_CODE (from_pointee
) != FUNCTION_TYPE
)
1253 tree nfrom
= TREE_TYPE (from
);
1254 /* Don't try to apply restrict to void. */
1255 int quals
= cp_type_quals (nfrom
) & ~TYPE_QUAL_RESTRICT
;
1256 from_pointee
= cp_build_qualified_type (void_type_node
, quals
);
1257 from
= build_pointer_type (from_pointee
);
1258 conv
= build_conv (ck_ptr
, from
, conv
);
1260 else if (TYPE_PTRDATAMEM_P (from
))
1262 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1263 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1265 if (same_type_p (fbase
, tbase
))
1266 /* No base conversion needed. */;
1267 else if (DERIVED_FROM_P (fbase
, tbase
)
1268 && (same_type_ignoring_top_level_qualifiers_p
1269 (from_pointee
, to_pointee
)))
1271 from
= build_ptrmem_type (tbase
, from_pointee
);
1272 conv
= build_conv (ck_pmem
, from
, conv
);
1277 else if (CLASS_TYPE_P (from_pointee
)
1278 && CLASS_TYPE_P (to_pointee
)
1281 An rvalue of type "pointer to cv D," where D is a
1282 class type, can be converted to an rvalue of type
1283 "pointer to cv B," where B is a base class (clause
1284 _class.derived_) of D. If B is an inaccessible
1285 (clause _class.access_) or ambiguous
1286 (_class.member.lookup_) base class of D, a program
1287 that necessitates this conversion is ill-formed.
1288 Therefore, we use DERIVED_FROM_P, and do not check
1289 access or uniqueness. */
1290 && DERIVED_FROM_P (to_pointee
, from_pointee
))
1293 = cp_build_qualified_type (to_pointee
,
1294 cp_type_quals (from_pointee
));
1295 from
= build_pointer_type (from_pointee
);
1296 conv
= build_conv (ck_ptr
, from
, conv
);
1297 conv
->base_p
= true;
1300 if (same_type_p (from
, to
))
1302 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
1303 /* In a C-style cast, we ignore CV-qualification because we
1304 are allowed to perform a static_cast followed by a
1306 conv
= build_conv (ck_qual
, to
, conv
);
1307 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1308 conv
= build_conv (ck_qual
, to
, conv
);
1309 else if (expr
&& string_conv_p (to
, expr
, 0))
1310 /* converting from string constant to char *. */
1311 conv
= build_conv (ck_qual
, to
, conv
);
1312 else if (fnptr_conv_p (to
, from
))
1313 conv
= build_conv (ck_fnptr
, to
, conv
);
1314 /* Allow conversions among compatible ObjC pointer types (base
1315 conversions have been already handled above). */
1316 else if (c_dialect_objc ()
1317 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1318 conv
= build_conv (ck_ptr
, to
, conv
);
1319 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1321 conv
= build_conv (ck_ptr
, to
, conv
);
1329 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1331 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1332 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1333 tree fbase
= class_of_this_parm (fromfn
);
1334 tree tbase
= class_of_this_parm (tofn
);
1336 if (!DERIVED_FROM_P (fbase
, tbase
))
1339 tree fstat
= static_fn_type (fromfn
);
1340 tree tstat
= static_fn_type (tofn
);
1341 if (same_type_p (tstat
, fstat
)
1342 || fnptr_conv_p (tstat
, fstat
))
1347 if (!same_type_p (fbase
, tbase
))
1349 from
= build_memfn_type (fstat
,
1351 cp_type_quals (tbase
),
1352 type_memfn_rqual (tofn
));
1353 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1354 conv
= build_conv (ck_pmem
, from
, conv
);
1355 conv
->base_p
= true;
1357 if (fnptr_conv_p (tstat
, fstat
))
1358 conv
= build_conv (ck_fnptr
, to
, conv
);
1360 else if (tcode
== BOOLEAN_TYPE
)
1364 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1365 to member type can be converted to a prvalue of type bool. ...
1366 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1367 std::nullptr_t can be converted to a prvalue of type bool; */
1368 if (ARITHMETIC_TYPE_P (from
)
1369 || UNSCOPED_ENUM_P (from
)
1370 || fcode
== POINTER_TYPE
1371 || TYPE_PTRMEM_P (from
)
1372 || NULLPTR_TYPE_P (from
))
1374 conv
= build_conv (ck_std
, to
, conv
);
1375 if (fcode
== POINTER_TYPE
1376 || TYPE_PTRDATAMEM_P (from
)
1377 || (TYPE_PTRMEMFUNC_P (from
)
1378 && conv
->rank
< cr_pbool
)
1379 || NULLPTR_TYPE_P (from
))
1380 conv
->rank
= cr_pbool
;
1381 if (NULLPTR_TYPE_P (from
) && (flags
& LOOKUP_ONLYCONVERTING
))
1388 /* We don't check for ENUMERAL_TYPE here because there are no standard
1389 conversions to enum type. */
1390 /* As an extension, allow conversion to complex type. */
1391 else if (ARITHMETIC_TYPE_P (to
))
1393 if (! (INTEGRAL_CODE_P (fcode
)
1394 || (fcode
== REAL_TYPE
&& !(flags
& LOOKUP_NO_NON_INTEGRAL
)))
1395 || SCOPED_ENUM_P (from
))
1397 conv
= build_conv (ck_std
, to
, conv
);
1399 /* Give this a better rank if it's a promotion. */
1400 if (same_type_p (to
, type_promotes_to (from
))
1401 && next_conversion (conv
)->rank
<= cr_promotion
)
1402 conv
->rank
= cr_promotion
;
1404 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1405 && vector_types_convertible_p (from
, to
, false))
1406 return build_conv (ck_std
, to
, conv
);
1407 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1408 && is_properly_derived_from (from
, to
))
1410 if (conv
->kind
== ck_rvalue
)
1411 conv
= next_conversion (conv
);
1412 conv
= build_conv (ck_base
, to
, conv
);
1413 /* The derived-to-base conversion indicates the initialization
1414 of a parameter with base type from an object of a derived
1415 type. A temporary object is created to hold the result of
1416 the conversion unless we're binding directly to a reference. */
1417 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1422 if (flags
& LOOKUP_NO_NARROWING
)
1423 conv
->check_narrowing
= true;
1428 /* Returns nonzero if T1 is reference-related to T2. */
1431 reference_related_p (tree t1
, tree t2
)
1433 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1436 t1
= TYPE_MAIN_VARIANT (t1
);
1437 t2
= TYPE_MAIN_VARIANT (t2
);
1441 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1442 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1444 return (same_type_p (t1
, t2
)
1445 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1446 && DERIVED_FROM_P (t1
, t2
)));
1449 /* Returns nonzero if T1 is reference-compatible with T2. */
1452 reference_compatible_p (tree t1
, tree t2
)
1456 "cv1 T1" is reference compatible with "cv2 T2" if
1457 * T1 is reference-related to T2 or
1458 * T2 is "noexcept function" and T1 is "function", where the
1459 function types are otherwise the same,
1460 and cv1 is the same cv-qualification as, or greater cv-qualification
1462 return ((reference_related_p (t1
, t2
)
1463 || fnptr_conv_p (t1
, t2
))
1464 && at_least_as_qualified_p (t1
, t2
));
1467 /* A reference of the indicated TYPE is being bound directly to the
1468 expression represented by the implicit conversion sequence CONV.
1469 Return a conversion sequence for this binding. */
1472 direct_reference_binding (tree type
, conversion
*conv
)
1476 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
1477 gcc_assert (TREE_CODE (conv
->type
) != REFERENCE_TYPE
);
1479 t
= TREE_TYPE (type
);
1483 When a parameter of reference type binds directly
1484 (_dcl.init.ref_) to an argument expression, the implicit
1485 conversion sequence is the identity conversion, unless the
1486 argument expression has a type that is a derived class of the
1487 parameter type, in which case the implicit conversion sequence is
1488 a derived-to-base Conversion.
1490 If the parameter binds directly to the result of applying a
1491 conversion function to the argument expression, the implicit
1492 conversion sequence is a user-defined conversion sequence
1493 (_over.ics.user_), with the second standard conversion sequence
1494 either an identity conversion or, if the conversion function
1495 returns an entity of a type that is a derived class of the
1496 parameter type, a derived-to-base conversion. */
1497 if (is_properly_derived_from (conv
->type
, t
))
1499 /* Represent the derived-to-base conversion. */
1500 conv
= build_conv (ck_base
, t
, conv
);
1501 /* We will actually be binding to the base-class subobject in
1502 the derived class, so we mark this conversion appropriately.
1503 That way, convert_like knows not to generate a temporary. */
1504 conv
->need_temporary_p
= false;
1506 return build_conv (ck_ref_bind
, type
, conv
);
1509 /* Returns the conversion path from type FROM to reference type TO for
1510 purposes of reference binding. For lvalue binding, either pass a
1511 reference type to FROM or an lvalue expression to EXPR. If the
1512 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1513 the conversion returned. If C_CAST_P is true, this
1514 conversion is coming from a C-style cast. */
1517 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1518 tsubst_flags_t complain
)
1520 conversion
*conv
= NULL
;
1521 tree to
= TREE_TYPE (rto
);
1526 cp_lvalue_kind gl_kind
;
1529 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1531 expr
= instantiate_type (to
, expr
, tf_none
);
1532 if (expr
== error_mark_node
)
1534 from
= TREE_TYPE (expr
);
1537 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1539 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1540 /* DR 1288: Otherwise, if the initializer list has a single element
1541 of type E and ... [T's] referenced type is reference-related to E,
1542 the object or reference is initialized from that element... */
1543 if (CONSTRUCTOR_NELTS (expr
) == 1)
1545 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1546 if (error_operand_p (elt
))
1548 tree etype
= TREE_TYPE (elt
);
1549 if (reference_related_p (to
, etype
))
1556 /* Otherwise, if T is a reference type, a prvalue temporary of the
1557 type referenced by T is copy-list-initialized or
1558 direct-list-initialized, depending on the kind of initialization
1559 for the reference, and the reference is bound to that temporary. */
1560 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1561 flags
|LOOKUP_NO_TEMP_BIND
, complain
);
1565 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1567 from
= TREE_TYPE (from
);
1568 if (!TYPE_REF_IS_RVALUE (rfrom
)
1569 || TREE_CODE (from
) == FUNCTION_TYPE
)
1570 gl_kind
= clk_ordinary
;
1572 gl_kind
= clk_rvalueref
;
1575 gl_kind
= lvalue_kind (expr
);
1576 else if (CLASS_TYPE_P (from
)
1577 || TREE_CODE (from
) == ARRAY_TYPE
)
1578 gl_kind
= clk_class
;
1582 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1583 if ((flags
& LOOKUP_NO_TEMP_BIND
)
1584 && (gl_kind
& clk_class
))
1587 /* Same mask as real_lvalue_p. */
1588 is_lvalue
= gl_kind
&& !(gl_kind
& (clk_rvalueref
|clk_class
));
1591 if ((gl_kind
& clk_bitfield
) != 0)
1592 tfrom
= unlowered_expr_type (expr
);
1594 /* Figure out whether or not the types are reference-related and
1595 reference compatible. We have to do this after stripping
1596 references from FROM. */
1597 related_p
= reference_related_p (to
, tfrom
);
1598 /* If this is a C cast, first convert to an appropriately qualified
1599 type, so that we can later do a const_cast to the desired type. */
1600 if (related_p
&& c_cast_p
1601 && !at_least_as_qualified_p (to
, tfrom
))
1602 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1603 compatible_p
= reference_compatible_p (to
, tfrom
);
1605 /* Directly bind reference when target expression's type is compatible with
1606 the reference and expression is an lvalue. In DR391, the wording in
1607 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1608 const and rvalue references to rvalues of compatible class type.
1609 We should also do direct bindings for non-class xvalues. */
1610 if ((related_p
|| compatible_p
) && gl_kind
)
1614 If the initializer expression
1616 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1617 is reference-compatible with "cv2 T2,"
1619 the reference is bound directly to the initializer expression
1623 If the initializer expression is an rvalue, with T2 a class type,
1624 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1625 is bound to the object represented by the rvalue or to a sub-object
1626 within that object. */
1628 conv
= build_identity_conv (tfrom
, expr
);
1629 conv
= direct_reference_binding (rto
, conv
);
1631 if (flags
& LOOKUP_PREFER_RVALUE
)
1632 /* The top-level caller requested that we pretend that the lvalue
1633 be treated as an rvalue. */
1634 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1635 else if (TREE_CODE (rfrom
) == REFERENCE_TYPE
)
1636 /* Handle rvalue reference to function properly. */
1637 conv
->rvaluedness_matches_p
1638 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1640 conv
->rvaluedness_matches_p
1641 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1643 if ((gl_kind
& clk_bitfield
) != 0
1644 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1645 /* For the purposes of overload resolution, we ignore the fact
1646 this expression is a bitfield or packed field. (In particular,
1647 [over.ics.ref] says specifically that a function with a
1648 non-const reference parameter is viable even if the
1649 argument is a bitfield.)
1651 However, when we actually call the function we must create
1652 a temporary to which to bind the reference. If the
1653 reference is volatile, or isn't const, then we cannot make
1654 a temporary, so we just issue an error when the conversion
1656 conv
->need_temporary_p
= true;
1658 /* Don't allow binding of lvalues (other than function lvalues) to
1659 rvalue references. */
1660 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1661 && TREE_CODE (to
) != FUNCTION_TYPE
1662 && !(flags
& LOOKUP_PREFER_RVALUE
))
1665 /* Nor the reverse. */
1666 if (!is_lvalue
&& !TYPE_REF_IS_RVALUE (rto
)
1667 && (!CP_TYPE_CONST_NON_VOLATILE_P (to
)
1668 || (flags
& LOOKUP_NO_RVAL_BIND
))
1669 && TREE_CODE (to
) != FUNCTION_TYPE
)
1677 /* [class.conv.fct] A conversion function is never used to convert a
1678 (possibly cv-qualified) object to the (possibly cv-qualified) same
1679 object type (or a reference to it), to a (possibly cv-qualified) base
1680 class of that type (or a reference to it).... */
1681 else if (CLASS_TYPE_P (from
) && !related_p
1682 && !(flags
& LOOKUP_NO_CONVERSION
))
1686 If the initializer expression
1688 -- has a class type (i.e., T2 is a class type) can be
1689 implicitly converted to an lvalue of type "cv3 T3," where
1690 "cv1 T1" is reference-compatible with "cv3 T3". (this
1691 conversion is selected by enumerating the applicable
1692 conversion functions (_over.match.ref_) and choosing the
1693 best one through overload resolution. (_over.match_).
1695 the reference is bound to the lvalue result of the conversion
1696 in the second case. */
1697 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1700 return cand
->second_conv
;
1703 /* From this point on, we conceptually need temporaries, even if we
1704 elide them. Only the cases above are "direct bindings". */
1705 if (flags
& LOOKUP_NO_TEMP_BIND
)
1710 When a parameter of reference type is not bound directly to an
1711 argument expression, the conversion sequence is the one required
1712 to convert the argument expression to the underlying type of the
1713 reference according to _over.best.ics_. Conceptually, this
1714 conversion sequence corresponds to copy-initializing a temporary
1715 of the underlying type with the argument expression. Any
1716 difference in top-level cv-qualification is subsumed by the
1717 initialization itself and does not constitute a conversion. */
1721 Otherwise, the reference shall be an lvalue reference to a
1722 non-volatile const type, or the reference shall be an rvalue
1725 We try below to treat this as a bad conversion to improve diagnostics,
1726 but if TO is an incomplete class, we need to reject this conversion
1727 now to avoid unnecessary instantiation. */
1728 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
)
1729 && !COMPLETE_TYPE_P (to
))
1732 /* We're generating a temporary now, but don't bind any more in the
1733 conversion (specifically, don't slice the temporary returned by a
1734 conversion operator). */
1735 flags
|= LOOKUP_NO_TEMP_BIND
;
1737 /* Core issue 899: When [copy-]initializing a temporary to be bound
1738 to the first parameter of a copy constructor (12.8) called with
1739 a single argument in the context of direct-initialization,
1740 explicit conversion functions are also considered.
1742 So don't set LOOKUP_ONLYCONVERTING in that case. */
1743 if (!(flags
& LOOKUP_COPY_PARM
))
1744 flags
|= LOOKUP_ONLYCONVERTING
;
1747 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1752 if (conv
->user_conv_p
)
1754 /* If initializing the temporary used a conversion function,
1755 recalculate the second conversion sequence. */
1756 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1757 if (t
->kind
== ck_user
1758 && DECL_CONV_FN_P (t
->cand
->fn
))
1760 tree ftype
= TREE_TYPE (TREE_TYPE (t
->cand
->fn
));
1761 int sflags
= (flags
|LOOKUP_NO_CONVERSION
)&~LOOKUP_NO_TEMP_BIND
;
1762 conversion
*new_second
1763 = reference_binding (rto
, ftype
, NULL_TREE
, c_cast_p
,
1767 return merge_conversion_sequences (t
, new_second
);
1771 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1772 /* This reference binding, unlike those above, requires the
1773 creation of a temporary. */
1774 conv
->need_temporary_p
= true;
1775 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1779 Otherwise, the reference shall be an lvalue reference to a
1780 non-volatile const type, or the reference shall be an rvalue
1782 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1787 Otherwise, a temporary of type "cv1 T1" is created and
1788 initialized from the initializer expression using the rules for a
1789 non-reference copy initialization. If T1 is reference-related to
1790 T2, cv1 must be the same cv-qualification as, or greater
1791 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1792 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1798 /* Returns the implicit conversion sequence (see [over.ics]) from type
1799 FROM to type TO. The optional expression EXPR may affect the
1800 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1801 true, this conversion is coming from a C-style cast. */
1804 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1805 int flags
, tsubst_flags_t complain
)
1809 if (from
== error_mark_node
|| to
== error_mark_node
1810 || expr
== error_mark_node
)
1813 /* Other flags only apply to the primary function in overload
1814 resolution, or after we've chosen one. */
1815 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1816 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1817 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1819 /* FIXME: actually we don't want warnings either, but we can't just
1820 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1821 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1822 We really ought not to issue that warning until we've committed
1823 to that conversion. */
1824 complain
&= ~tf_error
;
1826 /* Call reshape_init early to remove redundant braces. */
1827 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
)
1828 && CLASS_TYPE_P (to
)
1829 && COMPLETE_TYPE_P (complete_type (to
))
1830 && !CLASSTYPE_NON_AGGREGATE (to
))
1832 expr
= reshape_init (to
, expr
, complain
);
1833 if (expr
== error_mark_node
)
1835 from
= TREE_TYPE (expr
);
1838 if (TREE_CODE (to
) == REFERENCE_TYPE
)
1839 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1841 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
, complain
);
1846 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1848 if (is_std_init_list (to
))
1849 return build_list_conv (to
, expr
, flags
, complain
);
1851 /* As an extension, allow list-initialization of _Complex. */
1852 if (TREE_CODE (to
) == COMPLEX_TYPE
)
1854 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1859 /* Allow conversion from an initializer-list with one element to a
1861 if (SCALAR_TYPE_P (to
))
1863 int nelts
= CONSTRUCTOR_NELTS (expr
);
1867 elt
= build_value_init (to
, tf_none
);
1868 else if (nelts
== 1)
1869 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1871 elt
= error_mark_node
;
1873 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1874 c_cast_p
, flags
, complain
);
1877 conv
->check_narrowing
= true;
1878 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1879 /* Too many levels of braces, i.e. '{{1}}'. */
1884 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1885 return build_array_conv (to
, expr
, flags
, complain
);
1888 if (expr
!= NULL_TREE
1889 && (MAYBE_CLASS_TYPE_P (from
)
1890 || MAYBE_CLASS_TYPE_P (to
))
1891 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1893 struct z_candidate
*cand
;
1895 if (CLASS_TYPE_P (to
)
1896 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
1897 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
1898 return build_aggr_conv (to
, expr
, flags
, complain
);
1900 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
1903 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
1904 && CONSTRUCTOR_NELTS (expr
) == 1
1905 && !is_list_ctor (cand
->fn
))
1907 /* "If C is not an initializer-list constructor and the
1908 initializer list has a single element of type cv U, where U is
1909 X or a class derived from X, the implicit conversion sequence
1910 has Exact Match rank if U is X, or Conversion rank if U is
1912 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1913 tree elttype
= TREE_TYPE (elt
);
1914 if (reference_related_p (to
, elttype
))
1915 return implicit_conversion (to
, elttype
, elt
,
1916 c_cast_p
, flags
, complain
);
1918 conv
= cand
->second_conv
;
1921 /* We used to try to bind a reference to a temporary here, but that
1922 is now handled after the recursive call to this function at the end
1923 of reference_binding. */
1930 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1931 functions. ARGS will not be changed until a single candidate is
1934 static struct z_candidate
*
1935 add_candidate (struct z_candidate
**candidates
,
1936 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
1937 size_t num_convs
, conversion
**convs
,
1938 tree access_path
, tree conversion_path
,
1939 int viable
, struct rejection_reason
*reason
,
1942 struct z_candidate
*cand
= (struct z_candidate
*)
1943 conversion_obstack_alloc (sizeof (struct z_candidate
));
1946 cand
->first_arg
= first_arg
;
1948 cand
->convs
= convs
;
1949 cand
->num_convs
= num_convs
;
1950 cand
->access_path
= access_path
;
1951 cand
->conversion_path
= conversion_path
;
1952 cand
->viable
= viable
;
1953 cand
->reason
= reason
;
1954 cand
->next
= *candidates
;
1955 cand
->flags
= flags
;
1961 /* Return the number of remaining arguments in the parameter list
1962 beginning with ARG. */
1965 remaining_arguments (tree arg
)
1969 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
1970 arg
= TREE_CHAIN (arg
))
1976 /* Create an overload candidate for the function or method FN called
1977 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1978 FLAGS is passed on to implicit_conversion.
1980 This does not change ARGS.
1982 CTYPE, if non-NULL, is the type we want to pretend this function
1983 comes from for purposes of overload resolution. */
1985 static struct z_candidate
*
1986 add_function_candidate (struct z_candidate
**candidates
,
1987 tree fn
, tree ctype
, tree first_arg
,
1988 const vec
<tree
, va_gc
> *args
, tree access_path
,
1989 tree conversion_path
, int flags
,
1990 tsubst_flags_t complain
)
1992 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1996 tree orig_first_arg
= first_arg
;
1999 struct rejection_reason
*reason
= NULL
;
2001 /* At this point we should not see any functions which haven't been
2002 explicitly declared, except for friend functions which will have
2003 been found using argument dependent lookup. */
2004 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
2006 /* The `this', `in_chrg' and VTT arguments to constructors are not
2007 considered in overload resolution. */
2008 if (DECL_CONSTRUCTOR_P (fn
))
2010 if (ctor_omit_inherited_parms (fn
))
2011 /* Bring back parameters omitted from an inherited ctor. */
2012 parmlist
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn
));
2014 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
2015 skip
= num_artificial_parms_for (fn
);
2016 if (skip
> 0 && first_arg
!= NULL_TREE
)
2019 first_arg
= NULL_TREE
;
2025 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
2026 convs
= alloc_conversions (len
);
2028 /* 13.3.2 - Viable functions [over.match.viable]
2029 First, to be a viable function, a candidate function shall have enough
2030 parameters to agree in number with the arguments in the list.
2032 We need to check this first; otherwise, checking the ICSes might cause
2033 us to produce an ill-formed template instantiation. */
2035 parmnode
= parmlist
;
2036 for (i
= 0; i
< len
; ++i
)
2038 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
2040 parmnode
= TREE_CHAIN (parmnode
);
2043 if ((i
< len
&& parmnode
)
2044 || !sufficient_parms_p (parmnode
))
2046 int remaining
= remaining_arguments (parmnode
);
2048 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
2051 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2052 parameter of type "reference to cv C" (including such a constructor
2053 instantiated from a template) is excluded from the set of candidate
2054 functions when used to construct an object of type D with an argument list
2055 containing a single argument if C is reference-related to D. */
2056 if (viable
&& len
== 1 && parmlist
&& DECL_CONSTRUCTOR_P (fn
)
2057 && flag_new_inheriting_ctors
2058 && DECL_INHERITED_CTOR (fn
))
2060 tree ptype
= non_reference (TREE_VALUE (parmlist
));
2061 tree dtype
= DECL_CONTEXT (fn
);
2062 tree btype
= DECL_INHERITED_CTOR_BASE (fn
);
2063 if (reference_related_p (ptype
, dtype
)
2064 && reference_related_p (btype
, ptype
))
2067 reason
= inherited_ctor_rejection ();
2071 /* Second, for a function to be viable, its constraints must be
2073 if (flag_concepts
&& viable
2074 && !constraints_satisfied_p (fn
))
2076 reason
= constraint_failure (fn
);
2080 /* When looking for a function from a subobject from an implicit
2081 copy/move constructor/operator=, don't consider anything that takes (a
2082 reference to) an unrelated type. See c++/44909 and core 1092. */
2083 if (viable
&& parmlist
&& (flags
& LOOKUP_DEFAULTED
))
2085 if (DECL_CONSTRUCTOR_P (fn
))
2087 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
2088 && DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
)
2094 parmnode
= chain_index (i
-1, parmlist
);
2095 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
2100 /* This only applies at the top level. */
2101 flags
&= ~LOOKUP_DEFAULTED
;
2107 /* Third, for F to be a viable function, there shall exist for each
2108 argument an implicit conversion sequence that converts that argument
2109 to the corresponding parameter of F. */
2111 parmnode
= parmlist
;
2113 for (i
= 0; i
< len
; ++i
)
2115 tree argtype
, to_type
;
2120 if (parmnode
== void_list_node
)
2123 if (i
== 0 && first_arg
!= NULL_TREE
)
2126 arg
= CONST_CAST_TREE (
2127 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
2128 argtype
= lvalue_type (arg
);
2130 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2131 && ! DECL_CONSTRUCTOR_P (fn
));
2135 tree parmtype
= TREE_VALUE (parmnode
);
2138 parmnode
= TREE_CHAIN (parmnode
);
2140 /* The type of the implicit object parameter ('this') for
2141 overload resolution is not always the same as for the
2142 function itself; conversion functions are considered to
2143 be members of the class being converted, and functions
2144 introduced by a using-declaration are considered to be
2145 members of the class that uses them.
2147 Since build_over_call ignores the ICS for the `this'
2148 parameter, we can just change the parm type. */
2149 if (ctype
&& is_this
)
2151 parmtype
= cp_build_qualified_type
2152 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
2153 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
2155 /* If the function has a ref-qualifier, the implicit
2156 object parameter has reference type. */
2157 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
2158 parmtype
= cp_build_reference_type (parmtype
, rv
);
2159 /* The special handling of 'this' conversions in compare_ics
2160 does not apply if there is a ref-qualifier. */
2165 parmtype
= build_pointer_type (parmtype
);
2166 arg
= build_this (arg
);
2167 argtype
= lvalue_type (arg
);
2171 /* Core issue 899: When [copy-]initializing a temporary to be bound
2172 to the first parameter of a copy constructor (12.8) called with
2173 a single argument in the context of direct-initialization,
2174 explicit conversion functions are also considered.
2176 So set LOOKUP_COPY_PARM to let reference_binding know that
2177 it's being called in that context. We generalize the above
2178 to handle move constructors and template constructors as well;
2179 the standardese should soon be updated similarly. */
2180 if (ctype
&& i
== 0 && (len
-skip
== 1)
2181 && DECL_CONSTRUCTOR_P (fn
)
2182 && parmtype
!= error_mark_node
2183 && (same_type_ignoring_top_level_qualifiers_p
2184 (non_reference (parmtype
), ctype
)))
2186 if (!(flags
& LOOKUP_ONLYCONVERTING
))
2187 lflags
|= LOOKUP_COPY_PARM
;
2188 /* We allow user-defined conversions within init-lists, but
2189 don't list-initialize the copy parm, as that would mean
2190 using two levels of braces for the same type. */
2191 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
2192 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
2193 lflags
|= LOOKUP_NO_CONVERSION
;
2196 lflags
|= LOOKUP_ONLYCONVERTING
;
2198 t
= implicit_conversion (parmtype
, argtype
, arg
,
2199 /*c_cast_p=*/false, lflags
, complain
);
2204 t
= build_identity_conv (argtype
, arg
);
2205 t
->ellipsis_p
= true;
2216 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
);
2223 reason
= bad_arg_conversion_rejection (first_arg
, i
, arg
, to_type
);
2228 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2229 access_path
, conversion_path
, viable
, reason
, flags
);
2232 /* Create an overload candidate for the conversion function FN which will
2233 be invoked for expression OBJ, producing a pointer-to-function which
2234 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2235 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2236 passed on to implicit_conversion.
2238 Actually, we don't really care about FN; we care about the type it
2239 converts to. There may be multiple conversion functions that will
2240 convert to that type, and we rely on build_user_type_conversion_1 to
2241 choose the best one; so when we create our candidate, we record the type
2242 instead of the function. */
2244 static struct z_candidate
*
2245 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2246 const vec
<tree
, va_gc
> *arglist
,
2247 tree access_path
, tree conversion_path
,
2248 tsubst_flags_t complain
)
2250 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2251 int i
, len
, viable
, flags
;
2252 tree parmlist
, parmnode
;
2254 struct rejection_reason
*reason
;
2256 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2257 parmlist
= TREE_TYPE (parmlist
);
2258 parmlist
= TYPE_ARG_TYPES (parmlist
);
2260 len
= vec_safe_length (arglist
) + 1;
2261 convs
= alloc_conversions (len
);
2262 parmnode
= parmlist
;
2264 flags
= LOOKUP_IMPLICIT
;
2267 /* Don't bother looking up the same type twice. */
2268 if (*candidates
&& (*candidates
)->fn
== totype
)
2271 for (i
= 0; i
< len
; ++i
)
2273 tree arg
, argtype
, convert_type
= NULL_TREE
;
2279 arg
= (*arglist
)[i
- 1];
2280 argtype
= lvalue_type (arg
);
2284 t
= implicit_conversion (totype
, argtype
, arg
, /*c_cast_p=*/false,
2286 convert_type
= totype
;
2288 else if (parmnode
== void_list_node
)
2292 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2293 /*c_cast_p=*/false, flags
, complain
);
2294 convert_type
= TREE_VALUE (parmnode
);
2298 t
= build_identity_conv (argtype
, arg
);
2299 t
->ellipsis_p
= true;
2300 convert_type
= argtype
;
2310 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, arg
, convert_type
);
2317 parmnode
= TREE_CHAIN (parmnode
);
2321 || ! sufficient_parms_p (parmnode
))
2323 int remaining
= remaining_arguments (parmnode
);
2325 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2328 return add_candidate (candidates
, totype
, obj
, arglist
, len
, convs
,
2329 access_path
, conversion_path
, viable
, reason
, flags
);
2333 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2334 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2335 int flags
, tsubst_flags_t complain
)
2342 struct rejection_reason
*reason
= NULL
;
2347 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2348 convs
= alloc_conversions (num_convs
);
2350 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2351 conversion ops are allowed. We handle that here by just checking for
2352 boolean_type_node because other operators don't ask for it. COND_EXPR
2353 also does contextual conversion to bool for the first operand, but we
2354 handle that in build_conditional_expr, and type1 here is operand 2. */
2355 if (type1
!= boolean_type_node
)
2356 flags
|= LOOKUP_ONLYCONVERTING
;
2358 for (i
= 0; i
< 2; ++i
)
2363 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2364 /*c_cast_p=*/false, flags
, complain
);
2368 /* We need something for printing the candidate. */
2369 t
= build_identity_conv (types
[i
], NULL_TREE
);
2370 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2376 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, args
[i
],
2382 /* For COND_EXPR we rearranged the arguments; undo that now. */
2385 convs
[2] = convs
[1];
2386 convs
[1] = convs
[0];
2387 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2388 /*c_cast_p=*/false, flags
,
2395 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2400 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2402 /*access_path=*/NULL_TREE
,
2403 /*conversion_path=*/NULL_TREE
,
2404 viable
, reason
, flags
);
2408 is_complete (tree t
)
2410 return COMPLETE_TYPE_P (complete_type (t
));
2413 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2416 promoted_arithmetic_type_p (tree type
)
2420 In this section, the term promoted integral type is used to refer
2421 to those integral types which are preserved by integral promotion
2422 (including e.g. int and long but excluding e.g. char).
2423 Similarly, the term promoted arithmetic type refers to promoted
2424 integral types plus floating types. */
2425 return ((CP_INTEGRAL_TYPE_P (type
)
2426 && same_type_p (type_promotes_to (type
), type
))
2427 || TREE_CODE (type
) == REAL_TYPE
);
2430 /* Create any builtin operator overload candidates for the operator in
2431 question given the converted operand types TYPE1 and TYPE2. The other
2432 args are passed through from add_builtin_candidates to
2433 build_builtin_candidate.
2435 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2436 If CODE is requires candidates operands of the same type of the kind
2437 of which TYPE1 and TYPE2 are, we add both candidates
2438 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2441 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2442 enum tree_code code2
, tree fnname
, tree type1
,
2443 tree type2
, tree
*args
, tree
*argtypes
, int flags
,
2444 tsubst_flags_t complain
)
2448 case POSTINCREMENT_EXPR
:
2449 case POSTDECREMENT_EXPR
:
2450 args
[1] = integer_zero_node
;
2451 type2
= integer_type_node
;
2460 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2461 and VQ is either volatile or empty, there exist candidate operator
2462 functions of the form
2463 VQ T& operator++(VQ T&);
2464 T operator++(VQ T&, int);
2465 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2466 type other than bool, and VQ is either volatile or empty, there exist
2467 candidate operator functions of the form
2468 VQ T& operator--(VQ T&);
2469 T operator--(VQ T&, int);
2470 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2471 complete object type, and VQ is either volatile or empty, there exist
2472 candidate operator functions of the form
2473 T*VQ& operator++(T*VQ&);
2474 T*VQ& operator--(T*VQ&);
2475 T* operator++(T*VQ&, int);
2476 T* operator--(T*VQ&, int); */
2478 case POSTDECREMENT_EXPR
:
2479 case PREDECREMENT_EXPR
:
2480 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2483 case POSTINCREMENT_EXPR
:
2484 case PREINCREMENT_EXPR
:
2485 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2487 type1
= build_reference_type (type1
);
2492 /* 7 For every cv-qualified or cv-unqualified object type T, there
2493 exist candidate operator functions of the form
2497 8 For every function type T, there exist candidate operator functions of
2499 T& operator*(T*); */
2502 if (TYPE_PTR_P (type1
)
2503 && (TYPE_PTROB_P (type1
)
2504 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2508 /* 9 For every type T, there exist candidate operator functions of the form
2511 10For every promoted arithmetic type T, there exist candidate operator
2512 functions of the form
2516 case UNARY_PLUS_EXPR
: /* unary + */
2517 if (TYPE_PTR_P (type1
))
2521 if (ARITHMETIC_TYPE_P (type1
))
2525 /* 11For every promoted integral type T, there exist candidate operator
2526 functions of the form
2530 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2534 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2535 is the same type as C2 or is a derived class of C2, T is a complete
2536 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2537 there exist candidate operator functions of the form
2538 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2539 where CV12 is the union of CV1 and CV2. */
2542 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2544 tree c1
= TREE_TYPE (type1
);
2545 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2547 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2548 && (TYPE_PTRMEMFUNC_P (type2
)
2549 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2554 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2555 didate operator functions of the form
2560 bool operator<(L, R);
2561 bool operator>(L, R);
2562 bool operator<=(L, R);
2563 bool operator>=(L, R);
2564 bool operator==(L, R);
2565 bool operator!=(L, R);
2566 where LR is the result of the usual arithmetic conversions between
2569 14For every pair of types T and I, where T is a cv-qualified or cv-
2570 unqualified complete object type and I is a promoted integral type,
2571 there exist candidate operator functions of the form
2572 T* operator+(T*, I);
2573 T& operator[](T*, I);
2574 T* operator-(T*, I);
2575 T* operator+(I, T*);
2576 T& operator[](I, T*);
2578 15For every T, where T is a pointer to complete object type, there exist
2579 candidate operator functions of the form112)
2580 ptrdiff_t operator-(T, T);
2582 16For every pointer or enumeration type T, there exist candidate operator
2583 functions of the form
2584 bool operator<(T, T);
2585 bool operator>(T, T);
2586 bool operator<=(T, T);
2587 bool operator>=(T, T);
2588 bool operator==(T, T);
2589 bool operator!=(T, T);
2591 17For every pointer to member type T, there exist candidate operator
2592 functions of the form
2593 bool operator==(T, T);
2594 bool operator!=(T, T); */
2597 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2599 if (TYPE_PTROB_P (type1
)
2600 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2602 type2
= ptrdiff_type_node
;
2607 case TRUNC_DIV_EXPR
:
2608 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2614 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2615 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2617 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2622 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2634 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2636 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2638 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2639 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2641 if (TYPE_PTR_P (type1
)
2642 && null_ptr_cst_p (args
[1]))
2647 if (null_ptr_cst_p (args
[0])
2648 && TYPE_PTR_P (type2
))
2656 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2660 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2662 type1
= ptrdiff_type_node
;
2665 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2667 type2
= ptrdiff_type_node
;
2672 /* 18For every pair of promoted integral types L and R, there exist candi-
2673 date operator functions of the form
2680 where LR is the result of the usual arithmetic conversions between
2683 case TRUNC_MOD_EXPR
:
2689 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2693 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2694 type, VQ is either volatile or empty, and R is a promoted arithmetic
2695 type, there exist candidate operator functions of the form
2696 VQ L& operator=(VQ L&, R);
2697 VQ L& operator*=(VQ L&, R);
2698 VQ L& operator/=(VQ L&, R);
2699 VQ L& operator+=(VQ L&, R);
2700 VQ L& operator-=(VQ L&, R);
2702 20For every pair T, VQ), where T is any type and VQ is either volatile
2703 or empty, there exist candidate operator functions of the form
2704 T*VQ& operator=(T*VQ&, T*);
2706 21For every pair T, VQ), where T is a pointer to member type and VQ is
2707 either volatile or empty, there exist candidate operator functions of
2709 VQ T& operator=(VQ T&, T);
2711 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2712 unqualified complete object type, VQ is either volatile or empty, and
2713 I is a promoted integral type, there exist candidate operator func-
2715 T*VQ& operator+=(T*VQ&, I);
2716 T*VQ& operator-=(T*VQ&, I);
2718 23For every triple L, VQ, R), where L is an integral or enumeration
2719 type, VQ is either volatile or empty, and R is a promoted integral
2720 type, there exist candidate operator functions of the form
2722 VQ L& operator%=(VQ L&, R);
2723 VQ L& operator<<=(VQ L&, R);
2724 VQ L& operator>>=(VQ L&, R);
2725 VQ L& operator&=(VQ L&, R);
2726 VQ L& operator^=(VQ L&, R);
2727 VQ L& operator|=(VQ L&, R); */
2734 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2736 type2
= ptrdiff_type_node
;
2741 case TRUNC_DIV_EXPR
:
2742 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2746 case TRUNC_MOD_EXPR
:
2752 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2757 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2759 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2760 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2761 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2762 || ((TYPE_PTRMEMFUNC_P (type1
)
2763 || TYPE_PTR_P (type1
))
2764 && null_ptr_cst_p (args
[1])))
2774 type1
= build_reference_type (type1
);
2780 For every pair of promoted arithmetic types L and R, there
2781 exist candidate operator functions of the form
2783 LR operator?(bool, L, R);
2785 where LR is the result of the usual arithmetic conversions
2786 between types L and R.
2788 For every type T, where T is a pointer or pointer-to-member
2789 type, there exist candidate operator functions of the form T
2790 operator?(bool, T, T); */
2792 if (promoted_arithmetic_type_p (type1
)
2793 && promoted_arithmetic_type_p (type2
))
2797 /* Otherwise, the types should be pointers. */
2798 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2801 /* We don't check that the two types are the same; the logic
2802 below will actually create two candidates; one in which both
2803 parameter types are TYPE1, and one in which both parameter
2809 if (ARITHMETIC_TYPE_P (type1
))
2817 /* Make sure we don't create builtin candidates with dependent types. */
2818 bool u1
= uses_template_parms (type1
);
2819 bool u2
= type2
? uses_template_parms (type2
) : false;
2822 /* Try to recover if one of the types is non-dependent. But if
2823 there's only one type, there's nothing we can do. */
2826 /* And we lose if both are dependent. */
2829 /* Or if they have different forms. */
2830 if (TREE_CODE (type1
) != TREE_CODE (type2
))
2839 /* If we're dealing with two pointer types or two enumeral types,
2840 we need candidates for both of them. */
2841 if (type2
&& !same_type_p (type1
, type2
)
2842 && TREE_CODE (type1
) == TREE_CODE (type2
)
2843 && (TREE_CODE (type1
) == REFERENCE_TYPE
2844 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2845 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2846 || TYPE_PTRMEMFUNC_P (type1
)
2847 || MAYBE_CLASS_TYPE_P (type1
)
2848 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2850 if (TYPE_PTR_OR_PTRMEM_P (type1
))
2852 tree cptype
= composite_pointer_type (type1
, type2
,
2857 if (cptype
!= error_mark_node
)
2859 build_builtin_candidate
2860 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
2866 build_builtin_candidate
2867 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
2868 build_builtin_candidate
2869 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
2873 build_builtin_candidate
2874 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
2878 type_decays_to (tree type
)
2880 if (TREE_CODE (type
) == ARRAY_TYPE
)
2881 return build_pointer_type (TREE_TYPE (type
));
2882 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2883 return build_pointer_type (type
);
2887 /* There are three conditions of builtin candidates:
2889 1) bool-taking candidates. These are the same regardless of the input.
2890 2) pointer-pair taking candidates. These are generated for each type
2891 one of the input types converts to.
2892 3) arithmetic candidates. According to the standard, we should generate
2893 all of these, but I'm trying not to...
2895 Here we generate a superset of the possible candidates for this particular
2896 case. That is a subset of the full set the standard defines, plus some
2897 other cases which the standard disallows. add_builtin_candidate will
2898 filter out the invalid set. */
2901 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2902 enum tree_code code2
, tree fnname
, tree
*args
,
2903 int flags
, tsubst_flags_t complain
)
2907 tree type
, argtypes
[3], t
;
2908 /* TYPES[i] is the set of possible builtin-operator parameter types
2909 we will consider for the Ith argument. */
2910 vec
<tree
, va_gc
> *types
[2];
2913 for (i
= 0; i
< 3; ++i
)
2916 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2918 argtypes
[i
] = NULL_TREE
;
2923 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2924 and VQ is either volatile or empty, there exist candidate operator
2925 functions of the form
2926 VQ T& operator++(VQ T&); */
2928 case POSTINCREMENT_EXPR
:
2929 case PREINCREMENT_EXPR
:
2930 case POSTDECREMENT_EXPR
:
2931 case PREDECREMENT_EXPR
:
2936 /* 24There also exist candidate operator functions of the form
2937 bool operator!(bool);
2938 bool operator&&(bool, bool);
2939 bool operator||(bool, bool); */
2941 case TRUTH_NOT_EXPR
:
2942 build_builtin_candidate
2943 (candidates
, fnname
, boolean_type_node
,
2944 NULL_TREE
, args
, argtypes
, flags
, complain
);
2947 case TRUTH_ORIF_EXPR
:
2948 case TRUTH_ANDIF_EXPR
:
2949 build_builtin_candidate
2950 (candidates
, fnname
, boolean_type_node
,
2951 boolean_type_node
, args
, argtypes
, flags
, complain
);
2973 types
[0] = make_tree_vector ();
2974 types
[1] = make_tree_vector ();
2976 for (i
= 0; i
< 2; ++i
)
2980 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
2984 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
2987 convs
= lookup_conversions (argtypes
[i
]);
2989 if (code
== COND_EXPR
)
2991 if (lvalue_p (args
[i
]))
2992 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
2994 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
3000 for (; convs
; convs
= TREE_CHAIN (convs
))
3002 type
= TREE_TYPE (convs
);
3005 && (TREE_CODE (type
) != REFERENCE_TYPE
3006 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
3009 if (code
== COND_EXPR
&& TREE_CODE (type
) == REFERENCE_TYPE
)
3010 vec_safe_push (types
[i
], type
);
3012 type
= non_reference (type
);
3013 if (i
!= 0 || ! ref1
)
3015 type
= cv_unqualified (type_decays_to (type
));
3016 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
3017 vec_safe_push (types
[i
], type
);
3018 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3019 type
= type_promotes_to (type
);
3022 if (! vec_member (type
, types
[i
]))
3023 vec_safe_push (types
[i
], type
);
3028 if (code
== COND_EXPR
&& lvalue_p (args
[i
]))
3029 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3030 type
= non_reference (argtypes
[i
]);
3031 if (i
!= 0 || ! ref1
)
3033 type
= cv_unqualified (type_decays_to (type
));
3034 if (enum_p
&& UNSCOPED_ENUM_P (type
))
3035 vec_safe_push (types
[i
], type
);
3036 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3037 type
= type_promotes_to (type
);
3039 vec_safe_push (types
[i
], type
);
3043 /* Run through the possible parameter types of both arguments,
3044 creating candidates with those parameter types. */
3045 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
3050 if (!types
[1]->is_empty ())
3051 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
3052 add_builtin_candidate
3053 (candidates
, code
, code2
, fnname
, t
,
3054 u
, args
, argtypes
, flags
, complain
);
3056 add_builtin_candidate
3057 (candidates
, code
, code2
, fnname
, t
,
3058 NULL_TREE
, args
, argtypes
, flags
, complain
);
3061 release_tree_vector (types
[0]);
3062 release_tree_vector (types
[1]);
3066 /* If TMPL can be successfully instantiated as indicated by
3067 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3069 TMPL is the template. EXPLICIT_TARGS are any explicit template
3070 arguments. ARGLIST is the arguments provided at the call-site.
3071 This does not change ARGLIST. The RETURN_TYPE is the desired type
3072 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3073 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3074 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3076 static struct z_candidate
*
3077 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
3078 tree ctype
, tree explicit_targs
, tree first_arg
,
3079 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3080 tree access_path
, tree conversion_path
,
3081 int flags
, tree obj
, unification_kind_t strict
,
3082 tsubst_flags_t complain
)
3084 int ntparms
= DECL_NTPARMS (tmpl
);
3085 tree targs
= make_tree_vec (ntparms
);
3086 unsigned int len
= vec_safe_length (arglist
);
3087 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
3088 unsigned int skip_without_in_chrg
= 0;
3089 tree first_arg_without_in_chrg
= first_arg
;
3090 tree
*args_without_in_chrg
;
3091 unsigned int nargs_without_in_chrg
;
3092 unsigned int ia
, ix
;
3094 struct z_candidate
*cand
;
3096 struct rejection_reason
*reason
= NULL
;
3099 /* We don't do deduction on the in-charge parameter, the VTT
3100 parameter or 'this'. */
3101 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
3103 if (first_arg_without_in_chrg
!= NULL_TREE
)
3104 first_arg_without_in_chrg
= NULL_TREE
;
3105 else if (return_type
&& strict
== DEDUCE_CALL
)
3106 /* We're deducing for a call to the result of a template conversion
3107 function, so the args don't contain 'this'; leave them alone. */;
3109 ++skip_without_in_chrg
;
3112 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
3113 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
3114 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
3116 if (first_arg_without_in_chrg
!= NULL_TREE
)
3117 first_arg_without_in_chrg
= NULL_TREE
;
3119 ++skip_without_in_chrg
;
3122 if (len
< skip_without_in_chrg
)
3125 if (DECL_CONSTRUCTOR_P (tmpl
) && nargs
== 2
3126 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg
),
3127 TREE_TYPE ((*arglist
)[0])))
3129 /* 12.8/6 says, "A declaration of a constructor for a class X is
3130 ill-formed if its first parameter is of type (optionally cv-qualified)
3131 X and either there are no other parameters or else all other
3132 parameters have default arguments. A member function template is never
3133 instantiated to produce such a constructor signature."
3135 So if we're trying to copy an object of the containing class, don't
3136 consider a template constructor that has a first parameter type that
3137 is just a template parameter, as we would deduce a signature that we
3138 would then reject in the code below. */
3139 if (tree firstparm
= FUNCTION_FIRST_USER_PARMTYPE (tmpl
))
3141 firstparm
= TREE_VALUE (firstparm
);
3142 if (PACK_EXPANSION_P (firstparm
))
3143 firstparm
= PACK_EXPANSION_PATTERN (firstparm
);
3144 if (TREE_CODE (firstparm
) == TEMPLATE_TYPE_PARM
)
3146 gcc_assert (!explicit_targs
);
3147 reason
= invalid_copy_with_fn_template_rejection ();
3153 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
3154 + (len
- skip_without_in_chrg
));
3155 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
3157 if (first_arg_without_in_chrg
!= NULL_TREE
)
3159 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
3162 for (ix
= skip_without_in_chrg
;
3163 vec_safe_iterate (arglist
, ix
, &arg
);
3166 args_without_in_chrg
[ia
] = arg
;
3169 gcc_assert (ia
== nargs_without_in_chrg
);
3171 errs
= errorcount
+sorrycount
;
3172 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
3173 args_without_in_chrg
,
3174 nargs_without_in_chrg
,
3175 return_type
, strict
, flags
, false,
3176 complain
& tf_decltype
);
3178 if (fn
== error_mark_node
)
3180 /* Don't repeat unification later if it already resulted in errors. */
3181 if (errorcount
+sorrycount
== errs
)
3182 reason
= template_unification_rejection (tmpl
, explicit_targs
,
3183 targs
, args_without_in_chrg
,
3184 nargs_without_in_chrg
,
3185 return_type
, strict
, flags
);
3187 reason
= template_unification_error_rejection ();
3191 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
3193 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
3194 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
3197 /* We're trying to produce a constructor with a prohibited signature,
3198 as discussed above; handle here any cases we didn't catch then,
3200 reason
= invalid_copy_with_fn_template_rejection ();
3205 if (obj
!= NULL_TREE
)
3206 /* Aha, this is a conversion function. */
3207 cand
= add_conv_candidate (candidates
, fn
, obj
, arglist
,
3208 access_path
, conversion_path
, complain
);
3210 cand
= add_function_candidate (candidates
, fn
, ctype
,
3211 first_arg
, arglist
, access_path
,
3212 conversion_path
, flags
, complain
);
3213 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
3214 /* This situation can occur if a member template of a template
3215 class is specialized. Then, instantiate_template might return
3216 an instantiation of the specialization, in which case the
3217 DECL_TI_TEMPLATE field will point at the original
3218 specialization. For example:
3220 template <class T> struct S { template <class U> void f(U);
3221 template <> void f(int) {}; };
3225 Here, TMPL will be template <class U> S<double>::f(U).
3226 And, instantiate template will give us the specialization
3227 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3228 for this will point at template <class T> template <> S<T>::f(int),
3229 so that we can find the definition. For the purposes of
3230 overload resolution, however, we want the original TMPL. */
3231 cand
->template_decl
= build_template_info (tmpl
, targs
);
3233 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3234 cand
->explicit_targs
= explicit_targs
;
3238 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3239 access_path
, conversion_path
, 0, reason
, flags
);
3243 static struct z_candidate
*
3244 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3245 tree explicit_targs
, tree first_arg
,
3246 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3247 tree access_path
, tree conversion_path
, int flags
,
3248 unification_kind_t strict
, tsubst_flags_t complain
)
3251 add_template_candidate_real (candidates
, tmpl
, ctype
,
3252 explicit_targs
, first_arg
, arglist
,
3253 return_type
, access_path
, conversion_path
,
3254 flags
, NULL_TREE
, strict
, complain
);
3257 /* Create an overload candidate for the conversion function template TMPL,
3258 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3259 pointer-to-function which will in turn be called with the argument list
3260 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3261 passed on to implicit_conversion. */
3263 static struct z_candidate
*
3264 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3266 const vec
<tree
, va_gc
> *arglist
,
3267 tree return_type
, tree access_path
,
3268 tree conversion_path
, tsubst_flags_t complain
)
3270 /* Making this work broke PR 71117, so until the committee resolves core
3271 issue 2189, let's disable this candidate if there are any viable call
3273 if (any_strictly_viable (*candidates
))
3277 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3278 NULL_TREE
, arglist
, return_type
, access_path
,
3279 conversion_path
, 0, obj
, DEDUCE_CALL
,
3283 /* The CANDS are the set of candidates that were considered for
3284 overload resolution. Return the set of viable candidates, or CANDS
3285 if none are viable. If any of the candidates were viable, set
3286 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3287 considered viable only if it is strictly viable. */
3289 static struct z_candidate
*
3290 splice_viable (struct z_candidate
*cands
,
3294 struct z_candidate
*viable
;
3295 struct z_candidate
**last_viable
;
3296 struct z_candidate
**cand
;
3297 bool found_strictly_viable
= false;
3299 /* Be strict inside templates, since build_over_call won't actually
3300 do the conversions to get pedwarns. */
3301 if (processing_template_decl
)
3305 last_viable
= &viable
;
3306 *any_viable_p
= false;
3311 struct z_candidate
*c
= *cand
;
3313 && (c
->viable
== 1 || TREE_CODE (c
->fn
) == TEMPLATE_DECL
))
3315 /* Be strict in the presence of a viable candidate. Also if
3316 there are template candidates, so that we get deduction errors
3317 for them instead of silently preferring a bad conversion. */
3319 if (viable
&& !found_strictly_viable
)
3321 /* Put any spliced near matches back onto the main list so
3322 that we see them if there is no strict match. */
3323 *any_viable_p
= false;
3324 *last_viable
= cands
;
3327 last_viable
= &viable
;
3331 if (strict_p
? c
->viable
== 1 : c
->viable
)
3336 last_viable
= &c
->next
;
3337 *any_viable_p
= true;
3339 found_strictly_viable
= true;
3345 return viable
? viable
: cands
;
3349 any_strictly_viable (struct z_candidate
*cands
)
3351 for (; cands
; cands
= cands
->next
)
3352 if (cands
->viable
== 1)
3357 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3358 words, it is about to become the "this" pointer for a member
3359 function call. Take the address of the object. */
3362 build_this (tree obj
)
3364 /* In a template, we are only concerned about the type of the
3365 expression, so we can take a shortcut. */
3366 if (processing_template_decl
)
3367 return build_address (obj
);
3369 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3372 /* Returns true iff functions are equivalent. Equivalent functions are
3373 not '==' only if one is a function-local extern function or if
3374 both are extern "C". */
3377 equal_functions (tree fn1
, tree fn2
)
3379 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3381 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3383 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3384 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3385 return decls_match (fn1
, fn2
);
3389 /* Print information about a candidate being rejected due to INFO. */
3392 print_conversion_rejection (location_t loc
, struct conversion_info
*info
)
3394 tree from
= info
->from
;
3396 from
= lvalue_type (from
);
3397 if (info
->n_arg
== -1)
3399 /* Conversion of implicit `this' argument failed. */
3400 if (!TYPE_P (info
->from
))
3401 /* A bad conversion for 'this' must be discarding cv-quals. */
3402 inform (loc
, " passing %qT as %<this%> "
3403 "argument discards qualifiers",
3406 inform (loc
, " no known conversion for implicit "
3407 "%<this%> parameter from %qH to %qI",
3408 from
, info
->to_type
);
3410 else if (!TYPE_P (info
->from
))
3412 if (info
->n_arg
>= 0)
3413 inform (loc
, " conversion of argument %d would be ill-formed:",
3415 perform_implicit_conversion (info
->to_type
, info
->from
,
3416 tf_warning_or_error
);
3418 else if (info
->n_arg
== -2)
3419 /* Conversion of conversion function return value failed. */
3420 inform (loc
, " no known conversion from %qH to %qI",
3421 from
, info
->to_type
);
3423 inform (loc
, " no known conversion for argument %d from %qH to %qI",
3424 info
->n_arg
+ 1, from
, info
->to_type
);
3427 /* Print information about a candidate with WANT parameters and we found
3431 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3433 inform_n (loc
, want
,
3434 " candidate expects %d argument, %d provided",
3435 " candidate expects %d arguments, %d provided",
3439 /* Print information about one overload candidate CANDIDATE. MSGSTR
3440 is the text to print before the candidate itself.
3442 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3443 to have been run through gettext by the caller. This wart makes
3444 life simpler in print_z_candidates and for the translators. */
3447 print_z_candidate (location_t loc
, const char *msgstr
,
3448 struct z_candidate
*candidate
)
3450 const char *msg
= (msgstr
== NULL
3452 : ACONCAT ((msgstr
, " ", NULL
)));
3453 tree fn
= candidate
->fn
;
3454 if (flag_new_inheriting_ctors
)
3455 fn
= strip_inheriting_ctors (fn
);
3456 location_t cloc
= location_of (fn
);
3458 if (identifier_p (fn
))
3461 if (candidate
->num_convs
== 3)
3462 inform (cloc
, "%s%<%D(%T, %T, %T)%> <built-in>", msg
, fn
,
3463 candidate
->convs
[0]->type
,
3464 candidate
->convs
[1]->type
,
3465 candidate
->convs
[2]->type
);
3466 else if (candidate
->num_convs
== 2)
3467 inform (cloc
, "%s%<%D(%T, %T)%> <built-in>", msg
, fn
,
3468 candidate
->convs
[0]->type
,
3469 candidate
->convs
[1]->type
);
3471 inform (cloc
, "%s%<%D(%T)%> <built-in>", msg
, fn
,
3472 candidate
->convs
[0]->type
);
3474 else if (TYPE_P (fn
))
3475 inform (cloc
, "%s%qT <conversion>", msg
, fn
);
3476 else if (candidate
->viable
== -1)
3477 inform (cloc
, "%s%#qD <near match>", msg
, fn
);
3478 else if (DECL_DELETED_FN (fn
))
3479 inform (cloc
, "%s%#qD <deleted>", msg
, fn
);
3481 inform (cloc
, "%s%#qD", msg
, fn
);
3482 if (fn
!= candidate
->fn
)
3484 cloc
= location_of (candidate
->fn
);
3485 inform (cloc
, " inherited here");
3487 /* Give the user some information about why this candidate failed. */
3488 if (candidate
->reason
!= NULL
)
3490 struct rejection_reason
*r
= candidate
->reason
;
3495 print_arity_information (cloc
, r
->u
.arity
.actual
,
3496 r
->u
.arity
.expected
);
3498 case rr_arg_conversion
:
3499 print_conversion_rejection (cloc
, &r
->u
.conversion
);
3501 case rr_bad_arg_conversion
:
3502 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
);
3504 case rr_explicit_conversion
:
3505 inform (cloc
, " return type %qT of explicit conversion function "
3506 "cannot be converted to %qT with a qualification "
3507 "conversion", r
->u
.conversion
.from
,
3508 r
->u
.conversion
.to_type
);
3510 case rr_template_conversion
:
3511 inform (cloc
, " conversion from return type %qT of template "
3512 "conversion function specialization to %qT is not an "
3513 "exact match", r
->u
.conversion
.from
,
3514 r
->u
.conversion
.to_type
);
3516 case rr_template_unification
:
3517 /* We use template_unification_error_rejection if unification caused
3518 actual non-SFINAE errors, in which case we don't need to repeat
3520 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3522 inform (cloc
, " substitution of deduced template arguments "
3523 "resulted in errors seen above");
3526 /* Re-run template unification with diagnostics. */
3527 inform (cloc
, " template argument deduction/substitution failed:");
3528 fn_type_unification (r
->u
.template_unification
.tmpl
,
3529 r
->u
.template_unification
.explicit_targs
,
3531 (r
->u
.template_unification
.num_targs
)),
3532 r
->u
.template_unification
.args
,
3533 r
->u
.template_unification
.nargs
,
3534 r
->u
.template_unification
.return_type
,
3535 r
->u
.template_unification
.strict
,
3536 r
->u
.template_unification
.flags
,
3539 case rr_invalid_copy
:
3541 " a constructor taking a single argument of its own "
3542 "class type is invalid");
3544 case rr_constraint_failure
:
3546 tree tmpl
= r
->u
.template_instantiation
.tmpl
;
3547 tree args
= r
->u
.template_instantiation
.targs
;
3548 diagnose_constraints (cloc
, tmpl
, args
);
3551 case rr_inherited_ctor
:
3552 inform (cloc
, " an inherited constructor is not a candidate for "
3553 "initialization from an expression of the same or derived "
3558 /* This candidate didn't have any issues or we failed to
3559 handle a particular code. Either way... */
3566 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3568 struct z_candidate
*cand1
;
3569 struct z_candidate
**cand2
;
3574 /* Remove non-viable deleted candidates. */
3576 for (cand2
= &cand1
; *cand2
; )
3578 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3579 && !(*cand2
)->viable
3580 && DECL_DELETED_FN ((*cand2
)->fn
))
3581 *cand2
= (*cand2
)->next
;
3583 cand2
= &(*cand2
)->next
;
3585 /* ...if there are any non-deleted ones. */
3589 /* There may be duplicates in the set of candidates. We put off
3590 checking this condition as long as possible, since we have no way
3591 to eliminate duplicates from a set of functions in less than n^2
3592 time. Now we are about to emit an error message, so it is more
3593 permissible to go slowly. */
3594 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3596 tree fn
= cand1
->fn
;
3597 /* Skip builtin candidates and conversion functions. */
3600 cand2
= &cand1
->next
;
3603 if (DECL_P ((*cand2
)->fn
)
3604 && equal_functions (fn
, (*cand2
)->fn
))
3605 *cand2
= (*cand2
)->next
;
3607 cand2
= &(*cand2
)->next
;
3611 for (; candidates
; candidates
= candidates
->next
)
3612 print_z_candidate (loc
, "candidate:", candidates
);
3615 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3616 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3617 the result of the conversion function to convert it to the final
3618 desired type. Merge the two sequences into a single sequence,
3619 and return the merged sequence. */
3622 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3625 bool bad
= user_seq
->bad_p
;
3627 gcc_assert (user_seq
->kind
== ck_user
);
3629 /* Find the end of the second conversion sequence. */
3630 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3632 /* The entire sequence is a user-conversion sequence. */
3633 (*t
)->user_conv_p
= true;
3638 /* Replace the identity conversion with the user conversion
3645 /* Handle overload resolution for initializing an object of class type from
3646 an initializer list. First we look for a suitable constructor that
3647 takes a std::initializer_list; if we don't find one, we then look for a
3648 non-list constructor.
3650 Parameters are as for add_candidates, except that the arguments are in
3651 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3652 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3655 add_list_candidates (tree fns
, tree first_arg
,
3656 const vec
<tree
, va_gc
> *args
, tree totype
,
3657 tree explicit_targs
, bool template_only
,
3658 tree conversion_path
, tree access_path
,
3660 struct z_candidate
**candidates
,
3661 tsubst_flags_t complain
)
3663 gcc_assert (*candidates
== NULL
);
3665 /* We're looking for a ctor for list-initialization. */
3666 flags
|= LOOKUP_LIST_INIT_CTOR
;
3667 /* And we don't allow narrowing conversions. We also use this flag to
3668 avoid the copy constructor call for copy-list-initialization. */
3669 flags
|= LOOKUP_NO_NARROWING
;
3671 unsigned nart
= num_artificial_parms_for (OVL_FIRST (fns
)) - 1;
3672 tree init_list
= (*args
)[nart
];
3674 /* Always use the default constructor if the list is empty (DR 990). */
3675 if (CONSTRUCTOR_NELTS (init_list
) == 0
3676 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3678 /* If the class has a list ctor, try passing the list as a single
3679 argument first, but only consider list ctors. */
3680 else if (TYPE_HAS_LIST_CTOR (totype
))
3682 flags
|= LOOKUP_LIST_ONLY
;
3683 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3684 explicit_targs
, template_only
, conversion_path
,
3685 access_path
, flags
, candidates
, complain
);
3686 if (any_strictly_viable (*candidates
))
3690 /* Expand the CONSTRUCTOR into a new argument vec. */
3691 vec
<tree
, va_gc
> *new_args
;
3692 vec_alloc (new_args
, nart
+ CONSTRUCTOR_NELTS (init_list
));
3693 for (unsigned i
= 0; i
< nart
; ++i
)
3694 new_args
->quick_push ((*args
)[i
]);
3695 for (unsigned i
= 0; i
< CONSTRUCTOR_NELTS (init_list
); ++i
)
3696 new_args
->quick_push (CONSTRUCTOR_ELT (init_list
, i
)->value
);
3698 /* We aren't looking for list-ctors anymore. */
3699 flags
&= ~LOOKUP_LIST_ONLY
;
3700 /* We allow more user-defined conversions within an init-list. */
3701 flags
&= ~LOOKUP_NO_CONVERSION
;
3703 add_candidates (fns
, first_arg
, new_args
, NULL_TREE
,
3704 explicit_targs
, template_only
, conversion_path
,
3705 access_path
, flags
, candidates
, complain
);
3708 /* Returns the best overload candidate to perform the requested
3709 conversion. This function is used for three the overloading situations
3710 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3711 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3712 per [dcl.init.ref], so we ignore temporary bindings. */
3714 static struct z_candidate
*
3715 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3716 tsubst_flags_t complain
)
3718 struct z_candidate
*candidates
, *cand
;
3720 tree ctors
= NULL_TREE
;
3721 tree conv_fns
= NULL_TREE
;
3722 conversion
*conv
= NULL
;
3723 tree first_arg
= NULL_TREE
;
3724 vec
<tree
, va_gc
> *args
= NULL
;
3731 fromtype
= TREE_TYPE (expr
);
3733 /* We represent conversion within a hierarchy using RVALUE_CONV and
3734 BASE_CONV, as specified by [over.best.ics]; these become plain
3735 constructor calls, as specified in [dcl.init]. */
3736 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3737 || !DERIVED_FROM_P (totype
, fromtype
));
3739 if (MAYBE_CLASS_TYPE_P (totype
))
3740 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3741 creating a garbage BASELINK; constructors can't be inherited. */
3742 ctors
= lookup_fnfields_slot (totype
, complete_ctor_identifier
);
3744 /* FIXME P0135 doesn't say what to do in C++17 about list-initialization from
3745 a single element. For now, let's handle constructors as before and also
3746 consider conversion operators from the element. */
3747 if (cxx_dialect
>= cxx1z
3748 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
3749 && CONSTRUCTOR_NELTS (expr
) == 1)
3750 fromtype
= TREE_TYPE (CONSTRUCTOR_ELT (expr
, 0)->value
);
3752 if (MAYBE_CLASS_TYPE_P (fromtype
))
3754 tree to_nonref
= non_reference (totype
);
3755 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3756 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3757 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3759 /* [class.conv.fct] A conversion function is never used to
3760 convert a (possibly cv-qualified) object to the (possibly
3761 cv-qualified) same object type (or a reference to it), to a
3762 (possibly cv-qualified) base class of that type (or a
3763 reference to it)... */
3766 conv_fns
= lookup_conversions (fromtype
);
3770 flags
|= LOOKUP_NO_CONVERSION
;
3771 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3772 flags
|= LOOKUP_NO_NARROWING
;
3774 /* It's OK to bind a temporary for converting constructor arguments, but
3775 not in converting the return value of a conversion operator. */
3776 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
3777 | (flags
& LOOKUP_NO_NARROWING
));
3778 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3782 int ctorflags
= flags
;
3784 first_arg
= build_dummy_object (totype
);
3786 /* We should never try to call the abstract or base constructor
3788 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors
))
3789 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors
)));
3791 args
= make_tree_vector_single (expr
);
3792 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3794 /* List-initialization. */
3795 add_list_candidates (ctors
, first_arg
, args
, totype
, NULL_TREE
,
3796 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3797 ctorflags
, &candidates
, complain
);
3801 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3802 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3803 ctorflags
, &candidates
, complain
);
3806 for (cand
= candidates
; cand
; cand
= cand
->next
)
3808 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3810 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3811 set, then this is copy-initialization. In that case, "The
3812 result of the call is then used to direct-initialize the
3813 object that is the destination of the copy-initialization."
3816 We represent this in the conversion sequence with an
3817 rvalue conversion, which means a constructor call. */
3818 if (TREE_CODE (totype
) != REFERENCE_TYPE
3819 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3821 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3827 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3828 /* FIXME see above about C++17. */
3829 first_arg
= CONSTRUCTOR_ELT (expr
, 0)->value
;
3834 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3836 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3837 struct z_candidate
*old_candidates
;
3839 /* If we are called to convert to a reference type, we are trying to
3840 find a direct binding, so don't even consider temporaries. If
3841 we don't find a direct binding, the caller will try again to
3842 look for a temporary binding. */
3843 if (TREE_CODE (totype
) == REFERENCE_TYPE
)
3844 convflags
|= LOOKUP_NO_TEMP_BIND
;
3846 old_candidates
= candidates
;
3847 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
3849 conversion_path
, TYPE_BINFO (fromtype
),
3850 flags
, &candidates
, complain
);
3852 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
3854 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
3856 = implicit_conversion (totype
,
3859 /*c_cast_p=*/false, convflags
,
3862 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3863 copy-initialization. In that case, "The result of the
3864 call is then used to direct-initialize the object that is
3865 the destination of the copy-initialization." [dcl.init]
3867 We represent this in the conversion sequence with an
3868 rvalue conversion, which means a constructor call. But
3869 don't add a second rvalue conversion if there's already
3870 one there. Which there really shouldn't be, but it's
3871 harmless since we'd add it here anyway. */
3872 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
3873 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3874 ics
= build_conv (ck_rvalue
, totype
, ics
);
3876 cand
->second_conv
= ics
;
3881 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -2,
3884 else if (DECL_NONCONVERTING_P (cand
->fn
)
3885 && ics
->rank
> cr_exact
)
3887 /* 13.3.1.5: For direct-initialization, those explicit
3888 conversion functions that are not hidden within S and
3889 yield type T or a type that can be converted to type T
3890 with a qualification conversion (4.4) are also candidate
3892 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3893 I've raised this issue with the committee. --jason 9/2011 */
3895 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
3897 else if (cand
->viable
== 1 && ics
->bad_p
)
3901 = bad_arg_conversion_rejection (NULL_TREE
, -2,
3904 else if (primary_template_instantiation_p (cand
->fn
)
3905 && ics
->rank
> cr_exact
)
3907 /* 13.3.3.1.2: If the user-defined conversion is specified by
3908 a specialization of a conversion function template, the
3909 second standard conversion sequence shall have exact match
3912 cand
->reason
= template_conversion_rejection (rettype
, totype
);
3917 candidates
= splice_viable (candidates
, false, &any_viable_p
);
3921 release_tree_vector (args
);
3925 cand
= tourney (candidates
, complain
);
3928 if (complain
& tf_error
)
3930 error ("conversion from %qH to %qI is ambiguous",
3932 print_z_candidates (location_of (expr
), candidates
);
3935 cand
= candidates
; /* any one will do */
3936 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
3937 cand
->second_conv
->user_conv_p
= true;
3938 if (!any_strictly_viable (candidates
))
3939 cand
->second_conv
->bad_p
= true;
3940 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3941 ambiguous conversion is no worse than another user-defined
3948 if (!DECL_CONSTRUCTOR_P (cand
->fn
))
3949 convtype
= non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)));
3950 else if (cand
->second_conv
->kind
== ck_rvalue
)
3951 /* DR 5: [in the first step of copy-initialization]...if the function
3952 is a constructor, the call initializes a temporary of the
3953 cv-unqualified version of the destination type. */
3954 convtype
= cv_unqualified (totype
);
3957 /* Build the user conversion sequence. */
3961 build_identity_conv (TREE_TYPE (expr
), expr
));
3963 if (cand
->viable
== -1)
3966 /* Remember that this was a list-initialization. */
3967 if (flags
& LOOKUP_NO_NARROWING
)
3968 conv
->check_narrowing
= true;
3970 /* Combine it with the second conversion sequence. */
3971 cand
->second_conv
= merge_conversion_sequences (conv
,
3977 /* Wrapper for above. */
3980 build_user_type_conversion (tree totype
, tree expr
, int flags
,
3981 tsubst_flags_t complain
)
3983 struct z_candidate
*cand
;
3986 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
3987 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
3991 if (cand
->second_conv
->kind
== ck_ambig
)
3992 ret
= error_mark_node
;
3995 expr
= convert_like (cand
->second_conv
, expr
, complain
);
3996 ret
= convert_from_reference (expr
);
4002 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4006 /* Subroutine of convert_nontype_argument.
4008 EXPR is an argument for a template non-type parameter of integral or
4009 enumeration type. Do any necessary conversions (that are permitted for
4010 non-type arguments) to convert it to the parameter type.
4012 If conversion is successful, returns the converted expression;
4013 otherwise, returns error_mark_node. */
4016 build_integral_nontype_arg_conv (tree type
, tree expr
, tsubst_flags_t complain
)
4021 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
4023 if (error_operand_p (expr
))
4024 return error_mark_node
;
4026 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
4028 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4029 p
= conversion_obstack_alloc (0);
4031 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
4033 LOOKUP_IMPLICIT
, complain
);
4035 /* for a non-type template-parameter of integral or
4036 enumeration type, integral promotions (4.5) and integral
4037 conversions (4.7) are applied. */
4038 /* It should be sufficient to check the outermost conversion step, since
4039 there are no qualification conversions to integer type. */
4043 /* A conversion function is OK. If it isn't constexpr, we'll
4044 complain later that the argument isn't constant. */
4046 /* The lvalue-to-rvalue conversion is OK. */
4052 t
= next_conversion (conv
)->type
;
4053 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
))
4056 if (complain
& tf_error
)
4057 error_at (loc
, "conversion from %qH to %qI not considered for "
4058 "non-type template argument", t
, type
);
4067 expr
= convert_like (conv
, expr
, complain
);
4069 expr
= error_mark_node
;
4071 /* Free all the conversions we allocated. */
4072 obstack_free (&conversion_obstack
, p
);
4077 /* Do any initial processing on the arguments to a function call. */
4079 static vec
<tree
, va_gc
> *
4080 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
4085 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
4087 if (error_operand_p (arg
))
4089 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
4091 if (complain
& tf_error
)
4092 error ("invalid use of void expression");
4095 else if (invalid_nonstatic_memfn_p (input_location
, arg
, complain
))
4101 /* Perform overload resolution on FN, which is called with the ARGS.
4103 Return the candidate function selected by overload resolution, or
4104 NULL if the event that overload resolution failed. In the case
4105 that overload resolution fails, *CANDIDATES will be the set of
4106 candidates considered, and ANY_VIABLE_P will be set to true or
4107 false to indicate whether or not any of the candidates were
4110 The ARGS should already have gone through RESOLVE_ARGS before this
4111 function is called. */
4113 static struct z_candidate
*
4114 perform_overload_resolution (tree fn
,
4115 const vec
<tree
, va_gc
> *args
,
4116 struct z_candidate
**candidates
,
4117 bool *any_viable_p
, tsubst_flags_t complain
)
4119 struct z_candidate
*cand
;
4120 tree explicit_targs
;
4123 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4125 explicit_targs
= NULL_TREE
;
4129 *any_viable_p
= true;
4132 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4133 || TREE_CODE (fn
) == TEMPLATE_DECL
4134 || TREE_CODE (fn
) == OVERLOAD
4135 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
4137 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4139 explicit_targs
= TREE_OPERAND (fn
, 1);
4140 fn
= TREE_OPERAND (fn
, 0);
4144 /* Add the various candidate functions. */
4145 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
4146 explicit_targs
, template_only
,
4147 /*conversion_path=*/NULL_TREE
,
4148 /*access_path=*/NULL_TREE
,
4150 candidates
, complain
);
4152 *candidates
= splice_viable (*candidates
, false, any_viable_p
);
4154 cand
= tourney (*candidates
, complain
);
4158 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4162 /* Print an error message about being unable to build a call to FN with
4163 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4164 be located; CANDIDATES is a possibly empty list of such
4168 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
,
4169 struct z_candidate
*candidates
)
4171 tree targs
= NULL_TREE
;
4172 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4174 targs
= TREE_OPERAND (fn
, 1);
4175 fn
= TREE_OPERAND (fn
, 0);
4177 tree name
= OVL_NAME (fn
);
4178 location_t loc
= location_of (name
);
4180 name
= lookup_template_function (name
, targs
);
4182 if (!any_strictly_viable (candidates
))
4183 error_at (loc
, "no matching function for call to %<%D(%A)%>",
4184 name
, build_tree_list_vec (args
));
4186 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
4187 name
, build_tree_list_vec (args
));
4189 print_z_candidates (loc
, candidates
);
4192 /* Return an expression for a call to FN (a namespace-scope function,
4193 or a static member function) with the ARGS. This may change
4197 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
,
4198 tsubst_flags_t complain
)
4200 struct z_candidate
*candidates
, *cand
;
4205 if (args
!= NULL
&& *args
!= NULL
)
4207 *args
= resolve_args (*args
, complain
);
4209 return error_mark_node
;
4213 tm_malloc_replacement (fn
);
4215 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4216 p
= conversion_obstack_alloc (0);
4218 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
4223 if (complain
& tf_error
)
4225 // If there is a single (non-viable) function candidate,
4226 // let the error be diagnosed by cp_build_function_call_vec.
4227 if (!any_viable_p
&& candidates
&& ! candidates
->next
4228 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
4229 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
4231 // Otherwise, emit notes for non-viable candidates.
4232 print_error_for_call_failure (fn
, *args
, candidates
);
4234 result
= error_mark_node
;
4238 int flags
= LOOKUP_NORMAL
;
4239 /* If fn is template_id_expr, the call has explicit template arguments
4240 (e.g. func<int>(5)), communicate this info to build_over_call
4241 through flags so that later we can use it to decide whether to warn
4242 about peculiar null pointer conversion. */
4243 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4245 /* If overload resolution selects a specialization of a
4246 function concept for non-dependent template arguments,
4247 the expression is true if the constraints are satisfied
4248 and false otherwise.
4250 NOTE: This is an extension of Concepts Lite TS that
4251 allows constraints to be used in expressions. */
4252 if (flag_concepts
&& !processing_template_decl
)
4254 tree tmpl
= DECL_TI_TEMPLATE (cand
->fn
);
4255 tree targs
= DECL_TI_ARGS (cand
->fn
);
4256 tree decl
= DECL_TEMPLATE_RESULT (tmpl
);
4257 if (DECL_DECLARED_CONCEPT_P (decl
))
4258 return evaluate_function_concept (decl
, targs
);
4261 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4264 result
= build_over_call (cand
, flags
, complain
);
4267 /* Free all the conversions we allocated. */
4268 obstack_free (&conversion_obstack
, p
);
4273 /* Build a call to a global operator new. FNNAME is the name of the
4274 operator (either "operator new" or "operator new[]") and ARGS are
4275 the arguments provided. This may change ARGS. *SIZE points to the
4276 total number of bytes required by the allocation, and is updated if
4277 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4278 be used. If this function determines that no cookie should be
4279 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4280 is not NULL_TREE, it is evaluated before calculating the final
4281 array size, and if it fails, the array size is replaced with
4282 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4283 is non-NULL, it will be set, upon return, to the allocation
4287 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4288 tree
*size
, tree
*cookie_size
,
4289 tree align_arg
, tree size_check
,
4290 tree
*fn
, tsubst_flags_t complain
)
4292 tree original_size
= *size
;
4294 struct z_candidate
*candidates
;
4295 struct z_candidate
*cand
= NULL
;
4300 /* Set to (size_t)-1 if the size check fails. */
4301 if (size_check
!= NULL_TREE
)
4303 tree errval
= TYPE_MAX_VALUE (sizetype
);
4304 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4305 errval
= throw_bad_array_new_length ();
4306 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4307 original_size
, errval
);
4309 vec_safe_insert (*args
, 0, *size
);
4310 *args
= resolve_args (*args
, complain
);
4312 return error_mark_node
;
4318 If this lookup fails to find the name, or if the allocated type
4319 is not a class type, the allocation function's name is looked
4320 up in the global scope.
4322 we disregard block-scope declarations of "operator new". */
4323 fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/false, 0, 0);
4324 fns
= lookup_arg_dependent (fnname
, fns
, *args
);
4328 vec
<tree
, va_gc
>* align_args
4329 = vec_copy_and_insert (*args
, align_arg
, 1);
4330 cand
= perform_overload_resolution (fns
, align_args
, &candidates
,
4331 &any_viable_p
, tf_none
);
4332 /* If no aligned allocation function matches, try again without the
4336 /* Figure out what function is being called. */
4338 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
4341 /* If no suitable function could be found, issue an error message
4345 if (complain
& tf_error
)
4346 print_error_for_call_failure (fns
, *args
, candidates
);
4347 return error_mark_node
;
4350 /* If a cookie is required, add some extra space. Whether
4351 or not a cookie is required cannot be determined until
4352 after we know which function was called. */
4355 bool use_cookie
= true;
4358 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4359 /* Skip the size_t parameter. */
4360 arg_types
= TREE_CHAIN (arg_types
);
4361 /* Check the remaining parameters (if any). */
4363 && TREE_CHAIN (arg_types
) == void_list_node
4364 && same_type_p (TREE_VALUE (arg_types
),
4367 /* If we need a cookie, adjust the number of bytes allocated. */
4370 /* Update the total size. */
4371 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4374 /* Set to (size_t)-1 if the size check fails. */
4375 gcc_assert (size_check
!= NULL_TREE
);
4376 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4377 *size
, TYPE_MAX_VALUE (sizetype
));
4379 /* Update the argument list to reflect the adjusted size. */
4380 (**args
)[0] = *size
;
4383 *cookie_size
= NULL_TREE
;
4386 /* Tell our caller which function we decided to call. */
4390 /* Build the CALL_EXPR. */
4391 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4394 /* Build a new call to operator(). This may change ARGS. */
4397 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4399 struct z_candidate
*candidates
= 0, *cand
;
4400 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4401 tree type
= TREE_TYPE (obj
);
4403 tree result
= NULL_TREE
;
4406 if (error_operand_p (obj
))
4407 return error_mark_node
;
4409 obj
= prep_operand (obj
);
4411 if (TYPE_PTRMEMFUNC_P (type
))
4413 if (complain
& tf_error
)
4414 /* It's no good looking for an overloaded operator() on a
4415 pointer-to-member-function. */
4416 error ("pointer-to-member function %qE cannot be called without "
4417 "an object; consider using %<.*%> or %<->*%>", obj
);
4418 return error_mark_node
;
4421 if (TYPE_BINFO (type
))
4423 fns
= lookup_fnfields (TYPE_BINFO (type
), cp_operator_id (CALL_EXPR
), 1);
4424 if (fns
== error_mark_node
)
4425 return error_mark_node
;
4430 if (args
!= NULL
&& *args
!= NULL
)
4432 *args
= resolve_args (*args
, complain
);
4434 return error_mark_node
;
4437 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4438 p
= conversion_obstack_alloc (0);
4442 first_mem_arg
= obj
;
4444 add_candidates (BASELINK_FUNCTIONS (fns
),
4445 first_mem_arg
, *args
, NULL_TREE
,
4447 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4448 LOOKUP_NORMAL
, &candidates
, complain
);
4451 convs
= lookup_conversions (type
);
4453 for (; convs
; convs
= TREE_CHAIN (convs
))
4455 tree totype
= TREE_TYPE (convs
);
4457 if (TYPE_PTRFN_P (totype
)
4458 || TYPE_REFFN_P (totype
)
4459 || (TREE_CODE (totype
) == REFERENCE_TYPE
4460 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4461 for (ovl_iterator
iter (TREE_VALUE (convs
)); iter
; ++iter
)
4465 if (DECL_NONCONVERTING_P (fn
))
4468 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4469 add_template_conv_candidate
4470 (&candidates
, fn
, obj
, *args
, totype
,
4471 /*access_path=*/NULL_TREE
,
4472 /*conversion_path=*/NULL_TREE
, complain
);
4474 add_conv_candidate (&candidates
, fn
, obj
,
4475 *args
, /*conversion_path=*/NULL_TREE
,
4476 /*access_path=*/NULL_TREE
, complain
);
4480 /* Be strict here because if we choose a bad conversion candidate, the
4481 errors we get won't mention the call context. */
4482 candidates
= splice_viable (candidates
, true, &any_viable_p
);
4485 if (complain
& tf_error
)
4487 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4488 build_tree_list_vec (*args
));
4489 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4491 result
= error_mark_node
;
4495 cand
= tourney (candidates
, complain
);
4498 if (complain
& tf_error
)
4500 error ("call of %<(%T) (%A)%> is ambiguous",
4501 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4502 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4504 result
= error_mark_node
;
4506 /* Since cand->fn will be a type, not a function, for a conversion
4507 function, we must be careful not to unconditionally look at
4509 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4510 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
) == CALL_EXPR
)
4511 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4514 if (DECL_P (cand
->fn
))
4515 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
,
4518 obj
= convert_like (cand
->convs
[0], obj
, complain
);
4519 obj
= convert_from_reference (obj
);
4520 result
= cp_build_function_call_vec (obj
, args
, complain
);
4524 /* Free all the conversions we allocated. */
4525 obstack_free (&conversion_obstack
, p
);
4530 /* Wrapper for above. */
4533 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4536 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4537 ret
= build_op_call_1 (obj
, args
, complain
);
4538 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4542 /* Called by op_error to prepare format strings suitable for the error
4543 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4544 and a suffix (controlled by NTYPES). */
4547 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4551 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4552 : G_("no match for "), errmsg
, NULL
);
4555 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4556 else if (ntypes
== 2)
4557 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4559 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4565 op_error (location_t loc
, enum tree_code code
, enum tree_code code2
,
4566 tree arg1
, tree arg2
, tree arg3
, bool match
)
4570 if (code
== MODIFY_EXPR
)
4571 opname
= assignment_operator_name_info
[code2
].name
;
4573 opname
= operator_name_info
[code
].name
;
4578 if (flag_diagnostics_show_caret
)
4579 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4581 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4583 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4584 "in %<%E ? %E : %E%>"), 3, match
),
4586 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4589 case POSTINCREMENT_EXPR
:
4590 case POSTDECREMENT_EXPR
:
4591 if (flag_diagnostics_show_caret
)
4592 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4593 opname
, TREE_TYPE (arg1
));
4595 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4597 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4601 if (flag_diagnostics_show_caret
)
4602 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4603 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4605 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4607 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4612 if (flag_diagnostics_show_caret
)
4613 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4614 opname
, TREE_TYPE (arg1
));
4616 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4617 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4622 if (flag_diagnostics_show_caret
)
4623 error_at (loc
, op_error_string (G_("%<operator%s%>"), 2, match
),
4624 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4626 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4628 opname
, arg1
, opname
, arg2
,
4629 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4631 if (flag_diagnostics_show_caret
)
4632 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4633 opname
, TREE_TYPE (arg1
));
4635 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4637 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4642 /* Return the implicit conversion sequence that could be used to
4643 convert E1 to E2 in [expr.cond]. */
4646 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4648 tree t1
= non_reference (TREE_TYPE (e1
));
4649 tree t2
= non_reference (TREE_TYPE (e2
));
4655 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4656 implicitly converted (clause _conv_) to the type "lvalue reference to
4657 T2", subject to the constraint that in the conversion the
4658 reference must bind directly (_dcl.init.ref_) to an lvalue.
4660 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4661 implicitly converted to the type "rvalue reference to T2", subject to
4662 the constraint that the reference must bind directly. */
4665 tree rtype
= cp_build_reference_type (t2
, !lvalue_p (e2
));
4666 conv
= implicit_conversion (rtype
,
4670 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4671 |LOOKUP_ONLYCONVERTING
,
4673 if (conv
&& !conv
->bad_p
)
4677 /* If E2 is a prvalue or if neither of the conversions above can be done
4678 and at least one of the operands has (possibly cv-qualified) class
4680 if (!CLASS_TYPE_P (t1
) && !CLASS_TYPE_P (t2
))
4685 If E1 and E2 have class type, and the underlying class types are
4686 the same or one is a base class of the other: E1 can be converted
4687 to match E2 if the class of T2 is the same type as, or a base
4688 class of, the class of T1, and the cv-qualification of T2 is the
4689 same cv-qualification as, or a greater cv-qualification than, the
4690 cv-qualification of T1. If the conversion is applied, E1 is
4691 changed to an rvalue of type T2 that still refers to the original
4692 source class object (or the appropriate subobject thereof). */
4693 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4694 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4696 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4698 conv
= build_identity_conv (t1
, e1
);
4699 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4700 TYPE_MAIN_VARIANT (t2
)))
4701 conv
= build_conv (ck_base
, t2
, conv
);
4703 conv
= build_conv (ck_rvalue
, t2
, conv
);
4712 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4713 converted to the type that expression E2 would have if E2 were
4714 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4715 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4716 LOOKUP_IMPLICIT
, complain
);
4719 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4720 arguments to the conditional expression. */
4723 build_conditional_expr_1 (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
4724 tsubst_flags_t complain
)
4728 tree result
= NULL_TREE
;
4729 tree result_type
= NULL_TREE
;
4730 bool is_lvalue
= true;
4731 struct z_candidate
*candidates
= 0;
4732 struct z_candidate
*cand
;
4734 tree orig_arg2
, orig_arg3
;
4736 /* As a G++ extension, the second argument to the conditional can be
4737 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4738 c'.) If the second operand is omitted, make sure it is
4739 calculated only once. */
4742 if (complain
& tf_error
)
4743 pedwarn (loc
, OPT_Wpedantic
,
4744 "ISO C++ forbids omitting the middle term of a ?: expression");
4746 if ((complain
& tf_warning
) && !truth_value_p (TREE_CODE (arg1
)))
4747 warn_for_omitted_condop (loc
, arg1
);
4749 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4750 if (lvalue_p (arg1
))
4751 arg2
= arg1
= cp_stabilize_reference (arg1
);
4753 arg2
= arg1
= save_expr (arg1
);
4756 /* If something has already gone wrong, just pass that fact up the
4758 if (error_operand_p (arg1
)
4759 || error_operand_p (arg2
)
4760 || error_operand_p (arg3
))
4761 return error_mark_node
;
4766 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
4768 tree arg1_type
= TREE_TYPE (arg1
);
4770 /* If arg1 is another cond_expr choosing between -1 and 0,
4771 then we can use its comparison. It may help to avoid
4772 additional comparison, produce more accurate diagnostics
4773 and enables folding. */
4774 if (TREE_CODE (arg1
) == VEC_COND_EXPR
4775 && integer_minus_onep (TREE_OPERAND (arg1
, 1))
4776 && integer_zerop (TREE_OPERAND (arg1
, 2)))
4777 arg1
= TREE_OPERAND (arg1
, 0);
4779 arg1
= force_rvalue (arg1
, complain
);
4780 arg2
= force_rvalue (arg2
, complain
);
4781 arg3
= force_rvalue (arg3
, complain
);
4783 /* force_rvalue can return error_mark on valid arguments. */
4784 if (error_operand_p (arg1
)
4785 || error_operand_p (arg2
)
4786 || error_operand_p (arg3
))
4787 return error_mark_node
;
4789 arg2_type
= TREE_TYPE (arg2
);
4790 arg3_type
= TREE_TYPE (arg3
);
4792 if (!VECTOR_TYPE_P (arg2_type
)
4793 && !VECTOR_TYPE_P (arg3_type
))
4795 /* Rely on the error messages of the scalar version. */
4796 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
4797 orig_arg2
, orig_arg3
, complain
);
4798 if (scal
== error_mark_node
)
4799 return error_mark_node
;
4800 tree stype
= TREE_TYPE (scal
);
4801 tree ctype
= TREE_TYPE (arg1_type
);
4802 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
4803 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
4805 if (complain
& tf_error
)
4806 error_at (loc
, "inferred scalar type %qT is not an integer or "
4807 "floating point type of the same size as %qT", stype
,
4808 COMPARISON_CLASS_P (arg1
)
4809 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
4811 return error_mark_node
;
4814 tree vtype
= build_opaque_vector_type (stype
,
4815 TYPE_VECTOR_SUBPARTS (arg1_type
));
4816 /* We could pass complain & tf_warning to unsafe_conversion_p,
4817 but the warnings (like Wsign-conversion) have already been
4818 given by the scalar build_conditional_expr_1. We still check
4819 unsafe_conversion_p to forbid truncating long long -> float. */
4820 if (unsafe_conversion_p (loc
, stype
, arg2
, NULL_TREE
, false))
4822 if (complain
& tf_error
)
4823 error_at (loc
, "conversion of scalar %qH to vector %qI "
4824 "involves truncation", arg2_type
, vtype
);
4825 return error_mark_node
;
4827 if (unsafe_conversion_p (loc
, stype
, arg3
, NULL_TREE
, false))
4829 if (complain
& tf_error
)
4830 error_at (loc
, "conversion of scalar %qH to vector %qI "
4831 "involves truncation", arg3_type
, vtype
);
4832 return error_mark_node
;
4835 arg2
= cp_convert (stype
, arg2
, complain
);
4836 arg2
= save_expr (arg2
);
4837 arg2
= build_vector_from_val (vtype
, arg2
);
4839 arg3
= cp_convert (stype
, arg3
, complain
);
4840 arg3
= save_expr (arg3
);
4841 arg3
= build_vector_from_val (vtype
, arg3
);
4845 if (VECTOR_TYPE_P (arg2_type
) != VECTOR_TYPE_P (arg3_type
))
4847 enum stv_conv convert_flag
=
4848 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
4849 complain
& tf_error
);
4851 switch (convert_flag
)
4854 return error_mark_node
;
4857 arg2
= save_expr (arg2
);
4858 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
4859 arg2
= build_vector_from_val (arg3_type
, arg2
);
4860 arg2_type
= TREE_TYPE (arg2
);
4865 arg3
= save_expr (arg3
);
4866 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
4867 arg3
= build_vector_from_val (arg2_type
, arg3
);
4868 arg3_type
= TREE_TYPE (arg3
);
4876 if (!same_type_p (arg2_type
, arg3_type
)
4877 || TYPE_VECTOR_SUBPARTS (arg1_type
)
4878 != TYPE_VECTOR_SUBPARTS (arg2_type
)
4879 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
4881 if (complain
& tf_error
)
4883 "incompatible vector types in conditional expression: "
4884 "%qT, %qT and %qT", TREE_TYPE (arg1
),
4885 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
4886 return error_mark_node
;
4889 if (!COMPARISON_CLASS_P (arg1
))
4891 tree cmp_type
= build_same_sized_truth_vector_type (arg1_type
);
4892 arg1
= build2 (NE_EXPR
, cmp_type
, arg1
, build_zero_cst (arg1_type
));
4894 return build3_loc (loc
, VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
4899 The first expression is implicitly converted to bool (clause
4901 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
4903 if (error_operand_p (arg1
))
4904 return error_mark_node
;
4908 If either the second or the third operand has type (possibly
4909 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4910 array-to-pointer (_conv.array_), and function-to-pointer
4911 (_conv.func_) standard conversions are performed on the second
4912 and third operands. */
4913 arg2_type
= unlowered_expr_type (arg2
);
4914 arg3_type
= unlowered_expr_type (arg3
);
4915 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
4917 /* Do the conversions. We don't these for `void' type arguments
4918 since it can't have any effect and since decay_conversion
4919 does not handle that case gracefully. */
4920 if (!VOID_TYPE_P (arg2_type
))
4921 arg2
= decay_conversion (arg2
, complain
);
4922 if (!VOID_TYPE_P (arg3_type
))
4923 arg3
= decay_conversion (arg3
, complain
);
4924 arg2_type
= TREE_TYPE (arg2
);
4925 arg3_type
= TREE_TYPE (arg3
);
4929 One of the following shall hold:
4931 --The second or the third operand (but not both) is a
4932 throw-expression (_except.throw_); the result is of the
4933 type of the other and is an rvalue.
4935 --Both the second and the third operands have type void; the
4936 result is of type void and is an rvalue.
4938 We must avoid calling force_rvalue for expressions of type
4939 "void" because it will complain that their value is being
4941 if (TREE_CODE (arg2
) == THROW_EXPR
4942 && TREE_CODE (arg3
) != THROW_EXPR
)
4944 if (!VOID_TYPE_P (arg3_type
))
4946 arg3
= force_rvalue (arg3
, complain
);
4947 if (arg3
== error_mark_node
)
4948 return error_mark_node
;
4950 arg3_type
= TREE_TYPE (arg3
);
4951 result_type
= arg3_type
;
4953 else if (TREE_CODE (arg2
) != THROW_EXPR
4954 && TREE_CODE (arg3
) == THROW_EXPR
)
4956 if (!VOID_TYPE_P (arg2_type
))
4958 arg2
= force_rvalue (arg2
, complain
);
4959 if (arg2
== error_mark_node
)
4960 return error_mark_node
;
4962 arg2_type
= TREE_TYPE (arg2
);
4963 result_type
= arg2_type
;
4965 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
4966 result_type
= void_type_node
;
4969 if (complain
& tf_error
)
4971 if (VOID_TYPE_P (arg2_type
))
4972 error_at (EXPR_LOC_OR_LOC (arg3
, loc
),
4973 "second operand to the conditional operator "
4974 "is of type %<void%>, but the third operand is "
4975 "neither a throw-expression nor of type %<void%>");
4977 error_at (EXPR_LOC_OR_LOC (arg2
, loc
),
4978 "third operand to the conditional operator "
4979 "is of type %<void%>, but the second operand is "
4980 "neither a throw-expression nor of type %<void%>");
4982 return error_mark_node
;
4986 goto valid_operands
;
4990 Otherwise, if the second and third operand have different types,
4991 and either has (possibly cv-qualified) class type, or if both are
4992 glvalues of the same value category and the same type except for
4993 cv-qualification, an attempt is made to convert each of those operands
4994 to the type of the other. */
4995 else if (!same_type_p (arg2_type
, arg3_type
)
4996 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)
4997 || (same_type_ignoring_top_level_qualifiers_p (arg2_type
,
4999 && glvalue_p (arg2
) && glvalue_p (arg3
)
5000 && lvalue_p (arg2
) == lvalue_p (arg3
))))
5004 bool converted
= false;
5006 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5007 p
= conversion_obstack_alloc (0);
5009 conv2
= conditional_conversion (arg2
, arg3
, complain
);
5010 conv3
= conditional_conversion (arg3
, arg2
, complain
);
5014 If both can be converted, or one can be converted but the
5015 conversion is ambiguous, the program is ill-formed. If
5016 neither can be converted, the operands are left unchanged and
5017 further checking is performed as described below. If exactly
5018 one conversion is possible, that conversion is applied to the
5019 chosen operand and the converted operand is used in place of
5020 the original operand for the remainder of this section. */
5021 if ((conv2
&& !conv2
->bad_p
5022 && conv3
&& !conv3
->bad_p
)
5023 || (conv2
&& conv2
->kind
== ck_ambig
)
5024 || (conv3
&& conv3
->kind
== ck_ambig
))
5026 if (complain
& tf_error
)
5028 error_at (loc
, "operands to ?: have different types %qT and %qT",
5029 arg2_type
, arg3_type
);
5030 if (conv2
&& !conv2
->bad_p
&& conv3
&& !conv3
->bad_p
)
5031 inform (loc
, " and each type can be converted to the other");
5032 else if (conv2
&& conv2
->kind
== ck_ambig
)
5033 convert_like (conv2
, arg2
, complain
);
5035 convert_like (conv3
, arg3
, complain
);
5037 result
= error_mark_node
;
5039 else if (conv2
&& !conv2
->bad_p
)
5041 arg2
= convert_like (conv2
, arg2
, complain
);
5042 arg2
= convert_from_reference (arg2
);
5043 arg2_type
= TREE_TYPE (arg2
);
5044 /* Even if CONV2 is a valid conversion, the result of the
5045 conversion may be invalid. For example, if ARG3 has type
5046 "volatile X", and X does not have a copy constructor
5047 accepting a "volatile X&", then even if ARG2 can be
5048 converted to X, the conversion will fail. */
5049 if (error_operand_p (arg2
))
5050 result
= error_mark_node
;
5053 else if (conv3
&& !conv3
->bad_p
)
5055 arg3
= convert_like (conv3
, arg3
, complain
);
5056 arg3
= convert_from_reference (arg3
);
5057 arg3_type
= TREE_TYPE (arg3
);
5058 if (error_operand_p (arg3
))
5059 result
= error_mark_node
;
5063 /* Free all the conversions we allocated. */
5064 obstack_free (&conversion_obstack
, p
);
5069 /* If, after the conversion, both operands have class type,
5070 treat the cv-qualification of both operands as if it were the
5071 union of the cv-qualification of the operands.
5073 The standard is not clear about what to do in this
5074 circumstance. For example, if the first operand has type
5075 "const X" and the second operand has a user-defined
5076 conversion to "volatile X", what is the type of the second
5077 operand after this step? Making it be "const X" (matching
5078 the first operand) seems wrong, as that discards the
5079 qualification without actually performing a copy. Leaving it
5080 as "volatile X" seems wrong as that will result in the
5081 conditional expression failing altogether, even though,
5082 according to this step, the one operand could be converted to
5083 the type of the other. */
5085 && CLASS_TYPE_P (arg2_type
)
5086 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
5087 arg2_type
= arg3_type
=
5088 cp_build_qualified_type (arg2_type
,
5089 cp_type_quals (arg2_type
)
5090 | cp_type_quals (arg3_type
));
5095 If the second and third operands are glvalues of the same value
5096 category and have the same type, the result is of that type and
5098 if (((lvalue_p (arg2
) && lvalue_p (arg3
))
5099 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
5100 && same_type_p (arg2_type
, arg3_type
))
5102 result_type
= arg2_type
;
5103 arg2
= mark_lvalue_use (arg2
);
5104 arg3
= mark_lvalue_use (arg3
);
5105 goto valid_operands
;
5110 Otherwise, the result is an rvalue. If the second and third
5111 operand do not have the same type, and either has (possibly
5112 cv-qualified) class type, overload resolution is used to
5113 determine the conversions (if any) to be applied to the operands
5114 (_over.match.oper_, _over.built_). */
5116 if (!same_type_p (arg2_type
, arg3_type
)
5117 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
5123 /* Rearrange the arguments so that add_builtin_candidate only has
5124 to know about two args. In build_builtin_candidate, the
5125 arguments are unscrambled. */
5129 add_builtin_candidates (&candidates
,
5132 cp_operator_id (COND_EXPR
),
5134 LOOKUP_NORMAL
, complain
);
5138 If the overload resolution fails, the program is
5140 candidates
= splice_viable (candidates
, false, &any_viable_p
);
5143 if (complain
& tf_error
)
5144 error_at (loc
, "operands to ?: have different types %qT and %qT",
5145 arg2_type
, arg3_type
);
5146 return error_mark_node
;
5148 cand
= tourney (candidates
, complain
);
5151 if (complain
& tf_error
)
5153 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
5154 print_z_candidates (loc
, candidates
);
5156 return error_mark_node
;
5161 Otherwise, the conversions thus determined are applied, and
5162 the converted operands are used in place of the original
5163 operands for the remainder of this section. */
5164 conv
= cand
->convs
[0];
5165 arg1
= convert_like (conv
, arg1
, complain
);
5166 conv
= cand
->convs
[1];
5167 arg2
= convert_like (conv
, arg2
, complain
);
5168 arg2_type
= TREE_TYPE (arg2
);
5169 conv
= cand
->convs
[2];
5170 arg3
= convert_like (conv
, arg3
, complain
);
5171 arg3_type
= TREE_TYPE (arg3
);
5176 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5177 and function-to-pointer (_conv.func_) standard conversions are
5178 performed on the second and third operands.
5180 We need to force the lvalue-to-rvalue conversion here for class types,
5181 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5182 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5185 arg2
= force_rvalue (arg2
, complain
);
5186 if (!CLASS_TYPE_P (arg2_type
))
5187 arg2_type
= TREE_TYPE (arg2
);
5189 arg3
= force_rvalue (arg3
, complain
);
5190 if (!CLASS_TYPE_P (arg3_type
))
5191 arg3_type
= TREE_TYPE (arg3
);
5193 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5194 return error_mark_node
;
5198 After those conversions, one of the following shall hold:
5200 --The second and third operands have the same type; the result is of
5202 if (same_type_p (arg2_type
, arg3_type
))
5203 result_type
= arg2_type
;
5206 --The second and third operands have arithmetic or enumeration
5207 type; the usual arithmetic conversions are performed to bring
5208 them to a common type, and the result is of that type. */
5209 else if ((ARITHMETIC_TYPE_P (arg2_type
)
5210 || UNSCOPED_ENUM_P (arg2_type
))
5211 && (ARITHMETIC_TYPE_P (arg3_type
)
5212 || UNSCOPED_ENUM_P (arg3_type
)))
5214 /* In this case, there is always a common type. */
5215 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
5217 if (complain
& tf_warning
)
5218 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
5219 "implicit conversion from %qH to %qI to "
5220 "match other result of conditional",
5223 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5224 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
5226 if (TREE_CODE (orig_arg2
) == CONST_DECL
5227 && TREE_CODE (orig_arg3
) == CONST_DECL
5228 && DECL_CONTEXT (orig_arg2
) == DECL_CONTEXT (orig_arg3
))
5229 /* Two enumerators from the same enumeration can have different
5230 types when the enumeration is still being defined. */;
5231 else if (complain
& tf_warning
)
5232 warning_at (loc
, OPT_Wenum_compare
, "enumeral mismatch in "
5233 "conditional expression: %qT vs %qT",
5234 arg2_type
, arg3_type
);
5236 else if (extra_warnings
5237 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5238 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
5239 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
5240 && !same_type_p (arg2_type
,
5241 type_promotes_to (arg3_type
)))))
5243 if (complain
& tf_warning
)
5244 warning_at (loc
, OPT_Wextra
, "enumeral and non-enumeral type in "
5245 "conditional expression");
5248 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5249 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5253 --The second and third operands have pointer type, or one has
5254 pointer type and the other is a null pointer constant; pointer
5255 conversions (_conv.ptr_) and qualification conversions
5256 (_conv.qual_) are performed to bring them to their composite
5257 pointer type (_expr.rel_). The result is of the composite
5260 --The second and third operands have pointer to member type, or
5261 one has pointer to member type and the other is a null pointer
5262 constant; pointer to member conversions (_conv.mem_) and
5263 qualification conversions (_conv.qual_) are performed to bring
5264 them to a common type, whose cv-qualification shall match the
5265 cv-qualification of either the second or the third operand.
5266 The result is of the common type. */
5267 else if ((null_ptr_cst_p (arg2
)
5268 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
5269 || (null_ptr_cst_p (arg3
)
5270 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
5271 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
5272 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
5273 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
5275 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
5276 arg3
, CPO_CONDITIONAL_EXPR
,
5278 if (result_type
== error_mark_node
)
5279 return error_mark_node
;
5280 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5281 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5286 if (complain
& tf_error
)
5287 error_at (loc
, "operands to ?: have different types %qT and %qT",
5288 arg2_type
, arg3_type
);
5289 return error_mark_node
;
5292 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5293 return error_mark_node
;
5296 result
= build3_loc (loc
, COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
5298 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5299 warn here, because the COND_EXPR will be turned into ARG2. */
5300 if (warn_duplicated_branches
5301 && (arg2
== arg3
|| operand_equal_p (arg2
, arg3
, 0)))
5302 warning_at (EXPR_LOCATION (result
), OPT_Wduplicated_branches
,
5303 "this condition has identical branches");
5305 /* We can't use result_type below, as fold might have returned a
5310 /* Expand both sides into the same slot, hopefully the target of
5311 the ?: expression. We used to check for TARGET_EXPRs here,
5312 but now we sometimes wrap them in NOP_EXPRs so the test would
5314 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5315 result
= get_target_expr_sfinae (result
, complain
);
5316 /* If this expression is an rvalue, but might be mistaken for an
5317 lvalue, we must add a NON_LVALUE_EXPR. */
5318 result
= rvalue (result
);
5321 result
= force_paren_expr (result
);
5326 /* Wrapper for above. */
5329 build_conditional_expr (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
5330 tsubst_flags_t complain
)
5333 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5334 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5335 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5339 /* OPERAND is an operand to an expression. Perform necessary steps
5340 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5344 prep_operand (tree operand
)
5348 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5349 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5350 /* Make sure the template type is instantiated now. */
5351 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5357 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5358 OVERLOAD) to the CANDIDATES, returning an updated list of
5359 CANDIDATES. The ARGS are the arguments provided to the call;
5360 if FIRST_ARG is non-null it is the implicit object argument,
5361 otherwise the first element of ARGS is used if needed. The
5362 EXPLICIT_TARGS are explicit template arguments provided.
5363 TEMPLATE_ONLY is true if only template functions should be
5364 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5365 add_function_candidate. */
5368 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5370 tree explicit_targs
, bool template_only
,
5371 tree conversion_path
, tree access_path
,
5373 struct z_candidate
**candidates
,
5374 tsubst_flags_t complain
)
5377 const vec
<tree
, va_gc
> *non_static_args
;
5378 bool check_list_ctor
;
5379 bool check_converting
;
5380 unification_kind_t strict
;
5385 /* Precalculate special handling of constructors and conversion ops. */
5386 tree fn
= OVL_FIRST (fns
);
5387 if (DECL_CONV_FN_P (fn
))
5389 check_list_ctor
= false;
5390 check_converting
= !!(flags
& LOOKUP_ONLYCONVERTING
);
5391 if (flags
& LOOKUP_NO_CONVERSION
)
5392 /* We're doing return_type(x). */
5393 strict
= DEDUCE_CONV
;
5395 /* We're doing x.operator return_type(). */
5396 strict
= DEDUCE_EXACT
;
5397 /* [over.match.funcs] For conversion functions, the function
5398 is considered to be a member of the class of the implicit
5399 object argument for the purpose of defining the type of
5400 the implicit object parameter. */
5401 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5405 if (DECL_CONSTRUCTOR_P (fn
))
5407 check_list_ctor
= !!(flags
& LOOKUP_LIST_ONLY
);
5408 /* For list-initialization we consider explicit constructors
5409 and complain if one is chosen. */
5411 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5412 == LOOKUP_ONLYCONVERTING
);
5416 check_list_ctor
= false;
5417 check_converting
= false;
5419 strict
= DEDUCE_CALL
;
5420 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5424 non_static_args
= args
;
5426 /* Delay creating the implicit this parameter until it is needed. */
5427 non_static_args
= NULL
;
5429 for (lkp_iterator
iter (fns
); iter
; ++iter
)
5432 const vec
<tree
, va_gc
> *fn_args
;
5436 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5438 if (check_list_ctor
&& !is_list_ctor (fn
))
5441 /* Figure out which set of arguments to use. */
5442 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5444 /* If this function is a non-static member and we didn't get an
5445 implicit object argument, move it out of args. */
5446 if (first_arg
== NULL_TREE
)
5450 vec
<tree
, va_gc
> *tempvec
;
5451 vec_alloc (tempvec
, args
->length () - 1);
5452 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5453 tempvec
->quick_push (arg
);
5454 non_static_args
= tempvec
;
5455 first_arg
= (*args
)[0];
5458 fn_first_arg
= first_arg
;
5459 fn_args
= non_static_args
;
5463 /* Otherwise, just use the list of arguments provided. */
5464 fn_first_arg
= NULL_TREE
;
5468 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5469 add_template_candidate (candidates
,
5481 else if (!template_only
)
5482 add_function_candidate (candidates
,
5494 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5495 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5498 op_is_ordered (tree_code code
)
5504 return (flag_strong_eval_order
> 1 ? -1 : 0);
5508 return (flag_strong_eval_order
> 1 ? 1 : 0);
5511 // Not overloadable (yet).
5513 // Only one argument.
5520 return (flag_strong_eval_order
? 1 : 0);
5528 build_new_op_1 (location_t loc
, enum tree_code code
, int flags
, tree arg1
,
5529 tree arg2
, tree arg3
, tree
*overload
, tsubst_flags_t complain
)
5531 struct z_candidate
*candidates
= 0, *cand
;
5532 vec
<tree
, va_gc
> *arglist
;
5535 tree result
= NULL_TREE
;
5536 bool result_valid_p
= false;
5537 enum tree_code code2
= NOP_EXPR
;
5538 enum tree_code code_orig_arg1
= ERROR_MARK
;
5539 enum tree_code code_orig_arg2
= ERROR_MARK
;
5545 if (error_operand_p (arg1
)
5546 || error_operand_p (arg2
)
5547 || error_operand_p (arg3
))
5548 return error_mark_node
;
5550 if (code
== MODIFY_EXPR
)
5552 code2
= TREE_CODE (arg3
);
5554 fnname
= cp_assignment_operator_id (code2
);
5557 fnname
= cp_operator_id (code
);
5559 arg1
= prep_operand (arg1
);
5561 bool memonly
= false;
5566 case VEC_DELETE_EXPR
:
5568 /* Use build_op_new_call and build_op_delete_call instead. */
5572 /* Use build_op_call instead. */
5575 case TRUTH_ORIF_EXPR
:
5576 case TRUTH_ANDIF_EXPR
:
5577 case TRUTH_AND_EXPR
:
5579 /* These are saved for the sake of warn_logical_operator. */
5580 code_orig_arg1
= TREE_CODE (arg1
);
5581 code_orig_arg2
= TREE_CODE (arg2
);
5589 /* These are saved for the sake of maybe_warn_bool_compare. */
5590 code_orig_arg1
= TREE_CODE (TREE_TYPE (arg1
));
5591 code_orig_arg2
= TREE_CODE (TREE_TYPE (arg2
));
5594 /* =, ->, [], () must be non-static member functions. */
5596 if (code2
!= NOP_EXPR
)
5608 arg2
= prep_operand (arg2
);
5609 arg3
= prep_operand (arg3
);
5611 if (code
== COND_EXPR
)
5612 /* Use build_conditional_expr instead. */
5614 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5615 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5618 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5619 arg2
= integer_zero_node
;
5621 vec_alloc (arglist
, 3);
5622 arglist
->quick_push (arg1
);
5623 if (arg2
!= NULL_TREE
)
5624 arglist
->quick_push (arg2
);
5625 if (arg3
!= NULL_TREE
)
5626 arglist
->quick_push (arg3
);
5628 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5629 p
= conversion_obstack_alloc (0);
5631 /* Add namespace-scope operators to the list of functions to
5635 tree fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/true, 0, 0);
5636 fns
= lookup_arg_dependent (fnname
, fns
, arglist
);
5637 add_candidates (fns
, NULL_TREE
, arglist
, NULL_TREE
,
5638 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5639 flags
, &candidates
, complain
);
5644 args
[2] = NULL_TREE
;
5646 /* Add class-member operators to the candidate set. */
5647 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5651 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5652 if (fns
== error_mark_node
)
5654 result
= error_mark_node
;
5655 goto user_defined_result_ready
;
5658 add_candidates (BASELINK_FUNCTIONS (fns
),
5659 NULL_TREE
, arglist
, NULL_TREE
,
5661 BASELINK_BINFO (fns
),
5662 BASELINK_ACCESS_BINFO (fns
),
5663 flags
, &candidates
, complain
);
5665 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5666 only non-member functions that have type T1 or reference to
5667 cv-qualified-opt T1 for the first argument, if the first argument
5668 has an enumeration type, or T2 or reference to cv-qualified-opt
5669 T2 for the second argument, if the second argument has an
5670 enumeration type. Filter out those that don't match. */
5671 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5673 struct z_candidate
**candp
, **next
;
5675 for (candp
= &candidates
; *candp
; candp
= next
)
5677 tree parmlist
, parmtype
;
5678 int i
, nargs
= (arg2
? 2 : 1);
5683 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5685 for (i
= 0; i
< nargs
; ++i
)
5687 parmtype
= TREE_VALUE (parmlist
);
5689 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
5690 parmtype
= TREE_TYPE (parmtype
);
5691 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5692 && (same_type_ignoring_top_level_qualifiers_p
5693 (TREE_TYPE (args
[i
]), parmtype
)))
5696 parmlist
= TREE_CHAIN (parmlist
);
5699 /* No argument has an appropriate type, so remove this
5700 candidate function from the list. */
5703 *candp
= cand
->next
;
5709 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5716 /* For these, the built-in candidates set is empty
5717 [over.match.oper]/3. We don't want non-strict matches
5718 because exact matches are always possible with built-in
5719 operators. The built-in candidate set for COMPONENT_REF
5720 would be empty too, but since there are no such built-in
5721 operators, we accept non-strict matches for them. */
5730 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5735 case POSTINCREMENT_EXPR
:
5736 case POSTDECREMENT_EXPR
:
5737 /* Don't try anything fancy if we're not allowed to produce
5739 if (!(complain
& tf_error
))
5740 return error_mark_node
;
5742 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5743 distinguish between prefix and postfix ++ and
5744 operator++() was used for both, so we allow this with
5748 const char *msg
= (flag_permissive
)
5749 ? G_("no %<%D(int)%> declared for postfix %qs,"
5750 " trying prefix operator instead")
5751 : G_("no %<%D(int)%> declared for postfix %qs");
5752 permerror (loc
, msg
, fnname
, operator_name_info
[code
].name
);
5755 if (!flag_permissive
)
5756 return error_mark_node
;
5758 if (code
== POSTINCREMENT_EXPR
)
5759 code
= PREINCREMENT_EXPR
;
5761 code
= PREDECREMENT_EXPR
;
5762 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5763 NULL_TREE
, overload
, complain
);
5766 /* The caller will deal with these. */
5771 result_valid_p
= true;
5775 if (complain
& tf_error
)
5777 /* If one of the arguments of the operator represents
5778 an invalid use of member function pointer, try to report
5779 a meaningful error ... */
5780 if (invalid_nonstatic_memfn_p (loc
, arg1
, tf_error
)
5781 || invalid_nonstatic_memfn_p (loc
, arg2
, tf_error
)
5782 || invalid_nonstatic_memfn_p (loc
, arg3
, tf_error
))
5783 /* We displayed the error message. */;
5786 /* ... Otherwise, report the more generic
5787 "no matching operator found" error */
5788 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
5789 print_z_candidates (loc
, candidates
);
5792 result
= error_mark_node
;
5798 cand
= tourney (candidates
, complain
);
5801 if (complain
& tf_error
)
5803 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
5804 print_z_candidates (loc
, candidates
);
5806 result
= error_mark_node
;
5808 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
5811 *overload
= cand
->fn
;
5813 if (resolve_args (arglist
, complain
) == NULL
)
5814 result
= error_mark_node
;
5816 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5818 if (trivial_fn_p (cand
->fn
))
5819 /* There won't be a CALL_EXPR. */;
5820 else if (result
&& result
!= error_mark_node
)
5822 tree call
= extract_call_expr (result
);
5823 CALL_EXPR_OPERATOR_SYNTAX (call
) = true;
5825 if (processing_template_decl
&& DECL_HIDDEN_FRIEND_P (cand
->fn
))
5826 /* This prevents build_new_function_call from discarding this
5827 function during instantiation of the enclosing template. */
5828 KOENIG_LOOKUP_P (call
) = 1;
5830 /* Specify evaluation order as per P0145R2. */
5831 CALL_EXPR_ORDERED_ARGS (call
) = false;
5832 switch (op_is_ordered (code
))
5835 CALL_EXPR_REVERSE_ARGS (call
) = true;
5839 CALL_EXPR_ORDERED_ARGS (call
) = true;
5849 /* Give any warnings we noticed during overload resolution. */
5850 if (cand
->warnings
&& (complain
& tf_warning
))
5852 struct candidate_warning
*w
;
5853 for (w
= cand
->warnings
; w
; w
= w
->next
)
5854 joust (cand
, w
->loser
, 1, complain
);
5857 /* Check for comparison of different enum types. */
5866 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
5867 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
5868 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
5869 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
5870 && (complain
& tf_warning
))
5872 warning (OPT_Wenum_compare
,
5873 "comparison between %q#T and %q#T",
5874 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
5881 /* We need to strip any leading REF_BIND so that bitfields
5882 don't cause errors. This should not remove any important
5883 conversions, because builtins don't apply to class
5884 objects directly. */
5885 conv
= cand
->convs
[0];
5886 if (conv
->kind
== ck_ref_bind
)
5887 conv
= next_conversion (conv
);
5888 arg1
= convert_like (conv
, arg1
, complain
);
5892 conv
= cand
->convs
[1];
5893 if (conv
->kind
== ck_ref_bind
)
5894 conv
= next_conversion (conv
);
5896 arg2
= decay_conversion (arg2
, complain
);
5898 /* We need to call warn_logical_operator before
5899 converting arg2 to a boolean_type, but after
5900 decaying an enumerator to its value. */
5901 if (complain
& tf_warning
)
5902 warn_logical_operator (loc
, code
, boolean_type_node
,
5903 code_orig_arg1
, arg1
,
5904 code_orig_arg2
, arg2
);
5906 arg2
= convert_like (conv
, arg2
, complain
);
5910 conv
= cand
->convs
[2];
5911 if (conv
->kind
== ck_ref_bind
)
5912 conv
= next_conversion (conv
);
5913 arg3
= convert_like (conv
, arg3
, complain
);
5919 user_defined_result_ready
:
5921 /* Free all the conversions we allocated. */
5922 obstack_free (&conversion_obstack
, p
);
5924 if (result
|| result_valid_p
)
5931 return cp_build_modify_expr (loc
, arg1
, code2
, arg2
, complain
);
5934 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
5936 case TRUTH_ANDIF_EXPR
:
5937 case TRUTH_ORIF_EXPR
:
5938 case TRUTH_AND_EXPR
:
5940 if (complain
& tf_warning
)
5941 warn_logical_operator (loc
, code
, boolean_type_node
,
5942 code_orig_arg1
, arg1
,
5943 code_orig_arg2
, arg2
);
5951 if ((complain
& tf_warning
)
5952 && ((code_orig_arg1
== BOOLEAN_TYPE
)
5953 ^ (code_orig_arg2
== BOOLEAN_TYPE
)))
5954 maybe_warn_bool_compare (loc
, code
, arg1
, arg2
);
5955 if (complain
& tf_warning
&& warn_tautological_compare
)
5956 warn_tautological_cmp (loc
, code
, arg1
, arg2
);
5961 case TRUNC_DIV_EXPR
:
5966 case TRUNC_MOD_EXPR
:
5970 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
5972 case UNARY_PLUS_EXPR
:
5975 case TRUTH_NOT_EXPR
:
5976 case PREINCREMENT_EXPR
:
5977 case POSTINCREMENT_EXPR
:
5978 case PREDECREMENT_EXPR
:
5979 case POSTDECREMENT_EXPR
:
5983 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
5986 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
5989 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
5993 /* The caller will deal with these. */
6005 /* Wrapper for above. */
6008 build_new_op (location_t loc
, enum tree_code code
, int flags
,
6009 tree arg1
, tree arg2
, tree arg3
,
6010 tree
*overload
, tsubst_flags_t complain
)
6013 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
6014 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
6015 overload
, complain
);
6016 timevar_cond_stop (TV_OVERLOAD
, subtime
);
6020 /* CALL was returned by some call-building function; extract the actual
6021 CALL_EXPR from any bits that have been tacked on, e.g. by
6022 convert_from_reference. */
6025 extract_call_expr (tree call
)
6027 while (TREE_CODE (call
) == COMPOUND_EXPR
)
6028 call
= TREE_OPERAND (call
, 1);
6029 if (REFERENCE_REF_P (call
))
6030 call
= TREE_OPERAND (call
, 0);
6031 if (TREE_CODE (call
) == TARGET_EXPR
)
6032 call
= TARGET_EXPR_INITIAL (call
);
6033 gcc_assert (TREE_CODE (call
) == CALL_EXPR
6034 || TREE_CODE (call
) == AGGR_INIT_EXPR
6035 || call
== error_mark_node
);
6039 /* Returns true if FN has two parameters, of which the second has type
6043 second_parm_is_size_t (tree fn
)
6045 tree t
= FUNCTION_ARG_CHAIN (fn
);
6046 if (!t
|| !same_type_p (TREE_VALUE (t
), size_type_node
))
6049 if (t
== void_list_node
)
6051 if (aligned_new_threshold
&& t
6052 && same_type_p (TREE_VALUE (t
), align_type_node
)
6053 && TREE_CHAIN (t
) == void_list_node
)
6058 /* True if T, an allocation function, has std::align_val_t as its second
6062 aligned_allocation_fn_p (tree t
)
6064 if (!aligned_new_threshold
)
6067 tree a
= FUNCTION_ARG_CHAIN (t
);
6068 return (a
&& same_type_p (TREE_VALUE (a
), align_type_node
));
6071 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6072 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6073 std::align_val_t. */
6076 aligned_deallocation_fn_p (tree t
)
6078 if (!aligned_new_threshold
)
6081 /* A template instance is never a usual deallocation function,
6082 regardless of its signature. */
6083 if (TREE_CODE (t
) == TEMPLATE_DECL
6084 || primary_template_instantiation_p (t
))
6087 tree a
= FUNCTION_ARG_CHAIN (t
);
6088 if (same_type_p (TREE_VALUE (a
), align_type_node
)
6089 && TREE_CHAIN (a
) == void_list_node
)
6091 if (!same_type_p (TREE_VALUE (a
), size_type_node
))
6094 if (a
&& same_type_p (TREE_VALUE (a
), align_type_node
)
6095 && TREE_CHAIN (a
) == void_list_node
)
6100 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6101 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6104 usual_deallocation_fn_p (tree t
)
6106 /* A template instance is never a usual deallocation function,
6107 regardless of its signature. */
6108 if (TREE_CODE (t
) == TEMPLATE_DECL
6109 || primary_template_instantiation_p (t
))
6112 /* If a class T has a member deallocation function named operator delete
6113 with exactly one parameter, then that function is a usual
6114 (non-placement) deallocation function. If class T does not declare
6115 such an operator delete but does declare a member deallocation
6116 function named operator delete with exactly two parameters, the second
6117 of which has type std::size_t (18.2), then this function is a usual
6118 deallocation function. */
6119 bool global
= DECL_NAMESPACE_SCOPE_P (t
);
6120 tree chain
= FUNCTION_ARG_CHAIN (t
);
6123 if (chain
== void_list_node
6124 || ((!global
|| flag_sized_deallocation
)
6125 && second_parm_is_size_t (t
)))
6127 if (aligned_deallocation_fn_p (t
))
6132 /* Build a call to operator delete. This has to be handled very specially,
6133 because the restrictions on what signatures match are different from all
6134 other call instances. For a normal delete, only a delete taking (void *)
6135 or (void *, size_t) is accepted. For a placement delete, only an exact
6136 match with the placement new is accepted.
6138 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6139 ADDR is the pointer to be deleted.
6140 SIZE is the size of the memory block to be deleted.
6141 GLOBAL_P is true if the delete-expression should not consider
6142 class-specific delete operators.
6143 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6145 If this call to "operator delete" is being generated as part to
6146 deallocate memory allocated via a new-expression (as per [expr.new]
6147 which requires that if the initialization throws an exception then
6148 we call a deallocation function), then ALLOC_FN is the allocation
6152 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
6153 bool global_p
, tree placement
,
6154 tree alloc_fn
, tsubst_flags_t complain
)
6156 tree fn
= NULL_TREE
;
6157 tree fns
, fnname
, type
, t
;
6159 if (addr
== error_mark_node
)
6160 return error_mark_node
;
6162 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
6164 fnname
= cp_operator_id (code
);
6166 if (CLASS_TYPE_P (type
)
6167 && COMPLETE_TYPE_P (complete_type (type
))
6171 If the result of the lookup is ambiguous or inaccessible, or if
6172 the lookup selects a placement deallocation function, the
6173 program is ill-formed.
6175 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6177 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
6178 if (fns
== error_mark_node
)
6179 return error_mark_node
;
6184 if (fns
== NULL_TREE
)
6185 fns
= lookup_name_nonclass (fnname
);
6187 /* Strip const and volatile from addr. */
6188 addr
= cp_convert (ptr_type_node
, addr
, complain
);
6192 /* "A declaration of a placement deallocation function matches the
6193 declaration of a placement allocation function if it has the same
6194 number of parameters and, after parameter transformations (8.3.5),
6195 all parameter types except the first are identical."
6197 So we build up the function type we want and ask instantiate_type
6198 to get it for us. */
6199 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
6200 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
6201 t
= build_function_type (void_type_node
, t
);
6203 fn
= instantiate_type (t
, fns
, tf_none
);
6204 if (fn
== error_mark_node
)
6207 fn
= MAYBE_BASELINK_FUNCTIONS (fn
);
6209 /* "If the lookup finds the two-parameter form of a usual deallocation
6210 function (3.7.4.2) and that function, considered as a placement
6211 deallocation function, would have been selected as a match for the
6212 allocation function, the program is ill-formed." */
6213 if (second_parm_is_size_t (fn
))
6215 const char *const msg1
6216 = G_("exception cleanup for this placement new selects "
6217 "non-placement operator delete");
6218 const char *const msg2
6219 = G_("%qD is a usual (non-placement) deallocation "
6220 "function in C++14 (or with -fsized-deallocation)");
6222 /* But if the class has an operator delete (void *), then that is
6223 the usual deallocation function, so we shouldn't complain
6224 about using the operator delete (void *, size_t). */
6225 if (DECL_CLASS_SCOPE_P (fn
))
6226 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
));
6230 if (usual_deallocation_fn_p (elt
)
6231 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
6234 /* Before C++14 a two-parameter global deallocation function is
6235 always a placement deallocation function, but warn if
6237 else if (!flag_sized_deallocation
)
6239 if ((complain
& tf_warning
)
6240 && warning (OPT_Wc__14_compat
, msg1
))
6241 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6245 if (complain
& tf_warning_or_error
)
6247 if (permerror (input_location
, msg1
))
6249 /* Only mention C++14 for namespace-scope delete. */
6250 if (DECL_NAMESPACE_SCOPE_P (fn
))
6251 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6253 inform (DECL_SOURCE_LOCATION (fn
),
6254 "%qD is a usual (non-placement) deallocation "
6259 return error_mark_node
;
6264 /* "Any non-placement deallocation function matches a non-placement
6265 allocation function. If the lookup finds a single matching
6266 deallocation function, that function will be called; otherwise, no
6267 deallocation function will be called." */
6268 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
)); iter
; ++iter
)
6271 if (usual_deallocation_fn_p (elt
))
6279 /* -- If the type has new-extended alignment, a function with a
6280 parameter of type std::align_val_t is preferred; otherwise a
6281 function without such a parameter is preferred. If exactly one
6282 preferred function is found, that function is selected and the
6283 selection process terminates. If more than one preferred
6284 function is found, all non-preferred functions are eliminated
6285 from further consideration. */
6286 if (aligned_new_threshold
)
6288 bool want_align
= type_has_new_extended_alignment (type
);
6289 bool fn_align
= aligned_deallocation_fn_p (fn
);
6290 bool elt_align
= aligned_deallocation_fn_p (elt
);
6292 if (elt_align
!= fn_align
)
6294 if (want_align
== elt_align
)
6300 /* -- If the deallocation functions have class scope, the one
6301 without a parameter of type std::size_t is selected. */
6303 if (DECL_CLASS_SCOPE_P (fn
))
6306 /* -- If the type is complete and if, for the second alternative
6307 (delete array) only, the operand is a pointer to a class type
6308 with a non-trivial destructor or a (possibly multi-dimensional)
6309 array thereof, the function with a parameter of type std::size_t
6312 -- Otherwise, it is unspecified whether a deallocation function
6313 with a parameter of type std::size_t is selected. */
6316 want_size
= COMPLETE_TYPE_P (type
);
6317 if (code
== VEC_DELETE_EXPR
6318 && !TYPE_VEC_NEW_USES_COOKIE (type
))
6319 /* We need a cookie to determine the array size. */
6322 bool fn_size
= second_parm_is_size_t (fn
);
6323 bool elt_size
= second_parm_is_size_t (elt
);
6324 gcc_assert (fn_size
!= elt_size
);
6325 if (want_size
== elt_size
)
6330 /* If we have a matching function, call it. */
6333 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6335 /* If the FN is a member function, make sure that it is
6337 if (BASELINK_P (fns
))
6338 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
6341 /* Core issue 901: It's ok to new a type with deleted delete. */
6342 if (DECL_DELETED_FN (fn
) && alloc_fn
)
6347 /* The placement args might not be suitable for overload
6348 resolution at this point, so build the call directly. */
6349 int nargs
= call_expr_nargs (placement
);
6350 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
6353 for (i
= 1; i
< nargs
; i
++)
6354 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
6355 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
6356 return error_mark_node
;
6357 return build_cxx_call (fn
, nargs
, argarray
, complain
);
6362 vec
<tree
, va_gc
> *args
= make_tree_vector ();
6363 args
->quick_push (addr
);
6364 if (second_parm_is_size_t (fn
))
6365 args
->quick_push (size
);
6366 if (aligned_deallocation_fn_p (fn
))
6368 tree al
= build_int_cst (align_type_node
, TYPE_ALIGN_UNIT (type
));
6369 args
->quick_push (al
);
6371 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
6372 release_tree_vector (args
);
6379 If no unambiguous matching deallocation function can be found,
6380 propagating the exception does not cause the object's memory to
6384 if ((complain
& tf_warning
)
6386 warning (0, "no corresponding deallocation function for %qD",
6391 if (complain
& tf_error
)
6392 error ("no suitable %<operator %s%> for %qT",
6393 operator_name_info
[(int)code
].name
, type
);
6394 return error_mark_node
;
6397 /* If the current scope isn't allowed to access DECL along
6398 BASETYPE_PATH, give an error. The most derived class in
6399 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6400 the declaration to use in the error diagnostic. */
6403 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
6404 tsubst_flags_t complain
, access_failure_info
*afi
)
6406 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
6408 if (flag_new_inheriting_ctors
6409 && DECL_INHERITED_CTOR (decl
))
6411 /* 7.3.3/18: The additional constructors are accessible if they would be
6412 accessible when used to construct an object of the corresponding base
6414 decl
= strip_inheriting_ctors (decl
);
6415 basetype_path
= lookup_base (basetype_path
, DECL_CONTEXT (decl
),
6416 ba_any
, NULL
, complain
);
6419 if (!accessible_p (basetype_path
, decl
, true))
6421 if (complain
& tf_error
)
6423 if (flag_new_inheriting_ctors
)
6424 diag_decl
= strip_inheriting_ctors (diag_decl
);
6425 if (TREE_PRIVATE (decl
))
6427 error ("%q#D is private within this context", diag_decl
);
6428 inform (DECL_SOURCE_LOCATION (diag_decl
),
6429 "declared private here");
6431 afi
->record_access_failure (basetype_path
, diag_decl
);
6433 else if (TREE_PROTECTED (decl
))
6435 error ("%q#D is protected within this context", diag_decl
);
6436 inform (DECL_SOURCE_LOCATION (diag_decl
),
6437 "declared protected here");
6439 afi
->record_access_failure (basetype_path
, diag_decl
);
6443 error ("%q#D is inaccessible within this context", diag_decl
);
6444 inform (DECL_SOURCE_LOCATION (diag_decl
), "declared here");
6446 afi
->record_access_failure (basetype_path
, diag_decl
);
6455 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6456 bitwise or of LOOKUP_* values. If any errors are warnings are
6457 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6458 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6462 build_temp (tree expr
, tree type
, int flags
,
6463 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
6466 vec
<tree
, va_gc
> *args
;
6468 *diagnostic_kind
= DK_UNSPECIFIED
;
6470 /* If the source is a packed field, calling the copy constructor will require
6471 binding the field to the reference parameter to the copy constructor, and
6472 we'll end up with an infinite loop. If we can use a bitwise copy, then
6474 if ((lvalue_kind (expr
) & clk_packed
)
6475 && CLASS_TYPE_P (TREE_TYPE (expr
))
6476 && !type_has_nontrivial_copy_init (TREE_TYPE (expr
)))
6477 return get_target_expr_sfinae (expr
, complain
);
6479 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
6480 args
= make_tree_vector_single (expr
);
6481 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6482 &args
, type
, flags
, complain
);
6483 release_tree_vector (args
);
6484 if (warningcount
+ werrorcount
> savew
)
6485 *diagnostic_kind
= DK_WARNING
;
6486 else if (errorcount
> savee
)
6487 *diagnostic_kind
= DK_ERROR
;
6491 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6492 EXPR is implicitly converted to type TOTYPE.
6493 FN and ARGNUM are used for diagnostics. */
6496 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
6498 /* Issue warnings about peculiar, but valid, uses of NULL. */
6499 if (expr
== null_node
&& TREE_CODE (totype
) != BOOLEAN_TYPE
6500 && ARITHMETIC_TYPE_P (totype
))
6502 source_location loc
=
6503 expansion_point_location_if_in_system_header (input_location
);
6506 warning_at (loc
, OPT_Wconversion_null
,
6507 "passing NULL to non-pointer argument %P of %qD",
6510 warning_at (loc
, OPT_Wconversion_null
,
6511 "converting to non-pointer type %qT from NULL", totype
);
6514 /* Issue warnings if "false" is converted to a NULL pointer */
6515 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
6516 && TYPE_PTR_P (totype
))
6519 warning_at (input_location
, OPT_Wconversion_null
,
6520 "converting %<false%> to pointer type for argument %P "
6521 "of %qD", argnum
, fn
);
6523 warning_at (input_location
, OPT_Wconversion_null
,
6524 "converting %<false%> to pointer type %qT", totype
);
6528 /* We gave a diagnostic during a conversion. If this was in the second
6529 standard conversion sequence of a user-defined conversion sequence, say
6530 which user-defined conversion. */
6533 maybe_print_user_conv_context (conversion
*convs
)
6535 if (convs
->user_conv_p
)
6536 for (conversion
*t
= convs
; t
; t
= next_conversion (t
))
6537 if (t
->kind
== ck_user
)
6539 print_z_candidate (0, " after user-defined conversion:",
6545 /* Perform the conversions in CONVS on the expression EXPR. FN and
6546 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6547 indicates the `this' argument of a method. INNER is nonzero when
6548 being called to continue a conversion chain. It is negative when a
6549 reference binding will be applied, positive otherwise. If
6550 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6551 conversions will be emitted if appropriate. If C_CAST_P is true,
6552 this conversion is coming from a C-style cast; in that case,
6553 conversions to inaccessible bases are permitted. */
6556 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
6557 bool issue_conversion_warnings
,
6558 bool c_cast_p
, tsubst_flags_t complain
)
6560 tree totype
= convs
->type
;
6561 diagnostic_t diag_kind
;
6563 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6565 if (convs
->bad_p
&& !(complain
& tf_error
))
6566 return error_mark_node
;
6569 && convs
->kind
!= ck_user
6570 && convs
->kind
!= ck_list
6571 && convs
->kind
!= ck_ambig
6572 && (convs
->kind
!= ck_ref_bind
6573 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
6574 && (convs
->kind
!= ck_rvalue
6575 || SCALAR_TYPE_P (totype
))
6576 && convs
->kind
!= ck_base
)
6578 bool complained
= false;
6579 conversion
*t
= convs
;
6581 /* Give a helpful error if this is bad because of excess braces. */
6582 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6583 && SCALAR_TYPE_P (totype
)
6584 && CONSTRUCTOR_NELTS (expr
) > 0
6585 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
6587 complained
= permerror (loc
, "too many braces around initializer "
6589 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6590 && CONSTRUCTOR_NELTS (expr
) == 1)
6591 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6594 /* Give a helpful error if this is bad because a conversion to bool
6595 from std::nullptr_t requires direct-initialization. */
6596 if (NULLPTR_TYPE_P (TREE_TYPE (expr
))
6597 && TREE_CODE (totype
) == BOOLEAN_TYPE
)
6598 complained
= permerror (loc
, "converting to %qH from %qI requires "
6599 "direct-initialization",
6600 totype
, TREE_TYPE (expr
));
6602 for (; t
; t
= next_conversion (t
))
6604 if (t
->kind
== ck_user
&& t
->cand
->reason
)
6606 complained
= permerror (loc
, "invalid user-defined conversion "
6607 "from %qH to %qI", TREE_TYPE (expr
),
6610 print_z_candidate (loc
, "candidate is:", t
->cand
);
6611 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6612 /*issue_conversion_warnings=*/false,
6615 if (convs
->kind
== ck_ref_bind
)
6616 expr
= convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
6617 LOOKUP_NORMAL
, NULL_TREE
,
6620 expr
= cp_convert (totype
, expr
, complain
);
6621 if (complained
&& fn
)
6622 inform (DECL_SOURCE_LOCATION (fn
),
6623 " initializing argument %P of %qD", argnum
, fn
);
6626 else if (t
->kind
== ck_user
|| !t
->bad_p
)
6628 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6629 /*issue_conversion_warnings=*/false,
6634 else if (t
->kind
== ck_ambig
)
6635 return convert_like_real (t
, expr
, fn
, argnum
,
6636 /*issue_conversion_warnings=*/false,
6639 else if (t
->kind
== ck_identity
)
6643 complained
= permerror (loc
, "invalid conversion from %qH to %qI",
6644 TREE_TYPE (expr
), totype
);
6645 if (complained
&& fn
)
6646 inform (DECL_SOURCE_LOCATION (fn
),
6647 " initializing argument %P of %qD", argnum
, fn
);
6649 return cp_convert (totype
, expr
, complain
);
6652 if (issue_conversion_warnings
&& (complain
& tf_warning
))
6653 conversion_null_warnings (totype
, expr
, fn
, argnum
);
6655 switch (convs
->kind
)
6659 struct z_candidate
*cand
= convs
->cand
;
6660 tree convfn
= cand
->fn
;
6662 /* When converting from an init list we consider explicit
6663 constructors, but actually trying to call one is an error. */
6664 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
6665 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
6666 /* Unless this is for direct-list-initialization. */
6667 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
)
6668 /* And in C++98 a default constructor can't be explicit. */
6669 && cxx_dialect
>= cxx11
)
6671 if (!(complain
& tf_error
))
6672 return error_mark_node
;
6673 location_t loc
= location_of (expr
);
6674 if (CONSTRUCTOR_NELTS (expr
) == 0
6675 && FUNCTION_FIRST_USER_PARMTYPE (convfn
) != void_list_node
)
6677 if (pedwarn (loc
, 0, "converting to %qT from initializer list "
6678 "would use explicit constructor %qD",
6680 inform (loc
, "in C++11 and above a default constructor "
6684 error ("converting to %qT from initializer list would use "
6685 "explicit constructor %qD", totype
, convfn
);
6688 /* If we're initializing from {}, it's value-initialization. */
6689 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6690 && CONSTRUCTOR_NELTS (expr
) == 0
6691 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
6693 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
6694 expr
= build_value_init (totype
, complain
);
6695 expr
= get_target_expr_sfinae (expr
, complain
);
6696 if (expr
!= error_mark_node
)
6698 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6699 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
6704 expr
= mark_rvalue_use (expr
);
6706 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
6708 expr
= build_over_call (cand
, LOOKUP_NORMAL
|LOOKUP_NO_CONVERSION
,
6711 /* If this is a constructor or a function returning an aggr type,
6712 we need to build up a TARGET_EXPR. */
6713 if (DECL_CONSTRUCTOR_P (convfn
))
6715 expr
= build_cplus_new (totype
, expr
, complain
);
6717 /* Remember that this was list-initialization. */
6718 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
6719 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6725 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
6727 int nelts
= CONSTRUCTOR_NELTS (expr
);
6729 expr
= build_value_init (totype
, complain
);
6730 else if (nelts
== 1)
6731 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6735 expr
= mark_rvalue_use (expr
);
6737 if (type_unknown_p (expr
))
6738 expr
= instantiate_type (totype
, expr
, complain
);
6741 /* We leave bad_p off ck_ambig because overload resolution considers
6742 it valid, it just fails when we try to perform it. So we need to
6743 check complain here, too. */
6744 if (complain
& tf_error
)
6746 /* Call build_user_type_conversion again for the error. */
6747 build_user_type_conversion (totype
, convs
->u
.expr
, LOOKUP_IMPLICIT
,
6750 inform (DECL_SOURCE_LOCATION (fn
),
6751 " initializing argument %P of %qD", argnum
, fn
);
6753 return error_mark_node
;
6757 /* Conversion to std::initializer_list<T>. */
6758 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
6759 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
6760 unsigned len
= CONSTRUCTOR_NELTS (expr
);
6761 tree array
, val
, field
;
6762 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
6765 /* Convert all the elements. */
6766 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
6768 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
6769 false, false, complain
);
6770 if (sub
== error_mark_node
)
6772 if (!BRACE_ENCLOSED_INITIALIZER_P (val
)
6773 && !check_narrowing (TREE_TYPE (sub
), val
, complain
))
6774 return error_mark_node
;
6775 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
6776 if (!TREE_CONSTANT (sub
))
6777 TREE_CONSTANT (new_ctor
) = false;
6779 /* Build up the array. */
6780 elttype
= cp_build_qualified_type
6781 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
6782 array
= build_array_of_n_type (elttype
, len
);
6783 array
= finish_compound_literal (array
, new_ctor
, complain
);
6784 /* Take the address explicitly rather than via decay_conversion
6785 to avoid the error about taking the address of a temporary. */
6786 array
= cp_build_addr_expr (array
, complain
);
6787 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
6788 if (array
== error_mark_node
)
6789 return error_mark_node
;
6791 /* Build up the initializer_list object. */
6792 totype
= complete_type (totype
);
6793 field
= next_initializable_field (TYPE_FIELDS (totype
));
6794 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
6795 field
= next_initializable_field (DECL_CHAIN (field
));
6796 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
6797 new_ctor
= build_constructor (totype
, vec
);
6798 return get_target_expr_sfinae (new_ctor
, complain
);
6802 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
6804 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6805 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
6806 real
= perform_implicit_conversion (TREE_TYPE (totype
),
6808 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
6810 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
6813 expr
= reshape_init (totype
, expr
, complain
);
6814 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
6816 if (expr
!= error_mark_node
)
6817 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6824 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
6825 convs
->kind
== ck_ref_bind
? issue_conversion_warnings
: false,
6828 if (expr
== error_mark_node
)
6829 return error_mark_node
;
6831 switch (convs
->kind
)
6834 expr
= decay_conversion (expr
, complain
);
6835 if (expr
== error_mark_node
)
6837 if (complain
& tf_error
)
6839 maybe_print_user_conv_context (convs
);
6841 inform (DECL_SOURCE_LOCATION (fn
),
6842 " initializing argument %P of %qD", argnum
, fn
);
6844 return error_mark_node
;
6847 if (! MAYBE_CLASS_TYPE_P (totype
))
6850 /* Don't introduce copies when passing arguments along to the inherited
6852 if (current_function_decl
6853 && flag_new_inheriting_ctors
6854 && DECL_INHERITED_CTOR (current_function_decl
))
6859 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
6861 /* We are going to bind a reference directly to a base-class
6862 subobject of EXPR. */
6863 /* Build an expression for `*((base*) &expr)'. */
6864 expr
= convert_to_base (expr
, totype
,
6865 !c_cast_p
, /*nonnull=*/true, complain
);
6869 /* Copy-initialization where the cv-unqualified version of the source
6870 type is the same class as, or a derived class of, the class of the
6871 destination [is treated as direct-initialization]. [dcl.init] */
6872 flags
= LOOKUP_NORMAL
;
6873 if (convs
->user_conv_p
)
6874 /* This conversion is being done in the context of a user-defined
6875 conversion (i.e. the second step of copy-initialization), so
6876 don't allow any more. */
6877 flags
|= LOOKUP_NO_CONVERSION
;
6879 flags
|= LOOKUP_ONLYCONVERTING
;
6880 if (convs
->rvaluedness_matches_p
)
6881 flags
|= LOOKUP_PREFER_RVALUE
;
6882 if (TREE_CODE (expr
) == TARGET_EXPR
6883 && TARGET_EXPR_LIST_INIT_P (expr
))
6884 /* Copy-list-initialization doesn't actually involve a copy. */
6886 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
6887 if (diag_kind
&& complain
)
6889 maybe_print_user_conv_context (convs
);
6891 inform (DECL_SOURCE_LOCATION (fn
),
6892 " initializing argument %P of %qD", argnum
, fn
);
6895 return build_cplus_new (totype
, expr
, complain
);
6899 tree ref_type
= totype
;
6901 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
6903 tree extype
= TREE_TYPE (expr
);
6904 if (TYPE_REF_IS_RVALUE (ref_type
)
6906 error_at (loc
, "cannot bind rvalue reference of type %qH to "
6907 "lvalue of type %qI", totype
, extype
);
6908 else if (!TYPE_REF_IS_RVALUE (ref_type
) && !lvalue_p (expr
)
6909 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
6910 error_at (loc
, "cannot bind non-const lvalue reference of "
6911 "type %qH to an rvalue of type %qI", totype
, extype
);
6912 else if (!reference_compatible_p (TREE_TYPE (totype
), extype
))
6913 error_at (loc
, "binding reference of type %qH to %qI "
6914 "discards qualifiers", totype
, extype
);
6917 maybe_print_user_conv_context (convs
);
6919 inform (DECL_SOURCE_LOCATION (fn
),
6920 " initializing argument %P of %qD", argnum
, fn
);
6921 return error_mark_node
;
6924 /* If necessary, create a temporary.
6926 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
6927 that need temporaries, even when their types are reference
6928 compatible with the type of reference being bound, so the
6929 upcoming call to cp_build_addr_expr doesn't fail. */
6930 if (convs
->need_temporary_p
6931 || TREE_CODE (expr
) == CONSTRUCTOR
6932 || TREE_CODE (expr
) == VA_ARG_EXPR
)
6934 /* Otherwise, a temporary of type "cv1 T1" is created and
6935 initialized from the initializer expression using the rules
6936 for a non-reference copy-initialization (8.5). */
6938 tree type
= TREE_TYPE (ref_type
);
6939 cp_lvalue_kind lvalue
= lvalue_kind (expr
);
6941 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6942 (type
, next_conversion (convs
)->type
));
6943 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
6944 && !TYPE_REF_IS_RVALUE (ref_type
))
6946 /* If the reference is volatile or non-const, we
6947 cannot create a temporary. */
6948 if (lvalue
& clk_bitfield
)
6949 error_at (loc
, "cannot bind bitfield %qE to %qT",
6951 else if (lvalue
& clk_packed
)
6952 error_at (loc
, "cannot bind packed field %qE to %qT",
6955 error_at (loc
, "cannot bind rvalue %qE to %qT",
6957 return error_mark_node
;
6959 /* If the source is a packed field, and we must use a copy
6960 constructor, then building the target expr will require
6961 binding the field to the reference parameter to the
6962 copy constructor, and we'll end up with an infinite
6963 loop. If we can use a bitwise copy, then we'll be
6965 if ((lvalue
& clk_packed
)
6966 && CLASS_TYPE_P (type
)
6967 && type_has_nontrivial_copy_init (type
))
6969 error_at (loc
, "cannot bind packed field %qE to %qT",
6971 return error_mark_node
;
6973 if (lvalue
& clk_bitfield
)
6975 expr
= convert_bitfield_to_declared_type (expr
);
6976 expr
= fold_convert (type
, expr
);
6978 expr
= build_target_expr_with_type (expr
, type
, complain
);
6981 /* Take the address of the thing to which we will bind the
6983 expr
= cp_build_addr_expr (expr
, complain
);
6984 if (expr
== error_mark_node
)
6985 return error_mark_node
;
6987 /* Convert it to a pointer to the type referred to by the
6988 reference. This will adjust the pointer if a derived to
6989 base conversion is being performed. */
6990 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
6992 /* Convert the pointer to the desired reference type. */
6993 return build_nop (ref_type
, expr
);
6997 return decay_conversion (expr
, complain
);
7000 /* ??? Should the address of a transaction-safe pointer point to the TM
7001 clone, and this conversion look up the primary function? */
7002 return build_nop (totype
, expr
);
7005 /* Warn about deprecated conversion if appropriate. */
7006 string_conv_p (totype
, expr
, 1);
7011 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
7012 /*nonnull=*/false, complain
);
7013 return build_nop (totype
, expr
);
7016 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
7017 c_cast_p
, complain
);
7023 if (convs
->check_narrowing
7024 && !check_narrowing (totype
, expr
, complain
))
7025 return error_mark_node
;
7027 if (issue_conversion_warnings
)
7028 expr
= cp_convert_and_check (totype
, expr
, complain
);
7030 expr
= cp_convert (totype
, expr
, complain
);
7035 /* ARG is being passed to a varargs function. Perform any conversions
7036 required. Return the converted value. */
7039 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
7042 location_t loc
= EXPR_LOC_OR_LOC (arg
, input_location
);
7046 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7047 standard conversions are performed. */
7048 arg
= decay_conversion (arg
, complain
);
7049 arg_type
= TREE_TYPE (arg
);
7052 If the argument has integral or enumeration type that is subject
7053 to the integral promotions (_conv.prom_), or a floating point
7054 type that is subject to the floating point promotion
7055 (_conv.fpprom_), the value of the argument is converted to the
7056 promoted type before the call. */
7057 if (TREE_CODE (arg_type
) == REAL_TYPE
7058 && (TYPE_PRECISION (arg_type
)
7059 < TYPE_PRECISION (double_type_node
))
7060 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
7062 if ((complain
& tf_warning
)
7063 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
7064 warning_at (loc
, OPT_Wdouble_promotion
,
7065 "implicit conversion from %qH to %qI when passing "
7066 "argument to function",
7067 arg_type
, double_type_node
);
7068 arg
= convert_to_real_nofold (double_type_node
, arg
);
7070 else if (NULLPTR_TYPE_P (arg_type
))
7071 arg
= null_pointer_node
;
7072 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
7074 if (SCOPED_ENUM_P (arg_type
))
7076 tree prom
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
,
7078 prom
= cp_perform_integral_promotions (prom
, complain
);
7079 if (abi_version_crosses (6)
7080 && TYPE_MODE (TREE_TYPE (prom
)) != TYPE_MODE (arg_type
)
7081 && (complain
& tf_warning
))
7082 warning_at (loc
, OPT_Wabi
, "scoped enum %qT passed through ... as "
7083 "%qT before -fabi-version=6, %qT after", arg_type
,
7084 TREE_TYPE (prom
), ENUM_UNDERLYING_TYPE (arg_type
));
7085 if (!abi_version_at_least (6))
7089 arg
= cp_perform_integral_promotions (arg
, complain
);
7092 arg
= require_complete_type_sfinae (arg
, complain
);
7093 arg_type
= TREE_TYPE (arg
);
7095 if (arg
!= error_mark_node
7096 /* In a template (or ill-formed code), we can have an incomplete type
7097 even after require_complete_type_sfinae, in which case we don't know
7098 whether it has trivial copy or not. */
7099 && COMPLETE_TYPE_P (arg_type
))
7101 /* Build up a real lvalue-to-rvalue conversion in case the
7102 copy constructor is trivial but not callable. */
7103 if (!cp_unevaluated_operand
&& CLASS_TYPE_P (arg_type
))
7104 force_rvalue (arg
, complain
);
7106 /* [expr.call] 5.2.2/7:
7107 Passing a potentially-evaluated argument of class type (Clause 9)
7108 with a non-trivial copy constructor or a non-trivial destructor
7109 with no corresponding parameter is conditionally-supported, with
7110 implementation-defined semantics.
7112 We support it as pass-by-invisible-reference, just like a normal
7115 If the call appears in the context of a sizeof expression,
7116 it is not potentially-evaluated. */
7117 if (cp_unevaluated_operand
== 0
7118 && (type_has_nontrivial_copy_init (arg_type
)
7119 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
)))
7121 if (complain
& tf_warning
)
7122 warning (OPT_Wconditionally_supported
,
7123 "passing objects of non-trivially-copyable "
7124 "type %q#T through %<...%> is conditionally supported",
7126 return cp_build_addr_expr (arg
, complain
);
7133 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7136 build_x_va_arg (source_location loc
, tree expr
, tree type
)
7138 if (processing_template_decl
)
7140 tree r
= build_min (VA_ARG_EXPR
, type
, expr
);
7141 SET_EXPR_LOCATION (r
, loc
);
7145 type
= complete_type_or_else (type
, NULL_TREE
);
7147 if (expr
== error_mark_node
|| !type
)
7148 return error_mark_node
;
7150 expr
= mark_lvalue_use (expr
);
7152 if (TREE_CODE (type
) == REFERENCE_TYPE
)
7154 error ("cannot receive reference type %qT through %<...%>", type
);
7155 return error_mark_node
;
7158 if (type_has_nontrivial_copy_init (type
)
7159 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7161 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7162 it as pass by invisible reference. */
7163 warning_at (loc
, OPT_Wconditionally_supported
,
7164 "receiving objects of non-trivially-copyable type %q#T "
7165 "through %<...%> is conditionally-supported", type
);
7167 tree ref
= cp_build_reference_type (type
, false);
7168 expr
= build_va_arg (loc
, expr
, ref
);
7169 return convert_from_reference (expr
);
7172 tree ret
= build_va_arg (loc
, expr
, type
);
7173 if (CLASS_TYPE_P (type
))
7174 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7175 know how to handle it. */
7176 ret
= get_target_expr (ret
);
7180 /* TYPE has been given to va_arg. Apply the default conversions which
7181 would have happened when passed via ellipsis. Return the promoted
7182 type, or the passed type if there is no change. */
7185 cxx_type_promotes_to (tree type
)
7189 /* Perform the array-to-pointer and function-to-pointer
7191 type
= type_decays_to (type
);
7193 promote
= type_promotes_to (type
);
7194 if (same_type_p (type
, promote
))
7200 /* ARG is a default argument expression being passed to a parameter of
7201 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7202 zero-based argument number. Do any required conversions. Return
7203 the converted value. */
7205 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
7207 push_defarg_context (tree fn
)
7208 { vec_safe_push (default_arg_context
, fn
); }
7211 pop_defarg_context (void)
7212 { default_arg_context
->pop (); }
7215 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
7216 tsubst_flags_t complain
)
7221 /* See through clones. */
7222 fn
= DECL_ORIGIN (fn
);
7223 /* And inheriting ctors. */
7224 if (flag_new_inheriting_ctors
)
7225 fn
= strip_inheriting_ctors (fn
);
7227 /* Detect recursion. */
7228 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
7231 if (complain
& tf_error
)
7232 error ("recursive evaluation of default argument for %q#D", fn
);
7233 return error_mark_node
;
7236 /* If the ARG is an unparsed default argument expression, the
7237 conversion cannot be performed. */
7238 if (TREE_CODE (arg
) == DEFAULT_ARG
)
7240 if (complain
& tf_error
)
7241 error ("call to %qD uses the default argument for parameter %P, which "
7242 "is not yet defined", fn
, parmnum
);
7243 return error_mark_node
;
7246 push_defarg_context (fn
);
7248 if (fn
&& DECL_TEMPLATE_INFO (fn
))
7249 arg
= tsubst_default_argument (fn
, type
, arg
, complain
);
7255 The names in the expression are bound, and the semantic
7256 constraints are checked, at the point where the default
7257 expressions appears.
7259 we must not perform access checks here. */
7260 push_deferring_access_checks (dk_no_check
);
7261 /* We must make a copy of ARG, in case subsequent processing
7262 alters any part of it. */
7263 arg
= break_out_target_exprs (arg
);
7264 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
7265 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
7267 arg
= convert_for_arg_passing (type
, arg
, complain
);
7268 pop_deferring_access_checks();
7270 pop_defarg_context ();
7275 /* Returns the type which will really be used for passing an argument of
7279 type_passed_as (tree type
)
7281 /* Pass classes with copy ctors by invisible reference. */
7282 if (TREE_ADDRESSABLE (type
))
7284 type
= build_reference_type (type
);
7285 /* There are no other pointers to this temporary. */
7286 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
7288 else if (targetm
.calls
.promote_prototypes (type
)
7289 && INTEGRAL_TYPE_P (type
)
7290 && COMPLETE_TYPE_P (type
)
7291 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7292 type
= integer_type_node
;
7297 /* Actually perform the appropriate conversion. */
7300 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
7304 /* If VAL is a bitfield, then -- since it has already been converted
7305 to TYPE -- it cannot have a precision greater than TYPE.
7307 If it has a smaller precision, we must widen it here. For
7308 example, passing "int f:3;" to a function expecting an "int" will
7309 not result in any conversion before this point.
7311 If the precision is the same we must not risk widening. For
7312 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7313 often have type "int", even though the C++ type for the field is
7314 "long long". If the value is being passed to a function
7315 expecting an "int", then no conversions will be required. But,
7316 if we call convert_bitfield_to_declared_type, the bitfield will
7317 be converted to "long long". */
7318 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
7320 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
7321 val
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
), val
);
7323 if (val
== error_mark_node
)
7325 /* Pass classes with copy ctors by invisible reference. */
7326 else if (TREE_ADDRESSABLE (type
))
7327 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
7328 else if (targetm
.calls
.promote_prototypes (type
)
7329 && INTEGRAL_TYPE_P (type
)
7330 && COMPLETE_TYPE_P (type
)
7331 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7332 val
= cp_perform_integral_promotions (val
, complain
);
7333 if (complain
& tf_warning
)
7335 if (warn_suggest_attribute_format
)
7337 tree rhstype
= TREE_TYPE (val
);
7338 const enum tree_code coder
= TREE_CODE (rhstype
);
7339 const enum tree_code codel
= TREE_CODE (type
);
7340 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7342 && check_missing_format_attribute (type
, rhstype
))
7343 warning (OPT_Wsuggest_attribute_format
,
7344 "argument of function call might be a candidate "
7345 "for a format attribute");
7347 maybe_warn_parm_abi (type
, EXPR_LOC_OR_LOC (val
, input_location
));
7352 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7353 which just decay_conversion or no conversions at all should be done.
7354 This is true for some builtins which don't act like normal functions.
7355 Return 2 if no conversions at all should be done, 1 if just
7356 decay_conversion. Return 3 for special treatment of the 3rd argument
7357 for __builtin_*_overflow_p. */
7360 magic_varargs_p (tree fn
)
7362 if (flag_cilkplus
&& is_cilkplus_reduce_builtin (fn
) != BUILT_IN_NONE
)
7365 if (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
7366 switch (DECL_FUNCTION_CODE (fn
))
7368 case BUILT_IN_CLASSIFY_TYPE
:
7369 case BUILT_IN_CONSTANT_P
:
7370 case BUILT_IN_NEXT_ARG
:
7371 case BUILT_IN_VA_START
:
7374 case BUILT_IN_ADD_OVERFLOW_P
:
7375 case BUILT_IN_SUB_OVERFLOW_P
:
7376 case BUILT_IN_MUL_OVERFLOW_P
:
7380 return lookup_attribute ("type generic",
7381 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
7387 /* Returns the decl of the dispatcher function if FN is a function version. */
7390 get_function_version_dispatcher (tree fn
)
7392 tree dispatcher_decl
= NULL
;
7394 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7395 && DECL_FUNCTION_VERSIONED (fn
));
7397 gcc_assert (targetm
.get_function_versions_dispatcher
);
7398 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
7400 if (dispatcher_decl
== NULL
)
7402 error_at (input_location
, "use of multiversioned function "
7403 "without a default");
7407 retrofit_lang_decl (dispatcher_decl
);
7408 gcc_assert (dispatcher_decl
!= NULL
);
7409 return dispatcher_decl
;
7412 /* fn is a function version dispatcher that is marked used. Mark all the
7413 semantically identical function versions it will dispatch as used. */
7416 mark_versions_used (tree fn
)
7418 struct cgraph_node
*node
;
7419 struct cgraph_function_version_info
*node_v
;
7420 struct cgraph_function_version_info
*it_v
;
7422 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7424 node
= cgraph_node::get (fn
);
7428 gcc_assert (node
->dispatcher_function
);
7430 node_v
= node
->function_version ();
7434 /* All semantically identical versions are chained. Traverse and mark each
7435 one of them as used. */
7436 it_v
= node_v
->next
;
7437 while (it_v
!= NULL
)
7439 mark_used (it_v
->this_node
->decl
);
7444 /* Build a call to "the copy constructor" for the type of A, even if it
7445 wouldn't be selected by normal overload resolution. Used for
7449 call_copy_ctor (tree a
, tsubst_flags_t complain
)
7451 tree ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (a
));
7452 tree binfo
= TYPE_BINFO (ctype
);
7453 tree copy
= get_copy_ctor (ctype
, complain
);
7454 copy
= build_baselink (binfo
, binfo
, copy
, NULL_TREE
);
7455 tree ob
= build_dummy_object (ctype
);
7456 vec
<tree
, va_gc
>* args
= make_tree_vector_single (a
);
7457 tree r
= build_new_method_call (ob
, copy
, &args
, NULL_TREE
,
7458 LOOKUP_NORMAL
, NULL
, complain
);
7459 release_tree_vector (args
);
7463 /* Return true iff T refers to a base field. */
7466 is_base_field_ref (tree t
)
7469 if (TREE_CODE (t
) == ADDR_EXPR
)
7470 t
= TREE_OPERAND (t
, 0);
7471 if (TREE_CODE (t
) == COMPONENT_REF
)
7472 t
= TREE_OPERAND (t
, 1);
7473 if (TREE_CODE (t
) == FIELD_DECL
)
7474 return DECL_FIELD_IS_BASE (t
);
7478 /* We can't elide a copy from a function returning by value to a base
7479 subobject, as the callee might clobber tail padding. Return true iff this
7480 could be that case. */
7483 unsafe_copy_elision_p (tree target
, tree exp
)
7485 /* Copy elision only happens with a TARGET_EXPR. */
7486 if (TREE_CODE (exp
) != TARGET_EXPR
)
7488 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
7489 /* It's safe to elide the copy for a class with no tail padding. */
7490 if (tree_int_cst_equal (TYPE_SIZE (type
), CLASSTYPE_SIZE (type
)))
7492 /* It's safe to elide the copy if we aren't initializing a base object. */
7493 if (!is_base_field_ref (target
))
7495 tree init
= TARGET_EXPR_INITIAL (exp
);
7496 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7497 while (TREE_CODE (init
) == COMPOUND_EXPR
)
7498 init
= TREE_OPERAND (init
, 1);
7499 return (TREE_CODE (init
) == AGGR_INIT_EXPR
7500 && !AGGR_INIT_VIA_CTOR_P (init
));
7503 /* Subroutine of the various build_*_call functions. Overload resolution
7504 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7505 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7506 bitmask of various LOOKUP_* flags which apply to the call itself. */
7509 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
7512 const vec
<tree
, va_gc
> *args
= cand
->args
;
7513 tree first_arg
= cand
->first_arg
;
7514 conversion
**convs
= cand
->convs
;
7516 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
7521 unsigned int arg_index
= 0;
7525 bool already_used
= false;
7527 /* In a template, there is no need to perform all of the work that
7528 is normally done. We are only interested in the type of the call
7529 expression, i.e., the return type of the function. Any semantic
7530 errors will be deferred until the template is instantiated. */
7531 if (processing_template_decl
)
7535 const tree
*argarray
;
7538 return_type
= TREE_TYPE (TREE_TYPE (fn
));
7539 nargs
= vec_safe_length (args
);
7540 if (first_arg
== NULL_TREE
)
7541 argarray
= args
->address ();
7549 alcarray
= XALLOCAVEC (tree
, nargs
);
7550 alcarray
[0] = build_this (first_arg
);
7551 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
7552 alcarray
[ix
+ 1] = arg
;
7553 argarray
= alcarray
;
7556 addr
= build_addr_func (fn
, complain
);
7557 if (addr
== error_mark_node
)
7558 return error_mark_node
;
7559 expr
= build_call_array_loc (input_location
, return_type
,
7560 addr
, nargs
, argarray
);
7561 if (TREE_THIS_VOLATILE (fn
) && cfun
)
7562 current_function_returns_abnormally
= 1;
7563 return convert_from_reference (expr
);
7566 /* Give any warnings we noticed during overload resolution. */
7567 if (cand
->warnings
&& (complain
& tf_warning
))
7569 struct candidate_warning
*w
;
7570 for (w
= cand
->warnings
; w
; w
= w
->next
)
7571 joust (cand
, w
->loser
, 1, complain
);
7574 /* OK, we're actually calling this inherited constructor; set its deletedness
7575 appropriately. We can get away with doing this here because calling is
7576 the only way to refer to a constructor. */
7577 if (DECL_INHERITED_CTOR (fn
))
7578 deduce_inheriting_ctor (fn
);
7580 /* Make =delete work with SFINAE. */
7581 if (DECL_DELETED_FN (fn
) && !(complain
& tf_error
))
7582 return error_mark_node
;
7584 if (DECL_FUNCTION_MEMBER_P (fn
))
7587 /* If FN is a template function, two cases must be considered.
7592 template <class T> void f();
7594 template <class T> struct B {
7598 struct C : A, B<int> {
7600 using B<int>::g; // #2
7603 In case #1 where `A::f' is a member template, DECL_ACCESS is
7604 recorded in the primary template but not in its specialization.
7605 We check access of FN using its primary template.
7607 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7608 because it is a member of class template B, DECL_ACCESS is
7609 recorded in the specialization `B<int>::g'. We cannot use its
7610 primary template because `B<T>::g' and `B<int>::g' may have
7611 different access. */
7612 if (DECL_TEMPLATE_INFO (fn
)
7613 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
7614 access_fn
= DECL_TI_TEMPLATE (fn
);
7617 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
7619 return error_mark_node
;
7622 /* If we're checking for implicit delete, don't bother with argument
7624 if (flags
& LOOKUP_SPECULATIVE
)
7626 if (DECL_DELETED_FN (fn
))
7628 if (complain
& tf_error
)
7630 return error_mark_node
;
7632 if (cand
->viable
== 1)
7634 else if (!(complain
& tf_error
))
7635 /* Reject bad conversions now. */
7636 return error_mark_node
;
7637 /* else continue to get conversion error. */
7640 /* N3276 magic doesn't apply to nested calls. */
7641 int decltype_flag
= (complain
& tf_decltype
);
7642 complain
&= ~tf_decltype
;
7644 /* Find maximum size of vector to hold converted arguments. */
7645 parmlen
= list_length (parm
);
7646 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
7647 if (parmlen
> nargs
)
7649 argarray
= XALLOCAVEC (tree
, nargs
);
7651 /* The implicit parameters to a constructor are not considered by overload
7652 resolution, and must be of the proper type. */
7653 if (DECL_CONSTRUCTOR_P (fn
))
7656 if (first_arg
!= NULL_TREE
)
7658 object_arg
= first_arg
;
7659 first_arg
= NULL_TREE
;
7663 object_arg
= (*args
)[arg_index
];
7666 argarray
[j
++] = build_this (object_arg
);
7667 parm
= TREE_CHAIN (parm
);
7668 /* We should never try to call the abstract constructor. */
7669 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
7671 if (DECL_HAS_VTT_PARM_P (fn
))
7673 argarray
[j
++] = (*args
)[arg_index
];
7675 parm
= TREE_CHAIN (parm
);
7678 /* Bypass access control for 'this' parameter. */
7679 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7681 tree parmtype
= TREE_VALUE (parm
);
7682 tree arg
= build_this (first_arg
!= NULL_TREE
7684 : (*args
)[arg_index
]);
7685 tree argtype
= TREE_TYPE (arg
);
7689 if (convs
[i
]->bad_p
)
7691 if (complain
& tf_error
)
7693 if (permerror (input_location
, "passing %qT as %<this%> "
7694 "argument discards qualifiers",
7695 TREE_TYPE (argtype
)))
7696 inform (DECL_SOURCE_LOCATION (fn
), " in call to %qD", fn
);
7699 return error_mark_node
;
7702 /* See if the function member or the whole class type is declared
7703 final and the call can be devirtualized. */
7704 if (DECL_FINAL_P (fn
)
7705 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
7706 flags
|= LOOKUP_NONVIRTUAL
;
7708 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
7709 X is called for an object that is not of type X, or of a type
7710 derived from X, the behavior is undefined.
7712 So we can assume that anything passed as 'this' is non-null, and
7713 optimize accordingly. */
7714 gcc_assert (TYPE_PTR_P (parmtype
));
7715 /* Convert to the base in which the function was declared. */
7716 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
7717 converted_arg
= build_base_path (PLUS_EXPR
,
7719 cand
->conversion_path
,
7721 /* Check that the base class is accessible. */
7722 if (!accessible_base_p (TREE_TYPE (argtype
),
7723 BINFO_TYPE (cand
->conversion_path
), true))
7725 if (complain
& tf_error
)
7726 error ("%qT is not an accessible base of %qT",
7727 BINFO_TYPE (cand
->conversion_path
),
7728 TREE_TYPE (argtype
));
7730 return error_mark_node
;
7732 /* If fn was found by a using declaration, the conversion path
7733 will be to the derived class, not the base declaring fn. We
7734 must convert from derived to base. */
7735 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
7736 TREE_TYPE (parmtype
), ba_unique
,
7738 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
7739 base_binfo
, 1, complain
);
7741 argarray
[j
++] = converted_arg
;
7742 parm
= TREE_CHAIN (parm
);
7743 if (first_arg
!= NULL_TREE
)
7744 first_arg
= NULL_TREE
;
7751 gcc_assert (first_arg
== NULL_TREE
);
7752 for (; arg_index
< vec_safe_length (args
) && parm
;
7753 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
7755 tree type
= TREE_VALUE (parm
);
7756 tree arg
= (*args
)[arg_index
];
7757 bool conversion_warning
= true;
7761 /* If the argument is NULL and used to (implicitly) instantiate a
7762 template function (and bind one of the template arguments to
7763 the type of 'long int'), we don't want to warn about passing NULL
7764 to non-pointer argument.
7765 For example, if we have this template function:
7767 template<typename T> void func(T x) {}
7769 we want to warn (when -Wconversion is enabled) in this case:
7775 but not in this case:
7781 if (arg
== null_node
7782 && DECL_TEMPLATE_INFO (fn
)
7783 && cand
->template_decl
7784 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
7785 conversion_warning
= false;
7787 /* Warn about initializer_list deduction that isn't currently in the
7789 if (cxx_dialect
> cxx98
7790 && flag_deduce_init_list
7791 && cand
->template_decl
7792 && is_std_init_list (non_reference (type
))
7793 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
7795 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
7796 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
7797 tree patparm
= get_pattern_parm (realparm
, tmpl
);
7798 tree pattype
= TREE_TYPE (patparm
);
7799 if (PACK_EXPANSION_P (pattype
))
7800 pattype
= PACK_EXPANSION_PATTERN (pattype
);
7801 pattype
= non_reference (pattype
);
7803 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
7804 && (cand
->explicit_targs
== NULL_TREE
7805 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
7806 <= TEMPLATE_TYPE_IDX (pattype
))))
7808 pedwarn (input_location
, 0, "deducing %qT as %qT",
7809 non_reference (TREE_TYPE (patparm
)),
7810 non_reference (type
));
7811 pedwarn (DECL_SOURCE_LOCATION (cand
->fn
), 0,
7812 " in call to %qD", cand
->fn
);
7813 pedwarn (input_location
, 0,
7814 " (you can disable this with -fno-deduce-init-list)");
7818 /* Set user_conv_p on the argument conversions, so rvalue/base handling
7819 knows not to allow any more UDCs. This needs to happen after we
7820 process cand->warnings. */
7821 if (flags
& LOOKUP_NO_CONVERSION
)
7822 conv
->user_conv_p
= true;
7824 tsubst_flags_t arg_complain
= complain
& (~tf_no_cleanup
);
7825 if (!conversion_warning
)
7826 arg_complain
&= ~tf_warning
;
7828 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
7830 val
= convert_for_arg_passing (type
, val
, arg_complain
);
7832 if (val
== error_mark_node
)
7833 return error_mark_node
;
7835 argarray
[j
++] = val
;
7838 /* Default arguments */
7839 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
7841 if (TREE_VALUE (parm
) == error_mark_node
)
7842 return error_mark_node
;
7843 argarray
[j
++] = convert_default_arg (TREE_VALUE (parm
),
7844 TREE_PURPOSE (parm
),
7850 int magic
= magic_varargs_p (fn
);
7851 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
7853 tree a
= (*args
)[arg_index
];
7854 if ((magic
== 3 && arg_index
== 2) || magic
== 2)
7856 /* Do no conversions for certain magic varargs. */
7857 a
= mark_type_use (a
);
7858 if (TREE_CODE (a
) == FUNCTION_DECL
&& reject_gcc_builtin (a
))
7859 return error_mark_node
;
7861 else if (magic
!= 0)
7862 /* For other magic varargs only do decay_conversion. */
7863 a
= decay_conversion (a
, complain
);
7864 else if (DECL_CONSTRUCTOR_P (fn
)
7865 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn
),
7868 /* Avoid infinite recursion trying to call A(...). */
7869 if (complain
& tf_error
)
7870 /* Try to call the actual copy constructor for a good error. */
7871 call_copy_ctor (a
, complain
);
7872 return error_mark_node
;
7875 a
= convert_arg_to_ellipsis (a
, complain
);
7876 if (a
== error_mark_node
)
7877 return error_mark_node
;
7881 gcc_assert (j
<= nargs
);
7884 /* Avoid to do argument-transformation, if warnings for format, and for
7885 nonnull are disabled. Just in case that at least one of them is active
7886 the check_function_arguments function might warn about something. */
7888 bool warned_p
= false;
7891 || warn_suggest_attribute_format
7894 tree
*fargs
= (!nargs
? argarray
7895 : (tree
*) alloca (nargs
* sizeof (tree
)));
7896 for (j
= 0; j
< nargs
; j
++)
7897 fargs
[j
] = maybe_constant_value (argarray
[j
]);
7899 warned_p
= check_function_arguments (input_location
, fn
, TREE_TYPE (fn
),
7903 if (DECL_INHERITED_CTOR (fn
))
7905 /* Check for passing ellipsis arguments to an inherited constructor. We
7906 could handle this by open-coding the inherited constructor rather than
7907 defining it, but let's not bother now. */
7908 if (!cp_unevaluated_operand
7910 && cand
->convs
[cand
->num_convs
-1]->ellipsis_p
)
7912 if (complain
& tf_error
)
7914 sorry ("passing arguments to ellipsis of inherited constructor "
7916 inform (DECL_SOURCE_LOCATION (cand
->fn
), "declared here");
7918 return error_mark_node
;
7921 /* A base constructor inheriting from a virtual base doesn't get the
7922 inherited arguments, just this and __vtt. */
7923 if (ctor_omit_inherited_parms (fn
))
7927 /* Avoid actually calling copy constructors and copy assignment operators,
7930 if (! flag_elide_constructors
)
7931 /* Do things the hard way. */;
7932 else if (cand
->num_convs
== 1
7933 && (DECL_COPY_CONSTRUCTOR_P (fn
)
7934 || DECL_MOVE_CONSTRUCTOR_P (fn
))
7935 /* It's unsafe to elide the constructor when handling
7936 a noexcept-expression, it may evaluate to the wrong
7937 value (c++/53025). */
7938 && cp_noexcept_operand
== 0)
7941 tree arg
= argarray
[num_artificial_parms_for (fn
)];
7943 bool trivial
= trivial_fn_p (fn
);
7945 /* Pull out the real argument, disregarding const-correctness. */
7947 /* Strip the reference binding for the constructor parameter. */
7948 if (CONVERT_EXPR_P (targ
)
7949 && TREE_CODE (TREE_TYPE (targ
)) == REFERENCE_TYPE
)
7950 targ
= TREE_OPERAND (targ
, 0);
7951 /* But don't strip any other reference bindings; binding a temporary to a
7952 reference prevents copy elision. */
7953 while ((CONVERT_EXPR_P (targ
)
7954 && TREE_CODE (TREE_TYPE (targ
)) != REFERENCE_TYPE
)
7955 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
7956 targ
= TREE_OPERAND (targ
, 0);
7957 if (TREE_CODE (targ
) == ADDR_EXPR
)
7959 targ
= TREE_OPERAND (targ
, 0);
7960 if (!same_type_ignoring_top_level_qualifiers_p
7961 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
7970 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
7972 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
7974 if (CHECKING_P
&& cxx_dialect
>= cxx1z
)
7975 gcc_assert (TREE_CODE (arg
) != TARGET_EXPR
7977 /* See unsafe_copy_elision_p. */
7978 || DECL_BASE_CONSTRUCTOR_P (fn
));
7980 /* [class.copy]: the copy constructor is implicitly defined even if
7981 the implementation elided its use. */
7982 if (!trivial
|| DECL_DELETED_FN (fn
))
7984 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
7985 return error_mark_node
;
7986 already_used
= true;
7989 /* If we're creating a temp and we already have one, don't create a
7990 new one. If we're not creating a temp but we get one, use
7991 INIT_EXPR to collapse the temp into our target. Otherwise, if the
7992 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
7993 temp or an INIT_EXPR otherwise. */
7995 if (is_dummy_object (fa
))
7997 if (TREE_CODE (arg
) == TARGET_EXPR
)
8000 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
8002 else if ((trivial
|| TREE_CODE (arg
) == TARGET_EXPR
)
8003 && !unsafe_copy_elision_p (fa
, arg
))
8005 tree to
= cp_stabilize_reference (cp_build_indirect_ref (fa
,
8009 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
8013 else if (DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
8014 && trivial_fn_p (fn
)
8015 && !DECL_DELETED_FN (fn
))
8017 tree to
= cp_stabilize_reference
8018 (cp_build_indirect_ref (argarray
[0], RO_NULL
, complain
));
8019 tree type
= TREE_TYPE (to
);
8020 tree as_base
= CLASSTYPE_AS_BASE (type
);
8021 tree arg
= argarray
[1];
8023 if (is_really_empty_class (type
))
8025 /* Avoid copying empty classes. */
8026 val
= build2 (COMPOUND_EXPR
, type
, arg
, to
);
8027 TREE_NO_WARNING (val
) = 1;
8029 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
8031 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
8032 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
8033 /* Handle NSDMI that refer to the object being initialized. */
8034 replace_placeholders (arg
, to
);
8038 /* We must only copy the non-tail padding parts. */
8040 tree array_type
, alias_set
;
8042 arg2
= TYPE_SIZE_UNIT (as_base
);
8043 arg0
= cp_build_addr_expr (to
, complain
);
8045 array_type
= build_array_type (unsigned_char_type_node
,
8047 (size_binop (MINUS_EXPR
,
8048 arg2
, size_int (1))));
8049 alias_set
= build_int_cst (build_pointer_type (type
), 0);
8050 t
= build2 (MODIFY_EXPR
, void_type_node
,
8051 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
8052 build2 (MEM_REF
, array_type
, arg
, alias_set
));
8053 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
8054 TREE_NO_WARNING (val
) = 1;
8059 else if (!DECL_DELETED_FN (fn
)
8060 && trivial_fn_p (fn
))
8062 if (DECL_DESTRUCTOR_P (fn
))
8063 return fold_convert (void_type_node
, argarray
[0]);
8064 else if (default_ctor_p (fn
))
8066 if (is_dummy_object (argarray
[0]))
8067 return force_target_expr (DECL_CONTEXT (fn
), void_node
, complain
);
8069 return cp_build_indirect_ref (argarray
[0], RO_NULL
, complain
);
8073 /* For calls to a multi-versioned function, overload resolution
8074 returns the function with the highest target priority, that is,
8075 the version that will checked for dispatching first. If this
8076 version is inlinable, a direct call to this version can be made
8077 otherwise the call should go through the dispatcher. */
8079 if (DECL_FUNCTION_VERSIONED (fn
)
8080 && (current_function_decl
== NULL
8081 || !targetm
.target_option
.can_inline_p (current_function_decl
, fn
)))
8083 fn
= get_function_version_dispatcher (fn
);
8087 mark_versions_used (fn
);
8091 && !mark_used (fn
, complain
))
8092 return error_mark_node
;
8094 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0
8095 /* Don't mess with virtual lookup in instantiate_non_dependent_expr;
8096 virtual functions can't be constexpr. */
8097 && !in_template_function ())
8100 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
8102 ba_any
, NULL
, complain
);
8103 gcc_assert (binfo
&& binfo
!= error_mark_node
);
8105 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
8107 if (TREE_SIDE_EFFECTS (argarray
[0]))
8108 argarray
[0] = save_expr (argarray
[0]);
8109 t
= build_pointer_type (TREE_TYPE (fn
));
8110 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
8115 fn
= build_addr_func (fn
, complain
);
8116 if (fn
== error_mark_node
)
8117 return error_mark_node
;
8120 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
8121 if (call
== error_mark_node
)
8123 if (cand
->flags
& LOOKUP_LIST_INIT_CTOR
)
8125 tree c
= extract_call_expr (call
);
8126 /* build_new_op_1 will clear this when appropriate. */
8127 CALL_EXPR_ORDERED_ARGS (c
) = true;
8131 tree c
= extract_call_expr (call
);
8132 if (TREE_CODE (c
) == CALL_EXPR
)
8133 TREE_NO_WARNING (c
) = 1;
8138 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
8139 This function performs no overload resolution, conversion, or other
8140 high-level operations. */
8143 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
8144 tsubst_flags_t complain
)
8148 /* Remember roughly where this call is. */
8149 location_t loc
= EXPR_LOC_OR_LOC (fn
, input_location
);
8150 fn
= build_call_a (fn
, nargs
, argarray
);
8151 SET_EXPR_LOCATION (fn
, loc
);
8153 fndecl
= get_callee_fndecl (fn
);
8155 /* Check that arguments to builtin functions match the expectations. */
8157 && DECL_BUILT_IN (fndecl
)
8158 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
8162 /* We need to take care that values to BUILT_IN_NORMAL
8164 for (i
= 0; i
< nargs
; i
++)
8165 argarray
[i
] = fold_non_dependent_expr (argarray
[i
]);
8167 if (!check_builtin_function_arguments (EXPR_LOCATION (fn
), vNULL
, fndecl
,
8169 return error_mark_node
;
8172 /* If it is a built-in array notation function, then the return type of
8173 the function is the element type of the array passed in as array
8174 notation (i.e. the first parameter of the function). */
8175 if (flag_cilkplus
&& TREE_CODE (fn
) == CALL_EXPR
)
8177 enum built_in_function bif
=
8178 is_cilkplus_reduce_builtin (CALL_EXPR_FN (fn
));
8179 if (bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_ADD
8180 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MUL
8181 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MAX
8182 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MIN
8183 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE
8184 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MUTATING
)
8186 if (call_expr_nargs (fn
) == 0)
8188 error_at (EXPR_LOCATION (fn
), "Invalid builtin arguments");
8189 return error_mark_node
;
8191 /* for bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_ZERO or
8192 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_ZERO or
8193 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_NONZERO or
8194 BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_NONZERO or
8195 BUILT_IN_CILKPLUS_SEC_REDUCE_MIN_IND or
8196 BUILT_IN_CILKPLUS_SEC_REDUCE_MAX_IND
8197 The pre-defined return-type is the correct one. */
8198 tree array_ntn
= CALL_EXPR_ARG (fn
, 0);
8199 TREE_TYPE (fn
) = TREE_TYPE (array_ntn
);
8204 if (VOID_TYPE_P (TREE_TYPE (fn
)))
8207 /* 5.2.2/11: If a function call is a prvalue of object type: if the
8208 function call is either the operand of a decltype-specifier or the
8209 right operand of a comma operator that is the operand of a
8210 decltype-specifier, a temporary object is not introduced for the
8211 prvalue. The type of the prvalue may be incomplete. */
8212 if (!(complain
& tf_decltype
))
8214 fn
= require_complete_type_sfinae (fn
, complain
);
8215 if (fn
== error_mark_node
)
8216 return error_mark_node
;
8218 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
8220 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
8221 maybe_warn_parm_abi (TREE_TYPE (fn
), loc
);
8224 return convert_from_reference (fn
);
8227 /* Returns the value to use for the in-charge parameter when making a
8228 call to a function with the indicated NAME.
8230 FIXME:Can't we find a neater way to do this mapping? */
8233 in_charge_arg_for_name (tree name
)
8235 if (name
== base_ctor_identifier
8236 || name
== base_dtor_identifier
)
8237 return integer_zero_node
;
8238 else if (name
== complete_ctor_identifier
)
8239 return integer_one_node
;
8240 else if (name
== complete_dtor_identifier
)
8241 return integer_two_node
;
8242 else if (name
== deleting_dtor_identifier
)
8243 return integer_three_node
;
8245 /* This function should only be called with one of the names listed
8251 /* We've built up a constructor call RET. Complain if it delegates to the
8252 constructor we're currently compiling. */
8255 check_self_delegation (tree ret
)
8257 if (TREE_CODE (ret
) == TARGET_EXPR
)
8258 ret
= TARGET_EXPR_INITIAL (ret
);
8259 tree fn
= cp_get_callee_fndecl (ret
);
8260 if (fn
&& DECL_ABSTRACT_ORIGIN (fn
) == current_function_decl
)
8261 error ("constructor delegates to itself");
8264 /* Build a call to a constructor, destructor, or an assignment
8265 operator for INSTANCE, an expression with class type. NAME
8266 indicates the special member function to call; *ARGS are the
8267 arguments. ARGS may be NULL. This may change ARGS. BINFO
8268 indicates the base of INSTANCE that is to be passed as the `this'
8269 parameter to the member function called.
8271 FLAGS are the LOOKUP_* flags to use when processing the call.
8273 If NAME indicates a complete object constructor, INSTANCE may be
8274 NULL_TREE. In this case, the caller will call build_cplus_new to
8275 store the newly constructed object into a VAR_DECL. */
8278 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
8279 tree binfo
, int flags
, tsubst_flags_t complain
)
8282 /* The type of the subobject to be constructed or destroyed. */
8284 vec
<tree
, va_gc
> *allocated
= NULL
;
8287 gcc_assert (name
== complete_ctor_identifier
8288 || name
== base_ctor_identifier
8289 || name
== complete_dtor_identifier
8290 || name
== base_dtor_identifier
8291 || name
== deleting_dtor_identifier
8292 || name
== cp_assignment_operator_id (NOP_EXPR
));
8295 /* Resolve the name. */
8296 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
8297 return error_mark_node
;
8299 binfo
= TYPE_BINFO (binfo
);
8302 gcc_assert (binfo
!= NULL_TREE
);
8304 class_type
= BINFO_TYPE (binfo
);
8306 /* Handle the special case where INSTANCE is NULL_TREE. */
8307 if (name
== complete_ctor_identifier
&& !instance
)
8308 instance
= build_dummy_object (class_type
);
8311 if (name
== complete_dtor_identifier
8312 || name
== base_dtor_identifier
8313 || name
== deleting_dtor_identifier
)
8314 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
8316 /* Convert to the base class, if necessary. */
8317 if (!same_type_ignoring_top_level_qualifiers_p
8318 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
8320 if (name
!= cp_assignment_operator_id (NOP_EXPR
))
8321 /* For constructors and destructors, either the base is
8322 non-virtual, or it is virtual but we are doing the
8323 conversion from a constructor or destructor for the
8324 complete object. In either case, we can convert
8326 instance
= convert_to_base_statically (instance
, binfo
);
8328 /* However, for assignment operators, we must convert
8329 dynamically if the base is virtual. */
8330 instance
= build_base_path (PLUS_EXPR
, instance
,
8331 binfo
, /*nonnull=*/1, complain
);
8335 gcc_assert (instance
!= NULL_TREE
);
8337 /* In C++17, "If the initializer expression is a prvalue and the
8338 cv-unqualified version of the source type is the same class as the class
8339 of the destination, the initializer expression is used to initialize the
8340 destination object." Handle that here to avoid doing overload
8342 if (cxx_dialect
>= cxx1z
8343 && args
&& vec_safe_length (*args
) == 1
8344 && name
== complete_ctor_identifier
)
8346 tree arg
= (**args
)[0];
8348 /* FIXME P0135 doesn't say how to handle direct initialization from a
8349 type with a suitable conversion operator. Let's handle it like
8350 copy-initialization, but allowing explict conversions. */
8351 tsubst_flags_t sub_complain
= tf_warning
;
8352 if (!is_dummy_object (instance
))
8353 /* If we're using this to initialize a non-temporary object, don't
8354 require the destructor to be accessible. */
8355 sub_complain
|= tf_no_cleanup
;
8356 if (!reference_related_p (class_type
, TREE_TYPE (arg
)))
8357 arg
= perform_implicit_conversion_flags (class_type
, arg
,
8360 if ((TREE_CODE (arg
) == TARGET_EXPR
8361 || TREE_CODE (arg
) == CONSTRUCTOR
)
8362 && (same_type_ignoring_top_level_qualifiers_p
8363 (class_type
, TREE_TYPE (arg
))))
8365 if (is_dummy_object (instance
))
8367 if ((complain
& tf_error
)
8368 && (flags
& LOOKUP_DELEGATING_CONS
))
8369 check_self_delegation (arg
);
8370 /* Avoid change of behavior on Wunused-var-2.C. */
8371 mark_lvalue_use (instance
);
8372 return build2 (INIT_EXPR
, class_type
, instance
, arg
);
8376 fns
= lookup_fnfields (binfo
, name
, 1);
8378 /* When making a call to a constructor or destructor for a subobject
8379 that uses virtual base classes, pass down a pointer to a VTT for
8381 if ((name
== base_ctor_identifier
8382 || name
== base_dtor_identifier
)
8383 && CLASSTYPE_VBASECLASSES (class_type
))
8388 /* If the current function is a complete object constructor
8389 or destructor, then we fetch the VTT directly.
8390 Otherwise, we look it up using the VTT we were given. */
8391 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
8392 vtt
= decay_conversion (vtt
, complain
);
8393 if (vtt
== error_mark_node
)
8394 return error_mark_node
;
8395 vtt
= build_if_in_charge (vtt
, current_vtt_parm
);
8396 if (BINFO_SUBVTT_INDEX (binfo
))
8397 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
8403 allocated
= make_tree_vector ();
8407 vec_safe_insert (*args
, 0, sub_vtt
);
8410 ret
= build_new_method_call (instance
, fns
, args
,
8411 TYPE_BINFO (BINFO_TYPE (binfo
)),
8415 if (allocated
!= NULL
)
8416 release_tree_vector (allocated
);
8418 if ((complain
& tf_error
)
8419 && (flags
& LOOKUP_DELEGATING_CONS
)
8420 && name
== complete_ctor_identifier
)
8421 check_self_delegation (ret
);
8426 /* Return the NAME, as a C string. The NAME indicates a function that
8427 is a member of TYPE. *FREE_P is set to true if the caller must
8428 free the memory returned.
8430 Rather than go through all of this, we should simply set the names
8431 of constructors and destructors appropriately, and dispense with
8432 ctor_identifier, dtor_identifier, etc. */
8435 name_as_c_string (tree name
, tree type
, bool *free_p
)
8439 /* Assume that we will not allocate memory. */
8441 /* Constructors and destructors are special. */
8442 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
8445 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
))));
8446 /* For a destructor, add the '~'. */
8447 if (name
== complete_dtor_identifier
8448 || name
== base_dtor_identifier
8449 || name
== deleting_dtor_identifier
)
8451 pretty_name
= concat ("~", pretty_name
, NULL
);
8452 /* Remember that we need to free the memory allocated. */
8456 else if (IDENTIFIER_TYPENAME_P (name
))
8458 pretty_name
= concat ("operator ",
8459 type_as_string_translate (TREE_TYPE (name
),
8460 TFF_PLAIN_IDENTIFIER
),
8462 /* Remember that we need to free the memory allocated. */
8466 pretty_name
= CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name
)));
8471 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
8472 be set, upon return, to the function called. ARGS may be NULL.
8473 This may change ARGS. */
8476 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
8477 tree conversion_path
, int flags
,
8478 tree
*fn_p
, tsubst_flags_t complain
)
8480 struct z_candidate
*candidates
= 0, *cand
;
8481 tree explicit_targs
= NULL_TREE
;
8482 tree basetype
= NULL_TREE
;
8483 tree access_binfo
, binfo
;
8485 tree first_mem_arg
= NULL_TREE
;
8487 bool skip_first_for_error
;
8488 vec
<tree
, va_gc
> *user_args
;
8491 int template_only
= 0;
8495 vec
<tree
, va_gc
> *orig_args
= NULL
;
8498 gcc_assert (instance
!= NULL_TREE
);
8500 /* We don't know what function we're going to call, yet. */
8504 if (error_operand_p (instance
)
8505 || !fns
|| error_operand_p (fns
))
8506 return error_mark_node
;
8508 if (!BASELINK_P (fns
))
8510 if (complain
& tf_error
)
8511 error ("call to non-function %qD", fns
);
8512 return error_mark_node
;
8515 orig_instance
= instance
;
8518 /* Dismantle the baselink to collect all the information we need. */
8519 if (!conversion_path
)
8520 conversion_path
= BASELINK_BINFO (fns
);
8521 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
8522 binfo
= BASELINK_BINFO (fns
);
8523 optype
= BASELINK_OPTYPE (fns
);
8524 fns
= BASELINK_FUNCTIONS (fns
);
8525 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
8527 explicit_targs
= TREE_OPERAND (fns
, 1);
8528 fns
= TREE_OPERAND (fns
, 0);
8531 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
8532 || TREE_CODE (fns
) == TEMPLATE_DECL
8533 || TREE_CODE (fns
) == OVERLOAD
);
8534 fn
= OVL_FIRST (fns
);
8535 name
= DECL_NAME (fn
);
8537 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
8538 gcc_assert (CLASS_TYPE_P (basetype
));
8540 if (processing_template_decl
)
8542 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
8543 instance
= build_non_dependent_expr (instance
);
8545 make_args_non_dependent (*args
);
8548 user_args
= args
== NULL
? NULL
: *args
;
8549 /* Under DR 147 A::A() is an invalid constructor call,
8550 not a functional cast. */
8551 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
8553 if (! (complain
& tf_error
))
8554 return error_mark_node
;
8556 if (permerror (input_location
,
8557 "cannot call constructor %<%T::%D%> directly",
8559 inform (input_location
, "for a function-style cast, remove the "
8560 "redundant %<::%D%>", name
);
8561 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
8566 /* Figure out whether to skip the first argument for the error
8567 message we will display to users if an error occurs. We don't
8568 want to display any compiler-generated arguments. The "this"
8569 pointer hasn't been added yet. However, we must remove the VTT
8570 pointer if this is a call to a base-class constructor or
8572 skip_first_for_error
= false;
8573 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
8575 /* Callers should explicitly indicate whether they want to construct
8576 the complete object or just the part without virtual bases. */
8577 gcc_assert (name
!= ctor_identifier
);
8578 /* Similarly for destructors. */
8579 gcc_assert (name
!= dtor_identifier
);
8580 /* Remove the VTT pointer, if present. */
8581 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
8582 && CLASSTYPE_VBASECLASSES (basetype
))
8583 skip_first_for_error
= true;
8586 /* Process the argument list. */
8587 if (args
!= NULL
&& *args
!= NULL
)
8589 *args
= resolve_args (*args
, complain
);
8591 return error_mark_node
;
8594 /* Consider the object argument to be used even if we end up selecting a
8595 static member function. */
8596 instance
= mark_type_use (instance
);
8598 /* It's OK to call destructors and constructors on cv-qualified objects.
8599 Therefore, convert the INSTANCE to the unqualified type, if
8601 if (DECL_DESTRUCTOR_P (fn
)
8602 || DECL_CONSTRUCTOR_P (fn
))
8604 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
8606 instance
= build_this (instance
);
8607 instance
= build_nop (build_pointer_type (basetype
), instance
);
8608 instance
= build_fold_indirect_ref (instance
);
8611 if (DECL_DESTRUCTOR_P (fn
))
8612 name
= complete_dtor_identifier
;
8614 /* For the overload resolution we need to find the actual `this`
8615 that would be captured if the call turns out to be to a
8616 non-static member function. Do not actually capture it at this
8618 if (DECL_CONSTRUCTOR_P (fn
))
8619 /* Constructors don't use the enclosing 'this'. */
8620 first_mem_arg
= instance
;
8622 first_mem_arg
= maybe_resolve_dummy (instance
, false);
8624 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8625 p
= conversion_obstack_alloc (0);
8627 /* The number of arguments artificial parms in ARGS; we subtract one because
8628 there's no 'this' in ARGS. */
8629 unsigned skip
= num_artificial_parms_for (fn
) - 1;
8631 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
8632 initializer, not T({ }). */
8633 if (DECL_CONSTRUCTOR_P (fn
)
8634 && vec_safe_length (user_args
) > skip
8635 && DIRECT_LIST_INIT_P ((*user_args
)[skip
]))
8637 tree init_list
= (*user_args
)[skip
];
8638 tree init
= NULL_TREE
;
8640 gcc_assert (user_args
->length () == skip
+ 1
8641 && !(flags
& LOOKUP_ONLYCONVERTING
));
8643 /* If the initializer list has no elements and T is a class type with
8644 a default constructor, the object is value-initialized. Handle
8645 this here so we don't need to handle it wherever we use
8646 build_special_member_call. */
8647 if (CONSTRUCTOR_NELTS (init_list
) == 0
8648 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
8649 /* For a user-provided default constructor, use the normal
8650 mechanisms so that protected access works. */
8651 && type_has_non_user_provided_default_constructor (basetype
)
8652 && !processing_template_decl
)
8653 init
= build_value_init (basetype
, complain
);
8655 /* If BASETYPE is an aggregate, we need to do aggregate
8657 else if (CP_AGGREGATE_TYPE_P (basetype
))
8659 init
= reshape_init (basetype
, init_list
, complain
);
8660 init
= digest_init (basetype
, init
, complain
);
8665 if (is_dummy_object (instance
))
8666 return get_target_expr_sfinae (init
, complain
);
8667 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
8668 TREE_SIDE_EFFECTS (init
) = true;
8672 /* Otherwise go ahead with overload resolution. */
8673 add_list_candidates (fns
, first_mem_arg
, user_args
,
8674 basetype
, explicit_targs
, template_only
,
8675 conversion_path
, access_binfo
, flags
,
8676 &candidates
, complain
);
8680 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
8681 explicit_targs
, template_only
, conversion_path
,
8682 access_binfo
, flags
, &candidates
, complain
);
8684 any_viable_p
= false;
8685 candidates
= splice_viable (candidates
, false, &any_viable_p
);
8689 if (complain
& tf_error
)
8691 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
8692 cxx_incomplete_type_error (instance
, basetype
);
8694 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
8695 basetype
, optype
, build_tree_list_vec (user_args
),
8696 TREE_TYPE (instance
));
8699 tree arglist
= build_tree_list_vec (user_args
);
8700 tree errname
= name
;
8701 if (IDENTIFIER_CTOR_OR_DTOR_P (errname
))
8703 tree fn
= DECL_ORIGIN (OVL_FIRST (fns
));
8704 errname
= DECL_NAME (fn
);
8707 errname
= lookup_template_function (errname
, explicit_targs
);
8708 if (skip_first_for_error
)
8709 arglist
= TREE_CHAIN (arglist
);
8710 error ("no matching function for call to %<%T::%E(%A)%#V%>",
8711 basetype
, errname
, arglist
,
8712 TREE_TYPE (instance
));
8714 print_z_candidates (location_of (name
), candidates
);
8716 call
= error_mark_node
;
8720 cand
= tourney (candidates
, complain
);
8727 if (complain
& tf_error
)
8729 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
8730 arglist
= build_tree_list_vec (user_args
);
8731 if (skip_first_for_error
)
8732 arglist
= TREE_CHAIN (arglist
);
8733 if (!any_strictly_viable (candidates
))
8734 error ("no matching function for call to %<%s(%A)%>",
8735 pretty_name
, arglist
);
8737 error ("call of overloaded %<%s(%A)%> is ambiguous",
8738 pretty_name
, arglist
);
8739 print_z_candidates (location_of (name
), candidates
);
8743 call
= error_mark_node
;
8750 if (!(flags
& LOOKUP_NONVIRTUAL
)
8751 && DECL_PURE_VIRTUAL_P (fn
)
8752 && instance
== current_class_ref
8753 && (complain
& tf_warning
))
8755 /* This is not an error, it is runtime undefined
8757 if (!current_function_decl
)
8758 warning (0, "pure virtual %q#D called from "
8759 "non-static data member initializer", fn
);
8760 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
8761 || DECL_DESTRUCTOR_P (current_function_decl
))
8762 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
8763 ? G_("pure virtual %q#D called from constructor")
8764 : G_("pure virtual %q#D called from destructor")),
8768 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
8769 && !DECL_CONSTRUCTOR_P (fn
)
8770 && is_dummy_object (instance
))
8772 instance
= maybe_resolve_dummy (instance
, true);
8773 if (instance
== error_mark_node
)
8774 call
= error_mark_node
;
8775 else if (!is_dummy_object (instance
))
8777 /* We captured 'this' in the current lambda now that
8778 we know we really need it. */
8779 cand
->first_arg
= instance
;
8781 else if (any_dependent_bases_p ())
8782 /* We can't tell until instantiation time whether we can use
8783 *this as the implicit object argument. */;
8786 if (complain
& tf_error
)
8787 error ("cannot call member function %qD without object",
8789 call
= error_mark_node
;
8793 if (call
!= error_mark_node
)
8795 /* Optimize away vtable lookup if we know that this
8796 function can't be overridden. We need to check if
8797 the context and the type where we found fn are the same,
8798 actually FN might be defined in a different class
8799 type because of a using-declaration. In this case, we
8800 do not want to perform a non-virtual call. */
8801 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
8802 && same_type_ignoring_top_level_qualifiers_p
8803 (DECL_CONTEXT (fn
), BINFO_TYPE (binfo
))
8804 && resolves_to_fixed_type_p (instance
, 0))
8805 flags
|= LOOKUP_NONVIRTUAL
;
8807 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
8808 /* Now we know what function is being called. */
8811 /* Build the actual CALL_EXPR. */
8812 call
= build_over_call (cand
, flags
, complain
);
8813 /* In an expression of the form `a->f()' where `f' turns
8814 out to be a static member function, `a' is
8815 none-the-less evaluated. */
8816 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
8817 && !is_dummy_object (instance
)
8818 && TREE_SIDE_EFFECTS (instance
))
8819 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
),
8821 else if (call
!= error_mark_node
8822 && DECL_DESTRUCTOR_P (cand
->fn
)
8823 && !VOID_TYPE_P (TREE_TYPE (call
)))
8824 /* An explicit call of the form "x->~X()" has type
8825 "void". However, on platforms where destructors
8826 return "this" (i.e., those where
8827 targetm.cxx.cdtor_returns_this is true), such calls
8828 will appear to have a return value of pointer type
8829 to the low-level call machinery. We do not want to
8830 change the low-level machinery, since we want to be
8831 able to optimize "delete f()" on such platforms as
8832 "operator delete(~X(f()))" (rather than generating
8833 "t = f(), ~X(t), operator delete (t)"). */
8834 call
= build_nop (void_type_node
, call
);
8839 if (processing_template_decl
&& call
!= error_mark_node
)
8841 bool cast_to_void
= false;
8843 if (TREE_CODE (call
) == COMPOUND_EXPR
)
8844 call
= TREE_OPERAND (call
, 1);
8845 else if (TREE_CODE (call
) == NOP_EXPR
)
8847 cast_to_void
= true;
8848 call
= TREE_OPERAND (call
, 0);
8850 if (INDIRECT_REF_P (call
))
8851 call
= TREE_OPERAND (call
, 0);
8852 call
= (build_min_non_dep_call_vec
8854 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
8855 orig_instance
, orig_fns
, NULL_TREE
),
8857 SET_EXPR_LOCATION (call
, input_location
);
8858 call
= convert_from_reference (call
);
8860 call
= build_nop (void_type_node
, call
);
8863 /* Free all the conversions we allocated. */
8864 obstack_free (&conversion_obstack
, p
);
8866 if (orig_args
!= NULL
)
8867 release_tree_vector (orig_args
);
8872 /* Wrapper for above. */
8875 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
8876 tree conversion_path
, int flags
,
8877 tree
*fn_p
, tsubst_flags_t complain
)
8880 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
8881 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
8883 timevar_cond_stop (TV_OVERLOAD
, subtime
);
8887 /* Returns true iff standard conversion sequence ICS1 is a proper
8888 subsequence of ICS2. */
8891 is_subseq (conversion
*ics1
, conversion
*ics2
)
8893 /* We can assume that a conversion of the same code
8894 between the same types indicates a subsequence since we only get
8895 here if the types we are converting from are the same. */
8897 while (ics1
->kind
== ck_rvalue
8898 || ics1
->kind
== ck_lvalue
)
8899 ics1
= next_conversion (ics1
);
8903 while (ics2
->kind
== ck_rvalue
8904 || ics2
->kind
== ck_lvalue
)
8905 ics2
= next_conversion (ics2
);
8907 if (ics2
->kind
== ck_user
8908 || ics2
->kind
== ck_ambig
8909 || ics2
->kind
== ck_aggr
8910 || ics2
->kind
== ck_list
8911 || ics2
->kind
== ck_identity
)
8912 /* At this point, ICS1 cannot be a proper subsequence of
8913 ICS2. We can get a USER_CONV when we are comparing the
8914 second standard conversion sequence of two user conversion
8918 ics2
= next_conversion (ics2
);
8920 while (ics2
->kind
== ck_rvalue
8921 || ics2
->kind
== ck_lvalue
)
8922 ics2
= next_conversion (ics2
);
8924 if (ics2
->kind
== ics1
->kind
8925 && same_type_p (ics2
->type
, ics1
->type
)
8926 && (ics1
->kind
== ck_identity
8927 || same_type_p (next_conversion (ics2
)->type
,
8928 next_conversion (ics1
)->type
)))
8933 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
8934 be any _TYPE nodes. */
8937 is_properly_derived_from (tree derived
, tree base
)
8939 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
8942 /* We only allow proper derivation here. The DERIVED_FROM_P macro
8943 considers every class derived from itself. */
8944 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
8945 && DERIVED_FROM_P (base
, derived
));
8948 /* We build the ICS for an implicit object parameter as a pointer
8949 conversion sequence. However, such a sequence should be compared
8950 as if it were a reference conversion sequence. If ICS is the
8951 implicit conversion sequence for an implicit object parameter,
8952 modify it accordingly. */
8955 maybe_handle_implicit_object (conversion
**ics
)
8959 /* [over.match.funcs]
8961 For non-static member functions, the type of the
8962 implicit object parameter is "reference to cv X"
8963 where X is the class of which the function is a
8964 member and cv is the cv-qualification on the member
8965 function declaration. */
8966 conversion
*t
= *ics
;
8967 tree reference_type
;
8969 /* The `this' parameter is a pointer to a class type. Make the
8970 implicit conversion talk about a reference to that same class
8972 reference_type
= TREE_TYPE (t
->type
);
8973 reference_type
= build_reference_type (reference_type
);
8975 if (t
->kind
== ck_qual
)
8976 t
= next_conversion (t
);
8977 if (t
->kind
== ck_ptr
)
8978 t
= next_conversion (t
);
8979 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
8980 t
= direct_reference_binding (reference_type
, t
);
8982 t
->rvaluedness_matches_p
= 0;
8987 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
8988 and return the initial reference binding conversion. Otherwise,
8989 leave *ICS unchanged and return NULL. */
8992 maybe_handle_ref_bind (conversion
**ics
)
8994 if ((*ics
)->kind
== ck_ref_bind
)
8996 conversion
*old_ics
= *ics
;
8997 *ics
= next_conversion (old_ics
);
8998 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
9005 /* Compare two implicit conversion sequences according to the rules set out in
9006 [over.ics.rank]. Return values:
9008 1: ics1 is better than ics2
9009 -1: ics2 is better than ics1
9010 0: ics1 and ics2 are indistinguishable */
9013 compare_ics (conversion
*ics1
, conversion
*ics2
)
9019 tree deref_from_type1
= NULL_TREE
;
9020 tree deref_from_type2
= NULL_TREE
;
9021 tree deref_to_type1
= NULL_TREE
;
9022 tree deref_to_type2
= NULL_TREE
;
9023 conversion_rank rank1
, rank2
;
9025 /* REF_BINDING is nonzero if the result of the conversion sequence
9026 is a reference type. In that case REF_CONV is the reference
9027 binding conversion. */
9028 conversion
*ref_conv1
;
9029 conversion
*ref_conv2
;
9031 /* Compare badness before stripping the reference conversion. */
9032 if (ics1
->bad_p
> ics2
->bad_p
)
9034 else if (ics1
->bad_p
< ics2
->bad_p
)
9037 /* Handle implicit object parameters. */
9038 maybe_handle_implicit_object (&ics1
);
9039 maybe_handle_implicit_object (&ics2
);
9041 /* Handle reference parameters. */
9042 ref_conv1
= maybe_handle_ref_bind (&ics1
);
9043 ref_conv2
= maybe_handle_ref_bind (&ics2
);
9045 /* List-initialization sequence L1 is a better conversion sequence than
9046 list-initialization sequence L2 if L1 converts to
9047 std::initializer_list<X> for some X and L2 does not. */
9048 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
9050 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
9055 When comparing the basic forms of implicit conversion sequences (as
9056 defined in _over.best.ics_)
9058 --a standard conversion sequence (_over.ics.scs_) is a better
9059 conversion sequence than a user-defined conversion sequence
9060 or an ellipsis conversion sequence, and
9062 --a user-defined conversion sequence (_over.ics.user_) is a
9063 better conversion sequence than an ellipsis conversion sequence
9064 (_over.ics.ellipsis_). */
9065 /* Use BAD_CONVERSION_RANK because we already checked for a badness
9066 mismatch. If both ICS are bad, we try to make a decision based on
9067 what would have happened if they'd been good. This is not an
9068 extension, we'll still give an error when we build up the call; this
9069 just helps us give a more helpful error message. */
9070 rank1
= BAD_CONVERSION_RANK (ics1
);
9071 rank2
= BAD_CONVERSION_RANK (ics2
);
9075 else if (rank1
< rank2
)
9078 if (ics1
->ellipsis_p
)
9079 /* Both conversions are ellipsis conversions. */
9082 /* User-defined conversion sequence U1 is a better conversion sequence
9083 than another user-defined conversion sequence U2 if they contain the
9084 same user-defined conversion operator or constructor and if the sec-
9085 ond standard conversion sequence of U1 is better than the second
9086 standard conversion sequence of U2. */
9088 /* Handle list-conversion with the same code even though it isn't always
9089 ranked as a user-defined conversion and it doesn't have a second
9090 standard conversion sequence; it will still have the desired effect.
9091 Specifically, we need to do the reference binding comparison at the
9092 end of this function. */
9094 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
|| ics1
->kind
== ck_aggr
)
9099 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
9100 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
9101 || t1
->kind
== ck_list
)
9103 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
9104 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
9105 || t2
->kind
== ck_list
)
9108 if (t1
->kind
!= t2
->kind
)
9110 else if (t1
->kind
== ck_user
)
9112 if (t1
->cand
->fn
!= t2
->cand
->fn
)
9117 /* For ambiguous or aggregate conversions, use the target type as
9118 a proxy for the conversion function. */
9119 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
9123 /* We can just fall through here, after setting up
9124 FROM_TYPE1 and FROM_TYPE2. */
9125 from_type1
= t1
->type
;
9126 from_type2
= t2
->type
;
9133 /* We're dealing with two standard conversion sequences.
9137 Standard conversion sequence S1 is a better conversion
9138 sequence than standard conversion sequence S2 if
9140 --S1 is a proper subsequence of S2 (comparing the conversion
9141 sequences in the canonical form defined by _over.ics.scs_,
9142 excluding any Lvalue Transformation; the identity
9143 conversion sequence is considered to be a subsequence of
9144 any non-identity conversion sequence */
9147 while (t1
->kind
!= ck_identity
)
9148 t1
= next_conversion (t1
);
9149 from_type1
= t1
->type
;
9152 while (t2
->kind
!= ck_identity
)
9153 t2
= next_conversion (t2
);
9154 from_type2
= t2
->type
;
9157 /* One sequence can only be a subsequence of the other if they start with
9158 the same type. They can start with different types when comparing the
9159 second standard conversion sequence in two user-defined conversion
9161 if (same_type_p (from_type1
, from_type2
))
9163 if (is_subseq (ics1
, ics2
))
9165 if (is_subseq (ics2
, ics1
))
9173 --the rank of S1 is better than the rank of S2 (by the rules
9176 Standard conversion sequences are ordered by their ranks: an Exact
9177 Match is a better conversion than a Promotion, which is a better
9178 conversion than a Conversion.
9180 Two conversion sequences with the same rank are indistinguishable
9181 unless one of the following rules applies:
9183 --A conversion that does not a convert a pointer, pointer to member,
9184 or std::nullptr_t to bool is better than one that does.
9186 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
9187 so that we do not have to check it explicitly. */
9188 if (ics1
->rank
< ics2
->rank
)
9190 else if (ics2
->rank
< ics1
->rank
)
9193 to_type1
= ics1
->type
;
9194 to_type2
= ics2
->type
;
9196 /* A conversion from scalar arithmetic type to complex is worse than a
9197 conversion between scalar arithmetic types. */
9198 if (same_type_p (from_type1
, from_type2
)
9199 && ARITHMETIC_TYPE_P (from_type1
)
9200 && ARITHMETIC_TYPE_P (to_type1
)
9201 && ARITHMETIC_TYPE_P (to_type2
)
9202 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
9203 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
9205 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
9211 if (TYPE_PTR_P (from_type1
)
9212 && TYPE_PTR_P (from_type2
)
9213 && TYPE_PTR_P (to_type1
)
9214 && TYPE_PTR_P (to_type2
))
9216 deref_from_type1
= TREE_TYPE (from_type1
);
9217 deref_from_type2
= TREE_TYPE (from_type2
);
9218 deref_to_type1
= TREE_TYPE (to_type1
);
9219 deref_to_type2
= TREE_TYPE (to_type2
);
9221 /* The rules for pointers to members A::* are just like the rules
9222 for pointers A*, except opposite: if B is derived from A then
9223 A::* converts to B::*, not vice versa. For that reason, we
9224 switch the from_ and to_ variables here. */
9225 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
9226 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
9227 || (TYPE_PTRMEMFUNC_P (from_type1
)
9228 && TYPE_PTRMEMFUNC_P (from_type2
)
9229 && TYPE_PTRMEMFUNC_P (to_type1
)
9230 && TYPE_PTRMEMFUNC_P (to_type2
)))
9232 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
9233 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
9234 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
9235 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
9238 if (deref_from_type1
!= NULL_TREE
9239 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
9240 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
9242 /* This was one of the pointer or pointer-like conversions.
9246 --If class B is derived directly or indirectly from class A,
9247 conversion of B* to A* is better than conversion of B* to
9248 void*, and conversion of A* to void* is better than
9249 conversion of B* to void*. */
9250 if (VOID_TYPE_P (deref_to_type1
)
9251 && VOID_TYPE_P (deref_to_type2
))
9253 if (is_properly_derived_from (deref_from_type1
,
9256 else if (is_properly_derived_from (deref_from_type2
,
9260 else if (VOID_TYPE_P (deref_to_type1
)
9261 || VOID_TYPE_P (deref_to_type2
))
9263 if (same_type_p (deref_from_type1
, deref_from_type2
))
9265 if (VOID_TYPE_P (deref_to_type2
))
9267 if (is_properly_derived_from (deref_from_type1
,
9271 /* We know that DEREF_TO_TYPE1 is `void' here. */
9272 else if (is_properly_derived_from (deref_from_type1
,
9277 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
9278 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
9282 --If class B is derived directly or indirectly from class A
9283 and class C is derived directly or indirectly from B,
9285 --conversion of C* to B* is better than conversion of C* to
9288 --conversion of B* to A* is better than conversion of C* to
9290 if (same_type_p (deref_from_type1
, deref_from_type2
))
9292 if (is_properly_derived_from (deref_to_type1
,
9295 else if (is_properly_derived_from (deref_to_type2
,
9299 else if (same_type_p (deref_to_type1
, deref_to_type2
))
9301 if (is_properly_derived_from (deref_from_type2
,
9304 else if (is_properly_derived_from (deref_from_type1
,
9310 else if (CLASS_TYPE_P (non_reference (from_type1
))
9311 && same_type_p (from_type1
, from_type2
))
9313 tree from
= non_reference (from_type1
);
9317 --binding of an expression of type C to a reference of type
9318 B& is better than binding an expression of type C to a
9319 reference of type A&
9321 --conversion of C to B is better than conversion of C to A, */
9322 if (is_properly_derived_from (from
, to_type1
)
9323 && is_properly_derived_from (from
, to_type2
))
9325 if (is_properly_derived_from (to_type1
, to_type2
))
9327 else if (is_properly_derived_from (to_type2
, to_type1
))
9331 else if (CLASS_TYPE_P (non_reference (to_type1
))
9332 && same_type_p (to_type1
, to_type2
))
9334 tree to
= non_reference (to_type1
);
9338 --binding of an expression of type B to a reference of type
9339 A& is better than binding an expression of type C to a
9340 reference of type A&,
9342 --conversion of B to A is better than conversion of C to A */
9343 if (is_properly_derived_from (from_type1
, to
)
9344 && is_properly_derived_from (from_type2
, to
))
9346 if (is_properly_derived_from (from_type2
, from_type1
))
9348 else if (is_properly_derived_from (from_type1
, from_type2
))
9355 --S1 and S2 differ only in their qualification conversion and yield
9356 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
9357 qualification signature of type T1 is a proper subset of the cv-
9358 qualification signature of type T2 */
9359 if (ics1
->kind
== ck_qual
9360 && ics2
->kind
== ck_qual
9361 && same_type_p (from_type1
, from_type2
))
9363 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
9370 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
9371 to an implicit object parameter of a non-static member function
9372 declared without a ref-qualifier, and either S1 binds an lvalue
9373 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
9374 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
9375 draft standard, 13.3.3.2)
9377 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
9378 types to which the references refer are the same type except for
9379 top-level cv-qualifiers, and the type to which the reference
9380 initialized by S2 refers is more cv-qualified than the type to
9381 which the reference initialized by S1 refers.
9383 DR 1328 [over.match.best]: the context is an initialization by
9384 conversion function for direct reference binding (13.3.1.6) of a
9385 reference to function type, the return type of F1 is the same kind of
9386 reference (i.e. lvalue or rvalue) as the reference being initialized,
9387 and the return type of F2 is not. */
9389 if (ref_conv1
&& ref_conv2
)
9391 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
9392 && (ref_conv1
->rvaluedness_matches_p
9393 != ref_conv2
->rvaluedness_matches_p
)
9394 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
9395 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
9396 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
9398 if (ref_conv1
->bad_p
9399 && !same_type_p (TREE_TYPE (ref_conv1
->type
),
9400 TREE_TYPE (ref_conv2
->type
)))
9401 /* Don't prefer a bad conversion that drops cv-quals to a bad
9402 conversion with the wrong rvalueness. */
9404 return (ref_conv1
->rvaluedness_matches_p
9405 - ref_conv2
->rvaluedness_matches_p
);
9408 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
9410 int q1
= cp_type_quals (TREE_TYPE (ref_conv1
->type
));
9411 int q2
= cp_type_quals (TREE_TYPE (ref_conv2
->type
));
9412 if (ref_conv1
->bad_p
)
9414 /* Prefer the one that drops fewer cv-quals. */
9415 tree ftype
= next_conversion (ref_conv1
)->type
;
9416 int fquals
= cp_type_quals (ftype
);
9420 return comp_cv_qualification (q2
, q1
);
9424 /* Neither conversion sequence is better than the other. */
9428 /* The source type for this standard conversion sequence. */
9431 source_type (conversion
*t
)
9433 for (;; t
= next_conversion (t
))
9435 if (t
->kind
== ck_user
9436 || t
->kind
== ck_ambig
9437 || t
->kind
== ck_identity
)
9443 /* Note a warning about preferring WINNER to LOSER. We do this by storing
9444 a pointer to LOSER and re-running joust to produce the warning if WINNER
9445 is actually used. */
9448 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
9450 candidate_warning
*cw
= (candidate_warning
*)
9451 conversion_obstack_alloc (sizeof (candidate_warning
));
9453 cw
->next
= winner
->warnings
;
9454 winner
->warnings
= cw
;
9457 /* Compare two candidates for overloading as described in
9458 [over.match.best]. Return values:
9460 1: cand1 is better than cand2
9461 -1: cand2 is better than cand1
9462 0: cand1 and cand2 are indistinguishable */
9465 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
9466 tsubst_flags_t complain
)
9469 int off1
= 0, off2
= 0;
9473 /* Candidates that involve bad conversions are always worse than those
9475 if (cand1
->viable
> cand2
->viable
)
9477 if (cand1
->viable
< cand2
->viable
)
9480 /* If we have two pseudo-candidates for conversions to the same type,
9481 or two candidates for the same function, arbitrarily pick one. */
9482 if (cand1
->fn
== cand2
->fn
9483 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
9486 /* Prefer a non-deleted function over an implicitly deleted move
9487 constructor or assignment operator. This differs slightly from the
9488 wording for issue 1402 (which says the move op is ignored by overload
9489 resolution), but this way produces better error messages. */
9490 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
9491 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
9492 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
9494 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
9495 && move_fn_p (cand1
->fn
))
9497 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
9498 && move_fn_p (cand2
->fn
))
9502 /* a viable function F1
9503 is defined to be a better function than another viable function F2 if
9504 for all arguments i, ICSi(F1) is not a worse conversion sequence than
9505 ICSi(F2), and then */
9507 /* for some argument j, ICSj(F1) is a better conversion sequence than
9510 /* For comparing static and non-static member functions, we ignore
9511 the implicit object parameter of the non-static function. The
9512 standard says to pretend that the static function has an object
9513 parm, but that won't work with operator overloading. */
9514 len
= cand1
->num_convs
;
9515 if (len
!= cand2
->num_convs
)
9517 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
9518 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
9520 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
9521 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
9522 /* We're comparing a near-match list constructor and a near-match
9523 non-list constructor. Just treat them as unordered. */
9526 gcc_assert (static_1
!= static_2
);
9537 for (i
= 0; i
< len
; ++i
)
9539 conversion
*t1
= cand1
->convs
[i
+ off1
];
9540 conversion
*t2
= cand2
->convs
[i
+ off2
];
9541 int comp
= compare_ics (t1
, t2
);
9545 if ((complain
& tf_warning
)
9547 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
9548 == cr_std
+ cr_promotion
)
9549 && t1
->kind
== ck_std
9550 && t2
->kind
== ck_std
9551 && TREE_CODE (t1
->type
) == INTEGER_TYPE
9552 && TREE_CODE (t2
->type
) == INTEGER_TYPE
9553 && (TYPE_PRECISION (t1
->type
)
9554 == TYPE_PRECISION (t2
->type
))
9555 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
9556 || (TREE_CODE (next_conversion (t1
)->type
)
9559 tree type
= next_conversion (t1
)->type
;
9561 struct z_candidate
*w
, *l
;
9563 type1
= t1
->type
, type2
= t2
->type
,
9564 w
= cand1
, l
= cand2
;
9566 type1
= t2
->type
, type2
= t1
->type
,
9567 w
= cand2
, l
= cand1
;
9571 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
9572 type
, type1
, type2
);
9573 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
9579 if (winner
&& comp
!= winner
)
9588 /* warn about confusing overload resolution for user-defined conversions,
9589 either between a constructor and a conversion op, or between two
9591 if ((complain
& tf_warning
)
9592 && winner
&& warn_conversion
&& cand1
->second_conv
9593 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
9594 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
9596 struct z_candidate
*w
, *l
;
9597 bool give_warning
= false;
9600 w
= cand1
, l
= cand2
;
9602 w
= cand2
, l
= cand1
;
9604 /* We don't want to complain about `X::operator T1 ()'
9605 beating `X::operator T2 () const', when T2 is a no less
9606 cv-qualified version of T1. */
9607 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
9608 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
9610 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
9611 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
9613 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
9618 if (!comp_ptr_ttypes (t
, f
))
9619 give_warning
= true;
9622 give_warning
= true;
9628 tree source
= source_type (w
->convs
[0]);
9629 if (! DECL_CONSTRUCTOR_P (w
->fn
))
9630 source
= TREE_TYPE (source
);
9631 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
9632 && warning (OPT_Wconversion
, " for conversion from %qH to %qI",
9633 source
, w
->second_conv
->type
))
9635 inform (input_location
, " because conversion sequence for the argument is better");
9645 /* DR 495 moved this tiebreaker above the template ones. */
9647 the context is an initialization by user-defined conversion (see
9648 _dcl.init_ and _over.match.user_) and the standard conversion
9649 sequence from the return type of F1 to the destination type (i.e.,
9650 the type of the entity being initialized) is a better conversion
9651 sequence than the standard conversion sequence from the return type
9652 of F2 to the destination type. */
9654 if (cand1
->second_conv
)
9656 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
9662 F1 is a non-template function and F2 is a template function
9665 if (!cand1
->template_decl
&& cand2
->template_decl
)
9667 else if (cand1
->template_decl
&& !cand2
->template_decl
)
9671 F1 and F2 are template functions and the function template for F1 is
9672 more specialized than the template for F2 according to the partial
9675 if (cand1
->template_decl
&& cand2
->template_decl
)
9677 winner
= more_specialized_fn
9678 (TI_TEMPLATE (cand1
->template_decl
),
9679 TI_TEMPLATE (cand2
->template_decl
),
9680 /* [temp.func.order]: The presence of unused ellipsis and default
9681 arguments has no effect on the partial ordering of function
9682 templates. add_function_candidate() will not have
9683 counted the "this" argument for constructors. */
9684 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
9690 // or, if not that, F1 is more constrained than F2.
9691 if (flag_concepts
&& DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
))
9693 winner
= more_constrained (cand1
->fn
, cand2
->fn
);
9698 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
9699 if (deduction_guide_p (cand1
->fn
))
9701 gcc_assert (deduction_guide_p (cand2
->fn
));
9702 /* We distinguish between candidates from an explicit deduction guide and
9703 candidates built from a constructor based on DECL_ARTIFICIAL. */
9704 int art1
= DECL_ARTIFICIAL (cand1
->fn
);
9705 int art2
= DECL_ARTIFICIAL (cand2
->fn
);
9711 /* Prefer the special copy guide over a declared copy/move
9713 if (copy_guide_p (cand1
->fn
))
9715 if (copy_guide_p (cand2
->fn
))
9718 /* Prefer a candidate generated from a non-template constructor. */
9719 int tg1
= template_guide_p (cand1
->fn
);
9720 int tg2
= template_guide_p (cand2
->fn
);
9726 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
9727 for all arguments the corresponding parameters of F1 and F2 have the same
9728 type (CWG 2273/2277). */
9729 if (DECL_P (cand1
->fn
) && DECL_CLASS_SCOPE_P (cand1
->fn
)
9730 && !DECL_CONV_FN_P (cand1
->fn
)
9731 && DECL_P (cand2
->fn
) && DECL_CLASS_SCOPE_P (cand2
->fn
)
9732 && !DECL_CONV_FN_P (cand2
->fn
))
9734 tree base1
= DECL_CONTEXT (strip_inheriting_ctors (cand1
->fn
));
9735 tree base2
= DECL_CONTEXT (strip_inheriting_ctors (cand2
->fn
));
9740 /* No difference. */;
9741 else if (DERIVED_FROM_P (base1
, base2
))
9743 else if (DERIVED_FROM_P (base2
, base1
))
9746 if (int diff
= used2
- used1
)
9748 for (i
= 0; i
< len
; ++i
)
9750 conversion
*t1
= cand1
->convs
[i
+ off1
];
9751 conversion
*t2
= cand2
->convs
[i
+ off2
];
9752 if (!same_type_p (t1
->type
, t2
->type
))
9760 /* Check whether we can discard a builtin candidate, either because we
9761 have two identical ones or matching builtin and non-builtin candidates.
9763 (Pedantically in the latter case the builtin which matched the user
9764 function should not be added to the overload set, but we spot it here.
9767 ... the builtin candidates include ...
9768 - do not have the same parameter type list as any non-template
9769 non-member candidate. */
9771 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
9773 for (i
= 0; i
< len
; ++i
)
9774 if (!same_type_p (cand1
->convs
[i
]->type
,
9775 cand2
->convs
[i
]->type
))
9777 if (i
== cand1
->num_convs
)
9779 if (cand1
->fn
== cand2
->fn
)
9780 /* Two built-in candidates; arbitrarily pick one. */
9782 else if (identifier_p (cand1
->fn
))
9783 /* cand1 is built-in; prefer cand2. */
9786 /* cand2 is built-in; prefer cand1. */
9791 /* For candidates of a multi-versioned function, make the version with
9792 the highest priority win. This version will be checked for dispatching
9793 first. If this version can be inlined into the caller, the front-end
9794 will simply make a direct call to this function. */
9796 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
9797 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
9798 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
9799 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
9801 tree f1
= TREE_TYPE (cand1
->fn
);
9802 tree f2
= TREE_TYPE (cand2
->fn
);
9803 tree p1
= TYPE_ARG_TYPES (f1
);
9804 tree p2
= TYPE_ARG_TYPES (f2
);
9806 /* Check if cand1->fn and cand2->fn are versions of the same function. It
9807 is possible that cand1->fn and cand2->fn are function versions but of
9808 different functions. Check types to see if they are versions of the same
9810 if (compparms (p1
, p2
)
9811 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
9813 /* Always make the version with the higher priority, more
9814 specialized, win. */
9815 gcc_assert (targetm
.compare_version_priority
);
9816 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
9823 /* If the two function declarations represent the same function (this can
9824 happen with declarations in multiple scopes and arg-dependent lookup),
9825 arbitrarily choose one. But first make sure the default args we're
9827 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
9828 && equal_functions (cand1
->fn
, cand2
->fn
))
9830 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
9831 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
9833 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
9835 for (i
= 0; i
< len
; ++i
)
9837 /* Don't crash if the fn is variadic. */
9840 parms1
= TREE_CHAIN (parms1
);
9841 parms2
= TREE_CHAIN (parms2
);
9845 parms1
= TREE_CHAIN (parms1
);
9847 parms2
= TREE_CHAIN (parms2
);
9851 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
9852 TREE_PURPOSE (parms2
)))
9856 if (complain
& tf_error
)
9858 if (permerror (input_location
,
9859 "default argument mismatch in "
9860 "overload resolution"))
9862 inform (DECL_SOURCE_LOCATION (cand1
->fn
),
9863 " candidate 1: %q#F", cand1
->fn
);
9864 inform (DECL_SOURCE_LOCATION (cand2
->fn
),
9865 " candidate 2: %q#F", cand2
->fn
);
9872 add_warning (cand1
, cand2
);
9875 parms1
= TREE_CHAIN (parms1
);
9876 parms2
= TREE_CHAIN (parms2
);
9884 /* Extension: If the worst conversion for one candidate is worse than the
9885 worst conversion for the other, take the first. */
9886 if (!pedantic
&& (complain
& tf_warning_or_error
))
9888 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
9889 struct z_candidate
*w
= 0, *l
= 0;
9891 for (i
= 0; i
< len
; ++i
)
9893 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
9894 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
9895 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
9896 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
9899 winner
= 1, w
= cand1
, l
= cand2
;
9901 winner
= -1, w
= cand2
, l
= cand1
;
9904 /* Don't choose a deleted function over ambiguity. */
9905 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
9909 pedwarn (input_location
, 0,
9910 "ISO C++ says that these are ambiguous, even "
9911 "though the worst conversion for the first is better than "
9912 "the worst conversion for the second:");
9913 print_z_candidate (input_location
, _("candidate 1:"), w
);
9914 print_z_candidate (input_location
, _("candidate 2:"), l
);
9922 gcc_assert (!winner
);
9926 /* Given a list of candidates for overloading, find the best one, if any.
9927 This algorithm has a worst case of O(2n) (winner is last), and a best
9928 case of O(n/2) (totally ambiguous); much better than a sorting
9931 static struct z_candidate
*
9932 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
9934 struct z_candidate
*champ
= candidates
, *challenger
;
9936 int champ_compared_to_predecessor
= 0;
9938 /* Walk through the list once, comparing each current champ to the next
9939 candidate, knocking out a candidate or two with each comparison. */
9941 for (challenger
= champ
->next
; challenger
; )
9943 fate
= joust (champ
, challenger
, 0, complain
);
9945 challenger
= challenger
->next
;
9950 champ
= challenger
->next
;
9953 champ_compared_to_predecessor
= 0;
9958 champ_compared_to_predecessor
= 1;
9961 challenger
= champ
->next
;
9965 /* Make sure the champ is better than all the candidates it hasn't yet
9966 been compared to. */
9968 for (challenger
= candidates
;
9970 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
9971 challenger
= challenger
->next
)
9973 fate
= joust (champ
, challenger
, 0, complain
);
9981 /* Returns nonzero if things of type FROM can be converted to TO. */
9984 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
9986 tree arg
= NULL_TREE
;
9987 /* implicit_conversion only considers user-defined conversions
9988 if it has an expression for the call argument list. */
9989 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
9990 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
9991 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
9994 /* Returns nonzero if things of type FROM can be converted to TO with a
9995 standard conversion. */
9998 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
10000 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
10003 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
10006 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
10007 tsubst_flags_t complain
)
10013 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10014 p
= conversion_obstack_alloc (0);
10015 /* We want to discard any access checks done for this test,
10016 as we might not be in the appropriate access context and
10017 we'll do the check again when we actually perform the
10019 push_deferring_access_checks (dk_deferred
);
10021 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10023 ok_p
= (t
&& !t
->bad_p
);
10025 /* Discard the access checks now. */
10026 pop_deferring_access_checks ();
10027 /* Free all the conversions we allocated. */
10028 obstack_free (&conversion_obstack
, p
);
10033 /* Like can_convert_arg, but allows dubious conversions as well. */
10036 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
10037 tsubst_flags_t complain
)
10042 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10043 p
= conversion_obstack_alloc (0);
10044 /* Try to perform the conversion. */
10045 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10047 /* Free all the conversions we allocated. */
10048 obstack_free (&conversion_obstack
, p
);
10053 /* Convert EXPR to TYPE. Return the converted expression.
10055 Note that we allow bad conversions here because by the time we get to
10056 this point we are committed to doing the conversion. If we end up
10057 doing a bad conversion, convert_like will complain. */
10060 perform_implicit_conversion_flags (tree type
, tree expr
,
10061 tsubst_flags_t complain
, int flags
)
10065 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
10067 if (error_operand_p (expr
))
10068 return error_mark_node
;
10070 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10071 p
= conversion_obstack_alloc (0);
10073 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
10074 /*c_cast_p=*/false,
10079 if (complain
& tf_error
)
10081 /* If expr has unknown type, then it is an overloaded function.
10082 Call instantiate_type to get good error messages. */
10083 if (TREE_TYPE (expr
) == unknown_type_node
)
10084 instantiate_type (type
, expr
, complain
);
10085 else if (invalid_nonstatic_memfn_p (loc
, expr
, complain
))
10086 /* We gave an error. */;
10088 error_at (loc
, "could not convert %qE from %qH to %qI", expr
,
10089 TREE_TYPE (expr
), type
);
10091 expr
= error_mark_node
;
10093 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
10095 /* In a template, we are only concerned about determining the
10096 type of non-dependent expressions, so we do not have to
10097 perform the actual conversion. But for initializers, we
10098 need to be able to perform it at instantiation
10099 (or instantiate_non_dependent_expr) time. */
10100 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
10101 if (!(flags
& LOOKUP_ONLYCONVERTING
))
10102 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
10105 expr
= convert_like (conv
, expr
, complain
);
10107 /* Free all the conversions we allocated. */
10108 obstack_free (&conversion_obstack
, p
);
10114 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
10116 return perform_implicit_conversion_flags (type
, expr
, complain
,
10120 /* Convert EXPR to TYPE (as a direct-initialization) if that is
10121 permitted. If the conversion is valid, the converted expression is
10122 returned. Otherwise, NULL_TREE is returned, except in the case
10123 that TYPE is a class type; in that case, an error is issued. If
10124 C_CAST_P is true, then this direct-initialization is taking
10125 place as part of a static_cast being attempted as part of a C-style
10129 perform_direct_initialization_if_possible (tree type
,
10132 tsubst_flags_t complain
)
10137 if (type
== error_mark_node
|| error_operand_p (expr
))
10138 return error_mark_node
;
10141 If the destination type is a (possibly cv-qualified) class type:
10143 -- If the initialization is direct-initialization ...,
10144 constructors are considered. ... If no constructor applies, or
10145 the overload resolution is ambiguous, the initialization is
10147 if (CLASS_TYPE_P (type
))
10149 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
10150 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
10151 &args
, type
, LOOKUP_NORMAL
, complain
);
10152 release_tree_vector (args
);
10153 return build_cplus_new (type
, expr
, complain
);
10156 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10157 p
= conversion_obstack_alloc (0);
10159 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
10161 LOOKUP_NORMAL
, complain
);
10162 if (!conv
|| conv
->bad_p
)
10165 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0,
10166 /*issue_conversion_warnings=*/false,
10170 /* Free all the conversions we allocated. */
10171 obstack_free (&conversion_obstack
, p
);
10176 /* When initializing a reference that lasts longer than a full-expression,
10177 this special rule applies:
10181 The temporary to which the reference is bound or the temporary
10182 that is the complete object to which the reference is bound
10183 persists for the lifetime of the reference.
10185 The temporaries created during the evaluation of the expression
10186 initializing the reference, except the temporary to which the
10187 reference is bound, are destroyed at the end of the
10188 full-expression in which they are created.
10190 In that case, we store the converted expression into a new
10191 VAR_DECL in a new scope.
10193 However, we want to be careful not to create temporaries when
10194 they are not required. For example, given:
10197 struct D : public B {};
10201 there is no need to copy the return value from "f"; we can just
10202 extend its lifetime. Similarly, given:
10205 struct T { operator S(); };
10209 we can extend the lifetime of the return value of the conversion
10212 The next several functions are involved in this lifetime extension. */
10214 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
10215 reference is being bound to a temporary. Create and return a new
10216 VAR_DECL with the indicated TYPE; this variable will store the value to
10217 which the reference is bound. */
10220 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
10222 tree var
= create_temporary_var (type
);
10224 /* Register the variable. */
10226 && (TREE_STATIC (decl
) || CP_DECL_THREAD_LOCAL_P (decl
)))
10228 /* Namespace-scope or local static; give it a mangled name. */
10229 /* FIXME share comdat with decl? */
10231 TREE_STATIC (var
) = TREE_STATIC (decl
);
10232 CP_DECL_THREAD_LOCAL_P (var
) = CP_DECL_THREAD_LOCAL_P (decl
);
10233 set_decl_tls_model (var
, DECL_TLS_MODEL (decl
));
10235 tree name
= mangle_ref_init_variable (decl
);
10236 DECL_NAME (var
) = name
;
10237 SET_DECL_ASSEMBLER_NAME (var
, name
);
10239 var
= pushdecl (var
);
10242 /* Create a new cleanup level if necessary. */
10243 maybe_push_cleanup_level (type
);
10248 /* EXPR is the initializer for a variable DECL of reference or
10249 std::initializer_list type. Create, push and return a new VAR_DECL
10250 for the initializer so that it will live as long as DECL. Any
10251 cleanup for the new variable is returned through CLEANUP, and the
10252 code to initialize the new variable is returned through INITP. */
10255 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
10262 /* Create the temporary variable. */
10263 type
= TREE_TYPE (expr
);
10264 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
10265 layout_decl (var
, 0);
10266 /* If the rvalue is the result of a function call it will be
10267 a TARGET_EXPR. If it is some other construct (such as a
10268 member access expression where the underlying object is
10269 itself the result of a function call), turn it into a
10270 TARGET_EXPR here. It is important that EXPR be a
10271 TARGET_EXPR below since otherwise the INIT_EXPR will
10272 attempt to make a bitwise copy of EXPR to initialize
10274 if (TREE_CODE (expr
) != TARGET_EXPR
)
10275 expr
= get_target_expr (expr
);
10277 if (TREE_CODE (decl
) == FIELD_DECL
10278 && extra_warnings
&& !TREE_NO_WARNING (decl
))
10280 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
10281 "until the constructor exits", decl
);
10282 TREE_NO_WARNING (decl
) = true;
10285 /* Recursively extend temps in this initializer. */
10286 TARGET_EXPR_INITIAL (expr
)
10287 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
10289 /* Any reference temp has a non-trivial initializer. */
10290 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
10292 /* If the initializer is constant, put it in DECL_INITIAL so we get
10293 static initialization and use in constant expressions. */
10294 init
= maybe_constant_init (expr
);
10295 if (TREE_CONSTANT (init
))
10297 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
10299 /* 5.19 says that a constant expression can include an
10300 lvalue-rvalue conversion applied to "a glvalue of literal type
10301 that refers to a non-volatile temporary object initialized
10302 with a constant expression". Rather than try to communicate
10303 that this VAR_DECL is a temporary, just mark it constexpr.
10305 Currently this is only useful for initializer_list temporaries,
10306 since reference vars can't appear in constant expressions. */
10307 DECL_DECLARED_CONSTEXPR_P (var
) = true;
10308 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
10309 TREE_CONSTANT (var
) = true;
10311 DECL_INITIAL (var
) = init
;
10315 /* Create the INIT_EXPR that will initialize the temporary
10317 init
= split_nonconstant_init (var
, expr
);
10318 if (at_function_scope_p ())
10320 add_decl_expr (var
);
10322 if (TREE_STATIC (var
))
10323 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
10326 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
10328 vec_safe_push (*cleanups
, cleanup
);
10331 /* We must be careful to destroy the temporary only
10332 after its initialization has taken place. If the
10333 initialization throws an exception, then the
10334 destructor should not be run. We cannot simply
10335 transform INIT into something like:
10337 (INIT, ({ CLEANUP_STMT; }))
10339 because emit_local_var always treats the
10340 initializer as a full-expression. Thus, the
10341 destructor would run too early; it would run at the
10342 end of initializing the reference variable, rather
10343 than at the end of the block enclosing the
10344 reference variable.
10346 The solution is to pass back a cleanup expression
10347 which the caller is responsible for attaching to
10348 the statement tree. */
10352 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
10353 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
10355 if (CP_DECL_THREAD_LOCAL_P (var
))
10356 tls_aggregates
= tree_cons (NULL_TREE
, var
,
10359 static_aggregates
= tree_cons (NULL_TREE
, var
,
10360 static_aggregates
);
10363 /* Check whether the dtor is callable. */
10364 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
10366 /* Avoid -Wunused-variable warning (c++/38958). */
10367 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
10369 TREE_USED (decl
) = DECL_READ_P (decl
) = true;
10375 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
10376 initializing a variable of that TYPE. */
10379 initialize_reference (tree type
, tree expr
,
10380 int flags
, tsubst_flags_t complain
)
10384 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
10386 if (type
== error_mark_node
|| error_operand_p (expr
))
10387 return error_mark_node
;
10389 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10390 p
= conversion_obstack_alloc (0);
10392 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
10394 if (!conv
|| conv
->bad_p
)
10396 if (complain
& tf_error
)
10399 convert_like (conv
, expr
, complain
);
10400 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
10401 && !TYPE_REF_IS_RVALUE (type
)
10402 && !lvalue_p (expr
))
10403 error_at (loc
, "invalid initialization of non-const reference of "
10404 "type %qH from an rvalue of type %qI",
10405 type
, TREE_TYPE (expr
));
10407 error_at (loc
, "invalid initialization of reference of type "
10408 "%qH from expression of type %qI", type
,
10411 return error_mark_node
;
10414 if (conv
->kind
== ck_ref_bind
)
10415 /* Perform the conversion. */
10416 expr
= convert_like (conv
, expr
, complain
);
10417 else if (conv
->kind
== ck_ambig
)
10418 /* We gave an error in build_user_type_conversion_1. */
10419 expr
= error_mark_node
;
10421 gcc_unreachable ();
10423 /* Free all the conversions we allocated. */
10424 obstack_free (&conversion_obstack
, p
);
10429 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
10430 which is bound either to a reference or a std::initializer_list. */
10433 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
10438 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
10440 TREE_OPERAND (sub
, 1)
10441 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
10444 if (TREE_CODE (sub
) != ADDR_EXPR
)
10446 /* Deal with binding to a subobject. */
10447 for (p
= &TREE_OPERAND (sub
, 0); TREE_CODE (*p
) == COMPONENT_REF
; )
10448 p
= &TREE_OPERAND (*p
, 0);
10449 if (TREE_CODE (*p
) == TARGET_EXPR
)
10451 tree subinit
= NULL_TREE
;
10452 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
10453 recompute_tree_invariant_for_addr_expr (sub
);
10455 init
= fold_convert (TREE_TYPE (init
), sub
);
10457 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
10462 /* INIT is part of the initializer for DECL. If there are any
10463 reference or initializer lists being initialized, extend their
10464 lifetime to match that of DECL. */
10467 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
10469 tree type
= TREE_TYPE (init
);
10470 if (processing_template_decl
)
10472 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10473 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
10477 if (TREE_CODE (ctor
) == TARGET_EXPR
)
10478 ctor
= TARGET_EXPR_INITIAL (ctor
);
10479 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
10481 if (is_std_init_list (type
))
10483 /* The temporary array underlying a std::initializer_list
10484 is handled like a reference temporary. */
10485 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
10486 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
10487 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
10492 constructor_elt
*p
;
10493 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (ctor
);
10494 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
10495 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
10497 recompute_constructor_flags (ctor
);
10498 if (decl_maybe_constant_var_p (decl
) && TREE_CONSTANT (ctor
))
10499 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
10506 /* Returns true iff an initializer for TYPE could contain temporaries that
10507 need to be extended because they are bound to references or
10508 std::initializer_list. */
10511 type_has_extended_temps (tree type
)
10513 type
= strip_array_types (type
);
10514 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10516 if (CLASS_TYPE_P (type
))
10518 if (is_std_init_list (type
))
10520 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
10521 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
10522 if (type_has_extended_temps (TREE_TYPE (f
)))
10528 /* Returns true iff TYPE is some variant of std::initializer_list. */
10531 is_std_init_list (tree type
)
10533 if (!TYPE_P (type
))
10535 if (cxx_dialect
== cxx98
)
10537 /* Look through typedefs. */
10538 type
= TYPE_MAIN_VARIANT (type
);
10539 return (CLASS_TYPE_P (type
)
10540 && CP_TYPE_CONTEXT (type
) == std_node
10541 && init_list_identifier
== DECL_NAME (TYPE_NAME (type
)));
10544 /* Returns true iff DECL is a list constructor: i.e. a constructor which
10545 will accept an argument list of a single std::initializer_list<T>. */
10548 is_list_ctor (tree decl
)
10550 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
10553 if (!args
|| args
== void_list_node
)
10556 arg
= non_reference (TREE_VALUE (args
));
10557 if (!is_std_init_list (arg
))
10560 args
= TREE_CHAIN (args
);
10562 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
10563 /* There are more non-defaulted parms. */
10569 #include "gt-cp-call.h"