1 /* Functions related to invoking -*- C++ -*- methods and overloaded functions.
2 Copyright (C) 1987-2018 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com) and
4 modified by Brendan Kehoe (brendan@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* High-level class interface. */
27 #include "coretypes.h"
31 #include "stringpool.h"
33 #include "stor-layout.h"
34 #include "trans-mem.h"
39 #include "langhooks.h"
40 #include "c-family/c-objc.h"
41 #include "internal-fn.h"
42 #include "stringpool.h"
45 /* The various kinds of conversion. */
47 enum conversion_kind
{
64 /* The rank of the conversion. Order of the enumerals matters; better
65 conversions should come earlier in the list. */
67 enum conversion_rank
{
78 /* An implicit conversion sequence, in the sense of [over.best.ics].
79 The first conversion to be performed is at the end of the chain.
80 That conversion is always a cr_identity conversion. */
83 /* The kind of conversion represented by this step. */
85 /* The rank of this conversion. */
87 BOOL_BITFIELD user_conv_p
: 1;
88 BOOL_BITFIELD ellipsis_p
: 1;
89 BOOL_BITFIELD this_p
: 1;
90 /* True if this conversion would be permitted with a bending of
91 language standards, e.g. disregarding pointer qualifiers or
92 converting integers to pointers. */
93 BOOL_BITFIELD bad_p
: 1;
94 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
95 temporary should be created to hold the result of the
97 BOOL_BITFIELD need_temporary_p
: 1;
98 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
99 from a pointer-to-derived to pointer-to-base is being performed. */
100 BOOL_BITFIELD base_p
: 1;
101 /* If KIND is ck_ref_bind, true when either an lvalue reference is
102 being bound to an lvalue expression or an rvalue reference is
103 being bound to an rvalue expression. If KIND is ck_rvalue,
104 true when we are treating an lvalue as an rvalue (12.8p33). If
105 KIND is ck_base, always false. */
106 BOOL_BITFIELD rvaluedness_matches_p
: 1;
107 BOOL_BITFIELD check_narrowing
: 1;
108 /* The type of the expression resulting from the conversion. */
111 /* The next conversion in the chain. Since the conversions are
112 arranged from outermost to innermost, the NEXT conversion will
113 actually be performed before this conversion. This variant is
114 used only when KIND is neither ck_identity, ck_ambig nor
115 ck_list. Please use the next_conversion function instead
116 of using this field directly. */
118 /* The expression at the beginning of the conversion chain. This
119 variant is used only if KIND is ck_identity or ck_ambig. */
121 /* The array of conversions for an initializer_list, so this
122 variant is used only when KIN D is ck_list. */
125 /* The function candidate corresponding to this conversion
126 sequence. This field is only used if KIND is ck_user. */
127 struct z_candidate
*cand
;
130 #define CONVERSION_RANK(NODE) \
131 ((NODE)->bad_p ? cr_bad \
132 : (NODE)->ellipsis_p ? cr_ellipsis \
133 : (NODE)->user_conv_p ? cr_user \
136 #define BAD_CONVERSION_RANK(NODE) \
137 ((NODE)->ellipsis_p ? cr_ellipsis \
138 : (NODE)->user_conv_p ? cr_user \
141 static struct obstack conversion_obstack
;
142 static bool conversion_obstack_initialized
;
143 struct rejection_reason
;
145 static struct z_candidate
* tourney (struct z_candidate
*, tsubst_flags_t
);
146 static int equal_functions (tree
, tree
);
147 static int joust (struct z_candidate
*, struct z_candidate
*, bool,
149 static int compare_ics (conversion
*, conversion
*);
150 static void maybe_warn_class_memaccess (location_t
, tree
,
151 const vec
<tree
, va_gc
> *);
152 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
153 #define convert_like(CONV, EXPR, COMPLAIN) \
154 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, \
155 /*issue_conversion_warnings=*/true, \
156 /*c_cast_p=*/false, (COMPLAIN))
157 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
158 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), \
159 /*issue_conversion_warnings=*/true, \
160 /*c_cast_p=*/false, (COMPLAIN))
161 static tree
convert_like_real (conversion
*, tree
, tree
, int, bool,
162 bool, tsubst_flags_t
);
163 static void op_error (location_t
, enum tree_code
, enum tree_code
, tree
,
165 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int,
167 static void print_z_candidate (location_t
, const char *, struct z_candidate
*);
168 static void print_z_candidates (location_t
, struct z_candidate
*);
169 static tree
build_this (tree
);
170 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
171 static bool any_strictly_viable (struct z_candidate
*);
172 static struct z_candidate
*add_template_candidate
173 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
174 tree
, tree
, tree
, int, unification_kind_t
, tsubst_flags_t
);
175 static struct z_candidate
*add_template_candidate_real
176 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
177 tree
, tree
, tree
, int, tree
, unification_kind_t
, tsubst_flags_t
);
178 static void add_builtin_candidates
179 (struct z_candidate
**, enum tree_code
, enum tree_code
,
180 tree
, tree
*, int, tsubst_flags_t
);
181 static void add_builtin_candidate
182 (struct z_candidate
**, enum tree_code
, enum tree_code
,
183 tree
, tree
, tree
, tree
*, tree
*, int, tsubst_flags_t
);
184 static bool is_complete (tree
);
185 static void build_builtin_candidate
186 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
187 int, tsubst_flags_t
);
188 static struct z_candidate
*add_conv_candidate
189 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
190 tree
, tsubst_flags_t
);
191 static struct z_candidate
*add_function_candidate
192 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
193 tree
, int, tsubst_flags_t
);
194 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int,
196 static conversion
*reference_binding (tree
, tree
, tree
, bool, int,
198 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
199 static conversion
*build_list_conv (tree
, tree
, int, tsubst_flags_t
);
200 static conversion
*next_conversion (conversion
*);
201 static bool is_subseq (conversion
*, conversion
*);
202 static conversion
*maybe_handle_ref_bind (conversion
**);
203 static void maybe_handle_implicit_object (conversion
**);
204 static struct z_candidate
*add_candidate
205 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, size_t,
206 conversion
**, tree
, tree
, int, struct rejection_reason
*, int);
207 static tree
source_type (conversion
*);
208 static void add_warning (struct z_candidate
*, struct z_candidate
*);
209 static bool reference_compatible_p (tree
, tree
);
210 static conversion
*direct_reference_binding (tree
, conversion
*);
211 static bool promoted_arithmetic_type_p (tree
);
212 static conversion
*conditional_conversion (tree
, tree
, tsubst_flags_t
);
213 static char *name_as_c_string (tree
, tree
, bool *);
214 static tree
prep_operand (tree
);
215 static void add_candidates (tree
, tree
, const vec
<tree
, va_gc
> *, tree
, tree
,
216 bool, tree
, tree
, int, struct z_candidate
**,
218 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
219 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
221 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
222 NAME can take many forms... */
225 check_dtor_name (tree basetype
, tree name
)
227 /* Just accept something we've already complained about. */
228 if (name
== error_mark_node
)
231 if (TREE_CODE (name
) == TYPE_DECL
)
232 name
= TREE_TYPE (name
);
233 else if (TYPE_P (name
))
235 else if (identifier_p (name
))
237 if ((MAYBE_CLASS_TYPE_P (basetype
)
238 || TREE_CODE (basetype
) == ENUMERAL_TYPE
)
239 && name
== constructor_name (basetype
))
242 name
= get_type_value (name
);
248 template <class T> struct S { ~S(); };
252 NAME will be a class template. */
253 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
257 if (!name
|| name
== error_mark_node
)
259 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
262 /* We want the address of a function or method. We avoid creating a
263 pointer-to-member function. */
266 build_addr_func (tree function
, tsubst_flags_t complain
)
268 tree type
= TREE_TYPE (function
);
270 /* We have to do these by hand to avoid real pointer to member
272 if (TREE_CODE (type
) == METHOD_TYPE
)
274 if (TREE_CODE (function
) == OFFSET_REF
)
276 tree object
= build_address (TREE_OPERAND (function
, 0));
277 return get_member_function_from_ptrfunc (&object
,
278 TREE_OPERAND (function
, 1),
281 function
= build_address (function
);
284 function
= decay_conversion (function
, complain
, /*reject_builtin=*/false);
289 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
290 POINTER_TYPE to those. Note, pointer to member function types
291 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
292 two variants. build_call_a is the primitive taking an array of
293 arguments, while build_call_n is a wrapper that handles varargs. */
296 build_call_n (tree function
, int n
, ...)
299 return build_call_a (function
, 0, NULL
);
302 tree
*argarray
= XALLOCAVEC (tree
, n
);
307 for (i
= 0; i
< n
; i
++)
308 argarray
[i
] = va_arg (ap
, tree
);
310 return build_call_a (function
, n
, argarray
);
314 /* Update various flags in cfun and the call itself based on what is being
315 called. Split out of build_call_a so that bot_manip can use it too. */
318 set_flags_from_callee (tree call
)
321 tree decl
= get_callee_fndecl (call
);
323 /* We check both the decl and the type; a function may be known not to
324 throw without being declared throw(). */
325 nothrow
= decl
&& TREE_NOTHROW (decl
);
326 if (CALL_EXPR_FN (call
))
327 nothrow
|= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call
))));
328 else if (internal_fn_flags (CALL_EXPR_IFN (call
)) & ECF_NOTHROW
)
331 if (!nothrow
&& at_function_scope_p () && cfun
&& cp_function_chain
)
332 cp_function_chain
->can_throw
= 1;
334 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
335 current_function_returns_abnormally
= 1;
337 TREE_NOTHROW (call
) = nothrow
;
341 build_call_a (tree function
, int n
, tree
*argarray
)
348 function
= build_addr_func (function
, tf_warning_or_error
);
350 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
351 fntype
= TREE_TYPE (TREE_TYPE (function
));
352 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
353 || TREE_CODE (fntype
) == METHOD_TYPE
);
354 result_type
= TREE_TYPE (fntype
);
355 /* An rvalue has no cv-qualifiers. */
356 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
357 result_type
= cv_unqualified (result_type
);
359 function
= build_call_array_loc (input_location
,
360 result_type
, function
, n
, argarray
);
361 set_flags_from_callee (function
);
363 decl
= get_callee_fndecl (function
);
365 if (decl
&& !TREE_USED (decl
))
367 /* We invoke build_call directly for several library
368 functions. These may have been declared normally if
369 we're building libgcc, so we can't just check
371 gcc_assert (DECL_ARTIFICIAL (decl
)
372 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
377 require_complete_eh_spec_types (fntype
, decl
);
379 TREE_HAS_CONSTRUCTOR (function
) = (decl
&& DECL_CONSTRUCTOR_P (decl
));
381 /* Don't pass empty class objects by value. This is useful
382 for tags in STL, which are used to control overload resolution.
383 We don't need to handle other cases of copying empty classes. */
384 if (! decl
|| ! DECL_BUILT_IN (decl
))
385 for (i
= 0; i
< n
; i
++)
387 tree arg
= CALL_EXPR_ARG (function
, i
);
388 if (is_empty_class (TREE_TYPE (arg
))
389 && ! TREE_ADDRESSABLE (TREE_TYPE (arg
)))
391 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (arg
));
392 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (t
), arg
, t
);
393 CALL_EXPR_ARG (function
, i
) = arg
;
400 /* New overloading code. */
404 struct candidate_warning
{
406 candidate_warning
*next
;
409 /* Information for providing diagnostics about why overloading failed. */
411 enum rejection_reason_code
{
414 rr_explicit_conversion
,
415 rr_template_conversion
,
417 rr_bad_arg_conversion
,
418 rr_template_unification
,
421 rr_constraint_failure
424 struct conversion_info
{
425 /* The index of the argument, 0-based. */
427 /* The actual argument or its type. */
429 /* The type of the parameter. */
433 struct rejection_reason
{
434 enum rejection_reason_code code
;
436 /* Information about an arity mismatch. */
438 /* The expected number of arguments. */
440 /* The actual number of arguments in the call. */
442 /* Whether the call was a varargs call. */
445 /* Information about an argument conversion mismatch. */
446 struct conversion_info conversion
;
447 /* Same, but for bad argument conversions. */
448 struct conversion_info bad_conversion
;
449 /* Information about template unification failures. These are the
450 parameters passed to fn_type_unification. */
458 unification_kind_t strict
;
460 } template_unification
;
461 /* Information about template instantiation failures. These are the
462 parameters passed to instantiate_template. */
466 } template_instantiation
;
471 /* The FUNCTION_DECL that will be called if this candidate is
472 selected by overload resolution. */
474 /* If not NULL_TREE, the first argument to use when calling this
477 /* The rest of the arguments to use when calling this function. If
478 there are no further arguments this may be NULL or it may be an
480 const vec
<tree
, va_gc
> *args
;
481 /* The implicit conversion sequences for each of the arguments to
484 /* The number of implicit conversion sequences. */
486 /* If FN is a user-defined conversion, the standard conversion
487 sequence from the type returned by FN to the desired destination
489 conversion
*second_conv
;
490 struct rejection_reason
*reason
;
491 /* If FN is a member function, the binfo indicating the path used to
492 qualify the name of FN at the call site. This path is used to
493 determine whether or not FN is accessible if it is selected by
494 overload resolution. The DECL_CONTEXT of FN will always be a
495 (possibly improper) base of this binfo. */
497 /* If FN is a non-static member function, the binfo indicating the
498 subobject to which the `this' pointer should be converted if FN
499 is selected by overload resolution. The type pointed to by
500 the `this' pointer must correspond to the most derived class
501 indicated by the CONVERSION_PATH. */
502 tree conversion_path
;
505 candidate_warning
*warnings
;
509 /* The flags active in add_candidate. */
513 /* Returns true iff T is a null pointer constant in the sense of
517 null_ptr_cst_p (tree t
)
519 tree type
= TREE_TYPE (t
);
523 A null pointer constant is an integral constant expression
524 (_expr.const_) rvalue of integer type that evaluates to zero or
525 an rvalue of type std::nullptr_t. */
526 if (NULLPTR_TYPE_P (type
))
529 if (cxx_dialect
>= cxx11
)
531 STRIP_ANY_LOCATION_WRAPPER (t
);
533 /* Core issue 903 says only literal 0 is a null pointer constant. */
534 if (TREE_CODE (type
) == INTEGER_TYPE
535 && !char_type_p (type
)
536 && TREE_CODE (t
) == INTEGER_CST
538 && !TREE_OVERFLOW (t
))
541 else if (CP_INTEGRAL_TYPE_P (type
))
543 t
= fold_non_dependent_expr (t
);
545 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
552 /* Returns true iff T is a null member pointer value (4.11). */
555 null_member_pointer_value_p (tree t
)
557 tree type
= TREE_TYPE (t
);
560 else if (TYPE_PTRMEMFUNC_P (type
))
561 return (TREE_CODE (t
) == CONSTRUCTOR
562 && integer_zerop (CONSTRUCTOR_ELT (t
, 0)->value
));
563 else if (TYPE_PTRDATAMEM_P (type
))
564 return integer_all_onesp (t
);
569 /* Returns nonzero if PARMLIST consists of only default parms,
570 ellipsis, and/or undeduced parameter packs. */
573 sufficient_parms_p (const_tree parmlist
)
575 for (; parmlist
&& parmlist
!= void_list_node
;
576 parmlist
= TREE_CHAIN (parmlist
))
577 if (!TREE_PURPOSE (parmlist
)
578 && !PACK_EXPANSION_P (TREE_VALUE (parmlist
)))
583 /* Allocate N bytes of memory from the conversion obstack. The memory
584 is zeroed before being returned. */
587 conversion_obstack_alloc (size_t n
)
590 if (!conversion_obstack_initialized
)
592 gcc_obstack_init (&conversion_obstack
);
593 conversion_obstack_initialized
= true;
595 p
= obstack_alloc (&conversion_obstack
, n
);
600 /* Allocate rejection reasons. */
602 static struct rejection_reason
*
603 alloc_rejection (enum rejection_reason_code code
)
605 struct rejection_reason
*p
;
606 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
611 static struct rejection_reason
*
612 arity_rejection (tree first_arg
, int expected
, int actual
)
614 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
615 int adjust
= first_arg
!= NULL_TREE
;
616 r
->u
.arity
.expected
= expected
- adjust
;
617 r
->u
.arity
.actual
= actual
- adjust
;
621 static struct rejection_reason
*
622 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
624 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
625 int adjust
= first_arg
!= NULL_TREE
;
626 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
627 r
->u
.conversion
.from
= from
;
628 r
->u
.conversion
.to_type
= to
;
632 static struct rejection_reason
*
633 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
635 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
636 int adjust
= first_arg
!= NULL_TREE
;
637 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
638 r
->u
.bad_conversion
.from
= from
;
639 r
->u
.bad_conversion
.to_type
= to
;
643 static struct rejection_reason
*
644 explicit_conversion_rejection (tree from
, tree to
)
646 struct rejection_reason
*r
= alloc_rejection (rr_explicit_conversion
);
647 r
->u
.conversion
.n_arg
= 0;
648 r
->u
.conversion
.from
= from
;
649 r
->u
.conversion
.to_type
= to
;
653 static struct rejection_reason
*
654 template_conversion_rejection (tree from
, tree to
)
656 struct rejection_reason
*r
= alloc_rejection (rr_template_conversion
);
657 r
->u
.conversion
.n_arg
= 0;
658 r
->u
.conversion
.from
= from
;
659 r
->u
.conversion
.to_type
= to
;
663 static struct rejection_reason
*
664 template_unification_rejection (tree tmpl
, tree explicit_targs
, tree targs
,
665 const tree
*args
, unsigned int nargs
,
666 tree return_type
, unification_kind_t strict
,
669 size_t args_n_bytes
= sizeof (*args
) * nargs
;
670 tree
*args1
= (tree
*) conversion_obstack_alloc (args_n_bytes
);
671 struct rejection_reason
*r
= alloc_rejection (rr_template_unification
);
672 r
->u
.template_unification
.tmpl
= tmpl
;
673 r
->u
.template_unification
.explicit_targs
= explicit_targs
;
674 r
->u
.template_unification
.num_targs
= TREE_VEC_LENGTH (targs
);
675 /* Copy args to our own storage. */
676 memcpy (args1
, args
, args_n_bytes
);
677 r
->u
.template_unification
.args
= args1
;
678 r
->u
.template_unification
.nargs
= nargs
;
679 r
->u
.template_unification
.return_type
= return_type
;
680 r
->u
.template_unification
.strict
= strict
;
681 r
->u
.template_unification
.flags
= flags
;
685 static struct rejection_reason
*
686 template_unification_error_rejection (void)
688 return alloc_rejection (rr_template_unification
);
691 static struct rejection_reason
*
692 invalid_copy_with_fn_template_rejection (void)
694 struct rejection_reason
*r
= alloc_rejection (rr_invalid_copy
);
698 static struct rejection_reason
*
699 inherited_ctor_rejection (void)
701 struct rejection_reason
*r
= alloc_rejection (rr_inherited_ctor
);
705 // Build a constraint failure record, saving information into the
706 // template_instantiation field of the rejection. If FN is not a template
707 // declaration, the TMPL member is the FN declaration and TARGS is empty.
709 static struct rejection_reason
*
710 constraint_failure (tree fn
)
712 struct rejection_reason
*r
= alloc_rejection (rr_constraint_failure
);
713 if (tree ti
= DECL_TEMPLATE_INFO (fn
))
715 r
->u
.template_instantiation
.tmpl
= TI_TEMPLATE (ti
);
716 r
->u
.template_instantiation
.targs
= TI_ARGS (ti
);
720 r
->u
.template_instantiation
.tmpl
= fn
;
721 r
->u
.template_instantiation
.targs
= NULL_TREE
;
726 /* Dynamically allocate a conversion. */
729 alloc_conversion (conversion_kind kind
)
732 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
737 /* Make sure that all memory on the conversion obstack has been
741 validate_conversion_obstack (void)
743 if (conversion_obstack_initialized
)
744 gcc_assert ((obstack_next_free (&conversion_obstack
)
745 == obstack_base (&conversion_obstack
)));
748 /* Dynamically allocate an array of N conversions. */
751 alloc_conversions (size_t n
)
753 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
757 build_conv (conversion_kind code
, tree type
, conversion
*from
)
760 conversion_rank rank
= CONVERSION_RANK (from
);
762 /* Note that the caller is responsible for filling in t->cand for
763 user-defined conversions. */
764 t
= alloc_conversion (code
);
788 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
789 t
->bad_p
= from
->bad_p
;
794 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
795 specialization of std::initializer_list<T>, if such a conversion is
799 build_list_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
801 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
802 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
803 conversion
**subconvs
= alloc_conversions (len
);
808 /* Within a list-initialization we can have more user-defined
810 flags
&= ~LOOKUP_NO_CONVERSION
;
811 /* But no narrowing conversions. */
812 flags
|= LOOKUP_NO_NARROWING
;
814 /* Can't make an array of these types. */
815 if (TREE_CODE (elttype
) == REFERENCE_TYPE
816 || TREE_CODE (elttype
) == FUNCTION_TYPE
817 || VOID_TYPE_P (elttype
))
820 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
823 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
824 false, flags
, complain
);
831 t
= alloc_conversion (ck_list
);
833 t
->u
.list
= subconvs
;
836 for (i
= 0; i
< len
; ++i
)
838 conversion
*sub
= subconvs
[i
];
839 if (sub
->rank
> t
->rank
)
841 if (sub
->user_conv_p
)
842 t
->user_conv_p
= true;
850 /* Return the next conversion of the conversion chain (if applicable),
851 or NULL otherwise. Please use this function instead of directly
852 accessing fields of struct conversion. */
855 next_conversion (conversion
*conv
)
858 || conv
->kind
== ck_identity
859 || conv
->kind
== ck_ambig
860 || conv
->kind
== ck_list
)
865 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
866 is a valid aggregate initializer for array type ATYPE. */
869 can_convert_array (tree atype
, tree ctor
, int flags
, tsubst_flags_t complain
)
872 tree elttype
= TREE_TYPE (atype
);
873 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
875 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
877 if (TREE_CODE (elttype
) == ARRAY_TYPE
878 && TREE_CODE (val
) == CONSTRUCTOR
)
879 ok
= can_convert_array (elttype
, val
, flags
, complain
);
881 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
,
889 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
890 aggregate class, if such a conversion is possible. */
893 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
895 unsigned HOST_WIDE_INT i
= 0;
897 tree field
= next_initializable_field (TYPE_FIELDS (type
));
898 tree empty_ctor
= NULL_TREE
;
900 /* We already called reshape_init in implicit_conversion. */
902 /* The conversions within the init-list aren't affected by the enclosing
903 context; they're always simple copy-initialization. */
904 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
906 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
908 tree ftype
= TREE_TYPE (field
);
912 if (i
< CONSTRUCTOR_NELTS (ctor
))
913 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
914 else if (DECL_INITIAL (field
))
915 val
= get_nsdmi (field
, /*ctor*/false, complain
);
916 else if (TREE_CODE (ftype
) == REFERENCE_TYPE
)
917 /* Value-initialization of reference is ill-formed. */
921 if (empty_ctor
== NULL_TREE
)
922 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
927 if (TREE_CODE (ftype
) == ARRAY_TYPE
928 && TREE_CODE (val
) == CONSTRUCTOR
)
929 ok
= can_convert_array (ftype
, val
, flags
, complain
);
931 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
937 if (TREE_CODE (type
) == UNION_TYPE
)
941 if (i
< CONSTRUCTOR_NELTS (ctor
))
944 c
= alloc_conversion (ck_aggr
);
947 c
->user_conv_p
= true;
948 c
->check_narrowing
= true;
953 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
954 array type, if such a conversion is possible. */
957 build_array_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
960 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
961 tree elttype
= TREE_TYPE (type
);
966 enum conversion_rank rank
= cr_exact
;
968 /* We might need to propagate the size from the element to the array. */
969 complete_type (type
);
971 if (TYPE_DOMAIN (type
)
972 && !variably_modified_type_p (TYPE_DOMAIN (type
), NULL_TREE
))
974 unsigned HOST_WIDE_INT alen
= tree_to_uhwi (array_type_nelts_top (type
));
979 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
981 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
984 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
985 false, flags
, complain
);
989 if (sub
->rank
> rank
)
991 if (sub
->user_conv_p
)
997 c
= alloc_conversion (ck_aggr
);
1000 c
->user_conv_p
= user
;
1006 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1007 complex type, if such a conversion is possible. */
1010 build_complex_conv (tree type
, tree ctor
, int flags
,
1011 tsubst_flags_t complain
)
1014 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1015 tree elttype
= TREE_TYPE (type
);
1020 enum conversion_rank rank
= cr_exact
;
1025 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1027 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1030 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1031 false, flags
, complain
);
1035 if (sub
->rank
> rank
)
1037 if (sub
->user_conv_p
)
1043 c
= alloc_conversion (ck_aggr
);
1046 c
->user_conv_p
= user
;
1052 /* Build a representation of the identity conversion from EXPR to
1053 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1056 build_identity_conv (tree type
, tree expr
)
1060 c
= alloc_conversion (ck_identity
);
1067 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1068 were multiple user-defined conversions to accomplish the job.
1069 Build a conversion that indicates that ambiguity. */
1072 build_ambiguous_conv (tree type
, tree expr
)
1076 c
= alloc_conversion (ck_ambig
);
1084 strip_top_quals (tree t
)
1086 if (TREE_CODE (t
) == ARRAY_TYPE
)
1088 return cp_build_qualified_type (t
, 0);
1091 /* Returns the standard conversion path (see [conv]) from type FROM to type
1092 TO, if any. For proper handling of null pointer constants, you must
1093 also pass the expression EXPR to convert from. If C_CAST_P is true,
1094 this conversion is coming from a C-style cast. */
1097 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1098 int flags
, tsubst_flags_t complain
)
1100 enum tree_code fcode
, tcode
;
1102 bool fromref
= false;
1105 to
= non_reference (to
);
1106 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1109 from
= TREE_TYPE (from
);
1112 to
= strip_top_quals (to
);
1113 from
= strip_top_quals (from
);
1115 if (expr
&& type_unknown_p (expr
))
1117 if (TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1119 tsubst_flags_t tflags
= tf_conv
;
1120 expr
= instantiate_type (to
, expr
, tflags
);
1121 if (expr
== error_mark_node
)
1123 from
= TREE_TYPE (expr
);
1125 else if (TREE_CODE (to
) == BOOLEAN_TYPE
)
1127 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1128 expr
= resolve_nondeduced_context (expr
, complain
);
1129 from
= TREE_TYPE (expr
);
1133 fcode
= TREE_CODE (from
);
1134 tcode
= TREE_CODE (to
);
1136 conv
= build_identity_conv (from
, expr
);
1137 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1139 from
= type_decays_to (from
);
1140 fcode
= TREE_CODE (from
);
1141 conv
= build_conv (ck_lvalue
, from
, conv
);
1143 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1144 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1145 express the copy constructor call required by copy-initialization. */
1146 else if (fromref
|| (expr
&& obvalue_p (expr
)))
1151 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1154 from
= strip_top_quals (bitfield_type
);
1155 fcode
= TREE_CODE (from
);
1158 conv
= build_conv (ck_rvalue
, from
, conv
);
1159 if (flags
& LOOKUP_PREFER_RVALUE
)
1160 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1161 conv
->rvaluedness_matches_p
= true;
1164 /* Allow conversion between `__complex__' data types. */
1165 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1167 /* The standard conversion sequence to convert FROM to TO is
1168 the standard conversion sequence to perform componentwise
1170 conversion
*part_conv
= standard_conversion
1171 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
,
1176 conv
= build_conv (part_conv
->kind
, to
, conv
);
1177 conv
->rank
= part_conv
->rank
;
1185 if (same_type_p (from
, to
))
1187 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1188 conv
->type
= qualified_to
;
1193 A null pointer constant can be converted to a pointer type; ... A
1194 null pointer constant of integral type can be converted to an
1195 rvalue of type std::nullptr_t. */
1196 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1197 || NULLPTR_TYPE_P (to
))
1198 && ((expr
&& null_ptr_cst_p (expr
))
1199 || NULLPTR_TYPE_P (from
)))
1200 conv
= build_conv (ck_std
, to
, conv
);
1201 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1202 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1204 /* For backwards brain damage compatibility, allow interconversion of
1205 pointers and integers with a pedwarn. */
1206 conv
= build_conv (ck_std
, to
, conv
);
1209 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1211 /* For backwards brain damage compatibility, allow interconversion of
1212 enums and integers with a pedwarn. */
1213 conv
= build_conv (ck_std
, to
, conv
);
1216 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1217 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1222 if (tcode
== POINTER_TYPE
)
1224 to_pointee
= TREE_TYPE (to
);
1225 from_pointee
= TREE_TYPE (from
);
1227 /* Since this is the target of a pointer, it can't have function
1228 qualifiers, so any TYPE_QUALS must be for attributes const or
1229 noreturn. Strip them. */
1230 if (TREE_CODE (to_pointee
) == FUNCTION_TYPE
1231 && TYPE_QUALS (to_pointee
))
1232 to_pointee
= build_qualified_type (to_pointee
, TYPE_UNQUALIFIED
);
1233 if (TREE_CODE (from_pointee
) == FUNCTION_TYPE
1234 && TYPE_QUALS (from_pointee
))
1235 from_pointee
= build_qualified_type (from_pointee
, TYPE_UNQUALIFIED
);
1239 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1240 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1243 if (tcode
== POINTER_TYPE
1244 && same_type_ignoring_top_level_qualifiers_p (from_pointee
,
1247 else if (VOID_TYPE_P (to_pointee
)
1248 && !TYPE_PTRDATAMEM_P (from
)
1249 && TREE_CODE (from_pointee
) != FUNCTION_TYPE
)
1251 tree nfrom
= TREE_TYPE (from
);
1252 /* Don't try to apply restrict to void. */
1253 int quals
= cp_type_quals (nfrom
) & ~TYPE_QUAL_RESTRICT
;
1254 from_pointee
= cp_build_qualified_type (void_type_node
, quals
);
1255 from
= build_pointer_type (from_pointee
);
1256 conv
= build_conv (ck_ptr
, from
, conv
);
1258 else if (TYPE_PTRDATAMEM_P (from
))
1260 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1261 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1263 if (same_type_p (fbase
, tbase
))
1264 /* No base conversion needed. */;
1265 else if (DERIVED_FROM_P (fbase
, tbase
)
1266 && (same_type_ignoring_top_level_qualifiers_p
1267 (from_pointee
, to_pointee
)))
1269 from
= build_ptrmem_type (tbase
, from_pointee
);
1270 conv
= build_conv (ck_pmem
, from
, conv
);
1275 else if (CLASS_TYPE_P (from_pointee
)
1276 && CLASS_TYPE_P (to_pointee
)
1279 An rvalue of type "pointer to cv D," where D is a
1280 class type, can be converted to an rvalue of type
1281 "pointer to cv B," where B is a base class (clause
1282 _class.derived_) of D. If B is an inaccessible
1283 (clause _class.access_) or ambiguous
1284 (_class.member.lookup_) base class of D, a program
1285 that necessitates this conversion is ill-formed.
1286 Therefore, we use DERIVED_FROM_P, and do not check
1287 access or uniqueness. */
1288 && DERIVED_FROM_P (to_pointee
, from_pointee
))
1291 = cp_build_qualified_type (to_pointee
,
1292 cp_type_quals (from_pointee
));
1293 from
= build_pointer_type (from_pointee
);
1294 conv
= build_conv (ck_ptr
, from
, conv
);
1295 conv
->base_p
= true;
1298 if (same_type_p (from
, to
))
1300 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
1301 /* In a C-style cast, we ignore CV-qualification because we
1302 are allowed to perform a static_cast followed by a
1304 conv
= build_conv (ck_qual
, to
, conv
);
1305 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1306 conv
= build_conv (ck_qual
, to
, conv
);
1307 else if (expr
&& string_conv_p (to
, expr
, 0))
1308 /* converting from string constant to char *. */
1309 conv
= build_conv (ck_qual
, to
, conv
);
1310 else if (fnptr_conv_p (to
, from
))
1311 conv
= build_conv (ck_fnptr
, to
, conv
);
1312 /* Allow conversions among compatible ObjC pointer types (base
1313 conversions have been already handled above). */
1314 else if (c_dialect_objc ()
1315 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1316 conv
= build_conv (ck_ptr
, to
, conv
);
1317 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1319 conv
= build_conv (ck_ptr
, to
, conv
);
1327 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1329 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1330 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1331 tree fbase
= class_of_this_parm (fromfn
);
1332 tree tbase
= class_of_this_parm (tofn
);
1334 if (!DERIVED_FROM_P (fbase
, tbase
))
1337 tree fstat
= static_fn_type (fromfn
);
1338 tree tstat
= static_fn_type (tofn
);
1339 if (same_type_p (tstat
, fstat
)
1340 || fnptr_conv_p (tstat
, fstat
))
1345 if (!same_type_p (fbase
, tbase
))
1347 from
= build_memfn_type (fstat
,
1349 cp_type_quals (tbase
),
1350 type_memfn_rqual (tofn
));
1351 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1352 conv
= build_conv (ck_pmem
, from
, conv
);
1353 conv
->base_p
= true;
1355 if (fnptr_conv_p (tstat
, fstat
))
1356 conv
= build_conv (ck_fnptr
, to
, conv
);
1358 else if (tcode
== BOOLEAN_TYPE
)
1362 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1363 to member type can be converted to a prvalue of type bool. ...
1364 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1365 std::nullptr_t can be converted to a prvalue of type bool; */
1366 if (ARITHMETIC_TYPE_P (from
)
1367 || UNSCOPED_ENUM_P (from
)
1368 || fcode
== POINTER_TYPE
1369 || TYPE_PTRMEM_P (from
)
1370 || NULLPTR_TYPE_P (from
))
1372 conv
= build_conv (ck_std
, to
, conv
);
1373 if (fcode
== POINTER_TYPE
1374 || TYPE_PTRDATAMEM_P (from
)
1375 || (TYPE_PTRMEMFUNC_P (from
)
1376 && conv
->rank
< cr_pbool
)
1377 || NULLPTR_TYPE_P (from
))
1378 conv
->rank
= cr_pbool
;
1379 if (NULLPTR_TYPE_P (from
) && (flags
& LOOKUP_ONLYCONVERTING
))
1386 /* We don't check for ENUMERAL_TYPE here because there are no standard
1387 conversions to enum type. */
1388 /* As an extension, allow conversion to complex type. */
1389 else if (ARITHMETIC_TYPE_P (to
))
1391 if (! (INTEGRAL_CODE_P (fcode
)
1392 || (fcode
== REAL_TYPE
&& !(flags
& LOOKUP_NO_NON_INTEGRAL
)))
1393 || SCOPED_ENUM_P (from
))
1395 conv
= build_conv (ck_std
, to
, conv
);
1397 /* Give this a better rank if it's a promotion. */
1398 if (same_type_p (to
, type_promotes_to (from
))
1399 && next_conversion (conv
)->rank
<= cr_promotion
)
1400 conv
->rank
= cr_promotion
;
1402 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1403 && vector_types_convertible_p (from
, to
, false))
1404 return build_conv (ck_std
, to
, conv
);
1405 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1406 && is_properly_derived_from (from
, to
))
1408 if (conv
->kind
== ck_rvalue
)
1409 conv
= next_conversion (conv
);
1410 conv
= build_conv (ck_base
, to
, conv
);
1411 /* The derived-to-base conversion indicates the initialization
1412 of a parameter with base type from an object of a derived
1413 type. A temporary object is created to hold the result of
1414 the conversion unless we're binding directly to a reference. */
1415 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1420 if (flags
& LOOKUP_NO_NARROWING
)
1421 conv
->check_narrowing
= true;
1426 /* Returns nonzero if T1 is reference-related to T2. */
1429 reference_related_p (tree t1
, tree t2
)
1431 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1434 t1
= TYPE_MAIN_VARIANT (t1
);
1435 t2
= TYPE_MAIN_VARIANT (t2
);
1439 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1440 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1442 return (same_type_p (t1
, t2
)
1443 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1444 && DERIVED_FROM_P (t1
, t2
)));
1447 /* Returns nonzero if T1 is reference-compatible with T2. */
1450 reference_compatible_p (tree t1
, tree t2
)
1454 "cv1 T1" is reference compatible with "cv2 T2" if
1455 * T1 is reference-related to T2 or
1456 * T2 is "noexcept function" and T1 is "function", where the
1457 function types are otherwise the same,
1458 and cv1 is the same cv-qualification as, or greater cv-qualification
1460 return ((reference_related_p (t1
, t2
)
1461 || fnptr_conv_p (t1
, t2
))
1462 && at_least_as_qualified_p (t1
, t2
));
1465 /* A reference of the indicated TYPE is being bound directly to the
1466 expression represented by the implicit conversion sequence CONV.
1467 Return a conversion sequence for this binding. */
1470 direct_reference_binding (tree type
, conversion
*conv
)
1474 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
1475 gcc_assert (TREE_CODE (conv
->type
) != REFERENCE_TYPE
);
1477 t
= TREE_TYPE (type
);
1481 When a parameter of reference type binds directly
1482 (_dcl.init.ref_) to an argument expression, the implicit
1483 conversion sequence is the identity conversion, unless the
1484 argument expression has a type that is a derived class of the
1485 parameter type, in which case the implicit conversion sequence is
1486 a derived-to-base Conversion.
1488 If the parameter binds directly to the result of applying a
1489 conversion function to the argument expression, the implicit
1490 conversion sequence is a user-defined conversion sequence
1491 (_over.ics.user_), with the second standard conversion sequence
1492 either an identity conversion or, if the conversion function
1493 returns an entity of a type that is a derived class of the
1494 parameter type, a derived-to-base conversion. */
1495 if (is_properly_derived_from (conv
->type
, t
))
1497 /* Represent the derived-to-base conversion. */
1498 conv
= build_conv (ck_base
, t
, conv
);
1499 /* We will actually be binding to the base-class subobject in
1500 the derived class, so we mark this conversion appropriately.
1501 That way, convert_like knows not to generate a temporary. */
1502 conv
->need_temporary_p
= false;
1504 return build_conv (ck_ref_bind
, type
, conv
);
1507 /* Returns the conversion path from type FROM to reference type TO for
1508 purposes of reference binding. For lvalue binding, either pass a
1509 reference type to FROM or an lvalue expression to EXPR. If the
1510 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1511 the conversion returned. If C_CAST_P is true, this
1512 conversion is coming from a C-style cast. */
1515 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1516 tsubst_flags_t complain
)
1518 conversion
*conv
= NULL
;
1519 tree to
= TREE_TYPE (rto
);
1524 cp_lvalue_kind gl_kind
;
1527 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1529 expr
= instantiate_type (to
, expr
, tf_none
);
1530 if (expr
== error_mark_node
)
1532 from
= TREE_TYPE (expr
);
1535 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1537 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1538 /* DR 1288: Otherwise, if the initializer list has a single element
1539 of type E and ... [T's] referenced type is reference-related to E,
1540 the object or reference is initialized from that element... */
1541 if (CONSTRUCTOR_NELTS (expr
) == 1)
1543 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1544 if (error_operand_p (elt
))
1546 tree etype
= TREE_TYPE (elt
);
1547 if (reference_related_p (to
, etype
))
1554 /* Otherwise, if T is a reference type, a prvalue temporary of the
1555 type referenced by T is copy-list-initialized or
1556 direct-list-initialized, depending on the kind of initialization
1557 for the reference, and the reference is bound to that temporary. */
1558 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1559 flags
|LOOKUP_NO_TEMP_BIND
, complain
);
1563 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1565 from
= TREE_TYPE (from
);
1566 if (!TYPE_REF_IS_RVALUE (rfrom
)
1567 || TREE_CODE (from
) == FUNCTION_TYPE
)
1568 gl_kind
= clk_ordinary
;
1570 gl_kind
= clk_rvalueref
;
1573 gl_kind
= lvalue_kind (expr
);
1574 else if (CLASS_TYPE_P (from
)
1575 || TREE_CODE (from
) == ARRAY_TYPE
)
1576 gl_kind
= clk_class
;
1580 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1581 if ((flags
& LOOKUP_NO_TEMP_BIND
)
1582 && (gl_kind
& clk_class
))
1585 /* Same mask as real_lvalue_p. */
1586 is_lvalue
= gl_kind
&& !(gl_kind
& (clk_rvalueref
|clk_class
));
1589 if ((gl_kind
& clk_bitfield
) != 0)
1590 tfrom
= unlowered_expr_type (expr
);
1592 /* Figure out whether or not the types are reference-related and
1593 reference compatible. We have to do this after stripping
1594 references from FROM. */
1595 related_p
= reference_related_p (to
, tfrom
);
1596 /* If this is a C cast, first convert to an appropriately qualified
1597 type, so that we can later do a const_cast to the desired type. */
1598 if (related_p
&& c_cast_p
1599 && !at_least_as_qualified_p (to
, tfrom
))
1600 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1601 compatible_p
= reference_compatible_p (to
, tfrom
);
1603 /* Directly bind reference when target expression's type is compatible with
1604 the reference and expression is an lvalue. In DR391, the wording in
1605 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1606 const and rvalue references to rvalues of compatible class type.
1607 We should also do direct bindings for non-class xvalues. */
1608 if ((related_p
|| compatible_p
) && gl_kind
)
1612 If the initializer expression
1614 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1615 is reference-compatible with "cv2 T2,"
1617 the reference is bound directly to the initializer expression
1621 If the initializer expression is an rvalue, with T2 a class type,
1622 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1623 is bound to the object represented by the rvalue or to a sub-object
1624 within that object. */
1626 conv
= build_identity_conv (tfrom
, expr
);
1627 conv
= direct_reference_binding (rto
, conv
);
1629 if (TREE_CODE (rfrom
) == REFERENCE_TYPE
)
1630 /* Handle rvalue reference to function properly. */
1631 conv
->rvaluedness_matches_p
1632 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1634 conv
->rvaluedness_matches_p
1635 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1637 if ((gl_kind
& clk_bitfield
) != 0
1638 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1639 /* For the purposes of overload resolution, we ignore the fact
1640 this expression is a bitfield or packed field. (In particular,
1641 [over.ics.ref] says specifically that a function with a
1642 non-const reference parameter is viable even if the
1643 argument is a bitfield.)
1645 However, when we actually call the function we must create
1646 a temporary to which to bind the reference. If the
1647 reference is volatile, or isn't const, then we cannot make
1648 a temporary, so we just issue an error when the conversion
1650 conv
->need_temporary_p
= true;
1652 /* Don't allow binding of lvalues (other than function lvalues) to
1653 rvalue references. */
1654 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1655 && TREE_CODE (to
) != FUNCTION_TYPE
)
1658 /* Nor the reverse. */
1659 if (!is_lvalue
&& !TYPE_REF_IS_RVALUE (rto
)
1660 && (!CP_TYPE_CONST_NON_VOLATILE_P (to
)
1661 || (flags
& LOOKUP_NO_RVAL_BIND
))
1662 && TREE_CODE (to
) != FUNCTION_TYPE
)
1670 /* [class.conv.fct] A conversion function is never used to convert a
1671 (possibly cv-qualified) object to the (possibly cv-qualified) same
1672 object type (or a reference to it), to a (possibly cv-qualified) base
1673 class of that type (or a reference to it).... */
1674 else if (CLASS_TYPE_P (from
) && !related_p
1675 && !(flags
& LOOKUP_NO_CONVERSION
))
1679 If the initializer expression
1681 -- has a class type (i.e., T2 is a class type) can be
1682 implicitly converted to an lvalue of type "cv3 T3," where
1683 "cv1 T1" is reference-compatible with "cv3 T3". (this
1684 conversion is selected by enumerating the applicable
1685 conversion functions (_over.match.ref_) and choosing the
1686 best one through overload resolution. (_over.match_).
1688 the reference is bound to the lvalue result of the conversion
1689 in the second case. */
1690 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1693 return cand
->second_conv
;
1696 /* From this point on, we conceptually need temporaries, even if we
1697 elide them. Only the cases above are "direct bindings". */
1698 if (flags
& LOOKUP_NO_TEMP_BIND
)
1703 When a parameter of reference type is not bound directly to an
1704 argument expression, the conversion sequence is the one required
1705 to convert the argument expression to the underlying type of the
1706 reference according to _over.best.ics_. Conceptually, this
1707 conversion sequence corresponds to copy-initializing a temporary
1708 of the underlying type with the argument expression. Any
1709 difference in top-level cv-qualification is subsumed by the
1710 initialization itself and does not constitute a conversion. */
1714 Otherwise, the reference shall be an lvalue reference to a
1715 non-volatile const type, or the reference shall be an rvalue
1718 We try below to treat this as a bad conversion to improve diagnostics,
1719 but if TO is an incomplete class, we need to reject this conversion
1720 now to avoid unnecessary instantiation. */
1721 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
)
1722 && !COMPLETE_TYPE_P (to
))
1725 /* We're generating a temporary now, but don't bind any more in the
1726 conversion (specifically, don't slice the temporary returned by a
1727 conversion operator). */
1728 flags
|= LOOKUP_NO_TEMP_BIND
;
1730 /* Core issue 899: When [copy-]initializing a temporary to be bound
1731 to the first parameter of a copy constructor (12.8) called with
1732 a single argument in the context of direct-initialization,
1733 explicit conversion functions are also considered.
1735 So don't set LOOKUP_ONLYCONVERTING in that case. */
1736 if (!(flags
& LOOKUP_COPY_PARM
))
1737 flags
|= LOOKUP_ONLYCONVERTING
;
1740 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1745 if (conv
->user_conv_p
)
1747 /* If initializing the temporary used a conversion function,
1748 recalculate the second conversion sequence. */
1749 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1750 if (t
->kind
== ck_user
1751 && DECL_CONV_FN_P (t
->cand
->fn
))
1753 tree ftype
= TREE_TYPE (TREE_TYPE (t
->cand
->fn
));
1754 int sflags
= (flags
|LOOKUP_NO_CONVERSION
)&~LOOKUP_NO_TEMP_BIND
;
1755 conversion
*new_second
1756 = reference_binding (rto
, ftype
, NULL_TREE
, c_cast_p
,
1760 return merge_conversion_sequences (t
, new_second
);
1764 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1765 /* This reference binding, unlike those above, requires the
1766 creation of a temporary. */
1767 conv
->need_temporary_p
= true;
1768 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1772 Otherwise, the reference shall be an lvalue reference to a
1773 non-volatile const type, or the reference shall be an rvalue
1775 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1780 Otherwise, a temporary of type "cv1 T1" is created and
1781 initialized from the initializer expression using the rules for a
1782 non-reference copy initialization. If T1 is reference-related to
1783 T2, cv1 must be the same cv-qualification as, or greater
1784 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1785 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1791 /* Returns the implicit conversion sequence (see [over.ics]) from type
1792 FROM to type TO. The optional expression EXPR may affect the
1793 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1794 true, this conversion is coming from a C-style cast. */
1797 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1798 int flags
, tsubst_flags_t complain
)
1802 if (from
== error_mark_node
|| to
== error_mark_node
1803 || expr
== error_mark_node
)
1806 /* Other flags only apply to the primary function in overload
1807 resolution, or after we've chosen one. */
1808 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1809 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1810 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1812 /* FIXME: actually we don't want warnings either, but we can't just
1813 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1814 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1815 We really ought not to issue that warning until we've committed
1816 to that conversion. */
1817 complain
&= ~tf_error
;
1819 /* Call reshape_init early to remove redundant braces. */
1820 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
)
1821 && CLASS_TYPE_P (to
)
1822 && COMPLETE_TYPE_P (complete_type (to
))
1823 && !CLASSTYPE_NON_AGGREGATE (to
))
1825 expr
= reshape_init (to
, expr
, complain
);
1826 if (expr
== error_mark_node
)
1828 from
= TREE_TYPE (expr
);
1831 if (TREE_CODE (to
) == REFERENCE_TYPE
)
1832 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1834 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
, complain
);
1839 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1841 if (is_std_init_list (to
))
1842 return build_list_conv (to
, expr
, flags
, complain
);
1844 /* As an extension, allow list-initialization of _Complex. */
1845 if (TREE_CODE (to
) == COMPLEX_TYPE
)
1847 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1852 /* Allow conversion from an initializer-list with one element to a
1854 if (SCALAR_TYPE_P (to
))
1856 int nelts
= CONSTRUCTOR_NELTS (expr
);
1860 elt
= build_value_init (to
, tf_none
);
1861 else if (nelts
== 1)
1862 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1864 elt
= error_mark_node
;
1866 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1867 c_cast_p
, flags
, complain
);
1870 conv
->check_narrowing
= true;
1871 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1872 /* Too many levels of braces, i.e. '{{1}}'. */
1877 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1878 return build_array_conv (to
, expr
, flags
, complain
);
1881 if (expr
!= NULL_TREE
1882 && (MAYBE_CLASS_TYPE_P (from
)
1883 || MAYBE_CLASS_TYPE_P (to
))
1884 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1886 struct z_candidate
*cand
;
1888 if (CLASS_TYPE_P (to
)
1889 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
1890 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
1891 return build_aggr_conv (to
, expr
, flags
, complain
);
1893 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
1896 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
1897 && CONSTRUCTOR_NELTS (expr
) == 1
1898 && !is_list_ctor (cand
->fn
))
1900 /* "If C is not an initializer-list constructor and the
1901 initializer list has a single element of type cv U, where U is
1902 X or a class derived from X, the implicit conversion sequence
1903 has Exact Match rank if U is X, or Conversion rank if U is
1905 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1906 tree elttype
= TREE_TYPE (elt
);
1907 if (reference_related_p (to
, elttype
))
1908 return implicit_conversion (to
, elttype
, elt
,
1909 c_cast_p
, flags
, complain
);
1911 conv
= cand
->second_conv
;
1914 /* We used to try to bind a reference to a temporary here, but that
1915 is now handled after the recursive call to this function at the end
1916 of reference_binding. */
1923 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1924 functions. ARGS will not be changed until a single candidate is
1927 static struct z_candidate
*
1928 add_candidate (struct z_candidate
**candidates
,
1929 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
1930 size_t num_convs
, conversion
**convs
,
1931 tree access_path
, tree conversion_path
,
1932 int viable
, struct rejection_reason
*reason
,
1935 struct z_candidate
*cand
= (struct z_candidate
*)
1936 conversion_obstack_alloc (sizeof (struct z_candidate
));
1939 cand
->first_arg
= first_arg
;
1941 cand
->convs
= convs
;
1942 cand
->num_convs
= num_convs
;
1943 cand
->access_path
= access_path
;
1944 cand
->conversion_path
= conversion_path
;
1945 cand
->viable
= viable
;
1946 cand
->reason
= reason
;
1947 cand
->next
= *candidates
;
1948 cand
->flags
= flags
;
1954 /* Return the number of remaining arguments in the parameter list
1955 beginning with ARG. */
1958 remaining_arguments (tree arg
)
1962 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
1963 arg
= TREE_CHAIN (arg
))
1969 /* Create an overload candidate for the function or method FN called
1970 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1971 FLAGS is passed on to implicit_conversion.
1973 This does not change ARGS.
1975 CTYPE, if non-NULL, is the type we want to pretend this function
1976 comes from for purposes of overload resolution. */
1978 static struct z_candidate
*
1979 add_function_candidate (struct z_candidate
**candidates
,
1980 tree fn
, tree ctype
, tree first_arg
,
1981 const vec
<tree
, va_gc
> *args
, tree access_path
,
1982 tree conversion_path
, int flags
,
1983 tsubst_flags_t complain
)
1985 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1989 tree orig_first_arg
= first_arg
;
1992 struct rejection_reason
*reason
= NULL
;
1994 /* At this point we should not see any functions which haven't been
1995 explicitly declared, except for friend functions which will have
1996 been found using argument dependent lookup. */
1997 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
1999 /* The `this', `in_chrg' and VTT arguments to constructors are not
2000 considered in overload resolution. */
2001 if (DECL_CONSTRUCTOR_P (fn
))
2003 if (ctor_omit_inherited_parms (fn
))
2004 /* Bring back parameters omitted from an inherited ctor. */
2005 parmlist
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn
));
2007 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
2008 skip
= num_artificial_parms_for (fn
);
2009 if (skip
> 0 && first_arg
!= NULL_TREE
)
2012 first_arg
= NULL_TREE
;
2018 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
2019 convs
= alloc_conversions (len
);
2021 /* 13.3.2 - Viable functions [over.match.viable]
2022 First, to be a viable function, a candidate function shall have enough
2023 parameters to agree in number with the arguments in the list.
2025 We need to check this first; otherwise, checking the ICSes might cause
2026 us to produce an ill-formed template instantiation. */
2028 parmnode
= parmlist
;
2029 for (i
= 0; i
< len
; ++i
)
2031 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
2033 parmnode
= TREE_CHAIN (parmnode
);
2036 if ((i
< len
&& parmnode
)
2037 || !sufficient_parms_p (parmnode
))
2039 int remaining
= remaining_arguments (parmnode
);
2041 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
2044 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2045 parameter of type "reference to cv C" (including such a constructor
2046 instantiated from a template) is excluded from the set of candidate
2047 functions when used to construct an object of type D with an argument list
2048 containing a single argument if C is reference-related to D. */
2049 if (viable
&& len
== 1 && parmlist
&& DECL_CONSTRUCTOR_P (fn
)
2050 && flag_new_inheriting_ctors
2051 && DECL_INHERITED_CTOR (fn
))
2053 tree ptype
= non_reference (TREE_VALUE (parmlist
));
2054 tree dtype
= DECL_CONTEXT (fn
);
2055 tree btype
= DECL_INHERITED_CTOR_BASE (fn
);
2056 if (reference_related_p (ptype
, dtype
)
2057 && reference_related_p (btype
, ptype
))
2060 reason
= inherited_ctor_rejection ();
2064 /* Second, for a function to be viable, its constraints must be
2066 if (flag_concepts
&& viable
2067 && !constraints_satisfied_p (fn
))
2069 reason
= constraint_failure (fn
);
2073 /* When looking for a function from a subobject from an implicit
2074 copy/move constructor/operator=, don't consider anything that takes (a
2075 reference to) an unrelated type. See c++/44909 and core 1092. */
2076 if (viable
&& parmlist
&& (flags
& LOOKUP_DEFAULTED
))
2078 if (DECL_CONSTRUCTOR_P (fn
))
2080 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
2081 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
))
2087 parmnode
= chain_index (i
-1, parmlist
);
2088 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
2093 /* This only applies at the top level. */
2094 flags
&= ~LOOKUP_DEFAULTED
;
2100 /* Third, for F to be a viable function, there shall exist for each
2101 argument an implicit conversion sequence that converts that argument
2102 to the corresponding parameter of F. */
2104 parmnode
= parmlist
;
2106 for (i
= 0; i
< len
; ++i
)
2108 tree argtype
, to_type
;
2113 if (parmnode
== void_list_node
)
2116 if (i
== 0 && first_arg
!= NULL_TREE
)
2119 arg
= CONST_CAST_TREE (
2120 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
2121 argtype
= lvalue_type (arg
);
2123 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2124 && ! DECL_CONSTRUCTOR_P (fn
));
2128 tree parmtype
= TREE_VALUE (parmnode
);
2131 parmnode
= TREE_CHAIN (parmnode
);
2133 /* The type of the implicit object parameter ('this') for
2134 overload resolution is not always the same as for the
2135 function itself; conversion functions are considered to
2136 be members of the class being converted, and functions
2137 introduced by a using-declaration are considered to be
2138 members of the class that uses them.
2140 Since build_over_call ignores the ICS for the `this'
2141 parameter, we can just change the parm type. */
2142 if (ctype
&& is_this
)
2144 parmtype
= cp_build_qualified_type
2145 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
2146 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
2148 /* If the function has a ref-qualifier, the implicit
2149 object parameter has reference type. */
2150 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
2151 parmtype
= cp_build_reference_type (parmtype
, rv
);
2152 /* The special handling of 'this' conversions in compare_ics
2153 does not apply if there is a ref-qualifier. */
2158 parmtype
= build_pointer_type (parmtype
);
2159 /* We don't use build_this here because we don't want to
2160 capture the object argument until we've chosen a
2161 non-static member function. */
2162 arg
= build_address (arg
);
2163 argtype
= lvalue_type (arg
);
2167 /* Core issue 899: When [copy-]initializing a temporary to be bound
2168 to the first parameter of a copy constructor (12.8) called with
2169 a single argument in the context of direct-initialization,
2170 explicit conversion functions are also considered.
2172 So set LOOKUP_COPY_PARM to let reference_binding know that
2173 it's being called in that context. We generalize the above
2174 to handle move constructors and template constructors as well;
2175 the standardese should soon be updated similarly. */
2176 if (ctype
&& i
== 0 && (len
-skip
== 1)
2177 && DECL_CONSTRUCTOR_P (fn
)
2178 && parmtype
!= error_mark_node
2179 && (same_type_ignoring_top_level_qualifiers_p
2180 (non_reference (parmtype
), ctype
)))
2182 if (!(flags
& LOOKUP_ONLYCONVERTING
))
2183 lflags
|= LOOKUP_COPY_PARM
;
2184 /* We allow user-defined conversions within init-lists, but
2185 don't list-initialize the copy parm, as that would mean
2186 using two levels of braces for the same type. */
2187 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
2188 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
2189 lflags
|= LOOKUP_NO_CONVERSION
;
2192 lflags
|= LOOKUP_ONLYCONVERTING
;
2194 t
= implicit_conversion (parmtype
, argtype
, arg
,
2195 /*c_cast_p=*/false, lflags
, complain
);
2200 t
= build_identity_conv (argtype
, arg
);
2201 t
->ellipsis_p
= true;
2212 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
);
2219 reason
= bad_arg_conversion_rejection (first_arg
, i
, arg
, to_type
);
2224 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2225 access_path
, conversion_path
, viable
, reason
, flags
);
2228 /* Create an overload candidate for the conversion function FN which will
2229 be invoked for expression OBJ, producing a pointer-to-function which
2230 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2231 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2232 passed on to implicit_conversion.
2234 Actually, we don't really care about FN; we care about the type it
2235 converts to. There may be multiple conversion functions that will
2236 convert to that type, and we rely on build_user_type_conversion_1 to
2237 choose the best one; so when we create our candidate, we record the type
2238 instead of the function. */
2240 static struct z_candidate
*
2241 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2242 const vec
<tree
, va_gc
> *arglist
,
2243 tree access_path
, tree conversion_path
,
2244 tsubst_flags_t complain
)
2246 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2247 int i
, len
, viable
, flags
;
2248 tree parmlist
, parmnode
;
2250 struct rejection_reason
*reason
;
2252 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2253 parmlist
= TREE_TYPE (parmlist
);
2254 parmlist
= TYPE_ARG_TYPES (parmlist
);
2256 len
= vec_safe_length (arglist
) + 1;
2257 convs
= alloc_conversions (len
);
2258 parmnode
= parmlist
;
2260 flags
= LOOKUP_IMPLICIT
;
2263 /* Don't bother looking up the same type twice. */
2264 if (*candidates
&& (*candidates
)->fn
== totype
)
2267 for (i
= 0; i
< len
; ++i
)
2269 tree arg
, argtype
, convert_type
= NULL_TREE
;
2275 arg
= (*arglist
)[i
- 1];
2276 argtype
= lvalue_type (arg
);
2280 t
= build_identity_conv (argtype
, NULL_TREE
);
2281 t
= build_conv (ck_user
, totype
, t
);
2282 /* Leave the 'cand' field null; we'll figure out the conversion in
2283 convert_like_real if this candidate is chosen. */
2284 convert_type
= totype
;
2286 else if (parmnode
== void_list_node
)
2290 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2291 /*c_cast_p=*/false, flags
, complain
);
2292 convert_type
= TREE_VALUE (parmnode
);
2296 t
= build_identity_conv (argtype
, arg
);
2297 t
->ellipsis_p
= true;
2298 convert_type
= argtype
;
2308 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, arg
, convert_type
);
2315 parmnode
= TREE_CHAIN (parmnode
);
2319 || ! sufficient_parms_p (parmnode
))
2321 int remaining
= remaining_arguments (parmnode
);
2323 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2326 return add_candidate (candidates
, totype
, obj
, arglist
, len
, convs
,
2327 access_path
, conversion_path
, viable
, reason
, flags
);
2331 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2332 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2333 int flags
, tsubst_flags_t complain
)
2340 struct rejection_reason
*reason
= NULL
;
2345 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2346 convs
= alloc_conversions (num_convs
);
2348 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2349 conversion ops are allowed. We handle that here by just checking for
2350 boolean_type_node because other operators don't ask for it. COND_EXPR
2351 also does contextual conversion to bool for the first operand, but we
2352 handle that in build_conditional_expr, and type1 here is operand 2. */
2353 if (type1
!= boolean_type_node
)
2354 flags
|= LOOKUP_ONLYCONVERTING
;
2356 for (i
= 0; i
< 2; ++i
)
2361 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2362 /*c_cast_p=*/false, flags
, complain
);
2366 /* We need something for printing the candidate. */
2367 t
= build_identity_conv (types
[i
], NULL_TREE
);
2368 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2374 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, args
[i
],
2380 /* For COND_EXPR we rearranged the arguments; undo that now. */
2383 convs
[2] = convs
[1];
2384 convs
[1] = convs
[0];
2385 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2386 /*c_cast_p=*/false, flags
,
2393 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2398 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2400 /*access_path=*/NULL_TREE
,
2401 /*conversion_path=*/NULL_TREE
,
2402 viable
, reason
, flags
);
2406 is_complete (tree t
)
2408 return COMPLETE_TYPE_P (complete_type (t
));
2411 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2414 promoted_arithmetic_type_p (tree type
)
2418 In this section, the term promoted integral type is used to refer
2419 to those integral types which are preserved by integral promotion
2420 (including e.g. int and long but excluding e.g. char).
2421 Similarly, the term promoted arithmetic type refers to promoted
2422 integral types plus floating types. */
2423 return ((CP_INTEGRAL_TYPE_P (type
)
2424 && same_type_p (type_promotes_to (type
), type
))
2425 || TREE_CODE (type
) == REAL_TYPE
);
2428 /* Create any builtin operator overload candidates for the operator in
2429 question given the converted operand types TYPE1 and TYPE2. The other
2430 args are passed through from add_builtin_candidates to
2431 build_builtin_candidate.
2433 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2434 If CODE is requires candidates operands of the same type of the kind
2435 of which TYPE1 and TYPE2 are, we add both candidates
2436 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2439 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2440 enum tree_code code2
, tree fnname
, tree type1
,
2441 tree type2
, tree
*args
, tree
*argtypes
, int flags
,
2442 tsubst_flags_t complain
)
2446 case POSTINCREMENT_EXPR
:
2447 case POSTDECREMENT_EXPR
:
2448 args
[1] = integer_zero_node
;
2449 type2
= integer_type_node
;
2458 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2459 and VQ is either volatile or empty, there exist candidate operator
2460 functions of the form
2461 VQ T& operator++(VQ T&);
2462 T operator++(VQ T&, int);
2463 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2464 type other than bool, and VQ is either volatile or empty, there exist
2465 candidate operator functions of the form
2466 VQ T& operator--(VQ T&);
2467 T operator--(VQ T&, int);
2468 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2469 complete object type, and VQ is either volatile or empty, there exist
2470 candidate operator functions of the form
2471 T*VQ& operator++(T*VQ&);
2472 T*VQ& operator--(T*VQ&);
2473 T* operator++(T*VQ&, int);
2474 T* operator--(T*VQ&, int); */
2476 case POSTDECREMENT_EXPR
:
2477 case PREDECREMENT_EXPR
:
2478 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2481 case POSTINCREMENT_EXPR
:
2482 case PREINCREMENT_EXPR
:
2483 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2485 type1
= build_reference_type (type1
);
2490 /* 7 For every cv-qualified or cv-unqualified object type T, there
2491 exist candidate operator functions of the form
2495 8 For every function type T, there exist candidate operator functions of
2497 T& operator*(T*); */
2500 if (TYPE_PTR_P (type1
)
2501 && (TYPE_PTROB_P (type1
)
2502 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2506 /* 9 For every type T, there exist candidate operator functions of the form
2509 10For every promoted arithmetic type T, there exist candidate operator
2510 functions of the form
2514 case UNARY_PLUS_EXPR
: /* unary + */
2515 if (TYPE_PTR_P (type1
))
2519 if (ARITHMETIC_TYPE_P (type1
))
2523 /* 11For every promoted integral type T, there exist candidate operator
2524 functions of the form
2528 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2532 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2533 is the same type as C2 or is a derived class of C2, T is a complete
2534 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2535 there exist candidate operator functions of the form
2536 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2537 where CV12 is the union of CV1 and CV2. */
2540 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2542 tree c1
= TREE_TYPE (type1
);
2543 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2545 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2546 && (TYPE_PTRMEMFUNC_P (type2
)
2547 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2552 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2553 didate operator functions of the form
2558 bool operator<(L, R);
2559 bool operator>(L, R);
2560 bool operator<=(L, R);
2561 bool operator>=(L, R);
2562 bool operator==(L, R);
2563 bool operator!=(L, R);
2564 where LR is the result of the usual arithmetic conversions between
2567 14For every pair of types T and I, where T is a cv-qualified or cv-
2568 unqualified complete object type and I is a promoted integral type,
2569 there exist candidate operator functions of the form
2570 T* operator+(T*, I);
2571 T& operator[](T*, I);
2572 T* operator-(T*, I);
2573 T* operator+(I, T*);
2574 T& operator[](I, T*);
2576 15For every T, where T is a pointer to complete object type, there exist
2577 candidate operator functions of the form112)
2578 ptrdiff_t operator-(T, T);
2580 16For every pointer or enumeration type T, there exist candidate operator
2581 functions of the form
2582 bool operator<(T, T);
2583 bool operator>(T, T);
2584 bool operator<=(T, T);
2585 bool operator>=(T, T);
2586 bool operator==(T, T);
2587 bool operator!=(T, T);
2589 17For every pointer to member type T, there exist candidate operator
2590 functions of the form
2591 bool operator==(T, T);
2592 bool operator!=(T, T); */
2595 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2597 if (TYPE_PTROB_P (type1
)
2598 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2600 type2
= ptrdiff_type_node
;
2605 case TRUNC_DIV_EXPR
:
2606 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2612 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2613 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2615 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2620 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2632 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2634 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2636 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2637 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2639 if (TYPE_PTR_P (type1
)
2640 && null_ptr_cst_p (args
[1]))
2645 if (null_ptr_cst_p (args
[0])
2646 && TYPE_PTR_P (type2
))
2654 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2658 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2660 type1
= ptrdiff_type_node
;
2663 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2665 type2
= ptrdiff_type_node
;
2670 /* 18For every pair of promoted integral types L and R, there exist candi-
2671 date operator functions of the form
2678 where LR is the result of the usual arithmetic conversions between
2681 case TRUNC_MOD_EXPR
:
2687 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2691 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2692 type, VQ is either volatile or empty, and R is a promoted arithmetic
2693 type, there exist candidate operator functions of the form
2694 VQ L& operator=(VQ L&, R);
2695 VQ L& operator*=(VQ L&, R);
2696 VQ L& operator/=(VQ L&, R);
2697 VQ L& operator+=(VQ L&, R);
2698 VQ L& operator-=(VQ L&, R);
2700 20For every pair T, VQ), where T is any type and VQ is either volatile
2701 or empty, there exist candidate operator functions of the form
2702 T*VQ& operator=(T*VQ&, T*);
2704 21For every pair T, VQ), where T is a pointer to member type and VQ is
2705 either volatile or empty, there exist candidate operator functions of
2707 VQ T& operator=(VQ T&, T);
2709 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2710 unqualified complete object type, VQ is either volatile or empty, and
2711 I is a promoted integral type, there exist candidate operator func-
2713 T*VQ& operator+=(T*VQ&, I);
2714 T*VQ& operator-=(T*VQ&, I);
2716 23For every triple L, VQ, R), where L is an integral or enumeration
2717 type, VQ is either volatile or empty, and R is a promoted integral
2718 type, there exist candidate operator functions of the form
2720 VQ L& operator%=(VQ L&, R);
2721 VQ L& operator<<=(VQ L&, R);
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); */
2732 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2734 type2
= ptrdiff_type_node
;
2739 case TRUNC_DIV_EXPR
:
2740 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2744 case TRUNC_MOD_EXPR
:
2750 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2755 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2757 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2758 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2759 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2760 || ((TYPE_PTRMEMFUNC_P (type1
)
2761 || TYPE_PTR_P (type1
))
2762 && null_ptr_cst_p (args
[1])))
2772 type1
= build_reference_type (type1
);
2778 For every pair of promoted arithmetic types L and R, there
2779 exist candidate operator functions of the form
2781 LR operator?(bool, L, R);
2783 where LR is the result of the usual arithmetic conversions
2784 between types L and R.
2786 For every type T, where T is a pointer or pointer-to-member
2787 type, there exist candidate operator functions of the form T
2788 operator?(bool, T, T); */
2790 if (promoted_arithmetic_type_p (type1
)
2791 && promoted_arithmetic_type_p (type2
))
2795 /* Otherwise, the types should be pointers. */
2796 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2799 /* We don't check that the two types are the same; the logic
2800 below will actually create two candidates; one in which both
2801 parameter types are TYPE1, and one in which both parameter
2807 if (ARITHMETIC_TYPE_P (type1
))
2815 /* Make sure we don't create builtin candidates with dependent types. */
2816 bool u1
= uses_template_parms (type1
);
2817 bool u2
= type2
? uses_template_parms (type2
) : false;
2820 /* Try to recover if one of the types is non-dependent. But if
2821 there's only one type, there's nothing we can do. */
2824 /* And we lose if both are dependent. */
2827 /* Or if they have different forms. */
2828 if (TREE_CODE (type1
) != TREE_CODE (type2
))
2837 /* If we're dealing with two pointer types or two enumeral types,
2838 we need candidates for both of them. */
2839 if (type2
&& !same_type_p (type1
, type2
)
2840 && TREE_CODE (type1
) == TREE_CODE (type2
)
2841 && (TREE_CODE (type1
) == REFERENCE_TYPE
2842 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2843 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2844 || TYPE_PTRMEMFUNC_P (type1
)
2845 || MAYBE_CLASS_TYPE_P (type1
)
2846 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2848 if (TYPE_PTR_OR_PTRMEM_P (type1
))
2850 tree cptype
= composite_pointer_type (type1
, type2
,
2855 if (cptype
!= error_mark_node
)
2857 build_builtin_candidate
2858 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
2864 build_builtin_candidate
2865 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
2866 build_builtin_candidate
2867 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
2871 build_builtin_candidate
2872 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
2876 type_decays_to (tree type
)
2878 if (TREE_CODE (type
) == ARRAY_TYPE
)
2879 return build_pointer_type (TREE_TYPE (type
));
2880 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2881 return build_pointer_type (type
);
2885 /* There are three conditions of builtin candidates:
2887 1) bool-taking candidates. These are the same regardless of the input.
2888 2) pointer-pair taking candidates. These are generated for each type
2889 one of the input types converts to.
2890 3) arithmetic candidates. According to the standard, we should generate
2891 all of these, but I'm trying not to...
2893 Here we generate a superset of the possible candidates for this particular
2894 case. That is a subset of the full set the standard defines, plus some
2895 other cases which the standard disallows. add_builtin_candidate will
2896 filter out the invalid set. */
2899 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2900 enum tree_code code2
, tree fnname
, tree
*args
,
2901 int flags
, tsubst_flags_t complain
)
2905 tree type
, argtypes
[3], t
;
2906 /* TYPES[i] is the set of possible builtin-operator parameter types
2907 we will consider for the Ith argument. */
2908 vec
<tree
, va_gc
> *types
[2];
2911 for (i
= 0; i
< 3; ++i
)
2914 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2916 argtypes
[i
] = NULL_TREE
;
2921 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2922 and VQ is either volatile or empty, there exist candidate operator
2923 functions of the form
2924 VQ T& operator++(VQ T&); */
2926 case POSTINCREMENT_EXPR
:
2927 case PREINCREMENT_EXPR
:
2928 case POSTDECREMENT_EXPR
:
2929 case PREDECREMENT_EXPR
:
2934 /* 24There also exist candidate operator functions of the form
2935 bool operator!(bool);
2936 bool operator&&(bool, bool);
2937 bool operator||(bool, bool); */
2939 case TRUTH_NOT_EXPR
:
2940 build_builtin_candidate
2941 (candidates
, fnname
, boolean_type_node
,
2942 NULL_TREE
, args
, argtypes
, flags
, complain
);
2945 case TRUTH_ORIF_EXPR
:
2946 case TRUTH_ANDIF_EXPR
:
2947 build_builtin_candidate
2948 (candidates
, fnname
, boolean_type_node
,
2949 boolean_type_node
, args
, argtypes
, flags
, complain
);
2971 types
[0] = make_tree_vector ();
2972 types
[1] = make_tree_vector ();
2974 for (i
= 0; i
< 2; ++i
)
2978 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
2982 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
2985 convs
= lookup_conversions (argtypes
[i
]);
2987 if (code
== COND_EXPR
)
2989 if (lvalue_p (args
[i
]))
2990 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
2992 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
2998 for (; convs
; convs
= TREE_CHAIN (convs
))
3000 type
= TREE_TYPE (convs
);
3003 && (TREE_CODE (type
) != REFERENCE_TYPE
3004 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
3007 if (code
== COND_EXPR
&& TREE_CODE (type
) == REFERENCE_TYPE
)
3008 vec_safe_push (types
[i
], type
);
3010 type
= non_reference (type
);
3011 if (i
!= 0 || ! ref1
)
3013 type
= cv_unqualified (type_decays_to (type
));
3014 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
3015 vec_safe_push (types
[i
], type
);
3016 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3017 type
= type_promotes_to (type
);
3020 if (! vec_member (type
, types
[i
]))
3021 vec_safe_push (types
[i
], type
);
3026 if (code
== COND_EXPR
&& lvalue_p (args
[i
]))
3027 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3028 type
= non_reference (argtypes
[i
]);
3029 if (i
!= 0 || ! ref1
)
3031 type
= cv_unqualified (type_decays_to (type
));
3032 if (enum_p
&& UNSCOPED_ENUM_P (type
))
3033 vec_safe_push (types
[i
], type
);
3034 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3035 type
= type_promotes_to (type
);
3037 vec_safe_push (types
[i
], type
);
3041 /* Run through the possible parameter types of both arguments,
3042 creating candidates with those parameter types. */
3043 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
3048 if (!types
[1]->is_empty ())
3049 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
3050 add_builtin_candidate
3051 (candidates
, code
, code2
, fnname
, t
,
3052 u
, args
, argtypes
, flags
, complain
);
3054 add_builtin_candidate
3055 (candidates
, code
, code2
, fnname
, t
,
3056 NULL_TREE
, args
, argtypes
, flags
, complain
);
3059 release_tree_vector (types
[0]);
3060 release_tree_vector (types
[1]);
3064 /* If TMPL can be successfully instantiated as indicated by
3065 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3067 TMPL is the template. EXPLICIT_TARGS are any explicit template
3068 arguments. ARGLIST is the arguments provided at the call-site.
3069 This does not change ARGLIST. The RETURN_TYPE is the desired type
3070 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3071 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3072 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3074 static struct z_candidate
*
3075 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
3076 tree ctype
, tree explicit_targs
, tree first_arg
,
3077 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3078 tree access_path
, tree conversion_path
,
3079 int flags
, tree obj
, unification_kind_t strict
,
3080 tsubst_flags_t complain
)
3082 int ntparms
= DECL_NTPARMS (tmpl
);
3083 tree targs
= make_tree_vec (ntparms
);
3084 unsigned int len
= vec_safe_length (arglist
);
3085 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
3086 unsigned int skip_without_in_chrg
= 0;
3087 tree first_arg_without_in_chrg
= first_arg
;
3088 tree
*args_without_in_chrg
;
3089 unsigned int nargs_without_in_chrg
;
3090 unsigned int ia
, ix
;
3092 struct z_candidate
*cand
;
3094 struct rejection_reason
*reason
= NULL
;
3097 /* We don't do deduction on the in-charge parameter, the VTT
3098 parameter or 'this'. */
3099 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
3101 if (first_arg_without_in_chrg
!= NULL_TREE
)
3102 first_arg_without_in_chrg
= NULL_TREE
;
3103 else if (return_type
&& strict
== DEDUCE_CALL
)
3104 /* We're deducing for a call to the result of a template conversion
3105 function, so the args don't contain 'this'; leave them alone. */;
3107 ++skip_without_in_chrg
;
3110 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
3111 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
3112 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
3114 if (first_arg_without_in_chrg
!= NULL_TREE
)
3115 first_arg_without_in_chrg
= NULL_TREE
;
3117 ++skip_without_in_chrg
;
3120 if (len
< skip_without_in_chrg
)
3123 if (DECL_CONSTRUCTOR_P (tmpl
) && nargs
== 2
3124 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg
),
3125 TREE_TYPE ((*arglist
)[0])))
3127 /* 12.8/6 says, "A declaration of a constructor for a class X is
3128 ill-formed if its first parameter is of type (optionally cv-qualified)
3129 X and either there are no other parameters or else all other
3130 parameters have default arguments. A member function template is never
3131 instantiated to produce such a constructor signature."
3133 So if we're trying to copy an object of the containing class, don't
3134 consider a template constructor that has a first parameter type that
3135 is just a template parameter, as we would deduce a signature that we
3136 would then reject in the code below. */
3137 if (tree firstparm
= FUNCTION_FIRST_USER_PARMTYPE (tmpl
))
3139 firstparm
= TREE_VALUE (firstparm
);
3140 if (PACK_EXPANSION_P (firstparm
))
3141 firstparm
= PACK_EXPANSION_PATTERN (firstparm
);
3142 if (TREE_CODE (firstparm
) == TEMPLATE_TYPE_PARM
)
3144 gcc_assert (!explicit_targs
);
3145 reason
= invalid_copy_with_fn_template_rejection ();
3151 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
3152 + (len
- skip_without_in_chrg
));
3153 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
3155 if (first_arg_without_in_chrg
!= NULL_TREE
)
3157 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
3160 for (ix
= skip_without_in_chrg
;
3161 vec_safe_iterate (arglist
, ix
, &arg
);
3164 args_without_in_chrg
[ia
] = arg
;
3167 gcc_assert (ia
== nargs_without_in_chrg
);
3169 errs
= errorcount
+sorrycount
;
3170 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
3171 args_without_in_chrg
,
3172 nargs_without_in_chrg
,
3173 return_type
, strict
, flags
, false,
3174 complain
& tf_decltype
);
3176 if (fn
== error_mark_node
)
3178 /* Don't repeat unification later if it already resulted in errors. */
3179 if (errorcount
+sorrycount
== errs
)
3180 reason
= template_unification_rejection (tmpl
, explicit_targs
,
3181 targs
, args_without_in_chrg
,
3182 nargs_without_in_chrg
,
3183 return_type
, strict
, flags
);
3185 reason
= template_unification_error_rejection ();
3189 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
3191 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
3192 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
3195 /* We're trying to produce a constructor with a prohibited signature,
3196 as discussed above; handle here any cases we didn't catch then,
3198 reason
= invalid_copy_with_fn_template_rejection ();
3203 if (obj
!= NULL_TREE
)
3204 /* Aha, this is a conversion function. */
3205 cand
= add_conv_candidate (candidates
, fn
, obj
, arglist
,
3206 access_path
, conversion_path
, complain
);
3208 cand
= add_function_candidate (candidates
, fn
, ctype
,
3209 first_arg
, arglist
, access_path
,
3210 conversion_path
, flags
, complain
);
3211 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
3212 /* This situation can occur if a member template of a template
3213 class is specialized. Then, instantiate_template might return
3214 an instantiation of the specialization, in which case the
3215 DECL_TI_TEMPLATE field will point at the original
3216 specialization. For example:
3218 template <class T> struct S { template <class U> void f(U);
3219 template <> void f(int) {}; };
3223 Here, TMPL will be template <class U> S<double>::f(U).
3224 And, instantiate template will give us the specialization
3225 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3226 for this will point at template <class T> template <> S<T>::f(int),
3227 so that we can find the definition. For the purposes of
3228 overload resolution, however, we want the original TMPL. */
3229 cand
->template_decl
= build_template_info (tmpl
, targs
);
3231 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3232 cand
->explicit_targs
= explicit_targs
;
3236 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3237 access_path
, conversion_path
, 0, reason
, flags
);
3241 static struct z_candidate
*
3242 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3243 tree explicit_targs
, tree first_arg
,
3244 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3245 tree access_path
, tree conversion_path
, int flags
,
3246 unification_kind_t strict
, tsubst_flags_t complain
)
3249 add_template_candidate_real (candidates
, tmpl
, ctype
,
3250 explicit_targs
, first_arg
, arglist
,
3251 return_type
, access_path
, conversion_path
,
3252 flags
, NULL_TREE
, strict
, complain
);
3255 /* Create an overload candidate for the conversion function template TMPL,
3256 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3257 pointer-to-function which will in turn be called with the argument list
3258 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3259 passed on to implicit_conversion. */
3261 static struct z_candidate
*
3262 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3264 const vec
<tree
, va_gc
> *arglist
,
3265 tree return_type
, tree access_path
,
3266 tree conversion_path
, tsubst_flags_t complain
)
3268 /* Making this work broke PR 71117, so until the committee resolves core
3269 issue 2189, let's disable this candidate if there are any viable call
3271 if (any_strictly_viable (*candidates
))
3275 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3276 NULL_TREE
, arglist
, return_type
, access_path
,
3277 conversion_path
, 0, obj
, DEDUCE_CALL
,
3281 /* The CANDS are the set of candidates that were considered for
3282 overload resolution. Return the set of viable candidates, or CANDS
3283 if none are viable. If any of the candidates were viable, set
3284 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3285 considered viable only if it is strictly viable. */
3287 static struct z_candidate
*
3288 splice_viable (struct z_candidate
*cands
,
3292 struct z_candidate
*viable
;
3293 struct z_candidate
**last_viable
;
3294 struct z_candidate
**cand
;
3295 bool found_strictly_viable
= false;
3297 /* Be strict inside templates, since build_over_call won't actually
3298 do the conversions to get pedwarns. */
3299 if (processing_template_decl
)
3303 last_viable
= &viable
;
3304 *any_viable_p
= false;
3309 struct z_candidate
*c
= *cand
;
3311 && (c
->viable
== 1 || TREE_CODE (c
->fn
) == TEMPLATE_DECL
))
3313 /* Be strict in the presence of a viable candidate. Also if
3314 there are template candidates, so that we get deduction errors
3315 for them instead of silently preferring a bad conversion. */
3317 if (viable
&& !found_strictly_viable
)
3319 /* Put any spliced near matches back onto the main list so
3320 that we see them if there is no strict match. */
3321 *any_viable_p
= false;
3322 *last_viable
= cands
;
3325 last_viable
= &viable
;
3329 if (strict_p
? c
->viable
== 1 : c
->viable
)
3334 last_viable
= &c
->next
;
3335 *any_viable_p
= true;
3337 found_strictly_viable
= true;
3343 return viable
? viable
: cands
;
3347 any_strictly_viable (struct z_candidate
*cands
)
3349 for (; cands
; cands
= cands
->next
)
3350 if (cands
->viable
== 1)
3355 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3356 words, it is about to become the "this" pointer for a member
3357 function call. Take the address of the object. */
3360 build_this (tree obj
)
3362 /* In a template, we are only concerned about the type of the
3363 expression, so we can take a shortcut. */
3364 if (processing_template_decl
)
3365 return build_address (obj
);
3367 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3370 /* Returns true iff functions are equivalent. Equivalent functions are
3371 not '==' only if one is a function-local extern function or if
3372 both are extern "C". */
3375 equal_functions (tree fn1
, tree fn2
)
3377 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3379 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3381 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3382 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3383 return decls_match (fn1
, fn2
);
3387 /* Print information about a candidate being rejected due to INFO. */
3390 print_conversion_rejection (location_t loc
, struct conversion_info
*info
)
3392 tree from
= info
->from
;
3394 from
= lvalue_type (from
);
3395 if (info
->n_arg
== -1)
3397 /* Conversion of implicit `this' argument failed. */
3398 if (!TYPE_P (info
->from
))
3399 /* A bad conversion for 'this' must be discarding cv-quals. */
3400 inform (loc
, " passing %qT as %<this%> "
3401 "argument discards qualifiers",
3404 inform (loc
, " no known conversion for implicit "
3405 "%<this%> parameter from %qH to %qI",
3406 from
, info
->to_type
);
3408 else if (!TYPE_P (info
->from
))
3410 if (info
->n_arg
>= 0)
3411 inform (loc
, " conversion of argument %d would be ill-formed:",
3413 perform_implicit_conversion (info
->to_type
, info
->from
,
3414 tf_warning_or_error
);
3416 else if (info
->n_arg
== -2)
3417 /* Conversion of conversion function return value failed. */
3418 inform (loc
, " no known conversion from %qH to %qI",
3419 from
, info
->to_type
);
3421 inform (loc
, " no known conversion for argument %d from %qH to %qI",
3422 info
->n_arg
+ 1, from
, info
->to_type
);
3425 /* Print information about a candidate with WANT parameters and we found
3429 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3431 inform_n (loc
, want
,
3432 " candidate expects %d argument, %d provided",
3433 " candidate expects %d arguments, %d provided",
3437 /* Print information about one overload candidate CANDIDATE. MSGSTR
3438 is the text to print before the candidate itself.
3440 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3441 to have been run through gettext by the caller. This wart makes
3442 life simpler in print_z_candidates and for the translators. */
3445 print_z_candidate (location_t loc
, const char *msgstr
,
3446 struct z_candidate
*candidate
)
3448 const char *msg
= (msgstr
== NULL
3450 : ACONCAT ((msgstr
, " ", NULL
)));
3451 tree fn
= candidate
->fn
;
3452 if (flag_new_inheriting_ctors
)
3453 fn
= strip_inheriting_ctors (fn
);
3454 location_t cloc
= location_of (fn
);
3456 if (identifier_p (fn
))
3459 if (candidate
->num_convs
== 3)
3460 inform (cloc
, "%s%<%D(%T, %T, %T)%> <built-in>", msg
, fn
,
3461 candidate
->convs
[0]->type
,
3462 candidate
->convs
[1]->type
,
3463 candidate
->convs
[2]->type
);
3464 else if (candidate
->num_convs
== 2)
3465 inform (cloc
, "%s%<%D(%T, %T)%> <built-in>", msg
, fn
,
3466 candidate
->convs
[0]->type
,
3467 candidate
->convs
[1]->type
);
3469 inform (cloc
, "%s%<%D(%T)%> <built-in>", msg
, fn
,
3470 candidate
->convs
[0]->type
);
3472 else if (TYPE_P (fn
))
3473 inform (cloc
, "%s%qT <conversion>", msg
, fn
);
3474 else if (candidate
->viable
== -1)
3475 inform (cloc
, "%s%#qD <near match>", msg
, fn
);
3476 else if (DECL_DELETED_FN (fn
))
3477 inform (cloc
, "%s%#qD <deleted>", msg
, fn
);
3479 inform (cloc
, "%s%#qD", msg
, fn
);
3480 if (fn
!= candidate
->fn
)
3482 cloc
= location_of (candidate
->fn
);
3483 inform (cloc
, " inherited here");
3485 /* Give the user some information about why this candidate failed. */
3486 if (candidate
->reason
!= NULL
)
3488 struct rejection_reason
*r
= candidate
->reason
;
3493 print_arity_information (cloc
, r
->u
.arity
.actual
,
3494 r
->u
.arity
.expected
);
3496 case rr_arg_conversion
:
3497 print_conversion_rejection (cloc
, &r
->u
.conversion
);
3499 case rr_bad_arg_conversion
:
3500 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
);
3502 case rr_explicit_conversion
:
3503 inform (cloc
, " return type %qT of explicit conversion function "
3504 "cannot be converted to %qT with a qualification "
3505 "conversion", r
->u
.conversion
.from
,
3506 r
->u
.conversion
.to_type
);
3508 case rr_template_conversion
:
3509 inform (cloc
, " conversion from return type %qT of template "
3510 "conversion function specialization to %qT is not an "
3511 "exact match", r
->u
.conversion
.from
,
3512 r
->u
.conversion
.to_type
);
3514 case rr_template_unification
:
3515 /* We use template_unification_error_rejection if unification caused
3516 actual non-SFINAE errors, in which case we don't need to repeat
3518 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3520 inform (cloc
, " substitution of deduced template arguments "
3521 "resulted in errors seen above");
3524 /* Re-run template unification with diagnostics. */
3525 inform (cloc
, " template argument deduction/substitution failed:");
3526 fn_type_unification (r
->u
.template_unification
.tmpl
,
3527 r
->u
.template_unification
.explicit_targs
,
3529 (r
->u
.template_unification
.num_targs
)),
3530 r
->u
.template_unification
.args
,
3531 r
->u
.template_unification
.nargs
,
3532 r
->u
.template_unification
.return_type
,
3533 r
->u
.template_unification
.strict
,
3534 r
->u
.template_unification
.flags
,
3537 case rr_invalid_copy
:
3539 " a constructor taking a single argument of its own "
3540 "class type is invalid");
3542 case rr_constraint_failure
:
3544 tree tmpl
= r
->u
.template_instantiation
.tmpl
;
3545 tree args
= r
->u
.template_instantiation
.targs
;
3546 diagnose_constraints (cloc
, tmpl
, args
);
3549 case rr_inherited_ctor
:
3550 inform (cloc
, " an inherited constructor is not a candidate for "
3551 "initialization from an expression of the same or derived "
3556 /* This candidate didn't have any issues or we failed to
3557 handle a particular code. Either way... */
3564 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3566 struct z_candidate
*cand1
;
3567 struct z_candidate
**cand2
;
3572 /* Remove non-viable deleted candidates. */
3574 for (cand2
= &cand1
; *cand2
; )
3576 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3577 && !(*cand2
)->viable
3578 && DECL_DELETED_FN ((*cand2
)->fn
))
3579 *cand2
= (*cand2
)->next
;
3581 cand2
= &(*cand2
)->next
;
3583 /* ...if there are any non-deleted ones. */
3587 /* There may be duplicates in the set of candidates. We put off
3588 checking this condition as long as possible, since we have no way
3589 to eliminate duplicates from a set of functions in less than n^2
3590 time. Now we are about to emit an error message, so it is more
3591 permissible to go slowly. */
3592 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3594 tree fn
= cand1
->fn
;
3595 /* Skip builtin candidates and conversion functions. */
3598 cand2
= &cand1
->next
;
3601 if (DECL_P ((*cand2
)->fn
)
3602 && equal_functions (fn
, (*cand2
)->fn
))
3603 *cand2
= (*cand2
)->next
;
3605 cand2
= &(*cand2
)->next
;
3609 for (; candidates
; candidates
= candidates
->next
)
3610 print_z_candidate (loc
, "candidate:", candidates
);
3613 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3614 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3615 the result of the conversion function to convert it to the final
3616 desired type. Merge the two sequences into a single sequence,
3617 and return the merged sequence. */
3620 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3623 bool bad
= user_seq
->bad_p
;
3625 gcc_assert (user_seq
->kind
== ck_user
);
3627 /* Find the end of the second conversion sequence. */
3628 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3630 /* The entire sequence is a user-conversion sequence. */
3631 (*t
)->user_conv_p
= true;
3636 /* Replace the identity conversion with the user conversion
3643 /* Handle overload resolution for initializing an object of class type from
3644 an initializer list. First we look for a suitable constructor that
3645 takes a std::initializer_list; if we don't find one, we then look for a
3646 non-list constructor.
3648 Parameters are as for add_candidates, except that the arguments are in
3649 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3650 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3653 add_list_candidates (tree fns
, tree first_arg
,
3654 const vec
<tree
, va_gc
> *args
, tree totype
,
3655 tree explicit_targs
, bool template_only
,
3656 tree conversion_path
, tree access_path
,
3658 struct z_candidate
**candidates
,
3659 tsubst_flags_t complain
)
3661 gcc_assert (*candidates
== NULL
);
3663 /* We're looking for a ctor for list-initialization. */
3664 flags
|= LOOKUP_LIST_INIT_CTOR
;
3665 /* And we don't allow narrowing conversions. We also use this flag to
3666 avoid the copy constructor call for copy-list-initialization. */
3667 flags
|= LOOKUP_NO_NARROWING
;
3669 unsigned nart
= num_artificial_parms_for (OVL_FIRST (fns
)) - 1;
3670 tree init_list
= (*args
)[nart
];
3672 /* Always use the default constructor if the list is empty (DR 990). */
3673 if (CONSTRUCTOR_NELTS (init_list
) == 0
3674 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3676 /* If the class has a list ctor, try passing the list as a single
3677 argument first, but only consider list ctors. */
3678 else if (TYPE_HAS_LIST_CTOR (totype
))
3680 flags
|= LOOKUP_LIST_ONLY
;
3681 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3682 explicit_targs
, template_only
, conversion_path
,
3683 access_path
, flags
, candidates
, complain
);
3684 if (any_strictly_viable (*candidates
))
3688 /* Expand the CONSTRUCTOR into a new argument vec. */
3689 vec
<tree
, va_gc
> *new_args
;
3690 vec_alloc (new_args
, nart
+ CONSTRUCTOR_NELTS (init_list
));
3691 for (unsigned i
= 0; i
< nart
; ++i
)
3692 new_args
->quick_push ((*args
)[i
]);
3693 for (unsigned i
= 0; i
< CONSTRUCTOR_NELTS (init_list
); ++i
)
3694 new_args
->quick_push (CONSTRUCTOR_ELT (init_list
, i
)->value
);
3696 /* We aren't looking for list-ctors anymore. */
3697 flags
&= ~LOOKUP_LIST_ONLY
;
3698 /* We allow more user-defined conversions within an init-list. */
3699 flags
&= ~LOOKUP_NO_CONVERSION
;
3701 add_candidates (fns
, first_arg
, new_args
, NULL_TREE
,
3702 explicit_targs
, template_only
, conversion_path
,
3703 access_path
, flags
, candidates
, complain
);
3706 /* Returns the best overload candidate to perform the requested
3707 conversion. This function is used for three the overloading situations
3708 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3709 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3710 per [dcl.init.ref], so we ignore temporary bindings. */
3712 static struct z_candidate
*
3713 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3714 tsubst_flags_t complain
)
3716 struct z_candidate
*candidates
, *cand
;
3718 tree ctors
= NULL_TREE
;
3719 tree conv_fns
= NULL_TREE
;
3720 conversion
*conv
= NULL
;
3721 tree first_arg
= NULL_TREE
;
3722 vec
<tree
, va_gc
> *args
= NULL
;
3729 fromtype
= TREE_TYPE (expr
);
3731 /* We represent conversion within a hierarchy using RVALUE_CONV and
3732 BASE_CONV, as specified by [over.best.ics]; these become plain
3733 constructor calls, as specified in [dcl.init]. */
3734 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3735 || !DERIVED_FROM_P (totype
, fromtype
));
3737 if (CLASS_TYPE_P (totype
))
3738 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3739 creating a garbage BASELINK; constructors can't be inherited. */
3740 ctors
= get_class_binding (totype
, complete_ctor_identifier
);
3742 /* FIXME P0135 doesn't say what to do in C++17 about list-initialization from
3743 a single element. For now, let's handle constructors as before and also
3744 consider conversion operators from the element. */
3745 if (cxx_dialect
>= cxx17
3746 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
3747 && CONSTRUCTOR_NELTS (expr
) == 1)
3748 fromtype
= TREE_TYPE (CONSTRUCTOR_ELT (expr
, 0)->value
);
3750 if (MAYBE_CLASS_TYPE_P (fromtype
))
3752 tree to_nonref
= non_reference (totype
);
3753 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3754 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3755 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3757 /* [class.conv.fct] A conversion function is never used to
3758 convert a (possibly cv-qualified) object to the (possibly
3759 cv-qualified) same object type (or a reference to it), to a
3760 (possibly cv-qualified) base class of that type (or a
3761 reference to it)... */
3764 conv_fns
= lookup_conversions (fromtype
);
3768 flags
|= LOOKUP_NO_CONVERSION
;
3769 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3770 flags
|= LOOKUP_NO_NARROWING
;
3772 /* It's OK to bind a temporary for converting constructor arguments, but
3773 not in converting the return value of a conversion operator. */
3774 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
3775 | (flags
& LOOKUP_NO_NARROWING
));
3776 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3780 int ctorflags
= flags
;
3782 first_arg
= build_dummy_object (totype
);
3784 /* We should never try to call the abstract or base constructor
3786 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors
))
3787 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors
)));
3789 args
= make_tree_vector_single (expr
);
3790 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3792 /* List-initialization. */
3793 add_list_candidates (ctors
, first_arg
, args
, totype
, NULL_TREE
,
3794 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3795 ctorflags
, &candidates
, complain
);
3799 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3800 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3801 ctorflags
, &candidates
, complain
);
3804 for (cand
= candidates
; cand
; cand
= cand
->next
)
3806 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3808 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3809 set, then this is copy-initialization. In that case, "The
3810 result of the call is then used to direct-initialize the
3811 object that is the destination of the copy-initialization."
3814 We represent this in the conversion sequence with an
3815 rvalue conversion, which means a constructor call. */
3816 if (TREE_CODE (totype
) != REFERENCE_TYPE
3817 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3819 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3825 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3826 /* FIXME see above about C++17. */
3827 first_arg
= CONSTRUCTOR_ELT (expr
, 0)->value
;
3832 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3834 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3835 struct z_candidate
*old_candidates
;
3837 /* If we are called to convert to a reference type, we are trying to
3838 find a direct binding, so don't even consider temporaries. If
3839 we don't find a direct binding, the caller will try again to
3840 look for a temporary binding. */
3841 if (TREE_CODE (totype
) == REFERENCE_TYPE
)
3842 convflags
|= LOOKUP_NO_TEMP_BIND
;
3844 old_candidates
= candidates
;
3845 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
3847 conversion_path
, TYPE_BINFO (fromtype
),
3848 flags
, &candidates
, complain
);
3850 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
3852 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
3854 = implicit_conversion (totype
,
3857 /*c_cast_p=*/false, convflags
,
3860 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3861 copy-initialization. In that case, "The result of the
3862 call is then used to direct-initialize the object that is
3863 the destination of the copy-initialization." [dcl.init]
3865 We represent this in the conversion sequence with an
3866 rvalue conversion, which means a constructor call. But
3867 don't add a second rvalue conversion if there's already
3868 one there. Which there really shouldn't be, but it's
3869 harmless since we'd add it here anyway. */
3870 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
3871 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3872 ics
= build_conv (ck_rvalue
, totype
, ics
);
3874 cand
->second_conv
= ics
;
3879 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -2,
3882 else if (DECL_NONCONVERTING_P (cand
->fn
)
3883 && ics
->rank
> cr_exact
)
3885 /* 13.3.1.5: For direct-initialization, those explicit
3886 conversion functions that are not hidden within S and
3887 yield type T or a type that can be converted to type T
3888 with a qualification conversion (4.4) are also candidate
3890 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3891 I've raised this issue with the committee. --jason 9/2011 */
3893 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
3895 else if (cand
->viable
== 1 && ics
->bad_p
)
3899 = bad_arg_conversion_rejection (NULL_TREE
, -2,
3902 else if (primary_template_specialization_p (cand
->fn
)
3903 && ics
->rank
> cr_exact
)
3905 /* 13.3.3.1.2: If the user-defined conversion is specified by
3906 a specialization of a conversion function template, the
3907 second standard conversion sequence shall have exact match
3910 cand
->reason
= template_conversion_rejection (rettype
, totype
);
3915 candidates
= splice_viable (candidates
, false, &any_viable_p
);
3919 release_tree_vector (args
);
3923 cand
= tourney (candidates
, complain
);
3926 if (complain
& tf_error
)
3928 error ("conversion from %qH to %qI is ambiguous",
3930 print_z_candidates (location_of (expr
), candidates
);
3933 cand
= candidates
; /* any one will do */
3934 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
3935 cand
->second_conv
->user_conv_p
= true;
3936 if (!any_strictly_viable (candidates
))
3937 cand
->second_conv
->bad_p
= true;
3938 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3939 ambiguous conversion is no worse than another user-defined
3946 if (!DECL_CONSTRUCTOR_P (cand
->fn
))
3947 convtype
= non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)));
3948 else if (cand
->second_conv
->kind
== ck_rvalue
)
3949 /* DR 5: [in the first step of copy-initialization]...if the function
3950 is a constructor, the call initializes a temporary of the
3951 cv-unqualified version of the destination type. */
3952 convtype
= cv_unqualified (totype
);
3955 /* Build the user conversion sequence. */
3959 build_identity_conv (TREE_TYPE (expr
), expr
));
3961 if (cand
->viable
== -1)
3964 /* Remember that this was a list-initialization. */
3965 if (flags
& LOOKUP_NO_NARROWING
)
3966 conv
->check_narrowing
= true;
3968 /* Combine it with the second conversion sequence. */
3969 cand
->second_conv
= merge_conversion_sequences (conv
,
3975 /* Wrapper for above. */
3978 build_user_type_conversion (tree totype
, tree expr
, int flags
,
3979 tsubst_flags_t complain
)
3981 struct z_candidate
*cand
;
3984 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
3985 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
3989 if (cand
->second_conv
->kind
== ck_ambig
)
3990 ret
= error_mark_node
;
3993 expr
= convert_like (cand
->second_conv
, expr
, complain
);
3994 ret
= convert_from_reference (expr
);
4000 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4004 /* Subroutine of convert_nontype_argument.
4006 EXPR is an expression used in a context that requires a converted
4007 constant-expression, such as a template non-type parameter. Do any
4008 necessary conversions (that are permitted for converted
4009 constant-expressions) to convert it to the desired type.
4011 If conversion is successful, returns the converted expression;
4012 otherwise, returns error_mark_node. */
4015 build_converted_constant_expr (tree type
, tree expr
, tsubst_flags_t complain
)
4020 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
4022 if (error_operand_p (expr
))
4023 return error_mark_node
;
4025 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4026 p
= conversion_obstack_alloc (0);
4028 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
4030 LOOKUP_IMPLICIT
, complain
);
4032 /* A converted constant expression of type T is an expression, implicitly
4033 converted to type T, where the converted expression is a constant
4034 expression and the implicit conversion sequence contains only
4036 * user-defined conversions,
4037 * lvalue-to-rvalue conversions (7.1),
4038 * array-to-pointer conversions (7.2),
4039 * function-to-pointer conversions (7.3),
4040 * qualification conversions (7.5),
4041 * integral promotions (7.6),
4042 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4043 * null pointer conversions (7.11) from std::nullptr_t,
4044 * null member pointer conversions (7.12) from std::nullptr_t, and
4045 * function pointer conversions (7.13),
4047 and where the reference binding (if any) binds directly. */
4049 for (conversion
*c
= conv
;
4050 conv
&& c
->kind
!= ck_identity
;
4051 c
= next_conversion (c
))
4055 /* A conversion function is OK. If it isn't constexpr, we'll
4056 complain later that the argument isn't constant. */
4058 /* The lvalue-to-rvalue conversion is OK. */
4060 /* Array-to-pointer and function-to-pointer. */
4062 /* Function pointer conversions. */
4064 /* Qualification conversions. */
4069 if (c
->need_temporary_p
)
4071 if (complain
& tf_error
)
4072 error_at (loc
, "initializing %qH with %qI in converted "
4073 "constant expression does not bind directly",
4074 type
, next_conversion (c
)->type
);
4083 t
= next_conversion (c
)->type
;
4084 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
)
4085 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
4086 /* Integral promotion or conversion. */
4088 if (NULLPTR_TYPE_P (t
))
4089 /* Conversion from nullptr to pointer or pointer-to-member. */
4092 if (complain
& tf_error
)
4093 error_at (loc
, "conversion from %qH to %qI in a "
4094 "converted constant expression", t
, type
);
4103 /* Avoid confusing convert_nontype_argument by introducing
4104 a redundant conversion to the same reference type. */
4105 if (conv
&& conv
->kind
== ck_ref_bind
4106 && REFERENCE_REF_P (expr
))
4108 tree ref
= TREE_OPERAND (expr
, 0);
4109 if (same_type_p (type
, TREE_TYPE (ref
)))
4114 expr
= convert_like (conv
, expr
, complain
);
4116 expr
= error_mark_node
;
4118 /* Free all the conversions we allocated. */
4119 obstack_free (&conversion_obstack
, p
);
4124 /* Do any initial processing on the arguments to a function call. */
4126 static vec
<tree
, va_gc
> *
4127 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
4132 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
4134 if (error_operand_p (arg
))
4136 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
4138 if (complain
& tf_error
)
4139 error ("invalid use of void expression");
4142 else if (invalid_nonstatic_memfn_p (input_location
, arg
, complain
))
4148 /* Perform overload resolution on FN, which is called with the ARGS.
4150 Return the candidate function selected by overload resolution, or
4151 NULL if the event that overload resolution failed. In the case
4152 that overload resolution fails, *CANDIDATES will be the set of
4153 candidates considered, and ANY_VIABLE_P will be set to true or
4154 false to indicate whether or not any of the candidates were
4157 The ARGS should already have gone through RESOLVE_ARGS before this
4158 function is called. */
4160 static struct z_candidate
*
4161 perform_overload_resolution (tree fn
,
4162 const vec
<tree
, va_gc
> *args
,
4163 struct z_candidate
**candidates
,
4164 bool *any_viable_p
, tsubst_flags_t complain
)
4166 struct z_candidate
*cand
;
4167 tree explicit_targs
;
4170 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4172 explicit_targs
= NULL_TREE
;
4176 *any_viable_p
= true;
4179 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4180 || TREE_CODE (fn
) == TEMPLATE_DECL
4181 || TREE_CODE (fn
) == OVERLOAD
4182 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
4184 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4186 explicit_targs
= TREE_OPERAND (fn
, 1);
4187 fn
= TREE_OPERAND (fn
, 0);
4191 /* Add the various candidate functions. */
4192 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
4193 explicit_targs
, template_only
,
4194 /*conversion_path=*/NULL_TREE
,
4195 /*access_path=*/NULL_TREE
,
4197 candidates
, complain
);
4199 *candidates
= splice_viable (*candidates
, false, any_viable_p
);
4201 cand
= tourney (*candidates
, complain
);
4205 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4209 /* Print an error message about being unable to build a call to FN with
4210 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4211 be located; CANDIDATES is a possibly empty list of such
4215 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
,
4216 struct z_candidate
*candidates
)
4218 tree targs
= NULL_TREE
;
4219 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4221 targs
= TREE_OPERAND (fn
, 1);
4222 fn
= TREE_OPERAND (fn
, 0);
4224 tree name
= OVL_NAME (fn
);
4225 location_t loc
= location_of (name
);
4227 name
= lookup_template_function (name
, targs
);
4229 if (!any_strictly_viable (candidates
))
4230 error_at (loc
, "no matching function for call to %<%D(%A)%>",
4231 name
, build_tree_list_vec (args
));
4233 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
4234 name
, build_tree_list_vec (args
));
4236 print_z_candidates (loc
, candidates
);
4239 /* Return an expression for a call to FN (a namespace-scope function,
4240 or a static member function) with the ARGS. This may change
4244 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
,
4245 tsubst_flags_t complain
)
4247 struct z_candidate
*candidates
, *cand
;
4252 if (args
!= NULL
&& *args
!= NULL
)
4254 *args
= resolve_args (*args
, complain
);
4256 return error_mark_node
;
4260 tm_malloc_replacement (fn
);
4262 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4263 p
= conversion_obstack_alloc (0);
4265 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
4270 if (complain
& tf_error
)
4272 // If there is a single (non-viable) function candidate,
4273 // let the error be diagnosed by cp_build_function_call_vec.
4274 if (!any_viable_p
&& candidates
&& ! candidates
->next
4275 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
4276 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
4278 // Otherwise, emit notes for non-viable candidates.
4279 print_error_for_call_failure (fn
, *args
, candidates
);
4281 result
= error_mark_node
;
4285 int flags
= LOOKUP_NORMAL
;
4286 /* If fn is template_id_expr, the call has explicit template arguments
4287 (e.g. func<int>(5)), communicate this info to build_over_call
4288 through flags so that later we can use it to decide whether to warn
4289 about peculiar null pointer conversion. */
4290 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4292 /* If overload resolution selects a specialization of a
4293 function concept for non-dependent template arguments,
4294 the expression is true if the constraints are satisfied
4295 and false otherwise.
4297 NOTE: This is an extension of Concepts Lite TS that
4298 allows constraints to be used in expressions. */
4299 if (flag_concepts
&& !processing_template_decl
)
4301 tree tmpl
= DECL_TI_TEMPLATE (cand
->fn
);
4302 tree targs
= DECL_TI_ARGS (cand
->fn
);
4303 tree decl
= DECL_TEMPLATE_RESULT (tmpl
);
4304 if (DECL_DECLARED_CONCEPT_P (decl
))
4305 return evaluate_function_concept (decl
, targs
);
4308 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4311 result
= build_over_call (cand
, flags
, complain
);
4314 /* Free all the conversions we allocated. */
4315 obstack_free (&conversion_obstack
, p
);
4320 /* Build a call to a global operator new. FNNAME is the name of the
4321 operator (either "operator new" or "operator new[]") and ARGS are
4322 the arguments provided. This may change ARGS. *SIZE points to the
4323 total number of bytes required by the allocation, and is updated if
4324 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4325 be used. If this function determines that no cookie should be
4326 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4327 is not NULL_TREE, it is evaluated before calculating the final
4328 array size, and if it fails, the array size is replaced with
4329 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4330 is non-NULL, it will be set, upon return, to the allocation
4334 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4335 tree
*size
, tree
*cookie_size
,
4336 tree align_arg
, tree size_check
,
4337 tree
*fn
, tsubst_flags_t complain
)
4339 tree original_size
= *size
;
4341 struct z_candidate
*candidates
;
4342 struct z_candidate
*cand
= NULL
;
4347 /* Set to (size_t)-1 if the size check fails. */
4348 if (size_check
!= NULL_TREE
)
4350 tree errval
= TYPE_MAX_VALUE (sizetype
);
4351 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4352 errval
= throw_bad_array_new_length ();
4353 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4354 original_size
, errval
);
4356 vec_safe_insert (*args
, 0, *size
);
4357 *args
= resolve_args (*args
, complain
);
4359 return error_mark_node
;
4365 If this lookup fails to find the name, or if the allocated type
4366 is not a class type, the allocation function's name is looked
4367 up in the global scope.
4369 we disregard block-scope declarations of "operator new". */
4370 fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/false, 0, 0);
4371 fns
= lookup_arg_dependent (fnname
, fns
, *args
);
4375 vec
<tree
, va_gc
>* align_args
4376 = vec_copy_and_insert (*args
, align_arg
, 1);
4377 cand
= perform_overload_resolution (fns
, align_args
, &candidates
,
4378 &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
;
4451 tree result
= NULL_TREE
;
4454 obj
= mark_lvalue_use (obj
);
4456 if (error_operand_p (obj
))
4457 return error_mark_node
;
4459 tree type
= TREE_TYPE (obj
);
4461 obj
= prep_operand (obj
);
4463 if (TYPE_PTRMEMFUNC_P (type
))
4465 if (complain
& tf_error
)
4466 /* It's no good looking for an overloaded operator() on a
4467 pointer-to-member-function. */
4468 error ("pointer-to-member function %qE cannot be called without "
4469 "an object; consider using %<.*%> or %<->*%>", obj
);
4470 return error_mark_node
;
4473 if (TYPE_BINFO (type
))
4475 fns
= lookup_fnfields (TYPE_BINFO (type
), call_op_identifier
, 1);
4476 if (fns
== error_mark_node
)
4477 return error_mark_node
;
4482 if (args
!= NULL
&& *args
!= NULL
)
4484 *args
= resolve_args (*args
, complain
);
4486 return error_mark_node
;
4489 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4490 p
= conversion_obstack_alloc (0);
4494 first_mem_arg
= obj
;
4496 add_candidates (BASELINK_FUNCTIONS (fns
),
4497 first_mem_arg
, *args
, NULL_TREE
,
4499 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4500 LOOKUP_NORMAL
, &candidates
, complain
);
4503 convs
= lookup_conversions (type
);
4505 for (; convs
; convs
= TREE_CHAIN (convs
))
4507 tree totype
= TREE_TYPE (convs
);
4509 if (TYPE_PTRFN_P (totype
)
4510 || TYPE_REFFN_P (totype
)
4511 || (TREE_CODE (totype
) == REFERENCE_TYPE
4512 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4513 for (ovl_iterator
iter (TREE_VALUE (convs
)); iter
; ++iter
)
4517 if (DECL_NONCONVERTING_P (fn
))
4520 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4521 add_template_conv_candidate
4522 (&candidates
, fn
, obj
, *args
, totype
,
4523 /*access_path=*/NULL_TREE
,
4524 /*conversion_path=*/NULL_TREE
, complain
);
4526 add_conv_candidate (&candidates
, fn
, obj
,
4527 *args
, /*conversion_path=*/NULL_TREE
,
4528 /*access_path=*/NULL_TREE
, complain
);
4532 /* Be strict here because if we choose a bad conversion candidate, the
4533 errors we get won't mention the call context. */
4534 candidates
= splice_viable (candidates
, true, &any_viable_p
);
4537 if (complain
& tf_error
)
4539 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4540 build_tree_list_vec (*args
));
4541 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4543 result
= error_mark_node
;
4547 cand
= tourney (candidates
, complain
);
4550 if (complain
& tf_error
)
4552 error ("call of %<(%T) (%A)%> is ambiguous",
4553 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4554 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4556 result
= error_mark_node
;
4558 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4559 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
)
4560 && DECL_OVERLOADED_OPERATOR_IS (cand
->fn
, CALL_EXPR
))
4561 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4564 if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
4565 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
,
4569 gcc_checking_assert (TYPE_P (cand
->fn
));
4570 obj
= convert_like (cand
->convs
[0], obj
, complain
);
4572 obj
= convert_from_reference (obj
);
4573 result
= cp_build_function_call_vec (obj
, args
, complain
);
4577 /* Free all the conversions we allocated. */
4578 obstack_free (&conversion_obstack
, p
);
4583 /* Wrapper for above. */
4586 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4589 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4590 ret
= build_op_call_1 (obj
, args
, complain
);
4591 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4595 /* Called by op_error to prepare format strings suitable for the error
4596 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4597 and a suffix (controlled by NTYPES). */
4600 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4604 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4605 : G_("no match for "), errmsg
, NULL
);
4608 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4609 else if (ntypes
== 2)
4610 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4612 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4618 op_error (location_t loc
, enum tree_code code
, enum tree_code code2
,
4619 tree arg1
, tree arg2
, tree arg3
, bool match
)
4621 bool assop
= code
== MODIFY_EXPR
;
4622 const char *opname
= OVL_OP_INFO (assop
, assop
? code2
: 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 || maybe_ne (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 ovl_op_identifier (false, 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 && (complain
& tf_warning
)
5351 && (arg2
== arg3
|| operand_equal_p (arg2
, arg3
, 0)))
5352 warning_at (EXPR_LOCATION (result
), OPT_Wduplicated_branches
,
5353 "this condition has identical branches");
5355 /* We can't use result_type below, as fold might have returned a
5360 /* Expand both sides into the same slot, hopefully the target of
5361 the ?: expression. We used to check for TARGET_EXPRs here,
5362 but now we sometimes wrap them in NOP_EXPRs so the test would
5364 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5365 result
= get_target_expr_sfinae (result
, complain
);
5366 /* If this expression is an rvalue, but might be mistaken for an
5367 lvalue, we must add a NON_LVALUE_EXPR. */
5368 result
= rvalue (result
);
5371 result
= force_paren_expr (result
);
5376 /* Wrapper for above. */
5379 build_conditional_expr (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
5380 tsubst_flags_t complain
)
5383 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5384 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5385 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5389 /* OPERAND is an operand to an expression. Perform necessary steps
5390 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5394 prep_operand (tree operand
)
5398 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5399 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5400 /* Make sure the template type is instantiated now. */
5401 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5407 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5408 OVERLOAD) to the CANDIDATES, returning an updated list of
5409 CANDIDATES. The ARGS are the arguments provided to the call;
5410 if FIRST_ARG is non-null it is the implicit object argument,
5411 otherwise the first element of ARGS is used if needed. The
5412 EXPLICIT_TARGS are explicit template arguments provided.
5413 TEMPLATE_ONLY is true if only template functions should be
5414 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5415 add_function_candidate. */
5418 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5420 tree explicit_targs
, bool template_only
,
5421 tree conversion_path
, tree access_path
,
5423 struct z_candidate
**candidates
,
5424 tsubst_flags_t complain
)
5427 const vec
<tree
, va_gc
> *non_static_args
;
5428 bool check_list_ctor
= false;
5429 bool check_converting
= false;
5430 unification_kind_t strict
;
5435 /* Precalculate special handling of constructors and conversion ops. */
5436 tree fn
= OVL_FIRST (fns
);
5437 if (DECL_CONV_FN_P (fn
))
5439 check_list_ctor
= false;
5440 check_converting
= (flags
& LOOKUP_ONLYCONVERTING
) != 0;
5441 if (flags
& LOOKUP_NO_CONVERSION
)
5442 /* We're doing return_type(x). */
5443 strict
= DEDUCE_CONV
;
5445 /* We're doing x.operator return_type(). */
5446 strict
= DEDUCE_EXACT
;
5447 /* [over.match.funcs] For conversion functions, the function
5448 is considered to be a member of the class of the implicit
5449 object argument for the purpose of defining the type of
5450 the implicit object parameter. */
5451 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5455 if (DECL_CONSTRUCTOR_P (fn
))
5457 check_list_ctor
= (flags
& LOOKUP_LIST_ONLY
) != 0;
5458 /* For list-initialization we consider explicit constructors
5459 and complain if one is chosen. */
5461 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5462 == LOOKUP_ONLYCONVERTING
);
5464 strict
= DEDUCE_CALL
;
5465 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5469 non_static_args
= args
;
5471 /* Delay creating the implicit this parameter until it is needed. */
5472 non_static_args
= NULL
;
5474 for (lkp_iterator
iter (fns
); iter
; ++iter
)
5478 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5480 if (check_list_ctor
&& !is_list_ctor (fn
))
5483 tree fn_first_arg
= NULL_TREE
;
5484 const vec
<tree
, va_gc
> *fn_args
= args
;
5486 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5488 /* Figure out where the object arg comes from. If this
5489 function is a non-static member and we didn't get an
5490 implicit object argument, move it out of args. */
5491 if (first_arg
== NULL_TREE
)
5495 vec
<tree
, va_gc
> *tempvec
;
5496 vec_alloc (tempvec
, args
->length () - 1);
5497 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5498 tempvec
->quick_push (arg
);
5499 non_static_args
= tempvec
;
5500 first_arg
= (*args
)[0];
5503 fn_first_arg
= first_arg
;
5504 fn_args
= non_static_args
;
5507 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5508 add_template_candidate (candidates
,
5520 else if (!template_only
)
5521 add_function_candidate (candidates
,
5533 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5534 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5537 op_is_ordered (tree_code code
)
5543 return (flag_strong_eval_order
> 1 ? -1 : 0);
5547 return (flag_strong_eval_order
> 1 ? 1 : 0);
5550 // Not overloadable (yet).
5552 // Only one argument.
5559 return (flag_strong_eval_order
? 1 : 0);
5567 build_new_op_1 (location_t loc
, enum tree_code code
, int flags
, tree arg1
,
5568 tree arg2
, tree arg3
, tree
*overload
, tsubst_flags_t complain
)
5570 struct z_candidate
*candidates
= 0, *cand
;
5571 vec
<tree
, va_gc
> *arglist
;
5573 tree result
= NULL_TREE
;
5574 bool result_valid_p
= false;
5575 enum tree_code code2
= NOP_EXPR
;
5576 enum tree_code code_orig_arg1
= ERROR_MARK
;
5577 enum tree_code code_orig_arg2
= ERROR_MARK
;
5583 if (error_operand_p (arg1
)
5584 || error_operand_p (arg2
)
5585 || error_operand_p (arg3
))
5586 return error_mark_node
;
5588 bool ismodop
= code
== MODIFY_EXPR
;
5591 code2
= TREE_CODE (arg3
);
5594 tree fnname
= ovl_op_identifier (ismodop
, ismodop
? code2
: code
);
5596 arg1
= prep_operand (arg1
);
5598 bool memonly
= false;
5603 case VEC_DELETE_EXPR
:
5605 /* Use build_op_new_call and build_op_delete_call instead. */
5609 /* Use build_op_call instead. */
5612 case TRUTH_ORIF_EXPR
:
5613 case TRUTH_ANDIF_EXPR
:
5614 case TRUTH_AND_EXPR
:
5616 /* These are saved for the sake of warn_logical_operator. */
5617 code_orig_arg1
= TREE_CODE (arg1
);
5618 code_orig_arg2
= TREE_CODE (arg2
);
5626 /* These are saved for the sake of maybe_warn_bool_compare. */
5627 code_orig_arg1
= TREE_CODE (TREE_TYPE (arg1
));
5628 code_orig_arg2
= TREE_CODE (TREE_TYPE (arg2
));
5631 /* =, ->, [], () must be non-static member functions. */
5633 if (code2
!= NOP_EXPR
)
5645 arg2
= prep_operand (arg2
);
5646 arg3
= prep_operand (arg3
);
5648 if (code
== COND_EXPR
)
5649 /* Use build_conditional_expr instead. */
5651 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5652 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5655 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5656 arg2
= integer_zero_node
;
5658 vec_alloc (arglist
, 3);
5659 arglist
->quick_push (arg1
);
5660 if (arg2
!= NULL_TREE
)
5661 arglist
->quick_push (arg2
);
5662 if (arg3
!= NULL_TREE
)
5663 arglist
->quick_push (arg3
);
5665 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5666 p
= conversion_obstack_alloc (0);
5668 /* Add namespace-scope operators to the list of functions to
5672 tree fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/true, 0, 0);
5673 fns
= lookup_arg_dependent (fnname
, fns
, arglist
);
5674 add_candidates (fns
, NULL_TREE
, arglist
, NULL_TREE
,
5675 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5676 flags
, &candidates
, complain
);
5681 args
[2] = NULL_TREE
;
5683 /* Add class-member operators to the candidate set. */
5684 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5688 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5689 if (fns
== error_mark_node
)
5691 result
= error_mark_node
;
5692 goto user_defined_result_ready
;
5695 add_candidates (BASELINK_FUNCTIONS (fns
),
5696 NULL_TREE
, arglist
, NULL_TREE
,
5698 BASELINK_BINFO (fns
),
5699 BASELINK_ACCESS_BINFO (fns
),
5700 flags
, &candidates
, complain
);
5702 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5703 only non-member functions that have type T1 or reference to
5704 cv-qualified-opt T1 for the first argument, if the first argument
5705 has an enumeration type, or T2 or reference to cv-qualified-opt
5706 T2 for the second argument, if the second argument has an
5707 enumeration type. Filter out those that don't match. */
5708 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5710 struct z_candidate
**candp
, **next
;
5712 for (candp
= &candidates
; *candp
; candp
= next
)
5714 tree parmlist
, parmtype
;
5715 int i
, nargs
= (arg2
? 2 : 1);
5720 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5722 for (i
= 0; i
< nargs
; ++i
)
5724 parmtype
= TREE_VALUE (parmlist
);
5726 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
5727 parmtype
= TREE_TYPE (parmtype
);
5728 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5729 && (same_type_ignoring_top_level_qualifiers_p
5730 (TREE_TYPE (args
[i
]), parmtype
)))
5733 parmlist
= TREE_CHAIN (parmlist
);
5736 /* No argument has an appropriate type, so remove this
5737 candidate function from the list. */
5740 *candp
= cand
->next
;
5746 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5753 /* For these, the built-in candidates set is empty
5754 [over.match.oper]/3. We don't want non-strict matches
5755 because exact matches are always possible with built-in
5756 operators. The built-in candidate set for COMPONENT_REF
5757 would be empty too, but since there are no such built-in
5758 operators, we accept non-strict matches for them. */
5767 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5772 case POSTINCREMENT_EXPR
:
5773 case POSTDECREMENT_EXPR
:
5774 /* Don't try anything fancy if we're not allowed to produce
5776 if (!(complain
& tf_error
))
5777 return error_mark_node
;
5779 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5780 distinguish between prefix and postfix ++ and
5781 operator++() was used for both, so we allow this with
5785 const char *msg
= (flag_permissive
)
5786 ? G_("no %<%D(int)%> declared for postfix %qs,"
5787 " trying prefix operator instead")
5788 : G_("no %<%D(int)%> declared for postfix %qs");
5789 permerror (loc
, msg
, fnname
, OVL_OP_INFO (false, code
)->name
);
5792 if (!flag_permissive
)
5793 return error_mark_node
;
5795 if (code
== POSTINCREMENT_EXPR
)
5796 code
= PREINCREMENT_EXPR
;
5798 code
= PREDECREMENT_EXPR
;
5799 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5800 NULL_TREE
, overload
, complain
);
5803 /* The caller will deal with these. */
5808 result_valid_p
= true;
5812 if (complain
& tf_error
)
5814 /* If one of the arguments of the operator represents
5815 an invalid use of member function pointer, try to report
5816 a meaningful error ... */
5817 if (invalid_nonstatic_memfn_p (loc
, arg1
, tf_error
)
5818 || invalid_nonstatic_memfn_p (loc
, arg2
, tf_error
)
5819 || invalid_nonstatic_memfn_p (loc
, arg3
, tf_error
))
5820 /* We displayed the error message. */;
5823 /* ... Otherwise, report the more generic
5824 "no matching operator found" error */
5825 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
5826 print_z_candidates (loc
, candidates
);
5829 result
= error_mark_node
;
5835 cand
= tourney (candidates
, complain
);
5838 if (complain
& tf_error
)
5840 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
5841 print_z_candidates (loc
, candidates
);
5843 result
= error_mark_node
;
5845 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
5848 *overload
= cand
->fn
;
5850 if (resolve_args (arglist
, complain
) == NULL
)
5851 result
= error_mark_node
;
5853 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5855 if (trivial_fn_p (cand
->fn
))
5856 /* There won't be a CALL_EXPR. */;
5857 else if (result
&& result
!= error_mark_node
)
5859 tree call
= extract_call_expr (result
);
5860 CALL_EXPR_OPERATOR_SYNTAX (call
) = true;
5862 if (processing_template_decl
&& DECL_HIDDEN_FRIEND_P (cand
->fn
))
5863 /* This prevents build_new_function_call from discarding this
5864 function during instantiation of the enclosing template. */
5865 KOENIG_LOOKUP_P (call
) = 1;
5867 /* Specify evaluation order as per P0145R2. */
5868 CALL_EXPR_ORDERED_ARGS (call
) = false;
5869 switch (op_is_ordered (code
))
5872 CALL_EXPR_REVERSE_ARGS (call
) = true;
5876 CALL_EXPR_ORDERED_ARGS (call
) = true;
5886 /* Give any warnings we noticed during overload resolution. */
5887 if (cand
->warnings
&& (complain
& tf_warning
))
5889 struct candidate_warning
*w
;
5890 for (w
= cand
->warnings
; w
; w
= w
->next
)
5891 joust (cand
, w
->loser
, 1, complain
);
5894 /* Check for comparison of different enum types. */
5903 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
5904 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
5905 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
5906 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
5907 && (complain
& tf_warning
))
5909 warning (OPT_Wenum_compare
,
5910 "comparison between %q#T and %q#T",
5911 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
5918 /* We need to strip any leading REF_BIND so that bitfields
5919 don't cause errors. This should not remove any important
5920 conversions, because builtins don't apply to class
5921 objects directly. */
5922 conv
= cand
->convs
[0];
5923 if (conv
->kind
== ck_ref_bind
)
5924 conv
= next_conversion (conv
);
5925 arg1
= convert_like (conv
, arg1
, complain
);
5929 conv
= cand
->convs
[1];
5930 if (conv
->kind
== ck_ref_bind
)
5931 conv
= next_conversion (conv
);
5933 arg2
= decay_conversion (arg2
, complain
);
5935 /* We need to call warn_logical_operator before
5936 converting arg2 to a boolean_type, but after
5937 decaying an enumerator to its value. */
5938 if (complain
& tf_warning
)
5939 warn_logical_operator (loc
, code
, boolean_type_node
,
5940 code_orig_arg1
, arg1
,
5941 code_orig_arg2
, arg2
);
5943 arg2
= convert_like (conv
, arg2
, complain
);
5947 conv
= cand
->convs
[2];
5948 if (conv
->kind
== ck_ref_bind
)
5949 conv
= next_conversion (conv
);
5950 arg3
= convert_like (conv
, arg3
, complain
);
5956 user_defined_result_ready
:
5958 /* Free all the conversions we allocated. */
5959 obstack_free (&conversion_obstack
, p
);
5961 if (result
|| result_valid_p
)
5968 return cp_build_modify_expr (loc
, arg1
, code2
, arg2
, complain
);
5971 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
5973 case TRUTH_ANDIF_EXPR
:
5974 case TRUTH_ORIF_EXPR
:
5975 case TRUTH_AND_EXPR
:
5977 if (complain
& tf_warning
)
5978 warn_logical_operator (loc
, code
, boolean_type_node
,
5979 code_orig_arg1
, arg1
,
5980 code_orig_arg2
, arg2
);
5988 if ((complain
& tf_warning
)
5989 && ((code_orig_arg1
== BOOLEAN_TYPE
)
5990 ^ (code_orig_arg2
== BOOLEAN_TYPE
)))
5991 maybe_warn_bool_compare (loc
, code
, arg1
, arg2
);
5992 if (complain
& tf_warning
&& warn_tautological_compare
)
5993 warn_tautological_cmp (loc
, code
, arg1
, arg2
);
5998 case TRUNC_DIV_EXPR
:
6003 case TRUNC_MOD_EXPR
:
6007 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
6009 case UNARY_PLUS_EXPR
:
6012 case TRUTH_NOT_EXPR
:
6013 case PREINCREMENT_EXPR
:
6014 case POSTINCREMENT_EXPR
:
6015 case PREDECREMENT_EXPR
:
6016 case POSTDECREMENT_EXPR
:
6020 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
6023 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
6026 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
6030 /* The caller will deal with these. */
6042 /* Wrapper for above. */
6045 build_new_op (location_t loc
, enum tree_code code
, int flags
,
6046 tree arg1
, tree arg2
, tree arg3
,
6047 tree
*overload
, tsubst_flags_t complain
)
6050 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
6051 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
6052 overload
, complain
);
6053 timevar_cond_stop (TV_OVERLOAD
, subtime
);
6057 /* CALL was returned by some call-building function; extract the actual
6058 CALL_EXPR from any bits that have been tacked on, e.g. by
6059 convert_from_reference. */
6062 extract_call_expr (tree call
)
6064 while (TREE_CODE (call
) == COMPOUND_EXPR
)
6065 call
= TREE_OPERAND (call
, 1);
6066 if (REFERENCE_REF_P (call
))
6067 call
= TREE_OPERAND (call
, 0);
6068 if (TREE_CODE (call
) == TARGET_EXPR
)
6069 call
= TARGET_EXPR_INITIAL (call
);
6070 gcc_assert (TREE_CODE (call
) == CALL_EXPR
6071 || TREE_CODE (call
) == AGGR_INIT_EXPR
6072 || call
== error_mark_node
);
6076 /* Returns true if FN has two parameters, of which the second has type
6080 second_parm_is_size_t (tree fn
)
6082 tree t
= FUNCTION_ARG_CHAIN (fn
);
6083 if (!t
|| !same_type_p (TREE_VALUE (t
), size_type_node
))
6086 if (t
== void_list_node
)
6088 if (aligned_new_threshold
&& t
6089 && same_type_p (TREE_VALUE (t
), align_type_node
)
6090 && TREE_CHAIN (t
) == void_list_node
)
6095 /* True if T, an allocation function, has std::align_val_t as its second
6099 aligned_allocation_fn_p (tree t
)
6101 if (!aligned_new_threshold
)
6104 tree a
= FUNCTION_ARG_CHAIN (t
);
6105 return (a
&& same_type_p (TREE_VALUE (a
), align_type_node
));
6108 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6109 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6110 std::align_val_t. */
6113 aligned_deallocation_fn_p (tree t
)
6115 if (!aligned_new_threshold
)
6118 /* A template instance is never a usual deallocation function,
6119 regardless of its signature. */
6120 if (TREE_CODE (t
) == TEMPLATE_DECL
6121 || primary_template_specialization_p (t
))
6124 tree a
= FUNCTION_ARG_CHAIN (t
);
6125 if (same_type_p (TREE_VALUE (a
), align_type_node
)
6126 && TREE_CHAIN (a
) == void_list_node
)
6128 if (!same_type_p (TREE_VALUE (a
), size_type_node
))
6131 if (a
&& same_type_p (TREE_VALUE (a
), align_type_node
)
6132 && TREE_CHAIN (a
) == void_list_node
)
6137 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6138 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6141 usual_deallocation_fn_p (tree t
)
6143 /* A template instance is never a usual deallocation function,
6144 regardless of its signature. */
6145 if (TREE_CODE (t
) == TEMPLATE_DECL
6146 || primary_template_specialization_p (t
))
6149 /* If a class T has a member deallocation function named operator delete
6150 with exactly one parameter, then that function is a usual
6151 (non-placement) deallocation function. If class T does not declare
6152 such an operator delete but does declare a member deallocation
6153 function named operator delete with exactly two parameters, the second
6154 of which has type std::size_t (18.2), then this function is a usual
6155 deallocation function. */
6156 bool global
= DECL_NAMESPACE_SCOPE_P (t
);
6157 tree chain
= FUNCTION_ARG_CHAIN (t
);
6160 if (chain
== void_list_node
6161 || ((!global
|| flag_sized_deallocation
)
6162 && second_parm_is_size_t (t
)))
6164 if (aligned_deallocation_fn_p (t
))
6169 /* Build a call to operator delete. This has to be handled very specially,
6170 because the restrictions on what signatures match are different from all
6171 other call instances. For a normal delete, only a delete taking (void *)
6172 or (void *, size_t) is accepted. For a placement delete, only an exact
6173 match with the placement new is accepted.
6175 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6176 ADDR is the pointer to be deleted.
6177 SIZE is the size of the memory block to be deleted.
6178 GLOBAL_P is true if the delete-expression should not consider
6179 class-specific delete operators.
6180 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6182 If this call to "operator delete" is being generated as part to
6183 deallocate memory allocated via a new-expression (as per [expr.new]
6184 which requires that if the initialization throws an exception then
6185 we call a deallocation function), then ALLOC_FN is the allocation
6189 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
6190 bool global_p
, tree placement
,
6191 tree alloc_fn
, tsubst_flags_t complain
)
6193 tree fn
= NULL_TREE
;
6194 tree fns
, fnname
, type
, t
;
6196 if (addr
== error_mark_node
)
6197 return error_mark_node
;
6199 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
6201 fnname
= ovl_op_identifier (false, code
);
6203 if (CLASS_TYPE_P (type
)
6204 && COMPLETE_TYPE_P (complete_type (type
))
6208 If the result of the lookup is ambiguous or inaccessible, or if
6209 the lookup selects a placement deallocation function, the
6210 program is ill-formed.
6212 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6214 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
6215 if (fns
== error_mark_node
)
6216 return error_mark_node
;
6221 if (fns
== NULL_TREE
)
6222 fns
= lookup_name_nonclass (fnname
);
6224 /* Strip const and volatile from addr. */
6225 addr
= cp_convert (ptr_type_node
, addr
, complain
);
6229 /* "A declaration of a placement deallocation function matches the
6230 declaration of a placement allocation function if it has the same
6231 number of parameters and, after parameter transformations (8.3.5),
6232 all parameter types except the first are identical."
6234 So we build up the function type we want and ask instantiate_type
6235 to get it for us. */
6236 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
6237 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
6238 t
= build_function_type (void_type_node
, t
);
6240 fn
= instantiate_type (t
, fns
, tf_none
);
6241 if (fn
== error_mark_node
)
6244 fn
= MAYBE_BASELINK_FUNCTIONS (fn
);
6246 /* "If the lookup finds the two-parameter form of a usual deallocation
6247 function (3.7.4.2) and that function, considered as a placement
6248 deallocation function, would have been selected as a match for the
6249 allocation function, the program is ill-formed." */
6250 if (second_parm_is_size_t (fn
))
6252 const char *const msg1
6253 = G_("exception cleanup for this placement new selects "
6254 "non-placement operator delete");
6255 const char *const msg2
6256 = G_("%qD is a usual (non-placement) deallocation "
6257 "function in C++14 (or with -fsized-deallocation)");
6259 /* But if the class has an operator delete (void *), then that is
6260 the usual deallocation function, so we shouldn't complain
6261 about using the operator delete (void *, size_t). */
6262 if (DECL_CLASS_SCOPE_P (fn
))
6263 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
));
6267 if (usual_deallocation_fn_p (elt
)
6268 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
6271 /* Before C++14 a two-parameter global deallocation function is
6272 always a placement deallocation function, but warn if
6274 else if (!flag_sized_deallocation
)
6276 if ((complain
& tf_warning
)
6277 && warning (OPT_Wc__14_compat
, msg1
))
6278 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6282 if (complain
& tf_warning_or_error
)
6284 if (permerror (input_location
, msg1
))
6286 /* Only mention C++14 for namespace-scope delete. */
6287 if (DECL_NAMESPACE_SCOPE_P (fn
))
6288 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6290 inform (DECL_SOURCE_LOCATION (fn
),
6291 "%qD is a usual (non-placement) deallocation "
6296 return error_mark_node
;
6301 /* "Any non-placement deallocation function matches a non-placement
6302 allocation function. If the lookup finds a single matching
6303 deallocation function, that function will be called; otherwise, no
6304 deallocation function will be called." */
6305 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
)); iter
; ++iter
)
6308 if (usual_deallocation_fn_p (elt
))
6316 /* -- If the type has new-extended alignment, a function with a
6317 parameter of type std::align_val_t is preferred; otherwise a
6318 function without such a parameter is preferred. If exactly one
6319 preferred function is found, that function is selected and the
6320 selection process terminates. If more than one preferred
6321 function is found, all non-preferred functions are eliminated
6322 from further consideration. */
6323 if (aligned_new_threshold
)
6325 bool want_align
= type_has_new_extended_alignment (type
);
6326 bool fn_align
= aligned_deallocation_fn_p (fn
);
6327 bool elt_align
= aligned_deallocation_fn_p (elt
);
6329 if (elt_align
!= fn_align
)
6331 if (want_align
== elt_align
)
6337 /* -- If the deallocation functions have class scope, the one
6338 without a parameter of type std::size_t is selected. */
6340 if (DECL_CLASS_SCOPE_P (fn
))
6343 /* -- If the type is complete and if, for the second alternative
6344 (delete array) only, the operand is a pointer to a class type
6345 with a non-trivial destructor or a (possibly multi-dimensional)
6346 array thereof, the function with a parameter of type std::size_t
6349 -- Otherwise, it is unspecified whether a deallocation function
6350 with a parameter of type std::size_t is selected. */
6353 want_size
= COMPLETE_TYPE_P (type
);
6354 if (code
== VEC_DELETE_EXPR
6355 && !TYPE_VEC_NEW_USES_COOKIE (type
))
6356 /* We need a cookie to determine the array size. */
6359 bool fn_size
= second_parm_is_size_t (fn
);
6360 bool elt_size
= second_parm_is_size_t (elt
);
6361 gcc_assert (fn_size
!= elt_size
);
6362 if (want_size
== elt_size
)
6367 /* If we have a matching function, call it. */
6370 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6372 /* If the FN is a member function, make sure that it is
6374 if (BASELINK_P (fns
))
6375 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
6378 /* Core issue 901: It's ok to new a type with deleted delete. */
6379 if (DECL_DELETED_FN (fn
) && alloc_fn
)
6384 /* The placement args might not be suitable for overload
6385 resolution at this point, so build the call directly. */
6386 int nargs
= call_expr_nargs (placement
);
6387 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
6390 for (i
= 1; i
< nargs
; i
++)
6391 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
6392 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
6393 return error_mark_node
;
6394 return build_cxx_call (fn
, nargs
, argarray
, complain
);
6399 vec
<tree
, va_gc
> *args
= make_tree_vector ();
6400 args
->quick_push (addr
);
6401 if (second_parm_is_size_t (fn
))
6402 args
->quick_push (size
);
6403 if (aligned_deallocation_fn_p (fn
))
6405 tree al
= build_int_cst (align_type_node
, TYPE_ALIGN_UNIT (type
));
6406 args
->quick_push (al
);
6408 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
6409 release_tree_vector (args
);
6416 If no unambiguous matching deallocation function can be found,
6417 propagating the exception does not cause the object's memory to
6421 if ((complain
& tf_warning
)
6423 warning (0, "no corresponding deallocation function for %qD",
6428 if (complain
& tf_error
)
6429 error ("no suitable %<operator %s%> for %qT",
6430 OVL_OP_INFO (false, code
)->name
, type
);
6431 return error_mark_node
;
6434 /* If the current scope isn't allowed to access DECL along
6435 BASETYPE_PATH, give an error. The most derived class in
6436 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6437 the declaration to use in the error diagnostic. */
6440 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
6441 tsubst_flags_t complain
, access_failure_info
*afi
)
6443 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
6445 if (flag_new_inheriting_ctors
6446 && DECL_INHERITED_CTOR (decl
))
6448 /* 7.3.3/18: The additional constructors are accessible if they would be
6449 accessible when used to construct an object of the corresponding base
6451 decl
= strip_inheriting_ctors (decl
);
6452 basetype_path
= lookup_base (basetype_path
, DECL_CONTEXT (decl
),
6453 ba_any
, NULL
, complain
);
6456 if (!accessible_p (basetype_path
, decl
, true))
6458 if (complain
& tf_error
)
6460 if (flag_new_inheriting_ctors
)
6461 diag_decl
= strip_inheriting_ctors (diag_decl
);
6462 if (TREE_PRIVATE (decl
))
6464 error ("%q#D is private within this context", diag_decl
);
6465 inform (DECL_SOURCE_LOCATION (diag_decl
),
6466 "declared private here");
6468 afi
->record_access_failure (basetype_path
, diag_decl
);
6470 else if (TREE_PROTECTED (decl
))
6472 error ("%q#D is protected within this context", diag_decl
);
6473 inform (DECL_SOURCE_LOCATION (diag_decl
),
6474 "declared protected here");
6476 afi
->record_access_failure (basetype_path
, diag_decl
);
6480 error ("%q#D is inaccessible within this context", diag_decl
);
6481 inform (DECL_SOURCE_LOCATION (diag_decl
), "declared here");
6483 afi
->record_access_failure (basetype_path
, diag_decl
);
6492 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6493 bitwise or of LOOKUP_* values. If any errors are warnings are
6494 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6495 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6499 build_temp (tree expr
, tree type
, int flags
,
6500 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
6503 vec
<tree
, va_gc
> *args
;
6505 *diagnostic_kind
= DK_UNSPECIFIED
;
6507 /* If the source is a packed field, calling the copy constructor will require
6508 binding the field to the reference parameter to the copy constructor, and
6509 we'll end up with an infinite loop. If we can use a bitwise copy, then
6511 if ((lvalue_kind (expr
) & clk_packed
)
6512 && CLASS_TYPE_P (TREE_TYPE (expr
))
6513 && !type_has_nontrivial_copy_init (TREE_TYPE (expr
)))
6514 return get_target_expr_sfinae (expr
, complain
);
6516 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
6517 args
= make_tree_vector_single (expr
);
6518 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6519 &args
, type
, flags
, complain
);
6520 release_tree_vector (args
);
6521 if (warningcount
+ werrorcount
> savew
)
6522 *diagnostic_kind
= DK_WARNING
;
6523 else if (errorcount
> savee
)
6524 *diagnostic_kind
= DK_ERROR
;
6528 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6529 EXPR is implicitly converted to type TOTYPE.
6530 FN and ARGNUM are used for diagnostics. */
6533 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
6535 /* Issue warnings about peculiar, but valid, uses of NULL. */
6536 if (null_node_p (expr
) && TREE_CODE (totype
) != BOOLEAN_TYPE
6537 && ARITHMETIC_TYPE_P (totype
))
6539 source_location loc
=
6540 expansion_point_location_if_in_system_header (input_location
);
6543 warning_at (loc
, OPT_Wconversion_null
,
6544 "passing NULL to non-pointer argument %P of %qD",
6547 warning_at (loc
, OPT_Wconversion_null
,
6548 "converting to non-pointer type %qT from NULL", totype
);
6551 /* Issue warnings if "false" is converted to a NULL pointer */
6552 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
6553 && TYPE_PTR_P (totype
))
6556 warning_at (input_location
, OPT_Wconversion_null
,
6557 "converting %<false%> to pointer type for argument %P "
6558 "of %qD", argnum
, fn
);
6560 warning_at (input_location
, OPT_Wconversion_null
,
6561 "converting %<false%> to pointer type %qT", totype
);
6565 /* We gave a diagnostic during a conversion. If this was in the second
6566 standard conversion sequence of a user-defined conversion sequence, say
6567 which user-defined conversion. */
6570 maybe_print_user_conv_context (conversion
*convs
)
6572 if (convs
->user_conv_p
)
6573 for (conversion
*t
= convs
; t
; t
= next_conversion (t
))
6574 if (t
->kind
== ck_user
)
6576 print_z_candidate (0, " after user-defined conversion:",
6582 /* Locate the parameter with the given index within FNDECL.
6583 ARGNUM is zero based, -1 indicates the `this' argument of a method.
6584 Return the location of the FNDECL itself if there are problems. */
6587 get_fndecl_argument_location (tree fndecl
, int argnum
)
6592 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6593 for (i
= 0, param
= FUNCTION_FIRST_USER_PARM (fndecl
);
6594 i
< argnum
&& param
;
6595 i
++, param
= TREE_CHAIN (param
))
6598 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6599 return the location of FNDECL. */
6601 return DECL_SOURCE_LOCATION (fndecl
);
6603 return DECL_SOURCE_LOCATION (param
);
6606 /* Perform the conversions in CONVS on the expression EXPR. FN and
6607 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6608 indicates the `this' argument of a method. INNER is nonzero when
6609 being called to continue a conversion chain. It is negative when a
6610 reference binding will be applied, positive otherwise. If
6611 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6612 conversions will be emitted if appropriate. If C_CAST_P is true,
6613 this conversion is coming from a C-style cast; in that case,
6614 conversions to inaccessible bases are permitted. */
6617 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
6618 bool issue_conversion_warnings
,
6619 bool c_cast_p
, tsubst_flags_t complain
)
6621 tree totype
= convs
->type
;
6622 diagnostic_t diag_kind
;
6624 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6626 if (convs
->bad_p
&& !(complain
& tf_error
))
6627 return error_mark_node
;
6630 && convs
->kind
!= ck_user
6631 && convs
->kind
!= ck_list
6632 && convs
->kind
!= ck_ambig
6633 && (convs
->kind
!= ck_ref_bind
6634 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
6635 && (convs
->kind
!= ck_rvalue
6636 || SCALAR_TYPE_P (totype
))
6637 && convs
->kind
!= ck_base
)
6639 bool complained
= false;
6640 conversion
*t
= convs
;
6642 /* Give a helpful error if this is bad because of excess braces. */
6643 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6644 && SCALAR_TYPE_P (totype
)
6645 && CONSTRUCTOR_NELTS (expr
) > 0
6646 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
6648 complained
= permerror (loc
, "too many braces around initializer "
6650 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6651 && CONSTRUCTOR_NELTS (expr
) == 1)
6652 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6655 /* Give a helpful error if this is bad because a conversion to bool
6656 from std::nullptr_t requires direct-initialization. */
6657 if (NULLPTR_TYPE_P (TREE_TYPE (expr
))
6658 && TREE_CODE (totype
) == BOOLEAN_TYPE
)
6659 complained
= permerror (loc
, "converting to %qH from %qI requires "
6660 "direct-initialization",
6661 totype
, TREE_TYPE (expr
));
6663 for (; t
; t
= next_conversion (t
))
6665 if (t
->kind
== ck_user
&& t
->cand
->reason
)
6667 complained
= permerror (loc
, "invalid user-defined conversion "
6668 "from %qH to %qI", TREE_TYPE (expr
),
6671 print_z_candidate (loc
, "candidate is:", t
->cand
);
6672 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6673 /*issue_conversion_warnings=*/false,
6676 if (convs
->kind
== ck_ref_bind
)
6677 expr
= convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
6678 LOOKUP_NORMAL
, NULL_TREE
,
6681 expr
= cp_convert (totype
, expr
, complain
);
6682 if (complained
&& fn
)
6683 inform (DECL_SOURCE_LOCATION (fn
),
6684 " initializing argument %P of %qD", argnum
, fn
);
6687 else if (t
->kind
== ck_user
|| !t
->bad_p
)
6689 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6690 /*issue_conversion_warnings=*/false,
6695 else if (t
->kind
== ck_ambig
)
6696 return convert_like_real (t
, expr
, fn
, argnum
,
6697 /*issue_conversion_warnings=*/false,
6700 else if (t
->kind
== ck_identity
)
6704 complained
= permerror (loc
, "invalid conversion from %qH to %qI",
6705 TREE_TYPE (expr
), totype
);
6706 if (complained
&& fn
)
6707 inform (get_fndecl_argument_location (fn
, argnum
),
6708 " initializing argument %P of %qD", argnum
, fn
);
6710 return cp_convert (totype
, expr
, complain
);
6713 if (issue_conversion_warnings
&& (complain
& tf_warning
))
6714 conversion_null_warnings (totype
, expr
, fn
, argnum
);
6716 switch (convs
->kind
)
6720 struct z_candidate
*cand
= convs
->cand
;
6723 /* We chose the surrogate function from add_conv_candidate, now we
6724 actually need to build the conversion. */
6725 cand
= build_user_type_conversion_1 (totype
, expr
,
6726 LOOKUP_NO_CONVERSION
, complain
);
6728 tree convfn
= cand
->fn
;
6730 /* When converting from an init list we consider explicit
6731 constructors, but actually trying to call one is an error. */
6732 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
6733 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
6734 /* Unless this is for direct-list-initialization. */
6735 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
)
6736 /* And in C++98 a default constructor can't be explicit. */
6737 && cxx_dialect
>= cxx11
)
6739 if (!(complain
& tf_error
))
6740 return error_mark_node
;
6741 location_t loc
= location_of (expr
);
6742 if (CONSTRUCTOR_NELTS (expr
) == 0
6743 && FUNCTION_FIRST_USER_PARMTYPE (convfn
) != void_list_node
)
6745 if (pedwarn (loc
, 0, "converting to %qT from initializer list "
6746 "would use explicit constructor %qD",
6748 inform (loc
, "in C++11 and above a default constructor "
6752 error ("converting to %qT from initializer list would use "
6753 "explicit constructor %qD", totype
, convfn
);
6756 /* If we're initializing from {}, it's value-initialization. */
6757 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6758 && CONSTRUCTOR_NELTS (expr
) == 0
6759 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
6761 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
6762 expr
= build_value_init (totype
, complain
);
6763 expr
= get_target_expr_sfinae (expr
, complain
);
6764 if (expr
!= error_mark_node
)
6766 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6767 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
6772 expr
= mark_rvalue_use (expr
);
6774 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
6776 expr
= build_over_call (cand
, LOOKUP_NORMAL
|LOOKUP_NO_CONVERSION
,
6779 /* If this is a constructor or a function returning an aggr type,
6780 we need to build up a TARGET_EXPR. */
6781 if (DECL_CONSTRUCTOR_P (convfn
))
6783 expr
= build_cplus_new (totype
, expr
, complain
);
6785 /* Remember that this was list-initialization. */
6786 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
6787 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6793 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
6795 int nelts
= CONSTRUCTOR_NELTS (expr
);
6797 expr
= build_value_init (totype
, complain
);
6798 else if (nelts
== 1)
6799 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6803 expr
= mark_rvalue_use (expr
);
6805 if (type_unknown_p (expr
))
6806 expr
= instantiate_type (totype
, expr
, complain
);
6807 if (expr
== null_node
6808 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
6809 /* If __null has been converted to an integer type, we do not want to
6810 continue to warn about uses of EXPR as an integer, rather than as a
6812 expr
= build_int_cst (totype
, 0);
6815 /* We leave bad_p off ck_ambig because overload resolution considers
6816 it valid, it just fails when we try to perform it. So we need to
6817 check complain here, too. */
6818 if (complain
& tf_error
)
6820 /* Call build_user_type_conversion again for the error. */
6821 build_user_type_conversion (totype
, convs
->u
.expr
, LOOKUP_IMPLICIT
,
6824 inform (DECL_SOURCE_LOCATION (fn
),
6825 " initializing argument %P of %qD", argnum
, fn
);
6827 return error_mark_node
;
6831 /* Conversion to std::initializer_list<T>. */
6832 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
6833 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
6834 unsigned len
= CONSTRUCTOR_NELTS (expr
);
6835 tree array
, val
, field
;
6836 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
6839 /* Convert all the elements. */
6840 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
6842 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
6843 false, false, complain
);
6844 if (sub
== error_mark_node
)
6846 if (!BRACE_ENCLOSED_INITIALIZER_P (val
)
6847 && !check_narrowing (TREE_TYPE (sub
), val
, complain
))
6848 return error_mark_node
;
6849 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
6850 if (!TREE_CONSTANT (sub
))
6851 TREE_CONSTANT (new_ctor
) = false;
6853 /* Build up the array. */
6854 elttype
= cp_build_qualified_type
6855 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
6856 array
= build_array_of_n_type (elttype
, len
);
6857 array
= finish_compound_literal (array
, new_ctor
, complain
);
6858 /* Take the address explicitly rather than via decay_conversion
6859 to avoid the error about taking the address of a temporary. */
6860 array
= cp_build_addr_expr (array
, complain
);
6861 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
6862 if (array
== error_mark_node
)
6863 return error_mark_node
;
6865 /* Build up the initializer_list object. */
6866 totype
= complete_type (totype
);
6867 field
= next_initializable_field (TYPE_FIELDS (totype
));
6868 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
6869 field
= next_initializable_field (DECL_CHAIN (field
));
6870 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
6871 new_ctor
= build_constructor (totype
, vec
);
6872 return get_target_expr_sfinae (new_ctor
, complain
);
6876 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
6878 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6879 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
6880 real
= perform_implicit_conversion (TREE_TYPE (totype
),
6882 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
6884 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
6887 expr
= reshape_init (totype
, expr
, complain
);
6888 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
6890 if (expr
!= error_mark_node
)
6891 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6898 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
6899 convs
->kind
== ck_ref_bind
6900 ? issue_conversion_warnings
: false,
6901 c_cast_p
, complain
);
6902 if (expr
== error_mark_node
)
6903 return error_mark_node
;
6905 switch (convs
->kind
)
6908 expr
= decay_conversion (expr
, complain
);
6909 if (expr
== error_mark_node
)
6911 if (complain
& tf_error
)
6913 maybe_print_user_conv_context (convs
);
6915 inform (DECL_SOURCE_LOCATION (fn
),
6916 " initializing argument %P of %qD", argnum
, fn
);
6918 return error_mark_node
;
6921 if (! MAYBE_CLASS_TYPE_P (totype
))
6924 /* Don't introduce copies when passing arguments along to the inherited
6926 if (current_function_decl
6927 && flag_new_inheriting_ctors
6928 && DECL_INHERITED_CTOR (current_function_decl
))
6933 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
6935 /* We are going to bind a reference directly to a base-class
6936 subobject of EXPR. */
6937 /* Build an expression for `*((base*) &expr)'. */
6938 expr
= convert_to_base (expr
, totype
,
6939 !c_cast_p
, /*nonnull=*/true, complain
);
6943 /* Copy-initialization where the cv-unqualified version of the source
6944 type is the same class as, or a derived class of, the class of the
6945 destination [is treated as direct-initialization]. [dcl.init] */
6946 flags
= LOOKUP_NORMAL
;
6947 if (convs
->user_conv_p
)
6948 /* This conversion is being done in the context of a user-defined
6949 conversion (i.e. the second step of copy-initialization), so
6950 don't allow any more. */
6951 flags
|= LOOKUP_NO_CONVERSION
;
6953 flags
|= LOOKUP_ONLYCONVERTING
;
6954 if (convs
->rvaluedness_matches_p
)
6955 /* standard_conversion got LOOKUP_PREFER_RVALUE. */
6956 flags
|= LOOKUP_PREFER_RVALUE
;
6957 if (TREE_CODE (expr
) == TARGET_EXPR
6958 && TARGET_EXPR_LIST_INIT_P (expr
))
6959 /* Copy-list-initialization doesn't actually involve a copy. */
6961 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
6962 if (diag_kind
&& complain
)
6964 maybe_print_user_conv_context (convs
);
6966 inform (DECL_SOURCE_LOCATION (fn
),
6967 " initializing argument %P of %qD", argnum
, fn
);
6970 return build_cplus_new (totype
, expr
, complain
);
6974 tree ref_type
= totype
;
6976 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
6978 tree extype
= TREE_TYPE (expr
);
6979 if (TYPE_REF_IS_RVALUE (ref_type
)
6981 error_at (loc
, "cannot bind rvalue reference of type %qH to "
6982 "lvalue of type %qI", totype
, extype
);
6983 else if (!TYPE_REF_IS_RVALUE (ref_type
) && !lvalue_p (expr
)
6984 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
6985 error_at (loc
, "cannot bind non-const lvalue reference of "
6986 "type %qH to an rvalue of type %qI", totype
, extype
);
6987 else if (!reference_compatible_p (TREE_TYPE (totype
), extype
))
6988 error_at (loc
, "binding reference of type %qH to %qI "
6989 "discards qualifiers", totype
, extype
);
6992 maybe_print_user_conv_context (convs
);
6994 inform (DECL_SOURCE_LOCATION (fn
),
6995 " initializing argument %P of %qD", argnum
, fn
);
6996 return error_mark_node
;
6999 /* If necessary, create a temporary.
7001 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
7002 that need temporaries, even when their types are reference
7003 compatible with the type of reference being bound, so the
7004 upcoming call to cp_build_addr_expr doesn't fail. */
7005 if (convs
->need_temporary_p
7006 || TREE_CODE (expr
) == CONSTRUCTOR
7007 || TREE_CODE (expr
) == VA_ARG_EXPR
)
7009 /* Otherwise, a temporary of type "cv1 T1" is created and
7010 initialized from the initializer expression using the rules
7011 for a non-reference copy-initialization (8.5). */
7013 tree type
= TREE_TYPE (ref_type
);
7014 cp_lvalue_kind lvalue
= lvalue_kind (expr
);
7016 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7017 (type
, next_conversion (convs
)->type
));
7018 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
7019 && !TYPE_REF_IS_RVALUE (ref_type
))
7021 /* If the reference is volatile or non-const, we
7022 cannot create a temporary. */
7023 if (lvalue
& clk_bitfield
)
7024 error_at (loc
, "cannot bind bitfield %qE to %qT",
7026 else if (lvalue
& clk_packed
)
7027 error_at (loc
, "cannot bind packed field %qE to %qT",
7030 error_at (loc
, "cannot bind rvalue %qE to %qT",
7032 return error_mark_node
;
7034 /* If the source is a packed field, and we must use a copy
7035 constructor, then building the target expr will require
7036 binding the field to the reference parameter to the
7037 copy constructor, and we'll end up with an infinite
7038 loop. If we can use a bitwise copy, then we'll be
7040 if ((lvalue
& clk_packed
)
7041 && CLASS_TYPE_P (type
)
7042 && type_has_nontrivial_copy_init (type
))
7044 error_at (loc
, "cannot bind packed field %qE to %qT",
7046 return error_mark_node
;
7048 if (lvalue
& clk_bitfield
)
7050 expr
= convert_bitfield_to_declared_type (expr
);
7051 expr
= fold_convert (type
, expr
);
7053 expr
= build_target_expr_with_type (expr
, type
, complain
);
7056 /* Take the address of the thing to which we will bind the
7058 expr
= cp_build_addr_expr (expr
, complain
);
7059 if (expr
== error_mark_node
)
7060 return error_mark_node
;
7062 /* Convert it to a pointer to the type referred to by the
7063 reference. This will adjust the pointer if a derived to
7064 base conversion is being performed. */
7065 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
7067 /* Convert the pointer to the desired reference type. */
7068 return build_nop (ref_type
, expr
);
7072 return decay_conversion (expr
, complain
);
7075 /* ??? Should the address of a transaction-safe pointer point to the TM
7076 clone, and this conversion look up the primary function? */
7077 return build_nop (totype
, expr
);
7080 /* Warn about deprecated conversion if appropriate. */
7081 string_conv_p (totype
, expr
, 1);
7086 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
7087 /*nonnull=*/false, complain
);
7088 return build_nop (totype
, expr
);
7091 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
7092 c_cast_p
, complain
);
7098 if (convs
->check_narrowing
7099 && !check_narrowing (totype
, expr
, complain
))
7100 return error_mark_node
;
7102 if (issue_conversion_warnings
)
7103 expr
= cp_convert_and_check (totype
, expr
, complain
);
7105 expr
= cp_convert (totype
, expr
, complain
);
7110 /* ARG is being passed to a varargs function. Perform any conversions
7111 required. Return the converted value. */
7114 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
7117 location_t loc
= EXPR_LOC_OR_LOC (arg
, input_location
);
7121 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7122 standard conversions are performed. */
7123 arg
= decay_conversion (arg
, complain
);
7124 arg_type
= TREE_TYPE (arg
);
7127 If the argument has integral or enumeration type that is subject
7128 to the integral promotions (_conv.prom_), or a floating point
7129 type that is subject to the floating point promotion
7130 (_conv.fpprom_), the value of the argument is converted to the
7131 promoted type before the call. */
7132 if (TREE_CODE (arg_type
) == REAL_TYPE
7133 && (TYPE_PRECISION (arg_type
)
7134 < TYPE_PRECISION (double_type_node
))
7135 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
7137 if ((complain
& tf_warning
)
7138 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
7139 warning_at (loc
, OPT_Wdouble_promotion
,
7140 "implicit conversion from %qH to %qI when passing "
7141 "argument to function",
7142 arg_type
, double_type_node
);
7143 arg
= convert_to_real_nofold (double_type_node
, arg
);
7145 else if (NULLPTR_TYPE_P (arg_type
))
7146 arg
= null_pointer_node
;
7147 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
7149 if (SCOPED_ENUM_P (arg_type
))
7151 tree prom
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
,
7153 prom
= cp_perform_integral_promotions (prom
, complain
);
7154 if (abi_version_crosses (6)
7155 && TYPE_MODE (TREE_TYPE (prom
)) != TYPE_MODE (arg_type
)
7156 && (complain
& tf_warning
))
7157 warning_at (loc
, OPT_Wabi
, "scoped enum %qT passed through ... as "
7158 "%qT before -fabi-version=6, %qT after", arg_type
,
7159 TREE_TYPE (prom
), ENUM_UNDERLYING_TYPE (arg_type
));
7160 if (!abi_version_at_least (6))
7164 arg
= cp_perform_integral_promotions (arg
, complain
);
7167 arg
= require_complete_type_sfinae (arg
, complain
);
7168 arg_type
= TREE_TYPE (arg
);
7170 if (arg
!= error_mark_node
7171 /* In a template (or ill-formed code), we can have an incomplete type
7172 even after require_complete_type_sfinae, in which case we don't know
7173 whether it has trivial copy or not. */
7174 && COMPLETE_TYPE_P (arg_type
)
7175 && !cp_unevaluated_operand
)
7177 /* [expr.call] 5.2.2/7:
7178 Passing a potentially-evaluated argument of class type (Clause 9)
7179 with a non-trivial copy constructor or a non-trivial destructor
7180 with no corresponding parameter is conditionally-supported, with
7181 implementation-defined semantics.
7183 We support it as pass-by-invisible-reference, just like a normal
7186 If the call appears in the context of a sizeof expression,
7187 it is not potentially-evaluated. */
7188 if (type_has_nontrivial_copy_init (arg_type
)
7189 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
))
7191 arg
= force_rvalue (arg
, complain
);
7192 if (complain
& tf_warning
)
7193 warning (OPT_Wconditionally_supported
,
7194 "passing objects of non-trivially-copyable "
7195 "type %q#T through %<...%> is conditionally supported",
7197 return cp_build_addr_expr (arg
, complain
);
7199 /* Build up a real lvalue-to-rvalue conversion in case the
7200 copy constructor is trivial but not callable. */
7201 else if (CLASS_TYPE_P (arg_type
))
7202 force_rvalue (arg
, complain
);
7209 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7212 build_x_va_arg (source_location loc
, tree expr
, tree type
)
7214 if (processing_template_decl
)
7216 tree r
= build_min (VA_ARG_EXPR
, type
, expr
);
7217 SET_EXPR_LOCATION (r
, loc
);
7221 type
= complete_type_or_else (type
, NULL_TREE
);
7223 if (expr
== error_mark_node
|| !type
)
7224 return error_mark_node
;
7226 expr
= mark_lvalue_use (expr
);
7228 if (TREE_CODE (type
) == REFERENCE_TYPE
)
7230 error ("cannot receive reference type %qT through %<...%>", type
);
7231 return error_mark_node
;
7234 if (type_has_nontrivial_copy_init (type
)
7235 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7237 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7238 it as pass by invisible reference. */
7239 warning_at (loc
, OPT_Wconditionally_supported
,
7240 "receiving objects of non-trivially-copyable type %q#T "
7241 "through %<...%> is conditionally-supported", type
);
7243 tree ref
= cp_build_reference_type (type
, false);
7244 expr
= build_va_arg (loc
, expr
, ref
);
7245 return convert_from_reference (expr
);
7248 tree ret
= build_va_arg (loc
, expr
, type
);
7249 if (CLASS_TYPE_P (type
))
7250 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7251 know how to handle it. */
7252 ret
= get_target_expr (ret
);
7256 /* TYPE has been given to va_arg. Apply the default conversions which
7257 would have happened when passed via ellipsis. Return the promoted
7258 type, or the passed type if there is no change. */
7261 cxx_type_promotes_to (tree type
)
7265 /* Perform the array-to-pointer and function-to-pointer
7267 type
= type_decays_to (type
);
7269 promote
= type_promotes_to (type
);
7270 if (same_type_p (type
, promote
))
7276 /* ARG is a default argument expression being passed to a parameter of
7277 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7278 zero-based argument number. Do any required conversions. Return
7279 the converted value. */
7281 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
7283 push_defarg_context (tree fn
)
7284 { vec_safe_push (default_arg_context
, fn
); }
7287 pop_defarg_context (void)
7288 { default_arg_context
->pop (); }
7291 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
7292 tsubst_flags_t complain
)
7297 /* See through clones. */
7298 fn
= DECL_ORIGIN (fn
);
7299 /* And inheriting ctors. */
7300 if (flag_new_inheriting_ctors
)
7301 fn
= strip_inheriting_ctors (fn
);
7303 /* Detect recursion. */
7304 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
7307 if (complain
& tf_error
)
7308 error ("recursive evaluation of default argument for %q#D", fn
);
7309 return error_mark_node
;
7312 /* If the ARG is an unparsed default argument expression, the
7313 conversion cannot be performed. */
7314 if (TREE_CODE (arg
) == DEFAULT_ARG
)
7316 if (complain
& tf_error
)
7317 error ("call to %qD uses the default argument for parameter %P, which "
7318 "is not yet defined", fn
, parmnum
);
7319 return error_mark_node
;
7322 push_defarg_context (fn
);
7324 if (fn
&& DECL_TEMPLATE_INFO (fn
))
7325 arg
= tsubst_default_argument (fn
, parmnum
, type
, arg
, complain
);
7331 The names in the expression are bound, and the semantic
7332 constraints are checked, at the point where the default
7333 expressions appears.
7335 we must not perform access checks here. */
7336 push_deferring_access_checks (dk_no_check
);
7337 /* We must make a copy of ARG, in case subsequent processing
7338 alters any part of it. */
7339 arg
= break_out_target_exprs (arg
);
7340 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
7341 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
7343 arg
= convert_for_arg_passing (type
, arg
, complain
);
7344 pop_deferring_access_checks();
7346 pop_defarg_context ();
7351 /* Returns the type which will really be used for passing an argument of
7355 type_passed_as (tree type
)
7357 /* Pass classes with copy ctors by invisible reference. */
7358 if (TREE_ADDRESSABLE (type
))
7360 type
= build_reference_type (type
);
7361 /* There are no other pointers to this temporary. */
7362 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
7364 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7365 && INTEGRAL_TYPE_P (type
)
7366 && COMPLETE_TYPE_P (type
)
7367 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7368 type
= integer_type_node
;
7373 /* Actually perform the appropriate conversion. */
7376 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
7380 /* If VAL is a bitfield, then -- since it has already been converted
7381 to TYPE -- it cannot have a precision greater than TYPE.
7383 If it has a smaller precision, we must widen it here. For
7384 example, passing "int f:3;" to a function expecting an "int" will
7385 not result in any conversion before this point.
7387 If the precision is the same we must not risk widening. For
7388 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7389 often have type "int", even though the C++ type for the field is
7390 "long long". If the value is being passed to a function
7391 expecting an "int", then no conversions will be required. But,
7392 if we call convert_bitfield_to_declared_type, the bitfield will
7393 be converted to "long long". */
7394 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
7396 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
7397 val
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
), val
);
7399 if (val
== error_mark_node
)
7401 /* Pass classes with copy ctors by invisible reference. */
7402 else if (TREE_ADDRESSABLE (type
))
7403 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
7404 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7405 && INTEGRAL_TYPE_P (type
)
7406 && COMPLETE_TYPE_P (type
)
7407 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7408 val
= cp_perform_integral_promotions (val
, complain
);
7409 if (complain
& tf_warning
)
7411 if (warn_suggest_attribute_format
)
7413 tree rhstype
= TREE_TYPE (val
);
7414 const enum tree_code coder
= TREE_CODE (rhstype
);
7415 const enum tree_code codel
= TREE_CODE (type
);
7416 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7418 && check_missing_format_attribute (type
, rhstype
))
7419 warning (OPT_Wsuggest_attribute_format
,
7420 "argument of function call might be a candidate "
7421 "for a format attribute");
7423 maybe_warn_parm_abi (type
, EXPR_LOC_OR_LOC (val
, input_location
));
7428 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7429 which just decay_conversion or no conversions at all should be done.
7430 This is true for some builtins which don't act like normal functions.
7431 Return 2 if no conversions at all should be done, 1 if just
7432 decay_conversion. Return 3 for special treatment of the 3rd argument
7433 for __builtin_*_overflow_p. */
7436 magic_varargs_p (tree fn
)
7438 if (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
7439 switch (DECL_FUNCTION_CODE (fn
))
7441 case BUILT_IN_CLASSIFY_TYPE
:
7442 case BUILT_IN_CONSTANT_P
:
7443 case BUILT_IN_NEXT_ARG
:
7444 case BUILT_IN_VA_START
:
7447 case BUILT_IN_ADD_OVERFLOW_P
:
7448 case BUILT_IN_SUB_OVERFLOW_P
:
7449 case BUILT_IN_MUL_OVERFLOW_P
:
7453 return lookup_attribute ("type generic",
7454 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
7460 /* Returns the decl of the dispatcher function if FN is a function version. */
7463 get_function_version_dispatcher (tree fn
)
7465 tree dispatcher_decl
= NULL
;
7467 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7468 && DECL_FUNCTION_VERSIONED (fn
));
7470 gcc_assert (targetm
.get_function_versions_dispatcher
);
7471 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
7473 if (dispatcher_decl
== NULL
)
7475 error_at (input_location
, "use of multiversioned function "
7476 "without a default");
7480 retrofit_lang_decl (dispatcher_decl
);
7481 gcc_assert (dispatcher_decl
!= NULL
);
7482 return dispatcher_decl
;
7485 /* fn is a function version dispatcher that is marked used. Mark all the
7486 semantically identical function versions it will dispatch as used. */
7489 mark_versions_used (tree fn
)
7491 struct cgraph_node
*node
;
7492 struct cgraph_function_version_info
*node_v
;
7493 struct cgraph_function_version_info
*it_v
;
7495 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7497 node
= cgraph_node::get (fn
);
7501 gcc_assert (node
->dispatcher_function
);
7503 node_v
= node
->function_version ();
7507 /* All semantically identical versions are chained. Traverse and mark each
7508 one of them as used. */
7509 it_v
= node_v
->next
;
7510 while (it_v
!= NULL
)
7512 mark_used (it_v
->this_node
->decl
);
7517 /* Build a call to "the copy constructor" for the type of A, even if it
7518 wouldn't be selected by normal overload resolution. Used for
7522 call_copy_ctor (tree a
, tsubst_flags_t complain
)
7524 tree ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (a
));
7525 tree binfo
= TYPE_BINFO (ctype
);
7526 tree copy
= get_copy_ctor (ctype
, complain
);
7527 copy
= build_baselink (binfo
, binfo
, copy
, NULL_TREE
);
7528 tree ob
= build_dummy_object (ctype
);
7529 vec
<tree
, va_gc
>* args
= make_tree_vector_single (a
);
7530 tree r
= build_new_method_call (ob
, copy
, &args
, NULL_TREE
,
7531 LOOKUP_NORMAL
, NULL
, complain
);
7532 release_tree_vector (args
);
7536 /* Return true iff T refers to a base field. */
7539 is_base_field_ref (tree t
)
7542 if (TREE_CODE (t
) == ADDR_EXPR
)
7543 t
= TREE_OPERAND (t
, 0);
7544 if (TREE_CODE (t
) == COMPONENT_REF
)
7545 t
= TREE_OPERAND (t
, 1);
7546 if (TREE_CODE (t
) == FIELD_DECL
)
7547 return DECL_FIELD_IS_BASE (t
);
7551 /* We can't elide a copy from a function returning by value to a base
7552 subobject, as the callee might clobber tail padding. Return true iff this
7553 could be that case. */
7556 unsafe_copy_elision_p (tree target
, tree exp
)
7558 /* Copy elision only happens with a TARGET_EXPR. */
7559 if (TREE_CODE (exp
) != TARGET_EXPR
)
7561 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
7562 /* It's safe to elide the copy for a class with no tail padding. */
7563 if (tree_int_cst_equal (TYPE_SIZE (type
), CLASSTYPE_SIZE (type
)))
7565 /* It's safe to elide the copy if we aren't initializing a base object. */
7566 if (!is_base_field_ref (target
))
7568 tree init
= TARGET_EXPR_INITIAL (exp
);
7569 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7570 while (TREE_CODE (init
) == COMPOUND_EXPR
)
7571 init
= TREE_OPERAND (init
, 1);
7572 return (TREE_CODE (init
) == AGGR_INIT_EXPR
7573 && !AGGR_INIT_VIA_CTOR_P (init
));
7576 /* Subroutine of the various build_*_call functions. Overload resolution
7577 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7578 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7579 bitmask of various LOOKUP_* flags which apply to the call itself. */
7582 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
7585 const vec
<tree
, va_gc
> *args
= cand
->args
;
7586 tree first_arg
= cand
->first_arg
;
7587 conversion
**convs
= cand
->convs
;
7589 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
7594 unsigned int arg_index
= 0;
7598 bool already_used
= false;
7600 /* In a template, there is no need to perform all of the work that
7601 is normally done. We are only interested in the type of the call
7602 expression, i.e., the return type of the function. Any semantic
7603 errors will be deferred until the template is instantiated. */
7604 if (processing_template_decl
)
7608 const tree
*argarray
;
7611 if (undeduced_auto_decl (fn
))
7612 mark_used (fn
, complain
);
7614 return_type
= TREE_TYPE (TREE_TYPE (fn
));
7615 nargs
= vec_safe_length (args
);
7616 if (first_arg
== NULL_TREE
)
7617 argarray
= args
->address ();
7625 alcarray
= XALLOCAVEC (tree
, nargs
);
7626 alcarray
[0] = build_this (first_arg
);
7627 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
7628 alcarray
[ix
+ 1] = arg
;
7629 argarray
= alcarray
;
7632 addr
= build_addr_func (fn
, complain
);
7633 if (addr
== error_mark_node
)
7634 return error_mark_node
;
7635 expr
= build_call_array_loc (input_location
, return_type
,
7636 addr
, nargs
, argarray
);
7637 if (TREE_THIS_VOLATILE (fn
) && cfun
)
7638 current_function_returns_abnormally
= 1;
7639 return convert_from_reference (expr
);
7642 /* Give any warnings we noticed during overload resolution. */
7643 if (cand
->warnings
&& (complain
& tf_warning
))
7645 struct candidate_warning
*w
;
7646 for (w
= cand
->warnings
; w
; w
= w
->next
)
7647 joust (cand
, w
->loser
, 1, complain
);
7650 /* OK, we're actually calling this inherited constructor; set its deletedness
7651 appropriately. We can get away with doing this here because calling is
7652 the only way to refer to a constructor. */
7653 if (DECL_INHERITED_CTOR (fn
))
7654 deduce_inheriting_ctor (fn
);
7656 /* Make =delete work with SFINAE. */
7657 if (DECL_DELETED_FN (fn
) && !(complain
& tf_error
))
7658 return error_mark_node
;
7660 if (DECL_FUNCTION_MEMBER_P (fn
))
7663 /* If FN is a template function, two cases must be considered.
7668 template <class T> void f();
7670 template <class T> struct B {
7674 struct C : A, B<int> {
7676 using B<int>::g; // #2
7679 In case #1 where `A::f' is a member template, DECL_ACCESS is
7680 recorded in the primary template but not in its specialization.
7681 We check access of FN using its primary template.
7683 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7684 because it is a member of class template B, DECL_ACCESS is
7685 recorded in the specialization `B<int>::g'. We cannot use its
7686 primary template because `B<T>::g' and `B<int>::g' may have
7687 different access. */
7688 if (DECL_TEMPLATE_INFO (fn
)
7689 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
7690 access_fn
= DECL_TI_TEMPLATE (fn
);
7693 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
7695 return error_mark_node
;
7698 /* If we're checking for implicit delete, don't bother with argument
7700 if (flags
& LOOKUP_SPECULATIVE
)
7702 if (DECL_DELETED_FN (fn
))
7704 if (complain
& tf_error
)
7706 return error_mark_node
;
7708 if (cand
->viable
== 1)
7710 else if (!(complain
& tf_error
))
7711 /* Reject bad conversions now. */
7712 return error_mark_node
;
7713 /* else continue to get conversion error. */
7716 /* N3276 magic doesn't apply to nested calls. */
7717 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
7718 complain
&= ~tf_decltype
;
7719 /* No-Cleanup doesn't apply to nested calls either. */
7720 tsubst_flags_t no_cleanup_complain
= complain
;
7721 complain
&= ~tf_no_cleanup
;
7723 /* Find maximum size of vector to hold converted arguments. */
7724 parmlen
= list_length (parm
);
7725 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
7726 if (parmlen
> nargs
)
7728 argarray
= XALLOCAVEC (tree
, nargs
);
7730 /* The implicit parameters to a constructor are not considered by overload
7731 resolution, and must be of the proper type. */
7732 if (DECL_CONSTRUCTOR_P (fn
))
7735 if (first_arg
!= NULL_TREE
)
7737 object_arg
= first_arg
;
7738 first_arg
= NULL_TREE
;
7742 object_arg
= (*args
)[arg_index
];
7745 argarray
[j
++] = build_this (object_arg
);
7746 parm
= TREE_CHAIN (parm
);
7747 /* We should never try to call the abstract constructor. */
7748 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
7750 if (DECL_HAS_VTT_PARM_P (fn
))
7752 argarray
[j
++] = (*args
)[arg_index
];
7754 parm
= TREE_CHAIN (parm
);
7757 if (flags
& LOOKUP_PREFER_RVALUE
)
7759 /* The implicit move specified in 15.8.3/3 fails "...if the type of
7760 the first parameter of the selected constructor is not an rvalue
7761 reference to the object’s type (possibly cv-qualified)...." */
7762 gcc_assert (!(complain
& tf_error
));
7763 tree ptype
= convs
[0]->type
;
7764 if (TREE_CODE (ptype
) != REFERENCE_TYPE
7765 || !TYPE_REF_IS_RVALUE (ptype
)
7766 || CONVERSION_RANK (convs
[0]) > cr_exact
)
7767 return error_mark_node
;
7770 /* Bypass access control for 'this' parameter. */
7771 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7773 tree parmtype
= TREE_VALUE (parm
);
7774 tree arg
= build_this (first_arg
!= NULL_TREE
7776 : (*args
)[arg_index
]);
7777 tree argtype
= TREE_TYPE (arg
);
7781 if (arg
== error_mark_node
)
7782 return error_mark_node
;
7784 if (convs
[i
]->bad_p
)
7786 if (complain
& tf_error
)
7788 if (permerror (input_location
, "passing %qT as %<this%> "
7789 "argument discards qualifiers",
7790 TREE_TYPE (argtype
)))
7791 inform (DECL_SOURCE_LOCATION (fn
), " in call to %qD", fn
);
7794 return error_mark_node
;
7797 /* See if the function member or the whole class type is declared
7798 final and the call can be devirtualized. */
7799 if (DECL_FINAL_P (fn
)
7800 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
7801 flags
|= LOOKUP_NONVIRTUAL
;
7803 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
7804 X is called for an object that is not of type X, or of a type
7805 derived from X, the behavior is undefined.
7807 So we can assume that anything passed as 'this' is non-null, and
7808 optimize accordingly. */
7809 gcc_assert (TYPE_PTR_P (parmtype
));
7810 /* Convert to the base in which the function was declared. */
7811 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
7812 converted_arg
= build_base_path (PLUS_EXPR
,
7814 cand
->conversion_path
,
7816 /* Check that the base class is accessible. */
7817 if (!accessible_base_p (TREE_TYPE (argtype
),
7818 BINFO_TYPE (cand
->conversion_path
), true))
7820 if (complain
& tf_error
)
7821 error ("%qT is not an accessible base of %qT",
7822 BINFO_TYPE (cand
->conversion_path
),
7823 TREE_TYPE (argtype
));
7825 return error_mark_node
;
7827 /* If fn was found by a using declaration, the conversion path
7828 will be to the derived class, not the base declaring fn. We
7829 must convert from derived to base. */
7830 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
7831 TREE_TYPE (parmtype
), ba_unique
,
7833 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
7834 base_binfo
, 1, complain
);
7836 argarray
[j
++] = converted_arg
;
7837 parm
= TREE_CHAIN (parm
);
7838 if (first_arg
!= NULL_TREE
)
7839 first_arg
= NULL_TREE
;
7846 gcc_assert (first_arg
== NULL_TREE
);
7847 for (; arg_index
< vec_safe_length (args
) && parm
;
7848 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
7850 tree type
= TREE_VALUE (parm
);
7851 tree arg
= (*args
)[arg_index
];
7852 bool conversion_warning
= true;
7856 /* If the argument is NULL and used to (implicitly) instantiate a
7857 template function (and bind one of the template arguments to
7858 the type of 'long int'), we don't want to warn about passing NULL
7859 to non-pointer argument.
7860 For example, if we have this template function:
7862 template<typename T> void func(T x) {}
7864 we want to warn (when -Wconversion is enabled) in this case:
7870 but not in this case:
7876 if (null_node_p (arg
)
7877 && DECL_TEMPLATE_INFO (fn
)
7878 && cand
->template_decl
7879 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
7880 conversion_warning
= false;
7882 /* Warn about initializer_list deduction that isn't currently in the
7884 if (cxx_dialect
> cxx98
7885 && flag_deduce_init_list
7886 && cand
->template_decl
7887 && is_std_init_list (non_reference (type
))
7888 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
7890 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
7891 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
7892 tree patparm
= get_pattern_parm (realparm
, tmpl
);
7893 tree pattype
= TREE_TYPE (patparm
);
7894 if (PACK_EXPANSION_P (pattype
))
7895 pattype
= PACK_EXPANSION_PATTERN (pattype
);
7896 pattype
= non_reference (pattype
);
7898 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
7899 && (cand
->explicit_targs
== NULL_TREE
7900 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
7901 <= TEMPLATE_TYPE_IDX (pattype
))))
7903 pedwarn (input_location
, 0, "deducing %qT as %qT",
7904 non_reference (TREE_TYPE (patparm
)),
7905 non_reference (type
));
7906 pedwarn (DECL_SOURCE_LOCATION (cand
->fn
), 0,
7907 " in call to %qD", cand
->fn
);
7908 pedwarn (input_location
, 0,
7909 " (you can disable this with -fno-deduce-init-list)");
7913 /* Set user_conv_p on the argument conversions, so rvalue/base handling
7914 knows not to allow any more UDCs. This needs to happen after we
7915 process cand->warnings. */
7916 if (flags
& LOOKUP_NO_CONVERSION
)
7917 conv
->user_conv_p
= true;
7919 tsubst_flags_t arg_complain
= complain
;
7920 if (!conversion_warning
)
7921 arg_complain
&= ~tf_warning
;
7923 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
7925 val
= convert_for_arg_passing (type
, val
, arg_complain
);
7927 if (val
== error_mark_node
)
7928 return error_mark_node
;
7930 argarray
[j
++] = val
;
7933 /* Default arguments */
7934 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
7936 if (TREE_VALUE (parm
) == error_mark_node
)
7937 return error_mark_node
;
7938 val
= convert_default_arg (TREE_VALUE (parm
),
7939 TREE_PURPOSE (parm
),
7942 if (val
== error_mark_node
)
7943 return error_mark_node
;
7944 argarray
[j
++] = val
;
7948 int magic
= magic_varargs_p (fn
);
7949 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
7951 tree a
= (*args
)[arg_index
];
7952 if ((magic
== 3 && arg_index
== 2) || magic
== 2)
7954 /* Do no conversions for certain magic varargs. */
7955 a
= mark_type_use (a
);
7956 if (TREE_CODE (a
) == FUNCTION_DECL
&& reject_gcc_builtin (a
))
7957 return error_mark_node
;
7959 else if (magic
!= 0)
7960 /* For other magic varargs only do decay_conversion. */
7961 a
= decay_conversion (a
, complain
);
7962 else if (DECL_CONSTRUCTOR_P (fn
)
7963 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn
),
7966 /* Avoid infinite recursion trying to call A(...). */
7967 if (complain
& tf_error
)
7968 /* Try to call the actual copy constructor for a good error. */
7969 call_copy_ctor (a
, complain
);
7970 return error_mark_node
;
7973 a
= convert_arg_to_ellipsis (a
, complain
);
7974 if (a
== error_mark_node
)
7975 return error_mark_node
;
7979 gcc_assert (j
<= nargs
);
7982 /* Avoid to do argument-transformation, if warnings for format, and for
7983 nonnull are disabled. Just in case that at least one of them is active
7984 the check_function_arguments function might warn about something. */
7986 bool warned_p
= false;
7989 || warn_suggest_attribute_format
7992 tree
*fargs
= (!nargs
? argarray
7993 : (tree
*) alloca (nargs
* sizeof (tree
)));
7994 for (j
= 0; j
< nargs
; j
++)
7995 fargs
[j
] = maybe_constant_value (argarray
[j
]);
7997 warned_p
= check_function_arguments (input_location
, fn
, TREE_TYPE (fn
),
7998 nargs
, fargs
, NULL
);
8001 if (DECL_INHERITED_CTOR (fn
))
8003 /* Check for passing ellipsis arguments to an inherited constructor. We
8004 could handle this by open-coding the inherited constructor rather than
8005 defining it, but let's not bother now. */
8006 if (!cp_unevaluated_operand
8008 && cand
->convs
[cand
->num_convs
-1]->ellipsis_p
)
8010 if (complain
& tf_error
)
8012 sorry ("passing arguments to ellipsis of inherited constructor "
8014 inform (DECL_SOURCE_LOCATION (cand
->fn
), "declared here");
8016 return error_mark_node
;
8019 /* A base constructor inheriting from a virtual base doesn't get the
8020 inherited arguments, just this and __vtt. */
8021 if (ctor_omit_inherited_parms (fn
))
8025 /* Avoid actually calling copy constructors and copy assignment operators,
8028 if (! flag_elide_constructors
)
8029 /* Do things the hard way. */;
8030 else if (cand
->num_convs
== 1
8031 && (DECL_COPY_CONSTRUCTOR_P (fn
)
8032 || DECL_MOVE_CONSTRUCTOR_P (fn
))
8033 /* It's unsafe to elide the constructor when handling
8034 a noexcept-expression, it may evaluate to the wrong
8035 value (c++/53025). */
8036 && cp_noexcept_operand
== 0)
8039 tree arg
= argarray
[num_artificial_parms_for (fn
)];
8041 bool trivial
= trivial_fn_p (fn
);
8043 /* Pull out the real argument, disregarding const-correctness. */
8045 /* Strip the reference binding for the constructor parameter. */
8046 if (CONVERT_EXPR_P (targ
)
8047 && TREE_CODE (TREE_TYPE (targ
)) == REFERENCE_TYPE
)
8048 targ
= TREE_OPERAND (targ
, 0);
8049 /* But don't strip any other reference bindings; binding a temporary to a
8050 reference prevents copy elision. */
8051 while ((CONVERT_EXPR_P (targ
)
8052 && TREE_CODE (TREE_TYPE (targ
)) != REFERENCE_TYPE
)
8053 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
8054 targ
= TREE_OPERAND (targ
, 0);
8055 if (TREE_CODE (targ
) == ADDR_EXPR
)
8057 targ
= TREE_OPERAND (targ
, 0);
8058 if (!same_type_ignoring_top_level_qualifiers_p
8059 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
8068 arg
= cp_build_fold_indirect_ref (arg
);
8070 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8072 if (CHECKING_P
&& cxx_dialect
>= cxx17
)
8073 gcc_assert (TREE_CODE (arg
) != TARGET_EXPR
8074 /* It's from binding the ref parm to a packed field. */
8075 || convs
[0]->need_temporary_p
8077 /* See unsafe_copy_elision_p. */
8078 || DECL_BASE_CONSTRUCTOR_P (fn
));
8080 /* [class.copy]: the copy constructor is implicitly defined even if
8081 the implementation elided its use. */
8082 if (!trivial
|| DECL_DELETED_FN (fn
))
8084 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
8085 return error_mark_node
;
8086 already_used
= true;
8089 /* If we're creating a temp and we already have one, don't create a
8090 new one. If we're not creating a temp but we get one, use
8091 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8092 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8093 temp or an INIT_EXPR otherwise. */
8095 if (is_dummy_object (fa
))
8097 if (TREE_CODE (arg
) == TARGET_EXPR
)
8100 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
8102 else if ((trivial
|| TREE_CODE (arg
) == TARGET_EXPR
)
8103 && !unsafe_copy_elision_p (fa
, arg
))
8105 tree to
= cp_stabilize_reference (cp_build_fold_indirect_ref (fa
));
8107 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
8111 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
8112 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
)
8113 && trivial_fn_p (fn
)
8114 && !DECL_DELETED_FN (fn
))
8116 tree to
= cp_stabilize_reference
8117 (cp_build_fold_indirect_ref (argarray
[0]));
8118 tree type
= TREE_TYPE (to
);
8119 tree as_base
= CLASSTYPE_AS_BASE (type
);
8120 tree arg
= argarray
[1];
8122 if (is_really_empty_class (type
))
8124 /* Avoid copying empty classes. */
8125 val
= build2 (COMPOUND_EXPR
, type
, arg
, to
);
8126 TREE_NO_WARNING (val
) = 1;
8128 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
8130 arg
= cp_build_fold_indirect_ref (arg
);
8131 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
8132 /* Handle NSDMI that refer to the object being initialized. */
8133 replace_placeholders (arg
, to
);
8137 /* We must only copy the non-tail padding parts. */
8139 tree array_type
, alias_set
;
8141 arg2
= TYPE_SIZE_UNIT (as_base
);
8142 arg0
= cp_build_addr_expr (to
, complain
);
8144 array_type
= build_array_type (unsigned_char_type_node
,
8146 (size_binop (MINUS_EXPR
,
8147 arg2
, size_int (1))));
8148 alias_set
= build_int_cst (build_pointer_type (type
), 0);
8149 t
= build2 (MODIFY_EXPR
, void_type_node
,
8150 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
8151 build2 (MEM_REF
, array_type
, arg
, alias_set
));
8152 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
8153 TREE_NO_WARNING (val
) = 1;
8158 else if (!DECL_DELETED_FN (fn
)
8159 && trivial_fn_p (fn
))
8161 if (DECL_DESTRUCTOR_P (fn
))
8162 return fold_convert (void_type_node
, argarray
[0]);
8163 else if (default_ctor_p (fn
))
8165 if (is_dummy_object (argarray
[0]))
8166 return force_target_expr (DECL_CONTEXT (fn
), void_node
,
8167 no_cleanup_complain
);
8169 return cp_build_fold_indirect_ref (argarray
[0]);
8173 /* For calls to a multi-versioned function, overload resolution
8174 returns the function with the highest target priority, that is,
8175 the version that will checked for dispatching first. If this
8176 version is inlinable, a direct call to this version can be made
8177 otherwise the call should go through the dispatcher. */
8179 if (DECL_FUNCTION_VERSIONED (fn
)
8180 && (current_function_decl
== NULL
8181 || !targetm
.target_option
.can_inline_p (current_function_decl
, fn
)))
8183 fn
= get_function_version_dispatcher (fn
);
8187 mark_versions_used (fn
);
8191 && !mark_used (fn
, complain
))
8192 return error_mark_node
;
8194 /* Warn if the built-in writes to an object of a non-trivial type. */
8195 if (warn_class_memaccess
8196 && vec_safe_length (args
) >= 2
8197 && DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
8198 maybe_warn_class_memaccess (input_location
, fn
, args
);
8200 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0
8201 /* Don't mess with virtual lookup in instantiate_non_dependent_expr;
8202 virtual functions can't be constexpr. */
8203 && !in_template_function ())
8206 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
8208 ba_any
, NULL
, complain
);
8209 gcc_assert (binfo
&& binfo
!= error_mark_node
);
8211 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
8213 if (TREE_SIDE_EFFECTS (argarray
[0]))
8214 argarray
[0] = save_expr (argarray
[0]);
8215 t
= build_pointer_type (TREE_TYPE (fn
));
8216 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
8221 fn
= build_addr_func (fn
, complain
);
8222 if (fn
== error_mark_node
)
8223 return error_mark_node
;
8226 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
8227 if (call
== error_mark_node
)
8229 if (cand
->flags
& LOOKUP_LIST_INIT_CTOR
)
8231 tree c
= extract_call_expr (call
);
8232 /* build_new_op_1 will clear this when appropriate. */
8233 CALL_EXPR_ORDERED_ARGS (c
) = true;
8237 tree c
= extract_call_expr (call
);
8238 if (TREE_CODE (c
) == CALL_EXPR
)
8239 TREE_NO_WARNING (c
) = 1;
8244 /* Return the DECL of the first non-public data member of class TYPE
8245 or null if none can be found. */
8248 first_non_public_field (tree type
)
8250 if (!CLASS_TYPE_P (type
))
8253 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
8255 if (TREE_CODE (field
) != FIELD_DECL
)
8257 if (TREE_STATIC (field
))
8259 if (TREE_PRIVATE (field
) || TREE_PROTECTED (field
))
8265 for (tree base_binfo
, binfo
= TYPE_BINFO (type
);
8266 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8268 tree base
= TREE_TYPE (base_binfo
);
8270 if (tree field
= first_non_public_field (base
))
8277 /* Return true if all copy and move assignment operator overloads for
8278 class TYPE are trivial and at least one of them is not deleted and,
8279 when ACCESS is set, accessible. Return false otherwise. Set
8280 HASASSIGN to true when the TYPE has a (not necessarily trivial)
8281 copy or move assignment. */
8284 has_trivial_copy_assign_p (tree type
, bool access
, bool *hasassign
)
8286 tree fns
= get_class_binding (type
, assign_op_identifier
);
8287 bool all_trivial
= true;
8289 /* Iterate over overloads of the assignment operator, checking
8290 accessible copy assignments for triviality. */
8292 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8296 /* Skip operators that aren't copy assignments. */
8300 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8301 || accessible_p (TYPE_BINFO (type
), f
, true));
8303 /* Skip template assignment operators and deleted functions. */
8304 if (TREE_CODE (f
) != FUNCTION_DECL
|| DECL_DELETED_FN (f
))
8310 if (!accessible
|| !trivial_fn_p (f
))
8311 all_trivial
= false;
8313 /* Break early when both properties have been determined. */
8314 if (*hasassign
&& !all_trivial
)
8318 /* Return true if they're all trivial and one of the expressions
8319 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
8320 tree ref
= cp_build_reference_type (type
, false);
8322 && (is_trivially_xible (MODIFY_EXPR
, type
, type
)
8323 || is_trivially_xible (MODIFY_EXPR
, type
, ref
)));
8326 /* Return true if all copy and move ctor overloads for class TYPE are
8327 trivial and at least one of them is not deleted and, when ACCESS is
8328 set, accessible. Return false otherwise. Set each element of HASCTOR[]
8329 to true when the TYPE has a (not necessarily trivial) default and copy
8330 (or move) ctor, respectively. */
8333 has_trivial_copy_p (tree type
, bool access
, bool hasctor
[2])
8335 tree fns
= get_class_binding (type
, complete_ctor_identifier
);
8336 bool all_trivial
= true;
8338 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8342 /* Skip template constructors. */
8343 if (TREE_CODE (f
) != FUNCTION_DECL
)
8346 bool cpy_or_move_ctor_p
= copy_fn_p (f
);
8348 /* Skip ctors other than default, copy, and move. */
8349 if (!cpy_or_move_ctor_p
&& !default_ctor_p (f
))
8352 if (DECL_DELETED_FN (f
))
8355 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8356 || accessible_p (TYPE_BINFO (type
), f
, true));
8359 hasctor
[cpy_or_move_ctor_p
] = true;
8361 if (cpy_or_move_ctor_p
&& (!accessible
|| !trivial_fn_p (f
)))
8362 all_trivial
= false;
8364 /* Break early when both properties have been determined. */
8365 if (hasctor
[0] && hasctor
[1] && !all_trivial
)
8372 /* Issue a warning on a call to the built-in function FNDECL if it is
8373 a raw memory write whose destination is not an object of (something
8374 like) trivial or standard layout type with a non-deleted assignment
8375 and copy ctor. Detects const correctness violations, corrupting
8376 references, virtual table pointers, and bypassing non-trivial
8380 maybe_warn_class_memaccess (location_t loc
, tree fndecl
,
8381 const vec
<tree
, va_gc
> *args
)
8383 /* Except for bcopy where it's second, the destination pointer is
8384 the first argument for all functions handled here. Compute
8385 the index of the destination and source arguments. */
8386 unsigned dstidx
= DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_BCOPY
;
8387 unsigned srcidx
= !dstidx
;
8389 tree dest
= (*args
)[dstidx
];
8390 if (!TREE_TYPE (dest
) || !POINTER_TYPE_P (TREE_TYPE (dest
)))
8393 tree srctype
= NULL_TREE
;
8395 /* Determine the type of the pointed-to object and whether it's
8396 a complete class type. */
8397 tree desttype
= TREE_TYPE (TREE_TYPE (dest
));
8399 if (!desttype
|| !COMPLETE_TYPE_P (desttype
) || !CLASS_TYPE_P (desttype
))
8402 /* Check to see if the raw memory call is made by a ctor or dtor
8403 with this as the destination argument for the destination type.
8404 If so, be more permissive. */
8405 if (current_function_decl
8406 && (DECL_CONSTRUCTOR_P (current_function_decl
)
8407 || DECL_DESTRUCTOR_P (current_function_decl
))
8408 && is_this_parameter (tree_strip_nop_conversions (dest
)))
8410 tree ctx
= DECL_CONTEXT (current_function_decl
);
8411 bool special
= same_type_ignoring_top_level_qualifiers_p (ctx
, desttype
);
8413 tree binfo
= TYPE_BINFO (ctx
);
8415 /* A ctor and dtor for a class with no bases and no virtual functions
8416 can do whatever they want. Bail early with no further checking. */
8417 if (special
&& !BINFO_VTABLE (binfo
) && !BINFO_N_BASE_BINFOS (binfo
))
8421 /* True if the class is trivial. */
8422 bool trivial
= trivial_type_p (desttype
);
8424 /* Set to true if DESTYPE has an accessible copy assignment. */
8425 bool hasassign
= false;
8426 /* True if all of the class' overloaded copy assignment operators
8427 are all trivial (and not deleted) and at least one of them is
8429 bool trivassign
= has_trivial_copy_assign_p (desttype
, true, &hasassign
);
8431 /* Set to true if DESTTYPE has an accessible default and copy ctor,
8433 bool hasctors
[2] = { false, false };
8435 /* True if all of the class' overloaded copy constructors are all
8436 trivial (and not deleted) and at least one of them is accessible. */
8437 bool trivcopy
= has_trivial_copy_p (desttype
, true, hasctors
);
8439 /* Set FLD to the first private/protected member of the class. */
8440 tree fld
= trivial
? first_non_public_field (desttype
) : NULL_TREE
;
8442 /* The warning format string. */
8443 const char *warnfmt
= NULL
;
8444 /* A suggested alternative to offer instead of the raw memory call.
8445 Empty string when none can be come up with. */
8446 const char *suggest
= "";
8447 bool warned
= false;
8449 switch (DECL_FUNCTION_CODE (fndecl
))
8451 case BUILT_IN_MEMSET
:
8452 if (!integer_zerop (maybe_constant_value ((*args
)[1])))
8454 /* Diagnose setting non-copy-assignable or non-trivial types,
8455 or types with a private member, to (potentially) non-zero
8456 bytes. Since the value of the bytes being written is unknown,
8457 suggest using assignment instead (if one exists). Also warn
8458 for writes into objects for which zero-initialization doesn't
8459 mean all bits clear (pointer-to-member data, where null is all
8460 bits set). Since the value being written is (most likely)
8461 non-zero, simply suggest assignment (but not copy assignment). */
8462 suggest
= "; use assignment instead";
8464 warnfmt
= G_("%qD writing to an object of type %#qT with "
8465 "no trivial copy-assignment");
8467 warnfmt
= G_("%qD writing to an object of non-trivial type %#qT%s");
8470 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8471 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8472 "%qD writing to an object of type %#qT with "
8474 fndecl
, desttype
, access
, fld
);
8476 else if (!zero_init_p (desttype
))
8477 warnfmt
= G_("%qD writing to an object of type %#qT containing "
8478 "a pointer to data member%s");
8484 case BUILT_IN_BZERO
:
8485 /* Similarly to the above, diagnose clearing non-trivial or non-
8486 standard layout objects, or objects of types with no assignmenmt.
8487 Since the value being written is known to be zero, suggest either
8488 copy assignment, copy ctor, or default ctor as an alternative,
8489 depending on what's available. */
8491 if (hasassign
&& hasctors
[0])
8492 suggest
= G_("; use assignment or value-initialization instead");
8494 suggest
= G_("; use assignment instead");
8495 else if (hasctors
[0])
8496 suggest
= G_("; use value-initialization instead");
8499 warnfmt
= G_("%qD clearing an object of type %#qT with "
8500 "no trivial copy-assignment%s");
8502 warnfmt
= G_("%qD clearing an object of non-trivial type %#qT%s");
8503 else if (!zero_init_p (desttype
))
8504 warnfmt
= G_("%qD clearing an object of type %#qT containing "
8505 "a pointer-to-member%s");
8508 case BUILT_IN_BCOPY
:
8509 case BUILT_IN_MEMCPY
:
8510 case BUILT_IN_MEMMOVE
:
8511 case BUILT_IN_MEMPCPY
:
8512 /* Determine the type of the source object. */
8513 srctype
= TREE_TYPE ((*args
)[srcidx
]);
8514 if (!srctype
|| !POINTER_TYPE_P (srctype
))
8515 srctype
= void_type_node
;
8517 srctype
= TREE_TYPE (srctype
);
8519 /* Since it's impossible to determine wheter the byte copy is
8520 being used in place of assignment to an existing object or
8521 as a substitute for initialization, assume it's the former.
8522 Determine the best alternative to use instead depending on
8523 what's not deleted. */
8524 if (hasassign
&& hasctors
[1])
8525 suggest
= G_("; use copy-assignment or copy-initialization instead");
8527 suggest
= G_("; use copy-assignment instead");
8528 else if (hasctors
[1])
8529 suggest
= G_("; use copy-initialization instead");
8532 warnfmt
= G_("%qD writing to an object of type %#qT with no trivial "
8533 "copy-assignment%s");
8534 else if (!trivially_copyable_p (desttype
))
8535 warnfmt
= G_("%qD writing to an object of non-trivially copyable "
8538 warnfmt
= G_("%qD writing to an object with a deleted copy constructor");
8541 && !VOID_TYPE_P (srctype
)
8542 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
8543 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
8546 /* Warn when copying into a non-trivial object from an object
8547 of a different type other than void or char. */
8548 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8549 "%qD copying an object of non-trivial type "
8550 "%#qT from an array of %#qT",
8551 fndecl
, desttype
, srctype
);
8554 && !VOID_TYPE_P (srctype
)
8555 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
8556 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
8559 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8560 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8561 "%qD copying an object of type %#qT with "
8562 "%qs member %qD from an array of %#qT; use "
8563 "assignment or copy-initialization instead",
8564 fndecl
, desttype
, access
, fld
, srctype
);
8566 else if (!trivial
&& vec_safe_length (args
) > 2)
8568 tree sz
= maybe_constant_value ((*args
)[2]);
8569 if (!tree_fits_uhwi_p (sz
))
8572 /* Finally, warn on partial copies. */
8573 unsigned HOST_WIDE_INT typesize
8574 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype
));
8575 if (unsigned HOST_WIDE_INT partial
= tree_to_uhwi (sz
) % typesize
)
8576 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8577 (typesize
- partial
> 1
8578 ? G_("%qD writing to an object of "
8579 "a non-trivial type %#qT leaves %wu "
8581 : G_("%qD writing to an object of "
8582 "a non-trivial type %#qT leaves %wu "
8584 fndecl
, desttype
, typesize
- partial
);
8588 case BUILT_IN_REALLOC
:
8590 if (!trivially_copyable_p (desttype
))
8591 warnfmt
= G_("%qD moving an object of non-trivially copyable type "
8592 "%#qT; use %<new%> and %<delete%> instead");
8594 warnfmt
= G_("%qD moving an object of type %#qT with deleted copy "
8595 "constructor; use %<new%> and %<delete%> instead");
8596 else if (!get_dtor (desttype
, tf_none
))
8597 warnfmt
= G_("%qD moving an object of type %#qT with deleted "
8601 tree sz
= maybe_constant_value ((*args
)[1]);
8602 if (TREE_CODE (sz
) == INTEGER_CST
8603 && tree_int_cst_lt (sz
, TYPE_SIZE_UNIT (desttype
)))
8604 /* Finally, warn on reallocation into insufficient space. */
8605 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8606 "%qD moving an object of non-trivial type "
8607 "%#qT and size %E into a region of size %E",
8608 fndecl
, desttype
, TYPE_SIZE_UNIT (desttype
),
8620 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8621 warnfmt
, fndecl
, desttype
, suggest
);
8623 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8624 warnfmt
, fndecl
, desttype
);
8628 inform (location_of (desttype
), "%#qT declared here", desttype
);
8631 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
8632 This function performs no overload resolution, conversion, or other
8633 high-level operations. */
8636 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
8637 tsubst_flags_t complain
)
8641 /* Remember roughly where this call is. */
8642 location_t loc
= EXPR_LOC_OR_LOC (fn
, input_location
);
8643 fn
= build_call_a (fn
, nargs
, argarray
);
8644 SET_EXPR_LOCATION (fn
, loc
);
8646 fndecl
= get_callee_fndecl (fn
);
8648 /* Check that arguments to builtin functions match the expectations. */
8650 && DECL_BUILT_IN (fndecl
)
8651 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
8655 /* We need to take care that values to BUILT_IN_NORMAL
8657 for (i
= 0; i
< nargs
; i
++)
8658 argarray
[i
] = fold_non_dependent_expr (argarray
[i
]);
8660 if (!check_builtin_function_arguments (EXPR_LOCATION (fn
), vNULL
, fndecl
,
8662 return error_mark_node
;
8665 if (VOID_TYPE_P (TREE_TYPE (fn
)))
8668 /* 5.2.2/11: If a function call is a prvalue of object type: if the
8669 function call is either the operand of a decltype-specifier or the
8670 right operand of a comma operator that is the operand of a
8671 decltype-specifier, a temporary object is not introduced for the
8672 prvalue. The type of the prvalue may be incomplete. */
8673 if (!(complain
& tf_decltype
))
8675 fn
= require_complete_type_sfinae (fn
, complain
);
8676 if (fn
== error_mark_node
)
8677 return error_mark_node
;
8679 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
8681 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
8682 maybe_warn_parm_abi (TREE_TYPE (fn
), loc
);
8685 return convert_from_reference (fn
);
8688 /* Returns the value to use for the in-charge parameter when making a
8689 call to a function with the indicated NAME.
8691 FIXME:Can't we find a neater way to do this mapping? */
8694 in_charge_arg_for_name (tree name
)
8696 if (IDENTIFIER_CTOR_P (name
))
8698 if (name
== complete_ctor_identifier
)
8699 return integer_one_node
;
8700 gcc_checking_assert (name
== base_ctor_identifier
);
8704 if (name
== complete_dtor_identifier
)
8705 return integer_two_node
;
8706 else if (name
== deleting_dtor_identifier
)
8707 return integer_three_node
;
8708 gcc_checking_assert (name
== base_dtor_identifier
);
8711 return integer_zero_node
;
8714 /* We've built up a constructor call RET. Complain if it delegates to the
8715 constructor we're currently compiling. */
8718 check_self_delegation (tree ret
)
8720 if (TREE_CODE (ret
) == TARGET_EXPR
)
8721 ret
= TARGET_EXPR_INITIAL (ret
);
8722 tree fn
= cp_get_callee_fndecl (ret
);
8723 if (fn
&& DECL_ABSTRACT_ORIGIN (fn
) == current_function_decl
)
8724 error ("constructor delegates to itself");
8727 /* Build a call to a constructor, destructor, or an assignment
8728 operator for INSTANCE, an expression with class type. NAME
8729 indicates the special member function to call; *ARGS are the
8730 arguments. ARGS may be NULL. This may change ARGS. BINFO
8731 indicates the base of INSTANCE that is to be passed as the `this'
8732 parameter to the member function called.
8734 FLAGS are the LOOKUP_* flags to use when processing the call.
8736 If NAME indicates a complete object constructor, INSTANCE may be
8737 NULL_TREE. In this case, the caller will call build_cplus_new to
8738 store the newly constructed object into a VAR_DECL. */
8741 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
8742 tree binfo
, int flags
, tsubst_flags_t complain
)
8745 /* The type of the subobject to be constructed or destroyed. */
8747 vec
<tree
, va_gc
> *allocated
= NULL
;
8750 gcc_assert (IDENTIFIER_CDTOR_P (name
) || name
== assign_op_identifier
);
8753 /* Resolve the name. */
8754 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
8755 return error_mark_node
;
8757 binfo
= TYPE_BINFO (binfo
);
8760 gcc_assert (binfo
!= NULL_TREE
);
8762 class_type
= BINFO_TYPE (binfo
);
8764 /* Handle the special case where INSTANCE is NULL_TREE. */
8765 if (name
== complete_ctor_identifier
&& !instance
)
8766 instance
= build_dummy_object (class_type
);
8769 if (IDENTIFIER_DTOR_P (name
))
8770 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
8772 /* Convert to the base class, if necessary. */
8773 if (!same_type_ignoring_top_level_qualifiers_p
8774 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
8776 if (IDENTIFIER_CDTOR_P (name
))
8777 /* For constructors and destructors, either the base is
8778 non-virtual, or it is virtual but we are doing the
8779 conversion from a constructor or destructor for the
8780 complete object. In either case, we can convert
8782 instance
= convert_to_base_statically (instance
, binfo
);
8785 /* However, for assignment operators, we must convert
8786 dynamically if the base is virtual. */
8787 gcc_checking_assert (name
== assign_op_identifier
);
8788 instance
= build_base_path (PLUS_EXPR
, instance
,
8789 binfo
, /*nonnull=*/1, complain
);
8794 gcc_assert (instance
!= NULL_TREE
);
8796 /* In C++17, "If the initializer expression is a prvalue and the
8797 cv-unqualified version of the source type is the same class as the class
8798 of the destination, the initializer expression is used to initialize the
8799 destination object." Handle that here to avoid doing overload
8801 if (cxx_dialect
>= cxx17
8802 && args
&& vec_safe_length (*args
) == 1
8803 && name
== complete_ctor_identifier
)
8805 tree arg
= (**args
)[0];
8807 /* FIXME P0135 doesn't say how to handle direct initialization from a
8808 type with a suitable conversion operator. Let's handle it like
8809 copy-initialization, but allowing explict conversions. */
8810 tsubst_flags_t sub_complain
= tf_warning
;
8811 if (!is_dummy_object (instance
))
8812 /* If we're using this to initialize a non-temporary object, don't
8813 require the destructor to be accessible. */
8814 sub_complain
|= tf_no_cleanup
;
8815 if (!reference_related_p (class_type
, TREE_TYPE (arg
)))
8816 arg
= perform_implicit_conversion_flags (class_type
, arg
,
8819 if ((TREE_CODE (arg
) == TARGET_EXPR
8820 || TREE_CODE (arg
) == CONSTRUCTOR
)
8821 && (same_type_ignoring_top_level_qualifiers_p
8822 (class_type
, TREE_TYPE (arg
))))
8824 if (is_dummy_object (instance
))
8826 if ((complain
& tf_error
)
8827 && (flags
& LOOKUP_DELEGATING_CONS
))
8828 check_self_delegation (arg
);
8829 /* Avoid change of behavior on Wunused-var-2.C. */
8830 instance
= mark_lvalue_use (instance
);
8831 return build2 (INIT_EXPR
, class_type
, instance
, arg
);
8835 fns
= lookup_fnfields (binfo
, name
, 1);
8837 /* When making a call to a constructor or destructor for a subobject
8838 that uses virtual base classes, pass down a pointer to a VTT for
8840 if ((name
== base_ctor_identifier
8841 || name
== base_dtor_identifier
)
8842 && CLASSTYPE_VBASECLASSES (class_type
))
8847 /* If the current function is a complete object constructor
8848 or destructor, then we fetch the VTT directly.
8849 Otherwise, we look it up using the VTT we were given. */
8850 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
8851 vtt
= decay_conversion (vtt
, complain
);
8852 if (vtt
== error_mark_node
)
8853 return error_mark_node
;
8854 vtt
= build_if_in_charge (vtt
, current_vtt_parm
);
8855 if (BINFO_SUBVTT_INDEX (binfo
))
8856 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
8862 allocated
= make_tree_vector ();
8866 vec_safe_insert (*args
, 0, sub_vtt
);
8869 ret
= build_new_method_call (instance
, fns
, args
,
8870 TYPE_BINFO (BINFO_TYPE (binfo
)),
8874 if (allocated
!= NULL
)
8875 release_tree_vector (allocated
);
8877 if ((complain
& tf_error
)
8878 && (flags
& LOOKUP_DELEGATING_CONS
)
8879 && name
== complete_ctor_identifier
)
8880 check_self_delegation (ret
);
8885 /* Return the NAME, as a C string. The NAME indicates a function that
8886 is a member of TYPE. *FREE_P is set to true if the caller must
8887 free the memory returned.
8889 Rather than go through all of this, we should simply set the names
8890 of constructors and destructors appropriately, and dispense with
8891 ctor_identifier, dtor_identifier, etc. */
8894 name_as_c_string (tree name
, tree type
, bool *free_p
)
8896 const char *pretty_name
;
8898 /* Assume that we will not allocate memory. */
8900 /* Constructors and destructors are special. */
8901 if (IDENTIFIER_CDTOR_P (name
))
8904 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
)));
8905 /* For a destructor, add the '~'. */
8906 if (IDENTIFIER_DTOR_P (name
))
8908 pretty_name
= concat ("~", pretty_name
, NULL
);
8909 /* Remember that we need to free the memory allocated. */
8913 else if (IDENTIFIER_CONV_OP_P (name
))
8915 pretty_name
= concat ("operator ",
8916 type_as_string_translate (TREE_TYPE (name
),
8917 TFF_PLAIN_IDENTIFIER
),
8919 /* Remember that we need to free the memory allocated. */
8923 pretty_name
= identifier_to_locale (IDENTIFIER_POINTER (name
));
8925 return CONST_CAST (char *, pretty_name
);
8928 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
8929 be set, upon return, to the function called. ARGS may be NULL.
8930 This may change ARGS. */
8933 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
8934 tree conversion_path
, int flags
,
8935 tree
*fn_p
, tsubst_flags_t complain
)
8937 struct z_candidate
*candidates
= 0, *cand
;
8938 tree explicit_targs
= NULL_TREE
;
8939 tree basetype
= NULL_TREE
;
8940 tree access_binfo
, binfo
;
8942 tree first_mem_arg
= NULL_TREE
;
8944 bool skip_first_for_error
;
8945 vec
<tree
, va_gc
> *user_args
;
8948 int template_only
= 0;
8952 vec
<tree
, va_gc
> *orig_args
= NULL
;
8955 gcc_assert (instance
!= NULL_TREE
);
8957 /* We don't know what function we're going to call, yet. */
8961 if (error_operand_p (instance
)
8962 || !fns
|| error_operand_p (fns
))
8963 return error_mark_node
;
8965 if (!BASELINK_P (fns
))
8967 if (complain
& tf_error
)
8968 error ("call to non-function %qD", fns
);
8969 return error_mark_node
;
8972 orig_instance
= instance
;
8975 /* Dismantle the baselink to collect all the information we need. */
8976 if (!conversion_path
)
8977 conversion_path
= BASELINK_BINFO (fns
);
8978 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
8979 binfo
= BASELINK_BINFO (fns
);
8980 optype
= BASELINK_OPTYPE (fns
);
8981 fns
= BASELINK_FUNCTIONS (fns
);
8982 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
8984 explicit_targs
= TREE_OPERAND (fns
, 1);
8985 fns
= TREE_OPERAND (fns
, 0);
8988 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
8989 || TREE_CODE (fns
) == TEMPLATE_DECL
8990 || TREE_CODE (fns
) == OVERLOAD
);
8991 fn
= OVL_FIRST (fns
);
8992 name
= DECL_NAME (fn
);
8994 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
8995 gcc_assert (CLASS_TYPE_P (basetype
));
8997 if (processing_template_decl
)
8999 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
9000 instance
= build_non_dependent_expr (instance
);
9002 make_args_non_dependent (*args
);
9005 user_args
= args
== NULL
? NULL
: *args
;
9006 /* Under DR 147 A::A() is an invalid constructor call,
9007 not a functional cast. */
9008 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
9010 if (! (complain
& tf_error
))
9011 return error_mark_node
;
9013 basetype
= DECL_CONTEXT (fn
);
9014 name
= constructor_name (basetype
);
9015 if (permerror (input_location
,
9016 "cannot call constructor %<%T::%D%> directly",
9018 inform (input_location
, "for a function-style cast, remove the "
9019 "redundant %<::%D%>", name
);
9020 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
9025 /* Process the argument list. */
9026 if (args
!= NULL
&& *args
!= NULL
)
9028 *args
= resolve_args (*args
, complain
);
9030 return error_mark_node
;
9033 /* Consider the object argument to be used even if we end up selecting a
9034 static member function. */
9035 instance
= mark_type_use (instance
);
9037 /* Figure out whether to skip the first argument for the error
9038 message we will display to users if an error occurs. We don't
9039 want to display any compiler-generated arguments. The "this"
9040 pointer hasn't been added yet. However, we must remove the VTT
9041 pointer if this is a call to a base-class constructor or
9043 skip_first_for_error
= false;
9044 if (IDENTIFIER_CDTOR_P (name
))
9046 /* Callers should explicitly indicate whether they want to ctor
9047 the complete object or just the part without virtual bases. */
9048 gcc_assert (name
!= ctor_identifier
);
9050 /* Remove the VTT pointer, if present. */
9051 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
9052 && CLASSTYPE_VBASECLASSES (basetype
))
9053 skip_first_for_error
= true;
9055 /* It's OK to call destructors and constructors on cv-qualified
9056 objects. Therefore, convert the INSTANCE to the unqualified
9057 type, if necessary. */
9058 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
9060 instance
= build_this (instance
);
9061 instance
= build_nop (build_pointer_type (basetype
), instance
);
9062 instance
= build_fold_indirect_ref (instance
);
9066 gcc_assert (!DECL_DESTRUCTOR_P (fn
) && !DECL_CONSTRUCTOR_P (fn
));
9068 /* For the overload resolution we need to find the actual `this`
9069 that would be captured if the call turns out to be to a
9070 non-static member function. Do not actually capture it at this
9072 if (DECL_CONSTRUCTOR_P (fn
))
9073 /* Constructors don't use the enclosing 'this'. */
9074 first_mem_arg
= instance
;
9076 first_mem_arg
= maybe_resolve_dummy (instance
, false);
9078 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9079 p
= conversion_obstack_alloc (0);
9081 /* The number of arguments artificial parms in ARGS; we subtract one because
9082 there's no 'this' in ARGS. */
9083 unsigned skip
= num_artificial_parms_for (fn
) - 1;
9085 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
9086 initializer, not T({ }). */
9087 if (DECL_CONSTRUCTOR_P (fn
)
9088 && vec_safe_length (user_args
) > skip
9089 && DIRECT_LIST_INIT_P ((*user_args
)[skip
]))
9091 tree init_list
= (*user_args
)[skip
];
9092 tree init
= NULL_TREE
;
9094 gcc_assert (user_args
->length () == skip
+ 1
9095 && !(flags
& LOOKUP_ONLYCONVERTING
));
9097 /* If the initializer list has no elements and T is a class type with
9098 a default constructor, the object is value-initialized. Handle
9099 this here so we don't need to handle it wherever we use
9100 build_special_member_call. */
9101 if (CONSTRUCTOR_NELTS (init_list
) == 0
9102 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
9103 /* For a user-provided default constructor, use the normal
9104 mechanisms so that protected access works. */
9105 && type_has_non_user_provided_default_constructor (basetype
)
9106 && !processing_template_decl
)
9107 init
= build_value_init (basetype
, complain
);
9109 /* If BASETYPE is an aggregate, we need to do aggregate
9111 else if (CP_AGGREGATE_TYPE_P (basetype
))
9113 init
= reshape_init (basetype
, init_list
, complain
);
9114 init
= digest_init (basetype
, init
, complain
);
9119 if (is_dummy_object (instance
))
9120 return get_target_expr_sfinae (init
, complain
);
9121 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
9122 TREE_SIDE_EFFECTS (init
) = true;
9126 /* Otherwise go ahead with overload resolution. */
9127 add_list_candidates (fns
, first_mem_arg
, user_args
,
9128 basetype
, explicit_targs
, template_only
,
9129 conversion_path
, access_binfo
, flags
,
9130 &candidates
, complain
);
9133 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
9134 explicit_targs
, template_only
, conversion_path
,
9135 access_binfo
, flags
, &candidates
, complain
);
9137 any_viable_p
= false;
9138 candidates
= splice_viable (candidates
, false, &any_viable_p
);
9142 if (complain
& tf_error
)
9144 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
9145 cxx_incomplete_type_error (instance
, basetype
);
9147 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9148 basetype
, optype
, build_tree_list_vec (user_args
),
9149 TREE_TYPE (instance
));
9152 tree arglist
= build_tree_list_vec (user_args
);
9153 tree errname
= name
;
9154 bool twiddle
= false;
9155 if (IDENTIFIER_CDTOR_P (errname
))
9157 twiddle
= IDENTIFIER_DTOR_P (errname
);
9158 errname
= constructor_name (basetype
);
9161 errname
= lookup_template_function (errname
, explicit_targs
);
9162 if (skip_first_for_error
)
9163 arglist
= TREE_CHAIN (arglist
);
9164 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
9165 basetype
, &"~"[!twiddle
], errname
, arglist
,
9166 TREE_TYPE (instance
));
9168 print_z_candidates (location_of (name
), candidates
);
9170 call
= error_mark_node
;
9174 cand
= tourney (candidates
, complain
);
9181 if (complain
& tf_error
)
9183 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
9184 arglist
= build_tree_list_vec (user_args
);
9185 if (skip_first_for_error
)
9186 arglist
= TREE_CHAIN (arglist
);
9187 if (!any_strictly_viable (candidates
))
9188 error ("no matching function for call to %<%s(%A)%>",
9189 pretty_name
, arglist
);
9191 error ("call of overloaded %<%s(%A)%> is ambiguous",
9192 pretty_name
, arglist
);
9193 print_z_candidates (location_of (name
), candidates
);
9197 call
= error_mark_node
;
9204 if (!(flags
& LOOKUP_NONVIRTUAL
)
9205 && DECL_PURE_VIRTUAL_P (fn
)
9206 && instance
== current_class_ref
9207 && (complain
& tf_warning
))
9209 /* This is not an error, it is runtime undefined
9211 if (!current_function_decl
)
9212 warning (0, "pure virtual %q#D called from "
9213 "non-static data member initializer", fn
);
9214 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
9215 || DECL_DESTRUCTOR_P (current_function_decl
))
9216 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
9217 ? G_("pure virtual %q#D called from constructor")
9218 : G_("pure virtual %q#D called from destructor")),
9222 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
9223 && !DECL_CONSTRUCTOR_P (fn
)
9224 && is_dummy_object (instance
))
9226 instance
= maybe_resolve_dummy (instance
, true);
9227 if (instance
== error_mark_node
)
9228 call
= error_mark_node
;
9229 else if (!is_dummy_object (instance
))
9231 /* We captured 'this' in the current lambda now that
9232 we know we really need it. */
9233 cand
->first_arg
= instance
;
9235 else if (any_dependent_bases_p ())
9236 /* We can't tell until instantiation time whether we can use
9237 *this as the implicit object argument. */;
9240 if (complain
& tf_error
)
9241 error ("cannot call member function %qD without object",
9243 call
= error_mark_node
;
9247 if (call
!= error_mark_node
)
9249 /* Optimize away vtable lookup if we know that this
9250 function can't be overridden. We need to check if
9251 the context and the type where we found fn are the same,
9252 actually FN might be defined in a different class
9253 type because of a using-declaration. In this case, we
9254 do not want to perform a non-virtual call. */
9255 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
9256 && same_type_ignoring_top_level_qualifiers_p
9257 (DECL_CONTEXT (fn
), BINFO_TYPE (binfo
))
9258 && resolves_to_fixed_type_p (instance
, 0))
9259 flags
|= LOOKUP_NONVIRTUAL
;
9261 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
9262 /* Now we know what function is being called. */
9265 /* Build the actual CALL_EXPR. */
9266 call
= build_over_call (cand
, flags
, complain
);
9267 /* In an expression of the form `a->f()' where `f' turns
9268 out to be a static member function, `a' is
9269 none-the-less evaluated. */
9270 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
9271 && !is_dummy_object (instance
)
9272 && TREE_SIDE_EFFECTS (instance
))
9273 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
),
9275 else if (call
!= error_mark_node
9276 && DECL_DESTRUCTOR_P (cand
->fn
)
9277 && !VOID_TYPE_P (TREE_TYPE (call
)))
9278 /* An explicit call of the form "x->~X()" has type
9279 "void". However, on platforms where destructors
9280 return "this" (i.e., those where
9281 targetm.cxx.cdtor_returns_this is true), such calls
9282 will appear to have a return value of pointer type
9283 to the low-level call machinery. We do not want to
9284 change the low-level machinery, since we want to be
9285 able to optimize "delete f()" on such platforms as
9286 "operator delete(~X(f()))" (rather than generating
9287 "t = f(), ~X(t), operator delete (t)"). */
9288 call
= build_nop (void_type_node
, call
);
9293 if (processing_template_decl
&& call
!= error_mark_node
)
9295 bool cast_to_void
= false;
9297 if (TREE_CODE (call
) == COMPOUND_EXPR
)
9298 call
= TREE_OPERAND (call
, 1);
9299 else if (TREE_CODE (call
) == NOP_EXPR
)
9301 cast_to_void
= true;
9302 call
= TREE_OPERAND (call
, 0);
9304 if (INDIRECT_REF_P (call
))
9305 call
= TREE_OPERAND (call
, 0);
9306 call
= (build_min_non_dep_call_vec
9308 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
9309 orig_instance
, orig_fns
, NULL_TREE
),
9311 SET_EXPR_LOCATION (call
, input_location
);
9312 call
= convert_from_reference (call
);
9314 call
= build_nop (void_type_node
, call
);
9317 /* Free all the conversions we allocated. */
9318 obstack_free (&conversion_obstack
, p
);
9320 if (orig_args
!= NULL
)
9321 release_tree_vector (orig_args
);
9326 /* Wrapper for above. */
9329 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9330 tree conversion_path
, int flags
,
9331 tree
*fn_p
, tsubst_flags_t complain
)
9334 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
9335 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
9337 timevar_cond_stop (TV_OVERLOAD
, subtime
);
9341 /* Returns true iff standard conversion sequence ICS1 is a proper
9342 subsequence of ICS2. */
9345 is_subseq (conversion
*ics1
, conversion
*ics2
)
9347 /* We can assume that a conversion of the same code
9348 between the same types indicates a subsequence since we only get
9349 here if the types we are converting from are the same. */
9351 while (ics1
->kind
== ck_rvalue
9352 || ics1
->kind
== ck_lvalue
)
9353 ics1
= next_conversion (ics1
);
9357 while (ics2
->kind
== ck_rvalue
9358 || ics2
->kind
== ck_lvalue
)
9359 ics2
= next_conversion (ics2
);
9361 if (ics2
->kind
== ck_user
9362 || ics2
->kind
== ck_ambig
9363 || ics2
->kind
== ck_aggr
9364 || ics2
->kind
== ck_list
9365 || ics2
->kind
== ck_identity
)
9366 /* At this point, ICS1 cannot be a proper subsequence of
9367 ICS2. We can get a USER_CONV when we are comparing the
9368 second standard conversion sequence of two user conversion
9372 ics2
= next_conversion (ics2
);
9374 while (ics2
->kind
== ck_rvalue
9375 || ics2
->kind
== ck_lvalue
)
9376 ics2
= next_conversion (ics2
);
9378 if (ics2
->kind
== ics1
->kind
9379 && same_type_p (ics2
->type
, ics1
->type
)
9380 && (ics1
->kind
== ck_identity
9381 || same_type_p (next_conversion (ics2
)->type
,
9382 next_conversion (ics1
)->type
)))
9387 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
9388 be any _TYPE nodes. */
9391 is_properly_derived_from (tree derived
, tree base
)
9393 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
9396 /* We only allow proper derivation here. The DERIVED_FROM_P macro
9397 considers every class derived from itself. */
9398 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
9399 && DERIVED_FROM_P (base
, derived
));
9402 /* We build the ICS for an implicit object parameter as a pointer
9403 conversion sequence. However, such a sequence should be compared
9404 as if it were a reference conversion sequence. If ICS is the
9405 implicit conversion sequence for an implicit object parameter,
9406 modify it accordingly. */
9409 maybe_handle_implicit_object (conversion
**ics
)
9413 /* [over.match.funcs]
9415 For non-static member functions, the type of the
9416 implicit object parameter is "reference to cv X"
9417 where X is the class of which the function is a
9418 member and cv is the cv-qualification on the member
9419 function declaration. */
9420 conversion
*t
= *ics
;
9421 tree reference_type
;
9423 /* The `this' parameter is a pointer to a class type. Make the
9424 implicit conversion talk about a reference to that same class
9426 reference_type
= TREE_TYPE (t
->type
);
9427 reference_type
= build_reference_type (reference_type
);
9429 if (t
->kind
== ck_qual
)
9430 t
= next_conversion (t
);
9431 if (t
->kind
== ck_ptr
)
9432 t
= next_conversion (t
);
9433 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
9434 t
= direct_reference_binding (reference_type
, t
);
9436 t
->rvaluedness_matches_p
= 0;
9441 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
9442 and return the initial reference binding conversion. Otherwise,
9443 leave *ICS unchanged and return NULL. */
9446 maybe_handle_ref_bind (conversion
**ics
)
9448 if ((*ics
)->kind
== ck_ref_bind
)
9450 conversion
*old_ics
= *ics
;
9451 *ics
= next_conversion (old_ics
);
9452 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
9459 /* Compare two implicit conversion sequences according to the rules set out in
9460 [over.ics.rank]. Return values:
9462 1: ics1 is better than ics2
9463 -1: ics2 is better than ics1
9464 0: ics1 and ics2 are indistinguishable */
9467 compare_ics (conversion
*ics1
, conversion
*ics2
)
9473 tree deref_from_type1
= NULL_TREE
;
9474 tree deref_from_type2
= NULL_TREE
;
9475 tree deref_to_type1
= NULL_TREE
;
9476 tree deref_to_type2
= NULL_TREE
;
9477 conversion_rank rank1
, rank2
;
9479 /* REF_BINDING is nonzero if the result of the conversion sequence
9480 is a reference type. In that case REF_CONV is the reference
9481 binding conversion. */
9482 conversion
*ref_conv1
;
9483 conversion
*ref_conv2
;
9485 /* Compare badness before stripping the reference conversion. */
9486 if (ics1
->bad_p
> ics2
->bad_p
)
9488 else if (ics1
->bad_p
< ics2
->bad_p
)
9491 /* Handle implicit object parameters. */
9492 maybe_handle_implicit_object (&ics1
);
9493 maybe_handle_implicit_object (&ics2
);
9495 /* Handle reference parameters. */
9496 ref_conv1
= maybe_handle_ref_bind (&ics1
);
9497 ref_conv2
= maybe_handle_ref_bind (&ics2
);
9499 /* List-initialization sequence L1 is a better conversion sequence than
9500 list-initialization sequence L2 if L1 converts to
9501 std::initializer_list<X> for some X and L2 does not. */
9502 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
9504 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
9509 When comparing the basic forms of implicit conversion sequences (as
9510 defined in _over.best.ics_)
9512 --a standard conversion sequence (_over.ics.scs_) is a better
9513 conversion sequence than a user-defined conversion sequence
9514 or an ellipsis conversion sequence, and
9516 --a user-defined conversion sequence (_over.ics.user_) is a
9517 better conversion sequence than an ellipsis conversion sequence
9518 (_over.ics.ellipsis_). */
9519 /* Use BAD_CONVERSION_RANK because we already checked for a badness
9520 mismatch. If both ICS are bad, we try to make a decision based on
9521 what would have happened if they'd been good. This is not an
9522 extension, we'll still give an error when we build up the call; this
9523 just helps us give a more helpful error message. */
9524 rank1
= BAD_CONVERSION_RANK (ics1
);
9525 rank2
= BAD_CONVERSION_RANK (ics2
);
9529 else if (rank1
< rank2
)
9532 if (ics1
->ellipsis_p
)
9533 /* Both conversions are ellipsis conversions. */
9536 /* User-defined conversion sequence U1 is a better conversion sequence
9537 than another user-defined conversion sequence U2 if they contain the
9538 same user-defined conversion operator or constructor and if the sec-
9539 ond standard conversion sequence of U1 is better than the second
9540 standard conversion sequence of U2. */
9542 /* Handle list-conversion with the same code even though it isn't always
9543 ranked as a user-defined conversion and it doesn't have a second
9544 standard conversion sequence; it will still have the desired effect.
9545 Specifically, we need to do the reference binding comparison at the
9546 end of this function. */
9548 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
|| ics1
->kind
== ck_aggr
)
9553 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
9554 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
9555 || t1
->kind
== ck_list
)
9557 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
9558 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
9559 || t2
->kind
== ck_list
)
9562 if (t1
->kind
!= t2
->kind
)
9564 else if (t1
->kind
== ck_user
)
9566 tree f1
= t1
->cand
? t1
->cand
->fn
: t1
->type
;
9567 tree f2
= t2
->cand
? t2
->cand
->fn
: t2
->type
;
9573 /* For ambiguous or aggregate conversions, use the target type as
9574 a proxy for the conversion function. */
9575 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
9579 /* We can just fall through here, after setting up
9580 FROM_TYPE1 and FROM_TYPE2. */
9581 from_type1
= t1
->type
;
9582 from_type2
= t2
->type
;
9589 /* We're dealing with two standard conversion sequences.
9593 Standard conversion sequence S1 is a better conversion
9594 sequence than standard conversion sequence S2 if
9596 --S1 is a proper subsequence of S2 (comparing the conversion
9597 sequences in the canonical form defined by _over.ics.scs_,
9598 excluding any Lvalue Transformation; the identity
9599 conversion sequence is considered to be a subsequence of
9600 any non-identity conversion sequence */
9603 while (t1
->kind
!= ck_identity
)
9604 t1
= next_conversion (t1
);
9605 from_type1
= t1
->type
;
9608 while (t2
->kind
!= ck_identity
)
9609 t2
= next_conversion (t2
);
9610 from_type2
= t2
->type
;
9613 /* One sequence can only be a subsequence of the other if they start with
9614 the same type. They can start with different types when comparing the
9615 second standard conversion sequence in two user-defined conversion
9617 if (same_type_p (from_type1
, from_type2
))
9619 if (is_subseq (ics1
, ics2
))
9621 if (is_subseq (ics2
, ics1
))
9629 --the rank of S1 is better than the rank of S2 (by the rules
9632 Standard conversion sequences are ordered by their ranks: an Exact
9633 Match is a better conversion than a Promotion, which is a better
9634 conversion than a Conversion.
9636 Two conversion sequences with the same rank are indistinguishable
9637 unless one of the following rules applies:
9639 --A conversion that does not a convert a pointer, pointer to member,
9640 or std::nullptr_t to bool is better than one that does.
9642 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
9643 so that we do not have to check it explicitly. */
9644 if (ics1
->rank
< ics2
->rank
)
9646 else if (ics2
->rank
< ics1
->rank
)
9649 to_type1
= ics1
->type
;
9650 to_type2
= ics2
->type
;
9652 /* A conversion from scalar arithmetic type to complex is worse than a
9653 conversion between scalar arithmetic types. */
9654 if (same_type_p (from_type1
, from_type2
)
9655 && ARITHMETIC_TYPE_P (from_type1
)
9656 && ARITHMETIC_TYPE_P (to_type1
)
9657 && ARITHMETIC_TYPE_P (to_type2
)
9658 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
9659 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
9661 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
9667 if (TYPE_PTR_P (from_type1
)
9668 && TYPE_PTR_P (from_type2
)
9669 && TYPE_PTR_P (to_type1
)
9670 && TYPE_PTR_P (to_type2
))
9672 deref_from_type1
= TREE_TYPE (from_type1
);
9673 deref_from_type2
= TREE_TYPE (from_type2
);
9674 deref_to_type1
= TREE_TYPE (to_type1
);
9675 deref_to_type2
= TREE_TYPE (to_type2
);
9677 /* The rules for pointers to members A::* are just like the rules
9678 for pointers A*, except opposite: if B is derived from A then
9679 A::* converts to B::*, not vice versa. For that reason, we
9680 switch the from_ and to_ variables here. */
9681 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
9682 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
9683 || (TYPE_PTRMEMFUNC_P (from_type1
)
9684 && TYPE_PTRMEMFUNC_P (from_type2
)
9685 && TYPE_PTRMEMFUNC_P (to_type1
)
9686 && TYPE_PTRMEMFUNC_P (to_type2
)))
9688 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
9689 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
9690 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
9691 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
9694 if (deref_from_type1
!= NULL_TREE
9695 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
9696 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
9698 /* This was one of the pointer or pointer-like conversions.
9702 --If class B is derived directly or indirectly from class A,
9703 conversion of B* to A* is better than conversion of B* to
9704 void*, and conversion of A* to void* is better than
9705 conversion of B* to void*. */
9706 if (VOID_TYPE_P (deref_to_type1
)
9707 && VOID_TYPE_P (deref_to_type2
))
9709 if (is_properly_derived_from (deref_from_type1
,
9712 else if (is_properly_derived_from (deref_from_type2
,
9716 else if (VOID_TYPE_P (deref_to_type1
)
9717 || VOID_TYPE_P (deref_to_type2
))
9719 if (same_type_p (deref_from_type1
, deref_from_type2
))
9721 if (VOID_TYPE_P (deref_to_type2
))
9723 if (is_properly_derived_from (deref_from_type1
,
9727 /* We know that DEREF_TO_TYPE1 is `void' here. */
9728 else if (is_properly_derived_from (deref_from_type1
,
9733 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
9734 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
9738 --If class B is derived directly or indirectly from class A
9739 and class C is derived directly or indirectly from B,
9741 --conversion of C* to B* is better than conversion of C* to
9744 --conversion of B* to A* is better than conversion of C* to
9746 if (same_type_p (deref_from_type1
, deref_from_type2
))
9748 if (is_properly_derived_from (deref_to_type1
,
9751 else if (is_properly_derived_from (deref_to_type2
,
9755 else if (same_type_p (deref_to_type1
, deref_to_type2
))
9757 if (is_properly_derived_from (deref_from_type2
,
9760 else if (is_properly_derived_from (deref_from_type1
,
9766 else if (CLASS_TYPE_P (non_reference (from_type1
))
9767 && same_type_p (from_type1
, from_type2
))
9769 tree from
= non_reference (from_type1
);
9773 --binding of an expression of type C to a reference of type
9774 B& is better than binding an expression of type C to a
9775 reference of type A&
9777 --conversion of C to B is better than conversion of C to A, */
9778 if (is_properly_derived_from (from
, to_type1
)
9779 && is_properly_derived_from (from
, to_type2
))
9781 if (is_properly_derived_from (to_type1
, to_type2
))
9783 else if (is_properly_derived_from (to_type2
, to_type1
))
9787 else if (CLASS_TYPE_P (non_reference (to_type1
))
9788 && same_type_p (to_type1
, to_type2
))
9790 tree to
= non_reference (to_type1
);
9794 --binding of an expression of type B to a reference of type
9795 A& is better than binding an expression of type C to a
9796 reference of type A&,
9798 --conversion of B to A is better than conversion of C to A */
9799 if (is_properly_derived_from (from_type1
, to
)
9800 && is_properly_derived_from (from_type2
, to
))
9802 if (is_properly_derived_from (from_type2
, from_type1
))
9804 else if (is_properly_derived_from (from_type1
, from_type2
))
9811 --S1 and S2 differ only in their qualification conversion and yield
9812 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
9813 qualification signature of type T1 is a proper subset of the cv-
9814 qualification signature of type T2 */
9815 if (ics1
->kind
== ck_qual
9816 && ics2
->kind
== ck_qual
9817 && same_type_p (from_type1
, from_type2
))
9819 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
9826 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
9827 to an implicit object parameter of a non-static member function
9828 declared without a ref-qualifier, and either S1 binds an lvalue
9829 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
9830 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
9831 draft standard, 13.3.3.2)
9833 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
9834 types to which the references refer are the same type except for
9835 top-level cv-qualifiers, and the type to which the reference
9836 initialized by S2 refers is more cv-qualified than the type to
9837 which the reference initialized by S1 refers.
9839 DR 1328 [over.match.best]: the context is an initialization by
9840 conversion function for direct reference binding (13.3.1.6) of a
9841 reference to function type, the return type of F1 is the same kind of
9842 reference (i.e. lvalue or rvalue) as the reference being initialized,
9843 and the return type of F2 is not. */
9845 if (ref_conv1
&& ref_conv2
)
9847 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
9848 && (ref_conv1
->rvaluedness_matches_p
9849 != ref_conv2
->rvaluedness_matches_p
)
9850 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
9851 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
9852 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
9854 if (ref_conv1
->bad_p
9855 && !same_type_p (TREE_TYPE (ref_conv1
->type
),
9856 TREE_TYPE (ref_conv2
->type
)))
9857 /* Don't prefer a bad conversion that drops cv-quals to a bad
9858 conversion with the wrong rvalueness. */
9860 return (ref_conv1
->rvaluedness_matches_p
9861 - ref_conv2
->rvaluedness_matches_p
);
9864 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
9866 int q1
= cp_type_quals (TREE_TYPE (ref_conv1
->type
));
9867 int q2
= cp_type_quals (TREE_TYPE (ref_conv2
->type
));
9868 if (ref_conv1
->bad_p
)
9870 /* Prefer the one that drops fewer cv-quals. */
9871 tree ftype
= next_conversion (ref_conv1
)->type
;
9872 int fquals
= cp_type_quals (ftype
);
9876 return comp_cv_qualification (q2
, q1
);
9880 /* Neither conversion sequence is better than the other. */
9884 /* The source type for this standard conversion sequence. */
9887 source_type (conversion
*t
)
9889 for (;; t
= next_conversion (t
))
9891 if (t
->kind
== ck_user
9892 || t
->kind
== ck_ambig
9893 || t
->kind
== ck_identity
)
9899 /* Note a warning about preferring WINNER to LOSER. We do this by storing
9900 a pointer to LOSER and re-running joust to produce the warning if WINNER
9901 is actually used. */
9904 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
9906 candidate_warning
*cw
= (candidate_warning
*)
9907 conversion_obstack_alloc (sizeof (candidate_warning
));
9909 cw
->next
= winner
->warnings
;
9910 winner
->warnings
= cw
;
9913 /* Compare two candidates for overloading as described in
9914 [over.match.best]. Return values:
9916 1: cand1 is better than cand2
9917 -1: cand2 is better than cand1
9918 0: cand1 and cand2 are indistinguishable */
9921 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
9922 tsubst_flags_t complain
)
9925 int off1
= 0, off2
= 0;
9929 /* Candidates that involve bad conversions are always worse than those
9931 if (cand1
->viable
> cand2
->viable
)
9933 if (cand1
->viable
< cand2
->viable
)
9936 /* If we have two pseudo-candidates for conversions to the same type,
9937 or two candidates for the same function, arbitrarily pick one. */
9938 if (cand1
->fn
== cand2
->fn
9939 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
9942 /* Prefer a non-deleted function over an implicitly deleted move
9943 constructor or assignment operator. This differs slightly from the
9944 wording for issue 1402 (which says the move op is ignored by overload
9945 resolution), but this way produces better error messages. */
9946 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
9947 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
9948 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
9950 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
9951 && move_fn_p (cand1
->fn
))
9953 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
9954 && move_fn_p (cand2
->fn
))
9958 /* a viable function F1
9959 is defined to be a better function than another viable function F2 if
9960 for all arguments i, ICSi(F1) is not a worse conversion sequence than
9961 ICSi(F2), and then */
9963 /* for some argument j, ICSj(F1) is a better conversion sequence than
9966 /* For comparing static and non-static member functions, we ignore
9967 the implicit object parameter of the non-static function. The
9968 standard says to pretend that the static function has an object
9969 parm, but that won't work with operator overloading. */
9970 len
= cand1
->num_convs
;
9971 if (len
!= cand2
->num_convs
)
9973 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
9974 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
9976 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
9977 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
9978 /* We're comparing a near-match list constructor and a near-match
9979 non-list constructor. Just treat them as unordered. */
9982 gcc_assert (static_1
!= static_2
);
9993 for (i
= 0; i
< len
; ++i
)
9995 conversion
*t1
= cand1
->convs
[i
+ off1
];
9996 conversion
*t2
= cand2
->convs
[i
+ off2
];
9997 int comp
= compare_ics (t1
, t2
);
10001 if ((complain
& tf_warning
)
10003 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
10004 == cr_std
+ cr_promotion
)
10005 && t1
->kind
== ck_std
10006 && t2
->kind
== ck_std
10007 && TREE_CODE (t1
->type
) == INTEGER_TYPE
10008 && TREE_CODE (t2
->type
) == INTEGER_TYPE
10009 && (TYPE_PRECISION (t1
->type
)
10010 == TYPE_PRECISION (t2
->type
))
10011 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
10012 || (TREE_CODE (next_conversion (t1
)->type
)
10013 == ENUMERAL_TYPE
)))
10015 tree type
= next_conversion (t1
)->type
;
10017 struct z_candidate
*w
, *l
;
10019 type1
= t1
->type
, type2
= t2
->type
,
10020 w
= cand1
, l
= cand2
;
10022 type1
= t2
->type
, type2
= t1
->type
,
10023 w
= cand2
, l
= cand1
;
10027 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
10028 type
, type1
, type2
);
10029 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
10032 add_warning (w
, l
);
10035 if (winner
&& comp
!= winner
)
10044 /* warn about confusing overload resolution for user-defined conversions,
10045 either between a constructor and a conversion op, or between two
10047 if ((complain
& tf_warning
)
10048 && winner
&& warn_conversion
&& cand1
->second_conv
10049 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
10050 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
10052 struct z_candidate
*w
, *l
;
10053 bool give_warning
= false;
10056 w
= cand1
, l
= cand2
;
10058 w
= cand2
, l
= cand1
;
10060 /* We don't want to complain about `X::operator T1 ()'
10061 beating `X::operator T2 () const', when T2 is a no less
10062 cv-qualified version of T1. */
10063 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
10064 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
10066 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
10067 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
10069 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
10074 if (!comp_ptr_ttypes (t
, f
))
10075 give_warning
= true;
10078 give_warning
= true;
10084 tree source
= source_type (w
->convs
[0]);
10085 if (! DECL_CONSTRUCTOR_P (w
->fn
))
10086 source
= TREE_TYPE (source
);
10087 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
10088 && warning (OPT_Wconversion
, " for conversion from %qH to %qI",
10089 source
, w
->second_conv
->type
))
10091 inform (input_location
, " because conversion sequence for the argument is better");
10095 add_warning (w
, l
);
10101 /* DR 495 moved this tiebreaker above the template ones. */
10102 /* or, if not that,
10103 the context is an initialization by user-defined conversion (see
10104 _dcl.init_ and _over.match.user_) and the standard conversion
10105 sequence from the return type of F1 to the destination type (i.e.,
10106 the type of the entity being initialized) is a better conversion
10107 sequence than the standard conversion sequence from the return type
10108 of F2 to the destination type. */
10110 if (cand1
->second_conv
)
10112 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
10117 /* or, if not that,
10118 F1 is a non-template function and F2 is a template function
10121 if (!cand1
->template_decl
&& cand2
->template_decl
)
10123 else if (cand1
->template_decl
&& !cand2
->template_decl
)
10126 /* or, if not that,
10127 F1 and F2 are template functions and the function template for F1 is
10128 more specialized than the template for F2 according to the partial
10131 if (cand1
->template_decl
&& cand2
->template_decl
)
10133 winner
= more_specialized_fn
10134 (TI_TEMPLATE (cand1
->template_decl
),
10135 TI_TEMPLATE (cand2
->template_decl
),
10136 /* [temp.func.order]: The presence of unused ellipsis and default
10137 arguments has no effect on the partial ordering of function
10138 templates. add_function_candidate() will not have
10139 counted the "this" argument for constructors. */
10140 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
10146 // or, if not that, F1 is more constrained than F2.
10147 if (flag_concepts
&& DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
))
10149 winner
= more_constrained (cand1
->fn
, cand2
->fn
);
10154 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
10155 if (deduction_guide_p (cand1
->fn
))
10157 gcc_assert (deduction_guide_p (cand2
->fn
));
10158 /* We distinguish between candidates from an explicit deduction guide and
10159 candidates built from a constructor based on DECL_ARTIFICIAL. */
10160 int art1
= DECL_ARTIFICIAL (cand1
->fn
);
10161 int art2
= DECL_ARTIFICIAL (cand2
->fn
);
10163 return art2
- art1
;
10167 /* Prefer the special copy guide over a declared copy/move
10169 if (copy_guide_p (cand1
->fn
))
10171 if (copy_guide_p (cand2
->fn
))
10174 /* Prefer a candidate generated from a non-template constructor. */
10175 int tg1
= template_guide_p (cand1
->fn
);
10176 int tg2
= template_guide_p (cand2
->fn
);
10182 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
10183 for all arguments the corresponding parameters of F1 and F2 have the same
10184 type (CWG 2273/2277). */
10185 if (DECL_P (cand1
->fn
) && DECL_CLASS_SCOPE_P (cand1
->fn
)
10186 && !DECL_CONV_FN_P (cand1
->fn
)
10187 && DECL_P (cand2
->fn
) && DECL_CLASS_SCOPE_P (cand2
->fn
)
10188 && !DECL_CONV_FN_P (cand2
->fn
))
10190 tree base1
= DECL_CONTEXT (strip_inheriting_ctors (cand1
->fn
));
10191 tree base2
= DECL_CONTEXT (strip_inheriting_ctors (cand2
->fn
));
10193 bool used1
= false;
10194 bool used2
= false;
10195 if (base1
== base2
)
10196 /* No difference. */;
10197 else if (DERIVED_FROM_P (base1
, base2
))
10199 else if (DERIVED_FROM_P (base2
, base1
))
10202 if (int diff
= used2
- used1
)
10204 for (i
= 0; i
< len
; ++i
)
10206 conversion
*t1
= cand1
->convs
[i
+ off1
];
10207 conversion
*t2
= cand2
->convs
[i
+ off2
];
10208 if (!same_type_p (t1
->type
, t2
->type
))
10216 /* Check whether we can discard a builtin candidate, either because we
10217 have two identical ones or matching builtin and non-builtin candidates.
10219 (Pedantically in the latter case the builtin which matched the user
10220 function should not be added to the overload set, but we spot it here.
10223 ... the builtin candidates include ...
10224 - do not have the same parameter type list as any non-template
10225 non-member candidate. */
10227 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
10229 for (i
= 0; i
< len
; ++i
)
10230 if (!same_type_p (cand1
->convs
[i
]->type
,
10231 cand2
->convs
[i
]->type
))
10233 if (i
== cand1
->num_convs
)
10235 if (cand1
->fn
== cand2
->fn
)
10236 /* Two built-in candidates; arbitrarily pick one. */
10238 else if (identifier_p (cand1
->fn
))
10239 /* cand1 is built-in; prefer cand2. */
10242 /* cand2 is built-in; prefer cand1. */
10247 /* For candidates of a multi-versioned function, make the version with
10248 the highest priority win. This version will be checked for dispatching
10249 first. If this version can be inlined into the caller, the front-end
10250 will simply make a direct call to this function. */
10252 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
10253 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
10254 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
10255 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
10257 tree f1
= TREE_TYPE (cand1
->fn
);
10258 tree f2
= TREE_TYPE (cand2
->fn
);
10259 tree p1
= TYPE_ARG_TYPES (f1
);
10260 tree p2
= TYPE_ARG_TYPES (f2
);
10262 /* Check if cand1->fn and cand2->fn are versions of the same function. It
10263 is possible that cand1->fn and cand2->fn are function versions but of
10264 different functions. Check types to see if they are versions of the same
10266 if (compparms (p1
, p2
)
10267 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
10269 /* Always make the version with the higher priority, more
10270 specialized, win. */
10271 gcc_assert (targetm
.compare_version_priority
);
10272 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
10279 /* If the two function declarations represent the same function (this can
10280 happen with declarations in multiple scopes and arg-dependent lookup),
10281 arbitrarily choose one. But first make sure the default args we're
10283 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
10284 && equal_functions (cand1
->fn
, cand2
->fn
))
10286 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
10287 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
10289 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
10291 for (i
= 0; i
< len
; ++i
)
10293 /* Don't crash if the fn is variadic. */
10296 parms1
= TREE_CHAIN (parms1
);
10297 parms2
= TREE_CHAIN (parms2
);
10301 parms1
= TREE_CHAIN (parms1
);
10303 parms2
= TREE_CHAIN (parms2
);
10305 for (; parms1
; ++i
)
10307 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
10308 TREE_PURPOSE (parms2
)))
10312 if (complain
& tf_error
)
10314 if (permerror (input_location
,
10315 "default argument mismatch in "
10316 "overload resolution"))
10318 inform (DECL_SOURCE_LOCATION (cand1
->fn
),
10319 " candidate 1: %q#F", cand1
->fn
);
10320 inform (DECL_SOURCE_LOCATION (cand2
->fn
),
10321 " candidate 2: %q#F", cand2
->fn
);
10328 add_warning (cand1
, cand2
);
10331 parms1
= TREE_CHAIN (parms1
);
10332 parms2
= TREE_CHAIN (parms2
);
10340 /* Extension: If the worst conversion for one candidate is worse than the
10341 worst conversion for the other, take the first. */
10342 if (!pedantic
&& (complain
& tf_warning_or_error
))
10344 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
10345 struct z_candidate
*w
= 0, *l
= 0;
10347 for (i
= 0; i
< len
; ++i
)
10349 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
10350 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
10351 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
10352 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
10355 winner
= 1, w
= cand1
, l
= cand2
;
10357 winner
= -1, w
= cand2
, l
= cand1
;
10360 /* Don't choose a deleted function over ambiguity. */
10361 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
10365 pedwarn (input_location
, 0,
10366 "ISO C++ says that these are ambiguous, even "
10367 "though the worst conversion for the first is better than "
10368 "the worst conversion for the second:");
10369 print_z_candidate (input_location
, _("candidate 1:"), w
);
10370 print_z_candidate (input_location
, _("candidate 2:"), l
);
10373 add_warning (w
, l
);
10378 gcc_assert (!winner
);
10382 /* Given a list of candidates for overloading, find the best one, if any.
10383 This algorithm has a worst case of O(2n) (winner is last), and a best
10384 case of O(n/2) (totally ambiguous); much better than a sorting
10387 static struct z_candidate
*
10388 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
10390 struct z_candidate
*champ
= candidates
, *challenger
;
10392 int champ_compared_to_predecessor
= 0;
10394 /* Walk through the list once, comparing each current champ to the next
10395 candidate, knocking out a candidate or two with each comparison. */
10397 for (challenger
= champ
->next
; challenger
; )
10399 fate
= joust (champ
, challenger
, 0, complain
);
10401 challenger
= challenger
->next
;
10406 champ
= challenger
->next
;
10409 champ_compared_to_predecessor
= 0;
10413 champ
= challenger
;
10414 champ_compared_to_predecessor
= 1;
10417 challenger
= champ
->next
;
10421 /* Make sure the champ is better than all the candidates it hasn't yet
10422 been compared to. */
10424 for (challenger
= candidates
;
10425 challenger
!= champ
10426 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
10427 challenger
= challenger
->next
)
10429 fate
= joust (champ
, challenger
, 0, complain
);
10437 /* Returns nonzero if things of type FROM can be converted to TO. */
10440 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
10442 tree arg
= NULL_TREE
;
10443 /* implicit_conversion only considers user-defined conversions
10444 if it has an expression for the call argument list. */
10445 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
10446 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
10447 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
10450 /* Returns nonzero if things of type FROM can be converted to TO with a
10451 standard conversion. */
10454 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
10456 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
10459 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
10462 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
10463 tsubst_flags_t complain
)
10469 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10470 p
= conversion_obstack_alloc (0);
10471 /* We want to discard any access checks done for this test,
10472 as we might not be in the appropriate access context and
10473 we'll do the check again when we actually perform the
10475 push_deferring_access_checks (dk_deferred
);
10477 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10479 ok_p
= (t
&& !t
->bad_p
);
10481 /* Discard the access checks now. */
10482 pop_deferring_access_checks ();
10483 /* Free all the conversions we allocated. */
10484 obstack_free (&conversion_obstack
, p
);
10489 /* Like can_convert_arg, but allows dubious conversions as well. */
10492 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
10493 tsubst_flags_t complain
)
10498 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10499 p
= conversion_obstack_alloc (0);
10500 /* Try to perform the conversion. */
10501 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10503 /* Free all the conversions we allocated. */
10504 obstack_free (&conversion_obstack
, p
);
10509 /* Convert EXPR to TYPE. Return the converted expression.
10511 Note that we allow bad conversions here because by the time we get to
10512 this point we are committed to doing the conversion. If we end up
10513 doing a bad conversion, convert_like will complain. */
10516 perform_implicit_conversion_flags (tree type
, tree expr
,
10517 tsubst_flags_t complain
, int flags
)
10521 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
10523 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10524 expr
= mark_lvalue_use (expr
);
10526 expr
= mark_rvalue_use (expr
);
10528 if (error_operand_p (expr
))
10529 return error_mark_node
;
10531 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10532 p
= conversion_obstack_alloc (0);
10534 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
10535 /*c_cast_p=*/false,
10540 if (complain
& tf_error
)
10542 /* If expr has unknown type, then it is an overloaded function.
10543 Call instantiate_type to get good error messages. */
10544 if (TREE_TYPE (expr
) == unknown_type_node
)
10545 instantiate_type (type
, expr
, complain
);
10546 else if (invalid_nonstatic_memfn_p (loc
, expr
, complain
))
10547 /* We gave an error. */;
10549 error_at (loc
, "could not convert %qE from %qH to %qI", expr
,
10550 TREE_TYPE (expr
), type
);
10552 expr
= error_mark_node
;
10554 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
10556 /* In a template, we are only concerned about determining the
10557 type of non-dependent expressions, so we do not have to
10558 perform the actual conversion. But for initializers, we
10559 need to be able to perform it at instantiation
10560 (or instantiate_non_dependent_expr) time. */
10561 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
10562 if (!(flags
& LOOKUP_ONLYCONVERTING
))
10563 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
10566 expr
= convert_like (conv
, expr
, complain
);
10568 /* Free all the conversions we allocated. */
10569 obstack_free (&conversion_obstack
, p
);
10575 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
10577 return perform_implicit_conversion_flags (type
, expr
, complain
,
10581 /* Convert EXPR to TYPE (as a direct-initialization) if that is
10582 permitted. If the conversion is valid, the converted expression is
10583 returned. Otherwise, NULL_TREE is returned, except in the case
10584 that TYPE is a class type; in that case, an error is issued. If
10585 C_CAST_P is true, then this direct-initialization is taking
10586 place as part of a static_cast being attempted as part of a C-style
10590 perform_direct_initialization_if_possible (tree type
,
10593 tsubst_flags_t complain
)
10598 if (type
== error_mark_node
|| error_operand_p (expr
))
10599 return error_mark_node
;
10602 If the destination type is a (possibly cv-qualified) class type:
10604 -- If the initialization is direct-initialization ...,
10605 constructors are considered. ... If no constructor applies, or
10606 the overload resolution is ambiguous, the initialization is
10608 if (CLASS_TYPE_P (type
))
10610 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
10611 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
10612 &args
, type
, LOOKUP_NORMAL
, complain
);
10613 release_tree_vector (args
);
10614 return build_cplus_new (type
, expr
, complain
);
10617 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10618 p
= conversion_obstack_alloc (0);
10620 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
10622 LOOKUP_NORMAL
, complain
);
10623 if (!conv
|| conv
->bad_p
)
10625 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
10627 /* In a template, we are only concerned about determining the
10628 type of non-dependent expressions, so we do not have to
10629 perform the actual conversion. But for initializers, we
10630 need to be able to perform it at instantiation
10631 (or instantiate_non_dependent_expr) time. */
10632 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
10633 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
10636 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0,
10637 /*issue_conversion_warnings=*/false,
10641 /* Free all the conversions we allocated. */
10642 obstack_free (&conversion_obstack
, p
);
10647 /* When initializing a reference that lasts longer than a full-expression,
10648 this special rule applies:
10652 The temporary to which the reference is bound or the temporary
10653 that is the complete object to which the reference is bound
10654 persists for the lifetime of the reference.
10656 The temporaries created during the evaluation of the expression
10657 initializing the reference, except the temporary to which the
10658 reference is bound, are destroyed at the end of the
10659 full-expression in which they are created.
10661 In that case, we store the converted expression into a new
10662 VAR_DECL in a new scope.
10664 However, we want to be careful not to create temporaries when
10665 they are not required. For example, given:
10668 struct D : public B {};
10672 there is no need to copy the return value from "f"; we can just
10673 extend its lifetime. Similarly, given:
10676 struct T { operator S(); };
10680 we can extend the lifetime of the return value of the conversion
10683 The next several functions are involved in this lifetime extension. */
10685 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
10686 reference is being bound to a temporary. Create and return a new
10687 VAR_DECL with the indicated TYPE; this variable will store the value to
10688 which the reference is bound. */
10691 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
10693 tree var
= create_temporary_var (type
);
10695 /* Register the variable. */
10697 && (TREE_STATIC (decl
) || CP_DECL_THREAD_LOCAL_P (decl
)))
10699 /* Namespace-scope or local static; give it a mangled name. */
10700 /* FIXME share comdat with decl? */
10702 TREE_STATIC (var
) = TREE_STATIC (decl
);
10703 CP_DECL_THREAD_LOCAL_P (var
) = CP_DECL_THREAD_LOCAL_P (decl
);
10704 set_decl_tls_model (var
, DECL_TLS_MODEL (decl
));
10706 tree name
= mangle_ref_init_variable (decl
);
10707 DECL_NAME (var
) = name
;
10708 SET_DECL_ASSEMBLER_NAME (var
, name
);
10710 var
= pushdecl (var
);
10713 /* Create a new cleanup level if necessary. */
10714 maybe_push_cleanup_level (type
);
10719 /* EXPR is the initializer for a variable DECL of reference or
10720 std::initializer_list type. Create, push and return a new VAR_DECL
10721 for the initializer so that it will live as long as DECL. Any
10722 cleanup for the new variable is returned through CLEANUP, and the
10723 code to initialize the new variable is returned through INITP. */
10726 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
10733 /* Create the temporary variable. */
10734 type
= TREE_TYPE (expr
);
10735 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
10736 layout_decl (var
, 0);
10737 /* If the rvalue is the result of a function call it will be
10738 a TARGET_EXPR. If it is some other construct (such as a
10739 member access expression where the underlying object is
10740 itself the result of a function call), turn it into a
10741 TARGET_EXPR here. It is important that EXPR be a
10742 TARGET_EXPR below since otherwise the INIT_EXPR will
10743 attempt to make a bitwise copy of EXPR to initialize
10745 if (TREE_CODE (expr
) != TARGET_EXPR
)
10746 expr
= get_target_expr (expr
);
10748 if (TREE_CODE (decl
) == FIELD_DECL
10749 && extra_warnings
&& !TREE_NO_WARNING (decl
))
10751 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
10752 "until the constructor exits", decl
);
10753 TREE_NO_WARNING (decl
) = true;
10756 /* Recursively extend temps in this initializer. */
10757 TARGET_EXPR_INITIAL (expr
)
10758 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
10760 /* Any reference temp has a non-trivial initializer. */
10761 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
10763 /* If the initializer is constant, put it in DECL_INITIAL so we get
10764 static initialization and use in constant expressions. */
10765 init
= maybe_constant_init (expr
);
10766 if (TREE_CONSTANT (init
))
10768 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
10770 /* 5.19 says that a constant expression can include an
10771 lvalue-rvalue conversion applied to "a glvalue of literal type
10772 that refers to a non-volatile temporary object initialized
10773 with a constant expression". Rather than try to communicate
10774 that this VAR_DECL is a temporary, just mark it constexpr.
10776 Currently this is only useful for initializer_list temporaries,
10777 since reference vars can't appear in constant expressions. */
10778 DECL_DECLARED_CONSTEXPR_P (var
) = true;
10779 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
10780 TREE_CONSTANT (var
) = true;
10782 DECL_INITIAL (var
) = init
;
10786 /* Create the INIT_EXPR that will initialize the temporary
10788 init
= split_nonconstant_init (var
, expr
);
10789 if (at_function_scope_p ())
10791 add_decl_expr (var
);
10793 if (TREE_STATIC (var
))
10794 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
10797 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
10799 vec_safe_push (*cleanups
, cleanup
);
10802 /* We must be careful to destroy the temporary only
10803 after its initialization has taken place. If the
10804 initialization throws an exception, then the
10805 destructor should not be run. We cannot simply
10806 transform INIT into something like:
10808 (INIT, ({ CLEANUP_STMT; }))
10810 because emit_local_var always treats the
10811 initializer as a full-expression. Thus, the
10812 destructor would run too early; it would run at the
10813 end of initializing the reference variable, rather
10814 than at the end of the block enclosing the
10815 reference variable.
10817 The solution is to pass back a cleanup expression
10818 which the caller is responsible for attaching to
10819 the statement tree. */
10823 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
10824 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
10826 if (CP_DECL_THREAD_LOCAL_P (var
))
10827 tls_aggregates
= tree_cons (NULL_TREE
, var
,
10830 static_aggregates
= tree_cons (NULL_TREE
, var
,
10831 static_aggregates
);
10834 /* Check whether the dtor is callable. */
10835 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
10837 /* Avoid -Wunused-variable warning (c++/38958). */
10838 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
10840 TREE_USED (decl
) = DECL_READ_P (decl
) = true;
10846 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
10847 initializing a variable of that TYPE. */
10850 initialize_reference (tree type
, tree expr
,
10851 int flags
, tsubst_flags_t complain
)
10855 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
10857 if (type
== error_mark_node
|| error_operand_p (expr
))
10858 return error_mark_node
;
10860 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10861 p
= conversion_obstack_alloc (0);
10863 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
10865 if (!conv
|| conv
->bad_p
)
10867 if (complain
& tf_error
)
10870 convert_like (conv
, expr
, complain
);
10871 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
10872 && !TYPE_REF_IS_RVALUE (type
)
10873 && !lvalue_p (expr
))
10874 error_at (loc
, "invalid initialization of non-const reference of "
10875 "type %qH from an rvalue of type %qI",
10876 type
, TREE_TYPE (expr
));
10878 error_at (loc
, "invalid initialization of reference of type "
10879 "%qH from expression of type %qI", type
,
10882 return error_mark_node
;
10885 if (conv
->kind
== ck_ref_bind
)
10886 /* Perform the conversion. */
10887 expr
= convert_like (conv
, expr
, complain
);
10888 else if (conv
->kind
== ck_ambig
)
10889 /* We gave an error in build_user_type_conversion_1. */
10890 expr
= error_mark_node
;
10892 gcc_unreachable ();
10894 /* Free all the conversions we allocated. */
10895 obstack_free (&conversion_obstack
, p
);
10900 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
10901 which is bound either to a reference or a std::initializer_list. */
10904 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
10909 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
10911 TREE_OPERAND (sub
, 1)
10912 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
10915 if (TREE_CODE (sub
) != ADDR_EXPR
)
10917 /* Deal with binding to a subobject. */
10918 for (p
= &TREE_OPERAND (sub
, 0); TREE_CODE (*p
) == COMPONENT_REF
; )
10919 p
= &TREE_OPERAND (*p
, 0);
10920 if (TREE_CODE (*p
) == TARGET_EXPR
)
10922 tree subinit
= NULL_TREE
;
10923 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
10924 recompute_tree_invariant_for_addr_expr (sub
);
10926 init
= fold_convert (TREE_TYPE (init
), sub
);
10928 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
10933 /* INIT is part of the initializer for DECL. If there are any
10934 reference or initializer lists being initialized, extend their
10935 lifetime to match that of DECL. */
10938 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
10940 tree type
= TREE_TYPE (init
);
10941 if (processing_template_decl
)
10943 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10944 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
10948 if (TREE_CODE (ctor
) == TARGET_EXPR
)
10949 ctor
= TARGET_EXPR_INITIAL (ctor
);
10950 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
10952 if (is_std_init_list (type
))
10954 /* The temporary array underlying a std::initializer_list
10955 is handled like a reference temporary. */
10956 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
10957 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
10958 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
10963 constructor_elt
*p
;
10964 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (ctor
);
10965 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
10966 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
10968 recompute_constructor_flags (ctor
);
10969 if (decl_maybe_constant_var_p (decl
) && TREE_CONSTANT (ctor
))
10970 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
10977 /* Returns true iff an initializer for TYPE could contain temporaries that
10978 need to be extended because they are bound to references or
10979 std::initializer_list. */
10982 type_has_extended_temps (tree type
)
10984 type
= strip_array_types (type
);
10985 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10987 if (CLASS_TYPE_P (type
))
10989 if (is_std_init_list (type
))
10991 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
10992 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
10993 if (type_has_extended_temps (TREE_TYPE (f
)))
10999 /* Returns true iff TYPE is some variant of std::initializer_list. */
11002 is_std_init_list (tree type
)
11004 if (!TYPE_P (type
))
11006 if (cxx_dialect
== cxx98
)
11008 /* Look through typedefs. */
11009 type
= TYPE_MAIN_VARIANT (type
);
11010 return (CLASS_TYPE_P (type
)
11011 && CP_TYPE_CONTEXT (type
) == std_node
11012 && init_list_identifier
== DECL_NAME (TYPE_NAME (type
)));
11015 /* Returns true iff DECL is a list constructor: i.e. a constructor which
11016 will accept an argument list of a single std::initializer_list<T>. */
11019 is_list_ctor (tree decl
)
11021 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
11024 if (!args
|| args
== void_list_node
)
11027 arg
= non_reference (TREE_VALUE (args
));
11028 if (!is_std_init_list (arg
))
11031 args
= TREE_CHAIN (args
);
11033 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
11034 /* There are more non-defaulted parms. */
11040 #include "gt-cp-call.h"