1 /* Functions related to invoking -*- C++ -*- methods and overloaded functions.
2 Copyright (C) 1987-2016 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com) and
4 modified by Brendan Kehoe (brendan@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* High-level class interface. */
27 #include "coretypes.h"
31 #include "stringpool.h"
33 #include "stor-layout.h"
34 #include "trans-mem.h"
39 #include "langhooks.h"
40 #include "c-family/c-objc.h"
41 #include "internal-fn.h"
43 /* The various kinds of conversion. */
45 enum conversion_kind
{
62 /* The rank of the conversion. Order of the enumerals matters; better
63 conversions should come earlier in the list. */
65 enum conversion_rank
{
76 /* An implicit conversion sequence, in the sense of [over.best.ics].
77 The first conversion to be performed is at the end of the chain.
78 That conversion is always a cr_identity conversion. */
81 /* The kind of conversion represented by this step. */
83 /* The rank of this conversion. */
85 BOOL_BITFIELD user_conv_p
: 1;
86 BOOL_BITFIELD ellipsis_p
: 1;
87 BOOL_BITFIELD this_p
: 1;
88 /* True if this conversion would be permitted with a bending of
89 language standards, e.g. disregarding pointer qualifiers or
90 converting integers to pointers. */
91 BOOL_BITFIELD bad_p
: 1;
92 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
93 temporary should be created to hold the result of the
95 BOOL_BITFIELD need_temporary_p
: 1;
96 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
97 from a pointer-to-derived to pointer-to-base is being performed. */
98 BOOL_BITFIELD base_p
: 1;
99 /* If KIND is ck_ref_bind, true when either an lvalue reference is
100 being bound to an lvalue expression or an rvalue reference is
101 being bound to an rvalue expression. If KIND is ck_rvalue,
102 true when we should treat an lvalue as an rvalue (12.8p33). If
103 KIND is ck_base, always false. */
104 BOOL_BITFIELD rvaluedness_matches_p
: 1;
105 BOOL_BITFIELD check_narrowing
: 1;
106 /* The type of the expression resulting from the conversion. */
109 /* The next conversion in the chain. Since the conversions are
110 arranged from outermost to innermost, the NEXT conversion will
111 actually be performed before this conversion. This variant is
112 used only when KIND is neither ck_identity, ck_ambig nor
113 ck_list. Please use the next_conversion function instead
114 of using this field directly. */
116 /* The expression at the beginning of the conversion chain. This
117 variant is used only if KIND is ck_identity or ck_ambig. */
119 /* The array of conversions for an initializer_list, so this
120 variant is used only when KIN D is ck_list. */
123 /* The function candidate corresponding to this conversion
124 sequence. This field is only used if KIND is ck_user. */
125 struct z_candidate
*cand
;
128 #define CONVERSION_RANK(NODE) \
129 ((NODE)->bad_p ? cr_bad \
130 : (NODE)->ellipsis_p ? cr_ellipsis \
131 : (NODE)->user_conv_p ? cr_user \
134 #define BAD_CONVERSION_RANK(NODE) \
135 ((NODE)->ellipsis_p ? cr_ellipsis \
136 : (NODE)->user_conv_p ? cr_user \
139 static struct obstack conversion_obstack
;
140 static bool conversion_obstack_initialized
;
141 struct rejection_reason
;
143 static struct z_candidate
* tourney (struct z_candidate
*, tsubst_flags_t
);
144 static int equal_functions (tree
, tree
);
145 static int joust (struct z_candidate
*, struct z_candidate
*, bool,
147 static int compare_ics (conversion
*, conversion
*);
148 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
149 static tree
build_java_interface_fn_ref (tree
, tree
);
150 #define convert_like(CONV, EXPR, COMPLAIN) \
151 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
152 /*issue_conversion_warnings=*/true, \
153 /*c_cast_p=*/false, (COMPLAIN))
154 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
155 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
156 /*issue_conversion_warnings=*/true, \
157 /*c_cast_p=*/false, (COMPLAIN))
158 static tree
convert_like_real (conversion
*, tree
, tree
, int, int, bool,
159 bool, tsubst_flags_t
);
160 static void op_error (location_t
, enum tree_code
, enum tree_code
, tree
,
162 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int,
164 static void print_z_candidate (location_t
, const char *, struct z_candidate
*);
165 static void print_z_candidates (location_t
, struct z_candidate
*);
166 static tree
build_this (tree
);
167 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
168 static bool any_strictly_viable (struct z_candidate
*);
169 static struct z_candidate
*add_template_candidate
170 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
171 tree
, tree
, tree
, int, unification_kind_t
, tsubst_flags_t
);
172 static struct z_candidate
*add_template_candidate_real
173 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
174 tree
, tree
, tree
, int, tree
, unification_kind_t
, tsubst_flags_t
);
175 static void add_builtin_candidates
176 (struct z_candidate
**, enum tree_code
, enum tree_code
,
177 tree
, tree
*, int, tsubst_flags_t
);
178 static void add_builtin_candidate
179 (struct z_candidate
**, enum tree_code
, enum tree_code
,
180 tree
, tree
, tree
, tree
*, tree
*, int, tsubst_flags_t
);
181 static bool is_complete (tree
);
182 static void build_builtin_candidate
183 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
184 int, tsubst_flags_t
);
185 static struct z_candidate
*add_conv_candidate
186 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
187 tree
, tsubst_flags_t
);
188 static struct z_candidate
*add_function_candidate
189 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
190 tree
, int, tsubst_flags_t
);
191 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int,
193 static conversion
*reference_binding (tree
, tree
, tree
, bool, int,
195 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
196 static conversion
*build_list_conv (tree
, tree
, int, tsubst_flags_t
);
197 static conversion
*next_conversion (conversion
*);
198 static bool is_subseq (conversion
*, conversion
*);
199 static conversion
*maybe_handle_ref_bind (conversion
**);
200 static void maybe_handle_implicit_object (conversion
**);
201 static struct z_candidate
*add_candidate
202 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, size_t,
203 conversion
**, tree
, tree
, int, struct rejection_reason
*, int);
204 static tree
source_type (conversion
*);
205 static void add_warning (struct z_candidate
*, struct z_candidate
*);
206 static bool reference_compatible_p (tree
, tree
);
207 static conversion
*direct_reference_binding (tree
, conversion
*);
208 static bool promoted_arithmetic_type_p (tree
);
209 static conversion
*conditional_conversion (tree
, tree
, tsubst_flags_t
);
210 static char *name_as_c_string (tree
, tree
, bool *);
211 static tree
prep_operand (tree
);
212 static void add_candidates (tree
, tree
, const vec
<tree
, va_gc
> *, tree
, tree
,
213 bool, tree
, tree
, int, struct z_candidate
**,
215 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
216 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
218 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
219 NAME can take many forms... */
222 check_dtor_name (tree basetype
, tree name
)
224 /* Just accept something we've already complained about. */
225 if (name
== error_mark_node
)
228 if (TREE_CODE (name
) == TYPE_DECL
)
229 name
= TREE_TYPE (name
);
230 else if (TYPE_P (name
))
232 else if (identifier_p (name
))
234 if ((MAYBE_CLASS_TYPE_P (basetype
)
235 && name
== constructor_name (basetype
))
236 || (TREE_CODE (basetype
) == ENUMERAL_TYPE
237 && name
== TYPE_IDENTIFIER (basetype
)))
240 name
= get_type_value (name
);
246 template <class T> struct S { ~S(); };
250 NAME will be a class template. */
251 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
255 if (!name
|| name
== error_mark_node
)
257 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
260 /* We want the address of a function or method. We avoid creating a
261 pointer-to-member function. */
264 build_addr_func (tree function
, tsubst_flags_t complain
)
266 tree type
= TREE_TYPE (function
);
268 /* We have to do these by hand to avoid real pointer to member
270 if (TREE_CODE (type
) == METHOD_TYPE
)
272 if (TREE_CODE (function
) == OFFSET_REF
)
274 tree object
= build_address (TREE_OPERAND (function
, 0));
275 return get_member_function_from_ptrfunc (&object
,
276 TREE_OPERAND (function
, 1),
279 function
= build_address (function
);
282 function
= decay_conversion (function
, complain
, /*reject_builtin=*/false);
287 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
288 POINTER_TYPE to those. Note, pointer to member function types
289 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
290 two variants. build_call_a is the primitive taking an array of
291 arguments, while build_call_n is a wrapper that handles varargs. */
294 build_call_n (tree function
, int n
, ...)
297 return build_call_a (function
, 0, NULL
);
300 tree
*argarray
= XALLOCAVEC (tree
, n
);
305 for (i
= 0; i
< n
; i
++)
306 argarray
[i
] = va_arg (ap
, tree
);
308 return build_call_a (function
, n
, argarray
);
312 /* Update various flags in cfun and the call itself based on what is being
313 called. Split out of build_call_a so that bot_manip can use it too. */
316 set_flags_from_callee (tree call
)
319 tree decl
= get_callee_fndecl (call
);
321 /* We check both the decl and the type; a function may be known not to
322 throw without being declared throw(). */
323 nothrow
= decl
&& TREE_NOTHROW (decl
);
324 if (CALL_EXPR_FN (call
))
325 nothrow
|= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call
))));
326 else if (internal_fn_flags (CALL_EXPR_IFN (call
)) & ECF_NOTHROW
)
329 if (!nothrow
&& at_function_scope_p () && cfun
&& cp_function_chain
)
330 cp_function_chain
->can_throw
= 1;
332 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
333 current_function_returns_abnormally
= 1;
335 TREE_NOTHROW (call
) = nothrow
;
339 build_call_a (tree function
, int n
, tree
*argarray
)
346 function
= build_addr_func (function
, tf_warning_or_error
);
348 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
349 fntype
= TREE_TYPE (TREE_TYPE (function
));
350 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
351 || TREE_CODE (fntype
) == METHOD_TYPE
);
352 result_type
= TREE_TYPE (fntype
);
353 /* An rvalue has no cv-qualifiers. */
354 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
355 result_type
= cv_unqualified (result_type
);
357 function
= build_call_array_loc (input_location
,
358 result_type
, function
, n
, argarray
);
359 set_flags_from_callee (function
);
361 decl
= get_callee_fndecl (function
);
363 if (decl
&& !TREE_USED (decl
))
365 /* We invoke build_call directly for several library
366 functions. These may have been declared normally if
367 we're building libgcc, so we can't just check
369 gcc_assert (DECL_ARTIFICIAL (decl
)
370 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
375 require_complete_eh_spec_types (fntype
, decl
);
377 TREE_HAS_CONSTRUCTOR (function
) = (decl
&& DECL_CONSTRUCTOR_P (decl
));
379 /* Don't pass empty class objects by value. This is useful
380 for tags in STL, which are used to control overload resolution.
381 We don't need to handle other cases of copying empty classes. */
382 if (! decl
|| ! DECL_BUILT_IN (decl
))
383 for (i
= 0; i
< n
; i
++)
385 tree arg
= CALL_EXPR_ARG (function
, i
);
386 if (is_empty_class (TREE_TYPE (arg
))
387 && ! TREE_ADDRESSABLE (TREE_TYPE (arg
)))
389 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (arg
));
390 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (t
), arg
, t
);
391 CALL_EXPR_ARG (function
, i
) = arg
;
398 /* New overloading code. */
402 struct candidate_warning
{
404 candidate_warning
*next
;
407 /* Information for providing diagnostics about why overloading failed. */
409 enum rejection_reason_code
{
412 rr_explicit_conversion
,
413 rr_template_conversion
,
415 rr_bad_arg_conversion
,
416 rr_template_unification
,
418 rr_constraint_failure
421 struct conversion_info
{
422 /* The index of the argument, 0-based. */
424 /* The actual argument or its type. */
426 /* The type of the parameter. */
430 struct rejection_reason
{
431 enum rejection_reason_code code
;
433 /* Information about an arity mismatch. */
435 /* The expected number of arguments. */
437 /* The actual number of arguments in the call. */
439 /* Whether the call was a varargs call. */
442 /* Information about an argument conversion mismatch. */
443 struct conversion_info conversion
;
444 /* Same, but for bad argument conversions. */
445 struct conversion_info bad_conversion
;
446 /* Information about template unification failures. These are the
447 parameters passed to fn_type_unification. */
455 unification_kind_t strict
;
457 } template_unification
;
458 /* Information about template instantiation failures. These are the
459 parameters passed to instantiate_template. */
463 } template_instantiation
;
468 /* The FUNCTION_DECL that will be called if this candidate is
469 selected by overload resolution. */
471 /* If not NULL_TREE, the first argument to use when calling this
474 /* The rest of the arguments to use when calling this function. If
475 there are no further arguments this may be NULL or it may be an
477 const vec
<tree
, va_gc
> *args
;
478 /* The implicit conversion sequences for each of the arguments to
481 /* The number of implicit conversion sequences. */
483 /* If FN is a user-defined conversion, the standard conversion
484 sequence from the type returned by FN to the desired destination
486 conversion
*second_conv
;
487 struct rejection_reason
*reason
;
488 /* If FN is a member function, the binfo indicating the path used to
489 qualify the name of FN at the call site. This path is used to
490 determine whether or not FN is accessible if it is selected by
491 overload resolution. The DECL_CONTEXT of FN will always be a
492 (possibly improper) base of this binfo. */
494 /* If FN is a non-static member function, the binfo indicating the
495 subobject to which the `this' pointer should be converted if FN
496 is selected by overload resolution. The type pointed to by
497 the `this' pointer must correspond to the most derived class
498 indicated by the CONVERSION_PATH. */
499 tree conversion_path
;
502 candidate_warning
*warnings
;
506 /* The flags active in add_candidate. */
510 /* Returns true iff T is a null pointer constant in the sense of
514 null_ptr_cst_p (tree t
)
516 tree type
= TREE_TYPE (t
);
520 A null pointer constant is an integral constant expression
521 (_expr.const_) rvalue of integer type that evaluates to zero or
522 an rvalue of type std::nullptr_t. */
523 if (NULLPTR_TYPE_P (type
))
526 if (cxx_dialect
>= cxx11
)
528 /* Core issue 903 says only literal 0 is a null pointer constant. */
529 if (TREE_CODE (type
) == INTEGER_TYPE
530 && TREE_CODE (t
) == INTEGER_CST
532 && !TREE_OVERFLOW (t
))
535 else if (CP_INTEGRAL_TYPE_P (type
))
537 t
= fold_non_dependent_expr (t
);
539 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
546 /* Returns true iff T is a null member pointer value (4.11). */
549 null_member_pointer_value_p (tree t
)
551 tree type
= TREE_TYPE (t
);
554 else if (TYPE_PTRMEMFUNC_P (type
))
555 return (TREE_CODE (t
) == CONSTRUCTOR
556 && integer_zerop (CONSTRUCTOR_ELT (t
, 0)->value
));
557 else if (TYPE_PTRDATAMEM_P (type
))
558 return integer_all_onesp (t
);
563 /* Returns nonzero if PARMLIST consists of only default parms,
564 ellipsis, and/or undeduced parameter packs. */
567 sufficient_parms_p (const_tree parmlist
)
569 for (; parmlist
&& parmlist
!= void_list_node
;
570 parmlist
= TREE_CHAIN (parmlist
))
571 if (!TREE_PURPOSE (parmlist
)
572 && !PACK_EXPANSION_P (TREE_VALUE (parmlist
)))
577 /* Allocate N bytes of memory from the conversion obstack. The memory
578 is zeroed before being returned. */
581 conversion_obstack_alloc (size_t n
)
584 if (!conversion_obstack_initialized
)
586 gcc_obstack_init (&conversion_obstack
);
587 conversion_obstack_initialized
= true;
589 p
= obstack_alloc (&conversion_obstack
, n
);
594 /* Allocate rejection reasons. */
596 static struct rejection_reason
*
597 alloc_rejection (enum rejection_reason_code code
)
599 struct rejection_reason
*p
;
600 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
605 static struct rejection_reason
*
606 arity_rejection (tree first_arg
, int expected
, int actual
)
608 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
609 int adjust
= first_arg
!= NULL_TREE
;
610 r
->u
.arity
.expected
= expected
- adjust
;
611 r
->u
.arity
.actual
= actual
- adjust
;
615 static struct rejection_reason
*
616 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
618 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
619 int adjust
= first_arg
!= NULL_TREE
;
620 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
621 r
->u
.conversion
.from
= from
;
622 r
->u
.conversion
.to_type
= to
;
626 static struct rejection_reason
*
627 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
629 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
630 int adjust
= first_arg
!= NULL_TREE
;
631 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
632 r
->u
.bad_conversion
.from
= from
;
633 r
->u
.bad_conversion
.to_type
= to
;
637 static struct rejection_reason
*
638 explicit_conversion_rejection (tree from
, tree to
)
640 struct rejection_reason
*r
= alloc_rejection (rr_explicit_conversion
);
641 r
->u
.conversion
.n_arg
= 0;
642 r
->u
.conversion
.from
= from
;
643 r
->u
.conversion
.to_type
= to
;
647 static struct rejection_reason
*
648 template_conversion_rejection (tree from
, tree to
)
650 struct rejection_reason
*r
= alloc_rejection (rr_template_conversion
);
651 r
->u
.conversion
.n_arg
= 0;
652 r
->u
.conversion
.from
= from
;
653 r
->u
.conversion
.to_type
= to
;
657 static struct rejection_reason
*
658 template_unification_rejection (tree tmpl
, tree explicit_targs
, tree targs
,
659 const tree
*args
, unsigned int nargs
,
660 tree return_type
, unification_kind_t strict
,
663 size_t args_n_bytes
= sizeof (*args
) * nargs
;
664 tree
*args1
= (tree
*) conversion_obstack_alloc (args_n_bytes
);
665 struct rejection_reason
*r
= alloc_rejection (rr_template_unification
);
666 r
->u
.template_unification
.tmpl
= tmpl
;
667 r
->u
.template_unification
.explicit_targs
= explicit_targs
;
668 r
->u
.template_unification
.num_targs
= TREE_VEC_LENGTH (targs
);
669 /* Copy args to our own storage. */
670 memcpy (args1
, args
, args_n_bytes
);
671 r
->u
.template_unification
.args
= args1
;
672 r
->u
.template_unification
.nargs
= nargs
;
673 r
->u
.template_unification
.return_type
= return_type
;
674 r
->u
.template_unification
.strict
= strict
;
675 r
->u
.template_unification
.flags
= flags
;
679 static struct rejection_reason
*
680 template_unification_error_rejection (void)
682 return alloc_rejection (rr_template_unification
);
685 static struct rejection_reason
*
686 invalid_copy_with_fn_template_rejection (void)
688 struct rejection_reason
*r
= alloc_rejection (rr_invalid_copy
);
692 // Build a constraint failure record, saving information into the
693 // template_instantiation field of the rejection. If FN is not a template
694 // declaration, the TMPL member is the FN declaration and TARGS is empty.
696 static struct rejection_reason
*
697 constraint_failure (tree fn
)
699 struct rejection_reason
*r
= alloc_rejection (rr_constraint_failure
);
700 if (tree ti
= DECL_TEMPLATE_INFO (fn
))
702 r
->u
.template_instantiation
.tmpl
= TI_TEMPLATE (ti
);
703 r
->u
.template_instantiation
.targs
= TI_ARGS (ti
);
707 r
->u
.template_instantiation
.tmpl
= fn
;
708 r
->u
.template_instantiation
.targs
= NULL_TREE
;
713 /* Dynamically allocate a conversion. */
716 alloc_conversion (conversion_kind kind
)
719 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
724 /* Make sure that all memory on the conversion obstack has been
728 validate_conversion_obstack (void)
730 if (conversion_obstack_initialized
)
731 gcc_assert ((obstack_next_free (&conversion_obstack
)
732 == obstack_base (&conversion_obstack
)));
735 /* Dynamically allocate an array of N conversions. */
738 alloc_conversions (size_t n
)
740 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
744 build_conv (conversion_kind code
, tree type
, conversion
*from
)
747 conversion_rank rank
= CONVERSION_RANK (from
);
749 /* Note that the caller is responsible for filling in t->cand for
750 user-defined conversions. */
751 t
= alloc_conversion (code
);
774 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
775 t
->bad_p
= from
->bad_p
;
780 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
781 specialization of std::initializer_list<T>, if such a conversion is
785 build_list_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
787 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
788 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
789 conversion
**subconvs
= alloc_conversions (len
);
794 /* Within a list-initialization we can have more user-defined
796 flags
&= ~LOOKUP_NO_CONVERSION
;
797 /* But no narrowing conversions. */
798 flags
|= LOOKUP_NO_NARROWING
;
800 /* Can't make an array of these types. */
801 if (TREE_CODE (elttype
) == REFERENCE_TYPE
802 || TREE_CODE (elttype
) == FUNCTION_TYPE
803 || VOID_TYPE_P (elttype
))
806 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
809 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
810 false, flags
, complain
);
817 t
= alloc_conversion (ck_list
);
819 t
->u
.list
= subconvs
;
822 for (i
= 0; i
< len
; ++i
)
824 conversion
*sub
= subconvs
[i
];
825 if (sub
->rank
> t
->rank
)
827 if (sub
->user_conv_p
)
828 t
->user_conv_p
= true;
836 /* Return the next conversion of the conversion chain (if applicable),
837 or NULL otherwise. Please use this function instead of directly
838 accessing fields of struct conversion. */
841 next_conversion (conversion
*conv
)
844 || conv
->kind
== ck_identity
845 || conv
->kind
== ck_ambig
846 || conv
->kind
== ck_list
)
851 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
852 is a valid aggregate initializer for array type ATYPE. */
855 can_convert_array (tree atype
, tree ctor
, int flags
, tsubst_flags_t complain
)
858 tree elttype
= TREE_TYPE (atype
);
859 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
861 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
863 if (TREE_CODE (elttype
) == ARRAY_TYPE
864 && TREE_CODE (val
) == CONSTRUCTOR
)
865 ok
= can_convert_array (elttype
, val
, flags
, complain
);
867 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
,
875 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
876 aggregate class, if such a conversion is possible. */
879 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
881 unsigned HOST_WIDE_INT i
= 0;
883 tree field
= next_initializable_field (TYPE_FIELDS (type
));
884 tree empty_ctor
= NULL_TREE
;
886 /* We already called reshape_init in implicit_conversion. */
888 /* The conversions within the init-list aren't affected by the enclosing
889 context; they're always simple copy-initialization. */
890 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
892 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
894 tree ftype
= TREE_TYPE (field
);
898 if (i
< CONSTRUCTOR_NELTS (ctor
))
899 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
900 else if (DECL_INITIAL (field
))
901 val
= get_nsdmi (field
, /*ctor*/false);
902 else if (TREE_CODE (ftype
) == REFERENCE_TYPE
)
903 /* Value-initialization of reference is ill-formed. */
907 if (empty_ctor
== NULL_TREE
)
908 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
913 if (TREE_CODE (ftype
) == ARRAY_TYPE
914 && TREE_CODE (val
) == CONSTRUCTOR
)
915 ok
= can_convert_array (ftype
, val
, flags
, complain
);
917 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
923 if (TREE_CODE (type
) == UNION_TYPE
)
927 if (i
< CONSTRUCTOR_NELTS (ctor
))
930 c
= alloc_conversion (ck_aggr
);
933 c
->user_conv_p
= true;
934 c
->check_narrowing
= true;
939 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
940 array type, if such a conversion is possible. */
943 build_array_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
946 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
947 tree elttype
= TREE_TYPE (type
);
952 enum conversion_rank rank
= cr_exact
;
954 /* We might need to propagate the size from the element to the array. */
955 complete_type (type
);
957 if (TYPE_DOMAIN (type
)
958 && !variably_modified_type_p (TYPE_DOMAIN (type
), NULL_TREE
))
960 unsigned HOST_WIDE_INT alen
= tree_to_uhwi (array_type_nelts_top (type
));
965 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
967 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
970 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
971 false, flags
, complain
);
975 if (sub
->rank
> rank
)
977 if (sub
->user_conv_p
)
983 c
= alloc_conversion (ck_aggr
);
986 c
->user_conv_p
= user
;
992 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
993 complex type, if such a conversion is possible. */
996 build_complex_conv (tree type
, tree ctor
, int flags
,
997 tsubst_flags_t complain
)
1000 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1001 tree elttype
= TREE_TYPE (type
);
1006 enum conversion_rank rank
= cr_exact
;
1011 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1013 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1016 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1017 false, flags
, complain
);
1021 if (sub
->rank
> rank
)
1023 if (sub
->user_conv_p
)
1029 c
= alloc_conversion (ck_aggr
);
1032 c
->user_conv_p
= user
;
1038 /* Build a representation of the identity conversion from EXPR to
1039 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1042 build_identity_conv (tree type
, tree expr
)
1046 c
= alloc_conversion (ck_identity
);
1053 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1054 were multiple user-defined conversions to accomplish the job.
1055 Build a conversion that indicates that ambiguity. */
1058 build_ambiguous_conv (tree type
, tree expr
)
1062 c
= alloc_conversion (ck_ambig
);
1070 strip_top_quals (tree t
)
1072 if (TREE_CODE (t
) == ARRAY_TYPE
)
1074 return cp_build_qualified_type (t
, 0);
1077 /* Returns the standard conversion path (see [conv]) from type FROM to type
1078 TO, if any. For proper handling of null pointer constants, you must
1079 also pass the expression EXPR to convert from. If C_CAST_P is true,
1080 this conversion is coming from a C-style cast. */
1083 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1084 int flags
, tsubst_flags_t complain
)
1086 enum tree_code fcode
, tcode
;
1088 bool fromref
= false;
1091 to
= non_reference (to
);
1092 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1095 from
= TREE_TYPE (from
);
1098 to
= strip_top_quals (to
);
1099 from
= strip_top_quals (from
);
1101 if (expr
&& type_unknown_p (expr
))
1103 if (TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1105 tsubst_flags_t tflags
= tf_conv
;
1106 expr
= instantiate_type (to
, expr
, tflags
);
1107 if (expr
== error_mark_node
)
1109 from
= TREE_TYPE (expr
);
1111 else if (TREE_CODE (to
) == BOOLEAN_TYPE
)
1113 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1114 expr
= resolve_nondeduced_context (expr
, complain
);
1115 from
= TREE_TYPE (expr
);
1119 fcode
= TREE_CODE (from
);
1120 tcode
= TREE_CODE (to
);
1122 conv
= build_identity_conv (from
, expr
);
1123 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1125 from
= type_decays_to (from
);
1126 fcode
= TREE_CODE (from
);
1127 conv
= build_conv (ck_lvalue
, from
, conv
);
1129 else if (fromref
|| (expr
&& lvalue_p (expr
)))
1134 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1137 from
= strip_top_quals (bitfield_type
);
1138 fcode
= TREE_CODE (from
);
1141 conv
= build_conv (ck_rvalue
, from
, conv
);
1142 if (flags
& LOOKUP_PREFER_RVALUE
)
1143 conv
->rvaluedness_matches_p
= true;
1146 /* Allow conversion between `__complex__' data types. */
1147 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1149 /* The standard conversion sequence to convert FROM to TO is
1150 the standard conversion sequence to perform componentwise
1152 conversion
*part_conv
= standard_conversion
1153 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
,
1158 conv
= build_conv (part_conv
->kind
, to
, conv
);
1159 conv
->rank
= part_conv
->rank
;
1167 if (same_type_p (from
, to
))
1169 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1170 conv
->type
= qualified_to
;
1175 A null pointer constant can be converted to a pointer type; ... A
1176 null pointer constant of integral type can be converted to an
1177 rvalue of type std::nullptr_t. */
1178 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1179 || NULLPTR_TYPE_P (to
))
1180 && ((expr
&& null_ptr_cst_p (expr
))
1181 || NULLPTR_TYPE_P (from
)))
1182 conv
= build_conv (ck_std
, to
, conv
);
1183 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1184 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1186 /* For backwards brain damage compatibility, allow interconversion of
1187 pointers and integers with a pedwarn. */
1188 conv
= build_conv (ck_std
, to
, conv
);
1191 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1193 /* For backwards brain damage compatibility, allow interconversion of
1194 enums and integers with a pedwarn. */
1195 conv
= build_conv (ck_std
, to
, conv
);
1198 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1199 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1204 if (tcode
== POINTER_TYPE
1205 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from
),
1208 else if (VOID_TYPE_P (TREE_TYPE (to
))
1209 && !TYPE_PTRDATAMEM_P (from
)
1210 && TREE_CODE (TREE_TYPE (from
)) != FUNCTION_TYPE
)
1212 tree nfrom
= TREE_TYPE (from
);
1213 /* Don't try to apply restrict to void. */
1214 int quals
= cp_type_quals (nfrom
) & ~TYPE_QUAL_RESTRICT
;
1215 from
= build_pointer_type
1216 (cp_build_qualified_type (void_type_node
, quals
));
1217 conv
= build_conv (ck_ptr
, from
, conv
);
1219 else if (TYPE_PTRDATAMEM_P (from
))
1221 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1222 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1224 if (DERIVED_FROM_P (fbase
, tbase
)
1225 && (same_type_ignoring_top_level_qualifiers_p
1226 (TYPE_PTRMEM_POINTED_TO_TYPE (from
),
1227 TYPE_PTRMEM_POINTED_TO_TYPE (to
))))
1229 from
= build_ptrmem_type (tbase
,
1230 TYPE_PTRMEM_POINTED_TO_TYPE (from
));
1231 conv
= build_conv (ck_pmem
, from
, conv
);
1233 else if (!same_type_p (fbase
, tbase
))
1236 else if (CLASS_TYPE_P (TREE_TYPE (from
))
1237 && CLASS_TYPE_P (TREE_TYPE (to
))
1240 An rvalue of type "pointer to cv D," where D is a
1241 class type, can be converted to an rvalue of type
1242 "pointer to cv B," where B is a base class (clause
1243 _class.derived_) of D. If B is an inaccessible
1244 (clause _class.access_) or ambiguous
1245 (_class.member.lookup_) base class of D, a program
1246 that necessitates this conversion is ill-formed.
1247 Therefore, we use DERIVED_FROM_P, and do not check
1248 access or uniqueness. */
1249 && DERIVED_FROM_P (TREE_TYPE (to
), TREE_TYPE (from
)))
1252 cp_build_qualified_type (TREE_TYPE (to
),
1253 cp_type_quals (TREE_TYPE (from
)));
1254 from
= build_pointer_type (from
);
1255 conv
= build_conv (ck_ptr
, from
, conv
);
1256 conv
->base_p
= true;
1258 else if (tx_safe_fn_type_p (TREE_TYPE (from
)))
1260 /* A prvalue of type "pointer to transaction_safe function" can be
1261 converted to a prvalue of type "pointer to function". */
1262 tree unsafe
= tx_unsafe_fn_variant (TREE_TYPE (from
));
1263 if (same_type_p (unsafe
, TREE_TYPE (to
)))
1265 from
= build_pointer_type (unsafe
);
1266 conv
= build_conv (ck_tsafe
, from
, conv
);
1270 if (tcode
== POINTER_TYPE
)
1272 to_pointee
= TREE_TYPE (to
);
1273 from_pointee
= TREE_TYPE (from
);
1277 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1278 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1281 if (same_type_p (from
, to
))
1283 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
1284 /* In a C-style cast, we ignore CV-qualification because we
1285 are allowed to perform a static_cast followed by a
1287 conv
= build_conv (ck_qual
, to
, conv
);
1288 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1289 conv
= build_conv (ck_qual
, to
, conv
);
1290 else if (expr
&& string_conv_p (to
, expr
, 0))
1291 /* converting from string constant to char *. */
1292 conv
= build_conv (ck_qual
, to
, conv
);
1293 /* Allow conversions among compatible ObjC pointer types (base
1294 conversions have been already handled above). */
1295 else if (c_dialect_objc ()
1296 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1297 conv
= build_conv (ck_ptr
, to
, conv
);
1298 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1300 conv
= build_conv (ck_ptr
, to
, conv
);
1308 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1310 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1311 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1312 tree fbase
= class_of_this_parm (fromfn
);
1313 tree tbase
= class_of_this_parm (tofn
);
1315 if (!DERIVED_FROM_P (fbase
, tbase
)
1316 || !same_type_p (static_fn_type (fromfn
),
1317 static_fn_type (tofn
)))
1320 from
= build_memfn_type (fromfn
,
1322 cp_type_quals (tbase
),
1323 type_memfn_rqual (tofn
));
1324 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1325 conv
= build_conv (ck_pmem
, from
, conv
);
1326 conv
->base_p
= true;
1328 else if (tcode
== BOOLEAN_TYPE
)
1332 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1333 to member type can be converted to a prvalue of type bool. ...
1334 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1335 std::nullptr_t can be converted to a prvalue of type bool; */
1336 if (ARITHMETIC_TYPE_P (from
)
1337 || UNSCOPED_ENUM_P (from
)
1338 || fcode
== POINTER_TYPE
1339 || TYPE_PTRMEM_P (from
)
1340 || NULLPTR_TYPE_P (from
))
1342 conv
= build_conv (ck_std
, to
, conv
);
1343 if (fcode
== POINTER_TYPE
1344 || TYPE_PTRDATAMEM_P (from
)
1345 || (TYPE_PTRMEMFUNC_P (from
)
1346 && conv
->rank
< cr_pbool
)
1347 || NULLPTR_TYPE_P (from
))
1348 conv
->rank
= cr_pbool
;
1349 if (NULLPTR_TYPE_P (from
) && (flags
& LOOKUP_ONLYCONVERTING
))
1356 /* We don't check for ENUMERAL_TYPE here because there are no standard
1357 conversions to enum type. */
1358 /* As an extension, allow conversion to complex type. */
1359 else if (ARITHMETIC_TYPE_P (to
))
1361 if (! (INTEGRAL_CODE_P (fcode
)
1362 || (fcode
== REAL_TYPE
&& !(flags
& LOOKUP_NO_NON_INTEGRAL
)))
1363 || SCOPED_ENUM_P (from
))
1365 conv
= build_conv (ck_std
, to
, conv
);
1367 /* Give this a better rank if it's a promotion. */
1368 if (same_type_p (to
, type_promotes_to (from
))
1369 && next_conversion (conv
)->rank
<= cr_promotion
)
1370 conv
->rank
= cr_promotion
;
1372 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1373 && vector_types_convertible_p (from
, to
, false))
1374 return build_conv (ck_std
, to
, conv
);
1375 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1376 && is_properly_derived_from (from
, to
))
1378 if (conv
->kind
== ck_rvalue
)
1379 conv
= next_conversion (conv
);
1380 conv
= build_conv (ck_base
, to
, conv
);
1381 /* The derived-to-base conversion indicates the initialization
1382 of a parameter with base type from an object of a derived
1383 type. A temporary object is created to hold the result of
1384 the conversion unless we're binding directly to a reference. */
1385 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1390 if (flags
& LOOKUP_NO_NARROWING
)
1391 conv
->check_narrowing
= true;
1396 /* Returns nonzero if T1 is reference-related to T2. */
1399 reference_related_p (tree t1
, tree t2
)
1401 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1404 t1
= TYPE_MAIN_VARIANT (t1
);
1405 t2
= TYPE_MAIN_VARIANT (t2
);
1409 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1410 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1412 return (same_type_p (t1
, t2
)
1413 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1414 && DERIVED_FROM_P (t1
, t2
)));
1417 /* Returns nonzero if T1 is reference-compatible with T2. */
1420 reference_compatible_p (tree t1
, tree t2
)
1424 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
1425 reference-related to T2 and cv1 is the same cv-qualification as,
1426 or greater cv-qualification than, cv2. */
1427 return (reference_related_p (t1
, t2
)
1428 && at_least_as_qualified_p (t1
, t2
));
1431 /* A reference of the indicated TYPE is being bound directly to the
1432 expression represented by the implicit conversion sequence CONV.
1433 Return a conversion sequence for this binding. */
1436 direct_reference_binding (tree type
, conversion
*conv
)
1440 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
1441 gcc_assert (TREE_CODE (conv
->type
) != REFERENCE_TYPE
);
1443 t
= TREE_TYPE (type
);
1447 When a parameter of reference type binds directly
1448 (_dcl.init.ref_) to an argument expression, the implicit
1449 conversion sequence is the identity conversion, unless the
1450 argument expression has a type that is a derived class of the
1451 parameter type, in which case the implicit conversion sequence is
1452 a derived-to-base Conversion.
1454 If the parameter binds directly to the result of applying a
1455 conversion function to the argument expression, the implicit
1456 conversion sequence is a user-defined conversion sequence
1457 (_over.ics.user_), with the second standard conversion sequence
1458 either an identity conversion or, if the conversion function
1459 returns an entity of a type that is a derived class of the
1460 parameter type, a derived-to-base conversion. */
1461 if (!same_type_ignoring_top_level_qualifiers_p (t
, conv
->type
))
1463 /* Represent the derived-to-base conversion. */
1464 conv
= build_conv (ck_base
, t
, conv
);
1465 /* We will actually be binding to the base-class subobject in
1466 the derived class, so we mark this conversion appropriately.
1467 That way, convert_like knows not to generate a temporary. */
1468 conv
->need_temporary_p
= false;
1470 return build_conv (ck_ref_bind
, type
, conv
);
1473 /* Returns the conversion path from type FROM to reference type TO for
1474 purposes of reference binding. For lvalue binding, either pass a
1475 reference type to FROM or an lvalue expression to EXPR. If the
1476 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1477 the conversion returned. If C_CAST_P is true, this
1478 conversion is coming from a C-style cast. */
1481 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1482 tsubst_flags_t complain
)
1484 conversion
*conv
= NULL
;
1485 tree to
= TREE_TYPE (rto
);
1490 cp_lvalue_kind gl_kind
;
1493 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1495 expr
= instantiate_type (to
, expr
, tf_none
);
1496 if (expr
== error_mark_node
)
1498 from
= TREE_TYPE (expr
);
1501 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1503 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1504 /* DR 1288: Otherwise, if the initializer list has a single element
1505 of type E and ... [T's] referenced type is reference-related to E,
1506 the object or reference is initialized from that element... */
1507 if (CONSTRUCTOR_NELTS (expr
) == 1)
1509 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1510 if (error_operand_p (elt
))
1512 tree etype
= TREE_TYPE (elt
);
1513 if (reference_related_p (to
, etype
))
1520 /* Otherwise, if T is a reference type, a prvalue temporary of the
1521 type referenced by T is copy-list-initialized or
1522 direct-list-initialized, depending on the kind of initialization
1523 for the reference, and the reference is bound to that temporary. */
1524 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1525 flags
|LOOKUP_NO_TEMP_BIND
, complain
);
1529 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1531 from
= TREE_TYPE (from
);
1532 if (!TYPE_REF_IS_RVALUE (rfrom
)
1533 || TREE_CODE (from
) == FUNCTION_TYPE
)
1534 gl_kind
= clk_ordinary
;
1536 gl_kind
= clk_rvalueref
;
1540 gl_kind
= lvalue_kind (expr
);
1541 if (gl_kind
& clk_class
)
1542 /* A class prvalue is not a glvalue. */
1547 is_lvalue
= gl_kind
&& !(gl_kind
& clk_rvalueref
);
1550 if ((gl_kind
& clk_bitfield
) != 0)
1551 tfrom
= unlowered_expr_type (expr
);
1553 /* Figure out whether or not the types are reference-related and
1554 reference compatible. We have to do this after stripping
1555 references from FROM. */
1556 related_p
= reference_related_p (to
, tfrom
);
1557 /* If this is a C cast, first convert to an appropriately qualified
1558 type, so that we can later do a const_cast to the desired type. */
1559 if (related_p
&& c_cast_p
1560 && !at_least_as_qualified_p (to
, tfrom
))
1561 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1562 compatible_p
= reference_compatible_p (to
, tfrom
);
1564 /* Directly bind reference when target expression's type is compatible with
1565 the reference and expression is an lvalue. In DR391, the wording in
1566 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1567 const and rvalue references to rvalues of compatible class type.
1568 We should also do direct bindings for non-class xvalues. */
1571 || (!(flags
& LOOKUP_NO_TEMP_BIND
)
1572 && (CLASS_TYPE_P (from
)
1573 || TREE_CODE (from
) == ARRAY_TYPE
))))
1577 If the initializer expression
1579 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1580 is reference-compatible with "cv2 T2,"
1582 the reference is bound directly to the initializer expression
1586 If the initializer expression is an rvalue, with T2 a class type,
1587 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1588 is bound to the object represented by the rvalue or to a sub-object
1589 within that object. */
1591 conv
= build_identity_conv (tfrom
, expr
);
1592 conv
= direct_reference_binding (rto
, conv
);
1594 if (flags
& LOOKUP_PREFER_RVALUE
)
1595 /* The top-level caller requested that we pretend that the lvalue
1596 be treated as an rvalue. */
1597 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1598 else if (TREE_CODE (rfrom
) == REFERENCE_TYPE
)
1599 /* Handle rvalue reference to function properly. */
1600 conv
->rvaluedness_matches_p
1601 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1603 conv
->rvaluedness_matches_p
1604 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1606 if ((gl_kind
& clk_bitfield
) != 0
1607 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1608 /* For the purposes of overload resolution, we ignore the fact
1609 this expression is a bitfield or packed field. (In particular,
1610 [over.ics.ref] says specifically that a function with a
1611 non-const reference parameter is viable even if the
1612 argument is a bitfield.)
1614 However, when we actually call the function we must create
1615 a temporary to which to bind the reference. If the
1616 reference is volatile, or isn't const, then we cannot make
1617 a temporary, so we just issue an error when the conversion
1619 conv
->need_temporary_p
= true;
1621 /* Don't allow binding of lvalues (other than function lvalues) to
1622 rvalue references. */
1623 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1624 && TREE_CODE (to
) != FUNCTION_TYPE
1625 && !(flags
& LOOKUP_PREFER_RVALUE
))
1628 /* Nor the reverse. */
1629 if (!is_lvalue
&& !TYPE_REF_IS_RVALUE (rto
)
1630 && (!CP_TYPE_CONST_NON_VOLATILE_P (to
)
1631 || (flags
& LOOKUP_NO_RVAL_BIND
))
1632 && TREE_CODE (to
) != FUNCTION_TYPE
)
1640 /* [class.conv.fct] A conversion function is never used to convert a
1641 (possibly cv-qualified) object to the (possibly cv-qualified) same
1642 object type (or a reference to it), to a (possibly cv-qualified) base
1643 class of that type (or a reference to it).... */
1644 else if (CLASS_TYPE_P (from
) && !related_p
1645 && !(flags
& LOOKUP_NO_CONVERSION
))
1649 If the initializer expression
1651 -- has a class type (i.e., T2 is a class type) can be
1652 implicitly converted to an lvalue of type "cv3 T3," where
1653 "cv1 T1" is reference-compatible with "cv3 T3". (this
1654 conversion is selected by enumerating the applicable
1655 conversion functions (_over.match.ref_) and choosing the
1656 best one through overload resolution. (_over.match_).
1658 the reference is bound to the lvalue result of the conversion
1659 in the second case. */
1660 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1663 return cand
->second_conv
;
1666 /* From this point on, we conceptually need temporaries, even if we
1667 elide them. Only the cases above are "direct bindings". */
1668 if (flags
& LOOKUP_NO_TEMP_BIND
)
1673 When a parameter of reference type is not bound directly to an
1674 argument expression, the conversion sequence is the one required
1675 to convert the argument expression to the underlying type of the
1676 reference according to _over.best.ics_. Conceptually, this
1677 conversion sequence corresponds to copy-initializing a temporary
1678 of the underlying type with the argument expression. Any
1679 difference in top-level cv-qualification is subsumed by the
1680 initialization itself and does not constitute a conversion. */
1684 Otherwise, the reference shall be an lvalue reference to a
1685 non-volatile const type, or the reference shall be an rvalue
1688 We try below to treat this as a bad conversion to improve diagnostics,
1689 but if TO is an incomplete class, we need to reject this conversion
1690 now to avoid unnecessary instantiation. */
1691 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
)
1692 && !COMPLETE_TYPE_P (to
))
1695 /* We're generating a temporary now, but don't bind any more in the
1696 conversion (specifically, don't slice the temporary returned by a
1697 conversion operator). */
1698 flags
|= LOOKUP_NO_TEMP_BIND
;
1700 /* Core issue 899: When [copy-]initializing a temporary to be bound
1701 to the first parameter of a copy constructor (12.8) called with
1702 a single argument in the context of direct-initialization,
1703 explicit conversion functions are also considered.
1705 So don't set LOOKUP_ONLYCONVERTING in that case. */
1706 if (!(flags
& LOOKUP_COPY_PARM
))
1707 flags
|= LOOKUP_ONLYCONVERTING
;
1710 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1715 if (conv
->user_conv_p
)
1717 /* If initializing the temporary used a conversion function,
1718 recalculate the second conversion sequence. */
1719 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1720 if (t
->kind
== ck_user
1721 && DECL_CONV_FN_P (t
->cand
->fn
))
1723 tree ftype
= TREE_TYPE (TREE_TYPE (t
->cand
->fn
));
1724 int sflags
= (flags
|LOOKUP_NO_CONVERSION
)&~LOOKUP_NO_TEMP_BIND
;
1725 conversion
*new_second
1726 = reference_binding (rto
, ftype
, NULL_TREE
, c_cast_p
,
1730 return merge_conversion_sequences (t
, new_second
);
1734 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1735 /* This reference binding, unlike those above, requires the
1736 creation of a temporary. */
1737 conv
->need_temporary_p
= true;
1738 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1742 Otherwise, the reference shall be an lvalue reference to a
1743 non-volatile const type, or the reference shall be an rvalue
1745 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1750 Otherwise, a temporary of type "cv1 T1" is created and
1751 initialized from the initializer expression using the rules for a
1752 non-reference copy initialization. If T1 is reference-related to
1753 T2, cv1 must be the same cv-qualification as, or greater
1754 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1755 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1761 /* Returns the implicit conversion sequence (see [over.ics]) from type
1762 FROM to type TO. The optional expression EXPR may affect the
1763 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1764 true, this conversion is coming from a C-style cast. */
1767 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1768 int flags
, tsubst_flags_t complain
)
1772 if (from
== error_mark_node
|| to
== error_mark_node
1773 || expr
== error_mark_node
)
1776 /* Other flags only apply to the primary function in overload
1777 resolution, or after we've chosen one. */
1778 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1779 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1780 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1782 /* FIXME: actually we don't want warnings either, but we can't just
1783 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1784 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1785 We really ought not to issue that warning until we've committed
1786 to that conversion. */
1787 complain
&= ~tf_error
;
1789 /* Call reshape_init early to remove redundant braces. */
1790 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
)
1791 && CLASS_TYPE_P (to
)
1792 && COMPLETE_TYPE_P (complete_type (to
))
1793 && !CLASSTYPE_NON_AGGREGATE (to
))
1795 expr
= reshape_init (to
, expr
, complain
);
1796 if (expr
== error_mark_node
)
1798 from
= TREE_TYPE (expr
);
1801 if (TREE_CODE (to
) == REFERENCE_TYPE
)
1802 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1804 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
, complain
);
1809 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1811 if (is_std_init_list (to
))
1812 return build_list_conv (to
, expr
, flags
, complain
);
1814 /* As an extension, allow list-initialization of _Complex. */
1815 if (TREE_CODE (to
) == COMPLEX_TYPE
)
1817 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1822 /* Allow conversion from an initializer-list with one element to a
1824 if (SCALAR_TYPE_P (to
))
1826 int nelts
= CONSTRUCTOR_NELTS (expr
);
1830 elt
= build_value_init (to
, tf_none
);
1831 else if (nelts
== 1)
1832 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1834 elt
= error_mark_node
;
1836 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1837 c_cast_p
, flags
, complain
);
1840 conv
->check_narrowing
= true;
1841 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1842 /* Too many levels of braces, i.e. '{{1}}'. */
1847 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1848 return build_array_conv (to
, expr
, flags
, complain
);
1851 if (expr
!= NULL_TREE
1852 && (MAYBE_CLASS_TYPE_P (from
)
1853 || MAYBE_CLASS_TYPE_P (to
))
1854 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1856 struct z_candidate
*cand
;
1858 if (CLASS_TYPE_P (to
)
1859 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
1860 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
1861 return build_aggr_conv (to
, expr
, flags
, complain
);
1863 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
1866 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
1867 && CONSTRUCTOR_NELTS (expr
) == 1
1868 && !is_list_ctor (cand
->fn
))
1870 /* "If C is not an initializer-list constructor and the
1871 initializer list has a single element of type cv U, where U is
1872 X or a class derived from X, the implicit conversion sequence
1873 has Exact Match rank if U is X, or Conversion rank if U is
1875 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1876 tree elttype
= TREE_TYPE (elt
);
1877 if (reference_related_p (to
, elttype
))
1878 return implicit_conversion (to
, elttype
, elt
,
1879 c_cast_p
, flags
, complain
);
1881 conv
= cand
->second_conv
;
1884 /* We used to try to bind a reference to a temporary here, but that
1885 is now handled after the recursive call to this function at the end
1886 of reference_binding. */
1893 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1894 functions. ARGS will not be changed until a single candidate is
1897 static struct z_candidate
*
1898 add_candidate (struct z_candidate
**candidates
,
1899 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
1900 size_t num_convs
, conversion
**convs
,
1901 tree access_path
, tree conversion_path
,
1902 int viable
, struct rejection_reason
*reason
,
1905 struct z_candidate
*cand
= (struct z_candidate
*)
1906 conversion_obstack_alloc (sizeof (struct z_candidate
));
1909 cand
->first_arg
= first_arg
;
1911 cand
->convs
= convs
;
1912 cand
->num_convs
= num_convs
;
1913 cand
->access_path
= access_path
;
1914 cand
->conversion_path
= conversion_path
;
1915 cand
->viable
= viable
;
1916 cand
->reason
= reason
;
1917 cand
->next
= *candidates
;
1918 cand
->flags
= flags
;
1924 /* Return the number of remaining arguments in the parameter list
1925 beginning with ARG. */
1928 remaining_arguments (tree arg
)
1932 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
1933 arg
= TREE_CHAIN (arg
))
1939 /* Create an overload candidate for the function or method FN called
1940 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1941 FLAGS is passed on to implicit_conversion.
1943 This does not change ARGS.
1945 CTYPE, if non-NULL, is the type we want to pretend this function
1946 comes from for purposes of overload resolution. */
1948 static struct z_candidate
*
1949 add_function_candidate (struct z_candidate
**candidates
,
1950 tree fn
, tree ctype
, tree first_arg
,
1951 const vec
<tree
, va_gc
> *args
, tree access_path
,
1952 tree conversion_path
, int flags
,
1953 tsubst_flags_t complain
)
1955 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1959 tree orig_first_arg
= first_arg
;
1962 struct rejection_reason
*reason
= NULL
;
1964 /* At this point we should not see any functions which haven't been
1965 explicitly declared, except for friend functions which will have
1966 been found using argument dependent lookup. */
1967 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
1969 /* The `this', `in_chrg' and VTT arguments to constructors are not
1970 considered in overload resolution. */
1971 if (DECL_CONSTRUCTOR_P (fn
))
1973 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
1974 skip
= num_artificial_parms_for (fn
);
1975 if (skip
> 0 && first_arg
!= NULL_TREE
)
1978 first_arg
= NULL_TREE
;
1984 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
1985 convs
= alloc_conversions (len
);
1987 /* 13.3.2 - Viable functions [over.match.viable]
1988 First, to be a viable function, a candidate function shall have enough
1989 parameters to agree in number with the arguments in the list.
1991 We need to check this first; otherwise, checking the ICSes might cause
1992 us to produce an ill-formed template instantiation. */
1994 parmnode
= parmlist
;
1995 for (i
= 0; i
< len
; ++i
)
1997 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
1999 parmnode
= TREE_CHAIN (parmnode
);
2002 if ((i
< len
&& parmnode
)
2003 || !sufficient_parms_p (parmnode
))
2005 int remaining
= remaining_arguments (parmnode
);
2007 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
2010 /* Second, for a function to be viable, its constraints must be
2012 if (flag_concepts
&& viable
2013 && !constraints_satisfied_p (fn
))
2015 reason
= constraint_failure (fn
);
2019 /* When looking for a function from a subobject from an implicit
2020 copy/move constructor/operator=, don't consider anything that takes (a
2021 reference to) an unrelated type. See c++/44909 and core 1092. */
2022 if (viable
&& parmlist
&& (flags
& LOOKUP_DEFAULTED
))
2024 if (DECL_CONSTRUCTOR_P (fn
))
2026 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
2027 && DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
)
2033 parmnode
= chain_index (i
-1, parmlist
);
2034 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
2039 /* This only applies at the top level. */
2040 flags
&= ~LOOKUP_DEFAULTED
;
2046 /* Third, for F to be a viable function, there shall exist for each
2047 argument an implicit conversion sequence that converts that argument
2048 to the corresponding parameter of F. */
2050 parmnode
= parmlist
;
2052 for (i
= 0; i
< len
; ++i
)
2054 tree argtype
, to_type
;
2059 if (parmnode
== void_list_node
)
2062 if (i
== 0 && first_arg
!= NULL_TREE
)
2065 arg
= CONST_CAST_TREE (
2066 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
2067 argtype
= lvalue_type (arg
);
2069 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2070 && ! DECL_CONSTRUCTOR_P (fn
));
2074 tree parmtype
= TREE_VALUE (parmnode
);
2077 parmnode
= TREE_CHAIN (parmnode
);
2079 /* The type of the implicit object parameter ('this') for
2080 overload resolution is not always the same as for the
2081 function itself; conversion functions are considered to
2082 be members of the class being converted, and functions
2083 introduced by a using-declaration are considered to be
2084 members of the class that uses them.
2086 Since build_over_call ignores the ICS for the `this'
2087 parameter, we can just change the parm type. */
2088 if (ctype
&& is_this
)
2090 parmtype
= cp_build_qualified_type
2091 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
2092 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
2094 /* If the function has a ref-qualifier, the implicit
2095 object parameter has reference type. */
2096 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
2097 parmtype
= cp_build_reference_type (parmtype
, rv
);
2098 /* The special handling of 'this' conversions in compare_ics
2099 does not apply if there is a ref-qualifier. */
2104 parmtype
= build_pointer_type (parmtype
);
2105 arg
= build_this (arg
);
2106 argtype
= lvalue_type (arg
);
2110 /* Core issue 899: When [copy-]initializing a temporary to be bound
2111 to the first parameter of a copy constructor (12.8) called with
2112 a single argument in the context of direct-initialization,
2113 explicit conversion functions are also considered.
2115 So set LOOKUP_COPY_PARM to let reference_binding know that
2116 it's being called in that context. We generalize the above
2117 to handle move constructors and template constructors as well;
2118 the standardese should soon be updated similarly. */
2119 if (ctype
&& i
== 0 && (len
-skip
== 1)
2120 && DECL_CONSTRUCTOR_P (fn
)
2121 && parmtype
!= error_mark_node
2122 && (same_type_ignoring_top_level_qualifiers_p
2123 (non_reference (parmtype
), ctype
)))
2125 if (!(flags
& LOOKUP_ONLYCONVERTING
))
2126 lflags
|= LOOKUP_COPY_PARM
;
2127 /* We allow user-defined conversions within init-lists, but
2128 don't list-initialize the copy parm, as that would mean
2129 using two levels of braces for the same type. */
2130 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
2131 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
2132 lflags
|= LOOKUP_NO_CONVERSION
;
2135 lflags
|= LOOKUP_ONLYCONVERTING
;
2137 t
= implicit_conversion (parmtype
, argtype
, arg
,
2138 /*c_cast_p=*/false, lflags
, complain
);
2143 t
= build_identity_conv (argtype
, arg
);
2144 t
->ellipsis_p
= true;
2155 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
);
2162 reason
= bad_arg_conversion_rejection (first_arg
, i
, arg
, to_type
);
2167 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2168 access_path
, conversion_path
, viable
, reason
, flags
);
2171 /* Create an overload candidate for the conversion function FN which will
2172 be invoked for expression OBJ, producing a pointer-to-function which
2173 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2174 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2175 passed on to implicit_conversion.
2177 Actually, we don't really care about FN; we care about the type it
2178 converts to. There may be multiple conversion functions that will
2179 convert to that type, and we rely on build_user_type_conversion_1 to
2180 choose the best one; so when we create our candidate, we record the type
2181 instead of the function. */
2183 static struct z_candidate
*
2184 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2185 const vec
<tree
, va_gc
> *arglist
,
2186 tree access_path
, tree conversion_path
,
2187 tsubst_flags_t complain
)
2189 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2190 int i
, len
, viable
, flags
;
2191 tree parmlist
, parmnode
;
2193 struct rejection_reason
*reason
;
2195 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2196 parmlist
= TREE_TYPE (parmlist
);
2197 parmlist
= TYPE_ARG_TYPES (parmlist
);
2199 len
= vec_safe_length (arglist
) + 1;
2200 convs
= alloc_conversions (len
);
2201 parmnode
= parmlist
;
2203 flags
= LOOKUP_IMPLICIT
;
2206 /* Don't bother looking up the same type twice. */
2207 if (*candidates
&& (*candidates
)->fn
== totype
)
2210 for (i
= 0; i
< len
; ++i
)
2212 tree arg
, argtype
, convert_type
= NULL_TREE
;
2218 arg
= (*arglist
)[i
- 1];
2219 argtype
= lvalue_type (arg
);
2223 t
= implicit_conversion (totype
, argtype
, arg
, /*c_cast_p=*/false,
2225 convert_type
= totype
;
2227 else if (parmnode
== void_list_node
)
2231 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2232 /*c_cast_p=*/false, flags
, complain
);
2233 convert_type
= TREE_VALUE (parmnode
);
2237 t
= build_identity_conv (argtype
, arg
);
2238 t
->ellipsis_p
= true;
2239 convert_type
= argtype
;
2249 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, arg
, convert_type
);
2256 parmnode
= TREE_CHAIN (parmnode
);
2260 || ! sufficient_parms_p (parmnode
))
2262 int remaining
= remaining_arguments (parmnode
);
2264 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2267 return add_candidate (candidates
, totype
, obj
, arglist
, len
, convs
,
2268 access_path
, conversion_path
, viable
, reason
, flags
);
2272 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2273 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2274 int flags
, tsubst_flags_t complain
)
2281 struct rejection_reason
*reason
= NULL
;
2286 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2287 convs
= alloc_conversions (num_convs
);
2289 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2290 conversion ops are allowed. We handle that here by just checking for
2291 boolean_type_node because other operators don't ask for it. COND_EXPR
2292 also does contextual conversion to bool for the first operand, but we
2293 handle that in build_conditional_expr, and type1 here is operand 2. */
2294 if (type1
!= boolean_type_node
)
2295 flags
|= LOOKUP_ONLYCONVERTING
;
2297 for (i
= 0; i
< 2; ++i
)
2302 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2303 /*c_cast_p=*/false, flags
, complain
);
2307 /* We need something for printing the candidate. */
2308 t
= build_identity_conv (types
[i
], NULL_TREE
);
2309 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2315 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, args
[i
],
2321 /* For COND_EXPR we rearranged the arguments; undo that now. */
2324 convs
[2] = convs
[1];
2325 convs
[1] = convs
[0];
2326 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2327 /*c_cast_p=*/false, flags
,
2334 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2339 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2341 /*access_path=*/NULL_TREE
,
2342 /*conversion_path=*/NULL_TREE
,
2343 viable
, reason
, flags
);
2347 is_complete (tree t
)
2349 return COMPLETE_TYPE_P (complete_type (t
));
2352 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2355 promoted_arithmetic_type_p (tree type
)
2359 In this section, the term promoted integral type is used to refer
2360 to those integral types which are preserved by integral promotion
2361 (including e.g. int and long but excluding e.g. char).
2362 Similarly, the term promoted arithmetic type refers to promoted
2363 integral types plus floating types. */
2364 return ((CP_INTEGRAL_TYPE_P (type
)
2365 && same_type_p (type_promotes_to (type
), type
))
2366 || TREE_CODE (type
) == REAL_TYPE
);
2369 /* Create any builtin operator overload candidates for the operator in
2370 question given the converted operand types TYPE1 and TYPE2. The other
2371 args are passed through from add_builtin_candidates to
2372 build_builtin_candidate.
2374 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2375 If CODE is requires candidates operands of the same type of the kind
2376 of which TYPE1 and TYPE2 are, we add both candidates
2377 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2380 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2381 enum tree_code code2
, tree fnname
, tree type1
,
2382 tree type2
, tree
*args
, tree
*argtypes
, int flags
,
2383 tsubst_flags_t complain
)
2387 case POSTINCREMENT_EXPR
:
2388 case POSTDECREMENT_EXPR
:
2389 args
[1] = integer_zero_node
;
2390 type2
= integer_type_node
;
2399 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2400 and VQ is either volatile or empty, there exist candidate operator
2401 functions of the form
2402 VQ T& operator++(VQ T&);
2403 T operator++(VQ T&, int);
2404 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2405 type other than bool, and VQ is either volatile or empty, there exist
2406 candidate operator functions of the form
2407 VQ T& operator--(VQ T&);
2408 T operator--(VQ T&, int);
2409 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2410 complete object type, and VQ is either volatile or empty, there exist
2411 candidate operator functions of the form
2412 T*VQ& operator++(T*VQ&);
2413 T*VQ& operator--(T*VQ&);
2414 T* operator++(T*VQ&, int);
2415 T* operator--(T*VQ&, int); */
2417 case POSTDECREMENT_EXPR
:
2418 case PREDECREMENT_EXPR
:
2419 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2421 case POSTINCREMENT_EXPR
:
2422 case PREINCREMENT_EXPR
:
2423 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2425 type1
= build_reference_type (type1
);
2430 /* 7 For every cv-qualified or cv-unqualified object type T, there
2431 exist candidate operator functions of the form
2435 8 For every function type T, there exist candidate operator functions of
2437 T& operator*(T*); */
2440 if (TYPE_PTR_P (type1
)
2441 && (TYPE_PTROB_P (type1
)
2442 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2446 /* 9 For every type T, there exist candidate operator functions of the form
2449 10For every promoted arithmetic type T, there exist candidate operator
2450 functions of the form
2454 case UNARY_PLUS_EXPR
: /* unary + */
2455 if (TYPE_PTR_P (type1
))
2458 if (ARITHMETIC_TYPE_P (type1
))
2462 /* 11For every promoted integral type T, there exist candidate operator
2463 functions of the form
2467 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2471 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2472 is the same type as C2 or is a derived class of C2, T is a complete
2473 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2474 there exist candidate operator functions of the form
2475 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2476 where CV12 is the union of CV1 and CV2. */
2479 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2481 tree c1
= TREE_TYPE (type1
);
2482 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2484 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2485 && (TYPE_PTRMEMFUNC_P (type2
)
2486 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2491 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2492 didate operator functions of the form
2497 bool operator<(L, R);
2498 bool operator>(L, R);
2499 bool operator<=(L, R);
2500 bool operator>=(L, R);
2501 bool operator==(L, R);
2502 bool operator!=(L, R);
2503 where LR is the result of the usual arithmetic conversions between
2506 14For every pair of types T and I, where T is a cv-qualified or cv-
2507 unqualified complete object type and I is a promoted integral type,
2508 there exist candidate operator functions of the form
2509 T* operator+(T*, I);
2510 T& operator[](T*, I);
2511 T* operator-(T*, I);
2512 T* operator+(I, T*);
2513 T& operator[](I, T*);
2515 15For every T, where T is a pointer to complete object type, there exist
2516 candidate operator functions of the form112)
2517 ptrdiff_t operator-(T, T);
2519 16For every pointer or enumeration type T, there exist candidate operator
2520 functions of the form
2521 bool operator<(T, T);
2522 bool operator>(T, T);
2523 bool operator<=(T, T);
2524 bool operator>=(T, T);
2525 bool operator==(T, T);
2526 bool operator!=(T, T);
2528 17For every pointer to member type T, there exist candidate operator
2529 functions of the form
2530 bool operator==(T, T);
2531 bool operator!=(T, T); */
2534 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2536 if (TYPE_PTROB_P (type1
)
2537 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2539 type2
= ptrdiff_type_node
;
2543 case TRUNC_DIV_EXPR
:
2544 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2550 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2551 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2553 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2558 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2570 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2572 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2574 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2575 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2577 if (TYPE_PTR_P (type1
)
2578 && null_ptr_cst_p (args
[1]))
2583 if (null_ptr_cst_p (args
[0])
2584 && TYPE_PTR_P (type2
))
2592 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2595 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2597 type1
= ptrdiff_type_node
;
2600 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2602 type2
= ptrdiff_type_node
;
2607 /* 18For every pair of promoted integral types L and R, there exist candi-
2608 date operator functions of the form
2615 where LR is the result of the usual arithmetic conversions between
2618 case TRUNC_MOD_EXPR
:
2624 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2628 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2629 type, VQ is either volatile or empty, and R is a promoted arithmetic
2630 type, there exist candidate operator functions of the form
2631 VQ L& operator=(VQ L&, R);
2632 VQ L& operator*=(VQ L&, R);
2633 VQ L& operator/=(VQ L&, R);
2634 VQ L& operator+=(VQ L&, R);
2635 VQ L& operator-=(VQ L&, R);
2637 20For every pair T, VQ), where T is any type and VQ is either volatile
2638 or empty, there exist candidate operator functions of the form
2639 T*VQ& operator=(T*VQ&, T*);
2641 21For every pair T, VQ), where T is a pointer to member type and VQ is
2642 either volatile or empty, there exist candidate operator functions of
2644 VQ T& operator=(VQ T&, T);
2646 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2647 unqualified complete object type, VQ is either volatile or empty, and
2648 I is a promoted integral type, there exist candidate operator func-
2650 T*VQ& operator+=(T*VQ&, I);
2651 T*VQ& operator-=(T*VQ&, I);
2653 23For every triple L, VQ, R), where L is an integral or enumeration
2654 type, VQ is either volatile or empty, and R is a promoted integral
2655 type, there exist candidate operator functions of the form
2657 VQ L& operator%=(VQ L&, R);
2658 VQ L& operator<<=(VQ L&, R);
2659 VQ L& operator>>=(VQ L&, R);
2660 VQ L& operator&=(VQ L&, R);
2661 VQ L& operator^=(VQ L&, R);
2662 VQ L& operator|=(VQ L&, R); */
2669 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2671 type2
= ptrdiff_type_node
;
2675 case TRUNC_DIV_EXPR
:
2676 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2680 case TRUNC_MOD_EXPR
:
2686 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2691 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2693 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2694 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2695 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2696 || ((TYPE_PTRMEMFUNC_P (type1
)
2697 || TYPE_PTR_P (type1
))
2698 && null_ptr_cst_p (args
[1])))
2708 type1
= build_reference_type (type1
);
2714 For every pair of promoted arithmetic types L and R, there
2715 exist candidate operator functions of the form
2717 LR operator?(bool, L, R);
2719 where LR is the result of the usual arithmetic conversions
2720 between types L and R.
2722 For every type T, where T is a pointer or pointer-to-member
2723 type, there exist candidate operator functions of the form T
2724 operator?(bool, T, T); */
2726 if (promoted_arithmetic_type_p (type1
)
2727 && promoted_arithmetic_type_p (type2
))
2731 /* Otherwise, the types should be pointers. */
2732 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2735 /* We don't check that the two types are the same; the logic
2736 below will actually create two candidates; one in which both
2737 parameter types are TYPE1, and one in which both parameter
2743 if (ARITHMETIC_TYPE_P (type1
))
2751 /* Make sure we don't create builtin candidates with dependent types. */
2752 bool u1
= uses_template_parms (type1
);
2753 bool u2
= type2
? uses_template_parms (type2
) : false;
2756 /* Try to recover if one of the types is non-dependent. But if
2757 there's only one type, there's nothing we can do. */
2760 /* And we lose if both are dependent. */
2763 /* Or if they have different forms. */
2764 if (TREE_CODE (type1
) != TREE_CODE (type2
))
2773 /* If we're dealing with two pointer types or two enumeral types,
2774 we need candidates for both of them. */
2775 if (type2
&& !same_type_p (type1
, type2
)
2776 && TREE_CODE (type1
) == TREE_CODE (type2
)
2777 && (TREE_CODE (type1
) == REFERENCE_TYPE
2778 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2779 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2780 || TYPE_PTRMEMFUNC_P (type1
)
2781 || MAYBE_CLASS_TYPE_P (type1
)
2782 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2784 if (TYPE_PTR_OR_PTRMEM_P (type1
))
2786 tree cptype
= composite_pointer_type (type1
, type2
,
2791 if (cptype
!= error_mark_node
)
2793 build_builtin_candidate
2794 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
2800 build_builtin_candidate
2801 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
2802 build_builtin_candidate
2803 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
2807 build_builtin_candidate
2808 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
2812 type_decays_to (tree type
)
2814 if (TREE_CODE (type
) == ARRAY_TYPE
)
2815 return build_pointer_type (TREE_TYPE (type
));
2816 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2817 return build_pointer_type (type
);
2821 /* There are three conditions of builtin candidates:
2823 1) bool-taking candidates. These are the same regardless of the input.
2824 2) pointer-pair taking candidates. These are generated for each type
2825 one of the input types converts to.
2826 3) arithmetic candidates. According to the standard, we should generate
2827 all of these, but I'm trying not to...
2829 Here we generate a superset of the possible candidates for this particular
2830 case. That is a subset of the full set the standard defines, plus some
2831 other cases which the standard disallows. add_builtin_candidate will
2832 filter out the invalid set. */
2835 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2836 enum tree_code code2
, tree fnname
, tree
*args
,
2837 int flags
, tsubst_flags_t complain
)
2841 tree type
, argtypes
[3], t
;
2842 /* TYPES[i] is the set of possible builtin-operator parameter types
2843 we will consider for the Ith argument. */
2844 vec
<tree
, va_gc
> *types
[2];
2847 for (i
= 0; i
< 3; ++i
)
2850 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2852 argtypes
[i
] = NULL_TREE
;
2857 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2858 and VQ is either volatile or empty, there exist candidate operator
2859 functions of the form
2860 VQ T& operator++(VQ T&); */
2862 case POSTINCREMENT_EXPR
:
2863 case PREINCREMENT_EXPR
:
2864 case POSTDECREMENT_EXPR
:
2865 case PREDECREMENT_EXPR
:
2870 /* 24There also exist candidate operator functions of the form
2871 bool operator!(bool);
2872 bool operator&&(bool, bool);
2873 bool operator||(bool, bool); */
2875 case TRUTH_NOT_EXPR
:
2876 build_builtin_candidate
2877 (candidates
, fnname
, boolean_type_node
,
2878 NULL_TREE
, args
, argtypes
, flags
, complain
);
2881 case TRUTH_ORIF_EXPR
:
2882 case TRUTH_ANDIF_EXPR
:
2883 build_builtin_candidate
2884 (candidates
, fnname
, boolean_type_node
,
2885 boolean_type_node
, args
, argtypes
, flags
, complain
);
2907 types
[0] = make_tree_vector ();
2908 types
[1] = make_tree_vector ();
2910 for (i
= 0; i
< 2; ++i
)
2914 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
2918 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
2921 convs
= lookup_conversions (argtypes
[i
]);
2923 if (code
== COND_EXPR
)
2925 if (real_lvalue_p (args
[i
]))
2926 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
2928 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
2934 for (; convs
; convs
= TREE_CHAIN (convs
))
2936 type
= TREE_TYPE (convs
);
2939 && (TREE_CODE (type
) != REFERENCE_TYPE
2940 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
2943 if (code
== COND_EXPR
&& TREE_CODE (type
) == REFERENCE_TYPE
)
2944 vec_safe_push (types
[i
], type
);
2946 type
= non_reference (type
);
2947 if (i
!= 0 || ! ref1
)
2949 type
= cv_unqualified (type_decays_to (type
));
2950 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
2951 vec_safe_push (types
[i
], type
);
2952 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2953 type
= type_promotes_to (type
);
2956 if (! vec_member (type
, types
[i
]))
2957 vec_safe_push (types
[i
], type
);
2962 if (code
== COND_EXPR
&& real_lvalue_p (args
[i
]))
2963 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
2964 type
= non_reference (argtypes
[i
]);
2965 if (i
!= 0 || ! ref1
)
2967 type
= cv_unqualified (type_decays_to (type
));
2968 if (enum_p
&& UNSCOPED_ENUM_P (type
))
2969 vec_safe_push (types
[i
], type
);
2970 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2971 type
= type_promotes_to (type
);
2973 vec_safe_push (types
[i
], type
);
2977 /* Run through the possible parameter types of both arguments,
2978 creating candidates with those parameter types. */
2979 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
2984 if (!types
[1]->is_empty ())
2985 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
2986 add_builtin_candidate
2987 (candidates
, code
, code2
, fnname
, t
,
2988 u
, args
, argtypes
, flags
, complain
);
2990 add_builtin_candidate
2991 (candidates
, code
, code2
, fnname
, t
,
2992 NULL_TREE
, args
, argtypes
, flags
, complain
);
2995 release_tree_vector (types
[0]);
2996 release_tree_vector (types
[1]);
3000 /* If TMPL can be successfully instantiated as indicated by
3001 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3003 TMPL is the template. EXPLICIT_TARGS are any explicit template
3004 arguments. ARGLIST is the arguments provided at the call-site.
3005 This does not change ARGLIST. The RETURN_TYPE is the desired type
3006 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3007 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3008 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3010 static struct z_candidate
*
3011 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
3012 tree ctype
, tree explicit_targs
, tree first_arg
,
3013 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3014 tree access_path
, tree conversion_path
,
3015 int flags
, tree obj
, unification_kind_t strict
,
3016 tsubst_flags_t complain
)
3018 int ntparms
= DECL_NTPARMS (tmpl
);
3019 tree targs
= make_tree_vec (ntparms
);
3020 unsigned int len
= vec_safe_length (arglist
);
3021 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
3022 unsigned int skip_without_in_chrg
= 0;
3023 tree first_arg_without_in_chrg
= first_arg
;
3024 tree
*args_without_in_chrg
;
3025 unsigned int nargs_without_in_chrg
;
3026 unsigned int ia
, ix
;
3028 struct z_candidate
*cand
;
3030 struct rejection_reason
*reason
= NULL
;
3033 /* We don't do deduction on the in-charge parameter, the VTT
3034 parameter or 'this'. */
3035 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
3037 if (first_arg_without_in_chrg
!= NULL_TREE
)
3038 first_arg_without_in_chrg
= NULL_TREE
;
3039 else if (return_type
&& strict
== DEDUCE_CALL
)
3040 /* We're deducing for a call to the result of a template conversion
3041 function, so the args don't contain 'this'; leave them alone. */;
3043 ++skip_without_in_chrg
;
3046 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
3047 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
3048 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
3050 if (first_arg_without_in_chrg
!= NULL_TREE
)
3051 first_arg_without_in_chrg
= NULL_TREE
;
3053 ++skip_without_in_chrg
;
3056 if (len
< skip_without_in_chrg
)
3059 if (DECL_CONSTRUCTOR_P (tmpl
) && nargs
== 2
3060 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg
),
3061 TREE_TYPE ((*arglist
)[0])))
3063 /* 12.8/6 says, "A declaration of a constructor for a class X is
3064 ill-formed if its first parameter is of type (optionally cv-qualified)
3065 X and either there are no other parameters or else all other
3066 parameters have default arguments. A member function template is never
3067 instantiated to produce such a constructor signature."
3069 So if we're trying to copy an object of the containing class, don't
3070 consider a template constructor that has a first parameter type that
3071 is just a template parameter, as we would deduce a signature that we
3072 would then reject in the code below. */
3073 if (tree firstparm
= FUNCTION_FIRST_USER_PARMTYPE (tmpl
))
3075 firstparm
= TREE_VALUE (firstparm
);
3076 if (PACK_EXPANSION_P (firstparm
))
3077 firstparm
= PACK_EXPANSION_PATTERN (firstparm
);
3078 if (TREE_CODE (firstparm
) == TEMPLATE_TYPE_PARM
)
3080 gcc_assert (!explicit_targs
);
3081 reason
= invalid_copy_with_fn_template_rejection ();
3087 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
3088 + (len
- skip_without_in_chrg
));
3089 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
3091 if (first_arg_without_in_chrg
!= NULL_TREE
)
3093 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
3096 for (ix
= skip_without_in_chrg
;
3097 vec_safe_iterate (arglist
, ix
, &arg
);
3100 args_without_in_chrg
[ia
] = arg
;
3103 gcc_assert (ia
== nargs_without_in_chrg
);
3105 errs
= errorcount
+sorrycount
;
3106 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
3107 args_without_in_chrg
,
3108 nargs_without_in_chrg
,
3109 return_type
, strict
, flags
, false,
3110 complain
& tf_decltype
);
3112 if (fn
== error_mark_node
)
3114 /* Don't repeat unification later if it already resulted in errors. */
3115 if (errorcount
+sorrycount
== errs
)
3116 reason
= template_unification_rejection (tmpl
, explicit_targs
,
3117 targs
, args_without_in_chrg
,
3118 nargs_without_in_chrg
,
3119 return_type
, strict
, flags
);
3121 reason
= template_unification_error_rejection ();
3125 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
3127 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
3128 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
3131 /* We're trying to produce a constructor with a prohibited signature,
3132 as discussed above; handle here any cases we didn't catch then,
3134 reason
= invalid_copy_with_fn_template_rejection ();
3139 if (obj
!= NULL_TREE
)
3140 /* Aha, this is a conversion function. */
3141 cand
= add_conv_candidate (candidates
, fn
, obj
, arglist
,
3142 access_path
, conversion_path
, complain
);
3144 cand
= add_function_candidate (candidates
, fn
, ctype
,
3145 first_arg
, arglist
, access_path
,
3146 conversion_path
, flags
, complain
);
3147 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
3148 /* This situation can occur if a member template of a template
3149 class is specialized. Then, instantiate_template might return
3150 an instantiation of the specialization, in which case the
3151 DECL_TI_TEMPLATE field will point at the original
3152 specialization. For example:
3154 template <class T> struct S { template <class U> void f(U);
3155 template <> void f(int) {}; };
3159 Here, TMPL will be template <class U> S<double>::f(U).
3160 And, instantiate template will give us the specialization
3161 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3162 for this will point at template <class T> template <> S<T>::f(int),
3163 so that we can find the definition. For the purposes of
3164 overload resolution, however, we want the original TMPL. */
3165 cand
->template_decl
= build_template_info (tmpl
, targs
);
3167 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3168 cand
->explicit_targs
= explicit_targs
;
3172 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3173 access_path
, conversion_path
, 0, reason
, flags
);
3177 static struct z_candidate
*
3178 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3179 tree explicit_targs
, tree first_arg
,
3180 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3181 tree access_path
, tree conversion_path
, int flags
,
3182 unification_kind_t strict
, tsubst_flags_t complain
)
3185 add_template_candidate_real (candidates
, tmpl
, ctype
,
3186 explicit_targs
, first_arg
, arglist
,
3187 return_type
, access_path
, conversion_path
,
3188 flags
, NULL_TREE
, strict
, complain
);
3191 /* Create an overload candidate for the conversion function template TMPL,
3192 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3193 pointer-to-function which will in turn be called with the argument list
3194 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3195 passed on to implicit_conversion. */
3197 static struct z_candidate
*
3198 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3200 const vec
<tree
, va_gc
> *arglist
,
3201 tree return_type
, tree access_path
,
3202 tree conversion_path
, tsubst_flags_t complain
)
3205 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3206 NULL_TREE
, arglist
, return_type
, access_path
,
3207 conversion_path
, 0, obj
, DEDUCE_CALL
,
3211 /* The CANDS are the set of candidates that were considered for
3212 overload resolution. Return the set of viable candidates, or CANDS
3213 if none are viable. If any of the candidates were viable, set
3214 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3215 considered viable only if it is strictly viable. */
3217 static struct z_candidate
*
3218 splice_viable (struct z_candidate
*cands
,
3222 struct z_candidate
*viable
;
3223 struct z_candidate
**last_viable
;
3224 struct z_candidate
**cand
;
3225 bool found_strictly_viable
= false;
3227 /* Be strict inside templates, since build_over_call won't actually
3228 do the conversions to get pedwarns. */
3229 if (processing_template_decl
)
3233 last_viable
= &viable
;
3234 *any_viable_p
= false;
3239 struct z_candidate
*c
= *cand
;
3241 && (c
->viable
== 1 || TREE_CODE (c
->fn
) == TEMPLATE_DECL
))
3243 /* Be strict in the presence of a viable candidate. Also if
3244 there are template candidates, so that we get deduction errors
3245 for them instead of silently preferring a bad conversion. */
3247 if (viable
&& !found_strictly_viable
)
3249 /* Put any spliced near matches back onto the main list so
3250 that we see them if there is no strict match. */
3251 *any_viable_p
= false;
3252 *last_viable
= cands
;
3255 last_viable
= &viable
;
3259 if (strict_p
? c
->viable
== 1 : c
->viable
)
3264 last_viable
= &c
->next
;
3265 *any_viable_p
= true;
3267 found_strictly_viable
= true;
3273 return viable
? viable
: cands
;
3277 any_strictly_viable (struct z_candidate
*cands
)
3279 for (; cands
; cands
= cands
->next
)
3280 if (cands
->viable
== 1)
3285 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3286 words, it is about to become the "this" pointer for a member
3287 function call. Take the address of the object. */
3290 build_this (tree obj
)
3292 /* In a template, we are only concerned about the type of the
3293 expression, so we can take a shortcut. */
3294 if (processing_template_decl
)
3295 return build_address (obj
);
3297 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3300 /* Returns true iff functions are equivalent. Equivalent functions are
3301 not '==' only if one is a function-local extern function or if
3302 both are extern "C". */
3305 equal_functions (tree fn1
, tree fn2
)
3307 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3309 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3311 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3312 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3313 return decls_match (fn1
, fn2
);
3317 /* Print information about a candidate being rejected due to INFO. */
3320 print_conversion_rejection (location_t loc
, struct conversion_info
*info
)
3322 tree from
= info
->from
;
3324 from
= lvalue_type (from
);
3325 if (info
->n_arg
== -1)
3327 /* Conversion of implicit `this' argument failed. */
3328 if (!TYPE_P (info
->from
))
3329 /* A bad conversion for 'this' must be discarding cv-quals. */
3330 inform (loc
, " passing %qT as %<this%> "
3331 "argument discards qualifiers",
3334 inform (loc
, " no known conversion for implicit "
3335 "%<this%> parameter from %qT to %qT",
3336 from
, info
->to_type
);
3338 else if (!TYPE_P (info
->from
))
3340 if (info
->n_arg
>= 0)
3341 inform (loc
, " conversion of argument %d would be ill-formed:",
3343 perform_implicit_conversion (info
->to_type
, info
->from
,
3344 tf_warning_or_error
);
3346 else if (info
->n_arg
== -2)
3347 /* Conversion of conversion function return value failed. */
3348 inform (loc
, " no known conversion from %qT to %qT",
3349 from
, info
->to_type
);
3351 inform (loc
, " no known conversion for argument %d from %qT to %qT",
3352 info
->n_arg
+ 1, from
, info
->to_type
);
3355 /* Print information about a candidate with WANT parameters and we found
3359 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3361 inform_n (loc
, want
,
3362 " candidate expects %d argument, %d provided",
3363 " candidate expects %d arguments, %d provided",
3367 /* Print information about one overload candidate CANDIDATE. MSGSTR
3368 is the text to print before the candidate itself.
3370 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3371 to have been run through gettext by the caller. This wart makes
3372 life simpler in print_z_candidates and for the translators. */
3375 print_z_candidate (location_t loc
, const char *msgstr
,
3376 struct z_candidate
*candidate
)
3378 const char *msg
= (msgstr
== NULL
3380 : ACONCAT ((msgstr
, " ", NULL
)));
3381 location_t cloc
= location_of (candidate
->fn
);
3383 if (identifier_p (candidate
->fn
))
3386 if (candidate
->num_convs
== 3)
3387 inform (cloc
, "%s%D(%T, %T, %T) <built-in>", msg
, candidate
->fn
,
3388 candidate
->convs
[0]->type
,
3389 candidate
->convs
[1]->type
,
3390 candidate
->convs
[2]->type
);
3391 else if (candidate
->num_convs
== 2)
3392 inform (cloc
, "%s%D(%T, %T) <built-in>", msg
, candidate
->fn
,
3393 candidate
->convs
[0]->type
,
3394 candidate
->convs
[1]->type
);
3396 inform (cloc
, "%s%D(%T) <built-in>", msg
, candidate
->fn
,
3397 candidate
->convs
[0]->type
);
3399 else if (TYPE_P (candidate
->fn
))
3400 inform (cloc
, "%s%T <conversion>", msg
, candidate
->fn
);
3401 else if (candidate
->viable
== -1)
3402 inform (cloc
, "%s%#D <near match>", msg
, candidate
->fn
);
3403 else if (DECL_DELETED_FN (candidate
->fn
))
3404 inform (cloc
, "%s%#D <deleted>", msg
, candidate
->fn
);
3406 inform (cloc
, "%s%#D", msg
, candidate
->fn
);
3407 /* Give the user some information about why this candidate failed. */
3408 if (candidate
->reason
!= NULL
)
3410 struct rejection_reason
*r
= candidate
->reason
;
3415 print_arity_information (cloc
, r
->u
.arity
.actual
,
3416 r
->u
.arity
.expected
);
3418 case rr_arg_conversion
:
3419 print_conversion_rejection (cloc
, &r
->u
.conversion
);
3421 case rr_bad_arg_conversion
:
3422 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
);
3424 case rr_explicit_conversion
:
3425 inform (cloc
, " return type %qT of explicit conversion function "
3426 "cannot be converted to %qT with a qualification "
3427 "conversion", r
->u
.conversion
.from
,
3428 r
->u
.conversion
.to_type
);
3430 case rr_template_conversion
:
3431 inform (cloc
, " conversion from return type %qT of template "
3432 "conversion function specialization to %qT is not an "
3433 "exact match", r
->u
.conversion
.from
,
3434 r
->u
.conversion
.to_type
);
3436 case rr_template_unification
:
3437 /* We use template_unification_error_rejection if unification caused
3438 actual non-SFINAE errors, in which case we don't need to repeat
3440 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3442 inform (cloc
, " substitution of deduced template arguments "
3443 "resulted in errors seen above");
3446 /* Re-run template unification with diagnostics. */
3447 inform (cloc
, " template argument deduction/substitution failed:");
3448 fn_type_unification (r
->u
.template_unification
.tmpl
,
3449 r
->u
.template_unification
.explicit_targs
,
3451 (r
->u
.template_unification
.num_targs
)),
3452 r
->u
.template_unification
.args
,
3453 r
->u
.template_unification
.nargs
,
3454 r
->u
.template_unification
.return_type
,
3455 r
->u
.template_unification
.strict
,
3456 r
->u
.template_unification
.flags
,
3459 case rr_invalid_copy
:
3461 " a constructor taking a single argument of its own "
3462 "class type is invalid");
3464 case rr_constraint_failure
:
3466 tree tmpl
= r
->u
.template_instantiation
.tmpl
;
3467 tree args
= r
->u
.template_instantiation
.targs
;
3468 diagnose_constraints (cloc
, tmpl
, args
);
3473 /* This candidate didn't have any issues or we failed to
3474 handle a particular code. Either way... */
3481 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3483 struct z_candidate
*cand1
;
3484 struct z_candidate
**cand2
;
3489 /* Remove non-viable deleted candidates. */
3491 for (cand2
= &cand1
; *cand2
; )
3493 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3494 && !(*cand2
)->viable
3495 && DECL_DELETED_FN ((*cand2
)->fn
))
3496 *cand2
= (*cand2
)->next
;
3498 cand2
= &(*cand2
)->next
;
3500 /* ...if there are any non-deleted ones. */
3504 /* There may be duplicates in the set of candidates. We put off
3505 checking this condition as long as possible, since we have no way
3506 to eliminate duplicates from a set of functions in less than n^2
3507 time. Now we are about to emit an error message, so it is more
3508 permissible to go slowly. */
3509 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3511 tree fn
= cand1
->fn
;
3512 /* Skip builtin candidates and conversion functions. */
3515 cand2
= &cand1
->next
;
3518 if (DECL_P ((*cand2
)->fn
)
3519 && equal_functions (fn
, (*cand2
)->fn
))
3520 *cand2
= (*cand2
)->next
;
3522 cand2
= &(*cand2
)->next
;
3526 for (; candidates
; candidates
= candidates
->next
)
3527 print_z_candidate (loc
, "candidate:", candidates
);
3530 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3531 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3532 the result of the conversion function to convert it to the final
3533 desired type. Merge the two sequences into a single sequence,
3534 and return the merged sequence. */
3537 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3540 bool bad
= user_seq
->bad_p
;
3542 gcc_assert (user_seq
->kind
== ck_user
);
3544 /* Find the end of the second conversion sequence. */
3545 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3547 /* The entire sequence is a user-conversion sequence. */
3548 (*t
)->user_conv_p
= true;
3553 /* Replace the identity conversion with the user conversion
3560 /* Handle overload resolution for initializing an object of class type from
3561 an initializer list. First we look for a suitable constructor that
3562 takes a std::initializer_list; if we don't find one, we then look for a
3563 non-list constructor.
3565 Parameters are as for add_candidates, except that the arguments are in
3566 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3567 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3570 add_list_candidates (tree fns
, tree first_arg
,
3571 tree init_list
, tree totype
,
3572 tree explicit_targs
, bool template_only
,
3573 tree conversion_path
, tree access_path
,
3575 struct z_candidate
**candidates
,
3576 tsubst_flags_t complain
)
3578 vec
<tree
, va_gc
> *args
;
3580 gcc_assert (*candidates
== NULL
);
3582 /* We're looking for a ctor for list-initialization. */
3583 flags
|= LOOKUP_LIST_INIT_CTOR
;
3584 /* And we don't allow narrowing conversions. We also use this flag to
3585 avoid the copy constructor call for copy-list-initialization. */
3586 flags
|= LOOKUP_NO_NARROWING
;
3588 /* Always use the default constructor if the list is empty (DR 990). */
3589 if (CONSTRUCTOR_NELTS (init_list
) == 0
3590 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3592 /* If the class has a list ctor, try passing the list as a single
3593 argument first, but only consider list ctors. */
3594 else if (TYPE_HAS_LIST_CTOR (totype
))
3596 flags
|= LOOKUP_LIST_ONLY
;
3597 args
= make_tree_vector_single (init_list
);
3598 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3599 explicit_targs
, template_only
, conversion_path
,
3600 access_path
, flags
, candidates
, complain
);
3601 if (any_strictly_viable (*candidates
))
3605 args
= ctor_to_vec (init_list
);
3607 /* We aren't looking for list-ctors anymore. */
3608 flags
&= ~LOOKUP_LIST_ONLY
;
3609 /* We allow more user-defined conversions within an init-list. */
3610 flags
&= ~LOOKUP_NO_CONVERSION
;
3612 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3613 explicit_targs
, template_only
, conversion_path
,
3614 access_path
, flags
, candidates
, complain
);
3617 /* Returns the best overload candidate to perform the requested
3618 conversion. This function is used for three the overloading situations
3619 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3620 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3621 per [dcl.init.ref], so we ignore temporary bindings. */
3623 static struct z_candidate
*
3624 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3625 tsubst_flags_t complain
)
3627 struct z_candidate
*candidates
, *cand
;
3629 tree ctors
= NULL_TREE
;
3630 tree conv_fns
= NULL_TREE
;
3631 conversion
*conv
= NULL
;
3632 tree first_arg
= NULL_TREE
;
3633 vec
<tree
, va_gc
> *args
= NULL
;
3640 fromtype
= TREE_TYPE (expr
);
3642 /* We represent conversion within a hierarchy using RVALUE_CONV and
3643 BASE_CONV, as specified by [over.best.ics]; these become plain
3644 constructor calls, as specified in [dcl.init]. */
3645 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3646 || !DERIVED_FROM_P (totype
, fromtype
));
3648 if (MAYBE_CLASS_TYPE_P (totype
))
3649 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3650 creating a garbage BASELINK; constructors can't be inherited. */
3651 ctors
= lookup_fnfields_slot (totype
, complete_ctor_identifier
);
3653 if (MAYBE_CLASS_TYPE_P (fromtype
))
3655 tree to_nonref
= non_reference (totype
);
3656 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3657 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3658 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3660 /* [class.conv.fct] A conversion function is never used to
3661 convert a (possibly cv-qualified) object to the (possibly
3662 cv-qualified) same object type (or a reference to it), to a
3663 (possibly cv-qualified) base class of that type (or a
3664 reference to it)... */
3667 conv_fns
= lookup_conversions (fromtype
);
3671 flags
|= LOOKUP_NO_CONVERSION
;
3672 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3673 flags
|= LOOKUP_NO_NARROWING
;
3675 /* It's OK to bind a temporary for converting constructor arguments, but
3676 not in converting the return value of a conversion operator. */
3677 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
3678 | (flags
& LOOKUP_NO_NARROWING
));
3679 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3683 int ctorflags
= flags
;
3685 first_arg
= build_dummy_object (totype
);
3687 /* We should never try to call the abstract or base constructor
3689 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors
))
3690 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors
)));
3692 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3694 /* List-initialization. */
3695 add_list_candidates (ctors
, first_arg
, expr
, totype
, NULL_TREE
,
3696 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3697 ctorflags
, &candidates
, complain
);
3701 args
= make_tree_vector_single (expr
);
3702 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3703 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3704 ctorflags
, &candidates
, complain
);
3707 for (cand
= candidates
; cand
; cand
= cand
->next
)
3709 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3711 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3712 set, then this is copy-initialization. In that case, "The
3713 result of the call is then used to direct-initialize the
3714 object that is the destination of the copy-initialization."
3717 We represent this in the conversion sequence with an
3718 rvalue conversion, which means a constructor call. */
3719 if (TREE_CODE (totype
) != REFERENCE_TYPE
3720 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3722 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3729 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3731 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3732 struct z_candidate
*old_candidates
;
3734 /* If we are called to convert to a reference type, we are trying to
3735 find a direct binding, so don't even consider temporaries. If
3736 we don't find a direct binding, the caller will try again to
3737 look for a temporary binding. */
3738 if (TREE_CODE (totype
) == REFERENCE_TYPE
)
3739 convflags
|= LOOKUP_NO_TEMP_BIND
;
3741 old_candidates
= candidates
;
3742 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
3744 conversion_path
, TYPE_BINFO (fromtype
),
3745 flags
, &candidates
, complain
);
3747 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
3749 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
3751 = implicit_conversion (totype
,
3754 /*c_cast_p=*/false, convflags
,
3757 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3758 copy-initialization. In that case, "The result of the
3759 call is then used to direct-initialize the object that is
3760 the destination of the copy-initialization." [dcl.init]
3762 We represent this in the conversion sequence with an
3763 rvalue conversion, which means a constructor call. But
3764 don't add a second rvalue conversion if there's already
3765 one there. Which there really shouldn't be, but it's
3766 harmless since we'd add it here anyway. */
3767 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
3768 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3769 ics
= build_conv (ck_rvalue
, totype
, ics
);
3771 cand
->second_conv
= ics
;
3776 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -2,
3779 else if (DECL_NONCONVERTING_P (cand
->fn
)
3780 && ics
->rank
> cr_exact
)
3782 /* 13.3.1.5: For direct-initialization, those explicit
3783 conversion functions that are not hidden within S and
3784 yield type T or a type that can be converted to type T
3785 with a qualification conversion (4.4) are also candidate
3787 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3788 I've raised this issue with the committee. --jason 9/2011 */
3790 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
3792 else if (cand
->viable
== 1 && ics
->bad_p
)
3796 = bad_arg_conversion_rejection (NULL_TREE
, -2,
3799 else if (primary_template_instantiation_p (cand
->fn
)
3800 && ics
->rank
> cr_exact
)
3802 /* 13.3.3.1.2: If the user-defined conversion is specified by
3803 a specialization of a conversion function template, the
3804 second standard conversion sequence shall have exact match
3807 cand
->reason
= template_conversion_rejection (rettype
, totype
);
3812 candidates
= splice_viable (candidates
, false, &any_viable_p
);
3816 release_tree_vector (args
);
3820 cand
= tourney (candidates
, complain
);
3823 if (complain
& tf_error
)
3825 error ("conversion from %qT to %qT is ambiguous",
3827 print_z_candidates (location_of (expr
), candidates
);
3830 cand
= candidates
; /* any one will do */
3831 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
3832 cand
->second_conv
->user_conv_p
= true;
3833 if (!any_strictly_viable (candidates
))
3834 cand
->second_conv
->bad_p
= true;
3835 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3836 ambiguous conversion is no worse than another user-defined
3843 if (!DECL_CONSTRUCTOR_P (cand
->fn
))
3844 convtype
= non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)));
3845 else if (cand
->second_conv
->kind
== ck_rvalue
)
3846 /* DR 5: [in the first step of copy-initialization]...if the function
3847 is a constructor, the call initializes a temporary of the
3848 cv-unqualified version of the destination type. */
3849 convtype
= cv_unqualified (totype
);
3852 /* Build the user conversion sequence. */
3856 build_identity_conv (TREE_TYPE (expr
), expr
));
3858 if (cand
->viable
== -1)
3861 /* Remember that this was a list-initialization. */
3862 if (flags
& LOOKUP_NO_NARROWING
)
3863 conv
->check_narrowing
= true;
3865 /* Combine it with the second conversion sequence. */
3866 cand
->second_conv
= merge_conversion_sequences (conv
,
3872 /* Wrapper for above. */
3875 build_user_type_conversion (tree totype
, tree expr
, int flags
,
3876 tsubst_flags_t complain
)
3878 struct z_candidate
*cand
;
3881 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
3882 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
3886 if (cand
->second_conv
->kind
== ck_ambig
)
3887 ret
= error_mark_node
;
3890 expr
= convert_like (cand
->second_conv
, expr
, complain
);
3891 ret
= convert_from_reference (expr
);
3897 timevar_cond_stop (TV_OVERLOAD
, subtime
);
3901 /* Subroutine of convert_nontype_argument.
3903 EXPR is an argument for a template non-type parameter of integral or
3904 enumeration type. Do any necessary conversions (that are permitted for
3905 non-type arguments) to convert it to the parameter type.
3907 If conversion is successful, returns the converted expression;
3908 otherwise, returns error_mark_node. */
3911 build_integral_nontype_arg_conv (tree type
, tree expr
, tsubst_flags_t complain
)
3916 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
3918 if (error_operand_p (expr
))
3919 return error_mark_node
;
3921 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
3923 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3924 p
= conversion_obstack_alloc (0);
3926 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
3928 LOOKUP_IMPLICIT
, complain
);
3930 /* for a non-type template-parameter of integral or
3931 enumeration type, integral promotions (4.5) and integral
3932 conversions (4.7) are applied. */
3933 /* It should be sufficient to check the outermost conversion step, since
3934 there are no qualification conversions to integer type. */
3938 /* A conversion function is OK. If it isn't constexpr, we'll
3939 complain later that the argument isn't constant. */
3941 /* The lvalue-to-rvalue conversion is OK. */
3947 t
= next_conversion (conv
)->type
;
3948 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
))
3951 if (complain
& tf_error
)
3952 error_at (loc
, "conversion from %qT to %qT not considered for "
3953 "non-type template argument", t
, type
);
3954 /* and fall through. */
3962 expr
= convert_like (conv
, expr
, complain
);
3964 expr
= error_mark_node
;
3966 /* Free all the conversions we allocated. */
3967 obstack_free (&conversion_obstack
, p
);
3972 /* Do any initial processing on the arguments to a function call. */
3974 static vec
<tree
, va_gc
> *
3975 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
3980 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
3982 if (error_operand_p (arg
))
3984 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
3986 if (complain
& tf_error
)
3987 error ("invalid use of void expression");
3990 else if (invalid_nonstatic_memfn_p (input_location
, arg
, complain
))
3996 /* Perform overload resolution on FN, which is called with the ARGS.
3998 Return the candidate function selected by overload resolution, or
3999 NULL if the event that overload resolution failed. In the case
4000 that overload resolution fails, *CANDIDATES will be the set of
4001 candidates considered, and ANY_VIABLE_P will be set to true or
4002 false to indicate whether or not any of the candidates were
4005 The ARGS should already have gone through RESOLVE_ARGS before this
4006 function is called. */
4008 static struct z_candidate
*
4009 perform_overload_resolution (tree fn
,
4010 const vec
<tree
, va_gc
> *args
,
4011 struct z_candidate
**candidates
,
4012 bool *any_viable_p
, tsubst_flags_t complain
)
4014 struct z_candidate
*cand
;
4015 tree explicit_targs
;
4018 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4020 explicit_targs
= NULL_TREE
;
4024 *any_viable_p
= true;
4027 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4028 || TREE_CODE (fn
) == TEMPLATE_DECL
4029 || TREE_CODE (fn
) == OVERLOAD
4030 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
4032 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4034 explicit_targs
= TREE_OPERAND (fn
, 1);
4035 fn
= TREE_OPERAND (fn
, 0);
4039 /* Add the various candidate functions. */
4040 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
4041 explicit_targs
, template_only
,
4042 /*conversion_path=*/NULL_TREE
,
4043 /*access_path=*/NULL_TREE
,
4045 candidates
, complain
);
4047 *candidates
= splice_viable (*candidates
, false, any_viable_p
);
4049 cand
= tourney (*candidates
, complain
);
4053 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4057 /* Print an error message about being unable to build a call to FN with
4058 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4059 be located; CANDIDATES is a possibly empty list of such
4063 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
,
4064 struct z_candidate
*candidates
)
4066 tree name
= DECL_NAME (OVL_CURRENT (fn
));
4067 location_t loc
= location_of (name
);
4069 if (!any_strictly_viable (candidates
))
4070 error_at (loc
, "no matching function for call to %<%D(%A)%>",
4071 name
, build_tree_list_vec (args
));
4073 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
4074 name
, build_tree_list_vec (args
));
4076 print_z_candidates (loc
, candidates
);
4079 /* Return an expression for a call to FN (a namespace-scope function,
4080 or a static member function) with the ARGS. This may change
4084 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
, bool koenig_p
,
4085 tsubst_flags_t complain
)
4087 struct z_candidate
*candidates
, *cand
;
4092 if (args
!= NULL
&& *args
!= NULL
)
4094 *args
= resolve_args (*args
, complain
);
4096 return error_mark_node
;
4100 tm_malloc_replacement (fn
);
4102 /* If this function was found without using argument dependent
4103 lookup, then we want to ignore any undeclared friend
4109 fn
= remove_hidden_names (fn
);
4112 if (complain
& tf_error
)
4113 print_error_for_call_failure (orig_fn
, *args
, NULL
);
4114 return error_mark_node
;
4118 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4119 p
= conversion_obstack_alloc (0);
4121 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
4126 if (complain
& tf_error
)
4128 // If there is a single (non-viable) function candidate,
4129 // let the error be diagnosed by cp_build_function_call_vec.
4130 if (!any_viable_p
&& candidates
&& ! candidates
->next
4131 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
4132 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
4134 // Otherwise, emit notes for non-viable candidates.
4135 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4136 fn
= TREE_OPERAND (fn
, 0);
4137 print_error_for_call_failure (fn
, *args
, candidates
);
4139 result
= error_mark_node
;
4143 int flags
= LOOKUP_NORMAL
;
4144 /* If fn is template_id_expr, the call has explicit template arguments
4145 (e.g. func<int>(5)), communicate this info to build_over_call
4146 through flags so that later we can use it to decide whether to warn
4147 about peculiar null pointer conversion. */
4148 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4150 /* If overload resolution selects a specialization of a
4151 function concept for non-dependent template arguments,
4152 the expression is true if the constraints are satisfied
4153 and false otherwise.
4155 NOTE: This is an extension of Concepts Lite TS that
4156 allows constraints to be used in expressions. */
4157 if (flag_concepts
&& !processing_template_decl
)
4159 tree tmpl
= DECL_TI_TEMPLATE (cand
->fn
);
4160 tree targs
= DECL_TI_ARGS (cand
->fn
);
4161 tree decl
= DECL_TEMPLATE_RESULT (tmpl
);
4162 if (DECL_DECLARED_CONCEPT_P (decl
))
4163 return evaluate_function_concept (decl
, targs
);
4166 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4169 result
= build_over_call (cand
, flags
, complain
);
4172 /* Free all the conversions we allocated. */
4173 obstack_free (&conversion_obstack
, p
);
4178 /* Build a call to a global operator new. FNNAME is the name of the
4179 operator (either "operator new" or "operator new[]") and ARGS are
4180 the arguments provided. This may change ARGS. *SIZE points to the
4181 total number of bytes required by the allocation, and is updated if
4182 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4183 be used. If this function determines that no cookie should be
4184 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4185 is not NULL_TREE, it is evaluated before calculating the final
4186 array size, and if it fails, the array size is replaced with
4187 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4188 is non-NULL, it will be set, upon return, to the allocation
4192 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4193 tree
*size
, tree
*cookie_size
, tree size_check
,
4194 tree
*fn
, tsubst_flags_t complain
)
4196 tree original_size
= *size
;
4198 struct z_candidate
*candidates
;
4199 struct z_candidate
*cand
;
4204 /* Set to (size_t)-1 if the size check fails. */
4205 if (size_check
!= NULL_TREE
)
4207 tree errval
= TYPE_MAX_VALUE (sizetype
);
4208 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4209 errval
= throw_bad_array_new_length ();
4210 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4211 original_size
, errval
);
4213 vec_safe_insert (*args
, 0, *size
);
4214 *args
= resolve_args (*args
, complain
);
4216 return error_mark_node
;
4222 If this lookup fails to find the name, or if the allocated type
4223 is not a class type, the allocation function's name is looked
4224 up in the global scope.
4226 we disregard block-scope declarations of "operator new". */
4227 fns
= lookup_function_nonclass (fnname
, *args
, /*block_p=*/false);
4229 /* Figure out what function is being called. */
4230 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
4233 /* If no suitable function could be found, issue an error message
4237 if (complain
& tf_error
)
4238 print_error_for_call_failure (fns
, *args
, candidates
);
4239 return error_mark_node
;
4242 /* If a cookie is required, add some extra space. Whether
4243 or not a cookie is required cannot be determined until
4244 after we know which function was called. */
4247 bool use_cookie
= true;
4250 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4251 /* Skip the size_t parameter. */
4252 arg_types
= TREE_CHAIN (arg_types
);
4253 /* Check the remaining parameters (if any). */
4255 && TREE_CHAIN (arg_types
) == void_list_node
4256 && same_type_p (TREE_VALUE (arg_types
),
4259 /* If we need a cookie, adjust the number of bytes allocated. */
4262 /* Update the total size. */
4263 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4266 /* Set to (size_t)-1 if the size check fails. */
4267 gcc_assert (size_check
!= NULL_TREE
);
4268 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4269 *size
, TYPE_MAX_VALUE (sizetype
));
4271 /* Update the argument list to reflect the adjusted size. */
4272 (**args
)[0] = *size
;
4275 *cookie_size
= NULL_TREE
;
4278 /* Tell our caller which function we decided to call. */
4282 /* Build the CALL_EXPR. */
4283 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4286 /* Build a new call to operator(). This may change ARGS. */
4289 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4291 struct z_candidate
*candidates
= 0, *cand
;
4292 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4293 tree type
= TREE_TYPE (obj
);
4295 tree result
= NULL_TREE
;
4298 if (error_operand_p (obj
))
4299 return error_mark_node
;
4301 obj
= prep_operand (obj
);
4303 if (TYPE_PTRMEMFUNC_P (type
))
4305 if (complain
& tf_error
)
4306 /* It's no good looking for an overloaded operator() on a
4307 pointer-to-member-function. */
4308 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj
);
4309 return error_mark_node
;
4312 if (TYPE_BINFO (type
))
4314 fns
= lookup_fnfields (TYPE_BINFO (type
), ansi_opname (CALL_EXPR
), 1);
4315 if (fns
== error_mark_node
)
4316 return error_mark_node
;
4321 if (args
!= NULL
&& *args
!= NULL
)
4323 *args
= resolve_args (*args
, complain
);
4325 return error_mark_node
;
4328 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4329 p
= conversion_obstack_alloc (0);
4333 first_mem_arg
= obj
;
4335 add_candidates (BASELINK_FUNCTIONS (fns
),
4336 first_mem_arg
, *args
, NULL_TREE
,
4338 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4339 LOOKUP_NORMAL
, &candidates
, complain
);
4342 convs
= lookup_conversions (type
);
4344 for (; convs
; convs
= TREE_CHAIN (convs
))
4346 tree fns
= TREE_VALUE (convs
);
4347 tree totype
= TREE_TYPE (convs
);
4349 if (TYPE_PTRFN_P (totype
)
4350 || TYPE_REFFN_P (totype
)
4351 || (TREE_CODE (totype
) == REFERENCE_TYPE
4352 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4353 for (; fns
; fns
= OVL_NEXT (fns
))
4355 tree fn
= OVL_CURRENT (fns
);
4357 if (DECL_NONCONVERTING_P (fn
))
4360 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4361 add_template_conv_candidate
4362 (&candidates
, fn
, obj
, *args
, totype
,
4363 /*access_path=*/NULL_TREE
,
4364 /*conversion_path=*/NULL_TREE
, complain
);
4366 add_conv_candidate (&candidates
, fn
, obj
,
4367 *args
, /*conversion_path=*/NULL_TREE
,
4368 /*access_path=*/NULL_TREE
, complain
);
4372 /* Be strict here because if we choose a bad conversion candidate, the
4373 errors we get won't mention the call context. */
4374 candidates
= splice_viable (candidates
, true, &any_viable_p
);
4377 if (complain
& tf_error
)
4379 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4380 build_tree_list_vec (*args
));
4381 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4383 result
= error_mark_node
;
4387 cand
= tourney (candidates
, complain
);
4390 if (complain
& tf_error
)
4392 error ("call of %<(%T) (%A)%> is ambiguous",
4393 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4394 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4396 result
= error_mark_node
;
4398 /* Since cand->fn will be a type, not a function, for a conversion
4399 function, we must be careful not to unconditionally look at
4401 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4402 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
) == CALL_EXPR
)
4403 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4406 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
, -1,
4408 obj
= convert_from_reference (obj
);
4409 result
= cp_build_function_call_vec (obj
, args
, complain
);
4413 /* Free all the conversions we allocated. */
4414 obstack_free (&conversion_obstack
, p
);
4419 /* Wrapper for above. */
4422 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4425 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4426 ret
= build_op_call_1 (obj
, args
, complain
);
4427 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4431 /* Called by op_error to prepare format strings suitable for the error
4432 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4433 and a suffix (controlled by NTYPES). */
4436 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4440 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4441 : G_("no match for "), errmsg
, NULL
);
4444 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4445 else if (ntypes
== 2)
4446 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4448 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4454 op_error (location_t loc
, enum tree_code code
, enum tree_code code2
,
4455 tree arg1
, tree arg2
, tree arg3
, bool match
)
4459 if (code
== MODIFY_EXPR
)
4460 opname
= assignment_operator_name_info
[code2
].name
;
4462 opname
= operator_name_info
[code
].name
;
4467 if (flag_diagnostics_show_caret
)
4468 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4470 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4472 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4473 "in %<%E ? %E : %E%>"), 3, match
),
4475 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4478 case POSTINCREMENT_EXPR
:
4479 case POSTDECREMENT_EXPR
:
4480 if (flag_diagnostics_show_caret
)
4481 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4482 opname
, TREE_TYPE (arg1
));
4484 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4486 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4490 if (flag_diagnostics_show_caret
)
4491 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4492 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4494 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4496 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4501 if (flag_diagnostics_show_caret
)
4502 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4503 opname
, TREE_TYPE (arg1
));
4505 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4506 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4511 if (flag_diagnostics_show_caret
)
4512 error_at (loc
, op_error_string (G_("%<operator%s%>"), 2, match
),
4513 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4515 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4517 opname
, arg1
, opname
, arg2
,
4518 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4520 if (flag_diagnostics_show_caret
)
4521 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4522 opname
, TREE_TYPE (arg1
));
4524 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4526 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4531 /* Return the implicit conversion sequence that could be used to
4532 convert E1 to E2 in [expr.cond]. */
4535 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4537 tree t1
= non_reference (TREE_TYPE (e1
));
4538 tree t2
= non_reference (TREE_TYPE (e2
));
4544 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4545 implicitly converted (clause _conv_) to the type "lvalue reference to
4546 T2", subject to the constraint that in the conversion the
4547 reference must bind directly (_dcl.init.ref_) to an lvalue.
4549 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4550 implicitly converted to the type "rvalue reference to T2", subject to
4551 the constraint that the reference must bind directly. */
4552 if (lvalue_or_rvalue_with_address_p (e2
))
4554 tree rtype
= cp_build_reference_type (t2
, !real_lvalue_p (e2
));
4555 conv
= implicit_conversion (rtype
,
4559 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4560 |LOOKUP_ONLYCONVERTING
,
4562 if (conv
&& !conv
->bad_p
)
4566 /* If E2 is a prvalue or if neither of the conversions above can be done
4567 and at least one of the operands has (possibly cv-qualified) class
4569 if (!CLASS_TYPE_P (t1
) && !CLASS_TYPE_P (t2
))
4574 If E1 and E2 have class type, and the underlying class types are
4575 the same or one is a base class of the other: E1 can be converted
4576 to match E2 if the class of T2 is the same type as, or a base
4577 class of, the class of T1, and the cv-qualification of T2 is the
4578 same cv-qualification as, or a greater cv-qualification than, the
4579 cv-qualification of T1. If the conversion is applied, E1 is
4580 changed to an rvalue of type T2 that still refers to the original
4581 source class object (or the appropriate subobject thereof). */
4582 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4583 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4585 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4587 conv
= build_identity_conv (t1
, e1
);
4588 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4589 TYPE_MAIN_VARIANT (t2
)))
4590 conv
= build_conv (ck_base
, t2
, conv
);
4592 conv
= build_conv (ck_rvalue
, t2
, conv
);
4601 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4602 converted to the type that expression E2 would have if E2 were
4603 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4604 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4605 LOOKUP_IMPLICIT
, complain
);
4608 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4609 arguments to the conditional expression. */
4612 build_conditional_expr_1 (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
4613 tsubst_flags_t complain
)
4617 tree result
= NULL_TREE
;
4618 tree result_type
= NULL_TREE
;
4619 bool lvalue_p
= true;
4620 struct z_candidate
*candidates
= 0;
4621 struct z_candidate
*cand
;
4623 tree orig_arg2
, orig_arg3
;
4625 /* As a G++ extension, the second argument to the conditional can be
4626 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4627 c'.) If the second operand is omitted, make sure it is
4628 calculated only once. */
4631 if (complain
& tf_error
)
4632 pedwarn (loc
, OPT_Wpedantic
,
4633 "ISO C++ forbids omitting the middle term of a ?: expression");
4635 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4636 if (real_lvalue_p (arg1
))
4637 arg2
= arg1
= cp_stabilize_reference (arg1
);
4639 arg2
= arg1
= save_expr (arg1
);
4642 /* If something has already gone wrong, just pass that fact up the
4644 if (error_operand_p (arg1
)
4645 || error_operand_p (arg2
)
4646 || error_operand_p (arg3
))
4647 return error_mark_node
;
4652 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
4654 tree arg1_type
= TREE_TYPE (arg1
);
4656 /* If arg1 is another cond_expr choosing between -1 and 0,
4657 then we can use its comparison. It may help to avoid
4658 additional comparison, produce more accurate diagnostics
4659 and enables folding. */
4660 if (TREE_CODE (arg1
) == VEC_COND_EXPR
4661 && integer_minus_onep (TREE_OPERAND (arg1
, 1))
4662 && integer_zerop (TREE_OPERAND (arg1
, 2)))
4663 arg1
= TREE_OPERAND (arg1
, 0);
4665 arg1
= force_rvalue (arg1
, complain
);
4666 arg2
= force_rvalue (arg2
, complain
);
4667 arg3
= force_rvalue (arg3
, complain
);
4669 /* force_rvalue can return error_mark on valid arguments. */
4670 if (error_operand_p (arg1
)
4671 || error_operand_p (arg2
)
4672 || error_operand_p (arg3
))
4673 return error_mark_node
;
4675 arg2_type
= TREE_TYPE (arg2
);
4676 arg3_type
= TREE_TYPE (arg3
);
4678 if (!VECTOR_TYPE_P (arg2_type
)
4679 && !VECTOR_TYPE_P (arg3_type
))
4681 /* Rely on the error messages of the scalar version. */
4682 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
4683 orig_arg2
, orig_arg3
, complain
);
4684 if (scal
== error_mark_node
)
4685 return error_mark_node
;
4686 tree stype
= TREE_TYPE (scal
);
4687 tree ctype
= TREE_TYPE (arg1_type
);
4688 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
4689 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
4691 if (complain
& tf_error
)
4692 error_at (loc
, "inferred scalar type %qT is not an integer or "
4693 "floating point type of the same size as %qT", stype
,
4694 COMPARISON_CLASS_P (arg1
)
4695 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
4697 return error_mark_node
;
4700 tree vtype
= build_opaque_vector_type (stype
,
4701 TYPE_VECTOR_SUBPARTS (arg1_type
));
4702 /* We could pass complain & tf_warning to unsafe_conversion_p,
4703 but the warnings (like Wsign-conversion) have already been
4704 given by the scalar build_conditional_expr_1. We still check
4705 unsafe_conversion_p to forbid truncating long long -> float. */
4706 if (unsafe_conversion_p (loc
, stype
, arg2
, false))
4708 if (complain
& tf_error
)
4709 error_at (loc
, "conversion of scalar %qT to vector %qT "
4710 "involves truncation", arg2_type
, vtype
);
4711 return error_mark_node
;
4713 if (unsafe_conversion_p (loc
, stype
, arg3
, false))
4715 if (complain
& tf_error
)
4716 error_at (loc
, "conversion of scalar %qT to vector %qT "
4717 "involves truncation", arg3_type
, vtype
);
4718 return error_mark_node
;
4721 arg2
= cp_convert (stype
, arg2
, complain
);
4722 arg2
= save_expr (arg2
);
4723 arg2
= build_vector_from_val (vtype
, arg2
);
4725 arg3
= cp_convert (stype
, arg3
, complain
);
4726 arg3
= save_expr (arg3
);
4727 arg3
= build_vector_from_val (vtype
, arg3
);
4731 if (VECTOR_TYPE_P (arg2_type
) != VECTOR_TYPE_P (arg3_type
))
4733 enum stv_conv convert_flag
=
4734 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
4735 complain
& tf_error
);
4737 switch (convert_flag
)
4740 return error_mark_node
;
4743 arg2
= save_expr (arg2
);
4744 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
4745 arg2
= build_vector_from_val (arg3_type
, arg2
);
4746 arg2_type
= TREE_TYPE (arg2
);
4751 arg3
= save_expr (arg3
);
4752 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
4753 arg3
= build_vector_from_val (arg2_type
, arg3
);
4754 arg3_type
= TREE_TYPE (arg3
);
4762 if (!same_type_p (arg2_type
, arg3_type
)
4763 || TYPE_VECTOR_SUBPARTS (arg1_type
)
4764 != TYPE_VECTOR_SUBPARTS (arg2_type
)
4765 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
4767 if (complain
& tf_error
)
4769 "incompatible vector types in conditional expression: "
4770 "%qT, %qT and %qT", TREE_TYPE (arg1
),
4771 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
4772 return error_mark_node
;
4775 if (!COMPARISON_CLASS_P (arg1
))
4777 tree cmp_type
= build_same_sized_truth_vector_type (arg1_type
);
4778 arg1
= build2 (NE_EXPR
, cmp_type
, arg1
, build_zero_cst (arg1_type
));
4780 return build3_loc (loc
, VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
4785 The first expression is implicitly converted to bool (clause
4787 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
4789 if (error_operand_p (arg1
))
4790 return error_mark_node
;
4794 If either the second or the third operand has type (possibly
4795 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4796 array-to-pointer (_conv.array_), and function-to-pointer
4797 (_conv.func_) standard conversions are performed on the second
4798 and third operands. */
4799 arg2_type
= unlowered_expr_type (arg2
);
4800 arg3_type
= unlowered_expr_type (arg3
);
4801 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
4803 /* Do the conversions. We don't these for `void' type arguments
4804 since it can't have any effect and since decay_conversion
4805 does not handle that case gracefully. */
4806 if (!VOID_TYPE_P (arg2_type
))
4807 arg2
= decay_conversion (arg2
, complain
);
4808 if (!VOID_TYPE_P (arg3_type
))
4809 arg3
= decay_conversion (arg3
, complain
);
4810 arg2_type
= TREE_TYPE (arg2
);
4811 arg3_type
= TREE_TYPE (arg3
);
4815 One of the following shall hold:
4817 --The second or the third operand (but not both) is a
4818 throw-expression (_except.throw_); the result is of the
4819 type of the other and is an rvalue.
4821 --Both the second and the third operands have type void; the
4822 result is of type void and is an rvalue.
4824 We must avoid calling force_rvalue for expressions of type
4825 "void" because it will complain that their value is being
4827 if (TREE_CODE (arg2
) == THROW_EXPR
4828 && TREE_CODE (arg3
) != THROW_EXPR
)
4830 if (!VOID_TYPE_P (arg3_type
))
4832 arg3
= force_rvalue (arg3
, complain
);
4833 if (arg3
== error_mark_node
)
4834 return error_mark_node
;
4836 arg3_type
= TREE_TYPE (arg3
);
4837 result_type
= arg3_type
;
4839 else if (TREE_CODE (arg2
) != THROW_EXPR
4840 && TREE_CODE (arg3
) == THROW_EXPR
)
4842 if (!VOID_TYPE_P (arg2_type
))
4844 arg2
= force_rvalue (arg2
, complain
);
4845 if (arg2
== error_mark_node
)
4846 return error_mark_node
;
4848 arg2_type
= TREE_TYPE (arg2
);
4849 result_type
= arg2_type
;
4851 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
4852 result_type
= void_type_node
;
4855 if (complain
& tf_error
)
4857 if (VOID_TYPE_P (arg2_type
))
4858 error_at (EXPR_LOC_OR_LOC (arg3
, loc
),
4859 "second operand to the conditional operator "
4860 "is of type %<void%>, but the third operand is "
4861 "neither a throw-expression nor of type %<void%>");
4863 error_at (EXPR_LOC_OR_LOC (arg2
, loc
),
4864 "third operand to the conditional operator "
4865 "is of type %<void%>, but the second operand is "
4866 "neither a throw-expression nor of type %<void%>");
4868 return error_mark_node
;
4872 goto valid_operands
;
4876 Otherwise, if the second and third operand have different types,
4877 and either has (possibly cv-qualified) class type, or if both are
4878 glvalues of the same value category and the same type except for
4879 cv-qualification, an attempt is made to convert each of those operands
4880 to the type of the other. */
4881 else if (!same_type_p (arg2_type
, arg3_type
)
4882 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)
4883 || (same_type_ignoring_top_level_qualifiers_p (arg2_type
,
4885 && lvalue_or_rvalue_with_address_p (arg2
)
4886 && lvalue_or_rvalue_with_address_p (arg3
)
4887 && real_lvalue_p (arg2
) == real_lvalue_p (arg3
))))
4891 bool converted
= false;
4893 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4894 p
= conversion_obstack_alloc (0);
4896 conv2
= conditional_conversion (arg2
, arg3
, complain
);
4897 conv3
= conditional_conversion (arg3
, arg2
, complain
);
4901 If both can be converted, or one can be converted but the
4902 conversion is ambiguous, the program is ill-formed. If
4903 neither can be converted, the operands are left unchanged and
4904 further checking is performed as described below. If exactly
4905 one conversion is possible, that conversion is applied to the
4906 chosen operand and the converted operand is used in place of
4907 the original operand for the remainder of this section. */
4908 if ((conv2
&& !conv2
->bad_p
4909 && conv3
&& !conv3
->bad_p
)
4910 || (conv2
&& conv2
->kind
== ck_ambig
)
4911 || (conv3
&& conv3
->kind
== ck_ambig
))
4913 if (complain
& tf_error
)
4915 error_at (loc
, "operands to ?: have different types %qT and %qT",
4916 arg2_type
, arg3_type
);
4917 if (conv2
&& !conv2
->bad_p
&& conv3
&& !conv3
->bad_p
)
4918 inform (loc
, " and each type can be converted to the other");
4919 else if (conv2
&& conv2
->kind
== ck_ambig
)
4920 convert_like (conv2
, arg2
, complain
);
4922 convert_like (conv3
, arg3
, complain
);
4924 result
= error_mark_node
;
4926 else if (conv2
&& !conv2
->bad_p
)
4928 arg2
= convert_like (conv2
, arg2
, complain
);
4929 arg2
= convert_from_reference (arg2
);
4930 arg2_type
= TREE_TYPE (arg2
);
4931 /* Even if CONV2 is a valid conversion, the result of the
4932 conversion may be invalid. For example, if ARG3 has type
4933 "volatile X", and X does not have a copy constructor
4934 accepting a "volatile X&", then even if ARG2 can be
4935 converted to X, the conversion will fail. */
4936 if (error_operand_p (arg2
))
4937 result
= error_mark_node
;
4940 else if (conv3
&& !conv3
->bad_p
)
4942 arg3
= convert_like (conv3
, arg3
, complain
);
4943 arg3
= convert_from_reference (arg3
);
4944 arg3_type
= TREE_TYPE (arg3
);
4945 if (error_operand_p (arg3
))
4946 result
= error_mark_node
;
4950 /* Free all the conversions we allocated. */
4951 obstack_free (&conversion_obstack
, p
);
4956 /* If, after the conversion, both operands have class type,
4957 treat the cv-qualification of both operands as if it were the
4958 union of the cv-qualification of the operands.
4960 The standard is not clear about what to do in this
4961 circumstance. For example, if the first operand has type
4962 "const X" and the second operand has a user-defined
4963 conversion to "volatile X", what is the type of the second
4964 operand after this step? Making it be "const X" (matching
4965 the first operand) seems wrong, as that discards the
4966 qualification without actually performing a copy. Leaving it
4967 as "volatile X" seems wrong as that will result in the
4968 conditional expression failing altogether, even though,
4969 according to this step, the one operand could be converted to
4970 the type of the other. */
4972 && CLASS_TYPE_P (arg2_type
)
4973 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
4974 arg2_type
= arg3_type
=
4975 cp_build_qualified_type (arg2_type
,
4976 cp_type_quals (arg2_type
)
4977 | cp_type_quals (arg3_type
));
4982 If the second and third operands are glvalues of the same value
4983 category and have the same type, the result is of that type and
4985 if (((real_lvalue_p (arg2
) && real_lvalue_p (arg3
))
4986 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
4987 && same_type_p (arg2_type
, arg3_type
))
4989 result_type
= arg2_type
;
4990 arg2
= mark_lvalue_use (arg2
);
4991 arg3
= mark_lvalue_use (arg3
);
4992 goto valid_operands
;
4997 Otherwise, the result is an rvalue. If the second and third
4998 operand do not have the same type, and either has (possibly
4999 cv-qualified) class type, overload resolution is used to
5000 determine the conversions (if any) to be applied to the operands
5001 (_over.match.oper_, _over.built_). */
5003 if (!same_type_p (arg2_type
, arg3_type
)
5004 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
5010 /* Rearrange the arguments so that add_builtin_candidate only has
5011 to know about two args. In build_builtin_candidate, the
5012 arguments are unscrambled. */
5016 add_builtin_candidates (&candidates
,
5019 ansi_opname (COND_EXPR
),
5021 LOOKUP_NORMAL
, complain
);
5025 If the overload resolution fails, the program is
5027 candidates
= splice_viable (candidates
, false, &any_viable_p
);
5030 if (complain
& tf_error
)
5031 error_at (loc
, "operands to ?: have different types %qT and %qT",
5032 arg2_type
, arg3_type
);
5033 return error_mark_node
;
5035 cand
= tourney (candidates
, complain
);
5038 if (complain
& tf_error
)
5040 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
5041 print_z_candidates (loc
, candidates
);
5043 return error_mark_node
;
5048 Otherwise, the conversions thus determined are applied, and
5049 the converted operands are used in place of the original
5050 operands for the remainder of this section. */
5051 conv
= cand
->convs
[0];
5052 arg1
= convert_like (conv
, arg1
, complain
);
5053 conv
= cand
->convs
[1];
5054 arg2
= convert_like (conv
, arg2
, complain
);
5055 arg2_type
= TREE_TYPE (arg2
);
5056 conv
= cand
->convs
[2];
5057 arg3
= convert_like (conv
, arg3
, complain
);
5058 arg3_type
= TREE_TYPE (arg3
);
5063 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5064 and function-to-pointer (_conv.func_) standard conversions are
5065 performed on the second and third operands.
5067 We need to force the lvalue-to-rvalue conversion here for class types,
5068 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5069 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5072 arg2
= force_rvalue (arg2
, complain
);
5073 if (!CLASS_TYPE_P (arg2_type
))
5074 arg2_type
= TREE_TYPE (arg2
);
5076 arg3
= force_rvalue (arg3
, complain
);
5077 if (!CLASS_TYPE_P (arg3_type
))
5078 arg3_type
= TREE_TYPE (arg3
);
5080 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5081 return error_mark_node
;
5085 After those conversions, one of the following shall hold:
5087 --The second and third operands have the same type; the result is of
5089 if (same_type_p (arg2_type
, arg3_type
))
5090 result_type
= arg2_type
;
5093 --The second and third operands have arithmetic or enumeration
5094 type; the usual arithmetic conversions are performed to bring
5095 them to a common type, and the result is of that type. */
5096 else if ((ARITHMETIC_TYPE_P (arg2_type
)
5097 || UNSCOPED_ENUM_P (arg2_type
))
5098 && (ARITHMETIC_TYPE_P (arg3_type
)
5099 || UNSCOPED_ENUM_P (arg3_type
)))
5101 /* In this case, there is always a common type. */
5102 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
5104 if (complain
& tf_warning
)
5105 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
5106 "implicit conversion from %qT to %qT to "
5107 "match other result of conditional",
5110 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5111 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
5113 if (TREE_CODE (orig_arg2
) == CONST_DECL
5114 && TREE_CODE (orig_arg3
) == CONST_DECL
5115 && DECL_CONTEXT (orig_arg2
) == DECL_CONTEXT (orig_arg3
))
5116 /* Two enumerators from the same enumeration can have different
5117 types when the enumeration is still being defined. */;
5118 else if (complain
& tf_warning
)
5119 warning_at (loc
, OPT_Wenum_compare
, "enumeral mismatch in "
5120 "conditional expression: %qT vs %qT",
5121 arg2_type
, arg3_type
);
5123 else if (extra_warnings
5124 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5125 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
5126 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
5127 && !same_type_p (arg2_type
,
5128 type_promotes_to (arg3_type
)))))
5130 if (complain
& tf_warning
)
5131 warning_at (loc
, OPT_Wextra
, "enumeral and non-enumeral type in "
5132 "conditional expression");
5135 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5136 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5140 --The second and third operands have pointer type, or one has
5141 pointer type and the other is a null pointer constant; pointer
5142 conversions (_conv.ptr_) and qualification conversions
5143 (_conv.qual_) are performed to bring them to their composite
5144 pointer type (_expr.rel_). The result is of the composite
5147 --The second and third operands have pointer to member type, or
5148 one has pointer to member type and the other is a null pointer
5149 constant; pointer to member conversions (_conv.mem_) and
5150 qualification conversions (_conv.qual_) are performed to bring
5151 them to a common type, whose cv-qualification shall match the
5152 cv-qualification of either the second or the third operand.
5153 The result is of the common type. */
5154 else if ((null_ptr_cst_p (arg2
)
5155 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
5156 || (null_ptr_cst_p (arg3
)
5157 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
5158 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
5159 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
5160 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
5162 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
5163 arg3
, CPO_CONDITIONAL_EXPR
,
5165 if (result_type
== error_mark_node
)
5166 return error_mark_node
;
5167 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5168 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5173 if (complain
& tf_error
)
5174 error_at (loc
, "operands to ?: have different types %qT and %qT",
5175 arg2_type
, arg3_type
);
5176 return error_mark_node
;
5179 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5180 return error_mark_node
;
5183 result
= build3_loc (loc
, COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
5185 /* We can't use result_type below, as fold might have returned a
5190 /* Expand both sides into the same slot, hopefully the target of
5191 the ?: expression. We used to check for TARGET_EXPRs here,
5192 but now we sometimes wrap them in NOP_EXPRs so the test would
5194 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5195 result
= get_target_expr_sfinae (result
, complain
);
5196 /* If this expression is an rvalue, but might be mistaken for an
5197 lvalue, we must add a NON_LVALUE_EXPR. */
5198 result
= rvalue (result
);
5201 result
= force_paren_expr (result
);
5206 /* Wrapper for above. */
5209 build_conditional_expr (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
5210 tsubst_flags_t complain
)
5213 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5214 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5215 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5219 /* OPERAND is an operand to an expression. Perform necessary steps
5220 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5224 prep_operand (tree operand
)
5228 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5229 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5230 /* Make sure the template type is instantiated now. */
5231 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5237 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5238 OVERLOAD) to the CANDIDATES, returning an updated list of
5239 CANDIDATES. The ARGS are the arguments provided to the call;
5240 if FIRST_ARG is non-null it is the implicit object argument,
5241 otherwise the first element of ARGS is used if needed. The
5242 EXPLICIT_TARGS are explicit template arguments provided.
5243 TEMPLATE_ONLY is true if only template functions should be
5244 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5245 add_function_candidate. */
5248 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5250 tree explicit_targs
, bool template_only
,
5251 tree conversion_path
, tree access_path
,
5253 struct z_candidate
**candidates
,
5254 tsubst_flags_t complain
)
5257 const vec
<tree
, va_gc
> *non_static_args
;
5258 bool check_list_ctor
;
5259 bool check_converting
;
5260 unification_kind_t strict
;
5266 /* Precalculate special handling of constructors and conversion ops. */
5267 fn
= OVL_CURRENT (fns
);
5268 if (DECL_CONV_FN_P (fn
))
5270 check_list_ctor
= false;
5271 check_converting
= !!(flags
& LOOKUP_ONLYCONVERTING
);
5272 if (flags
& LOOKUP_NO_CONVERSION
)
5273 /* We're doing return_type(x). */
5274 strict
= DEDUCE_CONV
;
5276 /* We're doing x.operator return_type(). */
5277 strict
= DEDUCE_EXACT
;
5278 /* [over.match.funcs] For conversion functions, the function
5279 is considered to be a member of the class of the implicit
5280 object argument for the purpose of defining the type of
5281 the implicit object parameter. */
5282 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5286 if (DECL_CONSTRUCTOR_P (fn
))
5288 check_list_ctor
= !!(flags
& LOOKUP_LIST_ONLY
);
5289 /* For list-initialization we consider explicit constructors
5290 and complain if one is chosen. */
5292 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5293 == LOOKUP_ONLYCONVERTING
);
5297 check_list_ctor
= false;
5298 check_converting
= false;
5300 strict
= DEDUCE_CALL
;
5301 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5305 non_static_args
= args
;
5307 /* Delay creating the implicit this parameter until it is needed. */
5308 non_static_args
= NULL
;
5310 for (; fns
; fns
= OVL_NEXT (fns
))
5313 const vec
<tree
, va_gc
> *fn_args
;
5315 fn
= OVL_CURRENT (fns
);
5317 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5319 if (check_list_ctor
&& !is_list_ctor (fn
))
5322 /* Figure out which set of arguments to use. */
5323 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5325 /* If this function is a non-static member and we didn't get an
5326 implicit object argument, move it out of args. */
5327 if (first_arg
== NULL_TREE
)
5331 vec
<tree
, va_gc
> *tempvec
;
5332 vec_alloc (tempvec
, args
->length () - 1);
5333 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5334 tempvec
->quick_push (arg
);
5335 non_static_args
= tempvec
;
5336 first_arg
= (*args
)[0];
5339 fn_first_arg
= first_arg
;
5340 fn_args
= non_static_args
;
5344 /* Otherwise, just use the list of arguments provided. */
5345 fn_first_arg
= NULL_TREE
;
5349 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5350 add_template_candidate (candidates
,
5362 else if (!template_only
)
5363 add_function_candidate (candidates
,
5376 build_new_op_1 (location_t loc
, enum tree_code code
, int flags
, tree arg1
,
5377 tree arg2
, tree arg3
, tree
*overload
, tsubst_flags_t complain
)
5379 struct z_candidate
*candidates
= 0, *cand
;
5380 vec
<tree
, va_gc
> *arglist
;
5383 tree result
= NULL_TREE
;
5384 bool result_valid_p
= false;
5385 enum tree_code code2
= NOP_EXPR
;
5386 enum tree_code code_orig_arg1
= ERROR_MARK
;
5387 enum tree_code code_orig_arg2
= ERROR_MARK
;
5393 if (error_operand_p (arg1
)
5394 || error_operand_p (arg2
)
5395 || error_operand_p (arg3
))
5396 return error_mark_node
;
5398 if (code
== MODIFY_EXPR
)
5400 code2
= TREE_CODE (arg3
);
5402 fnname
= ansi_assopname (code2
);
5405 fnname
= ansi_opname (code
);
5407 arg1
= prep_operand (arg1
);
5409 bool memonly
= false;
5414 case VEC_DELETE_EXPR
:
5416 /* Use build_op_new_call and build_op_delete_call instead. */
5420 /* Use build_op_call instead. */
5423 case TRUTH_ORIF_EXPR
:
5424 case TRUTH_ANDIF_EXPR
:
5425 case TRUTH_AND_EXPR
:
5427 /* These are saved for the sake of warn_logical_operator. */
5428 code_orig_arg1
= TREE_CODE (arg1
);
5429 code_orig_arg2
= TREE_CODE (arg2
);
5437 /* These are saved for the sake of maybe_warn_bool_compare. */
5438 code_orig_arg1
= TREE_CODE (TREE_TYPE (arg1
));
5439 code_orig_arg2
= TREE_CODE (TREE_TYPE (arg2
));
5442 /* =, ->, [], () must be non-static member functions. */
5444 if (code2
!= NOP_EXPR
)
5455 arg2
= prep_operand (arg2
);
5456 arg3
= prep_operand (arg3
);
5458 if (code
== COND_EXPR
)
5459 /* Use build_conditional_expr instead. */
5461 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5462 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5465 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5466 arg2
= integer_zero_node
;
5468 vec_alloc (arglist
, 3);
5469 arglist
->quick_push (arg1
);
5470 if (arg2
!= NULL_TREE
)
5471 arglist
->quick_push (arg2
);
5472 if (arg3
!= NULL_TREE
)
5473 arglist
->quick_push (arg3
);
5475 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5476 p
= conversion_obstack_alloc (0);
5478 /* Add namespace-scope operators to the list of functions to
5481 add_candidates (lookup_function_nonclass (fnname
, arglist
,
5483 NULL_TREE
, arglist
, NULL_TREE
,
5484 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5485 flags
, &candidates
, complain
);
5489 args
[2] = NULL_TREE
;
5491 /* Add class-member operators to the candidate set. */
5492 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5496 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5497 if (fns
== error_mark_node
)
5499 result
= error_mark_node
;
5500 goto user_defined_result_ready
;
5503 add_candidates (BASELINK_FUNCTIONS (fns
),
5504 NULL_TREE
, arglist
, NULL_TREE
,
5506 BASELINK_BINFO (fns
),
5507 BASELINK_ACCESS_BINFO (fns
),
5508 flags
, &candidates
, complain
);
5510 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5511 only non-member functions that have type T1 or reference to
5512 cv-qualified-opt T1 for the first argument, if the first argument
5513 has an enumeration type, or T2 or reference to cv-qualified-opt
5514 T2 for the second argument, if the second argument has an
5515 enumeration type. Filter out those that don't match. */
5516 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5518 struct z_candidate
**candp
, **next
;
5520 for (candp
= &candidates
; *candp
; candp
= next
)
5522 tree parmlist
, parmtype
;
5523 int i
, nargs
= (arg2
? 2 : 1);
5528 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5530 for (i
= 0; i
< nargs
; ++i
)
5532 parmtype
= TREE_VALUE (parmlist
);
5534 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
5535 parmtype
= TREE_TYPE (parmtype
);
5536 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5537 && (same_type_ignoring_top_level_qualifiers_p
5538 (TREE_TYPE (args
[i
]), parmtype
)))
5541 parmlist
= TREE_CHAIN (parmlist
);
5544 /* No argument has an appropriate type, so remove this
5545 candidate function from the list. */
5548 *candp
= cand
->next
;
5554 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5561 /* For these, the built-in candidates set is empty
5562 [over.match.oper]/3. We don't want non-strict matches
5563 because exact matches are always possible with built-in
5564 operators. The built-in candidate set for COMPONENT_REF
5565 would be empty too, but since there are no such built-in
5566 operators, we accept non-strict matches for them. */
5575 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5580 case POSTINCREMENT_EXPR
:
5581 case POSTDECREMENT_EXPR
:
5582 /* Don't try anything fancy if we're not allowed to produce
5584 if (!(complain
& tf_error
))
5585 return error_mark_node
;
5587 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5588 distinguish between prefix and postfix ++ and
5589 operator++() was used for both, so we allow this with
5593 const char *msg
= (flag_permissive
)
5594 ? G_("no %<%D(int)%> declared for postfix %qs,"
5595 " trying prefix operator instead")
5596 : G_("no %<%D(int)%> declared for postfix %qs");
5597 permerror (loc
, msg
, fnname
, operator_name_info
[code
].name
);
5600 if (!flag_permissive
)
5601 return error_mark_node
;
5603 if (code
== POSTINCREMENT_EXPR
)
5604 code
= PREINCREMENT_EXPR
;
5606 code
= PREDECREMENT_EXPR
;
5607 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5608 NULL_TREE
, overload
, complain
);
5611 /* The caller will deal with these. */
5616 result_valid_p
= true;
5620 if (complain
& tf_error
)
5622 /* If one of the arguments of the operator represents
5623 an invalid use of member function pointer, try to report
5624 a meaningful error ... */
5625 if (invalid_nonstatic_memfn_p (loc
, arg1
, tf_error
)
5626 || invalid_nonstatic_memfn_p (loc
, arg2
, tf_error
)
5627 || invalid_nonstatic_memfn_p (loc
, arg3
, tf_error
))
5628 /* We displayed the error message. */;
5631 /* ... Otherwise, report the more generic
5632 "no matching operator found" error */
5633 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
5634 print_z_candidates (loc
, candidates
);
5637 result
= error_mark_node
;
5643 cand
= tourney (candidates
, complain
);
5646 if (complain
& tf_error
)
5648 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
5649 print_z_candidates (loc
, candidates
);
5651 result
= error_mark_node
;
5653 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
5656 *overload
= cand
->fn
;
5658 if (resolve_args (arglist
, complain
) == NULL
)
5659 result
= error_mark_node
;
5661 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5663 if (processing_template_decl
5664 && result
!= NULL_TREE
5665 && result
!= error_mark_node
5666 && DECL_HIDDEN_FRIEND_P (cand
->fn
))
5669 if (REFERENCE_REF_P (call
))
5670 call
= TREE_OPERAND (call
, 0);
5671 /* This prevents build_new_function_call from discarding this
5672 function during instantiation of the enclosing template. */
5673 KOENIG_LOOKUP_P (call
) = 1;
5678 /* Give any warnings we noticed during overload resolution. */
5679 if (cand
->warnings
&& (complain
& tf_warning
))
5681 struct candidate_warning
*w
;
5682 for (w
= cand
->warnings
; w
; w
= w
->next
)
5683 joust (cand
, w
->loser
, 1, complain
);
5686 /* Check for comparison of different enum types. */
5695 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
5696 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
5697 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
5698 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
5699 && (complain
& tf_warning
))
5701 warning (OPT_Wenum_compare
,
5702 "comparison between %q#T and %q#T",
5703 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
5710 /* We need to strip any leading REF_BIND so that bitfields
5711 don't cause errors. This should not remove any important
5712 conversions, because builtins don't apply to class
5713 objects directly. */
5714 conv
= cand
->convs
[0];
5715 if (conv
->kind
== ck_ref_bind
)
5716 conv
= next_conversion (conv
);
5717 arg1
= convert_like (conv
, arg1
, complain
);
5721 conv
= cand
->convs
[1];
5722 if (conv
->kind
== ck_ref_bind
)
5723 conv
= next_conversion (conv
);
5725 arg2
= decay_conversion (arg2
, complain
);
5727 /* We need to call warn_logical_operator before
5728 converting arg2 to a boolean_type, but after
5729 decaying an enumerator to its value. */
5730 if (complain
& tf_warning
)
5731 warn_logical_operator (loc
, code
, boolean_type_node
,
5732 code_orig_arg1
, arg1
,
5733 code_orig_arg2
, arg2
);
5735 arg2
= convert_like (conv
, arg2
, complain
);
5739 conv
= cand
->convs
[2];
5740 if (conv
->kind
== ck_ref_bind
)
5741 conv
= next_conversion (conv
);
5742 arg3
= convert_like (conv
, arg3
, complain
);
5748 user_defined_result_ready
:
5750 /* Free all the conversions we allocated. */
5751 obstack_free (&conversion_obstack
, p
);
5753 if (result
|| result_valid_p
)
5760 return cp_build_modify_expr (loc
, arg1
, code2
, arg2
, complain
);
5763 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
5765 case TRUTH_ANDIF_EXPR
:
5766 case TRUTH_ORIF_EXPR
:
5767 case TRUTH_AND_EXPR
:
5769 if (complain
& tf_warning
)
5770 warn_logical_operator (loc
, code
, boolean_type_node
,
5771 code_orig_arg1
, arg1
,
5772 code_orig_arg2
, arg2
);
5780 if ((complain
& tf_warning
)
5781 && ((code_orig_arg1
== BOOLEAN_TYPE
)
5782 ^ (code_orig_arg2
== BOOLEAN_TYPE
)))
5783 maybe_warn_bool_compare (loc
, code
, arg1
, arg2
);
5784 if (complain
& tf_warning
&& warn_tautological_compare
)
5785 warn_tautological_cmp (loc
, code
, arg1
, arg2
);
5790 case TRUNC_DIV_EXPR
:
5795 case TRUNC_MOD_EXPR
:
5799 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
5801 case UNARY_PLUS_EXPR
:
5804 case TRUTH_NOT_EXPR
:
5805 case PREINCREMENT_EXPR
:
5806 case POSTINCREMENT_EXPR
:
5807 case PREDECREMENT_EXPR
:
5808 case POSTDECREMENT_EXPR
:
5812 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
5815 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
5818 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
5822 /* The caller will deal with these. */
5834 /* Wrapper for above. */
5837 build_new_op (location_t loc
, enum tree_code code
, int flags
,
5838 tree arg1
, tree arg2
, tree arg3
,
5839 tree
*overload
, tsubst_flags_t complain
)
5842 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5843 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
5844 overload
, complain
);
5845 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5849 /* Returns true if FN has two parameters, of which the second has type
5853 second_parm_is_size_t (tree fn
)
5855 tree t
= FUNCTION_ARG_CHAIN (fn
);
5857 && same_type_p (TREE_VALUE (t
), size_type_node
)
5858 && TREE_CHAIN (t
) == void_list_node
);
5861 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
5862 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
5865 non_placement_deallocation_fn_p (tree t
)
5867 /* A template instance is never a usual deallocation function,
5868 regardless of its signature. */
5869 if (TREE_CODE (t
) == TEMPLATE_DECL
5870 || primary_template_instantiation_p (t
))
5873 /* If a class T has a member deallocation function named operator delete
5874 with exactly one parameter, then that function is a usual
5875 (non-placement) deallocation function. If class T does not declare
5876 such an operator delete but does declare a member deallocation
5877 function named operator delete with exactly two parameters, the second
5878 of which has type std::size_t (18.2), then this function is a usual
5879 deallocation function. */
5880 bool global
= DECL_NAMESPACE_SCOPE_P (t
);
5881 if (FUNCTION_ARG_CHAIN (t
) == void_list_node
5882 || ((!global
|| flag_sized_deallocation
)
5883 && second_parm_is_size_t (t
)))
5888 /* Build a call to operator delete. This has to be handled very specially,
5889 because the restrictions on what signatures match are different from all
5890 other call instances. For a normal delete, only a delete taking (void *)
5891 or (void *, size_t) is accepted. For a placement delete, only an exact
5892 match with the placement new is accepted.
5894 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
5895 ADDR is the pointer to be deleted.
5896 SIZE is the size of the memory block to be deleted.
5897 GLOBAL_P is true if the delete-expression should not consider
5898 class-specific delete operators.
5899 PLACEMENT is the corresponding placement new call, or NULL_TREE.
5901 If this call to "operator delete" is being generated as part to
5902 deallocate memory allocated via a new-expression (as per [expr.new]
5903 which requires that if the initialization throws an exception then
5904 we call a deallocation function), then ALLOC_FN is the allocation
5908 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
5909 bool global_p
, tree placement
,
5910 tree alloc_fn
, tsubst_flags_t complain
)
5912 tree fn
= NULL_TREE
;
5913 tree fns
, fnname
, type
, t
;
5915 if (addr
== error_mark_node
)
5916 return error_mark_node
;
5918 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
5920 fnname
= ansi_opname (code
);
5922 if (CLASS_TYPE_P (type
)
5923 && COMPLETE_TYPE_P (complete_type (type
))
5927 If the result of the lookup is ambiguous or inaccessible, or if
5928 the lookup selects a placement deallocation function, the
5929 program is ill-formed.
5931 Therefore, we ask lookup_fnfields to complain about ambiguity. */
5933 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
5934 if (fns
== error_mark_node
)
5935 return error_mark_node
;
5940 if (fns
== NULL_TREE
)
5941 fns
= lookup_name_nonclass (fnname
);
5943 /* Strip const and volatile from addr. */
5944 addr
= cp_convert (ptr_type_node
, addr
, complain
);
5948 /* "A declaration of a placement deallocation function matches the
5949 declaration of a placement allocation function if it has the same
5950 number of parameters and, after parameter transformations (8.3.5),
5951 all parameter types except the first are identical."
5953 So we build up the function type we want and ask instantiate_type
5954 to get it for us. */
5955 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
5956 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
5957 t
= build_function_type (void_type_node
, t
);
5959 fn
= instantiate_type (t
, fns
, tf_none
);
5960 if (fn
== error_mark_node
)
5963 if (BASELINK_P (fn
))
5964 fn
= BASELINK_FUNCTIONS (fn
);
5966 /* "If the lookup finds the two-parameter form of a usual deallocation
5967 function (3.7.4.2) and that function, considered as a placement
5968 deallocation function, would have been selected as a match for the
5969 allocation function, the program is ill-formed." */
5970 if (second_parm_is_size_t (fn
))
5973 = G_("exception cleanup for this placement new selects "
5974 "non-placement operator delete");
5976 = G_("%qD is a usual (non-placement) deallocation "
5977 "function in C++14 (or with -fsized-deallocation)");
5979 /* But if the class has an operator delete (void *), then that is
5980 the usual deallocation function, so we shouldn't complain
5981 about using the operator delete (void *, size_t). */
5982 if (DECL_CLASS_SCOPE_P (fn
))
5983 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
5984 t
; t
= OVL_NEXT (t
))
5986 tree elt
= OVL_CURRENT (t
);
5987 if (non_placement_deallocation_fn_p (elt
)
5988 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
5991 /* Before C++14 a two-parameter global deallocation function is
5992 always a placement deallocation function, but warn if
5994 else if (!flag_sized_deallocation
)
5996 if ((complain
& tf_warning
)
5997 && warning (OPT_Wc__14_compat
, msg1
))
5998 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6002 if (complain
& tf_warning_or_error
)
6004 if (permerror (input_location
, msg1
))
6006 /* Only mention C++14 for namespace-scope delete. */
6007 if (DECL_NAMESPACE_SCOPE_P (fn
))
6008 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6010 inform (DECL_SOURCE_LOCATION (fn
),
6011 "%qD is a usual (non-placement) deallocation "
6016 return error_mark_node
;
6021 /* "Any non-placement deallocation function matches a non-placement
6022 allocation function. If the lookup finds a single matching
6023 deallocation function, that function will be called; otherwise, no
6024 deallocation function will be called." */
6025 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
6026 t
; t
= OVL_NEXT (t
))
6028 tree elt
= OVL_CURRENT (t
);
6029 if (non_placement_deallocation_fn_p (elt
))
6032 /* "If a class T has a member deallocation function named
6033 operator delete with exactly one parameter, then that
6034 function is a usual (non-placement) deallocation
6035 function. If class T does not declare such an operator
6036 delete but does declare a member deallocation function named
6037 operator delete with exactly two parameters, the second of
6038 which has type std::size_t (18.2), then this function is a
6039 usual deallocation function."
6041 So in a class (void*) beats (void*, size_t). */
6042 if (DECL_CLASS_SCOPE_P (fn
))
6044 if (FUNCTION_ARG_CHAIN (fn
) == void_list_node
)
6047 /* At global scope (in C++14 and above) the rules are different:
6049 If deallocation function lookup finds both a usual
6050 deallocation function with only a pointer parameter and a
6051 usual deallocation function with both a pointer parameter
6052 and a size parameter, the function to be called is selected
6055 * If the type is complete and if, for the second alternative
6056 (delete array) only, the operand is a pointer to a class
6057 type with a non-trivial destructor or a (possibly
6058 multi-dimensional) array thereof, the function with two
6059 parameters is selected.
6061 * Otherwise, it is unspecified which of the two deallocation
6062 functions is selected. */
6065 bool want_size
= COMPLETE_TYPE_P (type
);
6066 if (code
== VEC_DELETE_EXPR
6067 && !TYPE_VEC_NEW_USES_COOKIE (type
))
6068 /* We need a cookie to determine the array size. */
6070 bool have_size
= (FUNCTION_ARG_CHAIN (fn
) != void_list_node
);
6071 if (want_size
== have_size
)
6077 /* If we have a matching function, call it. */
6080 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6082 /* If the FN is a member function, make sure that it is
6084 if (BASELINK_P (fns
))
6085 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
6088 /* Core issue 901: It's ok to new a type with deleted delete. */
6089 if (DECL_DELETED_FN (fn
) && alloc_fn
)
6094 /* The placement args might not be suitable for overload
6095 resolution at this point, so build the call directly. */
6096 int nargs
= call_expr_nargs (placement
);
6097 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
6100 for (i
= 1; i
< nargs
; i
++)
6101 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
6102 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
6103 return error_mark_node
;
6104 return build_cxx_call (fn
, nargs
, argarray
, complain
);
6109 vec
<tree
, va_gc
> *args
= make_tree_vector ();
6110 args
->quick_push (addr
);
6111 if (FUNCTION_ARG_CHAIN (fn
) != void_list_node
)
6112 args
->quick_push (size
);
6113 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
6114 release_tree_vector (args
);
6121 If no unambiguous matching deallocation function can be found,
6122 propagating the exception does not cause the object's memory to
6126 if ((complain
& tf_warning
)
6128 warning (0, "no corresponding deallocation function for %qD",
6133 if (complain
& tf_error
)
6134 error ("no suitable %<operator %s%> for %qT",
6135 operator_name_info
[(int)code
].name
, type
);
6136 return error_mark_node
;
6139 /* If the current scope isn't allowed to access DECL along
6140 BASETYPE_PATH, give an error. The most derived class in
6141 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6142 the declaration to use in the error diagnostic. */
6145 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
6146 tsubst_flags_t complain
)
6148 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
6150 if (!accessible_p (basetype_path
, decl
, true))
6152 if (complain
& tf_error
)
6154 if (TREE_PRIVATE (decl
))
6156 error ("%q#D is private within this context", diag_decl
);
6157 inform (DECL_SOURCE_LOCATION (diag_decl
),
6158 "declared private here");
6160 else if (TREE_PROTECTED (decl
))
6162 error ("%q#D is protected within this context", diag_decl
);
6163 inform (DECL_SOURCE_LOCATION (diag_decl
),
6164 "declared protected here");
6168 error ("%q#D is inaccessible within this context", diag_decl
);
6169 inform (DECL_SOURCE_LOCATION (diag_decl
), "declared here");
6178 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6179 bitwise or of LOOKUP_* values. If any errors are warnings are
6180 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6181 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6185 build_temp (tree expr
, tree type
, int flags
,
6186 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
6189 vec
<tree
, va_gc
> *args
;
6191 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
6192 args
= make_tree_vector_single (expr
);
6193 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6194 &args
, type
, flags
, complain
);
6195 release_tree_vector (args
);
6196 if (warningcount
+ werrorcount
> savew
)
6197 *diagnostic_kind
= DK_WARNING
;
6198 else if (errorcount
> savee
)
6199 *diagnostic_kind
= DK_ERROR
;
6201 *diagnostic_kind
= DK_UNSPECIFIED
;
6205 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6206 EXPR is implicitly converted to type TOTYPE.
6207 FN and ARGNUM are used for diagnostics. */
6210 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
6212 /* Issue warnings about peculiar, but valid, uses of NULL. */
6213 if (expr
== null_node
&& TREE_CODE (totype
) != BOOLEAN_TYPE
6214 && ARITHMETIC_TYPE_P (totype
))
6216 source_location loc
=
6217 expansion_point_location_if_in_system_header (input_location
);
6220 warning_at (loc
, OPT_Wconversion_null
,
6221 "passing NULL to non-pointer argument %P of %qD",
6224 warning_at (loc
, OPT_Wconversion_null
,
6225 "converting to non-pointer type %qT from NULL", totype
);
6228 /* Issue warnings if "false" is converted to a NULL pointer */
6229 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
6230 && TYPE_PTR_P (totype
))
6233 warning_at (input_location
, OPT_Wconversion_null
,
6234 "converting %<false%> to pointer type for argument %P "
6235 "of %qD", argnum
, fn
);
6237 warning_at (input_location
, OPT_Wconversion_null
,
6238 "converting %<false%> to pointer type %qT", totype
);
6242 /* We gave a diagnostic during a conversion. If this was in the second
6243 standard conversion sequence of a user-defined conversion sequence, say
6244 which user-defined conversion. */
6247 maybe_print_user_conv_context (conversion
*convs
)
6249 if (convs
->user_conv_p
)
6250 for (conversion
*t
= convs
; t
; t
= next_conversion (t
))
6251 if (t
->kind
== ck_user
)
6253 print_z_candidate (0, " after user-defined conversion:",
6259 /* Perform the conversions in CONVS on the expression EXPR. FN and
6260 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6261 indicates the `this' argument of a method. INNER is nonzero when
6262 being called to continue a conversion chain. It is negative when a
6263 reference binding will be applied, positive otherwise. If
6264 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6265 conversions will be emitted if appropriate. If C_CAST_P is true,
6266 this conversion is coming from a C-style cast; in that case,
6267 conversions to inaccessible bases are permitted. */
6270 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
6271 int inner
, bool issue_conversion_warnings
,
6272 bool c_cast_p
, tsubst_flags_t complain
)
6274 tree totype
= convs
->type
;
6275 diagnostic_t diag_kind
;
6277 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6279 if (convs
->bad_p
&& !(complain
& tf_error
))
6280 return error_mark_node
;
6283 && convs
->kind
!= ck_user
6284 && convs
->kind
!= ck_list
6285 && convs
->kind
!= ck_ambig
6286 && (convs
->kind
!= ck_ref_bind
6287 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
6288 && (convs
->kind
!= ck_rvalue
6289 || SCALAR_TYPE_P (totype
))
6290 && convs
->kind
!= ck_base
)
6292 bool complained
= false;
6293 conversion
*t
= convs
;
6295 /* Give a helpful error if this is bad because of excess braces. */
6296 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6297 && SCALAR_TYPE_P (totype
)
6298 && CONSTRUCTOR_NELTS (expr
) > 0
6299 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
6301 complained
= permerror (loc
, "too many braces around initializer "
6303 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6304 && CONSTRUCTOR_NELTS (expr
) == 1)
6305 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6308 /* Give a helpful error if this is bad because a conversion to bool
6309 from std::nullptr_t requires direct-initialization. */
6310 if (NULLPTR_TYPE_P (TREE_TYPE (expr
))
6311 && TREE_CODE (totype
) == BOOLEAN_TYPE
)
6312 complained
= permerror (loc
, "converting to %qT from %qT requires "
6313 "direct-initialization",
6314 totype
, TREE_TYPE (expr
));
6316 for (; t
; t
= next_conversion (t
))
6318 if (t
->kind
== ck_user
&& t
->cand
->reason
)
6320 complained
= permerror (loc
, "invalid user-defined conversion "
6321 "from %qT to %qT", TREE_TYPE (expr
),
6324 print_z_candidate (loc
, "candidate is:", t
->cand
);
6325 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
6326 /*issue_conversion_warnings=*/false,
6329 if (convs
->kind
== ck_ref_bind
)
6330 expr
= convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
6331 LOOKUP_NORMAL
, NULL_TREE
,
6334 expr
= cp_convert (totype
, expr
, complain
);
6335 if (complained
&& fn
)
6336 inform (DECL_SOURCE_LOCATION (fn
),
6337 " initializing argument %P of %qD", argnum
, fn
);
6340 else if (t
->kind
== ck_user
|| !t
->bad_p
)
6342 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
6343 /*issue_conversion_warnings=*/false,
6348 else if (t
->kind
== ck_ambig
)
6349 return convert_like_real (t
, expr
, fn
, argnum
, 1,
6350 /*issue_conversion_warnings=*/false,
6353 else if (t
->kind
== ck_identity
)
6357 complained
= permerror (loc
, "invalid conversion from %qT to %qT",
6358 TREE_TYPE (expr
), totype
);
6359 if (complained
&& fn
)
6360 inform (DECL_SOURCE_LOCATION (fn
),
6361 " initializing argument %P of %qD", argnum
, fn
);
6363 return cp_convert (totype
, expr
, complain
);
6366 if (issue_conversion_warnings
&& (complain
& tf_warning
))
6367 conversion_null_warnings (totype
, expr
, fn
, argnum
);
6369 switch (convs
->kind
)
6373 struct z_candidate
*cand
= convs
->cand
;
6374 tree convfn
= cand
->fn
;
6377 /* When converting from an init list we consider explicit
6378 constructors, but actually trying to call one is an error. */
6379 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
6380 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
6381 /* Unless this is for direct-list-initialization. */
6382 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
)
6383 /* And in C++98 a default constructor can't be explicit. */
6384 && cxx_dialect
>= cxx11
)
6386 if (!(complain
& tf_error
))
6387 return error_mark_node
;
6388 location_t loc
= location_of (expr
);
6389 if (CONSTRUCTOR_NELTS (expr
) == 0
6390 && FUNCTION_FIRST_USER_PARMTYPE (convfn
) != void_list_node
)
6392 if (pedwarn (loc
, 0, "converting to %qT from initializer list "
6393 "would use explicit constructor %qD",
6395 inform (loc
, "in C++11 and above a default constructor "
6399 error ("converting to %qT from initializer list would use "
6400 "explicit constructor %qD", totype
, convfn
);
6403 /* If we're initializing from {}, it's value-initialization. */
6404 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6405 && CONSTRUCTOR_NELTS (expr
) == 0
6406 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
6408 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
6409 expr
= build_value_init (totype
, complain
);
6410 expr
= get_target_expr_sfinae (expr
, complain
);
6411 if (expr
!= error_mark_node
)
6413 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6414 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
6419 expr
= mark_rvalue_use (expr
);
6421 /* Set user_conv_p on the argument conversions, so rvalue/base
6422 handling knows not to allow any more UDCs. */
6423 for (i
= 0; i
< cand
->num_convs
; ++i
)
6424 cand
->convs
[i
]->user_conv_p
= true;
6426 expr
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
6428 /* If this is a constructor or a function returning an aggr type,
6429 we need to build up a TARGET_EXPR. */
6430 if (DECL_CONSTRUCTOR_P (convfn
))
6432 expr
= build_cplus_new (totype
, expr
, complain
);
6434 /* Remember that this was list-initialization. */
6435 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
6436 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6442 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
6444 int nelts
= CONSTRUCTOR_NELTS (expr
);
6446 expr
= build_value_init (totype
, complain
);
6447 else if (nelts
== 1)
6448 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6452 expr
= mark_rvalue_use (expr
);
6454 if (type_unknown_p (expr
))
6455 expr
= instantiate_type (totype
, expr
, complain
);
6456 /* Convert a constant to its underlying value, unless we are
6457 about to bind it to a reference, in which case we need to
6458 leave it as an lvalue. */
6461 expr
= scalar_constant_value (expr
);
6462 if (expr
== null_node
&& INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
6463 /* If __null has been converted to an integer type, we do not
6464 want to warn about uses of EXPR as an integer, rather than
6466 expr
= build_int_cst (totype
, 0);
6470 /* We leave bad_p off ck_ambig because overload resolution considers
6471 it valid, it just fails when we try to perform it. So we need to
6472 check complain here, too. */
6473 if (complain
& tf_error
)
6475 /* Call build_user_type_conversion again for the error. */
6476 build_user_type_conversion (totype
, convs
->u
.expr
, LOOKUP_NORMAL
,
6479 inform (DECL_SOURCE_LOCATION (fn
),
6480 " initializing argument %P of %qD", argnum
, fn
);
6482 return error_mark_node
;
6486 /* Conversion to std::initializer_list<T>. */
6487 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
6488 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
6489 unsigned len
= CONSTRUCTOR_NELTS (expr
);
6490 tree array
, val
, field
;
6491 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
6494 /* Convert all the elements. */
6495 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
6497 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
6498 1, false, false, complain
);
6499 if (sub
== error_mark_node
)
6501 if (!BRACE_ENCLOSED_INITIALIZER_P (val
)
6502 && !check_narrowing (TREE_TYPE (sub
), val
, complain
))
6503 return error_mark_node
;
6504 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
6505 if (!TREE_CONSTANT (sub
))
6506 TREE_CONSTANT (new_ctor
) = false;
6508 /* Build up the array. */
6509 elttype
= cp_build_qualified_type
6510 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
6511 array
= build_array_of_n_type (elttype
, len
);
6512 array
= finish_compound_literal (array
, new_ctor
, complain
);
6513 /* Take the address explicitly rather than via decay_conversion
6514 to avoid the error about taking the address of a temporary. */
6515 array
= cp_build_addr_expr (array
, complain
);
6516 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
6517 if (array
== error_mark_node
)
6518 return error_mark_node
;
6520 /* Build up the initializer_list object. */
6521 totype
= complete_type (totype
);
6522 field
= next_initializable_field (TYPE_FIELDS (totype
));
6523 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
6524 field
= next_initializable_field (DECL_CHAIN (field
));
6525 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
6526 new_ctor
= build_constructor (totype
, vec
);
6527 return get_target_expr_sfinae (new_ctor
, complain
);
6531 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
6533 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6534 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
6535 real
= perform_implicit_conversion (TREE_TYPE (totype
),
6537 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
6539 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
6542 expr
= reshape_init (totype
, expr
, complain
);
6543 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
6545 if (expr
!= error_mark_node
)
6546 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6553 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
6554 convs
->kind
== ck_ref_bind
? -1 : 1,
6555 convs
->kind
== ck_ref_bind
? issue_conversion_warnings
: false,
6558 if (expr
== error_mark_node
)
6559 return error_mark_node
;
6561 switch (convs
->kind
)
6564 expr
= decay_conversion (expr
, complain
);
6565 if (expr
== error_mark_node
)
6569 maybe_print_user_conv_context (convs
);
6571 inform (DECL_SOURCE_LOCATION (fn
),
6572 " initializing argument %P of %qD", argnum
, fn
);
6574 return error_mark_node
;
6577 if (! MAYBE_CLASS_TYPE_P (totype
))
6579 /* Else fall through. */
6581 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
6583 /* We are going to bind a reference directly to a base-class
6584 subobject of EXPR. */
6585 /* Build an expression for `*((base*) &expr)'. */
6586 expr
= convert_to_base (expr
, totype
,
6587 !c_cast_p
, /*nonnull=*/true, complain
);
6591 /* Copy-initialization where the cv-unqualified version of the source
6592 type is the same class as, or a derived class of, the class of the
6593 destination [is treated as direct-initialization]. [dcl.init] */
6594 flags
= LOOKUP_NORMAL
;
6595 if (convs
->user_conv_p
)
6596 /* This conversion is being done in the context of a user-defined
6597 conversion (i.e. the second step of copy-initialization), so
6598 don't allow any more. */
6599 flags
|= LOOKUP_NO_CONVERSION
;
6601 flags
|= LOOKUP_ONLYCONVERTING
;
6602 if (convs
->rvaluedness_matches_p
)
6603 flags
|= LOOKUP_PREFER_RVALUE
;
6604 if (TREE_CODE (expr
) == TARGET_EXPR
6605 && TARGET_EXPR_LIST_INIT_P (expr
))
6606 /* Copy-list-initialization doesn't actually involve a copy. */
6608 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
6609 if (diag_kind
&& complain
)
6611 maybe_print_user_conv_context (convs
);
6613 inform (DECL_SOURCE_LOCATION (fn
),
6614 " initializing argument %P of %qD", argnum
, fn
);
6617 return build_cplus_new (totype
, expr
, complain
);
6621 tree ref_type
= totype
;
6623 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
6625 tree extype
= TREE_TYPE (expr
);
6626 if (TYPE_REF_IS_RVALUE (ref_type
)
6627 && real_lvalue_p (expr
))
6628 error_at (loc
, "cannot bind %qT lvalue to %qT",
6630 else if (!TYPE_REF_IS_RVALUE (ref_type
) && !real_lvalue_p (expr
)
6631 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
6632 error_at (loc
, "invalid initialization of non-const reference of "
6633 "type %qT from an rvalue of type %qT", totype
, extype
);
6634 else if (!reference_compatible_p (TREE_TYPE (totype
), extype
))
6635 error_at (loc
, "binding %qT to reference of type %qT "
6636 "discards qualifiers", extype
, totype
);
6639 maybe_print_user_conv_context (convs
);
6641 inform (DECL_SOURCE_LOCATION (fn
),
6642 " initializing argument %P of %qD", argnum
, fn
);
6643 return error_mark_node
;
6646 /* If necessary, create a temporary.
6648 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
6649 that need temporaries, even when their types are reference
6650 compatible with the type of reference being bound, so the
6651 upcoming call to cp_build_addr_expr doesn't fail. */
6652 if (convs
->need_temporary_p
6653 || TREE_CODE (expr
) == CONSTRUCTOR
6654 || TREE_CODE (expr
) == VA_ARG_EXPR
)
6656 /* Otherwise, a temporary of type "cv1 T1" is created and
6657 initialized from the initializer expression using the rules
6658 for a non-reference copy-initialization (8.5). */
6660 tree type
= TREE_TYPE (ref_type
);
6661 cp_lvalue_kind lvalue
= real_lvalue_p (expr
);
6663 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6664 (type
, next_conversion (convs
)->type
));
6665 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
6666 && !TYPE_REF_IS_RVALUE (ref_type
))
6668 /* If the reference is volatile or non-const, we
6669 cannot create a temporary. */
6670 if (lvalue
& clk_bitfield
)
6671 error_at (loc
, "cannot bind bitfield %qE to %qT",
6673 else if (lvalue
& clk_packed
)
6674 error_at (loc
, "cannot bind packed field %qE to %qT",
6677 error_at (loc
, "cannot bind rvalue %qE to %qT",
6679 return error_mark_node
;
6681 /* If the source is a packed field, and we must use a copy
6682 constructor, then building the target expr will require
6683 binding the field to the reference parameter to the
6684 copy constructor, and we'll end up with an infinite
6685 loop. If we can use a bitwise copy, then we'll be
6687 if ((lvalue
& clk_packed
)
6688 && CLASS_TYPE_P (type
)
6689 && type_has_nontrivial_copy_init (type
))
6691 error_at (loc
, "cannot bind packed field %qE to %qT",
6693 return error_mark_node
;
6695 if (lvalue
& clk_bitfield
)
6697 expr
= convert_bitfield_to_declared_type (expr
);
6698 expr
= fold_convert (type
, expr
);
6700 expr
= build_target_expr_with_type (expr
, type
, complain
);
6703 /* Take the address of the thing to which we will bind the
6705 expr
= cp_build_addr_expr (expr
, complain
);
6706 if (expr
== error_mark_node
)
6707 return error_mark_node
;
6709 /* Convert it to a pointer to the type referred to by the
6710 reference. This will adjust the pointer if a derived to
6711 base conversion is being performed. */
6712 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
6714 /* Convert the pointer to the desired reference type. */
6715 return build_nop (ref_type
, expr
);
6719 return decay_conversion (expr
, complain
);
6722 /* ??? Should the address of a transaction-safe pointer point to the TM
6723 clone, and this conversion look up the primary function? */
6724 return build_nop (totype
, expr
);
6727 /* Warn about deprecated conversion if appropriate. */
6728 string_conv_p (totype
, expr
, 1);
6733 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
6734 /*nonnull=*/false, complain
);
6735 return build_nop (totype
, expr
);
6738 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
6739 c_cast_p
, complain
);
6745 if (convs
->check_narrowing
6746 && !check_narrowing (totype
, expr
, complain
))
6747 return error_mark_node
;
6749 if (issue_conversion_warnings
)
6750 expr
= cp_convert_and_check (totype
, expr
, complain
);
6752 expr
= cp_convert (totype
, expr
, complain
);
6757 /* ARG is being passed to a varargs function. Perform any conversions
6758 required. Return the converted value. */
6761 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
6764 location_t loc
= EXPR_LOC_OR_LOC (arg
, input_location
);
6768 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6769 standard conversions are performed. */
6770 arg
= decay_conversion (arg
, complain
);
6771 arg_type
= TREE_TYPE (arg
);
6774 If the argument has integral or enumeration type that is subject
6775 to the integral promotions (_conv.prom_), or a floating point
6776 type that is subject to the floating point promotion
6777 (_conv.fpprom_), the value of the argument is converted to the
6778 promoted type before the call. */
6779 if (TREE_CODE (arg_type
) == REAL_TYPE
6780 && (TYPE_PRECISION (arg_type
)
6781 < TYPE_PRECISION (double_type_node
))
6782 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
6784 if ((complain
& tf_warning
)
6785 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
6786 warning_at (loc
, OPT_Wdouble_promotion
,
6787 "implicit conversion from %qT to %qT when passing "
6788 "argument to function",
6789 arg_type
, double_type_node
);
6790 arg
= convert_to_real_nofold (double_type_node
, arg
);
6792 else if (NULLPTR_TYPE_P (arg_type
))
6793 arg
= null_pointer_node
;
6794 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
6796 if (SCOPED_ENUM_P (arg_type
))
6798 tree prom
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
,
6800 prom
= cp_perform_integral_promotions (prom
, complain
);
6801 if (abi_version_crosses (6)
6802 && TYPE_MODE (TREE_TYPE (prom
)) != TYPE_MODE (arg_type
)
6803 && (complain
& tf_warning
))
6804 warning_at (loc
, OPT_Wabi
, "scoped enum %qT passed through ... as "
6805 "%qT before -fabi-version=6, %qT after", arg_type
,
6806 TREE_TYPE (prom
), ENUM_UNDERLYING_TYPE (arg_type
));
6807 if (!abi_version_at_least (6))
6811 arg
= cp_perform_integral_promotions (arg
, complain
);
6814 arg
= require_complete_type_sfinae (arg
, complain
);
6815 arg_type
= TREE_TYPE (arg
);
6817 if (arg
!= error_mark_node
6818 /* In a template (or ill-formed code), we can have an incomplete type
6819 even after require_complete_type_sfinae, in which case we don't know
6820 whether it has trivial copy or not. */
6821 && COMPLETE_TYPE_P (arg_type
))
6823 /* Build up a real lvalue-to-rvalue conversion in case the
6824 copy constructor is trivial but not callable. */
6825 if (!cp_unevaluated_operand
&& CLASS_TYPE_P (arg_type
))
6826 force_rvalue (arg
, complain
);
6828 /* [expr.call] 5.2.2/7:
6829 Passing a potentially-evaluated argument of class type (Clause 9)
6830 with a non-trivial copy constructor or a non-trivial destructor
6831 with no corresponding parameter is conditionally-supported, with
6832 implementation-defined semantics.
6834 We support it as pass-by-invisible-reference, just like a normal
6837 If the call appears in the context of a sizeof expression,
6838 it is not potentially-evaluated. */
6839 if (cp_unevaluated_operand
== 0
6840 && (type_has_nontrivial_copy_init (arg_type
)
6841 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
)))
6843 if (complain
& tf_warning
)
6844 warning (OPT_Wconditionally_supported
,
6845 "passing objects of non-trivially-copyable "
6846 "type %q#T through %<...%> is conditionally supported",
6848 return cp_build_addr_expr (arg
, complain
);
6855 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
6858 build_x_va_arg (source_location loc
, tree expr
, tree type
)
6860 if (processing_template_decl
)
6862 tree r
= build_min (VA_ARG_EXPR
, type
, expr
);
6863 SET_EXPR_LOCATION (r
, loc
);
6867 type
= complete_type_or_else (type
, NULL_TREE
);
6869 if (expr
== error_mark_node
|| !type
)
6870 return error_mark_node
;
6872 expr
= mark_lvalue_use (expr
);
6874 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6876 error ("cannot receive reference type %qT through %<...%>", type
);
6877 return error_mark_node
;
6880 if (type_has_nontrivial_copy_init (type
)
6881 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
6883 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
6884 it as pass by invisible reference. */
6885 warning_at (loc
, OPT_Wconditionally_supported
,
6886 "receiving objects of non-trivially-copyable type %q#T "
6887 "through %<...%> is conditionally-supported", type
);
6889 tree ref
= cp_build_reference_type (type
, false);
6890 expr
= build_va_arg (loc
, expr
, ref
);
6891 return convert_from_reference (expr
);
6894 return build_va_arg (loc
, expr
, type
);
6897 /* TYPE has been given to va_arg. Apply the default conversions which
6898 would have happened when passed via ellipsis. Return the promoted
6899 type, or the passed type if there is no change. */
6902 cxx_type_promotes_to (tree type
)
6906 /* Perform the array-to-pointer and function-to-pointer
6908 type
= type_decays_to (type
);
6910 promote
= type_promotes_to (type
);
6911 if (same_type_p (type
, promote
))
6917 /* ARG is a default argument expression being passed to a parameter of
6918 the indicated TYPE, which is a parameter to FN. PARMNUM is the
6919 zero-based argument number. Do any required conversions. Return
6920 the converted value. */
6922 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
6924 push_defarg_context (tree fn
)
6925 { vec_safe_push (default_arg_context
, fn
); }
6928 pop_defarg_context (void)
6929 { default_arg_context
->pop (); }
6932 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
6933 tsubst_flags_t complain
)
6938 /* See through clones. */
6939 fn
= DECL_ORIGIN (fn
);
6941 /* Detect recursion. */
6942 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
6945 if (complain
& tf_error
)
6946 error ("recursive evaluation of default argument for %q#D", fn
);
6947 return error_mark_node
;
6950 /* If the ARG is an unparsed default argument expression, the
6951 conversion cannot be performed. */
6952 if (TREE_CODE (arg
) == DEFAULT_ARG
)
6954 if (complain
& tf_error
)
6955 error ("call to %qD uses the default argument for parameter %P, which "
6956 "is not yet defined", fn
, parmnum
);
6957 return error_mark_node
;
6960 push_defarg_context (fn
);
6962 if (fn
&& DECL_TEMPLATE_INFO (fn
))
6963 arg
= tsubst_default_argument (fn
, type
, arg
, complain
);
6969 The names in the expression are bound, and the semantic
6970 constraints are checked, at the point where the default
6971 expressions appears.
6973 we must not perform access checks here. */
6974 push_deferring_access_checks (dk_no_check
);
6975 /* We must make a copy of ARG, in case subsequent processing
6976 alters any part of it. */
6977 arg
= break_out_target_exprs (arg
);
6978 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
6979 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
6981 arg
= convert_for_arg_passing (type
, arg
, complain
);
6982 pop_deferring_access_checks();
6984 pop_defarg_context ();
6989 /* Returns the type which will really be used for passing an argument of
6993 type_passed_as (tree type
)
6995 /* Pass classes with copy ctors by invisible reference. */
6996 if (TREE_ADDRESSABLE (type
))
6998 type
= build_reference_type (type
);
6999 /* There are no other pointers to this temporary. */
7000 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
7002 else if (targetm
.calls
.promote_prototypes (type
)
7003 && INTEGRAL_TYPE_P (type
)
7004 && COMPLETE_TYPE_P (type
)
7005 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7006 type
= integer_type_node
;
7011 /* Actually perform the appropriate conversion. */
7014 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
7018 /* If VAL is a bitfield, then -- since it has already been converted
7019 to TYPE -- it cannot have a precision greater than TYPE.
7021 If it has a smaller precision, we must widen it here. For
7022 example, passing "int f:3;" to a function expecting an "int" will
7023 not result in any conversion before this point.
7025 If the precision is the same we must not risk widening. For
7026 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7027 often have type "int", even though the C++ type for the field is
7028 "long long". If the value is being passed to a function
7029 expecting an "int", then no conversions will be required. But,
7030 if we call convert_bitfield_to_declared_type, the bitfield will
7031 be converted to "long long". */
7032 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
7034 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
7035 val
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
), val
);
7037 if (val
== error_mark_node
)
7039 /* Pass classes with copy ctors by invisible reference. */
7040 else if (TREE_ADDRESSABLE (type
))
7041 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
7042 else if (targetm
.calls
.promote_prototypes (type
)
7043 && INTEGRAL_TYPE_P (type
)
7044 && COMPLETE_TYPE_P (type
)
7045 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7046 val
= cp_perform_integral_promotions (val
, complain
);
7047 if ((complain
& tf_warning
)
7048 && warn_suggest_attribute_format
)
7050 tree rhstype
= TREE_TYPE (val
);
7051 const enum tree_code coder
= TREE_CODE (rhstype
);
7052 const enum tree_code codel
= TREE_CODE (type
);
7053 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7055 && check_missing_format_attribute (type
, rhstype
))
7056 warning (OPT_Wsuggest_attribute_format
,
7057 "argument of function call might be a candidate for a format attribute");
7062 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7063 which just decay_conversion or no conversions at all should be done.
7064 This is true for some builtins which don't act like normal functions.
7065 Return 2 if no conversions at all should be done, 1 if just
7066 decay_conversion. */
7069 magic_varargs_p (tree fn
)
7071 if (flag_cilkplus
&& is_cilkplus_reduce_builtin (fn
) != BUILT_IN_NONE
)
7074 if (DECL_BUILT_IN (fn
))
7075 switch (DECL_FUNCTION_CODE (fn
))
7077 case BUILT_IN_CLASSIFY_TYPE
:
7078 case BUILT_IN_CONSTANT_P
:
7079 case BUILT_IN_NEXT_ARG
:
7080 case BUILT_IN_VA_START
:
7084 return lookup_attribute ("type generic",
7085 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
7091 /* Returns the decl of the dispatcher function if FN is a function version. */
7094 get_function_version_dispatcher (tree fn
)
7096 tree dispatcher_decl
= NULL
;
7098 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7099 && DECL_FUNCTION_VERSIONED (fn
));
7101 gcc_assert (targetm
.get_function_versions_dispatcher
);
7102 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
7104 if (dispatcher_decl
== NULL
)
7106 error_at (input_location
, "use of multiversioned function "
7107 "without a default");
7111 retrofit_lang_decl (dispatcher_decl
);
7112 gcc_assert (dispatcher_decl
!= NULL
);
7113 return dispatcher_decl
;
7116 /* fn is a function version dispatcher that is marked used. Mark all the
7117 semantically identical function versions it will dispatch as used. */
7120 mark_versions_used (tree fn
)
7122 struct cgraph_node
*node
;
7123 struct cgraph_function_version_info
*node_v
;
7124 struct cgraph_function_version_info
*it_v
;
7126 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7128 node
= cgraph_node::get (fn
);
7132 gcc_assert (node
->dispatcher_function
);
7134 node_v
= node
->function_version ();
7138 /* All semantically identical versions are chained. Traverse and mark each
7139 one of them as used. */
7140 it_v
= node_v
->next
;
7141 while (it_v
!= NULL
)
7143 mark_used (it_v
->this_node
->decl
);
7148 /* Build a call to "the copy constructor" for the type of A, even if it
7149 wouldn't be selected by normal overload resolution. Used for
7153 call_copy_ctor (tree a
, tsubst_flags_t complain
)
7155 tree ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (a
));
7156 tree binfo
= TYPE_BINFO (ctype
);
7157 tree copy
= get_copy_ctor (ctype
, complain
);
7158 copy
= build_baselink (binfo
, binfo
, copy
, NULL_TREE
);
7159 tree ob
= build_dummy_object (ctype
);
7160 vec
<tree
, va_gc
>* args
= make_tree_vector_single (a
);
7161 tree r
= build_new_method_call (ob
, copy
, &args
, NULL_TREE
,
7162 LOOKUP_NORMAL
, NULL
, complain
);
7163 release_tree_vector (args
);
7167 /* Return true iff T refers to a base field. */
7170 is_base_field_ref (tree t
)
7173 if (TREE_CODE (t
) == ADDR_EXPR
)
7174 t
= TREE_OPERAND (t
, 0);
7175 if (TREE_CODE (t
) == COMPONENT_REF
)
7176 t
= TREE_OPERAND (t
, 1);
7177 if (TREE_CODE (t
) == FIELD_DECL
)
7178 return DECL_FIELD_IS_BASE (t
);
7182 /* We can't elide a copy from a function returning by value to a base
7183 subobject, as the callee might clobber tail padding. Return true iff this
7184 could be that case. */
7187 unsafe_copy_elision_p (tree target
, tree exp
)
7189 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
7190 if (type
== CLASSTYPE_AS_BASE (type
))
7192 if (!is_base_field_ref (target
)
7193 && resolves_to_fixed_type_p (target
, NULL
))
7195 tree init
= TARGET_EXPR_INITIAL (exp
);
7196 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7197 while (TREE_CODE (init
) == COMPOUND_EXPR
)
7198 init
= TREE_OPERAND (init
, 1);
7199 return (TREE_CODE (init
) == AGGR_INIT_EXPR
7200 && !AGGR_INIT_VIA_CTOR_P (init
));
7203 /* Subroutine of the various build_*_call functions. Overload resolution
7204 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7205 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7206 bitmask of various LOOKUP_* flags which apply to the call itself. */
7209 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
7212 const vec
<tree
, va_gc
> *args
= cand
->args
;
7213 tree first_arg
= cand
->first_arg
;
7214 conversion
**convs
= cand
->convs
;
7216 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
7221 unsigned int arg_index
= 0;
7225 bool already_used
= false;
7227 /* In a template, there is no need to perform all of the work that
7228 is normally done. We are only interested in the type of the call
7229 expression, i.e., the return type of the function. Any semantic
7230 errors will be deferred until the template is instantiated. */
7231 if (processing_template_decl
)
7235 const tree
*argarray
;
7238 return_type
= TREE_TYPE (TREE_TYPE (fn
));
7239 nargs
= vec_safe_length (args
);
7240 if (first_arg
== NULL_TREE
)
7241 argarray
= args
->address ();
7249 alcarray
= XALLOCAVEC (tree
, nargs
);
7250 alcarray
[0] = build_this (first_arg
);
7251 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
7252 alcarray
[ix
+ 1] = arg
;
7253 argarray
= alcarray
;
7256 addr
= build_addr_func (fn
, complain
);
7257 if (addr
== error_mark_node
)
7258 return error_mark_node
;
7259 expr
= build_call_array_loc (input_location
, return_type
,
7260 addr
, nargs
, argarray
);
7261 if (TREE_THIS_VOLATILE (fn
) && cfun
)
7262 current_function_returns_abnormally
= 1;
7263 return convert_from_reference (expr
);
7266 /* Give any warnings we noticed during overload resolution. */
7267 if (cand
->warnings
&& (complain
& tf_warning
))
7269 struct candidate_warning
*w
;
7270 for (w
= cand
->warnings
; w
; w
= w
->next
)
7271 joust (cand
, w
->loser
, 1, complain
);
7274 /* Make =delete work with SFINAE. */
7275 if (DECL_DELETED_FN (fn
) && !(complain
& tf_error
))
7276 return error_mark_node
;
7278 if (DECL_FUNCTION_MEMBER_P (fn
))
7281 /* If FN is a template function, two cases must be considered.
7286 template <class T> void f();
7288 template <class T> struct B {
7292 struct C : A, B<int> {
7294 using B<int>::g; // #2
7297 In case #1 where `A::f' is a member template, DECL_ACCESS is
7298 recorded in the primary template but not in its specialization.
7299 We check access of FN using its primary template.
7301 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7302 because it is a member of class template B, DECL_ACCESS is
7303 recorded in the specialization `B<int>::g'. We cannot use its
7304 primary template because `B<T>::g' and `B<int>::g' may have
7305 different access. */
7306 if (DECL_TEMPLATE_INFO (fn
)
7307 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
7308 access_fn
= DECL_TI_TEMPLATE (fn
);
7311 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
7313 return error_mark_node
;
7316 /* If we're checking for implicit delete, don't bother with argument
7318 if (flags
& LOOKUP_SPECULATIVE
)
7320 if (DECL_DELETED_FN (fn
))
7322 if (complain
& tf_error
)
7324 return error_mark_node
;
7326 if (cand
->viable
== 1)
7328 else if (!(complain
& tf_error
))
7329 /* Reject bad conversions now. */
7330 return error_mark_node
;
7331 /* else continue to get conversion error. */
7334 /* N3276 magic doesn't apply to nested calls. */
7335 int decltype_flag
= (complain
& tf_decltype
);
7336 complain
&= ~tf_decltype
;
7338 /* Find maximum size of vector to hold converted arguments. */
7339 parmlen
= list_length (parm
);
7340 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
7341 if (parmlen
> nargs
)
7343 argarray
= XALLOCAVEC (tree
, nargs
);
7345 /* The implicit parameters to a constructor are not considered by overload
7346 resolution, and must be of the proper type. */
7347 if (DECL_CONSTRUCTOR_P (fn
))
7350 if (first_arg
!= NULL_TREE
)
7352 object_arg
= first_arg
;
7353 first_arg
= NULL_TREE
;
7357 object_arg
= (*args
)[arg_index
];
7360 argarray
[j
++] = build_this (object_arg
);
7361 parm
= TREE_CHAIN (parm
);
7362 /* We should never try to call the abstract constructor. */
7363 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
7365 if (DECL_HAS_VTT_PARM_P (fn
))
7367 argarray
[j
++] = (*args
)[arg_index
];
7369 parm
= TREE_CHAIN (parm
);
7372 /* Bypass access control for 'this' parameter. */
7373 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7375 tree parmtype
= TREE_VALUE (parm
);
7376 tree arg
= build_this (first_arg
!= NULL_TREE
7378 : (*args
)[arg_index
]);
7379 tree argtype
= TREE_TYPE (arg
);
7383 if (convs
[i
]->bad_p
)
7385 if (complain
& tf_error
)
7387 if (permerror (input_location
, "passing %qT as %<this%> "
7388 "argument discards qualifiers",
7389 TREE_TYPE (argtype
)))
7390 inform (DECL_SOURCE_LOCATION (fn
), " in call to %qD", fn
);
7393 return error_mark_node
;
7396 /* See if the function member or the whole class type is declared
7397 final and the call can be devirtualized. */
7398 if (DECL_FINAL_P (fn
)
7399 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
7400 flags
|= LOOKUP_NONVIRTUAL
;
7402 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
7403 X is called for an object that is not of type X, or of a type
7404 derived from X, the behavior is undefined.
7406 So we can assume that anything passed as 'this' is non-null, and
7407 optimize accordingly. */
7408 gcc_assert (TYPE_PTR_P (parmtype
));
7409 /* Convert to the base in which the function was declared. */
7410 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
7411 converted_arg
= build_base_path (PLUS_EXPR
,
7413 cand
->conversion_path
,
7415 /* Check that the base class is accessible. */
7416 if (!accessible_base_p (TREE_TYPE (argtype
),
7417 BINFO_TYPE (cand
->conversion_path
), true))
7419 if (complain
& tf_error
)
7420 error ("%qT is not an accessible base of %qT",
7421 BINFO_TYPE (cand
->conversion_path
),
7422 TREE_TYPE (argtype
));
7424 return error_mark_node
;
7426 /* If fn was found by a using declaration, the conversion path
7427 will be to the derived class, not the base declaring fn. We
7428 must convert from derived to base. */
7429 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
7430 TREE_TYPE (parmtype
), ba_unique
,
7432 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
7433 base_binfo
, 1, complain
);
7435 argarray
[j
++] = converted_arg
;
7436 parm
= TREE_CHAIN (parm
);
7437 if (first_arg
!= NULL_TREE
)
7438 first_arg
= NULL_TREE
;
7445 gcc_assert (first_arg
== NULL_TREE
);
7446 for (; arg_index
< vec_safe_length (args
) && parm
;
7447 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
7449 tree type
= TREE_VALUE (parm
);
7450 tree arg
= (*args
)[arg_index
];
7451 bool conversion_warning
= true;
7455 /* If the argument is NULL and used to (implicitly) instantiate a
7456 template function (and bind one of the template arguments to
7457 the type of 'long int'), we don't want to warn about passing NULL
7458 to non-pointer argument.
7459 For example, if we have this template function:
7461 template<typename T> void func(T x) {}
7463 we want to warn (when -Wconversion is enabled) in this case:
7469 but not in this case:
7475 if (arg
== null_node
7476 && DECL_TEMPLATE_INFO (fn
)
7477 && cand
->template_decl
7478 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
7479 conversion_warning
= false;
7481 /* Warn about initializer_list deduction that isn't currently in the
7483 if (cxx_dialect
> cxx98
7484 && flag_deduce_init_list
7485 && cand
->template_decl
7486 && is_std_init_list (non_reference (type
))
7487 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
7489 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
7490 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
7491 tree patparm
= get_pattern_parm (realparm
, tmpl
);
7492 tree pattype
= TREE_TYPE (patparm
);
7493 if (PACK_EXPANSION_P (pattype
))
7494 pattype
= PACK_EXPANSION_PATTERN (pattype
);
7495 pattype
= non_reference (pattype
);
7497 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
7498 && (cand
->explicit_targs
== NULL_TREE
7499 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
7500 <= TEMPLATE_TYPE_IDX (pattype
))))
7502 pedwarn (input_location
, 0, "deducing %qT as %qT",
7503 non_reference (TREE_TYPE (patparm
)),
7504 non_reference (type
));
7505 pedwarn (DECL_SOURCE_LOCATION (cand
->fn
), 0,
7506 " in call to %qD", cand
->fn
);
7507 pedwarn (input_location
, 0,
7508 " (you can disable this with -fno-deduce-init-list)");
7511 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
7514 : complain
& (~tf_warning
));
7516 val
= convert_for_arg_passing (type
, val
, complain
);
7518 if (val
== error_mark_node
)
7519 return error_mark_node
;
7521 argarray
[j
++] = val
;
7524 /* Default arguments */
7525 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
7527 if (TREE_VALUE (parm
) == error_mark_node
)
7528 return error_mark_node
;
7529 argarray
[j
++] = convert_default_arg (TREE_VALUE (parm
),
7530 TREE_PURPOSE (parm
),
7536 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
7538 tree a
= (*args
)[arg_index
];
7539 int magic
= magic_varargs_p (fn
);
7542 /* Do no conversions for certain magic varargs. */
7543 a
= mark_type_use (a
);
7544 if (TREE_CODE (a
) == FUNCTION_DECL
&& reject_gcc_builtin (a
))
7545 return error_mark_node
;
7547 else if (magic
== 1)
7548 /* For other magic varargs only do decay_conversion. */
7549 a
= decay_conversion (a
, complain
);
7550 else if (DECL_CONSTRUCTOR_P (fn
)
7551 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn
),
7554 /* Avoid infinite recursion trying to call A(...). */
7555 if (complain
& tf_error
)
7556 /* Try to call the actual copy constructor for a good error. */
7557 call_copy_ctor (a
, complain
);
7558 return error_mark_node
;
7561 a
= convert_arg_to_ellipsis (a
, complain
);
7562 if (a
== error_mark_node
)
7563 return error_mark_node
;
7567 gcc_assert (j
<= nargs
);
7570 /* Avoid to do argument-transformation, if warnings for format, and for
7571 nonnull are disabled. Just in case that at least one of them is active
7572 the check_function_arguments function might warn about something. */
7574 if (warn_nonnull
|| warn_format
|| warn_suggest_attribute_format
)
7576 tree
*fargs
= (!nargs
? argarray
7577 : (tree
*) alloca (nargs
* sizeof (tree
)));
7578 for (j
= 0; j
< nargs
; j
++)
7579 fargs
[j
] = maybe_constant_value (argarray
[j
]);
7581 check_function_arguments (input_location
, TREE_TYPE (fn
), nargs
, fargs
);
7584 /* Avoid actually calling copy constructors and copy assignment operators,
7587 if (! flag_elide_constructors
)
7588 /* Do things the hard way. */;
7589 else if (cand
->num_convs
== 1
7590 && (DECL_COPY_CONSTRUCTOR_P (fn
)
7591 || DECL_MOVE_CONSTRUCTOR_P (fn
))
7592 /* It's unsafe to elide the constructor when handling
7593 a noexcept-expression, it may evaluate to the wrong
7594 value (c++/53025). */
7595 && cp_noexcept_operand
== 0)
7598 tree arg
= argarray
[num_artificial_parms_for (fn
)];
7600 bool trivial
= trivial_fn_p (fn
);
7602 /* Pull out the real argument, disregarding const-correctness. */
7604 while (CONVERT_EXPR_P (targ
)
7605 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
7606 targ
= TREE_OPERAND (targ
, 0);
7607 if (TREE_CODE (targ
) == ADDR_EXPR
)
7609 targ
= TREE_OPERAND (targ
, 0);
7610 if (!same_type_ignoring_top_level_qualifiers_p
7611 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
7620 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
7622 /* [class.copy]: the copy constructor is implicitly defined even if
7623 the implementation elided its use. */
7624 if (!trivial
|| DECL_DELETED_FN (fn
))
7626 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
7627 return error_mark_node
;
7628 already_used
= true;
7631 /* If we're creating a temp and we already have one, don't create a
7632 new one. If we're not creating a temp but we get one, use
7633 INIT_EXPR to collapse the temp into our target. Otherwise, if the
7634 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
7635 temp or an INIT_EXPR otherwise. */
7637 if (is_dummy_object (fa
))
7639 if (TREE_CODE (arg
) == TARGET_EXPR
)
7642 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
7645 || (TREE_CODE (arg
) == TARGET_EXPR
7646 && !unsafe_copy_elision_p (fa
, arg
)))
7648 tree to
= cp_stabilize_reference (cp_build_indirect_ref (fa
,
7652 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
7656 else if (DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
7657 && trivial_fn_p (fn
)
7658 && !DECL_DELETED_FN (fn
))
7660 tree to
= cp_stabilize_reference
7661 (cp_build_indirect_ref (argarray
[0], RO_NULL
, complain
));
7662 tree type
= TREE_TYPE (to
);
7663 tree as_base
= CLASSTYPE_AS_BASE (type
);
7664 tree arg
= argarray
[1];
7666 if (is_really_empty_class (type
))
7668 /* Avoid copying empty classes. */
7669 val
= build2 (COMPOUND_EXPR
, void_type_node
, to
, arg
);
7670 TREE_NO_WARNING (val
) = 1;
7671 val
= build2 (COMPOUND_EXPR
, type
, val
, to
);
7672 TREE_NO_WARNING (val
) = 1;
7674 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
7676 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
7677 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
7681 /* We must only copy the non-tail padding parts. */
7683 tree array_type
, alias_set
;
7685 arg2
= TYPE_SIZE_UNIT (as_base
);
7686 arg0
= cp_build_addr_expr (to
, complain
);
7688 array_type
= build_array_type (char_type_node
,
7690 (size_binop (MINUS_EXPR
,
7691 arg2
, size_int (1))));
7692 alias_set
= build_int_cst (build_pointer_type (type
), 0);
7693 t
= build2 (MODIFY_EXPR
, void_type_node
,
7694 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
7695 build2 (MEM_REF
, array_type
, arg
, alias_set
));
7696 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
7697 TREE_NO_WARNING (val
) = 1;
7702 else if (DECL_DESTRUCTOR_P (fn
)
7703 && trivial_fn_p (fn
)
7704 && !DECL_DELETED_FN (fn
))
7705 return fold_convert (void_type_node
, argarray
[0]);
7706 /* FIXME handle trivial default constructor, too. */
7708 /* For calls to a multi-versioned function, overload resolution
7709 returns the function with the highest target priority, that is,
7710 the version that will checked for dispatching first. If this
7711 version is inlinable, a direct call to this version can be made
7712 otherwise the call should go through the dispatcher. */
7714 if (DECL_FUNCTION_VERSIONED (fn
)
7715 && (current_function_decl
== NULL
7716 || !targetm
.target_option
.can_inline_p (current_function_decl
, fn
)))
7718 fn
= get_function_version_dispatcher (fn
);
7722 mark_versions_used (fn
);
7726 && !mark_used (fn
, complain
))
7727 return error_mark_node
;
7729 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0
7730 /* Don't mess with virtual lookup in instantiate_non_dependent_expr;
7731 virtual functions can't be constexpr. */
7732 && !in_template_function ())
7735 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
7737 ba_any
, NULL
, complain
);
7738 gcc_assert (binfo
&& binfo
!= error_mark_node
);
7740 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
7742 if (TREE_SIDE_EFFECTS (argarray
[0]))
7743 argarray
[0] = save_expr (argarray
[0]);
7744 t
= build_pointer_type (TREE_TYPE (fn
));
7745 if (DECL_CONTEXT (fn
) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn
)))
7746 fn
= build_java_interface_fn_ref (fn
, argarray
[0]);
7748 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
7753 fn
= build_addr_func (fn
, complain
);
7754 if (fn
== error_mark_node
)
7755 return error_mark_node
;
7758 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
7759 if (TREE_CODE (call
) == CALL_EXPR
7760 && (cand
->flags
& LOOKUP_LIST_INIT_CTOR
))
7761 CALL_EXPR_LIST_INIT_P (call
) = true;
7765 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
7766 This function performs no overload resolution, conversion, or other
7767 high-level operations. */
7770 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
7771 tsubst_flags_t complain
)
7775 /* Remember roughly where this call is. */
7776 location_t loc
= EXPR_LOC_OR_LOC (fn
, input_location
);
7777 fn
= build_call_a (fn
, nargs
, argarray
);
7778 SET_EXPR_LOCATION (fn
, loc
);
7780 fndecl
= get_callee_fndecl (fn
);
7782 /* Check that arguments to builtin functions match the expectations. */
7784 && DECL_BUILT_IN (fndecl
)
7785 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
7789 /* We need to take care that values to BUILT_IN_NORMAL
7791 for (i
= 0; i
< nargs
; i
++)
7792 argarray
[i
] = fold_non_dependent_expr (argarray
[i
]);
7794 if (!check_builtin_function_arguments (EXPR_LOCATION (fn
), vNULL
, fndecl
,
7796 return error_mark_node
;
7799 /* If it is a built-in array notation function, then the return type of
7800 the function is the element type of the array passed in as array
7801 notation (i.e. the first parameter of the function). */
7802 if (flag_cilkplus
&& TREE_CODE (fn
) == CALL_EXPR
)
7804 enum built_in_function bif
=
7805 is_cilkplus_reduce_builtin (CALL_EXPR_FN (fn
));
7806 if (bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_ADD
7807 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MUL
7808 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MAX
7809 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MIN
7810 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE
7811 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MUTATING
)
7813 if (call_expr_nargs (fn
) == 0)
7815 error_at (EXPR_LOCATION (fn
), "Invalid builtin arguments");
7816 return error_mark_node
;
7818 /* for bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_ZERO or
7819 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_ZERO or
7820 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_NONZERO or
7821 BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_NONZERO or
7822 BUILT_IN_CILKPLUS_SEC_REDUCE_MIN_IND or
7823 BUILT_IN_CILKPLUS_SEC_REDUCE_MAX_IND
7824 The pre-defined return-type is the correct one. */
7825 tree array_ntn
= CALL_EXPR_ARG (fn
, 0);
7826 TREE_TYPE (fn
) = TREE_TYPE (array_ntn
);
7831 if (VOID_TYPE_P (TREE_TYPE (fn
)))
7834 /* 5.2.2/11: If a function call is a prvalue of object type: if the
7835 function call is either the operand of a decltype-specifier or the
7836 right operand of a comma operator that is the operand of a
7837 decltype-specifier, a temporary object is not introduced for the
7838 prvalue. The type of the prvalue may be incomplete. */
7839 if (!(complain
& tf_decltype
))
7841 fn
= require_complete_type_sfinae (fn
, complain
);
7842 if (fn
== error_mark_node
)
7843 return error_mark_node
;
7845 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
7846 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
7848 return convert_from_reference (fn
);
7851 static GTY(()) tree java_iface_lookup_fn
;
7853 /* Make an expression which yields the address of the Java interface
7854 method FN. This is achieved by generating a call to libjava's
7855 _Jv_LookupInterfaceMethodIdx(). */
7858 build_java_interface_fn_ref (tree fn
, tree instance
)
7860 tree lookup_fn
, method
, idx
;
7861 tree klass_ref
, iface
, iface_ref
;
7864 if (!java_iface_lookup_fn
)
7866 tree ftype
= build_function_type_list (ptr_type_node
,
7867 ptr_type_node
, ptr_type_node
,
7868 java_int_type_node
, NULL_TREE
);
7869 java_iface_lookup_fn
7870 = add_builtin_function ("_Jv_LookupInterfaceMethodIdx", ftype
,
7871 0, NOT_BUILT_IN
, NULL
, NULL_TREE
);
7874 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
7875 This is the first entry in the vtable. */
7876 klass_ref
= build_vtbl_ref (cp_build_indirect_ref (instance
, RO_NULL
,
7877 tf_warning_or_error
),
7880 /* Get the java.lang.Class pointer for the interface being called. */
7881 iface
= DECL_CONTEXT (fn
);
7882 iface_ref
= lookup_field (iface
, get_identifier ("class$"), 0, false);
7883 if (!iface_ref
|| !VAR_P (iface_ref
)
7884 || DECL_CONTEXT (iface_ref
) != iface
)
7886 error ("could not find class$ field in java interface type %qT",
7888 return error_mark_node
;
7890 iface_ref
= build_address (iface_ref
);
7891 iface_ref
= convert (build_pointer_type (iface
), iface_ref
);
7893 /* Determine the itable index of FN. */
7895 for (method
= TYPE_METHODS (iface
); method
; method
= DECL_CHAIN (method
))
7897 if (!DECL_VIRTUAL_P (method
))
7903 idx
= build_int_cst (NULL_TREE
, i
);
7905 lookup_fn
= build1 (ADDR_EXPR
,
7906 build_pointer_type (TREE_TYPE (java_iface_lookup_fn
)),
7907 java_iface_lookup_fn
);
7908 return build_call_nary (ptr_type_node
, lookup_fn
,
7909 3, klass_ref
, iface_ref
, idx
);
7912 /* Returns the value to use for the in-charge parameter when making a
7913 call to a function with the indicated NAME.
7915 FIXME:Can't we find a neater way to do this mapping? */
7918 in_charge_arg_for_name (tree name
)
7920 if (name
== base_ctor_identifier
7921 || name
== base_dtor_identifier
)
7922 return integer_zero_node
;
7923 else if (name
== complete_ctor_identifier
)
7924 return integer_one_node
;
7925 else if (name
== complete_dtor_identifier
)
7926 return integer_two_node
;
7927 else if (name
== deleting_dtor_identifier
)
7928 return integer_three_node
;
7930 /* This function should only be called with one of the names listed
7936 /* Build a call to a constructor, destructor, or an assignment
7937 operator for INSTANCE, an expression with class type. NAME
7938 indicates the special member function to call; *ARGS are the
7939 arguments. ARGS may be NULL. This may change ARGS. BINFO
7940 indicates the base of INSTANCE that is to be passed as the `this'
7941 parameter to the member function called.
7943 FLAGS are the LOOKUP_* flags to use when processing the call.
7945 If NAME indicates a complete object constructor, INSTANCE may be
7946 NULL_TREE. In this case, the caller will call build_cplus_new to
7947 store the newly constructed object into a VAR_DECL. */
7950 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
7951 tree binfo
, int flags
, tsubst_flags_t complain
)
7954 /* The type of the subobject to be constructed or destroyed. */
7956 vec
<tree
, va_gc
> *allocated
= NULL
;
7959 gcc_assert (name
== complete_ctor_identifier
7960 || name
== base_ctor_identifier
7961 || name
== complete_dtor_identifier
7962 || name
== base_dtor_identifier
7963 || name
== deleting_dtor_identifier
7964 || name
== ansi_assopname (NOP_EXPR
));
7967 /* Resolve the name. */
7968 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
7969 return error_mark_node
;
7971 binfo
= TYPE_BINFO (binfo
);
7974 gcc_assert (binfo
!= NULL_TREE
);
7976 class_type
= BINFO_TYPE (binfo
);
7978 /* Handle the special case where INSTANCE is NULL_TREE. */
7979 if (name
== complete_ctor_identifier
&& !instance
)
7980 instance
= build_dummy_object (class_type
);
7983 if (name
== complete_dtor_identifier
7984 || name
== base_dtor_identifier
7985 || name
== deleting_dtor_identifier
)
7986 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
7988 /* Convert to the base class, if necessary. */
7989 if (!same_type_ignoring_top_level_qualifiers_p
7990 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
7992 if (name
!= ansi_assopname (NOP_EXPR
))
7993 /* For constructors and destructors, either the base is
7994 non-virtual, or it is virtual but we are doing the
7995 conversion from a constructor or destructor for the
7996 complete object. In either case, we can convert
7998 instance
= convert_to_base_statically (instance
, binfo
);
8000 /* However, for assignment operators, we must convert
8001 dynamically if the base is virtual. */
8002 instance
= build_base_path (PLUS_EXPR
, instance
,
8003 binfo
, /*nonnull=*/1, complain
);
8007 gcc_assert (instance
!= NULL_TREE
);
8009 fns
= lookup_fnfields (binfo
, name
, 1);
8011 /* When making a call to a constructor or destructor for a subobject
8012 that uses virtual base classes, pass down a pointer to a VTT for
8014 if ((name
== base_ctor_identifier
8015 || name
== base_dtor_identifier
)
8016 && CLASSTYPE_VBASECLASSES (class_type
))
8021 /* If the current function is a complete object constructor
8022 or destructor, then we fetch the VTT directly.
8023 Otherwise, we look it up using the VTT we were given. */
8024 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
8025 vtt
= decay_conversion (vtt
, complain
);
8026 if (vtt
== error_mark_node
)
8027 return error_mark_node
;
8028 vtt
= build_if_in_charge (vtt
, current_vtt_parm
);
8029 if (BINFO_SUBVTT_INDEX (binfo
))
8030 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
8036 allocated
= make_tree_vector ();
8040 vec_safe_insert (*args
, 0, sub_vtt
);
8043 ret
= build_new_method_call (instance
, fns
, args
,
8044 TYPE_BINFO (BINFO_TYPE (binfo
)),
8048 if (allocated
!= NULL
)
8049 release_tree_vector (allocated
);
8051 if ((complain
& tf_error
)
8052 && (flags
& LOOKUP_DELEGATING_CONS
)
8053 && name
== complete_ctor_identifier
8054 && TREE_CODE (ret
) == CALL_EXPR
8055 && (DECL_ABSTRACT_ORIGIN (TREE_OPERAND (CALL_EXPR_FN (ret
), 0))
8056 == current_function_decl
))
8057 error ("constructor delegates to itself");
8062 /* Return the NAME, as a C string. The NAME indicates a function that
8063 is a member of TYPE. *FREE_P is set to true if the caller must
8064 free the memory returned.
8066 Rather than go through all of this, we should simply set the names
8067 of constructors and destructors appropriately, and dispense with
8068 ctor_identifier, dtor_identifier, etc. */
8071 name_as_c_string (tree name
, tree type
, bool *free_p
)
8075 /* Assume that we will not allocate memory. */
8077 /* Constructors and destructors are special. */
8078 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
8081 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
))));
8082 /* For a destructor, add the '~'. */
8083 if (name
== complete_dtor_identifier
8084 || name
== base_dtor_identifier
8085 || name
== deleting_dtor_identifier
)
8087 pretty_name
= concat ("~", pretty_name
, NULL
);
8088 /* Remember that we need to free the memory allocated. */
8092 else if (IDENTIFIER_TYPENAME_P (name
))
8094 pretty_name
= concat ("operator ",
8095 type_as_string_translate (TREE_TYPE (name
),
8096 TFF_PLAIN_IDENTIFIER
),
8098 /* Remember that we need to free the memory allocated. */
8102 pretty_name
= CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name
)));
8107 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
8108 be set, upon return, to the function called. ARGS may be NULL.
8109 This may change ARGS. */
8112 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
8113 tree conversion_path
, int flags
,
8114 tree
*fn_p
, tsubst_flags_t complain
)
8116 struct z_candidate
*candidates
= 0, *cand
;
8117 tree explicit_targs
= NULL_TREE
;
8118 tree basetype
= NULL_TREE
;
8119 tree access_binfo
, binfo
;
8121 tree first_mem_arg
= NULL_TREE
;
8123 bool skip_first_for_error
;
8124 vec
<tree
, va_gc
> *user_args
;
8127 int template_only
= 0;
8131 vec
<tree
, va_gc
> *orig_args
= NULL
;
8134 gcc_assert (instance
!= NULL_TREE
);
8136 /* We don't know what function we're going to call, yet. */
8140 if (error_operand_p (instance
)
8141 || !fns
|| error_operand_p (fns
))
8142 return error_mark_node
;
8144 if (!BASELINK_P (fns
))
8146 if (complain
& tf_error
)
8147 error ("call to non-function %qD", fns
);
8148 return error_mark_node
;
8151 orig_instance
= instance
;
8154 /* Dismantle the baselink to collect all the information we need. */
8155 if (!conversion_path
)
8156 conversion_path
= BASELINK_BINFO (fns
);
8157 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
8158 binfo
= BASELINK_BINFO (fns
);
8159 optype
= BASELINK_OPTYPE (fns
);
8160 fns
= BASELINK_FUNCTIONS (fns
);
8161 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
8163 explicit_targs
= TREE_OPERAND (fns
, 1);
8164 fns
= TREE_OPERAND (fns
, 0);
8167 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
8168 || TREE_CODE (fns
) == TEMPLATE_DECL
8169 || TREE_CODE (fns
) == OVERLOAD
);
8170 fn
= get_first_fn (fns
);
8171 name
= DECL_NAME (fn
);
8173 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
8174 gcc_assert (CLASS_TYPE_P (basetype
));
8176 if (processing_template_decl
)
8178 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
8179 instance
= build_non_dependent_expr (instance
);
8181 make_args_non_dependent (*args
);
8184 user_args
= args
== NULL
? NULL
: *args
;
8185 /* Under DR 147 A::A() is an invalid constructor call,
8186 not a functional cast. */
8187 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
8189 if (! (complain
& tf_error
))
8190 return error_mark_node
;
8192 if (permerror (input_location
,
8193 "cannot call constructor %<%T::%D%> directly",
8195 inform (input_location
, "for a function-style cast, remove the "
8196 "redundant %<::%D%>", name
);
8197 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
8202 /* Figure out whether to skip the first argument for the error
8203 message we will display to users if an error occurs. We don't
8204 want to display any compiler-generated arguments. The "this"
8205 pointer hasn't been added yet. However, we must remove the VTT
8206 pointer if this is a call to a base-class constructor or
8208 skip_first_for_error
= false;
8209 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
8211 /* Callers should explicitly indicate whether they want to construct
8212 the complete object or just the part without virtual bases. */
8213 gcc_assert (name
!= ctor_identifier
);
8214 /* Similarly for destructors. */
8215 gcc_assert (name
!= dtor_identifier
);
8216 /* Remove the VTT pointer, if present. */
8217 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
8218 && CLASSTYPE_VBASECLASSES (basetype
))
8219 skip_first_for_error
= true;
8222 /* Process the argument list. */
8223 if (args
!= NULL
&& *args
!= NULL
)
8225 *args
= resolve_args (*args
, complain
);
8227 return error_mark_node
;
8230 /* Consider the object argument to be used even if we end up selecting a
8231 static member function. */
8232 instance
= mark_type_use (instance
);
8234 /* It's OK to call destructors and constructors on cv-qualified objects.
8235 Therefore, convert the INSTANCE to the unqualified type, if
8237 if (DECL_DESTRUCTOR_P (fn
)
8238 || DECL_CONSTRUCTOR_P (fn
))
8240 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
8242 instance
= build_this (instance
);
8243 instance
= build_nop (build_pointer_type (basetype
), instance
);
8244 instance
= build_fold_indirect_ref (instance
);
8247 if (DECL_DESTRUCTOR_P (fn
))
8248 name
= complete_dtor_identifier
;
8250 /* For the overload resolution we need to find the actual `this`
8251 that would be captured if the call turns out to be to a
8252 non-static member function. Do not actually capture it at this
8254 if (DECL_CONSTRUCTOR_P (fn
))
8255 /* Constructors don't use the enclosing 'this'. */
8256 first_mem_arg
= instance
;
8258 first_mem_arg
= maybe_resolve_dummy (instance
, false);
8260 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8261 p
= conversion_obstack_alloc (0);
8263 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
8264 initializer, not T({ }). */
8265 if (DECL_CONSTRUCTOR_P (fn
) && args
!= NULL
&& !vec_safe_is_empty (*args
)
8266 && DIRECT_LIST_INIT_P ((**args
)[0]))
8268 tree init_list
= (**args
)[0];
8269 tree init
= NULL_TREE
;
8271 gcc_assert ((*args
)->length () == 1
8272 && !(flags
& LOOKUP_ONLYCONVERTING
));
8274 /* If the initializer list has no elements and T is a class type with
8275 a default constructor, the object is value-initialized. Handle
8276 this here so we don't need to handle it wherever we use
8277 build_special_member_call. */
8278 if (CONSTRUCTOR_NELTS (init_list
) == 0
8279 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
8280 /* For a user-provided default constructor, use the normal
8281 mechanisms so that protected access works. */
8282 && type_has_non_user_provided_default_constructor (basetype
)
8283 && !processing_template_decl
)
8284 init
= build_value_init (basetype
, complain
);
8286 /* If BASETYPE is an aggregate, we need to do aggregate
8288 else if (CP_AGGREGATE_TYPE_P (basetype
))
8290 init
= reshape_init (basetype
, init_list
, complain
);
8291 init
= digest_init (basetype
, init
, complain
);
8296 if (is_dummy_object (instance
))
8297 return get_target_expr_sfinae (init
, complain
);
8298 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
8299 TREE_SIDE_EFFECTS (init
) = true;
8303 /* Otherwise go ahead with overload resolution. */
8304 add_list_candidates (fns
, first_mem_arg
, init_list
,
8305 basetype
, explicit_targs
, template_only
,
8306 conversion_path
, access_binfo
, flags
,
8307 &candidates
, complain
);
8311 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
8312 explicit_targs
, template_only
, conversion_path
,
8313 access_binfo
, flags
, &candidates
, complain
);
8315 any_viable_p
= false;
8316 candidates
= splice_viable (candidates
, false, &any_viable_p
);
8320 if (complain
& tf_error
)
8322 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
8323 cxx_incomplete_type_error (instance
, basetype
);
8325 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
8326 basetype
, optype
, build_tree_list_vec (user_args
),
8327 TREE_TYPE (instance
));
8334 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
8335 arglist
= build_tree_list_vec (user_args
);
8336 if (skip_first_for_error
)
8337 arglist
= TREE_CHAIN (arglist
);
8338 error ("no matching function for call to %<%T::%s(%A)%#V%>",
8339 basetype
, pretty_name
, arglist
,
8340 TREE_TYPE (instance
));
8344 print_z_candidates (location_of (name
), candidates
);
8346 call
= error_mark_node
;
8350 cand
= tourney (candidates
, complain
);
8357 if (complain
& tf_error
)
8359 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
8360 arglist
= build_tree_list_vec (user_args
);
8361 if (skip_first_for_error
)
8362 arglist
= TREE_CHAIN (arglist
);
8363 if (!any_strictly_viable (candidates
))
8364 error ("no matching function for call to %<%s(%A)%>",
8365 pretty_name
, arglist
);
8367 error ("call of overloaded %<%s(%A)%> is ambiguous",
8368 pretty_name
, arglist
);
8369 print_z_candidates (location_of (name
), candidates
);
8373 call
= error_mark_node
;
8380 if (!(flags
& LOOKUP_NONVIRTUAL
)
8381 && DECL_PURE_VIRTUAL_P (fn
)
8382 && instance
== current_class_ref
8383 && (complain
& tf_warning
))
8385 /* This is not an error, it is runtime undefined
8387 if (!current_function_decl
)
8388 warning (0, "pure virtual %q#D called from "
8389 "non-static data member initializer", fn
);
8390 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
8391 || DECL_DESTRUCTOR_P (current_function_decl
))
8392 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
8393 ? "pure virtual %q#D called from constructor"
8394 : "pure virtual %q#D called from destructor"),
8398 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
8399 && !DECL_CONSTRUCTOR_P (fn
)
8400 && is_dummy_object (instance
))
8402 instance
= maybe_resolve_dummy (instance
, true);
8403 if (instance
== error_mark_node
)
8404 call
= error_mark_node
;
8405 else if (!is_dummy_object (instance
))
8407 /* We captured 'this' in the current lambda now that
8408 we know we really need it. */
8409 cand
->first_arg
= instance
;
8411 else if (any_dependent_bases_p ())
8412 /* We can't tell until instantiation time whether we can use
8413 *this as the implicit object argument. */;
8416 if (complain
& tf_error
)
8417 error ("cannot call member function %qD without object",
8419 call
= error_mark_node
;
8423 if (call
!= error_mark_node
)
8425 /* Optimize away vtable lookup if we know that this
8426 function can't be overridden. We need to check if
8427 the context and the type where we found fn are the same,
8428 actually FN might be defined in a different class
8429 type because of a using-declaration. In this case, we
8430 do not want to perform a non-virtual call. */
8431 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
8432 && same_type_ignoring_top_level_qualifiers_p
8433 (DECL_CONTEXT (fn
), BINFO_TYPE (binfo
))
8434 && resolves_to_fixed_type_p (instance
, 0))
8435 flags
|= LOOKUP_NONVIRTUAL
;
8437 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
8438 /* Now we know what function is being called. */
8441 /* Build the actual CALL_EXPR. */
8442 call
= build_over_call (cand
, flags
, complain
);
8443 /* In an expression of the form `a->f()' where `f' turns
8444 out to be a static member function, `a' is
8445 none-the-less evaluated. */
8446 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
8447 && !is_dummy_object (instance
)
8448 && TREE_SIDE_EFFECTS (instance
))
8449 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
),
8451 else if (call
!= error_mark_node
8452 && DECL_DESTRUCTOR_P (cand
->fn
)
8453 && !VOID_TYPE_P (TREE_TYPE (call
)))
8454 /* An explicit call of the form "x->~X()" has type
8455 "void". However, on platforms where destructors
8456 return "this" (i.e., those where
8457 targetm.cxx.cdtor_returns_this is true), such calls
8458 will appear to have a return value of pointer type
8459 to the low-level call machinery. We do not want to
8460 change the low-level machinery, since we want to be
8461 able to optimize "delete f()" on such platforms as
8462 "operator delete(~X(f()))" (rather than generating
8463 "t = f(), ~X(t), operator delete (t)"). */
8464 call
= build_nop (void_type_node
, call
);
8469 if (processing_template_decl
&& call
!= error_mark_node
)
8471 bool cast_to_void
= false;
8473 if (TREE_CODE (call
) == COMPOUND_EXPR
)
8474 call
= TREE_OPERAND (call
, 1);
8475 else if (TREE_CODE (call
) == NOP_EXPR
)
8477 cast_to_void
= true;
8478 call
= TREE_OPERAND (call
, 0);
8480 if (INDIRECT_REF_P (call
))
8481 call
= TREE_OPERAND (call
, 0);
8482 call
= (build_min_non_dep_call_vec
8484 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
8485 orig_instance
, orig_fns
, NULL_TREE
),
8487 SET_EXPR_LOCATION (call
, input_location
);
8488 call
= convert_from_reference (call
);
8490 call
= build_nop (void_type_node
, call
);
8493 /* Free all the conversions we allocated. */
8494 obstack_free (&conversion_obstack
, p
);
8496 if (orig_args
!= NULL
)
8497 release_tree_vector (orig_args
);
8502 /* Wrapper for above. */
8505 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
8506 tree conversion_path
, int flags
,
8507 tree
*fn_p
, tsubst_flags_t complain
)
8510 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
8511 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
8513 timevar_cond_stop (TV_OVERLOAD
, subtime
);
8517 /* Returns true iff standard conversion sequence ICS1 is a proper
8518 subsequence of ICS2. */
8521 is_subseq (conversion
*ics1
, conversion
*ics2
)
8523 /* We can assume that a conversion of the same code
8524 between the same types indicates a subsequence since we only get
8525 here if the types we are converting from are the same. */
8527 while (ics1
->kind
== ck_rvalue
8528 || ics1
->kind
== ck_lvalue
)
8529 ics1
= next_conversion (ics1
);
8533 while (ics2
->kind
== ck_rvalue
8534 || ics2
->kind
== ck_lvalue
)
8535 ics2
= next_conversion (ics2
);
8537 if (ics2
->kind
== ck_user
8538 || ics2
->kind
== ck_ambig
8539 || ics2
->kind
== ck_aggr
8540 || ics2
->kind
== ck_list
8541 || ics2
->kind
== ck_identity
)
8542 /* At this point, ICS1 cannot be a proper subsequence of
8543 ICS2. We can get a USER_CONV when we are comparing the
8544 second standard conversion sequence of two user conversion
8548 ics2
= next_conversion (ics2
);
8550 if (ics2
->kind
== ics1
->kind
8551 && same_type_p (ics2
->type
, ics1
->type
)
8552 && same_type_p (next_conversion (ics2
)->type
,
8553 next_conversion (ics1
)->type
))
8558 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
8559 be any _TYPE nodes. */
8562 is_properly_derived_from (tree derived
, tree base
)
8564 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
8567 /* We only allow proper derivation here. The DERIVED_FROM_P macro
8568 considers every class derived from itself. */
8569 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
8570 && DERIVED_FROM_P (base
, derived
));
8573 /* We build the ICS for an implicit object parameter as a pointer
8574 conversion sequence. However, such a sequence should be compared
8575 as if it were a reference conversion sequence. If ICS is the
8576 implicit conversion sequence for an implicit object parameter,
8577 modify it accordingly. */
8580 maybe_handle_implicit_object (conversion
**ics
)
8584 /* [over.match.funcs]
8586 For non-static member functions, the type of the
8587 implicit object parameter is "reference to cv X"
8588 where X is the class of which the function is a
8589 member and cv is the cv-qualification on the member
8590 function declaration. */
8591 conversion
*t
= *ics
;
8592 tree reference_type
;
8594 /* The `this' parameter is a pointer to a class type. Make the
8595 implicit conversion talk about a reference to that same class
8597 reference_type
= TREE_TYPE (t
->type
);
8598 reference_type
= build_reference_type (reference_type
);
8600 if (t
->kind
== ck_qual
)
8601 t
= next_conversion (t
);
8602 if (t
->kind
== ck_ptr
)
8603 t
= next_conversion (t
);
8604 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
8605 t
= direct_reference_binding (reference_type
, t
);
8607 t
->rvaluedness_matches_p
= 0;
8612 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
8613 and return the initial reference binding conversion. Otherwise,
8614 leave *ICS unchanged and return NULL. */
8617 maybe_handle_ref_bind (conversion
**ics
)
8619 if ((*ics
)->kind
== ck_ref_bind
)
8621 conversion
*old_ics
= *ics
;
8622 *ics
= next_conversion (old_ics
);
8623 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
8630 /* Compare two implicit conversion sequences according to the rules set out in
8631 [over.ics.rank]. Return values:
8633 1: ics1 is better than ics2
8634 -1: ics2 is better than ics1
8635 0: ics1 and ics2 are indistinguishable */
8638 compare_ics (conversion
*ics1
, conversion
*ics2
)
8644 tree deref_from_type1
= NULL_TREE
;
8645 tree deref_from_type2
= NULL_TREE
;
8646 tree deref_to_type1
= NULL_TREE
;
8647 tree deref_to_type2
= NULL_TREE
;
8648 conversion_rank rank1
, rank2
;
8650 /* REF_BINDING is nonzero if the result of the conversion sequence
8651 is a reference type. In that case REF_CONV is the reference
8652 binding conversion. */
8653 conversion
*ref_conv1
;
8654 conversion
*ref_conv2
;
8656 /* Compare badness before stripping the reference conversion. */
8657 if (ics1
->bad_p
> ics2
->bad_p
)
8659 else if (ics1
->bad_p
< ics2
->bad_p
)
8662 /* Handle implicit object parameters. */
8663 maybe_handle_implicit_object (&ics1
);
8664 maybe_handle_implicit_object (&ics2
);
8666 /* Handle reference parameters. */
8667 ref_conv1
= maybe_handle_ref_bind (&ics1
);
8668 ref_conv2
= maybe_handle_ref_bind (&ics2
);
8670 /* List-initialization sequence L1 is a better conversion sequence than
8671 list-initialization sequence L2 if L1 converts to
8672 std::initializer_list<X> for some X and L2 does not. */
8673 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
8675 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
8680 When comparing the basic forms of implicit conversion sequences (as
8681 defined in _over.best.ics_)
8683 --a standard conversion sequence (_over.ics.scs_) is a better
8684 conversion sequence than a user-defined conversion sequence
8685 or an ellipsis conversion sequence, and
8687 --a user-defined conversion sequence (_over.ics.user_) is a
8688 better conversion sequence than an ellipsis conversion sequence
8689 (_over.ics.ellipsis_). */
8690 /* Use BAD_CONVERSION_RANK because we already checked for a badness
8691 mismatch. If both ICS are bad, we try to make a decision based on
8692 what would have happened if they'd been good. This is not an
8693 extension, we'll still give an error when we build up the call; this
8694 just helps us give a more helpful error message. */
8695 rank1
= BAD_CONVERSION_RANK (ics1
);
8696 rank2
= BAD_CONVERSION_RANK (ics2
);
8700 else if (rank1
< rank2
)
8703 if (ics1
->ellipsis_p
)
8704 /* Both conversions are ellipsis conversions. */
8707 /* User-defined conversion sequence U1 is a better conversion sequence
8708 than another user-defined conversion sequence U2 if they contain the
8709 same user-defined conversion operator or constructor and if the sec-
8710 ond standard conversion sequence of U1 is better than the second
8711 standard conversion sequence of U2. */
8713 /* Handle list-conversion with the same code even though it isn't always
8714 ranked as a user-defined conversion and it doesn't have a second
8715 standard conversion sequence; it will still have the desired effect.
8716 Specifically, we need to do the reference binding comparison at the
8717 end of this function. */
8719 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
|| ics1
->kind
== ck_aggr
)
8724 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
8725 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
8726 || t1
->kind
== ck_list
)
8728 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
8729 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
8730 || t2
->kind
== ck_list
)
8733 if (t1
->kind
!= t2
->kind
)
8735 else if (t1
->kind
== ck_user
)
8737 if (t1
->cand
->fn
!= t2
->cand
->fn
)
8742 /* For ambiguous or aggregate conversions, use the target type as
8743 a proxy for the conversion function. */
8744 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
8748 /* We can just fall through here, after setting up
8749 FROM_TYPE1 and FROM_TYPE2. */
8750 from_type1
= t1
->type
;
8751 from_type2
= t2
->type
;
8758 /* We're dealing with two standard conversion sequences.
8762 Standard conversion sequence S1 is a better conversion
8763 sequence than standard conversion sequence S2 if
8765 --S1 is a proper subsequence of S2 (comparing the conversion
8766 sequences in the canonical form defined by _over.ics.scs_,
8767 excluding any Lvalue Transformation; the identity
8768 conversion sequence is considered to be a subsequence of
8769 any non-identity conversion sequence */
8772 while (t1
->kind
!= ck_identity
)
8773 t1
= next_conversion (t1
);
8774 from_type1
= t1
->type
;
8777 while (t2
->kind
!= ck_identity
)
8778 t2
= next_conversion (t2
);
8779 from_type2
= t2
->type
;
8782 /* One sequence can only be a subsequence of the other if they start with
8783 the same type. They can start with different types when comparing the
8784 second standard conversion sequence in two user-defined conversion
8786 if (same_type_p (from_type1
, from_type2
))
8788 if (is_subseq (ics1
, ics2
))
8790 if (is_subseq (ics2
, ics1
))
8798 --the rank of S1 is better than the rank of S2 (by the rules
8801 Standard conversion sequences are ordered by their ranks: an Exact
8802 Match is a better conversion than a Promotion, which is a better
8803 conversion than a Conversion.
8805 Two conversion sequences with the same rank are indistinguishable
8806 unless one of the following rules applies:
8808 --A conversion that does not a convert a pointer, pointer to member,
8809 or std::nullptr_t to bool is better than one that does.
8811 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
8812 so that we do not have to check it explicitly. */
8813 if (ics1
->rank
< ics2
->rank
)
8815 else if (ics2
->rank
< ics1
->rank
)
8818 to_type1
= ics1
->type
;
8819 to_type2
= ics2
->type
;
8821 /* A conversion from scalar arithmetic type to complex is worse than a
8822 conversion between scalar arithmetic types. */
8823 if (same_type_p (from_type1
, from_type2
)
8824 && ARITHMETIC_TYPE_P (from_type1
)
8825 && ARITHMETIC_TYPE_P (to_type1
)
8826 && ARITHMETIC_TYPE_P (to_type2
)
8827 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
8828 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
8830 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
8836 if (TYPE_PTR_P (from_type1
)
8837 && TYPE_PTR_P (from_type2
)
8838 && TYPE_PTR_P (to_type1
)
8839 && TYPE_PTR_P (to_type2
))
8841 deref_from_type1
= TREE_TYPE (from_type1
);
8842 deref_from_type2
= TREE_TYPE (from_type2
);
8843 deref_to_type1
= TREE_TYPE (to_type1
);
8844 deref_to_type2
= TREE_TYPE (to_type2
);
8846 /* The rules for pointers to members A::* are just like the rules
8847 for pointers A*, except opposite: if B is derived from A then
8848 A::* converts to B::*, not vice versa. For that reason, we
8849 switch the from_ and to_ variables here. */
8850 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
8851 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
8852 || (TYPE_PTRMEMFUNC_P (from_type1
)
8853 && TYPE_PTRMEMFUNC_P (from_type2
)
8854 && TYPE_PTRMEMFUNC_P (to_type1
)
8855 && TYPE_PTRMEMFUNC_P (to_type2
)))
8857 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
8858 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
8859 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
8860 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
8863 if (deref_from_type1
!= NULL_TREE
8864 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
8865 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
8867 /* This was one of the pointer or pointer-like conversions.
8871 --If class B is derived directly or indirectly from class A,
8872 conversion of B* to A* is better than conversion of B* to
8873 void*, and conversion of A* to void* is better than
8874 conversion of B* to void*. */
8875 if (VOID_TYPE_P (deref_to_type1
)
8876 && VOID_TYPE_P (deref_to_type2
))
8878 if (is_properly_derived_from (deref_from_type1
,
8881 else if (is_properly_derived_from (deref_from_type2
,
8885 else if (VOID_TYPE_P (deref_to_type1
)
8886 || VOID_TYPE_P (deref_to_type2
))
8888 if (same_type_p (deref_from_type1
, deref_from_type2
))
8890 if (VOID_TYPE_P (deref_to_type2
))
8892 if (is_properly_derived_from (deref_from_type1
,
8896 /* We know that DEREF_TO_TYPE1 is `void' here. */
8897 else if (is_properly_derived_from (deref_from_type1
,
8902 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
8903 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
8907 --If class B is derived directly or indirectly from class A
8908 and class C is derived directly or indirectly from B,
8910 --conversion of C* to B* is better than conversion of C* to
8913 --conversion of B* to A* is better than conversion of C* to
8915 if (same_type_p (deref_from_type1
, deref_from_type2
))
8917 if (is_properly_derived_from (deref_to_type1
,
8920 else if (is_properly_derived_from (deref_to_type2
,
8924 else if (same_type_p (deref_to_type1
, deref_to_type2
))
8926 if (is_properly_derived_from (deref_from_type2
,
8929 else if (is_properly_derived_from (deref_from_type1
,
8935 else if (CLASS_TYPE_P (non_reference (from_type1
))
8936 && same_type_p (from_type1
, from_type2
))
8938 tree from
= non_reference (from_type1
);
8942 --binding of an expression of type C to a reference of type
8943 B& is better than binding an expression of type C to a
8944 reference of type A&
8946 --conversion of C to B is better than conversion of C to A, */
8947 if (is_properly_derived_from (from
, to_type1
)
8948 && is_properly_derived_from (from
, to_type2
))
8950 if (is_properly_derived_from (to_type1
, to_type2
))
8952 else if (is_properly_derived_from (to_type2
, to_type1
))
8956 else if (CLASS_TYPE_P (non_reference (to_type1
))
8957 && same_type_p (to_type1
, to_type2
))
8959 tree to
= non_reference (to_type1
);
8963 --binding of an expression of type B to a reference of type
8964 A& is better than binding an expression of type C to a
8965 reference of type A&,
8967 --conversion of B to A is better than conversion of C to A */
8968 if (is_properly_derived_from (from_type1
, to
)
8969 && is_properly_derived_from (from_type2
, to
))
8971 if (is_properly_derived_from (from_type2
, from_type1
))
8973 else if (is_properly_derived_from (from_type1
, from_type2
))
8980 --S1 and S2 differ only in their qualification conversion and yield
8981 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
8982 qualification signature of type T1 is a proper subset of the cv-
8983 qualification signature of type T2 */
8984 if (ics1
->kind
== ck_qual
8985 && ics2
->kind
== ck_qual
8986 && same_type_p (from_type1
, from_type2
))
8988 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
8995 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
8996 to an implicit object parameter of a non-static member function
8997 declared without a ref-qualifier, and either S1 binds an lvalue
8998 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
8999 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
9000 draft standard, 13.3.3.2)
9002 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
9003 types to which the references refer are the same type except for
9004 top-level cv-qualifiers, and the type to which the reference
9005 initialized by S2 refers is more cv-qualified than the type to
9006 which the reference initialized by S1 refers.
9008 DR 1328 [over.match.best]: the context is an initialization by
9009 conversion function for direct reference binding (13.3.1.6) of a
9010 reference to function type, the return type of F1 is the same kind of
9011 reference (i.e. lvalue or rvalue) as the reference being initialized,
9012 and the return type of F2 is not. */
9014 if (ref_conv1
&& ref_conv2
)
9016 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
9017 && (ref_conv1
->rvaluedness_matches_p
9018 != ref_conv2
->rvaluedness_matches_p
)
9019 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
9020 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
9021 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
9023 if (ref_conv1
->bad_p
9024 && !same_type_p (TREE_TYPE (ref_conv1
->type
),
9025 TREE_TYPE (ref_conv2
->type
)))
9026 /* Don't prefer a bad conversion that drops cv-quals to a bad
9027 conversion with the wrong rvalueness. */
9029 return (ref_conv1
->rvaluedness_matches_p
9030 - ref_conv2
->rvaluedness_matches_p
);
9033 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
9035 int q1
= cp_type_quals (TREE_TYPE (ref_conv1
->type
));
9036 int q2
= cp_type_quals (TREE_TYPE (ref_conv2
->type
));
9037 if (ref_conv1
->bad_p
)
9039 /* Prefer the one that drops fewer cv-quals. */
9040 tree ftype
= next_conversion (ref_conv1
)->type
;
9041 int fquals
= cp_type_quals (ftype
);
9045 return comp_cv_qualification (q2
, q1
);
9049 /* Neither conversion sequence is better than the other. */
9053 /* The source type for this standard conversion sequence. */
9056 source_type (conversion
*t
)
9058 for (;; t
= next_conversion (t
))
9060 if (t
->kind
== ck_user
9061 || t
->kind
== ck_ambig
9062 || t
->kind
== ck_identity
)
9068 /* Note a warning about preferring WINNER to LOSER. We do this by storing
9069 a pointer to LOSER and re-running joust to produce the warning if WINNER
9070 is actually used. */
9073 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
9075 candidate_warning
*cw
= (candidate_warning
*)
9076 conversion_obstack_alloc (sizeof (candidate_warning
));
9078 cw
->next
= winner
->warnings
;
9079 winner
->warnings
= cw
;
9082 /* Compare two candidates for overloading as described in
9083 [over.match.best]. Return values:
9085 1: cand1 is better than cand2
9086 -1: cand2 is better than cand1
9087 0: cand1 and cand2 are indistinguishable */
9090 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
9091 tsubst_flags_t complain
)
9094 int off1
= 0, off2
= 0;
9098 /* Candidates that involve bad conversions are always worse than those
9100 if (cand1
->viable
> cand2
->viable
)
9102 if (cand1
->viable
< cand2
->viable
)
9105 /* If we have two pseudo-candidates for conversions to the same type,
9106 or two candidates for the same function, arbitrarily pick one. */
9107 if (cand1
->fn
== cand2
->fn
9108 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
9111 /* Prefer a non-deleted function over an implicitly deleted move
9112 constructor or assignment operator. This differs slightly from the
9113 wording for issue 1402 (which says the move op is ignored by overload
9114 resolution), but this way produces better error messages. */
9115 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
9116 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
9117 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
9119 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
9120 && move_fn_p (cand1
->fn
))
9122 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
9123 && move_fn_p (cand2
->fn
))
9127 /* a viable function F1
9128 is defined to be a better function than another viable function F2 if
9129 for all arguments i, ICSi(F1) is not a worse conversion sequence than
9130 ICSi(F2), and then */
9132 /* for some argument j, ICSj(F1) is a better conversion sequence than
9135 /* For comparing static and non-static member functions, we ignore
9136 the implicit object parameter of the non-static function. The
9137 standard says to pretend that the static function has an object
9138 parm, but that won't work with operator overloading. */
9139 len
= cand1
->num_convs
;
9140 if (len
!= cand2
->num_convs
)
9142 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
9143 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
9145 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
9146 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
9147 /* We're comparing a near-match list constructor and a near-match
9148 non-list constructor. Just treat them as unordered. */
9151 gcc_assert (static_1
!= static_2
);
9162 for (i
= 0; i
< len
; ++i
)
9164 conversion
*t1
= cand1
->convs
[i
+ off1
];
9165 conversion
*t2
= cand2
->convs
[i
+ off2
];
9166 int comp
= compare_ics (t1
, t2
);
9170 if ((complain
& tf_warning
)
9172 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
9173 == cr_std
+ cr_promotion
)
9174 && t1
->kind
== ck_std
9175 && t2
->kind
== ck_std
9176 && TREE_CODE (t1
->type
) == INTEGER_TYPE
9177 && TREE_CODE (t2
->type
) == INTEGER_TYPE
9178 && (TYPE_PRECISION (t1
->type
)
9179 == TYPE_PRECISION (t2
->type
))
9180 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
9181 || (TREE_CODE (next_conversion (t1
)->type
)
9184 tree type
= next_conversion (t1
)->type
;
9186 struct z_candidate
*w
, *l
;
9188 type1
= t1
->type
, type2
= t2
->type
,
9189 w
= cand1
, l
= cand2
;
9191 type1
= t2
->type
, type2
= t1
->type
,
9192 w
= cand2
, l
= cand1
;
9196 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
9197 type
, type1
, type2
);
9198 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
9204 if (winner
&& comp
!= winner
)
9213 /* warn about confusing overload resolution for user-defined conversions,
9214 either between a constructor and a conversion op, or between two
9216 if ((complain
& tf_warning
)
9217 && winner
&& warn_conversion
&& cand1
->second_conv
9218 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
9219 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
9221 struct z_candidate
*w
, *l
;
9222 bool give_warning
= false;
9225 w
= cand1
, l
= cand2
;
9227 w
= cand2
, l
= cand1
;
9229 /* We don't want to complain about `X::operator T1 ()'
9230 beating `X::operator T2 () const', when T2 is a no less
9231 cv-qualified version of T1. */
9232 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
9233 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
9235 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
9236 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
9238 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
9243 if (!comp_ptr_ttypes (t
, f
))
9244 give_warning
= true;
9247 give_warning
= true;
9253 tree source
= source_type (w
->convs
[0]);
9254 if (! DECL_CONSTRUCTOR_P (w
->fn
))
9255 source
= TREE_TYPE (source
);
9256 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
9257 && warning (OPT_Wconversion
, " for conversion from %qT to %qT",
9258 source
, w
->second_conv
->type
))
9260 inform (input_location
, " because conversion sequence for the argument is better");
9270 /* DR 495 moved this tiebreaker above the template ones. */
9272 the context is an initialization by user-defined conversion (see
9273 _dcl.init_ and _over.match.user_) and the standard conversion
9274 sequence from the return type of F1 to the destination type (i.e.,
9275 the type of the entity being initialized) is a better conversion
9276 sequence than the standard conversion sequence from the return type
9277 of F2 to the destination type. */
9279 if (cand1
->second_conv
)
9281 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
9287 F1 is a non-template function and F2 is a template function
9290 if (!cand1
->template_decl
&& cand2
->template_decl
)
9292 else if (cand1
->template_decl
&& !cand2
->template_decl
)
9296 F1 and F2 are template functions and the function template for F1 is
9297 more specialized than the template for F2 according to the partial
9300 if (cand1
->template_decl
&& cand2
->template_decl
)
9302 winner
= more_specialized_fn
9303 (TI_TEMPLATE (cand1
->template_decl
),
9304 TI_TEMPLATE (cand2
->template_decl
),
9305 /* [temp.func.order]: The presence of unused ellipsis and default
9306 arguments has no effect on the partial ordering of function
9307 templates. add_function_candidate() will not have
9308 counted the "this" argument for constructors. */
9309 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
9315 // or, if not that, F1 is more constrained than F2.
9316 if (flag_concepts
&& DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
))
9318 winner
= more_constrained (cand1
->fn
, cand2
->fn
);
9323 /* Check whether we can discard a builtin candidate, either because we
9324 have two identical ones or matching builtin and non-builtin candidates.
9326 (Pedantically in the latter case the builtin which matched the user
9327 function should not be added to the overload set, but we spot it here.
9330 ... the builtin candidates include ...
9331 - do not have the same parameter type list as any non-template
9332 non-member candidate. */
9334 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
9336 for (i
= 0; i
< len
; ++i
)
9337 if (!same_type_p (cand1
->convs
[i
]->type
,
9338 cand2
->convs
[i
]->type
))
9340 if (i
== cand1
->num_convs
)
9342 if (cand1
->fn
== cand2
->fn
)
9343 /* Two built-in candidates; arbitrarily pick one. */
9345 else if (identifier_p (cand1
->fn
))
9346 /* cand1 is built-in; prefer cand2. */
9349 /* cand2 is built-in; prefer cand1. */
9354 /* For candidates of a multi-versioned function, make the version with
9355 the highest priority win. This version will be checked for dispatching
9356 first. If this version can be inlined into the caller, the front-end
9357 will simply make a direct call to this function. */
9359 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
9360 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
9361 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
9362 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
9364 tree f1
= TREE_TYPE (cand1
->fn
);
9365 tree f2
= TREE_TYPE (cand2
->fn
);
9366 tree p1
= TYPE_ARG_TYPES (f1
);
9367 tree p2
= TYPE_ARG_TYPES (f2
);
9369 /* Check if cand1->fn and cand2->fn are versions of the same function. It
9370 is possible that cand1->fn and cand2->fn are function versions but of
9371 different functions. Check types to see if they are versions of the same
9373 if (compparms (p1
, p2
)
9374 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
9376 /* Always make the version with the higher priority, more
9377 specialized, win. */
9378 gcc_assert (targetm
.compare_version_priority
);
9379 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
9386 /* If the two function declarations represent the same function (this can
9387 happen with declarations in multiple scopes and arg-dependent lookup),
9388 arbitrarily choose one. But first make sure the default args we're
9390 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
9391 && equal_functions (cand1
->fn
, cand2
->fn
))
9393 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
9394 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
9396 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
9398 for (i
= 0; i
< len
; ++i
)
9400 /* Don't crash if the fn is variadic. */
9403 parms1
= TREE_CHAIN (parms1
);
9404 parms2
= TREE_CHAIN (parms2
);
9408 parms1
= TREE_CHAIN (parms1
);
9410 parms2
= TREE_CHAIN (parms2
);
9414 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
9415 TREE_PURPOSE (parms2
)))
9419 if (complain
& tf_error
)
9421 if (permerror (input_location
,
9422 "default argument mismatch in "
9423 "overload resolution"))
9425 inform (input_location
,
9426 " candidate 1: %q+#F", cand1
->fn
);
9427 inform (input_location
,
9428 " candidate 2: %q+#F", cand2
->fn
);
9435 add_warning (cand1
, cand2
);
9438 parms1
= TREE_CHAIN (parms1
);
9439 parms2
= TREE_CHAIN (parms2
);
9447 /* Extension: If the worst conversion for one candidate is worse than the
9448 worst conversion for the other, take the first. */
9449 if (!pedantic
&& (complain
& tf_warning_or_error
))
9451 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
9452 struct z_candidate
*w
= 0, *l
= 0;
9454 for (i
= 0; i
< len
; ++i
)
9456 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
9457 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
9458 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
9459 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
9462 winner
= 1, w
= cand1
, l
= cand2
;
9464 winner
= -1, w
= cand2
, l
= cand1
;
9467 /* Don't choose a deleted function over ambiguity. */
9468 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
9472 pedwarn (input_location
, 0,
9473 "ISO C++ says that these are ambiguous, even "
9474 "though the worst conversion for the first is better than "
9475 "the worst conversion for the second:");
9476 print_z_candidate (input_location
, _("candidate 1:"), w
);
9477 print_z_candidate (input_location
, _("candidate 2:"), l
);
9485 gcc_assert (!winner
);
9489 /* Given a list of candidates for overloading, find the best one, if any.
9490 This algorithm has a worst case of O(2n) (winner is last), and a best
9491 case of O(n/2) (totally ambiguous); much better than a sorting
9494 static struct z_candidate
*
9495 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
9497 struct z_candidate
*champ
= candidates
, *challenger
;
9499 int champ_compared_to_predecessor
= 0;
9501 /* Walk through the list once, comparing each current champ to the next
9502 candidate, knocking out a candidate or two with each comparison. */
9504 for (challenger
= champ
->next
; challenger
; )
9506 fate
= joust (champ
, challenger
, 0, complain
);
9508 challenger
= challenger
->next
;
9513 champ
= challenger
->next
;
9516 champ_compared_to_predecessor
= 0;
9521 champ_compared_to_predecessor
= 1;
9524 challenger
= champ
->next
;
9528 /* Make sure the champ is better than all the candidates it hasn't yet
9529 been compared to. */
9531 for (challenger
= candidates
;
9533 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
9534 challenger
= challenger
->next
)
9536 fate
= joust (champ
, challenger
, 0, complain
);
9544 /* Returns nonzero if things of type FROM can be converted to TO. */
9547 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
9549 tree arg
= NULL_TREE
;
9550 /* implicit_conversion only considers user-defined conversions
9551 if it has an expression for the call argument list. */
9552 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
9553 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
9554 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
9557 /* Returns nonzero if things of type FROM can be converted to TO with a
9558 standard conversion. */
9561 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
9563 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
9566 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
9569 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
9570 tsubst_flags_t complain
)
9576 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9577 p
= conversion_obstack_alloc (0);
9578 /* We want to discard any access checks done for this test,
9579 as we might not be in the appropriate access context and
9580 we'll do the check again when we actually perform the
9582 push_deferring_access_checks (dk_deferred
);
9584 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
9586 ok_p
= (t
&& !t
->bad_p
);
9588 /* Discard the access checks now. */
9589 pop_deferring_access_checks ();
9590 /* Free all the conversions we allocated. */
9591 obstack_free (&conversion_obstack
, p
);
9596 /* Like can_convert_arg, but allows dubious conversions as well. */
9599 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
9600 tsubst_flags_t complain
)
9605 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9606 p
= conversion_obstack_alloc (0);
9607 /* Try to perform the conversion. */
9608 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
9610 /* Free all the conversions we allocated. */
9611 obstack_free (&conversion_obstack
, p
);
9616 /* Convert EXPR to TYPE. Return the converted expression.
9618 Note that we allow bad conversions here because by the time we get to
9619 this point we are committed to doing the conversion. If we end up
9620 doing a bad conversion, convert_like will complain. */
9623 perform_implicit_conversion_flags (tree type
, tree expr
,
9624 tsubst_flags_t complain
, int flags
)
9628 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
9630 if (error_operand_p (expr
))
9631 return error_mark_node
;
9633 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9634 p
= conversion_obstack_alloc (0);
9636 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
9642 if (complain
& tf_error
)
9644 /* If expr has unknown type, then it is an overloaded function.
9645 Call instantiate_type to get good error messages. */
9646 if (TREE_TYPE (expr
) == unknown_type_node
)
9647 instantiate_type (type
, expr
, complain
);
9648 else if (invalid_nonstatic_memfn_p (loc
, expr
, complain
))
9649 /* We gave an error. */;
9651 error_at (loc
, "could not convert %qE from %qT to %qT", expr
,
9652 TREE_TYPE (expr
), type
);
9654 expr
= error_mark_node
;
9656 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
9658 /* In a template, we are only concerned about determining the
9659 type of non-dependent expressions, so we do not have to
9660 perform the actual conversion. But for initializers, we
9661 need to be able to perform it at instantiation
9662 (or instantiate_non_dependent_expr) time. */
9663 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
9664 if (!(flags
& LOOKUP_ONLYCONVERTING
))
9665 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
9668 expr
= convert_like (conv
, expr
, complain
);
9670 /* Free all the conversions we allocated. */
9671 obstack_free (&conversion_obstack
, p
);
9677 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
9679 return perform_implicit_conversion_flags (type
, expr
, complain
,
9683 /* Convert EXPR to TYPE (as a direct-initialization) if that is
9684 permitted. If the conversion is valid, the converted expression is
9685 returned. Otherwise, NULL_TREE is returned, except in the case
9686 that TYPE is a class type; in that case, an error is issued. If
9687 C_CAST_P is true, then this direct-initialization is taking
9688 place as part of a static_cast being attempted as part of a C-style
9692 perform_direct_initialization_if_possible (tree type
,
9695 tsubst_flags_t complain
)
9700 if (type
== error_mark_node
|| error_operand_p (expr
))
9701 return error_mark_node
;
9704 If the destination type is a (possibly cv-qualified) class type:
9706 -- If the initialization is direct-initialization ...,
9707 constructors are considered. ... If no constructor applies, or
9708 the overload resolution is ambiguous, the initialization is
9710 if (CLASS_TYPE_P (type
))
9712 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
9713 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
9714 &args
, type
, LOOKUP_NORMAL
, complain
);
9715 release_tree_vector (args
);
9716 return build_cplus_new (type
, expr
, complain
);
9719 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9720 p
= conversion_obstack_alloc (0);
9722 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
9724 LOOKUP_NORMAL
, complain
);
9725 if (!conv
|| conv
->bad_p
)
9728 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0, 0,
9729 /*issue_conversion_warnings=*/false,
9733 /* Free all the conversions we allocated. */
9734 obstack_free (&conversion_obstack
, p
);
9739 /* When initializing a reference that lasts longer than a full-expression,
9740 this special rule applies:
9744 The temporary to which the reference is bound or the temporary
9745 that is the complete object to which the reference is bound
9746 persists for the lifetime of the reference.
9748 The temporaries created during the evaluation of the expression
9749 initializing the reference, except the temporary to which the
9750 reference is bound, are destroyed at the end of the
9751 full-expression in which they are created.
9753 In that case, we store the converted expression into a new
9754 VAR_DECL in a new scope.
9756 However, we want to be careful not to create temporaries when
9757 they are not required. For example, given:
9760 struct D : public B {};
9764 there is no need to copy the return value from "f"; we can just
9765 extend its lifetime. Similarly, given:
9768 struct T { operator S(); };
9772 we can extend the lifetime of the return value of the conversion
9775 The next several functions are involved in this lifetime extension. */
9777 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
9778 reference is being bound to a temporary. Create and return a new
9779 VAR_DECL with the indicated TYPE; this variable will store the value to
9780 which the reference is bound. */
9783 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
9787 /* Create the variable. */
9788 var
= create_temporary_var (type
);
9790 /* Register the variable. */
9792 && (TREE_STATIC (decl
) || CP_DECL_THREAD_LOCAL_P (decl
)))
9794 /* Namespace-scope or local static; give it a mangled name. */
9795 /* FIXME share comdat with decl? */
9798 TREE_STATIC (var
) = TREE_STATIC (decl
);
9799 CP_DECL_THREAD_LOCAL_P (var
) = CP_DECL_THREAD_LOCAL_P (decl
);
9800 set_decl_tls_model (var
, DECL_TLS_MODEL (decl
));
9801 name
= mangle_ref_init_variable (decl
);
9802 DECL_NAME (var
) = name
;
9803 SET_DECL_ASSEMBLER_NAME (var
, name
);
9804 var
= pushdecl_top_level (var
);
9807 /* Create a new cleanup level if necessary. */
9808 maybe_push_cleanup_level (type
);
9813 /* EXPR is the initializer for a variable DECL of reference or
9814 std::initializer_list type. Create, push and return a new VAR_DECL
9815 for the initializer so that it will live as long as DECL. Any
9816 cleanup for the new variable is returned through CLEANUP, and the
9817 code to initialize the new variable is returned through INITP. */
9820 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
9827 /* Create the temporary variable. */
9828 type
= TREE_TYPE (expr
);
9829 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
9830 layout_decl (var
, 0);
9831 /* If the rvalue is the result of a function call it will be
9832 a TARGET_EXPR. If it is some other construct (such as a
9833 member access expression where the underlying object is
9834 itself the result of a function call), turn it into a
9835 TARGET_EXPR here. It is important that EXPR be a
9836 TARGET_EXPR below since otherwise the INIT_EXPR will
9837 attempt to make a bitwise copy of EXPR to initialize
9839 if (TREE_CODE (expr
) != TARGET_EXPR
)
9840 expr
= get_target_expr (expr
);
9842 if (TREE_CODE (decl
) == FIELD_DECL
9843 && extra_warnings
&& !TREE_NO_WARNING (decl
))
9845 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
9846 "until the constructor exits", decl
);
9847 TREE_NO_WARNING (decl
) = true;
9850 /* Recursively extend temps in this initializer. */
9851 TARGET_EXPR_INITIAL (expr
)
9852 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
9854 /* Any reference temp has a non-trivial initializer. */
9855 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
9857 /* If the initializer is constant, put it in DECL_INITIAL so we get
9858 static initialization and use in constant expressions. */
9859 init
= maybe_constant_init (expr
);
9860 if (TREE_CONSTANT (init
))
9862 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
9864 /* 5.19 says that a constant expression can include an
9865 lvalue-rvalue conversion applied to "a glvalue of literal type
9866 that refers to a non-volatile temporary object initialized
9867 with a constant expression". Rather than try to communicate
9868 that this VAR_DECL is a temporary, just mark it constexpr.
9870 Currently this is only useful for initializer_list temporaries,
9871 since reference vars can't appear in constant expressions. */
9872 DECL_DECLARED_CONSTEXPR_P (var
) = true;
9873 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
9874 TREE_CONSTANT (var
) = true;
9876 DECL_INITIAL (var
) = init
;
9880 /* Create the INIT_EXPR that will initialize the temporary
9882 init
= split_nonconstant_init (var
, expr
);
9883 if (at_function_scope_p ())
9885 add_decl_expr (var
);
9887 if (TREE_STATIC (var
))
9888 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
9891 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
9893 vec_safe_push (*cleanups
, cleanup
);
9896 /* We must be careful to destroy the temporary only
9897 after its initialization has taken place. If the
9898 initialization throws an exception, then the
9899 destructor should not be run. We cannot simply
9900 transform INIT into something like:
9902 (INIT, ({ CLEANUP_STMT; }))
9904 because emit_local_var always treats the
9905 initializer as a full-expression. Thus, the
9906 destructor would run too early; it would run at the
9907 end of initializing the reference variable, rather
9908 than at the end of the block enclosing the
9911 The solution is to pass back a cleanup expression
9912 which the caller is responsible for attaching to
9913 the statement tree. */
9917 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
9918 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
9920 if (CP_DECL_THREAD_LOCAL_P (var
))
9921 tls_aggregates
= tree_cons (NULL_TREE
, var
,
9924 static_aggregates
= tree_cons (NULL_TREE
, var
,
9928 /* Check whether the dtor is callable. */
9929 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
9931 /* Avoid -Wunused-variable warning (c++/38958). */
9932 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
9934 TREE_USED (decl
) = DECL_READ_P (decl
) = true;
9940 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
9941 initializing a variable of that TYPE. */
9944 initialize_reference (tree type
, tree expr
,
9945 int flags
, tsubst_flags_t complain
)
9949 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
9951 if (type
== error_mark_node
|| error_operand_p (expr
))
9952 return error_mark_node
;
9954 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9955 p
= conversion_obstack_alloc (0);
9957 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
9959 if (!conv
|| conv
->bad_p
)
9961 if (complain
& tf_error
)
9964 convert_like (conv
, expr
, complain
);
9965 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
9966 && !TYPE_REF_IS_RVALUE (type
)
9967 && !real_lvalue_p (expr
))
9968 error_at (loc
, "invalid initialization of non-const reference of "
9969 "type %qT from an rvalue of type %qT",
9970 type
, TREE_TYPE (expr
));
9972 error_at (loc
, "invalid initialization of reference of type "
9973 "%qT from expression of type %qT", type
,
9976 return error_mark_node
;
9979 if (conv
->kind
== ck_ref_bind
)
9980 /* Perform the conversion. */
9981 expr
= convert_like (conv
, expr
, complain
);
9982 else if (conv
->kind
== ck_ambig
)
9983 /* We gave an error in build_user_type_conversion_1. */
9984 expr
= error_mark_node
;
9988 /* Free all the conversions we allocated. */
9989 obstack_free (&conversion_obstack
, p
);
9994 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
9995 which is bound either to a reference or a std::initializer_list. */
9998 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
10003 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
10005 TREE_OPERAND (sub
, 1)
10006 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
10009 if (TREE_CODE (sub
) != ADDR_EXPR
)
10011 /* Deal with binding to a subobject. */
10012 for (p
= &TREE_OPERAND (sub
, 0); TREE_CODE (*p
) == COMPONENT_REF
; )
10013 p
= &TREE_OPERAND (*p
, 0);
10014 if (TREE_CODE (*p
) == TARGET_EXPR
)
10016 tree subinit
= NULL_TREE
;
10017 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
10018 recompute_tree_invariant_for_addr_expr (sub
);
10020 init
= fold_convert (TREE_TYPE (init
), sub
);
10022 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
10027 /* INIT is part of the initializer for DECL. If there are any
10028 reference or initializer lists being initialized, extend their
10029 lifetime to match that of DECL. */
10032 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
10034 tree type
= TREE_TYPE (init
);
10035 if (processing_template_decl
)
10037 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10038 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
10039 else if (is_std_init_list (type
))
10041 /* The temporary array underlying a std::initializer_list
10042 is handled like a reference temporary. */
10044 if (TREE_CODE (ctor
) == TARGET_EXPR
)
10045 ctor
= TARGET_EXPR_INITIAL (ctor
);
10046 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
10048 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
10049 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
10050 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
10053 else if (TREE_CODE (init
) == CONSTRUCTOR
)
10056 constructor_elt
*p
;
10057 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (init
);
10058 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
10059 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
10065 /* Returns true iff an initializer for TYPE could contain temporaries that
10066 need to be extended because they are bound to references or
10067 std::initializer_list. */
10070 type_has_extended_temps (tree type
)
10072 type
= strip_array_types (type
);
10073 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10075 if (CLASS_TYPE_P (type
))
10077 if (is_std_init_list (type
))
10079 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
10080 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
10081 if (type_has_extended_temps (TREE_TYPE (f
)))
10087 /* Returns true iff TYPE is some variant of std::initializer_list. */
10090 is_std_init_list (tree type
)
10092 /* Look through typedefs. */
10093 if (!TYPE_P (type
))
10095 if (cxx_dialect
== cxx98
)
10097 type
= TYPE_MAIN_VARIANT (type
);
10098 return (CLASS_TYPE_P (type
)
10099 && CP_TYPE_CONTEXT (type
) == std_node
10100 && strcmp (TYPE_NAME_STRING (type
), "initializer_list") == 0);
10103 /* Returns true iff DECL is a list constructor: i.e. a constructor which
10104 will accept an argument list of a single std::initializer_list<T>. */
10107 is_list_ctor (tree decl
)
10109 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
10112 if (!args
|| args
== void_list_node
)
10115 arg
= non_reference (TREE_VALUE (args
));
10116 if (!is_std_init_list (arg
))
10119 args
= TREE_CHAIN (args
);
10121 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
10122 /* There are more non-defaulted parms. */
10128 #include "gt-cp-call.h"