1 /* Functions related to invoking -*- C++ -*- methods and overloaded functions.
2 Copyright (C) 1987-2018 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com) and
4 modified by Brendan Kehoe (brendan@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* High-level class interface. */
27 #include "coretypes.h"
31 #include "stringpool.h"
33 #include "stor-layout.h"
34 #include "trans-mem.h"
39 #include "langhooks.h"
40 #include "c-family/c-objc.h"
41 #include "internal-fn.h"
42 #include "stringpool.h"
45 /* The various kinds of conversion. */
47 enum conversion_kind
{
64 /* The rank of the conversion. Order of the enumerals matters; better
65 conversions should come earlier in the list. */
67 enum conversion_rank
{
78 /* An implicit conversion sequence, in the sense of [over.best.ics].
79 The first conversion to be performed is at the end of the chain.
80 That conversion is always a cr_identity conversion. */
83 /* The kind of conversion represented by this step. */
85 /* The rank of this conversion. */
87 BOOL_BITFIELD user_conv_p
: 1;
88 BOOL_BITFIELD ellipsis_p
: 1;
89 BOOL_BITFIELD this_p
: 1;
90 /* True if this conversion would be permitted with a bending of
91 language standards, e.g. disregarding pointer qualifiers or
92 converting integers to pointers. */
93 BOOL_BITFIELD bad_p
: 1;
94 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
95 temporary should be created to hold the result of the
96 conversion. If KIND is ck_ambig, true if the context is
97 copy-initialization. */
98 BOOL_BITFIELD need_temporary_p
: 1;
99 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
100 from a pointer-to-derived to pointer-to-base is being performed. */
101 BOOL_BITFIELD base_p
: 1;
102 /* If KIND is ck_ref_bind, true when either an lvalue reference is
103 being bound to an lvalue expression or an rvalue reference is
104 being bound to an rvalue expression. If KIND is ck_rvalue,
105 true when we are treating an lvalue as an rvalue (12.8p33). If
106 KIND is ck_base, always false. If ck_identity, we will be
107 binding a reference directly or decaying to a pointer. */
108 BOOL_BITFIELD rvaluedness_matches_p
: 1;
109 BOOL_BITFIELD check_narrowing
: 1;
110 /* Whether check_narrowing should only check TREE_CONSTANTs; used
111 in build_converted_constant_expr. */
112 BOOL_BITFIELD check_narrowing_const_only
: 1;
113 /* The type of the expression resulting from the conversion. */
116 /* The next conversion in the chain. Since the conversions are
117 arranged from outermost to innermost, the NEXT conversion will
118 actually be performed before this conversion. This variant is
119 used only when KIND is neither ck_identity, ck_ambig nor
120 ck_list. Please use the next_conversion function instead
121 of using this field directly. */
123 /* The expression at the beginning of the conversion chain. This
124 variant is used only if KIND is ck_identity or ck_ambig. */
126 /* The array of conversions for an initializer_list, so this
127 variant is used only when KIN D is ck_list. */
130 /* The function candidate corresponding to this conversion
131 sequence. This field is only used if KIND is ck_user. */
132 struct z_candidate
*cand
;
135 #define CONVERSION_RANK(NODE) \
136 ((NODE)->bad_p ? cr_bad \
137 : (NODE)->ellipsis_p ? cr_ellipsis \
138 : (NODE)->user_conv_p ? cr_user \
141 #define BAD_CONVERSION_RANK(NODE) \
142 ((NODE)->ellipsis_p ? cr_ellipsis \
143 : (NODE)->user_conv_p ? cr_user \
146 static struct obstack conversion_obstack
;
147 static bool conversion_obstack_initialized
;
148 struct rejection_reason
;
150 static struct z_candidate
* tourney (struct z_candidate
*, tsubst_flags_t
);
151 static int equal_functions (tree
, tree
);
152 static int joust (struct z_candidate
*, struct z_candidate
*, bool,
154 static int compare_ics (conversion
*, conversion
*);
155 static void maybe_warn_class_memaccess (location_t
, tree
,
156 const vec
<tree
, va_gc
> *);
157 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
158 #define convert_like(CONV, EXPR, COMPLAIN) \
159 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, \
160 /*issue_conversion_warnings=*/true, \
161 /*c_cast_p=*/false, (COMPLAIN))
162 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
163 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), \
164 /*issue_conversion_warnings=*/true, \
165 /*c_cast_p=*/false, (COMPLAIN))
166 static tree
convert_like_real (conversion
*, tree
, tree
, int, bool,
167 bool, tsubst_flags_t
);
168 static void op_error (location_t
, enum tree_code
, enum tree_code
, tree
,
170 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int,
172 static void print_z_candidate (location_t
, const char *, struct z_candidate
*);
173 static void print_z_candidates (location_t
, struct z_candidate
*);
174 static tree
build_this (tree
);
175 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
176 static bool any_strictly_viable (struct z_candidate
*);
177 static struct z_candidate
*add_template_candidate
178 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
179 tree
, tree
, tree
, int, unification_kind_t
, tsubst_flags_t
);
180 static struct z_candidate
*add_template_candidate_real
181 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
182 tree
, tree
, tree
, int, tree
, unification_kind_t
, tsubst_flags_t
);
183 static void add_builtin_candidates
184 (struct z_candidate
**, enum tree_code
, enum tree_code
,
185 tree
, tree
*, int, tsubst_flags_t
);
186 static void add_builtin_candidate
187 (struct z_candidate
**, enum tree_code
, enum tree_code
,
188 tree
, tree
, tree
, tree
*, tree
*, int, tsubst_flags_t
);
189 static bool is_complete (tree
);
190 static void build_builtin_candidate
191 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
192 int, tsubst_flags_t
);
193 static struct z_candidate
*add_conv_candidate
194 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
195 tree
, tsubst_flags_t
);
196 static struct z_candidate
*add_function_candidate
197 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
198 tree
, int, conversion
**, tsubst_flags_t
);
199 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int,
201 static conversion
*reference_binding (tree
, tree
, tree
, bool, int,
203 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
204 static conversion
*build_list_conv (tree
, tree
, int, tsubst_flags_t
);
205 static conversion
*next_conversion (conversion
*);
206 static bool is_subseq (conversion
*, conversion
*);
207 static conversion
*maybe_handle_ref_bind (conversion
**);
208 static void maybe_handle_implicit_object (conversion
**);
209 static struct z_candidate
*add_candidate
210 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, size_t,
211 conversion
**, tree
, tree
, int, struct rejection_reason
*, int);
212 static tree
source_type (conversion
*);
213 static void add_warning (struct z_candidate
*, struct z_candidate
*);
214 static bool reference_compatible_p (tree
, tree
);
215 static conversion
*direct_reference_binding (tree
, conversion
*);
216 static bool promoted_arithmetic_type_p (tree
);
217 static conversion
*conditional_conversion (tree
, tree
, tsubst_flags_t
);
218 static char *name_as_c_string (tree
, tree
, bool *);
219 static tree
prep_operand (tree
);
220 static void add_candidates (tree
, tree
, const vec
<tree
, va_gc
> *, tree
, tree
,
221 bool, tree
, tree
, int, struct z_candidate
**,
223 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
224 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
226 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
227 NAME can take many forms... */
230 check_dtor_name (tree basetype
, tree name
)
232 /* Just accept something we've already complained about. */
233 if (name
== error_mark_node
)
236 if (TREE_CODE (name
) == TYPE_DECL
)
237 name
= TREE_TYPE (name
);
238 else if (TYPE_P (name
))
240 else if (identifier_p (name
))
242 if ((MAYBE_CLASS_TYPE_P (basetype
)
243 || TREE_CODE (basetype
) == ENUMERAL_TYPE
)
244 && name
== constructor_name (basetype
))
247 name
= get_type_value (name
);
253 template <class T> struct S { ~S(); };
257 NAME will be a class template. */
258 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
262 if (!name
|| name
== error_mark_node
)
264 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
267 /* We want the address of a function or method. We avoid creating a
268 pointer-to-member function. */
271 build_addr_func (tree function
, tsubst_flags_t complain
)
273 tree type
= TREE_TYPE (function
);
275 /* We have to do these by hand to avoid real pointer to member
277 if (TREE_CODE (type
) == METHOD_TYPE
)
279 if (TREE_CODE (function
) == OFFSET_REF
)
281 tree object
= build_address (TREE_OPERAND (function
, 0));
282 return get_member_function_from_ptrfunc (&object
,
283 TREE_OPERAND (function
, 1),
286 function
= build_address (function
);
289 function
= decay_conversion (function
, complain
, /*reject_builtin=*/false);
294 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
295 POINTER_TYPE to those. Note, pointer to member function types
296 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
297 two variants. build_call_a is the primitive taking an array of
298 arguments, while build_call_n is a wrapper that handles varargs. */
301 build_call_n (tree function
, int n
, ...)
304 return build_call_a (function
, 0, NULL
);
307 tree
*argarray
= XALLOCAVEC (tree
, n
);
312 for (i
= 0; i
< n
; i
++)
313 argarray
[i
] = va_arg (ap
, tree
);
315 return build_call_a (function
, n
, argarray
);
319 /* Update various flags in cfun and the call itself based on what is being
320 called. Split out of build_call_a so that bot_manip can use it too. */
323 set_flags_from_callee (tree call
)
325 /* Handle both CALL_EXPRs and AGGR_INIT_EXPRs. */
326 tree decl
= cp_get_callee_fndecl_nofold (call
);
328 /* We check both the decl and the type; a function may be known not to
329 throw without being declared throw(). */
330 bool nothrow
= decl
&& TREE_NOTHROW (decl
);
331 tree callee
= cp_get_callee (call
);
333 nothrow
|= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (callee
)));
334 else if (TREE_CODE (call
) == CALL_EXPR
335 && internal_fn_flags (CALL_EXPR_IFN (call
)) & ECF_NOTHROW
)
338 if (!nothrow
&& at_function_scope_p () && cfun
&& cp_function_chain
)
339 cp_function_chain
->can_throw
= 1;
341 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
342 current_function_returns_abnormally
= 1;
344 TREE_NOTHROW (call
) = nothrow
;
348 build_call_a (tree function
, int n
, tree
*argarray
)
355 function
= build_addr_func (function
, tf_warning_or_error
);
357 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
358 fntype
= TREE_TYPE (TREE_TYPE (function
));
359 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
360 || TREE_CODE (fntype
) == METHOD_TYPE
);
361 result_type
= TREE_TYPE (fntype
);
362 /* An rvalue has no cv-qualifiers. */
363 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
364 result_type
= cv_unqualified (result_type
);
366 function
= build_call_array_loc (input_location
,
367 result_type
, function
, n
, argarray
);
368 set_flags_from_callee (function
);
370 decl
= get_callee_fndecl (function
);
372 if (decl
&& !TREE_USED (decl
))
374 /* We invoke build_call directly for several library
375 functions. These may have been declared normally if
376 we're building libgcc, so we can't just check
378 gcc_assert (DECL_ARTIFICIAL (decl
)
379 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
384 require_complete_eh_spec_types (fntype
, decl
);
386 TREE_HAS_CONSTRUCTOR (function
) = (decl
&& DECL_CONSTRUCTOR_P (decl
));
388 /* Don't pass empty class objects by value. This is useful
389 for tags in STL, which are used to control overload resolution.
390 We don't need to handle other cases of copying empty classes. */
391 if (! decl
|| ! DECL_BUILT_IN (decl
))
392 for (i
= 0; i
< n
; i
++)
394 tree arg
= CALL_EXPR_ARG (function
, i
);
395 if (is_empty_class (TREE_TYPE (arg
))
396 && ! TREE_ADDRESSABLE (TREE_TYPE (arg
)))
398 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (arg
));
399 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (t
), arg
, t
);
400 CALL_EXPR_ARG (function
, i
) = arg
;
407 /* New overloading code. */
411 struct candidate_warning
{
413 candidate_warning
*next
;
416 /* Information for providing diagnostics about why overloading failed. */
418 enum rejection_reason_code
{
421 rr_explicit_conversion
,
422 rr_template_conversion
,
424 rr_bad_arg_conversion
,
425 rr_template_unification
,
428 rr_constraint_failure
431 struct conversion_info
{
432 /* The index of the argument, 0-based. */
434 /* The actual argument or its type. */
436 /* The type of the parameter. */
440 struct rejection_reason
{
441 enum rejection_reason_code code
;
443 /* Information about an arity mismatch. */
445 /* The expected number of arguments. */
447 /* The actual number of arguments in the call. */
449 /* Whether the call was a varargs call. */
452 /* Information about an argument conversion mismatch. */
453 struct conversion_info conversion
;
454 /* Same, but for bad argument conversions. */
455 struct conversion_info bad_conversion
;
456 /* Information about template unification failures. These are the
457 parameters passed to fn_type_unification. */
465 unification_kind_t strict
;
467 } template_unification
;
468 /* Information about template instantiation failures. These are the
469 parameters passed to instantiate_template. */
473 } template_instantiation
;
478 /* The FUNCTION_DECL that will be called if this candidate is
479 selected by overload resolution. */
481 /* If not NULL_TREE, the first argument to use when calling this
484 /* The rest of the arguments to use when calling this function. If
485 there are no further arguments this may be NULL or it may be an
487 const vec
<tree
, va_gc
> *args
;
488 /* The implicit conversion sequences for each of the arguments to
491 /* The number of implicit conversion sequences. */
493 /* If FN is a user-defined conversion, the standard conversion
494 sequence from the type returned by FN to the desired destination
496 conversion
*second_conv
;
497 struct rejection_reason
*reason
;
498 /* If FN is a member function, the binfo indicating the path used to
499 qualify the name of FN at the call site. This path is used to
500 determine whether or not FN is accessible if it is selected by
501 overload resolution. The DECL_CONTEXT of FN will always be a
502 (possibly improper) base of this binfo. */
504 /* If FN is a non-static member function, the binfo indicating the
505 subobject to which the `this' pointer should be converted if FN
506 is selected by overload resolution. The type pointed to by
507 the `this' pointer must correspond to the most derived class
508 indicated by the CONVERSION_PATH. */
509 tree conversion_path
;
512 candidate_warning
*warnings
;
516 /* The flags active in add_candidate. */
520 /* Returns true iff T is a null pointer constant in the sense of
524 null_ptr_cst_p (tree t
)
526 tree type
= TREE_TYPE (t
);
530 A null pointer constant is an integral constant expression
531 (_expr.const_) rvalue of integer type that evaluates to zero or
532 an rvalue of type std::nullptr_t. */
533 if (NULLPTR_TYPE_P (type
))
536 if (cxx_dialect
>= cxx11
)
538 STRIP_ANY_LOCATION_WRAPPER (t
);
540 /* Core issue 903 says only literal 0 is a null pointer constant. */
541 if (TREE_CODE (type
) == INTEGER_TYPE
542 && !char_type_p (type
)
543 && TREE_CODE (t
) == INTEGER_CST
545 && !TREE_OVERFLOW (t
))
548 else if (CP_INTEGRAL_TYPE_P (type
))
550 t
= fold_non_dependent_expr (t
, tf_none
);
552 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
559 /* Returns true iff T is a null member pointer value (4.11). */
562 null_member_pointer_value_p (tree t
)
564 tree type
= TREE_TYPE (t
);
567 else if (TYPE_PTRMEMFUNC_P (type
))
568 return (TREE_CODE (t
) == CONSTRUCTOR
569 && integer_zerop (CONSTRUCTOR_ELT (t
, 0)->value
));
570 else if (TYPE_PTRDATAMEM_P (type
))
571 return integer_all_onesp (t
);
576 /* Returns nonzero if PARMLIST consists of only default parms,
577 ellipsis, and/or undeduced parameter packs. */
580 sufficient_parms_p (const_tree parmlist
)
582 for (; parmlist
&& parmlist
!= void_list_node
;
583 parmlist
= TREE_CHAIN (parmlist
))
584 if (!TREE_PURPOSE (parmlist
)
585 && !PACK_EXPANSION_P (TREE_VALUE (parmlist
)))
590 /* Allocate N bytes of memory from the conversion obstack. The memory
591 is zeroed before being returned. */
594 conversion_obstack_alloc (size_t n
)
597 if (!conversion_obstack_initialized
)
599 gcc_obstack_init (&conversion_obstack
);
600 conversion_obstack_initialized
= true;
602 p
= obstack_alloc (&conversion_obstack
, n
);
607 /* Allocate rejection reasons. */
609 static struct rejection_reason
*
610 alloc_rejection (enum rejection_reason_code code
)
612 struct rejection_reason
*p
;
613 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
618 static struct rejection_reason
*
619 arity_rejection (tree first_arg
, int expected
, int actual
)
621 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
622 int adjust
= first_arg
!= NULL_TREE
;
623 r
->u
.arity
.expected
= expected
- adjust
;
624 r
->u
.arity
.actual
= actual
- adjust
;
628 static struct rejection_reason
*
629 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
631 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
632 int adjust
= first_arg
!= NULL_TREE
;
633 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
634 r
->u
.conversion
.from
= from
;
635 r
->u
.conversion
.to_type
= to
;
639 static struct rejection_reason
*
640 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
642 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
643 int adjust
= first_arg
!= NULL_TREE
;
644 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
645 r
->u
.bad_conversion
.from
= from
;
646 r
->u
.bad_conversion
.to_type
= to
;
650 static struct rejection_reason
*
651 explicit_conversion_rejection (tree from
, tree to
)
653 struct rejection_reason
*r
= alloc_rejection (rr_explicit_conversion
);
654 r
->u
.conversion
.n_arg
= 0;
655 r
->u
.conversion
.from
= from
;
656 r
->u
.conversion
.to_type
= to
;
660 static struct rejection_reason
*
661 template_conversion_rejection (tree from
, tree to
)
663 struct rejection_reason
*r
= alloc_rejection (rr_template_conversion
);
664 r
->u
.conversion
.n_arg
= 0;
665 r
->u
.conversion
.from
= from
;
666 r
->u
.conversion
.to_type
= to
;
670 static struct rejection_reason
*
671 template_unification_rejection (tree tmpl
, tree explicit_targs
, tree targs
,
672 const tree
*args
, unsigned int nargs
,
673 tree return_type
, unification_kind_t strict
,
676 size_t args_n_bytes
= sizeof (*args
) * nargs
;
677 tree
*args1
= (tree
*) conversion_obstack_alloc (args_n_bytes
);
678 struct rejection_reason
*r
= alloc_rejection (rr_template_unification
);
679 r
->u
.template_unification
.tmpl
= tmpl
;
680 r
->u
.template_unification
.explicit_targs
= explicit_targs
;
681 r
->u
.template_unification
.num_targs
= TREE_VEC_LENGTH (targs
);
682 /* Copy args to our own storage. */
683 memcpy (args1
, args
, args_n_bytes
);
684 r
->u
.template_unification
.args
= args1
;
685 r
->u
.template_unification
.nargs
= nargs
;
686 r
->u
.template_unification
.return_type
= return_type
;
687 r
->u
.template_unification
.strict
= strict
;
688 r
->u
.template_unification
.flags
= flags
;
692 static struct rejection_reason
*
693 template_unification_error_rejection (void)
695 return alloc_rejection (rr_template_unification
);
698 static struct rejection_reason
*
699 invalid_copy_with_fn_template_rejection (void)
701 struct rejection_reason
*r
= alloc_rejection (rr_invalid_copy
);
705 static struct rejection_reason
*
706 inherited_ctor_rejection (void)
708 struct rejection_reason
*r
= alloc_rejection (rr_inherited_ctor
);
712 // Build a constraint failure record, saving information into the
713 // template_instantiation field of the rejection. If FN is not a template
714 // declaration, the TMPL member is the FN declaration and TARGS is empty.
716 static struct rejection_reason
*
717 constraint_failure (tree fn
)
719 struct rejection_reason
*r
= alloc_rejection (rr_constraint_failure
);
720 if (tree ti
= DECL_TEMPLATE_INFO (fn
))
722 r
->u
.template_instantiation
.tmpl
= TI_TEMPLATE (ti
);
723 r
->u
.template_instantiation
.targs
= TI_ARGS (ti
);
727 r
->u
.template_instantiation
.tmpl
= fn
;
728 r
->u
.template_instantiation
.targs
= NULL_TREE
;
733 /* Dynamically allocate a conversion. */
736 alloc_conversion (conversion_kind kind
)
739 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
744 /* Make sure that all memory on the conversion obstack has been
748 validate_conversion_obstack (void)
750 if (conversion_obstack_initialized
)
751 gcc_assert ((obstack_next_free (&conversion_obstack
)
752 == obstack_base (&conversion_obstack
)));
755 /* Dynamically allocate an array of N conversions. */
758 alloc_conversions (size_t n
)
760 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
764 build_conv (conversion_kind code
, tree type
, conversion
*from
)
767 conversion_rank rank
= CONVERSION_RANK (from
);
769 /* Note that the caller is responsible for filling in t->cand for
770 user-defined conversions. */
771 t
= alloc_conversion (code
);
795 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
796 t
->bad_p
= from
->bad_p
;
801 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
802 specialization of std::initializer_list<T>, if such a conversion is
806 build_list_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
808 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
809 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
810 conversion
**subconvs
= alloc_conversions (len
);
815 /* Within a list-initialization we can have more user-defined
817 flags
&= ~LOOKUP_NO_CONVERSION
;
818 /* But no narrowing conversions. */
819 flags
|= LOOKUP_NO_NARROWING
;
821 /* Can't make an array of these types. */
822 if (TYPE_REF_P (elttype
)
823 || TREE_CODE (elttype
) == FUNCTION_TYPE
824 || VOID_TYPE_P (elttype
))
827 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
830 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
831 false, flags
, complain
);
838 t
= alloc_conversion (ck_list
);
840 t
->u
.list
= subconvs
;
843 for (i
= 0; i
< len
; ++i
)
845 conversion
*sub
= subconvs
[i
];
846 if (sub
->rank
> t
->rank
)
848 if (sub
->user_conv_p
)
849 t
->user_conv_p
= true;
857 /* Return the next conversion of the conversion chain (if applicable),
858 or NULL otherwise. Please use this function instead of directly
859 accessing fields of struct conversion. */
862 next_conversion (conversion
*conv
)
865 || conv
->kind
== ck_identity
866 || conv
->kind
== ck_ambig
867 || conv
->kind
== ck_list
)
872 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
873 is a valid aggregate initializer for array type ATYPE. */
876 can_convert_array (tree atype
, tree ctor
, int flags
, tsubst_flags_t complain
)
879 tree elttype
= TREE_TYPE (atype
);
880 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
882 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
884 if (TREE_CODE (elttype
) == ARRAY_TYPE
885 && TREE_CODE (val
) == CONSTRUCTOR
)
886 ok
= can_convert_array (elttype
, val
, flags
, complain
);
888 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
,
896 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
897 aggregate class, if such a conversion is possible. */
900 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
902 unsigned HOST_WIDE_INT i
= 0;
904 tree field
= next_initializable_field (TYPE_FIELDS (type
));
905 tree empty_ctor
= NULL_TREE
;
907 /* We already called reshape_init in implicit_conversion. */
909 /* The conversions within the init-list aren't affected by the enclosing
910 context; they're always simple copy-initialization. */
911 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
913 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
915 tree ftype
= TREE_TYPE (field
);
919 if (i
< CONSTRUCTOR_NELTS (ctor
))
920 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
921 else if (DECL_INITIAL (field
))
922 val
= get_nsdmi (field
, /*ctor*/false, complain
);
923 else if (TYPE_REF_P (ftype
))
924 /* Value-initialization of reference is ill-formed. */
928 if (empty_ctor
== NULL_TREE
)
929 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
934 if (TREE_CODE (ftype
) == ARRAY_TYPE
935 && TREE_CODE (val
) == CONSTRUCTOR
)
936 ok
= can_convert_array (ftype
, val
, flags
, complain
);
938 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
944 if (TREE_CODE (type
) == UNION_TYPE
)
948 if (i
< CONSTRUCTOR_NELTS (ctor
))
951 c
= alloc_conversion (ck_aggr
);
954 c
->user_conv_p
= true;
955 c
->check_narrowing
= true;
960 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
961 array type, if such a conversion is possible. */
964 build_array_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
967 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
968 tree elttype
= TREE_TYPE (type
);
973 enum conversion_rank rank
= cr_exact
;
975 /* We might need to propagate the size from the element to the array. */
976 complete_type (type
);
978 if (TYPE_DOMAIN (type
)
979 && !variably_modified_type_p (TYPE_DOMAIN (type
), NULL_TREE
))
981 unsigned HOST_WIDE_INT alen
= tree_to_uhwi (array_type_nelts_top (type
));
986 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
988 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
991 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
992 false, flags
, complain
);
996 if (sub
->rank
> rank
)
998 if (sub
->user_conv_p
)
1004 c
= alloc_conversion (ck_aggr
);
1007 c
->user_conv_p
= user
;
1013 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1014 complex type, if such a conversion is possible. */
1017 build_complex_conv (tree type
, tree ctor
, int flags
,
1018 tsubst_flags_t complain
)
1021 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1022 tree elttype
= TREE_TYPE (type
);
1027 enum conversion_rank rank
= cr_exact
;
1032 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1034 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1037 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1038 false, flags
, complain
);
1042 if (sub
->rank
> rank
)
1044 if (sub
->user_conv_p
)
1050 c
= alloc_conversion (ck_aggr
);
1053 c
->user_conv_p
= user
;
1059 /* Build a representation of the identity conversion from EXPR to
1060 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1063 build_identity_conv (tree type
, tree expr
)
1067 c
= alloc_conversion (ck_identity
);
1074 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1075 were multiple user-defined conversions to accomplish the job.
1076 Build a conversion that indicates that ambiguity. */
1079 build_ambiguous_conv (tree type
, tree expr
)
1083 c
= alloc_conversion (ck_ambig
);
1091 strip_top_quals (tree t
)
1093 if (TREE_CODE (t
) == ARRAY_TYPE
)
1095 return cp_build_qualified_type (t
, 0);
1098 /* Returns the standard conversion path (see [conv]) from type FROM to type
1099 TO, if any. For proper handling of null pointer constants, you must
1100 also pass the expression EXPR to convert from. If C_CAST_P is true,
1101 this conversion is coming from a C-style cast. */
1104 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1105 int flags
, tsubst_flags_t complain
)
1107 enum tree_code fcode
, tcode
;
1109 bool fromref
= false;
1112 to
= non_reference (to
);
1113 if (TYPE_REF_P (from
))
1116 from
= TREE_TYPE (from
);
1119 to
= strip_top_quals (to
);
1120 from
= strip_top_quals (from
);
1122 if (expr
&& type_unknown_p (expr
))
1124 if (TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1126 tsubst_flags_t tflags
= tf_conv
;
1127 expr
= instantiate_type (to
, expr
, tflags
);
1128 if (expr
== error_mark_node
)
1130 from
= TREE_TYPE (expr
);
1132 else if (TREE_CODE (to
) == BOOLEAN_TYPE
)
1134 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1135 expr
= resolve_nondeduced_context (expr
, complain
);
1136 from
= TREE_TYPE (expr
);
1140 fcode
= TREE_CODE (from
);
1141 tcode
= TREE_CODE (to
);
1143 conv
= build_identity_conv (from
, expr
);
1144 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1146 from
= type_decays_to (from
);
1147 fcode
= TREE_CODE (from
);
1148 /* Tell convert_like_real that we're using the address. */
1149 conv
->rvaluedness_matches_p
= true;
1150 conv
= build_conv (ck_lvalue
, from
, conv
);
1152 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1153 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1154 express the copy constructor call required by copy-initialization. */
1155 else if (fromref
|| (expr
&& obvalue_p (expr
)))
1160 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1163 from
= strip_top_quals (bitfield_type
);
1164 fcode
= TREE_CODE (from
);
1167 conv
= build_conv (ck_rvalue
, from
, conv
);
1168 if (flags
& LOOKUP_PREFER_RVALUE
)
1169 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1170 conv
->rvaluedness_matches_p
= true;
1173 /* Allow conversion between `__complex__' data types. */
1174 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1176 /* The standard conversion sequence to convert FROM to TO is
1177 the standard conversion sequence to perform componentwise
1179 conversion
*part_conv
= standard_conversion
1180 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
,
1185 conv
= build_conv (part_conv
->kind
, to
, conv
);
1186 conv
->rank
= part_conv
->rank
;
1194 if (same_type_p (from
, to
))
1196 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1197 conv
->type
= qualified_to
;
1202 A null pointer constant can be converted to a pointer type; ... A
1203 null pointer constant of integral type can be converted to an
1204 rvalue of type std::nullptr_t. */
1205 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1206 || NULLPTR_TYPE_P (to
))
1207 && ((expr
&& null_ptr_cst_p (expr
))
1208 || NULLPTR_TYPE_P (from
)))
1209 conv
= build_conv (ck_std
, to
, conv
);
1210 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1211 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1213 /* For backwards brain damage compatibility, allow interconversion of
1214 pointers and integers with a pedwarn. */
1215 conv
= build_conv (ck_std
, to
, conv
);
1218 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1220 /* For backwards brain damage compatibility, allow interconversion of
1221 enums and integers with a pedwarn. */
1222 conv
= build_conv (ck_std
, to
, conv
);
1225 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1226 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1231 if (tcode
== POINTER_TYPE
)
1233 to_pointee
= TREE_TYPE (to
);
1234 from_pointee
= TREE_TYPE (from
);
1236 /* Since this is the target of a pointer, it can't have function
1237 qualifiers, so any TYPE_QUALS must be for attributes const or
1238 noreturn. Strip them. */
1239 if (TREE_CODE (to_pointee
) == FUNCTION_TYPE
1240 && TYPE_QUALS (to_pointee
))
1241 to_pointee
= build_qualified_type (to_pointee
, TYPE_UNQUALIFIED
);
1242 if (TREE_CODE (from_pointee
) == FUNCTION_TYPE
1243 && TYPE_QUALS (from_pointee
))
1244 from_pointee
= build_qualified_type (from_pointee
, TYPE_UNQUALIFIED
);
1248 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1249 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1252 if (tcode
== POINTER_TYPE
1253 && same_type_ignoring_top_level_qualifiers_p (from_pointee
,
1256 else if (VOID_TYPE_P (to_pointee
)
1257 && !TYPE_PTRDATAMEM_P (from
)
1258 && TREE_CODE (from_pointee
) != FUNCTION_TYPE
)
1260 tree nfrom
= TREE_TYPE (from
);
1261 /* Don't try to apply restrict to void. */
1262 int quals
= cp_type_quals (nfrom
) & ~TYPE_QUAL_RESTRICT
;
1263 from_pointee
= cp_build_qualified_type (void_type_node
, quals
);
1264 from
= build_pointer_type (from_pointee
);
1265 conv
= build_conv (ck_ptr
, from
, conv
);
1267 else if (TYPE_PTRDATAMEM_P (from
))
1269 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1270 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1272 if (same_type_p (fbase
, tbase
))
1273 /* No base conversion needed. */;
1274 else if (DERIVED_FROM_P (fbase
, tbase
)
1275 && (same_type_ignoring_top_level_qualifiers_p
1276 (from_pointee
, to_pointee
)))
1278 from
= build_ptrmem_type (tbase
, from_pointee
);
1279 conv
= build_conv (ck_pmem
, from
, conv
);
1284 else if (CLASS_TYPE_P (from_pointee
)
1285 && CLASS_TYPE_P (to_pointee
)
1288 An rvalue of type "pointer to cv D," where D is a
1289 class type, can be converted to an rvalue of type
1290 "pointer to cv B," where B is a base class (clause
1291 _class.derived_) of D. If B is an inaccessible
1292 (clause _class.access_) or ambiguous
1293 (_class.member.lookup_) base class of D, a program
1294 that necessitates this conversion is ill-formed.
1295 Therefore, we use DERIVED_FROM_P, and do not check
1296 access or uniqueness. */
1297 && DERIVED_FROM_P (to_pointee
, from_pointee
))
1300 = cp_build_qualified_type (to_pointee
,
1301 cp_type_quals (from_pointee
));
1302 from
= build_pointer_type (from_pointee
);
1303 conv
= build_conv (ck_ptr
, from
, conv
);
1304 conv
->base_p
= true;
1307 if (same_type_p (from
, to
))
1309 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
1310 /* In a C-style cast, we ignore CV-qualification because we
1311 are allowed to perform a static_cast followed by a
1313 conv
= build_conv (ck_qual
, to
, conv
);
1314 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1315 conv
= build_conv (ck_qual
, to
, conv
);
1316 else if (expr
&& string_conv_p (to
, expr
, 0))
1317 /* converting from string constant to char *. */
1318 conv
= build_conv (ck_qual
, to
, conv
);
1319 else if (fnptr_conv_p (to
, from
))
1320 conv
= build_conv (ck_fnptr
, to
, conv
);
1321 /* Allow conversions among compatible ObjC pointer types (base
1322 conversions have been already handled above). */
1323 else if (c_dialect_objc ()
1324 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1325 conv
= build_conv (ck_ptr
, to
, conv
);
1326 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1328 conv
= build_conv (ck_ptr
, to
, conv
);
1336 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1338 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1339 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1340 tree fbase
= class_of_this_parm (fromfn
);
1341 tree tbase
= class_of_this_parm (tofn
);
1343 if (!DERIVED_FROM_P (fbase
, tbase
))
1346 tree fstat
= static_fn_type (fromfn
);
1347 tree tstat
= static_fn_type (tofn
);
1348 if (same_type_p (tstat
, fstat
)
1349 || fnptr_conv_p (tstat
, fstat
))
1354 if (!same_type_p (fbase
, tbase
))
1356 from
= build_memfn_type (fstat
,
1358 cp_type_quals (tbase
),
1359 type_memfn_rqual (tofn
));
1360 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1361 conv
= build_conv (ck_pmem
, from
, conv
);
1362 conv
->base_p
= true;
1364 if (fnptr_conv_p (tstat
, fstat
))
1365 conv
= build_conv (ck_fnptr
, to
, conv
);
1367 else if (tcode
== BOOLEAN_TYPE
)
1371 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1372 to member type can be converted to a prvalue of type bool. ...
1373 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1374 std::nullptr_t can be converted to a prvalue of type bool; */
1375 if (ARITHMETIC_TYPE_P (from
)
1376 || UNSCOPED_ENUM_P (from
)
1377 || fcode
== POINTER_TYPE
1378 || TYPE_PTRMEM_P (from
)
1379 || NULLPTR_TYPE_P (from
))
1381 conv
= build_conv (ck_std
, to
, conv
);
1382 if (fcode
== POINTER_TYPE
1383 || TYPE_PTRDATAMEM_P (from
)
1384 || (TYPE_PTRMEMFUNC_P (from
)
1385 && conv
->rank
< cr_pbool
)
1386 || NULLPTR_TYPE_P (from
))
1387 conv
->rank
= cr_pbool
;
1388 if (NULLPTR_TYPE_P (from
) && (flags
& LOOKUP_ONLYCONVERTING
))
1395 /* We don't check for ENUMERAL_TYPE here because there are no standard
1396 conversions to enum type. */
1397 /* As an extension, allow conversion to complex type. */
1398 else if (ARITHMETIC_TYPE_P (to
))
1400 if (! (INTEGRAL_CODE_P (fcode
)
1401 || (fcode
== REAL_TYPE
&& !(flags
& LOOKUP_NO_NON_INTEGRAL
)))
1402 || SCOPED_ENUM_P (from
))
1404 conv
= build_conv (ck_std
, to
, conv
);
1406 /* Give this a better rank if it's a promotion. */
1407 if (same_type_p (to
, type_promotes_to (from
))
1408 && next_conversion (conv
)->rank
<= cr_promotion
)
1409 conv
->rank
= cr_promotion
;
1411 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1412 && vector_types_convertible_p (from
, to
, false))
1413 return build_conv (ck_std
, to
, conv
);
1414 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1415 && is_properly_derived_from (from
, to
))
1417 if (conv
->kind
== ck_rvalue
)
1418 conv
= next_conversion (conv
);
1419 conv
= build_conv (ck_base
, to
, conv
);
1420 /* The derived-to-base conversion indicates the initialization
1421 of a parameter with base type from an object of a derived
1422 type. A temporary object is created to hold the result of
1423 the conversion unless we're binding directly to a reference. */
1424 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1429 if (flags
& LOOKUP_NO_NARROWING
)
1430 conv
->check_narrowing
= true;
1435 /* Returns nonzero if T1 is reference-related to T2. */
1438 reference_related_p (tree t1
, tree t2
)
1440 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1443 t1
= TYPE_MAIN_VARIANT (t1
);
1444 t2
= TYPE_MAIN_VARIANT (t2
);
1448 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1449 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1451 return (same_type_p (t1
, t2
)
1452 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1453 && DERIVED_FROM_P (t1
, t2
)));
1456 /* Returns nonzero if T1 is reference-compatible with T2. */
1459 reference_compatible_p (tree t1
, tree t2
)
1463 "cv1 T1" is reference compatible with "cv2 T2" if
1464 * T1 is reference-related to T2 or
1465 * T2 is "noexcept function" and T1 is "function", where the
1466 function types are otherwise the same,
1467 and cv1 is the same cv-qualification as, or greater cv-qualification
1469 return ((reference_related_p (t1
, t2
)
1470 || fnptr_conv_p (t1
, t2
))
1471 && at_least_as_qualified_p (t1
, t2
));
1474 /* A reference of the indicated TYPE is being bound directly to the
1475 expression represented by the implicit conversion sequence CONV.
1476 Return a conversion sequence for this binding. */
1479 direct_reference_binding (tree type
, conversion
*conv
)
1483 gcc_assert (TYPE_REF_P (type
));
1484 gcc_assert (!TYPE_REF_P (conv
->type
));
1486 t
= TREE_TYPE (type
);
1488 if (conv
->kind
== ck_identity
)
1489 /* Mark the identity conv as to not decay to rvalue. */
1490 conv
->rvaluedness_matches_p
= true;
1494 When a parameter of reference type binds directly
1495 (_dcl.init.ref_) to an argument expression, the implicit
1496 conversion sequence is the identity conversion, unless the
1497 argument expression has a type that is a derived class of the
1498 parameter type, in which case the implicit conversion sequence is
1499 a derived-to-base Conversion.
1501 If the parameter binds directly to the result of applying a
1502 conversion function to the argument expression, the implicit
1503 conversion sequence is a user-defined conversion sequence
1504 (_over.ics.user_), with the second standard conversion sequence
1505 either an identity conversion or, if the conversion function
1506 returns an entity of a type that is a derived class of the
1507 parameter type, a derived-to-base conversion. */
1508 if (is_properly_derived_from (conv
->type
, t
))
1510 /* Represent the derived-to-base conversion. */
1511 conv
= build_conv (ck_base
, t
, conv
);
1512 /* We will actually be binding to the base-class subobject in
1513 the derived class, so we mark this conversion appropriately.
1514 That way, convert_like knows not to generate a temporary. */
1515 conv
->need_temporary_p
= false;
1518 return build_conv (ck_ref_bind
, type
, conv
);
1521 /* Returns the conversion path from type FROM to reference type TO for
1522 purposes of reference binding. For lvalue binding, either pass a
1523 reference type to FROM or an lvalue expression to EXPR. If the
1524 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1525 the conversion returned. If C_CAST_P is true, this
1526 conversion is coming from a C-style cast. */
1529 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1530 tsubst_flags_t complain
)
1532 conversion
*conv
= NULL
;
1533 tree to
= TREE_TYPE (rto
);
1538 cp_lvalue_kind gl_kind
;
1541 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1543 expr
= instantiate_type (to
, expr
, tf_none
);
1544 if (expr
== error_mark_node
)
1546 from
= TREE_TYPE (expr
);
1549 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1551 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1552 /* DR 1288: Otherwise, if the initializer list has a single element
1553 of type E and ... [T's] referenced type is reference-related to E,
1554 the object or reference is initialized from that element... */
1555 if (CONSTRUCTOR_NELTS (expr
) == 1)
1557 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1558 if (error_operand_p (elt
))
1560 tree etype
= TREE_TYPE (elt
);
1561 if (reference_related_p (to
, etype
))
1568 /* Otherwise, if T is a reference type, a prvalue temporary of the type
1569 referenced by T is copy-list-initialized, and the reference is bound
1570 to that temporary. */
1571 CONSTRUCTOR_IS_DIRECT_INIT (expr
) = false;
1575 if (TYPE_REF_P (from
))
1577 from
= TREE_TYPE (from
);
1578 if (!TYPE_REF_IS_RVALUE (rfrom
)
1579 || TREE_CODE (from
) == FUNCTION_TYPE
)
1580 gl_kind
= clk_ordinary
;
1582 gl_kind
= clk_rvalueref
;
1585 gl_kind
= lvalue_kind (expr
);
1586 else if (CLASS_TYPE_P (from
)
1587 || TREE_CODE (from
) == ARRAY_TYPE
)
1588 gl_kind
= clk_class
;
1592 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1593 if ((flags
& LOOKUP_NO_TEMP_BIND
)
1594 && (gl_kind
& clk_class
))
1597 /* Same mask as real_lvalue_p. */
1598 is_lvalue
= gl_kind
&& !(gl_kind
& (clk_rvalueref
|clk_class
));
1601 if ((gl_kind
& clk_bitfield
) != 0)
1602 tfrom
= unlowered_expr_type (expr
);
1604 /* Figure out whether or not the types are reference-related and
1605 reference compatible. We have to do this after stripping
1606 references from FROM. */
1607 related_p
= reference_related_p (to
, tfrom
);
1608 /* If this is a C cast, first convert to an appropriately qualified
1609 type, so that we can later do a const_cast to the desired type. */
1610 if (related_p
&& c_cast_p
1611 && !at_least_as_qualified_p (to
, tfrom
))
1612 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1613 compatible_p
= reference_compatible_p (to
, tfrom
);
1615 /* Directly bind reference when target expression's type is compatible with
1616 the reference and expression is an lvalue. In DR391, the wording in
1617 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1618 const and rvalue references to rvalues of compatible class type.
1619 We should also do direct bindings for non-class xvalues. */
1620 if ((related_p
|| compatible_p
) && gl_kind
)
1624 If the initializer expression
1626 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1627 is reference-compatible with "cv2 T2,"
1629 the reference is bound directly to the initializer expression
1633 If the initializer expression is an rvalue, with T2 a class type,
1634 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1635 is bound to the object represented by the rvalue or to a sub-object
1636 within that object. */
1638 conv
= build_identity_conv (tfrom
, expr
);
1639 conv
= direct_reference_binding (rto
, conv
);
1641 if (TYPE_REF_P (rfrom
))
1642 /* Handle rvalue reference to function properly. */
1643 conv
->rvaluedness_matches_p
1644 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1646 conv
->rvaluedness_matches_p
1647 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1649 if ((gl_kind
& clk_bitfield
) != 0
1650 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1651 /* For the purposes of overload resolution, we ignore the fact
1652 this expression is a bitfield or packed field. (In particular,
1653 [over.ics.ref] says specifically that a function with a
1654 non-const reference parameter is viable even if the
1655 argument is a bitfield.)
1657 However, when we actually call the function we must create
1658 a temporary to which to bind the reference. If the
1659 reference is volatile, or isn't const, then we cannot make
1660 a temporary, so we just issue an error when the conversion
1662 conv
->need_temporary_p
= true;
1664 /* Don't allow binding of lvalues (other than function lvalues) to
1665 rvalue references. */
1666 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1667 && TREE_CODE (to
) != FUNCTION_TYPE
)
1670 /* Nor the reverse. */
1671 if (!is_lvalue
&& !TYPE_REF_IS_RVALUE (rto
)
1672 && (!CP_TYPE_CONST_NON_VOLATILE_P (to
)
1673 || (flags
& LOOKUP_NO_RVAL_BIND
))
1674 && TREE_CODE (to
) != FUNCTION_TYPE
)
1682 /* [class.conv.fct] A conversion function is never used to convert a
1683 (possibly cv-qualified) object to the (possibly cv-qualified) same
1684 object type (or a reference to it), to a (possibly cv-qualified) base
1685 class of that type (or a reference to it).... */
1686 else if (CLASS_TYPE_P (from
) && !related_p
1687 && !(flags
& LOOKUP_NO_CONVERSION
))
1691 If the initializer expression
1693 -- has a class type (i.e., T2 is a class type) can be
1694 implicitly converted to an lvalue of type "cv3 T3," where
1695 "cv1 T1" is reference-compatible with "cv3 T3". (this
1696 conversion is selected by enumerating the applicable
1697 conversion functions (_over.match.ref_) and choosing the
1698 best one through overload resolution. (_over.match_).
1700 the reference is bound to the lvalue result of the conversion
1701 in the second case. */
1702 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1705 return cand
->second_conv
;
1708 /* From this point on, we conceptually need temporaries, even if we
1709 elide them. Only the cases above are "direct bindings". */
1710 if (flags
& LOOKUP_NO_TEMP_BIND
)
1715 When a parameter of reference type is not bound directly to an
1716 argument expression, the conversion sequence is the one required
1717 to convert the argument expression to the underlying type of the
1718 reference according to _over.best.ics_. Conceptually, this
1719 conversion sequence corresponds to copy-initializing a temporary
1720 of the underlying type with the argument expression. Any
1721 difference in top-level cv-qualification is subsumed by the
1722 initialization itself and does not constitute a conversion. */
1726 Otherwise, the reference shall be an lvalue reference to a
1727 non-volatile const type, or the reference shall be an rvalue
1730 We try below to treat this as a bad conversion to improve diagnostics,
1731 but if TO is an incomplete class, we need to reject this conversion
1732 now to avoid unnecessary instantiation. */
1733 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
)
1734 && !COMPLETE_TYPE_P (to
))
1737 /* We're generating a temporary now, but don't bind any more in the
1738 conversion (specifically, don't slice the temporary returned by a
1739 conversion operator). */
1740 flags
|= LOOKUP_NO_TEMP_BIND
;
1742 /* Core issue 899: When [copy-]initializing a temporary to be bound
1743 to the first parameter of a copy constructor (12.8) called with
1744 a single argument in the context of direct-initialization,
1745 explicit conversion functions are also considered.
1747 So don't set LOOKUP_ONLYCONVERTING in that case. */
1748 if (!(flags
& LOOKUP_COPY_PARM
))
1749 flags
|= LOOKUP_ONLYCONVERTING
;
1752 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1757 if (conv
->user_conv_p
)
1759 /* If initializing the temporary used a conversion function,
1760 recalculate the second conversion sequence. */
1761 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1762 if (t
->kind
== ck_user
1763 && DECL_CONV_FN_P (t
->cand
->fn
))
1765 tree ftype
= TREE_TYPE (TREE_TYPE (t
->cand
->fn
));
1766 int sflags
= (flags
|LOOKUP_NO_CONVERSION
)&~LOOKUP_NO_TEMP_BIND
;
1767 conversion
*new_second
1768 = reference_binding (rto
, ftype
, NULL_TREE
, c_cast_p
,
1772 return merge_conversion_sequences (t
, new_second
);
1776 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1777 /* This reference binding, unlike those above, requires the
1778 creation of a temporary. */
1779 conv
->need_temporary_p
= true;
1780 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1784 Otherwise, the reference shall be an lvalue reference to a
1785 non-volatile const type, or the reference shall be an rvalue
1787 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1792 Otherwise, a temporary of type "cv1 T1" is created and
1793 initialized from the initializer expression using the rules for a
1794 non-reference copy initialization. If T1 is reference-related to
1795 T2, cv1 must be the same cv-qualification as, or greater
1796 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1797 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1803 /* Returns the implicit conversion sequence (see [over.ics]) from type
1804 FROM to type TO. The optional expression EXPR may affect the
1805 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1806 true, this conversion is coming from a C-style cast. */
1809 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1810 int flags
, tsubst_flags_t complain
)
1814 if (from
== error_mark_node
|| to
== error_mark_node
1815 || expr
== error_mark_node
)
1818 /* Other flags only apply to the primary function in overload
1819 resolution, or after we've chosen one. */
1820 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1821 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1822 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1824 /* FIXME: actually we don't want warnings either, but we can't just
1825 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1826 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1827 We really ought not to issue that warning until we've committed
1828 to that conversion. */
1829 complain
&= ~tf_error
;
1831 /* Call reshape_init early to remove redundant braces. */
1832 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
)
1833 && CLASS_TYPE_P (to
)
1834 && COMPLETE_TYPE_P (complete_type (to
))
1835 && !CLASSTYPE_NON_AGGREGATE (to
))
1837 expr
= reshape_init (to
, expr
, complain
);
1838 if (expr
== error_mark_node
)
1840 from
= TREE_TYPE (expr
);
1843 if (TYPE_REF_P (to
))
1844 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1846 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
, complain
);
1851 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1853 if (is_std_init_list (to
))
1854 return build_list_conv (to
, expr
, flags
, complain
);
1856 /* As an extension, allow list-initialization of _Complex. */
1857 if (TREE_CODE (to
) == COMPLEX_TYPE
)
1859 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1864 /* Allow conversion from an initializer-list with one element to a
1866 if (SCALAR_TYPE_P (to
))
1868 int nelts
= CONSTRUCTOR_NELTS (expr
);
1872 elt
= build_value_init (to
, tf_none
);
1873 else if (nelts
== 1)
1874 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1876 elt
= error_mark_node
;
1878 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1879 c_cast_p
, flags
, complain
);
1882 conv
->check_narrowing
= true;
1883 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1884 /* Too many levels of braces, i.e. '{{1}}'. */
1889 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1890 return build_array_conv (to
, expr
, flags
, complain
);
1893 if (expr
!= NULL_TREE
1894 && (MAYBE_CLASS_TYPE_P (from
)
1895 || MAYBE_CLASS_TYPE_P (to
))
1896 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1898 struct z_candidate
*cand
;
1900 if (CLASS_TYPE_P (to
)
1901 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
1902 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
1903 return build_aggr_conv (to
, expr
, flags
, complain
);
1905 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
1908 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
1909 && CONSTRUCTOR_NELTS (expr
) == 1
1910 && !is_list_ctor (cand
->fn
))
1912 /* "If C is not an initializer-list constructor and the
1913 initializer list has a single element of type cv U, where U is
1914 X or a class derived from X, the implicit conversion sequence
1915 has Exact Match rank if U is X, or Conversion rank if U is
1917 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1918 tree elttype
= TREE_TYPE (elt
);
1919 if (reference_related_p (to
, elttype
))
1920 return implicit_conversion (to
, elttype
, elt
,
1921 c_cast_p
, flags
, complain
);
1923 conv
= cand
->second_conv
;
1926 /* We used to try to bind a reference to a temporary here, but that
1927 is now handled after the recursive call to this function at the end
1928 of reference_binding. */
1935 /* Like implicit_conversion, but return NULL if the conversion is bad.
1937 This is not static so that check_non_deducible_conversion can call it within
1938 add_template_candidate_real as part of overload resolution; it should not be
1939 called outside of overload resolution. */
1942 good_conversion (tree to
, tree from
, tree expr
,
1943 int flags
, tsubst_flags_t complain
)
1945 conversion
*c
= implicit_conversion (to
, from
, expr
, /*cast*/false,
1952 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1953 functions. ARGS will not be changed until a single candidate is
1956 static struct z_candidate
*
1957 add_candidate (struct z_candidate
**candidates
,
1958 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
1959 size_t num_convs
, conversion
**convs
,
1960 tree access_path
, tree conversion_path
,
1961 int viable
, struct rejection_reason
*reason
,
1964 struct z_candidate
*cand
= (struct z_candidate
*)
1965 conversion_obstack_alloc (sizeof (struct z_candidate
));
1968 cand
->first_arg
= first_arg
;
1970 cand
->convs
= convs
;
1971 cand
->num_convs
= num_convs
;
1972 cand
->access_path
= access_path
;
1973 cand
->conversion_path
= conversion_path
;
1974 cand
->viable
= viable
;
1975 cand
->reason
= reason
;
1976 cand
->next
= *candidates
;
1977 cand
->flags
= flags
;
1983 /* Return the number of remaining arguments in the parameter list
1984 beginning with ARG. */
1987 remaining_arguments (tree arg
)
1991 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
1992 arg
= TREE_CHAIN (arg
))
1998 /* [over.match.copy]: When initializing a temporary object (12.2) to be bound
1999 to the first parameter of a constructor where the parameter is of type
2000 "reference to possibly cv-qualified T" and the constructor is called with a
2001 single argument in the context of direct-initialization of an object of type
2002 "cv2 T", explicit conversion functions are also considered.
2004 So set LOOKUP_COPY_PARM to let reference_binding know that
2005 it's being called in that context. */
2008 conv_flags (int i
, int nargs
, tree fn
, tree arg
, int flags
)
2012 if (i
== 0 && nargs
== 1 && DECL_CONSTRUCTOR_P (fn
)
2013 && (t
= FUNCTION_FIRST_USER_PARMTYPE (fn
))
2014 && (same_type_ignoring_top_level_qualifiers_p
2015 (non_reference (TREE_VALUE (t
)), DECL_CONTEXT (fn
))))
2017 if (!(flags
& LOOKUP_ONLYCONVERTING
))
2018 lflags
|= LOOKUP_COPY_PARM
;
2019 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
2020 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
2021 lflags
|= LOOKUP_NO_CONVERSION
;
2024 lflags
|= LOOKUP_ONLYCONVERTING
;
2029 /* Create an overload candidate for the function or method FN called
2030 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
2031 FLAGS is passed on to implicit_conversion.
2033 This does not change ARGS.
2035 CTYPE, if non-NULL, is the type we want to pretend this function
2036 comes from for purposes of overload resolution. */
2038 static struct z_candidate
*
2039 add_function_candidate (struct z_candidate
**candidates
,
2040 tree fn
, tree ctype
, tree first_arg
,
2041 const vec
<tree
, va_gc
> *args
, tree access_path
,
2042 tree conversion_path
, int flags
,
2044 tsubst_flags_t complain
)
2046 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2049 tree orig_first_arg
= first_arg
;
2052 struct rejection_reason
*reason
= NULL
;
2054 /* At this point we should not see any functions which haven't been
2055 explicitly declared, except for friend functions which will have
2056 been found using argument dependent lookup. */
2057 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
2059 /* The `this', `in_chrg' and VTT arguments to constructors are not
2060 considered in overload resolution. */
2061 if (DECL_CONSTRUCTOR_P (fn
))
2063 if (ctor_omit_inherited_parms (fn
))
2064 /* Bring back parameters omitted from an inherited ctor. */
2065 parmlist
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn
));
2067 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
2068 skip
= num_artificial_parms_for (fn
);
2069 if (skip
> 0 && first_arg
!= NULL_TREE
)
2072 first_arg
= NULL_TREE
;
2078 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
2080 convs
= alloc_conversions (len
);
2082 /* 13.3.2 - Viable functions [over.match.viable]
2083 First, to be a viable function, a candidate function shall have enough
2084 parameters to agree in number with the arguments in the list.
2086 We need to check this first; otherwise, checking the ICSes might cause
2087 us to produce an ill-formed template instantiation. */
2089 parmnode
= parmlist
;
2090 for (i
= 0; i
< len
; ++i
)
2092 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
2094 parmnode
= TREE_CHAIN (parmnode
);
2097 if ((i
< len
&& parmnode
)
2098 || !sufficient_parms_p (parmnode
))
2100 int remaining
= remaining_arguments (parmnode
);
2102 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
2105 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2106 parameter of type "reference to cv C" (including such a constructor
2107 instantiated from a template) is excluded from the set of candidate
2108 functions when used to construct an object of type D with an argument list
2109 containing a single argument if C is reference-related to D. */
2110 if (viable
&& len
== 1 && parmlist
&& DECL_CONSTRUCTOR_P (fn
)
2111 && flag_new_inheriting_ctors
2112 && DECL_INHERITED_CTOR (fn
))
2114 tree ptype
= non_reference (TREE_VALUE (parmlist
));
2115 tree dtype
= DECL_CONTEXT (fn
);
2116 tree btype
= DECL_INHERITED_CTOR_BASE (fn
);
2117 if (reference_related_p (ptype
, dtype
)
2118 && reference_related_p (btype
, ptype
))
2121 reason
= inherited_ctor_rejection ();
2125 /* Second, for a function to be viable, its constraints must be
2127 if (flag_concepts
&& viable
2128 && !constraints_satisfied_p (fn
))
2130 reason
= constraint_failure (fn
);
2134 /* When looking for a function from a subobject from an implicit
2135 copy/move constructor/operator=, don't consider anything that takes (a
2136 reference to) an unrelated type. See c++/44909 and core 1092. */
2137 if (viable
&& parmlist
&& (flags
& LOOKUP_DEFAULTED
))
2139 if (DECL_CONSTRUCTOR_P (fn
))
2141 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
2142 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
))
2148 parmnode
= chain_index (i
-1, parmlist
);
2149 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
2154 /* This only applies at the top level. */
2155 flags
&= ~LOOKUP_DEFAULTED
;
2161 /* Third, for F to be a viable function, there shall exist for each
2162 argument an implicit conversion sequence that converts that argument
2163 to the corresponding parameter of F. */
2165 parmnode
= parmlist
;
2167 for (i
= 0; i
< len
; ++i
)
2169 tree argtype
, to_type
;
2174 if (parmnode
== void_list_node
)
2179 /* Already set during deduction. */
2180 parmnode
= TREE_CHAIN (parmnode
);
2184 if (i
== 0 && first_arg
!= NULL_TREE
)
2187 arg
= CONST_CAST_TREE (
2188 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
2189 argtype
= lvalue_type (arg
);
2191 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2192 && ! DECL_CONSTRUCTOR_P (fn
));
2196 tree parmtype
= TREE_VALUE (parmnode
);
2198 parmnode
= TREE_CHAIN (parmnode
);
2200 /* The type of the implicit object parameter ('this') for
2201 overload resolution is not always the same as for the
2202 function itself; conversion functions are considered to
2203 be members of the class being converted, and functions
2204 introduced by a using-declaration are considered to be
2205 members of the class that uses them.
2207 Since build_over_call ignores the ICS for the `this'
2208 parameter, we can just change the parm type. */
2209 if (ctype
&& is_this
)
2211 parmtype
= cp_build_qualified_type
2212 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
2213 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
2215 /* If the function has a ref-qualifier, the implicit
2216 object parameter has reference type. */
2217 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
2218 parmtype
= cp_build_reference_type (parmtype
, rv
);
2219 /* The special handling of 'this' conversions in compare_ics
2220 does not apply if there is a ref-qualifier. */
2225 parmtype
= build_pointer_type (parmtype
);
2226 /* We don't use build_this here because we don't want to
2227 capture the object argument until we've chosen a
2228 non-static member function. */
2229 arg
= build_address (arg
);
2230 argtype
= lvalue_type (arg
);
2234 int lflags
= conv_flags (i
, len
-skip
, fn
, arg
, flags
);
2236 t
= implicit_conversion (parmtype
, argtype
, arg
,
2237 /*c_cast_p=*/false, lflags
, complain
);
2242 t
= build_identity_conv (argtype
, arg
);
2243 t
->ellipsis_p
= true;
2254 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
);
2261 reason
= bad_arg_conversion_rejection (first_arg
, i
, arg
, to_type
);
2266 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2267 access_path
, conversion_path
, viable
, reason
, flags
);
2270 /* Create an overload candidate for the conversion function FN which will
2271 be invoked for expression OBJ, producing a pointer-to-function which
2272 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2273 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2274 passed on to implicit_conversion.
2276 Actually, we don't really care about FN; we care about the type it
2277 converts to. There may be multiple conversion functions that will
2278 convert to that type, and we rely on build_user_type_conversion_1 to
2279 choose the best one; so when we create our candidate, we record the type
2280 instead of the function. */
2282 static struct z_candidate
*
2283 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2284 const vec
<tree
, va_gc
> *arglist
,
2285 tree access_path
, tree conversion_path
,
2286 tsubst_flags_t complain
)
2288 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2289 int i
, len
, viable
, flags
;
2290 tree parmlist
, parmnode
;
2292 struct rejection_reason
*reason
;
2294 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2295 parmlist
= TREE_TYPE (parmlist
);
2296 parmlist
= TYPE_ARG_TYPES (parmlist
);
2298 len
= vec_safe_length (arglist
) + 1;
2299 convs
= alloc_conversions (len
);
2300 parmnode
= parmlist
;
2302 flags
= LOOKUP_IMPLICIT
;
2305 /* Don't bother looking up the same type twice. */
2306 if (*candidates
&& (*candidates
)->fn
== totype
)
2309 for (i
= 0; i
< len
; ++i
)
2311 tree arg
, argtype
, convert_type
= NULL_TREE
;
2317 arg
= (*arglist
)[i
- 1];
2318 argtype
= lvalue_type (arg
);
2322 t
= build_identity_conv (argtype
, NULL_TREE
);
2323 t
= build_conv (ck_user
, totype
, t
);
2324 /* Leave the 'cand' field null; we'll figure out the conversion in
2325 convert_like_real if this candidate is chosen. */
2326 convert_type
= totype
;
2328 else if (parmnode
== void_list_node
)
2332 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2333 /*c_cast_p=*/false, flags
, complain
);
2334 convert_type
= TREE_VALUE (parmnode
);
2338 t
= build_identity_conv (argtype
, arg
);
2339 t
->ellipsis_p
= true;
2340 convert_type
= argtype
;
2350 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, arg
, convert_type
);
2357 parmnode
= TREE_CHAIN (parmnode
);
2361 || ! sufficient_parms_p (parmnode
))
2363 int remaining
= remaining_arguments (parmnode
);
2365 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2368 return add_candidate (candidates
, totype
, obj
, arglist
, len
, convs
,
2369 access_path
, conversion_path
, viable
, reason
, flags
);
2373 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2374 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2375 int flags
, tsubst_flags_t complain
)
2382 struct rejection_reason
*reason
= NULL
;
2387 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2388 convs
= alloc_conversions (num_convs
);
2390 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2391 conversion ops are allowed. We handle that here by just checking for
2392 boolean_type_node because other operators don't ask for it. COND_EXPR
2393 also does contextual conversion to bool for the first operand, but we
2394 handle that in build_conditional_expr, and type1 here is operand 2. */
2395 if (type1
!= boolean_type_node
)
2396 flags
|= LOOKUP_ONLYCONVERTING
;
2398 for (i
= 0; i
< 2; ++i
)
2403 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2404 /*c_cast_p=*/false, flags
, complain
);
2408 /* We need something for printing the candidate. */
2409 t
= build_identity_conv (types
[i
], NULL_TREE
);
2410 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2416 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, args
[i
],
2422 /* For COND_EXPR we rearranged the arguments; undo that now. */
2425 convs
[2] = convs
[1];
2426 convs
[1] = convs
[0];
2427 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2428 /*c_cast_p=*/false, flags
,
2435 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2440 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2442 /*access_path=*/NULL_TREE
,
2443 /*conversion_path=*/NULL_TREE
,
2444 viable
, reason
, flags
);
2448 is_complete (tree t
)
2450 return COMPLETE_TYPE_P (complete_type (t
));
2453 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2456 promoted_arithmetic_type_p (tree type
)
2460 In this section, the term promoted integral type is used to refer
2461 to those integral types which are preserved by integral promotion
2462 (including e.g. int and long but excluding e.g. char).
2463 Similarly, the term promoted arithmetic type refers to promoted
2464 integral types plus floating types. */
2465 return ((CP_INTEGRAL_TYPE_P (type
)
2466 && same_type_p (type_promotes_to (type
), type
))
2467 || TREE_CODE (type
) == REAL_TYPE
);
2470 /* Create any builtin operator overload candidates for the operator in
2471 question given the converted operand types TYPE1 and TYPE2. The other
2472 args are passed through from add_builtin_candidates to
2473 build_builtin_candidate.
2475 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2476 If CODE is requires candidates operands of the same type of the kind
2477 of which TYPE1 and TYPE2 are, we add both candidates
2478 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2481 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2482 enum tree_code code2
, tree fnname
, tree type1
,
2483 tree type2
, tree
*args
, tree
*argtypes
, int flags
,
2484 tsubst_flags_t complain
)
2488 case POSTINCREMENT_EXPR
:
2489 case POSTDECREMENT_EXPR
:
2490 args
[1] = integer_zero_node
;
2491 type2
= integer_type_node
;
2500 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2501 and VQ is either volatile or empty, there exist candidate operator
2502 functions of the form
2503 VQ T& operator++(VQ T&);
2504 T operator++(VQ T&, int);
2505 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2506 type other than bool, and VQ is either volatile or empty, there exist
2507 candidate operator functions of the form
2508 VQ T& operator--(VQ T&);
2509 T operator--(VQ T&, int);
2510 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2511 complete object type, and VQ is either volatile or empty, there exist
2512 candidate operator functions of the form
2513 T*VQ& operator++(T*VQ&);
2514 T*VQ& operator--(T*VQ&);
2515 T* operator++(T*VQ&, int);
2516 T* operator--(T*VQ&, int); */
2518 case POSTDECREMENT_EXPR
:
2519 case PREDECREMENT_EXPR
:
2520 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2523 case POSTINCREMENT_EXPR
:
2524 case PREINCREMENT_EXPR
:
2525 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2527 type1
= build_reference_type (type1
);
2532 /* 7 For every cv-qualified or cv-unqualified object type T, there
2533 exist candidate operator functions of the form
2537 8 For every function type T, there exist candidate operator functions of
2539 T& operator*(T*); */
2542 if (TYPE_PTR_P (type1
)
2543 && (TYPE_PTROB_P (type1
)
2544 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2548 /* 9 For every type T, there exist candidate operator functions of the form
2551 10For every promoted arithmetic type T, there exist candidate operator
2552 functions of the form
2556 case UNARY_PLUS_EXPR
: /* unary + */
2557 if (TYPE_PTR_P (type1
))
2561 if (ARITHMETIC_TYPE_P (type1
))
2565 /* 11For every promoted integral type T, there exist candidate operator
2566 functions of the form
2570 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2574 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2575 is the same type as C2 or is a derived class of C2, T is a complete
2576 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2577 there exist candidate operator functions of the form
2578 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2579 where CV12 is the union of CV1 and CV2. */
2582 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2584 tree c1
= TREE_TYPE (type1
);
2585 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2587 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2588 && (TYPE_PTRMEMFUNC_P (type2
)
2589 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2594 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2595 didate operator functions of the form
2600 bool operator<(L, R);
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 where LR is the result of the usual arithmetic conversions between
2609 14For every pair of types T and I, where T is a cv-qualified or cv-
2610 unqualified complete object type and I is a promoted integral type,
2611 there exist candidate operator functions of the form
2612 T* operator+(T*, I);
2613 T& operator[](T*, I);
2614 T* operator-(T*, I);
2615 T* operator+(I, T*);
2616 T& operator[](I, T*);
2618 15For every T, where T is a pointer to complete object type, there exist
2619 candidate operator functions of the form112)
2620 ptrdiff_t operator-(T, T);
2622 16For every pointer or enumeration type T, there exist candidate operator
2623 functions of the form
2624 bool operator<(T, T);
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);
2631 17For every pointer to member type T, there exist candidate operator
2632 functions of the form
2633 bool operator==(T, T);
2634 bool operator!=(T, T); */
2637 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2639 if (TYPE_PTROB_P (type1
)
2640 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2642 type2
= ptrdiff_type_node
;
2647 case TRUNC_DIV_EXPR
:
2648 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2654 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2655 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2657 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2662 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2674 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2676 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2678 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2679 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2681 if (TYPE_PTR_P (type1
)
2682 && null_ptr_cst_p (args
[1]))
2687 if (null_ptr_cst_p (args
[0])
2688 && TYPE_PTR_P (type2
))
2696 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2700 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2702 type1
= ptrdiff_type_node
;
2705 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2707 type2
= ptrdiff_type_node
;
2712 /* 18For every pair of promoted integral types L and R, there exist candi-
2713 date operator functions of the form
2720 where LR is the result of the usual arithmetic conversions between
2723 case TRUNC_MOD_EXPR
:
2729 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2733 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2734 type, VQ is either volatile or empty, and R is a promoted arithmetic
2735 type, there exist candidate operator functions of the form
2736 VQ L& operator=(VQ L&, R);
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);
2742 20For every pair T, VQ), where T is any type and VQ is either volatile
2743 or empty, there exist candidate operator functions of the form
2744 T*VQ& operator=(T*VQ&, T*);
2746 21For every pair T, VQ), where T is a pointer to member type and VQ is
2747 either volatile or empty, there exist candidate operator functions of
2749 VQ T& operator=(VQ T&, T);
2751 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2752 unqualified complete object type, VQ is either volatile or empty, and
2753 I is a promoted integral type, there exist candidate operator func-
2755 T*VQ& operator+=(T*VQ&, I);
2756 T*VQ& operator-=(T*VQ&, I);
2758 23For every triple L, VQ, R), where L is an integral or enumeration
2759 type, VQ is either volatile or empty, and R is a promoted integral
2760 type, there exist candidate operator functions of the form
2762 VQ L& operator%=(VQ L&, R);
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); */
2774 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2776 type2
= ptrdiff_type_node
;
2781 case TRUNC_DIV_EXPR
:
2782 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2786 case TRUNC_MOD_EXPR
:
2792 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2797 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2799 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2800 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2801 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2802 || ((TYPE_PTRMEMFUNC_P (type1
)
2803 || TYPE_PTR_P (type1
))
2804 && null_ptr_cst_p (args
[1])))
2814 type1
= build_reference_type (type1
);
2820 For every pair of promoted arithmetic types L and R, there
2821 exist candidate operator functions of the form
2823 LR operator?(bool, L, R);
2825 where LR is the result of the usual arithmetic conversions
2826 between types L and R.
2828 For every type T, where T is a pointer or pointer-to-member
2829 type, there exist candidate operator functions of the form T
2830 operator?(bool, T, T); */
2832 if (promoted_arithmetic_type_p (type1
)
2833 && promoted_arithmetic_type_p (type2
))
2837 /* Otherwise, the types should be pointers. */
2838 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2841 /* We don't check that the two types are the same; the logic
2842 below will actually create two candidates; one in which both
2843 parameter types are TYPE1, and one in which both parameter
2849 if (ARITHMETIC_TYPE_P (type1
))
2857 /* Make sure we don't create builtin candidates with dependent types. */
2858 bool u1
= uses_template_parms (type1
);
2859 bool u2
= type2
? uses_template_parms (type2
) : false;
2862 /* Try to recover if one of the types is non-dependent. But if
2863 there's only one type, there's nothing we can do. */
2866 /* And we lose if both are dependent. */
2869 /* Or if they have different forms. */
2870 if (TREE_CODE (type1
) != TREE_CODE (type2
))
2879 /* If we're dealing with two pointer types or two enumeral types,
2880 we need candidates for both of them. */
2881 if (type2
&& !same_type_p (type1
, type2
)
2882 && TREE_CODE (type1
) == TREE_CODE (type2
)
2883 && (TYPE_REF_P (type1
)
2884 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2885 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2886 || TYPE_PTRMEMFUNC_P (type1
)
2887 || MAYBE_CLASS_TYPE_P (type1
)
2888 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2890 if (TYPE_PTR_OR_PTRMEM_P (type1
))
2892 tree cptype
= composite_pointer_type (type1
, type2
,
2897 if (cptype
!= error_mark_node
)
2899 build_builtin_candidate
2900 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
2906 build_builtin_candidate
2907 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
2908 build_builtin_candidate
2909 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
2913 build_builtin_candidate
2914 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
2918 type_decays_to (tree type
)
2920 if (TREE_CODE (type
) == ARRAY_TYPE
)
2921 return build_pointer_type (TREE_TYPE (type
));
2922 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2923 return build_pointer_type (type
);
2927 /* There are three conditions of builtin candidates:
2929 1) bool-taking candidates. These are the same regardless of the input.
2930 2) pointer-pair taking candidates. These are generated for each type
2931 one of the input types converts to.
2932 3) arithmetic candidates. According to the standard, we should generate
2933 all of these, but I'm trying not to...
2935 Here we generate a superset of the possible candidates for this particular
2936 case. That is a subset of the full set the standard defines, plus some
2937 other cases which the standard disallows. add_builtin_candidate will
2938 filter out the invalid set. */
2941 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2942 enum tree_code code2
, tree fnname
, tree
*args
,
2943 int flags
, tsubst_flags_t complain
)
2947 tree type
, argtypes
[3], t
;
2948 /* TYPES[i] is the set of possible builtin-operator parameter types
2949 we will consider for the Ith argument. */
2950 vec
<tree
, va_gc
> *types
[2];
2953 for (i
= 0; i
< 3; ++i
)
2956 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2958 argtypes
[i
] = NULL_TREE
;
2963 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2964 and VQ is either volatile or empty, there exist candidate operator
2965 functions of the form
2966 VQ T& operator++(VQ T&); */
2968 case POSTINCREMENT_EXPR
:
2969 case PREINCREMENT_EXPR
:
2970 case POSTDECREMENT_EXPR
:
2971 case PREDECREMENT_EXPR
:
2976 /* 24There also exist candidate operator functions of the form
2977 bool operator!(bool);
2978 bool operator&&(bool, bool);
2979 bool operator||(bool, bool); */
2981 case TRUTH_NOT_EXPR
:
2982 build_builtin_candidate
2983 (candidates
, fnname
, boolean_type_node
,
2984 NULL_TREE
, args
, argtypes
, flags
, complain
);
2987 case TRUTH_ORIF_EXPR
:
2988 case TRUTH_ANDIF_EXPR
:
2989 build_builtin_candidate
2990 (candidates
, fnname
, boolean_type_node
,
2991 boolean_type_node
, args
, argtypes
, flags
, complain
);
3013 types
[0] = make_tree_vector ();
3014 types
[1] = make_tree_vector ();
3016 for (i
= 0; i
< 2; ++i
)
3020 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
3024 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
3027 convs
= lookup_conversions (argtypes
[i
]);
3029 if (code
== COND_EXPR
)
3031 if (lvalue_p (args
[i
]))
3032 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3034 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
3040 for (; convs
; convs
= TREE_CHAIN (convs
))
3042 type
= TREE_TYPE (convs
);
3045 && (!TYPE_REF_P (type
)
3046 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
3049 if (code
== COND_EXPR
&& TYPE_REF_P (type
))
3050 vec_safe_push (types
[i
], type
);
3052 type
= non_reference (type
);
3053 if (i
!= 0 || ! ref1
)
3055 type
= cv_unqualified (type_decays_to (type
));
3056 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
3057 vec_safe_push (types
[i
], type
);
3058 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3059 type
= type_promotes_to (type
);
3062 if (! vec_member (type
, types
[i
]))
3063 vec_safe_push (types
[i
], type
);
3068 if (code
== COND_EXPR
&& lvalue_p (args
[i
]))
3069 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3070 type
= non_reference (argtypes
[i
]);
3071 if (i
!= 0 || ! ref1
)
3073 type
= cv_unqualified (type_decays_to (type
));
3074 if (enum_p
&& UNSCOPED_ENUM_P (type
))
3075 vec_safe_push (types
[i
], type
);
3076 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3077 type
= type_promotes_to (type
);
3079 vec_safe_push (types
[i
], type
);
3083 /* Run through the possible parameter types of both arguments,
3084 creating candidates with those parameter types. */
3085 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
3090 if (!types
[1]->is_empty ())
3091 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
3092 add_builtin_candidate
3093 (candidates
, code
, code2
, fnname
, t
,
3094 u
, args
, argtypes
, flags
, complain
);
3096 add_builtin_candidate
3097 (candidates
, code
, code2
, fnname
, t
,
3098 NULL_TREE
, args
, argtypes
, flags
, complain
);
3101 release_tree_vector (types
[0]);
3102 release_tree_vector (types
[1]);
3106 /* If TMPL can be successfully instantiated as indicated by
3107 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3109 TMPL is the template. EXPLICIT_TARGS are any explicit template
3110 arguments. ARGLIST is the arguments provided at the call-site.
3111 This does not change ARGLIST. The RETURN_TYPE is the desired type
3112 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3113 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3114 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3116 static struct z_candidate
*
3117 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
3118 tree ctype
, tree explicit_targs
, tree first_arg
,
3119 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3120 tree access_path
, tree conversion_path
,
3121 int flags
, tree obj
, unification_kind_t strict
,
3122 tsubst_flags_t complain
)
3124 int ntparms
= DECL_NTPARMS (tmpl
);
3125 tree targs
= make_tree_vec (ntparms
);
3126 unsigned int len
= vec_safe_length (arglist
);
3127 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
3128 unsigned int skip_without_in_chrg
= 0;
3129 tree first_arg_without_in_chrg
= first_arg
;
3130 tree
*args_without_in_chrg
;
3131 unsigned int nargs_without_in_chrg
;
3132 unsigned int ia
, ix
;
3134 struct z_candidate
*cand
;
3136 struct rejection_reason
*reason
= NULL
;
3138 conversion
**convs
= NULL
;
3140 /* We don't do deduction on the in-charge parameter, the VTT
3141 parameter or 'this'. */
3142 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
3144 if (first_arg_without_in_chrg
!= NULL_TREE
)
3145 first_arg_without_in_chrg
= NULL_TREE
;
3146 else if (return_type
&& strict
== DEDUCE_CALL
)
3147 /* We're deducing for a call to the result of a template conversion
3148 function, so the args don't contain 'this'; leave them alone. */;
3150 ++skip_without_in_chrg
;
3153 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
3154 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
3155 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
3157 if (first_arg_without_in_chrg
!= NULL_TREE
)
3158 first_arg_without_in_chrg
= NULL_TREE
;
3160 ++skip_without_in_chrg
;
3163 if (len
< skip_without_in_chrg
)
3166 if (DECL_CONSTRUCTOR_P (tmpl
) && nargs
== 2
3167 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg
),
3168 TREE_TYPE ((*arglist
)[0])))
3170 /* 12.8/6 says, "A declaration of a constructor for a class X is
3171 ill-formed if its first parameter is of type (optionally cv-qualified)
3172 X and either there are no other parameters or else all other
3173 parameters have default arguments. A member function template is never
3174 instantiated to produce such a constructor signature."
3176 So if we're trying to copy an object of the containing class, don't
3177 consider a template constructor that has a first parameter type that
3178 is just a template parameter, as we would deduce a signature that we
3179 would then reject in the code below. */
3180 if (tree firstparm
= FUNCTION_FIRST_USER_PARMTYPE (tmpl
))
3182 firstparm
= TREE_VALUE (firstparm
);
3183 if (PACK_EXPANSION_P (firstparm
))
3184 firstparm
= PACK_EXPANSION_PATTERN (firstparm
);
3185 if (TREE_CODE (firstparm
) == TEMPLATE_TYPE_PARM
)
3187 gcc_assert (!explicit_targs
);
3188 reason
= invalid_copy_with_fn_template_rejection ();
3194 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
3195 + (len
- skip_without_in_chrg
));
3196 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
3198 if (first_arg_without_in_chrg
!= NULL_TREE
)
3200 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
3203 for (ix
= skip_without_in_chrg
;
3204 vec_safe_iterate (arglist
, ix
, &arg
);
3207 args_without_in_chrg
[ia
] = arg
;
3210 gcc_assert (ia
== nargs_without_in_chrg
);
3212 errs
= errorcount
+sorrycount
;
3214 convs
= alloc_conversions (nargs
);
3215 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
3216 args_without_in_chrg
,
3217 nargs_without_in_chrg
,
3218 return_type
, strict
, flags
, convs
,
3219 false, complain
& tf_decltype
);
3221 if (fn
== error_mark_node
)
3223 /* Don't repeat unification later if it already resulted in errors. */
3224 if (errorcount
+sorrycount
== errs
)
3225 reason
= template_unification_rejection (tmpl
, explicit_targs
,
3226 targs
, args_without_in_chrg
,
3227 nargs_without_in_chrg
,
3228 return_type
, strict
, flags
);
3230 reason
= template_unification_error_rejection ();
3234 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
3236 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
3237 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
3240 /* We're trying to produce a constructor with a prohibited signature,
3241 as discussed above; handle here any cases we didn't catch then,
3243 reason
= invalid_copy_with_fn_template_rejection ();
3248 if (obj
!= NULL_TREE
)
3249 /* Aha, this is a conversion function. */
3250 cand
= add_conv_candidate (candidates
, fn
, obj
, arglist
,
3251 access_path
, conversion_path
, complain
);
3253 cand
= add_function_candidate (candidates
, fn
, ctype
,
3254 first_arg
, arglist
, access_path
,
3255 conversion_path
, flags
, convs
, complain
);
3256 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
3257 /* This situation can occur if a member template of a template
3258 class is specialized. Then, instantiate_template might return
3259 an instantiation of the specialization, in which case the
3260 DECL_TI_TEMPLATE field will point at the original
3261 specialization. For example:
3263 template <class T> struct S { template <class U> void f(U);
3264 template <> void f(int) {}; };
3268 Here, TMPL will be template <class U> S<double>::f(U).
3269 And, instantiate template will give us the specialization
3270 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3271 for this will point at template <class T> template <> S<T>::f(int),
3272 so that we can find the definition. For the purposes of
3273 overload resolution, however, we want the original TMPL. */
3274 cand
->template_decl
= build_template_info (tmpl
, targs
);
3276 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3277 cand
->explicit_targs
= explicit_targs
;
3281 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3282 access_path
, conversion_path
, 0, reason
, flags
);
3286 static struct z_candidate
*
3287 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3288 tree explicit_targs
, tree first_arg
,
3289 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3290 tree access_path
, tree conversion_path
, int flags
,
3291 unification_kind_t strict
, tsubst_flags_t complain
)
3294 add_template_candidate_real (candidates
, tmpl
, ctype
,
3295 explicit_targs
, first_arg
, arglist
,
3296 return_type
, access_path
, conversion_path
,
3297 flags
, NULL_TREE
, strict
, complain
);
3300 /* Create an overload candidate for the conversion function template TMPL,
3301 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3302 pointer-to-function which will in turn be called with the argument list
3303 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3304 passed on to implicit_conversion. */
3306 static struct z_candidate
*
3307 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3309 const vec
<tree
, va_gc
> *arglist
,
3310 tree return_type
, tree access_path
,
3311 tree conversion_path
, tsubst_flags_t complain
)
3313 /* Making this work broke PR 71117 and 85118, so until the committee resolves
3314 core issue 2189, let's disable this candidate if there are any call
3320 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3321 NULL_TREE
, arglist
, return_type
, access_path
,
3322 conversion_path
, 0, obj
, DEDUCE_CALL
,
3326 /* The CANDS are the set of candidates that were considered for
3327 overload resolution. Return the set of viable candidates, or CANDS
3328 if none are viable. If any of the candidates were viable, set
3329 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3330 considered viable only if it is strictly viable. */
3332 static struct z_candidate
*
3333 splice_viable (struct z_candidate
*cands
,
3337 struct z_candidate
*viable
;
3338 struct z_candidate
**last_viable
;
3339 struct z_candidate
**cand
;
3340 bool found_strictly_viable
= false;
3342 /* Be strict inside templates, since build_over_call won't actually
3343 do the conversions to get pedwarns. */
3344 if (processing_template_decl
)
3348 last_viable
= &viable
;
3349 *any_viable_p
= false;
3354 struct z_candidate
*c
= *cand
;
3356 && (c
->viable
== 1 || TREE_CODE (c
->fn
) == TEMPLATE_DECL
))
3358 /* Be strict in the presence of a viable candidate. Also if
3359 there are template candidates, so that we get deduction errors
3360 for them instead of silently preferring a bad conversion. */
3362 if (viable
&& !found_strictly_viable
)
3364 /* Put any spliced near matches back onto the main list so
3365 that we see them if there is no strict match. */
3366 *any_viable_p
= false;
3367 *last_viable
= cands
;
3370 last_viable
= &viable
;
3374 if (strict_p
? c
->viable
== 1 : c
->viable
)
3379 last_viable
= &c
->next
;
3380 *any_viable_p
= true;
3382 found_strictly_viable
= true;
3388 return viable
? viable
: cands
;
3392 any_strictly_viable (struct z_candidate
*cands
)
3394 for (; cands
; cands
= cands
->next
)
3395 if (cands
->viable
== 1)
3400 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3401 words, it is about to become the "this" pointer for a member
3402 function call. Take the address of the object. */
3405 build_this (tree obj
)
3407 /* In a template, we are only concerned about the type of the
3408 expression, so we can take a shortcut. */
3409 if (processing_template_decl
)
3410 return build_address (obj
);
3412 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3415 /* Returns true iff functions are equivalent. Equivalent functions are
3416 not '==' only if one is a function-local extern function or if
3417 both are extern "C". */
3420 equal_functions (tree fn1
, tree fn2
)
3422 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3424 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3426 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3427 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3428 return decls_match (fn1
, fn2
);
3432 /* Print information about a candidate being rejected due to INFO. */
3435 print_conversion_rejection (location_t loc
, struct conversion_info
*info
)
3437 tree from
= info
->from
;
3439 from
= lvalue_type (from
);
3440 if (info
->n_arg
== -1)
3442 /* Conversion of implicit `this' argument failed. */
3443 if (!TYPE_P (info
->from
))
3444 /* A bad conversion for 'this' must be discarding cv-quals. */
3445 inform (loc
, " passing %qT as %<this%> "
3446 "argument discards qualifiers",
3449 inform (loc
, " no known conversion for implicit "
3450 "%<this%> parameter from %qH to %qI",
3451 from
, info
->to_type
);
3453 else if (!TYPE_P (info
->from
))
3455 if (info
->n_arg
>= 0)
3456 inform (loc
, " conversion of argument %d would be ill-formed:",
3458 perform_implicit_conversion (info
->to_type
, info
->from
,
3459 tf_warning_or_error
);
3461 else if (info
->n_arg
== -2)
3462 /* Conversion of conversion function return value failed. */
3463 inform (loc
, " no known conversion from %qH to %qI",
3464 from
, info
->to_type
);
3466 inform (loc
, " no known conversion for argument %d from %qH to %qI",
3467 info
->n_arg
+ 1, from
, info
->to_type
);
3470 /* Print information about a candidate with WANT parameters and we found
3474 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3476 inform_n (loc
, want
,
3477 " candidate expects %d argument, %d provided",
3478 " candidate expects %d arguments, %d provided",
3482 /* Print information about one overload candidate CANDIDATE. MSGSTR
3483 is the text to print before the candidate itself.
3485 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3486 to have been run through gettext by the caller. This wart makes
3487 life simpler in print_z_candidates and for the translators. */
3490 print_z_candidate (location_t loc
, const char *msgstr
,
3491 struct z_candidate
*candidate
)
3493 const char *msg
= (msgstr
== NULL
3495 : ACONCAT ((msgstr
, " ", NULL
)));
3496 tree fn
= candidate
->fn
;
3497 if (flag_new_inheriting_ctors
)
3498 fn
= strip_inheriting_ctors (fn
);
3499 location_t cloc
= location_of (fn
);
3501 if (identifier_p (fn
))
3504 if (candidate
->num_convs
== 3)
3505 inform (cloc
, "%s%<%D(%T, %T, %T)%> <built-in>", msg
, fn
,
3506 candidate
->convs
[0]->type
,
3507 candidate
->convs
[1]->type
,
3508 candidate
->convs
[2]->type
);
3509 else if (candidate
->num_convs
== 2)
3510 inform (cloc
, "%s%<%D(%T, %T)%> <built-in>", msg
, fn
,
3511 candidate
->convs
[0]->type
,
3512 candidate
->convs
[1]->type
);
3514 inform (cloc
, "%s%<%D(%T)%> <built-in>", msg
, fn
,
3515 candidate
->convs
[0]->type
);
3517 else if (TYPE_P (fn
))
3518 inform (cloc
, "%s%qT <conversion>", msg
, fn
);
3519 else if (candidate
->viable
== -1)
3520 inform (cloc
, "%s%#qD <near match>", msg
, fn
);
3521 else if (DECL_DELETED_FN (fn
))
3522 inform (cloc
, "%s%#qD <deleted>", msg
, fn
);
3524 inform (cloc
, "%s%#qD", msg
, fn
);
3525 if (fn
!= candidate
->fn
)
3527 cloc
= location_of (candidate
->fn
);
3528 inform (cloc
, " inherited here");
3530 /* Give the user some information about why this candidate failed. */
3531 if (candidate
->reason
!= NULL
)
3533 struct rejection_reason
*r
= candidate
->reason
;
3538 print_arity_information (cloc
, r
->u
.arity
.actual
,
3539 r
->u
.arity
.expected
);
3541 case rr_arg_conversion
:
3542 print_conversion_rejection (cloc
, &r
->u
.conversion
);
3544 case rr_bad_arg_conversion
:
3545 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
);
3547 case rr_explicit_conversion
:
3548 inform (cloc
, " return type %qT of explicit conversion function "
3549 "cannot be converted to %qT with a qualification "
3550 "conversion", r
->u
.conversion
.from
,
3551 r
->u
.conversion
.to_type
);
3553 case rr_template_conversion
:
3554 inform (cloc
, " conversion from return type %qT of template "
3555 "conversion function specialization to %qT is not an "
3556 "exact match", r
->u
.conversion
.from
,
3557 r
->u
.conversion
.to_type
);
3559 case rr_template_unification
:
3560 /* We use template_unification_error_rejection if unification caused
3561 actual non-SFINAE errors, in which case we don't need to repeat
3563 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3565 inform (cloc
, " substitution of deduced template arguments "
3566 "resulted in errors seen above");
3569 /* Re-run template unification with diagnostics. */
3570 inform (cloc
, " template argument deduction/substitution failed:");
3571 fn_type_unification (r
->u
.template_unification
.tmpl
,
3572 r
->u
.template_unification
.explicit_targs
,
3574 (r
->u
.template_unification
.num_targs
)),
3575 r
->u
.template_unification
.args
,
3576 r
->u
.template_unification
.nargs
,
3577 r
->u
.template_unification
.return_type
,
3578 r
->u
.template_unification
.strict
,
3579 r
->u
.template_unification
.flags
,
3582 case rr_invalid_copy
:
3584 " a constructor taking a single argument of its own "
3585 "class type is invalid");
3587 case rr_constraint_failure
:
3589 tree tmpl
= r
->u
.template_instantiation
.tmpl
;
3590 tree args
= r
->u
.template_instantiation
.targs
;
3591 diagnose_constraints (cloc
, tmpl
, args
);
3594 case rr_inherited_ctor
:
3595 inform (cloc
, " an inherited constructor is not a candidate for "
3596 "initialization from an expression of the same or derived "
3601 /* This candidate didn't have any issues or we failed to
3602 handle a particular code. Either way... */
3609 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3611 struct z_candidate
*cand1
;
3612 struct z_candidate
**cand2
;
3617 /* Remove non-viable deleted candidates. */
3619 for (cand2
= &cand1
; *cand2
; )
3621 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3622 && !(*cand2
)->viable
3623 && DECL_DELETED_FN ((*cand2
)->fn
))
3624 *cand2
= (*cand2
)->next
;
3626 cand2
= &(*cand2
)->next
;
3628 /* ...if there are any non-deleted ones. */
3632 /* There may be duplicates in the set of candidates. We put off
3633 checking this condition as long as possible, since we have no way
3634 to eliminate duplicates from a set of functions in less than n^2
3635 time. Now we are about to emit an error message, so it is more
3636 permissible to go slowly. */
3637 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3639 tree fn
= cand1
->fn
;
3640 /* Skip builtin candidates and conversion functions. */
3643 cand2
= &cand1
->next
;
3646 if (DECL_P ((*cand2
)->fn
)
3647 && equal_functions (fn
, (*cand2
)->fn
))
3648 *cand2
= (*cand2
)->next
;
3650 cand2
= &(*cand2
)->next
;
3654 for (; candidates
; candidates
= candidates
->next
)
3655 print_z_candidate (loc
, "candidate:", candidates
);
3658 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3659 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3660 the result of the conversion function to convert it to the final
3661 desired type. Merge the two sequences into a single sequence,
3662 and return the merged sequence. */
3665 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3668 bool bad
= user_seq
->bad_p
;
3670 gcc_assert (user_seq
->kind
== ck_user
);
3672 /* Find the end of the second conversion sequence. */
3673 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3675 /* The entire sequence is a user-conversion sequence. */
3676 (*t
)->user_conv_p
= true;
3681 if ((*t
)->rvaluedness_matches_p
)
3682 /* We're binding a reference directly to the result of the conversion.
3683 build_user_type_conversion_1 stripped the REFERENCE_TYPE from the return
3684 type, but we want it back. */
3685 user_seq
->type
= TREE_TYPE (TREE_TYPE (user_seq
->cand
->fn
));
3687 /* Replace the identity conversion with the user conversion
3694 /* Handle overload resolution for initializing an object of class type from
3695 an initializer list. First we look for a suitable constructor that
3696 takes a std::initializer_list; if we don't find one, we then look for a
3697 non-list constructor.
3699 Parameters are as for add_candidates, except that the arguments are in
3700 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3701 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3704 add_list_candidates (tree fns
, tree first_arg
,
3705 const vec
<tree
, va_gc
> *args
, tree totype
,
3706 tree explicit_targs
, bool template_only
,
3707 tree conversion_path
, tree access_path
,
3709 struct z_candidate
**candidates
,
3710 tsubst_flags_t complain
)
3712 gcc_assert (*candidates
== NULL
);
3714 /* We're looking for a ctor for list-initialization. */
3715 flags
|= LOOKUP_LIST_INIT_CTOR
;
3716 /* And we don't allow narrowing conversions. We also use this flag to
3717 avoid the copy constructor call for copy-list-initialization. */
3718 flags
|= LOOKUP_NO_NARROWING
;
3720 unsigned nart
= num_artificial_parms_for (OVL_FIRST (fns
)) - 1;
3721 tree init_list
= (*args
)[nart
];
3723 /* Always use the default constructor if the list is empty (DR 990). */
3724 if (CONSTRUCTOR_NELTS (init_list
) == 0
3725 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3727 /* If the class has a list ctor, try passing the list as a single
3728 argument first, but only consider list ctors. */
3729 else if (TYPE_HAS_LIST_CTOR (totype
))
3731 flags
|= LOOKUP_LIST_ONLY
;
3732 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3733 explicit_targs
, template_only
, conversion_path
,
3734 access_path
, flags
, candidates
, complain
);
3735 if (any_strictly_viable (*candidates
))
3739 /* Expand the CONSTRUCTOR into a new argument vec. */
3740 vec
<tree
, va_gc
> *new_args
;
3741 vec_alloc (new_args
, nart
+ CONSTRUCTOR_NELTS (init_list
));
3742 for (unsigned i
= 0; i
< nart
; ++i
)
3743 new_args
->quick_push ((*args
)[i
]);
3744 for (unsigned i
= 0; i
< CONSTRUCTOR_NELTS (init_list
); ++i
)
3745 new_args
->quick_push (CONSTRUCTOR_ELT (init_list
, i
)->value
);
3747 /* We aren't looking for list-ctors anymore. */
3748 flags
&= ~LOOKUP_LIST_ONLY
;
3749 /* We allow more user-defined conversions within an init-list. */
3750 flags
&= ~LOOKUP_NO_CONVERSION
;
3752 add_candidates (fns
, first_arg
, new_args
, NULL_TREE
,
3753 explicit_targs
, template_only
, conversion_path
,
3754 access_path
, flags
, candidates
, complain
);
3757 /* Returns the best overload candidate to perform the requested
3758 conversion. This function is used for three the overloading situations
3759 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3760 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3761 per [dcl.init.ref], so we ignore temporary bindings. */
3763 static struct z_candidate
*
3764 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3765 tsubst_flags_t complain
)
3767 struct z_candidate
*candidates
, *cand
;
3769 tree ctors
= NULL_TREE
;
3770 tree conv_fns
= NULL_TREE
;
3771 conversion
*conv
= NULL
;
3772 tree first_arg
= NULL_TREE
;
3773 vec
<tree
, va_gc
> *args
= NULL
;
3780 fromtype
= TREE_TYPE (expr
);
3782 /* We represent conversion within a hierarchy using RVALUE_CONV and
3783 BASE_CONV, as specified by [over.best.ics]; these become plain
3784 constructor calls, as specified in [dcl.init]. */
3785 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3786 || !DERIVED_FROM_P (totype
, fromtype
));
3788 if (CLASS_TYPE_P (totype
))
3789 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3790 creating a garbage BASELINK; constructors can't be inherited. */
3791 ctors
= get_class_binding (totype
, complete_ctor_identifier
);
3793 if (MAYBE_CLASS_TYPE_P (fromtype
))
3795 tree to_nonref
= non_reference (totype
);
3796 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3797 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3798 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3800 /* [class.conv.fct] A conversion function is never used to
3801 convert a (possibly cv-qualified) object to the (possibly
3802 cv-qualified) same object type (or a reference to it), to a
3803 (possibly cv-qualified) base class of that type (or a
3804 reference to it)... */
3807 conv_fns
= lookup_conversions (fromtype
);
3811 flags
|= LOOKUP_NO_CONVERSION
;
3812 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3813 flags
|= LOOKUP_NO_NARROWING
;
3815 /* It's OK to bind a temporary for converting constructor arguments, but
3816 not in converting the return value of a conversion operator. */
3817 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
3818 | (flags
& LOOKUP_NO_NARROWING
));
3819 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3823 int ctorflags
= flags
;
3825 first_arg
= build_dummy_object (totype
);
3827 /* We should never try to call the abstract or base constructor
3829 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors
))
3830 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors
)));
3832 args
= make_tree_vector_single (expr
);
3833 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3835 /* List-initialization. */
3836 add_list_candidates (ctors
, first_arg
, args
, totype
, NULL_TREE
,
3837 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3838 ctorflags
, &candidates
, complain
);
3842 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3843 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3844 ctorflags
, &candidates
, complain
);
3847 for (cand
= candidates
; cand
; cand
= cand
->next
)
3849 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3851 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3852 set, then this is copy-initialization. In that case, "The
3853 result of the call is then used to direct-initialize the
3854 object that is the destination of the copy-initialization."
3857 We represent this in the conversion sequence with an
3858 rvalue conversion, which means a constructor call. */
3859 if (!TYPE_REF_P (totype
)
3860 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3862 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3868 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3869 first_arg
= CONSTRUCTOR_ELT (expr
, 0)->value
;
3874 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3876 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3877 struct z_candidate
*old_candidates
;
3879 /* If we are called to convert to a reference type, we are trying to
3880 find a direct binding, so don't even consider temporaries. If
3881 we don't find a direct binding, the caller will try again to
3882 look for a temporary binding. */
3883 if (TYPE_REF_P (totype
))
3884 convflags
|= LOOKUP_NO_TEMP_BIND
;
3886 old_candidates
= candidates
;
3887 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
3889 conversion_path
, TYPE_BINFO (fromtype
),
3890 flags
, &candidates
, complain
);
3892 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
3894 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
3896 = implicit_conversion (totype
,
3899 /*c_cast_p=*/false, convflags
,
3902 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3903 copy-initialization. In that case, "The result of the
3904 call is then used to direct-initialize the object that is
3905 the destination of the copy-initialization." [dcl.init]
3907 We represent this in the conversion sequence with an
3908 rvalue conversion, which means a constructor call. But
3909 don't add a second rvalue conversion if there's already
3910 one there. Which there really shouldn't be, but it's
3911 harmless since we'd add it here anyway. */
3912 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
3913 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3914 ics
= build_conv (ck_rvalue
, totype
, ics
);
3916 cand
->second_conv
= ics
;
3921 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -2,
3924 else if (DECL_NONCONVERTING_P (cand
->fn
)
3925 && ics
->rank
> cr_exact
)
3927 /* 13.3.1.5: For direct-initialization, those explicit
3928 conversion functions that are not hidden within S and
3929 yield type T or a type that can be converted to type T
3930 with a qualification conversion (4.4) are also candidate
3932 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3933 I've raised this issue with the committee. --jason 9/2011 */
3935 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
3937 else if (cand
->viable
== 1 && ics
->bad_p
)
3941 = bad_arg_conversion_rejection (NULL_TREE
, -2,
3944 else if (primary_template_specialization_p (cand
->fn
)
3945 && ics
->rank
> cr_exact
)
3947 /* 13.3.3.1.2: If the user-defined conversion is specified by
3948 a specialization of a conversion function template, the
3949 second standard conversion sequence shall have exact match
3952 cand
->reason
= template_conversion_rejection (rettype
, totype
);
3957 candidates
= splice_viable (candidates
, false, &any_viable_p
);
3961 release_tree_vector (args
);
3965 cand
= tourney (candidates
, complain
);
3968 if (complain
& tf_error
)
3970 error ("conversion from %qH to %qI is ambiguous",
3972 print_z_candidates (location_of (expr
), candidates
);
3975 cand
= candidates
; /* any one will do */
3976 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
3977 cand
->second_conv
->user_conv_p
= true;
3978 if (!any_strictly_viable (candidates
))
3979 cand
->second_conv
->bad_p
= true;
3980 if (flags
& LOOKUP_ONLYCONVERTING
)
3981 cand
->second_conv
->need_temporary_p
= true;
3982 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3983 ambiguous conversion is no worse than another user-defined
3990 if (!DECL_CONSTRUCTOR_P (cand
->fn
))
3991 convtype
= non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)));
3992 else if (cand
->second_conv
->kind
== ck_rvalue
)
3993 /* DR 5: [in the first step of copy-initialization]...if the function
3994 is a constructor, the call initializes a temporary of the
3995 cv-unqualified version of the destination type. */
3996 convtype
= cv_unqualified (totype
);
3999 /* Build the user conversion sequence. */
4003 build_identity_conv (TREE_TYPE (expr
), expr
));
4005 if (cand
->viable
== -1)
4008 /* Remember that this was a list-initialization. */
4009 if (flags
& LOOKUP_NO_NARROWING
)
4010 conv
->check_narrowing
= true;
4012 /* Combine it with the second conversion sequence. */
4013 cand
->second_conv
= merge_conversion_sequences (conv
,
4019 /* Wrapper for above. */
4022 build_user_type_conversion (tree totype
, tree expr
, int flags
,
4023 tsubst_flags_t complain
)
4025 struct z_candidate
*cand
;
4028 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4029 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
4033 if (cand
->second_conv
->kind
== ck_ambig
)
4034 ret
= error_mark_node
;
4037 expr
= convert_like (cand
->second_conv
, expr
, complain
);
4038 ret
= convert_from_reference (expr
);
4044 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4048 /* Subroutine of convert_nontype_argument.
4050 EXPR is an expression used in a context that requires a converted
4051 constant-expression, such as a template non-type parameter. Do any
4052 necessary conversions (that are permitted for converted
4053 constant-expressions) to convert it to the desired type.
4055 If conversion is successful, returns the converted expression;
4056 otherwise, returns error_mark_node. */
4059 build_converted_constant_expr (tree type
, tree expr
, tsubst_flags_t complain
)
4064 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
4066 if (error_operand_p (expr
))
4067 return error_mark_node
;
4069 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4070 p
= conversion_obstack_alloc (0);
4072 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
4074 LOOKUP_IMPLICIT
, complain
);
4076 /* A converted constant expression of type T is an expression, implicitly
4077 converted to type T, where the converted expression is a constant
4078 expression and the implicit conversion sequence contains only
4080 * user-defined conversions,
4081 * lvalue-to-rvalue conversions (7.1),
4082 * array-to-pointer conversions (7.2),
4083 * function-to-pointer conversions (7.3),
4084 * qualification conversions (7.5),
4085 * integral promotions (7.6),
4086 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4087 * null pointer conversions (7.11) from std::nullptr_t,
4088 * null member pointer conversions (7.12) from std::nullptr_t, and
4089 * function pointer conversions (7.13),
4091 and where the reference binding (if any) binds directly. */
4093 for (conversion
*c
= conv
;
4094 conv
&& c
->kind
!= ck_identity
;
4095 c
= next_conversion (c
))
4099 /* A conversion function is OK. If it isn't constexpr, we'll
4100 complain later that the argument isn't constant. */
4102 /* The lvalue-to-rvalue conversion is OK. */
4104 /* Array-to-pointer and function-to-pointer. */
4106 /* Function pointer conversions. */
4108 /* Qualification conversions. */
4113 if (c
->need_temporary_p
)
4115 if (complain
& tf_error
)
4116 error_at (loc
, "initializing %qH with %qI in converted "
4117 "constant expression does not bind directly",
4118 type
, next_conversion (c
)->type
);
4127 t
= next_conversion (c
)->type
;
4128 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
)
4129 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
4130 /* Integral promotion or conversion. */
4132 if (NULLPTR_TYPE_P (t
))
4133 /* Conversion from nullptr to pointer or pointer-to-member. */
4136 if (complain
& tf_error
)
4137 error_at (loc
, "conversion from %qH to %qI in a "
4138 "converted constant expression", t
, type
);
4147 /* Avoid confusing convert_nontype_argument by introducing
4148 a redundant conversion to the same reference type. */
4149 if (conv
&& conv
->kind
== ck_ref_bind
4150 && REFERENCE_REF_P (expr
))
4152 tree ref
= TREE_OPERAND (expr
, 0);
4153 if (same_type_p (type
, TREE_TYPE (ref
)))
4159 conv
->check_narrowing
= true;
4160 conv
->check_narrowing_const_only
= true;
4161 expr
= convert_like (conv
, expr
, complain
);
4165 if (complain
& tf_error
)
4166 error_at (loc
, "could not convert %qE from %qH to %qI", expr
,
4167 TREE_TYPE (expr
), type
);
4168 expr
= error_mark_node
;
4171 /* Free all the conversions we allocated. */
4172 obstack_free (&conversion_obstack
, p
);
4177 /* Do any initial processing on the arguments to a function call. */
4179 static vec
<tree
, va_gc
> *
4180 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
4185 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
4187 if (error_operand_p (arg
))
4189 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
4191 if (complain
& tf_error
)
4192 error ("invalid use of void expression");
4195 else if (invalid_nonstatic_memfn_p (arg
->exp
.locus
, arg
, complain
))
4201 /* Perform overload resolution on FN, which is called with the ARGS.
4203 Return the candidate function selected by overload resolution, or
4204 NULL if the event that overload resolution failed. In the case
4205 that overload resolution fails, *CANDIDATES will be the set of
4206 candidates considered, and ANY_VIABLE_P will be set to true or
4207 false to indicate whether or not any of the candidates were
4210 The ARGS should already have gone through RESOLVE_ARGS before this
4211 function is called. */
4213 static struct z_candidate
*
4214 perform_overload_resolution (tree fn
,
4215 const vec
<tree
, va_gc
> *args
,
4216 struct z_candidate
**candidates
,
4217 bool *any_viable_p
, tsubst_flags_t complain
)
4219 struct z_candidate
*cand
;
4220 tree explicit_targs
;
4223 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4225 explicit_targs
= NULL_TREE
;
4229 *any_viable_p
= true;
4232 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4233 || TREE_CODE (fn
) == TEMPLATE_DECL
4234 || TREE_CODE (fn
) == OVERLOAD
4235 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
4237 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4239 explicit_targs
= TREE_OPERAND (fn
, 1);
4240 fn
= TREE_OPERAND (fn
, 0);
4244 /* Add the various candidate functions. */
4245 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
4246 explicit_targs
, template_only
,
4247 /*conversion_path=*/NULL_TREE
,
4248 /*access_path=*/NULL_TREE
,
4250 candidates
, complain
);
4252 *candidates
= splice_viable (*candidates
, false, any_viable_p
);
4254 cand
= tourney (*candidates
, complain
);
4258 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4262 /* Print an error message about being unable to build a call to FN with
4263 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4264 be located; CANDIDATES is a possibly empty list of such
4268 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
,
4269 struct z_candidate
*candidates
)
4271 tree targs
= NULL_TREE
;
4272 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4274 targs
= TREE_OPERAND (fn
, 1);
4275 fn
= TREE_OPERAND (fn
, 0);
4277 tree name
= OVL_NAME (fn
);
4278 location_t loc
= location_of (name
);
4280 name
= lookup_template_function (name
, targs
);
4282 if (!any_strictly_viable (candidates
))
4283 error_at (loc
, "no matching function for call to %<%D(%A)%>",
4284 name
, build_tree_list_vec (args
));
4286 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
4287 name
, build_tree_list_vec (args
));
4289 print_z_candidates (loc
, candidates
);
4292 /* Return an expression for a call to FN (a namespace-scope function,
4293 or a static member function) with the ARGS. This may change
4297 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
,
4298 tsubst_flags_t complain
)
4300 struct z_candidate
*candidates
, *cand
;
4305 if (args
!= NULL
&& *args
!= NULL
)
4307 *args
= resolve_args (*args
, complain
);
4309 return error_mark_node
;
4313 tm_malloc_replacement (fn
);
4315 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4316 p
= conversion_obstack_alloc (0);
4318 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
4323 if (complain
& tf_error
)
4325 // If there is a single (non-viable) function candidate,
4326 // let the error be diagnosed by cp_build_function_call_vec.
4327 if (!any_viable_p
&& candidates
&& ! candidates
->next
4328 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
4329 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
4331 // Otherwise, emit notes for non-viable candidates.
4332 print_error_for_call_failure (fn
, *args
, candidates
);
4334 result
= error_mark_node
;
4338 int flags
= LOOKUP_NORMAL
;
4339 /* If fn is template_id_expr, the call has explicit template arguments
4340 (e.g. func<int>(5)), communicate this info to build_over_call
4341 through flags so that later we can use it to decide whether to warn
4342 about peculiar null pointer conversion. */
4343 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4345 /* If overload resolution selects a specialization of a
4346 function concept for non-dependent template arguments,
4347 the expression is true if the constraints are satisfied
4348 and false otherwise.
4350 NOTE: This is an extension of Concepts Lite TS that
4351 allows constraints to be used in expressions. */
4352 if (flag_concepts
&& !processing_template_decl
)
4354 tree tmpl
= DECL_TI_TEMPLATE (cand
->fn
);
4355 tree targs
= DECL_TI_ARGS (cand
->fn
);
4356 tree decl
= DECL_TEMPLATE_RESULT (tmpl
);
4357 if (DECL_DECLARED_CONCEPT_P (decl
))
4358 return evaluate_function_concept (decl
, targs
);
4361 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4364 result
= build_over_call (cand
, flags
, complain
);
4367 /* Free all the conversions we allocated. */
4368 obstack_free (&conversion_obstack
, p
);
4373 /* Build a call to a global operator new. FNNAME is the name of the
4374 operator (either "operator new" or "operator new[]") and ARGS are
4375 the arguments provided. This may change ARGS. *SIZE points to the
4376 total number of bytes required by the allocation, and is updated if
4377 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4378 be used. If this function determines that no cookie should be
4379 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4380 is not NULL_TREE, it is evaluated before calculating the final
4381 array size, and if it fails, the array size is replaced with
4382 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4383 is non-NULL, it will be set, upon return, to the allocation
4387 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4388 tree
*size
, tree
*cookie_size
,
4389 tree align_arg
, tree size_check
,
4390 tree
*fn
, tsubst_flags_t complain
)
4392 tree original_size
= *size
;
4394 struct z_candidate
*candidates
;
4395 struct z_candidate
*cand
= NULL
;
4400 /* Set to (size_t)-1 if the size check fails. */
4401 if (size_check
!= NULL_TREE
)
4403 tree errval
= TYPE_MAX_VALUE (sizetype
);
4404 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4405 errval
= throw_bad_array_new_length ();
4406 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4407 original_size
, errval
);
4409 vec_safe_insert (*args
, 0, *size
);
4410 *args
= resolve_args (*args
, complain
);
4412 return error_mark_node
;
4418 If this lookup fails to find the name, or if the allocated type
4419 is not a class type, the allocation function's name is looked
4420 up in the global scope.
4422 we disregard block-scope declarations of "operator new". */
4423 fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/false, 0, 0);
4424 fns
= lookup_arg_dependent (fnname
, fns
, *args
);
4428 vec
<tree
, va_gc
>* align_args
4429 = vec_copy_and_insert (*args
, align_arg
, 1);
4430 cand
= perform_overload_resolution (fns
, align_args
, &candidates
,
4431 &any_viable_p
, tf_none
);
4434 /* If no aligned allocation function matches, try again without the
4438 /* Figure out what function is being called. */
4440 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
4443 /* If no suitable function could be found, issue an error message
4447 if (complain
& tf_error
)
4448 print_error_for_call_failure (fns
, *args
, candidates
);
4449 return error_mark_node
;
4452 /* If a cookie is required, add some extra space. Whether
4453 or not a cookie is required cannot be determined until
4454 after we know which function was called. */
4457 bool use_cookie
= true;
4460 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4461 /* Skip the size_t parameter. */
4462 arg_types
= TREE_CHAIN (arg_types
);
4463 /* Check the remaining parameters (if any). */
4465 && TREE_CHAIN (arg_types
) == void_list_node
4466 && same_type_p (TREE_VALUE (arg_types
),
4469 /* If we need a cookie, adjust the number of bytes allocated. */
4472 /* Update the total size. */
4473 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4476 /* Set to (size_t)-1 if the size check fails. */
4477 gcc_assert (size_check
!= NULL_TREE
);
4478 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4479 *size
, TYPE_MAX_VALUE (sizetype
));
4481 /* Update the argument list to reflect the adjusted size. */
4482 (**args
)[0] = *size
;
4485 *cookie_size
= NULL_TREE
;
4488 /* Tell our caller which function we decided to call. */
4492 /* Build the CALL_EXPR. */
4493 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4496 /* Build a new call to operator(). This may change ARGS. */
4499 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4501 struct z_candidate
*candidates
= 0, *cand
;
4502 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4504 tree result
= NULL_TREE
;
4507 obj
= mark_lvalue_use (obj
);
4509 if (error_operand_p (obj
))
4510 return error_mark_node
;
4512 tree type
= TREE_TYPE (obj
);
4514 obj
= prep_operand (obj
);
4516 if (TYPE_PTRMEMFUNC_P (type
))
4518 if (complain
& tf_error
)
4519 /* It's no good looking for an overloaded operator() on a
4520 pointer-to-member-function. */
4521 error ("pointer-to-member function %qE cannot be called without "
4522 "an object; consider using %<.*%> or %<->*%>", obj
);
4523 return error_mark_node
;
4526 if (TYPE_BINFO (type
))
4528 fns
= lookup_fnfields (TYPE_BINFO (type
), call_op_identifier
, 1);
4529 if (fns
== error_mark_node
)
4530 return error_mark_node
;
4535 if (args
!= NULL
&& *args
!= NULL
)
4537 *args
= resolve_args (*args
, complain
);
4539 return error_mark_node
;
4542 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4543 p
= conversion_obstack_alloc (0);
4547 first_mem_arg
= obj
;
4549 add_candidates (BASELINK_FUNCTIONS (fns
),
4550 first_mem_arg
, *args
, NULL_TREE
,
4552 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4553 LOOKUP_NORMAL
, &candidates
, complain
);
4556 convs
= lookup_conversions (type
);
4558 for (; convs
; convs
= TREE_CHAIN (convs
))
4560 tree totype
= TREE_TYPE (convs
);
4562 if (TYPE_PTRFN_P (totype
)
4563 || TYPE_REFFN_P (totype
)
4564 || (TYPE_REF_P (totype
)
4565 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4566 for (ovl_iterator
iter (TREE_VALUE (convs
)); iter
; ++iter
)
4570 if (DECL_NONCONVERTING_P (fn
))
4573 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4574 add_template_conv_candidate
4575 (&candidates
, fn
, obj
, *args
, totype
,
4576 /*access_path=*/NULL_TREE
,
4577 /*conversion_path=*/NULL_TREE
, complain
);
4579 add_conv_candidate (&candidates
, fn
, obj
,
4580 *args
, /*conversion_path=*/NULL_TREE
,
4581 /*access_path=*/NULL_TREE
, complain
);
4585 /* Be strict here because if we choose a bad conversion candidate, the
4586 errors we get won't mention the call context. */
4587 candidates
= splice_viable (candidates
, true, &any_viable_p
);
4590 if (complain
& tf_error
)
4592 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4593 build_tree_list_vec (*args
));
4594 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4596 result
= error_mark_node
;
4600 cand
= tourney (candidates
, complain
);
4603 if (complain
& tf_error
)
4605 error ("call of %<(%T) (%A)%> is ambiguous",
4606 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4607 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4609 result
= error_mark_node
;
4611 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4612 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
)
4613 && DECL_OVERLOADED_OPERATOR_IS (cand
->fn
, CALL_EXPR
))
4614 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4617 if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
4618 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
,
4622 gcc_checking_assert (TYPE_P (cand
->fn
));
4623 obj
= convert_like (cand
->convs
[0], obj
, complain
);
4625 obj
= convert_from_reference (obj
);
4626 result
= cp_build_function_call_vec (obj
, args
, complain
);
4630 /* Free all the conversions we allocated. */
4631 obstack_free (&conversion_obstack
, p
);
4636 /* Wrapper for above. */
4639 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4642 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4643 ret
= build_op_call_1 (obj
, args
, complain
);
4644 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4648 /* Called by op_error to prepare format strings suitable for the error
4649 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4650 and a suffix (controlled by NTYPES). */
4653 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4657 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4658 : G_("no match for "), errmsg
, NULL
);
4661 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4662 else if (ntypes
== 2)
4663 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4665 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4671 op_error (location_t loc
, enum tree_code code
, enum tree_code code2
,
4672 tree arg1
, tree arg2
, tree arg3
, bool match
)
4674 bool assop
= code
== MODIFY_EXPR
;
4675 const char *opname
= OVL_OP_INFO (assop
, assop
? code2
: code
)->name
;
4680 if (flag_diagnostics_show_caret
)
4681 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4683 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4685 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4686 "in %<%E ? %E : %E%>"), 3, match
),
4688 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4691 case POSTINCREMENT_EXPR
:
4692 case POSTDECREMENT_EXPR
:
4693 if (flag_diagnostics_show_caret
)
4694 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4695 opname
, TREE_TYPE (arg1
));
4697 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4699 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4703 if (flag_diagnostics_show_caret
)
4704 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4705 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4707 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4709 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4714 if (flag_diagnostics_show_caret
)
4715 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4716 opname
, TREE_TYPE (arg1
));
4718 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4719 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4724 if (flag_diagnostics_show_caret
)
4725 error_at (loc
, op_error_string (G_("%<operator%s%>"), 2, match
),
4726 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4728 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4730 opname
, arg1
, opname
, arg2
,
4731 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4733 if (flag_diagnostics_show_caret
)
4734 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4735 opname
, TREE_TYPE (arg1
));
4737 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4739 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4744 /* Return the implicit conversion sequence that could be used to
4745 convert E1 to E2 in [expr.cond]. */
4748 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4750 tree t1
= non_reference (TREE_TYPE (e1
));
4751 tree t2
= non_reference (TREE_TYPE (e2
));
4757 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4758 implicitly converted (clause _conv_) to the type "lvalue reference to
4759 T2", subject to the constraint that in the conversion the
4760 reference must bind directly (_dcl.init.ref_) to an lvalue.
4762 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4763 implicitly converted to the type "rvalue reference to T2", subject to
4764 the constraint that the reference must bind directly. */
4767 tree rtype
= cp_build_reference_type (t2
, !lvalue_p (e2
));
4768 conv
= implicit_conversion (rtype
,
4772 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4773 |LOOKUP_ONLYCONVERTING
,
4775 if (conv
&& !conv
->bad_p
)
4779 /* If E2 is a prvalue or if neither of the conversions above can be done
4780 and at least one of the operands has (possibly cv-qualified) class
4782 if (!CLASS_TYPE_P (t1
) && !CLASS_TYPE_P (t2
))
4787 If E1 and E2 have class type, and the underlying class types are
4788 the same or one is a base class of the other: E1 can be converted
4789 to match E2 if the class of T2 is the same type as, or a base
4790 class of, the class of T1, and the cv-qualification of T2 is the
4791 same cv-qualification as, or a greater cv-qualification than, the
4792 cv-qualification of T1. If the conversion is applied, E1 is
4793 changed to an rvalue of type T2 that still refers to the original
4794 source class object (or the appropriate subobject thereof). */
4795 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4796 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4798 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4800 conv
= build_identity_conv (t1
, e1
);
4801 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4802 TYPE_MAIN_VARIANT (t2
)))
4803 conv
= build_conv (ck_base
, t2
, conv
);
4805 conv
= build_conv (ck_rvalue
, t2
, conv
);
4814 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4815 converted to the type that expression E2 would have if E2 were
4816 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4817 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4818 LOOKUP_IMPLICIT
, complain
);
4821 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4822 arguments to the conditional expression. */
4825 build_conditional_expr_1 (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
4826 tsubst_flags_t complain
)
4830 tree result
= NULL_TREE
;
4831 tree result_type
= NULL_TREE
;
4832 bool is_glvalue
= true;
4833 struct z_candidate
*candidates
= 0;
4834 struct z_candidate
*cand
;
4836 tree orig_arg2
, orig_arg3
;
4838 /* As a G++ extension, the second argument to the conditional can be
4839 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4840 c'.) If the second operand is omitted, make sure it is
4841 calculated only once. */
4844 if (complain
& tf_error
)
4845 pedwarn (loc
, OPT_Wpedantic
,
4846 "ISO C++ forbids omitting the middle term of a ?: expression");
4848 if ((complain
& tf_warning
) && !truth_value_p (TREE_CODE (arg1
)))
4849 warn_for_omitted_condop (loc
, arg1
);
4851 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4852 if (lvalue_p (arg1
))
4853 arg2
= arg1
= cp_stabilize_reference (arg1
);
4855 arg2
= arg1
= cp_save_expr (arg1
);
4858 /* If something has already gone wrong, just pass that fact up the
4860 if (error_operand_p (arg1
)
4861 || error_operand_p (arg2
)
4862 || error_operand_p (arg3
))
4863 return error_mark_node
;
4868 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
4870 tree arg1_type
= TREE_TYPE (arg1
);
4872 /* If arg1 is another cond_expr choosing between -1 and 0,
4873 then we can use its comparison. It may help to avoid
4874 additional comparison, produce more accurate diagnostics
4875 and enables folding. */
4876 if (TREE_CODE (arg1
) == VEC_COND_EXPR
4877 && integer_minus_onep (TREE_OPERAND (arg1
, 1))
4878 && integer_zerop (TREE_OPERAND (arg1
, 2)))
4879 arg1
= TREE_OPERAND (arg1
, 0);
4881 arg1
= force_rvalue (arg1
, complain
);
4882 arg2
= force_rvalue (arg2
, complain
);
4883 arg3
= force_rvalue (arg3
, complain
);
4885 /* force_rvalue can return error_mark on valid arguments. */
4886 if (error_operand_p (arg1
)
4887 || error_operand_p (arg2
)
4888 || error_operand_p (arg3
))
4889 return error_mark_node
;
4891 arg2_type
= TREE_TYPE (arg2
);
4892 arg3_type
= TREE_TYPE (arg3
);
4894 if (!VECTOR_TYPE_P (arg2_type
)
4895 && !VECTOR_TYPE_P (arg3_type
))
4897 /* Rely on the error messages of the scalar version. */
4898 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
4899 orig_arg2
, orig_arg3
, complain
);
4900 if (scal
== error_mark_node
)
4901 return error_mark_node
;
4902 tree stype
= TREE_TYPE (scal
);
4903 tree ctype
= TREE_TYPE (arg1_type
);
4904 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
4905 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
4907 if (complain
& tf_error
)
4908 error_at (loc
, "inferred scalar type %qT is not an integer or "
4909 "floating point type of the same size as %qT", stype
,
4910 COMPARISON_CLASS_P (arg1
)
4911 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
4913 return error_mark_node
;
4916 tree vtype
= build_opaque_vector_type (stype
,
4917 TYPE_VECTOR_SUBPARTS (arg1_type
));
4918 /* We could pass complain & tf_warning to unsafe_conversion_p,
4919 but the warnings (like Wsign-conversion) have already been
4920 given by the scalar build_conditional_expr_1. We still check
4921 unsafe_conversion_p to forbid truncating long long -> float. */
4922 if (unsafe_conversion_p (loc
, stype
, arg2
, NULL_TREE
, false))
4924 if (complain
& tf_error
)
4925 error_at (loc
, "conversion of scalar %qH to vector %qI "
4926 "involves truncation", arg2_type
, vtype
);
4927 return error_mark_node
;
4929 if (unsafe_conversion_p (loc
, stype
, arg3
, NULL_TREE
, false))
4931 if (complain
& tf_error
)
4932 error_at (loc
, "conversion of scalar %qH to vector %qI "
4933 "involves truncation", arg3_type
, vtype
);
4934 return error_mark_node
;
4937 arg2
= cp_convert (stype
, arg2
, complain
);
4938 arg2
= save_expr (arg2
);
4939 arg2
= build_vector_from_val (vtype
, arg2
);
4941 arg3
= cp_convert (stype
, arg3
, complain
);
4942 arg3
= save_expr (arg3
);
4943 arg3
= build_vector_from_val (vtype
, arg3
);
4947 if (VECTOR_TYPE_P (arg2_type
) != VECTOR_TYPE_P (arg3_type
))
4949 enum stv_conv convert_flag
=
4950 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
4951 complain
& tf_error
);
4953 switch (convert_flag
)
4956 return error_mark_node
;
4959 arg2
= save_expr (arg2
);
4960 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
4961 arg2
= build_vector_from_val (arg3_type
, arg2
);
4962 arg2_type
= TREE_TYPE (arg2
);
4967 arg3
= save_expr (arg3
);
4968 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
4969 arg3
= build_vector_from_val (arg2_type
, arg3
);
4970 arg3_type
= TREE_TYPE (arg3
);
4978 if (!same_type_p (arg2_type
, arg3_type
)
4979 || maybe_ne (TYPE_VECTOR_SUBPARTS (arg1_type
),
4980 TYPE_VECTOR_SUBPARTS (arg2_type
))
4981 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
4983 if (complain
& tf_error
)
4985 "incompatible vector types in conditional expression: "
4986 "%qT, %qT and %qT", TREE_TYPE (arg1
),
4987 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
4988 return error_mark_node
;
4991 if (!COMPARISON_CLASS_P (arg1
))
4993 tree cmp_type
= build_same_sized_truth_vector_type (arg1_type
);
4994 arg1
= build2 (NE_EXPR
, cmp_type
, arg1
, build_zero_cst (arg1_type
));
4996 return build3_loc (loc
, VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
5001 The first expression is implicitly converted to bool (clause
5003 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
5005 if (error_operand_p (arg1
))
5006 return error_mark_node
;
5010 If either the second or the third operand has type (possibly
5011 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
5012 array-to-pointer (_conv.array_), and function-to-pointer
5013 (_conv.func_) standard conversions are performed on the second
5014 and third operands. */
5015 arg2_type
= unlowered_expr_type (arg2
);
5016 arg3_type
= unlowered_expr_type (arg3
);
5017 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
5021 One of the following shall hold:
5023 --The second or the third operand (but not both) is a
5024 throw-expression (_except.throw_); the result is of the type
5025 and value category of the other.
5027 --Both the second and the third operands have type void; the
5028 result is of type void and is a prvalue. */
5029 if (TREE_CODE (arg2
) == THROW_EXPR
5030 && TREE_CODE (arg3
) != THROW_EXPR
)
5032 result_type
= arg3_type
;
5033 is_glvalue
= glvalue_p (arg3
);
5035 else if (TREE_CODE (arg2
) != THROW_EXPR
5036 && TREE_CODE (arg3
) == THROW_EXPR
)
5038 result_type
= arg2_type
;
5039 is_glvalue
= glvalue_p (arg2
);
5041 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
5043 result_type
= void_type_node
;
5048 if (complain
& tf_error
)
5050 if (VOID_TYPE_P (arg2_type
))
5051 error_at (cp_expr_loc_or_loc (arg3
, loc
),
5052 "second operand to the conditional operator "
5053 "is of type %<void%>, but the third operand is "
5054 "neither a throw-expression nor of type %<void%>");
5056 error_at (cp_expr_loc_or_loc (arg2
, loc
),
5057 "third operand to the conditional operator "
5058 "is of type %<void%>, but the second operand is "
5059 "neither a throw-expression nor of type %<void%>");
5061 return error_mark_node
;
5064 goto valid_operands
;
5068 Otherwise, if the second and third operand have different types,
5069 and either has (possibly cv-qualified) class type, or if both are
5070 glvalues of the same value category and the same type except for
5071 cv-qualification, an attempt is made to convert each of those operands
5072 to the type of the other. */
5073 else if (!same_type_p (arg2_type
, arg3_type
)
5074 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)
5075 || (same_type_ignoring_top_level_qualifiers_p (arg2_type
,
5077 && glvalue_p (arg2
) && glvalue_p (arg3
)
5078 && lvalue_p (arg2
) == lvalue_p (arg3
))))
5082 bool converted
= false;
5084 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5085 p
= conversion_obstack_alloc (0);
5087 conv2
= conditional_conversion (arg2
, arg3
, complain
);
5088 conv3
= conditional_conversion (arg3
, arg2
, complain
);
5092 If both can be converted, or one can be converted but the
5093 conversion is ambiguous, the program is ill-formed. If
5094 neither can be converted, the operands are left unchanged and
5095 further checking is performed as described below. If exactly
5096 one conversion is possible, that conversion is applied to the
5097 chosen operand and the converted operand is used in place of
5098 the original operand for the remainder of this section. */
5099 if ((conv2
&& !conv2
->bad_p
5100 && conv3
&& !conv3
->bad_p
)
5101 || (conv2
&& conv2
->kind
== ck_ambig
)
5102 || (conv3
&& conv3
->kind
== ck_ambig
))
5104 if (complain
& tf_error
)
5106 error_at (loc
, "operands to ?: have different types %qT and %qT",
5107 arg2_type
, arg3_type
);
5108 if (conv2
&& !conv2
->bad_p
&& conv3
&& !conv3
->bad_p
)
5109 inform (loc
, " and each type can be converted to the other");
5110 else if (conv2
&& conv2
->kind
== ck_ambig
)
5111 convert_like (conv2
, arg2
, complain
);
5113 convert_like (conv3
, arg3
, complain
);
5115 result
= error_mark_node
;
5117 else if (conv2
&& !conv2
->bad_p
)
5119 arg2
= convert_like (conv2
, arg2
, complain
);
5120 arg2
= convert_from_reference (arg2
);
5121 arg2_type
= TREE_TYPE (arg2
);
5122 /* Even if CONV2 is a valid conversion, the result of the
5123 conversion may be invalid. For example, if ARG3 has type
5124 "volatile X", and X does not have a copy constructor
5125 accepting a "volatile X&", then even if ARG2 can be
5126 converted to X, the conversion will fail. */
5127 if (error_operand_p (arg2
))
5128 result
= error_mark_node
;
5131 else if (conv3
&& !conv3
->bad_p
)
5133 arg3
= convert_like (conv3
, arg3
, complain
);
5134 arg3
= convert_from_reference (arg3
);
5135 arg3_type
= TREE_TYPE (arg3
);
5136 if (error_operand_p (arg3
))
5137 result
= error_mark_node
;
5141 /* Free all the conversions we allocated. */
5142 obstack_free (&conversion_obstack
, p
);
5147 /* If, after the conversion, both operands have class type,
5148 treat the cv-qualification of both operands as if it were the
5149 union of the cv-qualification of the operands.
5151 The standard is not clear about what to do in this
5152 circumstance. For example, if the first operand has type
5153 "const X" and the second operand has a user-defined
5154 conversion to "volatile X", what is the type of the second
5155 operand after this step? Making it be "const X" (matching
5156 the first operand) seems wrong, as that discards the
5157 qualification without actually performing a copy. Leaving it
5158 as "volatile X" seems wrong as that will result in the
5159 conditional expression failing altogether, even though,
5160 according to this step, the one operand could be converted to
5161 the type of the other. */
5163 && CLASS_TYPE_P (arg2_type
)
5164 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
5165 arg2_type
= arg3_type
=
5166 cp_build_qualified_type (arg2_type
,
5167 cp_type_quals (arg2_type
)
5168 | cp_type_quals (arg3_type
));
5173 If the second and third operands are glvalues of the same value
5174 category and have the same type, the result is of that type and
5176 if (((lvalue_p (arg2
) && lvalue_p (arg3
))
5177 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
5178 && same_type_p (arg2_type
, arg3_type
))
5180 result_type
= arg2_type
;
5181 arg2
= mark_lvalue_use (arg2
);
5182 arg3
= mark_lvalue_use (arg3
);
5183 goto valid_operands
;
5188 Otherwise, the result is an rvalue. If the second and third
5189 operand do not have the same type, and either has (possibly
5190 cv-qualified) class type, overload resolution is used to
5191 determine the conversions (if any) to be applied to the operands
5192 (_over.match.oper_, _over.built_). */
5194 if (!same_type_p (arg2_type
, arg3_type
)
5195 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
5201 /* Rearrange the arguments so that add_builtin_candidate only has
5202 to know about two args. In build_builtin_candidate, the
5203 arguments are unscrambled. */
5207 add_builtin_candidates (&candidates
,
5210 ovl_op_identifier (false, COND_EXPR
),
5212 LOOKUP_NORMAL
, complain
);
5216 If the overload resolution fails, the program is
5218 candidates
= splice_viable (candidates
, false, &any_viable_p
);
5221 if (complain
& tf_error
)
5222 error_at (loc
, "operands to ?: have different types %qT and %qT",
5223 arg2_type
, arg3_type
);
5224 return error_mark_node
;
5226 cand
= tourney (candidates
, complain
);
5229 if (complain
& tf_error
)
5231 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
5232 print_z_candidates (loc
, candidates
);
5234 return error_mark_node
;
5239 Otherwise, the conversions thus determined are applied, and
5240 the converted operands are used in place of the original
5241 operands for the remainder of this section. */
5242 conv
= cand
->convs
[0];
5243 arg1
= convert_like (conv
, arg1
, complain
);
5244 conv
= cand
->convs
[1];
5245 arg2
= convert_like (conv
, arg2
, complain
);
5246 arg2_type
= TREE_TYPE (arg2
);
5247 conv
= cand
->convs
[2];
5248 arg3
= convert_like (conv
, arg3
, complain
);
5249 arg3_type
= TREE_TYPE (arg3
);
5254 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5255 and function-to-pointer (_conv.func_) standard conversions are
5256 performed on the second and third operands.
5258 We need to force the lvalue-to-rvalue conversion here for class types,
5259 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5260 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5263 arg2
= force_rvalue (arg2
, complain
);
5264 if (!CLASS_TYPE_P (arg2_type
))
5265 arg2_type
= TREE_TYPE (arg2
);
5267 arg3
= force_rvalue (arg3
, complain
);
5268 if (!CLASS_TYPE_P (arg3_type
))
5269 arg3_type
= TREE_TYPE (arg3
);
5271 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5272 return error_mark_node
;
5276 After those conversions, one of the following shall hold:
5278 --The second and third operands have the same type; the result is of
5280 if (same_type_p (arg2_type
, arg3_type
))
5281 result_type
= arg2_type
;
5284 --The second and third operands have arithmetic or enumeration
5285 type; the usual arithmetic conversions are performed to bring
5286 them to a common type, and the result is of that type. */
5287 else if ((ARITHMETIC_TYPE_P (arg2_type
)
5288 || UNSCOPED_ENUM_P (arg2_type
))
5289 && (ARITHMETIC_TYPE_P (arg3_type
)
5290 || UNSCOPED_ENUM_P (arg3_type
)))
5292 /* In this case, there is always a common type. */
5293 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
5295 if (complain
& tf_warning
)
5296 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
5297 "implicit conversion from %qH to %qI to "
5298 "match other result of conditional",
5301 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5302 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
5304 if (TREE_CODE (orig_arg2
) == CONST_DECL
5305 && TREE_CODE (orig_arg3
) == CONST_DECL
5306 && DECL_CONTEXT (orig_arg2
) == DECL_CONTEXT (orig_arg3
))
5307 /* Two enumerators from the same enumeration can have different
5308 types when the enumeration is still being defined. */;
5309 else if (complain
& tf_warning
)
5310 warning_at (loc
, OPT_Wenum_compare
, "enumeral mismatch in "
5311 "conditional expression: %qT vs %qT",
5312 arg2_type
, arg3_type
);
5314 else if (extra_warnings
5315 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5316 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
5317 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
5318 && !same_type_p (arg2_type
,
5319 type_promotes_to (arg3_type
)))))
5321 if (complain
& tf_warning
)
5322 warning_at (loc
, OPT_Wextra
, "enumeral and non-enumeral type in "
5323 "conditional expression");
5326 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5327 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5331 --The second and third operands have pointer type, or one has
5332 pointer type and the other is a null pointer constant; pointer
5333 conversions (_conv.ptr_) and qualification conversions
5334 (_conv.qual_) are performed to bring them to their composite
5335 pointer type (_expr.rel_). The result is of the composite
5338 --The second and third operands have pointer to member type, or
5339 one has pointer to member type and the other is a null pointer
5340 constant; pointer to member conversions (_conv.mem_) and
5341 qualification conversions (_conv.qual_) are performed to bring
5342 them to a common type, whose cv-qualification shall match the
5343 cv-qualification of either the second or the third operand.
5344 The result is of the common type. */
5345 else if ((null_ptr_cst_p (arg2
)
5346 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
5347 || (null_ptr_cst_p (arg3
)
5348 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
5349 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
5350 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
5351 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
5353 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
5354 arg3
, CPO_CONDITIONAL_EXPR
,
5356 if (result_type
== error_mark_node
)
5357 return error_mark_node
;
5358 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5359 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5364 if (complain
& tf_error
)
5365 error_at (loc
, "operands to ?: have different types %qT and %qT",
5366 arg2_type
, arg3_type
);
5367 return error_mark_node
;
5370 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5371 return error_mark_node
;
5374 if (processing_template_decl
&& is_glvalue
)
5376 /* Let lvalue_kind know this was a glvalue. */
5377 tree arg
= (result_type
== arg2_type
? arg2
: arg3
);
5378 result_type
= cp_build_reference_type (result_type
, xvalue_p (arg
));
5381 result
= build3_loc (loc
, COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
5383 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5384 warn here, because the COND_EXPR will be turned into ARG2. */
5385 if (warn_duplicated_branches
5386 && (complain
& tf_warning
)
5387 && (arg2
== arg3
|| operand_equal_p (arg2
, arg3
, 0)))
5388 warning_at (EXPR_LOCATION (result
), OPT_Wduplicated_branches
,
5389 "this condition has identical branches");
5391 /* We can't use result_type below, as fold might have returned a
5396 /* Expand both sides into the same slot, hopefully the target of
5397 the ?: expression. We used to check for TARGET_EXPRs here,
5398 but now we sometimes wrap them in NOP_EXPRs so the test would
5400 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5401 result
= get_target_expr_sfinae (result
, complain
);
5402 /* If this expression is an rvalue, but might be mistaken for an
5403 lvalue, we must add a NON_LVALUE_EXPR. */
5404 result
= rvalue (result
);
5407 result
= force_paren_expr (result
);
5412 /* Wrapper for above. */
5415 build_conditional_expr (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
5416 tsubst_flags_t complain
)
5419 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5420 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5421 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5425 /* OPERAND is an operand to an expression. Perform necessary steps
5426 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5430 prep_operand (tree operand
)
5434 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5435 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5436 /* Make sure the template type is instantiated now. */
5437 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5443 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5444 OVERLOAD) to the CANDIDATES, returning an updated list of
5445 CANDIDATES. The ARGS are the arguments provided to the call;
5446 if FIRST_ARG is non-null it is the implicit object argument,
5447 otherwise the first element of ARGS is used if needed. The
5448 EXPLICIT_TARGS are explicit template arguments provided.
5449 TEMPLATE_ONLY is true if only template functions should be
5450 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5451 add_function_candidate. */
5454 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5456 tree explicit_targs
, bool template_only
,
5457 tree conversion_path
, tree access_path
,
5459 struct z_candidate
**candidates
,
5460 tsubst_flags_t complain
)
5463 const vec
<tree
, va_gc
> *non_static_args
;
5464 bool check_list_ctor
= false;
5465 bool check_converting
= false;
5466 unification_kind_t strict
;
5471 /* Precalculate special handling of constructors and conversion ops. */
5472 tree fn
= OVL_FIRST (fns
);
5473 if (DECL_CONV_FN_P (fn
))
5475 check_list_ctor
= false;
5476 check_converting
= (flags
& LOOKUP_ONLYCONVERTING
) != 0;
5477 if (flags
& LOOKUP_NO_CONVERSION
)
5478 /* We're doing return_type(x). */
5479 strict
= DEDUCE_CONV
;
5481 /* We're doing x.operator return_type(). */
5482 strict
= DEDUCE_EXACT
;
5483 /* [over.match.funcs] For conversion functions, the function
5484 is considered to be a member of the class of the implicit
5485 object argument for the purpose of defining the type of
5486 the implicit object parameter. */
5487 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5491 if (DECL_CONSTRUCTOR_P (fn
))
5493 check_list_ctor
= (flags
& LOOKUP_LIST_ONLY
) != 0;
5494 /* For list-initialization we consider explicit constructors
5495 and complain if one is chosen. */
5497 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5498 == LOOKUP_ONLYCONVERTING
);
5500 strict
= DEDUCE_CALL
;
5501 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5505 non_static_args
= args
;
5507 /* Delay creating the implicit this parameter until it is needed. */
5508 non_static_args
= NULL
;
5510 for (lkp_iterator
iter (fns
); iter
; ++iter
)
5514 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5516 if (check_list_ctor
&& !is_list_ctor (fn
))
5519 tree fn_first_arg
= NULL_TREE
;
5520 const vec
<tree
, va_gc
> *fn_args
= args
;
5522 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5524 /* Figure out where the object arg comes from. If this
5525 function is a non-static member and we didn't get an
5526 implicit object argument, move it out of args. */
5527 if (first_arg
== NULL_TREE
)
5531 vec
<tree
, va_gc
> *tempvec
;
5532 vec_alloc (tempvec
, args
->length () - 1);
5533 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5534 tempvec
->quick_push (arg
);
5535 non_static_args
= tempvec
;
5536 first_arg
= (*args
)[0];
5539 fn_first_arg
= first_arg
;
5540 fn_args
= non_static_args
;
5543 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5544 add_template_candidate (candidates
,
5556 else if (!template_only
)
5557 add_function_candidate (candidates
,
5570 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5571 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5574 op_is_ordered (tree_code code
)
5580 return (flag_strong_eval_order
> 1 ? -1 : 0);
5584 return (flag_strong_eval_order
> 1 ? 1 : 0);
5587 // Not overloadable (yet).
5589 // Only one argument.
5596 return (flag_strong_eval_order
? 1 : 0);
5604 build_new_op_1 (location_t loc
, enum tree_code code
, int flags
, tree arg1
,
5605 tree arg2
, tree arg3
, tree
*overload
, tsubst_flags_t complain
)
5607 struct z_candidate
*candidates
= 0, *cand
;
5608 vec
<tree
, va_gc
> *arglist
;
5610 tree result
= NULL_TREE
;
5611 bool result_valid_p
= false;
5612 enum tree_code code2
= NOP_EXPR
;
5613 enum tree_code code_orig_arg1
= ERROR_MARK
;
5614 enum tree_code code_orig_arg2
= ERROR_MARK
;
5620 if (error_operand_p (arg1
)
5621 || error_operand_p (arg2
)
5622 || error_operand_p (arg3
))
5623 return error_mark_node
;
5625 bool ismodop
= code
== MODIFY_EXPR
;
5628 code2
= TREE_CODE (arg3
);
5631 tree fnname
= ovl_op_identifier (ismodop
, ismodop
? code2
: code
);
5633 arg1
= prep_operand (arg1
);
5635 bool memonly
= false;
5640 case VEC_DELETE_EXPR
:
5642 /* Use build_op_new_call and build_op_delete_call instead. */
5646 /* Use build_op_call instead. */
5649 case TRUTH_ORIF_EXPR
:
5650 case TRUTH_ANDIF_EXPR
:
5651 case TRUTH_AND_EXPR
:
5653 /* These are saved for the sake of warn_logical_operator. */
5654 code_orig_arg1
= TREE_CODE (arg1
);
5655 code_orig_arg2
= TREE_CODE (arg2
);
5663 /* These are saved for the sake of maybe_warn_bool_compare. */
5664 code_orig_arg1
= TREE_CODE (TREE_TYPE (arg1
));
5665 code_orig_arg2
= TREE_CODE (TREE_TYPE (arg2
));
5668 /* =, ->, [], () must be non-static member functions. */
5670 if (code2
!= NOP_EXPR
)
5682 arg2
= prep_operand (arg2
);
5683 arg3
= prep_operand (arg3
);
5685 if (code
== COND_EXPR
)
5686 /* Use build_conditional_expr instead. */
5688 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5689 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5692 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5693 arg2
= integer_zero_node
;
5695 vec_alloc (arglist
, 3);
5696 arglist
->quick_push (arg1
);
5697 if (arg2
!= NULL_TREE
)
5698 arglist
->quick_push (arg2
);
5699 if (arg3
!= NULL_TREE
)
5700 arglist
->quick_push (arg3
);
5702 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5703 p
= conversion_obstack_alloc (0);
5705 /* Add namespace-scope operators to the list of functions to
5709 tree fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/true, 0, 0);
5710 fns
= lookup_arg_dependent (fnname
, fns
, arglist
);
5711 add_candidates (fns
, NULL_TREE
, arglist
, NULL_TREE
,
5712 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5713 flags
, &candidates
, complain
);
5718 args
[2] = NULL_TREE
;
5720 /* Add class-member operators to the candidate set. */
5721 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5725 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5726 if (fns
== error_mark_node
)
5728 result
= error_mark_node
;
5729 goto user_defined_result_ready
;
5732 add_candidates (BASELINK_FUNCTIONS (fns
),
5733 NULL_TREE
, arglist
, NULL_TREE
,
5735 BASELINK_BINFO (fns
),
5736 BASELINK_ACCESS_BINFO (fns
),
5737 flags
, &candidates
, complain
);
5739 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5740 only non-member functions that have type T1 or reference to
5741 cv-qualified-opt T1 for the first argument, if the first argument
5742 has an enumeration type, or T2 or reference to cv-qualified-opt
5743 T2 for the second argument, if the second argument has an
5744 enumeration type. Filter out those that don't match. */
5745 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5747 struct z_candidate
**candp
, **next
;
5749 for (candp
= &candidates
; *candp
; candp
= next
)
5751 tree parmlist
, parmtype
;
5752 int i
, nargs
= (arg2
? 2 : 1);
5757 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5759 for (i
= 0; i
< nargs
; ++i
)
5761 parmtype
= TREE_VALUE (parmlist
);
5763 if (TYPE_REF_P (parmtype
))
5764 parmtype
= TREE_TYPE (parmtype
);
5765 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5766 && (same_type_ignoring_top_level_qualifiers_p
5767 (TREE_TYPE (args
[i
]), parmtype
)))
5770 parmlist
= TREE_CHAIN (parmlist
);
5773 /* No argument has an appropriate type, so remove this
5774 candidate function from the list. */
5777 *candp
= cand
->next
;
5783 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5790 /* For these, the built-in candidates set is empty
5791 [over.match.oper]/3. We don't want non-strict matches
5792 because exact matches are always possible with built-in
5793 operators. The built-in candidate set for COMPONENT_REF
5794 would be empty too, but since there are no such built-in
5795 operators, we accept non-strict matches for them. */
5804 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5809 case POSTINCREMENT_EXPR
:
5810 case POSTDECREMENT_EXPR
:
5811 /* Don't try anything fancy if we're not allowed to produce
5813 if (!(complain
& tf_error
))
5814 return error_mark_node
;
5816 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5817 distinguish between prefix and postfix ++ and
5818 operator++() was used for both, so we allow this with
5822 const char *msg
= (flag_permissive
)
5823 ? G_("no %<%D(int)%> declared for postfix %qs,"
5824 " trying prefix operator instead")
5825 : G_("no %<%D(int)%> declared for postfix %qs");
5826 permerror (loc
, msg
, fnname
, OVL_OP_INFO (false, code
)->name
);
5829 if (!flag_permissive
)
5830 return error_mark_node
;
5832 if (code
== POSTINCREMENT_EXPR
)
5833 code
= PREINCREMENT_EXPR
;
5835 code
= PREDECREMENT_EXPR
;
5836 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5837 NULL_TREE
, overload
, complain
);
5840 /* The caller will deal with these. */
5845 result_valid_p
= true;
5849 if (complain
& tf_error
)
5851 /* If one of the arguments of the operator represents
5852 an invalid use of member function pointer, try to report
5853 a meaningful error ... */
5854 if (invalid_nonstatic_memfn_p (loc
, arg1
, tf_error
)
5855 || invalid_nonstatic_memfn_p (loc
, arg2
, tf_error
)
5856 || invalid_nonstatic_memfn_p (loc
, arg3
, tf_error
))
5857 /* We displayed the error message. */;
5860 /* ... Otherwise, report the more generic
5861 "no matching operator found" error */
5862 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
5863 print_z_candidates (loc
, candidates
);
5866 result
= error_mark_node
;
5872 cand
= tourney (candidates
, complain
);
5875 if (complain
& tf_error
)
5877 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
5878 print_z_candidates (loc
, candidates
);
5880 result
= error_mark_node
;
5882 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
5885 *overload
= cand
->fn
;
5887 if (resolve_args (arglist
, complain
) == NULL
)
5888 result
= error_mark_node
;
5890 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5892 if (trivial_fn_p (cand
->fn
))
5893 /* There won't be a CALL_EXPR. */;
5894 else if (result
&& result
!= error_mark_node
)
5896 tree call
= extract_call_expr (result
);
5897 CALL_EXPR_OPERATOR_SYNTAX (call
) = true;
5899 if (processing_template_decl
&& DECL_HIDDEN_FRIEND_P (cand
->fn
))
5900 /* This prevents build_new_function_call from discarding this
5901 function during instantiation of the enclosing template. */
5902 KOENIG_LOOKUP_P (call
) = 1;
5904 /* Specify evaluation order as per P0145R2. */
5905 CALL_EXPR_ORDERED_ARGS (call
) = false;
5906 switch (op_is_ordered (code
))
5909 CALL_EXPR_REVERSE_ARGS (call
) = true;
5913 CALL_EXPR_ORDERED_ARGS (call
) = true;
5923 /* Give any warnings we noticed during overload resolution. */
5924 if (cand
->warnings
&& (complain
& tf_warning
))
5926 struct candidate_warning
*w
;
5927 for (w
= cand
->warnings
; w
; w
= w
->next
)
5928 joust (cand
, w
->loser
, 1, complain
);
5931 /* Check for comparison of different enum types. */
5940 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
5941 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
5942 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
5943 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
5944 && (complain
& tf_warning
))
5946 warning (OPT_Wenum_compare
,
5947 "comparison between %q#T and %q#T",
5948 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
5955 /* We need to strip any leading REF_BIND so that bitfields
5956 don't cause errors. This should not remove any important
5957 conversions, because builtins don't apply to class
5958 objects directly. */
5959 conv
= cand
->convs
[0];
5960 if (conv
->kind
== ck_ref_bind
)
5961 conv
= next_conversion (conv
);
5962 arg1
= convert_like (conv
, arg1
, complain
);
5966 conv
= cand
->convs
[1];
5967 if (conv
->kind
== ck_ref_bind
)
5968 conv
= next_conversion (conv
);
5970 arg2
= decay_conversion (arg2
, complain
);
5972 /* We need to call warn_logical_operator before
5973 converting arg2 to a boolean_type, but after
5974 decaying an enumerator to its value. */
5975 if (complain
& tf_warning
)
5976 warn_logical_operator (loc
, code
, boolean_type_node
,
5977 code_orig_arg1
, arg1
,
5978 code_orig_arg2
, arg2
);
5980 arg2
= convert_like (conv
, arg2
, complain
);
5984 conv
= cand
->convs
[2];
5985 if (conv
->kind
== ck_ref_bind
)
5986 conv
= next_conversion (conv
);
5987 arg3
= convert_like (conv
, arg3
, complain
);
5993 user_defined_result_ready
:
5995 /* Free all the conversions we allocated. */
5996 obstack_free (&conversion_obstack
, p
);
5998 if (result
|| result_valid_p
)
6005 return cp_build_modify_expr (loc
, arg1
, code2
, arg2
, complain
);
6008 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
6010 case TRUTH_ANDIF_EXPR
:
6011 case TRUTH_ORIF_EXPR
:
6012 case TRUTH_AND_EXPR
:
6014 if (complain
& tf_warning
)
6015 warn_logical_operator (loc
, code
, boolean_type_node
,
6016 code_orig_arg1
, arg1
,
6017 code_orig_arg2
, arg2
);
6025 if ((complain
& tf_warning
)
6026 && ((code_orig_arg1
== BOOLEAN_TYPE
)
6027 ^ (code_orig_arg2
== BOOLEAN_TYPE
)))
6028 maybe_warn_bool_compare (loc
, code
, arg1
, arg2
);
6029 if (complain
& tf_warning
&& warn_tautological_compare
)
6030 warn_tautological_cmp (loc
, code
, arg1
, arg2
);
6035 case TRUNC_DIV_EXPR
:
6040 case TRUNC_MOD_EXPR
:
6044 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
6046 case UNARY_PLUS_EXPR
:
6049 case TRUTH_NOT_EXPR
:
6050 case PREINCREMENT_EXPR
:
6051 case POSTINCREMENT_EXPR
:
6052 case PREDECREMENT_EXPR
:
6053 case POSTDECREMENT_EXPR
:
6057 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
6060 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
6063 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
6067 /* The caller will deal with these. */
6079 /* Wrapper for above. */
6082 build_new_op (location_t loc
, enum tree_code code
, int flags
,
6083 tree arg1
, tree arg2
, tree arg3
,
6084 tree
*overload
, tsubst_flags_t complain
)
6087 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
6088 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
6089 overload
, complain
);
6090 timevar_cond_stop (TV_OVERLOAD
, subtime
);
6094 /* CALL was returned by some call-building function; extract the actual
6095 CALL_EXPR from any bits that have been tacked on, e.g. by
6096 convert_from_reference. */
6099 extract_call_expr (tree call
)
6101 while (TREE_CODE (call
) == COMPOUND_EXPR
)
6102 call
= TREE_OPERAND (call
, 1);
6103 if (REFERENCE_REF_P (call
))
6104 call
= TREE_OPERAND (call
, 0);
6105 if (TREE_CODE (call
) == TARGET_EXPR
)
6106 call
= TARGET_EXPR_INITIAL (call
);
6107 gcc_assert (TREE_CODE (call
) == CALL_EXPR
6108 || TREE_CODE (call
) == AGGR_INIT_EXPR
6109 || call
== error_mark_node
);
6113 /* Returns true if FN has two parameters, of which the second has type
6117 second_parm_is_size_t (tree fn
)
6119 tree t
= FUNCTION_ARG_CHAIN (fn
);
6120 if (!t
|| !same_type_p (TREE_VALUE (t
), size_type_node
))
6123 if (t
== void_list_node
)
6125 if (aligned_new_threshold
&& t
6126 && same_type_p (TREE_VALUE (t
), align_type_node
)
6127 && TREE_CHAIN (t
) == void_list_node
)
6132 /* True if T, an allocation function, has std::align_val_t as its second
6136 aligned_allocation_fn_p (tree t
)
6138 if (!aligned_new_threshold
)
6141 tree a
= FUNCTION_ARG_CHAIN (t
);
6142 return (a
&& same_type_p (TREE_VALUE (a
), align_type_node
));
6145 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6146 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6147 std::align_val_t. */
6150 aligned_deallocation_fn_p (tree t
)
6152 if (!aligned_new_threshold
)
6155 /* A template instance is never a usual deallocation function,
6156 regardless of its signature. */
6157 if (TREE_CODE (t
) == TEMPLATE_DECL
6158 || primary_template_specialization_p (t
))
6161 tree a
= FUNCTION_ARG_CHAIN (t
);
6162 if (same_type_p (TREE_VALUE (a
), align_type_node
)
6163 && TREE_CHAIN (a
) == void_list_node
)
6165 if (!same_type_p (TREE_VALUE (a
), size_type_node
))
6168 if (a
&& same_type_p (TREE_VALUE (a
), align_type_node
)
6169 && TREE_CHAIN (a
) == void_list_node
)
6174 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6175 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6178 usual_deallocation_fn_p (tree t
)
6180 /* A template instance is never a usual deallocation function,
6181 regardless of its signature. */
6182 if (TREE_CODE (t
) == TEMPLATE_DECL
6183 || primary_template_specialization_p (t
))
6186 /* If a class T has a member deallocation function named operator delete
6187 with exactly one parameter, then that function is a usual
6188 (non-placement) deallocation function. If class T does not declare
6189 such an operator delete but does declare a member deallocation
6190 function named operator delete with exactly two parameters, the second
6191 of which has type std::size_t (18.2), then this function is a usual
6192 deallocation function. */
6193 bool global
= DECL_NAMESPACE_SCOPE_P (t
);
6194 tree chain
= FUNCTION_ARG_CHAIN (t
);
6197 if (chain
== void_list_node
6198 || ((!global
|| flag_sized_deallocation
)
6199 && second_parm_is_size_t (t
)))
6201 if (aligned_deallocation_fn_p (t
))
6206 /* Build a call to operator delete. This has to be handled very specially,
6207 because the restrictions on what signatures match are different from all
6208 other call instances. For a normal delete, only a delete taking (void *)
6209 or (void *, size_t) is accepted. For a placement delete, only an exact
6210 match with the placement new is accepted.
6212 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6213 ADDR is the pointer to be deleted.
6214 SIZE is the size of the memory block to be deleted.
6215 GLOBAL_P is true if the delete-expression should not consider
6216 class-specific delete operators.
6217 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6219 If this call to "operator delete" is being generated as part to
6220 deallocate memory allocated via a new-expression (as per [expr.new]
6221 which requires that if the initialization throws an exception then
6222 we call a deallocation function), then ALLOC_FN is the allocation
6226 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
6227 bool global_p
, tree placement
,
6228 tree alloc_fn
, tsubst_flags_t complain
)
6230 tree fn
= NULL_TREE
;
6231 tree fns
, fnname
, type
, t
;
6233 if (addr
== error_mark_node
)
6234 return error_mark_node
;
6236 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
6238 fnname
= ovl_op_identifier (false, code
);
6240 if (CLASS_TYPE_P (type
)
6241 && COMPLETE_TYPE_P (complete_type (type
))
6245 If the result of the lookup is ambiguous or inaccessible, or if
6246 the lookup selects a placement deallocation function, the
6247 program is ill-formed.
6249 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6251 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
6252 if (fns
== error_mark_node
)
6253 return error_mark_node
;
6258 if (fns
== NULL_TREE
)
6259 fns
= lookup_name_nonclass (fnname
);
6261 /* Strip const and volatile from addr. */
6262 addr
= cp_convert (ptr_type_node
, addr
, complain
);
6266 /* "A declaration of a placement deallocation function matches the
6267 declaration of a placement allocation function if it has the same
6268 number of parameters and, after parameter transformations (8.3.5),
6269 all parameter types except the first are identical."
6271 So we build up the function type we want and ask instantiate_type
6272 to get it for us. */
6273 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
6274 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
6275 t
= build_function_type (void_type_node
, t
);
6277 fn
= instantiate_type (t
, fns
, tf_none
);
6278 if (fn
== error_mark_node
)
6281 fn
= MAYBE_BASELINK_FUNCTIONS (fn
);
6283 /* "If the lookup finds the two-parameter form of a usual deallocation
6284 function (3.7.4.2) and that function, considered as a placement
6285 deallocation function, would have been selected as a match for the
6286 allocation function, the program is ill-formed." */
6287 if (second_parm_is_size_t (fn
))
6289 const char *const msg1
6290 = G_("exception cleanup for this placement new selects "
6291 "non-placement operator delete");
6292 const char *const msg2
6293 = G_("%qD is a usual (non-placement) deallocation "
6294 "function in C++14 (or with -fsized-deallocation)");
6296 /* But if the class has an operator delete (void *), then that is
6297 the usual deallocation function, so we shouldn't complain
6298 about using the operator delete (void *, size_t). */
6299 if (DECL_CLASS_SCOPE_P (fn
))
6300 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
));
6304 if (usual_deallocation_fn_p (elt
)
6305 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
6308 /* Before C++14 a two-parameter global deallocation function is
6309 always a placement deallocation function, but warn if
6311 else if (!flag_sized_deallocation
)
6313 if ((complain
& tf_warning
)
6314 && warning (OPT_Wc__14_compat
, msg1
))
6315 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6319 if (complain
& tf_warning_or_error
)
6321 if (permerror (input_location
, msg1
))
6323 /* Only mention C++14 for namespace-scope delete. */
6324 if (DECL_NAMESPACE_SCOPE_P (fn
))
6325 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6327 inform (DECL_SOURCE_LOCATION (fn
),
6328 "%qD is a usual (non-placement) deallocation "
6333 return error_mark_node
;
6338 /* "Any non-placement deallocation function matches a non-placement
6339 allocation function. If the lookup finds a single matching
6340 deallocation function, that function will be called; otherwise, no
6341 deallocation function will be called." */
6342 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
)); iter
; ++iter
)
6345 if (usual_deallocation_fn_p (elt
))
6353 /* -- If the type has new-extended alignment, a function with a
6354 parameter of type std::align_val_t is preferred; otherwise a
6355 function without such a parameter is preferred. If exactly one
6356 preferred function is found, that function is selected and the
6357 selection process terminates. If more than one preferred
6358 function is found, all non-preferred functions are eliminated
6359 from further consideration. */
6360 if (aligned_new_threshold
)
6362 bool want_align
= type_has_new_extended_alignment (type
);
6363 bool fn_align
= aligned_deallocation_fn_p (fn
);
6364 bool elt_align
= aligned_deallocation_fn_p (elt
);
6366 if (elt_align
!= fn_align
)
6368 if (want_align
== elt_align
)
6374 /* -- If the deallocation functions have class scope, the one
6375 without a parameter of type std::size_t is selected. */
6377 if (DECL_CLASS_SCOPE_P (fn
))
6380 /* -- If the type is complete and if, for the second alternative
6381 (delete array) only, the operand is a pointer to a class type
6382 with a non-trivial destructor or a (possibly multi-dimensional)
6383 array thereof, the function with a parameter of type std::size_t
6386 -- Otherwise, it is unspecified whether a deallocation function
6387 with a parameter of type std::size_t is selected. */
6390 want_size
= COMPLETE_TYPE_P (type
);
6391 if (code
== VEC_DELETE_EXPR
6392 && !TYPE_VEC_NEW_USES_COOKIE (type
))
6393 /* We need a cookie to determine the array size. */
6396 bool fn_size
= second_parm_is_size_t (fn
);
6397 bool elt_size
= second_parm_is_size_t (elt
);
6398 gcc_assert (fn_size
!= elt_size
);
6399 if (want_size
== elt_size
)
6404 /* If we have a matching function, call it. */
6407 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6409 /* If the FN is a member function, make sure that it is
6411 if (BASELINK_P (fns
))
6412 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
6415 /* Core issue 901: It's ok to new a type with deleted delete. */
6416 if (DECL_DELETED_FN (fn
) && alloc_fn
)
6421 /* The placement args might not be suitable for overload
6422 resolution at this point, so build the call directly. */
6423 int nargs
= call_expr_nargs (placement
);
6424 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
6427 for (i
= 1; i
< nargs
; i
++)
6428 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
6429 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
6430 return error_mark_node
;
6431 return build_cxx_call (fn
, nargs
, argarray
, complain
);
6436 vec
<tree
, va_gc
> *args
= make_tree_vector ();
6437 args
->quick_push (addr
);
6438 if (second_parm_is_size_t (fn
))
6439 args
->quick_push (size
);
6440 if (aligned_deallocation_fn_p (fn
))
6442 tree al
= build_int_cst (align_type_node
, TYPE_ALIGN_UNIT (type
));
6443 args
->quick_push (al
);
6445 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
6446 release_tree_vector (args
);
6453 If no unambiguous matching deallocation function can be found,
6454 propagating the exception does not cause the object's memory to
6458 if ((complain
& tf_warning
)
6460 warning (0, "no corresponding deallocation function for %qD",
6465 if (complain
& tf_error
)
6466 error ("no suitable %<operator %s%> for %qT",
6467 OVL_OP_INFO (false, code
)->name
, type
);
6468 return error_mark_node
;
6471 /* If the current scope isn't allowed to access DECL along
6472 BASETYPE_PATH, give an error. The most derived class in
6473 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6474 the declaration to use in the error diagnostic. */
6477 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
6478 tsubst_flags_t complain
, access_failure_info
*afi
)
6480 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
6482 if (flag_new_inheriting_ctors
6483 && DECL_INHERITED_CTOR (decl
))
6485 /* 7.3.3/18: The additional constructors are accessible if they would be
6486 accessible when used to construct an object of the corresponding base
6488 decl
= strip_inheriting_ctors (decl
);
6489 basetype_path
= lookup_base (basetype_path
, DECL_CONTEXT (decl
),
6490 ba_any
, NULL
, complain
);
6493 if (!accessible_p (basetype_path
, decl
, true))
6495 if (complain
& tf_error
)
6497 if (flag_new_inheriting_ctors
)
6498 diag_decl
= strip_inheriting_ctors (diag_decl
);
6499 if (TREE_PRIVATE (decl
))
6501 error ("%q#D is private within this context", diag_decl
);
6502 inform (DECL_SOURCE_LOCATION (diag_decl
),
6503 "declared private here");
6505 afi
->record_access_failure (basetype_path
, diag_decl
);
6507 else if (TREE_PROTECTED (decl
))
6509 error ("%q#D is protected within this context", diag_decl
);
6510 inform (DECL_SOURCE_LOCATION (diag_decl
),
6511 "declared protected here");
6513 afi
->record_access_failure (basetype_path
, diag_decl
);
6517 error ("%q#D is inaccessible within this context", diag_decl
);
6518 inform (DECL_SOURCE_LOCATION (diag_decl
), "declared here");
6520 afi
->record_access_failure (basetype_path
, diag_decl
);
6529 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6530 bitwise or of LOOKUP_* values. If any errors are warnings are
6531 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6532 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6536 build_temp (tree expr
, tree type
, int flags
,
6537 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
6540 vec
<tree
, va_gc
> *args
;
6542 *diagnostic_kind
= DK_UNSPECIFIED
;
6544 /* If the source is a packed field, calling the copy constructor will require
6545 binding the field to the reference parameter to the copy constructor, and
6546 we'll end up with an infinite loop. If we can use a bitwise copy, then
6548 if ((lvalue_kind (expr
) & clk_packed
)
6549 && CLASS_TYPE_P (TREE_TYPE (expr
))
6550 && !type_has_nontrivial_copy_init (TREE_TYPE (expr
)))
6551 return get_target_expr_sfinae (expr
, complain
);
6553 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
6554 args
= make_tree_vector_single (expr
);
6555 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6556 &args
, type
, flags
, complain
);
6557 release_tree_vector (args
);
6558 if (warningcount
+ werrorcount
> savew
)
6559 *diagnostic_kind
= DK_WARNING
;
6560 else if (errorcount
> savee
)
6561 *diagnostic_kind
= DK_ERROR
;
6565 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6566 Also handle a subset of zero as null warnings.
6567 EXPR is implicitly converted to type TOTYPE.
6568 FN and ARGNUM are used for diagnostics. */
6571 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
6573 /* Issue warnings about peculiar, but valid, uses of NULL. */
6574 if (null_node_p (expr
) && TREE_CODE (totype
) != BOOLEAN_TYPE
6575 && ARITHMETIC_TYPE_P (totype
))
6577 source_location loc
=
6578 expansion_point_location_if_in_system_header (input_location
);
6581 warning_at (loc
, OPT_Wconversion_null
,
6582 "passing NULL to non-pointer argument %P of %qD",
6585 warning_at (loc
, OPT_Wconversion_null
,
6586 "converting to non-pointer type %qT from NULL", totype
);
6589 /* Issue warnings if "false" is converted to a NULL pointer */
6590 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
6591 && TYPE_PTR_P (totype
))
6594 warning_at (input_location
, OPT_Wconversion_null
,
6595 "converting %<false%> to pointer type for argument %P "
6596 "of %qD", argnum
, fn
);
6598 warning_at (input_location
, OPT_Wconversion_null
,
6599 "converting %<false%> to pointer type %qT", totype
);
6601 /* Handle zero as null pointer warnings for cases other
6602 than EQ_EXPR and NE_EXPR */
6603 else if (null_ptr_cst_p (expr
) &&
6604 (TYPE_PTR_OR_PTRMEM_P (totype
) || NULLPTR_TYPE_P (totype
)))
6606 source_location loc
=
6607 expansion_point_location_if_in_system_header (input_location
);
6608 maybe_warn_zero_as_null_pointer_constant (expr
, loc
);
6612 /* We gave a diagnostic during a conversion. If this was in the second
6613 standard conversion sequence of a user-defined conversion sequence, say
6614 which user-defined conversion. */
6617 maybe_print_user_conv_context (conversion
*convs
)
6619 if (convs
->user_conv_p
)
6620 for (conversion
*t
= convs
; t
; t
= next_conversion (t
))
6621 if (t
->kind
== ck_user
)
6623 print_z_candidate (0, " after user-defined conversion:",
6629 /* Locate the parameter with the given index within FNDECL.
6630 ARGNUM is zero based, -1 indicates the `this' argument of a method.
6631 Return the location of the FNDECL itself if there are problems. */
6634 get_fndecl_argument_location (tree fndecl
, int argnum
)
6639 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6640 for (i
= 0, param
= FUNCTION_FIRST_USER_PARM (fndecl
);
6641 i
< argnum
&& param
;
6642 i
++, param
= TREE_CHAIN (param
))
6645 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6646 return the location of FNDECL. */
6648 return DECL_SOURCE_LOCATION (fndecl
);
6650 return DECL_SOURCE_LOCATION (param
);
6653 /* Perform the conversions in CONVS on the expression EXPR. FN and
6654 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6655 indicates the `this' argument of a method. INNER is nonzero when
6656 being called to continue a conversion chain. It is negative when a
6657 reference binding will be applied, positive otherwise. If
6658 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6659 conversions will be emitted if appropriate. If C_CAST_P is true,
6660 this conversion is coming from a C-style cast; in that case,
6661 conversions to inaccessible bases are permitted. */
6664 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
6665 bool issue_conversion_warnings
,
6666 bool c_cast_p
, tsubst_flags_t complain
)
6668 tree totype
= convs
->type
;
6669 diagnostic_t diag_kind
;
6671 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
6673 if (convs
->bad_p
&& !(complain
& tf_error
))
6674 return error_mark_node
;
6677 && convs
->kind
!= ck_user
6678 && convs
->kind
!= ck_list
6679 && convs
->kind
!= ck_ambig
6680 && (convs
->kind
!= ck_ref_bind
6681 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
6682 && (convs
->kind
!= ck_rvalue
6683 || SCALAR_TYPE_P (totype
))
6684 && convs
->kind
!= ck_base
)
6686 bool complained
= false;
6687 conversion
*t
= convs
;
6689 /* Give a helpful error if this is bad because of excess braces. */
6690 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6691 && SCALAR_TYPE_P (totype
)
6692 && CONSTRUCTOR_NELTS (expr
) > 0
6693 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
6695 complained
= permerror (loc
, "too many braces around initializer "
6697 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6698 && CONSTRUCTOR_NELTS (expr
) == 1)
6699 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6702 /* Give a helpful error if this is bad because a conversion to bool
6703 from std::nullptr_t requires direct-initialization. */
6704 if (NULLPTR_TYPE_P (TREE_TYPE (expr
))
6705 && TREE_CODE (totype
) == BOOLEAN_TYPE
)
6706 complained
= permerror (loc
, "converting to %qH from %qI requires "
6707 "direct-initialization",
6708 totype
, TREE_TYPE (expr
));
6710 for (; t
; t
= next_conversion (t
))
6712 if (t
->kind
== ck_user
&& t
->cand
->reason
)
6714 complained
= permerror (loc
, "invalid user-defined conversion "
6715 "from %qH to %qI", TREE_TYPE (expr
),
6718 print_z_candidate (loc
, "candidate is:", t
->cand
);
6719 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6720 /*issue_conversion_warnings=*/false,
6723 if (convs
->kind
== ck_ref_bind
)
6724 expr
= convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
6725 LOOKUP_NORMAL
, NULL_TREE
,
6728 expr
= cp_convert (totype
, expr
, complain
);
6729 if (complained
&& fn
)
6730 inform (DECL_SOURCE_LOCATION (fn
),
6731 " initializing argument %P of %qD", argnum
, fn
);
6734 else if (t
->kind
== ck_user
|| !t
->bad_p
)
6736 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6737 /*issue_conversion_warnings=*/false,
6742 else if (t
->kind
== ck_ambig
)
6743 return convert_like_real (t
, expr
, fn
, argnum
,
6744 /*issue_conversion_warnings=*/false,
6747 else if (t
->kind
== ck_identity
)
6751 complained
= permerror (loc
, "invalid conversion from %qH to %qI",
6752 TREE_TYPE (expr
), totype
);
6753 if (complained
&& fn
)
6754 inform (get_fndecl_argument_location (fn
, argnum
),
6755 " initializing argument %P of %qD", argnum
, fn
);
6757 return cp_convert (totype
, expr
, complain
);
6760 if (issue_conversion_warnings
&& (complain
& tf_warning
))
6761 conversion_null_warnings (totype
, expr
, fn
, argnum
);
6763 switch (convs
->kind
)
6767 struct z_candidate
*cand
= convs
->cand
;
6770 /* We chose the surrogate function from add_conv_candidate, now we
6771 actually need to build the conversion. */
6772 cand
= build_user_type_conversion_1 (totype
, expr
,
6773 LOOKUP_NO_CONVERSION
, complain
);
6775 tree convfn
= cand
->fn
;
6777 /* When converting from an init list we consider explicit
6778 constructors, but actually trying to call one is an error. */
6779 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
6780 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
6781 /* Unless this is for direct-list-initialization. */
6782 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
)
6783 /* And in C++98 a default constructor can't be explicit. */
6784 && cxx_dialect
>= cxx11
)
6786 if (!(complain
& tf_error
))
6787 return error_mark_node
;
6788 location_t loc
= location_of (expr
);
6789 if (CONSTRUCTOR_NELTS (expr
) == 0
6790 && FUNCTION_FIRST_USER_PARMTYPE (convfn
) != void_list_node
)
6792 if (pedwarn (loc
, 0, "converting to %qT from initializer list "
6793 "would use explicit constructor %qD",
6795 inform (loc
, "in C++11 and above a default constructor "
6799 error ("converting to %qT from initializer list would use "
6800 "explicit constructor %qD", totype
, convfn
);
6803 /* If we're initializing from {}, it's value-initialization. */
6804 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6805 && CONSTRUCTOR_NELTS (expr
) == 0
6806 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
6808 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
6809 if (abstract_virtuals_error_sfinae (NULL_TREE
, totype
, complain
))
6810 return error_mark_node
;
6811 expr
= build_value_init (totype
, complain
);
6812 expr
= get_target_expr_sfinae (expr
, complain
);
6813 if (expr
!= error_mark_node
)
6815 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6816 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
6821 expr
= mark_rvalue_use (expr
);
6823 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
6825 expr
= build_over_call (cand
, LOOKUP_NORMAL
|LOOKUP_NO_CONVERSION
,
6828 /* If this is a constructor or a function returning an aggr type,
6829 we need to build up a TARGET_EXPR. */
6830 if (DECL_CONSTRUCTOR_P (convfn
))
6832 expr
= build_cplus_new (totype
, expr
, complain
);
6834 /* Remember that this was list-initialization. */
6835 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
6836 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6842 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
6844 int nelts
= CONSTRUCTOR_NELTS (expr
);
6846 expr
= build_value_init (totype
, complain
);
6847 else if (nelts
== 1)
6848 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6852 expr
= mark_use (expr
, /*rvalue_p=*/!convs
->rvaluedness_matches_p
,
6853 /*read_p=*/true, UNKNOWN_LOCATION
,
6854 /*reject_builtin=*/true);
6856 if (type_unknown_p (expr
))
6857 expr
= instantiate_type (totype
, expr
, complain
);
6858 if (expr
== null_node
6859 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
6860 /* If __null has been converted to an integer type, we do not want to
6861 continue to warn about uses of EXPR as an integer, rather than as a
6863 expr
= build_int_cst (totype
, 0);
6866 /* We leave bad_p off ck_ambig because overload resolution considers
6867 it valid, it just fails when we try to perform it. So we need to
6868 check complain here, too. */
6869 if (complain
& tf_error
)
6871 /* Call build_user_type_conversion again for the error. */
6872 int flags
= (convs
->need_temporary_p
6873 ? LOOKUP_IMPLICIT
: LOOKUP_NORMAL
);
6874 build_user_type_conversion (totype
, convs
->u
.expr
, flags
, complain
);
6875 gcc_assert (seen_error ());
6877 inform (DECL_SOURCE_LOCATION (fn
),
6878 " initializing argument %P of %qD", argnum
, fn
);
6880 return error_mark_node
;
6884 /* Conversion to std::initializer_list<T>. */
6885 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
6886 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
6887 unsigned len
= CONSTRUCTOR_NELTS (expr
);
6888 tree array
, val
, field
;
6889 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
6892 /* Convert all the elements. */
6893 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
6895 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
6896 false, false, complain
);
6897 if (sub
== error_mark_node
)
6899 if (!BRACE_ENCLOSED_INITIALIZER_P (val
)
6900 && !check_narrowing (TREE_TYPE (sub
), val
, complain
))
6901 return error_mark_node
;
6902 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
6903 if (!TREE_CONSTANT (sub
))
6904 TREE_CONSTANT (new_ctor
) = false;
6906 /* Build up the array. */
6907 elttype
= cp_build_qualified_type
6908 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
6909 array
= build_array_of_n_type (elttype
, len
);
6910 array
= finish_compound_literal (array
, new_ctor
, complain
);
6911 /* Take the address explicitly rather than via decay_conversion
6912 to avoid the error about taking the address of a temporary. */
6913 array
= cp_build_addr_expr (array
, complain
);
6914 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
6915 if (array
== error_mark_node
)
6916 return error_mark_node
;
6918 /* Build up the initializer_list object. Note: fail gracefully
6919 if the object cannot be completed because, for example, no
6920 definition is provided (c++/80956). */
6921 totype
= complete_type_or_maybe_complain (totype
, NULL_TREE
, complain
);
6923 return error_mark_node
;
6924 field
= next_initializable_field (TYPE_FIELDS (totype
));
6925 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
6926 field
= next_initializable_field (DECL_CHAIN (field
));
6927 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
6928 new_ctor
= build_constructor (totype
, vec
);
6929 return get_target_expr_sfinae (new_ctor
, complain
);
6933 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
6935 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6936 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
6937 real
= perform_implicit_conversion (TREE_TYPE (totype
),
6939 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
6941 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
6944 expr
= reshape_init (totype
, expr
, complain
);
6945 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
6947 if (expr
!= error_mark_node
)
6948 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6955 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
6956 convs
->kind
== ck_ref_bind
6957 ? issue_conversion_warnings
: false,
6958 c_cast_p
, complain
);
6959 if (expr
== error_mark_node
)
6960 return error_mark_node
;
6962 switch (convs
->kind
)
6965 expr
= decay_conversion (expr
, complain
);
6966 if (expr
== error_mark_node
)
6968 if (complain
& tf_error
)
6970 maybe_print_user_conv_context (convs
);
6972 inform (DECL_SOURCE_LOCATION (fn
),
6973 " initializing argument %P of %qD", argnum
, fn
);
6975 return error_mark_node
;
6978 if (! MAYBE_CLASS_TYPE_P (totype
))
6981 /* Don't introduce copies when passing arguments along to the inherited
6983 if (current_function_decl
6984 && flag_new_inheriting_ctors
6985 && DECL_INHERITED_CTOR (current_function_decl
))
6988 if (TREE_CODE (expr
) == TARGET_EXPR
6989 && TARGET_EXPR_LIST_INIT_P (expr
))
6990 /* Copy-list-initialization doesn't actually involve a copy. */
6995 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
6997 /* We are going to bind a reference directly to a base-class
6998 subobject of EXPR. */
6999 /* Build an expression for `*((base*) &expr)'. */
7000 expr
= convert_to_base (expr
, totype
,
7001 !c_cast_p
, /*nonnull=*/true, complain
);
7005 /* Copy-initialization where the cv-unqualified version of the source
7006 type is the same class as, or a derived class of, the class of the
7007 destination [is treated as direct-initialization]. [dcl.init] */
7008 flags
= LOOKUP_NORMAL
;
7009 if (convs
->user_conv_p
)
7010 /* This conversion is being done in the context of a user-defined
7011 conversion (i.e. the second step of copy-initialization), so
7012 don't allow any more. */
7013 flags
|= LOOKUP_NO_CONVERSION
;
7015 flags
|= LOOKUP_ONLYCONVERTING
;
7016 if (convs
->rvaluedness_matches_p
)
7017 /* standard_conversion got LOOKUP_PREFER_RVALUE. */
7018 flags
|= LOOKUP_PREFER_RVALUE
;
7019 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
7020 if (diag_kind
&& complain
)
7022 maybe_print_user_conv_context (convs
);
7024 inform (DECL_SOURCE_LOCATION (fn
),
7025 " initializing argument %P of %qD", argnum
, fn
);
7028 return build_cplus_new (totype
, expr
, complain
);
7032 tree ref_type
= totype
;
7034 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
7036 tree extype
= TREE_TYPE (expr
);
7037 if (TYPE_REF_IS_RVALUE (ref_type
)
7039 error_at (loc
, "cannot bind rvalue reference of type %qH to "
7040 "lvalue of type %qI", totype
, extype
);
7041 else if (!TYPE_REF_IS_RVALUE (ref_type
) && !lvalue_p (expr
)
7042 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
7043 error_at (loc
, "cannot bind non-const lvalue reference of "
7044 "type %qH to an rvalue of type %qI", totype
, extype
);
7045 else if (!reference_compatible_p (TREE_TYPE (totype
), extype
))
7046 error_at (loc
, "binding reference of type %qH to %qI "
7047 "discards qualifiers", totype
, extype
);
7050 maybe_print_user_conv_context (convs
);
7052 inform (DECL_SOURCE_LOCATION (fn
),
7053 " initializing argument %P of %qD", argnum
, fn
);
7054 return error_mark_node
;
7057 /* If necessary, create a temporary.
7059 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
7060 that need temporaries, even when their types are reference
7061 compatible with the type of reference being bound, so the
7062 upcoming call to cp_build_addr_expr doesn't fail. */
7063 if (convs
->need_temporary_p
7064 || TREE_CODE (expr
) == CONSTRUCTOR
7065 || TREE_CODE (expr
) == VA_ARG_EXPR
)
7067 /* Otherwise, a temporary of type "cv1 T1" is created and
7068 initialized from the initializer expression using the rules
7069 for a non-reference copy-initialization (8.5). */
7071 tree type
= TREE_TYPE (ref_type
);
7072 cp_lvalue_kind lvalue
= lvalue_kind (expr
);
7074 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7075 (type
, next_conversion (convs
)->type
));
7076 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
7077 && !TYPE_REF_IS_RVALUE (ref_type
))
7079 /* If the reference is volatile or non-const, we
7080 cannot create a temporary. */
7081 if (lvalue
& clk_bitfield
)
7082 error_at (loc
, "cannot bind bitfield %qE to %qT",
7084 else if (lvalue
& clk_packed
)
7085 error_at (loc
, "cannot bind packed field %qE to %qT",
7088 error_at (loc
, "cannot bind rvalue %qE to %qT",
7090 return error_mark_node
;
7092 /* If the source is a packed field, and we must use a copy
7093 constructor, then building the target expr will require
7094 binding the field to the reference parameter to the
7095 copy constructor, and we'll end up with an infinite
7096 loop. If we can use a bitwise copy, then we'll be
7098 if ((lvalue
& clk_packed
)
7099 && CLASS_TYPE_P (type
)
7100 && type_has_nontrivial_copy_init (type
))
7102 error_at (loc
, "cannot bind packed field %qE to %qT",
7104 return error_mark_node
;
7106 if (lvalue
& clk_bitfield
)
7108 expr
= convert_bitfield_to_declared_type (expr
);
7109 expr
= fold_convert (type
, expr
);
7111 expr
= build_target_expr_with_type (expr
, type
, complain
);
7114 /* Take the address of the thing to which we will bind the
7116 expr
= cp_build_addr_expr (expr
, complain
);
7117 if (expr
== error_mark_node
)
7118 return error_mark_node
;
7120 /* Convert it to a pointer to the type referred to by the
7121 reference. This will adjust the pointer if a derived to
7122 base conversion is being performed. */
7123 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
7125 /* Convert the pointer to the desired reference type. */
7126 return build_nop (ref_type
, expr
);
7130 return decay_conversion (expr
, complain
);
7133 /* ??? Should the address of a transaction-safe pointer point to the TM
7134 clone, and this conversion look up the primary function? */
7135 return build_nop (totype
, expr
);
7138 /* Warn about deprecated conversion if appropriate. */
7139 string_conv_p (totype
, expr
, 1);
7144 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
7145 /*nonnull=*/false, complain
);
7146 return build_nop (totype
, expr
);
7149 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
7150 c_cast_p
, complain
);
7156 if (convs
->check_narrowing
7157 && !check_narrowing (totype
, expr
, complain
,
7158 convs
->check_narrowing_const_only
))
7159 return error_mark_node
;
7161 warning_sentinel
w (warn_zero_as_null_pointer_constant
);
7162 if (issue_conversion_warnings
)
7163 expr
= cp_convert_and_check (totype
, expr
, complain
);
7165 expr
= cp_convert (totype
, expr
, complain
);
7170 /* ARG is being passed to a varargs function. Perform any conversions
7171 required. Return the converted value. */
7174 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
7177 location_t loc
= cp_expr_loc_or_loc (arg
, input_location
);
7181 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7182 standard conversions are performed. */
7183 arg
= decay_conversion (arg
, complain
);
7184 arg_type
= TREE_TYPE (arg
);
7187 If the argument has integral or enumeration type that is subject
7188 to the integral promotions (_conv.prom_), or a floating point
7189 type that is subject to the floating point promotion
7190 (_conv.fpprom_), the value of the argument is converted to the
7191 promoted type before the call. */
7192 if (TREE_CODE (arg_type
) == REAL_TYPE
7193 && (TYPE_PRECISION (arg_type
)
7194 < TYPE_PRECISION (double_type_node
))
7195 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
7197 if ((complain
& tf_warning
)
7198 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
7199 warning_at (loc
, OPT_Wdouble_promotion
,
7200 "implicit conversion from %qH to %qI when passing "
7201 "argument to function",
7202 arg_type
, double_type_node
);
7203 arg
= convert_to_real_nofold (double_type_node
, arg
);
7205 else if (NULLPTR_TYPE_P (arg_type
))
7206 arg
= null_pointer_node
;
7207 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
7209 if (SCOPED_ENUM_P (arg_type
))
7211 tree prom
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
,
7213 prom
= cp_perform_integral_promotions (prom
, complain
);
7214 if (abi_version_crosses (6)
7215 && TYPE_MODE (TREE_TYPE (prom
)) != TYPE_MODE (arg_type
)
7216 && (complain
& tf_warning
))
7217 warning_at (loc
, OPT_Wabi
, "scoped enum %qT passed through ... as "
7218 "%qT before -fabi-version=6, %qT after", arg_type
,
7219 TREE_TYPE (prom
), ENUM_UNDERLYING_TYPE (arg_type
));
7220 if (!abi_version_at_least (6))
7224 arg
= cp_perform_integral_promotions (arg
, complain
);
7227 arg
= require_complete_type_sfinae (arg
, complain
);
7228 arg_type
= TREE_TYPE (arg
);
7230 if (arg
!= error_mark_node
7231 /* In a template (or ill-formed code), we can have an incomplete type
7232 even after require_complete_type_sfinae, in which case we don't know
7233 whether it has trivial copy or not. */
7234 && COMPLETE_TYPE_P (arg_type
)
7235 && !cp_unevaluated_operand
)
7237 /* [expr.call] 5.2.2/7:
7238 Passing a potentially-evaluated argument of class type (Clause 9)
7239 with a non-trivial copy constructor or a non-trivial destructor
7240 with no corresponding parameter is conditionally-supported, with
7241 implementation-defined semantics.
7243 We support it as pass-by-invisible-reference, just like a normal
7246 If the call appears in the context of a sizeof expression,
7247 it is not potentially-evaluated. */
7248 if (type_has_nontrivial_copy_init (arg_type
)
7249 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
))
7251 arg
= force_rvalue (arg
, complain
);
7252 if (complain
& tf_warning
)
7253 warning (OPT_Wconditionally_supported
,
7254 "passing objects of non-trivially-copyable "
7255 "type %q#T through %<...%> is conditionally supported",
7257 return build1 (ADDR_EXPR
, build_reference_type (arg_type
), arg
);
7259 /* Build up a real lvalue-to-rvalue conversion in case the
7260 copy constructor is trivial but not callable. */
7261 else if (CLASS_TYPE_P (arg_type
))
7262 force_rvalue (arg
, complain
);
7269 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7272 build_x_va_arg (source_location loc
, tree expr
, tree type
)
7274 if (processing_template_decl
)
7276 tree r
= build_min (VA_ARG_EXPR
, type
, expr
);
7277 SET_EXPR_LOCATION (r
, loc
);
7281 type
= complete_type_or_else (type
, NULL_TREE
);
7283 if (expr
== error_mark_node
|| !type
)
7284 return error_mark_node
;
7286 expr
= mark_lvalue_use (expr
);
7288 if (TYPE_REF_P (type
))
7290 error ("cannot receive reference type %qT through %<...%>", type
);
7291 return error_mark_node
;
7294 if (type_has_nontrivial_copy_init (type
)
7295 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7297 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7298 it as pass by invisible reference. */
7299 warning_at (loc
, OPT_Wconditionally_supported
,
7300 "receiving objects of non-trivially-copyable type %q#T "
7301 "through %<...%> is conditionally-supported", type
);
7303 tree ref
= cp_build_reference_type (type
, false);
7304 expr
= build_va_arg (loc
, expr
, ref
);
7305 return convert_from_reference (expr
);
7308 tree ret
= build_va_arg (loc
, expr
, type
);
7309 if (CLASS_TYPE_P (type
))
7310 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7311 know how to handle it. */
7312 ret
= get_target_expr (ret
);
7316 /* TYPE has been given to va_arg. Apply the default conversions which
7317 would have happened when passed via ellipsis. Return the promoted
7318 type, or the passed type if there is no change. */
7321 cxx_type_promotes_to (tree type
)
7325 /* Perform the array-to-pointer and function-to-pointer
7327 type
= type_decays_to (type
);
7329 promote
= type_promotes_to (type
);
7330 if (same_type_p (type
, promote
))
7336 /* ARG is a default argument expression being passed to a parameter of
7337 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7338 zero-based argument number. Do any required conversions. Return
7339 the converted value. */
7341 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
7343 push_defarg_context (tree fn
)
7344 { vec_safe_push (default_arg_context
, fn
); }
7347 pop_defarg_context (void)
7348 { default_arg_context
->pop (); }
7351 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
7352 tsubst_flags_t complain
)
7357 /* See through clones. */
7358 fn
= DECL_ORIGIN (fn
);
7359 /* And inheriting ctors. */
7360 if (flag_new_inheriting_ctors
)
7361 fn
= strip_inheriting_ctors (fn
);
7363 /* Detect recursion. */
7364 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
7367 if (complain
& tf_error
)
7368 error ("recursive evaluation of default argument for %q#D", fn
);
7369 return error_mark_node
;
7372 /* If the ARG is an unparsed default argument expression, the
7373 conversion cannot be performed. */
7374 if (TREE_CODE (arg
) == DEFAULT_ARG
)
7376 if (complain
& tf_error
)
7377 error ("call to %qD uses the default argument for parameter %P, which "
7378 "is not yet defined", fn
, parmnum
);
7379 return error_mark_node
;
7382 push_defarg_context (fn
);
7384 if (fn
&& DECL_TEMPLATE_INFO (fn
))
7385 arg
= tsubst_default_argument (fn
, parmnum
, type
, arg
, complain
);
7391 The names in the expression are bound, and the semantic
7392 constraints are checked, at the point where the default
7393 expressions appears.
7395 we must not perform access checks here. */
7396 push_deferring_access_checks (dk_no_check
);
7397 /* We must make a copy of ARG, in case subsequent processing
7398 alters any part of it. */
7399 arg
= break_out_target_exprs (arg
, /*clear location*/true);
7401 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
7402 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
7404 arg
= convert_for_arg_passing (type
, arg
, complain
);
7405 pop_deferring_access_checks();
7407 pop_defarg_context ();
7412 /* Returns the type which will really be used for passing an argument of
7416 type_passed_as (tree type
)
7418 /* Pass classes with copy ctors by invisible reference. */
7419 if (TREE_ADDRESSABLE (type
))
7421 type
= build_reference_type (type
);
7422 /* There are no other pointers to this temporary. */
7423 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
7425 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7426 && INTEGRAL_TYPE_P (type
)
7427 && COMPLETE_TYPE_P (type
)
7428 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7429 type
= integer_type_node
;
7434 /* Actually perform the appropriate conversion. */
7437 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
7441 /* If VAL is a bitfield, then -- since it has already been converted
7442 to TYPE -- it cannot have a precision greater than TYPE.
7444 If it has a smaller precision, we must widen it here. For
7445 example, passing "int f:3;" to a function expecting an "int" will
7446 not result in any conversion before this point.
7448 If the precision is the same we must not risk widening. For
7449 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7450 often have type "int", even though the C++ type for the field is
7451 "long long". If the value is being passed to a function
7452 expecting an "int", then no conversions will be required. But,
7453 if we call convert_bitfield_to_declared_type, the bitfield will
7454 be converted to "long long". */
7455 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
7457 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
7458 val
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
), val
);
7460 if (val
== error_mark_node
)
7462 /* Pass classes with copy ctors by invisible reference. */
7463 else if (TREE_ADDRESSABLE (type
))
7464 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
7465 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7466 && INTEGRAL_TYPE_P (type
)
7467 && COMPLETE_TYPE_P (type
)
7468 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7469 val
= cp_perform_integral_promotions (val
, complain
);
7470 if (complain
& tf_warning
)
7472 if (warn_suggest_attribute_format
)
7474 tree rhstype
= TREE_TYPE (val
);
7475 const enum tree_code coder
= TREE_CODE (rhstype
);
7476 const enum tree_code codel
= TREE_CODE (type
);
7477 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7479 && check_missing_format_attribute (type
, rhstype
))
7480 warning (OPT_Wsuggest_attribute_format
,
7481 "argument of function call might be a candidate "
7482 "for a format attribute");
7484 maybe_warn_parm_abi (type
, cp_expr_loc_or_loc (val
, input_location
));
7489 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7490 which just decay_conversion or no conversions at all should be done.
7491 This is true for some builtins which don't act like normal functions.
7492 Return 2 if no conversions at all should be done, 1 if just
7493 decay_conversion. Return 3 for special treatment of the 3rd argument
7494 for __builtin_*_overflow_p. */
7497 magic_varargs_p (tree fn
)
7499 if (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
7500 switch (DECL_FUNCTION_CODE (fn
))
7502 case BUILT_IN_CLASSIFY_TYPE
:
7503 case BUILT_IN_CONSTANT_P
:
7504 case BUILT_IN_NEXT_ARG
:
7505 case BUILT_IN_VA_START
:
7508 case BUILT_IN_ADD_OVERFLOW_P
:
7509 case BUILT_IN_SUB_OVERFLOW_P
:
7510 case BUILT_IN_MUL_OVERFLOW_P
:
7514 return lookup_attribute ("type generic",
7515 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
7521 /* Returns the decl of the dispatcher function if FN is a function version. */
7524 get_function_version_dispatcher (tree fn
)
7526 tree dispatcher_decl
= NULL
;
7528 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7529 && DECL_FUNCTION_VERSIONED (fn
));
7531 gcc_assert (targetm
.get_function_versions_dispatcher
);
7532 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
7534 if (dispatcher_decl
== NULL
)
7536 error_at (input_location
, "use of multiversioned function "
7537 "without a default");
7541 retrofit_lang_decl (dispatcher_decl
);
7542 gcc_assert (dispatcher_decl
!= NULL
);
7543 return dispatcher_decl
;
7546 /* fn is a function version dispatcher that is marked used. Mark all the
7547 semantically identical function versions it will dispatch as used. */
7550 mark_versions_used (tree fn
)
7552 struct cgraph_node
*node
;
7553 struct cgraph_function_version_info
*node_v
;
7554 struct cgraph_function_version_info
*it_v
;
7556 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7558 node
= cgraph_node::get (fn
);
7562 gcc_assert (node
->dispatcher_function
);
7564 node_v
= node
->function_version ();
7568 /* All semantically identical versions are chained. Traverse and mark each
7569 one of them as used. */
7570 it_v
= node_v
->next
;
7571 while (it_v
!= NULL
)
7573 mark_used (it_v
->this_node
->decl
);
7578 /* Build a call to "the copy constructor" for the type of A, even if it
7579 wouldn't be selected by normal overload resolution. Used for
7583 call_copy_ctor (tree a
, tsubst_flags_t complain
)
7585 tree ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (a
));
7586 tree binfo
= TYPE_BINFO (ctype
);
7587 tree copy
= get_copy_ctor (ctype
, complain
);
7588 copy
= build_baselink (binfo
, binfo
, copy
, NULL_TREE
);
7589 tree ob
= build_dummy_object (ctype
);
7590 vec
<tree
, va_gc
>* args
= make_tree_vector_single (a
);
7591 tree r
= build_new_method_call (ob
, copy
, &args
, NULL_TREE
,
7592 LOOKUP_NORMAL
, NULL
, complain
);
7593 release_tree_vector (args
);
7597 /* Return true iff T refers to a base field. */
7600 is_base_field_ref (tree t
)
7603 if (TREE_CODE (t
) == ADDR_EXPR
)
7604 t
= TREE_OPERAND (t
, 0);
7605 if (TREE_CODE (t
) == COMPONENT_REF
)
7606 t
= TREE_OPERAND (t
, 1);
7607 if (TREE_CODE (t
) == FIELD_DECL
)
7608 return DECL_FIELD_IS_BASE (t
);
7612 /* We can't elide a copy from a function returning by value to a base
7613 subobject, as the callee might clobber tail padding. Return true iff this
7614 could be that case. */
7617 unsafe_copy_elision_p (tree target
, tree exp
)
7619 /* Copy elision only happens with a TARGET_EXPR. */
7620 if (TREE_CODE (exp
) != TARGET_EXPR
)
7622 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
7623 /* It's safe to elide the copy for a class with no tail padding. */
7624 if (tree_int_cst_equal (TYPE_SIZE (type
), CLASSTYPE_SIZE (type
)))
7626 /* It's safe to elide the copy if we aren't initializing a base object. */
7627 if (!is_base_field_ref (target
))
7629 tree init
= TARGET_EXPR_INITIAL (exp
);
7630 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7631 while (TREE_CODE (init
) == COMPOUND_EXPR
)
7632 init
= TREE_OPERAND (init
, 1);
7633 if (TREE_CODE (init
) == COND_EXPR
)
7635 /* We'll end up copying from each of the arms of the COND_EXPR directly
7636 into the target, so look at them. */
7637 if (tree op
= TREE_OPERAND (init
, 1))
7638 if (unsafe_copy_elision_p (target
, op
))
7640 return unsafe_copy_elision_p (target
, TREE_OPERAND (init
, 2));
7642 return (TREE_CODE (init
) == AGGR_INIT_EXPR
7643 && !AGGR_INIT_VIA_CTOR_P (init
));
7646 /* True iff C is a conversion that binds a reference to a prvalue. */
7649 conv_binds_ref_to_prvalue (conversion
*c
)
7651 if (c
->kind
!= ck_ref_bind
)
7653 if (c
->need_temporary_p
)
7656 c
= next_conversion (c
);
7658 if (c
->kind
== ck_rvalue
)
7660 if (c
->kind
== ck_user
&& !TYPE_REF_P (c
->type
))
7662 if (c
->kind
== ck_identity
&& c
->u
.expr
7663 && TREE_CODE (c
->u
.expr
) == TARGET_EXPR
)
7669 /* Call the trivial destructor for INSTANCE, which can be either an lvalue of
7670 class type or a pointer to class type. */
7673 build_trivial_dtor_call (tree instance
)
7675 gcc_assert (!is_dummy_object (instance
));
7677 if (!flag_lifetime_dse
)
7680 return fold_convert (void_type_node
, instance
);
7683 if (INDIRECT_TYPE_P (TREE_TYPE (instance
)))
7685 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
7687 instance
= cp_build_fold_indirect_ref (instance
);
7690 /* A trivial destructor should still clobber the object. */
7691 tree clobber
= build_clobber (TREE_TYPE (instance
));
7692 return build2 (MODIFY_EXPR
, void_type_node
,
7696 /* Subroutine of the various build_*_call functions. Overload resolution
7697 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7698 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7699 bitmask of various LOOKUP_* flags which apply to the call itself. */
7702 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
7705 const vec
<tree
, va_gc
> *args
= cand
->args
;
7706 tree first_arg
= cand
->first_arg
;
7707 conversion
**convs
= cand
->convs
;
7709 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
7714 unsigned int arg_index
= 0;
7718 bool already_used
= false;
7720 /* In a template, there is no need to perform all of the work that
7721 is normally done. We are only interested in the type of the call
7722 expression, i.e., the return type of the function. Any semantic
7723 errors will be deferred until the template is instantiated. */
7724 if (processing_template_decl
)
7728 const tree
*argarray
;
7731 if (undeduced_auto_decl (fn
))
7732 mark_used (fn
, complain
);
7734 /* Otherwise set TREE_USED for the benefit of -Wunused-function.
7738 return_type
= TREE_TYPE (TREE_TYPE (fn
));
7739 nargs
= vec_safe_length (args
);
7740 if (first_arg
== NULL_TREE
)
7741 argarray
= args
->address ();
7749 alcarray
= XALLOCAVEC (tree
, nargs
);
7750 alcarray
[0] = build_this (first_arg
);
7751 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
7752 alcarray
[ix
+ 1] = arg
;
7753 argarray
= alcarray
;
7756 addr
= build_addr_func (fn
, complain
);
7757 if (addr
== error_mark_node
)
7758 return error_mark_node
;
7759 expr
= build_call_array_loc (input_location
, return_type
,
7760 addr
, nargs
, argarray
);
7761 if (TREE_THIS_VOLATILE (fn
) && cfun
)
7762 current_function_returns_abnormally
= 1;
7763 return convert_from_reference (expr
);
7766 /* Give any warnings we noticed during overload resolution. */
7767 if (cand
->warnings
&& (complain
& tf_warning
))
7769 struct candidate_warning
*w
;
7770 for (w
= cand
->warnings
; w
; w
= w
->next
)
7771 joust (cand
, w
->loser
, 1, complain
);
7774 /* Core issue 2327: P0135 doesn't say how to handle the case where the
7775 argument to the copy constructor ends up being a prvalue after
7776 conversion. Let's do the normal processing, but pretend we aren't
7777 actually using the copy constructor. */
7778 bool force_elide
= false;
7779 if (cxx_dialect
>= cxx17
7780 && cand
->num_convs
== 1
7781 && DECL_COMPLETE_CONSTRUCTOR_P (fn
)
7782 && (DECL_COPY_CONSTRUCTOR_P (fn
)
7783 || DECL_MOVE_CONSTRUCTOR_P (fn
))
7784 && conv_binds_ref_to_prvalue (convs
[0]))
7787 goto not_really_used
;
7790 /* OK, we're actually calling this inherited constructor; set its deletedness
7791 appropriately. We can get away with doing this here because calling is
7792 the only way to refer to a constructor. */
7793 if (DECL_INHERITED_CTOR (fn
))
7794 deduce_inheriting_ctor (fn
);
7796 /* Make =delete work with SFINAE. */
7797 if (DECL_DELETED_FN (fn
))
7799 if (complain
& tf_error
)
7801 return error_mark_node
;
7804 if (DECL_FUNCTION_MEMBER_P (fn
))
7807 /* If FN is a template function, two cases must be considered.
7812 template <class T> void f();
7814 template <class T> struct B {
7818 struct C : A, B<int> {
7820 using B<int>::g; // #2
7823 In case #1 where `A::f' is a member template, DECL_ACCESS is
7824 recorded in the primary template but not in its specialization.
7825 We check access of FN using its primary template.
7827 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7828 because it is a member of class template B, DECL_ACCESS is
7829 recorded in the specialization `B<int>::g'. We cannot use its
7830 primary template because `B<T>::g' and `B<int>::g' may have
7831 different access. */
7832 if (DECL_TEMPLATE_INFO (fn
)
7833 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
7834 access_fn
= DECL_TI_TEMPLATE (fn
);
7837 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
7839 return error_mark_node
;
7842 /* If we're checking for implicit delete, don't bother with argument
7844 if (flags
& LOOKUP_SPECULATIVE
)
7846 if (cand
->viable
== 1)
7848 else if (!(complain
& tf_error
))
7849 /* Reject bad conversions now. */
7850 return error_mark_node
;
7851 /* else continue to get conversion error. */
7856 /* N3276 magic doesn't apply to nested calls. */
7857 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
7858 complain
&= ~tf_decltype
;
7859 /* No-Cleanup doesn't apply to nested calls either. */
7860 tsubst_flags_t no_cleanup_complain
= complain
;
7861 complain
&= ~tf_no_cleanup
;
7863 /* Find maximum size of vector to hold converted arguments. */
7864 parmlen
= list_length (parm
);
7865 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
7866 if (parmlen
> nargs
)
7868 argarray
= XALLOCAVEC (tree
, nargs
);
7870 /* The implicit parameters to a constructor are not considered by overload
7871 resolution, and must be of the proper type. */
7872 if (DECL_CONSTRUCTOR_P (fn
))
7875 if (first_arg
!= NULL_TREE
)
7877 object_arg
= first_arg
;
7878 first_arg
= NULL_TREE
;
7882 object_arg
= (*args
)[arg_index
];
7885 argarray
[j
++] = build_this (object_arg
);
7886 parm
= TREE_CHAIN (parm
);
7887 /* We should never try to call the abstract constructor. */
7888 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
7890 if (DECL_HAS_VTT_PARM_P (fn
))
7892 argarray
[j
++] = (*args
)[arg_index
];
7894 parm
= TREE_CHAIN (parm
);
7897 if (flags
& LOOKUP_PREFER_RVALUE
)
7899 /* The implicit move specified in 15.8.3/3 fails "...if the type of
7900 the first parameter of the selected constructor is not an rvalue
7901 reference to the object’s type (possibly cv-qualified)...." */
7902 gcc_assert (!(complain
& tf_error
));
7903 tree ptype
= convs
[0]->type
;
7904 if (!TYPE_REF_P (ptype
)
7905 || !TYPE_REF_IS_RVALUE (ptype
)
7906 || CONVERSION_RANK (convs
[0]) > cr_exact
)
7907 return error_mark_node
;
7910 /* Bypass access control for 'this' parameter. */
7911 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7913 tree parmtype
= TREE_VALUE (parm
);
7914 tree arg
= build_this (first_arg
!= NULL_TREE
7916 : (*args
)[arg_index
]);
7917 tree argtype
= TREE_TYPE (arg
);
7921 if (arg
== error_mark_node
)
7922 return error_mark_node
;
7924 if (convs
[i
]->bad_p
)
7926 if (complain
& tf_error
)
7928 if (permerror (input_location
, "passing %qT as %<this%> "
7929 "argument discards qualifiers",
7930 TREE_TYPE (argtype
)))
7931 inform (DECL_SOURCE_LOCATION (fn
), " in call to %qD", fn
);
7934 return error_mark_node
;
7937 /* See if the function member or the whole class type is declared
7938 final and the call can be devirtualized. */
7939 if (DECL_FINAL_P (fn
)
7940 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
7941 flags
|= LOOKUP_NONVIRTUAL
;
7943 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
7944 X is called for an object that is not of type X, or of a type
7945 derived from X, the behavior is undefined.
7947 So we can assume that anything passed as 'this' is non-null, and
7948 optimize accordingly. */
7949 gcc_assert (TYPE_PTR_P (parmtype
));
7950 /* Convert to the base in which the function was declared. */
7951 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
7952 converted_arg
= build_base_path (PLUS_EXPR
,
7954 cand
->conversion_path
,
7956 /* Check that the base class is accessible. */
7957 if (!accessible_base_p (TREE_TYPE (argtype
),
7958 BINFO_TYPE (cand
->conversion_path
), true))
7960 if (complain
& tf_error
)
7961 error ("%qT is not an accessible base of %qT",
7962 BINFO_TYPE (cand
->conversion_path
),
7963 TREE_TYPE (argtype
));
7965 return error_mark_node
;
7967 /* If fn was found by a using declaration, the conversion path
7968 will be to the derived class, not the base declaring fn. We
7969 must convert from derived to base. */
7970 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
7971 TREE_TYPE (parmtype
), ba_unique
,
7973 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
7974 base_binfo
, 1, complain
);
7976 argarray
[j
++] = converted_arg
;
7977 parm
= TREE_CHAIN (parm
);
7978 if (first_arg
!= NULL_TREE
)
7979 first_arg
= NULL_TREE
;
7986 gcc_assert (first_arg
== NULL_TREE
);
7987 for (; arg_index
< vec_safe_length (args
) && parm
;
7988 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
7990 tree type
= TREE_VALUE (parm
);
7991 tree arg
= (*args
)[arg_index
];
7992 bool conversion_warning
= true;
7996 /* If the argument is NULL and used to (implicitly) instantiate a
7997 template function (and bind one of the template arguments to
7998 the type of 'long int'), we don't want to warn about passing NULL
7999 to non-pointer argument.
8000 For example, if we have this template function:
8002 template<typename T> void func(T x) {}
8004 we want to warn (when -Wconversion is enabled) in this case:
8010 but not in this case:
8016 if (null_node_p (arg
)
8017 && DECL_TEMPLATE_INFO (fn
)
8018 && cand
->template_decl
8019 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
8020 conversion_warning
= false;
8022 /* Warn about initializer_list deduction that isn't currently in the
8024 if (cxx_dialect
> cxx98
8025 && flag_deduce_init_list
8026 && cand
->template_decl
8027 && is_std_init_list (non_reference (type
))
8028 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
8030 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
8031 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
8032 tree patparm
= get_pattern_parm (realparm
, tmpl
);
8033 tree pattype
= TREE_TYPE (patparm
);
8034 if (PACK_EXPANSION_P (pattype
))
8035 pattype
= PACK_EXPANSION_PATTERN (pattype
);
8036 pattype
= non_reference (pattype
);
8038 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
8039 && (cand
->explicit_targs
== NULL_TREE
8040 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
8041 <= TEMPLATE_TYPE_IDX (pattype
))))
8043 pedwarn (input_location
, 0, "deducing %qT as %qT",
8044 non_reference (TREE_TYPE (patparm
)),
8045 non_reference (type
));
8046 pedwarn (DECL_SOURCE_LOCATION (cand
->fn
), 0,
8047 " in call to %qD", cand
->fn
);
8048 pedwarn (input_location
, 0,
8049 " (you can disable this with -fno-deduce-init-list)");
8053 /* Set user_conv_p on the argument conversions, so rvalue/base handling
8054 knows not to allow any more UDCs. This needs to happen after we
8055 process cand->warnings. */
8056 if (flags
& LOOKUP_NO_CONVERSION
)
8057 conv
->user_conv_p
= true;
8059 tsubst_flags_t arg_complain
= complain
;
8060 if (!conversion_warning
)
8061 arg_complain
&= ~tf_warning
;
8063 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
8065 val
= convert_for_arg_passing (type
, val
, arg_complain
);
8067 if (val
== error_mark_node
)
8068 return error_mark_node
;
8070 argarray
[j
++] = val
;
8073 /* Default arguments */
8074 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
8076 if (TREE_VALUE (parm
) == error_mark_node
)
8077 return error_mark_node
;
8078 val
= convert_default_arg (TREE_VALUE (parm
),
8079 TREE_PURPOSE (parm
),
8082 if (val
== error_mark_node
)
8083 return error_mark_node
;
8084 argarray
[j
++] = val
;
8088 int magic
= magic_varargs_p (fn
);
8089 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
8091 tree a
= (*args
)[arg_index
];
8092 if ((magic
== 3 && arg_index
== 2) || magic
== 2)
8094 /* Do no conversions for certain magic varargs. */
8095 a
= mark_type_use (a
);
8096 if (TREE_CODE (a
) == FUNCTION_DECL
&& reject_gcc_builtin (a
))
8097 return error_mark_node
;
8099 else if (magic
!= 0)
8100 /* For other magic varargs only do decay_conversion. */
8101 a
= decay_conversion (a
, complain
);
8102 else if (DECL_CONSTRUCTOR_P (fn
)
8103 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn
),
8106 /* Avoid infinite recursion trying to call A(...). */
8107 if (complain
& tf_error
)
8108 /* Try to call the actual copy constructor for a good error. */
8109 call_copy_ctor (a
, complain
);
8110 return error_mark_node
;
8113 a
= convert_arg_to_ellipsis (a
, complain
);
8114 if (a
== error_mark_node
)
8115 return error_mark_node
;
8119 gcc_assert (j
<= nargs
);
8122 /* Avoid to do argument-transformation, if warnings for format, and for
8123 nonnull are disabled. Just in case that at least one of them is active
8124 the check_function_arguments function might warn about something. */
8126 bool warned_p
= false;
8129 || warn_suggest_attribute_format
8132 tree
*fargs
= (!nargs
? argarray
8133 : (tree
*) alloca (nargs
* sizeof (tree
)));
8134 for (j
= 0; j
< nargs
; j
++)
8136 /* For -Wformat undo the implicit passing by hidden reference
8137 done by convert_arg_to_ellipsis. */
8138 if (TREE_CODE (argarray
[j
]) == ADDR_EXPR
8139 && TYPE_REF_P (TREE_TYPE (argarray
[j
])))
8140 fargs
[j
] = TREE_OPERAND (argarray
[j
], 0);
8142 fargs
[j
] = maybe_constant_value (argarray
[j
]);
8145 warned_p
= check_function_arguments (input_location
, fn
, TREE_TYPE (fn
),
8146 nargs
, fargs
, NULL
);
8149 if (DECL_INHERITED_CTOR (fn
))
8151 /* Check for passing ellipsis arguments to an inherited constructor. We
8152 could handle this by open-coding the inherited constructor rather than
8153 defining it, but let's not bother now. */
8154 if (!cp_unevaluated_operand
8156 && cand
->convs
[cand
->num_convs
-1]->ellipsis_p
)
8158 if (complain
& tf_error
)
8160 sorry ("passing arguments to ellipsis of inherited constructor "
8162 inform (DECL_SOURCE_LOCATION (cand
->fn
), "declared here");
8164 return error_mark_node
;
8167 /* A base constructor inheriting from a virtual base doesn't get the
8168 inherited arguments, just this and __vtt. */
8169 if (ctor_omit_inherited_parms (fn
))
8173 /* Avoid actually calling copy constructors and copy assignment operators,
8176 if (! flag_elide_constructors
&& !force_elide
)
8177 /* Do things the hard way. */;
8178 else if (cand
->num_convs
== 1
8179 && (DECL_COPY_CONSTRUCTOR_P (fn
)
8180 || DECL_MOVE_CONSTRUCTOR_P (fn
))
8181 /* It's unsafe to elide the constructor when handling
8182 a noexcept-expression, it may evaluate to the wrong
8183 value (c++/53025). */
8184 && (force_elide
|| cp_noexcept_operand
== 0))
8187 tree arg
= argarray
[num_artificial_parms_for (fn
)];
8189 bool trivial
= trivial_fn_p (fn
);
8191 /* Pull out the real argument, disregarding const-correctness. */
8193 /* Strip the reference binding for the constructor parameter. */
8194 if (CONVERT_EXPR_P (targ
)
8195 && TYPE_REF_P (TREE_TYPE (targ
)))
8196 targ
= TREE_OPERAND (targ
, 0);
8197 /* But don't strip any other reference bindings; binding a temporary to a
8198 reference prevents copy elision. */
8199 while ((CONVERT_EXPR_P (targ
)
8200 && !TYPE_REF_P (TREE_TYPE (targ
)))
8201 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
8202 targ
= TREE_OPERAND (targ
, 0);
8203 if (TREE_CODE (targ
) == ADDR_EXPR
)
8205 targ
= TREE_OPERAND (targ
, 0);
8206 if (!same_type_ignoring_top_level_qualifiers_p
8207 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
8216 arg
= cp_build_fold_indirect_ref (arg
);
8218 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8220 if (CHECKING_P
&& cxx_dialect
>= cxx17
)
8221 gcc_assert (TREE_CODE (arg
) != TARGET_EXPR
8223 /* It's from binding the ref parm to a packed field. */
8224 || convs
[0]->need_temporary_p
8226 /* See unsafe_copy_elision_p. */
8227 || DECL_BASE_CONSTRUCTOR_P (fn
));
8230 bool unsafe
= unsafe_copy_elision_p (fa
, arg
);
8231 bool eliding_temp
= (TREE_CODE (arg
) == TARGET_EXPR
&& !unsafe
);
8233 /* [class.copy]: the copy constructor is implicitly defined even if the
8234 implementation elided its use. But don't warn about deprecation when
8235 eliding a temporary, as then no copy is actually performed. */
8236 warning_sentinel
s (warn_deprecated_copy
, eliding_temp
);
8238 /* The language says this isn't called. */;
8241 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
8242 return error_mark_node
;
8243 already_used
= true;
8246 cp_warn_deprecated_use (fn
, complain
);
8248 /* If we're creating a temp and we already have one, don't create a
8249 new one. If we're not creating a temp but we get one, use
8250 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8251 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8252 temp or an INIT_EXPR otherwise. */
8253 if (is_dummy_object (fa
))
8255 if (TREE_CODE (arg
) == TARGET_EXPR
)
8258 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
8260 else if ((trivial
|| TREE_CODE (arg
) == TARGET_EXPR
)
8263 tree to
= cp_stabilize_reference (cp_build_fold_indirect_ref (fa
));
8265 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
8269 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
8270 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
)
8271 && trivial_fn_p (fn
))
8273 tree to
= cp_stabilize_reference
8274 (cp_build_fold_indirect_ref (argarray
[0]));
8275 tree type
= TREE_TYPE (to
);
8276 tree as_base
= CLASSTYPE_AS_BASE (type
);
8277 tree arg
= argarray
[1];
8278 location_t loc
= cp_expr_loc_or_loc (arg
, input_location
);
8280 if (is_really_empty_class (type
))
8282 /* Avoid copying empty classes. */
8283 val
= build2 (COMPOUND_EXPR
, type
, arg
, to
);
8284 TREE_NO_WARNING (val
) = 1;
8286 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
8288 if (is_std_init_list (type
)
8289 && conv_binds_ref_to_prvalue (convs
[1]))
8290 warning_at (loc
, OPT_Winit_list_lifetime
,
8291 "assignment from temporary initializer_list does not "
8292 "extend the lifetime of the underlying array");
8293 arg
= cp_build_fold_indirect_ref (arg
);
8294 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
8298 /* We must only copy the non-tail padding parts. */
8300 tree array_type
, alias_set
;
8302 arg2
= TYPE_SIZE_UNIT (as_base
);
8303 arg0
= cp_build_addr_expr (to
, complain
);
8305 array_type
= build_array_type (unsigned_char_type_node
,
8307 (size_binop (MINUS_EXPR
,
8308 arg2
, size_int (1))));
8309 alias_set
= build_int_cst (build_pointer_type (type
), 0);
8310 t
= build2 (MODIFY_EXPR
, void_type_node
,
8311 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
8312 build2 (MEM_REF
, array_type
, arg
, alias_set
));
8313 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
8314 TREE_NO_WARNING (val
) = 1;
8317 cp_warn_deprecated_use (fn
, complain
);
8321 else if (trivial_fn_p (fn
))
8323 if (DECL_DESTRUCTOR_P (fn
))
8324 return build_trivial_dtor_call (argarray
[0]);
8325 else if (default_ctor_p (fn
))
8327 if (is_dummy_object (argarray
[0]))
8328 return force_target_expr (DECL_CONTEXT (fn
), void_node
,
8329 no_cleanup_complain
);
8331 return cp_build_fold_indirect_ref (argarray
[0]);
8335 gcc_assert (!force_elide
);
8338 && !mark_used (fn
, complain
))
8339 return error_mark_node
;
8341 /* Warn if the built-in writes to an object of a non-trivial type. */
8342 if (warn_class_memaccess
8343 && vec_safe_length (args
) >= 2
8344 && DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
8345 maybe_warn_class_memaccess (input_location
, fn
, args
);
8347 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0
8348 /* Don't mess with virtual lookup in instantiate_non_dependent_expr;
8349 virtual functions can't be constexpr. */
8350 && !in_template_function ())
8353 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
8355 ba_any
, NULL
, complain
);
8356 gcc_assert (binfo
&& binfo
!= error_mark_node
);
8358 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
8360 if (TREE_SIDE_EFFECTS (argarray
[0]))
8361 argarray
[0] = save_expr (argarray
[0]);
8362 t
= build_pointer_type (TREE_TYPE (fn
));
8363 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
8368 fn
= build_addr_func (fn
, complain
);
8369 if (fn
== error_mark_node
)
8370 return error_mark_node
;
8373 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
8374 if (call
== error_mark_node
)
8376 if (cand
->flags
& LOOKUP_LIST_INIT_CTOR
)
8378 tree c
= extract_call_expr (call
);
8379 /* build_new_op_1 will clear this when appropriate. */
8380 CALL_EXPR_ORDERED_ARGS (c
) = true;
8384 tree c
= extract_call_expr (call
);
8385 if (TREE_CODE (c
) == CALL_EXPR
)
8386 TREE_NO_WARNING (c
) = 1;
8394 /* Return the DECL of the first non-static subobject of class TYPE
8395 that satisfies the predicate PRED or null if none can be found. */
8397 template <class Predicate
>
8399 first_non_static_field (tree type
, Predicate pred
)
8401 if (!type
|| !CLASS_TYPE_P (type
))
8404 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
8406 if (TREE_CODE (field
) != FIELD_DECL
)
8408 if (TREE_STATIC (field
))
8416 for (tree base_binfo
, binfo
= TYPE_BINFO (type
);
8417 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8419 tree base
= TREE_TYPE (base_binfo
);
8422 if (tree field
= first_non_static_field (base
, pred
))
8429 struct NonPublicField
8431 bool operator() (const_tree t
)
8433 return DECL_P (t
) && (TREE_PRIVATE (t
) || TREE_PROTECTED (t
));
8437 /* Return the DECL of the first non-public subobject of class TYPE
8438 or null if none can be found. */
8441 first_non_public_field (tree type
)
8443 return first_non_static_field (type
, NonPublicField ());
8446 struct NonTrivialField
8448 bool operator() (const_tree t
)
8450 return !trivial_type_p (DECL_P (t
) ? TREE_TYPE (t
) : t
);
8454 /* Return the DECL of the first non-trivial subobject of class TYPE
8455 or null if none can be found. */
8458 first_non_trivial_field (tree type
)
8460 return first_non_static_field (type
, NonTrivialField ());
8463 } /* unnamed namespace */
8465 /* Return true if all copy and move assignment operator overloads for
8466 class TYPE are trivial and at least one of them is not deleted and,
8467 when ACCESS is set, accessible. Return false otherwise. Set
8468 HASASSIGN to true when the TYPE has a (not necessarily trivial)
8469 copy or move assignment. */
8472 has_trivial_copy_assign_p (tree type
, bool access
, bool *hasassign
)
8474 tree fns
= get_class_binding (type
, assign_op_identifier
);
8475 bool all_trivial
= true;
8477 /* Iterate over overloads of the assignment operator, checking
8478 accessible copy assignments for triviality. */
8480 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8484 /* Skip operators that aren't copy assignments. */
8488 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8489 || accessible_p (TYPE_BINFO (type
), f
, true));
8491 /* Skip template assignment operators and deleted functions. */
8492 if (TREE_CODE (f
) != FUNCTION_DECL
|| DECL_DELETED_FN (f
))
8498 if (!accessible
|| !trivial_fn_p (f
))
8499 all_trivial
= false;
8501 /* Break early when both properties have been determined. */
8502 if (*hasassign
&& !all_trivial
)
8506 /* Return true if they're all trivial and one of the expressions
8507 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
8508 tree ref
= cp_build_reference_type (type
, false);
8510 && (is_trivially_xible (MODIFY_EXPR
, type
, type
)
8511 || is_trivially_xible (MODIFY_EXPR
, type
, ref
)));
8514 /* Return true if all copy and move ctor overloads for class TYPE are
8515 trivial and at least one of them is not deleted and, when ACCESS is
8516 set, accessible. Return false otherwise. Set each element of HASCTOR[]
8517 to true when the TYPE has a (not necessarily trivial) default and copy
8518 (or move) ctor, respectively. */
8521 has_trivial_copy_p (tree type
, bool access
, bool hasctor
[2])
8523 tree fns
= get_class_binding (type
, complete_ctor_identifier
);
8524 bool all_trivial
= true;
8526 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8530 /* Skip template constructors. */
8531 if (TREE_CODE (f
) != FUNCTION_DECL
)
8534 bool cpy_or_move_ctor_p
= copy_fn_p (f
);
8536 /* Skip ctors other than default, copy, and move. */
8537 if (!cpy_or_move_ctor_p
&& !default_ctor_p (f
))
8540 if (DECL_DELETED_FN (f
))
8543 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8544 || accessible_p (TYPE_BINFO (type
), f
, true));
8547 hasctor
[cpy_or_move_ctor_p
] = true;
8549 if (cpy_or_move_ctor_p
&& (!accessible
|| !trivial_fn_p (f
)))
8550 all_trivial
= false;
8552 /* Break early when both properties have been determined. */
8553 if (hasctor
[0] && hasctor
[1] && !all_trivial
)
8560 /* Issue a warning on a call to the built-in function FNDECL if it is
8561 a raw memory write whose destination is not an object of (something
8562 like) trivial or standard layout type with a non-deleted assignment
8563 and copy ctor. Detects const correctness violations, corrupting
8564 references, virtual table pointers, and bypassing non-trivial
8568 maybe_warn_class_memaccess (location_t loc
, tree fndecl
,
8569 const vec
<tree
, va_gc
> *args
)
8571 /* Except for bcopy where it's second, the destination pointer is
8572 the first argument for all functions handled here. Compute
8573 the index of the destination and source arguments. */
8574 unsigned dstidx
= DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_BCOPY
;
8575 unsigned srcidx
= !dstidx
;
8577 tree dest
= (*args
)[dstidx
];
8578 if (!TREE_TYPE (dest
) || !INDIRECT_TYPE_P (TREE_TYPE (dest
)))
8581 tree srctype
= NULL_TREE
;
8583 /* Determine the type of the pointed-to object and whether it's
8584 a complete class type. */
8585 tree desttype
= TREE_TYPE (TREE_TYPE (dest
));
8587 if (!desttype
|| !COMPLETE_TYPE_P (desttype
) || !CLASS_TYPE_P (desttype
))
8590 /* Check to see if the raw memory call is made by a non-static member
8591 function with THIS as the destination argument for the destination
8592 type. If so, and if the class has no non-trivial bases or members,
8593 be more permissive. */
8594 if (current_function_decl
8595 && DECL_NONSTATIC_MEMBER_FUNCTION_P (current_function_decl
)
8596 && is_this_parameter (tree_strip_nop_conversions (dest
)))
8598 tree ctx
= DECL_CONTEXT (current_function_decl
);
8599 bool special
= same_type_ignoring_top_level_qualifiers_p (ctx
, desttype
);
8600 tree binfo
= TYPE_BINFO (ctx
);
8602 /* FIXME: The following if statement is overly permissive (see
8603 bug 84851). Remove it in GCC 9. */
8605 && !BINFO_VTABLE (binfo
)
8606 && !BINFO_N_BASE_BINFOS (binfo
)
8607 && (DECL_CONSTRUCTOR_P (current_function_decl
)
8608 || DECL_DESTRUCTOR_P (current_function_decl
)))
8612 && !BINFO_VTABLE (binfo
)
8613 && !first_non_trivial_field (desttype
))
8617 /* True if the class is trivial. */
8618 bool trivial
= trivial_type_p (desttype
);
8620 /* Set to true if DESTYPE has an accessible copy assignment. */
8621 bool hasassign
= false;
8622 /* True if all of the class' overloaded copy assignment operators
8623 are all trivial (and not deleted) and at least one of them is
8625 bool trivassign
= has_trivial_copy_assign_p (desttype
, true, &hasassign
);
8627 /* Set to true if DESTTYPE has an accessible default and copy ctor,
8629 bool hasctors
[2] = { false, false };
8631 /* True if all of the class' overloaded copy constructors are all
8632 trivial (and not deleted) and at least one of them is accessible. */
8633 bool trivcopy
= has_trivial_copy_p (desttype
, true, hasctors
);
8635 /* Set FLD to the first private/protected member of the class. */
8636 tree fld
= trivial
? first_non_public_field (desttype
) : NULL_TREE
;
8638 /* The warning format string. */
8639 const char *warnfmt
= NULL
;
8640 /* A suggested alternative to offer instead of the raw memory call.
8641 Empty string when none can be come up with. */
8642 const char *suggest
= "";
8643 bool warned
= false;
8645 switch (DECL_FUNCTION_CODE (fndecl
))
8647 case BUILT_IN_MEMSET
:
8648 if (!integer_zerop (maybe_constant_value ((*args
)[1])))
8650 /* Diagnose setting non-copy-assignable or non-trivial types,
8651 or types with a private member, to (potentially) non-zero
8652 bytes. Since the value of the bytes being written is unknown,
8653 suggest using assignment instead (if one exists). Also warn
8654 for writes into objects for which zero-initialization doesn't
8655 mean all bits clear (pointer-to-member data, where null is all
8656 bits set). Since the value being written is (most likely)
8657 non-zero, simply suggest assignment (but not copy assignment). */
8658 suggest
= "; use assignment instead";
8660 warnfmt
= G_("%qD writing to an object of type %#qT with "
8661 "no trivial copy-assignment");
8663 warnfmt
= G_("%qD writing to an object of non-trivial type %#qT%s");
8666 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8667 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8668 "%qD writing to an object of type %#qT with "
8670 fndecl
, desttype
, access
, fld
);
8672 else if (!zero_init_p (desttype
))
8673 warnfmt
= G_("%qD writing to an object of type %#qT containing "
8674 "a pointer to data member%s");
8680 case BUILT_IN_BZERO
:
8681 /* Similarly to the above, diagnose clearing non-trivial or non-
8682 standard layout objects, or objects of types with no assignmenmt.
8683 Since the value being written is known to be zero, suggest either
8684 copy assignment, copy ctor, or default ctor as an alternative,
8685 depending on what's available. */
8687 if (hasassign
&& hasctors
[0])
8688 suggest
= G_("; use assignment or value-initialization instead");
8690 suggest
= G_("; use assignment instead");
8691 else if (hasctors
[0])
8692 suggest
= G_("; use value-initialization instead");
8695 warnfmt
= G_("%qD clearing an object of type %#qT with "
8696 "no trivial copy-assignment%s");
8698 warnfmt
= G_("%qD clearing an object of non-trivial type %#qT%s");
8699 else if (!zero_init_p (desttype
))
8700 warnfmt
= G_("%qD clearing an object of type %#qT containing "
8701 "a pointer-to-member%s");
8704 case BUILT_IN_BCOPY
:
8705 case BUILT_IN_MEMCPY
:
8706 case BUILT_IN_MEMMOVE
:
8707 case BUILT_IN_MEMPCPY
:
8708 /* Determine the type of the source object. */
8709 srctype
= TREE_TYPE ((*args
)[srcidx
]);
8710 if (!srctype
|| !INDIRECT_TYPE_P (srctype
))
8711 srctype
= void_type_node
;
8713 srctype
= TREE_TYPE (srctype
);
8715 /* Since it's impossible to determine wheter the byte copy is
8716 being used in place of assignment to an existing object or
8717 as a substitute for initialization, assume it's the former.
8718 Determine the best alternative to use instead depending on
8719 what's not deleted. */
8720 if (hasassign
&& hasctors
[1])
8721 suggest
= G_("; use copy-assignment or copy-initialization instead");
8723 suggest
= G_("; use copy-assignment instead");
8724 else if (hasctors
[1])
8725 suggest
= G_("; use copy-initialization instead");
8728 warnfmt
= G_("%qD writing to an object of type %#qT with no trivial "
8729 "copy-assignment%s");
8730 else if (!trivially_copyable_p (desttype
))
8731 warnfmt
= G_("%qD writing to an object of non-trivially copyable "
8734 warnfmt
= G_("%qD writing to an object with a deleted copy constructor");
8737 && !VOID_TYPE_P (srctype
)
8738 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
8739 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
8742 /* Warn when copying into a non-trivial object from an object
8743 of a different type other than void or char. */
8744 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8745 "%qD copying an object of non-trivial type "
8746 "%#qT from an array of %#qT",
8747 fndecl
, desttype
, srctype
);
8750 && !VOID_TYPE_P (srctype
)
8751 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
8752 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
8755 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8756 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8757 "%qD copying an object of type %#qT with "
8758 "%qs member %qD from an array of %#qT; use "
8759 "assignment or copy-initialization instead",
8760 fndecl
, desttype
, access
, fld
, srctype
);
8762 else if (!trivial
&& vec_safe_length (args
) > 2)
8764 tree sz
= maybe_constant_value ((*args
)[2]);
8765 if (!tree_fits_uhwi_p (sz
))
8768 /* Finally, warn on partial copies. */
8769 unsigned HOST_WIDE_INT typesize
8770 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype
));
8771 if (unsigned HOST_WIDE_INT partial
= tree_to_uhwi (sz
) % typesize
)
8772 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8773 (typesize
- partial
> 1
8774 ? G_("%qD writing to an object of "
8775 "a non-trivial type %#qT leaves %wu "
8777 : G_("%qD writing to an object of "
8778 "a non-trivial type %#qT leaves %wu "
8780 fndecl
, desttype
, typesize
- partial
);
8784 case BUILT_IN_REALLOC
:
8786 if (!trivially_copyable_p (desttype
))
8787 warnfmt
= G_("%qD moving an object of non-trivially copyable type "
8788 "%#qT; use %<new%> and %<delete%> instead");
8790 warnfmt
= G_("%qD moving an object of type %#qT with deleted copy "
8791 "constructor; use %<new%> and %<delete%> instead");
8792 else if (!get_dtor (desttype
, tf_none
))
8793 warnfmt
= G_("%qD moving an object of type %#qT with deleted "
8797 tree sz
= maybe_constant_value ((*args
)[1]);
8798 if (TREE_CODE (sz
) == INTEGER_CST
8799 && tree_int_cst_lt (sz
, TYPE_SIZE_UNIT (desttype
)))
8800 /* Finally, warn on reallocation into insufficient space. */
8801 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8802 "%qD moving an object of non-trivial type "
8803 "%#qT and size %E into a region of size %E",
8804 fndecl
, desttype
, TYPE_SIZE_UNIT (desttype
),
8816 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8817 warnfmt
, fndecl
, desttype
, suggest
);
8819 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8820 warnfmt
, fndecl
, desttype
);
8824 inform (location_of (desttype
), "%#qT declared here", desttype
);
8827 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
8828 This function performs no overload resolution, conversion, or other
8829 high-level operations. */
8832 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
8833 tsubst_flags_t complain
)
8837 /* Remember roughly where this call is. */
8838 location_t loc
= cp_expr_loc_or_loc (fn
, input_location
);
8839 fn
= build_call_a (fn
, nargs
, argarray
);
8840 SET_EXPR_LOCATION (fn
, loc
);
8842 fndecl
= get_callee_fndecl (fn
);
8844 /* Check that arguments to builtin functions match the expectations. */
8846 && !processing_template_decl
8847 && DECL_BUILT_IN (fndecl
)
8848 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
8852 /* We need to take care that values to BUILT_IN_NORMAL
8854 for (i
= 0; i
< nargs
; i
++)
8855 argarray
[i
] = maybe_constant_value (argarray
[i
]);
8857 if (!check_builtin_function_arguments (EXPR_LOCATION (fn
), vNULL
, fndecl
,
8859 return error_mark_node
;
8862 if (VOID_TYPE_P (TREE_TYPE (fn
)))
8865 /* 5.2.2/11: If a function call is a prvalue of object type: if the
8866 function call is either the operand of a decltype-specifier or the
8867 right operand of a comma operator that is the operand of a
8868 decltype-specifier, a temporary object is not introduced for the
8869 prvalue. The type of the prvalue may be incomplete. */
8870 if (!(complain
& tf_decltype
))
8872 fn
= require_complete_type_sfinae (fn
, complain
);
8873 if (fn
== error_mark_node
)
8874 return error_mark_node
;
8876 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
8878 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
8879 maybe_warn_parm_abi (TREE_TYPE (fn
), loc
);
8882 return convert_from_reference (fn
);
8885 /* Returns the value to use for the in-charge parameter when making a
8886 call to a function with the indicated NAME.
8888 FIXME:Can't we find a neater way to do this mapping? */
8891 in_charge_arg_for_name (tree name
)
8893 if (IDENTIFIER_CTOR_P (name
))
8895 if (name
== complete_ctor_identifier
)
8896 return integer_one_node
;
8897 gcc_checking_assert (name
== base_ctor_identifier
);
8901 if (name
== complete_dtor_identifier
)
8902 return integer_two_node
;
8903 else if (name
== deleting_dtor_identifier
)
8904 return integer_three_node
;
8905 gcc_checking_assert (name
== base_dtor_identifier
);
8908 return integer_zero_node
;
8911 /* We've built up a constructor call RET. Complain if it delegates to the
8912 constructor we're currently compiling. */
8915 check_self_delegation (tree ret
)
8917 if (TREE_CODE (ret
) == TARGET_EXPR
)
8918 ret
= TARGET_EXPR_INITIAL (ret
);
8919 tree fn
= cp_get_callee_fndecl_nofold (ret
);
8920 if (fn
&& DECL_ABSTRACT_ORIGIN (fn
) == current_function_decl
)
8921 error ("constructor delegates to itself");
8924 /* Build a call to a constructor, destructor, or an assignment
8925 operator for INSTANCE, an expression with class type. NAME
8926 indicates the special member function to call; *ARGS are the
8927 arguments. ARGS may be NULL. This may change ARGS. BINFO
8928 indicates the base of INSTANCE that is to be passed as the `this'
8929 parameter to the member function called.
8931 FLAGS are the LOOKUP_* flags to use when processing the call.
8933 If NAME indicates a complete object constructor, INSTANCE may be
8934 NULL_TREE. In this case, the caller will call build_cplus_new to
8935 store the newly constructed object into a VAR_DECL. */
8938 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
8939 tree binfo
, int flags
, tsubst_flags_t complain
)
8942 /* The type of the subobject to be constructed or destroyed. */
8944 vec
<tree
, va_gc
> *allocated
= NULL
;
8947 gcc_assert (IDENTIFIER_CDTOR_P (name
) || name
== assign_op_identifier
);
8949 if (error_operand_p (instance
))
8950 return error_mark_node
;
8952 if (IDENTIFIER_DTOR_P (name
))
8954 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
8955 if (!type_build_dtor_call (TREE_TYPE (instance
)))
8956 /* Shortcut to avoid lazy destructor declaration. */
8957 return build_trivial_dtor_call (instance
);
8962 /* Resolve the name. */
8963 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
8964 return error_mark_node
;
8966 binfo
= TYPE_BINFO (binfo
);
8969 gcc_assert (binfo
!= NULL_TREE
);
8971 class_type
= BINFO_TYPE (binfo
);
8973 /* Handle the special case where INSTANCE is NULL_TREE. */
8974 if (name
== complete_ctor_identifier
&& !instance
)
8975 instance
= build_dummy_object (class_type
);
8978 /* Convert to the base class, if necessary. */
8979 if (!same_type_ignoring_top_level_qualifiers_p
8980 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
8982 if (IDENTIFIER_CDTOR_P (name
))
8983 /* For constructors and destructors, either the base is
8984 non-virtual, or it is virtual but we are doing the
8985 conversion from a constructor or destructor for the
8986 complete object. In either case, we can convert
8988 instance
= convert_to_base_statically (instance
, binfo
);
8991 /* However, for assignment operators, we must convert
8992 dynamically if the base is virtual. */
8993 gcc_checking_assert (name
== assign_op_identifier
);
8994 instance
= build_base_path (PLUS_EXPR
, instance
,
8995 binfo
, /*nonnull=*/1, complain
);
9000 gcc_assert (instance
!= NULL_TREE
);
9002 /* In C++17, "If the initializer expression is a prvalue and the
9003 cv-unqualified version of the source type is the same class as the class
9004 of the destination, the initializer expression is used to initialize the
9005 destination object." Handle that here to avoid doing overload
9007 if (cxx_dialect
>= cxx17
9008 && args
&& vec_safe_length (*args
) == 1
9009 && name
== complete_ctor_identifier
)
9011 tree arg
= (**args
)[0];
9013 if (BRACE_ENCLOSED_INITIALIZER_P (arg
)
9014 && !TYPE_HAS_LIST_CTOR (class_type
)
9015 && CONSTRUCTOR_NELTS (arg
) == 1)
9016 arg
= CONSTRUCTOR_ELT (arg
, 0)->value
;
9018 if ((TREE_CODE (arg
) == TARGET_EXPR
9019 || TREE_CODE (arg
) == CONSTRUCTOR
)
9020 && (same_type_ignoring_top_level_qualifiers_p
9021 (class_type
, TREE_TYPE (arg
))))
9023 if (is_dummy_object (instance
))
9025 else if (TREE_CODE (arg
) == TARGET_EXPR
)
9026 TARGET_EXPR_DIRECT_INIT_P (arg
) = true;
9028 if ((complain
& tf_error
)
9029 && (flags
& LOOKUP_DELEGATING_CONS
))
9030 check_self_delegation (arg
);
9031 /* Avoid change of behavior on Wunused-var-2.C. */
9032 instance
= mark_lvalue_use (instance
);
9033 return build2 (INIT_EXPR
, class_type
, instance
, arg
);
9037 fns
= lookup_fnfields (binfo
, name
, 1);
9039 /* When making a call to a constructor or destructor for a subobject
9040 that uses virtual base classes, pass down a pointer to a VTT for
9042 if ((name
== base_ctor_identifier
9043 || name
== base_dtor_identifier
)
9044 && CLASSTYPE_VBASECLASSES (class_type
))
9049 /* If the current function is a complete object constructor
9050 or destructor, then we fetch the VTT directly.
9051 Otherwise, we look it up using the VTT we were given. */
9052 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
9053 vtt
= decay_conversion (vtt
, complain
);
9054 if (vtt
== error_mark_node
)
9055 return error_mark_node
;
9056 vtt
= build_if_in_charge (vtt
, current_vtt_parm
);
9057 if (BINFO_SUBVTT_INDEX (binfo
))
9058 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
9064 allocated
= make_tree_vector ();
9068 vec_safe_insert (*args
, 0, sub_vtt
);
9071 ret
= build_new_method_call (instance
, fns
, args
,
9072 TYPE_BINFO (BINFO_TYPE (binfo
)),
9076 if (allocated
!= NULL
)
9077 release_tree_vector (allocated
);
9079 if ((complain
& tf_error
)
9080 && (flags
& LOOKUP_DELEGATING_CONS
)
9081 && name
== complete_ctor_identifier
)
9082 check_self_delegation (ret
);
9087 /* Return the NAME, as a C string. The NAME indicates a function that
9088 is a member of TYPE. *FREE_P is set to true if the caller must
9089 free the memory returned.
9091 Rather than go through all of this, we should simply set the names
9092 of constructors and destructors appropriately, and dispense with
9093 ctor_identifier, dtor_identifier, etc. */
9096 name_as_c_string (tree name
, tree type
, bool *free_p
)
9098 const char *pretty_name
;
9100 /* Assume that we will not allocate memory. */
9102 /* Constructors and destructors are special. */
9103 if (IDENTIFIER_CDTOR_P (name
))
9106 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
)));
9107 /* For a destructor, add the '~'. */
9108 if (IDENTIFIER_DTOR_P (name
))
9110 pretty_name
= concat ("~", pretty_name
, NULL
);
9111 /* Remember that we need to free the memory allocated. */
9115 else if (IDENTIFIER_CONV_OP_P (name
))
9117 pretty_name
= concat ("operator ",
9118 type_as_string_translate (TREE_TYPE (name
),
9119 TFF_PLAIN_IDENTIFIER
),
9121 /* Remember that we need to free the memory allocated. */
9125 pretty_name
= identifier_to_locale (IDENTIFIER_POINTER (name
));
9127 return CONST_CAST (char *, pretty_name
);
9130 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
9131 be set, upon return, to the function called. ARGS may be NULL.
9132 This may change ARGS. */
9135 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9136 tree conversion_path
, int flags
,
9137 tree
*fn_p
, tsubst_flags_t complain
)
9139 struct z_candidate
*candidates
= 0, *cand
;
9140 tree explicit_targs
= NULL_TREE
;
9141 tree basetype
= NULL_TREE
;
9142 tree access_binfo
, binfo
;
9144 tree first_mem_arg
= NULL_TREE
;
9146 bool skip_first_for_error
;
9147 vec
<tree
, va_gc
> *user_args
;
9150 int template_only
= 0;
9154 vec
<tree
, va_gc
> *orig_args
= NULL
;
9157 gcc_assert (instance
!= NULL_TREE
);
9159 /* We don't know what function we're going to call, yet. */
9163 if (error_operand_p (instance
)
9164 || !fns
|| error_operand_p (fns
))
9165 return error_mark_node
;
9167 if (!BASELINK_P (fns
))
9169 if (complain
& tf_error
)
9170 error ("call to non-function %qD", fns
);
9171 return error_mark_node
;
9174 orig_instance
= instance
;
9177 /* Dismantle the baselink to collect all the information we need. */
9178 if (!conversion_path
)
9179 conversion_path
= BASELINK_BINFO (fns
);
9180 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
9181 binfo
= BASELINK_BINFO (fns
);
9182 optype
= BASELINK_OPTYPE (fns
);
9183 fns
= BASELINK_FUNCTIONS (fns
);
9184 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
9186 explicit_targs
= TREE_OPERAND (fns
, 1);
9187 fns
= TREE_OPERAND (fns
, 0);
9190 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
9191 || TREE_CODE (fns
) == TEMPLATE_DECL
9192 || TREE_CODE (fns
) == OVERLOAD
);
9193 fn
= OVL_FIRST (fns
);
9194 name
= DECL_NAME (fn
);
9196 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
9197 gcc_assert (CLASS_TYPE_P (basetype
));
9199 user_args
= args
== NULL
? NULL
: *args
;
9200 /* Under DR 147 A::A() is an invalid constructor call,
9201 not a functional cast. */
9202 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
9204 if (! (complain
& tf_error
))
9205 return error_mark_node
;
9207 basetype
= DECL_CONTEXT (fn
);
9208 name
= constructor_name (basetype
);
9209 if (permerror (input_location
,
9210 "cannot call constructor %<%T::%D%> directly",
9212 inform (input_location
, "for a function-style cast, remove the "
9213 "redundant %<::%D%>", name
);
9214 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
9219 if (processing_template_decl
)
9221 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
9222 instance
= build_non_dependent_expr (instance
);
9224 make_args_non_dependent (*args
);
9227 /* Process the argument list. */
9228 if (args
!= NULL
&& *args
!= NULL
)
9230 *args
= resolve_args (*args
, complain
);
9232 return error_mark_node
;
9236 /* Consider the object argument to be used even if we end up selecting a
9237 static member function. */
9238 instance
= mark_type_use (instance
);
9240 /* Figure out whether to skip the first argument for the error
9241 message we will display to users if an error occurs. We don't
9242 want to display any compiler-generated arguments. The "this"
9243 pointer hasn't been added yet. However, we must remove the VTT
9244 pointer if this is a call to a base-class constructor or
9246 skip_first_for_error
= false;
9247 if (IDENTIFIER_CDTOR_P (name
))
9249 /* Callers should explicitly indicate whether they want to ctor
9250 the complete object or just the part without virtual bases. */
9251 gcc_assert (name
!= ctor_identifier
);
9253 /* Remove the VTT pointer, if present. */
9254 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
9255 && CLASSTYPE_VBASECLASSES (basetype
))
9256 skip_first_for_error
= true;
9258 /* It's OK to call destructors and constructors on cv-qualified
9259 objects. Therefore, convert the INSTANCE to the unqualified
9260 type, if necessary. */
9261 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
9263 instance
= build_this (instance
);
9264 instance
= build_nop (build_pointer_type (basetype
), instance
);
9265 instance
= build_fold_indirect_ref (instance
);
9269 gcc_assert (!DECL_DESTRUCTOR_P (fn
) && !DECL_CONSTRUCTOR_P (fn
));
9271 /* For the overload resolution we need to find the actual `this`
9272 that would be captured if the call turns out to be to a
9273 non-static member function. Do not actually capture it at this
9275 if (DECL_CONSTRUCTOR_P (fn
))
9276 /* Constructors don't use the enclosing 'this'. */
9277 first_mem_arg
= instance
;
9279 first_mem_arg
= maybe_resolve_dummy (instance
, false);
9281 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9282 p
= conversion_obstack_alloc (0);
9284 /* The number of arguments artificial parms in ARGS; we subtract one because
9285 there's no 'this' in ARGS. */
9286 unsigned skip
= num_artificial_parms_for (fn
) - 1;
9288 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
9289 initializer, not T({ }). */
9290 if (DECL_CONSTRUCTOR_P (fn
)
9291 && vec_safe_length (user_args
) > skip
9292 && DIRECT_LIST_INIT_P ((*user_args
)[skip
]))
9294 tree init_list
= (*user_args
)[skip
];
9295 tree init
= NULL_TREE
;
9297 gcc_assert (user_args
->length () == skip
+ 1
9298 && !(flags
& LOOKUP_ONLYCONVERTING
));
9300 /* If the initializer list has no elements and T is a class type with
9301 a default constructor, the object is value-initialized. Handle
9302 this here so we don't need to handle it wherever we use
9303 build_special_member_call. */
9304 if (CONSTRUCTOR_NELTS (init_list
) == 0
9305 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
9306 /* For a user-provided default constructor, use the normal
9307 mechanisms so that protected access works. */
9308 && type_has_non_user_provided_default_constructor (basetype
)
9309 && !processing_template_decl
)
9310 init
= build_value_init (basetype
, complain
);
9312 /* If BASETYPE is an aggregate, we need to do aggregate
9314 else if (CP_AGGREGATE_TYPE_P (basetype
))
9316 init
= reshape_init (basetype
, init_list
, complain
);
9317 init
= digest_init (basetype
, init
, complain
);
9322 if (is_dummy_object (instance
))
9323 return get_target_expr_sfinae (init
, complain
);
9324 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
9325 TREE_SIDE_EFFECTS (init
) = true;
9329 /* Otherwise go ahead with overload resolution. */
9330 add_list_candidates (fns
, first_mem_arg
, user_args
,
9331 basetype
, explicit_targs
, template_only
,
9332 conversion_path
, access_binfo
, flags
,
9333 &candidates
, complain
);
9336 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
9337 explicit_targs
, template_only
, conversion_path
,
9338 access_binfo
, flags
, &candidates
, complain
);
9340 any_viable_p
= false;
9341 candidates
= splice_viable (candidates
, false, &any_viable_p
);
9345 if (complain
& tf_error
)
9347 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
9348 cxx_incomplete_type_error (instance
, basetype
);
9350 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9351 basetype
, optype
, build_tree_list_vec (user_args
),
9352 TREE_TYPE (instance
));
9355 tree arglist
= build_tree_list_vec (user_args
);
9356 tree errname
= name
;
9357 bool twiddle
= false;
9358 if (IDENTIFIER_CDTOR_P (errname
))
9360 twiddle
= IDENTIFIER_DTOR_P (errname
);
9361 errname
= constructor_name (basetype
);
9364 errname
= lookup_template_function (errname
, explicit_targs
);
9365 if (skip_first_for_error
)
9366 arglist
= TREE_CHAIN (arglist
);
9367 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
9368 basetype
, &"~"[!twiddle
], errname
, arglist
,
9369 TREE_TYPE (instance
));
9371 print_z_candidates (location_of (name
), candidates
);
9373 call
= error_mark_node
;
9377 cand
= tourney (candidates
, complain
);
9384 if (complain
& tf_error
)
9386 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
9387 arglist
= build_tree_list_vec (user_args
);
9388 if (skip_first_for_error
)
9389 arglist
= TREE_CHAIN (arglist
);
9390 if (!any_strictly_viable (candidates
))
9391 error ("no matching function for call to %<%s(%A)%>",
9392 pretty_name
, arglist
);
9394 error ("call of overloaded %<%s(%A)%> is ambiguous",
9395 pretty_name
, arglist
);
9396 print_z_candidates (location_of (name
), candidates
);
9400 call
= error_mark_node
;
9407 if (!(flags
& LOOKUP_NONVIRTUAL
)
9408 && DECL_PURE_VIRTUAL_P (fn
)
9409 && instance
== current_class_ref
9410 && (complain
& tf_warning
))
9412 /* This is not an error, it is runtime undefined
9414 if (!current_function_decl
)
9415 warning (0, "pure virtual %q#D called from "
9416 "non-static data member initializer", fn
);
9417 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
9418 || DECL_DESTRUCTOR_P (current_function_decl
))
9419 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
9420 ? G_("pure virtual %q#D called from constructor")
9421 : G_("pure virtual %q#D called from destructor")),
9425 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
9426 && !DECL_CONSTRUCTOR_P (fn
)
9427 && is_dummy_object (instance
))
9429 instance
= maybe_resolve_dummy (instance
, true);
9430 if (instance
== error_mark_node
)
9431 call
= error_mark_node
;
9432 else if (!is_dummy_object (instance
))
9434 /* We captured 'this' in the current lambda now that
9435 we know we really need it. */
9436 cand
->first_arg
= instance
;
9438 else if (any_dependent_bases_p ())
9439 /* We can't tell until instantiation time whether we can use
9440 *this as the implicit object argument. */;
9443 if (complain
& tf_error
)
9444 error ("cannot call member function %qD without object",
9446 call
= error_mark_node
;
9450 if (call
!= error_mark_node
)
9452 /* Optimize away vtable lookup if we know that this
9453 function can't be overridden. We need to check if
9454 the context and the type where we found fn are the same,
9455 actually FN might be defined in a different class
9456 type because of a using-declaration. In this case, we
9457 do not want to perform a non-virtual call. */
9458 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
9459 && same_type_ignoring_top_level_qualifiers_p
9460 (DECL_CONTEXT (fn
), BINFO_TYPE (binfo
))
9461 && resolves_to_fixed_type_p (instance
, 0))
9462 flags
|= LOOKUP_NONVIRTUAL
;
9464 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
9465 /* Now we know what function is being called. */
9468 /* Build the actual CALL_EXPR. */
9469 call
= build_over_call (cand
, flags
, complain
);
9470 /* In an expression of the form `a->f()' where `f' turns
9471 out to be a static member function, `a' is
9472 none-the-less evaluated. */
9473 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
9474 && !is_dummy_object (instance
)
9475 && TREE_SIDE_EFFECTS (instance
))
9477 /* But avoid the implicit lvalue-rvalue conversion when 'a'
9480 if (TREE_THIS_VOLATILE (a
))
9482 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
), a
, call
);
9484 else if (call
!= error_mark_node
9485 && DECL_DESTRUCTOR_P (cand
->fn
)
9486 && !VOID_TYPE_P (TREE_TYPE (call
)))
9487 /* An explicit call of the form "x->~X()" has type
9488 "void". However, on platforms where destructors
9489 return "this" (i.e., those where
9490 targetm.cxx.cdtor_returns_this is true), such calls
9491 will appear to have a return value of pointer type
9492 to the low-level call machinery. We do not want to
9493 change the low-level machinery, since we want to be
9494 able to optimize "delete f()" on such platforms as
9495 "operator delete(~X(f()))" (rather than generating
9496 "t = f(), ~X(t), operator delete (t)"). */
9497 call
= build_nop (void_type_node
, call
);
9502 if (processing_template_decl
&& call
!= error_mark_node
)
9504 bool cast_to_void
= false;
9506 if (TREE_CODE (call
) == COMPOUND_EXPR
)
9507 call
= TREE_OPERAND (call
, 1);
9508 else if (TREE_CODE (call
) == NOP_EXPR
)
9510 cast_to_void
= true;
9511 call
= TREE_OPERAND (call
, 0);
9513 if (INDIRECT_REF_P (call
))
9514 call
= TREE_OPERAND (call
, 0);
9515 call
= (build_min_non_dep_call_vec
9517 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
9518 orig_instance
, orig_fns
, NULL_TREE
),
9520 SET_EXPR_LOCATION (call
, input_location
);
9521 call
= convert_from_reference (call
);
9523 call
= build_nop (void_type_node
, call
);
9526 /* Free all the conversions we allocated. */
9527 obstack_free (&conversion_obstack
, p
);
9529 if (orig_args
!= NULL
)
9530 release_tree_vector (orig_args
);
9535 /* Wrapper for above. */
9538 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9539 tree conversion_path
, int flags
,
9540 tree
*fn_p
, tsubst_flags_t complain
)
9543 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
9544 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
9546 timevar_cond_stop (TV_OVERLOAD
, subtime
);
9550 /* Returns true iff standard conversion sequence ICS1 is a proper
9551 subsequence of ICS2. */
9554 is_subseq (conversion
*ics1
, conversion
*ics2
)
9556 /* We can assume that a conversion of the same code
9557 between the same types indicates a subsequence since we only get
9558 here if the types we are converting from are the same. */
9560 while (ics1
->kind
== ck_rvalue
9561 || ics1
->kind
== ck_lvalue
)
9562 ics1
= next_conversion (ics1
);
9566 while (ics2
->kind
== ck_rvalue
9567 || ics2
->kind
== ck_lvalue
)
9568 ics2
= next_conversion (ics2
);
9570 if (ics2
->kind
== ck_user
9571 || ics2
->kind
== ck_ambig
9572 || ics2
->kind
== ck_aggr
9573 || ics2
->kind
== ck_list
9574 || ics2
->kind
== ck_identity
)
9575 /* At this point, ICS1 cannot be a proper subsequence of
9576 ICS2. We can get a USER_CONV when we are comparing the
9577 second standard conversion sequence of two user conversion
9581 ics2
= next_conversion (ics2
);
9583 while (ics2
->kind
== ck_rvalue
9584 || ics2
->kind
== ck_lvalue
)
9585 ics2
= next_conversion (ics2
);
9587 if (ics2
->kind
== ics1
->kind
9588 && same_type_p (ics2
->type
, ics1
->type
)
9589 && (ics1
->kind
== ck_identity
9590 || same_type_p (next_conversion (ics2
)->type
,
9591 next_conversion (ics1
)->type
)))
9596 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
9597 be any _TYPE nodes. */
9600 is_properly_derived_from (tree derived
, tree base
)
9602 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
9605 /* We only allow proper derivation here. The DERIVED_FROM_P macro
9606 considers every class derived from itself. */
9607 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
9608 && DERIVED_FROM_P (base
, derived
));
9611 /* We build the ICS for an implicit object parameter as a pointer
9612 conversion sequence. However, such a sequence should be compared
9613 as if it were a reference conversion sequence. If ICS is the
9614 implicit conversion sequence for an implicit object parameter,
9615 modify it accordingly. */
9618 maybe_handle_implicit_object (conversion
**ics
)
9622 /* [over.match.funcs]
9624 For non-static member functions, the type of the
9625 implicit object parameter is "reference to cv X"
9626 where X is the class of which the function is a
9627 member and cv is the cv-qualification on the member
9628 function declaration. */
9629 conversion
*t
= *ics
;
9630 tree reference_type
;
9632 /* The `this' parameter is a pointer to a class type. Make the
9633 implicit conversion talk about a reference to that same class
9635 reference_type
= TREE_TYPE (t
->type
);
9636 reference_type
= build_reference_type (reference_type
);
9638 if (t
->kind
== ck_qual
)
9639 t
= next_conversion (t
);
9640 if (t
->kind
== ck_ptr
)
9641 t
= next_conversion (t
);
9642 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
9643 t
= direct_reference_binding (reference_type
, t
);
9645 t
->rvaluedness_matches_p
= 0;
9650 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
9651 and return the initial reference binding conversion. Otherwise,
9652 leave *ICS unchanged and return NULL. */
9655 maybe_handle_ref_bind (conversion
**ics
)
9657 if ((*ics
)->kind
== ck_ref_bind
)
9659 conversion
*old_ics
= *ics
;
9660 *ics
= next_conversion (old_ics
);
9661 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
9668 /* Compare two implicit conversion sequences according to the rules set out in
9669 [over.ics.rank]. Return values:
9671 1: ics1 is better than ics2
9672 -1: ics2 is better than ics1
9673 0: ics1 and ics2 are indistinguishable */
9676 compare_ics (conversion
*ics1
, conversion
*ics2
)
9682 tree deref_from_type1
= NULL_TREE
;
9683 tree deref_from_type2
= NULL_TREE
;
9684 tree deref_to_type1
= NULL_TREE
;
9685 tree deref_to_type2
= NULL_TREE
;
9686 conversion_rank rank1
, rank2
;
9688 /* REF_BINDING is nonzero if the result of the conversion sequence
9689 is a reference type. In that case REF_CONV is the reference
9690 binding conversion. */
9691 conversion
*ref_conv1
;
9692 conversion
*ref_conv2
;
9694 /* Compare badness before stripping the reference conversion. */
9695 if (ics1
->bad_p
> ics2
->bad_p
)
9697 else if (ics1
->bad_p
< ics2
->bad_p
)
9700 /* Handle implicit object parameters. */
9701 maybe_handle_implicit_object (&ics1
);
9702 maybe_handle_implicit_object (&ics2
);
9704 /* Handle reference parameters. */
9705 ref_conv1
= maybe_handle_ref_bind (&ics1
);
9706 ref_conv2
= maybe_handle_ref_bind (&ics2
);
9708 /* List-initialization sequence L1 is a better conversion sequence than
9709 list-initialization sequence L2 if L1 converts to
9710 std::initializer_list<X> for some X and L2 does not. */
9711 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
9713 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
9718 When comparing the basic forms of implicit conversion sequences (as
9719 defined in _over.best.ics_)
9721 --a standard conversion sequence (_over.ics.scs_) is a better
9722 conversion sequence than a user-defined conversion sequence
9723 or an ellipsis conversion sequence, and
9725 --a user-defined conversion sequence (_over.ics.user_) is a
9726 better conversion sequence than an ellipsis conversion sequence
9727 (_over.ics.ellipsis_). */
9728 /* Use BAD_CONVERSION_RANK because we already checked for a badness
9729 mismatch. If both ICS are bad, we try to make a decision based on
9730 what would have happened if they'd been good. This is not an
9731 extension, we'll still give an error when we build up the call; this
9732 just helps us give a more helpful error message. */
9733 rank1
= BAD_CONVERSION_RANK (ics1
);
9734 rank2
= BAD_CONVERSION_RANK (ics2
);
9738 else if (rank1
< rank2
)
9741 if (ics1
->ellipsis_p
)
9742 /* Both conversions are ellipsis conversions. */
9745 /* User-defined conversion sequence U1 is a better conversion sequence
9746 than another user-defined conversion sequence U2 if they contain the
9747 same user-defined conversion operator or constructor and if the sec-
9748 ond standard conversion sequence of U1 is better than the second
9749 standard conversion sequence of U2. */
9751 /* Handle list-conversion with the same code even though it isn't always
9752 ranked as a user-defined conversion and it doesn't have a second
9753 standard conversion sequence; it will still have the desired effect.
9754 Specifically, we need to do the reference binding comparison at the
9755 end of this function. */
9757 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
|| ics1
->kind
== ck_aggr
)
9762 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
9763 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
9764 || t1
->kind
== ck_list
)
9766 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
9767 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
9768 || t2
->kind
== ck_list
)
9771 if (t1
->kind
!= t2
->kind
)
9773 else if (t1
->kind
== ck_user
)
9775 tree f1
= t1
->cand
? t1
->cand
->fn
: t1
->type
;
9776 tree f2
= t2
->cand
? t2
->cand
->fn
: t2
->type
;
9782 /* For ambiguous or aggregate conversions, use the target type as
9783 a proxy for the conversion function. */
9784 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
9788 /* We can just fall through here, after setting up
9789 FROM_TYPE1 and FROM_TYPE2. */
9790 from_type1
= t1
->type
;
9791 from_type2
= t2
->type
;
9798 /* We're dealing with two standard conversion sequences.
9802 Standard conversion sequence S1 is a better conversion
9803 sequence than standard conversion sequence S2 if
9805 --S1 is a proper subsequence of S2 (comparing the conversion
9806 sequences in the canonical form defined by _over.ics.scs_,
9807 excluding any Lvalue Transformation; the identity
9808 conversion sequence is considered to be a subsequence of
9809 any non-identity conversion sequence */
9812 while (t1
->kind
!= ck_identity
)
9813 t1
= next_conversion (t1
);
9814 from_type1
= t1
->type
;
9817 while (t2
->kind
!= ck_identity
)
9818 t2
= next_conversion (t2
);
9819 from_type2
= t2
->type
;
9822 /* One sequence can only be a subsequence of the other if they start with
9823 the same type. They can start with different types when comparing the
9824 second standard conversion sequence in two user-defined conversion
9826 if (same_type_p (from_type1
, from_type2
))
9828 if (is_subseq (ics1
, ics2
))
9830 if (is_subseq (ics2
, ics1
))
9838 --the rank of S1 is better than the rank of S2 (by the rules
9841 Standard conversion sequences are ordered by their ranks: an Exact
9842 Match is a better conversion than a Promotion, which is a better
9843 conversion than a Conversion.
9845 Two conversion sequences with the same rank are indistinguishable
9846 unless one of the following rules applies:
9848 --A conversion that does not a convert a pointer, pointer to member,
9849 or std::nullptr_t to bool is better than one that does.
9851 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
9852 so that we do not have to check it explicitly. */
9853 if (ics1
->rank
< ics2
->rank
)
9855 else if (ics2
->rank
< ics1
->rank
)
9858 to_type1
= ics1
->type
;
9859 to_type2
= ics2
->type
;
9861 /* A conversion from scalar arithmetic type to complex is worse than a
9862 conversion between scalar arithmetic types. */
9863 if (same_type_p (from_type1
, from_type2
)
9864 && ARITHMETIC_TYPE_P (from_type1
)
9865 && ARITHMETIC_TYPE_P (to_type1
)
9866 && ARITHMETIC_TYPE_P (to_type2
)
9867 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
9868 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
9870 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
9876 if (TYPE_PTR_P (from_type1
)
9877 && TYPE_PTR_P (from_type2
)
9878 && TYPE_PTR_P (to_type1
)
9879 && TYPE_PTR_P (to_type2
))
9881 deref_from_type1
= TREE_TYPE (from_type1
);
9882 deref_from_type2
= TREE_TYPE (from_type2
);
9883 deref_to_type1
= TREE_TYPE (to_type1
);
9884 deref_to_type2
= TREE_TYPE (to_type2
);
9886 /* The rules for pointers to members A::* are just like the rules
9887 for pointers A*, except opposite: if B is derived from A then
9888 A::* converts to B::*, not vice versa. For that reason, we
9889 switch the from_ and to_ variables here. */
9890 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
9891 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
9892 || (TYPE_PTRMEMFUNC_P (from_type1
)
9893 && TYPE_PTRMEMFUNC_P (from_type2
)
9894 && TYPE_PTRMEMFUNC_P (to_type1
)
9895 && TYPE_PTRMEMFUNC_P (to_type2
)))
9897 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
9898 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
9899 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
9900 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
9903 if (deref_from_type1
!= NULL_TREE
9904 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
9905 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
9907 /* This was one of the pointer or pointer-like conversions.
9911 --If class B is derived directly or indirectly from class A,
9912 conversion of B* to A* is better than conversion of B* to
9913 void*, and conversion of A* to void* is better than
9914 conversion of B* to void*. */
9915 if (VOID_TYPE_P (deref_to_type1
)
9916 && VOID_TYPE_P (deref_to_type2
))
9918 if (is_properly_derived_from (deref_from_type1
,
9921 else if (is_properly_derived_from (deref_from_type2
,
9925 else if (VOID_TYPE_P (deref_to_type1
)
9926 || VOID_TYPE_P (deref_to_type2
))
9928 if (same_type_p (deref_from_type1
, deref_from_type2
))
9930 if (VOID_TYPE_P (deref_to_type2
))
9932 if (is_properly_derived_from (deref_from_type1
,
9936 /* We know that DEREF_TO_TYPE1 is `void' here. */
9937 else if (is_properly_derived_from (deref_from_type1
,
9942 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
9943 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
9947 --If class B is derived directly or indirectly from class A
9948 and class C is derived directly or indirectly from B,
9950 --conversion of C* to B* is better than conversion of C* to
9953 --conversion of B* to A* is better than conversion of C* to
9955 if (same_type_p (deref_from_type1
, deref_from_type2
))
9957 if (is_properly_derived_from (deref_to_type1
,
9960 else if (is_properly_derived_from (deref_to_type2
,
9964 else if (same_type_p (deref_to_type1
, deref_to_type2
))
9966 if (is_properly_derived_from (deref_from_type2
,
9969 else if (is_properly_derived_from (deref_from_type1
,
9975 else if (CLASS_TYPE_P (non_reference (from_type1
))
9976 && same_type_p (from_type1
, from_type2
))
9978 tree from
= non_reference (from_type1
);
9982 --binding of an expression of type C to a reference of type
9983 B& is better than binding an expression of type C to a
9984 reference of type A&
9986 --conversion of C to B is better than conversion of C to A, */
9987 if (is_properly_derived_from (from
, to_type1
)
9988 && is_properly_derived_from (from
, to_type2
))
9990 if (is_properly_derived_from (to_type1
, to_type2
))
9992 else if (is_properly_derived_from (to_type2
, to_type1
))
9996 else if (CLASS_TYPE_P (non_reference (to_type1
))
9997 && same_type_p (to_type1
, to_type2
))
9999 tree to
= non_reference (to_type1
);
10003 --binding of an expression of type B to a reference of type
10004 A& is better than binding an expression of type C to a
10005 reference of type A&,
10007 --conversion of B to A is better than conversion of C to A */
10008 if (is_properly_derived_from (from_type1
, to
)
10009 && is_properly_derived_from (from_type2
, to
))
10011 if (is_properly_derived_from (from_type2
, from_type1
))
10013 else if (is_properly_derived_from (from_type1
, from_type2
))
10020 --S1 and S2 differ only in their qualification conversion and yield
10021 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
10022 qualification signature of type T1 is a proper subset of the cv-
10023 qualification signature of type T2 */
10024 if (ics1
->kind
== ck_qual
10025 && ics2
->kind
== ck_qual
10026 && same_type_p (from_type1
, from_type2
))
10028 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
10035 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
10036 to an implicit object parameter of a non-static member function
10037 declared without a ref-qualifier, and either S1 binds an lvalue
10038 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
10039 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
10040 draft standard, 13.3.3.2)
10042 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
10043 types to which the references refer are the same type except for
10044 top-level cv-qualifiers, and the type to which the reference
10045 initialized by S2 refers is more cv-qualified than the type to
10046 which the reference initialized by S1 refers.
10048 DR 1328 [over.match.best]: the context is an initialization by
10049 conversion function for direct reference binding (13.3.1.6) of a
10050 reference to function type, the return type of F1 is the same kind of
10051 reference (i.e. lvalue or rvalue) as the reference being initialized,
10052 and the return type of F2 is not. */
10054 if (ref_conv1
&& ref_conv2
)
10056 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
10057 && (ref_conv1
->rvaluedness_matches_p
10058 != ref_conv2
->rvaluedness_matches_p
)
10059 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
10060 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
10061 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
10063 if (ref_conv1
->bad_p
10064 && !same_type_p (TREE_TYPE (ref_conv1
->type
),
10065 TREE_TYPE (ref_conv2
->type
)))
10066 /* Don't prefer a bad conversion that drops cv-quals to a bad
10067 conversion with the wrong rvalueness. */
10069 return (ref_conv1
->rvaluedness_matches_p
10070 - ref_conv2
->rvaluedness_matches_p
);
10073 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
10075 int q1
= cp_type_quals (TREE_TYPE (ref_conv1
->type
));
10076 int q2
= cp_type_quals (TREE_TYPE (ref_conv2
->type
));
10077 if (ref_conv1
->bad_p
)
10079 /* Prefer the one that drops fewer cv-quals. */
10080 tree ftype
= next_conversion (ref_conv1
)->type
;
10081 int fquals
= cp_type_quals (ftype
);
10085 return comp_cv_qualification (q2
, q1
);
10089 /* Neither conversion sequence is better than the other. */
10093 /* The source type for this standard conversion sequence. */
10096 source_type (conversion
*t
)
10098 for (;; t
= next_conversion (t
))
10100 if (t
->kind
== ck_user
10101 || t
->kind
== ck_ambig
10102 || t
->kind
== ck_identity
)
10105 gcc_unreachable ();
10108 /* Note a warning about preferring WINNER to LOSER. We do this by storing
10109 a pointer to LOSER and re-running joust to produce the warning if WINNER
10110 is actually used. */
10113 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
10115 candidate_warning
*cw
= (candidate_warning
*)
10116 conversion_obstack_alloc (sizeof (candidate_warning
));
10118 cw
->next
= winner
->warnings
;
10119 winner
->warnings
= cw
;
10122 /* Compare two candidates for overloading as described in
10123 [over.match.best]. Return values:
10125 1: cand1 is better than cand2
10126 -1: cand2 is better than cand1
10127 0: cand1 and cand2 are indistinguishable */
10130 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
10131 tsubst_flags_t complain
)
10134 int off1
= 0, off2
= 0;
10138 /* Candidates that involve bad conversions are always worse than those
10140 if (cand1
->viable
> cand2
->viable
)
10142 if (cand1
->viable
< cand2
->viable
)
10145 /* If we have two pseudo-candidates for conversions to the same type,
10146 or two candidates for the same function, arbitrarily pick one. */
10147 if (cand1
->fn
== cand2
->fn
10148 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
10151 /* Prefer a non-deleted function over an implicitly deleted move
10152 constructor or assignment operator. This differs slightly from the
10153 wording for issue 1402 (which says the move op is ignored by overload
10154 resolution), but this way produces better error messages. */
10155 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
10156 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
10157 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
10159 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
10160 && move_fn_p (cand1
->fn
))
10162 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
10163 && move_fn_p (cand2
->fn
))
10167 /* a viable function F1
10168 is defined to be a better function than another viable function F2 if
10169 for all arguments i, ICSi(F1) is not a worse conversion sequence than
10170 ICSi(F2), and then */
10172 /* for some argument j, ICSj(F1) is a better conversion sequence than
10175 /* For comparing static and non-static member functions, we ignore
10176 the implicit object parameter of the non-static function. The
10177 standard says to pretend that the static function has an object
10178 parm, but that won't work with operator overloading. */
10179 len
= cand1
->num_convs
;
10180 if (len
!= cand2
->num_convs
)
10182 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
10183 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
10185 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
10186 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
10187 /* We're comparing a near-match list constructor and a near-match
10188 non-list constructor. Just treat them as unordered. */
10191 gcc_assert (static_1
!= static_2
);
10202 for (i
= 0; i
< len
; ++i
)
10204 conversion
*t1
= cand1
->convs
[i
+ off1
];
10205 conversion
*t2
= cand2
->convs
[i
+ off2
];
10206 int comp
= compare_ics (t1
, t2
);
10210 if ((complain
& tf_warning
)
10212 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
10213 == cr_std
+ cr_promotion
)
10214 && t1
->kind
== ck_std
10215 && t2
->kind
== ck_std
10216 && TREE_CODE (t1
->type
) == INTEGER_TYPE
10217 && TREE_CODE (t2
->type
) == INTEGER_TYPE
10218 && (TYPE_PRECISION (t1
->type
)
10219 == TYPE_PRECISION (t2
->type
))
10220 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
10221 || (TREE_CODE (next_conversion (t1
)->type
)
10222 == ENUMERAL_TYPE
)))
10224 tree type
= next_conversion (t1
)->type
;
10226 struct z_candidate
*w
, *l
;
10228 type1
= t1
->type
, type2
= t2
->type
,
10229 w
= cand1
, l
= cand2
;
10231 type1
= t2
->type
, type2
= t1
->type
,
10232 w
= cand2
, l
= cand1
;
10236 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
10237 type
, type1
, type2
);
10238 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
10241 add_warning (w
, l
);
10244 if (winner
&& comp
!= winner
)
10253 /* warn about confusing overload resolution for user-defined conversions,
10254 either between a constructor and a conversion op, or between two
10256 if ((complain
& tf_warning
)
10257 && winner
&& warn_conversion
&& cand1
->second_conv
10258 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
10259 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
10261 struct z_candidate
*w
, *l
;
10262 bool give_warning
= false;
10265 w
= cand1
, l
= cand2
;
10267 w
= cand2
, l
= cand1
;
10269 /* We don't want to complain about `X::operator T1 ()'
10270 beating `X::operator T2 () const', when T2 is a no less
10271 cv-qualified version of T1. */
10272 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
10273 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
10275 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
10276 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
10278 if (TREE_CODE (t
) == TREE_CODE (f
) && INDIRECT_TYPE_P (t
))
10283 if (!comp_ptr_ttypes (t
, f
))
10284 give_warning
= true;
10287 give_warning
= true;
10293 tree source
= source_type (w
->convs
[0]);
10294 if (INDIRECT_TYPE_P (source
))
10295 source
= TREE_TYPE (source
);
10296 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
10297 && warning (OPT_Wconversion
, " for conversion from %qH to %qI",
10298 source
, w
->second_conv
->type
))
10300 inform (input_location
, " because conversion sequence for the argument is better");
10304 add_warning (w
, l
);
10310 /* DR 495 moved this tiebreaker above the template ones. */
10311 /* or, if not that,
10312 the context is an initialization by user-defined conversion (see
10313 _dcl.init_ and _over.match.user_) and the standard conversion
10314 sequence from the return type of F1 to the destination type (i.e.,
10315 the type of the entity being initialized) is a better conversion
10316 sequence than the standard conversion sequence from the return type
10317 of F2 to the destination type. */
10319 if (cand1
->second_conv
)
10321 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
10326 /* or, if not that,
10327 F1 is a non-template function and F2 is a template function
10330 if (!cand1
->template_decl
&& cand2
->template_decl
)
10332 else if (cand1
->template_decl
&& !cand2
->template_decl
)
10335 /* or, if not that,
10336 F1 and F2 are template functions and the function template for F1 is
10337 more specialized than the template for F2 according to the partial
10340 if (cand1
->template_decl
&& cand2
->template_decl
)
10342 winner
= more_specialized_fn
10343 (TI_TEMPLATE (cand1
->template_decl
),
10344 TI_TEMPLATE (cand2
->template_decl
),
10345 /* [temp.func.order]: The presence of unused ellipsis and default
10346 arguments has no effect on the partial ordering of function
10347 templates. add_function_candidate() will not have
10348 counted the "this" argument for constructors. */
10349 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
10355 // or, if not that, F1 is more constrained than F2.
10356 if (flag_concepts
&& DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
))
10358 winner
= more_constrained (cand1
->fn
, cand2
->fn
);
10363 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
10364 if (deduction_guide_p (cand1
->fn
))
10366 gcc_assert (deduction_guide_p (cand2
->fn
));
10367 /* We distinguish between candidates from an explicit deduction guide and
10368 candidates built from a constructor based on DECL_ARTIFICIAL. */
10369 int art1
= DECL_ARTIFICIAL (cand1
->fn
);
10370 int art2
= DECL_ARTIFICIAL (cand2
->fn
);
10372 return art2
- art1
;
10376 /* Prefer the special copy guide over a declared copy/move
10378 if (copy_guide_p (cand1
->fn
))
10380 if (copy_guide_p (cand2
->fn
))
10383 /* Prefer a candidate generated from a non-template constructor. */
10384 int tg1
= template_guide_p (cand1
->fn
);
10385 int tg2
= template_guide_p (cand2
->fn
);
10391 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
10392 for all arguments the corresponding parameters of F1 and F2 have the same
10393 type (CWG 2273/2277). */
10394 if (DECL_P (cand1
->fn
) && DECL_CLASS_SCOPE_P (cand1
->fn
)
10395 && !DECL_CONV_FN_P (cand1
->fn
)
10396 && DECL_P (cand2
->fn
) && DECL_CLASS_SCOPE_P (cand2
->fn
)
10397 && !DECL_CONV_FN_P (cand2
->fn
))
10399 tree base1
= DECL_CONTEXT (strip_inheriting_ctors (cand1
->fn
));
10400 tree base2
= DECL_CONTEXT (strip_inheriting_ctors (cand2
->fn
));
10402 bool used1
= false;
10403 bool used2
= false;
10404 if (base1
== base2
)
10405 /* No difference. */;
10406 else if (DERIVED_FROM_P (base1
, base2
))
10408 else if (DERIVED_FROM_P (base2
, base1
))
10411 if (int diff
= used2
- used1
)
10413 for (i
= 0; i
< len
; ++i
)
10415 conversion
*t1
= cand1
->convs
[i
+ off1
];
10416 conversion
*t2
= cand2
->convs
[i
+ off2
];
10417 if (!same_type_p (t1
->type
, t2
->type
))
10425 /* Check whether we can discard a builtin candidate, either because we
10426 have two identical ones or matching builtin and non-builtin candidates.
10428 (Pedantically in the latter case the builtin which matched the user
10429 function should not be added to the overload set, but we spot it here.
10432 ... the builtin candidates include ...
10433 - do not have the same parameter type list as any non-template
10434 non-member candidate. */
10436 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
10438 for (i
= 0; i
< len
; ++i
)
10439 if (!same_type_p (cand1
->convs
[i
]->type
,
10440 cand2
->convs
[i
]->type
))
10442 if (i
== cand1
->num_convs
)
10444 if (cand1
->fn
== cand2
->fn
)
10445 /* Two built-in candidates; arbitrarily pick one. */
10447 else if (identifier_p (cand1
->fn
))
10448 /* cand1 is built-in; prefer cand2. */
10451 /* cand2 is built-in; prefer cand1. */
10456 /* For candidates of a multi-versioned function, make the version with
10457 the highest priority win. This version will be checked for dispatching
10458 first. If this version can be inlined into the caller, the front-end
10459 will simply make a direct call to this function. */
10461 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
10462 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
10463 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
10464 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
10466 tree f1
= TREE_TYPE (cand1
->fn
);
10467 tree f2
= TREE_TYPE (cand2
->fn
);
10468 tree p1
= TYPE_ARG_TYPES (f1
);
10469 tree p2
= TYPE_ARG_TYPES (f2
);
10471 /* Check if cand1->fn and cand2->fn are versions of the same function. It
10472 is possible that cand1->fn and cand2->fn are function versions but of
10473 different functions. Check types to see if they are versions of the same
10475 if (compparms (p1
, p2
)
10476 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
10478 /* Always make the version with the higher priority, more
10479 specialized, win. */
10480 gcc_assert (targetm
.compare_version_priority
);
10481 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
10488 /* If the two function declarations represent the same function (this can
10489 happen with declarations in multiple scopes and arg-dependent lookup),
10490 arbitrarily choose one. But first make sure the default args we're
10492 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
10493 && equal_functions (cand1
->fn
, cand2
->fn
))
10495 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
10496 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
10498 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
10500 for (i
= 0; i
< len
; ++i
)
10502 /* Don't crash if the fn is variadic. */
10505 parms1
= TREE_CHAIN (parms1
);
10506 parms2
= TREE_CHAIN (parms2
);
10510 parms1
= TREE_CHAIN (parms1
);
10512 parms2
= TREE_CHAIN (parms2
);
10514 for (; parms1
; ++i
)
10516 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
10517 TREE_PURPOSE (parms2
)))
10521 if (complain
& tf_error
)
10523 if (permerror (input_location
,
10524 "default argument mismatch in "
10525 "overload resolution"))
10527 inform (DECL_SOURCE_LOCATION (cand1
->fn
),
10528 " candidate 1: %q#F", cand1
->fn
);
10529 inform (DECL_SOURCE_LOCATION (cand2
->fn
),
10530 " candidate 2: %q#F", cand2
->fn
);
10537 add_warning (cand1
, cand2
);
10540 parms1
= TREE_CHAIN (parms1
);
10541 parms2
= TREE_CHAIN (parms2
);
10549 /* Extension: If the worst conversion for one candidate is worse than the
10550 worst conversion for the other, take the first. */
10551 if (!pedantic
&& (complain
& tf_warning_or_error
))
10553 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
10554 struct z_candidate
*w
= 0, *l
= 0;
10556 for (i
= 0; i
< len
; ++i
)
10558 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
10559 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
10560 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
10561 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
10564 winner
= 1, w
= cand1
, l
= cand2
;
10566 winner
= -1, w
= cand2
, l
= cand1
;
10569 /* Don't choose a deleted function over ambiguity. */
10570 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
10574 pedwarn (input_location
, 0,
10575 "ISO C++ says that these are ambiguous, even "
10576 "though the worst conversion for the first is better than "
10577 "the worst conversion for the second:");
10578 print_z_candidate (input_location
, _("candidate 1:"), w
);
10579 print_z_candidate (input_location
, _("candidate 2:"), l
);
10582 add_warning (w
, l
);
10587 gcc_assert (!winner
);
10591 /* Given a list of candidates for overloading, find the best one, if any.
10592 This algorithm has a worst case of O(2n) (winner is last), and a best
10593 case of O(n/2) (totally ambiguous); much better than a sorting
10596 static struct z_candidate
*
10597 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
10599 struct z_candidate
*champ
= candidates
, *challenger
;
10601 int champ_compared_to_predecessor
= 0;
10603 /* Walk through the list once, comparing each current champ to the next
10604 candidate, knocking out a candidate or two with each comparison. */
10606 for (challenger
= champ
->next
; challenger
; )
10608 fate
= joust (champ
, challenger
, 0, complain
);
10610 challenger
= challenger
->next
;
10615 champ
= challenger
->next
;
10618 champ_compared_to_predecessor
= 0;
10622 champ
= challenger
;
10623 champ_compared_to_predecessor
= 1;
10626 challenger
= champ
->next
;
10630 /* Make sure the champ is better than all the candidates it hasn't yet
10631 been compared to. */
10633 for (challenger
= candidates
;
10634 challenger
!= champ
10635 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
10636 challenger
= challenger
->next
)
10638 fate
= joust (champ
, challenger
, 0, complain
);
10646 /* Returns nonzero if things of type FROM can be converted to TO. */
10649 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
10651 tree arg
= NULL_TREE
;
10652 /* implicit_conversion only considers user-defined conversions
10653 if it has an expression for the call argument list. */
10654 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
10655 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
10656 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
10659 /* Returns nonzero if things of type FROM can be converted to TO with a
10660 standard conversion. */
10663 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
10665 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
10668 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
10671 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
10672 tsubst_flags_t complain
)
10678 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10679 p
= conversion_obstack_alloc (0);
10680 /* We want to discard any access checks done for this test,
10681 as we might not be in the appropriate access context and
10682 we'll do the check again when we actually perform the
10684 push_deferring_access_checks (dk_deferred
);
10686 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10688 ok_p
= (t
&& !t
->bad_p
);
10690 /* Discard the access checks now. */
10691 pop_deferring_access_checks ();
10692 /* Free all the conversions we allocated. */
10693 obstack_free (&conversion_obstack
, p
);
10698 /* Like can_convert_arg, but allows dubious conversions as well. */
10701 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
10702 tsubst_flags_t complain
)
10707 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10708 p
= conversion_obstack_alloc (0);
10709 /* Try to perform the conversion. */
10710 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10712 /* Free all the conversions we allocated. */
10713 obstack_free (&conversion_obstack
, p
);
10718 /* Convert EXPR to TYPE. Return the converted expression.
10720 Note that we allow bad conversions here because by the time we get to
10721 this point we are committed to doing the conversion. If we end up
10722 doing a bad conversion, convert_like will complain. */
10725 perform_implicit_conversion_flags (tree type
, tree expr
,
10726 tsubst_flags_t complain
, int flags
)
10730 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
10732 if (TYPE_REF_P (type
))
10733 expr
= mark_lvalue_use (expr
);
10735 expr
= mark_rvalue_use (expr
);
10737 if (error_operand_p (expr
))
10738 return error_mark_node
;
10740 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10741 p
= conversion_obstack_alloc (0);
10743 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
10744 /*c_cast_p=*/false,
10749 if (complain
& tf_error
)
10751 /* If expr has unknown type, then it is an overloaded function.
10752 Call instantiate_type to get good error messages. */
10753 if (TREE_TYPE (expr
) == unknown_type_node
)
10754 instantiate_type (type
, expr
, complain
);
10755 else if (invalid_nonstatic_memfn_p (loc
, expr
, complain
))
10756 /* We gave an error. */;
10758 error_at (loc
, "could not convert %qE from %qH to %qI", expr
,
10759 TREE_TYPE (expr
), type
);
10761 expr
= error_mark_node
;
10763 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
10765 /* In a template, we are only concerned about determining the
10766 type of non-dependent expressions, so we do not have to
10767 perform the actual conversion. But for initializers, we
10768 need to be able to perform it at instantiation
10769 (or instantiate_non_dependent_expr) time. */
10770 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
10771 if (!(flags
& LOOKUP_ONLYCONVERTING
))
10772 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
10775 expr
= convert_like (conv
, expr
, complain
);
10777 /* Free all the conversions we allocated. */
10778 obstack_free (&conversion_obstack
, p
);
10784 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
10786 return perform_implicit_conversion_flags (type
, expr
, complain
,
10790 /* Convert EXPR to TYPE (as a direct-initialization) if that is
10791 permitted. If the conversion is valid, the converted expression is
10792 returned. Otherwise, NULL_TREE is returned, except in the case
10793 that TYPE is a class type; in that case, an error is issued. If
10794 C_CAST_P is true, then this direct-initialization is taking
10795 place as part of a static_cast being attempted as part of a C-style
10799 perform_direct_initialization_if_possible (tree type
,
10802 tsubst_flags_t complain
)
10807 if (type
== error_mark_node
|| error_operand_p (expr
))
10808 return error_mark_node
;
10811 If the destination type is a (possibly cv-qualified) class type:
10813 -- If the initialization is direct-initialization ...,
10814 constructors are considered. ... If no constructor applies, or
10815 the overload resolution is ambiguous, the initialization is
10817 if (CLASS_TYPE_P (type
))
10819 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
10820 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
10821 &args
, type
, LOOKUP_NORMAL
, complain
);
10822 release_tree_vector (args
);
10823 return build_cplus_new (type
, expr
, complain
);
10826 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10827 p
= conversion_obstack_alloc (0);
10829 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
10831 LOOKUP_NORMAL
, complain
);
10832 if (!conv
|| conv
->bad_p
)
10834 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
10836 /* In a template, we are only concerned about determining the
10837 type of non-dependent expressions, so we do not have to
10838 perform the actual conversion. But for initializers, we
10839 need to be able to perform it at instantiation
10840 (or instantiate_non_dependent_expr) time. */
10841 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
10842 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
10845 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0,
10846 /*issue_conversion_warnings=*/false,
10850 /* Free all the conversions we allocated. */
10851 obstack_free (&conversion_obstack
, p
);
10856 /* When initializing a reference that lasts longer than a full-expression,
10857 this special rule applies:
10861 The temporary to which the reference is bound or the temporary
10862 that is the complete object to which the reference is bound
10863 persists for the lifetime of the reference.
10865 The temporaries created during the evaluation of the expression
10866 initializing the reference, except the temporary to which the
10867 reference is bound, are destroyed at the end of the
10868 full-expression in which they are created.
10870 In that case, we store the converted expression into a new
10871 VAR_DECL in a new scope.
10873 However, we want to be careful not to create temporaries when
10874 they are not required. For example, given:
10877 struct D : public B {};
10881 there is no need to copy the return value from "f"; we can just
10882 extend its lifetime. Similarly, given:
10885 struct T { operator S(); };
10889 we can extend the lifetime of the return value of the conversion
10892 The next several functions are involved in this lifetime extension. */
10894 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
10895 reference is being bound to a temporary. Create and return a new
10896 VAR_DECL with the indicated TYPE; this variable will store the value to
10897 which the reference is bound. */
10900 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
10902 tree var
= create_temporary_var (type
);
10904 /* Register the variable. */
10906 && (TREE_STATIC (decl
) || CP_DECL_THREAD_LOCAL_P (decl
)))
10908 /* Namespace-scope or local static; give it a mangled name. */
10909 /* FIXME share comdat with decl? */
10911 TREE_STATIC (var
) = TREE_STATIC (decl
);
10912 CP_DECL_THREAD_LOCAL_P (var
) = CP_DECL_THREAD_LOCAL_P (decl
);
10913 set_decl_tls_model (var
, DECL_TLS_MODEL (decl
));
10915 tree name
= mangle_ref_init_variable (decl
);
10916 DECL_NAME (var
) = name
;
10917 SET_DECL_ASSEMBLER_NAME (var
, name
);
10919 var
= pushdecl (var
);
10922 /* Create a new cleanup level if necessary. */
10923 maybe_push_cleanup_level (type
);
10928 /* EXPR is the initializer for a variable DECL of reference or
10929 std::initializer_list type. Create, push and return a new VAR_DECL
10930 for the initializer so that it will live as long as DECL. Any
10931 cleanup for the new variable is returned through CLEANUP, and the
10932 code to initialize the new variable is returned through INITP. */
10935 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
10942 /* Create the temporary variable. */
10943 type
= TREE_TYPE (expr
);
10944 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
10945 layout_decl (var
, 0);
10946 /* If the rvalue is the result of a function call it will be
10947 a TARGET_EXPR. If it is some other construct (such as a
10948 member access expression where the underlying object is
10949 itself the result of a function call), turn it into a
10950 TARGET_EXPR here. It is important that EXPR be a
10951 TARGET_EXPR below since otherwise the INIT_EXPR will
10952 attempt to make a bitwise copy of EXPR to initialize
10954 if (TREE_CODE (expr
) != TARGET_EXPR
)
10955 expr
= get_target_expr (expr
);
10957 if (TREE_CODE (decl
) == FIELD_DECL
10958 && extra_warnings
&& !TREE_NO_WARNING (decl
))
10960 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
10961 "until the constructor exits", decl
);
10962 TREE_NO_WARNING (decl
) = true;
10965 /* Recursively extend temps in this initializer. */
10966 TARGET_EXPR_INITIAL (expr
)
10967 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
10969 /* Any reference temp has a non-trivial initializer. */
10970 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
10972 /* If the initializer is constant, put it in DECL_INITIAL so we get
10973 static initialization and use in constant expressions. */
10974 init
= maybe_constant_init (expr
);
10975 /* As in store_init_value. */
10976 init
= cp_fully_fold (init
);
10977 if (TREE_CONSTANT (init
))
10979 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
10981 /* 5.19 says that a constant expression can include an
10982 lvalue-rvalue conversion applied to "a glvalue of literal type
10983 that refers to a non-volatile temporary object initialized
10984 with a constant expression". Rather than try to communicate
10985 that this VAR_DECL is a temporary, just mark it constexpr. */
10986 DECL_DECLARED_CONSTEXPR_P (var
) = true;
10987 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
10988 TREE_CONSTANT (var
) = true;
10989 TREE_READONLY (var
) = true;
10991 DECL_INITIAL (var
) = init
;
10995 /* Create the INIT_EXPR that will initialize the temporary
10997 init
= split_nonconstant_init (var
, expr
);
10998 if (at_function_scope_p ())
11000 add_decl_expr (var
);
11002 if (TREE_STATIC (var
))
11003 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
11006 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
11008 vec_safe_push (*cleanups
, cleanup
);
11011 /* We must be careful to destroy the temporary only
11012 after its initialization has taken place. If the
11013 initialization throws an exception, then the
11014 destructor should not be run. We cannot simply
11015 transform INIT into something like:
11017 (INIT, ({ CLEANUP_STMT; }))
11019 because emit_local_var always treats the
11020 initializer as a full-expression. Thus, the
11021 destructor would run too early; it would run at the
11022 end of initializing the reference variable, rather
11023 than at the end of the block enclosing the
11024 reference variable.
11026 The solution is to pass back a cleanup expression
11027 which the caller is responsible for attaching to
11028 the statement tree. */
11032 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
11033 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
11035 if (CP_DECL_THREAD_LOCAL_P (var
))
11036 tls_aggregates
= tree_cons (NULL_TREE
, var
,
11039 static_aggregates
= tree_cons (NULL_TREE
, var
,
11040 static_aggregates
);
11043 /* Check whether the dtor is callable. */
11044 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
11046 /* Avoid -Wunused-variable warning (c++/38958). */
11047 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
11049 TREE_USED (decl
) = DECL_READ_P (decl
) = true;
11055 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
11056 initializing a variable of that TYPE. */
11059 initialize_reference (tree type
, tree expr
,
11060 int flags
, tsubst_flags_t complain
)
11064 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
11066 if (type
== error_mark_node
|| error_operand_p (expr
))
11067 return error_mark_node
;
11069 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11070 p
= conversion_obstack_alloc (0);
11072 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
11074 if (!conv
|| conv
->bad_p
)
11076 if (complain
& tf_error
)
11079 convert_like (conv
, expr
, complain
);
11080 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
11081 && !TYPE_REF_IS_RVALUE (type
)
11082 && !lvalue_p (expr
))
11083 error_at (loc
, "invalid initialization of non-const reference of "
11084 "type %qH from an rvalue of type %qI",
11085 type
, TREE_TYPE (expr
));
11087 error_at (loc
, "invalid initialization of reference of type "
11088 "%qH from expression of type %qI", type
,
11091 return error_mark_node
;
11094 if (conv
->kind
== ck_ref_bind
)
11095 /* Perform the conversion. */
11096 expr
= convert_like (conv
, expr
, complain
);
11097 else if (conv
->kind
== ck_ambig
)
11098 /* We gave an error in build_user_type_conversion_1. */
11099 expr
= error_mark_node
;
11101 gcc_unreachable ();
11103 /* Free all the conversions we allocated. */
11104 obstack_free (&conversion_obstack
, p
);
11109 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
11110 which is bound either to a reference or a std::initializer_list. */
11113 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
11118 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
11120 TREE_OPERAND (sub
, 1)
11121 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
11124 if (TREE_CODE (sub
) != ADDR_EXPR
)
11126 /* Deal with binding to a subobject. */
11127 for (p
= &TREE_OPERAND (sub
, 0);
11128 (TREE_CODE (*p
) == COMPONENT_REF
11129 || TREE_CODE (*p
) == ARRAY_REF
); )
11130 p
= &TREE_OPERAND (*p
, 0);
11131 if (TREE_CODE (*p
) == TARGET_EXPR
)
11133 tree subinit
= NULL_TREE
;
11134 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
11135 recompute_tree_invariant_for_addr_expr (sub
);
11137 init
= fold_convert (TREE_TYPE (init
), sub
);
11139 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
11144 /* INIT is part of the initializer for DECL. If there are any
11145 reference or initializer lists being initialized, extend their
11146 lifetime to match that of DECL. */
11149 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
11151 tree type
= TREE_TYPE (init
);
11152 if (processing_template_decl
)
11154 if (TYPE_REF_P (type
))
11155 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
11159 if (TREE_CODE (ctor
) == TARGET_EXPR
)
11160 ctor
= TARGET_EXPR_INITIAL (ctor
);
11161 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
11163 if (is_std_init_list (type
))
11165 /* The temporary array underlying a std::initializer_list
11166 is handled like a reference temporary. */
11167 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
11168 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
11169 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
11174 constructor_elt
*p
;
11175 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (ctor
);
11176 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
11177 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
11179 recompute_constructor_flags (ctor
);
11180 if (decl_maybe_constant_var_p (decl
) && TREE_CONSTANT (ctor
))
11181 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
11188 /* Returns true iff an initializer for TYPE could contain temporaries that
11189 need to be extended because they are bound to references or
11190 std::initializer_list. */
11193 type_has_extended_temps (tree type
)
11195 type
= strip_array_types (type
);
11196 if (TYPE_REF_P (type
))
11198 if (CLASS_TYPE_P (type
))
11200 if (is_std_init_list (type
))
11202 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
11203 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
11204 if (type_has_extended_temps (TREE_TYPE (f
)))
11210 /* Returns true iff TYPE is some variant of std::initializer_list. */
11213 is_std_init_list (tree type
)
11215 if (!TYPE_P (type
))
11217 if (cxx_dialect
== cxx98
)
11219 /* Look through typedefs. */
11220 type
= TYPE_MAIN_VARIANT (type
);
11221 return (CLASS_TYPE_P (type
)
11222 && CP_TYPE_CONTEXT (type
) == std_node
11223 && init_list_identifier
== DECL_NAME (TYPE_NAME (type
)));
11226 /* Returns true iff DECL is a list constructor: i.e. a constructor which
11227 will accept an argument list of a single std::initializer_list<T>. */
11230 is_list_ctor (tree decl
)
11232 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
11235 if (!args
|| args
== void_list_node
)
11238 arg
= non_reference (TREE_VALUE (args
));
11239 if (!is_std_init_list (arg
))
11242 args
= TREE_CHAIN (args
);
11244 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
11245 /* There are more non-defaulted parms. */
11251 #include "gt-cp-call.h"