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"
44 #include "gcc-rich-location.h"
46 /* The various kinds of conversion. */
48 enum conversion_kind
{
65 /* The rank of the conversion. Order of the enumerals matters; better
66 conversions should come earlier in the list. */
68 enum conversion_rank
{
79 /* An implicit conversion sequence, in the sense of [over.best.ics].
80 The first conversion to be performed is at the end of the chain.
81 That conversion is always a cr_identity conversion. */
84 /* The kind of conversion represented by this step. */
86 /* The rank of this conversion. */
88 BOOL_BITFIELD user_conv_p
: 1;
89 BOOL_BITFIELD ellipsis_p
: 1;
90 BOOL_BITFIELD this_p
: 1;
91 /* True if this conversion would be permitted with a bending of
92 language standards, e.g. disregarding pointer qualifiers or
93 converting integers to pointers. */
94 BOOL_BITFIELD bad_p
: 1;
95 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
96 temporary should be created to hold the result of the
97 conversion. If KIND is ck_ambig, true if the context is
98 copy-initialization. */
99 BOOL_BITFIELD need_temporary_p
: 1;
100 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
101 from a pointer-to-derived to pointer-to-base is being performed. */
102 BOOL_BITFIELD base_p
: 1;
103 /* If KIND is ck_ref_bind, true when either an lvalue reference is
104 being bound to an lvalue expression or an rvalue reference is
105 being bound to an rvalue expression. If KIND is ck_rvalue,
106 true when we are treating an lvalue as an rvalue (12.8p33). If
107 KIND is ck_base, always false. If ck_identity, we will be
108 binding a reference directly or decaying to a pointer. */
109 BOOL_BITFIELD rvaluedness_matches_p
: 1;
110 BOOL_BITFIELD check_narrowing
: 1;
111 /* Whether check_narrowing should only check TREE_CONSTANTs; used
112 in build_converted_constant_expr. */
113 BOOL_BITFIELD check_narrowing_const_only
: 1;
114 /* The type of the expression resulting from the conversion. */
117 /* The next conversion in the chain. Since the conversions are
118 arranged from outermost to innermost, the NEXT conversion will
119 actually be performed before this conversion. This variant is
120 used only when KIND is neither ck_identity, ck_ambig nor
121 ck_list. Please use the next_conversion function instead
122 of using this field directly. */
124 /* The expression at the beginning of the conversion chain. This
125 variant is used only if KIND is ck_identity or ck_ambig. */
127 /* The array of conversions for an initializer_list, so this
128 variant is used only when KIN D is ck_list. */
131 /* The function candidate corresponding to this conversion
132 sequence. This field is only used if KIND is ck_user. */
133 struct z_candidate
*cand
;
136 #define CONVERSION_RANK(NODE) \
137 ((NODE)->bad_p ? cr_bad \
138 : (NODE)->ellipsis_p ? cr_ellipsis \
139 : (NODE)->user_conv_p ? cr_user \
142 #define BAD_CONVERSION_RANK(NODE) \
143 ((NODE)->ellipsis_p ? cr_ellipsis \
144 : (NODE)->user_conv_p ? cr_user \
147 static struct obstack conversion_obstack
;
148 static bool conversion_obstack_initialized
;
149 struct rejection_reason
;
151 static struct z_candidate
* tourney (struct z_candidate
*, tsubst_flags_t
);
152 static int equal_functions (tree
, tree
);
153 static int joust (struct z_candidate
*, struct z_candidate
*, bool,
155 static int compare_ics (conversion
*, conversion
*);
156 static void maybe_warn_class_memaccess (location_t
, tree
,
157 const vec
<tree
, va_gc
> *);
158 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
159 #define convert_like(CONV, EXPR, COMPLAIN) \
160 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, \
161 /*issue_conversion_warnings=*/true, \
162 /*c_cast_p=*/false, (COMPLAIN))
163 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
164 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), \
165 /*issue_conversion_warnings=*/true, \
166 /*c_cast_p=*/false, (COMPLAIN))
167 static tree
convert_like_real (conversion
*, tree
, tree
, int, bool,
168 bool, tsubst_flags_t
);
169 static void op_error (location_t
, enum tree_code
, enum tree_code
, tree
,
171 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int,
173 static void print_z_candidate (location_t
, const char *, struct z_candidate
*);
174 static void print_z_candidates (location_t
, struct z_candidate
*);
175 static tree
build_this (tree
);
176 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
177 static bool any_strictly_viable (struct z_candidate
*);
178 static struct z_candidate
*add_template_candidate
179 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
180 tree
, tree
, tree
, int, unification_kind_t
, tsubst_flags_t
);
181 static struct z_candidate
*add_template_candidate_real
182 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
183 tree
, tree
, tree
, int, tree
, unification_kind_t
, tsubst_flags_t
);
184 static void add_builtin_candidates
185 (struct z_candidate
**, enum tree_code
, enum tree_code
,
186 tree
, tree
*, int, tsubst_flags_t
);
187 static void add_builtin_candidate
188 (struct z_candidate
**, enum tree_code
, enum tree_code
,
189 tree
, tree
, tree
, tree
*, tree
*, int, tsubst_flags_t
);
190 static bool is_complete (tree
);
191 static void build_builtin_candidate
192 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
193 int, tsubst_flags_t
);
194 static struct z_candidate
*add_conv_candidate
195 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
196 tree
, tsubst_flags_t
);
197 static struct z_candidate
*add_function_candidate
198 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
199 tree
, int, conversion
**, tsubst_flags_t
);
200 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int,
202 static conversion
*reference_binding (tree
, tree
, tree
, bool, int,
204 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
205 static conversion
*build_list_conv (tree
, tree
, int, tsubst_flags_t
);
206 static conversion
*next_conversion (conversion
*);
207 static bool is_subseq (conversion
*, conversion
*);
208 static conversion
*maybe_handle_ref_bind (conversion
**);
209 static void maybe_handle_implicit_object (conversion
**);
210 static struct z_candidate
*add_candidate
211 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, size_t,
212 conversion
**, tree
, tree
, int, struct rejection_reason
*, int);
213 static tree
source_type (conversion
*);
214 static void add_warning (struct z_candidate
*, struct z_candidate
*);
215 static bool reference_compatible_p (tree
, tree
);
216 static conversion
*direct_reference_binding (tree
, conversion
*);
217 static bool promoted_arithmetic_type_p (tree
);
218 static conversion
*conditional_conversion (tree
, tree
, tsubst_flags_t
);
219 static char *name_as_c_string (tree
, tree
, bool *);
220 static tree
prep_operand (tree
);
221 static void add_candidates (tree
, tree
, const vec
<tree
, va_gc
> *, tree
, tree
,
222 bool, tree
, tree
, int, struct z_candidate
**,
224 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
225 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
227 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
228 NAME can take many forms... */
231 check_dtor_name (tree basetype
, tree name
)
233 /* Just accept something we've already complained about. */
234 if (name
== error_mark_node
)
237 if (TREE_CODE (name
) == TYPE_DECL
)
238 name
= TREE_TYPE (name
);
239 else if (TYPE_P (name
))
241 else if (identifier_p (name
))
243 if ((MAYBE_CLASS_TYPE_P (basetype
)
244 || TREE_CODE (basetype
) == ENUMERAL_TYPE
)
245 && name
== constructor_name (basetype
))
248 name
= get_type_value (name
);
254 template <class T> struct S { ~S(); };
258 NAME will be a class template. */
259 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
263 if (!name
|| name
== error_mark_node
)
265 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
268 /* We want the address of a function or method. We avoid creating a
269 pointer-to-member function. */
272 build_addr_func (tree function
, tsubst_flags_t complain
)
274 tree type
= TREE_TYPE (function
);
276 /* We have to do these by hand to avoid real pointer to member
278 if (TREE_CODE (type
) == METHOD_TYPE
)
280 if (TREE_CODE (function
) == OFFSET_REF
)
282 tree object
= build_address (TREE_OPERAND (function
, 0));
283 return get_member_function_from_ptrfunc (&object
,
284 TREE_OPERAND (function
, 1),
287 function
= build_address (function
);
290 function
= decay_conversion (function
, complain
, /*reject_builtin=*/false);
295 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
296 POINTER_TYPE to those. Note, pointer to member function types
297 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
298 two variants. build_call_a is the primitive taking an array of
299 arguments, while build_call_n is a wrapper that handles varargs. */
302 build_call_n (tree function
, int n
, ...)
305 return build_call_a (function
, 0, NULL
);
308 tree
*argarray
= XALLOCAVEC (tree
, n
);
313 for (i
= 0; i
< n
; i
++)
314 argarray
[i
] = va_arg (ap
, tree
);
316 return build_call_a (function
, n
, argarray
);
320 /* Update various flags in cfun and the call itself based on what is being
321 called. Split out of build_call_a so that bot_manip can use it too. */
324 set_flags_from_callee (tree call
)
326 /* Handle both CALL_EXPRs and AGGR_INIT_EXPRs. */
327 tree decl
= cp_get_callee_fndecl_nofold (call
);
329 /* We check both the decl and the type; a function may be known not to
330 throw without being declared throw(). */
331 bool nothrow
= decl
&& TREE_NOTHROW (decl
);
332 tree callee
= cp_get_callee (call
);
334 nothrow
|= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (callee
)));
335 else if (TREE_CODE (call
) == CALL_EXPR
336 && internal_fn_flags (CALL_EXPR_IFN (call
)) & ECF_NOTHROW
)
339 if (!nothrow
&& at_function_scope_p () && cfun
&& cp_function_chain
)
340 cp_function_chain
->can_throw
= 1;
342 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
343 current_function_returns_abnormally
= 1;
345 TREE_NOTHROW (call
) = nothrow
;
349 build_call_a (tree function
, int n
, tree
*argarray
)
356 function
= build_addr_func (function
, tf_warning_or_error
);
358 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
359 fntype
= TREE_TYPE (TREE_TYPE (function
));
360 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
361 || TREE_CODE (fntype
) == METHOD_TYPE
);
362 result_type
= TREE_TYPE (fntype
);
363 /* An rvalue has no cv-qualifiers. */
364 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
365 result_type
= cv_unqualified (result_type
);
367 function
= build_call_array_loc (input_location
,
368 result_type
, function
, n
, argarray
);
369 set_flags_from_callee (function
);
371 decl
= get_callee_fndecl (function
);
373 if (decl
&& !TREE_USED (decl
))
375 /* We invoke build_call directly for several library
376 functions. These may have been declared normally if
377 we're building libgcc, so we can't just check
379 gcc_assert (DECL_ARTIFICIAL (decl
)
380 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
385 require_complete_eh_spec_types (fntype
, decl
);
387 TREE_HAS_CONSTRUCTOR (function
) = (decl
&& DECL_CONSTRUCTOR_P (decl
));
389 /* Don't pass empty class objects by value. This is useful
390 for tags in STL, which are used to control overload resolution.
391 We don't need to handle other cases of copying empty classes. */
392 if (! decl
|| ! DECL_BUILT_IN (decl
))
393 for (i
= 0; i
< n
; i
++)
395 tree arg
= CALL_EXPR_ARG (function
, i
);
396 if (is_empty_class (TREE_TYPE (arg
))
397 && ! TREE_ADDRESSABLE (TREE_TYPE (arg
)))
399 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (arg
));
400 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (t
), arg
, t
);
401 CALL_EXPR_ARG (function
, i
) = arg
;
408 /* New overloading code. */
412 struct candidate_warning
{
414 candidate_warning
*next
;
417 /* Information for providing diagnostics about why overloading failed. */
419 enum rejection_reason_code
{
422 rr_explicit_conversion
,
423 rr_template_conversion
,
425 rr_bad_arg_conversion
,
426 rr_template_unification
,
429 rr_constraint_failure
432 struct conversion_info
{
433 /* The index of the argument, 0-based. */
435 /* The actual argument or its type. */
437 /* The type of the parameter. */
441 struct rejection_reason
{
442 enum rejection_reason_code code
;
444 /* Information about an arity mismatch. */
446 /* The expected number of arguments. */
448 /* The actual number of arguments in the call. */
450 /* Whether the call was a varargs call. */
453 /* Information about an argument conversion mismatch. */
454 struct conversion_info conversion
;
455 /* Same, but for bad argument conversions. */
456 struct conversion_info bad_conversion
;
457 /* Information about template unification failures. These are the
458 parameters passed to fn_type_unification. */
466 unification_kind_t strict
;
468 } template_unification
;
469 /* Information about template instantiation failures. These are the
470 parameters passed to instantiate_template. */
474 } template_instantiation
;
479 /* The FUNCTION_DECL that will be called if this candidate is
480 selected by overload resolution. */
482 /* If not NULL_TREE, the first argument to use when calling this
485 /* The rest of the arguments to use when calling this function. If
486 there are no further arguments this may be NULL or it may be an
488 const vec
<tree
, va_gc
> *args
;
489 /* The implicit conversion sequences for each of the arguments to
492 /* The number of implicit conversion sequences. */
494 /* If FN is a user-defined conversion, the standard conversion
495 sequence from the type returned by FN to the desired destination
497 conversion
*second_conv
;
498 struct rejection_reason
*reason
;
499 /* If FN is a member function, the binfo indicating the path used to
500 qualify the name of FN at the call site. This path is used to
501 determine whether or not FN is accessible if it is selected by
502 overload resolution. The DECL_CONTEXT of FN will always be a
503 (possibly improper) base of this binfo. */
505 /* If FN is a non-static member function, the binfo indicating the
506 subobject to which the `this' pointer should be converted if FN
507 is selected by overload resolution. The type pointed to by
508 the `this' pointer must correspond to the most derived class
509 indicated by the CONVERSION_PATH. */
510 tree conversion_path
;
513 candidate_warning
*warnings
;
517 /* The flags active in add_candidate. */
521 /* Returns true iff T is a null pointer constant in the sense of
525 null_ptr_cst_p (tree t
)
527 tree type
= TREE_TYPE (t
);
531 A null pointer constant is an integral constant expression
532 (_expr.const_) rvalue of integer type that evaluates to zero or
533 an rvalue of type std::nullptr_t. */
534 if (NULLPTR_TYPE_P (type
))
537 if (cxx_dialect
>= cxx11
)
539 STRIP_ANY_LOCATION_WRAPPER (t
);
541 /* Core issue 903 says only literal 0 is a null pointer constant. */
542 if (TREE_CODE (type
) == INTEGER_TYPE
543 && !char_type_p (type
)
544 && TREE_CODE (t
) == INTEGER_CST
546 && !TREE_OVERFLOW (t
))
549 else if (CP_INTEGRAL_TYPE_P (type
))
551 t
= fold_non_dependent_expr (t
, tf_none
);
553 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
560 /* Returns true iff T is a null member pointer value (4.11). */
563 null_member_pointer_value_p (tree t
)
565 tree type
= TREE_TYPE (t
);
568 else if (TYPE_PTRMEMFUNC_P (type
))
569 return (TREE_CODE (t
) == CONSTRUCTOR
570 && integer_zerop (CONSTRUCTOR_ELT (t
, 0)->value
));
571 else if (TYPE_PTRDATAMEM_P (type
))
572 return integer_all_onesp (t
);
577 /* Returns nonzero if PARMLIST consists of only default parms,
578 ellipsis, and/or undeduced parameter packs. */
581 sufficient_parms_p (const_tree parmlist
)
583 for (; parmlist
&& parmlist
!= void_list_node
;
584 parmlist
= TREE_CHAIN (parmlist
))
585 if (!TREE_PURPOSE (parmlist
)
586 && !PACK_EXPANSION_P (TREE_VALUE (parmlist
)))
591 /* Allocate N bytes of memory from the conversion obstack. The memory
592 is zeroed before being returned. */
595 conversion_obstack_alloc (size_t n
)
598 if (!conversion_obstack_initialized
)
600 gcc_obstack_init (&conversion_obstack
);
601 conversion_obstack_initialized
= true;
603 p
= obstack_alloc (&conversion_obstack
, n
);
608 /* Allocate rejection reasons. */
610 static struct rejection_reason
*
611 alloc_rejection (enum rejection_reason_code code
)
613 struct rejection_reason
*p
;
614 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
619 static struct rejection_reason
*
620 arity_rejection (tree first_arg
, int expected
, int actual
)
622 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
623 int adjust
= first_arg
!= NULL_TREE
;
624 r
->u
.arity
.expected
= expected
- adjust
;
625 r
->u
.arity
.actual
= actual
- adjust
;
629 static struct rejection_reason
*
630 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
632 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
633 int adjust
= first_arg
!= NULL_TREE
;
634 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
635 r
->u
.conversion
.from
= from
;
636 r
->u
.conversion
.to_type
= to
;
640 static struct rejection_reason
*
641 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
643 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
644 int adjust
= first_arg
!= NULL_TREE
;
645 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
646 r
->u
.bad_conversion
.from
= from
;
647 r
->u
.bad_conversion
.to_type
= to
;
651 static struct rejection_reason
*
652 explicit_conversion_rejection (tree from
, tree to
)
654 struct rejection_reason
*r
= alloc_rejection (rr_explicit_conversion
);
655 r
->u
.conversion
.n_arg
= 0;
656 r
->u
.conversion
.from
= from
;
657 r
->u
.conversion
.to_type
= to
;
661 static struct rejection_reason
*
662 template_conversion_rejection (tree from
, tree to
)
664 struct rejection_reason
*r
= alloc_rejection (rr_template_conversion
);
665 r
->u
.conversion
.n_arg
= 0;
666 r
->u
.conversion
.from
= from
;
667 r
->u
.conversion
.to_type
= to
;
671 static struct rejection_reason
*
672 template_unification_rejection (tree tmpl
, tree explicit_targs
, tree targs
,
673 const tree
*args
, unsigned int nargs
,
674 tree return_type
, unification_kind_t strict
,
677 size_t args_n_bytes
= sizeof (*args
) * nargs
;
678 tree
*args1
= (tree
*) conversion_obstack_alloc (args_n_bytes
);
679 struct rejection_reason
*r
= alloc_rejection (rr_template_unification
);
680 r
->u
.template_unification
.tmpl
= tmpl
;
681 r
->u
.template_unification
.explicit_targs
= explicit_targs
;
682 r
->u
.template_unification
.num_targs
= TREE_VEC_LENGTH (targs
);
683 /* Copy args to our own storage. */
684 memcpy (args1
, args
, args_n_bytes
);
685 r
->u
.template_unification
.args
= args1
;
686 r
->u
.template_unification
.nargs
= nargs
;
687 r
->u
.template_unification
.return_type
= return_type
;
688 r
->u
.template_unification
.strict
= strict
;
689 r
->u
.template_unification
.flags
= flags
;
693 static struct rejection_reason
*
694 template_unification_error_rejection (void)
696 return alloc_rejection (rr_template_unification
);
699 static struct rejection_reason
*
700 invalid_copy_with_fn_template_rejection (void)
702 struct rejection_reason
*r
= alloc_rejection (rr_invalid_copy
);
706 static struct rejection_reason
*
707 inherited_ctor_rejection (void)
709 struct rejection_reason
*r
= alloc_rejection (rr_inherited_ctor
);
713 // Build a constraint failure record, saving information into the
714 // template_instantiation field of the rejection. If FN is not a template
715 // declaration, the TMPL member is the FN declaration and TARGS is empty.
717 static struct rejection_reason
*
718 constraint_failure (tree fn
)
720 struct rejection_reason
*r
= alloc_rejection (rr_constraint_failure
);
721 if (tree ti
= DECL_TEMPLATE_INFO (fn
))
723 r
->u
.template_instantiation
.tmpl
= TI_TEMPLATE (ti
);
724 r
->u
.template_instantiation
.targs
= TI_ARGS (ti
);
728 r
->u
.template_instantiation
.tmpl
= fn
;
729 r
->u
.template_instantiation
.targs
= NULL_TREE
;
734 /* Dynamically allocate a conversion. */
737 alloc_conversion (conversion_kind kind
)
740 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
745 /* Make sure that all memory on the conversion obstack has been
749 validate_conversion_obstack (void)
751 if (conversion_obstack_initialized
)
752 gcc_assert ((obstack_next_free (&conversion_obstack
)
753 == obstack_base (&conversion_obstack
)));
756 /* Dynamically allocate an array of N conversions. */
759 alloc_conversions (size_t n
)
761 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
765 build_conv (conversion_kind code
, tree type
, conversion
*from
)
768 conversion_rank rank
= CONVERSION_RANK (from
);
770 /* Note that the caller is responsible for filling in t->cand for
771 user-defined conversions. */
772 t
= alloc_conversion (code
);
796 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
797 t
->bad_p
= from
->bad_p
;
802 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
803 specialization of std::initializer_list<T>, if such a conversion is
807 build_list_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
809 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
810 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
811 conversion
**subconvs
= alloc_conversions (len
);
816 /* Within a list-initialization we can have more user-defined
818 flags
&= ~LOOKUP_NO_CONVERSION
;
819 /* But no narrowing conversions. */
820 flags
|= LOOKUP_NO_NARROWING
;
822 /* Can't make an array of these types. */
823 if (TYPE_REF_P (elttype
)
824 || TREE_CODE (elttype
) == FUNCTION_TYPE
825 || VOID_TYPE_P (elttype
))
828 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
831 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
832 false, flags
, complain
);
839 t
= alloc_conversion (ck_list
);
841 t
->u
.list
= subconvs
;
844 for (i
= 0; i
< len
; ++i
)
846 conversion
*sub
= subconvs
[i
];
847 if (sub
->rank
> t
->rank
)
849 if (sub
->user_conv_p
)
850 t
->user_conv_p
= true;
858 /* Return the next conversion of the conversion chain (if applicable),
859 or NULL otherwise. Please use this function instead of directly
860 accessing fields of struct conversion. */
863 next_conversion (conversion
*conv
)
866 || conv
->kind
== ck_identity
867 || conv
->kind
== ck_ambig
868 || conv
->kind
== ck_list
)
873 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
874 is a valid aggregate initializer for array type ATYPE. */
877 can_convert_array (tree atype
, tree ctor
, int flags
, tsubst_flags_t complain
)
880 tree elttype
= TREE_TYPE (atype
);
881 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
883 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
885 if (TREE_CODE (elttype
) == ARRAY_TYPE
886 && TREE_CODE (val
) == CONSTRUCTOR
)
887 ok
= can_convert_array (elttype
, val
, flags
, complain
);
889 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
,
897 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
898 aggregate class, if such a conversion is possible. */
901 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
903 unsigned HOST_WIDE_INT i
= 0;
905 tree field
= next_initializable_field (TYPE_FIELDS (type
));
906 tree empty_ctor
= NULL_TREE
;
908 /* We already called reshape_init in implicit_conversion. */
910 /* The conversions within the init-list aren't affected by the enclosing
911 context; they're always simple copy-initialization. */
912 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
914 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
916 tree ftype
= TREE_TYPE (field
);
920 if (i
< CONSTRUCTOR_NELTS (ctor
))
921 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
922 else if (DECL_INITIAL (field
))
923 val
= get_nsdmi (field
, /*ctor*/false, complain
);
924 else if (TYPE_REF_P (ftype
))
925 /* Value-initialization of reference is ill-formed. */
929 if (empty_ctor
== NULL_TREE
)
930 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
935 if (TREE_CODE (ftype
) == ARRAY_TYPE
936 && TREE_CODE (val
) == CONSTRUCTOR
)
937 ok
= can_convert_array (ftype
, val
, flags
, complain
);
939 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
945 if (TREE_CODE (type
) == UNION_TYPE
)
949 if (i
< CONSTRUCTOR_NELTS (ctor
))
952 c
= alloc_conversion (ck_aggr
);
955 c
->user_conv_p
= true;
956 c
->check_narrowing
= true;
961 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
962 array type, if such a conversion is possible. */
965 build_array_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
968 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
969 tree elttype
= TREE_TYPE (type
);
974 enum conversion_rank rank
= cr_exact
;
976 /* We might need to propagate the size from the element to the array. */
977 complete_type (type
);
979 if (TYPE_DOMAIN (type
)
980 && !variably_modified_type_p (TYPE_DOMAIN (type
), NULL_TREE
))
982 unsigned HOST_WIDE_INT alen
= tree_to_uhwi (array_type_nelts_top (type
));
987 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
989 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
992 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
993 false, flags
, complain
);
997 if (sub
->rank
> rank
)
999 if (sub
->user_conv_p
)
1005 c
= alloc_conversion (ck_aggr
);
1008 c
->user_conv_p
= user
;
1014 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1015 complex type, if such a conversion is possible. */
1018 build_complex_conv (tree type
, tree ctor
, int flags
,
1019 tsubst_flags_t complain
)
1022 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1023 tree elttype
= TREE_TYPE (type
);
1028 enum conversion_rank rank
= cr_exact
;
1033 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1035 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1038 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1039 false, flags
, complain
);
1043 if (sub
->rank
> rank
)
1045 if (sub
->user_conv_p
)
1051 c
= alloc_conversion (ck_aggr
);
1054 c
->user_conv_p
= user
;
1060 /* Build a representation of the identity conversion from EXPR to
1061 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1064 build_identity_conv (tree type
, tree expr
)
1068 c
= alloc_conversion (ck_identity
);
1075 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1076 were multiple user-defined conversions to accomplish the job.
1077 Build a conversion that indicates that ambiguity. */
1080 build_ambiguous_conv (tree type
, tree expr
)
1084 c
= alloc_conversion (ck_ambig
);
1092 strip_top_quals (tree t
)
1094 if (TREE_CODE (t
) == ARRAY_TYPE
)
1096 return cp_build_qualified_type (t
, 0);
1099 /* Returns the standard conversion path (see [conv]) from type FROM to type
1100 TO, if any. For proper handling of null pointer constants, you must
1101 also pass the expression EXPR to convert from. If C_CAST_P is true,
1102 this conversion is coming from a C-style cast. */
1105 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1106 int flags
, tsubst_flags_t complain
)
1108 enum tree_code fcode
, tcode
;
1110 bool fromref
= false;
1113 to
= non_reference (to
);
1114 if (TYPE_REF_P (from
))
1117 from
= TREE_TYPE (from
);
1120 to
= strip_top_quals (to
);
1121 from
= strip_top_quals (from
);
1123 if (expr
&& type_unknown_p (expr
))
1125 if (TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1127 tsubst_flags_t tflags
= tf_conv
;
1128 expr
= instantiate_type (to
, expr
, tflags
);
1129 if (expr
== error_mark_node
)
1131 from
= TREE_TYPE (expr
);
1133 else if (TREE_CODE (to
) == BOOLEAN_TYPE
)
1135 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1136 expr
= resolve_nondeduced_context (expr
, complain
);
1137 from
= TREE_TYPE (expr
);
1141 fcode
= TREE_CODE (from
);
1142 tcode
= TREE_CODE (to
);
1144 conv
= build_identity_conv (from
, expr
);
1145 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1147 from
= type_decays_to (from
);
1148 fcode
= TREE_CODE (from
);
1149 /* Tell convert_like_real that we're using the address. */
1150 conv
->rvaluedness_matches_p
= true;
1151 conv
= build_conv (ck_lvalue
, from
, conv
);
1153 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1154 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1155 express the copy constructor call required by copy-initialization. */
1156 else if (fromref
|| (expr
&& obvalue_p (expr
)))
1161 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1164 from
= strip_top_quals (bitfield_type
);
1165 fcode
= TREE_CODE (from
);
1168 conv
= build_conv (ck_rvalue
, from
, conv
);
1169 if (flags
& LOOKUP_PREFER_RVALUE
)
1170 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1171 conv
->rvaluedness_matches_p
= true;
1174 /* Allow conversion between `__complex__' data types. */
1175 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1177 /* The standard conversion sequence to convert FROM to TO is
1178 the standard conversion sequence to perform componentwise
1180 conversion
*part_conv
= standard_conversion
1181 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
,
1186 conv
= build_conv (part_conv
->kind
, to
, conv
);
1187 conv
->rank
= part_conv
->rank
;
1195 if (same_type_p (from
, to
))
1197 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1198 conv
->type
= qualified_to
;
1203 A null pointer constant can be converted to a pointer type; ... A
1204 null pointer constant of integral type can be converted to an
1205 rvalue of type std::nullptr_t. */
1206 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1207 || NULLPTR_TYPE_P (to
))
1208 && ((expr
&& null_ptr_cst_p (expr
))
1209 || NULLPTR_TYPE_P (from
)))
1210 conv
= build_conv (ck_std
, to
, conv
);
1211 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1212 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1214 /* For backwards brain damage compatibility, allow interconversion of
1215 pointers and integers with a pedwarn. */
1216 conv
= build_conv (ck_std
, to
, conv
);
1219 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1221 /* For backwards brain damage compatibility, allow interconversion of
1222 enums and integers with a pedwarn. */
1223 conv
= build_conv (ck_std
, to
, conv
);
1226 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1227 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1232 if (tcode
== POINTER_TYPE
)
1234 to_pointee
= TREE_TYPE (to
);
1235 from_pointee
= TREE_TYPE (from
);
1237 /* Since this is the target of a pointer, it can't have function
1238 qualifiers, so any TYPE_QUALS must be for attributes const or
1239 noreturn. Strip them. */
1240 if (TREE_CODE (to_pointee
) == FUNCTION_TYPE
1241 && TYPE_QUALS (to_pointee
))
1242 to_pointee
= build_qualified_type (to_pointee
, TYPE_UNQUALIFIED
);
1243 if (TREE_CODE (from_pointee
) == FUNCTION_TYPE
1244 && TYPE_QUALS (from_pointee
))
1245 from_pointee
= build_qualified_type (from_pointee
, TYPE_UNQUALIFIED
);
1249 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1250 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1253 if (tcode
== POINTER_TYPE
1254 && same_type_ignoring_top_level_qualifiers_p (from_pointee
,
1257 else if (VOID_TYPE_P (to_pointee
)
1258 && !TYPE_PTRDATAMEM_P (from
)
1259 && TREE_CODE (from_pointee
) != FUNCTION_TYPE
)
1261 tree nfrom
= TREE_TYPE (from
);
1262 /* Don't try to apply restrict to void. */
1263 int quals
= cp_type_quals (nfrom
) & ~TYPE_QUAL_RESTRICT
;
1264 from_pointee
= cp_build_qualified_type (void_type_node
, quals
);
1265 from
= build_pointer_type (from_pointee
);
1266 conv
= build_conv (ck_ptr
, from
, conv
);
1268 else if (TYPE_PTRDATAMEM_P (from
))
1270 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1271 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1273 if (same_type_p (fbase
, tbase
))
1274 /* No base conversion needed. */;
1275 else if (DERIVED_FROM_P (fbase
, tbase
)
1276 && (same_type_ignoring_top_level_qualifiers_p
1277 (from_pointee
, to_pointee
)))
1279 from
= build_ptrmem_type (tbase
, from_pointee
);
1280 conv
= build_conv (ck_pmem
, from
, conv
);
1285 else if (CLASS_TYPE_P (from_pointee
)
1286 && CLASS_TYPE_P (to_pointee
)
1289 An rvalue of type "pointer to cv D," where D is a
1290 class type, can be converted to an rvalue of type
1291 "pointer to cv B," where B is a base class (clause
1292 _class.derived_) of D. If B is an inaccessible
1293 (clause _class.access_) or ambiguous
1294 (_class.member.lookup_) base class of D, a program
1295 that necessitates this conversion is ill-formed.
1296 Therefore, we use DERIVED_FROM_P, and do not check
1297 access or uniqueness. */
1298 && DERIVED_FROM_P (to_pointee
, from_pointee
))
1301 = cp_build_qualified_type (to_pointee
,
1302 cp_type_quals (from_pointee
));
1303 from
= build_pointer_type (from_pointee
);
1304 conv
= build_conv (ck_ptr
, from
, conv
);
1305 conv
->base_p
= true;
1308 if (same_type_p (from
, to
))
1310 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
1311 /* In a C-style cast, we ignore CV-qualification because we
1312 are allowed to perform a static_cast followed by a
1314 conv
= build_conv (ck_qual
, to
, conv
);
1315 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1316 conv
= build_conv (ck_qual
, to
, conv
);
1317 else if (expr
&& string_conv_p (to
, expr
, 0))
1318 /* converting from string constant to char *. */
1319 conv
= build_conv (ck_qual
, to
, conv
);
1320 else if (fnptr_conv_p (to
, from
))
1321 conv
= build_conv (ck_fnptr
, to
, conv
);
1322 /* Allow conversions among compatible ObjC pointer types (base
1323 conversions have been already handled above). */
1324 else if (c_dialect_objc ()
1325 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1326 conv
= build_conv (ck_ptr
, to
, conv
);
1327 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1329 conv
= build_conv (ck_ptr
, to
, conv
);
1337 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1339 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1340 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1341 tree fbase
= class_of_this_parm (fromfn
);
1342 tree tbase
= class_of_this_parm (tofn
);
1344 if (!DERIVED_FROM_P (fbase
, tbase
))
1347 tree fstat
= static_fn_type (fromfn
);
1348 tree tstat
= static_fn_type (tofn
);
1349 if (same_type_p (tstat
, fstat
)
1350 || fnptr_conv_p (tstat
, fstat
))
1355 if (!same_type_p (fbase
, tbase
))
1357 from
= build_memfn_type (fstat
,
1359 cp_type_quals (tbase
),
1360 type_memfn_rqual (tofn
));
1361 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1362 conv
= build_conv (ck_pmem
, from
, conv
);
1363 conv
->base_p
= true;
1365 if (fnptr_conv_p (tstat
, fstat
))
1366 conv
= build_conv (ck_fnptr
, to
, conv
);
1368 else if (tcode
== BOOLEAN_TYPE
)
1372 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1373 to member type can be converted to a prvalue of type bool. ...
1374 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1375 std::nullptr_t can be converted to a prvalue of type bool; */
1376 if (ARITHMETIC_TYPE_P (from
)
1377 || UNSCOPED_ENUM_P (from
)
1378 || fcode
== POINTER_TYPE
1379 || TYPE_PTRMEM_P (from
)
1380 || NULLPTR_TYPE_P (from
))
1382 conv
= build_conv (ck_std
, to
, conv
);
1383 if (fcode
== POINTER_TYPE
1384 || TYPE_PTRDATAMEM_P (from
)
1385 || (TYPE_PTRMEMFUNC_P (from
)
1386 && conv
->rank
< cr_pbool
)
1387 || NULLPTR_TYPE_P (from
))
1388 conv
->rank
= cr_pbool
;
1389 if (NULLPTR_TYPE_P (from
) && (flags
& LOOKUP_ONLYCONVERTING
))
1396 /* We don't check for ENUMERAL_TYPE here because there are no standard
1397 conversions to enum type. */
1398 /* As an extension, allow conversion to complex type. */
1399 else if (ARITHMETIC_TYPE_P (to
))
1401 if (! (INTEGRAL_CODE_P (fcode
)
1402 || (fcode
== REAL_TYPE
&& !(flags
& LOOKUP_NO_NON_INTEGRAL
)))
1403 || SCOPED_ENUM_P (from
))
1405 conv
= build_conv (ck_std
, to
, conv
);
1407 /* Give this a better rank if it's a promotion. */
1408 if (same_type_p (to
, type_promotes_to (from
))
1409 && next_conversion (conv
)->rank
<= cr_promotion
)
1410 conv
->rank
= cr_promotion
;
1412 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1413 && vector_types_convertible_p (from
, to
, false))
1414 return build_conv (ck_std
, to
, conv
);
1415 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1416 && is_properly_derived_from (from
, to
))
1418 if (conv
->kind
== ck_rvalue
)
1419 conv
= next_conversion (conv
);
1420 conv
= build_conv (ck_base
, to
, conv
);
1421 /* The derived-to-base conversion indicates the initialization
1422 of a parameter with base type from an object of a derived
1423 type. A temporary object is created to hold the result of
1424 the conversion unless we're binding directly to a reference. */
1425 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1430 if (flags
& LOOKUP_NO_NARROWING
)
1431 conv
->check_narrowing
= true;
1436 /* Returns nonzero if T1 is reference-related to T2. */
1439 reference_related_p (tree t1
, tree t2
)
1441 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1444 t1
= TYPE_MAIN_VARIANT (t1
);
1445 t2
= TYPE_MAIN_VARIANT (t2
);
1449 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1450 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1452 return (same_type_p (t1
, t2
)
1453 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1454 && DERIVED_FROM_P (t1
, t2
)));
1457 /* Returns nonzero if T1 is reference-compatible with T2. */
1460 reference_compatible_p (tree t1
, tree t2
)
1464 "cv1 T1" is reference compatible with "cv2 T2" if
1465 * T1 is reference-related to T2 or
1466 * T2 is "noexcept function" and T1 is "function", where the
1467 function types are otherwise the same,
1468 and cv1 is the same cv-qualification as, or greater cv-qualification
1470 return ((reference_related_p (t1
, t2
)
1471 || fnptr_conv_p (t1
, t2
))
1472 && at_least_as_qualified_p (t1
, t2
));
1475 /* A reference of the indicated TYPE is being bound directly to the
1476 expression represented by the implicit conversion sequence CONV.
1477 Return a conversion sequence for this binding. */
1480 direct_reference_binding (tree type
, conversion
*conv
)
1484 gcc_assert (TYPE_REF_P (type
));
1485 gcc_assert (!TYPE_REF_P (conv
->type
));
1487 t
= TREE_TYPE (type
);
1489 if (conv
->kind
== ck_identity
)
1490 /* Mark the identity conv as to not decay to rvalue. */
1491 conv
->rvaluedness_matches_p
= true;
1495 When a parameter of reference type binds directly
1496 (_dcl.init.ref_) to an argument expression, the implicit
1497 conversion sequence is the identity conversion, unless the
1498 argument expression has a type that is a derived class of the
1499 parameter type, in which case the implicit conversion sequence is
1500 a derived-to-base Conversion.
1502 If the parameter binds directly to the result of applying a
1503 conversion function to the argument expression, the implicit
1504 conversion sequence is a user-defined conversion sequence
1505 (_over.ics.user_), with the second standard conversion sequence
1506 either an identity conversion or, if the conversion function
1507 returns an entity of a type that is a derived class of the
1508 parameter type, a derived-to-base conversion. */
1509 if (is_properly_derived_from (conv
->type
, t
))
1511 /* Represent the derived-to-base conversion. */
1512 conv
= build_conv (ck_base
, t
, conv
);
1513 /* We will actually be binding to the base-class subobject in
1514 the derived class, so we mark this conversion appropriately.
1515 That way, convert_like knows not to generate a temporary. */
1516 conv
->need_temporary_p
= false;
1519 return build_conv (ck_ref_bind
, type
, conv
);
1522 /* Returns the conversion path from type FROM to reference type TO for
1523 purposes of reference binding. For lvalue binding, either pass a
1524 reference type to FROM or an lvalue expression to EXPR. If the
1525 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1526 the conversion returned. If C_CAST_P is true, this
1527 conversion is coming from a C-style cast. */
1530 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1531 tsubst_flags_t complain
)
1533 conversion
*conv
= NULL
;
1534 tree to
= TREE_TYPE (rto
);
1539 cp_lvalue_kind gl_kind
;
1542 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1544 expr
= instantiate_type (to
, expr
, tf_none
);
1545 if (expr
== error_mark_node
)
1547 from
= TREE_TYPE (expr
);
1550 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1552 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1553 /* DR 1288: Otherwise, if the initializer list has a single element
1554 of type E and ... [T's] referenced type is reference-related to E,
1555 the object or reference is initialized from that element... */
1556 if (CONSTRUCTOR_NELTS (expr
) == 1)
1558 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1559 if (error_operand_p (elt
))
1561 tree etype
= TREE_TYPE (elt
);
1562 if (reference_related_p (to
, etype
))
1569 /* Otherwise, if T is a reference type, a prvalue temporary of the type
1570 referenced by T is copy-list-initialized, and the reference is bound
1571 to that temporary. */
1572 CONSTRUCTOR_IS_DIRECT_INIT (expr
) = false;
1576 if (TYPE_REF_P (from
))
1578 from
= TREE_TYPE (from
);
1579 if (!TYPE_REF_IS_RVALUE (rfrom
)
1580 || TREE_CODE (from
) == FUNCTION_TYPE
)
1581 gl_kind
= clk_ordinary
;
1583 gl_kind
= clk_rvalueref
;
1586 gl_kind
= lvalue_kind (expr
);
1587 else if (CLASS_TYPE_P (from
)
1588 || TREE_CODE (from
) == ARRAY_TYPE
)
1589 gl_kind
= clk_class
;
1593 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1594 if ((flags
& LOOKUP_NO_TEMP_BIND
)
1595 && (gl_kind
& clk_class
))
1598 /* Same mask as real_lvalue_p. */
1599 is_lvalue
= gl_kind
&& !(gl_kind
& (clk_rvalueref
|clk_class
));
1602 if ((gl_kind
& clk_bitfield
) != 0)
1603 tfrom
= unlowered_expr_type (expr
);
1605 /* Figure out whether or not the types are reference-related and
1606 reference compatible. We have to do this after stripping
1607 references from FROM. */
1608 related_p
= reference_related_p (to
, tfrom
);
1609 /* If this is a C cast, first convert to an appropriately qualified
1610 type, so that we can later do a const_cast to the desired type. */
1611 if (related_p
&& c_cast_p
1612 && !at_least_as_qualified_p (to
, tfrom
))
1613 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1614 compatible_p
= reference_compatible_p (to
, tfrom
);
1616 /* Directly bind reference when target expression's type is compatible with
1617 the reference and expression is an lvalue. In DR391, the wording in
1618 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1619 const and rvalue references to rvalues of compatible class type.
1620 We should also do direct bindings for non-class xvalues. */
1621 if ((related_p
|| compatible_p
) && gl_kind
)
1625 If the initializer expression
1627 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1628 is reference-compatible with "cv2 T2,"
1630 the reference is bound directly to the initializer expression
1634 If the initializer expression is an rvalue, with T2 a class type,
1635 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1636 is bound to the object represented by the rvalue or to a sub-object
1637 within that object. */
1639 conv
= build_identity_conv (tfrom
, expr
);
1640 conv
= direct_reference_binding (rto
, conv
);
1642 if (TYPE_REF_P (rfrom
))
1643 /* Handle rvalue reference to function properly. */
1644 conv
->rvaluedness_matches_p
1645 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1647 conv
->rvaluedness_matches_p
1648 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1650 if ((gl_kind
& clk_bitfield
) != 0
1651 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1652 /* For the purposes of overload resolution, we ignore the fact
1653 this expression is a bitfield or packed field. (In particular,
1654 [over.ics.ref] says specifically that a function with a
1655 non-const reference parameter is viable even if the
1656 argument is a bitfield.)
1658 However, when we actually call the function we must create
1659 a temporary to which to bind the reference. If the
1660 reference is volatile, or isn't const, then we cannot make
1661 a temporary, so we just issue an error when the conversion
1663 conv
->need_temporary_p
= true;
1665 /* Don't allow binding of lvalues (other than function lvalues) to
1666 rvalue references. */
1667 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1668 && TREE_CODE (to
) != FUNCTION_TYPE
)
1671 /* Nor the reverse. */
1672 if (!is_lvalue
&& !TYPE_REF_IS_RVALUE (rto
)
1673 && (!CP_TYPE_CONST_NON_VOLATILE_P (to
)
1674 || (flags
& LOOKUP_NO_RVAL_BIND
))
1675 && TREE_CODE (to
) != FUNCTION_TYPE
)
1683 /* [class.conv.fct] A conversion function is never used to convert a
1684 (possibly cv-qualified) object to the (possibly cv-qualified) same
1685 object type (or a reference to it), to a (possibly cv-qualified) base
1686 class of that type (or a reference to it).... */
1687 else if (CLASS_TYPE_P (from
) && !related_p
1688 && !(flags
& LOOKUP_NO_CONVERSION
))
1692 If the initializer expression
1694 -- has a class type (i.e., T2 is a class type) can be
1695 implicitly converted to an lvalue of type "cv3 T3," where
1696 "cv1 T1" is reference-compatible with "cv3 T3". (this
1697 conversion is selected by enumerating the applicable
1698 conversion functions (_over.match.ref_) and choosing the
1699 best one through overload resolution. (_over.match_).
1701 the reference is bound to the lvalue result of the conversion
1702 in the second case. */
1703 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1706 return cand
->second_conv
;
1709 /* From this point on, we conceptually need temporaries, even if we
1710 elide them. Only the cases above are "direct bindings". */
1711 if (flags
& LOOKUP_NO_TEMP_BIND
)
1716 When a parameter of reference type is not bound directly to an
1717 argument expression, the conversion sequence is the one required
1718 to convert the argument expression to the underlying type of the
1719 reference according to _over.best.ics_. Conceptually, this
1720 conversion sequence corresponds to copy-initializing a temporary
1721 of the underlying type with the argument expression. Any
1722 difference in top-level cv-qualification is subsumed by the
1723 initialization itself and does not constitute a conversion. */
1727 Otherwise, the reference shall be an lvalue reference to a
1728 non-volatile const type, or the reference shall be an rvalue
1731 We try below to treat this as a bad conversion to improve diagnostics,
1732 but if TO is an incomplete class, we need to reject this conversion
1733 now to avoid unnecessary instantiation. */
1734 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
)
1735 && !COMPLETE_TYPE_P (to
))
1738 /* We're generating a temporary now, but don't bind any more in the
1739 conversion (specifically, don't slice the temporary returned by a
1740 conversion operator). */
1741 flags
|= LOOKUP_NO_TEMP_BIND
;
1743 /* Core issue 899: When [copy-]initializing a temporary to be bound
1744 to the first parameter of a copy constructor (12.8) called with
1745 a single argument in the context of direct-initialization,
1746 explicit conversion functions are also considered.
1748 So don't set LOOKUP_ONLYCONVERTING in that case. */
1749 if (!(flags
& LOOKUP_COPY_PARM
))
1750 flags
|= LOOKUP_ONLYCONVERTING
;
1753 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1758 if (conv
->user_conv_p
)
1760 /* If initializing the temporary used a conversion function,
1761 recalculate the second conversion sequence. */
1762 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1763 if (t
->kind
== ck_user
1764 && DECL_CONV_FN_P (t
->cand
->fn
))
1766 tree ftype
= TREE_TYPE (TREE_TYPE (t
->cand
->fn
));
1767 int sflags
= (flags
|LOOKUP_NO_CONVERSION
)&~LOOKUP_NO_TEMP_BIND
;
1768 conversion
*new_second
1769 = reference_binding (rto
, ftype
, NULL_TREE
, c_cast_p
,
1773 return merge_conversion_sequences (t
, new_second
);
1777 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1778 /* This reference binding, unlike those above, requires the
1779 creation of a temporary. */
1780 conv
->need_temporary_p
= true;
1781 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1785 Otherwise, the reference shall be an lvalue reference to a
1786 non-volatile const type, or the reference shall be an rvalue
1788 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1793 Otherwise, a temporary of type "cv1 T1" is created and
1794 initialized from the initializer expression using the rules for a
1795 non-reference copy initialization. If T1 is reference-related to
1796 T2, cv1 must be the same cv-qualification as, or greater
1797 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1798 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1804 /* Returns the implicit conversion sequence (see [over.ics]) from type
1805 FROM to type TO. The optional expression EXPR may affect the
1806 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1807 true, this conversion is coming from a C-style cast. */
1810 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1811 int flags
, tsubst_flags_t complain
)
1815 if (from
== error_mark_node
|| to
== error_mark_node
1816 || expr
== error_mark_node
)
1819 /* Other flags only apply to the primary function in overload
1820 resolution, or after we've chosen one. */
1821 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1822 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1823 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1825 /* FIXME: actually we don't want warnings either, but we can't just
1826 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1827 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1828 We really ought not to issue that warning until we've committed
1829 to that conversion. */
1830 complain
&= ~tf_error
;
1832 /* Call reshape_init early to remove redundant braces. */
1833 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
)
1834 && CLASS_TYPE_P (to
)
1835 && COMPLETE_TYPE_P (complete_type (to
))
1836 && !CLASSTYPE_NON_AGGREGATE (to
))
1838 expr
= reshape_init (to
, expr
, complain
);
1839 if (expr
== error_mark_node
)
1841 from
= TREE_TYPE (expr
);
1844 if (TYPE_REF_P (to
))
1845 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1847 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
, complain
);
1852 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1854 if (is_std_init_list (to
))
1855 return build_list_conv (to
, expr
, flags
, complain
);
1857 /* As an extension, allow list-initialization of _Complex. */
1858 if (TREE_CODE (to
) == COMPLEX_TYPE
)
1860 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1865 /* Allow conversion from an initializer-list with one element to a
1867 if (SCALAR_TYPE_P (to
))
1869 int nelts
= CONSTRUCTOR_NELTS (expr
);
1873 elt
= build_value_init (to
, tf_none
);
1874 else if (nelts
== 1)
1875 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1877 elt
= error_mark_node
;
1879 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1880 c_cast_p
, flags
, complain
);
1883 conv
->check_narrowing
= true;
1884 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1885 /* Too many levels of braces, i.e. '{{1}}'. */
1890 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1891 return build_array_conv (to
, expr
, flags
, complain
);
1894 if (expr
!= NULL_TREE
1895 && (MAYBE_CLASS_TYPE_P (from
)
1896 || MAYBE_CLASS_TYPE_P (to
))
1897 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1899 struct z_candidate
*cand
;
1901 if (CLASS_TYPE_P (to
)
1902 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
1903 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
1904 return build_aggr_conv (to
, expr
, flags
, complain
);
1906 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
1909 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
1910 && CONSTRUCTOR_NELTS (expr
) == 1
1911 && !is_list_ctor (cand
->fn
))
1913 /* "If C is not an initializer-list constructor and the
1914 initializer list has a single element of type cv U, where U is
1915 X or a class derived from X, the implicit conversion sequence
1916 has Exact Match rank if U is X, or Conversion rank if U is
1918 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1919 tree elttype
= TREE_TYPE (elt
);
1920 if (reference_related_p (to
, elttype
))
1921 return implicit_conversion (to
, elttype
, elt
,
1922 c_cast_p
, flags
, complain
);
1924 conv
= cand
->second_conv
;
1927 /* We used to try to bind a reference to a temporary here, but that
1928 is now handled after the recursive call to this function at the end
1929 of reference_binding. */
1936 /* Like implicit_conversion, but return NULL if the conversion is bad.
1938 This is not static so that check_non_deducible_conversion can call it within
1939 add_template_candidate_real as part of overload resolution; it should not be
1940 called outside of overload resolution. */
1943 good_conversion (tree to
, tree from
, tree expr
,
1944 int flags
, tsubst_flags_t complain
)
1946 conversion
*c
= implicit_conversion (to
, from
, expr
, /*cast*/false,
1953 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1954 functions. ARGS will not be changed until a single candidate is
1957 static struct z_candidate
*
1958 add_candidate (struct z_candidate
**candidates
,
1959 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
1960 size_t num_convs
, conversion
**convs
,
1961 tree access_path
, tree conversion_path
,
1962 int viable
, struct rejection_reason
*reason
,
1965 struct z_candidate
*cand
= (struct z_candidate
*)
1966 conversion_obstack_alloc (sizeof (struct z_candidate
));
1969 cand
->first_arg
= first_arg
;
1971 cand
->convs
= convs
;
1972 cand
->num_convs
= num_convs
;
1973 cand
->access_path
= access_path
;
1974 cand
->conversion_path
= conversion_path
;
1975 cand
->viable
= viable
;
1976 cand
->reason
= reason
;
1977 cand
->next
= *candidates
;
1978 cand
->flags
= flags
;
1984 /* Return the number of remaining arguments in the parameter list
1985 beginning with ARG. */
1988 remaining_arguments (tree arg
)
1992 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
1993 arg
= TREE_CHAIN (arg
))
1999 /* [over.match.copy]: When initializing a temporary object (12.2) to be bound
2000 to the first parameter of a constructor where the parameter is of type
2001 "reference to possibly cv-qualified T" and the constructor is called with a
2002 single argument in the context of direct-initialization of an object of type
2003 "cv2 T", explicit conversion functions are also considered.
2005 So set LOOKUP_COPY_PARM to let reference_binding know that
2006 it's being called in that context. */
2009 conv_flags (int i
, int nargs
, tree fn
, tree arg
, int flags
)
2013 if (i
== 0 && nargs
== 1 && DECL_CONSTRUCTOR_P (fn
)
2014 && (t
= FUNCTION_FIRST_USER_PARMTYPE (fn
))
2015 && (same_type_ignoring_top_level_qualifiers_p
2016 (non_reference (TREE_VALUE (t
)), DECL_CONTEXT (fn
))))
2018 if (!(flags
& LOOKUP_ONLYCONVERTING
))
2019 lflags
|= LOOKUP_COPY_PARM
;
2020 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
2021 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
2022 lflags
|= LOOKUP_NO_CONVERSION
;
2025 lflags
|= LOOKUP_ONLYCONVERTING
;
2030 /* Create an overload candidate for the function or method FN called
2031 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
2032 FLAGS is passed on to implicit_conversion.
2034 This does not change ARGS.
2036 CTYPE, if non-NULL, is the type we want to pretend this function
2037 comes from for purposes of overload resolution. */
2039 static struct z_candidate
*
2040 add_function_candidate (struct z_candidate
**candidates
,
2041 tree fn
, tree ctype
, tree first_arg
,
2042 const vec
<tree
, va_gc
> *args
, tree access_path
,
2043 tree conversion_path
, int flags
,
2045 tsubst_flags_t complain
)
2047 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2050 tree orig_first_arg
= first_arg
;
2053 struct rejection_reason
*reason
= NULL
;
2055 /* At this point we should not see any functions which haven't been
2056 explicitly declared, except for friend functions which will have
2057 been found using argument dependent lookup. */
2058 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
2060 /* The `this', `in_chrg' and VTT arguments to constructors are not
2061 considered in overload resolution. */
2062 if (DECL_CONSTRUCTOR_P (fn
))
2064 if (ctor_omit_inherited_parms (fn
))
2065 /* Bring back parameters omitted from an inherited ctor. */
2066 parmlist
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn
));
2068 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
2069 skip
= num_artificial_parms_for (fn
);
2070 if (skip
> 0 && first_arg
!= NULL_TREE
)
2073 first_arg
= NULL_TREE
;
2079 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
2081 convs
= alloc_conversions (len
);
2083 /* 13.3.2 - Viable functions [over.match.viable]
2084 First, to be a viable function, a candidate function shall have enough
2085 parameters to agree in number with the arguments in the list.
2087 We need to check this first; otherwise, checking the ICSes might cause
2088 us to produce an ill-formed template instantiation. */
2090 parmnode
= parmlist
;
2091 for (i
= 0; i
< len
; ++i
)
2093 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
2095 parmnode
= TREE_CHAIN (parmnode
);
2098 if ((i
< len
&& parmnode
)
2099 || !sufficient_parms_p (parmnode
))
2101 int remaining
= remaining_arguments (parmnode
);
2103 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
2106 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2107 parameter of type "reference to cv C" (including such a constructor
2108 instantiated from a template) is excluded from the set of candidate
2109 functions when used to construct an object of type D with an argument list
2110 containing a single argument if C is reference-related to D. */
2111 if (viable
&& len
== 1 && parmlist
&& DECL_CONSTRUCTOR_P (fn
)
2112 && flag_new_inheriting_ctors
2113 && DECL_INHERITED_CTOR (fn
))
2115 tree ptype
= non_reference (TREE_VALUE (parmlist
));
2116 tree dtype
= DECL_CONTEXT (fn
);
2117 tree btype
= DECL_INHERITED_CTOR_BASE (fn
);
2118 if (reference_related_p (ptype
, dtype
)
2119 && reference_related_p (btype
, ptype
))
2122 reason
= inherited_ctor_rejection ();
2126 /* Second, for a function to be viable, its constraints must be
2128 if (flag_concepts
&& viable
2129 && !constraints_satisfied_p (fn
))
2131 reason
= constraint_failure (fn
);
2135 /* When looking for a function from a subobject from an implicit
2136 copy/move constructor/operator=, don't consider anything that takes (a
2137 reference to) an unrelated type. See c++/44909 and core 1092. */
2138 if (viable
&& parmlist
&& (flags
& LOOKUP_DEFAULTED
))
2140 if (DECL_CONSTRUCTOR_P (fn
))
2142 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
2143 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
))
2149 parmnode
= chain_index (i
-1, parmlist
);
2150 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
2155 /* This only applies at the top level. */
2156 flags
&= ~LOOKUP_DEFAULTED
;
2162 /* Third, for F to be a viable function, there shall exist for each
2163 argument an implicit conversion sequence that converts that argument
2164 to the corresponding parameter of F. */
2166 parmnode
= parmlist
;
2168 for (i
= 0; i
< len
; ++i
)
2170 tree argtype
, to_type
;
2175 if (parmnode
== void_list_node
)
2180 /* Already set during deduction. */
2181 parmnode
= TREE_CHAIN (parmnode
);
2185 if (i
== 0 && first_arg
!= NULL_TREE
)
2188 arg
= CONST_CAST_TREE (
2189 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
2190 argtype
= lvalue_type (arg
);
2192 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2193 && ! DECL_CONSTRUCTOR_P (fn
));
2197 tree parmtype
= TREE_VALUE (parmnode
);
2199 parmnode
= TREE_CHAIN (parmnode
);
2201 /* The type of the implicit object parameter ('this') for
2202 overload resolution is not always the same as for the
2203 function itself; conversion functions are considered to
2204 be members of the class being converted, and functions
2205 introduced by a using-declaration are considered to be
2206 members of the class that uses them.
2208 Since build_over_call ignores the ICS for the `this'
2209 parameter, we can just change the parm type. */
2210 if (ctype
&& is_this
)
2212 parmtype
= cp_build_qualified_type
2213 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
2214 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
2216 /* If the function has a ref-qualifier, the implicit
2217 object parameter has reference type. */
2218 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
2219 parmtype
= cp_build_reference_type (parmtype
, rv
);
2220 /* The special handling of 'this' conversions in compare_ics
2221 does not apply if there is a ref-qualifier. */
2226 parmtype
= build_pointer_type (parmtype
);
2227 /* We don't use build_this here because we don't want to
2228 capture the object argument until we've chosen a
2229 non-static member function. */
2230 arg
= build_address (arg
);
2231 argtype
= lvalue_type (arg
);
2235 int lflags
= conv_flags (i
, len
-skip
, fn
, arg
, flags
);
2237 t
= implicit_conversion (parmtype
, argtype
, arg
,
2238 /*c_cast_p=*/false, lflags
, complain
);
2243 t
= build_identity_conv (argtype
, arg
);
2244 t
->ellipsis_p
= true;
2255 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
);
2262 reason
= bad_arg_conversion_rejection (first_arg
, i
, arg
, to_type
);
2267 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2268 access_path
, conversion_path
, viable
, reason
, flags
);
2271 /* Create an overload candidate for the conversion function FN which will
2272 be invoked for expression OBJ, producing a pointer-to-function which
2273 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2274 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2275 passed on to implicit_conversion.
2277 Actually, we don't really care about FN; we care about the type it
2278 converts to. There may be multiple conversion functions that will
2279 convert to that type, and we rely on build_user_type_conversion_1 to
2280 choose the best one; so when we create our candidate, we record the type
2281 instead of the function. */
2283 static struct z_candidate
*
2284 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2285 const vec
<tree
, va_gc
> *arglist
,
2286 tree access_path
, tree conversion_path
,
2287 tsubst_flags_t complain
)
2289 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2290 int i
, len
, viable
, flags
;
2291 tree parmlist
, parmnode
;
2293 struct rejection_reason
*reason
;
2295 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2296 parmlist
= TREE_TYPE (parmlist
);
2297 parmlist
= TYPE_ARG_TYPES (parmlist
);
2299 len
= vec_safe_length (arglist
) + 1;
2300 convs
= alloc_conversions (len
);
2301 parmnode
= parmlist
;
2303 flags
= LOOKUP_IMPLICIT
;
2306 /* Don't bother looking up the same type twice. */
2307 if (*candidates
&& (*candidates
)->fn
== totype
)
2310 for (i
= 0; i
< len
; ++i
)
2312 tree arg
, argtype
, convert_type
= NULL_TREE
;
2318 arg
= (*arglist
)[i
- 1];
2319 argtype
= lvalue_type (arg
);
2323 t
= build_identity_conv (argtype
, NULL_TREE
);
2324 t
= build_conv (ck_user
, totype
, t
);
2325 /* Leave the 'cand' field null; we'll figure out the conversion in
2326 convert_like_real if this candidate is chosen. */
2327 convert_type
= totype
;
2329 else if (parmnode
== void_list_node
)
2333 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2334 /*c_cast_p=*/false, flags
, complain
);
2335 convert_type
= TREE_VALUE (parmnode
);
2339 t
= build_identity_conv (argtype
, arg
);
2340 t
->ellipsis_p
= true;
2341 convert_type
= argtype
;
2351 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, arg
, convert_type
);
2358 parmnode
= TREE_CHAIN (parmnode
);
2362 || ! sufficient_parms_p (parmnode
))
2364 int remaining
= remaining_arguments (parmnode
);
2366 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2369 return add_candidate (candidates
, totype
, obj
, arglist
, len
, convs
,
2370 access_path
, conversion_path
, viable
, reason
, flags
);
2374 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2375 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2376 int flags
, tsubst_flags_t complain
)
2383 struct rejection_reason
*reason
= NULL
;
2388 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2389 convs
= alloc_conversions (num_convs
);
2391 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2392 conversion ops are allowed. We handle that here by just checking for
2393 boolean_type_node because other operators don't ask for it. COND_EXPR
2394 also does contextual conversion to bool for the first operand, but we
2395 handle that in build_conditional_expr, and type1 here is operand 2. */
2396 if (type1
!= boolean_type_node
)
2397 flags
|= LOOKUP_ONLYCONVERTING
;
2399 for (i
= 0; i
< 2; ++i
)
2404 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2405 /*c_cast_p=*/false, flags
, complain
);
2409 /* We need something for printing the candidate. */
2410 t
= build_identity_conv (types
[i
], NULL_TREE
);
2411 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2417 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, args
[i
],
2423 /* For COND_EXPR we rearranged the arguments; undo that now. */
2426 convs
[2] = convs
[1];
2427 convs
[1] = convs
[0];
2428 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2429 /*c_cast_p=*/false, flags
,
2436 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2441 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2443 /*access_path=*/NULL_TREE
,
2444 /*conversion_path=*/NULL_TREE
,
2445 viable
, reason
, flags
);
2449 is_complete (tree t
)
2451 return COMPLETE_TYPE_P (complete_type (t
));
2454 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2457 promoted_arithmetic_type_p (tree type
)
2461 In this section, the term promoted integral type is used to refer
2462 to those integral types which are preserved by integral promotion
2463 (including e.g. int and long but excluding e.g. char).
2464 Similarly, the term promoted arithmetic type refers to promoted
2465 integral types plus floating types. */
2466 return ((CP_INTEGRAL_TYPE_P (type
)
2467 && same_type_p (type_promotes_to (type
), type
))
2468 || TREE_CODE (type
) == REAL_TYPE
);
2471 /* Create any builtin operator overload candidates for the operator in
2472 question given the converted operand types TYPE1 and TYPE2. The other
2473 args are passed through from add_builtin_candidates to
2474 build_builtin_candidate.
2476 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2477 If CODE is requires candidates operands of the same type of the kind
2478 of which TYPE1 and TYPE2 are, we add both candidates
2479 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2482 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2483 enum tree_code code2
, tree fnname
, tree type1
,
2484 tree type2
, tree
*args
, tree
*argtypes
, int flags
,
2485 tsubst_flags_t complain
)
2489 case POSTINCREMENT_EXPR
:
2490 case POSTDECREMENT_EXPR
:
2491 args
[1] = integer_zero_node
;
2492 type2
= integer_type_node
;
2501 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2502 and VQ is either volatile or empty, there exist candidate operator
2503 functions of the form
2504 VQ T& operator++(VQ T&);
2505 T operator++(VQ T&, int);
2506 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2507 type other than bool, and VQ is either volatile or empty, there exist
2508 candidate operator functions of the form
2509 VQ T& operator--(VQ T&);
2510 T operator--(VQ T&, int);
2511 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2512 complete object type, and VQ is either volatile or empty, there exist
2513 candidate operator functions of the form
2514 T*VQ& operator++(T*VQ&);
2515 T*VQ& operator--(T*VQ&);
2516 T* operator++(T*VQ&, int);
2517 T* operator--(T*VQ&, int); */
2519 case POSTDECREMENT_EXPR
:
2520 case PREDECREMENT_EXPR
:
2521 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2524 case POSTINCREMENT_EXPR
:
2525 case PREINCREMENT_EXPR
:
2526 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2528 type1
= build_reference_type (type1
);
2533 /* 7 For every cv-qualified or cv-unqualified object type T, there
2534 exist candidate operator functions of the form
2538 8 For every function type T, there exist candidate operator functions of
2540 T& operator*(T*); */
2543 if (TYPE_PTR_P (type1
)
2544 && (TYPE_PTROB_P (type1
)
2545 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2549 /* 9 For every type T, there exist candidate operator functions of the form
2552 10For every promoted arithmetic type T, there exist candidate operator
2553 functions of the form
2557 case UNARY_PLUS_EXPR
: /* unary + */
2558 if (TYPE_PTR_P (type1
))
2562 if (ARITHMETIC_TYPE_P (type1
))
2566 /* 11For every promoted integral type T, there exist candidate operator
2567 functions of the form
2571 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2575 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2576 is the same type as C2 or is a derived class of C2, T is a complete
2577 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2578 there exist candidate operator functions of the form
2579 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2580 where CV12 is the union of CV1 and CV2. */
2583 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2585 tree c1
= TREE_TYPE (type1
);
2586 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2588 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2589 && (TYPE_PTRMEMFUNC_P (type2
)
2590 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2595 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2596 didate operator functions of the form
2601 bool operator<(L, R);
2602 bool operator>(L, R);
2603 bool operator<=(L, R);
2604 bool operator>=(L, R);
2605 bool operator==(L, R);
2606 bool operator!=(L, R);
2607 where LR is the result of the usual arithmetic conversions between
2610 14For every pair of types T and I, where T is a cv-qualified or cv-
2611 unqualified complete object type and I is a promoted integral type,
2612 there exist candidate operator functions of the form
2613 T* operator+(T*, I);
2614 T& operator[](T*, I);
2615 T* operator-(T*, I);
2616 T* operator+(I, T*);
2617 T& operator[](I, T*);
2619 15For every T, where T is a pointer to complete object type, there exist
2620 candidate operator functions of the form112)
2621 ptrdiff_t operator-(T, T);
2623 16For every pointer or enumeration type T, there exist candidate operator
2624 functions of the form
2625 bool operator<(T, T);
2626 bool operator>(T, T);
2627 bool operator<=(T, T);
2628 bool operator>=(T, T);
2629 bool operator==(T, T);
2630 bool operator!=(T, T);
2632 17For every pointer to member type T, there exist candidate operator
2633 functions of the form
2634 bool operator==(T, T);
2635 bool operator!=(T, T); */
2638 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2640 if (TYPE_PTROB_P (type1
)
2641 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2643 type2
= ptrdiff_type_node
;
2648 case TRUNC_DIV_EXPR
:
2649 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2655 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2656 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2658 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2663 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2675 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2677 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2679 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2680 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2682 if (TYPE_PTR_P (type1
)
2683 && null_ptr_cst_p (args
[1]))
2688 if (null_ptr_cst_p (args
[0])
2689 && TYPE_PTR_P (type2
))
2697 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2701 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2703 type1
= ptrdiff_type_node
;
2706 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2708 type2
= ptrdiff_type_node
;
2713 /* 18For every pair of promoted integral types L and R, there exist candi-
2714 date operator functions of the form
2721 where LR is the result of the usual arithmetic conversions between
2724 case TRUNC_MOD_EXPR
:
2730 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2734 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2735 type, VQ is either volatile or empty, and R is a promoted arithmetic
2736 type, there exist candidate operator functions of the form
2737 VQ L& operator=(VQ L&, R);
2738 VQ L& operator*=(VQ L&, R);
2739 VQ L& operator/=(VQ L&, R);
2740 VQ L& operator+=(VQ L&, R);
2741 VQ L& operator-=(VQ L&, R);
2743 20For every pair T, VQ), where T is any type and VQ is either volatile
2744 or empty, there exist candidate operator functions of the form
2745 T*VQ& operator=(T*VQ&, T*);
2747 21For every pair T, VQ), where T is a pointer to member type and VQ is
2748 either volatile or empty, there exist candidate operator functions of
2750 VQ T& operator=(VQ T&, T);
2752 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2753 unqualified complete object type, VQ is either volatile or empty, and
2754 I is a promoted integral type, there exist candidate operator func-
2756 T*VQ& operator+=(T*VQ&, I);
2757 T*VQ& operator-=(T*VQ&, I);
2759 23For every triple L, VQ, R), where L is an integral or enumeration
2760 type, VQ is either volatile or empty, and R is a promoted integral
2761 type, there exist candidate operator functions of the form
2763 VQ L& operator%=(VQ L&, R);
2764 VQ L& operator<<=(VQ L&, R);
2765 VQ L& operator>>=(VQ L&, R);
2766 VQ L& operator&=(VQ L&, R);
2767 VQ L& operator^=(VQ L&, R);
2768 VQ L& operator|=(VQ L&, R); */
2775 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2777 type2
= ptrdiff_type_node
;
2782 case TRUNC_DIV_EXPR
:
2783 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2787 case TRUNC_MOD_EXPR
:
2793 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2798 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2800 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2801 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2802 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2803 || ((TYPE_PTRMEMFUNC_P (type1
)
2804 || TYPE_PTR_P (type1
))
2805 && null_ptr_cst_p (args
[1])))
2815 type1
= build_reference_type (type1
);
2821 For every pair of promoted arithmetic types L and R, there
2822 exist candidate operator functions of the form
2824 LR operator?(bool, L, R);
2826 where LR is the result of the usual arithmetic conversions
2827 between types L and R.
2829 For every type T, where T is a pointer or pointer-to-member
2830 type, there exist candidate operator functions of the form T
2831 operator?(bool, T, T); */
2833 if (promoted_arithmetic_type_p (type1
)
2834 && promoted_arithmetic_type_p (type2
))
2838 /* Otherwise, the types should be pointers. */
2839 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2842 /* We don't check that the two types are the same; the logic
2843 below will actually create two candidates; one in which both
2844 parameter types are TYPE1, and one in which both parameter
2850 if (ARITHMETIC_TYPE_P (type1
))
2858 /* Make sure we don't create builtin candidates with dependent types. */
2859 bool u1
= uses_template_parms (type1
);
2860 bool u2
= type2
? uses_template_parms (type2
) : false;
2863 /* Try to recover if one of the types is non-dependent. But if
2864 there's only one type, there's nothing we can do. */
2867 /* And we lose if both are dependent. */
2870 /* Or if they have different forms. */
2871 if (TREE_CODE (type1
) != TREE_CODE (type2
))
2880 /* If we're dealing with two pointer types or two enumeral types,
2881 we need candidates for both of them. */
2882 if (type2
&& !same_type_p (type1
, type2
)
2883 && TREE_CODE (type1
) == TREE_CODE (type2
)
2884 && (TYPE_REF_P (type1
)
2885 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2886 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2887 || TYPE_PTRMEMFUNC_P (type1
)
2888 || MAYBE_CLASS_TYPE_P (type1
)
2889 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2891 if (TYPE_PTR_OR_PTRMEM_P (type1
))
2893 tree cptype
= composite_pointer_type (type1
, type2
,
2898 if (cptype
!= error_mark_node
)
2900 build_builtin_candidate
2901 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
2907 build_builtin_candidate
2908 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
2909 build_builtin_candidate
2910 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
2914 build_builtin_candidate
2915 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
2919 type_decays_to (tree type
)
2921 if (TREE_CODE (type
) == ARRAY_TYPE
)
2922 return build_pointer_type (TREE_TYPE (type
));
2923 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2924 return build_pointer_type (type
);
2928 /* There are three conditions of builtin candidates:
2930 1) bool-taking candidates. These are the same regardless of the input.
2931 2) pointer-pair taking candidates. These are generated for each type
2932 one of the input types converts to.
2933 3) arithmetic candidates. According to the standard, we should generate
2934 all of these, but I'm trying not to...
2936 Here we generate a superset of the possible candidates for this particular
2937 case. That is a subset of the full set the standard defines, plus some
2938 other cases which the standard disallows. add_builtin_candidate will
2939 filter out the invalid set. */
2942 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2943 enum tree_code code2
, tree fnname
, tree
*args
,
2944 int flags
, tsubst_flags_t complain
)
2948 tree type
, argtypes
[3], t
;
2949 /* TYPES[i] is the set of possible builtin-operator parameter types
2950 we will consider for the Ith argument. */
2951 vec
<tree
, va_gc
> *types
[2];
2954 for (i
= 0; i
< 3; ++i
)
2957 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2959 argtypes
[i
] = NULL_TREE
;
2964 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2965 and VQ is either volatile or empty, there exist candidate operator
2966 functions of the form
2967 VQ T& operator++(VQ T&); */
2969 case POSTINCREMENT_EXPR
:
2970 case PREINCREMENT_EXPR
:
2971 case POSTDECREMENT_EXPR
:
2972 case PREDECREMENT_EXPR
:
2977 /* 24There also exist candidate operator functions of the form
2978 bool operator!(bool);
2979 bool operator&&(bool, bool);
2980 bool operator||(bool, bool); */
2982 case TRUTH_NOT_EXPR
:
2983 build_builtin_candidate
2984 (candidates
, fnname
, boolean_type_node
,
2985 NULL_TREE
, args
, argtypes
, flags
, complain
);
2988 case TRUTH_ORIF_EXPR
:
2989 case TRUTH_ANDIF_EXPR
:
2990 build_builtin_candidate
2991 (candidates
, fnname
, boolean_type_node
,
2992 boolean_type_node
, args
, argtypes
, flags
, complain
);
3014 types
[0] = make_tree_vector ();
3015 types
[1] = make_tree_vector ();
3017 for (i
= 0; i
< 2; ++i
)
3021 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
3025 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
3028 convs
= lookup_conversions (argtypes
[i
]);
3030 if (code
== COND_EXPR
)
3032 if (lvalue_p (args
[i
]))
3033 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3035 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
3041 for (; convs
; convs
= TREE_CHAIN (convs
))
3043 type
= TREE_TYPE (convs
);
3046 && (!TYPE_REF_P (type
)
3047 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
3050 if (code
== COND_EXPR
&& TYPE_REF_P (type
))
3051 vec_safe_push (types
[i
], type
);
3053 type
= non_reference (type
);
3054 if (i
!= 0 || ! ref1
)
3056 type
= cv_unqualified (type_decays_to (type
));
3057 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
3058 vec_safe_push (types
[i
], type
);
3059 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3060 type
= type_promotes_to (type
);
3063 if (! vec_member (type
, types
[i
]))
3064 vec_safe_push (types
[i
], type
);
3069 if (code
== COND_EXPR
&& lvalue_p (args
[i
]))
3070 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3071 type
= non_reference (argtypes
[i
]);
3072 if (i
!= 0 || ! ref1
)
3074 type
= cv_unqualified (type_decays_to (type
));
3075 if (enum_p
&& UNSCOPED_ENUM_P (type
))
3076 vec_safe_push (types
[i
], type
);
3077 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3078 type
= type_promotes_to (type
);
3080 vec_safe_push (types
[i
], type
);
3084 /* Run through the possible parameter types of both arguments,
3085 creating candidates with those parameter types. */
3086 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
3091 if (!types
[1]->is_empty ())
3092 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
3093 add_builtin_candidate
3094 (candidates
, code
, code2
, fnname
, t
,
3095 u
, args
, argtypes
, flags
, complain
);
3097 add_builtin_candidate
3098 (candidates
, code
, code2
, fnname
, t
,
3099 NULL_TREE
, args
, argtypes
, flags
, complain
);
3102 release_tree_vector (types
[0]);
3103 release_tree_vector (types
[1]);
3107 /* If TMPL can be successfully instantiated as indicated by
3108 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3110 TMPL is the template. EXPLICIT_TARGS are any explicit template
3111 arguments. ARGLIST is the arguments provided at the call-site.
3112 This does not change ARGLIST. The RETURN_TYPE is the desired type
3113 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3114 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3115 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3117 static struct z_candidate
*
3118 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
3119 tree ctype
, tree explicit_targs
, tree first_arg
,
3120 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3121 tree access_path
, tree conversion_path
,
3122 int flags
, tree obj
, unification_kind_t strict
,
3123 tsubst_flags_t complain
)
3125 int ntparms
= DECL_NTPARMS (tmpl
);
3126 tree targs
= make_tree_vec (ntparms
);
3127 unsigned int len
= vec_safe_length (arglist
);
3128 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
3129 unsigned int skip_without_in_chrg
= 0;
3130 tree first_arg_without_in_chrg
= first_arg
;
3131 tree
*args_without_in_chrg
;
3132 unsigned int nargs_without_in_chrg
;
3133 unsigned int ia
, ix
;
3135 struct z_candidate
*cand
;
3137 struct rejection_reason
*reason
= NULL
;
3139 conversion
**convs
= NULL
;
3141 /* We don't do deduction on the in-charge parameter, the VTT
3142 parameter or 'this'. */
3143 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
3145 if (first_arg_without_in_chrg
!= NULL_TREE
)
3146 first_arg_without_in_chrg
= NULL_TREE
;
3147 else if (return_type
&& strict
== DEDUCE_CALL
)
3148 /* We're deducing for a call to the result of a template conversion
3149 function, so the args don't contain 'this'; leave them alone. */;
3151 ++skip_without_in_chrg
;
3154 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
3155 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
3156 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
3158 if (first_arg_without_in_chrg
!= NULL_TREE
)
3159 first_arg_without_in_chrg
= NULL_TREE
;
3161 ++skip_without_in_chrg
;
3164 if (len
< skip_without_in_chrg
)
3167 if (DECL_CONSTRUCTOR_P (tmpl
) && nargs
== 2
3168 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg
),
3169 TREE_TYPE ((*arglist
)[0])))
3171 /* 12.8/6 says, "A declaration of a constructor for a class X is
3172 ill-formed if its first parameter is of type (optionally cv-qualified)
3173 X and either there are no other parameters or else all other
3174 parameters have default arguments. A member function template is never
3175 instantiated to produce such a constructor signature."
3177 So if we're trying to copy an object of the containing class, don't
3178 consider a template constructor that has a first parameter type that
3179 is just a template parameter, as we would deduce a signature that we
3180 would then reject in the code below. */
3181 if (tree firstparm
= FUNCTION_FIRST_USER_PARMTYPE (tmpl
))
3183 firstparm
= TREE_VALUE (firstparm
);
3184 if (PACK_EXPANSION_P (firstparm
))
3185 firstparm
= PACK_EXPANSION_PATTERN (firstparm
);
3186 if (TREE_CODE (firstparm
) == TEMPLATE_TYPE_PARM
)
3188 gcc_assert (!explicit_targs
);
3189 reason
= invalid_copy_with_fn_template_rejection ();
3195 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
3196 + (len
- skip_without_in_chrg
));
3197 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
3199 if (first_arg_without_in_chrg
!= NULL_TREE
)
3201 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
3204 for (ix
= skip_without_in_chrg
;
3205 vec_safe_iterate (arglist
, ix
, &arg
);
3208 args_without_in_chrg
[ia
] = arg
;
3211 gcc_assert (ia
== nargs_without_in_chrg
);
3213 errs
= errorcount
+sorrycount
;
3215 convs
= alloc_conversions (nargs
);
3216 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
3217 args_without_in_chrg
,
3218 nargs_without_in_chrg
,
3219 return_type
, strict
, flags
, convs
,
3220 false, complain
& tf_decltype
);
3222 if (fn
== error_mark_node
)
3224 /* Don't repeat unification later if it already resulted in errors. */
3225 if (errorcount
+sorrycount
== errs
)
3226 reason
= template_unification_rejection (tmpl
, explicit_targs
,
3227 targs
, args_without_in_chrg
,
3228 nargs_without_in_chrg
,
3229 return_type
, strict
, flags
);
3231 reason
= template_unification_error_rejection ();
3235 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
3237 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
3238 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
3241 /* We're trying to produce a constructor with a prohibited signature,
3242 as discussed above; handle here any cases we didn't catch then,
3244 reason
= invalid_copy_with_fn_template_rejection ();
3249 if (obj
!= NULL_TREE
)
3250 /* Aha, this is a conversion function. */
3251 cand
= add_conv_candidate (candidates
, fn
, obj
, arglist
,
3252 access_path
, conversion_path
, complain
);
3254 cand
= add_function_candidate (candidates
, fn
, ctype
,
3255 first_arg
, arglist
, access_path
,
3256 conversion_path
, flags
, convs
, complain
);
3257 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
3258 /* This situation can occur if a member template of a template
3259 class is specialized. Then, instantiate_template might return
3260 an instantiation of the specialization, in which case the
3261 DECL_TI_TEMPLATE field will point at the original
3262 specialization. For example:
3264 template <class T> struct S { template <class U> void f(U);
3265 template <> void f(int) {}; };
3269 Here, TMPL will be template <class U> S<double>::f(U).
3270 And, instantiate template will give us the specialization
3271 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3272 for this will point at template <class T> template <> S<T>::f(int),
3273 so that we can find the definition. For the purposes of
3274 overload resolution, however, we want the original TMPL. */
3275 cand
->template_decl
= build_template_info (tmpl
, targs
);
3277 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3278 cand
->explicit_targs
= explicit_targs
;
3282 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3283 access_path
, conversion_path
, 0, reason
, flags
);
3287 static struct z_candidate
*
3288 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3289 tree explicit_targs
, tree first_arg
,
3290 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3291 tree access_path
, tree conversion_path
, int flags
,
3292 unification_kind_t strict
, tsubst_flags_t complain
)
3295 add_template_candidate_real (candidates
, tmpl
, ctype
,
3296 explicit_targs
, first_arg
, arglist
,
3297 return_type
, access_path
, conversion_path
,
3298 flags
, NULL_TREE
, strict
, complain
);
3301 /* Create an overload candidate for the conversion function template TMPL,
3302 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3303 pointer-to-function which will in turn be called with the argument list
3304 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3305 passed on to implicit_conversion. */
3307 static struct z_candidate
*
3308 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3310 const vec
<tree
, va_gc
> *arglist
,
3311 tree return_type
, tree access_path
,
3312 tree conversion_path
, tsubst_flags_t complain
)
3314 /* Making this work broke PR 71117 and 85118, so until the committee resolves
3315 core issue 2189, let's disable this candidate if there are any call
3321 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3322 NULL_TREE
, arglist
, return_type
, access_path
,
3323 conversion_path
, 0, obj
, DEDUCE_CALL
,
3327 /* The CANDS are the set of candidates that were considered for
3328 overload resolution. Return the set of viable candidates, or CANDS
3329 if none are viable. If any of the candidates were viable, set
3330 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3331 considered viable only if it is strictly viable. */
3333 static struct z_candidate
*
3334 splice_viable (struct z_candidate
*cands
,
3338 struct z_candidate
*viable
;
3339 struct z_candidate
**last_viable
;
3340 struct z_candidate
**cand
;
3341 bool found_strictly_viable
= false;
3343 /* Be strict inside templates, since build_over_call won't actually
3344 do the conversions to get pedwarns. */
3345 if (processing_template_decl
)
3349 last_viable
= &viable
;
3350 *any_viable_p
= false;
3355 struct z_candidate
*c
= *cand
;
3357 && (c
->viable
== 1 || TREE_CODE (c
->fn
) == TEMPLATE_DECL
))
3359 /* Be strict in the presence of a viable candidate. Also if
3360 there are template candidates, so that we get deduction errors
3361 for them instead of silently preferring a bad conversion. */
3363 if (viable
&& !found_strictly_viable
)
3365 /* Put any spliced near matches back onto the main list so
3366 that we see them if there is no strict match. */
3367 *any_viable_p
= false;
3368 *last_viable
= cands
;
3371 last_viable
= &viable
;
3375 if (strict_p
? c
->viable
== 1 : c
->viable
)
3380 last_viable
= &c
->next
;
3381 *any_viable_p
= true;
3383 found_strictly_viable
= true;
3389 return viable
? viable
: cands
;
3393 any_strictly_viable (struct z_candidate
*cands
)
3395 for (; cands
; cands
= cands
->next
)
3396 if (cands
->viable
== 1)
3401 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3402 words, it is about to become the "this" pointer for a member
3403 function call. Take the address of the object. */
3406 build_this (tree obj
)
3408 /* In a template, we are only concerned about the type of the
3409 expression, so we can take a shortcut. */
3410 if (processing_template_decl
)
3411 return build_address (obj
);
3413 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3416 /* Returns true iff functions are equivalent. Equivalent functions are
3417 not '==' only if one is a function-local extern function or if
3418 both are extern "C". */
3421 equal_functions (tree fn1
, tree fn2
)
3423 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3425 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3427 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3428 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3429 return decls_match (fn1
, fn2
);
3433 /* Print information about a candidate being rejected due to INFO. */
3436 print_conversion_rejection (location_t loc
, struct conversion_info
*info
)
3438 tree from
= info
->from
;
3440 from
= lvalue_type (from
);
3441 if (info
->n_arg
== -1)
3443 /* Conversion of implicit `this' argument failed. */
3444 if (!TYPE_P (info
->from
))
3445 /* A bad conversion for 'this' must be discarding cv-quals. */
3446 inform (loc
, " passing %qT as %<this%> "
3447 "argument discards qualifiers",
3450 inform (loc
, " no known conversion for implicit "
3451 "%<this%> parameter from %qH to %qI",
3452 from
, info
->to_type
);
3454 else if (!TYPE_P (info
->from
))
3456 if (info
->n_arg
>= 0)
3457 inform (loc
, " conversion of argument %d would be ill-formed:",
3459 perform_implicit_conversion (info
->to_type
, info
->from
,
3460 tf_warning_or_error
);
3462 else if (info
->n_arg
== -2)
3463 /* Conversion of conversion function return value failed. */
3464 inform (loc
, " no known conversion from %qH to %qI",
3465 from
, info
->to_type
);
3467 inform (loc
, " no known conversion for argument %d from %qH to %qI",
3468 info
->n_arg
+ 1, from
, info
->to_type
);
3471 /* Print information about a candidate with WANT parameters and we found
3475 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3477 inform_n (loc
, want
,
3478 " candidate expects %d argument, %d provided",
3479 " candidate expects %d arguments, %d provided",
3483 /* Print information about one overload candidate CANDIDATE. MSGSTR
3484 is the text to print before the candidate itself.
3486 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3487 to have been run through gettext by the caller. This wart makes
3488 life simpler in print_z_candidates and for the translators. */
3491 print_z_candidate (location_t loc
, const char *msgstr
,
3492 struct z_candidate
*candidate
)
3494 const char *msg
= (msgstr
== NULL
3496 : ACONCAT ((msgstr
, " ", NULL
)));
3497 tree fn
= candidate
->fn
;
3498 if (flag_new_inheriting_ctors
)
3499 fn
= strip_inheriting_ctors (fn
);
3500 location_t cloc
= location_of (fn
);
3502 if (identifier_p (fn
))
3505 if (candidate
->num_convs
== 3)
3506 inform (cloc
, "%s%<%D(%T, %T, %T)%> <built-in>", msg
, fn
,
3507 candidate
->convs
[0]->type
,
3508 candidate
->convs
[1]->type
,
3509 candidate
->convs
[2]->type
);
3510 else if (candidate
->num_convs
== 2)
3511 inform (cloc
, "%s%<%D(%T, %T)%> <built-in>", msg
, fn
,
3512 candidate
->convs
[0]->type
,
3513 candidate
->convs
[1]->type
);
3515 inform (cloc
, "%s%<%D(%T)%> <built-in>", msg
, fn
,
3516 candidate
->convs
[0]->type
);
3518 else if (TYPE_P (fn
))
3519 inform (cloc
, "%s%qT <conversion>", msg
, fn
);
3520 else if (candidate
->viable
== -1)
3521 inform (cloc
, "%s%#qD <near match>", msg
, fn
);
3522 else if (DECL_DELETED_FN (fn
))
3523 inform (cloc
, "%s%#qD <deleted>", msg
, fn
);
3525 inform (cloc
, "%s%#qD", msg
, fn
);
3526 if (fn
!= candidate
->fn
)
3528 cloc
= location_of (candidate
->fn
);
3529 inform (cloc
, " inherited here");
3531 /* Give the user some information about why this candidate failed. */
3532 if (candidate
->reason
!= NULL
)
3534 struct rejection_reason
*r
= candidate
->reason
;
3539 print_arity_information (cloc
, r
->u
.arity
.actual
,
3540 r
->u
.arity
.expected
);
3542 case rr_arg_conversion
:
3543 print_conversion_rejection (cloc
, &r
->u
.conversion
);
3545 case rr_bad_arg_conversion
:
3546 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
);
3548 case rr_explicit_conversion
:
3549 inform (cloc
, " return type %qT of explicit conversion function "
3550 "cannot be converted to %qT with a qualification "
3551 "conversion", r
->u
.conversion
.from
,
3552 r
->u
.conversion
.to_type
);
3554 case rr_template_conversion
:
3555 inform (cloc
, " conversion from return type %qT of template "
3556 "conversion function specialization to %qT is not an "
3557 "exact match", r
->u
.conversion
.from
,
3558 r
->u
.conversion
.to_type
);
3560 case rr_template_unification
:
3561 /* We use template_unification_error_rejection if unification caused
3562 actual non-SFINAE errors, in which case we don't need to repeat
3564 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3566 inform (cloc
, " substitution of deduced template arguments "
3567 "resulted in errors seen above");
3570 /* Re-run template unification with diagnostics. */
3571 inform (cloc
, " template argument deduction/substitution failed:");
3572 fn_type_unification (r
->u
.template_unification
.tmpl
,
3573 r
->u
.template_unification
.explicit_targs
,
3575 (r
->u
.template_unification
.num_targs
)),
3576 r
->u
.template_unification
.args
,
3577 r
->u
.template_unification
.nargs
,
3578 r
->u
.template_unification
.return_type
,
3579 r
->u
.template_unification
.strict
,
3580 r
->u
.template_unification
.flags
,
3583 case rr_invalid_copy
:
3585 " a constructor taking a single argument of its own "
3586 "class type is invalid");
3588 case rr_constraint_failure
:
3590 tree tmpl
= r
->u
.template_instantiation
.tmpl
;
3591 tree args
= r
->u
.template_instantiation
.targs
;
3592 diagnose_constraints (cloc
, tmpl
, args
);
3595 case rr_inherited_ctor
:
3596 inform (cloc
, " an inherited constructor is not a candidate for "
3597 "initialization from an expression of the same or derived "
3602 /* This candidate didn't have any issues or we failed to
3603 handle a particular code. Either way... */
3610 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3612 struct z_candidate
*cand1
;
3613 struct z_candidate
**cand2
;
3618 /* Remove non-viable deleted candidates. */
3620 for (cand2
= &cand1
; *cand2
; )
3622 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3623 && !(*cand2
)->viable
3624 && DECL_DELETED_FN ((*cand2
)->fn
))
3625 *cand2
= (*cand2
)->next
;
3627 cand2
= &(*cand2
)->next
;
3629 /* ...if there are any non-deleted ones. */
3633 /* There may be duplicates in the set of candidates. We put off
3634 checking this condition as long as possible, since we have no way
3635 to eliminate duplicates from a set of functions in less than n^2
3636 time. Now we are about to emit an error message, so it is more
3637 permissible to go slowly. */
3638 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3640 tree fn
= cand1
->fn
;
3641 /* Skip builtin candidates and conversion functions. */
3644 cand2
= &cand1
->next
;
3647 if (DECL_P ((*cand2
)->fn
)
3648 && equal_functions (fn
, (*cand2
)->fn
))
3649 *cand2
= (*cand2
)->next
;
3651 cand2
= &(*cand2
)->next
;
3655 for (; candidates
; candidates
= candidates
->next
)
3656 print_z_candidate (loc
, "candidate:", candidates
);
3659 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3660 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3661 the result of the conversion function to convert it to the final
3662 desired type. Merge the two sequences into a single sequence,
3663 and return the merged sequence. */
3666 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3669 bool bad
= user_seq
->bad_p
;
3671 gcc_assert (user_seq
->kind
== ck_user
);
3673 /* Find the end of the second conversion sequence. */
3674 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3676 /* The entire sequence is a user-conversion sequence. */
3677 (*t
)->user_conv_p
= true;
3682 if ((*t
)->rvaluedness_matches_p
)
3683 /* We're binding a reference directly to the result of the conversion.
3684 build_user_type_conversion_1 stripped the REFERENCE_TYPE from the return
3685 type, but we want it back. */
3686 user_seq
->type
= TREE_TYPE (TREE_TYPE (user_seq
->cand
->fn
));
3688 /* Replace the identity conversion with the user conversion
3695 /* Handle overload resolution for initializing an object of class type from
3696 an initializer list. First we look for a suitable constructor that
3697 takes a std::initializer_list; if we don't find one, we then look for a
3698 non-list constructor.
3700 Parameters are as for add_candidates, except that the arguments are in
3701 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3702 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3705 add_list_candidates (tree fns
, tree first_arg
,
3706 const vec
<tree
, va_gc
> *args
, tree totype
,
3707 tree explicit_targs
, bool template_only
,
3708 tree conversion_path
, tree access_path
,
3710 struct z_candidate
**candidates
,
3711 tsubst_flags_t complain
)
3713 gcc_assert (*candidates
== NULL
);
3715 /* We're looking for a ctor for list-initialization. */
3716 flags
|= LOOKUP_LIST_INIT_CTOR
;
3717 /* And we don't allow narrowing conversions. We also use this flag to
3718 avoid the copy constructor call for copy-list-initialization. */
3719 flags
|= LOOKUP_NO_NARROWING
;
3721 unsigned nart
= num_artificial_parms_for (OVL_FIRST (fns
)) - 1;
3722 tree init_list
= (*args
)[nart
];
3724 /* Always use the default constructor if the list is empty (DR 990). */
3725 if (CONSTRUCTOR_NELTS (init_list
) == 0
3726 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3728 /* If the class has a list ctor, try passing the list as a single
3729 argument first, but only consider list ctors. */
3730 else if (TYPE_HAS_LIST_CTOR (totype
))
3732 flags
|= LOOKUP_LIST_ONLY
;
3733 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3734 explicit_targs
, template_only
, conversion_path
,
3735 access_path
, flags
, candidates
, complain
);
3736 if (any_strictly_viable (*candidates
))
3740 /* Expand the CONSTRUCTOR into a new argument vec. */
3741 vec
<tree
, va_gc
> *new_args
;
3742 vec_alloc (new_args
, nart
+ CONSTRUCTOR_NELTS (init_list
));
3743 for (unsigned i
= 0; i
< nart
; ++i
)
3744 new_args
->quick_push ((*args
)[i
]);
3745 for (unsigned i
= 0; i
< CONSTRUCTOR_NELTS (init_list
); ++i
)
3746 new_args
->quick_push (CONSTRUCTOR_ELT (init_list
, i
)->value
);
3748 /* We aren't looking for list-ctors anymore. */
3749 flags
&= ~LOOKUP_LIST_ONLY
;
3750 /* We allow more user-defined conversions within an init-list. */
3751 flags
&= ~LOOKUP_NO_CONVERSION
;
3753 add_candidates (fns
, first_arg
, new_args
, NULL_TREE
,
3754 explicit_targs
, template_only
, conversion_path
,
3755 access_path
, flags
, candidates
, complain
);
3758 /* Returns the best overload candidate to perform the requested
3759 conversion. This function is used for three the overloading situations
3760 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3761 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3762 per [dcl.init.ref], so we ignore temporary bindings. */
3764 static struct z_candidate
*
3765 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3766 tsubst_flags_t complain
)
3768 struct z_candidate
*candidates
, *cand
;
3770 tree ctors
= NULL_TREE
;
3771 tree conv_fns
= NULL_TREE
;
3772 conversion
*conv
= NULL
;
3773 tree first_arg
= NULL_TREE
;
3774 vec
<tree
, va_gc
> *args
= NULL
;
3781 fromtype
= TREE_TYPE (expr
);
3783 /* We represent conversion within a hierarchy using RVALUE_CONV and
3784 BASE_CONV, as specified by [over.best.ics]; these become plain
3785 constructor calls, as specified in [dcl.init]. */
3786 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3787 || !DERIVED_FROM_P (totype
, fromtype
));
3789 if (CLASS_TYPE_P (totype
))
3790 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3791 creating a garbage BASELINK; constructors can't be inherited. */
3792 ctors
= get_class_binding (totype
, complete_ctor_identifier
);
3794 if (MAYBE_CLASS_TYPE_P (fromtype
))
3796 tree to_nonref
= non_reference (totype
);
3797 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3798 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3799 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3801 /* [class.conv.fct] A conversion function is never used to
3802 convert a (possibly cv-qualified) object to the (possibly
3803 cv-qualified) same object type (or a reference to it), to a
3804 (possibly cv-qualified) base class of that type (or a
3805 reference to it)... */
3808 conv_fns
= lookup_conversions (fromtype
);
3812 flags
|= LOOKUP_NO_CONVERSION
;
3813 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3814 flags
|= LOOKUP_NO_NARROWING
;
3816 /* It's OK to bind a temporary for converting constructor arguments, but
3817 not in converting the return value of a conversion operator. */
3818 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
3819 | (flags
& LOOKUP_NO_NARROWING
));
3820 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3824 int ctorflags
= flags
;
3826 first_arg
= build_dummy_object (totype
);
3828 /* We should never try to call the abstract or base constructor
3830 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors
))
3831 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors
)));
3833 args
= make_tree_vector_single (expr
);
3834 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3836 /* List-initialization. */
3837 add_list_candidates (ctors
, first_arg
, args
, totype
, NULL_TREE
,
3838 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3839 ctorflags
, &candidates
, complain
);
3843 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3844 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3845 ctorflags
, &candidates
, complain
);
3848 for (cand
= candidates
; cand
; cand
= cand
->next
)
3850 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3852 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3853 set, then this is copy-initialization. In that case, "The
3854 result of the call is then used to direct-initialize the
3855 object that is the destination of the copy-initialization."
3858 We represent this in the conversion sequence with an
3859 rvalue conversion, which means a constructor call. */
3860 if (!TYPE_REF_P (totype
)
3861 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3863 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3869 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3870 first_arg
= CONSTRUCTOR_ELT (expr
, 0)->value
;
3875 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3877 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3878 struct z_candidate
*old_candidates
;
3880 /* If we are called to convert to a reference type, we are trying to
3881 find a direct binding, so don't even consider temporaries. If
3882 we don't find a direct binding, the caller will try again to
3883 look for a temporary binding. */
3884 if (TYPE_REF_P (totype
))
3885 convflags
|= LOOKUP_NO_TEMP_BIND
;
3887 old_candidates
= candidates
;
3888 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
3890 conversion_path
, TYPE_BINFO (fromtype
),
3891 flags
, &candidates
, complain
);
3893 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
3895 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
3897 = implicit_conversion (totype
,
3900 /*c_cast_p=*/false, convflags
,
3903 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3904 copy-initialization. In that case, "The result of the
3905 call is then used to direct-initialize the object that is
3906 the destination of the copy-initialization." [dcl.init]
3908 We represent this in the conversion sequence with an
3909 rvalue conversion, which means a constructor call. But
3910 don't add a second rvalue conversion if there's already
3911 one there. Which there really shouldn't be, but it's
3912 harmless since we'd add it here anyway. */
3913 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
3914 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3915 ics
= build_conv (ck_rvalue
, totype
, ics
);
3917 cand
->second_conv
= ics
;
3922 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -2,
3925 else if (DECL_NONCONVERTING_P (cand
->fn
)
3926 && ics
->rank
> cr_exact
)
3928 /* 13.3.1.5: For direct-initialization, those explicit
3929 conversion functions that are not hidden within S and
3930 yield type T or a type that can be converted to type T
3931 with a qualification conversion (4.4) are also candidate
3933 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3934 I've raised this issue with the committee. --jason 9/2011 */
3936 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
3938 else if (cand
->viable
== 1 && ics
->bad_p
)
3942 = bad_arg_conversion_rejection (NULL_TREE
, -2,
3945 else if (primary_template_specialization_p (cand
->fn
)
3946 && ics
->rank
> cr_exact
)
3948 /* 13.3.3.1.2: If the user-defined conversion is specified by
3949 a specialization of a conversion function template, the
3950 second standard conversion sequence shall have exact match
3953 cand
->reason
= template_conversion_rejection (rettype
, totype
);
3958 candidates
= splice_viable (candidates
, false, &any_viable_p
);
3962 release_tree_vector (args
);
3966 cand
= tourney (candidates
, complain
);
3969 if (complain
& tf_error
)
3971 auto_diagnostic_group d
;
3972 error ("conversion from %qH to %qI is ambiguous",
3974 print_z_candidates (location_of (expr
), candidates
);
3977 cand
= candidates
; /* any one will do */
3978 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
3979 cand
->second_conv
->user_conv_p
= true;
3980 if (!any_strictly_viable (candidates
))
3981 cand
->second_conv
->bad_p
= true;
3982 if (flags
& LOOKUP_ONLYCONVERTING
)
3983 cand
->second_conv
->need_temporary_p
= true;
3984 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3985 ambiguous conversion is no worse than another user-defined
3992 if (!DECL_CONSTRUCTOR_P (cand
->fn
))
3993 convtype
= non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)));
3994 else if (cand
->second_conv
->kind
== ck_rvalue
)
3995 /* DR 5: [in the first step of copy-initialization]...if the function
3996 is a constructor, the call initializes a temporary of the
3997 cv-unqualified version of the destination type. */
3998 convtype
= cv_unqualified (totype
);
4001 /* Build the user conversion sequence. */
4005 build_identity_conv (TREE_TYPE (expr
), expr
));
4007 if (cand
->viable
== -1)
4010 /* Remember that this was a list-initialization. */
4011 if (flags
& LOOKUP_NO_NARROWING
)
4012 conv
->check_narrowing
= true;
4014 /* Combine it with the second conversion sequence. */
4015 cand
->second_conv
= merge_conversion_sequences (conv
,
4021 /* Wrapper for above. */
4024 build_user_type_conversion (tree totype
, tree expr
, int flags
,
4025 tsubst_flags_t complain
)
4027 struct z_candidate
*cand
;
4030 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4031 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
4035 if (cand
->second_conv
->kind
== ck_ambig
)
4036 ret
= error_mark_node
;
4039 expr
= convert_like (cand
->second_conv
, expr
, complain
);
4040 ret
= convert_from_reference (expr
);
4046 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4050 /* Subroutine of convert_nontype_argument.
4052 EXPR is an expression used in a context that requires a converted
4053 constant-expression, such as a template non-type parameter. Do any
4054 necessary conversions (that are permitted for converted
4055 constant-expressions) to convert it to the desired type.
4057 If conversion is successful, returns the converted expression;
4058 otherwise, returns error_mark_node. */
4061 build_converted_constant_expr (tree type
, tree expr
, tsubst_flags_t complain
)
4066 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
4068 if (error_operand_p (expr
))
4069 return error_mark_node
;
4071 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4072 p
= conversion_obstack_alloc (0);
4074 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
4076 LOOKUP_IMPLICIT
, complain
);
4078 /* A converted constant expression of type T is an expression, implicitly
4079 converted to type T, where the converted expression is a constant
4080 expression and the implicit conversion sequence contains only
4082 * user-defined conversions,
4083 * lvalue-to-rvalue conversions (7.1),
4084 * array-to-pointer conversions (7.2),
4085 * function-to-pointer conversions (7.3),
4086 * qualification conversions (7.5),
4087 * integral promotions (7.6),
4088 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4089 * null pointer conversions (7.11) from std::nullptr_t,
4090 * null member pointer conversions (7.12) from std::nullptr_t, and
4091 * function pointer conversions (7.13),
4093 and where the reference binding (if any) binds directly. */
4095 for (conversion
*c
= conv
;
4096 conv
&& c
->kind
!= ck_identity
;
4097 c
= next_conversion (c
))
4101 /* A conversion function is OK. If it isn't constexpr, we'll
4102 complain later that the argument isn't constant. */
4104 /* The lvalue-to-rvalue conversion is OK. */
4106 /* Array-to-pointer and function-to-pointer. */
4108 /* Function pointer conversions. */
4110 /* Qualification conversions. */
4115 if (c
->need_temporary_p
)
4117 if (complain
& tf_error
)
4118 error_at (loc
, "initializing %qH with %qI in converted "
4119 "constant expression does not bind directly",
4120 type
, next_conversion (c
)->type
);
4129 t
= next_conversion (c
)->type
;
4130 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
)
4131 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
4132 /* Integral promotion or conversion. */
4134 if (NULLPTR_TYPE_P (t
))
4135 /* Conversion from nullptr to pointer or pointer-to-member. */
4138 if (complain
& tf_error
)
4139 error_at (loc
, "conversion from %qH to %qI in a "
4140 "converted constant expression", t
, type
);
4149 /* Avoid confusing convert_nontype_argument by introducing
4150 a redundant conversion to the same reference type. */
4151 if (conv
&& conv
->kind
== ck_ref_bind
4152 && REFERENCE_REF_P (expr
))
4154 tree ref
= TREE_OPERAND (expr
, 0);
4155 if (same_type_p (type
, TREE_TYPE (ref
)))
4161 conv
->check_narrowing
= true;
4162 conv
->check_narrowing_const_only
= true;
4163 expr
= convert_like (conv
, expr
, complain
);
4167 if (complain
& tf_error
)
4168 error_at (loc
, "could not convert %qE from %qH to %qI", expr
,
4169 TREE_TYPE (expr
), type
);
4170 expr
= error_mark_node
;
4173 /* Free all the conversions we allocated. */
4174 obstack_free (&conversion_obstack
, p
);
4179 /* Do any initial processing on the arguments to a function call. */
4181 static vec
<tree
, va_gc
> *
4182 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
4187 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
4189 if (error_operand_p (arg
))
4191 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
4193 if (complain
& tf_error
)
4194 error ("invalid use of void expression");
4197 else if (invalid_nonstatic_memfn_p (arg
->exp
.locus
, arg
, complain
))
4203 /* Perform overload resolution on FN, which is called with the ARGS.
4205 Return the candidate function selected by overload resolution, or
4206 NULL if the event that overload resolution failed. In the case
4207 that overload resolution fails, *CANDIDATES will be the set of
4208 candidates considered, and ANY_VIABLE_P will be set to true or
4209 false to indicate whether or not any of the candidates were
4212 The ARGS should already have gone through RESOLVE_ARGS before this
4213 function is called. */
4215 static struct z_candidate
*
4216 perform_overload_resolution (tree fn
,
4217 const vec
<tree
, va_gc
> *args
,
4218 struct z_candidate
**candidates
,
4219 bool *any_viable_p
, tsubst_flags_t complain
)
4221 struct z_candidate
*cand
;
4222 tree explicit_targs
;
4225 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4227 explicit_targs
= NULL_TREE
;
4231 *any_viable_p
= true;
4234 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4235 || TREE_CODE (fn
) == TEMPLATE_DECL
4236 || TREE_CODE (fn
) == OVERLOAD
4237 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
4239 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4241 explicit_targs
= TREE_OPERAND (fn
, 1);
4242 fn
= TREE_OPERAND (fn
, 0);
4246 /* Add the various candidate functions. */
4247 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
4248 explicit_targs
, template_only
,
4249 /*conversion_path=*/NULL_TREE
,
4250 /*access_path=*/NULL_TREE
,
4252 candidates
, complain
);
4254 *candidates
= splice_viable (*candidates
, false, any_viable_p
);
4256 cand
= tourney (*candidates
, complain
);
4260 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4264 /* Print an error message about being unable to build a call to FN with
4265 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4266 be located; CANDIDATES is a possibly empty list of such
4270 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
,
4271 struct z_candidate
*candidates
)
4273 tree targs
= NULL_TREE
;
4274 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4276 targs
= TREE_OPERAND (fn
, 1);
4277 fn
= TREE_OPERAND (fn
, 0);
4279 tree name
= OVL_NAME (fn
);
4280 location_t loc
= location_of (name
);
4282 name
= lookup_template_function (name
, targs
);
4284 auto_diagnostic_group d
;
4285 if (!any_strictly_viable (candidates
))
4286 error_at (loc
, "no matching function for call to %<%D(%A)%>",
4287 name
, build_tree_list_vec (args
));
4289 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
4290 name
, build_tree_list_vec (args
));
4292 print_z_candidates (loc
, candidates
);
4295 /* Return an expression for a call to FN (a namespace-scope function,
4296 or a static member function) with the ARGS. This may change
4300 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
,
4301 tsubst_flags_t complain
)
4303 struct z_candidate
*candidates
, *cand
;
4308 if (args
!= NULL
&& *args
!= NULL
)
4310 *args
= resolve_args (*args
, complain
);
4312 return error_mark_node
;
4316 tm_malloc_replacement (fn
);
4318 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4319 p
= conversion_obstack_alloc (0);
4321 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
4326 if (complain
& tf_error
)
4328 // If there is a single (non-viable) function candidate,
4329 // let the error be diagnosed by cp_build_function_call_vec.
4330 if (!any_viable_p
&& candidates
&& ! candidates
->next
4331 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
4332 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
4334 // Otherwise, emit notes for non-viable candidates.
4335 print_error_for_call_failure (fn
, *args
, candidates
);
4337 result
= error_mark_node
;
4341 int flags
= LOOKUP_NORMAL
;
4342 /* If fn is template_id_expr, the call has explicit template arguments
4343 (e.g. func<int>(5)), communicate this info to build_over_call
4344 through flags so that later we can use it to decide whether to warn
4345 about peculiar null pointer conversion. */
4346 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4348 /* If overload resolution selects a specialization of a
4349 function concept for non-dependent template arguments,
4350 the expression is true if the constraints are satisfied
4351 and false otherwise.
4353 NOTE: This is an extension of Concepts Lite TS that
4354 allows constraints to be used in expressions. */
4355 if (flag_concepts
&& !processing_template_decl
)
4357 tree tmpl
= DECL_TI_TEMPLATE (cand
->fn
);
4358 tree targs
= DECL_TI_ARGS (cand
->fn
);
4359 tree decl
= DECL_TEMPLATE_RESULT (tmpl
);
4360 if (DECL_DECLARED_CONCEPT_P (decl
))
4361 return evaluate_function_concept (decl
, targs
);
4364 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4367 result
= build_over_call (cand
, flags
, complain
);
4370 /* Free all the conversions we allocated. */
4371 obstack_free (&conversion_obstack
, p
);
4376 /* Build a call to a global operator new. FNNAME is the name of the
4377 operator (either "operator new" or "operator new[]") and ARGS are
4378 the arguments provided. This may change ARGS. *SIZE points to the
4379 total number of bytes required by the allocation, and is updated if
4380 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4381 be used. If this function determines that no cookie should be
4382 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4383 is not NULL_TREE, it is evaluated before calculating the final
4384 array size, and if it fails, the array size is replaced with
4385 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4386 is non-NULL, it will be set, upon return, to the allocation
4390 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4391 tree
*size
, tree
*cookie_size
,
4392 tree align_arg
, tree size_check
,
4393 tree
*fn
, tsubst_flags_t complain
)
4395 tree original_size
= *size
;
4397 struct z_candidate
*candidates
;
4398 struct z_candidate
*cand
= NULL
;
4403 /* Set to (size_t)-1 if the size check fails. */
4404 if (size_check
!= NULL_TREE
)
4406 tree errval
= TYPE_MAX_VALUE (sizetype
);
4407 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4408 errval
= throw_bad_array_new_length ();
4409 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4410 original_size
, errval
);
4412 vec_safe_insert (*args
, 0, *size
);
4413 *args
= resolve_args (*args
, complain
);
4415 return error_mark_node
;
4421 If this lookup fails to find the name, or if the allocated type
4422 is not a class type, the allocation function's name is looked
4423 up in the global scope.
4425 we disregard block-scope declarations of "operator new". */
4426 fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/false, 0, 0);
4427 fns
= lookup_arg_dependent (fnname
, fns
, *args
);
4431 vec
<tree
, va_gc
>* align_args
4432 = vec_copy_and_insert (*args
, align_arg
, 1);
4433 cand
= perform_overload_resolution (fns
, align_args
, &candidates
,
4434 &any_viable_p
, tf_none
);
4437 /* If no aligned allocation function matches, try again without the
4441 /* Figure out what function is being called. */
4443 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
4446 /* If no suitable function could be found, issue an error message
4450 if (complain
& tf_error
)
4451 print_error_for_call_failure (fns
, *args
, candidates
);
4452 return error_mark_node
;
4455 /* If a cookie is required, add some extra space. Whether
4456 or not a cookie is required cannot be determined until
4457 after we know which function was called. */
4460 bool use_cookie
= true;
4463 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4464 /* Skip the size_t parameter. */
4465 arg_types
= TREE_CHAIN (arg_types
);
4466 /* Check the remaining parameters (if any). */
4468 && TREE_CHAIN (arg_types
) == void_list_node
4469 && same_type_p (TREE_VALUE (arg_types
),
4472 /* If we need a cookie, adjust the number of bytes allocated. */
4475 /* Update the total size. */
4476 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4479 /* Set to (size_t)-1 if the size check fails. */
4480 gcc_assert (size_check
!= NULL_TREE
);
4481 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4482 *size
, TYPE_MAX_VALUE (sizetype
));
4484 /* Update the argument list to reflect the adjusted size. */
4485 (**args
)[0] = *size
;
4488 *cookie_size
= NULL_TREE
;
4491 /* Tell our caller which function we decided to call. */
4495 /* Build the CALL_EXPR. */
4496 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4499 /* Build a new call to operator(). This may change ARGS. */
4502 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4504 struct z_candidate
*candidates
= 0, *cand
;
4505 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4507 tree result
= NULL_TREE
;
4510 obj
= mark_lvalue_use (obj
);
4512 if (error_operand_p (obj
))
4513 return error_mark_node
;
4515 tree type
= TREE_TYPE (obj
);
4517 obj
= prep_operand (obj
);
4519 if (TYPE_PTRMEMFUNC_P (type
))
4521 if (complain
& tf_error
)
4522 /* It's no good looking for an overloaded operator() on a
4523 pointer-to-member-function. */
4524 error ("pointer-to-member function %qE cannot be called without "
4525 "an object; consider using %<.*%> or %<->*%>", obj
);
4526 return error_mark_node
;
4529 if (TYPE_BINFO (type
))
4531 fns
= lookup_fnfields (TYPE_BINFO (type
), call_op_identifier
, 1);
4532 if (fns
== error_mark_node
)
4533 return error_mark_node
;
4538 if (args
!= NULL
&& *args
!= NULL
)
4540 *args
= resolve_args (*args
, complain
);
4542 return error_mark_node
;
4545 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4546 p
= conversion_obstack_alloc (0);
4550 first_mem_arg
= obj
;
4552 add_candidates (BASELINK_FUNCTIONS (fns
),
4553 first_mem_arg
, *args
, NULL_TREE
,
4555 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4556 LOOKUP_NORMAL
, &candidates
, complain
);
4559 convs
= lookup_conversions (type
);
4561 for (; convs
; convs
= TREE_CHAIN (convs
))
4563 tree totype
= TREE_TYPE (convs
);
4565 if (TYPE_PTRFN_P (totype
)
4566 || TYPE_REFFN_P (totype
)
4567 || (TYPE_REF_P (totype
)
4568 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4569 for (ovl_iterator
iter (TREE_VALUE (convs
)); iter
; ++iter
)
4573 if (DECL_NONCONVERTING_P (fn
))
4576 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4577 add_template_conv_candidate
4578 (&candidates
, fn
, obj
, *args
, totype
,
4579 /*access_path=*/NULL_TREE
,
4580 /*conversion_path=*/NULL_TREE
, complain
);
4582 add_conv_candidate (&candidates
, fn
, obj
,
4583 *args
, /*conversion_path=*/NULL_TREE
,
4584 /*access_path=*/NULL_TREE
, complain
);
4588 /* Be strict here because if we choose a bad conversion candidate, the
4589 errors we get won't mention the call context. */
4590 candidates
= splice_viable (candidates
, true, &any_viable_p
);
4593 if (complain
& tf_error
)
4595 auto_diagnostic_group d
;
4596 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4597 build_tree_list_vec (*args
));
4598 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4600 result
= error_mark_node
;
4604 cand
= tourney (candidates
, complain
);
4607 if (complain
& tf_error
)
4609 auto_diagnostic_group d
;
4610 error ("call of %<(%T) (%A)%> is ambiguous",
4611 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4612 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4614 result
= error_mark_node
;
4616 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4617 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
)
4618 && DECL_OVERLOADED_OPERATOR_IS (cand
->fn
, CALL_EXPR
))
4619 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4622 if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
4623 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
,
4627 gcc_checking_assert (TYPE_P (cand
->fn
));
4628 obj
= convert_like (cand
->convs
[0], obj
, complain
);
4630 obj
= convert_from_reference (obj
);
4631 result
= cp_build_function_call_vec (obj
, args
, complain
);
4635 /* Free all the conversions we allocated. */
4636 obstack_free (&conversion_obstack
, p
);
4641 /* Wrapper for above. */
4644 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4647 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4648 ret
= build_op_call_1 (obj
, args
, complain
);
4649 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4653 /* Called by op_error to prepare format strings suitable for the error
4654 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4655 and a suffix (controlled by NTYPES). */
4658 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4662 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4663 : G_("no match for "), errmsg
, NULL
);
4666 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4667 else if (ntypes
== 2)
4668 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4670 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4676 op_error (location_t loc
, enum tree_code code
, enum tree_code code2
,
4677 tree arg1
, tree arg2
, tree arg3
, bool match
)
4679 bool assop
= code
== MODIFY_EXPR
;
4680 const char *opname
= OVL_OP_INFO (assop
, assop
? code2
: code
)->name
;
4685 if (flag_diagnostics_show_caret
)
4686 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4688 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4690 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4691 "in %<%E ? %E : %E%>"), 3, match
),
4693 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4696 case POSTINCREMENT_EXPR
:
4697 case POSTDECREMENT_EXPR
:
4698 if (flag_diagnostics_show_caret
)
4699 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4700 opname
, TREE_TYPE (arg1
));
4702 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4704 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4708 if (flag_diagnostics_show_caret
)
4709 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4710 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4712 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4714 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4719 if (flag_diagnostics_show_caret
)
4720 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4721 opname
, TREE_TYPE (arg1
));
4723 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4724 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4729 if (flag_diagnostics_show_caret
)
4730 error_at (loc
, op_error_string (G_("%<operator%s%>"), 2, match
),
4731 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4733 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4735 opname
, arg1
, opname
, arg2
,
4736 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4738 if (flag_diagnostics_show_caret
)
4739 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4740 opname
, TREE_TYPE (arg1
));
4742 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4744 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4749 /* Return the implicit conversion sequence that could be used to
4750 convert E1 to E2 in [expr.cond]. */
4753 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4755 tree t1
= non_reference (TREE_TYPE (e1
));
4756 tree t2
= non_reference (TREE_TYPE (e2
));
4762 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4763 implicitly converted (clause _conv_) to the type "lvalue reference to
4764 T2", subject to the constraint that in the conversion the
4765 reference must bind directly (_dcl.init.ref_) to an lvalue.
4767 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4768 implicitly converted to the type "rvalue reference to T2", subject to
4769 the constraint that the reference must bind directly. */
4772 tree rtype
= cp_build_reference_type (t2
, !lvalue_p (e2
));
4773 conv
= implicit_conversion (rtype
,
4777 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4778 |LOOKUP_ONLYCONVERTING
,
4780 if (conv
&& !conv
->bad_p
)
4784 /* If E2 is a prvalue or if neither of the conversions above can be done
4785 and at least one of the operands has (possibly cv-qualified) class
4787 if (!CLASS_TYPE_P (t1
) && !CLASS_TYPE_P (t2
))
4792 If E1 and E2 have class type, and the underlying class types are
4793 the same or one is a base class of the other: E1 can be converted
4794 to match E2 if the class of T2 is the same type as, or a base
4795 class of, the class of T1, and the cv-qualification of T2 is the
4796 same cv-qualification as, or a greater cv-qualification than, the
4797 cv-qualification of T1. If the conversion is applied, E1 is
4798 changed to an rvalue of type T2 that still refers to the original
4799 source class object (or the appropriate subobject thereof). */
4800 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4801 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4803 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4805 conv
= build_identity_conv (t1
, e1
);
4806 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4807 TYPE_MAIN_VARIANT (t2
)))
4808 conv
= build_conv (ck_base
, t2
, conv
);
4810 conv
= build_conv (ck_rvalue
, t2
, conv
);
4819 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4820 converted to the type that expression E2 would have if E2 were
4821 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4822 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4823 LOOKUP_IMPLICIT
, complain
);
4826 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4827 arguments to the conditional expression. */
4830 build_conditional_expr_1 (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
4831 tsubst_flags_t complain
)
4835 tree result
= NULL_TREE
;
4836 tree result_type
= NULL_TREE
;
4837 bool is_glvalue
= true;
4838 struct z_candidate
*candidates
= 0;
4839 struct z_candidate
*cand
;
4841 tree orig_arg2
, orig_arg3
;
4843 /* As a G++ extension, the second argument to the conditional can be
4844 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4845 c'.) If the second operand is omitted, make sure it is
4846 calculated only once. */
4849 if (complain
& tf_error
)
4850 pedwarn (loc
, OPT_Wpedantic
,
4851 "ISO C++ forbids omitting the middle term of a ?: expression");
4853 if ((complain
& tf_warning
) && !truth_value_p (TREE_CODE (arg1
)))
4854 warn_for_omitted_condop (loc
, arg1
);
4856 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4857 if (lvalue_p (arg1
))
4858 arg2
= arg1
= cp_stabilize_reference (arg1
);
4860 arg2
= arg1
= cp_save_expr (arg1
);
4863 /* If something has already gone wrong, just pass that fact up the
4865 if (error_operand_p (arg1
)
4866 || error_operand_p (arg2
)
4867 || error_operand_p (arg3
))
4868 return error_mark_node
;
4873 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
4875 tree arg1_type
= TREE_TYPE (arg1
);
4877 /* If arg1 is another cond_expr choosing between -1 and 0,
4878 then we can use its comparison. It may help to avoid
4879 additional comparison, produce more accurate diagnostics
4880 and enables folding. */
4881 if (TREE_CODE (arg1
) == VEC_COND_EXPR
4882 && integer_minus_onep (TREE_OPERAND (arg1
, 1))
4883 && integer_zerop (TREE_OPERAND (arg1
, 2)))
4884 arg1
= TREE_OPERAND (arg1
, 0);
4886 arg1
= force_rvalue (arg1
, complain
);
4887 arg2
= force_rvalue (arg2
, complain
);
4888 arg3
= force_rvalue (arg3
, complain
);
4890 /* force_rvalue can return error_mark on valid arguments. */
4891 if (error_operand_p (arg1
)
4892 || error_operand_p (arg2
)
4893 || error_operand_p (arg3
))
4894 return error_mark_node
;
4896 arg2_type
= TREE_TYPE (arg2
);
4897 arg3_type
= TREE_TYPE (arg3
);
4899 if (!VECTOR_TYPE_P (arg2_type
)
4900 && !VECTOR_TYPE_P (arg3_type
))
4902 /* Rely on the error messages of the scalar version. */
4903 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
4904 orig_arg2
, orig_arg3
, complain
);
4905 if (scal
== error_mark_node
)
4906 return error_mark_node
;
4907 tree stype
= TREE_TYPE (scal
);
4908 tree ctype
= TREE_TYPE (arg1_type
);
4909 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
4910 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
4912 if (complain
& tf_error
)
4913 error_at (loc
, "inferred scalar type %qT is not an integer or "
4914 "floating point type of the same size as %qT", stype
,
4915 COMPARISON_CLASS_P (arg1
)
4916 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
4918 return error_mark_node
;
4921 tree vtype
= build_opaque_vector_type (stype
,
4922 TYPE_VECTOR_SUBPARTS (arg1_type
));
4923 /* We could pass complain & tf_warning to unsafe_conversion_p,
4924 but the warnings (like Wsign-conversion) have already been
4925 given by the scalar build_conditional_expr_1. We still check
4926 unsafe_conversion_p to forbid truncating long long -> float. */
4927 if (unsafe_conversion_p (loc
, stype
, arg2
, NULL_TREE
, false))
4929 if (complain
& tf_error
)
4930 error_at (loc
, "conversion of scalar %qH to vector %qI "
4931 "involves truncation", arg2_type
, vtype
);
4932 return error_mark_node
;
4934 if (unsafe_conversion_p (loc
, stype
, arg3
, NULL_TREE
, false))
4936 if (complain
& tf_error
)
4937 error_at (loc
, "conversion of scalar %qH to vector %qI "
4938 "involves truncation", arg3_type
, vtype
);
4939 return error_mark_node
;
4942 arg2
= cp_convert (stype
, arg2
, complain
);
4943 arg2
= save_expr (arg2
);
4944 arg2
= build_vector_from_val (vtype
, arg2
);
4946 arg3
= cp_convert (stype
, arg3
, complain
);
4947 arg3
= save_expr (arg3
);
4948 arg3
= build_vector_from_val (vtype
, arg3
);
4952 if (VECTOR_TYPE_P (arg2_type
) != VECTOR_TYPE_P (arg3_type
))
4954 enum stv_conv convert_flag
=
4955 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
4956 complain
& tf_error
);
4958 switch (convert_flag
)
4961 return error_mark_node
;
4964 arg2
= save_expr (arg2
);
4965 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
4966 arg2
= build_vector_from_val (arg3_type
, arg2
);
4967 arg2_type
= TREE_TYPE (arg2
);
4972 arg3
= save_expr (arg3
);
4973 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
4974 arg3
= build_vector_from_val (arg2_type
, arg3
);
4975 arg3_type
= TREE_TYPE (arg3
);
4983 if (!same_type_p (arg2_type
, arg3_type
)
4984 || maybe_ne (TYPE_VECTOR_SUBPARTS (arg1_type
),
4985 TYPE_VECTOR_SUBPARTS (arg2_type
))
4986 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
4988 if (complain
& tf_error
)
4990 "incompatible vector types in conditional expression: "
4991 "%qT, %qT and %qT", TREE_TYPE (arg1
),
4992 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
4993 return error_mark_node
;
4996 if (!COMPARISON_CLASS_P (arg1
))
4998 tree cmp_type
= build_same_sized_truth_vector_type (arg1_type
);
4999 arg1
= build2 (NE_EXPR
, cmp_type
, arg1
, build_zero_cst (arg1_type
));
5001 return build3_loc (loc
, VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
5006 The first expression is implicitly converted to bool (clause
5008 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
5010 if (error_operand_p (arg1
))
5011 return error_mark_node
;
5015 If either the second or the third operand has type (possibly
5016 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
5017 array-to-pointer (_conv.array_), and function-to-pointer
5018 (_conv.func_) standard conversions are performed on the second
5019 and third operands. */
5020 arg2_type
= unlowered_expr_type (arg2
);
5021 arg3_type
= unlowered_expr_type (arg3
);
5022 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
5026 One of the following shall hold:
5028 --The second or the third operand (but not both) is a
5029 throw-expression (_except.throw_); the result is of the type
5030 and value category of the other.
5032 --Both the second and the third operands have type void; the
5033 result is of type void and is a prvalue. */
5034 if (TREE_CODE (arg2
) == THROW_EXPR
5035 && TREE_CODE (arg3
) != THROW_EXPR
)
5037 result_type
= arg3_type
;
5038 is_glvalue
= glvalue_p (arg3
);
5040 else if (TREE_CODE (arg2
) != THROW_EXPR
5041 && TREE_CODE (arg3
) == THROW_EXPR
)
5043 result_type
= arg2_type
;
5044 is_glvalue
= glvalue_p (arg2
);
5046 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
5048 result_type
= void_type_node
;
5053 if (complain
& tf_error
)
5055 if (VOID_TYPE_P (arg2_type
))
5056 error_at (cp_expr_loc_or_loc (arg3
, loc
),
5057 "second operand to the conditional operator "
5058 "is of type %<void%>, but the third operand is "
5059 "neither a throw-expression nor of type %<void%>");
5061 error_at (cp_expr_loc_or_loc (arg2
, loc
),
5062 "third operand to the conditional operator "
5063 "is of type %<void%>, but the second operand is "
5064 "neither a throw-expression nor of type %<void%>");
5066 return error_mark_node
;
5069 goto valid_operands
;
5073 Otherwise, if the second and third operand have different types,
5074 and either has (possibly cv-qualified) class type, or if both are
5075 glvalues of the same value category and the same type except for
5076 cv-qualification, an attempt is made to convert each of those operands
5077 to the type of the other. */
5078 else if (!same_type_p (arg2_type
, arg3_type
)
5079 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)
5080 || (same_type_ignoring_top_level_qualifiers_p (arg2_type
,
5082 && glvalue_p (arg2
) && glvalue_p (arg3
)
5083 && lvalue_p (arg2
) == lvalue_p (arg3
))))
5087 bool converted
= false;
5089 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5090 p
= conversion_obstack_alloc (0);
5092 conv2
= conditional_conversion (arg2
, arg3
, complain
);
5093 conv3
= conditional_conversion (arg3
, arg2
, complain
);
5097 If both can be converted, or one can be converted but the
5098 conversion is ambiguous, the program is ill-formed. If
5099 neither can be converted, the operands are left unchanged and
5100 further checking is performed as described below. If exactly
5101 one conversion is possible, that conversion is applied to the
5102 chosen operand and the converted operand is used in place of
5103 the original operand for the remainder of this section. */
5104 if ((conv2
&& !conv2
->bad_p
5105 && conv3
&& !conv3
->bad_p
)
5106 || (conv2
&& conv2
->kind
== ck_ambig
)
5107 || (conv3
&& conv3
->kind
== ck_ambig
))
5109 if (complain
& tf_error
)
5111 error_at (loc
, "operands to ?: have different types %qT and %qT",
5112 arg2_type
, arg3_type
);
5113 if (conv2
&& !conv2
->bad_p
&& conv3
&& !conv3
->bad_p
)
5114 inform (loc
, " and each type can be converted to the other");
5115 else if (conv2
&& conv2
->kind
== ck_ambig
)
5116 convert_like (conv2
, arg2
, complain
);
5118 convert_like (conv3
, arg3
, complain
);
5120 result
= error_mark_node
;
5122 else if (conv2
&& !conv2
->bad_p
)
5124 arg2
= convert_like (conv2
, arg2
, complain
);
5125 arg2
= convert_from_reference (arg2
);
5126 arg2_type
= TREE_TYPE (arg2
);
5127 /* Even if CONV2 is a valid conversion, the result of the
5128 conversion may be invalid. For example, if ARG3 has type
5129 "volatile X", and X does not have a copy constructor
5130 accepting a "volatile X&", then even if ARG2 can be
5131 converted to X, the conversion will fail. */
5132 if (error_operand_p (arg2
))
5133 result
= error_mark_node
;
5136 else if (conv3
&& !conv3
->bad_p
)
5138 arg3
= convert_like (conv3
, arg3
, complain
);
5139 arg3
= convert_from_reference (arg3
);
5140 arg3_type
= TREE_TYPE (arg3
);
5141 if (error_operand_p (arg3
))
5142 result
= error_mark_node
;
5146 /* Free all the conversions we allocated. */
5147 obstack_free (&conversion_obstack
, p
);
5152 /* If, after the conversion, both operands have class type,
5153 treat the cv-qualification of both operands as if it were the
5154 union of the cv-qualification of the operands.
5156 The standard is not clear about what to do in this
5157 circumstance. For example, if the first operand has type
5158 "const X" and the second operand has a user-defined
5159 conversion to "volatile X", what is the type of the second
5160 operand after this step? Making it be "const X" (matching
5161 the first operand) seems wrong, as that discards the
5162 qualification without actually performing a copy. Leaving it
5163 as "volatile X" seems wrong as that will result in the
5164 conditional expression failing altogether, even though,
5165 according to this step, the one operand could be converted to
5166 the type of the other. */
5168 && CLASS_TYPE_P (arg2_type
)
5169 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
5170 arg2_type
= arg3_type
=
5171 cp_build_qualified_type (arg2_type
,
5172 cp_type_quals (arg2_type
)
5173 | cp_type_quals (arg3_type
));
5178 If the second and third operands are glvalues of the same value
5179 category and have the same type, the result is of that type and
5181 if (((lvalue_p (arg2
) && lvalue_p (arg3
))
5182 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
5183 && same_type_p (arg2_type
, arg3_type
))
5185 result_type
= arg2_type
;
5186 arg2
= mark_lvalue_use (arg2
);
5187 arg3
= mark_lvalue_use (arg3
);
5188 goto valid_operands
;
5193 Otherwise, the result is an rvalue. If the second and third
5194 operand do not have the same type, and either has (possibly
5195 cv-qualified) class type, overload resolution is used to
5196 determine the conversions (if any) to be applied to the operands
5197 (_over.match.oper_, _over.built_). */
5199 if (!same_type_p (arg2_type
, arg3_type
)
5200 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
5206 /* Rearrange the arguments so that add_builtin_candidate only has
5207 to know about two args. In build_builtin_candidate, the
5208 arguments are unscrambled. */
5212 add_builtin_candidates (&candidates
,
5215 ovl_op_identifier (false, COND_EXPR
),
5217 LOOKUP_NORMAL
, complain
);
5221 If the overload resolution fails, the program is
5223 candidates
= splice_viable (candidates
, false, &any_viable_p
);
5226 if (complain
& tf_error
)
5227 error_at (loc
, "operands to ?: have different types %qT and %qT",
5228 arg2_type
, arg3_type
);
5229 return error_mark_node
;
5231 cand
= tourney (candidates
, complain
);
5234 if (complain
& tf_error
)
5236 auto_diagnostic_group d
;
5237 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
5238 print_z_candidates (loc
, candidates
);
5240 return error_mark_node
;
5245 Otherwise, the conversions thus determined are applied, and
5246 the converted operands are used in place of the original
5247 operands for the remainder of this section. */
5248 conv
= cand
->convs
[0];
5249 arg1
= convert_like (conv
, arg1
, complain
);
5250 conv
= cand
->convs
[1];
5251 arg2
= convert_like (conv
, arg2
, complain
);
5252 arg2_type
= TREE_TYPE (arg2
);
5253 conv
= cand
->convs
[2];
5254 arg3
= convert_like (conv
, arg3
, complain
);
5255 arg3_type
= TREE_TYPE (arg3
);
5260 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5261 and function-to-pointer (_conv.func_) standard conversions are
5262 performed on the second and third operands.
5264 We need to force the lvalue-to-rvalue conversion here for class types,
5265 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5266 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5269 arg2
= force_rvalue (arg2
, complain
);
5270 if (!CLASS_TYPE_P (arg2_type
))
5271 arg2_type
= TREE_TYPE (arg2
);
5273 arg3
= force_rvalue (arg3
, complain
);
5274 if (!CLASS_TYPE_P (arg3_type
))
5275 arg3_type
= TREE_TYPE (arg3
);
5277 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5278 return error_mark_node
;
5282 After those conversions, one of the following shall hold:
5284 --The second and third operands have the same type; the result is of
5286 if (same_type_p (arg2_type
, arg3_type
))
5287 result_type
= arg2_type
;
5290 --The second and third operands have arithmetic or enumeration
5291 type; the usual arithmetic conversions are performed to bring
5292 them to a common type, and the result is of that type. */
5293 else if ((ARITHMETIC_TYPE_P (arg2_type
)
5294 || UNSCOPED_ENUM_P (arg2_type
))
5295 && (ARITHMETIC_TYPE_P (arg3_type
)
5296 || UNSCOPED_ENUM_P (arg3_type
)))
5298 /* In this case, there is always a common type. */
5299 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
5301 if (complain
& tf_warning
)
5302 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
5303 "implicit conversion from %qH to %qI to "
5304 "match other result of conditional",
5307 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5308 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
5310 if (TREE_CODE (orig_arg2
) == CONST_DECL
5311 && TREE_CODE (orig_arg3
) == CONST_DECL
5312 && DECL_CONTEXT (orig_arg2
) == DECL_CONTEXT (orig_arg3
))
5313 /* Two enumerators from the same enumeration can have different
5314 types when the enumeration is still being defined. */;
5315 else if (complain
& tf_warning
)
5316 warning_at (loc
, OPT_Wenum_compare
, "enumeral mismatch in "
5317 "conditional expression: %qT vs %qT",
5318 arg2_type
, arg3_type
);
5320 else if (extra_warnings
5321 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5322 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
5323 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
5324 && !same_type_p (arg2_type
,
5325 type_promotes_to (arg3_type
)))))
5327 if (complain
& tf_warning
)
5328 warning_at (loc
, OPT_Wextra
, "enumeral and non-enumeral type in "
5329 "conditional expression");
5332 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5333 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5337 --The second and third operands have pointer type, or one has
5338 pointer type and the other is a null pointer constant; pointer
5339 conversions (_conv.ptr_) and qualification conversions
5340 (_conv.qual_) are performed to bring them to their composite
5341 pointer type (_expr.rel_). The result is of the composite
5344 --The second and third operands have pointer to member type, or
5345 one has pointer to member type and the other is a null pointer
5346 constant; pointer to member conversions (_conv.mem_) and
5347 qualification conversions (_conv.qual_) are performed to bring
5348 them to a common type, whose cv-qualification shall match the
5349 cv-qualification of either the second or the third operand.
5350 The result is of the common type. */
5351 else if ((null_ptr_cst_p (arg2
)
5352 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
5353 || (null_ptr_cst_p (arg3
)
5354 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
5355 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
5356 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
5357 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
5359 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
5360 arg3
, CPO_CONDITIONAL_EXPR
,
5362 if (result_type
== error_mark_node
)
5363 return error_mark_node
;
5364 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5365 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5370 if (complain
& tf_error
)
5371 error_at (loc
, "operands to ?: have different types %qT and %qT",
5372 arg2_type
, arg3_type
);
5373 return error_mark_node
;
5376 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5377 return error_mark_node
;
5380 if (processing_template_decl
&& is_glvalue
)
5382 /* Let lvalue_kind know this was a glvalue. */
5383 tree arg
= (result_type
== arg2_type
? arg2
: arg3
);
5384 result_type
= cp_build_reference_type (result_type
, xvalue_p (arg
));
5387 result
= build3_loc (loc
, COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
5389 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5390 warn here, because the COND_EXPR will be turned into ARG2. */
5391 if (warn_duplicated_branches
5392 && (complain
& tf_warning
)
5393 && (arg2
== arg3
|| operand_equal_p (arg2
, arg3
, 0)))
5394 warning_at (EXPR_LOCATION (result
), OPT_Wduplicated_branches
,
5395 "this condition has identical branches");
5397 /* We can't use result_type below, as fold might have returned a
5402 /* Expand both sides into the same slot, hopefully the target of
5403 the ?: expression. We used to check for TARGET_EXPRs here,
5404 but now we sometimes wrap them in NOP_EXPRs so the test would
5406 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5407 result
= get_target_expr_sfinae (result
, complain
);
5408 /* If this expression is an rvalue, but might be mistaken for an
5409 lvalue, we must add a NON_LVALUE_EXPR. */
5410 result
= rvalue (result
);
5413 result
= force_paren_expr (result
);
5418 /* Wrapper for above. */
5421 build_conditional_expr (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
5422 tsubst_flags_t complain
)
5425 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5426 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5427 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5431 /* OPERAND is an operand to an expression. Perform necessary steps
5432 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5436 prep_operand (tree operand
)
5440 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5441 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5442 /* Make sure the template type is instantiated now. */
5443 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5449 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5450 OVERLOAD) to the CANDIDATES, returning an updated list of
5451 CANDIDATES. The ARGS are the arguments provided to the call;
5452 if FIRST_ARG is non-null it is the implicit object argument,
5453 otherwise the first element of ARGS is used if needed. The
5454 EXPLICIT_TARGS are explicit template arguments provided.
5455 TEMPLATE_ONLY is true if only template functions should be
5456 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5457 add_function_candidate. */
5460 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5462 tree explicit_targs
, bool template_only
,
5463 tree conversion_path
, tree access_path
,
5465 struct z_candidate
**candidates
,
5466 tsubst_flags_t complain
)
5469 const vec
<tree
, va_gc
> *non_static_args
;
5470 bool check_list_ctor
= false;
5471 bool check_converting
= false;
5472 unification_kind_t strict
;
5477 /* Precalculate special handling of constructors and conversion ops. */
5478 tree fn
= OVL_FIRST (fns
);
5479 if (DECL_CONV_FN_P (fn
))
5481 check_list_ctor
= false;
5482 check_converting
= (flags
& LOOKUP_ONLYCONVERTING
) != 0;
5483 if (flags
& LOOKUP_NO_CONVERSION
)
5484 /* We're doing return_type(x). */
5485 strict
= DEDUCE_CONV
;
5487 /* We're doing x.operator return_type(). */
5488 strict
= DEDUCE_EXACT
;
5489 /* [over.match.funcs] For conversion functions, the function
5490 is considered to be a member of the class of the implicit
5491 object argument for the purpose of defining the type of
5492 the implicit object parameter. */
5493 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5497 if (DECL_CONSTRUCTOR_P (fn
))
5499 check_list_ctor
= (flags
& LOOKUP_LIST_ONLY
) != 0;
5500 /* For list-initialization we consider explicit constructors
5501 and complain if one is chosen. */
5503 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5504 == LOOKUP_ONLYCONVERTING
);
5506 strict
= DEDUCE_CALL
;
5507 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5511 non_static_args
= args
;
5513 /* Delay creating the implicit this parameter until it is needed. */
5514 non_static_args
= NULL
;
5516 for (lkp_iterator
iter (fns
); iter
; ++iter
)
5520 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5522 if (check_list_ctor
&& !is_list_ctor (fn
))
5525 tree fn_first_arg
= NULL_TREE
;
5526 const vec
<tree
, va_gc
> *fn_args
= args
;
5528 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5530 /* Figure out where the object arg comes from. If this
5531 function is a non-static member and we didn't get an
5532 implicit object argument, move it out of args. */
5533 if (first_arg
== NULL_TREE
)
5537 vec
<tree
, va_gc
> *tempvec
;
5538 vec_alloc (tempvec
, args
->length () - 1);
5539 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5540 tempvec
->quick_push (arg
);
5541 non_static_args
= tempvec
;
5542 first_arg
= (*args
)[0];
5545 fn_first_arg
= first_arg
;
5546 fn_args
= non_static_args
;
5549 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5550 add_template_candidate (candidates
,
5562 else if (!template_only
)
5563 add_function_candidate (candidates
,
5576 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5577 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5580 op_is_ordered (tree_code code
)
5586 return (flag_strong_eval_order
> 1 ? -1 : 0);
5590 return (flag_strong_eval_order
> 1 ? 1 : 0);
5593 // Not overloadable (yet).
5595 // Only one argument.
5602 return (flag_strong_eval_order
? 1 : 0);
5610 build_new_op_1 (location_t loc
, enum tree_code code
, int flags
, tree arg1
,
5611 tree arg2
, tree arg3
, tree
*overload
, tsubst_flags_t complain
)
5613 struct z_candidate
*candidates
= 0, *cand
;
5614 vec
<tree
, va_gc
> *arglist
;
5616 tree result
= NULL_TREE
;
5617 bool result_valid_p
= false;
5618 enum tree_code code2
= NOP_EXPR
;
5619 enum tree_code code_orig_arg1
= ERROR_MARK
;
5620 enum tree_code code_orig_arg2
= ERROR_MARK
;
5626 if (error_operand_p (arg1
)
5627 || error_operand_p (arg2
)
5628 || error_operand_p (arg3
))
5629 return error_mark_node
;
5631 bool ismodop
= code
== MODIFY_EXPR
;
5634 code2
= TREE_CODE (arg3
);
5637 tree fnname
= ovl_op_identifier (ismodop
, ismodop
? code2
: code
);
5639 arg1
= prep_operand (arg1
);
5641 bool memonly
= false;
5646 case VEC_DELETE_EXPR
:
5648 /* Use build_op_new_call and build_op_delete_call instead. */
5652 /* Use build_op_call instead. */
5655 case TRUTH_ORIF_EXPR
:
5656 case TRUTH_ANDIF_EXPR
:
5657 case TRUTH_AND_EXPR
:
5659 /* These are saved for the sake of warn_logical_operator. */
5660 code_orig_arg1
= TREE_CODE (arg1
);
5661 code_orig_arg2
= TREE_CODE (arg2
);
5669 /* These are saved for the sake of maybe_warn_bool_compare. */
5670 code_orig_arg1
= TREE_CODE (TREE_TYPE (arg1
));
5671 code_orig_arg2
= TREE_CODE (TREE_TYPE (arg2
));
5674 /* =, ->, [], () must be non-static member functions. */
5676 if (code2
!= NOP_EXPR
)
5688 arg2
= prep_operand (arg2
);
5689 arg3
= prep_operand (arg3
);
5691 if (code
== COND_EXPR
)
5692 /* Use build_conditional_expr instead. */
5694 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5695 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5698 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5699 arg2
= integer_zero_node
;
5701 vec_alloc (arglist
, 3);
5702 arglist
->quick_push (arg1
);
5703 if (arg2
!= NULL_TREE
)
5704 arglist
->quick_push (arg2
);
5705 if (arg3
!= NULL_TREE
)
5706 arglist
->quick_push (arg3
);
5708 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5709 p
= conversion_obstack_alloc (0);
5711 /* Add namespace-scope operators to the list of functions to
5715 tree fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/true, 0, 0);
5716 fns
= lookup_arg_dependent (fnname
, fns
, arglist
);
5717 add_candidates (fns
, NULL_TREE
, arglist
, NULL_TREE
,
5718 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5719 flags
, &candidates
, complain
);
5724 args
[2] = NULL_TREE
;
5726 /* Add class-member operators to the candidate set. */
5727 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5731 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5732 if (fns
== error_mark_node
)
5734 result
= error_mark_node
;
5735 goto user_defined_result_ready
;
5738 add_candidates (BASELINK_FUNCTIONS (fns
),
5739 NULL_TREE
, arglist
, NULL_TREE
,
5741 BASELINK_BINFO (fns
),
5742 BASELINK_ACCESS_BINFO (fns
),
5743 flags
, &candidates
, complain
);
5745 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5746 only non-member functions that have type T1 or reference to
5747 cv-qualified-opt T1 for the first argument, if the first argument
5748 has an enumeration type, or T2 or reference to cv-qualified-opt
5749 T2 for the second argument, if the second argument has an
5750 enumeration type. Filter out those that don't match. */
5751 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5753 struct z_candidate
**candp
, **next
;
5755 for (candp
= &candidates
; *candp
; candp
= next
)
5757 tree parmlist
, parmtype
;
5758 int i
, nargs
= (arg2
? 2 : 1);
5763 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5765 for (i
= 0; i
< nargs
; ++i
)
5767 parmtype
= TREE_VALUE (parmlist
);
5769 if (TYPE_REF_P (parmtype
))
5770 parmtype
= TREE_TYPE (parmtype
);
5771 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5772 && (same_type_ignoring_top_level_qualifiers_p
5773 (TREE_TYPE (args
[i
]), parmtype
)))
5776 parmlist
= TREE_CHAIN (parmlist
);
5779 /* No argument has an appropriate type, so remove this
5780 candidate function from the list. */
5783 *candp
= cand
->next
;
5789 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5796 /* For these, the built-in candidates set is empty
5797 [over.match.oper]/3. We don't want non-strict matches
5798 because exact matches are always possible with built-in
5799 operators. The built-in candidate set for COMPONENT_REF
5800 would be empty too, but since there are no such built-in
5801 operators, we accept non-strict matches for them. */
5810 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5815 case POSTINCREMENT_EXPR
:
5816 case POSTDECREMENT_EXPR
:
5817 /* Don't try anything fancy if we're not allowed to produce
5819 if (!(complain
& tf_error
))
5820 return error_mark_node
;
5822 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5823 distinguish between prefix and postfix ++ and
5824 operator++() was used for both, so we allow this with
5828 const char *msg
= (flag_permissive
)
5829 ? G_("no %<%D(int)%> declared for postfix %qs,"
5830 " trying prefix operator instead")
5831 : G_("no %<%D(int)%> declared for postfix %qs");
5832 permerror (loc
, msg
, fnname
, OVL_OP_INFO (false, code
)->name
);
5835 if (!flag_permissive
)
5836 return error_mark_node
;
5838 if (code
== POSTINCREMENT_EXPR
)
5839 code
= PREINCREMENT_EXPR
;
5841 code
= PREDECREMENT_EXPR
;
5842 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5843 NULL_TREE
, overload
, complain
);
5846 /* The caller will deal with these. */
5851 result_valid_p
= true;
5855 if (complain
& tf_error
)
5857 /* If one of the arguments of the operator represents
5858 an invalid use of member function pointer, try to report
5859 a meaningful error ... */
5860 if (invalid_nonstatic_memfn_p (loc
, arg1
, tf_error
)
5861 || invalid_nonstatic_memfn_p (loc
, arg2
, tf_error
)
5862 || invalid_nonstatic_memfn_p (loc
, arg3
, tf_error
))
5863 /* We displayed the error message. */;
5866 /* ... Otherwise, report the more generic
5867 "no matching operator found" error */
5868 auto_diagnostic_group d
;
5869 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
5870 print_z_candidates (loc
, candidates
);
5873 result
= error_mark_node
;
5879 cand
= tourney (candidates
, complain
);
5882 if (complain
& tf_error
)
5884 auto_diagnostic_group d
;
5885 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
5886 print_z_candidates (loc
, candidates
);
5888 result
= error_mark_node
;
5890 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
5893 *overload
= cand
->fn
;
5895 if (resolve_args (arglist
, complain
) == NULL
)
5896 result
= error_mark_node
;
5898 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5900 if (trivial_fn_p (cand
->fn
))
5901 /* There won't be a CALL_EXPR. */;
5902 else if (result
&& result
!= error_mark_node
)
5904 tree call
= extract_call_expr (result
);
5905 CALL_EXPR_OPERATOR_SYNTAX (call
) = true;
5907 if (processing_template_decl
&& DECL_HIDDEN_FRIEND_P (cand
->fn
))
5908 /* This prevents build_new_function_call from discarding this
5909 function during instantiation of the enclosing template. */
5910 KOENIG_LOOKUP_P (call
) = 1;
5912 /* Specify evaluation order as per P0145R2. */
5913 CALL_EXPR_ORDERED_ARGS (call
) = false;
5914 switch (op_is_ordered (code
))
5917 CALL_EXPR_REVERSE_ARGS (call
) = true;
5921 CALL_EXPR_ORDERED_ARGS (call
) = true;
5931 /* Give any warnings we noticed during overload resolution. */
5932 if (cand
->warnings
&& (complain
& tf_warning
))
5934 struct candidate_warning
*w
;
5935 for (w
= cand
->warnings
; w
; w
= w
->next
)
5936 joust (cand
, w
->loser
, 1, complain
);
5939 /* Check for comparison of different enum types. */
5948 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
5949 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
5950 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
5951 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
5952 && (complain
& tf_warning
))
5954 warning (OPT_Wenum_compare
,
5955 "comparison between %q#T and %q#T",
5956 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
5963 /* We need to strip any leading REF_BIND so that bitfields
5964 don't cause errors. This should not remove any important
5965 conversions, because builtins don't apply to class
5966 objects directly. */
5967 conv
= cand
->convs
[0];
5968 if (conv
->kind
== ck_ref_bind
)
5969 conv
= next_conversion (conv
);
5970 arg1
= convert_like (conv
, arg1
, complain
);
5974 conv
= cand
->convs
[1];
5975 if (conv
->kind
== ck_ref_bind
)
5976 conv
= next_conversion (conv
);
5978 arg2
= decay_conversion (arg2
, complain
);
5980 /* We need to call warn_logical_operator before
5981 converting arg2 to a boolean_type, but after
5982 decaying an enumerator to its value. */
5983 if (complain
& tf_warning
)
5984 warn_logical_operator (loc
, code
, boolean_type_node
,
5985 code_orig_arg1
, arg1
,
5986 code_orig_arg2
, arg2
);
5988 arg2
= convert_like (conv
, arg2
, complain
);
5992 conv
= cand
->convs
[2];
5993 if (conv
->kind
== ck_ref_bind
)
5994 conv
= next_conversion (conv
);
5995 arg3
= convert_like (conv
, arg3
, complain
);
6001 user_defined_result_ready
:
6003 /* Free all the conversions we allocated. */
6004 obstack_free (&conversion_obstack
, p
);
6006 if (result
|| result_valid_p
)
6013 return cp_build_modify_expr (loc
, arg1
, code2
, arg2
, complain
);
6016 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
6018 case TRUTH_ANDIF_EXPR
:
6019 case TRUTH_ORIF_EXPR
:
6020 case TRUTH_AND_EXPR
:
6022 if (complain
& tf_warning
)
6023 warn_logical_operator (loc
, code
, boolean_type_node
,
6024 code_orig_arg1
, arg1
,
6025 code_orig_arg2
, arg2
);
6033 if ((complain
& tf_warning
)
6034 && ((code_orig_arg1
== BOOLEAN_TYPE
)
6035 ^ (code_orig_arg2
== BOOLEAN_TYPE
)))
6036 maybe_warn_bool_compare (loc
, code
, arg1
, arg2
);
6037 if (complain
& tf_warning
&& warn_tautological_compare
)
6038 warn_tautological_cmp (loc
, code
, arg1
, arg2
);
6043 case TRUNC_DIV_EXPR
:
6048 case TRUNC_MOD_EXPR
:
6052 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
6054 case UNARY_PLUS_EXPR
:
6057 case TRUTH_NOT_EXPR
:
6058 case PREINCREMENT_EXPR
:
6059 case POSTINCREMENT_EXPR
:
6060 case PREDECREMENT_EXPR
:
6061 case POSTDECREMENT_EXPR
:
6065 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
6068 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
6071 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
6075 /* The caller will deal with these. */
6087 /* Wrapper for above. */
6090 build_new_op (location_t loc
, enum tree_code code
, int flags
,
6091 tree arg1
, tree arg2
, tree arg3
,
6092 tree
*overload
, tsubst_flags_t complain
)
6095 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
6096 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
6097 overload
, complain
);
6098 timevar_cond_stop (TV_OVERLOAD
, subtime
);
6102 /* CALL was returned by some call-building function; extract the actual
6103 CALL_EXPR from any bits that have been tacked on, e.g. by
6104 convert_from_reference. */
6107 extract_call_expr (tree call
)
6109 while (TREE_CODE (call
) == COMPOUND_EXPR
)
6110 call
= TREE_OPERAND (call
, 1);
6111 if (REFERENCE_REF_P (call
))
6112 call
= TREE_OPERAND (call
, 0);
6113 if (TREE_CODE (call
) == TARGET_EXPR
)
6114 call
= TARGET_EXPR_INITIAL (call
);
6115 gcc_assert (TREE_CODE (call
) == CALL_EXPR
6116 || TREE_CODE (call
) == AGGR_INIT_EXPR
6117 || call
== error_mark_node
);
6121 /* Returns true if FN has two parameters, of which the second has type
6125 second_parm_is_size_t (tree fn
)
6127 tree t
= FUNCTION_ARG_CHAIN (fn
);
6128 if (!t
|| !same_type_p (TREE_VALUE (t
), size_type_node
))
6131 if (t
== void_list_node
)
6133 if (aligned_new_threshold
&& t
6134 && same_type_p (TREE_VALUE (t
), align_type_node
)
6135 && TREE_CHAIN (t
) == void_list_node
)
6140 /* True if T, an allocation function, has std::align_val_t as its second
6144 aligned_allocation_fn_p (tree t
)
6146 if (!aligned_new_threshold
)
6149 tree a
= FUNCTION_ARG_CHAIN (t
);
6150 return (a
&& same_type_p (TREE_VALUE (a
), align_type_node
));
6153 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6154 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6155 std::align_val_t. */
6158 aligned_deallocation_fn_p (tree t
)
6160 if (!aligned_new_threshold
)
6163 /* A template instance is never a usual deallocation function,
6164 regardless of its signature. */
6165 if (TREE_CODE (t
) == TEMPLATE_DECL
6166 || primary_template_specialization_p (t
))
6169 tree a
= FUNCTION_ARG_CHAIN (t
);
6170 if (same_type_p (TREE_VALUE (a
), align_type_node
)
6171 && TREE_CHAIN (a
) == void_list_node
)
6173 if (!same_type_p (TREE_VALUE (a
), size_type_node
))
6176 if (a
&& same_type_p (TREE_VALUE (a
), align_type_node
)
6177 && TREE_CHAIN (a
) == void_list_node
)
6182 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6183 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6186 usual_deallocation_fn_p (tree t
)
6188 /* A template instance is never a usual deallocation function,
6189 regardless of its signature. */
6190 if (TREE_CODE (t
) == TEMPLATE_DECL
6191 || primary_template_specialization_p (t
))
6194 /* If a class T has a member deallocation function named operator delete
6195 with exactly one parameter, then that function is a usual
6196 (non-placement) deallocation function. If class T does not declare
6197 such an operator delete but does declare a member deallocation
6198 function named operator delete with exactly two parameters, the second
6199 of which has type std::size_t (18.2), then this function is a usual
6200 deallocation function. */
6201 bool global
= DECL_NAMESPACE_SCOPE_P (t
);
6202 tree chain
= FUNCTION_ARG_CHAIN (t
);
6205 if (chain
== void_list_node
6206 || ((!global
|| flag_sized_deallocation
)
6207 && second_parm_is_size_t (t
)))
6209 if (aligned_deallocation_fn_p (t
))
6214 /* Build a call to operator delete. This has to be handled very specially,
6215 because the restrictions on what signatures match are different from all
6216 other call instances. For a normal delete, only a delete taking (void *)
6217 or (void *, size_t) is accepted. For a placement delete, only an exact
6218 match with the placement new is accepted.
6220 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6221 ADDR is the pointer to be deleted.
6222 SIZE is the size of the memory block to be deleted.
6223 GLOBAL_P is true if the delete-expression should not consider
6224 class-specific delete operators.
6225 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6227 If this call to "operator delete" is being generated as part to
6228 deallocate memory allocated via a new-expression (as per [expr.new]
6229 which requires that if the initialization throws an exception then
6230 we call a deallocation function), then ALLOC_FN is the allocation
6234 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
6235 bool global_p
, tree placement
,
6236 tree alloc_fn
, tsubst_flags_t complain
)
6238 tree fn
= NULL_TREE
;
6239 tree fns
, fnname
, type
, t
;
6241 if (addr
== error_mark_node
)
6242 return error_mark_node
;
6244 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
6246 fnname
= ovl_op_identifier (false, code
);
6248 if (CLASS_TYPE_P (type
)
6249 && COMPLETE_TYPE_P (complete_type (type
))
6253 If the result of the lookup is ambiguous or inaccessible, or if
6254 the lookup selects a placement deallocation function, the
6255 program is ill-formed.
6257 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6259 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
6260 if (fns
== error_mark_node
)
6261 return error_mark_node
;
6266 if (fns
== NULL_TREE
)
6267 fns
= lookup_name_nonclass (fnname
);
6269 /* Strip const and volatile from addr. */
6270 addr
= cp_convert (ptr_type_node
, addr
, complain
);
6274 /* "A declaration of a placement deallocation function matches the
6275 declaration of a placement allocation function if it has the same
6276 number of parameters and, after parameter transformations (8.3.5),
6277 all parameter types except the first are identical."
6279 So we build up the function type we want and ask instantiate_type
6280 to get it for us. */
6281 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
6282 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
6283 t
= build_function_type (void_type_node
, t
);
6285 fn
= instantiate_type (t
, fns
, tf_none
);
6286 if (fn
== error_mark_node
)
6289 fn
= MAYBE_BASELINK_FUNCTIONS (fn
);
6291 /* "If the lookup finds the two-parameter form of a usual deallocation
6292 function (3.7.4.2) and that function, considered as a placement
6293 deallocation function, would have been selected as a match for the
6294 allocation function, the program is ill-formed." */
6295 if (second_parm_is_size_t (fn
))
6297 const char *const msg1
6298 = G_("exception cleanup for this placement new selects "
6299 "non-placement operator delete");
6300 const char *const msg2
6301 = G_("%qD is a usual (non-placement) deallocation "
6302 "function in C++14 (or with -fsized-deallocation)");
6304 /* But if the class has an operator delete (void *), then that is
6305 the usual deallocation function, so we shouldn't complain
6306 about using the operator delete (void *, size_t). */
6307 if (DECL_CLASS_SCOPE_P (fn
))
6308 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
));
6312 if (usual_deallocation_fn_p (elt
)
6313 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
6316 /* Before C++14 a two-parameter global deallocation function is
6317 always a placement deallocation function, but warn if
6319 else if (!flag_sized_deallocation
)
6321 if (complain
& tf_warning
)
6323 auto_diagnostic_group d
;
6324 if (warning (OPT_Wc__14_compat
, msg1
))
6325 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6330 if (complain
& tf_warning_or_error
)
6332 auto_diagnostic_group d
;
6333 if (permerror (input_location
, msg1
))
6335 /* Only mention C++14 for namespace-scope delete. */
6336 if (DECL_NAMESPACE_SCOPE_P (fn
))
6337 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6339 inform (DECL_SOURCE_LOCATION (fn
),
6340 "%qD is a usual (non-placement) deallocation "
6345 return error_mark_node
;
6350 /* "Any non-placement deallocation function matches a non-placement
6351 allocation function. If the lookup finds a single matching
6352 deallocation function, that function will be called; otherwise, no
6353 deallocation function will be called." */
6354 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
)); iter
; ++iter
)
6357 if (usual_deallocation_fn_p (elt
))
6365 /* -- If the type has new-extended alignment, a function with a
6366 parameter of type std::align_val_t is preferred; otherwise a
6367 function without such a parameter is preferred. If exactly one
6368 preferred function is found, that function is selected and the
6369 selection process terminates. If more than one preferred
6370 function is found, all non-preferred functions are eliminated
6371 from further consideration. */
6372 if (aligned_new_threshold
)
6374 bool want_align
= type_has_new_extended_alignment (type
);
6375 bool fn_align
= aligned_deallocation_fn_p (fn
);
6376 bool elt_align
= aligned_deallocation_fn_p (elt
);
6378 if (elt_align
!= fn_align
)
6380 if (want_align
== elt_align
)
6386 /* -- If the deallocation functions have class scope, the one
6387 without a parameter of type std::size_t is selected. */
6389 if (DECL_CLASS_SCOPE_P (fn
))
6392 /* -- If the type is complete and if, for the second alternative
6393 (delete array) only, the operand is a pointer to a class type
6394 with a non-trivial destructor or a (possibly multi-dimensional)
6395 array thereof, the function with a parameter of type std::size_t
6398 -- Otherwise, it is unspecified whether a deallocation function
6399 with a parameter of type std::size_t is selected. */
6402 want_size
= COMPLETE_TYPE_P (type
);
6403 if (code
== VEC_DELETE_EXPR
6404 && !TYPE_VEC_NEW_USES_COOKIE (type
))
6405 /* We need a cookie to determine the array size. */
6408 bool fn_size
= second_parm_is_size_t (fn
);
6409 bool elt_size
= second_parm_is_size_t (elt
);
6410 gcc_assert (fn_size
!= elt_size
);
6411 if (want_size
== elt_size
)
6416 /* If we have a matching function, call it. */
6419 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6421 /* If the FN is a member function, make sure that it is
6423 if (BASELINK_P (fns
))
6424 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
6427 /* Core issue 901: It's ok to new a type with deleted delete. */
6428 if (DECL_DELETED_FN (fn
) && alloc_fn
)
6433 /* The placement args might not be suitable for overload
6434 resolution at this point, so build the call directly. */
6435 int nargs
= call_expr_nargs (placement
);
6436 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
6439 for (i
= 1; i
< nargs
; i
++)
6440 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
6441 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
6442 return error_mark_node
;
6443 return build_cxx_call (fn
, nargs
, argarray
, complain
);
6448 vec
<tree
, va_gc
> *args
= make_tree_vector ();
6449 args
->quick_push (addr
);
6450 if (second_parm_is_size_t (fn
))
6451 args
->quick_push (size
);
6452 if (aligned_deallocation_fn_p (fn
))
6454 tree al
= build_int_cst (align_type_node
, TYPE_ALIGN_UNIT (type
));
6455 args
->quick_push (al
);
6457 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
6458 release_tree_vector (args
);
6465 If no unambiguous matching deallocation function can be found,
6466 propagating the exception does not cause the object's memory to
6470 if ((complain
& tf_warning
)
6472 warning (0, "no corresponding deallocation function for %qD",
6477 if (complain
& tf_error
)
6478 error ("no suitable %<operator %s%> for %qT",
6479 OVL_OP_INFO (false, code
)->name
, type
);
6480 return error_mark_node
;
6483 /* If the current scope isn't allowed to access DECL along
6484 BASETYPE_PATH, give an error. The most derived class in
6485 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6486 the declaration to use in the error diagnostic. */
6489 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
6490 tsubst_flags_t complain
, access_failure_info
*afi
)
6492 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
6494 if (flag_new_inheriting_ctors
6495 && DECL_INHERITED_CTOR (decl
))
6497 /* 7.3.3/18: The additional constructors are accessible if they would be
6498 accessible when used to construct an object of the corresponding base
6500 decl
= strip_inheriting_ctors (decl
);
6501 basetype_path
= lookup_base (basetype_path
, DECL_CONTEXT (decl
),
6502 ba_any
, NULL
, complain
);
6505 if (!accessible_p (basetype_path
, decl
, true))
6507 if (complain
& tf_error
)
6509 if (flag_new_inheriting_ctors
)
6510 diag_decl
= strip_inheriting_ctors (diag_decl
);
6511 if (TREE_PRIVATE (decl
))
6513 error ("%q#D is private within this context", diag_decl
);
6514 inform (DECL_SOURCE_LOCATION (diag_decl
),
6515 "declared private here");
6517 afi
->record_access_failure (basetype_path
, diag_decl
);
6519 else if (TREE_PROTECTED (decl
))
6521 error ("%q#D is protected within this context", diag_decl
);
6522 inform (DECL_SOURCE_LOCATION (diag_decl
),
6523 "declared protected here");
6525 afi
->record_access_failure (basetype_path
, diag_decl
);
6529 error ("%q#D is inaccessible within this context", diag_decl
);
6530 inform (DECL_SOURCE_LOCATION (diag_decl
), "declared here");
6532 afi
->record_access_failure (basetype_path
, diag_decl
);
6541 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6542 bitwise or of LOOKUP_* values. If any errors are warnings are
6543 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6544 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6548 build_temp (tree expr
, tree type
, int flags
,
6549 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
6552 vec
<tree
, va_gc
> *args
;
6554 *diagnostic_kind
= DK_UNSPECIFIED
;
6556 /* If the source is a packed field, calling the copy constructor will require
6557 binding the field to the reference parameter to the copy constructor, and
6558 we'll end up with an infinite loop. If we can use a bitwise copy, then
6560 if ((lvalue_kind (expr
) & clk_packed
)
6561 && CLASS_TYPE_P (TREE_TYPE (expr
))
6562 && !type_has_nontrivial_copy_init (TREE_TYPE (expr
)))
6563 return get_target_expr_sfinae (expr
, complain
);
6565 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
6566 args
= make_tree_vector_single (expr
);
6567 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6568 &args
, type
, flags
, complain
);
6569 release_tree_vector (args
);
6570 if (warningcount
+ werrorcount
> savew
)
6571 *diagnostic_kind
= DK_WARNING
;
6572 else if (errorcount
> savee
)
6573 *diagnostic_kind
= DK_ERROR
;
6577 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6578 Also handle a subset of zero as null warnings.
6579 EXPR is implicitly converted to type TOTYPE.
6580 FN and ARGNUM are used for diagnostics. */
6583 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
6585 /* Issue warnings about peculiar, but valid, uses of NULL. */
6586 if (null_node_p (expr
) && TREE_CODE (totype
) != BOOLEAN_TYPE
6587 && ARITHMETIC_TYPE_P (totype
))
6589 source_location loc
=
6590 expansion_point_location_if_in_system_header (input_location
);
6593 warning_at (loc
, OPT_Wconversion_null
,
6594 "passing NULL to non-pointer argument %P of %qD",
6597 warning_at (loc
, OPT_Wconversion_null
,
6598 "converting to non-pointer type %qT from NULL", totype
);
6601 /* Issue warnings if "false" is converted to a NULL pointer */
6602 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
6603 && TYPE_PTR_P (totype
))
6606 warning_at (input_location
, OPT_Wconversion_null
,
6607 "converting %<false%> to pointer type for argument %P "
6608 "of %qD", argnum
, fn
);
6610 warning_at (input_location
, OPT_Wconversion_null
,
6611 "converting %<false%> to pointer type %qT", totype
);
6613 /* Handle zero as null pointer warnings for cases other
6614 than EQ_EXPR and NE_EXPR */
6615 else if (null_ptr_cst_p (expr
) &&
6616 (TYPE_PTR_OR_PTRMEM_P (totype
) || NULLPTR_TYPE_P (totype
)))
6618 source_location loc
=
6619 expansion_point_location_if_in_system_header (input_location
);
6620 maybe_warn_zero_as_null_pointer_constant (expr
, loc
);
6624 /* We gave a diagnostic during a conversion. If this was in the second
6625 standard conversion sequence of a user-defined conversion sequence, say
6626 which user-defined conversion. */
6629 maybe_print_user_conv_context (conversion
*convs
)
6631 if (convs
->user_conv_p
)
6632 for (conversion
*t
= convs
; t
; t
= next_conversion (t
))
6633 if (t
->kind
== ck_user
)
6635 print_z_candidate (0, " after user-defined conversion:",
6641 /* Locate the parameter with the given index within FNDECL.
6642 ARGNUM is zero based, -1 indicates the `this' argument of a method.
6643 Return the location of the FNDECL itself if there are problems. */
6646 get_fndecl_argument_location (tree fndecl
, int argnum
)
6651 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6652 for (i
= 0, param
= FUNCTION_FIRST_USER_PARM (fndecl
);
6653 i
< argnum
&& param
;
6654 i
++, param
= TREE_CHAIN (param
))
6657 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6658 return the location of FNDECL. */
6660 return DECL_SOURCE_LOCATION (fndecl
);
6662 return DECL_SOURCE_LOCATION (param
);
6665 /* Perform the conversions in CONVS on the expression EXPR. FN and
6666 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6667 indicates the `this' argument of a method. INNER is nonzero when
6668 being called to continue a conversion chain. It is negative when a
6669 reference binding will be applied, positive otherwise. If
6670 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6671 conversions will be emitted if appropriate. If C_CAST_P is true,
6672 this conversion is coming from a C-style cast; in that case,
6673 conversions to inaccessible bases are permitted. */
6676 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
6677 bool issue_conversion_warnings
,
6678 bool c_cast_p
, tsubst_flags_t complain
)
6680 tree totype
= convs
->type
;
6681 diagnostic_t diag_kind
;
6683 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
6685 if (convs
->bad_p
&& !(complain
& tf_error
))
6686 return error_mark_node
;
6689 && convs
->kind
!= ck_user
6690 && convs
->kind
!= ck_list
6691 && convs
->kind
!= ck_ambig
6692 && (convs
->kind
!= ck_ref_bind
6693 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
6694 && (convs
->kind
!= ck_rvalue
6695 || SCALAR_TYPE_P (totype
))
6696 && convs
->kind
!= ck_base
)
6698 bool complained
= false;
6699 conversion
*t
= convs
;
6701 /* Give a helpful error if this is bad because of excess braces. */
6702 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6703 && SCALAR_TYPE_P (totype
)
6704 && CONSTRUCTOR_NELTS (expr
) > 0
6705 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
6707 complained
= permerror (loc
, "too many braces around initializer "
6709 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6710 && CONSTRUCTOR_NELTS (expr
) == 1)
6711 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6714 /* Give a helpful error if this is bad because a conversion to bool
6715 from std::nullptr_t requires direct-initialization. */
6716 if (NULLPTR_TYPE_P (TREE_TYPE (expr
))
6717 && TREE_CODE (totype
) == BOOLEAN_TYPE
)
6718 complained
= permerror (loc
, "converting to %qH from %qI requires "
6719 "direct-initialization",
6720 totype
, TREE_TYPE (expr
));
6722 for (; t
; t
= next_conversion (t
))
6724 if (t
->kind
== ck_user
&& t
->cand
->reason
)
6726 auto_diagnostic_group d
;
6727 complained
= permerror (loc
, "invalid user-defined conversion "
6728 "from %qH to %qI", TREE_TYPE (expr
),
6731 print_z_candidate (loc
, "candidate is:", t
->cand
);
6732 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6733 /*issue_conversion_warnings=*/false,
6736 if (convs
->kind
== ck_ref_bind
)
6737 expr
= convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
6738 LOOKUP_NORMAL
, NULL_TREE
,
6741 expr
= cp_convert (totype
, expr
, complain
);
6742 if (complained
&& fn
)
6743 inform (DECL_SOURCE_LOCATION (fn
),
6744 " initializing argument %P of %qD", argnum
, fn
);
6747 else if (t
->kind
== ck_user
|| !t
->bad_p
)
6749 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6750 /*issue_conversion_warnings=*/false,
6755 else if (t
->kind
== ck_ambig
)
6756 return convert_like_real (t
, expr
, fn
, argnum
,
6757 /*issue_conversion_warnings=*/false,
6760 else if (t
->kind
== ck_identity
)
6765 range_label_for_type_mismatch
label (TREE_TYPE (expr
), totype
);
6766 gcc_rich_location
richloc (loc
, &label
);
6767 complained
= permerror (&richloc
,
6768 "invalid conversion from %qH to %qI",
6769 TREE_TYPE (expr
), totype
);
6771 if (complained
&& fn
)
6772 inform (get_fndecl_argument_location (fn
, argnum
),
6773 " initializing argument %P of %qD", argnum
, fn
);
6775 return cp_convert (totype
, expr
, complain
);
6778 if (issue_conversion_warnings
&& (complain
& tf_warning
))
6779 conversion_null_warnings (totype
, expr
, fn
, argnum
);
6781 switch (convs
->kind
)
6785 struct z_candidate
*cand
= convs
->cand
;
6788 /* We chose the surrogate function from add_conv_candidate, now we
6789 actually need to build the conversion. */
6790 cand
= build_user_type_conversion_1 (totype
, expr
,
6791 LOOKUP_NO_CONVERSION
, complain
);
6793 tree convfn
= cand
->fn
;
6795 /* When converting from an init list we consider explicit
6796 constructors, but actually trying to call one is an error. */
6797 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
6798 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
6799 /* Unless this is for direct-list-initialization. */
6800 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
)
6801 /* And in C++98 a default constructor can't be explicit. */
6802 && cxx_dialect
>= cxx11
)
6804 if (!(complain
& tf_error
))
6805 return error_mark_node
;
6806 location_t loc
= location_of (expr
);
6807 if (CONSTRUCTOR_NELTS (expr
) == 0
6808 && FUNCTION_FIRST_USER_PARMTYPE (convfn
) != void_list_node
)
6810 auto_diagnostic_group d
;
6811 if (pedwarn (loc
, 0, "converting to %qT from initializer list "
6812 "would use explicit constructor %qD",
6814 inform (loc
, "in C++11 and above a default constructor "
6818 error ("converting to %qT from initializer list would use "
6819 "explicit constructor %qD", totype
, convfn
);
6822 /* If we're initializing from {}, it's value-initialization. */
6823 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6824 && CONSTRUCTOR_NELTS (expr
) == 0
6825 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
6827 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
6828 if (abstract_virtuals_error_sfinae (NULL_TREE
, totype
, complain
))
6829 return error_mark_node
;
6830 expr
= build_value_init (totype
, complain
);
6831 expr
= get_target_expr_sfinae (expr
, complain
);
6832 if (expr
!= error_mark_node
)
6834 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6835 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
6840 expr
= mark_rvalue_use (expr
);
6842 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
6844 expr
= build_over_call (cand
, LOOKUP_NORMAL
|LOOKUP_NO_CONVERSION
,
6847 /* If this is a constructor or a function returning an aggr type,
6848 we need to build up a TARGET_EXPR. */
6849 if (DECL_CONSTRUCTOR_P (convfn
))
6851 expr
= build_cplus_new (totype
, expr
, complain
);
6853 /* Remember that this was list-initialization. */
6854 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
6855 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6861 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
6863 int nelts
= CONSTRUCTOR_NELTS (expr
);
6865 expr
= build_value_init (totype
, complain
);
6866 else if (nelts
== 1)
6867 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6871 expr
= mark_use (expr
, /*rvalue_p=*/!convs
->rvaluedness_matches_p
,
6872 /*read_p=*/true, UNKNOWN_LOCATION
,
6873 /*reject_builtin=*/true);
6875 if (type_unknown_p (expr
))
6876 expr
= instantiate_type (totype
, expr
, complain
);
6877 if (expr
== null_node
6878 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
6879 /* If __null has been converted to an integer type, we do not want to
6880 continue to warn about uses of EXPR as an integer, rather than as a
6882 expr
= build_int_cst (totype
, 0);
6885 /* We leave bad_p off ck_ambig because overload resolution considers
6886 it valid, it just fails when we try to perform it. So we need to
6887 check complain here, too. */
6888 if (complain
& tf_error
)
6890 /* Call build_user_type_conversion again for the error. */
6891 int flags
= (convs
->need_temporary_p
6892 ? LOOKUP_IMPLICIT
: LOOKUP_NORMAL
);
6893 build_user_type_conversion (totype
, convs
->u
.expr
, flags
, complain
);
6894 gcc_assert (seen_error ());
6896 inform (DECL_SOURCE_LOCATION (fn
),
6897 " initializing argument %P of %qD", argnum
, fn
);
6899 return error_mark_node
;
6903 /* Conversion to std::initializer_list<T>. */
6904 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
6905 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
6906 unsigned len
= CONSTRUCTOR_NELTS (expr
);
6907 tree array
, val
, field
;
6908 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
6911 /* Convert all the elements. */
6912 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
6914 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
6915 false, false, complain
);
6916 if (sub
== error_mark_node
)
6918 if (!BRACE_ENCLOSED_INITIALIZER_P (val
)
6919 && !check_narrowing (TREE_TYPE (sub
), val
, complain
))
6920 return error_mark_node
;
6921 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
6922 if (!TREE_CONSTANT (sub
))
6923 TREE_CONSTANT (new_ctor
) = false;
6925 /* Build up the array. */
6926 elttype
= cp_build_qualified_type
6927 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
6928 array
= build_array_of_n_type (elttype
, len
);
6929 array
= finish_compound_literal (array
, new_ctor
, complain
);
6930 /* Take the address explicitly rather than via decay_conversion
6931 to avoid the error about taking the address of a temporary. */
6932 array
= cp_build_addr_expr (array
, complain
);
6933 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
6934 if (array
== error_mark_node
)
6935 return error_mark_node
;
6937 /* Build up the initializer_list object. Note: fail gracefully
6938 if the object cannot be completed because, for example, no
6939 definition is provided (c++/80956). */
6940 totype
= complete_type_or_maybe_complain (totype
, NULL_TREE
, complain
);
6942 return error_mark_node
;
6943 field
= next_initializable_field (TYPE_FIELDS (totype
));
6944 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
6945 field
= next_initializable_field (DECL_CHAIN (field
));
6946 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
6947 new_ctor
= build_constructor (totype
, vec
);
6948 return get_target_expr_sfinae (new_ctor
, complain
);
6952 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
6954 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6955 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
6956 real
= perform_implicit_conversion (TREE_TYPE (totype
),
6958 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
6960 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
6963 expr
= reshape_init (totype
, expr
, complain
);
6964 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
6966 if (expr
!= error_mark_node
)
6967 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6974 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
6975 convs
->kind
== ck_ref_bind
6976 ? issue_conversion_warnings
: false,
6977 c_cast_p
, complain
);
6978 if (expr
== error_mark_node
)
6979 return error_mark_node
;
6981 switch (convs
->kind
)
6984 expr
= decay_conversion (expr
, complain
);
6985 if (expr
== error_mark_node
)
6987 if (complain
& tf_error
)
6989 auto_diagnostic_group d
;
6990 maybe_print_user_conv_context (convs
);
6992 inform (DECL_SOURCE_LOCATION (fn
),
6993 " initializing argument %P of %qD", argnum
, fn
);
6995 return error_mark_node
;
6998 if (! MAYBE_CLASS_TYPE_P (totype
))
7001 /* Don't introduce copies when passing arguments along to the inherited
7003 if (current_function_decl
7004 && flag_new_inheriting_ctors
7005 && DECL_INHERITED_CTOR (current_function_decl
))
7008 if (TREE_CODE (expr
) == TARGET_EXPR
7009 && TARGET_EXPR_LIST_INIT_P (expr
))
7010 /* Copy-list-initialization doesn't actually involve a copy. */
7015 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
7017 /* We are going to bind a reference directly to a base-class
7018 subobject of EXPR. */
7019 /* Build an expression for `*((base*) &expr)'. */
7020 expr
= convert_to_base (expr
, totype
,
7021 !c_cast_p
, /*nonnull=*/true, complain
);
7025 /* Copy-initialization where the cv-unqualified version of the source
7026 type is the same class as, or a derived class of, the class of the
7027 destination [is treated as direct-initialization]. [dcl.init] */
7028 flags
= LOOKUP_NORMAL
;
7029 if (convs
->user_conv_p
)
7030 /* This conversion is being done in the context of a user-defined
7031 conversion (i.e. the second step of copy-initialization), so
7032 don't allow any more. */
7033 flags
|= LOOKUP_NO_CONVERSION
;
7035 flags
|= LOOKUP_ONLYCONVERTING
;
7036 if (convs
->rvaluedness_matches_p
)
7037 /* standard_conversion got LOOKUP_PREFER_RVALUE. */
7038 flags
|= LOOKUP_PREFER_RVALUE
;
7039 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
7040 if (diag_kind
&& complain
)
7042 auto_diagnostic_group d
;
7043 maybe_print_user_conv_context (convs
);
7045 inform (DECL_SOURCE_LOCATION (fn
),
7046 " initializing argument %P of %qD", argnum
, fn
);
7049 return build_cplus_new (totype
, expr
, complain
);
7053 tree ref_type
= totype
;
7055 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
7057 tree extype
= TREE_TYPE (expr
);
7058 auto_diagnostic_group d
;
7059 if (TYPE_REF_IS_RVALUE (ref_type
)
7061 error_at (loc
, "cannot bind rvalue reference of type %qH to "
7062 "lvalue of type %qI", totype
, extype
);
7063 else if (!TYPE_REF_IS_RVALUE (ref_type
) && !lvalue_p (expr
)
7064 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
7065 error_at (loc
, "cannot bind non-const lvalue reference of "
7066 "type %qH to an rvalue of type %qI", totype
, extype
);
7067 else if (!reference_compatible_p (TREE_TYPE (totype
), extype
))
7068 error_at (loc
, "binding reference of type %qH to %qI "
7069 "discards qualifiers", totype
, extype
);
7072 maybe_print_user_conv_context (convs
);
7074 inform (DECL_SOURCE_LOCATION (fn
),
7075 " initializing argument %P of %qD", argnum
, fn
);
7076 return error_mark_node
;
7079 /* If necessary, create a temporary.
7081 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
7082 that need temporaries, even when their types are reference
7083 compatible with the type of reference being bound, so the
7084 upcoming call to cp_build_addr_expr doesn't fail. */
7085 if (convs
->need_temporary_p
7086 || TREE_CODE (expr
) == CONSTRUCTOR
7087 || TREE_CODE (expr
) == VA_ARG_EXPR
)
7089 /* Otherwise, a temporary of type "cv1 T1" is created and
7090 initialized from the initializer expression using the rules
7091 for a non-reference copy-initialization (8.5). */
7093 tree type
= TREE_TYPE (ref_type
);
7094 cp_lvalue_kind lvalue
= lvalue_kind (expr
);
7096 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7097 (type
, next_conversion (convs
)->type
));
7098 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
7099 && !TYPE_REF_IS_RVALUE (ref_type
))
7101 /* If the reference is volatile or non-const, we
7102 cannot create a temporary. */
7103 if (lvalue
& clk_bitfield
)
7104 error_at (loc
, "cannot bind bitfield %qE to %qT",
7106 else if (lvalue
& clk_packed
)
7107 error_at (loc
, "cannot bind packed field %qE to %qT",
7110 error_at (loc
, "cannot bind rvalue %qE to %qT",
7112 return error_mark_node
;
7114 /* If the source is a packed field, and we must use a copy
7115 constructor, then building the target expr will require
7116 binding the field to the reference parameter to the
7117 copy constructor, and we'll end up with an infinite
7118 loop. If we can use a bitwise copy, then we'll be
7120 if ((lvalue
& clk_packed
)
7121 && CLASS_TYPE_P (type
)
7122 && type_has_nontrivial_copy_init (type
))
7124 error_at (loc
, "cannot bind packed field %qE to %qT",
7126 return error_mark_node
;
7128 if (lvalue
& clk_bitfield
)
7130 expr
= convert_bitfield_to_declared_type (expr
);
7131 expr
= fold_convert (type
, expr
);
7133 expr
= build_target_expr_with_type (expr
, type
, complain
);
7136 /* Take the address of the thing to which we will bind the
7138 expr
= cp_build_addr_expr (expr
, complain
);
7139 if (expr
== error_mark_node
)
7140 return error_mark_node
;
7142 /* Convert it to a pointer to the type referred to by the
7143 reference. This will adjust the pointer if a derived to
7144 base conversion is being performed. */
7145 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
7147 /* Convert the pointer to the desired reference type. */
7148 return build_nop (ref_type
, expr
);
7152 return decay_conversion (expr
, complain
);
7155 /* ??? Should the address of a transaction-safe pointer point to the TM
7156 clone, and this conversion look up the primary function? */
7157 return build_nop (totype
, expr
);
7160 /* Warn about deprecated conversion if appropriate. */
7161 string_conv_p (totype
, expr
, 1);
7166 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
7167 /*nonnull=*/false, complain
);
7168 return build_nop (totype
, expr
);
7171 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
7172 c_cast_p
, complain
);
7178 if (convs
->check_narrowing
7179 && !check_narrowing (totype
, expr
, complain
,
7180 convs
->check_narrowing_const_only
))
7181 return error_mark_node
;
7183 warning_sentinel
w (warn_zero_as_null_pointer_constant
);
7184 if (issue_conversion_warnings
)
7185 expr
= cp_convert_and_check (totype
, expr
, complain
);
7187 expr
= cp_convert (totype
, expr
, complain
);
7192 /* ARG is being passed to a varargs function. Perform any conversions
7193 required. Return the converted value. */
7196 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
7199 location_t loc
= cp_expr_loc_or_loc (arg
, input_location
);
7203 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7204 standard conversions are performed. */
7205 arg
= decay_conversion (arg
, complain
);
7206 arg_type
= TREE_TYPE (arg
);
7209 If the argument has integral or enumeration type that is subject
7210 to the integral promotions (_conv.prom_), or a floating point
7211 type that is subject to the floating point promotion
7212 (_conv.fpprom_), the value of the argument is converted to the
7213 promoted type before the call. */
7214 if (TREE_CODE (arg_type
) == REAL_TYPE
7215 && (TYPE_PRECISION (arg_type
)
7216 < TYPE_PRECISION (double_type_node
))
7217 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
7219 if ((complain
& tf_warning
)
7220 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
7221 warning_at (loc
, OPT_Wdouble_promotion
,
7222 "implicit conversion from %qH to %qI when passing "
7223 "argument to function",
7224 arg_type
, double_type_node
);
7225 arg
= convert_to_real_nofold (double_type_node
, arg
);
7227 else if (NULLPTR_TYPE_P (arg_type
))
7228 arg
= null_pointer_node
;
7229 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
7231 if (SCOPED_ENUM_P (arg_type
))
7233 tree prom
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
,
7235 prom
= cp_perform_integral_promotions (prom
, complain
);
7236 if (abi_version_crosses (6)
7237 && TYPE_MODE (TREE_TYPE (prom
)) != TYPE_MODE (arg_type
)
7238 && (complain
& tf_warning
))
7239 warning_at (loc
, OPT_Wabi
, "scoped enum %qT passed through ... as "
7240 "%qT before -fabi-version=6, %qT after", arg_type
,
7241 TREE_TYPE (prom
), ENUM_UNDERLYING_TYPE (arg_type
));
7242 if (!abi_version_at_least (6))
7246 arg
= cp_perform_integral_promotions (arg
, complain
);
7249 arg
= require_complete_type_sfinae (arg
, complain
);
7250 arg_type
= TREE_TYPE (arg
);
7252 if (arg
!= error_mark_node
7253 /* In a template (or ill-formed code), we can have an incomplete type
7254 even after require_complete_type_sfinae, in which case we don't know
7255 whether it has trivial copy or not. */
7256 && COMPLETE_TYPE_P (arg_type
)
7257 && !cp_unevaluated_operand
)
7259 /* [expr.call] 5.2.2/7:
7260 Passing a potentially-evaluated argument of class type (Clause 9)
7261 with a non-trivial copy constructor or a non-trivial destructor
7262 with no corresponding parameter is conditionally-supported, with
7263 implementation-defined semantics.
7265 We support it as pass-by-invisible-reference, just like a normal
7268 If the call appears in the context of a sizeof expression,
7269 it is not potentially-evaluated. */
7270 if (type_has_nontrivial_copy_init (arg_type
)
7271 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
))
7273 arg
= force_rvalue (arg
, complain
);
7274 if (complain
& tf_warning
)
7275 warning (OPT_Wconditionally_supported
,
7276 "passing objects of non-trivially-copyable "
7277 "type %q#T through %<...%> is conditionally supported",
7279 return build1 (ADDR_EXPR
, build_reference_type (arg_type
), arg
);
7281 /* Build up a real lvalue-to-rvalue conversion in case the
7282 copy constructor is trivial but not callable. */
7283 else if (CLASS_TYPE_P (arg_type
))
7284 force_rvalue (arg
, complain
);
7291 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7294 build_x_va_arg (source_location loc
, tree expr
, tree type
)
7296 if (processing_template_decl
)
7298 tree r
= build_min (VA_ARG_EXPR
, type
, expr
);
7299 SET_EXPR_LOCATION (r
, loc
);
7303 type
= complete_type_or_else (type
, NULL_TREE
);
7305 if (expr
== error_mark_node
|| !type
)
7306 return error_mark_node
;
7308 expr
= mark_lvalue_use (expr
);
7310 if (TYPE_REF_P (type
))
7312 error ("cannot receive reference type %qT through %<...%>", type
);
7313 return error_mark_node
;
7316 if (type_has_nontrivial_copy_init (type
)
7317 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7319 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7320 it as pass by invisible reference. */
7321 warning_at (loc
, OPT_Wconditionally_supported
,
7322 "receiving objects of non-trivially-copyable type %q#T "
7323 "through %<...%> is conditionally-supported", type
);
7325 tree ref
= cp_build_reference_type (type
, false);
7326 expr
= build_va_arg (loc
, expr
, ref
);
7327 return convert_from_reference (expr
);
7330 tree ret
= build_va_arg (loc
, expr
, type
);
7331 if (CLASS_TYPE_P (type
))
7332 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7333 know how to handle it. */
7334 ret
= get_target_expr (ret
);
7338 /* TYPE has been given to va_arg. Apply the default conversions which
7339 would have happened when passed via ellipsis. Return the promoted
7340 type, or the passed type if there is no change. */
7343 cxx_type_promotes_to (tree type
)
7347 /* Perform the array-to-pointer and function-to-pointer
7349 type
= type_decays_to (type
);
7351 promote
= type_promotes_to (type
);
7352 if (same_type_p (type
, promote
))
7358 /* ARG is a default argument expression being passed to a parameter of
7359 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7360 zero-based argument number. Do any required conversions. Return
7361 the converted value. */
7363 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
7365 push_defarg_context (tree fn
)
7366 { vec_safe_push (default_arg_context
, fn
); }
7369 pop_defarg_context (void)
7370 { default_arg_context
->pop (); }
7373 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
7374 tsubst_flags_t complain
)
7379 /* See through clones. */
7380 fn
= DECL_ORIGIN (fn
);
7381 /* And inheriting ctors. */
7382 if (flag_new_inheriting_ctors
)
7383 fn
= strip_inheriting_ctors (fn
);
7385 /* Detect recursion. */
7386 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
7389 if (complain
& tf_error
)
7390 error ("recursive evaluation of default argument for %q#D", fn
);
7391 return error_mark_node
;
7394 /* If the ARG is an unparsed default argument expression, the
7395 conversion cannot be performed. */
7396 if (TREE_CODE (arg
) == DEFAULT_ARG
)
7398 if (complain
& tf_error
)
7399 error ("call to %qD uses the default argument for parameter %P, which "
7400 "is not yet defined", fn
, parmnum
);
7401 return error_mark_node
;
7404 push_defarg_context (fn
);
7406 if (fn
&& DECL_TEMPLATE_INFO (fn
))
7407 arg
= tsubst_default_argument (fn
, parmnum
, type
, arg
, complain
);
7413 The names in the expression are bound, and the semantic
7414 constraints are checked, at the point where the default
7415 expressions appears.
7417 we must not perform access checks here. */
7418 push_deferring_access_checks (dk_no_check
);
7419 /* We must make a copy of ARG, in case subsequent processing
7420 alters any part of it. */
7421 arg
= break_out_target_exprs (arg
, /*clear location*/true);
7423 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
7424 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
7426 arg
= convert_for_arg_passing (type
, arg
, complain
);
7427 pop_deferring_access_checks();
7429 pop_defarg_context ();
7434 /* Returns the type which will really be used for passing an argument of
7438 type_passed_as (tree type
)
7440 /* Pass classes with copy ctors by invisible reference. */
7441 if (TREE_ADDRESSABLE (type
))
7443 type
= build_reference_type (type
);
7444 /* There are no other pointers to this temporary. */
7445 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
7447 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7448 && INTEGRAL_TYPE_P (type
)
7449 && COMPLETE_TYPE_P (type
)
7450 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7451 type
= integer_type_node
;
7456 /* Actually perform the appropriate conversion. */
7459 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
7463 /* If VAL is a bitfield, then -- since it has already been converted
7464 to TYPE -- it cannot have a precision greater than TYPE.
7466 If it has a smaller precision, we must widen it here. For
7467 example, passing "int f:3;" to a function expecting an "int" will
7468 not result in any conversion before this point.
7470 If the precision is the same we must not risk widening. For
7471 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7472 often have type "int", even though the C++ type for the field is
7473 "long long". If the value is being passed to a function
7474 expecting an "int", then no conversions will be required. But,
7475 if we call convert_bitfield_to_declared_type, the bitfield will
7476 be converted to "long long". */
7477 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
7479 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
7480 val
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
), val
);
7482 if (val
== error_mark_node
)
7484 /* Pass classes with copy ctors by invisible reference. */
7485 else if (TREE_ADDRESSABLE (type
))
7486 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
7487 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7488 && INTEGRAL_TYPE_P (type
)
7489 && COMPLETE_TYPE_P (type
)
7490 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7491 val
= cp_perform_integral_promotions (val
, complain
);
7492 if (complain
& tf_warning
)
7494 if (warn_suggest_attribute_format
)
7496 tree rhstype
= TREE_TYPE (val
);
7497 const enum tree_code coder
= TREE_CODE (rhstype
);
7498 const enum tree_code codel
= TREE_CODE (type
);
7499 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7501 && check_missing_format_attribute (type
, rhstype
))
7502 warning (OPT_Wsuggest_attribute_format
,
7503 "argument of function call might be a candidate "
7504 "for a format attribute");
7506 maybe_warn_parm_abi (type
, cp_expr_loc_or_loc (val
, input_location
));
7511 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7512 which just decay_conversion or no conversions at all should be done.
7513 This is true for some builtins which don't act like normal functions.
7514 Return 2 if no conversions at all should be done, 1 if just
7515 decay_conversion. Return 3 for special treatment of the 3rd argument
7516 for __builtin_*_overflow_p. */
7519 magic_varargs_p (tree fn
)
7521 if (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
7522 switch (DECL_FUNCTION_CODE (fn
))
7524 case BUILT_IN_CLASSIFY_TYPE
:
7525 case BUILT_IN_CONSTANT_P
:
7526 case BUILT_IN_NEXT_ARG
:
7527 case BUILT_IN_VA_START
:
7530 case BUILT_IN_ADD_OVERFLOW_P
:
7531 case BUILT_IN_SUB_OVERFLOW_P
:
7532 case BUILT_IN_MUL_OVERFLOW_P
:
7536 return lookup_attribute ("type generic",
7537 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
7543 /* Returns the decl of the dispatcher function if FN is a function version. */
7546 get_function_version_dispatcher (tree fn
)
7548 tree dispatcher_decl
= NULL
;
7550 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7551 && DECL_FUNCTION_VERSIONED (fn
));
7553 gcc_assert (targetm
.get_function_versions_dispatcher
);
7554 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
7556 if (dispatcher_decl
== NULL
)
7558 error_at (input_location
, "use of multiversioned function "
7559 "without a default");
7563 retrofit_lang_decl (dispatcher_decl
);
7564 gcc_assert (dispatcher_decl
!= NULL
);
7565 return dispatcher_decl
;
7568 /* fn is a function version dispatcher that is marked used. Mark all the
7569 semantically identical function versions it will dispatch as used. */
7572 mark_versions_used (tree fn
)
7574 struct cgraph_node
*node
;
7575 struct cgraph_function_version_info
*node_v
;
7576 struct cgraph_function_version_info
*it_v
;
7578 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7580 node
= cgraph_node::get (fn
);
7584 gcc_assert (node
->dispatcher_function
);
7586 node_v
= node
->function_version ();
7590 /* All semantically identical versions are chained. Traverse and mark each
7591 one of them as used. */
7592 it_v
= node_v
->next
;
7593 while (it_v
!= NULL
)
7595 mark_used (it_v
->this_node
->decl
);
7600 /* Build a call to "the copy constructor" for the type of A, even if it
7601 wouldn't be selected by normal overload resolution. Used for
7605 call_copy_ctor (tree a
, tsubst_flags_t complain
)
7607 tree ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (a
));
7608 tree binfo
= TYPE_BINFO (ctype
);
7609 tree copy
= get_copy_ctor (ctype
, complain
);
7610 copy
= build_baselink (binfo
, binfo
, copy
, NULL_TREE
);
7611 tree ob
= build_dummy_object (ctype
);
7612 vec
<tree
, va_gc
>* args
= make_tree_vector_single (a
);
7613 tree r
= build_new_method_call (ob
, copy
, &args
, NULL_TREE
,
7614 LOOKUP_NORMAL
, NULL
, complain
);
7615 release_tree_vector (args
);
7619 /* Return true iff T refers to a base field. */
7622 is_base_field_ref (tree t
)
7625 if (TREE_CODE (t
) == ADDR_EXPR
)
7626 t
= TREE_OPERAND (t
, 0);
7627 if (TREE_CODE (t
) == COMPONENT_REF
)
7628 t
= TREE_OPERAND (t
, 1);
7629 if (TREE_CODE (t
) == FIELD_DECL
)
7630 return DECL_FIELD_IS_BASE (t
);
7634 /* We can't elide a copy from a function returning by value to a base
7635 subobject, as the callee might clobber tail padding. Return true iff this
7636 could be that case. */
7639 unsafe_copy_elision_p (tree target
, tree exp
)
7641 /* Copy elision only happens with a TARGET_EXPR. */
7642 if (TREE_CODE (exp
) != TARGET_EXPR
)
7644 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
7645 /* It's safe to elide the copy for a class with no tail padding. */
7646 if (tree_int_cst_equal (TYPE_SIZE (type
), CLASSTYPE_SIZE (type
)))
7648 /* It's safe to elide the copy if we aren't initializing a base object. */
7649 if (!is_base_field_ref (target
))
7651 tree init
= TARGET_EXPR_INITIAL (exp
);
7652 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7653 while (TREE_CODE (init
) == COMPOUND_EXPR
)
7654 init
= TREE_OPERAND (init
, 1);
7655 if (TREE_CODE (init
) == COND_EXPR
)
7657 /* We'll end up copying from each of the arms of the COND_EXPR directly
7658 into the target, so look at them. */
7659 if (tree op
= TREE_OPERAND (init
, 1))
7660 if (unsafe_copy_elision_p (target
, op
))
7662 return unsafe_copy_elision_p (target
, TREE_OPERAND (init
, 2));
7664 return (TREE_CODE (init
) == AGGR_INIT_EXPR
7665 && !AGGR_INIT_VIA_CTOR_P (init
));
7668 /* True iff C is a conversion that binds a reference to a prvalue. */
7671 conv_binds_ref_to_prvalue (conversion
*c
)
7673 if (c
->kind
!= ck_ref_bind
)
7675 if (c
->need_temporary_p
)
7678 c
= next_conversion (c
);
7680 if (c
->kind
== ck_rvalue
)
7682 if (c
->kind
== ck_user
&& !TYPE_REF_P (c
->type
))
7684 if (c
->kind
== ck_identity
&& c
->u
.expr
7685 && TREE_CODE (c
->u
.expr
) == TARGET_EXPR
)
7691 /* Call the trivial destructor for INSTANCE, which can be either an lvalue of
7692 class type or a pointer to class type. */
7695 build_trivial_dtor_call (tree instance
)
7697 gcc_assert (!is_dummy_object (instance
));
7699 if (!flag_lifetime_dse
)
7702 return fold_convert (void_type_node
, instance
);
7705 if (INDIRECT_TYPE_P (TREE_TYPE (instance
)))
7707 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
7709 instance
= cp_build_fold_indirect_ref (instance
);
7712 /* A trivial destructor should still clobber the object. */
7713 tree clobber
= build_clobber (TREE_TYPE (instance
));
7714 return build2 (MODIFY_EXPR
, void_type_node
,
7718 /* Subroutine of the various build_*_call functions. Overload resolution
7719 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7720 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7721 bitmask of various LOOKUP_* flags which apply to the call itself. */
7724 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
7727 const vec
<tree
, va_gc
> *args
= cand
->args
;
7728 tree first_arg
= cand
->first_arg
;
7729 conversion
**convs
= cand
->convs
;
7731 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
7736 unsigned int arg_index
= 0;
7740 bool already_used
= false;
7742 /* In a template, there is no need to perform all of the work that
7743 is normally done. We are only interested in the type of the call
7744 expression, i.e., the return type of the function. Any semantic
7745 errors will be deferred until the template is instantiated. */
7746 if (processing_template_decl
)
7750 const tree
*argarray
;
7753 if (undeduced_auto_decl (fn
))
7754 mark_used (fn
, complain
);
7756 /* Otherwise set TREE_USED for the benefit of -Wunused-function.
7760 return_type
= TREE_TYPE (TREE_TYPE (fn
));
7761 nargs
= vec_safe_length (args
);
7762 if (first_arg
== NULL_TREE
)
7763 argarray
= args
->address ();
7771 alcarray
= XALLOCAVEC (tree
, nargs
);
7772 alcarray
[0] = build_this (first_arg
);
7773 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
7774 alcarray
[ix
+ 1] = arg
;
7775 argarray
= alcarray
;
7778 addr
= build_addr_func (fn
, complain
);
7779 if (addr
== error_mark_node
)
7780 return error_mark_node
;
7781 expr
= build_call_array_loc (input_location
, return_type
,
7782 addr
, nargs
, argarray
);
7783 if (TREE_THIS_VOLATILE (fn
) && cfun
)
7784 current_function_returns_abnormally
= 1;
7785 return convert_from_reference (expr
);
7788 /* Give any warnings we noticed during overload resolution. */
7789 if (cand
->warnings
&& (complain
& tf_warning
))
7791 struct candidate_warning
*w
;
7792 for (w
= cand
->warnings
; w
; w
= w
->next
)
7793 joust (cand
, w
->loser
, 1, complain
);
7796 /* Core issue 2327: P0135 doesn't say how to handle the case where the
7797 argument to the copy constructor ends up being a prvalue after
7798 conversion. Let's do the normal processing, but pretend we aren't
7799 actually using the copy constructor. */
7800 bool force_elide
= false;
7801 if (cxx_dialect
>= cxx17
7802 && cand
->num_convs
== 1
7803 && DECL_COMPLETE_CONSTRUCTOR_P (fn
)
7804 && (DECL_COPY_CONSTRUCTOR_P (fn
)
7805 || DECL_MOVE_CONSTRUCTOR_P (fn
))
7806 && conv_binds_ref_to_prvalue (convs
[0]))
7809 goto not_really_used
;
7812 /* OK, we're actually calling this inherited constructor; set its deletedness
7813 appropriately. We can get away with doing this here because calling is
7814 the only way to refer to a constructor. */
7815 if (DECL_INHERITED_CTOR (fn
))
7816 deduce_inheriting_ctor (fn
);
7818 /* Make =delete work with SFINAE. */
7819 if (DECL_DELETED_FN (fn
))
7821 if (complain
& tf_error
)
7823 return error_mark_node
;
7826 if (DECL_FUNCTION_MEMBER_P (fn
))
7829 /* If FN is a template function, two cases must be considered.
7834 template <class T> void f();
7836 template <class T> struct B {
7840 struct C : A, B<int> {
7842 using B<int>::g; // #2
7845 In case #1 where `A::f' is a member template, DECL_ACCESS is
7846 recorded in the primary template but not in its specialization.
7847 We check access of FN using its primary template.
7849 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7850 because it is a member of class template B, DECL_ACCESS is
7851 recorded in the specialization `B<int>::g'. We cannot use its
7852 primary template because `B<T>::g' and `B<int>::g' may have
7853 different access. */
7854 if (DECL_TEMPLATE_INFO (fn
)
7855 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
7856 access_fn
= DECL_TI_TEMPLATE (fn
);
7859 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
7861 return error_mark_node
;
7864 /* If we're checking for implicit delete, don't bother with argument
7866 if (flags
& LOOKUP_SPECULATIVE
)
7868 if (cand
->viable
== 1)
7870 else if (!(complain
& tf_error
))
7871 /* Reject bad conversions now. */
7872 return error_mark_node
;
7873 /* else continue to get conversion error. */
7878 /* N3276 magic doesn't apply to nested calls. */
7879 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
7880 complain
&= ~tf_decltype
;
7881 /* No-Cleanup doesn't apply to nested calls either. */
7882 tsubst_flags_t no_cleanup_complain
= complain
;
7883 complain
&= ~tf_no_cleanup
;
7885 /* Find maximum size of vector to hold converted arguments. */
7886 parmlen
= list_length (parm
);
7887 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
7888 if (parmlen
> nargs
)
7890 argarray
= XALLOCAVEC (tree
, nargs
);
7892 /* The implicit parameters to a constructor are not considered by overload
7893 resolution, and must be of the proper type. */
7894 if (DECL_CONSTRUCTOR_P (fn
))
7897 if (first_arg
!= NULL_TREE
)
7899 object_arg
= first_arg
;
7900 first_arg
= NULL_TREE
;
7904 object_arg
= (*args
)[arg_index
];
7907 argarray
[j
++] = build_this (object_arg
);
7908 parm
= TREE_CHAIN (parm
);
7909 /* We should never try to call the abstract constructor. */
7910 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
7912 if (DECL_HAS_VTT_PARM_P (fn
))
7914 argarray
[j
++] = (*args
)[arg_index
];
7916 parm
= TREE_CHAIN (parm
);
7919 if (flags
& LOOKUP_PREFER_RVALUE
)
7921 /* The implicit move specified in 15.8.3/3 fails "...if the type of
7922 the first parameter of the selected constructor is not an rvalue
7923 reference to the object’s type (possibly cv-qualified)...." */
7924 gcc_assert (!(complain
& tf_error
));
7925 tree ptype
= convs
[0]->type
;
7926 if (!TYPE_REF_P (ptype
)
7927 || !TYPE_REF_IS_RVALUE (ptype
)
7928 || CONVERSION_RANK (convs
[0]) > cr_exact
)
7929 return error_mark_node
;
7932 /* Bypass access control for 'this' parameter. */
7933 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7935 tree parmtype
= TREE_VALUE (parm
);
7936 tree arg
= build_this (first_arg
!= NULL_TREE
7938 : (*args
)[arg_index
]);
7939 tree argtype
= TREE_TYPE (arg
);
7943 if (arg
== error_mark_node
)
7944 return error_mark_node
;
7946 if (convs
[i
]->bad_p
)
7948 if (complain
& tf_error
)
7950 auto_diagnostic_group d
;
7951 if (permerror (input_location
, "passing %qT as %<this%> "
7952 "argument discards qualifiers",
7953 TREE_TYPE (argtype
)))
7954 inform (DECL_SOURCE_LOCATION (fn
), " in call to %qD", fn
);
7957 return error_mark_node
;
7960 /* See if the function member or the whole class type is declared
7961 final and the call can be devirtualized. */
7962 if (DECL_FINAL_P (fn
)
7963 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
7964 flags
|= LOOKUP_NONVIRTUAL
;
7966 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
7967 X is called for an object that is not of type X, or of a type
7968 derived from X, the behavior is undefined.
7970 So we can assume that anything passed as 'this' is non-null, and
7971 optimize accordingly. */
7972 gcc_assert (TYPE_PTR_P (parmtype
));
7973 /* Convert to the base in which the function was declared. */
7974 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
7975 converted_arg
= build_base_path (PLUS_EXPR
,
7977 cand
->conversion_path
,
7979 /* Check that the base class is accessible. */
7980 if (!accessible_base_p (TREE_TYPE (argtype
),
7981 BINFO_TYPE (cand
->conversion_path
), true))
7983 if (complain
& tf_error
)
7984 error ("%qT is not an accessible base of %qT",
7985 BINFO_TYPE (cand
->conversion_path
),
7986 TREE_TYPE (argtype
));
7988 return error_mark_node
;
7990 /* If fn was found by a using declaration, the conversion path
7991 will be to the derived class, not the base declaring fn. We
7992 must convert from derived to base. */
7993 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
7994 TREE_TYPE (parmtype
), ba_unique
,
7996 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
7997 base_binfo
, 1, complain
);
7999 argarray
[j
++] = converted_arg
;
8000 parm
= TREE_CHAIN (parm
);
8001 if (first_arg
!= NULL_TREE
)
8002 first_arg
= NULL_TREE
;
8009 gcc_assert (first_arg
== NULL_TREE
);
8010 for (; arg_index
< vec_safe_length (args
) && parm
;
8011 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
8013 tree type
= TREE_VALUE (parm
);
8014 tree arg
= (*args
)[arg_index
];
8015 bool conversion_warning
= true;
8019 /* If the argument is NULL and used to (implicitly) instantiate a
8020 template function (and bind one of the template arguments to
8021 the type of 'long int'), we don't want to warn about passing NULL
8022 to non-pointer argument.
8023 For example, if we have this template function:
8025 template<typename T> void func(T x) {}
8027 we want to warn (when -Wconversion is enabled) in this case:
8033 but not in this case:
8039 if (null_node_p (arg
)
8040 && DECL_TEMPLATE_INFO (fn
)
8041 && cand
->template_decl
8042 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
8043 conversion_warning
= false;
8045 /* Warn about initializer_list deduction that isn't currently in the
8047 if (cxx_dialect
> cxx98
8048 && flag_deduce_init_list
8049 && cand
->template_decl
8050 && is_std_init_list (non_reference (type
))
8051 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
8053 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
8054 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
8055 tree patparm
= get_pattern_parm (realparm
, tmpl
);
8056 tree pattype
= TREE_TYPE (patparm
);
8057 if (PACK_EXPANSION_P (pattype
))
8058 pattype
= PACK_EXPANSION_PATTERN (pattype
);
8059 pattype
= non_reference (pattype
);
8061 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
8062 && (cand
->explicit_targs
== NULL_TREE
8063 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
8064 <= TEMPLATE_TYPE_IDX (pattype
))))
8066 pedwarn (input_location
, 0, "deducing %qT as %qT",
8067 non_reference (TREE_TYPE (patparm
)),
8068 non_reference (type
));
8069 pedwarn (DECL_SOURCE_LOCATION (cand
->fn
), 0,
8070 " in call to %qD", cand
->fn
);
8071 pedwarn (input_location
, 0,
8072 " (you can disable this with -fno-deduce-init-list)");
8076 /* Set user_conv_p on the argument conversions, so rvalue/base handling
8077 knows not to allow any more UDCs. This needs to happen after we
8078 process cand->warnings. */
8079 if (flags
& LOOKUP_NO_CONVERSION
)
8080 conv
->user_conv_p
= true;
8082 tsubst_flags_t arg_complain
= complain
;
8083 if (!conversion_warning
)
8084 arg_complain
&= ~tf_warning
;
8086 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
8088 val
= convert_for_arg_passing (type
, val
, arg_complain
);
8090 if (val
== error_mark_node
)
8091 return error_mark_node
;
8093 argarray
[j
++] = val
;
8096 /* Default arguments */
8097 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
8099 if (TREE_VALUE (parm
) == error_mark_node
)
8100 return error_mark_node
;
8101 val
= convert_default_arg (TREE_VALUE (parm
),
8102 TREE_PURPOSE (parm
),
8105 if (val
== error_mark_node
)
8106 return error_mark_node
;
8107 argarray
[j
++] = val
;
8111 int magic
= magic_varargs_p (fn
);
8112 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
8114 tree a
= (*args
)[arg_index
];
8115 if ((magic
== 3 && arg_index
== 2) || magic
== 2)
8117 /* Do no conversions for certain magic varargs. */
8118 a
= mark_type_use (a
);
8119 if (TREE_CODE (a
) == FUNCTION_DECL
&& reject_gcc_builtin (a
))
8120 return error_mark_node
;
8122 else if (magic
!= 0)
8123 /* For other magic varargs only do decay_conversion. */
8124 a
= decay_conversion (a
, complain
);
8125 else if (DECL_CONSTRUCTOR_P (fn
)
8126 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn
),
8129 /* Avoid infinite recursion trying to call A(...). */
8130 if (complain
& tf_error
)
8131 /* Try to call the actual copy constructor for a good error. */
8132 call_copy_ctor (a
, complain
);
8133 return error_mark_node
;
8136 a
= convert_arg_to_ellipsis (a
, complain
);
8137 if (a
== error_mark_node
)
8138 return error_mark_node
;
8142 gcc_assert (j
<= nargs
);
8145 /* Avoid to do argument-transformation, if warnings for format, and for
8146 nonnull are disabled. Just in case that at least one of them is active
8147 the check_function_arguments function might warn about something. */
8149 bool warned_p
= false;
8152 || warn_suggest_attribute_format
8155 tree
*fargs
= (!nargs
? argarray
8156 : (tree
*) alloca (nargs
* sizeof (tree
)));
8157 for (j
= 0; j
< nargs
; j
++)
8159 /* For -Wformat undo the implicit passing by hidden reference
8160 done by convert_arg_to_ellipsis. */
8161 if (TREE_CODE (argarray
[j
]) == ADDR_EXPR
8162 && TYPE_REF_P (TREE_TYPE (argarray
[j
])))
8163 fargs
[j
] = TREE_OPERAND (argarray
[j
], 0);
8165 fargs
[j
] = maybe_constant_value (argarray
[j
]);
8168 warned_p
= check_function_arguments (input_location
, fn
, TREE_TYPE (fn
),
8169 nargs
, fargs
, NULL
);
8172 if (DECL_INHERITED_CTOR (fn
))
8174 /* Check for passing ellipsis arguments to an inherited constructor. We
8175 could handle this by open-coding the inherited constructor rather than
8176 defining it, but let's not bother now. */
8177 if (!cp_unevaluated_operand
8179 && cand
->convs
[cand
->num_convs
-1]->ellipsis_p
)
8181 if (complain
& tf_error
)
8183 sorry ("passing arguments to ellipsis of inherited constructor "
8185 inform (DECL_SOURCE_LOCATION (cand
->fn
), "declared here");
8187 return error_mark_node
;
8190 /* A base constructor inheriting from a virtual base doesn't get the
8191 inherited arguments, just this and __vtt. */
8192 if (ctor_omit_inherited_parms (fn
))
8196 /* Avoid actually calling copy constructors and copy assignment operators,
8199 if (! flag_elide_constructors
&& !force_elide
)
8200 /* Do things the hard way. */;
8201 else if (cand
->num_convs
== 1
8202 && (DECL_COPY_CONSTRUCTOR_P (fn
)
8203 || DECL_MOVE_CONSTRUCTOR_P (fn
))
8204 /* It's unsafe to elide the constructor when handling
8205 a noexcept-expression, it may evaluate to the wrong
8206 value (c++/53025). */
8207 && (force_elide
|| cp_noexcept_operand
== 0))
8210 tree arg
= argarray
[num_artificial_parms_for (fn
)];
8212 bool trivial
= trivial_fn_p (fn
);
8214 /* Pull out the real argument, disregarding const-correctness. */
8216 /* Strip the reference binding for the constructor parameter. */
8217 if (CONVERT_EXPR_P (targ
)
8218 && TYPE_REF_P (TREE_TYPE (targ
)))
8219 targ
= TREE_OPERAND (targ
, 0);
8220 /* But don't strip any other reference bindings; binding a temporary to a
8221 reference prevents copy elision. */
8222 while ((CONVERT_EXPR_P (targ
)
8223 && !TYPE_REF_P (TREE_TYPE (targ
)))
8224 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
8225 targ
= TREE_OPERAND (targ
, 0);
8226 if (TREE_CODE (targ
) == ADDR_EXPR
)
8228 targ
= TREE_OPERAND (targ
, 0);
8229 if (!same_type_ignoring_top_level_qualifiers_p
8230 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
8239 arg
= cp_build_fold_indirect_ref (arg
);
8241 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8243 if (CHECKING_P
&& cxx_dialect
>= cxx17
)
8244 gcc_assert (TREE_CODE (arg
) != TARGET_EXPR
8246 /* It's from binding the ref parm to a packed field. */
8247 || convs
[0]->need_temporary_p
8249 /* See unsafe_copy_elision_p. */
8250 || DECL_BASE_CONSTRUCTOR_P (fn
));
8253 bool unsafe
= unsafe_copy_elision_p (fa
, arg
);
8254 bool eliding_temp
= (TREE_CODE (arg
) == TARGET_EXPR
&& !unsafe
);
8256 /* [class.copy]: the copy constructor is implicitly defined even if the
8257 implementation elided its use. But don't warn about deprecation when
8258 eliding a temporary, as then no copy is actually performed. */
8259 warning_sentinel
s (warn_deprecated_copy
, eliding_temp
);
8261 /* The language says this isn't called. */;
8264 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
8265 return error_mark_node
;
8266 already_used
= true;
8269 cp_warn_deprecated_use (fn
, complain
);
8271 /* If we're creating a temp and we already have one, don't create a
8272 new one. If we're not creating a temp but we get one, use
8273 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8274 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8275 temp or an INIT_EXPR otherwise. */
8276 if (is_dummy_object (fa
))
8278 if (TREE_CODE (arg
) == TARGET_EXPR
)
8281 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
8283 else if ((trivial
|| TREE_CODE (arg
) == TARGET_EXPR
)
8286 tree to
= cp_stabilize_reference (cp_build_fold_indirect_ref (fa
));
8288 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
8292 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
8293 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
)
8294 && trivial_fn_p (fn
))
8296 tree to
= cp_stabilize_reference
8297 (cp_build_fold_indirect_ref (argarray
[0]));
8298 tree type
= TREE_TYPE (to
);
8299 tree as_base
= CLASSTYPE_AS_BASE (type
);
8300 tree arg
= argarray
[1];
8301 location_t loc
= cp_expr_loc_or_loc (arg
, input_location
);
8303 if (is_really_empty_class (type
))
8305 /* Avoid copying empty classes. */
8306 val
= build2 (COMPOUND_EXPR
, type
, arg
, to
);
8307 TREE_NO_WARNING (val
) = 1;
8309 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
8311 if (is_std_init_list (type
)
8312 && conv_binds_ref_to_prvalue (convs
[1]))
8313 warning_at (loc
, OPT_Winit_list_lifetime
,
8314 "assignment from temporary initializer_list does not "
8315 "extend the lifetime of the underlying array");
8316 arg
= cp_build_fold_indirect_ref (arg
);
8317 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
8321 /* We must only copy the non-tail padding parts. */
8323 tree array_type
, alias_set
;
8325 arg2
= TYPE_SIZE_UNIT (as_base
);
8326 arg0
= cp_build_addr_expr (to
, complain
);
8328 array_type
= build_array_type (unsigned_char_type_node
,
8330 (size_binop (MINUS_EXPR
,
8331 arg2
, size_int (1))));
8332 alias_set
= build_int_cst (build_pointer_type (type
), 0);
8333 t
= build2 (MODIFY_EXPR
, void_type_node
,
8334 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
8335 build2 (MEM_REF
, array_type
, arg
, alias_set
));
8336 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
8337 TREE_NO_WARNING (val
) = 1;
8340 cp_warn_deprecated_use (fn
, complain
);
8344 else if (trivial_fn_p (fn
))
8346 if (DECL_DESTRUCTOR_P (fn
))
8347 return build_trivial_dtor_call (argarray
[0]);
8348 else if (default_ctor_p (fn
))
8350 if (is_dummy_object (argarray
[0]))
8351 return force_target_expr (DECL_CONTEXT (fn
), void_node
,
8352 no_cleanup_complain
);
8354 return cp_build_fold_indirect_ref (argarray
[0]);
8358 gcc_assert (!force_elide
);
8361 && !mark_used (fn
, complain
))
8362 return error_mark_node
;
8364 /* Warn if the built-in writes to an object of a non-trivial type. */
8365 if (warn_class_memaccess
8366 && vec_safe_length (args
) >= 2
8367 && DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
8368 maybe_warn_class_memaccess (input_location
, fn
, args
);
8370 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0
8371 /* Don't mess with virtual lookup in instantiate_non_dependent_expr;
8372 virtual functions can't be constexpr. */
8373 && !in_template_function ())
8376 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
8378 ba_any
, NULL
, complain
);
8379 gcc_assert (binfo
&& binfo
!= error_mark_node
);
8381 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
8383 if (TREE_SIDE_EFFECTS (argarray
[0]))
8384 argarray
[0] = save_expr (argarray
[0]);
8385 t
= build_pointer_type (TREE_TYPE (fn
));
8386 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
8391 fn
= build_addr_func (fn
, complain
);
8392 if (fn
== error_mark_node
)
8393 return error_mark_node
;
8396 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
8397 if (call
== error_mark_node
)
8399 if (cand
->flags
& LOOKUP_LIST_INIT_CTOR
)
8401 tree c
= extract_call_expr (call
);
8402 /* build_new_op_1 will clear this when appropriate. */
8403 CALL_EXPR_ORDERED_ARGS (c
) = true;
8407 tree c
= extract_call_expr (call
);
8408 if (TREE_CODE (c
) == CALL_EXPR
)
8409 TREE_NO_WARNING (c
) = 1;
8417 /* Return the DECL of the first non-static subobject of class TYPE
8418 that satisfies the predicate PRED or null if none can be found. */
8420 template <class Predicate
>
8422 first_non_static_field (tree type
, Predicate pred
)
8424 if (!type
|| !CLASS_TYPE_P (type
))
8427 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
8429 if (TREE_CODE (field
) != FIELD_DECL
)
8431 if (TREE_STATIC (field
))
8439 for (tree base_binfo
, binfo
= TYPE_BINFO (type
);
8440 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8442 tree base
= TREE_TYPE (base_binfo
);
8445 if (tree field
= first_non_static_field (base
, pred
))
8452 struct NonPublicField
8454 bool operator() (const_tree t
)
8456 return DECL_P (t
) && (TREE_PRIVATE (t
) || TREE_PROTECTED (t
));
8460 /* Return the DECL of the first non-public subobject of class TYPE
8461 or null if none can be found. */
8464 first_non_public_field (tree type
)
8466 return first_non_static_field (type
, NonPublicField ());
8469 struct NonTrivialField
8471 bool operator() (const_tree t
)
8473 return !trivial_type_p (DECL_P (t
) ? TREE_TYPE (t
) : t
);
8477 /* Return the DECL of the first non-trivial subobject of class TYPE
8478 or null if none can be found. */
8481 first_non_trivial_field (tree type
)
8483 return first_non_static_field (type
, NonTrivialField ());
8486 } /* unnamed namespace */
8488 /* Return true if all copy and move assignment operator overloads for
8489 class TYPE are trivial and at least one of them is not deleted and,
8490 when ACCESS is set, accessible. Return false otherwise. Set
8491 HASASSIGN to true when the TYPE has a (not necessarily trivial)
8492 copy or move assignment. */
8495 has_trivial_copy_assign_p (tree type
, bool access
, bool *hasassign
)
8497 tree fns
= get_class_binding (type
, assign_op_identifier
);
8498 bool all_trivial
= true;
8500 /* Iterate over overloads of the assignment operator, checking
8501 accessible copy assignments for triviality. */
8503 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8507 /* Skip operators that aren't copy assignments. */
8511 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8512 || accessible_p (TYPE_BINFO (type
), f
, true));
8514 /* Skip template assignment operators and deleted functions. */
8515 if (TREE_CODE (f
) != FUNCTION_DECL
|| DECL_DELETED_FN (f
))
8521 if (!accessible
|| !trivial_fn_p (f
))
8522 all_trivial
= false;
8524 /* Break early when both properties have been determined. */
8525 if (*hasassign
&& !all_trivial
)
8529 /* Return true if they're all trivial and one of the expressions
8530 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
8531 tree ref
= cp_build_reference_type (type
, false);
8533 && (is_trivially_xible (MODIFY_EXPR
, type
, type
)
8534 || is_trivially_xible (MODIFY_EXPR
, type
, ref
)));
8537 /* Return true if all copy and move ctor overloads for class TYPE are
8538 trivial and at least one of them is not deleted and, when ACCESS is
8539 set, accessible. Return false otherwise. Set each element of HASCTOR[]
8540 to true when the TYPE has a (not necessarily trivial) default and copy
8541 (or move) ctor, respectively. */
8544 has_trivial_copy_p (tree type
, bool access
, bool hasctor
[2])
8546 tree fns
= get_class_binding (type
, complete_ctor_identifier
);
8547 bool all_trivial
= true;
8549 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8553 /* Skip template constructors. */
8554 if (TREE_CODE (f
) != FUNCTION_DECL
)
8557 bool cpy_or_move_ctor_p
= copy_fn_p (f
);
8559 /* Skip ctors other than default, copy, and move. */
8560 if (!cpy_or_move_ctor_p
&& !default_ctor_p (f
))
8563 if (DECL_DELETED_FN (f
))
8566 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8567 || accessible_p (TYPE_BINFO (type
), f
, true));
8570 hasctor
[cpy_or_move_ctor_p
] = true;
8572 if (cpy_or_move_ctor_p
&& (!accessible
|| !trivial_fn_p (f
)))
8573 all_trivial
= false;
8575 /* Break early when both properties have been determined. */
8576 if (hasctor
[0] && hasctor
[1] && !all_trivial
)
8583 /* Issue a warning on a call to the built-in function FNDECL if it is
8584 a raw memory write whose destination is not an object of (something
8585 like) trivial or standard layout type with a non-deleted assignment
8586 and copy ctor. Detects const correctness violations, corrupting
8587 references, virtual table pointers, and bypassing non-trivial
8591 maybe_warn_class_memaccess (location_t loc
, tree fndecl
,
8592 const vec
<tree
, va_gc
> *args
)
8594 /* Except for bcopy where it's second, the destination pointer is
8595 the first argument for all functions handled here. Compute
8596 the index of the destination and source arguments. */
8597 unsigned dstidx
= DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_BCOPY
;
8598 unsigned srcidx
= !dstidx
;
8600 tree dest
= (*args
)[dstidx
];
8601 if (!TREE_TYPE (dest
) || !INDIRECT_TYPE_P (TREE_TYPE (dest
)))
8604 tree srctype
= NULL_TREE
;
8606 /* Determine the type of the pointed-to object and whether it's
8607 a complete class type. */
8608 tree desttype
= TREE_TYPE (TREE_TYPE (dest
));
8610 if (!desttype
|| !COMPLETE_TYPE_P (desttype
) || !CLASS_TYPE_P (desttype
))
8613 /* Check to see if the raw memory call is made by a non-static member
8614 function with THIS as the destination argument for the destination
8615 type. If so, and if the class has no non-trivial bases or members,
8616 be more permissive. */
8617 if (current_function_decl
8618 && DECL_NONSTATIC_MEMBER_FUNCTION_P (current_function_decl
)
8619 && is_this_parameter (tree_strip_nop_conversions (dest
)))
8621 tree ctx
= DECL_CONTEXT (current_function_decl
);
8622 bool special
= same_type_ignoring_top_level_qualifiers_p (ctx
, desttype
);
8623 tree binfo
= TYPE_BINFO (ctx
);
8625 /* FIXME: The following if statement is overly permissive (see
8626 bug 84851). Remove it in GCC 9. */
8628 && !BINFO_VTABLE (binfo
)
8629 && !BINFO_N_BASE_BINFOS (binfo
)
8630 && (DECL_CONSTRUCTOR_P (current_function_decl
)
8631 || DECL_DESTRUCTOR_P (current_function_decl
)))
8635 && !BINFO_VTABLE (binfo
)
8636 && !first_non_trivial_field (desttype
))
8640 /* True if the class is trivial. */
8641 bool trivial
= trivial_type_p (desttype
);
8643 /* Set to true if DESTYPE has an accessible copy assignment. */
8644 bool hasassign
= false;
8645 /* True if all of the class' overloaded copy assignment operators
8646 are all trivial (and not deleted) and at least one of them is
8648 bool trivassign
= has_trivial_copy_assign_p (desttype
, true, &hasassign
);
8650 /* Set to true if DESTTYPE has an accessible default and copy ctor,
8652 bool hasctors
[2] = { false, false };
8654 /* True if all of the class' overloaded copy constructors are all
8655 trivial (and not deleted) and at least one of them is accessible. */
8656 bool trivcopy
= has_trivial_copy_p (desttype
, true, hasctors
);
8658 /* Set FLD to the first private/protected member of the class. */
8659 tree fld
= trivial
? first_non_public_field (desttype
) : NULL_TREE
;
8661 /* The warning format string. */
8662 const char *warnfmt
= NULL
;
8663 /* A suggested alternative to offer instead of the raw memory call.
8664 Empty string when none can be come up with. */
8665 const char *suggest
= "";
8666 bool warned
= false;
8668 switch (DECL_FUNCTION_CODE (fndecl
))
8670 case BUILT_IN_MEMSET
:
8671 if (!integer_zerop (maybe_constant_value ((*args
)[1])))
8673 /* Diagnose setting non-copy-assignable or non-trivial types,
8674 or types with a private member, to (potentially) non-zero
8675 bytes. Since the value of the bytes being written is unknown,
8676 suggest using assignment instead (if one exists). Also warn
8677 for writes into objects for which zero-initialization doesn't
8678 mean all bits clear (pointer-to-member data, where null is all
8679 bits set). Since the value being written is (most likely)
8680 non-zero, simply suggest assignment (but not copy assignment). */
8681 suggest
= "; use assignment instead";
8683 warnfmt
= G_("%qD writing to an object of type %#qT with "
8684 "no trivial copy-assignment");
8686 warnfmt
= G_("%qD writing to an object of non-trivial type %#qT%s");
8689 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8690 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8691 "%qD writing to an object of type %#qT with "
8693 fndecl
, desttype
, access
, fld
);
8695 else if (!zero_init_p (desttype
))
8696 warnfmt
= G_("%qD writing to an object of type %#qT containing "
8697 "a pointer to data member%s");
8703 case BUILT_IN_BZERO
:
8704 /* Similarly to the above, diagnose clearing non-trivial or non-
8705 standard layout objects, or objects of types with no assignmenmt.
8706 Since the value being written is known to be zero, suggest either
8707 copy assignment, copy ctor, or default ctor as an alternative,
8708 depending on what's available. */
8710 if (hasassign
&& hasctors
[0])
8711 suggest
= G_("; use assignment or value-initialization instead");
8713 suggest
= G_("; use assignment instead");
8714 else if (hasctors
[0])
8715 suggest
= G_("; use value-initialization instead");
8718 warnfmt
= G_("%qD clearing an object of type %#qT with "
8719 "no trivial copy-assignment%s");
8721 warnfmt
= G_("%qD clearing an object of non-trivial type %#qT%s");
8722 else if (!zero_init_p (desttype
))
8723 warnfmt
= G_("%qD clearing an object of type %#qT containing "
8724 "a pointer-to-member%s");
8727 case BUILT_IN_BCOPY
:
8728 case BUILT_IN_MEMCPY
:
8729 case BUILT_IN_MEMMOVE
:
8730 case BUILT_IN_MEMPCPY
:
8731 /* Determine the type of the source object. */
8732 srctype
= TREE_TYPE ((*args
)[srcidx
]);
8733 if (!srctype
|| !INDIRECT_TYPE_P (srctype
))
8734 srctype
= void_type_node
;
8736 srctype
= TREE_TYPE (srctype
);
8738 /* Since it's impossible to determine wheter the byte copy is
8739 being used in place of assignment to an existing object or
8740 as a substitute for initialization, assume it's the former.
8741 Determine the best alternative to use instead depending on
8742 what's not deleted. */
8743 if (hasassign
&& hasctors
[1])
8744 suggest
= G_("; use copy-assignment or copy-initialization instead");
8746 suggest
= G_("; use copy-assignment instead");
8747 else if (hasctors
[1])
8748 suggest
= G_("; use copy-initialization instead");
8751 warnfmt
= G_("%qD writing to an object of type %#qT with no trivial "
8752 "copy-assignment%s");
8753 else if (!trivially_copyable_p (desttype
))
8754 warnfmt
= G_("%qD writing to an object of non-trivially copyable "
8757 warnfmt
= G_("%qD writing to an object with a deleted copy constructor");
8760 && !VOID_TYPE_P (srctype
)
8761 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
8762 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
8765 /* Warn when copying into a non-trivial object from an object
8766 of a different type other than void or char. */
8767 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8768 "%qD copying an object of non-trivial type "
8769 "%#qT from an array of %#qT",
8770 fndecl
, desttype
, srctype
);
8773 && !VOID_TYPE_P (srctype
)
8774 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
8775 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
8778 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8779 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8780 "%qD copying an object of type %#qT with "
8781 "%qs member %qD from an array of %#qT; use "
8782 "assignment or copy-initialization instead",
8783 fndecl
, desttype
, access
, fld
, srctype
);
8785 else if (!trivial
&& vec_safe_length (args
) > 2)
8787 tree sz
= maybe_constant_value ((*args
)[2]);
8788 if (!tree_fits_uhwi_p (sz
))
8791 /* Finally, warn on partial copies. */
8792 unsigned HOST_WIDE_INT typesize
8793 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype
));
8794 if (unsigned HOST_WIDE_INT partial
= tree_to_uhwi (sz
) % typesize
)
8795 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8796 (typesize
- partial
> 1
8797 ? G_("%qD writing to an object of "
8798 "a non-trivial type %#qT leaves %wu "
8800 : G_("%qD writing to an object of "
8801 "a non-trivial type %#qT leaves %wu "
8803 fndecl
, desttype
, typesize
- partial
);
8807 case BUILT_IN_REALLOC
:
8809 if (!trivially_copyable_p (desttype
))
8810 warnfmt
= G_("%qD moving an object of non-trivially copyable type "
8811 "%#qT; use %<new%> and %<delete%> instead");
8813 warnfmt
= G_("%qD moving an object of type %#qT with deleted copy "
8814 "constructor; use %<new%> and %<delete%> instead");
8815 else if (!get_dtor (desttype
, tf_none
))
8816 warnfmt
= G_("%qD moving an object of type %#qT with deleted "
8820 tree sz
= maybe_constant_value ((*args
)[1]);
8821 if (TREE_CODE (sz
) == INTEGER_CST
8822 && tree_int_cst_lt (sz
, TYPE_SIZE_UNIT (desttype
)))
8823 /* Finally, warn on reallocation into insufficient space. */
8824 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8825 "%qD moving an object of non-trivial type "
8826 "%#qT and size %E into a region of size %E",
8827 fndecl
, desttype
, TYPE_SIZE_UNIT (desttype
),
8839 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8840 warnfmt
, fndecl
, desttype
, suggest
);
8842 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8843 warnfmt
, fndecl
, desttype
);
8847 inform (location_of (desttype
), "%#qT declared here", desttype
);
8850 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
8851 This function performs no overload resolution, conversion, or other
8852 high-level operations. */
8855 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
8856 tsubst_flags_t complain
)
8860 /* Remember roughly where this call is. */
8861 location_t loc
= cp_expr_loc_or_loc (fn
, input_location
);
8862 fn
= build_call_a (fn
, nargs
, argarray
);
8863 SET_EXPR_LOCATION (fn
, loc
);
8865 fndecl
= get_callee_fndecl (fn
);
8867 /* Check that arguments to builtin functions match the expectations. */
8869 && !processing_template_decl
8870 && DECL_BUILT_IN (fndecl
)
8871 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
8875 /* We need to take care that values to BUILT_IN_NORMAL
8877 for (i
= 0; i
< nargs
; i
++)
8878 argarray
[i
] = maybe_constant_value (argarray
[i
]);
8880 if (!check_builtin_function_arguments (EXPR_LOCATION (fn
), vNULL
, fndecl
,
8882 return error_mark_node
;
8885 if (VOID_TYPE_P (TREE_TYPE (fn
)))
8888 /* 5.2.2/11: If a function call is a prvalue of object type: if the
8889 function call is either the operand of a decltype-specifier or the
8890 right operand of a comma operator that is the operand of a
8891 decltype-specifier, a temporary object is not introduced for the
8892 prvalue. The type of the prvalue may be incomplete. */
8893 if (!(complain
& tf_decltype
))
8895 fn
= require_complete_type_sfinae (fn
, complain
);
8896 if (fn
== error_mark_node
)
8897 return error_mark_node
;
8899 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
8901 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
8902 maybe_warn_parm_abi (TREE_TYPE (fn
), loc
);
8905 return convert_from_reference (fn
);
8908 /* Returns the value to use for the in-charge parameter when making a
8909 call to a function with the indicated NAME.
8911 FIXME:Can't we find a neater way to do this mapping? */
8914 in_charge_arg_for_name (tree name
)
8916 if (IDENTIFIER_CTOR_P (name
))
8918 if (name
== complete_ctor_identifier
)
8919 return integer_one_node
;
8920 gcc_checking_assert (name
== base_ctor_identifier
);
8924 if (name
== complete_dtor_identifier
)
8925 return integer_two_node
;
8926 else if (name
== deleting_dtor_identifier
)
8927 return integer_three_node
;
8928 gcc_checking_assert (name
== base_dtor_identifier
);
8931 return integer_zero_node
;
8934 /* We've built up a constructor call RET. Complain if it delegates to the
8935 constructor we're currently compiling. */
8938 check_self_delegation (tree ret
)
8940 if (TREE_CODE (ret
) == TARGET_EXPR
)
8941 ret
= TARGET_EXPR_INITIAL (ret
);
8942 tree fn
= cp_get_callee_fndecl_nofold (ret
);
8943 if (fn
&& DECL_ABSTRACT_ORIGIN (fn
) == current_function_decl
)
8944 error ("constructor delegates to itself");
8947 /* Build a call to a constructor, destructor, or an assignment
8948 operator for INSTANCE, an expression with class type. NAME
8949 indicates the special member function to call; *ARGS are the
8950 arguments. ARGS may be NULL. This may change ARGS. BINFO
8951 indicates the base of INSTANCE that is to be passed as the `this'
8952 parameter to the member function called.
8954 FLAGS are the LOOKUP_* flags to use when processing the call.
8956 If NAME indicates a complete object constructor, INSTANCE may be
8957 NULL_TREE. In this case, the caller will call build_cplus_new to
8958 store the newly constructed object into a VAR_DECL. */
8961 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
8962 tree binfo
, int flags
, tsubst_flags_t complain
)
8965 /* The type of the subobject to be constructed or destroyed. */
8967 vec
<tree
, va_gc
> *allocated
= NULL
;
8970 gcc_assert (IDENTIFIER_CDTOR_P (name
) || name
== assign_op_identifier
);
8972 if (error_operand_p (instance
))
8973 return error_mark_node
;
8975 if (IDENTIFIER_DTOR_P (name
))
8977 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
8978 if (!type_build_dtor_call (TREE_TYPE (instance
)))
8979 /* Shortcut to avoid lazy destructor declaration. */
8980 return build_trivial_dtor_call (instance
);
8985 /* Resolve the name. */
8986 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
8987 return error_mark_node
;
8989 binfo
= TYPE_BINFO (binfo
);
8992 gcc_assert (binfo
!= NULL_TREE
);
8994 class_type
= BINFO_TYPE (binfo
);
8996 /* Handle the special case where INSTANCE is NULL_TREE. */
8997 if (name
== complete_ctor_identifier
&& !instance
)
8998 instance
= build_dummy_object (class_type
);
9001 /* Convert to the base class, if necessary. */
9002 if (!same_type_ignoring_top_level_qualifiers_p
9003 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
9005 if (IDENTIFIER_CDTOR_P (name
))
9006 /* For constructors and destructors, either the base is
9007 non-virtual, or it is virtual but we are doing the
9008 conversion from a constructor or destructor for the
9009 complete object. In either case, we can convert
9011 instance
= convert_to_base_statically (instance
, binfo
);
9014 /* However, for assignment operators, we must convert
9015 dynamically if the base is virtual. */
9016 gcc_checking_assert (name
== assign_op_identifier
);
9017 instance
= build_base_path (PLUS_EXPR
, instance
,
9018 binfo
, /*nonnull=*/1, complain
);
9023 gcc_assert (instance
!= NULL_TREE
);
9025 /* In C++17, "If the initializer expression is a prvalue and the
9026 cv-unqualified version of the source type is the same class as the class
9027 of the destination, the initializer expression is used to initialize the
9028 destination object." Handle that here to avoid doing overload
9030 if (cxx_dialect
>= cxx17
9031 && args
&& vec_safe_length (*args
) == 1
9032 && name
== complete_ctor_identifier
)
9034 tree arg
= (**args
)[0];
9036 if (BRACE_ENCLOSED_INITIALIZER_P (arg
)
9037 && !TYPE_HAS_LIST_CTOR (class_type
)
9038 && CONSTRUCTOR_NELTS (arg
) == 1)
9039 arg
= CONSTRUCTOR_ELT (arg
, 0)->value
;
9041 if ((TREE_CODE (arg
) == TARGET_EXPR
9042 || TREE_CODE (arg
) == CONSTRUCTOR
)
9043 && (same_type_ignoring_top_level_qualifiers_p
9044 (class_type
, TREE_TYPE (arg
))))
9046 if (is_dummy_object (instance
))
9048 else if (TREE_CODE (arg
) == TARGET_EXPR
)
9049 TARGET_EXPR_DIRECT_INIT_P (arg
) = true;
9051 if ((complain
& tf_error
)
9052 && (flags
& LOOKUP_DELEGATING_CONS
))
9053 check_self_delegation (arg
);
9054 /* Avoid change of behavior on Wunused-var-2.C. */
9055 instance
= mark_lvalue_use (instance
);
9056 return build2 (INIT_EXPR
, class_type
, instance
, arg
);
9060 fns
= lookup_fnfields (binfo
, name
, 1);
9062 /* When making a call to a constructor or destructor for a subobject
9063 that uses virtual base classes, pass down a pointer to a VTT for
9065 if ((name
== base_ctor_identifier
9066 || name
== base_dtor_identifier
)
9067 && CLASSTYPE_VBASECLASSES (class_type
))
9072 /* If the current function is a complete object constructor
9073 or destructor, then we fetch the VTT directly.
9074 Otherwise, we look it up using the VTT we were given. */
9075 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
9076 vtt
= decay_conversion (vtt
, complain
);
9077 if (vtt
== error_mark_node
)
9078 return error_mark_node
;
9079 vtt
= build_if_in_charge (vtt
, current_vtt_parm
);
9080 if (BINFO_SUBVTT_INDEX (binfo
))
9081 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
9087 allocated
= make_tree_vector ();
9091 vec_safe_insert (*args
, 0, sub_vtt
);
9094 ret
= build_new_method_call (instance
, fns
, args
,
9095 TYPE_BINFO (BINFO_TYPE (binfo
)),
9099 if (allocated
!= NULL
)
9100 release_tree_vector (allocated
);
9102 if ((complain
& tf_error
)
9103 && (flags
& LOOKUP_DELEGATING_CONS
)
9104 && name
== complete_ctor_identifier
)
9105 check_self_delegation (ret
);
9110 /* Return the NAME, as a C string. The NAME indicates a function that
9111 is a member of TYPE. *FREE_P is set to true if the caller must
9112 free the memory returned.
9114 Rather than go through all of this, we should simply set the names
9115 of constructors and destructors appropriately, and dispense with
9116 ctor_identifier, dtor_identifier, etc. */
9119 name_as_c_string (tree name
, tree type
, bool *free_p
)
9121 const char *pretty_name
;
9123 /* Assume that we will not allocate memory. */
9125 /* Constructors and destructors are special. */
9126 if (IDENTIFIER_CDTOR_P (name
))
9129 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
)));
9130 /* For a destructor, add the '~'. */
9131 if (IDENTIFIER_DTOR_P (name
))
9133 pretty_name
= concat ("~", pretty_name
, NULL
);
9134 /* Remember that we need to free the memory allocated. */
9138 else if (IDENTIFIER_CONV_OP_P (name
))
9140 pretty_name
= concat ("operator ",
9141 type_as_string_translate (TREE_TYPE (name
),
9142 TFF_PLAIN_IDENTIFIER
),
9144 /* Remember that we need to free the memory allocated. */
9148 pretty_name
= identifier_to_locale (IDENTIFIER_POINTER (name
));
9150 return CONST_CAST (char *, pretty_name
);
9153 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
9154 be set, upon return, to the function called. ARGS may be NULL.
9155 This may change ARGS. */
9158 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9159 tree conversion_path
, int flags
,
9160 tree
*fn_p
, tsubst_flags_t complain
)
9162 struct z_candidate
*candidates
= 0, *cand
;
9163 tree explicit_targs
= NULL_TREE
;
9164 tree basetype
= NULL_TREE
;
9165 tree access_binfo
, binfo
;
9167 tree first_mem_arg
= NULL_TREE
;
9169 bool skip_first_for_error
;
9170 vec
<tree
, va_gc
> *user_args
;
9173 int template_only
= 0;
9177 vec
<tree
, va_gc
> *orig_args
= NULL
;
9180 gcc_assert (instance
!= NULL_TREE
);
9182 /* We don't know what function we're going to call, yet. */
9186 if (error_operand_p (instance
)
9187 || !fns
|| error_operand_p (fns
))
9188 return error_mark_node
;
9190 if (!BASELINK_P (fns
))
9192 if (complain
& tf_error
)
9193 error ("call to non-function %qD", fns
);
9194 return error_mark_node
;
9197 orig_instance
= instance
;
9200 /* Dismantle the baselink to collect all the information we need. */
9201 if (!conversion_path
)
9202 conversion_path
= BASELINK_BINFO (fns
);
9203 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
9204 binfo
= BASELINK_BINFO (fns
);
9205 optype
= BASELINK_OPTYPE (fns
);
9206 fns
= BASELINK_FUNCTIONS (fns
);
9207 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
9209 explicit_targs
= TREE_OPERAND (fns
, 1);
9210 fns
= TREE_OPERAND (fns
, 0);
9213 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
9214 || TREE_CODE (fns
) == TEMPLATE_DECL
9215 || TREE_CODE (fns
) == OVERLOAD
);
9216 fn
= OVL_FIRST (fns
);
9217 name
= DECL_NAME (fn
);
9219 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
9220 gcc_assert (CLASS_TYPE_P (basetype
));
9222 user_args
= args
== NULL
? NULL
: *args
;
9223 /* Under DR 147 A::A() is an invalid constructor call,
9224 not a functional cast. */
9225 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
9227 if (! (complain
& tf_error
))
9228 return error_mark_node
;
9230 basetype
= DECL_CONTEXT (fn
);
9231 name
= constructor_name (basetype
);
9232 auto_diagnostic_group d
;
9233 if (permerror (input_location
,
9234 "cannot call constructor %<%T::%D%> directly",
9236 inform (input_location
, "for a function-style cast, remove the "
9237 "redundant %<::%D%>", name
);
9238 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
9243 if (processing_template_decl
)
9245 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
9246 instance
= build_non_dependent_expr (instance
);
9248 make_args_non_dependent (*args
);
9251 /* Process the argument list. */
9252 if (args
!= NULL
&& *args
!= NULL
)
9254 *args
= resolve_args (*args
, complain
);
9256 return error_mark_node
;
9260 /* Consider the object argument to be used even if we end up selecting a
9261 static member function. */
9262 instance
= mark_type_use (instance
);
9264 /* Figure out whether to skip the first argument for the error
9265 message we will display to users if an error occurs. We don't
9266 want to display any compiler-generated arguments. The "this"
9267 pointer hasn't been added yet. However, we must remove the VTT
9268 pointer if this is a call to a base-class constructor or
9270 skip_first_for_error
= false;
9271 if (IDENTIFIER_CDTOR_P (name
))
9273 /* Callers should explicitly indicate whether they want to ctor
9274 the complete object or just the part without virtual bases. */
9275 gcc_assert (name
!= ctor_identifier
);
9277 /* Remove the VTT pointer, if present. */
9278 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
9279 && CLASSTYPE_VBASECLASSES (basetype
))
9280 skip_first_for_error
= true;
9282 /* It's OK to call destructors and constructors on cv-qualified
9283 objects. Therefore, convert the INSTANCE to the unqualified
9284 type, if necessary. */
9285 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
9287 instance
= build_this (instance
);
9288 instance
= build_nop (build_pointer_type (basetype
), instance
);
9289 instance
= build_fold_indirect_ref (instance
);
9293 gcc_assert (!DECL_DESTRUCTOR_P (fn
) && !DECL_CONSTRUCTOR_P (fn
));
9295 /* For the overload resolution we need to find the actual `this`
9296 that would be captured if the call turns out to be to a
9297 non-static member function. Do not actually capture it at this
9299 if (DECL_CONSTRUCTOR_P (fn
))
9300 /* Constructors don't use the enclosing 'this'. */
9301 first_mem_arg
= instance
;
9303 first_mem_arg
= maybe_resolve_dummy (instance
, false);
9305 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9306 p
= conversion_obstack_alloc (0);
9308 /* The number of arguments artificial parms in ARGS; we subtract one because
9309 there's no 'this' in ARGS. */
9310 unsigned skip
= num_artificial_parms_for (fn
) - 1;
9312 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
9313 initializer, not T({ }). */
9314 if (DECL_CONSTRUCTOR_P (fn
)
9315 && vec_safe_length (user_args
) > skip
9316 && DIRECT_LIST_INIT_P ((*user_args
)[skip
]))
9318 tree init_list
= (*user_args
)[skip
];
9319 tree init
= NULL_TREE
;
9321 gcc_assert (user_args
->length () == skip
+ 1
9322 && !(flags
& LOOKUP_ONLYCONVERTING
));
9324 /* If the initializer list has no elements and T is a class type with
9325 a default constructor, the object is value-initialized. Handle
9326 this here so we don't need to handle it wherever we use
9327 build_special_member_call. */
9328 if (CONSTRUCTOR_NELTS (init_list
) == 0
9329 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
9330 /* For a user-provided default constructor, use the normal
9331 mechanisms so that protected access works. */
9332 && type_has_non_user_provided_default_constructor (basetype
)
9333 && !processing_template_decl
)
9334 init
= build_value_init (basetype
, complain
);
9336 /* If BASETYPE is an aggregate, we need to do aggregate
9338 else if (CP_AGGREGATE_TYPE_P (basetype
))
9340 init
= reshape_init (basetype
, init_list
, complain
);
9341 init
= digest_init (basetype
, init
, complain
);
9346 if (is_dummy_object (instance
))
9347 return get_target_expr_sfinae (init
, complain
);
9348 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
9349 TREE_SIDE_EFFECTS (init
) = true;
9353 /* Otherwise go ahead with overload resolution. */
9354 add_list_candidates (fns
, first_mem_arg
, user_args
,
9355 basetype
, explicit_targs
, template_only
,
9356 conversion_path
, access_binfo
, flags
,
9357 &candidates
, complain
);
9360 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
9361 explicit_targs
, template_only
, conversion_path
,
9362 access_binfo
, flags
, &candidates
, complain
);
9364 any_viable_p
= false;
9365 candidates
= splice_viable (candidates
, false, &any_viable_p
);
9369 if (complain
& tf_error
)
9371 auto_diagnostic_group d
;
9372 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
9373 cxx_incomplete_type_error (instance
, basetype
);
9375 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9376 basetype
, optype
, build_tree_list_vec (user_args
),
9377 TREE_TYPE (instance
));
9380 tree arglist
= build_tree_list_vec (user_args
);
9381 tree errname
= name
;
9382 bool twiddle
= false;
9383 if (IDENTIFIER_CDTOR_P (errname
))
9385 twiddle
= IDENTIFIER_DTOR_P (errname
);
9386 errname
= constructor_name (basetype
);
9389 errname
= lookup_template_function (errname
, explicit_targs
);
9390 if (skip_first_for_error
)
9391 arglist
= TREE_CHAIN (arglist
);
9392 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
9393 basetype
, &"~"[!twiddle
], errname
, arglist
,
9394 TREE_TYPE (instance
));
9396 print_z_candidates (location_of (name
), candidates
);
9398 call
= error_mark_node
;
9402 cand
= tourney (candidates
, complain
);
9409 if (complain
& tf_error
)
9411 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
9412 arglist
= build_tree_list_vec (user_args
);
9413 if (skip_first_for_error
)
9414 arglist
= TREE_CHAIN (arglist
);
9415 auto_diagnostic_group d
;
9416 if (!any_strictly_viable (candidates
))
9417 error ("no matching function for call to %<%s(%A)%>",
9418 pretty_name
, arglist
);
9420 error ("call of overloaded %<%s(%A)%> is ambiguous",
9421 pretty_name
, arglist
);
9422 print_z_candidates (location_of (name
), candidates
);
9426 call
= error_mark_node
;
9433 if (!(flags
& LOOKUP_NONVIRTUAL
)
9434 && DECL_PURE_VIRTUAL_P (fn
)
9435 && instance
== current_class_ref
9436 && (complain
& tf_warning
))
9438 /* This is not an error, it is runtime undefined
9440 if (!current_function_decl
)
9441 warning (0, "pure virtual %q#D called from "
9442 "non-static data member initializer", fn
);
9443 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
9444 || DECL_DESTRUCTOR_P (current_function_decl
))
9445 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
9446 ? G_("pure virtual %q#D called from constructor")
9447 : G_("pure virtual %q#D called from destructor")),
9451 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
9452 && !DECL_CONSTRUCTOR_P (fn
)
9453 && is_dummy_object (instance
))
9455 instance
= maybe_resolve_dummy (instance
, true);
9456 if (instance
== error_mark_node
)
9457 call
= error_mark_node
;
9458 else if (!is_dummy_object (instance
))
9460 /* We captured 'this' in the current lambda now that
9461 we know we really need it. */
9462 cand
->first_arg
= instance
;
9464 else if (any_dependent_bases_p ())
9465 /* We can't tell until instantiation time whether we can use
9466 *this as the implicit object argument. */;
9469 if (complain
& tf_error
)
9470 error ("cannot call member function %qD without object",
9472 call
= error_mark_node
;
9476 if (call
!= error_mark_node
)
9478 /* Optimize away vtable lookup if we know that this
9479 function can't be overridden. We need to check if
9480 the context and the type where we found fn are the same,
9481 actually FN might be defined in a different class
9482 type because of a using-declaration. In this case, we
9483 do not want to perform a non-virtual call. */
9484 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
9485 && same_type_ignoring_top_level_qualifiers_p
9486 (DECL_CONTEXT (fn
), BINFO_TYPE (binfo
))
9487 && resolves_to_fixed_type_p (instance
, 0))
9488 flags
|= LOOKUP_NONVIRTUAL
;
9490 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
9491 /* Now we know what function is being called. */
9494 /* Build the actual CALL_EXPR. */
9495 call
= build_over_call (cand
, flags
, complain
);
9496 /* In an expression of the form `a->f()' where `f' turns
9497 out to be a static member function, `a' is
9498 none-the-less evaluated. */
9499 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
9500 && !is_dummy_object (instance
)
9501 && TREE_SIDE_EFFECTS (instance
))
9503 /* But avoid the implicit lvalue-rvalue conversion when 'a'
9506 if (TREE_THIS_VOLATILE (a
))
9508 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
), a
, call
);
9510 else if (call
!= error_mark_node
9511 && DECL_DESTRUCTOR_P (cand
->fn
)
9512 && !VOID_TYPE_P (TREE_TYPE (call
)))
9513 /* An explicit call of the form "x->~X()" has type
9514 "void". However, on platforms where destructors
9515 return "this" (i.e., those where
9516 targetm.cxx.cdtor_returns_this is true), such calls
9517 will appear to have a return value of pointer type
9518 to the low-level call machinery. We do not want to
9519 change the low-level machinery, since we want to be
9520 able to optimize "delete f()" on such platforms as
9521 "operator delete(~X(f()))" (rather than generating
9522 "t = f(), ~X(t), operator delete (t)"). */
9523 call
= build_nop (void_type_node
, call
);
9528 if (processing_template_decl
&& call
!= error_mark_node
)
9530 bool cast_to_void
= false;
9532 if (TREE_CODE (call
) == COMPOUND_EXPR
)
9533 call
= TREE_OPERAND (call
, 1);
9534 else if (TREE_CODE (call
) == NOP_EXPR
)
9536 cast_to_void
= true;
9537 call
= TREE_OPERAND (call
, 0);
9539 if (INDIRECT_REF_P (call
))
9540 call
= TREE_OPERAND (call
, 0);
9541 call
= (build_min_non_dep_call_vec
9543 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
9544 orig_instance
, orig_fns
, NULL_TREE
),
9546 SET_EXPR_LOCATION (call
, input_location
);
9547 call
= convert_from_reference (call
);
9549 call
= build_nop (void_type_node
, call
);
9552 /* Free all the conversions we allocated. */
9553 obstack_free (&conversion_obstack
, p
);
9555 if (orig_args
!= NULL
)
9556 release_tree_vector (orig_args
);
9561 /* Wrapper for above. */
9564 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9565 tree conversion_path
, int flags
,
9566 tree
*fn_p
, tsubst_flags_t complain
)
9569 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
9570 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
9572 timevar_cond_stop (TV_OVERLOAD
, subtime
);
9576 /* Returns true iff standard conversion sequence ICS1 is a proper
9577 subsequence of ICS2. */
9580 is_subseq (conversion
*ics1
, conversion
*ics2
)
9582 /* We can assume that a conversion of the same code
9583 between the same types indicates a subsequence since we only get
9584 here if the types we are converting from are the same. */
9586 while (ics1
->kind
== ck_rvalue
9587 || ics1
->kind
== ck_lvalue
)
9588 ics1
= next_conversion (ics1
);
9592 while (ics2
->kind
== ck_rvalue
9593 || ics2
->kind
== ck_lvalue
)
9594 ics2
= next_conversion (ics2
);
9596 if (ics2
->kind
== ck_user
9597 || ics2
->kind
== ck_ambig
9598 || ics2
->kind
== ck_aggr
9599 || ics2
->kind
== ck_list
9600 || ics2
->kind
== ck_identity
)
9601 /* At this point, ICS1 cannot be a proper subsequence of
9602 ICS2. We can get a USER_CONV when we are comparing the
9603 second standard conversion sequence of two user conversion
9607 ics2
= next_conversion (ics2
);
9609 while (ics2
->kind
== ck_rvalue
9610 || ics2
->kind
== ck_lvalue
)
9611 ics2
= next_conversion (ics2
);
9613 if (ics2
->kind
== ics1
->kind
9614 && same_type_p (ics2
->type
, ics1
->type
)
9615 && (ics1
->kind
== ck_identity
9616 || same_type_p (next_conversion (ics2
)->type
,
9617 next_conversion (ics1
)->type
)))
9622 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
9623 be any _TYPE nodes. */
9626 is_properly_derived_from (tree derived
, tree base
)
9628 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
9631 /* We only allow proper derivation here. The DERIVED_FROM_P macro
9632 considers every class derived from itself. */
9633 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
9634 && DERIVED_FROM_P (base
, derived
));
9637 /* We build the ICS for an implicit object parameter as a pointer
9638 conversion sequence. However, such a sequence should be compared
9639 as if it were a reference conversion sequence. If ICS is the
9640 implicit conversion sequence for an implicit object parameter,
9641 modify it accordingly. */
9644 maybe_handle_implicit_object (conversion
**ics
)
9648 /* [over.match.funcs]
9650 For non-static member functions, the type of the
9651 implicit object parameter is "reference to cv X"
9652 where X is the class of which the function is a
9653 member and cv is the cv-qualification on the member
9654 function declaration. */
9655 conversion
*t
= *ics
;
9656 tree reference_type
;
9658 /* The `this' parameter is a pointer to a class type. Make the
9659 implicit conversion talk about a reference to that same class
9661 reference_type
= TREE_TYPE (t
->type
);
9662 reference_type
= build_reference_type (reference_type
);
9664 if (t
->kind
== ck_qual
)
9665 t
= next_conversion (t
);
9666 if (t
->kind
== ck_ptr
)
9667 t
= next_conversion (t
);
9668 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
9669 t
= direct_reference_binding (reference_type
, t
);
9671 t
->rvaluedness_matches_p
= 0;
9676 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
9677 and return the initial reference binding conversion. Otherwise,
9678 leave *ICS unchanged and return NULL. */
9681 maybe_handle_ref_bind (conversion
**ics
)
9683 if ((*ics
)->kind
== ck_ref_bind
)
9685 conversion
*old_ics
= *ics
;
9686 *ics
= next_conversion (old_ics
);
9687 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
9694 /* Compare two implicit conversion sequences according to the rules set out in
9695 [over.ics.rank]. Return values:
9697 1: ics1 is better than ics2
9698 -1: ics2 is better than ics1
9699 0: ics1 and ics2 are indistinguishable */
9702 compare_ics (conversion
*ics1
, conversion
*ics2
)
9708 tree deref_from_type1
= NULL_TREE
;
9709 tree deref_from_type2
= NULL_TREE
;
9710 tree deref_to_type1
= NULL_TREE
;
9711 tree deref_to_type2
= NULL_TREE
;
9712 conversion_rank rank1
, rank2
;
9714 /* REF_BINDING is nonzero if the result of the conversion sequence
9715 is a reference type. In that case REF_CONV is the reference
9716 binding conversion. */
9717 conversion
*ref_conv1
;
9718 conversion
*ref_conv2
;
9720 /* Compare badness before stripping the reference conversion. */
9721 if (ics1
->bad_p
> ics2
->bad_p
)
9723 else if (ics1
->bad_p
< ics2
->bad_p
)
9726 /* Handle implicit object parameters. */
9727 maybe_handle_implicit_object (&ics1
);
9728 maybe_handle_implicit_object (&ics2
);
9730 /* Handle reference parameters. */
9731 ref_conv1
= maybe_handle_ref_bind (&ics1
);
9732 ref_conv2
= maybe_handle_ref_bind (&ics2
);
9734 /* List-initialization sequence L1 is a better conversion sequence than
9735 list-initialization sequence L2 if L1 converts to
9736 std::initializer_list<X> for some X and L2 does not. */
9737 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
9739 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
9744 When comparing the basic forms of implicit conversion sequences (as
9745 defined in _over.best.ics_)
9747 --a standard conversion sequence (_over.ics.scs_) is a better
9748 conversion sequence than a user-defined conversion sequence
9749 or an ellipsis conversion sequence, and
9751 --a user-defined conversion sequence (_over.ics.user_) is a
9752 better conversion sequence than an ellipsis conversion sequence
9753 (_over.ics.ellipsis_). */
9754 /* Use BAD_CONVERSION_RANK because we already checked for a badness
9755 mismatch. If both ICS are bad, we try to make a decision based on
9756 what would have happened if they'd been good. This is not an
9757 extension, we'll still give an error when we build up the call; this
9758 just helps us give a more helpful error message. */
9759 rank1
= BAD_CONVERSION_RANK (ics1
);
9760 rank2
= BAD_CONVERSION_RANK (ics2
);
9764 else if (rank1
< rank2
)
9767 if (ics1
->ellipsis_p
)
9768 /* Both conversions are ellipsis conversions. */
9771 /* User-defined conversion sequence U1 is a better conversion sequence
9772 than another user-defined conversion sequence U2 if they contain the
9773 same user-defined conversion operator or constructor and if the sec-
9774 ond standard conversion sequence of U1 is better than the second
9775 standard conversion sequence of U2. */
9777 /* Handle list-conversion with the same code even though it isn't always
9778 ranked as a user-defined conversion and it doesn't have a second
9779 standard conversion sequence; it will still have the desired effect.
9780 Specifically, we need to do the reference binding comparison at the
9781 end of this function. */
9783 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
|| ics1
->kind
== ck_aggr
)
9788 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
9789 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
9790 || t1
->kind
== ck_list
)
9792 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
9793 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
9794 || t2
->kind
== ck_list
)
9797 if (t1
->kind
!= t2
->kind
)
9799 else if (t1
->kind
== ck_user
)
9801 tree f1
= t1
->cand
? t1
->cand
->fn
: t1
->type
;
9802 tree f2
= t2
->cand
? t2
->cand
->fn
: t2
->type
;
9808 /* For ambiguous or aggregate conversions, use the target type as
9809 a proxy for the conversion function. */
9810 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
9814 /* We can just fall through here, after setting up
9815 FROM_TYPE1 and FROM_TYPE2. */
9816 from_type1
= t1
->type
;
9817 from_type2
= t2
->type
;
9824 /* We're dealing with two standard conversion sequences.
9828 Standard conversion sequence S1 is a better conversion
9829 sequence than standard conversion sequence S2 if
9831 --S1 is a proper subsequence of S2 (comparing the conversion
9832 sequences in the canonical form defined by _over.ics.scs_,
9833 excluding any Lvalue Transformation; the identity
9834 conversion sequence is considered to be a subsequence of
9835 any non-identity conversion sequence */
9838 while (t1
->kind
!= ck_identity
)
9839 t1
= next_conversion (t1
);
9840 from_type1
= t1
->type
;
9843 while (t2
->kind
!= ck_identity
)
9844 t2
= next_conversion (t2
);
9845 from_type2
= t2
->type
;
9848 /* One sequence can only be a subsequence of the other if they start with
9849 the same type. They can start with different types when comparing the
9850 second standard conversion sequence in two user-defined conversion
9852 if (same_type_p (from_type1
, from_type2
))
9854 if (is_subseq (ics1
, ics2
))
9856 if (is_subseq (ics2
, ics1
))
9864 --the rank of S1 is better than the rank of S2 (by the rules
9867 Standard conversion sequences are ordered by their ranks: an Exact
9868 Match is a better conversion than a Promotion, which is a better
9869 conversion than a Conversion.
9871 Two conversion sequences with the same rank are indistinguishable
9872 unless one of the following rules applies:
9874 --A conversion that does not a convert a pointer, pointer to member,
9875 or std::nullptr_t to bool is better than one that does.
9877 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
9878 so that we do not have to check it explicitly. */
9879 if (ics1
->rank
< ics2
->rank
)
9881 else if (ics2
->rank
< ics1
->rank
)
9884 to_type1
= ics1
->type
;
9885 to_type2
= ics2
->type
;
9887 /* A conversion from scalar arithmetic type to complex is worse than a
9888 conversion between scalar arithmetic types. */
9889 if (same_type_p (from_type1
, from_type2
)
9890 && ARITHMETIC_TYPE_P (from_type1
)
9891 && ARITHMETIC_TYPE_P (to_type1
)
9892 && ARITHMETIC_TYPE_P (to_type2
)
9893 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
9894 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
9896 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
9902 if (TYPE_PTR_P (from_type1
)
9903 && TYPE_PTR_P (from_type2
)
9904 && TYPE_PTR_P (to_type1
)
9905 && TYPE_PTR_P (to_type2
))
9907 deref_from_type1
= TREE_TYPE (from_type1
);
9908 deref_from_type2
= TREE_TYPE (from_type2
);
9909 deref_to_type1
= TREE_TYPE (to_type1
);
9910 deref_to_type2
= TREE_TYPE (to_type2
);
9912 /* The rules for pointers to members A::* are just like the rules
9913 for pointers A*, except opposite: if B is derived from A then
9914 A::* converts to B::*, not vice versa. For that reason, we
9915 switch the from_ and to_ variables here. */
9916 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
9917 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
9918 || (TYPE_PTRMEMFUNC_P (from_type1
)
9919 && TYPE_PTRMEMFUNC_P (from_type2
)
9920 && TYPE_PTRMEMFUNC_P (to_type1
)
9921 && TYPE_PTRMEMFUNC_P (to_type2
)))
9923 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
9924 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
9925 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
9926 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
9929 if (deref_from_type1
!= NULL_TREE
9930 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
9931 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
9933 /* This was one of the pointer or pointer-like conversions.
9937 --If class B is derived directly or indirectly from class A,
9938 conversion of B* to A* is better than conversion of B* to
9939 void*, and conversion of A* to void* is better than
9940 conversion of B* to void*. */
9941 if (VOID_TYPE_P (deref_to_type1
)
9942 && VOID_TYPE_P (deref_to_type2
))
9944 if (is_properly_derived_from (deref_from_type1
,
9947 else if (is_properly_derived_from (deref_from_type2
,
9951 else if (VOID_TYPE_P (deref_to_type1
)
9952 || VOID_TYPE_P (deref_to_type2
))
9954 if (same_type_p (deref_from_type1
, deref_from_type2
))
9956 if (VOID_TYPE_P (deref_to_type2
))
9958 if (is_properly_derived_from (deref_from_type1
,
9962 /* We know that DEREF_TO_TYPE1 is `void' here. */
9963 else if (is_properly_derived_from (deref_from_type1
,
9968 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
9969 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
9973 --If class B is derived directly or indirectly from class A
9974 and class C is derived directly or indirectly from B,
9976 --conversion of C* to B* is better than conversion of C* to
9979 --conversion of B* to A* is better than conversion of C* to
9981 if (same_type_p (deref_from_type1
, deref_from_type2
))
9983 if (is_properly_derived_from (deref_to_type1
,
9986 else if (is_properly_derived_from (deref_to_type2
,
9990 else if (same_type_p (deref_to_type1
, deref_to_type2
))
9992 if (is_properly_derived_from (deref_from_type2
,
9995 else if (is_properly_derived_from (deref_from_type1
,
10001 else if (CLASS_TYPE_P (non_reference (from_type1
))
10002 && same_type_p (from_type1
, from_type2
))
10004 tree from
= non_reference (from_type1
);
10008 --binding of an expression of type C to a reference of type
10009 B& is better than binding an expression of type C to a
10010 reference of type A&
10012 --conversion of C to B is better than conversion of C to A, */
10013 if (is_properly_derived_from (from
, to_type1
)
10014 && is_properly_derived_from (from
, to_type2
))
10016 if (is_properly_derived_from (to_type1
, to_type2
))
10018 else if (is_properly_derived_from (to_type2
, to_type1
))
10022 else if (CLASS_TYPE_P (non_reference (to_type1
))
10023 && same_type_p (to_type1
, to_type2
))
10025 tree to
= non_reference (to_type1
);
10029 --binding of an expression of type B to a reference of type
10030 A& is better than binding an expression of type C to a
10031 reference of type A&,
10033 --conversion of B to A is better than conversion of C to A */
10034 if (is_properly_derived_from (from_type1
, to
)
10035 && is_properly_derived_from (from_type2
, to
))
10037 if (is_properly_derived_from (from_type2
, from_type1
))
10039 else if (is_properly_derived_from (from_type1
, from_type2
))
10046 --S1 and S2 differ only in their qualification conversion and yield
10047 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
10048 qualification signature of type T1 is a proper subset of the cv-
10049 qualification signature of type T2 */
10050 if (ics1
->kind
== ck_qual
10051 && ics2
->kind
== ck_qual
10052 && same_type_p (from_type1
, from_type2
))
10054 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
10061 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
10062 to an implicit object parameter of a non-static member function
10063 declared without a ref-qualifier, and either S1 binds an lvalue
10064 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
10065 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
10066 draft standard, 13.3.3.2)
10068 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
10069 types to which the references refer are the same type except for
10070 top-level cv-qualifiers, and the type to which the reference
10071 initialized by S2 refers is more cv-qualified than the type to
10072 which the reference initialized by S1 refers.
10074 DR 1328 [over.match.best]: the context is an initialization by
10075 conversion function for direct reference binding (13.3.1.6) of a
10076 reference to function type, the return type of F1 is the same kind of
10077 reference (i.e. lvalue or rvalue) as the reference being initialized,
10078 and the return type of F2 is not. */
10080 if (ref_conv1
&& ref_conv2
)
10082 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
10083 && (ref_conv1
->rvaluedness_matches_p
10084 != ref_conv2
->rvaluedness_matches_p
)
10085 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
10086 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
10087 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
10089 if (ref_conv1
->bad_p
10090 && !same_type_p (TREE_TYPE (ref_conv1
->type
),
10091 TREE_TYPE (ref_conv2
->type
)))
10092 /* Don't prefer a bad conversion that drops cv-quals to a bad
10093 conversion with the wrong rvalueness. */
10095 return (ref_conv1
->rvaluedness_matches_p
10096 - ref_conv2
->rvaluedness_matches_p
);
10099 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
10101 int q1
= cp_type_quals (TREE_TYPE (ref_conv1
->type
));
10102 int q2
= cp_type_quals (TREE_TYPE (ref_conv2
->type
));
10103 if (ref_conv1
->bad_p
)
10105 /* Prefer the one that drops fewer cv-quals. */
10106 tree ftype
= next_conversion (ref_conv1
)->type
;
10107 int fquals
= cp_type_quals (ftype
);
10111 return comp_cv_qualification (q2
, q1
);
10115 /* Neither conversion sequence is better than the other. */
10119 /* The source type for this standard conversion sequence. */
10122 source_type (conversion
*t
)
10124 for (;; t
= next_conversion (t
))
10126 if (t
->kind
== ck_user
10127 || t
->kind
== ck_ambig
10128 || t
->kind
== ck_identity
)
10131 gcc_unreachable ();
10134 /* Note a warning about preferring WINNER to LOSER. We do this by storing
10135 a pointer to LOSER and re-running joust to produce the warning if WINNER
10136 is actually used. */
10139 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
10141 candidate_warning
*cw
= (candidate_warning
*)
10142 conversion_obstack_alloc (sizeof (candidate_warning
));
10144 cw
->next
= winner
->warnings
;
10145 winner
->warnings
= cw
;
10148 /* Compare two candidates for overloading as described in
10149 [over.match.best]. Return values:
10151 1: cand1 is better than cand2
10152 -1: cand2 is better than cand1
10153 0: cand1 and cand2 are indistinguishable */
10156 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
10157 tsubst_flags_t complain
)
10160 int off1
= 0, off2
= 0;
10164 /* Candidates that involve bad conversions are always worse than those
10166 if (cand1
->viable
> cand2
->viable
)
10168 if (cand1
->viable
< cand2
->viable
)
10171 /* If we have two pseudo-candidates for conversions to the same type,
10172 or two candidates for the same function, arbitrarily pick one. */
10173 if (cand1
->fn
== cand2
->fn
10174 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
10177 /* Prefer a non-deleted function over an implicitly deleted move
10178 constructor or assignment operator. This differs slightly from the
10179 wording for issue 1402 (which says the move op is ignored by overload
10180 resolution), but this way produces better error messages. */
10181 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
10182 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
10183 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
10185 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
10186 && move_fn_p (cand1
->fn
))
10188 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
10189 && move_fn_p (cand2
->fn
))
10193 /* a viable function F1
10194 is defined to be a better function than another viable function F2 if
10195 for all arguments i, ICSi(F1) is not a worse conversion sequence than
10196 ICSi(F2), and then */
10198 /* for some argument j, ICSj(F1) is a better conversion sequence than
10201 /* For comparing static and non-static member functions, we ignore
10202 the implicit object parameter of the non-static function. The
10203 standard says to pretend that the static function has an object
10204 parm, but that won't work with operator overloading. */
10205 len
= cand1
->num_convs
;
10206 if (len
!= cand2
->num_convs
)
10208 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
10209 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
10211 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
10212 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
10213 /* We're comparing a near-match list constructor and a near-match
10214 non-list constructor. Just treat them as unordered. */
10217 gcc_assert (static_1
!= static_2
);
10228 for (i
= 0; i
< len
; ++i
)
10230 conversion
*t1
= cand1
->convs
[i
+ off1
];
10231 conversion
*t2
= cand2
->convs
[i
+ off2
];
10232 int comp
= compare_ics (t1
, t2
);
10236 if ((complain
& tf_warning
)
10238 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
10239 == cr_std
+ cr_promotion
)
10240 && t1
->kind
== ck_std
10241 && t2
->kind
== ck_std
10242 && TREE_CODE (t1
->type
) == INTEGER_TYPE
10243 && TREE_CODE (t2
->type
) == INTEGER_TYPE
10244 && (TYPE_PRECISION (t1
->type
)
10245 == TYPE_PRECISION (t2
->type
))
10246 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
10247 || (TREE_CODE (next_conversion (t1
)->type
)
10248 == ENUMERAL_TYPE
)))
10250 tree type
= next_conversion (t1
)->type
;
10252 struct z_candidate
*w
, *l
;
10254 type1
= t1
->type
, type2
= t2
->type
,
10255 w
= cand1
, l
= cand2
;
10257 type1
= t2
->type
, type2
= t1
->type
,
10258 w
= cand2
, l
= cand1
;
10262 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
10263 type
, type1
, type2
);
10264 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
10267 add_warning (w
, l
);
10270 if (winner
&& comp
!= winner
)
10279 /* warn about confusing overload resolution for user-defined conversions,
10280 either between a constructor and a conversion op, or between two
10282 if ((complain
& tf_warning
)
10283 && winner
&& warn_conversion
&& cand1
->second_conv
10284 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
10285 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
10287 struct z_candidate
*w
, *l
;
10288 bool give_warning
= false;
10291 w
= cand1
, l
= cand2
;
10293 w
= cand2
, l
= cand1
;
10295 /* We don't want to complain about `X::operator T1 ()'
10296 beating `X::operator T2 () const', when T2 is a no less
10297 cv-qualified version of T1. */
10298 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
10299 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
10301 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
10302 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
10304 if (TREE_CODE (t
) == TREE_CODE (f
) && INDIRECT_TYPE_P (t
))
10309 if (!comp_ptr_ttypes (t
, f
))
10310 give_warning
= true;
10313 give_warning
= true;
10319 tree source
= source_type (w
->convs
[0]);
10320 if (INDIRECT_TYPE_P (source
))
10321 source
= TREE_TYPE (source
);
10322 auto_diagnostic_group d
;
10323 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
10324 && warning (OPT_Wconversion
, " for conversion from %qH to %qI",
10325 source
, w
->second_conv
->type
))
10327 inform (input_location
, " because conversion sequence for the argument is better");
10331 add_warning (w
, l
);
10337 /* DR 495 moved this tiebreaker above the template ones. */
10338 /* or, if not that,
10339 the context is an initialization by user-defined conversion (see
10340 _dcl.init_ and _over.match.user_) and the standard conversion
10341 sequence from the return type of F1 to the destination type (i.e.,
10342 the type of the entity being initialized) is a better conversion
10343 sequence than the standard conversion sequence from the return type
10344 of F2 to the destination type. */
10346 if (cand1
->second_conv
)
10348 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
10353 /* or, if not that,
10354 F1 is a non-template function and F2 is a template function
10357 if (!cand1
->template_decl
&& cand2
->template_decl
)
10359 else if (cand1
->template_decl
&& !cand2
->template_decl
)
10362 /* or, if not that,
10363 F1 and F2 are template functions and the function template for F1 is
10364 more specialized than the template for F2 according to the partial
10367 if (cand1
->template_decl
&& cand2
->template_decl
)
10369 winner
= more_specialized_fn
10370 (TI_TEMPLATE (cand1
->template_decl
),
10371 TI_TEMPLATE (cand2
->template_decl
),
10372 /* [temp.func.order]: The presence of unused ellipsis and default
10373 arguments has no effect on the partial ordering of function
10374 templates. add_function_candidate() will not have
10375 counted the "this" argument for constructors. */
10376 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
10382 // or, if not that, F1 is more constrained than F2.
10383 if (flag_concepts
&& DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
))
10385 winner
= more_constrained (cand1
->fn
, cand2
->fn
);
10390 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
10391 if (deduction_guide_p (cand1
->fn
))
10393 gcc_assert (deduction_guide_p (cand2
->fn
));
10394 /* We distinguish between candidates from an explicit deduction guide and
10395 candidates built from a constructor based on DECL_ARTIFICIAL. */
10396 int art1
= DECL_ARTIFICIAL (cand1
->fn
);
10397 int art2
= DECL_ARTIFICIAL (cand2
->fn
);
10399 return art2
- art1
;
10403 /* Prefer the special copy guide over a declared copy/move
10405 if (copy_guide_p (cand1
->fn
))
10407 if (copy_guide_p (cand2
->fn
))
10410 /* Prefer a candidate generated from a non-template constructor. */
10411 int tg1
= template_guide_p (cand1
->fn
);
10412 int tg2
= template_guide_p (cand2
->fn
);
10418 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
10419 for all arguments the corresponding parameters of F1 and F2 have the same
10420 type (CWG 2273/2277). */
10421 if (DECL_P (cand1
->fn
) && DECL_CLASS_SCOPE_P (cand1
->fn
)
10422 && !DECL_CONV_FN_P (cand1
->fn
)
10423 && DECL_P (cand2
->fn
) && DECL_CLASS_SCOPE_P (cand2
->fn
)
10424 && !DECL_CONV_FN_P (cand2
->fn
))
10426 tree base1
= DECL_CONTEXT (strip_inheriting_ctors (cand1
->fn
));
10427 tree base2
= DECL_CONTEXT (strip_inheriting_ctors (cand2
->fn
));
10429 bool used1
= false;
10430 bool used2
= false;
10431 if (base1
== base2
)
10432 /* No difference. */;
10433 else if (DERIVED_FROM_P (base1
, base2
))
10435 else if (DERIVED_FROM_P (base2
, base1
))
10438 if (int diff
= used2
- used1
)
10440 for (i
= 0; i
< len
; ++i
)
10442 conversion
*t1
= cand1
->convs
[i
+ off1
];
10443 conversion
*t2
= cand2
->convs
[i
+ off2
];
10444 if (!same_type_p (t1
->type
, t2
->type
))
10452 /* Check whether we can discard a builtin candidate, either because we
10453 have two identical ones or matching builtin and non-builtin candidates.
10455 (Pedantically in the latter case the builtin which matched the user
10456 function should not be added to the overload set, but we spot it here.
10459 ... the builtin candidates include ...
10460 - do not have the same parameter type list as any non-template
10461 non-member candidate. */
10463 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
10465 for (i
= 0; i
< len
; ++i
)
10466 if (!same_type_p (cand1
->convs
[i
]->type
,
10467 cand2
->convs
[i
]->type
))
10469 if (i
== cand1
->num_convs
)
10471 if (cand1
->fn
== cand2
->fn
)
10472 /* Two built-in candidates; arbitrarily pick one. */
10474 else if (identifier_p (cand1
->fn
))
10475 /* cand1 is built-in; prefer cand2. */
10478 /* cand2 is built-in; prefer cand1. */
10483 /* For candidates of a multi-versioned function, make the version with
10484 the highest priority win. This version will be checked for dispatching
10485 first. If this version can be inlined into the caller, the front-end
10486 will simply make a direct call to this function. */
10488 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
10489 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
10490 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
10491 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
10493 tree f1
= TREE_TYPE (cand1
->fn
);
10494 tree f2
= TREE_TYPE (cand2
->fn
);
10495 tree p1
= TYPE_ARG_TYPES (f1
);
10496 tree p2
= TYPE_ARG_TYPES (f2
);
10498 /* Check if cand1->fn and cand2->fn are versions of the same function. It
10499 is possible that cand1->fn and cand2->fn are function versions but of
10500 different functions. Check types to see if they are versions of the same
10502 if (compparms (p1
, p2
)
10503 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
10505 /* Always make the version with the higher priority, more
10506 specialized, win. */
10507 gcc_assert (targetm
.compare_version_priority
);
10508 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
10515 /* If the two function declarations represent the same function (this can
10516 happen with declarations in multiple scopes and arg-dependent lookup),
10517 arbitrarily choose one. But first make sure the default args we're
10519 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
10520 && equal_functions (cand1
->fn
, cand2
->fn
))
10522 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
10523 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
10525 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
10527 for (i
= 0; i
< len
; ++i
)
10529 /* Don't crash if the fn is variadic. */
10532 parms1
= TREE_CHAIN (parms1
);
10533 parms2
= TREE_CHAIN (parms2
);
10537 parms1
= TREE_CHAIN (parms1
);
10539 parms2
= TREE_CHAIN (parms2
);
10541 for (; parms1
; ++i
)
10543 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
10544 TREE_PURPOSE (parms2
)))
10548 if (complain
& tf_error
)
10550 auto_diagnostic_group d
;
10551 if (permerror (input_location
,
10552 "default argument mismatch in "
10553 "overload resolution"))
10555 inform (DECL_SOURCE_LOCATION (cand1
->fn
),
10556 " candidate 1: %q#F", cand1
->fn
);
10557 inform (DECL_SOURCE_LOCATION (cand2
->fn
),
10558 " candidate 2: %q#F", cand2
->fn
);
10565 add_warning (cand1
, cand2
);
10568 parms1
= TREE_CHAIN (parms1
);
10569 parms2
= TREE_CHAIN (parms2
);
10577 /* Extension: If the worst conversion for one candidate is worse than the
10578 worst conversion for the other, take the first. */
10579 if (!pedantic
&& (complain
& tf_warning_or_error
))
10581 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
10582 struct z_candidate
*w
= 0, *l
= 0;
10584 for (i
= 0; i
< len
; ++i
)
10586 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
10587 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
10588 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
10589 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
10592 winner
= 1, w
= cand1
, l
= cand2
;
10594 winner
= -1, w
= cand2
, l
= cand1
;
10597 /* Don't choose a deleted function over ambiguity. */
10598 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
10602 auto_diagnostic_group d
;
10603 pedwarn (input_location
, 0,
10604 "ISO C++ says that these are ambiguous, even "
10605 "though the worst conversion for the first is better than "
10606 "the worst conversion for the second:");
10607 print_z_candidate (input_location
, _("candidate 1:"), w
);
10608 print_z_candidate (input_location
, _("candidate 2:"), l
);
10611 add_warning (w
, l
);
10616 gcc_assert (!winner
);
10620 /* Given a list of candidates for overloading, find the best one, if any.
10621 This algorithm has a worst case of O(2n) (winner is last), and a best
10622 case of O(n/2) (totally ambiguous); much better than a sorting
10625 static struct z_candidate
*
10626 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
10628 struct z_candidate
*champ
= candidates
, *challenger
;
10630 int champ_compared_to_predecessor
= 0;
10632 /* Walk through the list once, comparing each current champ to the next
10633 candidate, knocking out a candidate or two with each comparison. */
10635 for (challenger
= champ
->next
; challenger
; )
10637 fate
= joust (champ
, challenger
, 0, complain
);
10639 challenger
= challenger
->next
;
10644 champ
= challenger
->next
;
10647 champ_compared_to_predecessor
= 0;
10651 champ
= challenger
;
10652 champ_compared_to_predecessor
= 1;
10655 challenger
= champ
->next
;
10659 /* Make sure the champ is better than all the candidates it hasn't yet
10660 been compared to. */
10662 for (challenger
= candidates
;
10663 challenger
!= champ
10664 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
10665 challenger
= challenger
->next
)
10667 fate
= joust (champ
, challenger
, 0, complain
);
10675 /* Returns nonzero if things of type FROM can be converted to TO. */
10678 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
10680 tree arg
= NULL_TREE
;
10681 /* implicit_conversion only considers user-defined conversions
10682 if it has an expression for the call argument list. */
10683 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
10684 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
10685 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
10688 /* Returns nonzero if things of type FROM can be converted to TO with a
10689 standard conversion. */
10692 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
10694 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
10697 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
10700 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
10701 tsubst_flags_t complain
)
10707 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10708 p
= conversion_obstack_alloc (0);
10709 /* We want to discard any access checks done for this test,
10710 as we might not be in the appropriate access context and
10711 we'll do the check again when we actually perform the
10713 push_deferring_access_checks (dk_deferred
);
10715 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10717 ok_p
= (t
&& !t
->bad_p
);
10719 /* Discard the access checks now. */
10720 pop_deferring_access_checks ();
10721 /* Free all the conversions we allocated. */
10722 obstack_free (&conversion_obstack
, p
);
10727 /* Like can_convert_arg, but allows dubious conversions as well. */
10730 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
10731 tsubst_flags_t complain
)
10736 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10737 p
= conversion_obstack_alloc (0);
10738 /* Try to perform the conversion. */
10739 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10741 /* Free all the conversions we allocated. */
10742 obstack_free (&conversion_obstack
, p
);
10747 /* Convert EXPR to TYPE. Return the converted expression.
10749 Note that we allow bad conversions here because by the time we get to
10750 this point we are committed to doing the conversion. If we end up
10751 doing a bad conversion, convert_like will complain. */
10754 perform_implicit_conversion_flags (tree type
, tree expr
,
10755 tsubst_flags_t complain
, int flags
)
10759 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
10761 if (TYPE_REF_P (type
))
10762 expr
= mark_lvalue_use (expr
);
10764 expr
= mark_rvalue_use (expr
);
10766 if (error_operand_p (expr
))
10767 return error_mark_node
;
10769 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10770 p
= conversion_obstack_alloc (0);
10772 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
10773 /*c_cast_p=*/false,
10778 if (complain
& tf_error
)
10780 /* If expr has unknown type, then it is an overloaded function.
10781 Call instantiate_type to get good error messages. */
10782 if (TREE_TYPE (expr
) == unknown_type_node
)
10783 instantiate_type (type
, expr
, complain
);
10784 else if (invalid_nonstatic_memfn_p (loc
, expr
, complain
))
10785 /* We gave an error. */;
10788 range_label_for_type_mismatch
label (TREE_TYPE (expr
), type
);
10789 gcc_rich_location
rich_loc (loc
, &label
);
10790 error_at (&rich_loc
, "could not convert %qE from %qH to %qI",
10791 expr
, TREE_TYPE (expr
), type
);
10794 expr
= error_mark_node
;
10796 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
10798 /* In a template, we are only concerned about determining the
10799 type of non-dependent expressions, so we do not have to
10800 perform the actual conversion. But for initializers, we
10801 need to be able to perform it at instantiation
10802 (or instantiate_non_dependent_expr) time. */
10803 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
10804 if (!(flags
& LOOKUP_ONLYCONVERTING
))
10805 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
10808 expr
= convert_like (conv
, expr
, complain
);
10810 /* Free all the conversions we allocated. */
10811 obstack_free (&conversion_obstack
, p
);
10817 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
10819 return perform_implicit_conversion_flags (type
, expr
, complain
,
10823 /* Convert EXPR to TYPE (as a direct-initialization) if that is
10824 permitted. If the conversion is valid, the converted expression is
10825 returned. Otherwise, NULL_TREE is returned, except in the case
10826 that TYPE is a class type; in that case, an error is issued. If
10827 C_CAST_P is true, then this direct-initialization is taking
10828 place as part of a static_cast being attempted as part of a C-style
10832 perform_direct_initialization_if_possible (tree type
,
10835 tsubst_flags_t complain
)
10840 if (type
== error_mark_node
|| error_operand_p (expr
))
10841 return error_mark_node
;
10844 If the destination type is a (possibly cv-qualified) class type:
10846 -- If the initialization is direct-initialization ...,
10847 constructors are considered. ... If no constructor applies, or
10848 the overload resolution is ambiguous, the initialization is
10850 if (CLASS_TYPE_P (type
))
10852 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
10853 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
10854 &args
, type
, LOOKUP_NORMAL
, complain
);
10855 release_tree_vector (args
);
10856 return build_cplus_new (type
, expr
, complain
);
10859 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10860 p
= conversion_obstack_alloc (0);
10862 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
10864 LOOKUP_NORMAL
, complain
);
10865 if (!conv
|| conv
->bad_p
)
10867 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
10869 /* In a template, we are only concerned about determining the
10870 type of non-dependent expressions, so we do not have to
10871 perform the actual conversion. But for initializers, we
10872 need to be able to perform it at instantiation
10873 (or instantiate_non_dependent_expr) time. */
10874 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
10875 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
10878 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0,
10879 /*issue_conversion_warnings=*/false,
10883 /* Free all the conversions we allocated. */
10884 obstack_free (&conversion_obstack
, p
);
10889 /* When initializing a reference that lasts longer than a full-expression,
10890 this special rule applies:
10894 The temporary to which the reference is bound or the temporary
10895 that is the complete object to which the reference is bound
10896 persists for the lifetime of the reference.
10898 The temporaries created during the evaluation of the expression
10899 initializing the reference, except the temporary to which the
10900 reference is bound, are destroyed at the end of the
10901 full-expression in which they are created.
10903 In that case, we store the converted expression into a new
10904 VAR_DECL in a new scope.
10906 However, we want to be careful not to create temporaries when
10907 they are not required. For example, given:
10910 struct D : public B {};
10914 there is no need to copy the return value from "f"; we can just
10915 extend its lifetime. Similarly, given:
10918 struct T { operator S(); };
10922 we can extend the lifetime of the return value of the conversion
10925 The next several functions are involved in this lifetime extension. */
10927 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
10928 reference is being bound to a temporary. Create and return a new
10929 VAR_DECL with the indicated TYPE; this variable will store the value to
10930 which the reference is bound. */
10933 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
10935 tree var
= create_temporary_var (type
);
10937 /* Register the variable. */
10939 && (TREE_STATIC (decl
) || CP_DECL_THREAD_LOCAL_P (decl
)))
10941 /* Namespace-scope or local static; give it a mangled name. */
10942 /* FIXME share comdat with decl? */
10944 TREE_STATIC (var
) = TREE_STATIC (decl
);
10945 CP_DECL_THREAD_LOCAL_P (var
) = CP_DECL_THREAD_LOCAL_P (decl
);
10946 set_decl_tls_model (var
, DECL_TLS_MODEL (decl
));
10948 tree name
= mangle_ref_init_variable (decl
);
10949 DECL_NAME (var
) = name
;
10950 SET_DECL_ASSEMBLER_NAME (var
, name
);
10952 var
= pushdecl (var
);
10955 /* Create a new cleanup level if necessary. */
10956 maybe_push_cleanup_level (type
);
10961 /* EXPR is the initializer for a variable DECL of reference or
10962 std::initializer_list type. Create, push and return a new VAR_DECL
10963 for the initializer so that it will live as long as DECL. Any
10964 cleanup for the new variable is returned through CLEANUP, and the
10965 code to initialize the new variable is returned through INITP. */
10968 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
10975 /* Create the temporary variable. */
10976 type
= TREE_TYPE (expr
);
10977 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
10978 layout_decl (var
, 0);
10979 /* If the rvalue is the result of a function call it will be
10980 a TARGET_EXPR. If it is some other construct (such as a
10981 member access expression where the underlying object is
10982 itself the result of a function call), turn it into a
10983 TARGET_EXPR here. It is important that EXPR be a
10984 TARGET_EXPR below since otherwise the INIT_EXPR will
10985 attempt to make a bitwise copy of EXPR to initialize
10987 if (TREE_CODE (expr
) != TARGET_EXPR
)
10988 expr
= get_target_expr (expr
);
10990 if (TREE_CODE (decl
) == FIELD_DECL
10991 && extra_warnings
&& !TREE_NO_WARNING (decl
))
10993 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
10994 "until the constructor exits", decl
);
10995 TREE_NO_WARNING (decl
) = true;
10998 /* Recursively extend temps in this initializer. */
10999 TARGET_EXPR_INITIAL (expr
)
11000 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
11002 /* Any reference temp has a non-trivial initializer. */
11003 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
11005 /* If the initializer is constant, put it in DECL_INITIAL so we get
11006 static initialization and use in constant expressions. */
11007 init
= maybe_constant_init (expr
);
11008 /* As in store_init_value. */
11009 init
= cp_fully_fold (init
);
11010 if (TREE_CONSTANT (init
))
11012 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
11014 /* 5.19 says that a constant expression can include an
11015 lvalue-rvalue conversion applied to "a glvalue of literal type
11016 that refers to a non-volatile temporary object initialized
11017 with a constant expression". Rather than try to communicate
11018 that this VAR_DECL is a temporary, just mark it constexpr. */
11019 DECL_DECLARED_CONSTEXPR_P (var
) = true;
11020 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
11021 TREE_CONSTANT (var
) = true;
11022 TREE_READONLY (var
) = true;
11024 DECL_INITIAL (var
) = init
;
11028 /* Create the INIT_EXPR that will initialize the temporary
11030 init
= split_nonconstant_init (var
, expr
);
11031 if (at_function_scope_p ())
11033 add_decl_expr (var
);
11035 if (TREE_STATIC (var
))
11036 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
11039 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
11041 vec_safe_push (*cleanups
, cleanup
);
11044 /* We must be careful to destroy the temporary only
11045 after its initialization has taken place. If the
11046 initialization throws an exception, then the
11047 destructor should not be run. We cannot simply
11048 transform INIT into something like:
11050 (INIT, ({ CLEANUP_STMT; }))
11052 because emit_local_var always treats the
11053 initializer as a full-expression. Thus, the
11054 destructor would run too early; it would run at the
11055 end of initializing the reference variable, rather
11056 than at the end of the block enclosing the
11057 reference variable.
11059 The solution is to pass back a cleanup expression
11060 which the caller is responsible for attaching to
11061 the statement tree. */
11065 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
11066 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
11068 if (CP_DECL_THREAD_LOCAL_P (var
))
11069 tls_aggregates
= tree_cons (NULL_TREE
, var
,
11072 static_aggregates
= tree_cons (NULL_TREE
, var
,
11073 static_aggregates
);
11076 /* Check whether the dtor is callable. */
11077 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
11079 /* Avoid -Wunused-variable warning (c++/38958). */
11080 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
11082 TREE_USED (decl
) = DECL_READ_P (decl
) = true;
11088 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
11089 initializing a variable of that TYPE. */
11092 initialize_reference (tree type
, tree expr
,
11093 int flags
, tsubst_flags_t complain
)
11097 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
11099 if (type
== error_mark_node
|| error_operand_p (expr
))
11100 return error_mark_node
;
11102 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11103 p
= conversion_obstack_alloc (0);
11105 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
11107 if (!conv
|| conv
->bad_p
)
11109 if (complain
& tf_error
)
11112 convert_like (conv
, expr
, complain
);
11113 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
11114 && !TYPE_REF_IS_RVALUE (type
)
11115 && !lvalue_p (expr
))
11116 error_at (loc
, "invalid initialization of non-const reference of "
11117 "type %qH from an rvalue of type %qI",
11118 type
, TREE_TYPE (expr
));
11120 error_at (loc
, "invalid initialization of reference of type "
11121 "%qH from expression of type %qI", type
,
11124 return error_mark_node
;
11127 if (conv
->kind
== ck_ref_bind
)
11128 /* Perform the conversion. */
11129 expr
= convert_like (conv
, expr
, complain
);
11130 else if (conv
->kind
== ck_ambig
)
11131 /* We gave an error in build_user_type_conversion_1. */
11132 expr
= error_mark_node
;
11134 gcc_unreachable ();
11136 /* Free all the conversions we allocated. */
11137 obstack_free (&conversion_obstack
, p
);
11142 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
11143 which is bound either to a reference or a std::initializer_list. */
11146 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
11151 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
11153 TREE_OPERAND (sub
, 1)
11154 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
11157 if (TREE_CODE (sub
) != ADDR_EXPR
)
11159 /* Deal with binding to a subobject. */
11160 for (p
= &TREE_OPERAND (sub
, 0);
11161 (TREE_CODE (*p
) == COMPONENT_REF
11162 || TREE_CODE (*p
) == ARRAY_REF
); )
11163 p
= &TREE_OPERAND (*p
, 0);
11164 if (TREE_CODE (*p
) == TARGET_EXPR
)
11166 tree subinit
= NULL_TREE
;
11167 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
11168 recompute_tree_invariant_for_addr_expr (sub
);
11170 init
= fold_convert (TREE_TYPE (init
), sub
);
11172 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
11177 /* INIT is part of the initializer for DECL. If there are any
11178 reference or initializer lists being initialized, extend their
11179 lifetime to match that of DECL. */
11182 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
11184 tree type
= TREE_TYPE (init
);
11185 if (processing_template_decl
)
11187 if (TYPE_REF_P (type
))
11188 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
11192 if (TREE_CODE (ctor
) == TARGET_EXPR
)
11193 ctor
= TARGET_EXPR_INITIAL (ctor
);
11194 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
11196 if (is_std_init_list (type
))
11198 /* The temporary array underlying a std::initializer_list
11199 is handled like a reference temporary. */
11200 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
11201 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
11202 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
11207 constructor_elt
*p
;
11208 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (ctor
);
11209 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
11210 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
11212 recompute_constructor_flags (ctor
);
11213 if (decl_maybe_constant_var_p (decl
) && TREE_CONSTANT (ctor
))
11214 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
11221 /* Returns true iff an initializer for TYPE could contain temporaries that
11222 need to be extended because they are bound to references or
11223 std::initializer_list. */
11226 type_has_extended_temps (tree type
)
11228 type
= strip_array_types (type
);
11229 if (TYPE_REF_P (type
))
11231 if (CLASS_TYPE_P (type
))
11233 if (is_std_init_list (type
))
11235 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
11236 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
11237 if (type_has_extended_temps (TREE_TYPE (f
)))
11243 /* Returns true iff TYPE is some variant of std::initializer_list. */
11246 is_std_init_list (tree type
)
11248 if (!TYPE_P (type
))
11250 if (cxx_dialect
== cxx98
)
11252 /* Look through typedefs. */
11253 type
= TYPE_MAIN_VARIANT (type
);
11254 return (CLASS_TYPE_P (type
)
11255 && CP_TYPE_CONTEXT (type
) == std_node
11256 && init_list_identifier
== DECL_NAME (TYPE_NAME (type
)));
11259 /* Returns true iff DECL is a list constructor: i.e. a constructor which
11260 will accept an argument list of a single std::initializer_list<T>. */
11263 is_list_ctor (tree decl
)
11265 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
11268 if (!args
|| args
== void_list_node
)
11271 arg
= non_reference (TREE_VALUE (args
));
11272 if (!is_std_init_list (arg
))
11275 args
= TREE_CHAIN (args
);
11277 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
11278 /* There are more non-defaulted parms. */
11284 #include "gt-cp-call.h"