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 expression used in a context that requires a converted
4009 constant-expression, such as a template non-type parameter. Do any
4010 necessary conversions (that are permitted for converted
4011 constant-expressions) to convert it to the desired type.
4013 If conversion is successful, returns the converted expression;
4014 otherwise, returns error_mark_node. */
4017 build_converted_constant_expr (tree type
, tree expr
, tsubst_flags_t complain
)
4022 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
4024 if (error_operand_p (expr
))
4025 return error_mark_node
;
4027 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4028 p
= conversion_obstack_alloc (0);
4030 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
4032 LOOKUP_IMPLICIT
, complain
);
4034 /* A converted constant expression of type T is an expression, implicitly
4035 converted to type T, where the converted expression is a constant
4036 expression and the implicit conversion sequence contains only
4038 * user-defined conversions,
4039 * lvalue-to-rvalue conversions (7.1),
4040 * array-to-pointer conversions (7.2),
4041 * function-to-pointer conversions (7.3),
4042 * qualification conversions (7.5),
4043 * integral promotions (7.6),
4044 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4045 * null pointer conversions (7.11) from std::nullptr_t,
4046 * null member pointer conversions (7.12) from std::nullptr_t, and
4047 * function pointer conversions (7.13),
4049 and where the reference binding (if any) binds directly. */
4051 for (conversion
*c
= conv
;
4052 conv
&& c
->kind
!= ck_identity
;
4053 c
= next_conversion (c
))
4057 /* A conversion function is OK. If it isn't constexpr, we'll
4058 complain later that the argument isn't constant. */
4060 /* The lvalue-to-rvalue conversion is OK. */
4062 /* Array-to-pointer and function-to-pointer. */
4064 /* Function pointer conversions. */
4066 /* Qualification conversions. */
4071 if (c
->need_temporary_p
)
4073 if (complain
& tf_error
)
4074 error_at (loc
, "initializing %qH with %qI in converted "
4075 "constant expression does not bind directly",
4076 type
, next_conversion (c
)->type
);
4085 t
= next_conversion (c
)->type
;
4086 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
)
4087 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
4088 /* Integral promotion or conversion. */
4090 if (NULLPTR_TYPE_P (t
))
4091 /* Conversion from nullptr to pointer or pointer-to-member. */
4094 if (complain
& tf_error
)
4095 error_at (loc
, "conversion from %qH to %qI in a "
4096 "converted constant expression", t
, type
);
4105 /* Avoid confusing convert_nontype_argument by introducing
4106 a redundant conversion to the same reference type. */
4107 if (conv
&& conv
->kind
== ck_ref_bind
4108 && REFERENCE_REF_P (expr
))
4110 tree ref
= TREE_OPERAND (expr
, 0);
4111 if (same_type_p (type
, TREE_TYPE (ref
)))
4116 expr
= convert_like (conv
, expr
, complain
);
4118 expr
= error_mark_node
;
4120 /* Free all the conversions we allocated. */
4121 obstack_free (&conversion_obstack
, p
);
4126 /* Do any initial processing on the arguments to a function call. */
4128 static vec
<tree
, va_gc
> *
4129 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
4134 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
4136 if (error_operand_p (arg
))
4138 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
4140 if (complain
& tf_error
)
4141 error ("invalid use of void expression");
4144 else if (invalid_nonstatic_memfn_p (input_location
, arg
, complain
))
4150 /* Perform overload resolution on FN, which is called with the ARGS.
4152 Return the candidate function selected by overload resolution, or
4153 NULL if the event that overload resolution failed. In the case
4154 that overload resolution fails, *CANDIDATES will be the set of
4155 candidates considered, and ANY_VIABLE_P will be set to true or
4156 false to indicate whether or not any of the candidates were
4159 The ARGS should already have gone through RESOLVE_ARGS before this
4160 function is called. */
4162 static struct z_candidate
*
4163 perform_overload_resolution (tree fn
,
4164 const vec
<tree
, va_gc
> *args
,
4165 struct z_candidate
**candidates
,
4166 bool *any_viable_p
, tsubst_flags_t complain
)
4168 struct z_candidate
*cand
;
4169 tree explicit_targs
;
4172 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4174 explicit_targs
= NULL_TREE
;
4178 *any_viable_p
= true;
4181 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4182 || TREE_CODE (fn
) == TEMPLATE_DECL
4183 || TREE_CODE (fn
) == OVERLOAD
4184 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
4186 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4188 explicit_targs
= TREE_OPERAND (fn
, 1);
4189 fn
= TREE_OPERAND (fn
, 0);
4193 /* Add the various candidate functions. */
4194 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
4195 explicit_targs
, template_only
,
4196 /*conversion_path=*/NULL_TREE
,
4197 /*access_path=*/NULL_TREE
,
4199 candidates
, complain
);
4201 *candidates
= splice_viable (*candidates
, false, any_viable_p
);
4203 cand
= tourney (*candidates
, complain
);
4207 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4211 /* Print an error message about being unable to build a call to FN with
4212 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4213 be located; CANDIDATES is a possibly empty list of such
4217 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
,
4218 struct z_candidate
*candidates
)
4220 tree targs
= NULL_TREE
;
4221 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4223 targs
= TREE_OPERAND (fn
, 1);
4224 fn
= TREE_OPERAND (fn
, 0);
4226 tree name
= OVL_NAME (fn
);
4227 location_t loc
= location_of (name
);
4229 name
= lookup_template_function (name
, targs
);
4231 if (!any_strictly_viable (candidates
))
4232 error_at (loc
, "no matching function for call to %<%D(%A)%>",
4233 name
, build_tree_list_vec (args
));
4235 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
4236 name
, build_tree_list_vec (args
));
4238 print_z_candidates (loc
, candidates
);
4241 /* Return an expression for a call to FN (a namespace-scope function,
4242 or a static member function) with the ARGS. This may change
4246 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
,
4247 tsubst_flags_t complain
)
4249 struct z_candidate
*candidates
, *cand
;
4254 if (args
!= NULL
&& *args
!= NULL
)
4256 *args
= resolve_args (*args
, complain
);
4258 return error_mark_node
;
4262 tm_malloc_replacement (fn
);
4264 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4265 p
= conversion_obstack_alloc (0);
4267 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
4272 if (complain
& tf_error
)
4274 // If there is a single (non-viable) function candidate,
4275 // let the error be diagnosed by cp_build_function_call_vec.
4276 if (!any_viable_p
&& candidates
&& ! candidates
->next
4277 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
4278 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
4280 // Otherwise, emit notes for non-viable candidates.
4281 print_error_for_call_failure (fn
, *args
, candidates
);
4283 result
= error_mark_node
;
4287 int flags
= LOOKUP_NORMAL
;
4288 /* If fn is template_id_expr, the call has explicit template arguments
4289 (e.g. func<int>(5)), communicate this info to build_over_call
4290 through flags so that later we can use it to decide whether to warn
4291 about peculiar null pointer conversion. */
4292 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4294 /* If overload resolution selects a specialization of a
4295 function concept for non-dependent template arguments,
4296 the expression is true if the constraints are satisfied
4297 and false otherwise.
4299 NOTE: This is an extension of Concepts Lite TS that
4300 allows constraints to be used in expressions. */
4301 if (flag_concepts
&& !processing_template_decl
)
4303 tree tmpl
= DECL_TI_TEMPLATE (cand
->fn
);
4304 tree targs
= DECL_TI_ARGS (cand
->fn
);
4305 tree decl
= DECL_TEMPLATE_RESULT (tmpl
);
4306 if (DECL_DECLARED_CONCEPT_P (decl
))
4307 return evaluate_function_concept (decl
, targs
);
4310 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4313 result
= build_over_call (cand
, flags
, complain
);
4316 /* Free all the conversions we allocated. */
4317 obstack_free (&conversion_obstack
, p
);
4322 /* Build a call to a global operator new. FNNAME is the name of the
4323 operator (either "operator new" or "operator new[]") and ARGS are
4324 the arguments provided. This may change ARGS. *SIZE points to the
4325 total number of bytes required by the allocation, and is updated if
4326 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4327 be used. If this function determines that no cookie should be
4328 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4329 is not NULL_TREE, it is evaluated before calculating the final
4330 array size, and if it fails, the array size is replaced with
4331 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4332 is non-NULL, it will be set, upon return, to the allocation
4336 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4337 tree
*size
, tree
*cookie_size
,
4338 tree align_arg
, tree size_check
,
4339 tree
*fn
, tsubst_flags_t complain
)
4341 tree original_size
= *size
;
4343 struct z_candidate
*candidates
;
4344 struct z_candidate
*cand
= NULL
;
4349 /* Set to (size_t)-1 if the size check fails. */
4350 if (size_check
!= NULL_TREE
)
4352 tree errval
= TYPE_MAX_VALUE (sizetype
);
4353 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4354 errval
= throw_bad_array_new_length ();
4355 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4356 original_size
, errval
);
4358 vec_safe_insert (*args
, 0, *size
);
4359 *args
= resolve_args (*args
, complain
);
4361 return error_mark_node
;
4367 If this lookup fails to find the name, or if the allocated type
4368 is not a class type, the allocation function's name is looked
4369 up in the global scope.
4371 we disregard block-scope declarations of "operator new". */
4372 fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/false, 0, 0);
4373 fns
= lookup_arg_dependent (fnname
, fns
, *args
);
4377 vec
<tree
, va_gc
>* align_args
4378 = vec_copy_and_insert (*args
, align_arg
, 1);
4379 cand
= perform_overload_resolution (fns
, align_args
, &candidates
,
4380 &any_viable_p
, tf_none
);
4381 /* If no aligned allocation function matches, try again without the
4385 /* Figure out what function is being called. */
4387 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
4390 /* If no suitable function could be found, issue an error message
4394 if (complain
& tf_error
)
4395 print_error_for_call_failure (fns
, *args
, candidates
);
4396 return error_mark_node
;
4399 /* If a cookie is required, add some extra space. Whether
4400 or not a cookie is required cannot be determined until
4401 after we know which function was called. */
4404 bool use_cookie
= true;
4407 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4408 /* Skip the size_t parameter. */
4409 arg_types
= TREE_CHAIN (arg_types
);
4410 /* Check the remaining parameters (if any). */
4412 && TREE_CHAIN (arg_types
) == void_list_node
4413 && same_type_p (TREE_VALUE (arg_types
),
4416 /* If we need a cookie, adjust the number of bytes allocated. */
4419 /* Update the total size. */
4420 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4423 /* Set to (size_t)-1 if the size check fails. */
4424 gcc_assert (size_check
!= NULL_TREE
);
4425 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4426 *size
, TYPE_MAX_VALUE (sizetype
));
4428 /* Update the argument list to reflect the adjusted size. */
4429 (**args
)[0] = *size
;
4432 *cookie_size
= NULL_TREE
;
4435 /* Tell our caller which function we decided to call. */
4439 /* Build the CALL_EXPR. */
4440 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4443 /* Build a new call to operator(). This may change ARGS. */
4446 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4448 struct z_candidate
*candidates
= 0, *cand
;
4449 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4450 tree type
= TREE_TYPE (obj
);
4452 tree result
= NULL_TREE
;
4455 if (error_operand_p (obj
))
4456 return error_mark_node
;
4458 obj
= prep_operand (obj
);
4460 if (TYPE_PTRMEMFUNC_P (type
))
4462 if (complain
& tf_error
)
4463 /* It's no good looking for an overloaded operator() on a
4464 pointer-to-member-function. */
4465 error ("pointer-to-member function %qE cannot be called without "
4466 "an object; consider using %<.*%> or %<->*%>", obj
);
4467 return error_mark_node
;
4470 if (TYPE_BINFO (type
))
4472 fns
= lookup_fnfields (TYPE_BINFO (type
), cp_operator_id (CALL_EXPR
), 1);
4473 if (fns
== error_mark_node
)
4474 return error_mark_node
;
4479 if (args
!= NULL
&& *args
!= NULL
)
4481 *args
= resolve_args (*args
, complain
);
4483 return error_mark_node
;
4486 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4487 p
= conversion_obstack_alloc (0);
4491 first_mem_arg
= obj
;
4493 add_candidates (BASELINK_FUNCTIONS (fns
),
4494 first_mem_arg
, *args
, NULL_TREE
,
4496 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4497 LOOKUP_NORMAL
, &candidates
, complain
);
4500 convs
= lookup_conversions (type
);
4502 for (; convs
; convs
= TREE_CHAIN (convs
))
4504 tree totype
= TREE_TYPE (convs
);
4506 if (TYPE_PTRFN_P (totype
)
4507 || TYPE_REFFN_P (totype
)
4508 || (TREE_CODE (totype
) == REFERENCE_TYPE
4509 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4510 for (ovl_iterator
iter (TREE_VALUE (convs
)); iter
; ++iter
)
4514 if (DECL_NONCONVERTING_P (fn
))
4517 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4518 add_template_conv_candidate
4519 (&candidates
, fn
, obj
, *args
, totype
,
4520 /*access_path=*/NULL_TREE
,
4521 /*conversion_path=*/NULL_TREE
, complain
);
4523 add_conv_candidate (&candidates
, fn
, obj
,
4524 *args
, /*conversion_path=*/NULL_TREE
,
4525 /*access_path=*/NULL_TREE
, complain
);
4529 /* Be strict here because if we choose a bad conversion candidate, the
4530 errors we get won't mention the call context. */
4531 candidates
= splice_viable (candidates
, true, &any_viable_p
);
4534 if (complain
& tf_error
)
4536 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4537 build_tree_list_vec (*args
));
4538 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4540 result
= error_mark_node
;
4544 cand
= tourney (candidates
, complain
);
4547 if (complain
& tf_error
)
4549 error ("call of %<(%T) (%A)%> is ambiguous",
4550 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4551 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4553 result
= error_mark_node
;
4555 /* Since cand->fn will be a type, not a function, for a conversion
4556 function, we must be careful not to unconditionally look at
4558 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4559 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
) == CALL_EXPR
)
4560 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4563 if (DECL_P (cand
->fn
))
4564 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
,
4567 obj
= convert_like (cand
->convs
[0], obj
, complain
);
4568 obj
= convert_from_reference (obj
);
4569 result
= cp_build_function_call_vec (obj
, args
, complain
);
4573 /* Free all the conversions we allocated. */
4574 obstack_free (&conversion_obstack
, p
);
4579 /* Wrapper for above. */
4582 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4585 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4586 ret
= build_op_call_1 (obj
, args
, complain
);
4587 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4591 /* Called by op_error to prepare format strings suitable for the error
4592 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4593 and a suffix (controlled by NTYPES). */
4596 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4600 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4601 : G_("no match for "), errmsg
, NULL
);
4604 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4605 else if (ntypes
== 2)
4606 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4608 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4614 op_error (location_t loc
, enum tree_code code
, enum tree_code code2
,
4615 tree arg1
, tree arg2
, tree arg3
, bool match
)
4619 if (code
== MODIFY_EXPR
)
4620 opname
= assignment_operator_name_info
[code2
].name
;
4622 opname
= operator_name_info
[code
].name
;
4627 if (flag_diagnostics_show_caret
)
4628 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4630 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4632 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4633 "in %<%E ? %E : %E%>"), 3, match
),
4635 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4638 case POSTINCREMENT_EXPR
:
4639 case POSTDECREMENT_EXPR
:
4640 if (flag_diagnostics_show_caret
)
4641 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4642 opname
, TREE_TYPE (arg1
));
4644 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4646 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4650 if (flag_diagnostics_show_caret
)
4651 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4652 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4654 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4656 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4661 if (flag_diagnostics_show_caret
)
4662 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4663 opname
, TREE_TYPE (arg1
));
4665 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4666 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4671 if (flag_diagnostics_show_caret
)
4672 error_at (loc
, op_error_string (G_("%<operator%s%>"), 2, match
),
4673 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4675 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4677 opname
, arg1
, opname
, arg2
,
4678 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4680 if (flag_diagnostics_show_caret
)
4681 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4682 opname
, TREE_TYPE (arg1
));
4684 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4686 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4691 /* Return the implicit conversion sequence that could be used to
4692 convert E1 to E2 in [expr.cond]. */
4695 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4697 tree t1
= non_reference (TREE_TYPE (e1
));
4698 tree t2
= non_reference (TREE_TYPE (e2
));
4704 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4705 implicitly converted (clause _conv_) to the type "lvalue reference to
4706 T2", subject to the constraint that in the conversion the
4707 reference must bind directly (_dcl.init.ref_) to an lvalue.
4709 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4710 implicitly converted to the type "rvalue reference to T2", subject to
4711 the constraint that the reference must bind directly. */
4714 tree rtype
= cp_build_reference_type (t2
, !lvalue_p (e2
));
4715 conv
= implicit_conversion (rtype
,
4719 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4720 |LOOKUP_ONLYCONVERTING
,
4722 if (conv
&& !conv
->bad_p
)
4726 /* If E2 is a prvalue or if neither of the conversions above can be done
4727 and at least one of the operands has (possibly cv-qualified) class
4729 if (!CLASS_TYPE_P (t1
) && !CLASS_TYPE_P (t2
))
4734 If E1 and E2 have class type, and the underlying class types are
4735 the same or one is a base class of the other: E1 can be converted
4736 to match E2 if the class of T2 is the same type as, or a base
4737 class of, the class of T1, and the cv-qualification of T2 is the
4738 same cv-qualification as, or a greater cv-qualification than, the
4739 cv-qualification of T1. If the conversion is applied, E1 is
4740 changed to an rvalue of type T2 that still refers to the original
4741 source class object (or the appropriate subobject thereof). */
4742 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4743 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4745 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4747 conv
= build_identity_conv (t1
, e1
);
4748 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4749 TYPE_MAIN_VARIANT (t2
)))
4750 conv
= build_conv (ck_base
, t2
, conv
);
4752 conv
= build_conv (ck_rvalue
, t2
, conv
);
4761 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4762 converted to the type that expression E2 would have if E2 were
4763 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4764 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4765 LOOKUP_IMPLICIT
, complain
);
4768 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4769 arguments to the conditional expression. */
4772 build_conditional_expr_1 (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
4773 tsubst_flags_t complain
)
4777 tree result
= NULL_TREE
;
4778 tree result_type
= NULL_TREE
;
4779 bool is_lvalue
= true;
4780 struct z_candidate
*candidates
= 0;
4781 struct z_candidate
*cand
;
4783 tree orig_arg2
, orig_arg3
;
4785 /* As a G++ extension, the second argument to the conditional can be
4786 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4787 c'.) If the second operand is omitted, make sure it is
4788 calculated only once. */
4791 if (complain
& tf_error
)
4792 pedwarn (loc
, OPT_Wpedantic
,
4793 "ISO C++ forbids omitting the middle term of a ?: expression");
4795 if ((complain
& tf_warning
) && !truth_value_p (TREE_CODE (arg1
)))
4796 warn_for_omitted_condop (loc
, arg1
);
4798 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4799 if (lvalue_p (arg1
))
4800 arg2
= arg1
= cp_stabilize_reference (arg1
);
4802 arg2
= arg1
= save_expr (arg1
);
4805 /* If something has already gone wrong, just pass that fact up the
4807 if (error_operand_p (arg1
)
4808 || error_operand_p (arg2
)
4809 || error_operand_p (arg3
))
4810 return error_mark_node
;
4815 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
4817 tree arg1_type
= TREE_TYPE (arg1
);
4819 /* If arg1 is another cond_expr choosing between -1 and 0,
4820 then we can use its comparison. It may help to avoid
4821 additional comparison, produce more accurate diagnostics
4822 and enables folding. */
4823 if (TREE_CODE (arg1
) == VEC_COND_EXPR
4824 && integer_minus_onep (TREE_OPERAND (arg1
, 1))
4825 && integer_zerop (TREE_OPERAND (arg1
, 2)))
4826 arg1
= TREE_OPERAND (arg1
, 0);
4828 arg1
= force_rvalue (arg1
, complain
);
4829 arg2
= force_rvalue (arg2
, complain
);
4830 arg3
= force_rvalue (arg3
, complain
);
4832 /* force_rvalue can return error_mark on valid arguments. */
4833 if (error_operand_p (arg1
)
4834 || error_operand_p (arg2
)
4835 || error_operand_p (arg3
))
4836 return error_mark_node
;
4838 arg2_type
= TREE_TYPE (arg2
);
4839 arg3_type
= TREE_TYPE (arg3
);
4841 if (!VECTOR_TYPE_P (arg2_type
)
4842 && !VECTOR_TYPE_P (arg3_type
))
4844 /* Rely on the error messages of the scalar version. */
4845 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
4846 orig_arg2
, orig_arg3
, complain
);
4847 if (scal
== error_mark_node
)
4848 return error_mark_node
;
4849 tree stype
= TREE_TYPE (scal
);
4850 tree ctype
= TREE_TYPE (arg1_type
);
4851 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
4852 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
4854 if (complain
& tf_error
)
4855 error_at (loc
, "inferred scalar type %qT is not an integer or "
4856 "floating point type of the same size as %qT", stype
,
4857 COMPARISON_CLASS_P (arg1
)
4858 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
4860 return error_mark_node
;
4863 tree vtype
= build_opaque_vector_type (stype
,
4864 TYPE_VECTOR_SUBPARTS (arg1_type
));
4865 /* We could pass complain & tf_warning to unsafe_conversion_p,
4866 but the warnings (like Wsign-conversion) have already been
4867 given by the scalar build_conditional_expr_1. We still check
4868 unsafe_conversion_p to forbid truncating long long -> float. */
4869 if (unsafe_conversion_p (loc
, stype
, arg2
, NULL_TREE
, false))
4871 if (complain
& tf_error
)
4872 error_at (loc
, "conversion of scalar %qH to vector %qI "
4873 "involves truncation", arg2_type
, vtype
);
4874 return error_mark_node
;
4876 if (unsafe_conversion_p (loc
, stype
, arg3
, NULL_TREE
, false))
4878 if (complain
& tf_error
)
4879 error_at (loc
, "conversion of scalar %qH to vector %qI "
4880 "involves truncation", arg3_type
, vtype
);
4881 return error_mark_node
;
4884 arg2
= cp_convert (stype
, arg2
, complain
);
4885 arg2
= save_expr (arg2
);
4886 arg2
= build_vector_from_val (vtype
, arg2
);
4888 arg3
= cp_convert (stype
, arg3
, complain
);
4889 arg3
= save_expr (arg3
);
4890 arg3
= build_vector_from_val (vtype
, arg3
);
4894 if (VECTOR_TYPE_P (arg2_type
) != VECTOR_TYPE_P (arg3_type
))
4896 enum stv_conv convert_flag
=
4897 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
4898 complain
& tf_error
);
4900 switch (convert_flag
)
4903 return error_mark_node
;
4906 arg2
= save_expr (arg2
);
4907 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
4908 arg2
= build_vector_from_val (arg3_type
, arg2
);
4909 arg2_type
= TREE_TYPE (arg2
);
4914 arg3
= save_expr (arg3
);
4915 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
4916 arg3
= build_vector_from_val (arg2_type
, arg3
);
4917 arg3_type
= TREE_TYPE (arg3
);
4925 if (!same_type_p (arg2_type
, arg3_type
)
4926 || TYPE_VECTOR_SUBPARTS (arg1_type
)
4927 != TYPE_VECTOR_SUBPARTS (arg2_type
)
4928 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
4930 if (complain
& tf_error
)
4932 "incompatible vector types in conditional expression: "
4933 "%qT, %qT and %qT", TREE_TYPE (arg1
),
4934 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
4935 return error_mark_node
;
4938 if (!COMPARISON_CLASS_P (arg1
))
4940 tree cmp_type
= build_same_sized_truth_vector_type (arg1_type
);
4941 arg1
= build2 (NE_EXPR
, cmp_type
, arg1
, build_zero_cst (arg1_type
));
4943 return build3_loc (loc
, VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
4948 The first expression is implicitly converted to bool (clause
4950 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
4952 if (error_operand_p (arg1
))
4953 return error_mark_node
;
4957 If either the second or the third operand has type (possibly
4958 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4959 array-to-pointer (_conv.array_), and function-to-pointer
4960 (_conv.func_) standard conversions are performed on the second
4961 and third operands. */
4962 arg2_type
= unlowered_expr_type (arg2
);
4963 arg3_type
= unlowered_expr_type (arg3
);
4964 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
4966 /* Do the conversions. We don't these for `void' type arguments
4967 since it can't have any effect and since decay_conversion
4968 does not handle that case gracefully. */
4969 if (!VOID_TYPE_P (arg2_type
))
4970 arg2
= decay_conversion (arg2
, complain
);
4971 if (!VOID_TYPE_P (arg3_type
))
4972 arg3
= decay_conversion (arg3
, complain
);
4973 arg2_type
= TREE_TYPE (arg2
);
4974 arg3_type
= TREE_TYPE (arg3
);
4978 One of the following shall hold:
4980 --The second or the third operand (but not both) is a
4981 throw-expression (_except.throw_); the result is of the
4982 type of the other and is an rvalue.
4984 --Both the second and the third operands have type void; the
4985 result is of type void and is an rvalue.
4987 We must avoid calling force_rvalue for expressions of type
4988 "void" because it will complain that their value is being
4990 if (TREE_CODE (arg2
) == THROW_EXPR
4991 && TREE_CODE (arg3
) != THROW_EXPR
)
4993 if (!VOID_TYPE_P (arg3_type
))
4995 arg3
= force_rvalue (arg3
, complain
);
4996 if (arg3
== error_mark_node
)
4997 return error_mark_node
;
4999 arg3_type
= TREE_TYPE (arg3
);
5000 result_type
= arg3_type
;
5002 else if (TREE_CODE (arg2
) != THROW_EXPR
5003 && TREE_CODE (arg3
) == THROW_EXPR
)
5005 if (!VOID_TYPE_P (arg2_type
))
5007 arg2
= force_rvalue (arg2
, complain
);
5008 if (arg2
== error_mark_node
)
5009 return error_mark_node
;
5011 arg2_type
= TREE_TYPE (arg2
);
5012 result_type
= arg2_type
;
5014 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
5015 result_type
= void_type_node
;
5018 if (complain
& tf_error
)
5020 if (VOID_TYPE_P (arg2_type
))
5021 error_at (EXPR_LOC_OR_LOC (arg3
, loc
),
5022 "second operand to the conditional operator "
5023 "is of type %<void%>, but the third operand is "
5024 "neither a throw-expression nor of type %<void%>");
5026 error_at (EXPR_LOC_OR_LOC (arg2
, loc
),
5027 "third operand to the conditional operator "
5028 "is of type %<void%>, but the second operand is "
5029 "neither a throw-expression nor of type %<void%>");
5031 return error_mark_node
;
5035 goto valid_operands
;
5039 Otherwise, if the second and third operand have different types,
5040 and either has (possibly cv-qualified) class type, or if both are
5041 glvalues of the same value category and the same type except for
5042 cv-qualification, an attempt is made to convert each of those operands
5043 to the type of the other. */
5044 else if (!same_type_p (arg2_type
, arg3_type
)
5045 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)
5046 || (same_type_ignoring_top_level_qualifiers_p (arg2_type
,
5048 && glvalue_p (arg2
) && glvalue_p (arg3
)
5049 && lvalue_p (arg2
) == lvalue_p (arg3
))))
5053 bool converted
= false;
5055 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5056 p
= conversion_obstack_alloc (0);
5058 conv2
= conditional_conversion (arg2
, arg3
, complain
);
5059 conv3
= conditional_conversion (arg3
, arg2
, complain
);
5063 If both can be converted, or one can be converted but the
5064 conversion is ambiguous, the program is ill-formed. If
5065 neither can be converted, the operands are left unchanged and
5066 further checking is performed as described below. If exactly
5067 one conversion is possible, that conversion is applied to the
5068 chosen operand and the converted operand is used in place of
5069 the original operand for the remainder of this section. */
5070 if ((conv2
&& !conv2
->bad_p
5071 && conv3
&& !conv3
->bad_p
)
5072 || (conv2
&& conv2
->kind
== ck_ambig
)
5073 || (conv3
&& conv3
->kind
== ck_ambig
))
5075 if (complain
& tf_error
)
5077 error_at (loc
, "operands to ?: have different types %qT and %qT",
5078 arg2_type
, arg3_type
);
5079 if (conv2
&& !conv2
->bad_p
&& conv3
&& !conv3
->bad_p
)
5080 inform (loc
, " and each type can be converted to the other");
5081 else if (conv2
&& conv2
->kind
== ck_ambig
)
5082 convert_like (conv2
, arg2
, complain
);
5084 convert_like (conv3
, arg3
, complain
);
5086 result
= error_mark_node
;
5088 else if (conv2
&& !conv2
->bad_p
)
5090 arg2
= convert_like (conv2
, arg2
, complain
);
5091 arg2
= convert_from_reference (arg2
);
5092 arg2_type
= TREE_TYPE (arg2
);
5093 /* Even if CONV2 is a valid conversion, the result of the
5094 conversion may be invalid. For example, if ARG3 has type
5095 "volatile X", and X does not have a copy constructor
5096 accepting a "volatile X&", then even if ARG2 can be
5097 converted to X, the conversion will fail. */
5098 if (error_operand_p (arg2
))
5099 result
= error_mark_node
;
5102 else if (conv3
&& !conv3
->bad_p
)
5104 arg3
= convert_like (conv3
, arg3
, complain
);
5105 arg3
= convert_from_reference (arg3
);
5106 arg3_type
= TREE_TYPE (arg3
);
5107 if (error_operand_p (arg3
))
5108 result
= error_mark_node
;
5112 /* Free all the conversions we allocated. */
5113 obstack_free (&conversion_obstack
, p
);
5118 /* If, after the conversion, both operands have class type,
5119 treat the cv-qualification of both operands as if it were the
5120 union of the cv-qualification of the operands.
5122 The standard is not clear about what to do in this
5123 circumstance. For example, if the first operand has type
5124 "const X" and the second operand has a user-defined
5125 conversion to "volatile X", what is the type of the second
5126 operand after this step? Making it be "const X" (matching
5127 the first operand) seems wrong, as that discards the
5128 qualification without actually performing a copy. Leaving it
5129 as "volatile X" seems wrong as that will result in the
5130 conditional expression failing altogether, even though,
5131 according to this step, the one operand could be converted to
5132 the type of the other. */
5134 && CLASS_TYPE_P (arg2_type
)
5135 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
5136 arg2_type
= arg3_type
=
5137 cp_build_qualified_type (arg2_type
,
5138 cp_type_quals (arg2_type
)
5139 | cp_type_quals (arg3_type
));
5144 If the second and third operands are glvalues of the same value
5145 category and have the same type, the result is of that type and
5147 if (((lvalue_p (arg2
) && lvalue_p (arg3
))
5148 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
5149 && same_type_p (arg2_type
, arg3_type
))
5151 result_type
= arg2_type
;
5152 arg2
= mark_lvalue_use (arg2
);
5153 arg3
= mark_lvalue_use (arg3
);
5154 goto valid_operands
;
5159 Otherwise, the result is an rvalue. If the second and third
5160 operand do not have the same type, and either has (possibly
5161 cv-qualified) class type, overload resolution is used to
5162 determine the conversions (if any) to be applied to the operands
5163 (_over.match.oper_, _over.built_). */
5165 if (!same_type_p (arg2_type
, arg3_type
)
5166 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
5172 /* Rearrange the arguments so that add_builtin_candidate only has
5173 to know about two args. In build_builtin_candidate, the
5174 arguments are unscrambled. */
5178 add_builtin_candidates (&candidates
,
5181 cp_operator_id (COND_EXPR
),
5183 LOOKUP_NORMAL
, complain
);
5187 If the overload resolution fails, the program is
5189 candidates
= splice_viable (candidates
, false, &any_viable_p
);
5192 if (complain
& tf_error
)
5193 error_at (loc
, "operands to ?: have different types %qT and %qT",
5194 arg2_type
, arg3_type
);
5195 return error_mark_node
;
5197 cand
= tourney (candidates
, complain
);
5200 if (complain
& tf_error
)
5202 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
5203 print_z_candidates (loc
, candidates
);
5205 return error_mark_node
;
5210 Otherwise, the conversions thus determined are applied, and
5211 the converted operands are used in place of the original
5212 operands for the remainder of this section. */
5213 conv
= cand
->convs
[0];
5214 arg1
= convert_like (conv
, arg1
, complain
);
5215 conv
= cand
->convs
[1];
5216 arg2
= convert_like (conv
, arg2
, complain
);
5217 arg2_type
= TREE_TYPE (arg2
);
5218 conv
= cand
->convs
[2];
5219 arg3
= convert_like (conv
, arg3
, complain
);
5220 arg3_type
= TREE_TYPE (arg3
);
5225 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5226 and function-to-pointer (_conv.func_) standard conversions are
5227 performed on the second and third operands.
5229 We need to force the lvalue-to-rvalue conversion here for class types,
5230 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5231 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5234 arg2
= force_rvalue (arg2
, complain
);
5235 if (!CLASS_TYPE_P (arg2_type
))
5236 arg2_type
= TREE_TYPE (arg2
);
5238 arg3
= force_rvalue (arg3
, complain
);
5239 if (!CLASS_TYPE_P (arg3_type
))
5240 arg3_type
= TREE_TYPE (arg3
);
5242 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5243 return error_mark_node
;
5247 After those conversions, one of the following shall hold:
5249 --The second and third operands have the same type; the result is of
5251 if (same_type_p (arg2_type
, arg3_type
))
5252 result_type
= arg2_type
;
5255 --The second and third operands have arithmetic or enumeration
5256 type; the usual arithmetic conversions are performed to bring
5257 them to a common type, and the result is of that type. */
5258 else if ((ARITHMETIC_TYPE_P (arg2_type
)
5259 || UNSCOPED_ENUM_P (arg2_type
))
5260 && (ARITHMETIC_TYPE_P (arg3_type
)
5261 || UNSCOPED_ENUM_P (arg3_type
)))
5263 /* In this case, there is always a common type. */
5264 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
5266 if (complain
& tf_warning
)
5267 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
5268 "implicit conversion from %qH to %qI to "
5269 "match other result of conditional",
5272 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5273 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
5275 if (TREE_CODE (orig_arg2
) == CONST_DECL
5276 && TREE_CODE (orig_arg3
) == CONST_DECL
5277 && DECL_CONTEXT (orig_arg2
) == DECL_CONTEXT (orig_arg3
))
5278 /* Two enumerators from the same enumeration can have different
5279 types when the enumeration is still being defined. */;
5280 else if (complain
& tf_warning
)
5281 warning_at (loc
, OPT_Wenum_compare
, "enumeral mismatch in "
5282 "conditional expression: %qT vs %qT",
5283 arg2_type
, arg3_type
);
5285 else if (extra_warnings
5286 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5287 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
5288 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
5289 && !same_type_p (arg2_type
,
5290 type_promotes_to (arg3_type
)))))
5292 if (complain
& tf_warning
)
5293 warning_at (loc
, OPT_Wextra
, "enumeral and non-enumeral type in "
5294 "conditional expression");
5297 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5298 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5302 --The second and third operands have pointer type, or one has
5303 pointer type and the other is a null pointer constant; pointer
5304 conversions (_conv.ptr_) and qualification conversions
5305 (_conv.qual_) are performed to bring them to their composite
5306 pointer type (_expr.rel_). The result is of the composite
5309 --The second and third operands have pointer to member type, or
5310 one has pointer to member type and the other is a null pointer
5311 constant; pointer to member conversions (_conv.mem_) and
5312 qualification conversions (_conv.qual_) are performed to bring
5313 them to a common type, whose cv-qualification shall match the
5314 cv-qualification of either the second or the third operand.
5315 The result is of the common type. */
5316 else if ((null_ptr_cst_p (arg2
)
5317 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
5318 || (null_ptr_cst_p (arg3
)
5319 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
5320 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
5321 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
5322 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
5324 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
5325 arg3
, CPO_CONDITIONAL_EXPR
,
5327 if (result_type
== error_mark_node
)
5328 return error_mark_node
;
5329 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5330 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5335 if (complain
& tf_error
)
5336 error_at (loc
, "operands to ?: have different types %qT and %qT",
5337 arg2_type
, arg3_type
);
5338 return error_mark_node
;
5341 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5342 return error_mark_node
;
5345 result
= build3_loc (loc
, COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
5347 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5348 warn here, because the COND_EXPR will be turned into ARG2. */
5349 if (warn_duplicated_branches
5350 && (arg2
== arg3
|| operand_equal_p (arg2
, arg3
, 0)))
5351 warning_at (EXPR_LOCATION (result
), OPT_Wduplicated_branches
,
5352 "this condition has identical branches");
5354 /* We can't use result_type below, as fold might have returned a
5359 /* Expand both sides into the same slot, hopefully the target of
5360 the ?: expression. We used to check for TARGET_EXPRs here,
5361 but now we sometimes wrap them in NOP_EXPRs so the test would
5363 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5364 result
= get_target_expr_sfinae (result
, complain
);
5365 /* If this expression is an rvalue, but might be mistaken for an
5366 lvalue, we must add a NON_LVALUE_EXPR. */
5367 result
= rvalue (result
);
5370 result
= force_paren_expr (result
);
5375 /* Wrapper for above. */
5378 build_conditional_expr (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
5379 tsubst_flags_t complain
)
5382 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5383 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5384 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5388 /* OPERAND is an operand to an expression. Perform necessary steps
5389 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5393 prep_operand (tree operand
)
5397 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5398 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5399 /* Make sure the template type is instantiated now. */
5400 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5406 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5407 OVERLOAD) to the CANDIDATES, returning an updated list of
5408 CANDIDATES. The ARGS are the arguments provided to the call;
5409 if FIRST_ARG is non-null it is the implicit object argument,
5410 otherwise the first element of ARGS is used if needed. The
5411 EXPLICIT_TARGS are explicit template arguments provided.
5412 TEMPLATE_ONLY is true if only template functions should be
5413 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5414 add_function_candidate. */
5417 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5419 tree explicit_targs
, bool template_only
,
5420 tree conversion_path
, tree access_path
,
5422 struct z_candidate
**candidates
,
5423 tsubst_flags_t complain
)
5426 const vec
<tree
, va_gc
> *non_static_args
;
5427 bool check_list_ctor
;
5428 bool check_converting
;
5429 unification_kind_t strict
;
5434 /* Precalculate special handling of constructors and conversion ops. */
5435 tree fn
= OVL_FIRST (fns
);
5436 if (DECL_CONV_FN_P (fn
))
5438 check_list_ctor
= false;
5439 check_converting
= !!(flags
& LOOKUP_ONLYCONVERTING
);
5440 if (flags
& LOOKUP_NO_CONVERSION
)
5441 /* We're doing return_type(x). */
5442 strict
= DEDUCE_CONV
;
5444 /* We're doing x.operator return_type(). */
5445 strict
= DEDUCE_EXACT
;
5446 /* [over.match.funcs] For conversion functions, the function
5447 is considered to be a member of the class of the implicit
5448 object argument for the purpose of defining the type of
5449 the implicit object parameter. */
5450 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5454 if (DECL_CONSTRUCTOR_P (fn
))
5456 check_list_ctor
= !!(flags
& LOOKUP_LIST_ONLY
);
5457 /* For list-initialization we consider explicit constructors
5458 and complain if one is chosen. */
5460 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5461 == LOOKUP_ONLYCONVERTING
);
5465 check_list_ctor
= false;
5466 check_converting
= false;
5468 strict
= DEDUCE_CALL
;
5469 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5473 non_static_args
= args
;
5475 /* Delay creating the implicit this parameter until it is needed. */
5476 non_static_args
= NULL
;
5478 for (lkp_iterator
iter (fns
); iter
; ++iter
)
5481 const vec
<tree
, va_gc
> *fn_args
;
5485 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5487 if (check_list_ctor
&& !is_list_ctor (fn
))
5490 /* Figure out which set of arguments to use. */
5491 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5493 /* If this function is a non-static member and we didn't get an
5494 implicit object argument, move it out of args. */
5495 if (first_arg
== NULL_TREE
)
5499 vec
<tree
, va_gc
> *tempvec
;
5500 vec_alloc (tempvec
, args
->length () - 1);
5501 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5502 tempvec
->quick_push (arg
);
5503 non_static_args
= tempvec
;
5504 first_arg
= (*args
)[0];
5507 fn_first_arg
= first_arg
;
5508 fn_args
= non_static_args
;
5512 /* Otherwise, just use the list of arguments provided. */
5513 fn_first_arg
= NULL_TREE
;
5517 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5518 add_template_candidate (candidates
,
5530 else if (!template_only
)
5531 add_function_candidate (candidates
,
5543 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5544 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5547 op_is_ordered (tree_code code
)
5553 return (flag_strong_eval_order
> 1 ? -1 : 0);
5557 return (flag_strong_eval_order
> 1 ? 1 : 0);
5560 // Not overloadable (yet).
5562 // Only one argument.
5569 return (flag_strong_eval_order
? 1 : 0);
5577 build_new_op_1 (location_t loc
, enum tree_code code
, int flags
, tree arg1
,
5578 tree arg2
, tree arg3
, tree
*overload
, tsubst_flags_t complain
)
5580 struct z_candidate
*candidates
= 0, *cand
;
5581 vec
<tree
, va_gc
> *arglist
;
5584 tree result
= NULL_TREE
;
5585 bool result_valid_p
= false;
5586 enum tree_code code2
= NOP_EXPR
;
5587 enum tree_code code_orig_arg1
= ERROR_MARK
;
5588 enum tree_code code_orig_arg2
= ERROR_MARK
;
5594 if (error_operand_p (arg1
)
5595 || error_operand_p (arg2
)
5596 || error_operand_p (arg3
))
5597 return error_mark_node
;
5599 if (code
== MODIFY_EXPR
)
5601 code2
= TREE_CODE (arg3
);
5603 fnname
= cp_assignment_operator_id (code2
);
5606 fnname
= cp_operator_id (code
);
5608 arg1
= prep_operand (arg1
);
5610 bool memonly
= false;
5615 case VEC_DELETE_EXPR
:
5617 /* Use build_op_new_call and build_op_delete_call instead. */
5621 /* Use build_op_call instead. */
5624 case TRUTH_ORIF_EXPR
:
5625 case TRUTH_ANDIF_EXPR
:
5626 case TRUTH_AND_EXPR
:
5628 /* These are saved for the sake of warn_logical_operator. */
5629 code_orig_arg1
= TREE_CODE (arg1
);
5630 code_orig_arg2
= TREE_CODE (arg2
);
5638 /* These are saved for the sake of maybe_warn_bool_compare. */
5639 code_orig_arg1
= TREE_CODE (TREE_TYPE (arg1
));
5640 code_orig_arg2
= TREE_CODE (TREE_TYPE (arg2
));
5643 /* =, ->, [], () must be non-static member functions. */
5645 if (code2
!= NOP_EXPR
)
5657 arg2
= prep_operand (arg2
);
5658 arg3
= prep_operand (arg3
);
5660 if (code
== COND_EXPR
)
5661 /* Use build_conditional_expr instead. */
5663 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5664 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5667 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5668 arg2
= integer_zero_node
;
5670 vec_alloc (arglist
, 3);
5671 arglist
->quick_push (arg1
);
5672 if (arg2
!= NULL_TREE
)
5673 arglist
->quick_push (arg2
);
5674 if (arg3
!= NULL_TREE
)
5675 arglist
->quick_push (arg3
);
5677 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5678 p
= conversion_obstack_alloc (0);
5680 /* Add namespace-scope operators to the list of functions to
5684 tree fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/true, 0, 0);
5685 fns
= lookup_arg_dependent (fnname
, fns
, arglist
);
5686 add_candidates (fns
, NULL_TREE
, arglist
, NULL_TREE
,
5687 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5688 flags
, &candidates
, complain
);
5693 args
[2] = NULL_TREE
;
5695 /* Add class-member operators to the candidate set. */
5696 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5700 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5701 if (fns
== error_mark_node
)
5703 result
= error_mark_node
;
5704 goto user_defined_result_ready
;
5707 add_candidates (BASELINK_FUNCTIONS (fns
),
5708 NULL_TREE
, arglist
, NULL_TREE
,
5710 BASELINK_BINFO (fns
),
5711 BASELINK_ACCESS_BINFO (fns
),
5712 flags
, &candidates
, complain
);
5714 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5715 only non-member functions that have type T1 or reference to
5716 cv-qualified-opt T1 for the first argument, if the first argument
5717 has an enumeration type, or T2 or reference to cv-qualified-opt
5718 T2 for the second argument, if the second argument has an
5719 enumeration type. Filter out those that don't match. */
5720 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5722 struct z_candidate
**candp
, **next
;
5724 for (candp
= &candidates
; *candp
; candp
= next
)
5726 tree parmlist
, parmtype
;
5727 int i
, nargs
= (arg2
? 2 : 1);
5732 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5734 for (i
= 0; i
< nargs
; ++i
)
5736 parmtype
= TREE_VALUE (parmlist
);
5738 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
5739 parmtype
= TREE_TYPE (parmtype
);
5740 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5741 && (same_type_ignoring_top_level_qualifiers_p
5742 (TREE_TYPE (args
[i
]), parmtype
)))
5745 parmlist
= TREE_CHAIN (parmlist
);
5748 /* No argument has an appropriate type, so remove this
5749 candidate function from the list. */
5752 *candp
= cand
->next
;
5758 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5765 /* For these, the built-in candidates set is empty
5766 [over.match.oper]/3. We don't want non-strict matches
5767 because exact matches are always possible with built-in
5768 operators. The built-in candidate set for COMPONENT_REF
5769 would be empty too, but since there are no such built-in
5770 operators, we accept non-strict matches for them. */
5779 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5784 case POSTINCREMENT_EXPR
:
5785 case POSTDECREMENT_EXPR
:
5786 /* Don't try anything fancy if we're not allowed to produce
5788 if (!(complain
& tf_error
))
5789 return error_mark_node
;
5791 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5792 distinguish between prefix and postfix ++ and
5793 operator++() was used for both, so we allow this with
5797 const char *msg
= (flag_permissive
)
5798 ? G_("no %<%D(int)%> declared for postfix %qs,"
5799 " trying prefix operator instead")
5800 : G_("no %<%D(int)%> declared for postfix %qs");
5801 permerror (loc
, msg
, fnname
, operator_name_info
[code
].name
);
5804 if (!flag_permissive
)
5805 return error_mark_node
;
5807 if (code
== POSTINCREMENT_EXPR
)
5808 code
= PREINCREMENT_EXPR
;
5810 code
= PREDECREMENT_EXPR
;
5811 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5812 NULL_TREE
, overload
, complain
);
5815 /* The caller will deal with these. */
5820 result_valid_p
= true;
5824 if (complain
& tf_error
)
5826 /* If one of the arguments of the operator represents
5827 an invalid use of member function pointer, try to report
5828 a meaningful error ... */
5829 if (invalid_nonstatic_memfn_p (loc
, arg1
, tf_error
)
5830 || invalid_nonstatic_memfn_p (loc
, arg2
, tf_error
)
5831 || invalid_nonstatic_memfn_p (loc
, arg3
, tf_error
))
5832 /* We displayed the error message. */;
5835 /* ... Otherwise, report the more generic
5836 "no matching operator found" error */
5837 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
5838 print_z_candidates (loc
, candidates
);
5841 result
= error_mark_node
;
5847 cand
= tourney (candidates
, complain
);
5850 if (complain
& tf_error
)
5852 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
5853 print_z_candidates (loc
, candidates
);
5855 result
= error_mark_node
;
5857 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
5860 *overload
= cand
->fn
;
5862 if (resolve_args (arglist
, complain
) == NULL
)
5863 result
= error_mark_node
;
5865 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5867 if (trivial_fn_p (cand
->fn
))
5868 /* There won't be a CALL_EXPR. */;
5869 else if (result
&& result
!= error_mark_node
)
5871 tree call
= extract_call_expr (result
);
5872 CALL_EXPR_OPERATOR_SYNTAX (call
) = true;
5874 if (processing_template_decl
&& DECL_HIDDEN_FRIEND_P (cand
->fn
))
5875 /* This prevents build_new_function_call from discarding this
5876 function during instantiation of the enclosing template. */
5877 KOENIG_LOOKUP_P (call
) = 1;
5879 /* Specify evaluation order as per P0145R2. */
5880 CALL_EXPR_ORDERED_ARGS (call
) = false;
5881 switch (op_is_ordered (code
))
5884 CALL_EXPR_REVERSE_ARGS (call
) = true;
5888 CALL_EXPR_ORDERED_ARGS (call
) = true;
5898 /* Give any warnings we noticed during overload resolution. */
5899 if (cand
->warnings
&& (complain
& tf_warning
))
5901 struct candidate_warning
*w
;
5902 for (w
= cand
->warnings
; w
; w
= w
->next
)
5903 joust (cand
, w
->loser
, 1, complain
);
5906 /* Check for comparison of different enum types. */
5915 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
5916 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
5917 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
5918 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
5919 && (complain
& tf_warning
))
5921 warning (OPT_Wenum_compare
,
5922 "comparison between %q#T and %q#T",
5923 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
5930 /* We need to strip any leading REF_BIND so that bitfields
5931 don't cause errors. This should not remove any important
5932 conversions, because builtins don't apply to class
5933 objects directly. */
5934 conv
= cand
->convs
[0];
5935 if (conv
->kind
== ck_ref_bind
)
5936 conv
= next_conversion (conv
);
5937 arg1
= convert_like (conv
, arg1
, complain
);
5941 conv
= cand
->convs
[1];
5942 if (conv
->kind
== ck_ref_bind
)
5943 conv
= next_conversion (conv
);
5945 arg2
= decay_conversion (arg2
, complain
);
5947 /* We need to call warn_logical_operator before
5948 converting arg2 to a boolean_type, but after
5949 decaying an enumerator to its value. */
5950 if (complain
& tf_warning
)
5951 warn_logical_operator (loc
, code
, boolean_type_node
,
5952 code_orig_arg1
, arg1
,
5953 code_orig_arg2
, arg2
);
5955 arg2
= convert_like (conv
, arg2
, complain
);
5959 conv
= cand
->convs
[2];
5960 if (conv
->kind
== ck_ref_bind
)
5961 conv
= next_conversion (conv
);
5962 arg3
= convert_like (conv
, arg3
, complain
);
5968 user_defined_result_ready
:
5970 /* Free all the conversions we allocated. */
5971 obstack_free (&conversion_obstack
, p
);
5973 if (result
|| result_valid_p
)
5980 return cp_build_modify_expr (loc
, arg1
, code2
, arg2
, complain
);
5983 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
5985 case TRUTH_ANDIF_EXPR
:
5986 case TRUTH_ORIF_EXPR
:
5987 case TRUTH_AND_EXPR
:
5989 if (complain
& tf_warning
)
5990 warn_logical_operator (loc
, code
, boolean_type_node
,
5991 code_orig_arg1
, arg1
,
5992 code_orig_arg2
, arg2
);
6000 if ((complain
& tf_warning
)
6001 && ((code_orig_arg1
== BOOLEAN_TYPE
)
6002 ^ (code_orig_arg2
== BOOLEAN_TYPE
)))
6003 maybe_warn_bool_compare (loc
, code
, arg1
, arg2
);
6004 if (complain
& tf_warning
&& warn_tautological_compare
)
6005 warn_tautological_cmp (loc
, code
, arg1
, arg2
);
6010 case TRUNC_DIV_EXPR
:
6015 case TRUNC_MOD_EXPR
:
6019 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
6021 case UNARY_PLUS_EXPR
:
6024 case TRUTH_NOT_EXPR
:
6025 case PREINCREMENT_EXPR
:
6026 case POSTINCREMENT_EXPR
:
6027 case PREDECREMENT_EXPR
:
6028 case POSTDECREMENT_EXPR
:
6032 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
6035 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
6038 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
6042 /* The caller will deal with these. */
6054 /* Wrapper for above. */
6057 build_new_op (location_t loc
, enum tree_code code
, int flags
,
6058 tree arg1
, tree arg2
, tree arg3
,
6059 tree
*overload
, tsubst_flags_t complain
)
6062 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
6063 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
6064 overload
, complain
);
6065 timevar_cond_stop (TV_OVERLOAD
, subtime
);
6069 /* CALL was returned by some call-building function; extract the actual
6070 CALL_EXPR from any bits that have been tacked on, e.g. by
6071 convert_from_reference. */
6074 extract_call_expr (tree call
)
6076 while (TREE_CODE (call
) == COMPOUND_EXPR
)
6077 call
= TREE_OPERAND (call
, 1);
6078 if (REFERENCE_REF_P (call
))
6079 call
= TREE_OPERAND (call
, 0);
6080 if (TREE_CODE (call
) == TARGET_EXPR
)
6081 call
= TARGET_EXPR_INITIAL (call
);
6082 gcc_assert (TREE_CODE (call
) == CALL_EXPR
6083 || TREE_CODE (call
) == AGGR_INIT_EXPR
6084 || call
== error_mark_node
);
6088 /* Returns true if FN has two parameters, of which the second has type
6092 second_parm_is_size_t (tree fn
)
6094 tree t
= FUNCTION_ARG_CHAIN (fn
);
6095 if (!t
|| !same_type_p (TREE_VALUE (t
), size_type_node
))
6098 if (t
== void_list_node
)
6100 if (aligned_new_threshold
&& t
6101 && same_type_p (TREE_VALUE (t
), align_type_node
)
6102 && TREE_CHAIN (t
) == void_list_node
)
6107 /* True if T, an allocation function, has std::align_val_t as its second
6111 aligned_allocation_fn_p (tree t
)
6113 if (!aligned_new_threshold
)
6116 tree a
= FUNCTION_ARG_CHAIN (t
);
6117 return (a
&& same_type_p (TREE_VALUE (a
), align_type_node
));
6120 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6121 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6122 std::align_val_t. */
6125 aligned_deallocation_fn_p (tree t
)
6127 if (!aligned_new_threshold
)
6130 /* A template instance is never a usual deallocation function,
6131 regardless of its signature. */
6132 if (TREE_CODE (t
) == TEMPLATE_DECL
6133 || primary_template_instantiation_p (t
))
6136 tree a
= FUNCTION_ARG_CHAIN (t
);
6137 if (same_type_p (TREE_VALUE (a
), align_type_node
)
6138 && TREE_CHAIN (a
) == void_list_node
)
6140 if (!same_type_p (TREE_VALUE (a
), size_type_node
))
6143 if (a
&& same_type_p (TREE_VALUE (a
), align_type_node
)
6144 && TREE_CHAIN (a
) == void_list_node
)
6149 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6150 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6153 usual_deallocation_fn_p (tree t
)
6155 /* A template instance is never a usual deallocation function,
6156 regardless of its signature. */
6157 if (TREE_CODE (t
) == TEMPLATE_DECL
6158 || primary_template_instantiation_p (t
))
6161 /* If a class T has a member deallocation function named operator delete
6162 with exactly one parameter, then that function is a usual
6163 (non-placement) deallocation function. If class T does not declare
6164 such an operator delete but does declare a member deallocation
6165 function named operator delete with exactly two parameters, the second
6166 of which has type std::size_t (18.2), then this function is a usual
6167 deallocation function. */
6168 bool global
= DECL_NAMESPACE_SCOPE_P (t
);
6169 tree chain
= FUNCTION_ARG_CHAIN (t
);
6172 if (chain
== void_list_node
6173 || ((!global
|| flag_sized_deallocation
)
6174 && second_parm_is_size_t (t
)))
6176 if (aligned_deallocation_fn_p (t
))
6181 /* Build a call to operator delete. This has to be handled very specially,
6182 because the restrictions on what signatures match are different from all
6183 other call instances. For a normal delete, only a delete taking (void *)
6184 or (void *, size_t) is accepted. For a placement delete, only an exact
6185 match with the placement new is accepted.
6187 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6188 ADDR is the pointer to be deleted.
6189 SIZE is the size of the memory block to be deleted.
6190 GLOBAL_P is true if the delete-expression should not consider
6191 class-specific delete operators.
6192 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6194 If this call to "operator delete" is being generated as part to
6195 deallocate memory allocated via a new-expression (as per [expr.new]
6196 which requires that if the initialization throws an exception then
6197 we call a deallocation function), then ALLOC_FN is the allocation
6201 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
6202 bool global_p
, tree placement
,
6203 tree alloc_fn
, tsubst_flags_t complain
)
6205 tree fn
= NULL_TREE
;
6206 tree fns
, fnname
, type
, t
;
6208 if (addr
== error_mark_node
)
6209 return error_mark_node
;
6211 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
6213 fnname
= cp_operator_id (code
);
6215 if (CLASS_TYPE_P (type
)
6216 && COMPLETE_TYPE_P (complete_type (type
))
6220 If the result of the lookup is ambiguous or inaccessible, or if
6221 the lookup selects a placement deallocation function, the
6222 program is ill-formed.
6224 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6226 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
6227 if (fns
== error_mark_node
)
6228 return error_mark_node
;
6233 if (fns
== NULL_TREE
)
6234 fns
= lookup_name_nonclass (fnname
);
6236 /* Strip const and volatile from addr. */
6237 addr
= cp_convert (ptr_type_node
, addr
, complain
);
6241 /* "A declaration of a placement deallocation function matches the
6242 declaration of a placement allocation function if it has the same
6243 number of parameters and, after parameter transformations (8.3.5),
6244 all parameter types except the first are identical."
6246 So we build up the function type we want and ask instantiate_type
6247 to get it for us. */
6248 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
6249 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
6250 t
= build_function_type (void_type_node
, t
);
6252 fn
= instantiate_type (t
, fns
, tf_none
);
6253 if (fn
== error_mark_node
)
6256 fn
= MAYBE_BASELINK_FUNCTIONS (fn
);
6258 /* "If the lookup finds the two-parameter form of a usual deallocation
6259 function (3.7.4.2) and that function, considered as a placement
6260 deallocation function, would have been selected as a match for the
6261 allocation function, the program is ill-formed." */
6262 if (second_parm_is_size_t (fn
))
6264 const char *const msg1
6265 = G_("exception cleanup for this placement new selects "
6266 "non-placement operator delete");
6267 const char *const msg2
6268 = G_("%qD is a usual (non-placement) deallocation "
6269 "function in C++14 (or with -fsized-deallocation)");
6271 /* But if the class has an operator delete (void *), then that is
6272 the usual deallocation function, so we shouldn't complain
6273 about using the operator delete (void *, size_t). */
6274 if (DECL_CLASS_SCOPE_P (fn
))
6275 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
));
6279 if (usual_deallocation_fn_p (elt
)
6280 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
6283 /* Before C++14 a two-parameter global deallocation function is
6284 always a placement deallocation function, but warn if
6286 else if (!flag_sized_deallocation
)
6288 if ((complain
& tf_warning
)
6289 && warning (OPT_Wc__14_compat
, msg1
))
6290 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6294 if (complain
& tf_warning_or_error
)
6296 if (permerror (input_location
, msg1
))
6298 /* Only mention C++14 for namespace-scope delete. */
6299 if (DECL_NAMESPACE_SCOPE_P (fn
))
6300 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6302 inform (DECL_SOURCE_LOCATION (fn
),
6303 "%qD is a usual (non-placement) deallocation "
6308 return error_mark_node
;
6313 /* "Any non-placement deallocation function matches a non-placement
6314 allocation function. If the lookup finds a single matching
6315 deallocation function, that function will be called; otherwise, no
6316 deallocation function will be called." */
6317 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
)); iter
; ++iter
)
6320 if (usual_deallocation_fn_p (elt
))
6328 /* -- If the type has new-extended alignment, a function with a
6329 parameter of type std::align_val_t is preferred; otherwise a
6330 function without such a parameter is preferred. If exactly one
6331 preferred function is found, that function is selected and the
6332 selection process terminates. If more than one preferred
6333 function is found, all non-preferred functions are eliminated
6334 from further consideration. */
6335 if (aligned_new_threshold
)
6337 bool want_align
= type_has_new_extended_alignment (type
);
6338 bool fn_align
= aligned_deallocation_fn_p (fn
);
6339 bool elt_align
= aligned_deallocation_fn_p (elt
);
6341 if (elt_align
!= fn_align
)
6343 if (want_align
== elt_align
)
6349 /* -- If the deallocation functions have class scope, the one
6350 without a parameter of type std::size_t is selected. */
6352 if (DECL_CLASS_SCOPE_P (fn
))
6355 /* -- If the type is complete and if, for the second alternative
6356 (delete array) only, the operand is a pointer to a class type
6357 with a non-trivial destructor or a (possibly multi-dimensional)
6358 array thereof, the function with a parameter of type std::size_t
6361 -- Otherwise, it is unspecified whether a deallocation function
6362 with a parameter of type std::size_t is selected. */
6365 want_size
= COMPLETE_TYPE_P (type
);
6366 if (code
== VEC_DELETE_EXPR
6367 && !TYPE_VEC_NEW_USES_COOKIE (type
))
6368 /* We need a cookie to determine the array size. */
6371 bool fn_size
= second_parm_is_size_t (fn
);
6372 bool elt_size
= second_parm_is_size_t (elt
);
6373 gcc_assert (fn_size
!= elt_size
);
6374 if (want_size
== elt_size
)
6379 /* If we have a matching function, call it. */
6382 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6384 /* If the FN is a member function, make sure that it is
6386 if (BASELINK_P (fns
))
6387 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
6390 /* Core issue 901: It's ok to new a type with deleted delete. */
6391 if (DECL_DELETED_FN (fn
) && alloc_fn
)
6396 /* The placement args might not be suitable for overload
6397 resolution at this point, so build the call directly. */
6398 int nargs
= call_expr_nargs (placement
);
6399 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
6402 for (i
= 1; i
< nargs
; i
++)
6403 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
6404 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
6405 return error_mark_node
;
6406 return build_cxx_call (fn
, nargs
, argarray
, complain
);
6411 vec
<tree
, va_gc
> *args
= make_tree_vector ();
6412 args
->quick_push (addr
);
6413 if (second_parm_is_size_t (fn
))
6414 args
->quick_push (size
);
6415 if (aligned_deallocation_fn_p (fn
))
6417 tree al
= build_int_cst (align_type_node
, TYPE_ALIGN_UNIT (type
));
6418 args
->quick_push (al
);
6420 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
6421 release_tree_vector (args
);
6428 If no unambiguous matching deallocation function can be found,
6429 propagating the exception does not cause the object's memory to
6433 if ((complain
& tf_warning
)
6435 warning (0, "no corresponding deallocation function for %qD",
6440 if (complain
& tf_error
)
6441 error ("no suitable %<operator %s%> for %qT",
6442 operator_name_info
[(int)code
].name
, type
);
6443 return error_mark_node
;
6446 /* If the current scope isn't allowed to access DECL along
6447 BASETYPE_PATH, give an error. The most derived class in
6448 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6449 the declaration to use in the error diagnostic. */
6452 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
6453 tsubst_flags_t complain
, access_failure_info
*afi
)
6455 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
6457 if (flag_new_inheriting_ctors
6458 && DECL_INHERITED_CTOR (decl
))
6460 /* 7.3.3/18: The additional constructors are accessible if they would be
6461 accessible when used to construct an object of the corresponding base
6463 decl
= strip_inheriting_ctors (decl
);
6464 basetype_path
= lookup_base (basetype_path
, DECL_CONTEXT (decl
),
6465 ba_any
, NULL
, complain
);
6468 if (!accessible_p (basetype_path
, decl
, true))
6470 if (complain
& tf_error
)
6472 if (flag_new_inheriting_ctors
)
6473 diag_decl
= strip_inheriting_ctors (diag_decl
);
6474 if (TREE_PRIVATE (decl
))
6476 error ("%q#D is private within this context", diag_decl
);
6477 inform (DECL_SOURCE_LOCATION (diag_decl
),
6478 "declared private here");
6480 afi
->record_access_failure (basetype_path
, diag_decl
);
6482 else if (TREE_PROTECTED (decl
))
6484 error ("%q#D is protected within this context", diag_decl
);
6485 inform (DECL_SOURCE_LOCATION (diag_decl
),
6486 "declared protected here");
6488 afi
->record_access_failure (basetype_path
, diag_decl
);
6492 error ("%q#D is inaccessible within this context", diag_decl
);
6493 inform (DECL_SOURCE_LOCATION (diag_decl
), "declared here");
6495 afi
->record_access_failure (basetype_path
, diag_decl
);
6504 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6505 bitwise or of LOOKUP_* values. If any errors are warnings are
6506 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6507 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6511 build_temp (tree expr
, tree type
, int flags
,
6512 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
6515 vec
<tree
, va_gc
> *args
;
6517 *diagnostic_kind
= DK_UNSPECIFIED
;
6519 /* If the source is a packed field, calling the copy constructor will require
6520 binding the field to the reference parameter to the copy constructor, and
6521 we'll end up with an infinite loop. If we can use a bitwise copy, then
6523 if ((lvalue_kind (expr
) & clk_packed
)
6524 && CLASS_TYPE_P (TREE_TYPE (expr
))
6525 && !type_has_nontrivial_copy_init (TREE_TYPE (expr
)))
6526 return get_target_expr_sfinae (expr
, complain
);
6528 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
6529 args
= make_tree_vector_single (expr
);
6530 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6531 &args
, type
, flags
, complain
);
6532 release_tree_vector (args
);
6533 if (warningcount
+ werrorcount
> savew
)
6534 *diagnostic_kind
= DK_WARNING
;
6535 else if (errorcount
> savee
)
6536 *diagnostic_kind
= DK_ERROR
;
6540 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6541 EXPR is implicitly converted to type TOTYPE.
6542 FN and ARGNUM are used for diagnostics. */
6545 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
6547 /* Issue warnings about peculiar, but valid, uses of NULL. */
6548 if (expr
== null_node
&& TREE_CODE (totype
) != BOOLEAN_TYPE
6549 && ARITHMETIC_TYPE_P (totype
))
6551 source_location loc
=
6552 expansion_point_location_if_in_system_header (input_location
);
6555 warning_at (loc
, OPT_Wconversion_null
,
6556 "passing NULL to non-pointer argument %P of %qD",
6559 warning_at (loc
, OPT_Wconversion_null
,
6560 "converting to non-pointer type %qT from NULL", totype
);
6563 /* Issue warnings if "false" is converted to a NULL pointer */
6564 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
6565 && TYPE_PTR_P (totype
))
6568 warning_at (input_location
, OPT_Wconversion_null
,
6569 "converting %<false%> to pointer type for argument %P "
6570 "of %qD", argnum
, fn
);
6572 warning_at (input_location
, OPT_Wconversion_null
,
6573 "converting %<false%> to pointer type %qT", totype
);
6577 /* We gave a diagnostic during a conversion. If this was in the second
6578 standard conversion sequence of a user-defined conversion sequence, say
6579 which user-defined conversion. */
6582 maybe_print_user_conv_context (conversion
*convs
)
6584 if (convs
->user_conv_p
)
6585 for (conversion
*t
= convs
; t
; t
= next_conversion (t
))
6586 if (t
->kind
== ck_user
)
6588 print_z_candidate (0, " after user-defined conversion:",
6594 /* Perform the conversions in CONVS on the expression EXPR. FN and
6595 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6596 indicates the `this' argument of a method. INNER is nonzero when
6597 being called to continue a conversion chain. It is negative when a
6598 reference binding will be applied, positive otherwise. If
6599 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6600 conversions will be emitted if appropriate. If C_CAST_P is true,
6601 this conversion is coming from a C-style cast; in that case,
6602 conversions to inaccessible bases are permitted. */
6605 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
6606 bool issue_conversion_warnings
,
6607 bool c_cast_p
, tsubst_flags_t complain
)
6609 tree totype
= convs
->type
;
6610 diagnostic_t diag_kind
;
6612 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6614 if (convs
->bad_p
&& !(complain
& tf_error
))
6615 return error_mark_node
;
6618 && convs
->kind
!= ck_user
6619 && convs
->kind
!= ck_list
6620 && convs
->kind
!= ck_ambig
6621 && (convs
->kind
!= ck_ref_bind
6622 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
6623 && (convs
->kind
!= ck_rvalue
6624 || SCALAR_TYPE_P (totype
))
6625 && convs
->kind
!= ck_base
)
6627 bool complained
= false;
6628 conversion
*t
= convs
;
6630 /* Give a helpful error if this is bad because of excess braces. */
6631 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6632 && SCALAR_TYPE_P (totype
)
6633 && CONSTRUCTOR_NELTS (expr
) > 0
6634 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
6636 complained
= permerror (loc
, "too many braces around initializer "
6638 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6639 && CONSTRUCTOR_NELTS (expr
) == 1)
6640 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6643 /* Give a helpful error if this is bad because a conversion to bool
6644 from std::nullptr_t requires direct-initialization. */
6645 if (NULLPTR_TYPE_P (TREE_TYPE (expr
))
6646 && TREE_CODE (totype
) == BOOLEAN_TYPE
)
6647 complained
= permerror (loc
, "converting to %qH from %qI requires "
6648 "direct-initialization",
6649 totype
, TREE_TYPE (expr
));
6651 for (; t
; t
= next_conversion (t
))
6653 if (t
->kind
== ck_user
&& t
->cand
->reason
)
6655 complained
= permerror (loc
, "invalid user-defined conversion "
6656 "from %qH to %qI", TREE_TYPE (expr
),
6659 print_z_candidate (loc
, "candidate is:", t
->cand
);
6660 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6661 /*issue_conversion_warnings=*/false,
6664 if (convs
->kind
== ck_ref_bind
)
6665 expr
= convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
6666 LOOKUP_NORMAL
, NULL_TREE
,
6669 expr
= cp_convert (totype
, expr
, complain
);
6670 if (complained
&& fn
)
6671 inform (DECL_SOURCE_LOCATION (fn
),
6672 " initializing argument %P of %qD", argnum
, fn
);
6675 else if (t
->kind
== ck_user
|| !t
->bad_p
)
6677 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6678 /*issue_conversion_warnings=*/false,
6683 else if (t
->kind
== ck_ambig
)
6684 return convert_like_real (t
, expr
, fn
, argnum
,
6685 /*issue_conversion_warnings=*/false,
6688 else if (t
->kind
== ck_identity
)
6692 complained
= permerror (loc
, "invalid conversion from %qH to %qI",
6693 TREE_TYPE (expr
), totype
);
6694 if (complained
&& fn
)
6695 inform (DECL_SOURCE_LOCATION (fn
),
6696 " initializing argument %P of %qD", argnum
, fn
);
6698 return cp_convert (totype
, expr
, complain
);
6701 if (issue_conversion_warnings
&& (complain
& tf_warning
))
6702 conversion_null_warnings (totype
, expr
, fn
, argnum
);
6704 switch (convs
->kind
)
6708 struct z_candidate
*cand
= convs
->cand
;
6709 tree convfn
= cand
->fn
;
6711 /* When converting from an init list we consider explicit
6712 constructors, but actually trying to call one is an error. */
6713 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
6714 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
6715 /* Unless this is for direct-list-initialization. */
6716 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
)
6717 /* And in C++98 a default constructor can't be explicit. */
6718 && cxx_dialect
>= cxx11
)
6720 if (!(complain
& tf_error
))
6721 return error_mark_node
;
6722 location_t loc
= location_of (expr
);
6723 if (CONSTRUCTOR_NELTS (expr
) == 0
6724 && FUNCTION_FIRST_USER_PARMTYPE (convfn
) != void_list_node
)
6726 if (pedwarn (loc
, 0, "converting to %qT from initializer list "
6727 "would use explicit constructor %qD",
6729 inform (loc
, "in C++11 and above a default constructor "
6733 error ("converting to %qT from initializer list would use "
6734 "explicit constructor %qD", totype
, convfn
);
6737 /* If we're initializing from {}, it's value-initialization. */
6738 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6739 && CONSTRUCTOR_NELTS (expr
) == 0
6740 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
6742 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
6743 expr
= build_value_init (totype
, complain
);
6744 expr
= get_target_expr_sfinae (expr
, complain
);
6745 if (expr
!= error_mark_node
)
6747 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6748 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
6753 expr
= mark_rvalue_use (expr
);
6755 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
6757 expr
= build_over_call (cand
, LOOKUP_NORMAL
|LOOKUP_NO_CONVERSION
,
6760 /* If this is a constructor or a function returning an aggr type,
6761 we need to build up a TARGET_EXPR. */
6762 if (DECL_CONSTRUCTOR_P (convfn
))
6764 expr
= build_cplus_new (totype
, expr
, complain
);
6766 /* Remember that this was list-initialization. */
6767 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
6768 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6774 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
6776 int nelts
= CONSTRUCTOR_NELTS (expr
);
6778 expr
= build_value_init (totype
, complain
);
6779 else if (nelts
== 1)
6780 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6784 expr
= mark_rvalue_use (expr
);
6786 if (type_unknown_p (expr
))
6787 expr
= instantiate_type (totype
, expr
, complain
);
6790 /* We leave bad_p off ck_ambig because overload resolution considers
6791 it valid, it just fails when we try to perform it. So we need to
6792 check complain here, too. */
6793 if (complain
& tf_error
)
6795 /* Call build_user_type_conversion again for the error. */
6796 build_user_type_conversion (totype
, convs
->u
.expr
, LOOKUP_IMPLICIT
,
6799 inform (DECL_SOURCE_LOCATION (fn
),
6800 " initializing argument %P of %qD", argnum
, fn
);
6802 return error_mark_node
;
6806 /* Conversion to std::initializer_list<T>. */
6807 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
6808 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
6809 unsigned len
= CONSTRUCTOR_NELTS (expr
);
6810 tree array
, val
, field
;
6811 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
6814 /* Convert all the elements. */
6815 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
6817 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
6818 false, false, complain
);
6819 if (sub
== error_mark_node
)
6821 if (!BRACE_ENCLOSED_INITIALIZER_P (val
)
6822 && !check_narrowing (TREE_TYPE (sub
), val
, complain
))
6823 return error_mark_node
;
6824 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
6825 if (!TREE_CONSTANT (sub
))
6826 TREE_CONSTANT (new_ctor
) = false;
6828 /* Build up the array. */
6829 elttype
= cp_build_qualified_type
6830 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
6831 array
= build_array_of_n_type (elttype
, len
);
6832 array
= finish_compound_literal (array
, new_ctor
, complain
);
6833 /* Take the address explicitly rather than via decay_conversion
6834 to avoid the error about taking the address of a temporary. */
6835 array
= cp_build_addr_expr (array
, complain
);
6836 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
6837 if (array
== error_mark_node
)
6838 return error_mark_node
;
6840 /* Build up the initializer_list object. */
6841 totype
= complete_type (totype
);
6842 field
= next_initializable_field (TYPE_FIELDS (totype
));
6843 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
6844 field
= next_initializable_field (DECL_CHAIN (field
));
6845 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
6846 new_ctor
= build_constructor (totype
, vec
);
6847 return get_target_expr_sfinae (new_ctor
, complain
);
6851 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
6853 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6854 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
6855 real
= perform_implicit_conversion (TREE_TYPE (totype
),
6857 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
6859 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
6862 expr
= reshape_init (totype
, expr
, complain
);
6863 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
6865 if (expr
!= error_mark_node
)
6866 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6873 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
6874 convs
->kind
== ck_ref_bind
? issue_conversion_warnings
: false,
6877 if (expr
== error_mark_node
)
6878 return error_mark_node
;
6880 switch (convs
->kind
)
6883 expr
= decay_conversion (expr
, complain
);
6884 if (expr
== error_mark_node
)
6886 if (complain
& tf_error
)
6888 maybe_print_user_conv_context (convs
);
6890 inform (DECL_SOURCE_LOCATION (fn
),
6891 " initializing argument %P of %qD", argnum
, fn
);
6893 return error_mark_node
;
6896 if (! MAYBE_CLASS_TYPE_P (totype
))
6899 /* Don't introduce copies when passing arguments along to the inherited
6901 if (current_function_decl
6902 && flag_new_inheriting_ctors
6903 && DECL_INHERITED_CTOR (current_function_decl
))
6908 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
6910 /* We are going to bind a reference directly to a base-class
6911 subobject of EXPR. */
6912 /* Build an expression for `*((base*) &expr)'. */
6913 expr
= convert_to_base (expr
, totype
,
6914 !c_cast_p
, /*nonnull=*/true, complain
);
6918 /* Copy-initialization where the cv-unqualified version of the source
6919 type is the same class as, or a derived class of, the class of the
6920 destination [is treated as direct-initialization]. [dcl.init] */
6921 flags
= LOOKUP_NORMAL
;
6922 if (convs
->user_conv_p
)
6923 /* This conversion is being done in the context of a user-defined
6924 conversion (i.e. the second step of copy-initialization), so
6925 don't allow any more. */
6926 flags
|= LOOKUP_NO_CONVERSION
;
6928 flags
|= LOOKUP_ONLYCONVERTING
;
6929 if (convs
->rvaluedness_matches_p
)
6930 flags
|= LOOKUP_PREFER_RVALUE
;
6931 if (TREE_CODE (expr
) == TARGET_EXPR
6932 && TARGET_EXPR_LIST_INIT_P (expr
))
6933 /* Copy-list-initialization doesn't actually involve a copy. */
6935 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
6936 if (diag_kind
&& complain
)
6938 maybe_print_user_conv_context (convs
);
6940 inform (DECL_SOURCE_LOCATION (fn
),
6941 " initializing argument %P of %qD", argnum
, fn
);
6944 return build_cplus_new (totype
, expr
, complain
);
6948 tree ref_type
= totype
;
6950 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
6952 tree extype
= TREE_TYPE (expr
);
6953 if (TYPE_REF_IS_RVALUE (ref_type
)
6955 error_at (loc
, "cannot bind rvalue reference of type %qH to "
6956 "lvalue of type %qI", totype
, extype
);
6957 else if (!TYPE_REF_IS_RVALUE (ref_type
) && !lvalue_p (expr
)
6958 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
6959 error_at (loc
, "cannot bind non-const lvalue reference of "
6960 "type %qH to an rvalue of type %qI", totype
, extype
);
6961 else if (!reference_compatible_p (TREE_TYPE (totype
), extype
))
6962 error_at (loc
, "binding reference of type %qH to %qI "
6963 "discards qualifiers", totype
, extype
);
6966 maybe_print_user_conv_context (convs
);
6968 inform (DECL_SOURCE_LOCATION (fn
),
6969 " initializing argument %P of %qD", argnum
, fn
);
6970 return error_mark_node
;
6973 /* If necessary, create a temporary.
6975 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
6976 that need temporaries, even when their types are reference
6977 compatible with the type of reference being bound, so the
6978 upcoming call to cp_build_addr_expr doesn't fail. */
6979 if (convs
->need_temporary_p
6980 || TREE_CODE (expr
) == CONSTRUCTOR
6981 || TREE_CODE (expr
) == VA_ARG_EXPR
)
6983 /* Otherwise, a temporary of type "cv1 T1" is created and
6984 initialized from the initializer expression using the rules
6985 for a non-reference copy-initialization (8.5). */
6987 tree type
= TREE_TYPE (ref_type
);
6988 cp_lvalue_kind lvalue
= lvalue_kind (expr
);
6990 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6991 (type
, next_conversion (convs
)->type
));
6992 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
6993 && !TYPE_REF_IS_RVALUE (ref_type
))
6995 /* If the reference is volatile or non-const, we
6996 cannot create a temporary. */
6997 if (lvalue
& clk_bitfield
)
6998 error_at (loc
, "cannot bind bitfield %qE to %qT",
7000 else if (lvalue
& clk_packed
)
7001 error_at (loc
, "cannot bind packed field %qE to %qT",
7004 error_at (loc
, "cannot bind rvalue %qE to %qT",
7006 return error_mark_node
;
7008 /* If the source is a packed field, and we must use a copy
7009 constructor, then building the target expr will require
7010 binding the field to the reference parameter to the
7011 copy constructor, and we'll end up with an infinite
7012 loop. If we can use a bitwise copy, then we'll be
7014 if ((lvalue
& clk_packed
)
7015 && CLASS_TYPE_P (type
)
7016 && type_has_nontrivial_copy_init (type
))
7018 error_at (loc
, "cannot bind packed field %qE to %qT",
7020 return error_mark_node
;
7022 if (lvalue
& clk_bitfield
)
7024 expr
= convert_bitfield_to_declared_type (expr
);
7025 expr
= fold_convert (type
, expr
);
7027 expr
= build_target_expr_with_type (expr
, type
, complain
);
7030 /* Take the address of the thing to which we will bind the
7032 expr
= cp_build_addr_expr (expr
, complain
);
7033 if (expr
== error_mark_node
)
7034 return error_mark_node
;
7036 /* Convert it to a pointer to the type referred to by the
7037 reference. This will adjust the pointer if a derived to
7038 base conversion is being performed. */
7039 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
7041 /* Convert the pointer to the desired reference type. */
7042 return build_nop (ref_type
, expr
);
7046 return decay_conversion (expr
, complain
);
7049 /* ??? Should the address of a transaction-safe pointer point to the TM
7050 clone, and this conversion look up the primary function? */
7051 return build_nop (totype
, expr
);
7054 /* Warn about deprecated conversion if appropriate. */
7055 string_conv_p (totype
, expr
, 1);
7060 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
7061 /*nonnull=*/false, complain
);
7062 return build_nop (totype
, expr
);
7065 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
7066 c_cast_p
, complain
);
7072 if (convs
->check_narrowing
7073 && !check_narrowing (totype
, expr
, complain
))
7074 return error_mark_node
;
7076 if (issue_conversion_warnings
)
7077 expr
= cp_convert_and_check (totype
, expr
, complain
);
7079 expr
= cp_convert (totype
, expr
, complain
);
7084 /* ARG is being passed to a varargs function. Perform any conversions
7085 required. Return the converted value. */
7088 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
7091 location_t loc
= EXPR_LOC_OR_LOC (arg
, input_location
);
7095 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7096 standard conversions are performed. */
7097 arg
= decay_conversion (arg
, complain
);
7098 arg_type
= TREE_TYPE (arg
);
7101 If the argument has integral or enumeration type that is subject
7102 to the integral promotions (_conv.prom_), or a floating point
7103 type that is subject to the floating point promotion
7104 (_conv.fpprom_), the value of the argument is converted to the
7105 promoted type before the call. */
7106 if (TREE_CODE (arg_type
) == REAL_TYPE
7107 && (TYPE_PRECISION (arg_type
)
7108 < TYPE_PRECISION (double_type_node
))
7109 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
7111 if ((complain
& tf_warning
)
7112 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
7113 warning_at (loc
, OPT_Wdouble_promotion
,
7114 "implicit conversion from %qH to %qI when passing "
7115 "argument to function",
7116 arg_type
, double_type_node
);
7117 arg
= convert_to_real_nofold (double_type_node
, arg
);
7119 else if (NULLPTR_TYPE_P (arg_type
))
7120 arg
= null_pointer_node
;
7121 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
7123 if (SCOPED_ENUM_P (arg_type
))
7125 tree prom
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
,
7127 prom
= cp_perform_integral_promotions (prom
, complain
);
7128 if (abi_version_crosses (6)
7129 && TYPE_MODE (TREE_TYPE (prom
)) != TYPE_MODE (arg_type
)
7130 && (complain
& tf_warning
))
7131 warning_at (loc
, OPT_Wabi
, "scoped enum %qT passed through ... as "
7132 "%qT before -fabi-version=6, %qT after", arg_type
,
7133 TREE_TYPE (prom
), ENUM_UNDERLYING_TYPE (arg_type
));
7134 if (!abi_version_at_least (6))
7138 arg
= cp_perform_integral_promotions (arg
, complain
);
7141 arg
= require_complete_type_sfinae (arg
, complain
);
7142 arg_type
= TREE_TYPE (arg
);
7144 if (arg
!= error_mark_node
7145 /* In a template (or ill-formed code), we can have an incomplete type
7146 even after require_complete_type_sfinae, in which case we don't know
7147 whether it has trivial copy or not. */
7148 && COMPLETE_TYPE_P (arg_type
))
7150 /* Build up a real lvalue-to-rvalue conversion in case the
7151 copy constructor is trivial but not callable. */
7152 if (!cp_unevaluated_operand
&& CLASS_TYPE_P (arg_type
))
7153 force_rvalue (arg
, complain
);
7155 /* [expr.call] 5.2.2/7:
7156 Passing a potentially-evaluated argument of class type (Clause 9)
7157 with a non-trivial copy constructor or a non-trivial destructor
7158 with no corresponding parameter is conditionally-supported, with
7159 implementation-defined semantics.
7161 We support it as pass-by-invisible-reference, just like a normal
7164 If the call appears in the context of a sizeof expression,
7165 it is not potentially-evaluated. */
7166 if (cp_unevaluated_operand
== 0
7167 && (type_has_nontrivial_copy_init (arg_type
)
7168 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
)))
7170 if (complain
& tf_warning
)
7171 warning (OPT_Wconditionally_supported
,
7172 "passing objects of non-trivially-copyable "
7173 "type %q#T through %<...%> is conditionally supported",
7175 return cp_build_addr_expr (arg
, complain
);
7182 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7185 build_x_va_arg (source_location loc
, tree expr
, tree type
)
7187 if (processing_template_decl
)
7189 tree r
= build_min (VA_ARG_EXPR
, type
, expr
);
7190 SET_EXPR_LOCATION (r
, loc
);
7194 type
= complete_type_or_else (type
, NULL_TREE
);
7196 if (expr
== error_mark_node
|| !type
)
7197 return error_mark_node
;
7199 expr
= mark_lvalue_use (expr
);
7201 if (TREE_CODE (type
) == REFERENCE_TYPE
)
7203 error ("cannot receive reference type %qT through %<...%>", type
);
7204 return error_mark_node
;
7207 if (type_has_nontrivial_copy_init (type
)
7208 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7210 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7211 it as pass by invisible reference. */
7212 warning_at (loc
, OPT_Wconditionally_supported
,
7213 "receiving objects of non-trivially-copyable type %q#T "
7214 "through %<...%> is conditionally-supported", type
);
7216 tree ref
= cp_build_reference_type (type
, false);
7217 expr
= build_va_arg (loc
, expr
, ref
);
7218 return convert_from_reference (expr
);
7221 tree ret
= build_va_arg (loc
, expr
, type
);
7222 if (CLASS_TYPE_P (type
))
7223 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7224 know how to handle it. */
7225 ret
= get_target_expr (ret
);
7229 /* TYPE has been given to va_arg. Apply the default conversions which
7230 would have happened when passed via ellipsis. Return the promoted
7231 type, or the passed type if there is no change. */
7234 cxx_type_promotes_to (tree type
)
7238 /* Perform the array-to-pointer and function-to-pointer
7240 type
= type_decays_to (type
);
7242 promote
= type_promotes_to (type
);
7243 if (same_type_p (type
, promote
))
7249 /* ARG is a default argument expression being passed to a parameter of
7250 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7251 zero-based argument number. Do any required conversions. Return
7252 the converted value. */
7254 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
7256 push_defarg_context (tree fn
)
7257 { vec_safe_push (default_arg_context
, fn
); }
7260 pop_defarg_context (void)
7261 { default_arg_context
->pop (); }
7264 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
7265 tsubst_flags_t complain
)
7270 /* See through clones. */
7271 fn
= DECL_ORIGIN (fn
);
7272 /* And inheriting ctors. */
7273 if (flag_new_inheriting_ctors
)
7274 fn
= strip_inheriting_ctors (fn
);
7276 /* Detect recursion. */
7277 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
7280 if (complain
& tf_error
)
7281 error ("recursive evaluation of default argument for %q#D", fn
);
7282 return error_mark_node
;
7285 /* If the ARG is an unparsed default argument expression, the
7286 conversion cannot be performed. */
7287 if (TREE_CODE (arg
) == DEFAULT_ARG
)
7289 if (complain
& tf_error
)
7290 error ("call to %qD uses the default argument for parameter %P, which "
7291 "is not yet defined", fn
, parmnum
);
7292 return error_mark_node
;
7295 push_defarg_context (fn
);
7297 if (fn
&& DECL_TEMPLATE_INFO (fn
))
7298 arg
= tsubst_default_argument (fn
, type
, arg
, complain
);
7304 The names in the expression are bound, and the semantic
7305 constraints are checked, at the point where the default
7306 expressions appears.
7308 we must not perform access checks here. */
7309 push_deferring_access_checks (dk_no_check
);
7310 /* We must make a copy of ARG, in case subsequent processing
7311 alters any part of it. */
7312 arg
= break_out_target_exprs (arg
);
7313 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
7314 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
7316 arg
= convert_for_arg_passing (type
, arg
, complain
);
7317 pop_deferring_access_checks();
7319 pop_defarg_context ();
7324 /* Returns the type which will really be used for passing an argument of
7328 type_passed_as (tree type
)
7330 /* Pass classes with copy ctors by invisible reference. */
7331 if (TREE_ADDRESSABLE (type
))
7333 type
= build_reference_type (type
);
7334 /* There are no other pointers to this temporary. */
7335 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
7337 else if (targetm
.calls
.promote_prototypes (type
)
7338 && INTEGRAL_TYPE_P (type
)
7339 && COMPLETE_TYPE_P (type
)
7340 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7341 type
= integer_type_node
;
7346 /* Actually perform the appropriate conversion. */
7349 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
7353 /* If VAL is a bitfield, then -- since it has already been converted
7354 to TYPE -- it cannot have a precision greater than TYPE.
7356 If it has a smaller precision, we must widen it here. For
7357 example, passing "int f:3;" to a function expecting an "int" will
7358 not result in any conversion before this point.
7360 If the precision is the same we must not risk widening. For
7361 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7362 often have type "int", even though the C++ type for the field is
7363 "long long". If the value is being passed to a function
7364 expecting an "int", then no conversions will be required. But,
7365 if we call convert_bitfield_to_declared_type, the bitfield will
7366 be converted to "long long". */
7367 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
7369 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
7370 val
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
), val
);
7372 if (val
== error_mark_node
)
7374 /* Pass classes with copy ctors by invisible reference. */
7375 else if (TREE_ADDRESSABLE (type
))
7376 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
7377 else if (targetm
.calls
.promote_prototypes (type
)
7378 && INTEGRAL_TYPE_P (type
)
7379 && COMPLETE_TYPE_P (type
)
7380 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7381 val
= cp_perform_integral_promotions (val
, complain
);
7382 if (complain
& tf_warning
)
7384 if (warn_suggest_attribute_format
)
7386 tree rhstype
= TREE_TYPE (val
);
7387 const enum tree_code coder
= TREE_CODE (rhstype
);
7388 const enum tree_code codel
= TREE_CODE (type
);
7389 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7391 && check_missing_format_attribute (type
, rhstype
))
7392 warning (OPT_Wsuggest_attribute_format
,
7393 "argument of function call might be a candidate "
7394 "for a format attribute");
7396 maybe_warn_parm_abi (type
, EXPR_LOC_OR_LOC (val
, input_location
));
7401 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7402 which just decay_conversion or no conversions at all should be done.
7403 This is true for some builtins which don't act like normal functions.
7404 Return 2 if no conversions at all should be done, 1 if just
7405 decay_conversion. Return 3 for special treatment of the 3rd argument
7406 for __builtin_*_overflow_p. */
7409 magic_varargs_p (tree fn
)
7411 if (flag_cilkplus
&& is_cilkplus_reduce_builtin (fn
) != BUILT_IN_NONE
)
7414 if (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
7415 switch (DECL_FUNCTION_CODE (fn
))
7417 case BUILT_IN_CLASSIFY_TYPE
:
7418 case BUILT_IN_CONSTANT_P
:
7419 case BUILT_IN_NEXT_ARG
:
7420 case BUILT_IN_VA_START
:
7423 case BUILT_IN_ADD_OVERFLOW_P
:
7424 case BUILT_IN_SUB_OVERFLOW_P
:
7425 case BUILT_IN_MUL_OVERFLOW_P
:
7429 return lookup_attribute ("type generic",
7430 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
7436 /* Returns the decl of the dispatcher function if FN is a function version. */
7439 get_function_version_dispatcher (tree fn
)
7441 tree dispatcher_decl
= NULL
;
7443 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7444 && DECL_FUNCTION_VERSIONED (fn
));
7446 gcc_assert (targetm
.get_function_versions_dispatcher
);
7447 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
7449 if (dispatcher_decl
== NULL
)
7451 error_at (input_location
, "use of multiversioned function "
7452 "without a default");
7456 retrofit_lang_decl (dispatcher_decl
);
7457 gcc_assert (dispatcher_decl
!= NULL
);
7458 return dispatcher_decl
;
7461 /* fn is a function version dispatcher that is marked used. Mark all the
7462 semantically identical function versions it will dispatch as used. */
7465 mark_versions_used (tree fn
)
7467 struct cgraph_node
*node
;
7468 struct cgraph_function_version_info
*node_v
;
7469 struct cgraph_function_version_info
*it_v
;
7471 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7473 node
= cgraph_node::get (fn
);
7477 gcc_assert (node
->dispatcher_function
);
7479 node_v
= node
->function_version ();
7483 /* All semantically identical versions are chained. Traverse and mark each
7484 one of them as used. */
7485 it_v
= node_v
->next
;
7486 while (it_v
!= NULL
)
7488 mark_used (it_v
->this_node
->decl
);
7493 /* Build a call to "the copy constructor" for the type of A, even if it
7494 wouldn't be selected by normal overload resolution. Used for
7498 call_copy_ctor (tree a
, tsubst_flags_t complain
)
7500 tree ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (a
));
7501 tree binfo
= TYPE_BINFO (ctype
);
7502 tree copy
= get_copy_ctor (ctype
, complain
);
7503 copy
= build_baselink (binfo
, binfo
, copy
, NULL_TREE
);
7504 tree ob
= build_dummy_object (ctype
);
7505 vec
<tree
, va_gc
>* args
= make_tree_vector_single (a
);
7506 tree r
= build_new_method_call (ob
, copy
, &args
, NULL_TREE
,
7507 LOOKUP_NORMAL
, NULL
, complain
);
7508 release_tree_vector (args
);
7512 /* Return true iff T refers to a base field. */
7515 is_base_field_ref (tree t
)
7518 if (TREE_CODE (t
) == ADDR_EXPR
)
7519 t
= TREE_OPERAND (t
, 0);
7520 if (TREE_CODE (t
) == COMPONENT_REF
)
7521 t
= TREE_OPERAND (t
, 1);
7522 if (TREE_CODE (t
) == FIELD_DECL
)
7523 return DECL_FIELD_IS_BASE (t
);
7527 /* We can't elide a copy from a function returning by value to a base
7528 subobject, as the callee might clobber tail padding. Return true iff this
7529 could be that case. */
7532 unsafe_copy_elision_p (tree target
, tree exp
)
7534 /* Copy elision only happens with a TARGET_EXPR. */
7535 if (TREE_CODE (exp
) != TARGET_EXPR
)
7537 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
7538 /* It's safe to elide the copy for a class with no tail padding. */
7539 if (tree_int_cst_equal (TYPE_SIZE (type
), CLASSTYPE_SIZE (type
)))
7541 /* It's safe to elide the copy if we aren't initializing a base object. */
7542 if (!is_base_field_ref (target
))
7544 tree init
= TARGET_EXPR_INITIAL (exp
);
7545 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7546 while (TREE_CODE (init
) == COMPOUND_EXPR
)
7547 init
= TREE_OPERAND (init
, 1);
7548 return (TREE_CODE (init
) == AGGR_INIT_EXPR
7549 && !AGGR_INIT_VIA_CTOR_P (init
));
7552 /* Subroutine of the various build_*_call functions. Overload resolution
7553 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7554 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7555 bitmask of various LOOKUP_* flags which apply to the call itself. */
7558 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
7561 const vec
<tree
, va_gc
> *args
= cand
->args
;
7562 tree first_arg
= cand
->first_arg
;
7563 conversion
**convs
= cand
->convs
;
7565 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
7570 unsigned int arg_index
= 0;
7574 bool already_used
= false;
7576 /* In a template, there is no need to perform all of the work that
7577 is normally done. We are only interested in the type of the call
7578 expression, i.e., the return type of the function. Any semantic
7579 errors will be deferred until the template is instantiated. */
7580 if (processing_template_decl
)
7584 const tree
*argarray
;
7587 if (undeduced_auto_decl (fn
))
7588 mark_used (fn
, complain
);
7590 return_type
= TREE_TYPE (TREE_TYPE (fn
));
7591 nargs
= vec_safe_length (args
);
7592 if (first_arg
== NULL_TREE
)
7593 argarray
= args
->address ();
7601 alcarray
= XALLOCAVEC (tree
, nargs
);
7602 alcarray
[0] = build_this (first_arg
);
7603 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
7604 alcarray
[ix
+ 1] = arg
;
7605 argarray
= alcarray
;
7608 addr
= build_addr_func (fn
, complain
);
7609 if (addr
== error_mark_node
)
7610 return error_mark_node
;
7611 expr
= build_call_array_loc (input_location
, return_type
,
7612 addr
, nargs
, argarray
);
7613 if (TREE_THIS_VOLATILE (fn
) && cfun
)
7614 current_function_returns_abnormally
= 1;
7615 return convert_from_reference (expr
);
7618 /* Give any warnings we noticed during overload resolution. */
7619 if (cand
->warnings
&& (complain
& tf_warning
))
7621 struct candidate_warning
*w
;
7622 for (w
= cand
->warnings
; w
; w
= w
->next
)
7623 joust (cand
, w
->loser
, 1, complain
);
7626 /* OK, we're actually calling this inherited constructor; set its deletedness
7627 appropriately. We can get away with doing this here because calling is
7628 the only way to refer to a constructor. */
7629 if (DECL_INHERITED_CTOR (fn
))
7630 deduce_inheriting_ctor (fn
);
7632 /* Make =delete work with SFINAE. */
7633 if (DECL_DELETED_FN (fn
) && !(complain
& tf_error
))
7634 return error_mark_node
;
7636 if (DECL_FUNCTION_MEMBER_P (fn
))
7639 /* If FN is a template function, two cases must be considered.
7644 template <class T> void f();
7646 template <class T> struct B {
7650 struct C : A, B<int> {
7652 using B<int>::g; // #2
7655 In case #1 where `A::f' is a member template, DECL_ACCESS is
7656 recorded in the primary template but not in its specialization.
7657 We check access of FN using its primary template.
7659 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7660 because it is a member of class template B, DECL_ACCESS is
7661 recorded in the specialization `B<int>::g'. We cannot use its
7662 primary template because `B<T>::g' and `B<int>::g' may have
7663 different access. */
7664 if (DECL_TEMPLATE_INFO (fn
)
7665 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
7666 access_fn
= DECL_TI_TEMPLATE (fn
);
7669 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
7671 return error_mark_node
;
7674 /* If we're checking for implicit delete, don't bother with argument
7676 if (flags
& LOOKUP_SPECULATIVE
)
7678 if (DECL_DELETED_FN (fn
))
7680 if (complain
& tf_error
)
7682 return error_mark_node
;
7684 if (cand
->viable
== 1)
7686 else if (!(complain
& tf_error
))
7687 /* Reject bad conversions now. */
7688 return error_mark_node
;
7689 /* else continue to get conversion error. */
7692 /* N3276 magic doesn't apply to nested calls. */
7693 int decltype_flag
= (complain
& tf_decltype
);
7694 complain
&= ~tf_decltype
;
7696 /* Find maximum size of vector to hold converted arguments. */
7697 parmlen
= list_length (parm
);
7698 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
7699 if (parmlen
> nargs
)
7701 argarray
= XALLOCAVEC (tree
, nargs
);
7703 /* The implicit parameters to a constructor are not considered by overload
7704 resolution, and must be of the proper type. */
7705 if (DECL_CONSTRUCTOR_P (fn
))
7708 if (first_arg
!= NULL_TREE
)
7710 object_arg
= first_arg
;
7711 first_arg
= NULL_TREE
;
7715 object_arg
= (*args
)[arg_index
];
7718 argarray
[j
++] = build_this (object_arg
);
7719 parm
= TREE_CHAIN (parm
);
7720 /* We should never try to call the abstract constructor. */
7721 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
7723 if (DECL_HAS_VTT_PARM_P (fn
))
7725 argarray
[j
++] = (*args
)[arg_index
];
7727 parm
= TREE_CHAIN (parm
);
7730 /* Bypass access control for 'this' parameter. */
7731 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7733 tree parmtype
= TREE_VALUE (parm
);
7734 tree arg
= build_this (first_arg
!= NULL_TREE
7736 : (*args
)[arg_index
]);
7737 tree argtype
= TREE_TYPE (arg
);
7741 if (convs
[i
]->bad_p
)
7743 if (complain
& tf_error
)
7745 if (permerror (input_location
, "passing %qT as %<this%> "
7746 "argument discards qualifiers",
7747 TREE_TYPE (argtype
)))
7748 inform (DECL_SOURCE_LOCATION (fn
), " in call to %qD", fn
);
7751 return error_mark_node
;
7754 /* See if the function member or the whole class type is declared
7755 final and the call can be devirtualized. */
7756 if (DECL_FINAL_P (fn
)
7757 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
7758 flags
|= LOOKUP_NONVIRTUAL
;
7760 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
7761 X is called for an object that is not of type X, or of a type
7762 derived from X, the behavior is undefined.
7764 So we can assume that anything passed as 'this' is non-null, and
7765 optimize accordingly. */
7766 gcc_assert (TYPE_PTR_P (parmtype
));
7767 /* Convert to the base in which the function was declared. */
7768 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
7769 converted_arg
= build_base_path (PLUS_EXPR
,
7771 cand
->conversion_path
,
7773 /* Check that the base class is accessible. */
7774 if (!accessible_base_p (TREE_TYPE (argtype
),
7775 BINFO_TYPE (cand
->conversion_path
), true))
7777 if (complain
& tf_error
)
7778 error ("%qT is not an accessible base of %qT",
7779 BINFO_TYPE (cand
->conversion_path
),
7780 TREE_TYPE (argtype
));
7782 return error_mark_node
;
7784 /* If fn was found by a using declaration, the conversion path
7785 will be to the derived class, not the base declaring fn. We
7786 must convert from derived to base. */
7787 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
7788 TREE_TYPE (parmtype
), ba_unique
,
7790 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
7791 base_binfo
, 1, complain
);
7793 argarray
[j
++] = converted_arg
;
7794 parm
= TREE_CHAIN (parm
);
7795 if (first_arg
!= NULL_TREE
)
7796 first_arg
= NULL_TREE
;
7803 gcc_assert (first_arg
== NULL_TREE
);
7804 for (; arg_index
< vec_safe_length (args
) && parm
;
7805 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
7807 tree type
= TREE_VALUE (parm
);
7808 tree arg
= (*args
)[arg_index
];
7809 bool conversion_warning
= true;
7813 /* If the argument is NULL and used to (implicitly) instantiate a
7814 template function (and bind one of the template arguments to
7815 the type of 'long int'), we don't want to warn about passing NULL
7816 to non-pointer argument.
7817 For example, if we have this template function:
7819 template<typename T> void func(T x) {}
7821 we want to warn (when -Wconversion is enabled) in this case:
7827 but not in this case:
7833 if (arg
== null_node
7834 && DECL_TEMPLATE_INFO (fn
)
7835 && cand
->template_decl
7836 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
7837 conversion_warning
= false;
7839 /* Warn about initializer_list deduction that isn't currently in the
7841 if (cxx_dialect
> cxx98
7842 && flag_deduce_init_list
7843 && cand
->template_decl
7844 && is_std_init_list (non_reference (type
))
7845 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
7847 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
7848 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
7849 tree patparm
= get_pattern_parm (realparm
, tmpl
);
7850 tree pattype
= TREE_TYPE (patparm
);
7851 if (PACK_EXPANSION_P (pattype
))
7852 pattype
= PACK_EXPANSION_PATTERN (pattype
);
7853 pattype
= non_reference (pattype
);
7855 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
7856 && (cand
->explicit_targs
== NULL_TREE
7857 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
7858 <= TEMPLATE_TYPE_IDX (pattype
))))
7860 pedwarn (input_location
, 0, "deducing %qT as %qT",
7861 non_reference (TREE_TYPE (patparm
)),
7862 non_reference (type
));
7863 pedwarn (DECL_SOURCE_LOCATION (cand
->fn
), 0,
7864 " in call to %qD", cand
->fn
);
7865 pedwarn (input_location
, 0,
7866 " (you can disable this with -fno-deduce-init-list)");
7870 /* Set user_conv_p on the argument conversions, so rvalue/base handling
7871 knows not to allow any more UDCs. This needs to happen after we
7872 process cand->warnings. */
7873 if (flags
& LOOKUP_NO_CONVERSION
)
7874 conv
->user_conv_p
= true;
7876 tsubst_flags_t arg_complain
= complain
& (~tf_no_cleanup
);
7877 if (!conversion_warning
)
7878 arg_complain
&= ~tf_warning
;
7880 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
7882 val
= convert_for_arg_passing (type
, val
, arg_complain
);
7884 if (val
== error_mark_node
)
7885 return error_mark_node
;
7887 argarray
[j
++] = val
;
7890 /* Default arguments */
7891 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
7893 if (TREE_VALUE (parm
) == error_mark_node
)
7894 return error_mark_node
;
7895 argarray
[j
++] = convert_default_arg (TREE_VALUE (parm
),
7896 TREE_PURPOSE (parm
),
7902 int magic
= magic_varargs_p (fn
);
7903 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
7905 tree a
= (*args
)[arg_index
];
7906 if ((magic
== 3 && arg_index
== 2) || magic
== 2)
7908 /* Do no conversions for certain magic varargs. */
7909 a
= mark_type_use (a
);
7910 if (TREE_CODE (a
) == FUNCTION_DECL
&& reject_gcc_builtin (a
))
7911 return error_mark_node
;
7913 else if (magic
!= 0)
7914 /* For other magic varargs only do decay_conversion. */
7915 a
= decay_conversion (a
, complain
);
7916 else if (DECL_CONSTRUCTOR_P (fn
)
7917 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn
),
7920 /* Avoid infinite recursion trying to call A(...). */
7921 if (complain
& tf_error
)
7922 /* Try to call the actual copy constructor for a good error. */
7923 call_copy_ctor (a
, complain
);
7924 return error_mark_node
;
7927 a
= convert_arg_to_ellipsis (a
, complain
);
7928 if (a
== error_mark_node
)
7929 return error_mark_node
;
7933 gcc_assert (j
<= nargs
);
7936 /* Avoid to do argument-transformation, if warnings for format, and for
7937 nonnull are disabled. Just in case that at least one of them is active
7938 the check_function_arguments function might warn about something. */
7940 bool warned_p
= false;
7943 || warn_suggest_attribute_format
7946 tree
*fargs
= (!nargs
? argarray
7947 : (tree
*) alloca (nargs
* sizeof (tree
)));
7948 for (j
= 0; j
< nargs
; j
++)
7949 fargs
[j
] = maybe_constant_value (argarray
[j
]);
7951 warned_p
= check_function_arguments (input_location
, fn
, TREE_TYPE (fn
),
7955 if (DECL_INHERITED_CTOR (fn
))
7957 /* Check for passing ellipsis arguments to an inherited constructor. We
7958 could handle this by open-coding the inherited constructor rather than
7959 defining it, but let's not bother now. */
7960 if (!cp_unevaluated_operand
7962 && cand
->convs
[cand
->num_convs
-1]->ellipsis_p
)
7964 if (complain
& tf_error
)
7966 sorry ("passing arguments to ellipsis of inherited constructor "
7968 inform (DECL_SOURCE_LOCATION (cand
->fn
), "declared here");
7970 return error_mark_node
;
7973 /* A base constructor inheriting from a virtual base doesn't get the
7974 inherited arguments, just this and __vtt. */
7975 if (ctor_omit_inherited_parms (fn
))
7979 /* Avoid actually calling copy constructors and copy assignment operators,
7982 if (! flag_elide_constructors
)
7983 /* Do things the hard way. */;
7984 else if (cand
->num_convs
== 1
7985 && (DECL_COPY_CONSTRUCTOR_P (fn
)
7986 || DECL_MOVE_CONSTRUCTOR_P (fn
))
7987 /* It's unsafe to elide the constructor when handling
7988 a noexcept-expression, it may evaluate to the wrong
7989 value (c++/53025). */
7990 && cp_noexcept_operand
== 0)
7993 tree arg
= argarray
[num_artificial_parms_for (fn
)];
7995 bool trivial
= trivial_fn_p (fn
);
7997 /* Pull out the real argument, disregarding const-correctness. */
7999 /* Strip the reference binding for the constructor parameter. */
8000 if (CONVERT_EXPR_P (targ
)
8001 && TREE_CODE (TREE_TYPE (targ
)) == REFERENCE_TYPE
)
8002 targ
= TREE_OPERAND (targ
, 0);
8003 /* But don't strip any other reference bindings; binding a temporary to a
8004 reference prevents copy elision. */
8005 while ((CONVERT_EXPR_P (targ
)
8006 && TREE_CODE (TREE_TYPE (targ
)) != REFERENCE_TYPE
)
8007 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
8008 targ
= TREE_OPERAND (targ
, 0);
8009 if (TREE_CODE (targ
) == ADDR_EXPR
)
8011 targ
= TREE_OPERAND (targ
, 0);
8012 if (!same_type_ignoring_top_level_qualifiers_p
8013 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
8022 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
8024 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8026 if (CHECKING_P
&& cxx_dialect
>= cxx1z
)
8027 gcc_assert (TREE_CODE (arg
) != TARGET_EXPR
8028 /* It's from binding the ref parm to a packed field. */
8029 || convs
[0]->need_temporary_p
8031 /* See unsafe_copy_elision_p. */
8032 || DECL_BASE_CONSTRUCTOR_P (fn
));
8034 /* [class.copy]: the copy constructor is implicitly defined even if
8035 the implementation elided its use. */
8036 if (!trivial
|| DECL_DELETED_FN (fn
))
8038 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
8039 return error_mark_node
;
8040 already_used
= true;
8043 /* If we're creating a temp and we already have one, don't create a
8044 new one. If we're not creating a temp but we get one, use
8045 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8046 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8047 temp or an INIT_EXPR otherwise. */
8049 if (is_dummy_object (fa
))
8051 if (TREE_CODE (arg
) == TARGET_EXPR
)
8054 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
8056 else if ((trivial
|| TREE_CODE (arg
) == TARGET_EXPR
)
8057 && !unsafe_copy_elision_p (fa
, arg
))
8059 tree to
= cp_stabilize_reference (cp_build_indirect_ref (fa
,
8063 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
8067 else if (DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
8068 && trivial_fn_p (fn
)
8069 && !DECL_DELETED_FN (fn
))
8071 tree to
= cp_stabilize_reference
8072 (cp_build_indirect_ref (argarray
[0], RO_NULL
, complain
));
8073 tree type
= TREE_TYPE (to
);
8074 tree as_base
= CLASSTYPE_AS_BASE (type
);
8075 tree arg
= argarray
[1];
8077 if (is_really_empty_class (type
))
8079 /* Avoid copying empty classes. */
8080 val
= build2 (COMPOUND_EXPR
, type
, arg
, to
);
8081 TREE_NO_WARNING (val
) = 1;
8083 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
8085 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
8086 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
8087 /* Handle NSDMI that refer to the object being initialized. */
8088 replace_placeholders (arg
, to
);
8092 /* We must only copy the non-tail padding parts. */
8094 tree array_type
, alias_set
;
8096 arg2
= TYPE_SIZE_UNIT (as_base
);
8097 arg0
= cp_build_addr_expr (to
, complain
);
8099 array_type
= build_array_type (unsigned_char_type_node
,
8101 (size_binop (MINUS_EXPR
,
8102 arg2
, size_int (1))));
8103 alias_set
= build_int_cst (build_pointer_type (type
), 0);
8104 t
= build2 (MODIFY_EXPR
, void_type_node
,
8105 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
8106 build2 (MEM_REF
, array_type
, arg
, alias_set
));
8107 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
8108 TREE_NO_WARNING (val
) = 1;
8113 else if (!DECL_DELETED_FN (fn
)
8114 && trivial_fn_p (fn
))
8116 if (DECL_DESTRUCTOR_P (fn
))
8117 return fold_convert (void_type_node
, argarray
[0]);
8118 else if (default_ctor_p (fn
))
8120 if (is_dummy_object (argarray
[0]))
8121 return force_target_expr (DECL_CONTEXT (fn
), void_node
, complain
);
8123 return cp_build_indirect_ref (argarray
[0], RO_NULL
, complain
);
8127 /* For calls to a multi-versioned function, overload resolution
8128 returns the function with the highest target priority, that is,
8129 the version that will checked for dispatching first. If this
8130 version is inlinable, a direct call to this version can be made
8131 otherwise the call should go through the dispatcher. */
8133 if (DECL_FUNCTION_VERSIONED (fn
)
8134 && (current_function_decl
== NULL
8135 || !targetm
.target_option
.can_inline_p (current_function_decl
, fn
)))
8137 fn
= get_function_version_dispatcher (fn
);
8141 mark_versions_used (fn
);
8145 && !mark_used (fn
, complain
))
8146 return error_mark_node
;
8148 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0
8149 /* Don't mess with virtual lookup in instantiate_non_dependent_expr;
8150 virtual functions can't be constexpr. */
8151 && !in_template_function ())
8154 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
8156 ba_any
, NULL
, complain
);
8157 gcc_assert (binfo
&& binfo
!= error_mark_node
);
8159 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
8161 if (TREE_SIDE_EFFECTS (argarray
[0]))
8162 argarray
[0] = save_expr (argarray
[0]);
8163 t
= build_pointer_type (TREE_TYPE (fn
));
8164 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
8169 fn
= build_addr_func (fn
, complain
);
8170 if (fn
== error_mark_node
)
8171 return error_mark_node
;
8174 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
8175 if (call
== error_mark_node
)
8177 if (cand
->flags
& LOOKUP_LIST_INIT_CTOR
)
8179 tree c
= extract_call_expr (call
);
8180 /* build_new_op_1 will clear this when appropriate. */
8181 CALL_EXPR_ORDERED_ARGS (c
) = true;
8185 tree c
= extract_call_expr (call
);
8186 if (TREE_CODE (c
) == CALL_EXPR
)
8187 TREE_NO_WARNING (c
) = 1;
8192 /* Return the DECL of the first non-public data member of class TYPE
8193 or null if none can be found. */
8196 first_non_public_field (tree type
)
8198 if (!CLASS_TYPE_P (type
))
8201 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
8203 if (TREE_CODE (field
) != FIELD_DECL
)
8205 if (TREE_STATIC (field
))
8207 if (TREE_PRIVATE (field
) || TREE_PROTECTED (field
))
8213 for (tree base_binfo
, binfo
= TYPE_BINFO (type
);
8214 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8216 tree base
= TREE_TYPE (base_binfo
);
8218 if (tree field
= first_non_public_field (base
))
8225 /* Return true if all copy and move assignment operator overloads for
8226 class TYPE are trivial and at least one of them is not deleted and,
8227 when ACCESS is set, accessible. Return false otherwise. Set
8228 HASASSIGN to true when the TYPE has a (not necessarily trivial)
8229 copy or move assignment. */
8232 has_trivial_copy_assign_p (tree type
, bool access
, bool *hasassign
)
8234 tree fns
= cp_assignment_operator_id (NOP_EXPR
);
8235 fns
= lookup_fnfields_slot (type
, fns
);
8237 bool all_trivial
= true;
8239 /* Iterate over overloads of the assignment operator, checking
8240 accessible copy assignments for triviality. */
8242 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8246 /* Skip operators that aren't copy assignments. */
8250 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8251 || accessible_p (TYPE_BINFO (type
), f
, true));
8253 /* Skip template assignment operators and deleted functions. */
8254 if (TREE_CODE (f
) != FUNCTION_DECL
|| DECL_DELETED_FN (f
))
8260 if (!accessible
|| !trivial_fn_p (f
))
8261 all_trivial
= false;
8263 /* Break early when both properties have been determined. */
8264 if (*hasassign
&& !all_trivial
)
8268 /* Return true if they're all trivial and one of the expressions
8269 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
8270 tree ref
= cp_build_reference_type (type
, false);
8272 && (is_trivially_xible (MODIFY_EXPR
, type
, type
)
8273 || is_trivially_xible (MODIFY_EXPR
, type
, ref
)));
8276 /* Return true if all copy and move ctor overloads for class TYPE are
8277 trivial and at least one of them is not deleted and, when ACCESS is
8278 set, accessible. Return false otherwise. Set each element of HASCTOR[]
8279 to true when the TYPE has a (not necessarily trivial) default and copy
8280 (or move) ctor, respectively. */
8283 has_trivial_copy_p (tree type
, bool access
, bool hasctor
[2])
8285 tree fns
= lookup_fnfields_slot (type
, complete_ctor_identifier
);
8287 bool all_trivial
= true;
8289 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8293 /* Skip template constructors. */
8294 if (TREE_CODE (f
) != FUNCTION_DECL
)
8297 bool cpy_or_move_ctor_p
= copy_fn_p (f
);
8299 /* Skip ctors other than default, copy, and move. */
8300 if (!cpy_or_move_ctor_p
&& !default_ctor_p (f
))
8303 if (DECL_DELETED_FN (f
))
8306 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8307 || accessible_p (TYPE_BINFO (type
), f
, true));
8310 hasctor
[cpy_or_move_ctor_p
] = true;
8312 if (cpy_or_move_ctor_p
&& (!accessible
|| !trivial_fn_p (f
)))
8313 all_trivial
= false;
8315 /* Break early when both properties have been determined. */
8316 if (hasctor
[0] && hasctor
[1] && !all_trivial
)
8323 /* Issue a warning on a call to the built-in function FNDECL if it is
8324 a raw memory write whose destination is not an object of (something
8325 like) trivial or standard layout type with a non-deleted assignment
8326 and copy ctor. Detects const correctness violations, corrupting
8327 references, virtual table pointers, and bypassing non-trivial
8331 maybe_warn_class_memaccess (location_t loc
, tree fndecl
, tree
*args
)
8333 /* Except for bcopy where it's second, the destination pointer is
8334 the first argument for all functions handled here. Compute
8335 the index of the destination and source arguments. */
8336 unsigned dstidx
= DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_BCOPY
;
8337 unsigned srcidx
= !dstidx
;
8339 tree dest
= args
[dstidx
];
8340 if (!dest
|| !TREE_TYPE (dest
) || !POINTER_TYPE_P (TREE_TYPE (dest
)))
8343 /* Remove the outermost (usually implicit) conversion to the void*
8345 if (TREE_CODE (dest
) == NOP_EXPR
)
8346 dest
= TREE_OPERAND (dest
, 0);
8348 tree srctype
= NULL_TREE
;
8350 /* Determine the type of the pointed-to object and whether it's
8351 a complete class type. */
8352 tree desttype
= TREE_TYPE (TREE_TYPE (dest
));
8354 if (!desttype
|| !COMPLETE_TYPE_P (desttype
) || !CLASS_TYPE_P (desttype
))
8357 /* Check to see if the raw memory call is made by a ctor or dtor
8358 with this as the destination argument for the destination type.
8359 If so, be more permissive. */
8360 if (current_function_decl
8361 && (DECL_CONSTRUCTOR_P (current_function_decl
)
8362 || DECL_DESTRUCTOR_P (current_function_decl
))
8363 && is_this_parameter (tree_strip_nop_conversions (dest
)))
8365 tree ctx
= DECL_CONTEXT (current_function_decl
);
8366 bool special
= same_type_ignoring_top_level_qualifiers_p (ctx
, desttype
);
8368 tree binfo
= TYPE_BINFO (ctx
);
8370 /* A ctor and dtor for a class with no bases and no virtual functions
8371 can do whatever they want. Bail early with no further checking. */
8372 if (special
&& !BINFO_VTABLE (binfo
) && !BINFO_N_BASE_BINFOS (binfo
))
8376 /* True if the class is trivial. */
8377 bool trivial
= trivial_type_p (desttype
);
8379 /* Set to true if DESTYPE has an accessible copy assignment. */
8380 bool hasassign
= false;
8381 /* True if all of the class' overloaded copy assignment operators
8382 are all trivial (and not deleted) and at least one of them is
8384 bool trivassign
= has_trivial_copy_assign_p (desttype
, true, &hasassign
);
8386 /* Set to true if DESTTYPE has an accessible default and copy ctor,
8388 bool hasctors
[2] = { false, false };
8390 /* True if all of the class' overloaded copy constructors are all
8391 trivial (and not deleted) and at least one of them is accessible. */
8392 bool trivcopy
= has_trivial_copy_p (desttype
, true, hasctors
);
8394 /* Set FLD to the first private/protected member of the class. */
8395 tree fld
= trivial
? first_non_public_field (desttype
) : NULL_TREE
;
8397 /* The warning format string. */
8398 const char *warnfmt
= NULL
;
8399 /* A suggested alternative to offer instead of the raw memory call.
8400 Empty string when none can be come up with. */
8401 const char *suggest
= "";
8402 bool warned
= false;
8404 switch (DECL_FUNCTION_CODE (fndecl
))
8406 case BUILT_IN_MEMSET
:
8407 if (!integer_zerop (args
[1]))
8409 /* Diagnose setting non-copy-assignable or non-trivial types,
8410 or types with a private member, to (potentially) non-zero
8411 bytes. Since the value of the bytes being written is unknown,
8412 suggest using assignment instead (if one exists). Also warn
8413 for writes into objects for which zero-initialization doesn't
8414 mean all bits clear (pointer-to-member data, where null is all
8415 bits set). Since the value being written is (most likely)
8416 non-zero, simply suggest assignment (but not copy assignment). */
8417 suggest
= "; use assignment instead";
8419 warnfmt
= G_("%qD writing to an object of type %#qT with "
8420 "no trivial copy-assignment");
8422 warnfmt
= G_("%qD writing to an object of non-trivial type %#qT%s");
8425 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8426 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8427 "%qD writing to an object of type %#qT with "
8429 fndecl
, desttype
, access
, fld
);
8431 else if (!zero_init_p (desttype
))
8432 warnfmt
= G_("%qD writing to an object of type %#qT containing "
8433 "a pointer to data member%s");
8439 case BUILT_IN_BZERO
:
8440 /* Similarly to the above, diagnose clearing non-trivial or non-
8441 standard layout objects, or objects of types with no assignmenmt.
8442 Since the value being written is known to be zero, suggest either
8443 copy assignment, copy ctor, or default ctor as an alternative,
8444 depending on what's available. */
8446 if (hasassign
&& hasctors
[0])
8447 suggest
= G_("; use assignment or value-initialization instead");
8449 suggest
= G_("; use assignment instead");
8450 else if (hasctors
[0])
8451 suggest
= G_("; use value-initialization instead");
8454 warnfmt
= G_("%qD clearing an object of type %#qT with "
8455 "no trivial copy-assignment%s");
8457 warnfmt
= G_("%qD clearing an object of non-trivial type %#qT%s");
8458 else if (!zero_init_p (desttype
))
8459 warnfmt
= G_("%qD clearing an object of type %#qT containing "
8460 "a pointer-to-member%s");
8463 case BUILT_IN_BCOPY
:
8464 case BUILT_IN_MEMCPY
:
8465 case BUILT_IN_MEMMOVE
:
8466 case BUILT_IN_MEMPCPY
:
8467 /* Determine the type of the source object. */
8468 srctype
= STRIP_NOPS (args
[srcidx
]);
8469 srctype
= TREE_TYPE (TREE_TYPE (srctype
));
8471 /* Since it's impossible to determine wheter the byte copy is
8472 being used in place of assignment to an existing object or
8473 as a substitute for initialization, assume it's the former.
8474 Determine the best alternative to use instead depending on
8475 what's not deleted. */
8476 if (hasassign
&& hasctors
[1])
8477 suggest
= G_("; use copy-assignment or copy-initialization instead");
8479 suggest
= G_("; use copy-assignment instead");
8480 else if (hasctors
[1])
8481 suggest
= G_("; use copy-initialization instead");
8484 warnfmt
= G_("%qD writing to an object of type %#qT with no trivial "
8485 "copy-assignment%s");
8486 else if (!trivially_copyable_p (desttype
))
8487 warnfmt
= G_("%qD writing to an object of non-trivially copyable "
8490 warnfmt
= G_("%qD writing to an object with a deleted copy constructor");
8493 && !VOID_TYPE_P (srctype
)
8494 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
8495 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
8498 /* Warn when copying into a non-trivial object from an object
8499 of a different type other than void or char. */
8500 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8501 "%qD copying an object of non-trivial type "
8502 "%#qT from an array of %#qT",
8503 fndecl
, desttype
, srctype
);
8506 && !VOID_TYPE_P (srctype
)
8507 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
8508 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
8511 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8512 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8513 "%qD copying an object of type %#qT with "
8514 "%qs member %qD from an array of %#qT; use "
8515 "assignment or copy-initialization instead",
8516 fndecl
, desttype
, access
, fld
, srctype
);
8518 else if (!trivial
&& TREE_CODE (args
[2]) == INTEGER_CST
)
8520 /* Finally, warn on partial copies. */
8521 unsigned HOST_WIDE_INT typesize
8522 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype
));
8523 if (unsigned HOST_WIDE_INT partial
8524 = tree_to_uhwi (args
[2]) % typesize
)
8525 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8526 (typesize
- partial
> 1
8527 ? G_("%qD writing to an object of "
8528 "a non-trivial type %#qT leaves %wu "
8530 : G_("%qD writing to an object of "
8531 "a non-trivial type %#qT leaves %wu "
8533 fndecl
, desttype
, typesize
- partial
);
8537 case BUILT_IN_REALLOC
:
8539 if (!trivially_copyable_p (desttype
))
8540 warnfmt
= G_("%qD moving an object of non-trivially copyable type "
8541 "%#qT; use %<new%> and %<delete%> instead");
8543 warnfmt
= G_("%qD moving an object of type %#qT with deleted copy "
8544 "constructor; use %<new%> and %<delete%> instead");
8545 else if (!get_dtor (desttype
, tf_none
))
8546 warnfmt
= G_("%qD moving an object of type %#qT with deleted "
8549 && TREE_CODE (args
[1]) == INTEGER_CST
8550 && tree_int_cst_lt (args
[1], TYPE_SIZE_UNIT (desttype
)))
8552 /* Finally, warn on reallocation into insufficient space. */
8553 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8554 "%qD moving an object of non-trivial type "
8555 "%#qT and size %E into a region of size %E",
8556 fndecl
, desttype
, TYPE_SIZE_UNIT (desttype
),
8565 if (!warned
&& !warnfmt
)
8571 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8572 warnfmt
, fndecl
, desttype
, suggest
);
8574 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8575 warnfmt
, fndecl
, desttype
);
8579 inform (location_of (desttype
), "%#qT declared here", desttype
);
8582 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
8583 This function performs no overload resolution, conversion, or other
8584 high-level operations. */
8587 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
8588 tsubst_flags_t complain
)
8592 /* Remember roughly where this call is. */
8593 location_t loc
= EXPR_LOC_OR_LOC (fn
, input_location
);
8594 fn
= build_call_a (fn
, nargs
, argarray
);
8595 SET_EXPR_LOCATION (fn
, loc
);
8597 fndecl
= get_callee_fndecl (fn
);
8599 /* Check that arguments to builtin functions match the expectations. */
8601 && DECL_BUILT_IN (fndecl
)
8602 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
8606 /* We need to take care that values to BUILT_IN_NORMAL
8608 for (i
= 0; i
< nargs
; i
++)
8609 argarray
[i
] = fold_non_dependent_expr (argarray
[i
]);
8611 if (!check_builtin_function_arguments (EXPR_LOCATION (fn
), vNULL
, fndecl
,
8613 return error_mark_node
;
8615 /* Warn if the built-in writes to an object of a non-trivial type. */
8617 maybe_warn_class_memaccess (loc
, fndecl
, argarray
);
8620 /* If it is a built-in array notation function, then the return type of
8621 the function is the element type of the array passed in as array
8622 notation (i.e. the first parameter of the function). */
8623 if (flag_cilkplus
&& TREE_CODE (fn
) == CALL_EXPR
)
8625 enum built_in_function bif
=
8626 is_cilkplus_reduce_builtin (CALL_EXPR_FN (fn
));
8627 if (bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_ADD
8628 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MUL
8629 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MAX
8630 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MIN
8631 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE
8632 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MUTATING
)
8634 if (call_expr_nargs (fn
) == 0)
8636 error_at (EXPR_LOCATION (fn
), "Invalid builtin arguments");
8637 return error_mark_node
;
8639 /* for bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_ZERO or
8640 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_ZERO or
8641 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_NONZERO or
8642 BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_NONZERO or
8643 BUILT_IN_CILKPLUS_SEC_REDUCE_MIN_IND or
8644 BUILT_IN_CILKPLUS_SEC_REDUCE_MAX_IND
8645 The pre-defined return-type is the correct one. */
8646 tree array_ntn
= CALL_EXPR_ARG (fn
, 0);
8647 TREE_TYPE (fn
) = TREE_TYPE (array_ntn
);
8652 if (VOID_TYPE_P (TREE_TYPE (fn
)))
8655 /* 5.2.2/11: If a function call is a prvalue of object type: if the
8656 function call is either the operand of a decltype-specifier or the
8657 right operand of a comma operator that is the operand of a
8658 decltype-specifier, a temporary object is not introduced for the
8659 prvalue. The type of the prvalue may be incomplete. */
8660 if (!(complain
& tf_decltype
))
8662 fn
= require_complete_type_sfinae (fn
, complain
);
8663 if (fn
== error_mark_node
)
8664 return error_mark_node
;
8666 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
8668 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
8669 maybe_warn_parm_abi (TREE_TYPE (fn
), loc
);
8672 return convert_from_reference (fn
);
8675 /* Returns the value to use for the in-charge parameter when making a
8676 call to a function with the indicated NAME.
8678 FIXME:Can't we find a neater way to do this mapping? */
8681 in_charge_arg_for_name (tree name
)
8683 if (IDENTIFIER_CTOR_P (name
))
8685 if (name
== complete_ctor_identifier
)
8686 return integer_one_node
;
8687 gcc_checking_assert (name
== base_ctor_identifier
);
8691 if (name
== complete_dtor_identifier
)
8692 return integer_two_node
;
8693 else if (name
== deleting_dtor_identifier
)
8694 return integer_three_node
;
8695 gcc_checking_assert (name
== base_dtor_identifier
);
8698 return integer_zero_node
;
8701 /* We've built up a constructor call RET. Complain if it delegates to the
8702 constructor we're currently compiling. */
8705 check_self_delegation (tree ret
)
8707 if (TREE_CODE (ret
) == TARGET_EXPR
)
8708 ret
= TARGET_EXPR_INITIAL (ret
);
8709 tree fn
= cp_get_callee_fndecl (ret
);
8710 if (fn
&& DECL_ABSTRACT_ORIGIN (fn
) == current_function_decl
)
8711 error ("constructor delegates to itself");
8714 /* Build a call to a constructor, destructor, or an assignment
8715 operator for INSTANCE, an expression with class type. NAME
8716 indicates the special member function to call; *ARGS are the
8717 arguments. ARGS may be NULL. This may change ARGS. BINFO
8718 indicates the base of INSTANCE that is to be passed as the `this'
8719 parameter to the member function called.
8721 FLAGS are the LOOKUP_* flags to use when processing the call.
8723 If NAME indicates a complete object constructor, INSTANCE may be
8724 NULL_TREE. In this case, the caller will call build_cplus_new to
8725 store the newly constructed object into a VAR_DECL. */
8728 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
8729 tree binfo
, int flags
, tsubst_flags_t complain
)
8732 /* The type of the subobject to be constructed or destroyed. */
8734 vec
<tree
, va_gc
> *allocated
= NULL
;
8737 gcc_assert (IDENTIFIER_CDTOR_P (name
)
8738 || name
== cp_assignment_operator_id (NOP_EXPR
));
8741 /* Resolve the name. */
8742 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
8743 return error_mark_node
;
8745 binfo
= TYPE_BINFO (binfo
);
8748 gcc_assert (binfo
!= NULL_TREE
);
8750 class_type
= BINFO_TYPE (binfo
);
8752 /* Handle the special case where INSTANCE is NULL_TREE. */
8753 if (name
== complete_ctor_identifier
&& !instance
)
8754 instance
= build_dummy_object (class_type
);
8757 if (IDENTIFIER_DTOR_P (name
))
8758 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
8760 /* Convert to the base class, if necessary. */
8761 if (!same_type_ignoring_top_level_qualifiers_p
8762 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
8764 if (name
!= cp_assignment_operator_id (NOP_EXPR
))
8765 /* For constructors and destructors, either the base is
8766 non-virtual, or it is virtual but we are doing the
8767 conversion from a constructor or destructor for the
8768 complete object. In either case, we can convert
8770 instance
= convert_to_base_statically (instance
, binfo
);
8772 /* However, for assignment operators, we must convert
8773 dynamically if the base is virtual. */
8774 instance
= build_base_path (PLUS_EXPR
, instance
,
8775 binfo
, /*nonnull=*/1, complain
);
8779 gcc_assert (instance
!= NULL_TREE
);
8781 /* In C++17, "If the initializer expression is a prvalue and the
8782 cv-unqualified version of the source type is the same class as the class
8783 of the destination, the initializer expression is used to initialize the
8784 destination object." Handle that here to avoid doing overload
8786 if (cxx_dialect
>= cxx1z
8787 && args
&& vec_safe_length (*args
) == 1
8788 && name
== complete_ctor_identifier
)
8790 tree arg
= (**args
)[0];
8792 /* FIXME P0135 doesn't say how to handle direct initialization from a
8793 type with a suitable conversion operator. Let's handle it like
8794 copy-initialization, but allowing explict conversions. */
8795 tsubst_flags_t sub_complain
= tf_warning
;
8796 if (!is_dummy_object (instance
))
8797 /* If we're using this to initialize a non-temporary object, don't
8798 require the destructor to be accessible. */
8799 sub_complain
|= tf_no_cleanup
;
8800 if (!reference_related_p (class_type
, TREE_TYPE (arg
)))
8801 arg
= perform_implicit_conversion_flags (class_type
, arg
,
8804 if ((TREE_CODE (arg
) == TARGET_EXPR
8805 || TREE_CODE (arg
) == CONSTRUCTOR
)
8806 && (same_type_ignoring_top_level_qualifiers_p
8807 (class_type
, TREE_TYPE (arg
))))
8809 if (is_dummy_object (instance
))
8811 if ((complain
& tf_error
)
8812 && (flags
& LOOKUP_DELEGATING_CONS
))
8813 check_self_delegation (arg
);
8814 /* Avoid change of behavior on Wunused-var-2.C. */
8815 mark_lvalue_use (instance
);
8816 return build2 (INIT_EXPR
, class_type
, instance
, arg
);
8820 fns
= lookup_fnfields (binfo
, name
, 1);
8822 /* When making a call to a constructor or destructor for a subobject
8823 that uses virtual base classes, pass down a pointer to a VTT for
8825 if ((name
== base_ctor_identifier
8826 || name
== base_dtor_identifier
)
8827 && CLASSTYPE_VBASECLASSES (class_type
))
8832 /* If the current function is a complete object constructor
8833 or destructor, then we fetch the VTT directly.
8834 Otherwise, we look it up using the VTT we were given. */
8835 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
8836 vtt
= decay_conversion (vtt
, complain
);
8837 if (vtt
== error_mark_node
)
8838 return error_mark_node
;
8839 vtt
= build_if_in_charge (vtt
, current_vtt_parm
);
8840 if (BINFO_SUBVTT_INDEX (binfo
))
8841 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
8847 allocated
= make_tree_vector ();
8851 vec_safe_insert (*args
, 0, sub_vtt
);
8854 ret
= build_new_method_call (instance
, fns
, args
,
8855 TYPE_BINFO (BINFO_TYPE (binfo
)),
8859 if (allocated
!= NULL
)
8860 release_tree_vector (allocated
);
8862 if ((complain
& tf_error
)
8863 && (flags
& LOOKUP_DELEGATING_CONS
)
8864 && name
== complete_ctor_identifier
)
8865 check_self_delegation (ret
);
8870 /* Return the NAME, as a C string. The NAME indicates a function that
8871 is a member of TYPE. *FREE_P is set to true if the caller must
8872 free the memory returned.
8874 Rather than go through all of this, we should simply set the names
8875 of constructors and destructors appropriately, and dispense with
8876 ctor_identifier, dtor_identifier, etc. */
8879 name_as_c_string (tree name
, tree type
, bool *free_p
)
8883 /* Assume that we will not allocate memory. */
8885 /* Constructors and destructors are special. */
8886 if (IDENTIFIER_CDTOR_P (name
))
8889 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
))));
8890 /* For a destructor, add the '~'. */
8891 if (IDENTIFIER_DTOR_P (name
))
8893 pretty_name
= concat ("~", pretty_name
, NULL
);
8894 /* Remember that we need to free the memory allocated. */
8898 else if (IDENTIFIER_CONV_OP_P (name
))
8900 pretty_name
= concat ("operator ",
8901 type_as_string_translate (TREE_TYPE (name
),
8902 TFF_PLAIN_IDENTIFIER
),
8904 /* Remember that we need to free the memory allocated. */
8908 pretty_name
= CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name
)));
8913 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
8914 be set, upon return, to the function called. ARGS may be NULL.
8915 This may change ARGS. */
8918 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
8919 tree conversion_path
, int flags
,
8920 tree
*fn_p
, tsubst_flags_t complain
)
8922 struct z_candidate
*candidates
= 0, *cand
;
8923 tree explicit_targs
= NULL_TREE
;
8924 tree basetype
= NULL_TREE
;
8925 tree access_binfo
, binfo
;
8927 tree first_mem_arg
= NULL_TREE
;
8929 bool skip_first_for_error
;
8930 vec
<tree
, va_gc
> *user_args
;
8933 int template_only
= 0;
8937 vec
<tree
, va_gc
> *orig_args
= NULL
;
8940 gcc_assert (instance
!= NULL_TREE
);
8942 /* We don't know what function we're going to call, yet. */
8946 if (error_operand_p (instance
)
8947 || !fns
|| error_operand_p (fns
))
8948 return error_mark_node
;
8950 if (!BASELINK_P (fns
))
8952 if (complain
& tf_error
)
8953 error ("call to non-function %qD", fns
);
8954 return error_mark_node
;
8957 orig_instance
= instance
;
8960 /* Dismantle the baselink to collect all the information we need. */
8961 if (!conversion_path
)
8962 conversion_path
= BASELINK_BINFO (fns
);
8963 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
8964 binfo
= BASELINK_BINFO (fns
);
8965 optype
= BASELINK_OPTYPE (fns
);
8966 fns
= BASELINK_FUNCTIONS (fns
);
8967 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
8969 explicit_targs
= TREE_OPERAND (fns
, 1);
8970 fns
= TREE_OPERAND (fns
, 0);
8973 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
8974 || TREE_CODE (fns
) == TEMPLATE_DECL
8975 || TREE_CODE (fns
) == OVERLOAD
);
8976 fn
= OVL_FIRST (fns
);
8977 name
= DECL_NAME (fn
);
8979 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
8980 gcc_assert (CLASS_TYPE_P (basetype
));
8982 if (processing_template_decl
)
8984 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
8985 instance
= build_non_dependent_expr (instance
);
8987 make_args_non_dependent (*args
);
8990 user_args
= args
== NULL
? NULL
: *args
;
8991 /* Under DR 147 A::A() is an invalid constructor call,
8992 not a functional cast. */
8993 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
8995 if (! (complain
& tf_error
))
8996 return error_mark_node
;
8998 if (permerror (input_location
,
8999 "cannot call constructor %<%T::%D%> directly",
9001 inform (input_location
, "for a function-style cast, remove the "
9002 "redundant %<::%D%>", name
);
9003 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
9008 /* Figure out whether to skip the first argument for the error
9009 message we will display to users if an error occurs. We don't
9010 want to display any compiler-generated arguments. The "this"
9011 pointer hasn't been added yet. However, we must remove the VTT
9012 pointer if this is a call to a base-class constructor or
9014 skip_first_for_error
= false;
9015 if (IDENTIFIER_CDTOR_P (name
))
9017 /* Callers should explicitly indicate whether they want to construct
9018 the complete object or just the part without virtual bases. */
9019 gcc_assert (name
!= ctor_identifier
);
9020 /* Similarly for destructors. */
9021 gcc_assert (name
!= dtor_identifier
);
9022 /* Remove the VTT pointer, if present. */
9023 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
9024 && CLASSTYPE_VBASECLASSES (basetype
))
9025 skip_first_for_error
= true;
9028 /* Process the argument list. */
9029 if (args
!= NULL
&& *args
!= NULL
)
9031 *args
= resolve_args (*args
, complain
);
9033 return error_mark_node
;
9036 /* Consider the object argument to be used even if we end up selecting a
9037 static member function. */
9038 instance
= mark_type_use (instance
);
9040 /* It's OK to call destructors and constructors on cv-qualified objects.
9041 Therefore, convert the INSTANCE to the unqualified type, if
9043 if (DECL_DESTRUCTOR_P (fn
)
9044 || DECL_CONSTRUCTOR_P (fn
))
9046 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
9048 instance
= build_this (instance
);
9049 instance
= build_nop (build_pointer_type (basetype
), instance
);
9050 instance
= build_fold_indirect_ref (instance
);
9053 if (DECL_DESTRUCTOR_P (fn
))
9054 name
= complete_dtor_identifier
;
9056 /* For the overload resolution we need to find the actual `this`
9057 that would be captured if the call turns out to be to a
9058 non-static member function. Do not actually capture it at this
9060 if (DECL_CONSTRUCTOR_P (fn
))
9061 /* Constructors don't use the enclosing 'this'. */
9062 first_mem_arg
= instance
;
9064 first_mem_arg
= maybe_resolve_dummy (instance
, false);
9066 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9067 p
= conversion_obstack_alloc (0);
9069 /* The number of arguments artificial parms in ARGS; we subtract one because
9070 there's no 'this' in ARGS. */
9071 unsigned skip
= num_artificial_parms_for (fn
) - 1;
9073 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
9074 initializer, not T({ }). */
9075 if (DECL_CONSTRUCTOR_P (fn
)
9076 && vec_safe_length (user_args
) > skip
9077 && DIRECT_LIST_INIT_P ((*user_args
)[skip
]))
9079 tree init_list
= (*user_args
)[skip
];
9080 tree init
= NULL_TREE
;
9082 gcc_assert (user_args
->length () == skip
+ 1
9083 && !(flags
& LOOKUP_ONLYCONVERTING
));
9085 /* If the initializer list has no elements and T is a class type with
9086 a default constructor, the object is value-initialized. Handle
9087 this here so we don't need to handle it wherever we use
9088 build_special_member_call. */
9089 if (CONSTRUCTOR_NELTS (init_list
) == 0
9090 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
9091 /* For a user-provided default constructor, use the normal
9092 mechanisms so that protected access works. */
9093 && type_has_non_user_provided_default_constructor (basetype
)
9094 && !processing_template_decl
)
9095 init
= build_value_init (basetype
, complain
);
9097 /* If BASETYPE is an aggregate, we need to do aggregate
9099 else if (CP_AGGREGATE_TYPE_P (basetype
))
9101 init
= reshape_init (basetype
, init_list
, complain
);
9102 init
= digest_init (basetype
, init
, complain
);
9107 if (is_dummy_object (instance
))
9108 return get_target_expr_sfinae (init
, complain
);
9109 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
9110 TREE_SIDE_EFFECTS (init
) = true;
9114 /* Otherwise go ahead with overload resolution. */
9115 add_list_candidates (fns
, first_mem_arg
, user_args
,
9116 basetype
, explicit_targs
, template_only
,
9117 conversion_path
, access_binfo
, flags
,
9118 &candidates
, complain
);
9122 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
9123 explicit_targs
, template_only
, conversion_path
,
9124 access_binfo
, flags
, &candidates
, complain
);
9126 any_viable_p
= false;
9127 candidates
= splice_viable (candidates
, false, &any_viable_p
);
9131 if (complain
& tf_error
)
9133 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
9134 cxx_incomplete_type_error (instance
, basetype
);
9136 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9137 basetype
, optype
, build_tree_list_vec (user_args
),
9138 TREE_TYPE (instance
));
9141 tree arglist
= build_tree_list_vec (user_args
);
9142 tree errname
= name
;
9143 if (IDENTIFIER_CDTOR_P (errname
))
9145 tree fn
= DECL_ORIGIN (OVL_FIRST (fns
));
9146 errname
= DECL_NAME (fn
);
9149 errname
= lookup_template_function (errname
, explicit_targs
);
9150 if (skip_first_for_error
)
9151 arglist
= TREE_CHAIN (arglist
);
9152 error ("no matching function for call to %<%T::%E(%A)%#V%>",
9153 basetype
, errname
, arglist
,
9154 TREE_TYPE (instance
));
9156 print_z_candidates (location_of (name
), candidates
);
9158 call
= error_mark_node
;
9162 cand
= tourney (candidates
, complain
);
9169 if (complain
& tf_error
)
9171 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
9172 arglist
= build_tree_list_vec (user_args
);
9173 if (skip_first_for_error
)
9174 arglist
= TREE_CHAIN (arglist
);
9175 if (!any_strictly_viable (candidates
))
9176 error ("no matching function for call to %<%s(%A)%>",
9177 pretty_name
, arglist
);
9179 error ("call of overloaded %<%s(%A)%> is ambiguous",
9180 pretty_name
, arglist
);
9181 print_z_candidates (location_of (name
), candidates
);
9185 call
= error_mark_node
;
9192 if (!(flags
& LOOKUP_NONVIRTUAL
)
9193 && DECL_PURE_VIRTUAL_P (fn
)
9194 && instance
== current_class_ref
9195 && (complain
& tf_warning
))
9197 /* This is not an error, it is runtime undefined
9199 if (!current_function_decl
)
9200 warning (0, "pure virtual %q#D called from "
9201 "non-static data member initializer", fn
);
9202 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
9203 || DECL_DESTRUCTOR_P (current_function_decl
))
9204 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
9205 ? G_("pure virtual %q#D called from constructor")
9206 : G_("pure virtual %q#D called from destructor")),
9210 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
9211 && !DECL_CONSTRUCTOR_P (fn
)
9212 && is_dummy_object (instance
))
9214 instance
= maybe_resolve_dummy (instance
, true);
9215 if (instance
== error_mark_node
)
9216 call
= error_mark_node
;
9217 else if (!is_dummy_object (instance
))
9219 /* We captured 'this' in the current lambda now that
9220 we know we really need it. */
9221 cand
->first_arg
= instance
;
9223 else if (any_dependent_bases_p ())
9224 /* We can't tell until instantiation time whether we can use
9225 *this as the implicit object argument. */;
9228 if (complain
& tf_error
)
9229 error ("cannot call member function %qD without object",
9231 call
= error_mark_node
;
9235 if (call
!= error_mark_node
)
9237 /* Optimize away vtable lookup if we know that this
9238 function can't be overridden. We need to check if
9239 the context and the type where we found fn are the same,
9240 actually FN might be defined in a different class
9241 type because of a using-declaration. In this case, we
9242 do not want to perform a non-virtual call. */
9243 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
9244 && same_type_ignoring_top_level_qualifiers_p
9245 (DECL_CONTEXT (fn
), BINFO_TYPE (binfo
))
9246 && resolves_to_fixed_type_p (instance
, 0))
9247 flags
|= LOOKUP_NONVIRTUAL
;
9249 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
9250 /* Now we know what function is being called. */
9253 /* Build the actual CALL_EXPR. */
9254 call
= build_over_call (cand
, flags
, complain
);
9255 /* In an expression of the form `a->f()' where `f' turns
9256 out to be a static member function, `a' is
9257 none-the-less evaluated. */
9258 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
9259 && !is_dummy_object (instance
)
9260 && TREE_SIDE_EFFECTS (instance
))
9261 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
),
9263 else if (call
!= error_mark_node
9264 && DECL_DESTRUCTOR_P (cand
->fn
)
9265 && !VOID_TYPE_P (TREE_TYPE (call
)))
9266 /* An explicit call of the form "x->~X()" has type
9267 "void". However, on platforms where destructors
9268 return "this" (i.e., those where
9269 targetm.cxx.cdtor_returns_this is true), such calls
9270 will appear to have a return value of pointer type
9271 to the low-level call machinery. We do not want to
9272 change the low-level machinery, since we want to be
9273 able to optimize "delete f()" on such platforms as
9274 "operator delete(~X(f()))" (rather than generating
9275 "t = f(), ~X(t), operator delete (t)"). */
9276 call
= build_nop (void_type_node
, call
);
9281 if (processing_template_decl
&& call
!= error_mark_node
)
9283 bool cast_to_void
= false;
9285 if (TREE_CODE (call
) == COMPOUND_EXPR
)
9286 call
= TREE_OPERAND (call
, 1);
9287 else if (TREE_CODE (call
) == NOP_EXPR
)
9289 cast_to_void
= true;
9290 call
= TREE_OPERAND (call
, 0);
9292 if (INDIRECT_REF_P (call
))
9293 call
= TREE_OPERAND (call
, 0);
9294 call
= (build_min_non_dep_call_vec
9296 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
9297 orig_instance
, orig_fns
, NULL_TREE
),
9299 SET_EXPR_LOCATION (call
, input_location
);
9300 call
= convert_from_reference (call
);
9302 call
= build_nop (void_type_node
, call
);
9305 /* Free all the conversions we allocated. */
9306 obstack_free (&conversion_obstack
, p
);
9308 if (orig_args
!= NULL
)
9309 release_tree_vector (orig_args
);
9314 /* Wrapper for above. */
9317 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9318 tree conversion_path
, int flags
,
9319 tree
*fn_p
, tsubst_flags_t complain
)
9322 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
9323 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
9325 timevar_cond_stop (TV_OVERLOAD
, subtime
);
9329 /* Returns true iff standard conversion sequence ICS1 is a proper
9330 subsequence of ICS2. */
9333 is_subseq (conversion
*ics1
, conversion
*ics2
)
9335 /* We can assume that a conversion of the same code
9336 between the same types indicates a subsequence since we only get
9337 here if the types we are converting from are the same. */
9339 while (ics1
->kind
== ck_rvalue
9340 || ics1
->kind
== ck_lvalue
)
9341 ics1
= next_conversion (ics1
);
9345 while (ics2
->kind
== ck_rvalue
9346 || ics2
->kind
== ck_lvalue
)
9347 ics2
= next_conversion (ics2
);
9349 if (ics2
->kind
== ck_user
9350 || ics2
->kind
== ck_ambig
9351 || ics2
->kind
== ck_aggr
9352 || ics2
->kind
== ck_list
9353 || ics2
->kind
== ck_identity
)
9354 /* At this point, ICS1 cannot be a proper subsequence of
9355 ICS2. We can get a USER_CONV when we are comparing the
9356 second standard conversion sequence of two user conversion
9360 ics2
= next_conversion (ics2
);
9362 while (ics2
->kind
== ck_rvalue
9363 || ics2
->kind
== ck_lvalue
)
9364 ics2
= next_conversion (ics2
);
9366 if (ics2
->kind
== ics1
->kind
9367 && same_type_p (ics2
->type
, ics1
->type
)
9368 && (ics1
->kind
== ck_identity
9369 || same_type_p (next_conversion (ics2
)->type
,
9370 next_conversion (ics1
)->type
)))
9375 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
9376 be any _TYPE nodes. */
9379 is_properly_derived_from (tree derived
, tree base
)
9381 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
9384 /* We only allow proper derivation here. The DERIVED_FROM_P macro
9385 considers every class derived from itself. */
9386 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
9387 && DERIVED_FROM_P (base
, derived
));
9390 /* We build the ICS for an implicit object parameter as a pointer
9391 conversion sequence. However, such a sequence should be compared
9392 as if it were a reference conversion sequence. If ICS is the
9393 implicit conversion sequence for an implicit object parameter,
9394 modify it accordingly. */
9397 maybe_handle_implicit_object (conversion
**ics
)
9401 /* [over.match.funcs]
9403 For non-static member functions, the type of the
9404 implicit object parameter is "reference to cv X"
9405 where X is the class of which the function is a
9406 member and cv is the cv-qualification on the member
9407 function declaration. */
9408 conversion
*t
= *ics
;
9409 tree reference_type
;
9411 /* The `this' parameter is a pointer to a class type. Make the
9412 implicit conversion talk about a reference to that same class
9414 reference_type
= TREE_TYPE (t
->type
);
9415 reference_type
= build_reference_type (reference_type
);
9417 if (t
->kind
== ck_qual
)
9418 t
= next_conversion (t
);
9419 if (t
->kind
== ck_ptr
)
9420 t
= next_conversion (t
);
9421 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
9422 t
= direct_reference_binding (reference_type
, t
);
9424 t
->rvaluedness_matches_p
= 0;
9429 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
9430 and return the initial reference binding conversion. Otherwise,
9431 leave *ICS unchanged and return NULL. */
9434 maybe_handle_ref_bind (conversion
**ics
)
9436 if ((*ics
)->kind
== ck_ref_bind
)
9438 conversion
*old_ics
= *ics
;
9439 *ics
= next_conversion (old_ics
);
9440 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
9447 /* Compare two implicit conversion sequences according to the rules set out in
9448 [over.ics.rank]. Return values:
9450 1: ics1 is better than ics2
9451 -1: ics2 is better than ics1
9452 0: ics1 and ics2 are indistinguishable */
9455 compare_ics (conversion
*ics1
, conversion
*ics2
)
9461 tree deref_from_type1
= NULL_TREE
;
9462 tree deref_from_type2
= NULL_TREE
;
9463 tree deref_to_type1
= NULL_TREE
;
9464 tree deref_to_type2
= NULL_TREE
;
9465 conversion_rank rank1
, rank2
;
9467 /* REF_BINDING is nonzero if the result of the conversion sequence
9468 is a reference type. In that case REF_CONV is the reference
9469 binding conversion. */
9470 conversion
*ref_conv1
;
9471 conversion
*ref_conv2
;
9473 /* Compare badness before stripping the reference conversion. */
9474 if (ics1
->bad_p
> ics2
->bad_p
)
9476 else if (ics1
->bad_p
< ics2
->bad_p
)
9479 /* Handle implicit object parameters. */
9480 maybe_handle_implicit_object (&ics1
);
9481 maybe_handle_implicit_object (&ics2
);
9483 /* Handle reference parameters. */
9484 ref_conv1
= maybe_handle_ref_bind (&ics1
);
9485 ref_conv2
= maybe_handle_ref_bind (&ics2
);
9487 /* List-initialization sequence L1 is a better conversion sequence than
9488 list-initialization sequence L2 if L1 converts to
9489 std::initializer_list<X> for some X and L2 does not. */
9490 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
9492 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
9497 When comparing the basic forms of implicit conversion sequences (as
9498 defined in _over.best.ics_)
9500 --a standard conversion sequence (_over.ics.scs_) is a better
9501 conversion sequence than a user-defined conversion sequence
9502 or an ellipsis conversion sequence, and
9504 --a user-defined conversion sequence (_over.ics.user_) is a
9505 better conversion sequence than an ellipsis conversion sequence
9506 (_over.ics.ellipsis_). */
9507 /* Use BAD_CONVERSION_RANK because we already checked for a badness
9508 mismatch. If both ICS are bad, we try to make a decision based on
9509 what would have happened if they'd been good. This is not an
9510 extension, we'll still give an error when we build up the call; this
9511 just helps us give a more helpful error message. */
9512 rank1
= BAD_CONVERSION_RANK (ics1
);
9513 rank2
= BAD_CONVERSION_RANK (ics2
);
9517 else if (rank1
< rank2
)
9520 if (ics1
->ellipsis_p
)
9521 /* Both conversions are ellipsis conversions. */
9524 /* User-defined conversion sequence U1 is a better conversion sequence
9525 than another user-defined conversion sequence U2 if they contain the
9526 same user-defined conversion operator or constructor and if the sec-
9527 ond standard conversion sequence of U1 is better than the second
9528 standard conversion sequence of U2. */
9530 /* Handle list-conversion with the same code even though it isn't always
9531 ranked as a user-defined conversion and it doesn't have a second
9532 standard conversion sequence; it will still have the desired effect.
9533 Specifically, we need to do the reference binding comparison at the
9534 end of this function. */
9536 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
|| ics1
->kind
== ck_aggr
)
9541 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
9542 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
9543 || t1
->kind
== ck_list
)
9545 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
9546 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
9547 || t2
->kind
== ck_list
)
9550 if (t1
->kind
!= t2
->kind
)
9552 else if (t1
->kind
== ck_user
)
9554 if (t1
->cand
->fn
!= t2
->cand
->fn
)
9559 /* For ambiguous or aggregate conversions, use the target type as
9560 a proxy for the conversion function. */
9561 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
9565 /* We can just fall through here, after setting up
9566 FROM_TYPE1 and FROM_TYPE2. */
9567 from_type1
= t1
->type
;
9568 from_type2
= t2
->type
;
9575 /* We're dealing with two standard conversion sequences.
9579 Standard conversion sequence S1 is a better conversion
9580 sequence than standard conversion sequence S2 if
9582 --S1 is a proper subsequence of S2 (comparing the conversion
9583 sequences in the canonical form defined by _over.ics.scs_,
9584 excluding any Lvalue Transformation; the identity
9585 conversion sequence is considered to be a subsequence of
9586 any non-identity conversion sequence */
9589 while (t1
->kind
!= ck_identity
)
9590 t1
= next_conversion (t1
);
9591 from_type1
= t1
->type
;
9594 while (t2
->kind
!= ck_identity
)
9595 t2
= next_conversion (t2
);
9596 from_type2
= t2
->type
;
9599 /* One sequence can only be a subsequence of the other if they start with
9600 the same type. They can start with different types when comparing the
9601 second standard conversion sequence in two user-defined conversion
9603 if (same_type_p (from_type1
, from_type2
))
9605 if (is_subseq (ics1
, ics2
))
9607 if (is_subseq (ics2
, ics1
))
9615 --the rank of S1 is better than the rank of S2 (by the rules
9618 Standard conversion sequences are ordered by their ranks: an Exact
9619 Match is a better conversion than a Promotion, which is a better
9620 conversion than a Conversion.
9622 Two conversion sequences with the same rank are indistinguishable
9623 unless one of the following rules applies:
9625 --A conversion that does not a convert a pointer, pointer to member,
9626 or std::nullptr_t to bool is better than one that does.
9628 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
9629 so that we do not have to check it explicitly. */
9630 if (ics1
->rank
< ics2
->rank
)
9632 else if (ics2
->rank
< ics1
->rank
)
9635 to_type1
= ics1
->type
;
9636 to_type2
= ics2
->type
;
9638 /* A conversion from scalar arithmetic type to complex is worse than a
9639 conversion between scalar arithmetic types. */
9640 if (same_type_p (from_type1
, from_type2
)
9641 && ARITHMETIC_TYPE_P (from_type1
)
9642 && ARITHMETIC_TYPE_P (to_type1
)
9643 && ARITHMETIC_TYPE_P (to_type2
)
9644 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
9645 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
9647 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
9653 if (TYPE_PTR_P (from_type1
)
9654 && TYPE_PTR_P (from_type2
)
9655 && TYPE_PTR_P (to_type1
)
9656 && TYPE_PTR_P (to_type2
))
9658 deref_from_type1
= TREE_TYPE (from_type1
);
9659 deref_from_type2
= TREE_TYPE (from_type2
);
9660 deref_to_type1
= TREE_TYPE (to_type1
);
9661 deref_to_type2
= TREE_TYPE (to_type2
);
9663 /* The rules for pointers to members A::* are just like the rules
9664 for pointers A*, except opposite: if B is derived from A then
9665 A::* converts to B::*, not vice versa. For that reason, we
9666 switch the from_ and to_ variables here. */
9667 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
9668 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
9669 || (TYPE_PTRMEMFUNC_P (from_type1
)
9670 && TYPE_PTRMEMFUNC_P (from_type2
)
9671 && TYPE_PTRMEMFUNC_P (to_type1
)
9672 && TYPE_PTRMEMFUNC_P (to_type2
)))
9674 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
9675 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
9676 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
9677 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
9680 if (deref_from_type1
!= NULL_TREE
9681 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
9682 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
9684 /* This was one of the pointer or pointer-like conversions.
9688 --If class B is derived directly or indirectly from class A,
9689 conversion of B* to A* is better than conversion of B* to
9690 void*, and conversion of A* to void* is better than
9691 conversion of B* to void*. */
9692 if (VOID_TYPE_P (deref_to_type1
)
9693 && VOID_TYPE_P (deref_to_type2
))
9695 if (is_properly_derived_from (deref_from_type1
,
9698 else if (is_properly_derived_from (deref_from_type2
,
9702 else if (VOID_TYPE_P (deref_to_type1
)
9703 || VOID_TYPE_P (deref_to_type2
))
9705 if (same_type_p (deref_from_type1
, deref_from_type2
))
9707 if (VOID_TYPE_P (deref_to_type2
))
9709 if (is_properly_derived_from (deref_from_type1
,
9713 /* We know that DEREF_TO_TYPE1 is `void' here. */
9714 else if (is_properly_derived_from (deref_from_type1
,
9719 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
9720 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
9724 --If class B is derived directly or indirectly from class A
9725 and class C is derived directly or indirectly from B,
9727 --conversion of C* to B* is better than conversion of C* to
9730 --conversion of B* to A* is better than conversion of C* to
9732 if (same_type_p (deref_from_type1
, deref_from_type2
))
9734 if (is_properly_derived_from (deref_to_type1
,
9737 else if (is_properly_derived_from (deref_to_type2
,
9741 else if (same_type_p (deref_to_type1
, deref_to_type2
))
9743 if (is_properly_derived_from (deref_from_type2
,
9746 else if (is_properly_derived_from (deref_from_type1
,
9752 else if (CLASS_TYPE_P (non_reference (from_type1
))
9753 && same_type_p (from_type1
, from_type2
))
9755 tree from
= non_reference (from_type1
);
9759 --binding of an expression of type C to a reference of type
9760 B& is better than binding an expression of type C to a
9761 reference of type A&
9763 --conversion of C to B is better than conversion of C to A, */
9764 if (is_properly_derived_from (from
, to_type1
)
9765 && is_properly_derived_from (from
, to_type2
))
9767 if (is_properly_derived_from (to_type1
, to_type2
))
9769 else if (is_properly_derived_from (to_type2
, to_type1
))
9773 else if (CLASS_TYPE_P (non_reference (to_type1
))
9774 && same_type_p (to_type1
, to_type2
))
9776 tree to
= non_reference (to_type1
);
9780 --binding of an expression of type B to a reference of type
9781 A& is better than binding an expression of type C to a
9782 reference of type A&,
9784 --conversion of B to A is better than conversion of C to A */
9785 if (is_properly_derived_from (from_type1
, to
)
9786 && is_properly_derived_from (from_type2
, to
))
9788 if (is_properly_derived_from (from_type2
, from_type1
))
9790 else if (is_properly_derived_from (from_type1
, from_type2
))
9797 --S1 and S2 differ only in their qualification conversion and yield
9798 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
9799 qualification signature of type T1 is a proper subset of the cv-
9800 qualification signature of type T2 */
9801 if (ics1
->kind
== ck_qual
9802 && ics2
->kind
== ck_qual
9803 && same_type_p (from_type1
, from_type2
))
9805 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
9812 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
9813 to an implicit object parameter of a non-static member function
9814 declared without a ref-qualifier, and either S1 binds an lvalue
9815 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
9816 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
9817 draft standard, 13.3.3.2)
9819 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
9820 types to which the references refer are the same type except for
9821 top-level cv-qualifiers, and the type to which the reference
9822 initialized by S2 refers is more cv-qualified than the type to
9823 which the reference initialized by S1 refers.
9825 DR 1328 [over.match.best]: the context is an initialization by
9826 conversion function for direct reference binding (13.3.1.6) of a
9827 reference to function type, the return type of F1 is the same kind of
9828 reference (i.e. lvalue or rvalue) as the reference being initialized,
9829 and the return type of F2 is not. */
9831 if (ref_conv1
&& ref_conv2
)
9833 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
9834 && (ref_conv1
->rvaluedness_matches_p
9835 != ref_conv2
->rvaluedness_matches_p
)
9836 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
9837 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
9838 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
9840 if (ref_conv1
->bad_p
9841 && !same_type_p (TREE_TYPE (ref_conv1
->type
),
9842 TREE_TYPE (ref_conv2
->type
)))
9843 /* Don't prefer a bad conversion that drops cv-quals to a bad
9844 conversion with the wrong rvalueness. */
9846 return (ref_conv1
->rvaluedness_matches_p
9847 - ref_conv2
->rvaluedness_matches_p
);
9850 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
9852 int q1
= cp_type_quals (TREE_TYPE (ref_conv1
->type
));
9853 int q2
= cp_type_quals (TREE_TYPE (ref_conv2
->type
));
9854 if (ref_conv1
->bad_p
)
9856 /* Prefer the one that drops fewer cv-quals. */
9857 tree ftype
= next_conversion (ref_conv1
)->type
;
9858 int fquals
= cp_type_quals (ftype
);
9862 return comp_cv_qualification (q2
, q1
);
9866 /* Neither conversion sequence is better than the other. */
9870 /* The source type for this standard conversion sequence. */
9873 source_type (conversion
*t
)
9875 for (;; t
= next_conversion (t
))
9877 if (t
->kind
== ck_user
9878 || t
->kind
== ck_ambig
9879 || t
->kind
== ck_identity
)
9885 /* Note a warning about preferring WINNER to LOSER. We do this by storing
9886 a pointer to LOSER and re-running joust to produce the warning if WINNER
9887 is actually used. */
9890 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
9892 candidate_warning
*cw
= (candidate_warning
*)
9893 conversion_obstack_alloc (sizeof (candidate_warning
));
9895 cw
->next
= winner
->warnings
;
9896 winner
->warnings
= cw
;
9899 /* Compare two candidates for overloading as described in
9900 [over.match.best]. Return values:
9902 1: cand1 is better than cand2
9903 -1: cand2 is better than cand1
9904 0: cand1 and cand2 are indistinguishable */
9907 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
9908 tsubst_flags_t complain
)
9911 int off1
= 0, off2
= 0;
9915 /* Candidates that involve bad conversions are always worse than those
9917 if (cand1
->viable
> cand2
->viable
)
9919 if (cand1
->viable
< cand2
->viable
)
9922 /* If we have two pseudo-candidates for conversions to the same type,
9923 or two candidates for the same function, arbitrarily pick one. */
9924 if (cand1
->fn
== cand2
->fn
9925 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
9928 /* Prefer a non-deleted function over an implicitly deleted move
9929 constructor or assignment operator. This differs slightly from the
9930 wording for issue 1402 (which says the move op is ignored by overload
9931 resolution), but this way produces better error messages. */
9932 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
9933 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
9934 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
9936 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
9937 && move_fn_p (cand1
->fn
))
9939 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
9940 && move_fn_p (cand2
->fn
))
9944 /* a viable function F1
9945 is defined to be a better function than another viable function F2 if
9946 for all arguments i, ICSi(F1) is not a worse conversion sequence than
9947 ICSi(F2), and then */
9949 /* for some argument j, ICSj(F1) is a better conversion sequence than
9952 /* For comparing static and non-static member functions, we ignore
9953 the implicit object parameter of the non-static function. The
9954 standard says to pretend that the static function has an object
9955 parm, but that won't work with operator overloading. */
9956 len
= cand1
->num_convs
;
9957 if (len
!= cand2
->num_convs
)
9959 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
9960 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
9962 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
9963 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
9964 /* We're comparing a near-match list constructor and a near-match
9965 non-list constructor. Just treat them as unordered. */
9968 gcc_assert (static_1
!= static_2
);
9979 for (i
= 0; i
< len
; ++i
)
9981 conversion
*t1
= cand1
->convs
[i
+ off1
];
9982 conversion
*t2
= cand2
->convs
[i
+ off2
];
9983 int comp
= compare_ics (t1
, t2
);
9987 if ((complain
& tf_warning
)
9989 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
9990 == cr_std
+ cr_promotion
)
9991 && t1
->kind
== ck_std
9992 && t2
->kind
== ck_std
9993 && TREE_CODE (t1
->type
) == INTEGER_TYPE
9994 && TREE_CODE (t2
->type
) == INTEGER_TYPE
9995 && (TYPE_PRECISION (t1
->type
)
9996 == TYPE_PRECISION (t2
->type
))
9997 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
9998 || (TREE_CODE (next_conversion (t1
)->type
)
10001 tree type
= next_conversion (t1
)->type
;
10003 struct z_candidate
*w
, *l
;
10005 type1
= t1
->type
, type2
= t2
->type
,
10006 w
= cand1
, l
= cand2
;
10008 type1
= t2
->type
, type2
= t1
->type
,
10009 w
= cand2
, l
= cand1
;
10013 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
10014 type
, type1
, type2
);
10015 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
10018 add_warning (w
, l
);
10021 if (winner
&& comp
!= winner
)
10030 /* warn about confusing overload resolution for user-defined conversions,
10031 either between a constructor and a conversion op, or between two
10033 if ((complain
& tf_warning
)
10034 && winner
&& warn_conversion
&& cand1
->second_conv
10035 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
10036 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
10038 struct z_candidate
*w
, *l
;
10039 bool give_warning
= false;
10042 w
= cand1
, l
= cand2
;
10044 w
= cand2
, l
= cand1
;
10046 /* We don't want to complain about `X::operator T1 ()'
10047 beating `X::operator T2 () const', when T2 is a no less
10048 cv-qualified version of T1. */
10049 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
10050 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
10052 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
10053 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
10055 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
10060 if (!comp_ptr_ttypes (t
, f
))
10061 give_warning
= true;
10064 give_warning
= true;
10070 tree source
= source_type (w
->convs
[0]);
10071 if (! DECL_CONSTRUCTOR_P (w
->fn
))
10072 source
= TREE_TYPE (source
);
10073 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
10074 && warning (OPT_Wconversion
, " for conversion from %qH to %qI",
10075 source
, w
->second_conv
->type
))
10077 inform (input_location
, " because conversion sequence for the argument is better");
10081 add_warning (w
, l
);
10087 /* DR 495 moved this tiebreaker above the template ones. */
10088 /* or, if not that,
10089 the context is an initialization by user-defined conversion (see
10090 _dcl.init_ and _over.match.user_) and the standard conversion
10091 sequence from the return type of F1 to the destination type (i.e.,
10092 the type of the entity being initialized) is a better conversion
10093 sequence than the standard conversion sequence from the return type
10094 of F2 to the destination type. */
10096 if (cand1
->second_conv
)
10098 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
10103 /* or, if not that,
10104 F1 is a non-template function and F2 is a template function
10107 if (!cand1
->template_decl
&& cand2
->template_decl
)
10109 else if (cand1
->template_decl
&& !cand2
->template_decl
)
10112 /* or, if not that,
10113 F1 and F2 are template functions and the function template for F1 is
10114 more specialized than the template for F2 according to the partial
10117 if (cand1
->template_decl
&& cand2
->template_decl
)
10119 winner
= more_specialized_fn
10120 (TI_TEMPLATE (cand1
->template_decl
),
10121 TI_TEMPLATE (cand2
->template_decl
),
10122 /* [temp.func.order]: The presence of unused ellipsis and default
10123 arguments has no effect on the partial ordering of function
10124 templates. add_function_candidate() will not have
10125 counted the "this" argument for constructors. */
10126 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
10132 // or, if not that, F1 is more constrained than F2.
10133 if (flag_concepts
&& DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
))
10135 winner
= more_constrained (cand1
->fn
, cand2
->fn
);
10140 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
10141 if (deduction_guide_p (cand1
->fn
))
10143 gcc_assert (deduction_guide_p (cand2
->fn
));
10144 /* We distinguish between candidates from an explicit deduction guide and
10145 candidates built from a constructor based on DECL_ARTIFICIAL. */
10146 int art1
= DECL_ARTIFICIAL (cand1
->fn
);
10147 int art2
= DECL_ARTIFICIAL (cand2
->fn
);
10149 return art2
- art1
;
10153 /* Prefer the special copy guide over a declared copy/move
10155 if (copy_guide_p (cand1
->fn
))
10157 if (copy_guide_p (cand2
->fn
))
10160 /* Prefer a candidate generated from a non-template constructor. */
10161 int tg1
= template_guide_p (cand1
->fn
);
10162 int tg2
= template_guide_p (cand2
->fn
);
10168 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
10169 for all arguments the corresponding parameters of F1 and F2 have the same
10170 type (CWG 2273/2277). */
10171 if (DECL_P (cand1
->fn
) && DECL_CLASS_SCOPE_P (cand1
->fn
)
10172 && !DECL_CONV_FN_P (cand1
->fn
)
10173 && DECL_P (cand2
->fn
) && DECL_CLASS_SCOPE_P (cand2
->fn
)
10174 && !DECL_CONV_FN_P (cand2
->fn
))
10176 tree base1
= DECL_CONTEXT (strip_inheriting_ctors (cand1
->fn
));
10177 tree base2
= DECL_CONTEXT (strip_inheriting_ctors (cand2
->fn
));
10179 bool used1
= false;
10180 bool used2
= false;
10181 if (base1
== base2
)
10182 /* No difference. */;
10183 else if (DERIVED_FROM_P (base1
, base2
))
10185 else if (DERIVED_FROM_P (base2
, base1
))
10188 if (int diff
= used2
- used1
)
10190 for (i
= 0; i
< len
; ++i
)
10192 conversion
*t1
= cand1
->convs
[i
+ off1
];
10193 conversion
*t2
= cand2
->convs
[i
+ off2
];
10194 if (!same_type_p (t1
->type
, t2
->type
))
10202 /* Check whether we can discard a builtin candidate, either because we
10203 have two identical ones or matching builtin and non-builtin candidates.
10205 (Pedantically in the latter case the builtin which matched the user
10206 function should not be added to the overload set, but we spot it here.
10209 ... the builtin candidates include ...
10210 - do not have the same parameter type list as any non-template
10211 non-member candidate. */
10213 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
10215 for (i
= 0; i
< len
; ++i
)
10216 if (!same_type_p (cand1
->convs
[i
]->type
,
10217 cand2
->convs
[i
]->type
))
10219 if (i
== cand1
->num_convs
)
10221 if (cand1
->fn
== cand2
->fn
)
10222 /* Two built-in candidates; arbitrarily pick one. */
10224 else if (identifier_p (cand1
->fn
))
10225 /* cand1 is built-in; prefer cand2. */
10228 /* cand2 is built-in; prefer cand1. */
10233 /* For candidates of a multi-versioned function, make the version with
10234 the highest priority win. This version will be checked for dispatching
10235 first. If this version can be inlined into the caller, the front-end
10236 will simply make a direct call to this function. */
10238 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
10239 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
10240 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
10241 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
10243 tree f1
= TREE_TYPE (cand1
->fn
);
10244 tree f2
= TREE_TYPE (cand2
->fn
);
10245 tree p1
= TYPE_ARG_TYPES (f1
);
10246 tree p2
= TYPE_ARG_TYPES (f2
);
10248 /* Check if cand1->fn and cand2->fn are versions of the same function. It
10249 is possible that cand1->fn and cand2->fn are function versions but of
10250 different functions. Check types to see if they are versions of the same
10252 if (compparms (p1
, p2
)
10253 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
10255 /* Always make the version with the higher priority, more
10256 specialized, win. */
10257 gcc_assert (targetm
.compare_version_priority
);
10258 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
10265 /* If the two function declarations represent the same function (this can
10266 happen with declarations in multiple scopes and arg-dependent lookup),
10267 arbitrarily choose one. But first make sure the default args we're
10269 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
10270 && equal_functions (cand1
->fn
, cand2
->fn
))
10272 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
10273 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
10275 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
10277 for (i
= 0; i
< len
; ++i
)
10279 /* Don't crash if the fn is variadic. */
10282 parms1
= TREE_CHAIN (parms1
);
10283 parms2
= TREE_CHAIN (parms2
);
10287 parms1
= TREE_CHAIN (parms1
);
10289 parms2
= TREE_CHAIN (parms2
);
10291 for (; parms1
; ++i
)
10293 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
10294 TREE_PURPOSE (parms2
)))
10298 if (complain
& tf_error
)
10300 if (permerror (input_location
,
10301 "default argument mismatch in "
10302 "overload resolution"))
10304 inform (DECL_SOURCE_LOCATION (cand1
->fn
),
10305 " candidate 1: %q#F", cand1
->fn
);
10306 inform (DECL_SOURCE_LOCATION (cand2
->fn
),
10307 " candidate 2: %q#F", cand2
->fn
);
10314 add_warning (cand1
, cand2
);
10317 parms1
= TREE_CHAIN (parms1
);
10318 parms2
= TREE_CHAIN (parms2
);
10326 /* Extension: If the worst conversion for one candidate is worse than the
10327 worst conversion for the other, take the first. */
10328 if (!pedantic
&& (complain
& tf_warning_or_error
))
10330 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
10331 struct z_candidate
*w
= 0, *l
= 0;
10333 for (i
= 0; i
< len
; ++i
)
10335 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
10336 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
10337 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
10338 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
10341 winner
= 1, w
= cand1
, l
= cand2
;
10343 winner
= -1, w
= cand2
, l
= cand1
;
10346 /* Don't choose a deleted function over ambiguity. */
10347 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
10351 pedwarn (input_location
, 0,
10352 "ISO C++ says that these are ambiguous, even "
10353 "though the worst conversion for the first is better than "
10354 "the worst conversion for the second:");
10355 print_z_candidate (input_location
, _("candidate 1:"), w
);
10356 print_z_candidate (input_location
, _("candidate 2:"), l
);
10359 add_warning (w
, l
);
10364 gcc_assert (!winner
);
10368 /* Given a list of candidates for overloading, find the best one, if any.
10369 This algorithm has a worst case of O(2n) (winner is last), and a best
10370 case of O(n/2) (totally ambiguous); much better than a sorting
10373 static struct z_candidate
*
10374 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
10376 struct z_candidate
*champ
= candidates
, *challenger
;
10378 int champ_compared_to_predecessor
= 0;
10380 /* Walk through the list once, comparing each current champ to the next
10381 candidate, knocking out a candidate or two with each comparison. */
10383 for (challenger
= champ
->next
; challenger
; )
10385 fate
= joust (champ
, challenger
, 0, complain
);
10387 challenger
= challenger
->next
;
10392 champ
= challenger
->next
;
10395 champ_compared_to_predecessor
= 0;
10399 champ
= challenger
;
10400 champ_compared_to_predecessor
= 1;
10403 challenger
= champ
->next
;
10407 /* Make sure the champ is better than all the candidates it hasn't yet
10408 been compared to. */
10410 for (challenger
= candidates
;
10411 challenger
!= champ
10412 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
10413 challenger
= challenger
->next
)
10415 fate
= joust (champ
, challenger
, 0, complain
);
10423 /* Returns nonzero if things of type FROM can be converted to TO. */
10426 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
10428 tree arg
= NULL_TREE
;
10429 /* implicit_conversion only considers user-defined conversions
10430 if it has an expression for the call argument list. */
10431 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
10432 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
10433 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
10436 /* Returns nonzero if things of type FROM can be converted to TO with a
10437 standard conversion. */
10440 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
10442 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
10445 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
10448 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
10449 tsubst_flags_t complain
)
10455 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10456 p
= conversion_obstack_alloc (0);
10457 /* We want to discard any access checks done for this test,
10458 as we might not be in the appropriate access context and
10459 we'll do the check again when we actually perform the
10461 push_deferring_access_checks (dk_deferred
);
10463 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10465 ok_p
= (t
&& !t
->bad_p
);
10467 /* Discard the access checks now. */
10468 pop_deferring_access_checks ();
10469 /* Free all the conversions we allocated. */
10470 obstack_free (&conversion_obstack
, p
);
10475 /* Like can_convert_arg, but allows dubious conversions as well. */
10478 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
10479 tsubst_flags_t complain
)
10484 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10485 p
= conversion_obstack_alloc (0);
10486 /* Try to perform the conversion. */
10487 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10489 /* Free all the conversions we allocated. */
10490 obstack_free (&conversion_obstack
, p
);
10495 /* Convert EXPR to TYPE. Return the converted expression.
10497 Note that we allow bad conversions here because by the time we get to
10498 this point we are committed to doing the conversion. If we end up
10499 doing a bad conversion, convert_like will complain. */
10502 perform_implicit_conversion_flags (tree type
, tree expr
,
10503 tsubst_flags_t complain
, int flags
)
10507 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
10509 if (error_operand_p (expr
))
10510 return error_mark_node
;
10512 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10513 p
= conversion_obstack_alloc (0);
10515 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
10516 /*c_cast_p=*/false,
10521 if (complain
& tf_error
)
10523 /* If expr has unknown type, then it is an overloaded function.
10524 Call instantiate_type to get good error messages. */
10525 if (TREE_TYPE (expr
) == unknown_type_node
)
10526 instantiate_type (type
, expr
, complain
);
10527 else if (invalid_nonstatic_memfn_p (loc
, expr
, complain
))
10528 /* We gave an error. */;
10530 error_at (loc
, "could not convert %qE from %qH to %qI", expr
,
10531 TREE_TYPE (expr
), type
);
10533 expr
= error_mark_node
;
10535 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
10537 /* In a template, we are only concerned about determining the
10538 type of non-dependent expressions, so we do not have to
10539 perform the actual conversion. But for initializers, we
10540 need to be able to perform it at instantiation
10541 (or instantiate_non_dependent_expr) time. */
10542 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
10543 if (!(flags
& LOOKUP_ONLYCONVERTING
))
10544 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
10547 expr
= convert_like (conv
, expr
, complain
);
10549 /* Free all the conversions we allocated. */
10550 obstack_free (&conversion_obstack
, p
);
10556 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
10558 return perform_implicit_conversion_flags (type
, expr
, complain
,
10562 /* Convert EXPR to TYPE (as a direct-initialization) if that is
10563 permitted. If the conversion is valid, the converted expression is
10564 returned. Otherwise, NULL_TREE is returned, except in the case
10565 that TYPE is a class type; in that case, an error is issued. If
10566 C_CAST_P is true, then this direct-initialization is taking
10567 place as part of a static_cast being attempted as part of a C-style
10571 perform_direct_initialization_if_possible (tree type
,
10574 tsubst_flags_t complain
)
10579 if (type
== error_mark_node
|| error_operand_p (expr
))
10580 return error_mark_node
;
10583 If the destination type is a (possibly cv-qualified) class type:
10585 -- If the initialization is direct-initialization ...,
10586 constructors are considered. ... If no constructor applies, or
10587 the overload resolution is ambiguous, the initialization is
10589 if (CLASS_TYPE_P (type
))
10591 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
10592 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
10593 &args
, type
, LOOKUP_NORMAL
, complain
);
10594 release_tree_vector (args
);
10595 return build_cplus_new (type
, expr
, complain
);
10598 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10599 p
= conversion_obstack_alloc (0);
10601 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
10603 LOOKUP_NORMAL
, complain
);
10604 if (!conv
|| conv
->bad_p
)
10607 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0,
10608 /*issue_conversion_warnings=*/false,
10612 /* Free all the conversions we allocated. */
10613 obstack_free (&conversion_obstack
, p
);
10618 /* When initializing a reference that lasts longer than a full-expression,
10619 this special rule applies:
10623 The temporary to which the reference is bound or the temporary
10624 that is the complete object to which the reference is bound
10625 persists for the lifetime of the reference.
10627 The temporaries created during the evaluation of the expression
10628 initializing the reference, except the temporary to which the
10629 reference is bound, are destroyed at the end of the
10630 full-expression in which they are created.
10632 In that case, we store the converted expression into a new
10633 VAR_DECL in a new scope.
10635 However, we want to be careful not to create temporaries when
10636 they are not required. For example, given:
10639 struct D : public B {};
10643 there is no need to copy the return value from "f"; we can just
10644 extend its lifetime. Similarly, given:
10647 struct T { operator S(); };
10651 we can extend the lifetime of the return value of the conversion
10654 The next several functions are involved in this lifetime extension. */
10656 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
10657 reference is being bound to a temporary. Create and return a new
10658 VAR_DECL with the indicated TYPE; this variable will store the value to
10659 which the reference is bound. */
10662 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
10664 tree var
= create_temporary_var (type
);
10666 /* Register the variable. */
10668 && (TREE_STATIC (decl
) || CP_DECL_THREAD_LOCAL_P (decl
)))
10670 /* Namespace-scope or local static; give it a mangled name. */
10671 /* FIXME share comdat with decl? */
10673 TREE_STATIC (var
) = TREE_STATIC (decl
);
10674 CP_DECL_THREAD_LOCAL_P (var
) = CP_DECL_THREAD_LOCAL_P (decl
);
10675 set_decl_tls_model (var
, DECL_TLS_MODEL (decl
));
10677 tree name
= mangle_ref_init_variable (decl
);
10678 DECL_NAME (var
) = name
;
10679 SET_DECL_ASSEMBLER_NAME (var
, name
);
10681 var
= pushdecl (var
);
10684 /* Create a new cleanup level if necessary. */
10685 maybe_push_cleanup_level (type
);
10690 /* EXPR is the initializer for a variable DECL of reference or
10691 std::initializer_list type. Create, push and return a new VAR_DECL
10692 for the initializer so that it will live as long as DECL. Any
10693 cleanup for the new variable is returned through CLEANUP, and the
10694 code to initialize the new variable is returned through INITP. */
10697 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
10704 /* Create the temporary variable. */
10705 type
= TREE_TYPE (expr
);
10706 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
10707 layout_decl (var
, 0);
10708 /* If the rvalue is the result of a function call it will be
10709 a TARGET_EXPR. If it is some other construct (such as a
10710 member access expression where the underlying object is
10711 itself the result of a function call), turn it into a
10712 TARGET_EXPR here. It is important that EXPR be a
10713 TARGET_EXPR below since otherwise the INIT_EXPR will
10714 attempt to make a bitwise copy of EXPR to initialize
10716 if (TREE_CODE (expr
) != TARGET_EXPR
)
10717 expr
= get_target_expr (expr
);
10719 if (TREE_CODE (decl
) == FIELD_DECL
10720 && extra_warnings
&& !TREE_NO_WARNING (decl
))
10722 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
10723 "until the constructor exits", decl
);
10724 TREE_NO_WARNING (decl
) = true;
10727 /* Recursively extend temps in this initializer. */
10728 TARGET_EXPR_INITIAL (expr
)
10729 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
10731 /* Any reference temp has a non-trivial initializer. */
10732 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
10734 /* If the initializer is constant, put it in DECL_INITIAL so we get
10735 static initialization and use in constant expressions. */
10736 init
= maybe_constant_init (expr
);
10737 if (TREE_CONSTANT (init
))
10739 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
10741 /* 5.19 says that a constant expression can include an
10742 lvalue-rvalue conversion applied to "a glvalue of literal type
10743 that refers to a non-volatile temporary object initialized
10744 with a constant expression". Rather than try to communicate
10745 that this VAR_DECL is a temporary, just mark it constexpr.
10747 Currently this is only useful for initializer_list temporaries,
10748 since reference vars can't appear in constant expressions. */
10749 DECL_DECLARED_CONSTEXPR_P (var
) = true;
10750 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
10751 TREE_CONSTANT (var
) = true;
10753 DECL_INITIAL (var
) = init
;
10757 /* Create the INIT_EXPR that will initialize the temporary
10759 init
= split_nonconstant_init (var
, expr
);
10760 if (at_function_scope_p ())
10762 add_decl_expr (var
);
10764 if (TREE_STATIC (var
))
10765 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
10768 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
10770 vec_safe_push (*cleanups
, cleanup
);
10773 /* We must be careful to destroy the temporary only
10774 after its initialization has taken place. If the
10775 initialization throws an exception, then the
10776 destructor should not be run. We cannot simply
10777 transform INIT into something like:
10779 (INIT, ({ CLEANUP_STMT; }))
10781 because emit_local_var always treats the
10782 initializer as a full-expression. Thus, the
10783 destructor would run too early; it would run at the
10784 end of initializing the reference variable, rather
10785 than at the end of the block enclosing the
10786 reference variable.
10788 The solution is to pass back a cleanup expression
10789 which the caller is responsible for attaching to
10790 the statement tree. */
10794 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
10795 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
10797 if (CP_DECL_THREAD_LOCAL_P (var
))
10798 tls_aggregates
= tree_cons (NULL_TREE
, var
,
10801 static_aggregates
= tree_cons (NULL_TREE
, var
,
10802 static_aggregates
);
10805 /* Check whether the dtor is callable. */
10806 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
10808 /* Avoid -Wunused-variable warning (c++/38958). */
10809 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
10811 TREE_USED (decl
) = DECL_READ_P (decl
) = true;
10817 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
10818 initializing a variable of that TYPE. */
10821 initialize_reference (tree type
, tree expr
,
10822 int flags
, tsubst_flags_t complain
)
10826 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
10828 if (type
== error_mark_node
|| error_operand_p (expr
))
10829 return error_mark_node
;
10831 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10832 p
= conversion_obstack_alloc (0);
10834 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
10836 if (!conv
|| conv
->bad_p
)
10838 if (complain
& tf_error
)
10841 convert_like (conv
, expr
, complain
);
10842 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
10843 && !TYPE_REF_IS_RVALUE (type
)
10844 && !lvalue_p (expr
))
10845 error_at (loc
, "invalid initialization of non-const reference of "
10846 "type %qH from an rvalue of type %qI",
10847 type
, TREE_TYPE (expr
));
10849 error_at (loc
, "invalid initialization of reference of type "
10850 "%qH from expression of type %qI", type
,
10853 return error_mark_node
;
10856 if (conv
->kind
== ck_ref_bind
)
10857 /* Perform the conversion. */
10858 expr
= convert_like (conv
, expr
, complain
);
10859 else if (conv
->kind
== ck_ambig
)
10860 /* We gave an error in build_user_type_conversion_1. */
10861 expr
= error_mark_node
;
10863 gcc_unreachable ();
10865 /* Free all the conversions we allocated. */
10866 obstack_free (&conversion_obstack
, p
);
10871 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
10872 which is bound either to a reference or a std::initializer_list. */
10875 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
10880 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
10882 TREE_OPERAND (sub
, 1)
10883 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
10886 if (TREE_CODE (sub
) != ADDR_EXPR
)
10888 /* Deal with binding to a subobject. */
10889 for (p
= &TREE_OPERAND (sub
, 0); TREE_CODE (*p
) == COMPONENT_REF
; )
10890 p
= &TREE_OPERAND (*p
, 0);
10891 if (TREE_CODE (*p
) == TARGET_EXPR
)
10893 tree subinit
= NULL_TREE
;
10894 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
10895 recompute_tree_invariant_for_addr_expr (sub
);
10897 init
= fold_convert (TREE_TYPE (init
), sub
);
10899 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
10904 /* INIT is part of the initializer for DECL. If there are any
10905 reference or initializer lists being initialized, extend their
10906 lifetime to match that of DECL. */
10909 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
10911 tree type
= TREE_TYPE (init
);
10912 if (processing_template_decl
)
10914 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10915 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
10919 if (TREE_CODE (ctor
) == TARGET_EXPR
)
10920 ctor
= TARGET_EXPR_INITIAL (ctor
);
10921 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
10923 if (is_std_init_list (type
))
10925 /* The temporary array underlying a std::initializer_list
10926 is handled like a reference temporary. */
10927 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
10928 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
10929 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
10934 constructor_elt
*p
;
10935 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (ctor
);
10936 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
10937 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
10939 recompute_constructor_flags (ctor
);
10940 if (decl_maybe_constant_var_p (decl
) && TREE_CONSTANT (ctor
))
10941 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
10948 /* Returns true iff an initializer for TYPE could contain temporaries that
10949 need to be extended because they are bound to references or
10950 std::initializer_list. */
10953 type_has_extended_temps (tree type
)
10955 type
= strip_array_types (type
);
10956 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10958 if (CLASS_TYPE_P (type
))
10960 if (is_std_init_list (type
))
10962 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
10963 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
10964 if (type_has_extended_temps (TREE_TYPE (f
)))
10970 /* Returns true iff TYPE is some variant of std::initializer_list. */
10973 is_std_init_list (tree type
)
10975 if (!TYPE_P (type
))
10977 if (cxx_dialect
== cxx98
)
10979 /* Look through typedefs. */
10980 type
= TYPE_MAIN_VARIANT (type
);
10981 return (CLASS_TYPE_P (type
)
10982 && CP_TYPE_CONTEXT (type
) == std_node
10983 && init_list_identifier
== DECL_NAME (TYPE_NAME (type
)));
10986 /* Returns true iff DECL is a list constructor: i.e. a constructor which
10987 will accept an argument list of a single std::initializer_list<T>. */
10990 is_list_ctor (tree decl
)
10992 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
10995 if (!args
|| args
== void_list_node
)
10998 arg
= non_reference (TREE_VALUE (args
));
10999 if (!is_std_init_list (arg
))
11002 args
= TREE_CHAIN (args
);
11004 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
11005 /* There are more non-defaulted parms. */
11011 #include "gt-cp-call.h"