1 /* Functions related to invoking methods and overloaded functions.
2 Copyright (C) 1987-2014 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"
30 #include "stor-layout.h"
31 #include "trans-mem.h"
32 #include "stringpool.h"
36 #include "diagnostic-core.h"
40 #include "langhooks.h"
41 #include "c-family/c-objc.h"
46 /* The various kinds of conversion. */
48 typedef enum conversion_kind
{
64 /* The rank of the conversion. Order of the enumerals matters; better
65 conversions should come earlier in the list. */
67 typedef enum conversion_rank
{
78 /* An implicit conversion sequence, in the sense of [over.best.ics].
79 The first conversion to be performed is at the end of the chain.
80 That conversion is always a cr_identity conversion. */
82 typedef struct conversion conversion
;
84 /* The kind of conversion represented by this step. */
86 /* The rank of this conversion. */
88 BOOL_BITFIELD user_conv_p
: 1;
89 BOOL_BITFIELD ellipsis_p
: 1;
90 BOOL_BITFIELD this_p
: 1;
91 /* True if this conversion would be permitted with a bending of
92 language standards, e.g. disregarding pointer qualifiers or
93 converting integers to pointers. */
94 BOOL_BITFIELD bad_p
: 1;
95 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
96 temporary should be created to hold the result of the
98 BOOL_BITFIELD need_temporary_p
: 1;
99 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
100 from a pointer-to-derived to pointer-to-base is being performed. */
101 BOOL_BITFIELD base_p
: 1;
102 /* If KIND is ck_ref_bind, true when either an lvalue reference is
103 being bound to an lvalue expression or an rvalue reference is
104 being bound to an rvalue expression. If KIND is ck_rvalue,
105 true when we should treat an lvalue as an rvalue (12.8p33). If
106 KIND is ck_base, always false. */
107 BOOL_BITFIELD rvaluedness_matches_p
: 1;
108 BOOL_BITFIELD check_narrowing
: 1;
109 /* The type of the expression resulting from the conversion. */
112 /* The next conversion in the chain. Since the conversions are
113 arranged from outermost to innermost, the NEXT conversion will
114 actually be performed before this conversion. This variant is
115 used only when KIND is neither ck_identity, ck_ambig nor
116 ck_list. Please use the next_conversion function instead
117 of using this field directly. */
119 /* The expression at the beginning of the conversion chain. This
120 variant is used only if KIND is ck_identity or ck_ambig. */
122 /* The array of conversions for an initializer_list, so this
123 variant is used only when KIN D is ck_list. */
126 /* The function candidate corresponding to this conversion
127 sequence. This field is only used if KIND is ck_user. */
128 struct z_candidate
*cand
;
131 #define CONVERSION_RANK(NODE) \
132 ((NODE)->bad_p ? cr_bad \
133 : (NODE)->ellipsis_p ? cr_ellipsis \
134 : (NODE)->user_conv_p ? cr_user \
137 #define BAD_CONVERSION_RANK(NODE) \
138 ((NODE)->ellipsis_p ? cr_ellipsis \
139 : (NODE)->user_conv_p ? cr_user \
142 static struct obstack conversion_obstack
;
143 static bool conversion_obstack_initialized
;
144 struct rejection_reason
;
146 static struct z_candidate
* tourney (struct z_candidate
*, tsubst_flags_t
);
147 static int equal_functions (tree
, tree
);
148 static int joust (struct z_candidate
*, struct z_candidate
*, bool,
150 static int compare_ics (conversion
*, conversion
*);
151 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
152 static tree
build_java_interface_fn_ref (tree
, tree
);
153 #define convert_like(CONV, EXPR, COMPLAIN) \
154 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
155 /*issue_conversion_warnings=*/true, \
156 /*c_cast_p=*/false, (COMPLAIN))
157 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
158 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
159 /*issue_conversion_warnings=*/true, \
160 /*c_cast_p=*/false, (COMPLAIN))
161 static tree
convert_like_real (conversion
*, tree
, tree
, int, int, bool,
162 bool, tsubst_flags_t
);
163 static void op_error (location_t
, enum tree_code
, enum tree_code
, tree
,
165 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int,
167 static void print_z_candidate (location_t
, const char *, struct z_candidate
*);
168 static void print_z_candidates (location_t
, struct z_candidate
*);
169 static tree
build_this (tree
);
170 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
171 static bool any_strictly_viable (struct z_candidate
*);
172 static struct z_candidate
*add_template_candidate
173 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
174 tree
, tree
, tree
, int, unification_kind_t
, tsubst_flags_t
);
175 static struct z_candidate
*add_template_candidate_real
176 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
177 tree
, tree
, tree
, int, tree
, unification_kind_t
, tsubst_flags_t
);
178 static struct z_candidate
*add_template_conv_candidate
179 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
180 tree
, tree
, tree
, tsubst_flags_t
);
181 static void add_builtin_candidates
182 (struct z_candidate
**, enum tree_code
, enum tree_code
,
183 tree
, tree
*, int, tsubst_flags_t
);
184 static void add_builtin_candidate
185 (struct z_candidate
**, enum tree_code
, enum tree_code
,
186 tree
, tree
, tree
, tree
*, tree
*, int, tsubst_flags_t
);
187 static bool is_complete (tree
);
188 static void build_builtin_candidate
189 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
190 int, tsubst_flags_t
);
191 static struct z_candidate
*add_conv_candidate
192 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
193 tree
, tsubst_flags_t
);
194 static struct z_candidate
*add_function_candidate
195 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
196 tree
, int, tsubst_flags_t
);
197 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int,
199 static conversion
*standard_conversion (tree
, tree
, tree
, bool, int);
200 static conversion
*reference_binding (tree
, tree
, tree
, bool, int,
202 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
203 static conversion
*build_list_conv (tree
, tree
, int, tsubst_flags_t
);
204 static conversion
*next_conversion (conversion
*);
205 static bool is_subseq (conversion
*, conversion
*);
206 static conversion
*maybe_handle_ref_bind (conversion
**);
207 static void maybe_handle_implicit_object (conversion
**);
208 static struct z_candidate
*add_candidate
209 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, size_t,
210 conversion
**, tree
, tree
, int, struct rejection_reason
*, int);
211 static tree
source_type (conversion
*);
212 static void add_warning (struct z_candidate
*, struct z_candidate
*);
213 static bool reference_compatible_p (tree
, tree
);
214 static conversion
*direct_reference_binding (tree
, conversion
*);
215 static bool promoted_arithmetic_type_p (tree
);
216 static conversion
*conditional_conversion (tree
, tree
, tsubst_flags_t
);
217 static char *name_as_c_string (tree
, tree
, bool *);
218 static tree
prep_operand (tree
);
219 static void add_candidates (tree
, tree
, const vec
<tree
, va_gc
> *, tree
, tree
,
220 bool, tree
, tree
, int, struct z_candidate
**,
222 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
223 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
225 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
226 NAME can take many forms... */
229 check_dtor_name (tree basetype
, tree name
)
231 /* Just accept something we've already complained about. */
232 if (name
== error_mark_node
)
235 if (TREE_CODE (name
) == TYPE_DECL
)
236 name
= TREE_TYPE (name
);
237 else if (TYPE_P (name
))
239 else if (identifier_p (name
))
241 if ((MAYBE_CLASS_TYPE_P (basetype
)
242 && name
== constructor_name (basetype
))
243 || (TREE_CODE (basetype
) == ENUMERAL_TYPE
244 && name
== TYPE_IDENTIFIER (basetype
)))
247 name
= get_type_value (name
);
253 template <class T> struct S { ~S(); };
257 NAME will be a class template. */
258 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
262 if (!name
|| name
== error_mark_node
)
264 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
267 /* We want the address of a function or method. We avoid creating a
268 pointer-to-member function. */
271 build_addr_func (tree function
, tsubst_flags_t complain
)
273 tree type
= TREE_TYPE (function
);
275 /* We have to do these by hand to avoid real pointer to member
277 if (TREE_CODE (type
) == METHOD_TYPE
)
279 if (TREE_CODE (function
) == OFFSET_REF
)
281 tree object
= build_address (TREE_OPERAND (function
, 0));
282 return get_member_function_from_ptrfunc (&object
,
283 TREE_OPERAND (function
, 1),
286 function
= build_address (function
);
289 function
= decay_conversion (function
, complain
);
294 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
295 POINTER_TYPE to those. Note, pointer to member function types
296 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
297 two variants. build_call_a is the primitive taking an array of
298 arguments, while build_call_n is a wrapper that handles varargs. */
301 build_call_n (tree function
, int n
, ...)
304 return build_call_a (function
, 0, NULL
);
307 tree
*argarray
= XALLOCAVEC (tree
, n
);
312 for (i
= 0; i
< n
; i
++)
313 argarray
[i
] = va_arg (ap
, tree
);
315 return build_call_a (function
, n
, argarray
);
319 /* Update various flags in cfun and the call itself based on what is being
320 called. Split out of build_call_a so that bot_manip can use it too. */
323 set_flags_from_callee (tree call
)
326 tree decl
= get_callee_fndecl (call
);
328 /* We check both the decl and the type; a function may be known not to
329 throw without being declared throw(). */
330 nothrow
= ((decl
&& TREE_NOTHROW (decl
))
331 || TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call
)))));
333 if (!nothrow
&& at_function_scope_p () && cfun
&& cp_function_chain
)
334 cp_function_chain
->can_throw
= 1;
336 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
337 current_function_returns_abnormally
= 1;
339 TREE_NOTHROW (call
) = nothrow
;
343 build_call_a (tree function
, int n
, tree
*argarray
)
350 function
= build_addr_func (function
, tf_warning_or_error
);
352 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
353 fntype
= TREE_TYPE (TREE_TYPE (function
));
354 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
355 || TREE_CODE (fntype
) == METHOD_TYPE
);
356 result_type
= TREE_TYPE (fntype
);
357 /* An rvalue has no cv-qualifiers. */
358 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
359 result_type
= cv_unqualified (result_type
);
361 function
= build_call_array_loc (input_location
,
362 result_type
, function
, n
, argarray
);
363 set_flags_from_callee (function
);
365 decl
= get_callee_fndecl (function
);
367 if (decl
&& !TREE_USED (decl
))
369 /* We invoke build_call directly for several library
370 functions. These may have been declared normally if
371 we're building libgcc, so we can't just check
373 gcc_assert (DECL_ARTIFICIAL (decl
)
374 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
379 if (decl
&& TREE_DEPRECATED (decl
))
380 warn_deprecated_use (decl
, NULL_TREE
);
381 require_complete_eh_spec_types (fntype
, decl
);
383 TREE_HAS_CONSTRUCTOR (function
) = (decl
&& DECL_CONSTRUCTOR_P (decl
));
385 /* Don't pass empty class objects by value. This is useful
386 for tags in STL, which are used to control overload resolution.
387 We don't need to handle other cases of copying empty classes. */
388 if (! decl
|| ! DECL_BUILT_IN (decl
))
389 for (i
= 0; i
< n
; i
++)
391 tree arg
= CALL_EXPR_ARG (function
, i
);
392 if (is_empty_class (TREE_TYPE (arg
))
393 && ! TREE_ADDRESSABLE (TREE_TYPE (arg
)))
395 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (arg
));
396 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (t
), arg
, t
);
397 CALL_EXPR_ARG (function
, i
) = arg
;
404 /* Build something of the form ptr->method (args)
405 or object.method (args). This can also build
406 calls to constructors, and find friends.
408 Member functions always take their class variable
411 INSTANCE is a class instance.
413 NAME is the name of the method desired, usually an IDENTIFIER_NODE.
415 PARMS help to figure out what that NAME really refers to.
417 BASETYPE_PATH, if non-NULL, contains a chain from the type of INSTANCE
418 down to the real instance type to use for access checking. We need this
419 information to get protected accesses correct.
421 FLAGS is the logical disjunction of zero or more LOOKUP_
422 flags. See cp-tree.h for more info.
424 If this is all OK, calls build_function_call with the resolved
427 This function must also handle being called to perform
428 initialization, promotion/coercion of arguments, and
429 instantiation of default parameters.
431 Note that NAME may refer to an instance variable name. If
432 `operator()()' is defined for the type of that field, then we return
435 /* New overloading code. */
437 typedef struct z_candidate z_candidate
;
439 typedef struct candidate_warning candidate_warning
;
440 struct candidate_warning
{
442 candidate_warning
*next
;
445 /* Information for providing diagnostics about why overloading failed. */
447 enum rejection_reason_code
{
450 rr_explicit_conversion
,
451 rr_template_conversion
,
453 rr_bad_arg_conversion
,
454 rr_template_unification
,
456 rr_constraint_failure
459 struct conversion_info
{
460 /* The index of the argument, 0-based. */
462 /* The actual argument or its type. */
464 /* The type of the parameter. */
468 struct rejection_reason
{
469 enum rejection_reason_code code
;
471 /* Information about an arity mismatch. */
473 /* The expected number of arguments. */
475 /* The actual number of arguments in the call. */
477 /* Whether the call was a varargs call. */
480 /* Information about an argument conversion mismatch. */
481 struct conversion_info conversion
;
482 /* Same, but for bad argument conversions. */
483 struct conversion_info bad_conversion
;
484 /* Information about template unification failures. These are the
485 parameters passed to fn_type_unification. */
493 unification_kind_t strict
;
495 } template_unification
;
496 /* Information about template instantiation failures. These are the
497 parameters passed to instantiate_template. */
501 } template_instantiation
;
506 /* The FUNCTION_DECL that will be called if this candidate is
507 selected by overload resolution. */
509 /* If not NULL_TREE, the first argument to use when calling this
512 /* The rest of the arguments to use when calling this function. If
513 there are no further arguments this may be NULL or it may be an
515 const vec
<tree
, va_gc
> *args
;
516 /* The implicit conversion sequences for each of the arguments to
519 /* The number of implicit conversion sequences. */
521 /* If FN is a user-defined conversion, the standard conversion
522 sequence from the type returned by FN to the desired destination
524 conversion
*second_conv
;
525 struct rejection_reason
*reason
;
526 /* If FN is a member function, the binfo indicating the path used to
527 qualify the name of FN at the call site. This path is used to
528 determine whether or not FN is accessible if it is selected by
529 overload resolution. The DECL_CONTEXT of FN will always be a
530 (possibly improper) base of this binfo. */
532 /* If FN is a non-static member function, the binfo indicating the
533 subobject to which the `this' pointer should be converted if FN
534 is selected by overload resolution. The type pointed to by
535 the `this' pointer must correspond to the most derived class
536 indicated by the CONVERSION_PATH. */
537 tree conversion_path
;
540 candidate_warning
*warnings
;
544 /* The flags active in add_candidate. */
548 /* Returns true iff T is a null pointer constant in the sense of
552 null_ptr_cst_p (tree t
)
556 A null pointer constant is an integral constant expression
557 (_expr.const_) rvalue of integer type that evaluates to zero or
558 an rvalue of type std::nullptr_t. */
559 if (NULLPTR_TYPE_P (TREE_TYPE (t
)))
561 if (CP_INTEGRAL_TYPE_P (TREE_TYPE (t
)))
563 /* Core issue 903 says only literal 0 is a null pointer constant. */
564 if (cxx_dialect
< cxx11
)
565 t
= maybe_constant_value (fold_non_dependent_expr_sfinae (t
, tf_none
));
567 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
573 /* Returns true iff T is a null member pointer value (4.11). */
576 null_member_pointer_value_p (tree t
)
578 tree type
= TREE_TYPE (t
);
581 else if (TYPE_PTRMEMFUNC_P (type
))
582 return (TREE_CODE (t
) == CONSTRUCTOR
583 && integer_zerop (CONSTRUCTOR_ELT (t
, 0)->value
));
584 else if (TYPE_PTRDATAMEM_P (type
))
585 return integer_all_onesp (t
);
590 /* Returns nonzero if PARMLIST consists of only default parms,
591 ellipsis, and/or undeduced parameter packs. */
594 sufficient_parms_p (const_tree parmlist
)
596 for (; parmlist
&& parmlist
!= void_list_node
;
597 parmlist
= TREE_CHAIN (parmlist
))
598 if (!TREE_PURPOSE (parmlist
)
599 && !PACK_EXPANSION_P (TREE_VALUE (parmlist
)))
604 /* Allocate N bytes of memory from the conversion obstack. The memory
605 is zeroed before being returned. */
608 conversion_obstack_alloc (size_t n
)
611 if (!conversion_obstack_initialized
)
613 gcc_obstack_init (&conversion_obstack
);
614 conversion_obstack_initialized
= true;
616 p
= obstack_alloc (&conversion_obstack
, n
);
621 /* Allocate rejection reasons. */
623 static struct rejection_reason
*
624 alloc_rejection (enum rejection_reason_code code
)
626 struct rejection_reason
*p
;
627 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
632 static struct rejection_reason
*
633 arity_rejection (tree first_arg
, int expected
, int actual
)
635 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
636 int adjust
= first_arg
!= NULL_TREE
;
637 r
->u
.arity
.expected
= expected
- adjust
;
638 r
->u
.arity
.actual
= actual
- adjust
;
642 static struct rejection_reason
*
643 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
645 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
646 int adjust
= first_arg
!= NULL_TREE
;
647 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
648 r
->u
.conversion
.from
= from
;
649 r
->u
.conversion
.to_type
= to
;
653 static struct rejection_reason
*
654 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
656 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
657 int adjust
= first_arg
!= NULL_TREE
;
658 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
659 r
->u
.bad_conversion
.from
= from
;
660 r
->u
.bad_conversion
.to_type
= to
;
664 static struct rejection_reason
*
665 explicit_conversion_rejection (tree from
, tree to
)
667 struct rejection_reason
*r
= alloc_rejection (rr_explicit_conversion
);
668 r
->u
.conversion
.n_arg
= 0;
669 r
->u
.conversion
.from
= from
;
670 r
->u
.conversion
.to_type
= to
;
674 static struct rejection_reason
*
675 template_conversion_rejection (tree from
, tree to
)
677 struct rejection_reason
*r
= alloc_rejection (rr_template_conversion
);
678 r
->u
.conversion
.n_arg
= 0;
679 r
->u
.conversion
.from
= from
;
680 r
->u
.conversion
.to_type
= to
;
684 static struct rejection_reason
*
685 template_unification_rejection (tree tmpl
, tree explicit_targs
, tree targs
,
686 const tree
*args
, unsigned int nargs
,
687 tree return_type
, unification_kind_t strict
,
690 size_t args_n_bytes
= sizeof (*args
) * nargs
;
691 tree
*args1
= (tree
*) conversion_obstack_alloc (args_n_bytes
);
692 struct rejection_reason
*r
= alloc_rejection (rr_template_unification
);
693 r
->u
.template_unification
.tmpl
= tmpl
;
694 r
->u
.template_unification
.explicit_targs
= explicit_targs
;
695 r
->u
.template_unification
.num_targs
= TREE_VEC_LENGTH (targs
);
696 /* Copy args to our own storage. */
697 memcpy (args1
, args
, args_n_bytes
);
698 r
->u
.template_unification
.args
= args1
;
699 r
->u
.template_unification
.nargs
= nargs
;
700 r
->u
.template_unification
.return_type
= return_type
;
701 r
->u
.template_unification
.strict
= strict
;
702 r
->u
.template_unification
.flags
= flags
;
706 static struct rejection_reason
*
707 template_unification_error_rejection (void)
709 return alloc_rejection (rr_template_unification
);
712 static struct rejection_reason
*
713 invalid_copy_with_fn_template_rejection (void)
715 struct rejection_reason
*r
= alloc_rejection (rr_invalid_copy
);
719 static struct rejection_reason
*
720 template_constraint_failure (tree tmpl
, tree targs
)
722 struct rejection_reason
*r
= alloc_rejection (rr_constraint_failure
);
723 r
->u
.template_instantiation
.tmpl
= tmpl
;
724 r
->u
.template_instantiation
.targs
= targs
;
728 /* Dynamically allocate a conversion. */
731 alloc_conversion (conversion_kind kind
)
734 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
739 #ifdef ENABLE_CHECKING
741 /* Make sure that all memory on the conversion obstack has been
745 validate_conversion_obstack (void)
747 if (conversion_obstack_initialized
)
748 gcc_assert ((obstack_next_free (&conversion_obstack
)
749 == obstack_base (&conversion_obstack
)));
752 #endif /* ENABLE_CHECKING */
754 /* Dynamically allocate an array of N conversions. */
757 alloc_conversions (size_t n
)
759 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
763 build_conv (conversion_kind code
, tree type
, conversion
*from
)
766 conversion_rank rank
= CONVERSION_RANK (from
);
768 /* Note that the caller is responsible for filling in t->cand for
769 user-defined conversions. */
770 t
= alloc_conversion (code
);
793 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
794 t
->bad_p
= from
->bad_p
;
799 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
800 specialization of std::initializer_list<T>, if such a conversion is
804 build_list_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
806 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
807 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
808 conversion
**subconvs
= alloc_conversions (len
);
813 /* Within a list-initialization we can have more user-defined
815 flags
&= ~LOOKUP_NO_CONVERSION
;
816 /* But no narrowing conversions. */
817 flags
|= LOOKUP_NO_NARROWING
;
819 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
822 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
823 false, flags
, complain
);
830 t
= alloc_conversion (ck_list
);
832 t
->u
.list
= subconvs
;
835 for (i
= 0; i
< len
; ++i
)
837 conversion
*sub
= subconvs
[i
];
838 if (sub
->rank
> t
->rank
)
840 if (sub
->user_conv_p
)
841 t
->user_conv_p
= true;
849 /* Return the next conversion of the conversion chain (if applicable),
850 or NULL otherwise. Please use this function instead of directly
851 accessing fields of struct conversion. */
854 next_conversion (conversion
*conv
)
857 || conv
->kind
== ck_identity
858 || conv
->kind
== ck_ambig
859 || conv
->kind
== ck_list
)
864 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
865 is a valid aggregate initializer for array type ATYPE. */
868 can_convert_array (tree atype
, tree ctor
, int flags
, tsubst_flags_t complain
)
871 tree elttype
= TREE_TYPE (atype
);
872 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
874 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
876 if (TREE_CODE (elttype
) == ARRAY_TYPE
877 && TREE_CODE (val
) == CONSTRUCTOR
)
878 ok
= can_convert_array (elttype
, val
, flags
, complain
);
880 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
,
888 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
889 aggregate class, if such a conversion is possible. */
892 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
894 unsigned HOST_WIDE_INT i
= 0;
896 tree field
= next_initializable_field (TYPE_FIELDS (type
));
897 tree empty_ctor
= NULL_TREE
;
899 ctor
= reshape_init (type
, ctor
, tf_none
);
900 if (ctor
== error_mark_node
)
903 /* The conversions within the init-list aren't affected by the enclosing
904 context; they're always simple copy-initialization. */
905 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
907 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
909 tree ftype
= TREE_TYPE (field
);
913 if (i
< CONSTRUCTOR_NELTS (ctor
))
914 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
915 else if (TREE_CODE (ftype
) == REFERENCE_TYPE
)
916 /* Value-initialization of reference is ill-formed. */
920 if (empty_ctor
== NULL_TREE
)
921 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
926 if (TREE_CODE (ftype
) == ARRAY_TYPE
927 && TREE_CODE (val
) == CONSTRUCTOR
)
928 ok
= can_convert_array (ftype
, val
, flags
, complain
);
930 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
936 if (TREE_CODE (type
) == UNION_TYPE
)
940 if (i
< CONSTRUCTOR_NELTS (ctor
))
943 c
= alloc_conversion (ck_aggr
);
946 c
->user_conv_p
= true;
947 c
->check_narrowing
= true;
952 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
953 array type, if such a conversion is possible. */
956 build_array_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
959 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
960 tree elttype
= TREE_TYPE (type
);
965 enum conversion_rank rank
= cr_exact
;
967 /* We might need to propagate the size from the element to the array. */
968 complete_type (type
);
970 if (TYPE_DOMAIN (type
)
971 && !variably_modified_type_p (TYPE_DOMAIN (type
), NULL_TREE
))
973 unsigned HOST_WIDE_INT alen
= tree_to_uhwi (array_type_nelts_top (type
));
978 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
980 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
983 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
984 false, flags
, complain
);
988 if (sub
->rank
> rank
)
990 if (sub
->user_conv_p
)
996 c
= alloc_conversion (ck_aggr
);
999 c
->user_conv_p
= user
;
1005 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1006 complex type, if such a conversion is possible. */
1009 build_complex_conv (tree type
, tree ctor
, int flags
,
1010 tsubst_flags_t complain
)
1013 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1014 tree elttype
= TREE_TYPE (type
);
1019 enum conversion_rank rank
= cr_exact
;
1024 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1026 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1029 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1030 false, flags
, complain
);
1034 if (sub
->rank
> rank
)
1036 if (sub
->user_conv_p
)
1042 c
= alloc_conversion (ck_aggr
);
1045 c
->user_conv_p
= user
;
1051 /* Build a representation of the identity conversion from EXPR to
1052 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1055 build_identity_conv (tree type
, tree expr
)
1059 c
= alloc_conversion (ck_identity
);
1066 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1067 were multiple user-defined conversions to accomplish the job.
1068 Build a conversion that indicates that ambiguity. */
1071 build_ambiguous_conv (tree type
, tree expr
)
1075 c
= alloc_conversion (ck_ambig
);
1083 strip_top_quals (tree t
)
1085 if (TREE_CODE (t
) == ARRAY_TYPE
)
1087 return cp_build_qualified_type (t
, 0);
1090 /* Returns the standard conversion path (see [conv]) from type FROM to type
1091 TO, if any. For proper handling of null pointer constants, you must
1092 also pass the expression EXPR to convert from. If C_CAST_P is true,
1093 this conversion is coming from a C-style cast. */
1096 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1099 enum tree_code fcode
, tcode
;
1101 bool fromref
= false;
1104 to
= non_reference (to
);
1105 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1108 from
= TREE_TYPE (from
);
1111 to
= strip_top_quals (to
);
1112 from
= strip_top_quals (from
);
1114 if ((TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1115 && expr
&& type_unknown_p (expr
))
1117 tsubst_flags_t tflags
= tf_conv
;
1118 expr
= instantiate_type (to
, expr
, tflags
);
1119 if (expr
== error_mark_node
)
1121 from
= TREE_TYPE (expr
);
1124 fcode
= TREE_CODE (from
);
1125 tcode
= TREE_CODE (to
);
1127 conv
= build_identity_conv (from
, expr
);
1128 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1130 from
= type_decays_to (from
);
1131 fcode
= TREE_CODE (from
);
1132 conv
= build_conv (ck_lvalue
, from
, conv
);
1134 else if (fromref
|| (expr
&& lvalue_p (expr
)))
1139 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1142 from
= strip_top_quals (bitfield_type
);
1143 fcode
= TREE_CODE (from
);
1146 conv
= build_conv (ck_rvalue
, from
, conv
);
1147 if (flags
& LOOKUP_PREFER_RVALUE
)
1148 conv
->rvaluedness_matches_p
= true;
1151 /* Allow conversion between `__complex__' data types. */
1152 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1154 /* The standard conversion sequence to convert FROM to TO is
1155 the standard conversion sequence to perform componentwise
1157 conversion
*part_conv
= standard_conversion
1158 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
);
1162 conv
= build_conv (part_conv
->kind
, to
, conv
);
1163 conv
->rank
= part_conv
->rank
;
1171 if (same_type_p (from
, to
))
1173 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1174 conv
->type
= qualified_to
;
1179 A null pointer constant can be converted to a pointer type; ... A
1180 null pointer constant of integral type can be converted to an
1181 rvalue of type std::nullptr_t. */
1182 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1183 || NULLPTR_TYPE_P (to
))
1184 && expr
&& null_ptr_cst_p (expr
))
1185 conv
= build_conv (ck_std
, to
, conv
);
1186 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1187 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1189 /* For backwards brain damage compatibility, allow interconversion of
1190 pointers and integers with a pedwarn. */
1191 conv
= build_conv (ck_std
, to
, conv
);
1194 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1196 /* For backwards brain damage compatibility, allow interconversion of
1197 enums and integers with a pedwarn. */
1198 conv
= build_conv (ck_std
, to
, conv
);
1201 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1202 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1207 if (tcode
== POINTER_TYPE
1208 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from
),
1211 else if (VOID_TYPE_P (TREE_TYPE (to
))
1212 && !TYPE_PTRDATAMEM_P (from
)
1213 && TREE_CODE (TREE_TYPE (from
)) != FUNCTION_TYPE
)
1215 tree nfrom
= TREE_TYPE (from
);
1216 /* Don't try to apply restrict to void. */
1217 int quals
= cp_type_quals (nfrom
) & ~TYPE_QUAL_RESTRICT
;
1218 from
= build_pointer_type
1219 (cp_build_qualified_type (void_type_node
, quals
));
1220 conv
= build_conv (ck_ptr
, from
, conv
);
1222 else if (TYPE_PTRDATAMEM_P (from
))
1224 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1225 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1227 if (DERIVED_FROM_P (fbase
, tbase
)
1228 && (same_type_ignoring_top_level_qualifiers_p
1229 (TYPE_PTRMEM_POINTED_TO_TYPE (from
),
1230 TYPE_PTRMEM_POINTED_TO_TYPE (to
))))
1232 from
= build_ptrmem_type (tbase
,
1233 TYPE_PTRMEM_POINTED_TO_TYPE (from
));
1234 conv
= build_conv (ck_pmem
, from
, conv
);
1236 else if (!same_type_p (fbase
, tbase
))
1239 else if (CLASS_TYPE_P (TREE_TYPE (from
))
1240 && CLASS_TYPE_P (TREE_TYPE (to
))
1243 An rvalue of type "pointer to cv D," where D is a
1244 class type, can be converted to an rvalue of type
1245 "pointer to cv B," where B is a base class (clause
1246 _class.derived_) of D. If B is an inaccessible
1247 (clause _class.access_) or ambiguous
1248 (_class.member.lookup_) base class of D, a program
1249 that necessitates this conversion is ill-formed.
1250 Therefore, we use DERIVED_FROM_P, and do not check
1251 access or uniqueness. */
1252 && DERIVED_FROM_P (TREE_TYPE (to
), TREE_TYPE (from
)))
1255 cp_build_qualified_type (TREE_TYPE (to
),
1256 cp_type_quals (TREE_TYPE (from
)));
1257 from
= build_pointer_type (from
);
1258 conv
= build_conv (ck_ptr
, from
, conv
);
1259 conv
->base_p
= true;
1262 if (tcode
== POINTER_TYPE
)
1264 to_pointee
= TREE_TYPE (to
);
1265 from_pointee
= TREE_TYPE (from
);
1269 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1270 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1273 if (same_type_p (from
, to
))
1275 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
1276 /* In a C-style cast, we ignore CV-qualification because we
1277 are allowed to perform a static_cast followed by a
1279 conv
= build_conv (ck_qual
, to
, conv
);
1280 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1281 conv
= build_conv (ck_qual
, to
, conv
);
1282 else if (expr
&& string_conv_p (to
, expr
, 0))
1283 /* converting from string constant to char *. */
1284 conv
= build_conv (ck_qual
, to
, conv
);
1285 /* Allow conversions among compatible ObjC pointer types (base
1286 conversions have been already handled above). */
1287 else if (c_dialect_objc ()
1288 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1289 conv
= build_conv (ck_ptr
, to
, conv
);
1290 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1292 conv
= build_conv (ck_ptr
, to
, conv
);
1300 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1302 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1303 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1304 tree fbase
= class_of_this_parm (fromfn
);
1305 tree tbase
= class_of_this_parm (tofn
);
1307 if (!DERIVED_FROM_P (fbase
, tbase
)
1308 || !same_type_p (static_fn_type (fromfn
),
1309 static_fn_type (tofn
)))
1312 from
= build_memfn_type (fromfn
,
1314 cp_type_quals (tbase
),
1315 type_memfn_rqual (tofn
));
1316 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1317 conv
= build_conv (ck_pmem
, from
, conv
);
1318 conv
->base_p
= true;
1320 else if (tcode
== BOOLEAN_TYPE
)
1324 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1325 to member type can be converted to a prvalue of type bool. ...
1326 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1327 std::nullptr_t can be converted to a prvalue of type bool; */
1328 if (ARITHMETIC_TYPE_P (from
)
1329 || UNSCOPED_ENUM_P (from
)
1330 || fcode
== POINTER_TYPE
1331 || TYPE_PTRMEM_P (from
)
1332 || NULLPTR_TYPE_P (from
))
1334 conv
= build_conv (ck_std
, to
, conv
);
1335 if (fcode
== POINTER_TYPE
1336 || TYPE_PTRDATAMEM_P (from
)
1337 || (TYPE_PTRMEMFUNC_P (from
)
1338 && conv
->rank
< cr_pbool
)
1339 || NULLPTR_TYPE_P (from
))
1340 conv
->rank
= cr_pbool
;
1341 if (NULLPTR_TYPE_P (from
) && (flags
& LOOKUP_ONLYCONVERTING
))
1348 /* We don't check for ENUMERAL_TYPE here because there are no standard
1349 conversions to enum type. */
1350 /* As an extension, allow conversion to complex type. */
1351 else if (ARITHMETIC_TYPE_P (to
))
1353 if (! (INTEGRAL_CODE_P (fcode
)
1354 || (fcode
== REAL_TYPE
&& !(flags
& LOOKUP_NO_NON_INTEGRAL
)))
1355 || SCOPED_ENUM_P (from
))
1357 conv
= build_conv (ck_std
, to
, conv
);
1359 /* Give this a better rank if it's a promotion. */
1360 if (same_type_p (to
, type_promotes_to (from
))
1361 && next_conversion (conv
)->rank
<= cr_promotion
)
1362 conv
->rank
= cr_promotion
;
1364 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1365 && vector_types_convertible_p (from
, to
, false))
1366 return build_conv (ck_std
, to
, conv
);
1367 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1368 && is_properly_derived_from (from
, to
))
1370 if (conv
->kind
== ck_rvalue
)
1371 conv
= next_conversion (conv
);
1372 conv
= build_conv (ck_base
, to
, conv
);
1373 /* The derived-to-base conversion indicates the initialization
1374 of a parameter with base type from an object of a derived
1375 type. A temporary object is created to hold the result of
1376 the conversion unless we're binding directly to a reference. */
1377 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1382 if (flags
& LOOKUP_NO_NARROWING
)
1383 conv
->check_narrowing
= true;
1388 /* Returns nonzero if T1 is reference-related to T2. */
1391 reference_related_p (tree t1
, tree t2
)
1393 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1396 t1
= TYPE_MAIN_VARIANT (t1
);
1397 t2
= TYPE_MAIN_VARIANT (t2
);
1401 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1402 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1404 return (same_type_p (t1
, t2
)
1405 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1406 && DERIVED_FROM_P (t1
, t2
)));
1409 /* Returns nonzero if T1 is reference-compatible with T2. */
1412 reference_compatible_p (tree t1
, tree t2
)
1416 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
1417 reference-related to T2 and cv1 is the same cv-qualification as,
1418 or greater cv-qualification than, cv2. */
1419 return (reference_related_p (t1
, t2
)
1420 && at_least_as_qualified_p (t1
, t2
));
1423 /* A reference of the indicated TYPE is being bound directly to the
1424 expression represented by the implicit conversion sequence CONV.
1425 Return a conversion sequence for this binding. */
1428 direct_reference_binding (tree type
, conversion
*conv
)
1432 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
1433 gcc_assert (TREE_CODE (conv
->type
) != REFERENCE_TYPE
);
1435 t
= TREE_TYPE (type
);
1439 When a parameter of reference type binds directly
1440 (_dcl.init.ref_) to an argument expression, the implicit
1441 conversion sequence is the identity conversion, unless the
1442 argument expression has a type that is a derived class of the
1443 parameter type, in which case the implicit conversion sequence is
1444 a derived-to-base Conversion.
1446 If the parameter binds directly to the result of applying a
1447 conversion function to the argument expression, the implicit
1448 conversion sequence is a user-defined conversion sequence
1449 (_over.ics.user_), with the second standard conversion sequence
1450 either an identity conversion or, if the conversion function
1451 returns an entity of a type that is a derived class of the
1452 parameter type, a derived-to-base conversion. */
1453 if (!same_type_ignoring_top_level_qualifiers_p (t
, conv
->type
))
1455 /* Represent the derived-to-base conversion. */
1456 conv
= build_conv (ck_base
, t
, conv
);
1457 /* We will actually be binding to the base-class subobject in
1458 the derived class, so we mark this conversion appropriately.
1459 That way, convert_like knows not to generate a temporary. */
1460 conv
->need_temporary_p
= false;
1462 return build_conv (ck_ref_bind
, type
, conv
);
1465 /* Returns the conversion path from type FROM to reference type TO for
1466 purposes of reference binding. For lvalue binding, either pass a
1467 reference type to FROM or an lvalue expression to EXPR. If the
1468 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1469 the conversion returned. If C_CAST_P is true, this
1470 conversion is coming from a C-style cast. */
1473 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1474 tsubst_flags_t complain
)
1476 conversion
*conv
= NULL
;
1477 tree to
= TREE_TYPE (rto
);
1482 cp_lvalue_kind gl_kind
;
1485 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1487 expr
= instantiate_type (to
, expr
, tf_none
);
1488 if (expr
== error_mark_node
)
1490 from
= TREE_TYPE (expr
);
1493 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1495 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1496 /* DR 1288: Otherwise, if the initializer list has a single element
1497 of type E and ... [T's] referenced type is reference-related to E,
1498 the object or reference is initialized from that element... */
1499 if (CONSTRUCTOR_NELTS (expr
) == 1)
1501 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1502 if (error_operand_p (elt
))
1504 tree etype
= TREE_TYPE (elt
);
1505 if (reference_related_p (to
, etype
))
1512 /* Otherwise, if T is a reference type, a prvalue temporary of the
1513 type referenced by T is copy-list-initialized or
1514 direct-list-initialized, depending on the kind of initialization
1515 for the reference, and the reference is bound to that temporary. */
1516 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1517 flags
|LOOKUP_NO_TEMP_BIND
, complain
);
1521 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1523 from
= TREE_TYPE (from
);
1524 if (!TYPE_REF_IS_RVALUE (rfrom
)
1525 || TREE_CODE (from
) == FUNCTION_TYPE
)
1526 gl_kind
= clk_ordinary
;
1528 gl_kind
= clk_rvalueref
;
1532 gl_kind
= lvalue_kind (expr
);
1533 if (gl_kind
& clk_class
)
1534 /* A class prvalue is not a glvalue. */
1539 is_lvalue
= gl_kind
&& !(gl_kind
& clk_rvalueref
);
1542 if ((gl_kind
& clk_bitfield
) != 0)
1543 tfrom
= unlowered_expr_type (expr
);
1545 /* Figure out whether or not the types are reference-related and
1546 reference compatible. We have do do this after stripping
1547 references from FROM. */
1548 related_p
= reference_related_p (to
, tfrom
);
1549 /* If this is a C cast, first convert to an appropriately qualified
1550 type, so that we can later do a const_cast to the desired type. */
1551 if (related_p
&& c_cast_p
1552 && !at_least_as_qualified_p (to
, tfrom
))
1553 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1554 compatible_p
= reference_compatible_p (to
, tfrom
);
1556 /* Directly bind reference when target expression's type is compatible with
1557 the reference and expression is an lvalue. In DR391, the wording in
1558 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1559 const and rvalue references to rvalues of compatible class type.
1560 We should also do direct bindings for non-class xvalues. */
1563 || (!(flags
& LOOKUP_NO_TEMP_BIND
)
1564 && (CLASS_TYPE_P (from
)
1565 || TREE_CODE (from
) == ARRAY_TYPE
))))
1569 If the initializer expression
1571 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1572 is reference-compatible with "cv2 T2,"
1574 the reference is bound directly to the initializer expression
1578 If the initializer expression is an rvalue, with T2 a class type,
1579 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1580 is bound to the object represented by the rvalue or to a sub-object
1581 within that object. */
1583 conv
= build_identity_conv (tfrom
, expr
);
1584 conv
= direct_reference_binding (rto
, conv
);
1586 if (flags
& LOOKUP_PREFER_RVALUE
)
1587 /* The top-level caller requested that we pretend that the lvalue
1588 be treated as an rvalue. */
1589 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1590 else if (TREE_CODE (rfrom
) == REFERENCE_TYPE
)
1591 /* Handle rvalue reference to function properly. */
1592 conv
->rvaluedness_matches_p
1593 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1595 conv
->rvaluedness_matches_p
1596 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1598 if ((gl_kind
& clk_bitfield
) != 0
1599 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1600 /* For the purposes of overload resolution, we ignore the fact
1601 this expression is a bitfield or packed field. (In particular,
1602 [over.ics.ref] says specifically that a function with a
1603 non-const reference parameter is viable even if the
1604 argument is a bitfield.)
1606 However, when we actually call the function we must create
1607 a temporary to which to bind the reference. If the
1608 reference is volatile, or isn't const, then we cannot make
1609 a temporary, so we just issue an error when the conversion
1611 conv
->need_temporary_p
= true;
1613 /* Don't allow binding of lvalues (other than function lvalues) to
1614 rvalue references. */
1615 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1616 && TREE_CODE (to
) != FUNCTION_TYPE
1617 && !(flags
& LOOKUP_PREFER_RVALUE
))
1620 /* Nor the reverse. */
1621 if (!is_lvalue
&& !TYPE_REF_IS_RVALUE (rto
)
1622 && (!CP_TYPE_CONST_NON_VOLATILE_P (to
)
1623 || (flags
& LOOKUP_NO_RVAL_BIND
))
1624 && TREE_CODE (to
) != FUNCTION_TYPE
)
1632 /* [class.conv.fct] A conversion function is never used to convert a
1633 (possibly cv-qualified) object to the (possibly cv-qualified) same
1634 object type (or a reference to it), to a (possibly cv-qualified) base
1635 class of that type (or a reference to it).... */
1636 else if (CLASS_TYPE_P (from
) && !related_p
1637 && !(flags
& LOOKUP_NO_CONVERSION
))
1641 If the initializer expression
1643 -- has a class type (i.e., T2 is a class type) can be
1644 implicitly converted to an lvalue of type "cv3 T3," where
1645 "cv1 T1" is reference-compatible with "cv3 T3". (this
1646 conversion is selected by enumerating the applicable
1647 conversion functions (_over.match.ref_) and choosing the
1648 best one through overload resolution. (_over.match_).
1650 the reference is bound to the lvalue result of the conversion
1651 in the second case. */
1652 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1655 return cand
->second_conv
;
1658 /* From this point on, we conceptually need temporaries, even if we
1659 elide them. Only the cases above are "direct bindings". */
1660 if (flags
& LOOKUP_NO_TEMP_BIND
)
1665 When a parameter of reference type is not bound directly to an
1666 argument expression, the conversion sequence is the one required
1667 to convert the argument expression to the underlying type of the
1668 reference according to _over.best.ics_. Conceptually, this
1669 conversion sequence corresponds to copy-initializing a temporary
1670 of the underlying type with the argument expression. Any
1671 difference in top-level cv-qualification is subsumed by the
1672 initialization itself and does not constitute a conversion. */
1674 /* We're generating a temporary now, but don't bind any more in the
1675 conversion (specifically, don't slice the temporary returned by a
1676 conversion operator). */
1677 flags
|= LOOKUP_NO_TEMP_BIND
;
1679 /* Core issue 899: When [copy-]initializing a temporary to be bound
1680 to the first parameter of a copy constructor (12.8) called with
1681 a single argument in the context of direct-initialization,
1682 explicit conversion functions are also considered.
1684 So don't set LOOKUP_ONLYCONVERTING in that case. */
1685 if (!(flags
& LOOKUP_COPY_PARM
))
1686 flags
|= LOOKUP_ONLYCONVERTING
;
1689 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1694 if (conv
->user_conv_p
)
1696 /* If initializing the temporary used a conversion function,
1697 recalculate the second conversion sequence. */
1698 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1699 if (t
->kind
== ck_user
1700 && DECL_CONV_FN_P (t
->cand
->fn
))
1702 tree ftype
= TREE_TYPE (TREE_TYPE (t
->cand
->fn
));
1703 int sflags
= (flags
|LOOKUP_NO_CONVERSION
)&~LOOKUP_NO_TEMP_BIND
;
1704 conversion
*new_second
1705 = reference_binding (rto
, ftype
, NULL_TREE
, c_cast_p
,
1709 return merge_conversion_sequences (t
, new_second
);
1713 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1714 /* This reference binding, unlike those above, requires the
1715 creation of a temporary. */
1716 conv
->need_temporary_p
= true;
1717 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1721 Otherwise, the reference shall be an lvalue reference to a
1722 non-volatile const type, or the reference shall be an rvalue
1724 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1729 Otherwise, a temporary of type "cv1 T1" is created and
1730 initialized from the initializer expression using the rules for a
1731 non-reference copy initialization. If T1 is reference-related to
1732 T2, cv1 must be the same cv-qualification as, or greater
1733 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1734 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1740 /* Returns the implicit conversion sequence (see [over.ics]) from type
1741 FROM to type TO. The optional expression EXPR may affect the
1742 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1743 true, this conversion is coming from a C-style cast. */
1746 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1747 int flags
, tsubst_flags_t complain
)
1751 if (from
== error_mark_node
|| to
== error_mark_node
1752 || expr
== error_mark_node
)
1755 /* Other flags only apply to the primary function in overload
1756 resolution, or after we've chosen one. */
1757 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1758 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1759 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1761 /* FIXME: actually we don't want warnings either, but we can't just
1762 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1763 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1764 We really ought not to issue that warning until we've committed
1765 to that conversion. */
1766 complain
&= ~tf_error
;
1768 if (TREE_CODE (to
) == REFERENCE_TYPE
)
1769 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1771 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
);
1776 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1778 if (is_std_init_list (to
))
1779 return build_list_conv (to
, expr
, flags
, complain
);
1781 /* As an extension, allow list-initialization of _Complex. */
1782 if (TREE_CODE (to
) == COMPLEX_TYPE
)
1784 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1789 /* Allow conversion from an initializer-list with one element to a
1791 if (SCALAR_TYPE_P (to
))
1793 int nelts
= CONSTRUCTOR_NELTS (expr
);
1797 elt
= build_value_init (to
, tf_none
);
1798 else if (nelts
== 1)
1799 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1801 elt
= error_mark_node
;
1803 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1804 c_cast_p
, flags
, complain
);
1807 conv
->check_narrowing
= true;
1808 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1809 /* Too many levels of braces, i.e. '{{1}}'. */
1814 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1815 return build_array_conv (to
, expr
, flags
, complain
);
1818 if (expr
!= NULL_TREE
1819 && (MAYBE_CLASS_TYPE_P (from
)
1820 || MAYBE_CLASS_TYPE_P (to
))
1821 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1823 struct z_candidate
*cand
;
1825 if (CLASS_TYPE_P (to
)
1826 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
1827 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
1828 return build_aggr_conv (to
, expr
, flags
, complain
);
1830 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
1832 conv
= cand
->second_conv
;
1834 /* We used to try to bind a reference to a temporary here, but that
1835 is now handled after the recursive call to this function at the end
1836 of reference_binding. */
1843 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1844 functions. ARGS will not be changed until a single candidate is
1847 static struct z_candidate
*
1848 add_candidate (struct z_candidate
**candidates
,
1849 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
1850 size_t num_convs
, conversion
**convs
,
1851 tree access_path
, tree conversion_path
,
1852 int viable
, struct rejection_reason
*reason
,
1855 struct z_candidate
*cand
= (struct z_candidate
*)
1856 conversion_obstack_alloc (sizeof (struct z_candidate
));
1859 cand
->first_arg
= first_arg
;
1861 cand
->convs
= convs
;
1862 cand
->num_convs
= num_convs
;
1863 cand
->access_path
= access_path
;
1864 cand
->conversion_path
= conversion_path
;
1865 cand
->viable
= viable
;
1866 cand
->reason
= reason
;
1867 cand
->next
= *candidates
;
1868 cand
->flags
= flags
;
1874 /* Return the number of remaining arguments in the parameter list
1875 beginning with ARG. */
1878 remaining_arguments (tree arg
)
1882 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
1883 arg
= TREE_CHAIN (arg
))
1889 // Returns true if FN is a non-template member function or non-template
1890 // friend function. Both kinds of declaration can be constrained.
1892 is_constrainable_non_template_fn (tree fn
)
1894 if (DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (fn
))
1897 return DECL_FUNCTION_MEMBER_P (fn
) &&
1898 DECL_TEMPLATE_INFO (fn
) &&
1899 !DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
));
1902 /* Create an overload candidate for the function or method FN called
1903 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1904 FLAGS is passed on to implicit_conversion.
1906 This does not change ARGS.
1908 CTYPE, if non-NULL, is the type we want to pretend this function
1909 comes from for purposes of overload resolution. */
1911 static struct z_candidate
*
1912 add_function_candidate (struct z_candidate
**candidates
,
1913 tree fn
, tree ctype
, tree first_arg
,
1914 const vec
<tree
, va_gc
> *args
, tree access_path
,
1915 tree conversion_path
, int flags
,
1916 tsubst_flags_t complain
)
1918 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1922 tree orig_first_arg
= first_arg
;
1925 struct rejection_reason
*reason
= NULL
;
1927 /* At this point we should not see any functions which haven't been
1928 explicitly declared, except for friend functions which will have
1929 been found using argument dependent lookup. */
1930 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
1932 /* The `this', `in_chrg' and VTT arguments to constructors are not
1933 considered in overload resolution. */
1934 if (DECL_CONSTRUCTOR_P (fn
))
1936 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
1937 skip
= num_artificial_parms_for (fn
);
1938 if (skip
> 0 && first_arg
!= NULL_TREE
)
1941 first_arg
= NULL_TREE
;
1947 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
1948 convs
= alloc_conversions (len
);
1952 // Functions whose constraints are not satisfied are non-viable.
1954 // For function templates, constraints are checked as part of template
1955 // argument deduction. A failure there means that the template is
1956 // already added as a non-viable candidate. For non-template member
1957 // functions, however, the declaration declaration has already been
1958 // synthesized, but its constraints have not actually been checked.
1959 // We should do that now.
1961 // TODO: Consider checking constrained non-template members during
1962 // class template instantiation and setting a flag indicating whether
1963 // or not the declaration is viable. This could be set as a flag in
1964 // TEMPLATE_INFO (there should be a bunch of unused bits there).
1965 if (is_constrainable_non_template_fn (fn
))
1967 tree tmpl
= DECL_TI_TEMPLATE (fn
);
1968 tree args
= DECL_TI_ARGS (fn
);
1969 if (!check_template_constraints (tmpl
, args
))
1971 reason
= template_constraint_failure (tmpl
, args
);
1977 /* 13.3.2 - Viable functions [over.match.viable]
1978 First, to be a viable function, a candidate function shall have enough
1979 parameters to agree in number with the arguments in the list.
1981 We need to check this first; otherwise, checking the ICSes might cause
1982 us to produce an ill-formed template instantiation. */
1984 parmnode
= parmlist
;
1985 for (i
= 0; i
< len
; ++i
)
1987 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
1989 parmnode
= TREE_CHAIN (parmnode
);
1992 if ((i
< len
&& parmnode
)
1993 || !sufficient_parms_p (parmnode
))
1995 int remaining
= remaining_arguments (parmnode
);
1997 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
1999 /* When looking for a function from a subobject from an implicit
2000 copy/move constructor/operator=, don't consider anything that takes (a
2001 reference to) an unrelated type. See c++/44909 and core 1092. */
2002 else if (parmlist
&& (flags
& LOOKUP_DEFAULTED
))
2004 if (DECL_CONSTRUCTOR_P (fn
))
2006 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
2007 && DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
)
2013 parmnode
= chain_index (i
-1, parmlist
);
2014 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
2019 /* This only applies at the top level. */
2020 flags
&= ~LOOKUP_DEFAULTED
;
2026 /* Second, for F to be a viable function, there shall exist for each
2027 argument an implicit conversion sequence that converts that argument
2028 to the corresponding parameter of F. */
2030 parmnode
= parmlist
;
2032 for (i
= 0; i
< len
; ++i
)
2034 tree argtype
, to_type
;
2039 if (parmnode
== void_list_node
)
2042 if (i
== 0 && first_arg
!= NULL_TREE
)
2045 arg
= CONST_CAST_TREE (
2046 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
2047 argtype
= lvalue_type (arg
);
2049 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2050 && ! DECL_CONSTRUCTOR_P (fn
));
2054 tree parmtype
= TREE_VALUE (parmnode
);
2057 parmnode
= TREE_CHAIN (parmnode
);
2059 /* The type of the implicit object parameter ('this') for
2060 overload resolution is not always the same as for the
2061 function itself; conversion functions are considered to
2062 be members of the class being converted, and functions
2063 introduced by a using-declaration are considered to be
2064 members of the class that uses them.
2066 Since build_over_call ignores the ICS for the `this'
2067 parameter, we can just change the parm type. */
2068 if (ctype
&& is_this
)
2070 parmtype
= cp_build_qualified_type
2071 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
2072 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
2074 /* If the function has a ref-qualifier, the implicit
2075 object parameter has reference type. */
2076 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
2077 parmtype
= cp_build_reference_type (parmtype
, rv
);
2078 /* The special handling of 'this' conversions in compare_ics
2079 does not apply if there is a ref-qualifier. */
2084 parmtype
= build_pointer_type (parmtype
);
2085 arg
= build_this (arg
);
2086 argtype
= lvalue_type (arg
);
2090 /* Core issue 899: When [copy-]initializing a temporary to be bound
2091 to the first parameter of a copy constructor (12.8) called with
2092 a single argument in the context of direct-initialization,
2093 explicit conversion functions are also considered.
2095 So set LOOKUP_COPY_PARM to let reference_binding know that
2096 it's being called in that context. We generalize the above
2097 to handle move constructors and template constructors as well;
2098 the standardese should soon be updated similarly. */
2099 if (ctype
&& i
== 0 && (len
-skip
== 1)
2100 && DECL_CONSTRUCTOR_P (fn
)
2101 && parmtype
!= error_mark_node
2102 && (same_type_ignoring_top_level_qualifiers_p
2103 (non_reference (parmtype
), ctype
)))
2105 if (!(flags
& LOOKUP_ONLYCONVERTING
))
2106 lflags
|= LOOKUP_COPY_PARM
;
2107 /* We allow user-defined conversions within init-lists, but
2108 don't list-initialize the copy parm, as that would mean
2109 using two levels of braces for the same type. */
2110 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
2111 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
2112 lflags
|= LOOKUP_NO_CONVERSION
;
2115 lflags
|= LOOKUP_ONLYCONVERTING
;
2117 t
= implicit_conversion (parmtype
, argtype
, arg
,
2118 /*c_cast_p=*/false, lflags
, complain
);
2123 t
= build_identity_conv (argtype
, arg
);
2124 t
->ellipsis_p
= true;
2135 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
);
2142 reason
= bad_arg_conversion_rejection (first_arg
, i
, arg
, to_type
);
2147 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2148 access_path
, conversion_path
, viable
, reason
, flags
);
2151 /* Create an overload candidate for the conversion function FN which will
2152 be invoked for expression OBJ, producing a pointer-to-function which
2153 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2154 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2155 passed on to implicit_conversion.
2157 Actually, we don't really care about FN; we care about the type it
2158 converts to. There may be multiple conversion functions that will
2159 convert to that type, and we rely on build_user_type_conversion_1 to
2160 choose the best one; so when we create our candidate, we record the type
2161 instead of the function. */
2163 static struct z_candidate
*
2164 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2165 tree first_arg
, const vec
<tree
, va_gc
> *arglist
,
2166 tree access_path
, tree conversion_path
,
2167 tsubst_flags_t complain
)
2169 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2170 int i
, len
, viable
, flags
;
2171 tree parmlist
, parmnode
;
2173 struct rejection_reason
*reason
;
2175 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2176 parmlist
= TREE_TYPE (parmlist
);
2177 parmlist
= TYPE_ARG_TYPES (parmlist
);
2179 len
= vec_safe_length (arglist
) + (first_arg
!= NULL_TREE
? 1 : 0) + 1;
2180 convs
= alloc_conversions (len
);
2181 parmnode
= parmlist
;
2183 flags
= LOOKUP_IMPLICIT
;
2186 /* Don't bother looking up the same type twice. */
2187 if (*candidates
&& (*candidates
)->fn
== totype
)
2190 for (i
= 0; i
< len
; ++i
)
2192 tree arg
, argtype
, convert_type
= NULL_TREE
;
2197 else if (i
== 1 && first_arg
!= NULL_TREE
)
2200 arg
= (*arglist
)[i
- (first_arg
!= NULL_TREE
? 1 : 0) - 1];
2201 argtype
= lvalue_type (arg
);
2205 t
= implicit_conversion (totype
, argtype
, arg
, /*c_cast_p=*/false,
2207 convert_type
= totype
;
2209 else if (parmnode
== void_list_node
)
2213 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2214 /*c_cast_p=*/false, flags
, complain
);
2215 convert_type
= TREE_VALUE (parmnode
);
2219 t
= build_identity_conv (argtype
, arg
);
2220 t
->ellipsis_p
= true;
2221 convert_type
= argtype
;
2231 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, arg
, convert_type
);
2238 parmnode
= TREE_CHAIN (parmnode
);
2242 || ! sufficient_parms_p (parmnode
))
2244 int remaining
= remaining_arguments (parmnode
);
2246 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2249 return add_candidate (candidates
, totype
, first_arg
, arglist
, len
, convs
,
2250 access_path
, conversion_path
, viable
, reason
, flags
);
2254 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2255 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2256 int flags
, tsubst_flags_t complain
)
2263 struct rejection_reason
*reason
= NULL
;
2268 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2269 convs
= alloc_conversions (num_convs
);
2271 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2272 conversion ops are allowed. We handle that here by just checking for
2273 boolean_type_node because other operators don't ask for it. COND_EXPR
2274 also does contextual conversion to bool for the first operand, but we
2275 handle that in build_conditional_expr, and type1 here is operand 2. */
2276 if (type1
!= boolean_type_node
)
2277 flags
|= LOOKUP_ONLYCONVERTING
;
2279 for (i
= 0; i
< 2; ++i
)
2284 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2285 /*c_cast_p=*/false, flags
, complain
);
2289 /* We need something for printing the candidate. */
2290 t
= build_identity_conv (types
[i
], NULL_TREE
);
2291 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2297 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, args
[i
],
2303 /* For COND_EXPR we rearranged the arguments; undo that now. */
2306 convs
[2] = convs
[1];
2307 convs
[1] = convs
[0];
2308 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2309 /*c_cast_p=*/false, flags
,
2316 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2321 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2323 /*access_path=*/NULL_TREE
,
2324 /*conversion_path=*/NULL_TREE
,
2325 viable
, reason
, flags
);
2329 is_complete (tree t
)
2331 return COMPLETE_TYPE_P (complete_type (t
));
2334 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2337 promoted_arithmetic_type_p (tree type
)
2341 In this section, the term promoted integral type is used to refer
2342 to those integral types which are preserved by integral promotion
2343 (including e.g. int and long but excluding e.g. char).
2344 Similarly, the term promoted arithmetic type refers to promoted
2345 integral types plus floating types. */
2346 return ((CP_INTEGRAL_TYPE_P (type
)
2347 && same_type_p (type_promotes_to (type
), type
))
2348 || TREE_CODE (type
) == REAL_TYPE
);
2351 /* Create any builtin operator overload candidates for the operator in
2352 question given the converted operand types TYPE1 and TYPE2. The other
2353 args are passed through from add_builtin_candidates to
2354 build_builtin_candidate.
2356 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2357 If CODE is requires candidates operands of the same type of the kind
2358 of which TYPE1 and TYPE2 are, we add both candidates
2359 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2362 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2363 enum tree_code code2
, tree fnname
, tree type1
,
2364 tree type2
, tree
*args
, tree
*argtypes
, int flags
,
2365 tsubst_flags_t complain
)
2369 case POSTINCREMENT_EXPR
:
2370 case POSTDECREMENT_EXPR
:
2371 args
[1] = integer_zero_node
;
2372 type2
= integer_type_node
;
2381 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2382 and VQ is either volatile or empty, there exist candidate operator
2383 functions of the form
2384 VQ T& operator++(VQ T&);
2385 T operator++(VQ T&, int);
2386 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2387 type other than bool, and VQ is either volatile or empty, there exist
2388 candidate operator functions of the form
2389 VQ T& operator--(VQ T&);
2390 T operator--(VQ T&, int);
2391 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2392 complete object type, and VQ is either volatile or empty, there exist
2393 candidate operator functions of the form
2394 T*VQ& operator++(T*VQ&);
2395 T*VQ& operator--(T*VQ&);
2396 T* operator++(T*VQ&, int);
2397 T* operator--(T*VQ&, int); */
2399 case POSTDECREMENT_EXPR
:
2400 case PREDECREMENT_EXPR
:
2401 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2403 case POSTINCREMENT_EXPR
:
2404 case PREINCREMENT_EXPR
:
2405 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2407 type1
= build_reference_type (type1
);
2412 /* 7 For every cv-qualified or cv-unqualified object type T, there
2413 exist candidate operator functions of the form
2417 8 For every function type T, there exist candidate operator functions of
2419 T& operator*(T*); */
2422 if (TYPE_PTR_P (type1
)
2423 && (TYPE_PTROB_P (type1
)
2424 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2428 /* 9 For every type T, there exist candidate operator functions of the form
2431 10For every promoted arithmetic type T, there exist candidate operator
2432 functions of the form
2436 case UNARY_PLUS_EXPR
: /* unary + */
2437 if (TYPE_PTR_P (type1
))
2440 if (ARITHMETIC_TYPE_P (type1
))
2444 /* 11For every promoted integral type T, there exist candidate operator
2445 functions of the form
2449 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2453 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2454 is the same type as C2 or is a derived class of C2, T is a complete
2455 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2456 there exist candidate operator functions of the form
2457 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2458 where CV12 is the union of CV1 and CV2. */
2461 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2463 tree c1
= TREE_TYPE (type1
);
2464 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2466 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2467 && (TYPE_PTRMEMFUNC_P (type2
)
2468 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2473 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2474 didate operator functions of the form
2479 bool operator<(L, R);
2480 bool operator>(L, R);
2481 bool operator<=(L, R);
2482 bool operator>=(L, R);
2483 bool operator==(L, R);
2484 bool operator!=(L, R);
2485 where LR is the result of the usual arithmetic conversions between
2488 14For every pair of types T and I, where T is a cv-qualified or cv-
2489 unqualified complete object type and I is a promoted integral type,
2490 there exist candidate operator functions of the form
2491 T* operator+(T*, I);
2492 T& operator[](T*, I);
2493 T* operator-(T*, I);
2494 T* operator+(I, T*);
2495 T& operator[](I, T*);
2497 15For every T, where T is a pointer to complete object type, there exist
2498 candidate operator functions of the form112)
2499 ptrdiff_t operator-(T, T);
2501 16For every pointer or enumeration type T, there exist candidate operator
2502 functions of the form
2503 bool operator<(T, T);
2504 bool operator>(T, T);
2505 bool operator<=(T, T);
2506 bool operator>=(T, T);
2507 bool operator==(T, T);
2508 bool operator!=(T, T);
2510 17For every pointer to member type T, there exist candidate operator
2511 functions of the form
2512 bool operator==(T, T);
2513 bool operator!=(T, T); */
2516 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2518 if (TYPE_PTROB_P (type1
)
2519 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2521 type2
= ptrdiff_type_node
;
2525 case TRUNC_DIV_EXPR
:
2526 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2532 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2533 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2535 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2540 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2552 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2554 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2556 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2557 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2559 if (TYPE_PTR_P (type1
)
2560 && null_ptr_cst_p (args
[1]))
2565 if (null_ptr_cst_p (args
[0])
2566 && TYPE_PTR_P (type2
))
2574 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2577 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2579 type1
= ptrdiff_type_node
;
2582 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2584 type2
= ptrdiff_type_node
;
2589 /* 18For every pair of promoted integral types L and R, there exist candi-
2590 date operator functions of the form
2597 where LR is the result of the usual arithmetic conversions between
2600 case TRUNC_MOD_EXPR
:
2606 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2610 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2611 type, VQ is either volatile or empty, and R is a promoted arithmetic
2612 type, there exist candidate operator functions of the form
2613 VQ L& operator=(VQ L&, R);
2614 VQ L& operator*=(VQ L&, R);
2615 VQ L& operator/=(VQ L&, R);
2616 VQ L& operator+=(VQ L&, R);
2617 VQ L& operator-=(VQ L&, R);
2619 20For every pair T, VQ), where T is any type and VQ is either volatile
2620 or empty, there exist candidate operator functions of the form
2621 T*VQ& operator=(T*VQ&, T*);
2623 21For every pair T, VQ), where T is a pointer to member type and VQ is
2624 either volatile or empty, there exist candidate operator functions of
2626 VQ T& operator=(VQ T&, T);
2628 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2629 unqualified complete object type, VQ is either volatile or empty, and
2630 I is a promoted integral type, there exist candidate operator func-
2632 T*VQ& operator+=(T*VQ&, I);
2633 T*VQ& operator-=(T*VQ&, I);
2635 23For every triple L, VQ, R), where L is an integral or enumeration
2636 type, VQ is either volatile or empty, and R is a promoted integral
2637 type, there exist candidate operator functions of the form
2639 VQ L& operator%=(VQ L&, R);
2640 VQ L& operator<<=(VQ L&, R);
2641 VQ L& operator>>=(VQ L&, R);
2642 VQ L& operator&=(VQ L&, R);
2643 VQ L& operator^=(VQ L&, R);
2644 VQ L& operator|=(VQ L&, R); */
2651 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2653 type2
= ptrdiff_type_node
;
2657 case TRUNC_DIV_EXPR
:
2658 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2662 case TRUNC_MOD_EXPR
:
2668 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2673 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2675 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2676 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2677 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2678 || ((TYPE_PTRMEMFUNC_P (type1
)
2679 || TYPE_PTR_P (type1
))
2680 && null_ptr_cst_p (args
[1])))
2690 type1
= build_reference_type (type1
);
2696 For every pair of promoted arithmetic types L and R, there
2697 exist candidate operator functions of the form
2699 LR operator?(bool, L, R);
2701 where LR is the result of the usual arithmetic conversions
2702 between types L and R.
2704 For every type T, where T is a pointer or pointer-to-member
2705 type, there exist candidate operator functions of the form T
2706 operator?(bool, T, T); */
2708 if (promoted_arithmetic_type_p (type1
)
2709 && promoted_arithmetic_type_p (type2
))
2713 /* Otherwise, the types should be pointers. */
2714 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2717 /* We don't check that the two types are the same; the logic
2718 below will actually create two candidates; one in which both
2719 parameter types are TYPE1, and one in which both parameter
2725 if (ARITHMETIC_TYPE_P (type1
))
2733 /* Make sure we don't create builtin candidates with dependent types. */
2734 bool u1
= uses_template_parms (type1
);
2735 bool u2
= type2
? uses_template_parms (type2
) : false;
2738 /* Try to recover if one of the types is non-dependent. But if
2739 there's only one type, there's nothing we can do. */
2742 /* And we lose if both are dependent. */
2745 /* Or if they have different forms. */
2746 if (TREE_CODE (type1
) != TREE_CODE (type2
))
2755 /* If we're dealing with two pointer types or two enumeral types,
2756 we need candidates for both of them. */
2757 if (type2
&& !same_type_p (type1
, type2
)
2758 && TREE_CODE (type1
) == TREE_CODE (type2
)
2759 && (TREE_CODE (type1
) == REFERENCE_TYPE
2760 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2761 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2762 || TYPE_PTRMEMFUNC_P (type1
)
2763 || MAYBE_CLASS_TYPE_P (type1
)
2764 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2766 if (TYPE_PTR_OR_PTRMEM_P (type1
))
2768 tree cptype
= composite_pointer_type (type1
, type2
,
2773 if (cptype
!= error_mark_node
)
2775 build_builtin_candidate
2776 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
2782 build_builtin_candidate
2783 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
2784 build_builtin_candidate
2785 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
2789 build_builtin_candidate
2790 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
2794 type_decays_to (tree type
)
2796 if (TREE_CODE (type
) == ARRAY_TYPE
)
2797 return build_pointer_type (TREE_TYPE (type
));
2798 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2799 return build_pointer_type (type
);
2803 /* There are three conditions of builtin candidates:
2805 1) bool-taking candidates. These are the same regardless of the input.
2806 2) pointer-pair taking candidates. These are generated for each type
2807 one of the input types converts to.
2808 3) arithmetic candidates. According to the standard, we should generate
2809 all of these, but I'm trying not to...
2811 Here we generate a superset of the possible candidates for this particular
2812 case. That is a subset of the full set the standard defines, plus some
2813 other cases which the standard disallows. add_builtin_candidate will
2814 filter out the invalid set. */
2817 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2818 enum tree_code code2
, tree fnname
, tree
*args
,
2819 int flags
, tsubst_flags_t complain
)
2823 tree type
, argtypes
[3], t
;
2824 /* TYPES[i] is the set of possible builtin-operator parameter types
2825 we will consider for the Ith argument. */
2826 vec
<tree
, va_gc
> *types
[2];
2829 for (i
= 0; i
< 3; ++i
)
2832 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2834 argtypes
[i
] = NULL_TREE
;
2839 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2840 and VQ is either volatile or empty, there exist candidate operator
2841 functions of the form
2842 VQ T& operator++(VQ T&); */
2844 case POSTINCREMENT_EXPR
:
2845 case PREINCREMENT_EXPR
:
2846 case POSTDECREMENT_EXPR
:
2847 case PREDECREMENT_EXPR
:
2852 /* 24There also exist candidate operator functions of the form
2853 bool operator!(bool);
2854 bool operator&&(bool, bool);
2855 bool operator||(bool, bool); */
2857 case TRUTH_NOT_EXPR
:
2858 build_builtin_candidate
2859 (candidates
, fnname
, boolean_type_node
,
2860 NULL_TREE
, args
, argtypes
, flags
, complain
);
2863 case TRUTH_ORIF_EXPR
:
2864 case TRUTH_ANDIF_EXPR
:
2865 build_builtin_candidate
2866 (candidates
, fnname
, boolean_type_node
,
2867 boolean_type_node
, args
, argtypes
, flags
, complain
);
2889 types
[0] = make_tree_vector ();
2890 types
[1] = make_tree_vector ();
2892 for (i
= 0; i
< 2; ++i
)
2896 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
2900 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
2903 convs
= lookup_conversions (argtypes
[i
]);
2905 if (code
== COND_EXPR
)
2907 if (real_lvalue_p (args
[i
]))
2908 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
2910 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
2916 for (; convs
; convs
= TREE_CHAIN (convs
))
2918 type
= TREE_TYPE (convs
);
2921 && (TREE_CODE (type
) != REFERENCE_TYPE
2922 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
2925 if (code
== COND_EXPR
&& TREE_CODE (type
) == REFERENCE_TYPE
)
2926 vec_safe_push (types
[i
], type
);
2928 type
= non_reference (type
);
2929 if (i
!= 0 || ! ref1
)
2931 type
= cv_unqualified (type_decays_to (type
));
2932 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
2933 vec_safe_push (types
[i
], type
);
2934 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2935 type
= type_promotes_to (type
);
2938 if (! vec_member (type
, types
[i
]))
2939 vec_safe_push (types
[i
], type
);
2944 if (code
== COND_EXPR
&& real_lvalue_p (args
[i
]))
2945 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
2946 type
= non_reference (argtypes
[i
]);
2947 if (i
!= 0 || ! ref1
)
2949 type
= cv_unqualified (type_decays_to (type
));
2950 if (enum_p
&& UNSCOPED_ENUM_P (type
))
2951 vec_safe_push (types
[i
], type
);
2952 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2953 type
= type_promotes_to (type
);
2955 vec_safe_push (types
[i
], type
);
2959 /* Run through the possible parameter types of both arguments,
2960 creating candidates with those parameter types. */
2961 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
2966 if (!types
[1]->is_empty ())
2967 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
2968 add_builtin_candidate
2969 (candidates
, code
, code2
, fnname
, t
,
2970 u
, args
, argtypes
, flags
, complain
);
2972 add_builtin_candidate
2973 (candidates
, code
, code2
, fnname
, t
,
2974 NULL_TREE
, args
, argtypes
, flags
, complain
);
2977 release_tree_vector (types
[0]);
2978 release_tree_vector (types
[1]);
2982 /* If TMPL can be successfully instantiated as indicated by
2983 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2985 TMPL is the template. EXPLICIT_TARGS are any explicit template
2986 arguments. ARGLIST is the arguments provided at the call-site.
2987 This does not change ARGLIST. The RETURN_TYPE is the desired type
2988 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
2989 as for add_function_candidate. If an OBJ is supplied, FLAGS and
2990 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
2992 static struct z_candidate
*
2993 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
2994 tree ctype
, tree explicit_targs
, tree first_arg
,
2995 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
2996 tree access_path
, tree conversion_path
,
2997 int flags
, tree obj
, unification_kind_t strict
,
2998 tsubst_flags_t complain
)
3000 int ntparms
= DECL_NTPARMS (tmpl
);
3001 tree targs
= make_tree_vec (ntparms
);
3002 unsigned int len
= vec_safe_length (arglist
);
3003 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
3004 unsigned int skip_without_in_chrg
= 0;
3005 tree first_arg_without_in_chrg
= first_arg
;
3006 tree
*args_without_in_chrg
;
3007 unsigned int nargs_without_in_chrg
;
3008 unsigned int ia
, ix
;
3010 struct z_candidate
*cand
;
3012 struct rejection_reason
*reason
= NULL
;
3015 /* We don't do deduction on the in-charge parameter, the VTT
3016 parameter or 'this'. */
3017 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
3019 if (first_arg_without_in_chrg
!= NULL_TREE
)
3020 first_arg_without_in_chrg
= NULL_TREE
;
3022 ++skip_without_in_chrg
;
3025 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
3026 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
3027 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
3029 if (first_arg_without_in_chrg
!= NULL_TREE
)
3030 first_arg_without_in_chrg
= NULL_TREE
;
3032 ++skip_without_in_chrg
;
3035 if (len
< skip_without_in_chrg
)
3038 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
3039 + (len
- skip_without_in_chrg
));
3040 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
3042 if (first_arg_without_in_chrg
!= NULL_TREE
)
3044 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
3047 for (ix
= skip_without_in_chrg
;
3048 vec_safe_iterate (arglist
, ix
, &arg
);
3051 args_without_in_chrg
[ia
] = arg
;
3054 gcc_assert (ia
== nargs_without_in_chrg
);
3056 errs
= errorcount
+sorrycount
;
3057 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
3058 args_without_in_chrg
,
3059 nargs_without_in_chrg
,
3060 return_type
, strict
, flags
, false,
3061 complain
& tf_decltype
);
3063 if (fn
== error_mark_node
)
3065 if (errorcount
+sorrycount
== errs
)
3066 /* Don't repeat unification later if it already resulted in errors. */
3067 reason
= template_unification_rejection (tmpl
, explicit_targs
,
3068 targs
, args_without_in_chrg
,
3069 nargs_without_in_chrg
,
3070 return_type
, strict
, flags
);
3072 reason
= template_unification_error_rejection ();
3078 A member function template is never instantiated to perform the
3079 copy of a class object to an object of its class type.
3081 It's a little unclear what this means; the standard explicitly
3082 does allow a template to be used to copy a class. For example,
3087 template <class T> A(const T&);
3090 void g () { A a (f ()); }
3092 the member template will be used to make the copy. The section
3093 quoted above appears in the paragraph that forbids constructors
3094 whose only parameter is (a possibly cv-qualified variant of) the
3095 class type, and a logical interpretation is that the intent was
3096 to forbid the instantiation of member templates which would then
3098 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
3100 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
3101 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
3104 reason
= invalid_copy_with_fn_template_rejection ();
3109 if (obj
!= NULL_TREE
)
3110 /* Aha, this is a conversion function. */
3111 cand
= add_conv_candidate (candidates
, fn
, obj
, first_arg
, arglist
,
3112 access_path
, conversion_path
, complain
);
3114 cand
= add_function_candidate (candidates
, fn
, ctype
,
3115 first_arg
, arglist
, access_path
,
3116 conversion_path
, flags
, complain
);
3117 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
3119 /* This situation can occur if a member template of a template
3120 class is specialized. Then, instantiate_template might return
3121 an instantiation of the specialization, in which case the
3122 DECL_TI_TEMPLATE field will point at the original
3123 specialization. For example:
3125 template <class T> struct S { template <class U> void f(U);
3126 template <> void f(int) {}; };
3130 Here, TMPL will be template <class U> S<double>::f(U).
3131 And, instantiate template will give us the specialization
3132 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3133 for this will point at template <class T> template <> S<T>::f(int),
3134 so that we can find the definition. For the purposes of
3135 overload resolution, however, we want the original TMPL. */
3136 cand
->template_decl
= build_template_info (tmpl
, targs
);
3139 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3140 cand
->explicit_targs
= explicit_targs
;
3144 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3145 access_path
, conversion_path
, 0, reason
, flags
);
3149 static struct z_candidate
*
3150 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3151 tree explicit_targs
, tree first_arg
,
3152 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3153 tree access_path
, tree conversion_path
, int flags
,
3154 unification_kind_t strict
, tsubst_flags_t complain
)
3157 add_template_candidate_real (candidates
, tmpl
, ctype
,
3158 explicit_targs
, first_arg
, arglist
,
3159 return_type
, access_path
, conversion_path
,
3160 flags
, NULL_TREE
, strict
, complain
);
3164 static struct z_candidate
*
3165 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3166 tree obj
, tree first_arg
,
3167 const vec
<tree
, va_gc
> *arglist
,
3168 tree return_type
, tree access_path
,
3169 tree conversion_path
, tsubst_flags_t complain
)
3172 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3173 first_arg
, arglist
, return_type
, access_path
,
3174 conversion_path
, 0, obj
, DEDUCE_CONV
,
3178 /* The CANDS are the set of candidates that were considered for
3179 overload resolution. Return the set of viable candidates, or CANDS
3180 if none are viable. If any of the candidates were viable, set
3181 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3182 considered viable only if it is strictly viable. */
3184 static struct z_candidate
*
3185 splice_viable (struct z_candidate
*cands
,
3189 struct z_candidate
*viable
;
3190 struct z_candidate
**last_viable
;
3191 struct z_candidate
**cand
;
3192 bool found_strictly_viable
= false;
3194 /* Be strict inside templates, since build_over_call won't actually
3195 do the conversions to get pedwarns. */
3196 if (processing_template_decl
)
3200 last_viable
= &viable
;
3201 *any_viable_p
= false;
3206 struct z_candidate
*c
= *cand
;
3208 && (c
->viable
== 1 || TREE_CODE (c
->fn
) == TEMPLATE_DECL
))
3210 /* Be strict in the presence of a viable candidate. Also if
3211 there are template candidates, so that we get deduction errors
3212 for them instead of silently preferring a bad conversion. */
3214 if (viable
&& !found_strictly_viable
)
3216 /* Put any spliced near matches back onto the main list so
3217 that we see them if there is no strict match. */
3218 *any_viable_p
= false;
3219 *last_viable
= cands
;
3222 last_viable
= &viable
;
3226 if (strict_p
? c
->viable
== 1 : c
->viable
)
3231 last_viable
= &c
->next
;
3232 *any_viable_p
= true;
3234 found_strictly_viable
= true;
3240 return viable
? viable
: cands
;
3244 any_strictly_viable (struct z_candidate
*cands
)
3246 for (; cands
; cands
= cands
->next
)
3247 if (cands
->viable
== 1)
3252 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3253 words, it is about to become the "this" pointer for a member
3254 function call. Take the address of the object. */
3257 build_this (tree obj
)
3259 /* In a template, we are only concerned about the type of the
3260 expression, so we can take a shortcut. */
3261 if (processing_template_decl
)
3262 return build_address (obj
);
3264 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3267 /* Returns true iff functions are equivalent. Equivalent functions are
3268 not '==' only if one is a function-local extern function or if
3269 both are extern "C". */
3272 equal_functions (tree fn1
, tree fn2
)
3274 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3276 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3278 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3279 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3280 return decls_match (fn1
, fn2
);
3284 /* Print information about a candidate being rejected due to INFO. */
3287 print_conversion_rejection (location_t loc
, struct conversion_info
*info
)
3289 tree from
= info
->from
;
3291 from
= lvalue_type (from
);
3292 if (info
->n_arg
== -1)
3294 /* Conversion of implicit `this' argument failed. */
3295 if (!TYPE_P (info
->from
))
3296 /* A bad conversion for 'this' must be discarding cv-quals. */
3297 inform (loc
, " passing %qT as %<this%> "
3298 "argument discards qualifiers",
3301 inform (loc
, " no known conversion for implicit "
3302 "%<this%> parameter from %qT to %qT",
3303 from
, info
->to_type
);
3305 else if (!TYPE_P (info
->from
))
3307 if (info
->n_arg
>= 0)
3308 inform (loc
, " conversion of argument %d would be ill-formed:",
3310 perform_implicit_conversion (info
->to_type
, info
->from
,
3311 tf_warning_or_error
);
3313 else if (info
->n_arg
== -2)
3314 /* Conversion of conversion function return value failed. */
3315 inform (loc
, " no known conversion from %qT to %qT",
3316 from
, info
->to_type
);
3318 inform (loc
, " no known conversion for argument %d from %qT to %qT",
3319 info
->n_arg
+ 1, from
, info
->to_type
);
3322 /* Print information about a candidate with WANT parameters and we found
3326 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3328 inform_n (loc
, want
,
3329 " candidate expects %d argument, %d provided",
3330 " candidate expects %d arguments, %d provided",
3334 /* Print information about one overload candidate CANDIDATE. MSGSTR
3335 is the text to print before the candidate itself.
3337 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3338 to have been run through gettext by the caller. This wart makes
3339 life simpler in print_z_candidates and for the translators. */
3342 print_z_candidate (location_t loc
, const char *msgstr
,
3343 struct z_candidate
*candidate
)
3345 const char *msg
= (msgstr
== NULL
3347 : ACONCAT ((msgstr
, " ", NULL
)));
3348 location_t cloc
= location_of (candidate
->fn
);
3350 if (identifier_p (candidate
->fn
))
3353 if (candidate
->num_convs
== 3)
3354 inform (cloc
, "%s%D(%T, %T, %T) <built-in>", msg
, candidate
->fn
,
3355 candidate
->convs
[0]->type
,
3356 candidate
->convs
[1]->type
,
3357 candidate
->convs
[2]->type
);
3358 else if (candidate
->num_convs
== 2)
3359 inform (cloc
, "%s%D(%T, %T) <built-in>", msg
, candidate
->fn
,
3360 candidate
->convs
[0]->type
,
3361 candidate
->convs
[1]->type
);
3363 inform (cloc
, "%s%D(%T) <built-in>", msg
, candidate
->fn
,
3364 candidate
->convs
[0]->type
);
3366 else if (TYPE_P (candidate
->fn
))
3367 inform (cloc
, "%s%T <conversion>", msg
, candidate
->fn
);
3368 else if (candidate
->viable
== -1)
3369 inform (cloc
, "%s%#D <near match>", msg
, candidate
->fn
);
3370 else if (DECL_DELETED_FN (candidate
->fn
))
3371 inform (cloc
, "%s%#D <deleted>", msg
, candidate
->fn
);
3373 inform (cloc
, "%s%#D", msg
, candidate
->fn
);
3374 /* Give the user some information about why this candidate failed. */
3375 if (candidate
->reason
!= NULL
)
3377 struct rejection_reason
*r
= candidate
->reason
;
3382 print_arity_information (cloc
, r
->u
.arity
.actual
,
3383 r
->u
.arity
.expected
);
3385 case rr_arg_conversion
:
3386 print_conversion_rejection (cloc
, &r
->u
.conversion
);
3388 case rr_bad_arg_conversion
:
3389 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
);
3391 case rr_explicit_conversion
:
3392 inform (cloc
, " return type %qT of explicit conversion function "
3393 "cannot be converted to %qT with a qualification "
3394 "conversion", r
->u
.conversion
.from
,
3395 r
->u
.conversion
.to_type
);
3397 case rr_template_conversion
:
3398 inform (cloc
, " conversion from return type %qT of template "
3399 "conversion function specialization to %qT is not an "
3400 "exact match", r
->u
.conversion
.from
,
3401 r
->u
.conversion
.to_type
);
3403 case rr_template_unification
:
3404 /* We use template_unification_error_rejection if unification caused
3405 actual non-SFINAE errors, in which case we don't need to repeat
3407 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3409 inform (cloc
, " substitution of deduced template arguments "
3410 "resulted in errors seen above");
3413 /* Re-run template unification with diagnostics. */
3414 inform (cloc
, " template argument deduction/substitution failed:");
3415 fn_type_unification (r
->u
.template_unification
.tmpl
,
3416 r
->u
.template_unification
.explicit_targs
,
3418 (r
->u
.template_unification
.num_targs
)),
3419 r
->u
.template_unification
.args
,
3420 r
->u
.template_unification
.nargs
,
3421 r
->u
.template_unification
.return_type
,
3422 r
->u
.template_unification
.strict
,
3423 r
->u
.template_unification
.flags
,
3426 case rr_invalid_copy
:
3428 " a constructor taking a single argument of its own "
3429 "class type is invalid");
3431 case rr_constraint_failure
:
3433 tree tmpl
= r
->u
.template_instantiation
.tmpl
;
3434 tree args
= r
->u
.template_instantiation
.targs
;
3435 diagnose_constraints (cloc
, tmpl
, args
);
3440 /* This candidate didn't have any issues or we failed to
3441 handle a particular code. Either way... */
3448 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3450 struct z_candidate
*cand1
;
3451 struct z_candidate
**cand2
;
3457 /* Remove non-viable deleted candidates. */
3459 for (cand2
= &cand1
; *cand2
; )
3461 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3462 && !(*cand2
)->viable
3463 && DECL_DELETED_FN ((*cand2
)->fn
))
3464 *cand2
= (*cand2
)->next
;
3466 cand2
= &(*cand2
)->next
;
3468 /* ...if there are any non-deleted ones. */
3472 /* There may be duplicates in the set of candidates. We put off
3473 checking this condition as long as possible, since we have no way
3474 to eliminate duplicates from a set of functions in less than n^2
3475 time. Now we are about to emit an error message, so it is more
3476 permissible to go slowly. */
3477 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3479 tree fn
= cand1
->fn
;
3480 /* Skip builtin candidates and conversion functions. */
3483 cand2
= &cand1
->next
;
3486 if (DECL_P ((*cand2
)->fn
)
3487 && equal_functions (fn
, (*cand2
)->fn
))
3488 *cand2
= (*cand2
)->next
;
3490 cand2
= &(*cand2
)->next
;
3494 for (n_candidates
= 0, cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3497 for (; candidates
; candidates
= candidates
->next
)
3498 print_z_candidate (loc
, "candidate:", candidates
);
3501 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3502 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3503 the result of the conversion function to convert it to the final
3504 desired type. Merge the two sequences into a single sequence,
3505 and return the merged sequence. */
3508 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3511 bool bad
= user_seq
->bad_p
;
3513 gcc_assert (user_seq
->kind
== ck_user
);
3515 /* Find the end of the second conversion sequence. */
3516 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3518 /* The entire sequence is a user-conversion sequence. */
3519 (*t
)->user_conv_p
= true;
3524 /* Replace the identity conversion with the user conversion
3531 /* Handle overload resolution for initializing an object of class type from
3532 an initializer list. First we look for a suitable constructor that
3533 takes a std::initializer_list; if we don't find one, we then look for a
3534 non-list constructor.
3536 Parameters are as for add_candidates, except that the arguments are in
3537 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3538 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3541 add_list_candidates (tree fns
, tree first_arg
,
3542 tree init_list
, tree totype
,
3543 tree explicit_targs
, bool template_only
,
3544 tree conversion_path
, tree access_path
,
3546 struct z_candidate
**candidates
,
3547 tsubst_flags_t complain
)
3549 vec
<tree
, va_gc
> *args
;
3551 gcc_assert (*candidates
== NULL
);
3553 /* We're looking for a ctor for list-initialization. */
3554 flags
|= LOOKUP_LIST_INIT_CTOR
;
3555 /* And we don't allow narrowing conversions. We also use this flag to
3556 avoid the copy constructor call for copy-list-initialization. */
3557 flags
|= LOOKUP_NO_NARROWING
;
3559 /* Always use the default constructor if the list is empty (DR 990). */
3560 if (CONSTRUCTOR_NELTS (init_list
) == 0
3561 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3563 /* If the class has a list ctor, try passing the list as a single
3564 argument first, but only consider list ctors. */
3565 else if (TYPE_HAS_LIST_CTOR (totype
))
3567 flags
|= LOOKUP_LIST_ONLY
;
3568 args
= make_tree_vector_single (init_list
);
3569 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3570 explicit_targs
, template_only
, conversion_path
,
3571 access_path
, flags
, candidates
, complain
);
3572 if (any_strictly_viable (*candidates
))
3576 args
= ctor_to_vec (init_list
);
3578 /* We aren't looking for list-ctors anymore. */
3579 flags
&= ~LOOKUP_LIST_ONLY
;
3580 /* We allow more user-defined conversions within an init-list. */
3581 flags
&= ~LOOKUP_NO_CONVERSION
;
3583 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3584 explicit_targs
, template_only
, conversion_path
,
3585 access_path
, flags
, candidates
, complain
);
3588 /* Returns the best overload candidate to perform the requested
3589 conversion. This function is used for three the overloading situations
3590 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3591 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3592 per [dcl.init.ref], so we ignore temporary bindings. */
3594 static struct z_candidate
*
3595 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3596 tsubst_flags_t complain
)
3598 struct z_candidate
*candidates
, *cand
;
3600 tree ctors
= NULL_TREE
;
3601 tree conv_fns
= NULL_TREE
;
3602 conversion
*conv
= NULL
;
3603 tree first_arg
= NULL_TREE
;
3604 vec
<tree
, va_gc
> *args
= NULL
;
3611 fromtype
= TREE_TYPE (expr
);
3613 /* We represent conversion within a hierarchy using RVALUE_CONV and
3614 BASE_CONV, as specified by [over.best.ics]; these become plain
3615 constructor calls, as specified in [dcl.init]. */
3616 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3617 || !DERIVED_FROM_P (totype
, fromtype
));
3619 if (MAYBE_CLASS_TYPE_P (totype
))
3620 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3621 creating a garbage BASELINK; constructors can't be inherited. */
3622 ctors
= lookup_fnfields_slot (totype
, complete_ctor_identifier
);
3624 if (MAYBE_CLASS_TYPE_P (fromtype
))
3626 tree to_nonref
= non_reference (totype
);
3627 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3628 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3629 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3631 /* [class.conv.fct] A conversion function is never used to
3632 convert a (possibly cv-qualified) object to the (possibly
3633 cv-qualified) same object type (or a reference to it), to a
3634 (possibly cv-qualified) base class of that type (or a
3635 reference to it)... */
3638 conv_fns
= lookup_conversions (fromtype
);
3642 flags
|= LOOKUP_NO_CONVERSION
;
3643 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3644 flags
|= LOOKUP_NO_NARROWING
;
3646 /* It's OK to bind a temporary for converting constructor arguments, but
3647 not in converting the return value of a conversion operator. */
3648 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
);
3649 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3653 int ctorflags
= flags
;
3655 first_arg
= build_dummy_object (totype
);
3657 /* We should never try to call the abstract or base constructor
3659 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors
))
3660 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors
)));
3662 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3664 /* List-initialization. */
3665 add_list_candidates (ctors
, first_arg
, expr
, totype
, NULL_TREE
,
3666 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3667 ctorflags
, &candidates
, complain
);
3671 args
= make_tree_vector_single (expr
);
3672 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3673 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3674 ctorflags
, &candidates
, complain
);
3677 for (cand
= candidates
; cand
; cand
= cand
->next
)
3679 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3681 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3682 set, then this is copy-initialization. In that case, "The
3683 result of the call is then used to direct-initialize the
3684 object that is the destination of the copy-initialization."
3687 We represent this in the conversion sequence with an
3688 rvalue conversion, which means a constructor call. */
3689 if (TREE_CODE (totype
) != REFERENCE_TYPE
3690 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3692 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3699 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3701 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3702 struct z_candidate
*old_candidates
;
3704 /* If we are called to convert to a reference type, we are trying to
3705 find a direct binding, so don't even consider temporaries. If
3706 we don't find a direct binding, the caller will try again to
3707 look for a temporary binding. */
3708 if (TREE_CODE (totype
) == REFERENCE_TYPE
)
3709 convflags
|= LOOKUP_NO_TEMP_BIND
;
3711 old_candidates
= candidates
;
3712 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
3714 conversion_path
, TYPE_BINFO (fromtype
),
3715 flags
, &candidates
, complain
);
3717 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
3719 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
3721 = implicit_conversion (totype
,
3724 /*c_cast_p=*/false, convflags
,
3727 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3728 copy-initialization. In that case, "The result of the
3729 call is then used to direct-initialize the object that is
3730 the destination of the copy-initialization." [dcl.init]
3732 We represent this in the conversion sequence with an
3733 rvalue conversion, which means a constructor call. But
3734 don't add a second rvalue conversion if there's already
3735 one there. Which there really shouldn't be, but it's
3736 harmless since we'd add it here anyway. */
3737 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
3738 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3739 ics
= build_conv (ck_rvalue
, totype
, ics
);
3741 cand
->second_conv
= ics
;
3746 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -2,
3749 else if (DECL_NONCONVERTING_P (cand
->fn
)
3750 && ics
->rank
> cr_exact
)
3752 /* 13.3.1.5: For direct-initialization, those explicit
3753 conversion functions that are not hidden within S and
3754 yield type T or a type that can be converted to type T
3755 with a qualification conversion (4.4) are also candidate
3757 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3758 I've raised this issue with the committee. --jason 9/2011 */
3760 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
3762 else if (cand
->viable
== 1 && ics
->bad_p
)
3766 = bad_arg_conversion_rejection (NULL_TREE
, -2,
3769 else if (primary_template_instantiation_p (cand
->fn
)
3770 && ics
->rank
> cr_exact
)
3772 /* 13.3.3.1.2: If the user-defined conversion is specified by
3773 a specialization of a conversion function template, the
3774 second standard conversion sequence shall have exact match
3777 cand
->reason
= template_conversion_rejection (rettype
, totype
);
3782 candidates
= splice_viable (candidates
, false, &any_viable_p
);
3786 release_tree_vector (args
);
3790 cand
= tourney (candidates
, complain
);
3793 if (complain
& tf_error
)
3795 error ("conversion from %qT to %qT is ambiguous",
3797 print_z_candidates (location_of (expr
), candidates
);
3800 cand
= candidates
; /* any one will do */
3801 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
3802 cand
->second_conv
->user_conv_p
= true;
3803 if (!any_strictly_viable (candidates
))
3804 cand
->second_conv
->bad_p
= true;
3805 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3806 ambiguous conversion is no worse than another user-defined
3813 if (!DECL_CONSTRUCTOR_P (cand
->fn
))
3814 convtype
= non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)));
3815 else if (cand
->second_conv
->kind
== ck_rvalue
)
3816 /* DR 5: [in the first step of copy-initialization]...if the function
3817 is a constructor, the call initializes a temporary of the
3818 cv-unqualified version of the destination type. */
3819 convtype
= cv_unqualified (totype
);
3822 /* Build the user conversion sequence. */
3826 build_identity_conv (TREE_TYPE (expr
), expr
));
3828 if (cand
->viable
== -1)
3831 /* Remember that this was a list-initialization. */
3832 if (flags
& LOOKUP_NO_NARROWING
)
3833 conv
->check_narrowing
= true;
3835 /* Combine it with the second conversion sequence. */
3836 cand
->second_conv
= merge_conversion_sequences (conv
,
3842 /* Wrapper for above. */
3845 build_user_type_conversion (tree totype
, tree expr
, int flags
,
3846 tsubst_flags_t complain
)
3848 struct z_candidate
*cand
;
3851 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
3852 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
3856 if (cand
->second_conv
->kind
== ck_ambig
)
3857 ret
= error_mark_node
;
3860 expr
= convert_like (cand
->second_conv
, expr
, complain
);
3861 ret
= convert_from_reference (expr
);
3867 timevar_cond_stop (TV_OVERLOAD
, subtime
);
3871 /* Subroutine of convert_nontype_argument.
3873 EXPR is an argument for a template non-type parameter of integral or
3874 enumeration type. Do any necessary conversions (that are permitted for
3875 non-type arguments) to convert it to the parameter type.
3877 If conversion is successful, returns the converted expression;
3878 otherwise, returns error_mark_node. */
3881 build_integral_nontype_arg_conv (tree type
, tree expr
, tsubst_flags_t complain
)
3886 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
3888 if (error_operand_p (expr
))
3889 return error_mark_node
;
3891 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
3893 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3894 p
= conversion_obstack_alloc (0);
3896 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
3898 LOOKUP_IMPLICIT
, complain
);
3900 /* for a non-type template-parameter of integral or
3901 enumeration type, integral promotions (4.5) and integral
3902 conversions (4.7) are applied. */
3903 /* It should be sufficient to check the outermost conversion step, since
3904 there are no qualification conversions to integer type. */
3908 /* A conversion function is OK. If it isn't constexpr, we'll
3909 complain later that the argument isn't constant. */
3911 /* The lvalue-to-rvalue conversion is OK. */
3917 t
= next_conversion (conv
)->type
;
3918 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
))
3921 if (complain
& tf_error
)
3922 error_at (loc
, "conversion from %qT to %qT not considered for "
3923 "non-type template argument", t
, type
);
3924 /* and fall through. */
3932 expr
= convert_like (conv
, expr
, complain
);
3934 expr
= error_mark_node
;
3936 /* Free all the conversions we allocated. */
3937 obstack_free (&conversion_obstack
, p
);
3942 /* Do any initial processing on the arguments to a function call. */
3944 static vec
<tree
, va_gc
> *
3945 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
3950 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
3952 if (error_operand_p (arg
))
3954 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
3956 if (complain
& tf_error
)
3957 error ("invalid use of void expression");
3960 else if (invalid_nonstatic_memfn_p (arg
, complain
))
3966 /* Perform overload resolution on FN, which is called with the ARGS.
3968 Return the candidate function selected by overload resolution, or
3969 NULL if the event that overload resolution failed. In the case
3970 that overload resolution fails, *CANDIDATES will be the set of
3971 candidates considered, and ANY_VIABLE_P will be set to true or
3972 false to indicate whether or not any of the candidates were
3975 The ARGS should already have gone through RESOLVE_ARGS before this
3976 function is called. */
3978 static struct z_candidate
*
3979 perform_overload_resolution (tree fn
,
3980 const vec
<tree
, va_gc
> *args
,
3981 struct z_candidate
**candidates
,
3982 bool *any_viable_p
, tsubst_flags_t complain
)
3984 struct z_candidate
*cand
;
3985 tree explicit_targs
;
3988 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
3990 explicit_targs
= NULL_TREE
;
3994 *any_viable_p
= true;
3997 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
3998 || TREE_CODE (fn
) == TEMPLATE_DECL
3999 || TREE_CODE (fn
) == OVERLOAD
4000 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
4002 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4004 explicit_targs
= TREE_OPERAND (fn
, 1);
4005 fn
= TREE_OPERAND (fn
, 0);
4009 /* Add the various candidate functions. */
4010 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
4011 explicit_targs
, template_only
,
4012 /*conversion_path=*/NULL_TREE
,
4013 /*access_path=*/NULL_TREE
,
4015 candidates
, complain
);
4017 *candidates
= splice_viable (*candidates
, false, any_viable_p
);
4019 cand
= tourney (*candidates
, complain
);
4023 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4027 /* Print an error message about being unable to build a call to FN with
4028 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4029 be located; CANDIDATES is a possibly empty list of such
4033 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
,
4034 struct z_candidate
*candidates
)
4036 tree name
= DECL_NAME (OVL_CURRENT (fn
));
4037 location_t loc
= location_of (name
);
4039 if (!any_strictly_viable (candidates
))
4040 error_at (loc
, "no matching function for call to %<%D(%A)%>",
4041 name
, build_tree_list_vec (args
));
4043 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
4044 name
, build_tree_list_vec (args
));
4046 print_z_candidates (loc
, candidates
);
4049 /* Return an expression for a call to FN (a namespace-scope function,
4050 or a static member function) with the ARGS. This may change
4054 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
, bool koenig_p
,
4055 tsubst_flags_t complain
)
4057 struct z_candidate
*candidates
, *cand
;
4062 if (args
!= NULL
&& *args
!= NULL
)
4064 *args
= resolve_args (*args
, complain
);
4066 return error_mark_node
;
4070 tm_malloc_replacement (fn
);
4072 /* If this function was found without using argument dependent
4073 lookup, then we want to ignore any undeclared friend
4079 fn
= remove_hidden_names (fn
);
4082 if (complain
& tf_error
)
4083 print_error_for_call_failure (orig_fn
, *args
, NULL
);
4084 return error_mark_node
;
4088 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4089 p
= conversion_obstack_alloc (0);
4091 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
4096 if (complain
& tf_error
)
4098 if (!any_viable_p
&& candidates
&& ! candidates
->next
4099 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
4100 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
4101 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4102 fn
= TREE_OPERAND (fn
, 0);
4103 print_error_for_call_failure (fn
, *args
, candidates
);
4105 result
= error_mark_node
;
4109 int flags
= LOOKUP_NORMAL
;
4110 /* If fn is template_id_expr, the call has explicit template arguments
4111 (e.g. func<int>(5)), communicate this info to build_over_call
4112 through flags so that later we can use it to decide whether to warn
4113 about peculiar null pointer conversion. */
4114 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4115 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4116 result
= build_over_call (cand
, flags
, complain
);
4119 /* Free all the conversions we allocated. */
4120 obstack_free (&conversion_obstack
, p
);
4125 /* Build a call to a global operator new. FNNAME is the name of the
4126 operator (either "operator new" or "operator new[]") and ARGS are
4127 the arguments provided. This may change ARGS. *SIZE points to the
4128 total number of bytes required by the allocation, and is updated if
4129 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4130 be used. If this function determines that no cookie should be
4131 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4132 is not NULL_TREE, it is evaluated before calculating the final
4133 array size, and if it fails, the array size is replaced with
4134 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4135 is non-NULL, it will be set, upon return, to the allocation
4139 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4140 tree
*size
, tree
*cookie_size
, tree size_check
,
4141 tree
*fn
, tsubst_flags_t complain
)
4143 tree original_size
= *size
;
4145 struct z_candidate
*candidates
;
4146 struct z_candidate
*cand
;
4151 /* Set to (size_t)-1 if the size check fails. */
4152 if (size_check
!= NULL_TREE
)
4154 tree errval
= TYPE_MAX_VALUE (sizetype
);
4155 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4156 errval
= throw_bad_array_new_length ();
4157 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4158 original_size
, errval
);
4160 vec_safe_insert (*args
, 0, *size
);
4161 *args
= resolve_args (*args
, complain
);
4163 return error_mark_node
;
4169 If this lookup fails to find the name, or if the allocated type
4170 is not a class type, the allocation function's name is looked
4171 up in the global scope.
4173 we disregard block-scope declarations of "operator new". */
4174 fns
= lookup_function_nonclass (fnname
, *args
, /*block_p=*/false);
4176 /* Figure out what function is being called. */
4177 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
4180 /* If no suitable function could be found, issue an error message
4184 if (complain
& tf_error
)
4185 print_error_for_call_failure (fns
, *args
, candidates
);
4186 return error_mark_node
;
4189 /* If a cookie is required, add some extra space. Whether
4190 or not a cookie is required cannot be determined until
4191 after we know which function was called. */
4194 bool use_cookie
= true;
4197 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4198 /* Skip the size_t parameter. */
4199 arg_types
= TREE_CHAIN (arg_types
);
4200 /* Check the remaining parameters (if any). */
4202 && TREE_CHAIN (arg_types
) == void_list_node
4203 && same_type_p (TREE_VALUE (arg_types
),
4206 /* If we need a cookie, adjust the number of bytes allocated. */
4209 /* Update the total size. */
4210 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4211 /* Set to (size_t)-1 if the size check fails. */
4212 gcc_assert (size_check
!= NULL_TREE
);
4213 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4214 *size
, TYPE_MAX_VALUE (sizetype
));
4215 /* Update the argument list to reflect the adjusted size. */
4216 (**args
)[0] = *size
;
4219 *cookie_size
= NULL_TREE
;
4222 /* Tell our caller which function we decided to call. */
4226 /* Build the CALL_EXPR. */
4227 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4230 /* Build a new call to operator(). This may change ARGS. */
4233 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4235 struct z_candidate
*candidates
= 0, *cand
;
4236 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4237 tree type
= TREE_TYPE (obj
);
4239 tree result
= NULL_TREE
;
4242 if (error_operand_p (obj
))
4243 return error_mark_node
;
4245 obj
= prep_operand (obj
);
4247 if (TYPE_PTRMEMFUNC_P (type
))
4249 if (complain
& tf_error
)
4250 /* It's no good looking for an overloaded operator() on a
4251 pointer-to-member-function. */
4252 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj
);
4253 return error_mark_node
;
4256 if (TYPE_BINFO (type
))
4258 fns
= lookup_fnfields (TYPE_BINFO (type
), ansi_opname (CALL_EXPR
), 1);
4259 if (fns
== error_mark_node
)
4260 return error_mark_node
;
4265 if (args
!= NULL
&& *args
!= NULL
)
4267 *args
= resolve_args (*args
, complain
);
4269 return error_mark_node
;
4272 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4273 p
= conversion_obstack_alloc (0);
4277 first_mem_arg
= obj
;
4279 add_candidates (BASELINK_FUNCTIONS (fns
),
4280 first_mem_arg
, *args
, NULL_TREE
,
4282 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4283 LOOKUP_NORMAL
, &candidates
, complain
);
4286 convs
= lookup_conversions (type
);
4288 for (; convs
; convs
= TREE_CHAIN (convs
))
4290 tree fns
= TREE_VALUE (convs
);
4291 tree totype
= TREE_TYPE (convs
);
4293 if (TYPE_PTRFN_P (totype
)
4294 || TYPE_REFFN_P (totype
)
4295 || (TREE_CODE (totype
) == REFERENCE_TYPE
4296 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4297 for (; fns
; fns
= OVL_NEXT (fns
))
4299 tree fn
= OVL_CURRENT (fns
);
4301 if (DECL_NONCONVERTING_P (fn
))
4304 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4305 add_template_conv_candidate
4306 (&candidates
, fn
, obj
, NULL_TREE
, *args
, totype
,
4307 /*access_path=*/NULL_TREE
,
4308 /*conversion_path=*/NULL_TREE
, complain
);
4310 add_conv_candidate (&candidates
, fn
, obj
, NULL_TREE
,
4311 *args
, /*conversion_path=*/NULL_TREE
,
4312 /*access_path=*/NULL_TREE
, complain
);
4316 /* Be strict here because if we choose a bad conversion candidate, the
4317 errors we get won't mention the call context. */
4318 candidates
= splice_viable (candidates
, true, &any_viable_p
);
4321 if (complain
& tf_error
)
4323 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4324 build_tree_list_vec (*args
));
4325 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4327 result
= error_mark_node
;
4331 cand
= tourney (candidates
, complain
);
4334 if (complain
& tf_error
)
4336 error ("call of %<(%T) (%A)%> is ambiguous",
4337 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4338 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4340 result
= error_mark_node
;
4342 /* Since cand->fn will be a type, not a function, for a conversion
4343 function, we must be careful not to unconditionally look at
4345 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4346 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
) == CALL_EXPR
)
4347 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4350 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
, -1,
4352 obj
= convert_from_reference (obj
);
4353 result
= cp_build_function_call_vec (obj
, args
, complain
);
4357 /* Free all the conversions we allocated. */
4358 obstack_free (&conversion_obstack
, p
);
4363 /* Wrapper for above. */
4366 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4369 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4370 ret
= build_op_call_1 (obj
, args
, complain
);
4371 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4375 /* Called by op_error to prepare format strings suitable for the error
4376 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4377 and a suffix (controlled by NTYPES). */
4380 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4384 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4385 : G_("no match for "), errmsg
, NULL
);
4388 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4389 else if (ntypes
== 2)
4390 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4392 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4398 op_error (location_t loc
, enum tree_code code
, enum tree_code code2
,
4399 tree arg1
, tree arg2
, tree arg3
, bool match
)
4403 if (code
== MODIFY_EXPR
)
4404 opname
= assignment_operator_name_info
[code2
].name
;
4406 opname
= operator_name_info
[code
].name
;
4411 if (flag_diagnostics_show_caret
)
4412 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4414 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4416 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4417 "in %<%E ? %E : %E%>"), 3, match
),
4419 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4422 case POSTINCREMENT_EXPR
:
4423 case POSTDECREMENT_EXPR
:
4424 if (flag_diagnostics_show_caret
)
4425 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4426 opname
, TREE_TYPE (arg1
));
4428 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4430 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4434 if (flag_diagnostics_show_caret
)
4435 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4436 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4438 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4440 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4445 if (flag_diagnostics_show_caret
)
4446 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4447 opname
, TREE_TYPE (arg1
));
4449 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4450 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4455 if (flag_diagnostics_show_caret
)
4456 error_at (loc
, op_error_string (G_("%<operator%s%>"), 2, match
),
4457 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4459 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4461 opname
, arg1
, opname
, arg2
,
4462 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4464 if (flag_diagnostics_show_caret
)
4465 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4466 opname
, TREE_TYPE (arg1
));
4468 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4470 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4475 /* Return the implicit conversion sequence that could be used to
4476 convert E1 to E2 in [expr.cond]. */
4479 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4481 tree t1
= non_reference (TREE_TYPE (e1
));
4482 tree t2
= non_reference (TREE_TYPE (e2
));
4488 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4489 implicitly converted (clause _conv_) to the type "lvalue reference to
4490 T2", subject to the constraint that in the conversion the
4491 reference must bind directly (_dcl.init.ref_) to an lvalue.
4493 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4494 implicitly converted to the type "rvalue reference to T2", subject to
4495 the constraint that the reference must bind directly. */
4496 if (lvalue_or_rvalue_with_address_p (e2
))
4498 tree rtype
= cp_build_reference_type (t2
, !real_lvalue_p (e2
));
4499 conv
= implicit_conversion (rtype
,
4503 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4504 |LOOKUP_ONLYCONVERTING
,
4506 if (conv
&& !conv
->bad_p
)
4510 /* If E2 is a prvalue or if neither of the conversions above can be done
4511 and at least one of the operands has (possibly cv-qualified) class
4513 if (!CLASS_TYPE_P (t1
) && !CLASS_TYPE_P (t2
))
4518 If E1 and E2 have class type, and the underlying class types are
4519 the same or one is a base class of the other: E1 can be converted
4520 to match E2 if the class of T2 is the same type as, or a base
4521 class of, the class of T1, and the cv-qualification of T2 is the
4522 same cv-qualification as, or a greater cv-qualification than, the
4523 cv-qualification of T1. If the conversion is applied, E1 is
4524 changed to an rvalue of type T2 that still refers to the original
4525 source class object (or the appropriate subobject thereof). */
4526 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4527 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4529 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4531 conv
= build_identity_conv (t1
, e1
);
4532 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4533 TYPE_MAIN_VARIANT (t2
)))
4534 conv
= build_conv (ck_base
, t2
, conv
);
4536 conv
= build_conv (ck_rvalue
, t2
, conv
);
4545 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4546 converted to the type that expression E2 would have if E2 were
4547 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4548 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4549 LOOKUP_IMPLICIT
, complain
);
4552 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4553 arguments to the conditional expression. */
4556 build_conditional_expr_1 (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
4557 tsubst_flags_t complain
)
4561 tree result
= NULL_TREE
;
4562 tree result_type
= NULL_TREE
;
4563 bool lvalue_p
= true;
4564 struct z_candidate
*candidates
= 0;
4565 struct z_candidate
*cand
;
4567 tree orig_arg2
, orig_arg3
;
4569 /* As a G++ extension, the second argument to the conditional can be
4570 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4571 c'.) If the second operand is omitted, make sure it is
4572 calculated only once. */
4575 if (complain
& tf_error
)
4576 pedwarn (loc
, OPT_Wpedantic
,
4577 "ISO C++ forbids omitting the middle term of a ?: expression");
4579 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4580 if (real_lvalue_p (arg1
))
4581 arg2
= arg1
= stabilize_reference (arg1
);
4583 arg2
= arg1
= save_expr (arg1
);
4586 /* If something has already gone wrong, just pass that fact up the
4588 if (error_operand_p (arg1
)
4589 || error_operand_p (arg2
)
4590 || error_operand_p (arg3
))
4591 return error_mark_node
;
4596 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
4598 arg1
= force_rvalue (arg1
, complain
);
4599 arg2
= force_rvalue (arg2
, complain
);
4600 arg3
= force_rvalue (arg3
, complain
);
4602 /* force_rvalue can return error_mark on valid arguments. */
4603 if (error_operand_p (arg1
)
4604 || error_operand_p (arg2
)
4605 || error_operand_p (arg3
))
4606 return error_mark_node
;
4608 tree arg1_type
= TREE_TYPE (arg1
);
4609 arg2_type
= TREE_TYPE (arg2
);
4610 arg3_type
= TREE_TYPE (arg3
);
4612 if (TREE_CODE (arg2_type
) != VECTOR_TYPE
4613 && TREE_CODE (arg3_type
) != VECTOR_TYPE
)
4615 /* Rely on the error messages of the scalar version. */
4616 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
4617 orig_arg2
, orig_arg3
, complain
);
4618 if (scal
== error_mark_node
)
4619 return error_mark_node
;
4620 tree stype
= TREE_TYPE (scal
);
4621 tree ctype
= TREE_TYPE (arg1_type
);
4622 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
4623 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
4625 if (complain
& tf_error
)
4626 error_at (loc
, "inferred scalar type %qT is not an integer or "
4627 "floating point type of the same size as %qT", stype
,
4628 COMPARISON_CLASS_P (arg1
)
4629 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
4631 return error_mark_node
;
4634 tree vtype
= build_opaque_vector_type (stype
,
4635 TYPE_VECTOR_SUBPARTS (arg1_type
));
4636 /* We could pass complain & tf_warning to unsafe_conversion_p,
4637 but the warnings (like Wsign-conversion) have already been
4638 given by the scalar build_conditional_expr_1. We still check
4639 unsafe_conversion_p to forbid truncating long long -> float. */
4640 if (unsafe_conversion_p (loc
, stype
, arg2
, false))
4642 if (complain
& tf_error
)
4643 error_at (loc
, "conversion of scalar %qT to vector %qT "
4644 "involves truncation", arg2_type
, vtype
);
4645 return error_mark_node
;
4647 if (unsafe_conversion_p (loc
, stype
, arg3
, false))
4649 if (complain
& tf_error
)
4650 error_at (loc
, "conversion of scalar %qT to vector %qT "
4651 "involves truncation", arg3_type
, vtype
);
4652 return error_mark_node
;
4655 arg2
= cp_convert (stype
, arg2
, complain
);
4656 arg2
= save_expr (arg2
);
4657 arg2
= build_vector_from_val (vtype
, arg2
);
4659 arg3
= cp_convert (stype
, arg3
, complain
);
4660 arg3
= save_expr (arg3
);
4661 arg3
= build_vector_from_val (vtype
, arg3
);
4665 if ((TREE_CODE (arg2_type
) == VECTOR_TYPE
)
4666 != (TREE_CODE (arg3_type
) == VECTOR_TYPE
))
4668 enum stv_conv convert_flag
=
4669 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
4670 complain
& tf_error
);
4672 switch (convert_flag
)
4675 return error_mark_node
;
4678 arg2
= save_expr (arg2
);
4679 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
4680 arg2
= build_vector_from_val (arg3_type
, arg2
);
4681 arg2_type
= TREE_TYPE (arg2
);
4686 arg3
= save_expr (arg3
);
4687 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
4688 arg3
= build_vector_from_val (arg2_type
, arg3
);
4689 arg3_type
= TREE_TYPE (arg3
);
4697 if (!same_type_p (arg2_type
, arg3_type
)
4698 || TYPE_VECTOR_SUBPARTS (arg1_type
)
4699 != TYPE_VECTOR_SUBPARTS (arg2_type
)
4700 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
4702 if (complain
& tf_error
)
4704 "incompatible vector types in conditional expression: "
4705 "%qT, %qT and %qT", TREE_TYPE (arg1
),
4706 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
4707 return error_mark_node
;
4710 if (!COMPARISON_CLASS_P (arg1
))
4711 arg1
= cp_build_binary_op (loc
, NE_EXPR
, arg1
,
4712 build_zero_cst (arg1_type
), complain
);
4713 return fold_build3 (VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
4718 The first expression is implicitly converted to bool (clause
4720 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
4722 if (error_operand_p (arg1
))
4723 return error_mark_node
;
4727 If either the second or the third operand has type (possibly
4728 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4729 array-to-pointer (_conv.array_), and function-to-pointer
4730 (_conv.func_) standard conversions are performed on the second
4731 and third operands. */
4732 arg2_type
= unlowered_expr_type (arg2
);
4733 arg3_type
= unlowered_expr_type (arg3
);
4734 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
4736 /* Do the conversions. We don't these for `void' type arguments
4737 since it can't have any effect and since decay_conversion
4738 does not handle that case gracefully. */
4739 if (!VOID_TYPE_P (arg2_type
))
4740 arg2
= decay_conversion (arg2
, complain
);
4741 if (!VOID_TYPE_P (arg3_type
))
4742 arg3
= decay_conversion (arg3
, complain
);
4743 arg2_type
= TREE_TYPE (arg2
);
4744 arg3_type
= TREE_TYPE (arg3
);
4748 One of the following shall hold:
4750 --The second or the third operand (but not both) is a
4751 throw-expression (_except.throw_); the result is of the
4752 type of the other and is an rvalue.
4754 --Both the second and the third operands have type void; the
4755 result is of type void and is an rvalue.
4757 We must avoid calling force_rvalue for expressions of type
4758 "void" because it will complain that their value is being
4760 if (TREE_CODE (arg2
) == THROW_EXPR
4761 && TREE_CODE (arg3
) != THROW_EXPR
)
4763 if (!VOID_TYPE_P (arg3_type
))
4765 arg3
= force_rvalue (arg3
, complain
);
4766 if (arg3
== error_mark_node
)
4767 return error_mark_node
;
4769 arg3_type
= TREE_TYPE (arg3
);
4770 result_type
= arg3_type
;
4772 else if (TREE_CODE (arg2
) != THROW_EXPR
4773 && TREE_CODE (arg3
) == THROW_EXPR
)
4775 if (!VOID_TYPE_P (arg2_type
))
4777 arg2
= force_rvalue (arg2
, complain
);
4778 if (arg2
== error_mark_node
)
4779 return error_mark_node
;
4781 arg2_type
= TREE_TYPE (arg2
);
4782 result_type
= arg2_type
;
4784 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
4785 result_type
= void_type_node
;
4788 if (complain
& tf_error
)
4790 if (VOID_TYPE_P (arg2_type
))
4791 error_at (EXPR_LOC_OR_LOC (arg3
, loc
),
4792 "second operand to the conditional operator "
4793 "is of type %<void%>, but the third operand is "
4794 "neither a throw-expression nor of type %<void%>");
4796 error_at (EXPR_LOC_OR_LOC (arg2
, loc
),
4797 "third operand to the conditional operator "
4798 "is of type %<void%>, but the second operand is "
4799 "neither a throw-expression nor of type %<void%>");
4801 return error_mark_node
;
4805 goto valid_operands
;
4809 Otherwise, if the second and third operand have different types,
4810 and either has (possibly cv-qualified) class type, or if both are
4811 glvalues of the same value category and the same type except for
4812 cv-qualification, an attempt is made to convert each of those operands
4813 to the type of the other. */
4814 else if (!same_type_p (arg2_type
, arg3_type
)
4815 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)
4816 || (same_type_ignoring_top_level_qualifiers_p (arg2_type
,
4818 && lvalue_or_rvalue_with_address_p (arg2
)
4819 && lvalue_or_rvalue_with_address_p (arg3
)
4820 && real_lvalue_p (arg2
) == real_lvalue_p (arg3
))))
4825 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4826 p
= conversion_obstack_alloc (0);
4828 conv2
= conditional_conversion (arg2
, arg3
, complain
);
4829 conv3
= conditional_conversion (arg3
, arg2
, complain
);
4833 If both can be converted, or one can be converted but the
4834 conversion is ambiguous, the program is ill-formed. If
4835 neither can be converted, the operands are left unchanged and
4836 further checking is performed as described below. If exactly
4837 one conversion is possible, that conversion is applied to the
4838 chosen operand and the converted operand is used in place of
4839 the original operand for the remainder of this section. */
4840 if ((conv2
&& !conv2
->bad_p
4841 && conv3
&& !conv3
->bad_p
)
4842 || (conv2
&& conv2
->kind
== ck_ambig
)
4843 || (conv3
&& conv3
->kind
== ck_ambig
))
4845 if (complain
& tf_error
)
4847 error_at (loc
, "operands to ?: have different types %qT and %qT",
4848 arg2_type
, arg3_type
);
4849 if (conv2
&& !conv2
->bad_p
&& conv3
&& !conv3
->bad_p
)
4850 inform (loc
, " and each type can be converted to the other");
4851 else if (conv2
&& conv2
->kind
== ck_ambig
)
4852 convert_like (conv2
, arg2
, complain
);
4854 convert_like (conv3
, arg3
, complain
);
4856 result
= error_mark_node
;
4858 else if (conv2
&& !conv2
->bad_p
)
4860 arg2
= convert_like (conv2
, arg2
, complain
);
4861 arg2
= convert_from_reference (arg2
);
4862 arg2_type
= TREE_TYPE (arg2
);
4863 /* Even if CONV2 is a valid conversion, the result of the
4864 conversion may be invalid. For example, if ARG3 has type
4865 "volatile X", and X does not have a copy constructor
4866 accepting a "volatile X&", then even if ARG2 can be
4867 converted to X, the conversion will fail. */
4868 if (error_operand_p (arg2
))
4869 result
= error_mark_node
;
4871 else if (conv3
&& !conv3
->bad_p
)
4873 arg3
= convert_like (conv3
, arg3
, complain
);
4874 arg3
= convert_from_reference (arg3
);
4875 arg3_type
= TREE_TYPE (arg3
);
4876 if (error_operand_p (arg3
))
4877 result
= error_mark_node
;
4880 /* Free all the conversions we allocated. */
4881 obstack_free (&conversion_obstack
, p
);
4886 /* If, after the conversion, both operands have class type,
4887 treat the cv-qualification of both operands as if it were the
4888 union of the cv-qualification of the operands.
4890 The standard is not clear about what to do in this
4891 circumstance. For example, if the first operand has type
4892 "const X" and the second operand has a user-defined
4893 conversion to "volatile X", what is the type of the second
4894 operand after this step? Making it be "const X" (matching
4895 the first operand) seems wrong, as that discards the
4896 qualification without actually performing a copy. Leaving it
4897 as "volatile X" seems wrong as that will result in the
4898 conditional expression failing altogether, even though,
4899 according to this step, the one operand could be converted to
4900 the type of the other. */
4901 if (((conv2
&& !conv2
->bad_p
)
4902 || (conv3
&& !conv3
->bad_p
))
4903 && CLASS_TYPE_P (arg2_type
)
4904 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
4905 arg2_type
= arg3_type
=
4906 cp_build_qualified_type (arg2_type
,
4907 cp_type_quals (arg2_type
)
4908 | cp_type_quals (arg3_type
));
4913 If the second and third operands are glvalues of the same value
4914 category and have the same type, the result is of that type and
4916 if (((real_lvalue_p (arg2
) && real_lvalue_p (arg3
))
4917 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
4918 && same_type_p (arg2_type
, arg3_type
))
4920 result_type
= arg2_type
;
4921 arg2
= mark_lvalue_use (arg2
);
4922 arg3
= mark_lvalue_use (arg3
);
4923 goto valid_operands
;
4928 Otherwise, the result is an rvalue. If the second and third
4929 operand do not have the same type, and either has (possibly
4930 cv-qualified) class type, overload resolution is used to
4931 determine the conversions (if any) to be applied to the operands
4932 (_over.match.oper_, _over.built_). */
4934 if (!same_type_p (arg2_type
, arg3_type
)
4935 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
4941 /* Rearrange the arguments so that add_builtin_candidate only has
4942 to know about two args. In build_builtin_candidate, the
4943 arguments are unscrambled. */
4947 add_builtin_candidates (&candidates
,
4950 ansi_opname (COND_EXPR
),
4952 LOOKUP_NORMAL
, complain
);
4956 If the overload resolution fails, the program is
4958 candidates
= splice_viable (candidates
, false, &any_viable_p
);
4961 if (complain
& tf_error
)
4962 error_at (loc
, "operands to ?: have different types %qT and %qT",
4963 arg2_type
, arg3_type
);
4964 return error_mark_node
;
4966 cand
= tourney (candidates
, complain
);
4969 if (complain
& tf_error
)
4971 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
4972 print_z_candidates (loc
, candidates
);
4974 return error_mark_node
;
4979 Otherwise, the conversions thus determined are applied, and
4980 the converted operands are used in place of the original
4981 operands for the remainder of this section. */
4982 conv
= cand
->convs
[0];
4983 arg1
= convert_like (conv
, arg1
, complain
);
4984 conv
= cand
->convs
[1];
4985 arg2
= convert_like (conv
, arg2
, complain
);
4986 arg2_type
= TREE_TYPE (arg2
);
4987 conv
= cand
->convs
[2];
4988 arg3
= convert_like (conv
, arg3
, complain
);
4989 arg3_type
= TREE_TYPE (arg3
);
4994 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
4995 and function-to-pointer (_conv.func_) standard conversions are
4996 performed on the second and third operands.
4998 We need to force the lvalue-to-rvalue conversion here for class types,
4999 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5000 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5003 arg2
= force_rvalue (arg2
, complain
);
5004 if (!CLASS_TYPE_P (arg2_type
))
5005 arg2_type
= TREE_TYPE (arg2
);
5007 arg3
= force_rvalue (arg3
, complain
);
5008 if (!CLASS_TYPE_P (arg3_type
))
5009 arg3_type
= TREE_TYPE (arg3
);
5011 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5012 return error_mark_node
;
5016 After those conversions, one of the following shall hold:
5018 --The second and third operands have the same type; the result is of
5020 if (same_type_p (arg2_type
, arg3_type
))
5021 result_type
= arg2_type
;
5024 --The second and third operands have arithmetic or enumeration
5025 type; the usual arithmetic conversions are performed to bring
5026 them to a common type, and the result is of that type. */
5027 else if ((ARITHMETIC_TYPE_P (arg2_type
)
5028 || UNSCOPED_ENUM_P (arg2_type
))
5029 && (ARITHMETIC_TYPE_P (arg3_type
)
5030 || UNSCOPED_ENUM_P (arg3_type
)))
5032 /* In this case, there is always a common type. */
5033 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
5035 if (complain
& tf_warning
)
5036 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
5037 "implicit conversion from %qT to %qT to "
5038 "match other result of conditional",
5041 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5042 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
5044 if (TREE_CODE (orig_arg2
) == CONST_DECL
5045 && TREE_CODE (orig_arg3
) == CONST_DECL
5046 && DECL_CONTEXT (orig_arg2
) == DECL_CONTEXT (orig_arg3
))
5047 /* Two enumerators from the same enumeration can have different
5048 types when the enumeration is still being defined. */;
5049 else if (complain
& tf_warning
)
5050 warning_at (loc
, OPT_Wenum_compare
, "enumeral mismatch in "
5051 "conditional expression: %qT vs %qT",
5052 arg2_type
, arg3_type
);
5054 else if (extra_warnings
5055 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5056 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
5057 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
5058 && !same_type_p (arg2_type
,
5059 type_promotes_to (arg3_type
)))))
5061 if (complain
& tf_warning
)
5062 warning_at (loc
, 0, "enumeral and non-enumeral type in "
5063 "conditional expression");
5066 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5067 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5071 --The second and third operands have pointer type, or one has
5072 pointer type and the other is a null pointer constant; pointer
5073 conversions (_conv.ptr_) and qualification conversions
5074 (_conv.qual_) are performed to bring them to their composite
5075 pointer type (_expr.rel_). The result is of the composite
5078 --The second and third operands have pointer to member type, or
5079 one has pointer to member type and the other is a null pointer
5080 constant; pointer to member conversions (_conv.mem_) and
5081 qualification conversions (_conv.qual_) are performed to bring
5082 them to a common type, whose cv-qualification shall match the
5083 cv-qualification of either the second or the third operand.
5084 The result is of the common type. */
5085 else if ((null_ptr_cst_p (arg2
)
5086 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
5087 || (null_ptr_cst_p (arg3
)
5088 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
5089 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
5090 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
5091 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
5093 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
5094 arg3
, CPO_CONDITIONAL_EXPR
,
5096 if (result_type
== error_mark_node
)
5097 return error_mark_node
;
5098 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5099 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5104 if (complain
& tf_error
)
5105 error_at (loc
, "operands to ?: have different types %qT and %qT",
5106 arg2_type
, arg3_type
);
5107 return error_mark_node
;
5110 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5111 return error_mark_node
;
5114 result
= build3 (COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
5115 if (!cp_unevaluated_operand
)
5116 /* Avoid folding within decltype (c++/42013) and noexcept. */
5117 result
= fold_if_not_in_template (result
);
5119 /* We can't use result_type below, as fold might have returned a
5124 /* Expand both sides into the same slot, hopefully the target of
5125 the ?: expression. We used to check for TARGET_EXPRs here,
5126 but now we sometimes wrap them in NOP_EXPRs so the test would
5128 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5129 result
= get_target_expr_sfinae (result
, complain
);
5130 /* If this expression is an rvalue, but might be mistaken for an
5131 lvalue, we must add a NON_LVALUE_EXPR. */
5132 result
= rvalue (result
);
5135 result
= force_paren_expr (result
);
5140 /* Wrapper for above. */
5143 build_conditional_expr (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
5144 tsubst_flags_t complain
)
5147 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5148 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5149 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5153 /* OPERAND is an operand to an expression. Perform necessary steps
5154 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5158 prep_operand (tree operand
)
5162 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5163 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5164 /* Make sure the template type is instantiated now. */
5165 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5171 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5172 OVERLOAD) to the CANDIDATES, returning an updated list of
5173 CANDIDATES. The ARGS are the arguments provided to the call;
5174 if FIRST_ARG is non-null it is the implicit object argument,
5175 otherwise the first element of ARGS is used if needed. The
5176 EXPLICIT_TARGS are explicit template arguments provided.
5177 TEMPLATE_ONLY is true if only template functions should be
5178 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5179 add_function_candidate. */
5182 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5184 tree explicit_targs
, bool template_only
,
5185 tree conversion_path
, tree access_path
,
5187 struct z_candidate
**candidates
,
5188 tsubst_flags_t complain
)
5191 const vec
<tree
, va_gc
> *non_static_args
;
5192 bool check_list_ctor
;
5193 bool check_converting
;
5194 unification_kind_t strict
;
5200 /* Precalculate special handling of constructors and conversion ops. */
5201 fn
= OVL_CURRENT (fns
);
5202 if (DECL_CONV_FN_P (fn
))
5204 check_list_ctor
= false;
5205 check_converting
= !!(flags
& LOOKUP_ONLYCONVERTING
);
5206 if (flags
& LOOKUP_NO_CONVERSION
)
5207 /* We're doing return_type(x). */
5208 strict
= DEDUCE_CONV
;
5210 /* We're doing x.operator return_type(). */
5211 strict
= DEDUCE_EXACT
;
5212 /* [over.match.funcs] For conversion functions, the function
5213 is considered to be a member of the class of the implicit
5214 object argument for the purpose of defining the type of
5215 the implicit object parameter. */
5216 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5220 if (DECL_CONSTRUCTOR_P (fn
))
5222 check_list_ctor
= !!(flags
& LOOKUP_LIST_ONLY
);
5223 /* For list-initialization we consider explicit constructors
5224 and complain if one is chosen. */
5226 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5227 == LOOKUP_ONLYCONVERTING
);
5231 check_list_ctor
= false;
5232 check_converting
= false;
5234 strict
= DEDUCE_CALL
;
5235 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5239 non_static_args
= args
;
5241 /* Delay creating the implicit this parameter until it is needed. */
5242 non_static_args
= NULL
;
5244 for (; fns
; fns
= OVL_NEXT (fns
))
5247 const vec
<tree
, va_gc
> *fn_args
;
5249 fn
= OVL_CURRENT (fns
);
5251 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5253 if (check_list_ctor
&& !is_list_ctor (fn
))
5256 /* Figure out which set of arguments to use. */
5257 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5259 /* If this function is a non-static member and we didn't get an
5260 implicit object argument, move it out of args. */
5261 if (first_arg
== NULL_TREE
)
5265 vec
<tree
, va_gc
> *tempvec
;
5266 vec_alloc (tempvec
, args
->length () - 1);
5267 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5268 tempvec
->quick_push (arg
);
5269 non_static_args
= tempvec
;
5270 first_arg
= (*args
)[0];
5273 fn_first_arg
= first_arg
;
5274 fn_args
= non_static_args
;
5278 /* Otherwise, just use the list of arguments provided. */
5279 fn_first_arg
= NULL_TREE
;
5283 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5284 add_template_candidate (candidates
,
5296 else if (!template_only
)
5297 add_function_candidate (candidates
,
5310 build_new_op_1 (location_t loc
, enum tree_code code
, int flags
, tree arg1
,
5311 tree arg2
, tree arg3
, tree
*overload
, tsubst_flags_t complain
)
5313 struct z_candidate
*candidates
= 0, *cand
;
5314 vec
<tree
, va_gc
> *arglist
;
5317 tree result
= NULL_TREE
;
5318 bool result_valid_p
= false;
5319 enum tree_code code2
= NOP_EXPR
;
5320 enum tree_code code_orig_arg1
= ERROR_MARK
;
5321 enum tree_code code_orig_arg2
= ERROR_MARK
;
5327 if (error_operand_p (arg1
)
5328 || error_operand_p (arg2
)
5329 || error_operand_p (arg3
))
5330 return error_mark_node
;
5332 if (code
== MODIFY_EXPR
)
5334 code2
= TREE_CODE (arg3
);
5336 fnname
= ansi_assopname (code2
);
5339 fnname
= ansi_opname (code
);
5341 arg1
= prep_operand (arg1
);
5347 case VEC_DELETE_EXPR
:
5349 /* Use build_op_new_call and build_op_delete_call instead. */
5353 /* Use build_op_call instead. */
5356 case TRUTH_ORIF_EXPR
:
5357 case TRUTH_ANDIF_EXPR
:
5358 case TRUTH_AND_EXPR
:
5360 /* These are saved for the sake of warn_logical_operator. */
5361 code_orig_arg1
= TREE_CODE (arg1
);
5362 code_orig_arg2
= TREE_CODE (arg2
);
5368 arg2
= prep_operand (arg2
);
5369 arg3
= prep_operand (arg3
);
5371 if (code
== COND_EXPR
)
5372 /* Use build_conditional_expr instead. */
5374 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5375 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5378 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5379 arg2
= integer_zero_node
;
5381 vec_alloc (arglist
, 3);
5382 arglist
->quick_push (arg1
);
5383 if (arg2
!= NULL_TREE
)
5384 arglist
->quick_push (arg2
);
5385 if (arg3
!= NULL_TREE
)
5386 arglist
->quick_push (arg3
);
5388 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5389 p
= conversion_obstack_alloc (0);
5391 /* Add namespace-scope operators to the list of functions to
5393 add_candidates (lookup_function_nonclass (fnname
, arglist
, /*block_p=*/true),
5394 NULL_TREE
, arglist
, NULL_TREE
,
5395 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5396 flags
, &candidates
, complain
);
5400 args
[2] = NULL_TREE
;
5402 /* Add class-member operators to the candidate set. */
5403 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5407 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5408 if (fns
== error_mark_node
)
5410 result
= error_mark_node
;
5411 goto user_defined_result_ready
;
5414 add_candidates (BASELINK_FUNCTIONS (fns
),
5415 NULL_TREE
, arglist
, NULL_TREE
,
5417 BASELINK_BINFO (fns
),
5418 BASELINK_ACCESS_BINFO (fns
),
5419 flags
, &candidates
, complain
);
5421 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5422 only non-member functions that have type T1 or reference to
5423 cv-qualified-opt T1 for the first argument, if the first argument
5424 has an enumeration type, or T2 or reference to cv-qualified-opt
5425 T2 for the second argument, if the the second argument has an
5426 enumeration type. Filter out those that don't match. */
5427 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5429 struct z_candidate
**candp
, **next
;
5431 for (candp
= &candidates
; *candp
; candp
= next
)
5433 tree parmlist
, parmtype
;
5434 int i
, nargs
= (arg2
? 2 : 1);
5439 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5441 for (i
= 0; i
< nargs
; ++i
)
5443 parmtype
= TREE_VALUE (parmlist
);
5445 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
5446 parmtype
= TREE_TYPE (parmtype
);
5447 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5448 && (same_type_ignoring_top_level_qualifiers_p
5449 (TREE_TYPE (args
[i
]), parmtype
)))
5452 parmlist
= TREE_CHAIN (parmlist
);
5455 /* No argument has an appropriate type, so remove this
5456 candidate function from the list. */
5459 *candp
= cand
->next
;
5465 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5472 /* For these, the built-in candidates set is empty
5473 [over.match.oper]/3. We don't want non-strict matches
5474 because exact matches are always possible with built-in
5475 operators. The built-in candidate set for COMPONENT_REF
5476 would be empty too, but since there are no such built-in
5477 operators, we accept non-strict matches for them. */
5486 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5491 case POSTINCREMENT_EXPR
:
5492 case POSTDECREMENT_EXPR
:
5493 /* Don't try anything fancy if we're not allowed to produce
5495 if (!(complain
& tf_error
))
5496 return error_mark_node
;
5498 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5499 distinguish between prefix and postfix ++ and
5500 operator++() was used for both, so we allow this with
5504 const char *msg
= (flag_permissive
)
5505 ? G_("no %<%D(int)%> declared for postfix %qs,"
5506 " trying prefix operator instead")
5507 : G_("no %<%D(int)%> declared for postfix %qs");
5508 permerror (loc
, msg
, fnname
, operator_name_info
[code
].name
);
5511 if (!flag_permissive
)
5512 return error_mark_node
;
5514 if (code
== POSTINCREMENT_EXPR
)
5515 code
= PREINCREMENT_EXPR
;
5517 code
= PREDECREMENT_EXPR
;
5518 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5519 NULL_TREE
, overload
, complain
);
5522 /* The caller will deal with these. */
5527 result_valid_p
= true;
5531 if (complain
& tf_error
)
5533 /* If one of the arguments of the operator represents
5534 an invalid use of member function pointer, try to report
5535 a meaningful error ... */
5536 if (invalid_nonstatic_memfn_p (arg1
, tf_error
)
5537 || invalid_nonstatic_memfn_p (arg2
, tf_error
)
5538 || invalid_nonstatic_memfn_p (arg3
, tf_error
))
5539 /* We displayed the error message. */;
5542 /* ... Otherwise, report the more generic
5543 "no matching operator found" error */
5544 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
5545 print_z_candidates (loc
, candidates
);
5548 result
= error_mark_node
;
5554 cand
= tourney (candidates
, complain
);
5557 if (complain
& tf_error
)
5559 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
5560 print_z_candidates (loc
, candidates
);
5562 result
= error_mark_node
;
5564 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
5567 *overload
= cand
->fn
;
5569 if (resolve_args (arglist
, complain
) == NULL
)
5570 result
= error_mark_node
;
5572 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5576 /* Give any warnings we noticed during overload resolution. */
5577 if (cand
->warnings
&& (complain
& tf_warning
))
5579 struct candidate_warning
*w
;
5580 for (w
= cand
->warnings
; w
; w
= w
->next
)
5581 joust (cand
, w
->loser
, 1, complain
);
5584 /* Check for comparison of different enum types. */
5593 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
5594 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
5595 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
5596 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
5597 && (complain
& tf_warning
))
5599 warning (OPT_Wenum_compare
,
5600 "comparison between %q#T and %q#T",
5601 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
5608 /* We need to strip any leading REF_BIND so that bitfields
5609 don't cause errors. This should not remove any important
5610 conversions, because builtins don't apply to class
5611 objects directly. */
5612 conv
= cand
->convs
[0];
5613 if (conv
->kind
== ck_ref_bind
)
5614 conv
= next_conversion (conv
);
5615 arg1
= convert_like (conv
, arg1
, complain
);
5619 conv
= cand
->convs
[1];
5620 if (conv
->kind
== ck_ref_bind
)
5621 conv
= next_conversion (conv
);
5623 arg2
= decay_conversion (arg2
, complain
);
5625 /* We need to call warn_logical_operator before
5626 converting arg2 to a boolean_type, but after
5627 decaying an enumerator to its value. */
5628 if (complain
& tf_warning
)
5629 warn_logical_operator (loc
, code
, boolean_type_node
,
5630 code_orig_arg1
, arg1
,
5631 code_orig_arg2
, arg2
);
5633 arg2
= convert_like (conv
, arg2
, complain
);
5637 conv
= cand
->convs
[2];
5638 if (conv
->kind
== ck_ref_bind
)
5639 conv
= next_conversion (conv
);
5640 arg3
= convert_like (conv
, arg3
, complain
);
5646 user_defined_result_ready
:
5648 /* Free all the conversions we allocated. */
5649 obstack_free (&conversion_obstack
, p
);
5651 if (result
|| result_valid_p
)
5658 return cp_build_modify_expr (arg1
, code2
, arg2
, complain
);
5661 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
5663 case TRUTH_ANDIF_EXPR
:
5664 case TRUTH_ORIF_EXPR
:
5665 case TRUTH_AND_EXPR
:
5667 warn_logical_operator (loc
, code
, boolean_type_node
,
5668 code_orig_arg1
, arg1
, code_orig_arg2
, arg2
);
5673 case TRUNC_DIV_EXPR
:
5684 case TRUNC_MOD_EXPR
:
5688 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
5690 case UNARY_PLUS_EXPR
:
5693 case TRUTH_NOT_EXPR
:
5694 case PREINCREMENT_EXPR
:
5695 case POSTINCREMENT_EXPR
:
5696 case PREDECREMENT_EXPR
:
5697 case POSTDECREMENT_EXPR
:
5701 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
5704 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
5707 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
5711 /* The caller will deal with these. */
5723 /* Wrapper for above. */
5726 build_new_op (location_t loc
, enum tree_code code
, int flags
,
5727 tree arg1
, tree arg2
, tree arg3
,
5728 tree
*overload
, tsubst_flags_t complain
)
5731 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5732 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
5733 overload
, complain
);
5734 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5738 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
5739 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
5742 non_placement_deallocation_fn_p (tree t
)
5744 /* A template instance is never a usual deallocation function,
5745 regardless of its signature. */
5746 if (TREE_CODE (t
) == TEMPLATE_DECL
5747 || primary_template_instantiation_p (t
))
5750 /* If a class T has a member deallocation function named operator delete
5751 with exactly one parameter, then that function is a usual
5752 (non-placement) deallocation function. If class T does not declare
5753 such an operator delete but does declare a member deallocation
5754 function named operator delete with exactly two parameters, the second
5755 of which has type std::size_t (18.2), then this function is a usual
5756 deallocation function. */
5757 t
= FUNCTION_ARG_CHAIN (t
);
5758 if (t
== void_list_node
5759 || (t
&& same_type_p (TREE_VALUE (t
), size_type_node
)
5760 && TREE_CHAIN (t
) == void_list_node
))
5765 /* Build a call to operator delete. This has to be handled very specially,
5766 because the restrictions on what signatures match are different from all
5767 other call instances. For a normal delete, only a delete taking (void *)
5768 or (void *, size_t) is accepted. For a placement delete, only an exact
5769 match with the placement new is accepted.
5771 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
5772 ADDR is the pointer to be deleted.
5773 SIZE is the size of the memory block to be deleted.
5774 GLOBAL_P is true if the delete-expression should not consider
5775 class-specific delete operators.
5776 PLACEMENT is the corresponding placement new call, or NULL_TREE.
5778 If this call to "operator delete" is being generated as part to
5779 deallocate memory allocated via a new-expression (as per [expr.new]
5780 which requires that if the initialization throws an exception then
5781 we call a deallocation function), then ALLOC_FN is the allocation
5785 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
5786 bool global_p
, tree placement
,
5787 tree alloc_fn
, tsubst_flags_t complain
)
5789 tree fn
= NULL_TREE
;
5790 tree fns
, fnname
, type
, t
;
5792 if (addr
== error_mark_node
)
5793 return error_mark_node
;
5795 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
5797 fnname
= ansi_opname (code
);
5799 if (CLASS_TYPE_P (type
)
5800 && COMPLETE_TYPE_P (complete_type (type
))
5804 If the result of the lookup is ambiguous or inaccessible, or if
5805 the lookup selects a placement deallocation function, the
5806 program is ill-formed.
5808 Therefore, we ask lookup_fnfields to complain about ambiguity. */
5810 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
5811 if (fns
== error_mark_node
)
5812 return error_mark_node
;
5817 if (fns
== NULL_TREE
)
5818 fns
= lookup_name_nonclass (fnname
);
5820 /* Strip const and volatile from addr. */
5821 addr
= cp_convert (ptr_type_node
, addr
, complain
);
5825 /* "A declaration of a placement deallocation function matches the
5826 declaration of a placement allocation function if it has the same
5827 number of parameters and, after parameter transformations (8.3.5),
5828 all parameter types except the first are identical."
5830 So we build up the function type we want and ask instantiate_type
5831 to get it for us. */
5832 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
5833 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
5834 t
= build_function_type (void_type_node
, t
);
5836 fn
= instantiate_type (t
, fns
, tf_none
);
5837 if (fn
== error_mark_node
)
5840 if (BASELINK_P (fn
))
5841 fn
= BASELINK_FUNCTIONS (fn
);
5843 /* "If the lookup finds the two-parameter form of a usual deallocation
5844 function (3.7.4.2) and that function, considered as a placement
5845 deallocation function, would have been selected as a match for the
5846 allocation function, the program is ill-formed." */
5847 if (non_placement_deallocation_fn_p (fn
))
5849 /* But if the class has an operator delete (void *), then that is
5850 the usual deallocation function, so we shouldn't complain
5851 about using the operator delete (void *, size_t). */
5852 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
5853 t
; t
= OVL_NEXT (t
))
5855 tree elt
= OVL_CURRENT (t
);
5856 if (non_placement_deallocation_fn_p (elt
)
5857 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
5860 if (complain
& tf_error
)
5862 permerror (0, "non-placement deallocation function %q+D", fn
);
5863 permerror (input_location
, "selected for placement delete");
5866 return error_mark_node
;
5871 /* "Any non-placement deallocation function matches a non-placement
5872 allocation function. If the lookup finds a single matching
5873 deallocation function, that function will be called; otherwise, no
5874 deallocation function will be called." */
5875 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
5876 t
; t
= OVL_NEXT (t
))
5878 tree elt
= OVL_CURRENT (t
);
5879 if (non_placement_deallocation_fn_p (elt
))
5882 /* "If a class T has a member deallocation function named
5883 operator delete with exactly one parameter, then that
5884 function is a usual (non-placement) deallocation
5885 function. If class T does not declare such an operator
5886 delete but does declare a member deallocation function named
5887 operator delete with exactly two parameters, the second of
5888 which has type std::size_t (18.2), then this function is a
5889 usual deallocation function."
5891 So (void*) beats (void*, size_t). */
5892 if (FUNCTION_ARG_CHAIN (fn
) == void_list_node
)
5897 /* If we have a matching function, call it. */
5900 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
5902 /* If the FN is a member function, make sure that it is
5904 if (BASELINK_P (fns
))
5905 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
5908 /* Core issue 901: It's ok to new a type with deleted delete. */
5909 if (DECL_DELETED_FN (fn
) && alloc_fn
)
5914 /* The placement args might not be suitable for overload
5915 resolution at this point, so build the call directly. */
5916 int nargs
= call_expr_nargs (placement
);
5917 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
5920 for (i
= 1; i
< nargs
; i
++)
5921 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
5923 return build_cxx_call (fn
, nargs
, argarray
, complain
);
5928 vec
<tree
, va_gc
> *args
= make_tree_vector ();
5929 args
->quick_push (addr
);
5930 if (FUNCTION_ARG_CHAIN (fn
) != void_list_node
)
5931 args
->quick_push (size
);
5932 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
5933 release_tree_vector (args
);
5940 If no unambiguous matching deallocation function can be found,
5941 propagating the exception does not cause the object's memory to
5945 if ((complain
& tf_warning
)
5947 warning (0, "no corresponding deallocation function for %qD",
5952 if (complain
& tf_error
)
5953 error ("no suitable %<operator %s%> for %qT",
5954 operator_name_info
[(int)code
].name
, type
);
5955 return error_mark_node
;
5958 /* If the current scope isn't allowed to access DECL along
5959 BASETYPE_PATH, give an error. The most derived class in
5960 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
5961 the declaration to use in the error diagnostic. */
5964 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
5965 tsubst_flags_t complain
)
5967 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
5969 if (!accessible_p (basetype_path
, decl
, true))
5971 if (complain
& tf_error
)
5973 if (TREE_PRIVATE (decl
))
5974 error ("%q+#D is private", diag_decl
);
5975 else if (TREE_PROTECTED (decl
))
5976 error ("%q+#D is protected", diag_decl
);
5978 error ("%q+#D is inaccessible", diag_decl
);
5979 error ("within this context");
5987 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
5988 bitwise or of LOOKUP_* values. If any errors are warnings are
5989 generated, set *DIAGNOSTIC_FN to "error" or "warning",
5990 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
5994 build_temp (tree expr
, tree type
, int flags
,
5995 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
5998 vec
<tree
, va_gc
> *args
;
6000 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
6001 args
= make_tree_vector_single (expr
);
6002 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6003 &args
, type
, flags
, complain
);
6004 release_tree_vector (args
);
6005 if (warningcount
+ werrorcount
> savew
)
6006 *diagnostic_kind
= DK_WARNING
;
6007 else if (errorcount
> savee
)
6008 *diagnostic_kind
= DK_ERROR
;
6010 *diagnostic_kind
= DK_UNSPECIFIED
;
6014 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6015 EXPR is implicitly converted to type TOTYPE.
6016 FN and ARGNUM are used for diagnostics. */
6019 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
6021 /* Issue warnings about peculiar, but valid, uses of NULL. */
6022 if (expr
== null_node
&& TREE_CODE (totype
) != BOOLEAN_TYPE
6023 && ARITHMETIC_TYPE_P (totype
))
6025 source_location loc
=
6026 expansion_point_location_if_in_system_header (input_location
);
6029 warning_at (loc
, OPT_Wconversion_null
,
6030 "passing NULL to non-pointer argument %P of %qD",
6033 warning_at (loc
, OPT_Wconversion_null
,
6034 "converting to non-pointer type %qT from NULL", totype
);
6037 /* Issue warnings if "false" is converted to a NULL pointer */
6038 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
6039 && TYPE_PTR_P (totype
))
6042 warning_at (input_location
, OPT_Wconversion_null
,
6043 "converting %<false%> to pointer type for argument %P "
6044 "of %qD", argnum
, fn
);
6046 warning_at (input_location
, OPT_Wconversion_null
,
6047 "converting %<false%> to pointer type %qT", totype
);
6051 /* We gave a diagnostic during a conversion. If this was in the second
6052 standard conversion sequence of a user-defined conversion sequence, say
6053 which user-defined conversion. */
6056 maybe_print_user_conv_context (conversion
*convs
)
6058 if (convs
->user_conv_p
)
6059 for (conversion
*t
= convs
; t
; t
= next_conversion (t
))
6060 if (t
->kind
== ck_user
)
6062 print_z_candidate (0, " after user-defined conversion:",
6068 /* Perform the conversions in CONVS on the expression EXPR. FN and
6069 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6070 indicates the `this' argument of a method. INNER is nonzero when
6071 being called to continue a conversion chain. It is negative when a
6072 reference binding will be applied, positive otherwise. If
6073 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6074 conversions will be emitted if appropriate. If C_CAST_P is true,
6075 this conversion is coming from a C-style cast; in that case,
6076 conversions to inaccessible bases are permitted. */
6079 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
6080 int inner
, bool issue_conversion_warnings
,
6081 bool c_cast_p
, tsubst_flags_t complain
)
6083 tree totype
= convs
->type
;
6084 diagnostic_t diag_kind
;
6086 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6088 if (convs
->bad_p
&& !(complain
& tf_error
))
6089 return error_mark_node
;
6092 && convs
->kind
!= ck_user
6093 && convs
->kind
!= ck_list
6094 && convs
->kind
!= ck_ambig
6095 && (convs
->kind
!= ck_ref_bind
6096 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
6097 && (convs
->kind
!= ck_rvalue
6098 || SCALAR_TYPE_P (totype
))
6099 && convs
->kind
!= ck_base
)
6101 bool complained
= false;
6102 conversion
*t
= convs
;
6104 /* Give a helpful error if this is bad because of excess braces. */
6105 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6106 && SCALAR_TYPE_P (totype
)
6107 && CONSTRUCTOR_NELTS (expr
) > 0
6108 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
6110 complained
= permerror (loc
, "too many braces around initializer "
6112 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6113 && CONSTRUCTOR_NELTS (expr
) == 1)
6114 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6117 /* Give a helpful error if this is bad because a conversion to bool
6118 from std::nullptr_t requires direct-initialization. */
6119 if (NULLPTR_TYPE_P (TREE_TYPE (expr
))
6120 && TREE_CODE (totype
) == BOOLEAN_TYPE
)
6121 complained
= permerror (loc
, "converting to %qT from %qT requires "
6122 "direct-initialization",
6123 totype
, TREE_TYPE (expr
));
6125 for (; t
; t
= next_conversion (t
))
6127 if (t
->kind
== ck_user
&& t
->cand
->reason
)
6129 permerror (loc
, "invalid user-defined conversion "
6130 "from %qT to %qT", TREE_TYPE (expr
), totype
);
6131 print_z_candidate (loc
, "candidate is:", t
->cand
);
6132 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
6133 /*issue_conversion_warnings=*/false,
6136 if (convs
->kind
== ck_ref_bind
)
6137 expr
= convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
6138 LOOKUP_NORMAL
, NULL_TREE
,
6141 expr
= cp_convert (totype
, expr
, complain
);
6143 inform (DECL_SOURCE_LOCATION (fn
),
6144 " initializing argument %P of %qD", argnum
, fn
);
6147 else if (t
->kind
== ck_user
|| !t
->bad_p
)
6149 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
6150 /*issue_conversion_warnings=*/false,
6155 else if (t
->kind
== ck_ambig
)
6156 return convert_like_real (t
, expr
, fn
, argnum
, 1,
6157 /*issue_conversion_warnings=*/false,
6160 else if (t
->kind
== ck_identity
)
6164 complained
= permerror (loc
, "invalid conversion from %qT to %qT",
6165 TREE_TYPE (expr
), totype
);
6166 if (complained
&& fn
)
6167 inform (DECL_SOURCE_LOCATION (fn
),
6168 " initializing argument %P of %qD", argnum
, fn
);
6170 return cp_convert (totype
, expr
, complain
);
6173 if (issue_conversion_warnings
&& (complain
& tf_warning
))
6174 conversion_null_warnings (totype
, expr
, fn
, argnum
);
6176 switch (convs
->kind
)
6180 struct z_candidate
*cand
= convs
->cand
;
6181 tree convfn
= cand
->fn
;
6184 /* When converting from an init list we consider explicit
6185 constructors, but actually trying to call one is an error. */
6186 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
6187 /* Unless this is for direct-list-initialization. */
6188 && !DIRECT_LIST_INIT_P (expr
))
6190 if (!(complain
& tf_error
))
6191 return error_mark_node
;
6192 error ("converting to %qT from initializer list would use "
6193 "explicit constructor %qD", totype
, convfn
);
6196 /* If we're initializing from {}, it's value-initialization. */
6197 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6198 && CONSTRUCTOR_NELTS (expr
) == 0
6199 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
6201 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
6202 expr
= build_value_init (totype
, complain
);
6203 expr
= get_target_expr_sfinae (expr
, complain
);
6204 if (expr
!= error_mark_node
)
6206 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6207 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
6212 expr
= mark_rvalue_use (expr
);
6214 /* Set user_conv_p on the argument conversions, so rvalue/base
6215 handling knows not to allow any more UDCs. */
6216 for (i
= 0; i
< cand
->num_convs
; ++i
)
6217 cand
->convs
[i
]->user_conv_p
= true;
6219 expr
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
6221 /* If this is a constructor or a function returning an aggr type,
6222 we need to build up a TARGET_EXPR. */
6223 if (DECL_CONSTRUCTOR_P (convfn
))
6225 expr
= build_cplus_new (totype
, expr
, complain
);
6227 /* Remember that this was list-initialization. */
6228 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
6229 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6235 expr
= mark_rvalue_use (expr
);
6236 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
6238 int nelts
= CONSTRUCTOR_NELTS (expr
);
6240 expr
= build_value_init (totype
, complain
);
6241 else if (nelts
== 1)
6242 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6247 if (type_unknown_p (expr
))
6248 expr
= instantiate_type (totype
, expr
, complain
);
6249 /* Convert a constant to its underlying value, unless we are
6250 about to bind it to a reference, in which case we need to
6251 leave it as an lvalue. */
6254 expr
= decl_constant_value_safe (expr
);
6255 if (expr
== null_node
&& INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
6256 /* If __null has been converted to an integer type, we do not
6257 want to warn about uses of EXPR as an integer, rather than
6259 expr
= build_int_cst (totype
, 0);
6263 /* We leave bad_p off ck_ambig because overload resolution considers
6264 it valid, it just fails when we try to perform it. So we need to
6265 check complain here, too. */
6266 if (complain
& tf_error
)
6268 /* Call build_user_type_conversion again for the error. */
6269 build_user_type_conversion (totype
, convs
->u
.expr
, LOOKUP_NORMAL
,
6272 inform (input_location
, " initializing argument %P of %q+D",
6275 return error_mark_node
;
6279 /* Conversion to std::initializer_list<T>. */
6280 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
6281 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
6282 unsigned len
= CONSTRUCTOR_NELTS (expr
);
6283 tree array
, val
, field
;
6284 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
6287 /* Convert all the elements. */
6288 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
6290 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
6291 1, false, false, complain
);
6292 if (sub
== error_mark_node
)
6294 if (!BRACE_ENCLOSED_INITIALIZER_P (val
))
6295 check_narrowing (TREE_TYPE (sub
), val
);
6296 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
6297 if (!TREE_CONSTANT (sub
))
6298 TREE_CONSTANT (new_ctor
) = false;
6300 /* Build up the array. */
6301 elttype
= cp_build_qualified_type
6302 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
6303 array
= build_array_of_n_type (elttype
, len
);
6304 array
= finish_compound_literal (array
, new_ctor
, complain
);
6305 /* Take the address explicitly rather than via decay_conversion
6306 to avoid the error about taking the address of a temporary. */
6307 array
= cp_build_addr_expr (array
, complain
);
6308 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
6309 if (array
== error_mark_node
)
6310 return error_mark_node
;
6312 /* Build up the initializer_list object. */
6313 totype
= complete_type (totype
);
6314 field
= next_initializable_field (TYPE_FIELDS (totype
));
6315 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
6316 field
= next_initializable_field (DECL_CHAIN (field
));
6317 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
6318 new_ctor
= build_constructor (totype
, vec
);
6319 return get_target_expr_sfinae (new_ctor
, complain
);
6323 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
6325 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6326 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
6327 real
= perform_implicit_conversion (TREE_TYPE (totype
),
6329 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
6331 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
6332 return fold_if_not_in_template (expr
);
6334 expr
= reshape_init (totype
, expr
, complain
);
6335 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
6337 if (expr
!= error_mark_node
)
6338 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6345 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
6346 convs
->kind
== ck_ref_bind
? -1 : 1,
6347 convs
->kind
== ck_ref_bind
? issue_conversion_warnings
: false,
6350 if (expr
== error_mark_node
)
6351 return error_mark_node
;
6353 switch (convs
->kind
)
6356 expr
= decay_conversion (expr
, complain
);
6357 if (expr
== error_mark_node
)
6358 return error_mark_node
;
6360 if (! MAYBE_CLASS_TYPE_P (totype
))
6362 /* Else fall through. */
6364 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
6366 /* We are going to bind a reference directly to a base-class
6367 subobject of EXPR. */
6368 /* Build an expression for `*((base*) &expr)'. */
6369 expr
= cp_build_addr_expr (expr
, complain
);
6370 expr
= convert_to_base (expr
, build_pointer_type (totype
),
6371 !c_cast_p
, /*nonnull=*/true, complain
);
6372 expr
= cp_build_indirect_ref (expr
, RO_IMPLICIT_CONVERSION
, complain
);
6376 /* Copy-initialization where the cv-unqualified version of the source
6377 type is the same class as, or a derived class of, the class of the
6378 destination [is treated as direct-initialization]. [dcl.init] */
6379 flags
= LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
;
6380 if (convs
->user_conv_p
)
6381 /* This conversion is being done in the context of a user-defined
6382 conversion (i.e. the second step of copy-initialization), so
6383 don't allow any more. */
6384 flags
|= LOOKUP_NO_CONVERSION
;
6385 if (convs
->rvaluedness_matches_p
)
6386 flags
|= LOOKUP_PREFER_RVALUE
;
6387 if (TREE_CODE (expr
) == TARGET_EXPR
6388 && TARGET_EXPR_LIST_INIT_P (expr
))
6389 /* Copy-list-initialization doesn't actually involve a copy. */
6391 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
6392 if (diag_kind
&& complain
)
6394 maybe_print_user_conv_context (convs
);
6396 inform (DECL_SOURCE_LOCATION (fn
),
6397 " initializing argument %P of %qD", argnum
, fn
);
6400 return build_cplus_new (totype
, expr
, complain
);
6404 tree ref_type
= totype
;
6406 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
6408 tree extype
= TREE_TYPE (expr
);
6409 if (TYPE_REF_IS_RVALUE (ref_type
)
6410 && real_lvalue_p (expr
))
6411 error_at (loc
, "cannot bind %qT lvalue to %qT",
6413 else if (!TYPE_REF_IS_RVALUE (ref_type
) && !real_lvalue_p (expr
)
6414 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
6415 error_at (loc
, "invalid initialization of non-const reference of "
6416 "type %qT from an rvalue of type %qT", totype
, extype
);
6417 else if (!reference_compatible_p (TREE_TYPE (totype
), extype
))
6418 error_at (loc
, "binding %qT to reference of type %qT "
6419 "discards qualifiers", extype
, totype
);
6422 maybe_print_user_conv_context (convs
);
6424 inform (input_location
,
6425 " initializing argument %P of %q+D", argnum
, fn
);
6426 return error_mark_node
;
6429 /* If necessary, create a temporary.
6431 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
6432 that need temporaries, even when their types are reference
6433 compatible with the type of reference being bound, so the
6434 upcoming call to cp_build_addr_expr doesn't fail. */
6435 if (convs
->need_temporary_p
6436 || TREE_CODE (expr
) == CONSTRUCTOR
6437 || TREE_CODE (expr
) == VA_ARG_EXPR
)
6439 /* Otherwise, a temporary of type "cv1 T1" is created and
6440 initialized from the initializer expression using the rules
6441 for a non-reference copy-initialization (8.5). */
6443 tree type
= TREE_TYPE (ref_type
);
6444 cp_lvalue_kind lvalue
= real_lvalue_p (expr
);
6446 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6447 (type
, next_conversion (convs
)->type
));
6448 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
6449 && !TYPE_REF_IS_RVALUE (ref_type
))
6451 /* If the reference is volatile or non-const, we
6452 cannot create a temporary. */
6453 if (lvalue
& clk_bitfield
)
6454 error_at (loc
, "cannot bind bitfield %qE to %qT",
6456 else if (lvalue
& clk_packed
)
6457 error_at (loc
, "cannot bind packed field %qE to %qT",
6460 error_at (loc
, "cannot bind rvalue %qE to %qT",
6462 return error_mark_node
;
6464 /* If the source is a packed field, and we must use a copy
6465 constructor, then building the target expr will require
6466 binding the field to the reference parameter to the
6467 copy constructor, and we'll end up with an infinite
6468 loop. If we can use a bitwise copy, then we'll be
6470 if ((lvalue
& clk_packed
)
6471 && CLASS_TYPE_P (type
)
6472 && type_has_nontrivial_copy_init (type
))
6474 error_at (loc
, "cannot bind packed field %qE to %qT",
6476 return error_mark_node
;
6478 if (lvalue
& clk_bitfield
)
6480 expr
= convert_bitfield_to_declared_type (expr
);
6481 expr
= fold_convert (type
, expr
);
6483 expr
= build_target_expr_with_type (expr
, type
, complain
);
6486 /* Take the address of the thing to which we will bind the
6488 expr
= cp_build_addr_expr (expr
, complain
);
6489 if (expr
== error_mark_node
)
6490 return error_mark_node
;
6492 /* Convert it to a pointer to the type referred to by the
6493 reference. This will adjust the pointer if a derived to
6494 base conversion is being performed. */
6495 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
6497 /* Convert the pointer to the desired reference type. */
6498 return build_nop (ref_type
, expr
);
6502 return decay_conversion (expr
, complain
);
6505 /* Warn about deprecated conversion if appropriate. */
6506 string_conv_p (totype
, expr
, 1);
6511 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
6512 /*nonnull=*/false, complain
);
6513 return build_nop (totype
, expr
);
6516 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
6517 c_cast_p
, complain
);
6523 if (convs
->check_narrowing
)
6524 check_narrowing (totype
, expr
);
6526 if (issue_conversion_warnings
)
6527 expr
= cp_convert_and_check (totype
, expr
, complain
);
6529 expr
= cp_convert (totype
, expr
, complain
);
6534 /* ARG is being passed to a varargs function. Perform any conversions
6535 required. Return the converted value. */
6538 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
6541 location_t loc
= EXPR_LOC_OR_LOC (arg
, input_location
);
6545 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6546 standard conversions are performed. */
6547 arg
= decay_conversion (arg
, complain
);
6548 arg_type
= TREE_TYPE (arg
);
6551 If the argument has integral or enumeration type that is subject
6552 to the integral promotions (_conv.prom_), or a floating point
6553 type that is subject to the floating point promotion
6554 (_conv.fpprom_), the value of the argument is converted to the
6555 promoted type before the call. */
6556 if (TREE_CODE (arg_type
) == REAL_TYPE
6557 && (TYPE_PRECISION (arg_type
)
6558 < TYPE_PRECISION (double_type_node
))
6559 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
6561 if ((complain
& tf_warning
)
6562 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
6563 warning_at (loc
, OPT_Wdouble_promotion
,
6564 "implicit conversion from %qT to %qT when passing "
6565 "argument to function",
6566 arg_type
, double_type_node
);
6567 arg
= convert_to_real (double_type_node
, arg
);
6569 else if (NULLPTR_TYPE_P (arg_type
))
6570 arg
= null_pointer_node
;
6571 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
6573 if (SCOPED_ENUM_P (arg_type
))
6575 tree prom
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
,
6577 prom
= cp_perform_integral_promotions (prom
, complain
);
6578 if (abi_version_crosses (6)
6579 && TYPE_MODE (TREE_TYPE (prom
)) != TYPE_MODE (arg_type
)
6580 && (complain
& tf_warning
))
6581 warning_at (loc
, OPT_Wabi
, "scoped enum %qT passed through ... as "
6582 "%qT before -fabi-version=6, %qT after", arg_type
,
6583 TREE_TYPE (prom
), ENUM_UNDERLYING_TYPE (arg_type
));
6584 if (!abi_version_at_least (6))
6588 arg
= cp_perform_integral_promotions (arg
, complain
);
6591 arg
= require_complete_type_sfinae (arg
, complain
);
6592 arg_type
= TREE_TYPE (arg
);
6594 if (arg
!= error_mark_node
6595 /* In a template (or ill-formed code), we can have an incomplete type
6596 even after require_complete_type_sfinae, in which case we don't know
6597 whether it has trivial copy or not. */
6598 && COMPLETE_TYPE_P (arg_type
))
6600 /* Build up a real lvalue-to-rvalue conversion in case the
6601 copy constructor is trivial but not callable. */
6602 if (!cp_unevaluated_operand
&& CLASS_TYPE_P (arg_type
))
6603 force_rvalue (arg
, complain
);
6605 /* [expr.call] 5.2.2/7:
6606 Passing a potentially-evaluated argument of class type (Clause 9)
6607 with a non-trivial copy constructor or a non-trivial destructor
6608 with no corresponding parameter is conditionally-supported, with
6609 implementation-defined semantics.
6611 We used to just warn here and do a bitwise copy, but now
6612 cp_expr_size will abort if we try to do that.
6614 If the call appears in the context of a sizeof expression,
6615 it is not potentially-evaluated. */
6616 if (cp_unevaluated_operand
== 0
6617 && (type_has_nontrivial_copy_init (arg_type
)
6618 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
)))
6620 if (complain
& tf_error
)
6621 error_at (loc
, "cannot pass objects of non-trivially-copyable "
6622 "type %q#T through %<...%>", arg_type
);
6623 return error_mark_node
;
6630 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
6633 build_x_va_arg (source_location loc
, tree expr
, tree type
)
6635 if (processing_template_decl
)
6636 return build_min (VA_ARG_EXPR
, type
, expr
);
6638 type
= complete_type_or_else (type
, NULL_TREE
);
6640 if (expr
== error_mark_node
|| !type
)
6641 return error_mark_node
;
6643 expr
= mark_lvalue_use (expr
);
6645 if (type_has_nontrivial_copy_init (type
)
6646 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
6647 || TREE_CODE (type
) == REFERENCE_TYPE
)
6649 /* Remove reference types so we don't ICE later on. */
6650 tree type1
= non_reference (type
);
6651 /* conditionally-supported behavior [expr.call] 5.2.2/7. */
6652 error ("cannot receive objects of non-trivially-copyable type %q#T "
6653 "through %<...%>; ", type
);
6654 expr
= convert (build_pointer_type (type1
), null_node
);
6655 expr
= cp_build_indirect_ref (expr
, RO_NULL
, tf_warning_or_error
);
6659 return build_va_arg (loc
, expr
, type
);
6662 /* TYPE has been given to va_arg. Apply the default conversions which
6663 would have happened when passed via ellipsis. Return the promoted
6664 type, or the passed type if there is no change. */
6667 cxx_type_promotes_to (tree type
)
6671 /* Perform the array-to-pointer and function-to-pointer
6673 type
= type_decays_to (type
);
6675 promote
= type_promotes_to (type
);
6676 if (same_type_p (type
, promote
))
6682 /* ARG is a default argument expression being passed to a parameter of
6683 the indicated TYPE, which is a parameter to FN. PARMNUM is the
6684 zero-based argument number. Do any required conversions. Return
6685 the converted value. */
6687 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
6689 push_defarg_context (tree fn
)
6690 { vec_safe_push (default_arg_context
, fn
); }
6693 pop_defarg_context (void)
6694 { default_arg_context
->pop (); }
6697 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
6698 tsubst_flags_t complain
)
6703 /* See through clones. */
6704 fn
= DECL_ORIGIN (fn
);
6706 /* Detect recursion. */
6707 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
6710 if (complain
& tf_error
)
6711 error ("recursive evaluation of default argument for %q#D", fn
);
6712 return error_mark_node
;
6715 /* If the ARG is an unparsed default argument expression, the
6716 conversion cannot be performed. */
6717 if (TREE_CODE (arg
) == DEFAULT_ARG
)
6719 if (complain
& tf_error
)
6720 error ("call to %qD uses the default argument for parameter %P, which "
6721 "is not yet defined", fn
, parmnum
);
6722 return error_mark_node
;
6725 push_defarg_context (fn
);
6727 if (fn
&& DECL_TEMPLATE_INFO (fn
))
6728 arg
= tsubst_default_argument (fn
, type
, arg
, complain
);
6734 The names in the expression are bound, and the semantic
6735 constraints are checked, at the point where the default
6736 expressions appears.
6738 we must not perform access checks here. */
6739 push_deferring_access_checks (dk_no_check
);
6740 /* We must make a copy of ARG, in case subsequent processing
6741 alters any part of it. */
6742 arg
= break_out_target_exprs (arg
);
6743 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
6744 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
6746 arg
= convert_for_arg_passing (type
, arg
, complain
);
6747 pop_deferring_access_checks();
6749 pop_defarg_context ();
6754 /* Returns the type which will really be used for passing an argument of
6758 type_passed_as (tree type
)
6760 /* Pass classes with copy ctors by invisible reference. */
6761 if (TREE_ADDRESSABLE (type
))
6763 type
= build_reference_type (type
);
6764 /* There are no other pointers to this temporary. */
6765 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
6767 else if (targetm
.calls
.promote_prototypes (type
)
6768 && INTEGRAL_TYPE_P (type
)
6769 && COMPLETE_TYPE_P (type
)
6770 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
6771 type
= integer_type_node
;
6776 /* Actually perform the appropriate conversion. */
6779 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
6783 /* If VAL is a bitfield, then -- since it has already been converted
6784 to TYPE -- it cannot have a precision greater than TYPE.
6786 If it has a smaller precision, we must widen it here. For
6787 example, passing "int f:3;" to a function expecting an "int" will
6788 not result in any conversion before this point.
6790 If the precision is the same we must not risk widening. For
6791 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
6792 often have type "int", even though the C++ type for the field is
6793 "long long". If the value is being passed to a function
6794 expecting an "int", then no conversions will be required. But,
6795 if we call convert_bitfield_to_declared_type, the bitfield will
6796 be converted to "long long". */
6797 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
6799 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
6800 val
= convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type
), val
);
6802 if (val
== error_mark_node
)
6804 /* Pass classes with copy ctors by invisible reference. */
6805 else if (TREE_ADDRESSABLE (type
))
6806 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
6807 else if (targetm
.calls
.promote_prototypes (type
)
6808 && INTEGRAL_TYPE_P (type
)
6809 && COMPLETE_TYPE_P (type
)
6810 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
6811 val
= cp_perform_integral_promotions (val
, complain
);
6812 if ((complain
& tf_warning
)
6813 && warn_suggest_attribute_format
)
6815 tree rhstype
= TREE_TYPE (val
);
6816 const enum tree_code coder
= TREE_CODE (rhstype
);
6817 const enum tree_code codel
= TREE_CODE (type
);
6818 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
6820 && check_missing_format_attribute (type
, rhstype
))
6821 warning (OPT_Wsuggest_attribute_format
,
6822 "argument of function call might be a candidate for a format attribute");
6827 /* Returns true iff FN is a function with magic varargs, i.e. ones for
6828 which no conversions at all should be done. This is true for some
6829 builtins which don't act like normal functions. */
6832 magic_varargs_p (tree fn
)
6834 if (flag_cilkplus
&& is_cilkplus_reduce_builtin (fn
) != BUILT_IN_NONE
)
6837 if (DECL_BUILT_IN (fn
))
6838 switch (DECL_FUNCTION_CODE (fn
))
6840 case BUILT_IN_CLASSIFY_TYPE
:
6841 case BUILT_IN_CONSTANT_P
:
6842 case BUILT_IN_NEXT_ARG
:
6843 case BUILT_IN_VA_START
:
6847 return lookup_attribute ("type generic",
6848 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
6854 /* Returns the decl of the dispatcher function if FN is a function version. */
6857 get_function_version_dispatcher (tree fn
)
6859 tree dispatcher_decl
= NULL
;
6861 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
6862 && DECL_FUNCTION_VERSIONED (fn
));
6864 gcc_assert (targetm
.get_function_versions_dispatcher
);
6865 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
6867 if (dispatcher_decl
== NULL
)
6869 error_at (input_location
, "use of multiversioned function "
6870 "without a default");
6874 retrofit_lang_decl (dispatcher_decl
);
6875 gcc_assert (dispatcher_decl
!= NULL
);
6876 return dispatcher_decl
;
6879 /* fn is a function version dispatcher that is marked used. Mark all the
6880 semantically identical function versions it will dispatch as used. */
6883 mark_versions_used (tree fn
)
6885 struct cgraph_node
*node
;
6886 struct cgraph_function_version_info
*node_v
;
6887 struct cgraph_function_version_info
*it_v
;
6889 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6891 node
= cgraph_get_node (fn
);
6895 gcc_assert (node
->dispatcher_function
);
6897 node_v
= get_cgraph_node_version (node
);
6901 /* All semantically identical versions are chained. Traverse and mark each
6902 one of them as used. */
6903 it_v
= node_v
->next
;
6904 while (it_v
!= NULL
)
6906 mark_used (it_v
->this_node
->decl
);
6911 /* Subroutine of the various build_*_call functions. Overload resolution
6912 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
6913 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
6914 bitmask of various LOOKUP_* flags which apply to the call itself. */
6917 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
6920 const vec
<tree
, va_gc
> *args
= cand
->args
;
6921 tree first_arg
= cand
->first_arg
;
6922 conversion
**convs
= cand
->convs
;
6924 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
6929 unsigned int arg_index
= 0;
6933 bool already_used
= false;
6935 /* In a template, there is no need to perform all of the work that
6936 is normally done. We are only interested in the type of the call
6937 expression, i.e., the return type of the function. Any semantic
6938 errors will be deferred until the template is instantiated. */
6939 if (processing_template_decl
)
6943 const tree
*argarray
;
6946 return_type
= TREE_TYPE (TREE_TYPE (fn
));
6947 nargs
= vec_safe_length (args
);
6948 if (first_arg
== NULL_TREE
)
6949 argarray
= args
->address ();
6957 alcarray
= XALLOCAVEC (tree
, nargs
);
6958 alcarray
[0] = build_this (first_arg
);
6959 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
6960 alcarray
[ix
+ 1] = arg
;
6961 argarray
= alcarray
;
6964 addr
= build_addr_func (fn
, complain
);
6965 if (addr
== error_mark_node
)
6966 return error_mark_node
;
6967 expr
= build_call_array_loc (input_location
, return_type
,
6968 addr
, nargs
, argarray
);
6969 if (TREE_THIS_VOLATILE (fn
) && cfun
)
6970 current_function_returns_abnormally
= 1;
6971 return convert_from_reference (expr
);
6974 /* Give any warnings we noticed during overload resolution. */
6975 if (cand
->warnings
&& (complain
& tf_warning
))
6977 struct candidate_warning
*w
;
6978 for (w
= cand
->warnings
; w
; w
= w
->next
)
6979 joust (cand
, w
->loser
, 1, complain
);
6982 /* Make =delete work with SFINAE. */
6983 if (DECL_DELETED_FN (fn
) && !(complain
& tf_error
))
6984 return error_mark_node
;
6986 if (DECL_FUNCTION_MEMBER_P (fn
))
6989 /* If FN is a template function, two cases must be considered.
6994 template <class T> void f();
6996 template <class T> struct B {
7000 struct C : A, B<int> {
7002 using B<int>::g; // #2
7005 In case #1 where `A::f' is a member template, DECL_ACCESS is
7006 recorded in the primary template but not in its specialization.
7007 We check access of FN using its primary template.
7009 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7010 because it is a member of class template B, DECL_ACCESS is
7011 recorded in the specialization `B<int>::g'. We cannot use its
7012 primary template because `B<T>::g' and `B<int>::g' may have
7013 different access. */
7014 if (DECL_TEMPLATE_INFO (fn
)
7015 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
7016 access_fn
= DECL_TI_TEMPLATE (fn
);
7019 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
7021 return error_mark_node
;
7024 /* If we're checking for implicit delete, don't bother with argument
7026 if (flags
& LOOKUP_SPECULATIVE
)
7028 if (DECL_DELETED_FN (fn
))
7030 if (complain
& tf_error
)
7032 return error_mark_node
;
7034 if (cand
->viable
== 1)
7036 else if (!(complain
& tf_error
))
7037 /* Reject bad conversions now. */
7038 return error_mark_node
;
7039 /* else continue to get conversion error. */
7042 /* N3276 magic doesn't apply to nested calls. */
7043 int decltype_flag
= (complain
& tf_decltype
);
7044 complain
&= ~tf_decltype
;
7046 /* Find maximum size of vector to hold converted arguments. */
7047 parmlen
= list_length (parm
);
7048 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
7049 if (parmlen
> nargs
)
7051 argarray
= XALLOCAVEC (tree
, nargs
);
7053 /* The implicit parameters to a constructor are not considered by overload
7054 resolution, and must be of the proper type. */
7055 if (DECL_CONSTRUCTOR_P (fn
))
7058 if (first_arg
!= NULL_TREE
)
7060 object_arg
= first_arg
;
7061 first_arg
= NULL_TREE
;
7065 object_arg
= (*args
)[arg_index
];
7068 argarray
[j
++] = build_this (object_arg
);
7069 parm
= TREE_CHAIN (parm
);
7070 /* We should never try to call the abstract constructor. */
7071 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
7073 if (DECL_HAS_VTT_PARM_P (fn
))
7075 argarray
[j
++] = (*args
)[arg_index
];
7077 parm
= TREE_CHAIN (parm
);
7080 /* Bypass access control for 'this' parameter. */
7081 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7083 tree parmtype
= TREE_VALUE (parm
);
7084 tree arg
= build_this (first_arg
!= NULL_TREE
7086 : (*args
)[arg_index
]);
7087 tree argtype
= TREE_TYPE (arg
);
7091 if (convs
[i
]->bad_p
)
7093 if (complain
& tf_error
)
7095 if (permerror (input_location
, "passing %qT as %<this%> "
7096 "argument discards qualifiers",
7097 TREE_TYPE (argtype
)))
7098 inform (DECL_SOURCE_LOCATION (fn
), " in call to %qD", fn
);
7101 return error_mark_node
;
7104 /* See if the function member or the whole class type is declared
7105 final and the call can be devirtualized. */
7106 if (DECL_FINAL_P (fn
)
7107 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
7108 flags
|= LOOKUP_NONVIRTUAL
;
7110 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
7111 X is called for an object that is not of type X, or of a type
7112 derived from X, the behavior is undefined.
7114 So we can assume that anything passed as 'this' is non-null, and
7115 optimize accordingly. */
7116 gcc_assert (TYPE_PTR_P (parmtype
));
7117 /* Convert to the base in which the function was declared. */
7118 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
7119 converted_arg
= build_base_path (PLUS_EXPR
,
7121 cand
->conversion_path
,
7123 /* Check that the base class is accessible. */
7124 if (!accessible_base_p (TREE_TYPE (argtype
),
7125 BINFO_TYPE (cand
->conversion_path
), true))
7127 if (complain
& tf_error
)
7128 error ("%qT is not an accessible base of %qT",
7129 BINFO_TYPE (cand
->conversion_path
),
7130 TREE_TYPE (argtype
));
7132 return error_mark_node
;
7134 /* If fn was found by a using declaration, the conversion path
7135 will be to the derived class, not the base declaring fn. We
7136 must convert from derived to base. */
7137 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
7138 TREE_TYPE (parmtype
), ba_unique
,
7140 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
7141 base_binfo
, 1, complain
);
7143 argarray
[j
++] = converted_arg
;
7144 parm
= TREE_CHAIN (parm
);
7145 if (first_arg
!= NULL_TREE
)
7146 first_arg
= NULL_TREE
;
7153 gcc_assert (first_arg
== NULL_TREE
);
7154 for (; arg_index
< vec_safe_length (args
) && parm
;
7155 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
7157 tree type
= TREE_VALUE (parm
);
7158 tree arg
= (*args
)[arg_index
];
7159 bool conversion_warning
= true;
7163 /* If the argument is NULL and used to (implicitly) instantiate a
7164 template function (and bind one of the template arguments to
7165 the type of 'long int'), we don't want to warn about passing NULL
7166 to non-pointer argument.
7167 For example, if we have this template function:
7169 template<typename T> void func(T x) {}
7171 we want to warn (when -Wconversion is enabled) in this case:
7177 but not in this case:
7183 if (arg
== null_node
7184 && DECL_TEMPLATE_INFO (fn
)
7185 && cand
->template_decl
7186 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
7187 conversion_warning
= false;
7189 /* Warn about initializer_list deduction that isn't currently in the
7191 if (cxx_dialect
> cxx98
7192 && flag_deduce_init_list
7193 && cand
->template_decl
7194 && is_std_init_list (non_reference (type
))
7195 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
7197 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
7198 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
7199 tree patparm
= get_pattern_parm (realparm
, tmpl
);
7200 tree pattype
= TREE_TYPE (patparm
);
7201 if (PACK_EXPANSION_P (pattype
))
7202 pattype
= PACK_EXPANSION_PATTERN (pattype
);
7203 pattype
= non_reference (pattype
);
7205 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
7206 && (cand
->explicit_targs
== NULL_TREE
7207 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
7208 <= TEMPLATE_TYPE_IDX (pattype
))))
7210 pedwarn (input_location
, 0, "deducing %qT as %qT",
7211 non_reference (TREE_TYPE (patparm
)),
7212 non_reference (type
));
7213 pedwarn (input_location
, 0, " in call to %q+D", cand
->fn
);
7214 pedwarn (input_location
, 0,
7215 " (you can disable this with -fno-deduce-init-list)");
7218 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
7221 : complain
& (~tf_warning
));
7223 val
= convert_for_arg_passing (type
, val
, complain
);
7225 if (val
== error_mark_node
)
7226 return error_mark_node
;
7228 argarray
[j
++] = val
;
7231 /* Default arguments */
7232 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
7234 if (TREE_VALUE (parm
) == error_mark_node
)
7235 return error_mark_node
;
7236 argarray
[j
++] = convert_default_arg (TREE_VALUE (parm
),
7237 TREE_PURPOSE (parm
),
7243 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
7245 tree a
= (*args
)[arg_index
];
7246 if (magic_varargs_p (fn
))
7247 /* Do no conversions for magic varargs. */
7248 a
= mark_type_use (a
);
7250 a
= convert_arg_to_ellipsis (a
, complain
);
7254 gcc_assert (j
<= nargs
);
7257 check_function_arguments (TREE_TYPE (fn
), nargs
, argarray
);
7259 /* Avoid actually calling copy constructors and copy assignment operators,
7262 if (! flag_elide_constructors
)
7263 /* Do things the hard way. */;
7264 else if (cand
->num_convs
== 1
7265 && (DECL_COPY_CONSTRUCTOR_P (fn
)
7266 || DECL_MOVE_CONSTRUCTOR_P (fn
)))
7269 tree arg
= argarray
[num_artificial_parms_for (fn
)];
7271 bool trivial
= trivial_fn_p (fn
);
7273 /* Pull out the real argument, disregarding const-correctness. */
7275 while (CONVERT_EXPR_P (targ
)
7276 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
7277 targ
= TREE_OPERAND (targ
, 0);
7278 if (TREE_CODE (targ
) == ADDR_EXPR
)
7280 targ
= TREE_OPERAND (targ
, 0);
7281 if (!same_type_ignoring_top_level_qualifiers_p
7282 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
7291 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
7293 /* [class.copy]: the copy constructor is implicitly defined even if
7294 the implementation elided its use. */
7295 if (!trivial
|| DECL_DELETED_FN (fn
))
7298 already_used
= true;
7301 /* If we're creating a temp and we already have one, don't create a
7302 new one. If we're not creating a temp but we get one, use
7303 INIT_EXPR to collapse the temp into our target. Otherwise, if the
7304 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
7305 temp or an INIT_EXPR otherwise. */
7307 if (is_dummy_object (fa
))
7309 if (TREE_CODE (arg
) == TARGET_EXPR
)
7312 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
7314 else if (TREE_CODE (arg
) == TARGET_EXPR
|| trivial
)
7316 tree to
= stabilize_reference (cp_build_indirect_ref (fa
, RO_NULL
,
7319 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
7323 else if (DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
7324 && trivial_fn_p (fn
)
7325 && !DECL_DELETED_FN (fn
))
7327 tree to
= stabilize_reference
7328 (cp_build_indirect_ref (argarray
[0], RO_NULL
, complain
));
7329 tree type
= TREE_TYPE (to
);
7330 tree as_base
= CLASSTYPE_AS_BASE (type
);
7331 tree arg
= argarray
[1];
7333 if (is_really_empty_class (type
))
7335 /* Avoid copying empty classes. */
7336 val
= build2 (COMPOUND_EXPR
, void_type_node
, to
, arg
);
7337 TREE_NO_WARNING (val
) = 1;
7338 val
= build2 (COMPOUND_EXPR
, type
, val
, to
);
7339 TREE_NO_WARNING (val
) = 1;
7341 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
7343 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
7344 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
7348 /* We must only copy the non-tail padding parts. */
7350 tree array_type
, alias_set
;
7352 arg2
= TYPE_SIZE_UNIT (as_base
);
7353 arg0
= cp_build_addr_expr (to
, complain
);
7355 array_type
= build_array_type (char_type_node
,
7357 (size_binop (MINUS_EXPR
,
7358 arg2
, size_int (1))));
7359 alias_set
= build_int_cst (build_pointer_type (type
), 0);
7360 t
= build2 (MODIFY_EXPR
, void_type_node
,
7361 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
7362 build2 (MEM_REF
, array_type
, arg
, alias_set
));
7363 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
7364 TREE_NO_WARNING (val
) = 1;
7369 else if (DECL_DESTRUCTOR_P (fn
)
7370 && trivial_fn_p (fn
)
7371 && !DECL_DELETED_FN (fn
))
7372 return fold_convert (void_type_node
, argarray
[0]);
7373 /* FIXME handle trivial default constructor, too. */
7375 /* For calls to a multi-versioned function, overload resolution
7376 returns the function with the highest target priority, that is,
7377 the version that will checked for dispatching first. If this
7378 version is inlinable, a direct call to this version can be made
7379 otherwise the call should go through the dispatcher. */
7381 if (DECL_FUNCTION_VERSIONED (fn
)
7382 && (current_function_decl
== NULL
7383 || !targetm
.target_option
.can_inline_p (current_function_decl
, fn
)))
7385 fn
= get_function_version_dispatcher (fn
);
7389 mark_versions_used (fn
);
7394 return error_mark_node
;
7396 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0
7397 /* Don't mess with virtual lookup in fold_non_dependent_expr; virtual
7398 functions can't be constexpr. */
7399 && !in_template_function ())
7402 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
7404 ba_any
, NULL
, complain
);
7405 gcc_assert (binfo
&& binfo
!= error_mark_node
);
7407 /* Warn about deprecated virtual functions now, since we're about
7408 to throw away the decl. */
7409 if (TREE_DEPRECATED (fn
))
7410 warn_deprecated_use (fn
, NULL_TREE
);
7412 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
7414 if (TREE_SIDE_EFFECTS (argarray
[0]))
7415 argarray
[0] = save_expr (argarray
[0]);
7416 t
= build_pointer_type (TREE_TYPE (fn
));
7417 if (DECL_CONTEXT (fn
) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn
)))
7418 fn
= build_java_interface_fn_ref (fn
, argarray
[0]);
7420 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
7425 fn
= build_addr_func (fn
, complain
);
7426 if (fn
== error_mark_node
)
7427 return error_mark_node
;
7430 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
7431 if (TREE_CODE (call
) == CALL_EXPR
7432 && (cand
->flags
& LOOKUP_LIST_INIT_CTOR
))
7433 CALL_EXPR_LIST_INIT_P (call
) = true;
7437 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
7438 This function performs no overload resolution, conversion, or other
7439 high-level operations. */
7442 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
7443 tsubst_flags_t complain
)
7448 /* Remember roughly where this call is. */
7449 location_t loc
= EXPR_LOC_OR_LOC (fn
, input_location
);
7450 fn
= build_call_a (fn
, nargs
, argarray
);
7451 SET_EXPR_LOCATION (fn
, loc
);
7453 fndecl
= get_callee_fndecl (fn
);
7455 /* Check that arguments to builtin functions match the expectations. */
7457 && DECL_BUILT_IN (fndecl
)
7458 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
7459 && !check_builtin_function_arguments (fndecl
, nargs
, argarray
))
7460 return error_mark_node
;
7462 /* If it is a built-in array notation function, then the return type of
7463 the function is the element type of the array passed in as array
7464 notation (i.e. the first parameter of the function). */
7465 if (flag_cilkplus
&& TREE_CODE (fn
) == CALL_EXPR
)
7467 enum built_in_function bif
=
7468 is_cilkplus_reduce_builtin (CALL_EXPR_FN (fn
));
7469 if (bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_ADD
7470 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MUL
7471 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MAX
7472 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MIN
7473 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE
7474 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MUTATING
)
7476 /* for bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_ZERO or
7477 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_ZERO or
7478 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_NONZERO or
7479 BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_NONZERO or
7480 BUILT_IN_CILKPLUS_SEC_REDUCE_MIN_IND or
7481 BUILT_IN_CILKPLUS_SEC_REDUCE_MAX_IND
7482 The pre-defined return-type is the correct one. */
7483 tree array_ntn
= CALL_EXPR_ARG (fn
, 0);
7484 TREE_TYPE (fn
) = TREE_TYPE (array_ntn
);
7489 /* Some built-in function calls will be evaluated at compile-time in
7490 fold (). Set optimize to 1 when folding __builtin_constant_p inside
7491 a constexpr function so that fold_builtin_1 doesn't fold it to 0. */
7492 optimize_sav
= optimize
;
7493 if (!optimize
&& fndecl
&& DECL_IS_BUILTIN_CONSTANT_P (fndecl
)
7494 && current_function_decl
7495 && DECL_DECLARED_CONSTEXPR_P (current_function_decl
))
7497 fn
= fold_if_not_in_template (fn
);
7498 optimize
= optimize_sav
;
7500 if (VOID_TYPE_P (TREE_TYPE (fn
)))
7503 /* 5.2.2/11: If a function call is a prvalue of object type: if the
7504 function call is either the operand of a decltype-specifier or the
7505 right operand of a comma operator that is the operand of a
7506 decltype-specifier, a temporary object is not introduced for the
7507 prvalue. The type of the prvalue may be incomplete. */
7508 if (!(complain
& tf_decltype
))
7510 fn
= require_complete_type_sfinae (fn
, complain
);
7511 if (fn
== error_mark_node
)
7512 return error_mark_node
;
7514 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
7515 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
7517 return convert_from_reference (fn
);
7520 static GTY(()) tree java_iface_lookup_fn
;
7522 /* Make an expression which yields the address of the Java interface
7523 method FN. This is achieved by generating a call to libjava's
7524 _Jv_LookupInterfaceMethodIdx(). */
7527 build_java_interface_fn_ref (tree fn
, tree instance
)
7529 tree lookup_fn
, method
, idx
;
7530 tree klass_ref
, iface
, iface_ref
;
7533 if (!java_iface_lookup_fn
)
7535 tree ftype
= build_function_type_list (ptr_type_node
,
7536 ptr_type_node
, ptr_type_node
,
7537 java_int_type_node
, NULL_TREE
);
7538 java_iface_lookup_fn
7539 = add_builtin_function ("_Jv_LookupInterfaceMethodIdx", ftype
,
7540 0, NOT_BUILT_IN
, NULL
, NULL_TREE
);
7543 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
7544 This is the first entry in the vtable. */
7545 klass_ref
= build_vtbl_ref (cp_build_indirect_ref (instance
, RO_NULL
,
7546 tf_warning_or_error
),
7549 /* Get the java.lang.Class pointer for the interface being called. */
7550 iface
= DECL_CONTEXT (fn
);
7551 iface_ref
= lookup_field (iface
, get_identifier ("class$"), 0, false);
7552 if (!iface_ref
|| !VAR_P (iface_ref
)
7553 || DECL_CONTEXT (iface_ref
) != iface
)
7555 error ("could not find class$ field in java interface type %qT",
7557 return error_mark_node
;
7559 iface_ref
= build_address (iface_ref
);
7560 iface_ref
= convert (build_pointer_type (iface
), iface_ref
);
7562 /* Determine the itable index of FN. */
7564 for (method
= TYPE_METHODS (iface
); method
; method
= DECL_CHAIN (method
))
7566 if (!DECL_VIRTUAL_P (method
))
7572 idx
= build_int_cst (NULL_TREE
, i
);
7574 lookup_fn
= build1 (ADDR_EXPR
,
7575 build_pointer_type (TREE_TYPE (java_iface_lookup_fn
)),
7576 java_iface_lookup_fn
);
7577 return build_call_nary (ptr_type_node
, lookup_fn
,
7578 3, klass_ref
, iface_ref
, idx
);
7581 /* Returns the value to use for the in-charge parameter when making a
7582 call to a function with the indicated NAME.
7584 FIXME:Can't we find a neater way to do this mapping? */
7587 in_charge_arg_for_name (tree name
)
7589 if (name
== base_ctor_identifier
7590 || name
== base_dtor_identifier
)
7591 return integer_zero_node
;
7592 else if (name
== complete_ctor_identifier
)
7593 return integer_one_node
;
7594 else if (name
== complete_dtor_identifier
)
7595 return integer_two_node
;
7596 else if (name
== deleting_dtor_identifier
)
7597 return integer_three_node
;
7599 /* This function should only be called with one of the names listed
7605 /* Build a call to a constructor, destructor, or an assignment
7606 operator for INSTANCE, an expression with class type. NAME
7607 indicates the special member function to call; *ARGS are the
7608 arguments. ARGS may be NULL. This may change ARGS. BINFO
7609 indicates the base of INSTANCE that is to be passed as the `this'
7610 parameter to the member function called.
7612 FLAGS are the LOOKUP_* flags to use when processing the call.
7614 If NAME indicates a complete object constructor, INSTANCE may be
7615 NULL_TREE. In this case, the caller will call build_cplus_new to
7616 store the newly constructed object into a VAR_DECL. */
7619 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
7620 tree binfo
, int flags
, tsubst_flags_t complain
)
7623 /* The type of the subobject to be constructed or destroyed. */
7625 vec
<tree
, va_gc
> *allocated
= NULL
;
7628 gcc_assert (name
== complete_ctor_identifier
7629 || name
== base_ctor_identifier
7630 || name
== complete_dtor_identifier
7631 || name
== base_dtor_identifier
7632 || name
== deleting_dtor_identifier
7633 || name
== ansi_assopname (NOP_EXPR
));
7636 /* Resolve the name. */
7637 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
7638 return error_mark_node
;
7640 binfo
= TYPE_BINFO (binfo
);
7643 gcc_assert (binfo
!= NULL_TREE
);
7645 class_type
= BINFO_TYPE (binfo
);
7647 /* Handle the special case where INSTANCE is NULL_TREE. */
7648 if (name
== complete_ctor_identifier
&& !instance
)
7649 instance
= build_dummy_object (class_type
);
7652 if (name
== complete_dtor_identifier
7653 || name
== base_dtor_identifier
7654 || name
== deleting_dtor_identifier
)
7655 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
7657 /* Convert to the base class, if necessary. */
7658 if (!same_type_ignoring_top_level_qualifiers_p
7659 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
7661 if (name
!= ansi_assopname (NOP_EXPR
))
7662 /* For constructors and destructors, either the base is
7663 non-virtual, or it is virtual but we are doing the
7664 conversion from a constructor or destructor for the
7665 complete object. In either case, we can convert
7667 instance
= convert_to_base_statically (instance
, binfo
);
7669 /* However, for assignment operators, we must convert
7670 dynamically if the base is virtual. */
7671 instance
= build_base_path (PLUS_EXPR
, instance
,
7672 binfo
, /*nonnull=*/1, complain
);
7676 gcc_assert (instance
!= NULL_TREE
);
7678 fns
= lookup_fnfields (binfo
, name
, 1);
7680 /* When making a call to a constructor or destructor for a subobject
7681 that uses virtual base classes, pass down a pointer to a VTT for
7683 if ((name
== base_ctor_identifier
7684 || name
== base_dtor_identifier
)
7685 && CLASSTYPE_VBASECLASSES (class_type
))
7690 /* If the current function is a complete object constructor
7691 or destructor, then we fetch the VTT directly.
7692 Otherwise, we look it up using the VTT we were given. */
7693 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
7694 vtt
= decay_conversion (vtt
, complain
);
7695 if (vtt
== error_mark_node
)
7696 return error_mark_node
;
7697 vtt
= build3 (COND_EXPR
, TREE_TYPE (vtt
),
7698 build2 (EQ_EXPR
, boolean_type_node
,
7699 current_in_charge_parm
, integer_zero_node
),
7702 if (BINFO_SUBVTT_INDEX (binfo
))
7703 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
7709 allocated
= make_tree_vector ();
7713 vec_safe_insert (*args
, 0, sub_vtt
);
7716 ret
= build_new_method_call (instance
, fns
, args
,
7717 TYPE_BINFO (BINFO_TYPE (binfo
)),
7721 if (allocated
!= NULL
)
7722 release_tree_vector (allocated
);
7724 if ((complain
& tf_error
)
7725 && (flags
& LOOKUP_DELEGATING_CONS
)
7726 && name
== complete_ctor_identifier
7727 && TREE_CODE (ret
) == CALL_EXPR
7728 && (DECL_ABSTRACT_ORIGIN (TREE_OPERAND (CALL_EXPR_FN (ret
), 0))
7729 == current_function_decl
))
7730 error ("constructor delegates to itself");
7735 /* Return the NAME, as a C string. The NAME indicates a function that
7736 is a member of TYPE. *FREE_P is set to true if the caller must
7737 free the memory returned.
7739 Rather than go through all of this, we should simply set the names
7740 of constructors and destructors appropriately, and dispense with
7741 ctor_identifier, dtor_identifier, etc. */
7744 name_as_c_string (tree name
, tree type
, bool *free_p
)
7748 /* Assume that we will not allocate memory. */
7750 /* Constructors and destructors are special. */
7751 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
7754 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
))));
7755 /* For a destructor, add the '~'. */
7756 if (name
== complete_dtor_identifier
7757 || name
== base_dtor_identifier
7758 || name
== deleting_dtor_identifier
)
7760 pretty_name
= concat ("~", pretty_name
, NULL
);
7761 /* Remember that we need to free the memory allocated. */
7765 else if (IDENTIFIER_TYPENAME_P (name
))
7767 pretty_name
= concat ("operator ",
7768 type_as_string_translate (TREE_TYPE (name
),
7769 TFF_PLAIN_IDENTIFIER
),
7771 /* Remember that we need to free the memory allocated. */
7775 pretty_name
= CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name
)));
7780 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
7781 be set, upon return, to the function called. ARGS may be NULL.
7782 This may change ARGS. */
7785 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
7786 tree conversion_path
, int flags
,
7787 tree
*fn_p
, tsubst_flags_t complain
)
7789 struct z_candidate
*candidates
= 0, *cand
;
7790 tree explicit_targs
= NULL_TREE
;
7791 tree basetype
= NULL_TREE
;
7792 tree access_binfo
, binfo
;
7794 tree first_mem_arg
= NULL_TREE
;
7796 bool skip_first_for_error
;
7797 vec
<tree
, va_gc
> *user_args
;
7800 int template_only
= 0;
7804 vec
<tree
, va_gc
> *orig_args
= NULL
;
7807 gcc_assert (instance
!= NULL_TREE
);
7809 /* We don't know what function we're going to call, yet. */
7813 if (error_operand_p (instance
)
7814 || !fns
|| error_operand_p (fns
))
7815 return error_mark_node
;
7817 if (!BASELINK_P (fns
))
7819 if (complain
& tf_error
)
7820 error ("call to non-function %qD", fns
);
7821 return error_mark_node
;
7824 orig_instance
= instance
;
7827 /* Dismantle the baselink to collect all the information we need. */
7828 if (!conversion_path
)
7829 conversion_path
= BASELINK_BINFO (fns
);
7830 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
7831 binfo
= BASELINK_BINFO (fns
);
7832 optype
= BASELINK_OPTYPE (fns
);
7833 fns
= BASELINK_FUNCTIONS (fns
);
7834 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
7836 explicit_targs
= TREE_OPERAND (fns
, 1);
7837 fns
= TREE_OPERAND (fns
, 0);
7840 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
7841 || TREE_CODE (fns
) == TEMPLATE_DECL
7842 || TREE_CODE (fns
) == OVERLOAD
);
7843 fn
= get_first_fn (fns
);
7844 name
= DECL_NAME (fn
);
7846 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
7847 gcc_assert (CLASS_TYPE_P (basetype
));
7849 if (processing_template_decl
)
7851 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
7852 instance
= build_non_dependent_expr (instance
);
7854 make_args_non_dependent (*args
);
7857 user_args
= args
== NULL
? NULL
: *args
;
7858 /* Under DR 147 A::A() is an invalid constructor call,
7859 not a functional cast. */
7860 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
7862 if (! (complain
& tf_error
))
7863 return error_mark_node
;
7865 if (permerror (input_location
,
7866 "cannot call constructor %<%T::%D%> directly",
7868 inform (input_location
, "for a function-style cast, remove the "
7869 "redundant %<::%D%>", name
);
7870 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
7875 /* Figure out whether to skip the first argument for the error
7876 message we will display to users if an error occurs. We don't
7877 want to display any compiler-generated arguments. The "this"
7878 pointer hasn't been added yet. However, we must remove the VTT
7879 pointer if this is a call to a base-class constructor or
7881 skip_first_for_error
= false;
7882 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
7884 /* Callers should explicitly indicate whether they want to construct
7885 the complete object or just the part without virtual bases. */
7886 gcc_assert (name
!= ctor_identifier
);
7887 /* Similarly for destructors. */
7888 gcc_assert (name
!= dtor_identifier
);
7889 /* Remove the VTT pointer, if present. */
7890 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
7891 && CLASSTYPE_VBASECLASSES (basetype
))
7892 skip_first_for_error
= true;
7895 /* Process the argument list. */
7896 if (args
!= NULL
&& *args
!= NULL
)
7898 *args
= resolve_args (*args
, complain
);
7900 return error_mark_node
;
7903 /* Consider the object argument to be used even if we end up selecting a
7904 static member function. */
7905 instance
= mark_type_use (instance
);
7907 /* It's OK to call destructors and constructors on cv-qualified objects.
7908 Therefore, convert the INSTANCE to the unqualified type, if
7910 if (DECL_DESTRUCTOR_P (fn
)
7911 || DECL_CONSTRUCTOR_P (fn
))
7913 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
7915 instance
= build_this (instance
);
7916 instance
= build_nop (build_pointer_type (basetype
), instance
);
7917 instance
= build_fold_indirect_ref (instance
);
7920 if (DECL_DESTRUCTOR_P (fn
))
7921 name
= complete_dtor_identifier
;
7923 /* For the overload resolution we need to find the actual `this`
7924 that would be captured if the call turns out to be to a
7925 non-static member function. Do not actually capture it at this
7927 first_mem_arg
= maybe_resolve_dummy (instance
, false);
7929 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7930 p
= conversion_obstack_alloc (0);
7932 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
7933 initializer, not T({ }). */
7934 if (DECL_CONSTRUCTOR_P (fn
) && args
!= NULL
&& !vec_safe_is_empty (*args
)
7935 && DIRECT_LIST_INIT_P ((**args
)[0]))
7937 tree init_list
= (**args
)[0];
7938 tree init
= NULL_TREE
;
7940 gcc_assert ((*args
)->length () == 1
7941 && !(flags
& LOOKUP_ONLYCONVERTING
));
7943 /* If the initializer list has no elements and T is a class type with
7944 a default constructor, the object is value-initialized. Handle
7945 this here so we don't need to handle it wherever we use
7946 build_special_member_call. */
7947 if (CONSTRUCTOR_NELTS (init_list
) == 0
7948 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
7949 /* For a user-provided default constructor, use the normal
7950 mechanisms so that protected access works. */
7951 && !type_has_user_provided_default_constructor (basetype
)
7952 && !processing_template_decl
)
7953 init
= build_value_init (basetype
, complain
);
7955 /* If BASETYPE is an aggregate, we need to do aggregate
7957 else if (CP_AGGREGATE_TYPE_P (basetype
))
7958 init
= digest_init (basetype
, init_list
, complain
);
7962 if (is_dummy_object (instance
))
7963 return get_target_expr_sfinae (init
, complain
);
7964 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
7965 TREE_SIDE_EFFECTS (init
) = true;
7969 /* Otherwise go ahead with overload resolution. */
7970 add_list_candidates (fns
, first_mem_arg
, init_list
,
7971 basetype
, explicit_targs
, template_only
,
7972 conversion_path
, access_binfo
, flags
,
7973 &candidates
, complain
);
7977 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
7978 explicit_targs
, template_only
, conversion_path
,
7979 access_binfo
, flags
, &candidates
, complain
);
7981 any_viable_p
= false;
7982 candidates
= splice_viable (candidates
, false, &any_viable_p
);
7986 if (complain
& tf_error
)
7988 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
7989 cxx_incomplete_type_error (instance
, basetype
);
7991 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
7992 basetype
, optype
, build_tree_list_vec (user_args
),
7993 TREE_TYPE (instance
));
8000 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
8001 arglist
= build_tree_list_vec (user_args
);
8002 if (skip_first_for_error
)
8003 arglist
= TREE_CHAIN (arglist
);
8004 error ("no matching function for call to %<%T::%s(%A)%#V%>",
8005 basetype
, pretty_name
, arglist
,
8006 TREE_TYPE (instance
));
8010 print_z_candidates (location_of (name
), candidates
);
8012 call
= error_mark_node
;
8016 cand
= tourney (candidates
, complain
);
8023 if (complain
& tf_error
)
8025 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
8026 arglist
= build_tree_list_vec (user_args
);
8027 if (skip_first_for_error
)
8028 arglist
= TREE_CHAIN (arglist
);
8029 if (!any_strictly_viable (candidates
))
8030 error ("no matching function for call to %<%s(%A)%>",
8031 pretty_name
, arglist
);
8033 error ("call of overloaded %<%s(%A)%> is ambiguous",
8034 pretty_name
, arglist
);
8035 print_z_candidates (location_of (name
), candidates
);
8039 call
= error_mark_node
;
8046 if (!(flags
& LOOKUP_NONVIRTUAL
)
8047 && DECL_PURE_VIRTUAL_P (fn
)
8048 && instance
== current_class_ref
8049 && (complain
& tf_warning
))
8051 /* This is not an error, it is runtime undefined
8053 if (!current_function_decl
)
8054 warning (0, "pure virtual %q#D called from "
8055 "non-static data member initializer", fn
);
8056 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
8057 || DECL_DESTRUCTOR_P (current_function_decl
))
8058 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
8059 ? "pure virtual %q#D called from constructor"
8060 : "pure virtual %q#D called from destructor"),
8064 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
8065 && !DECL_CONSTRUCTOR_P (fn
)
8066 && is_dummy_object (instance
))
8068 instance
= maybe_resolve_dummy (instance
, true);
8069 if (instance
== error_mark_node
)
8070 call
= error_mark_node
;
8071 else if (!is_dummy_object (instance
))
8073 /* We captured 'this' in the current lambda now that
8074 we know we really need it. */
8075 cand
->first_arg
= instance
;
8079 if (complain
& tf_error
)
8080 error ("cannot call member function %qD without object",
8082 call
= error_mark_node
;
8086 if (call
!= error_mark_node
)
8088 /* Optimize away vtable lookup if we know that this
8089 function can't be overridden. We need to check if
8090 the context and the type where we found fn are the same,
8091 actually FN might be defined in a different class
8092 type because of a using-declaration. In this case, we
8093 do not want to perform a non-virtual call. */
8094 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
8095 && same_type_ignoring_top_level_qualifiers_p
8096 (DECL_CONTEXT (fn
), BINFO_TYPE (binfo
))
8097 && resolves_to_fixed_type_p (instance
, 0))
8098 flags
|= LOOKUP_NONVIRTUAL
;
8100 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
8101 /* Now we know what function is being called. */
8104 /* Build the actual CALL_EXPR. */
8105 call
= build_over_call (cand
, flags
, complain
);
8106 /* In an expression of the form `a->f()' where `f' turns
8107 out to be a static member function, `a' is
8108 none-the-less evaluated. */
8109 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
8110 && !is_dummy_object (instance
)
8111 && TREE_SIDE_EFFECTS (instance
))
8112 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
),
8114 else if (call
!= error_mark_node
8115 && DECL_DESTRUCTOR_P (cand
->fn
)
8116 && !VOID_TYPE_P (TREE_TYPE (call
)))
8117 /* An explicit call of the form "x->~X()" has type
8118 "void". However, on platforms where destructors
8119 return "this" (i.e., those where
8120 targetm.cxx.cdtor_returns_this is true), such calls
8121 will appear to have a return value of pointer type
8122 to the low-level call machinery. We do not want to
8123 change the low-level machinery, since we want to be
8124 able to optimize "delete f()" on such platforms as
8125 "operator delete(~X(f()))" (rather than generating
8126 "t = f(), ~X(t), operator delete (t)"). */
8127 call
= build_nop (void_type_node
, call
);
8132 if (processing_template_decl
&& call
!= error_mark_node
)
8134 bool cast_to_void
= false;
8136 if (TREE_CODE (call
) == COMPOUND_EXPR
)
8137 call
= TREE_OPERAND (call
, 1);
8138 else if (TREE_CODE (call
) == NOP_EXPR
)
8140 cast_to_void
= true;
8141 call
= TREE_OPERAND (call
, 0);
8143 if (INDIRECT_REF_P (call
))
8144 call
= TREE_OPERAND (call
, 0);
8145 call
= (build_min_non_dep_call_vec
8147 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
8148 orig_instance
, orig_fns
, NULL_TREE
),
8150 SET_EXPR_LOCATION (call
, input_location
);
8151 call
= convert_from_reference (call
);
8153 call
= build_nop (void_type_node
, call
);
8156 /* Free all the conversions we allocated. */
8157 obstack_free (&conversion_obstack
, p
);
8159 if (orig_args
!= NULL
)
8160 release_tree_vector (orig_args
);
8165 /* Wrapper for above. */
8168 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
8169 tree conversion_path
, int flags
,
8170 tree
*fn_p
, tsubst_flags_t complain
)
8173 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
8174 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
8176 timevar_cond_stop (TV_OVERLOAD
, subtime
);
8180 /* Returns true iff standard conversion sequence ICS1 is a proper
8181 subsequence of ICS2. */
8184 is_subseq (conversion
*ics1
, conversion
*ics2
)
8186 /* We can assume that a conversion of the same code
8187 between the same types indicates a subsequence since we only get
8188 here if the types we are converting from are the same. */
8190 while (ics1
->kind
== ck_rvalue
8191 || ics1
->kind
== ck_lvalue
)
8192 ics1
= next_conversion (ics1
);
8196 while (ics2
->kind
== ck_rvalue
8197 || ics2
->kind
== ck_lvalue
)
8198 ics2
= next_conversion (ics2
);
8200 if (ics2
->kind
== ck_user
8201 || ics2
->kind
== ck_ambig
8202 || ics2
->kind
== ck_aggr
8203 || ics2
->kind
== ck_list
8204 || ics2
->kind
== ck_identity
)
8205 /* At this point, ICS1 cannot be a proper subsequence of
8206 ICS2. We can get a USER_CONV when we are comparing the
8207 second standard conversion sequence of two user conversion
8211 ics2
= next_conversion (ics2
);
8213 if (ics2
->kind
== ics1
->kind
8214 && same_type_p (ics2
->type
, ics1
->type
)
8215 && same_type_p (next_conversion (ics2
)->type
,
8216 next_conversion (ics1
)->type
))
8221 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
8222 be any _TYPE nodes. */
8225 is_properly_derived_from (tree derived
, tree base
)
8227 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
8230 /* We only allow proper derivation here. The DERIVED_FROM_P macro
8231 considers every class derived from itself. */
8232 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
8233 && DERIVED_FROM_P (base
, derived
));
8236 /* We build the ICS for an implicit object parameter as a pointer
8237 conversion sequence. However, such a sequence should be compared
8238 as if it were a reference conversion sequence. If ICS is the
8239 implicit conversion sequence for an implicit object parameter,
8240 modify it accordingly. */
8243 maybe_handle_implicit_object (conversion
**ics
)
8247 /* [over.match.funcs]
8249 For non-static member functions, the type of the
8250 implicit object parameter is "reference to cv X"
8251 where X is the class of which the function is a
8252 member and cv is the cv-qualification on the member
8253 function declaration. */
8254 conversion
*t
= *ics
;
8255 tree reference_type
;
8257 /* The `this' parameter is a pointer to a class type. Make the
8258 implicit conversion talk about a reference to that same class
8260 reference_type
= TREE_TYPE (t
->type
);
8261 reference_type
= build_reference_type (reference_type
);
8263 if (t
->kind
== ck_qual
)
8264 t
= next_conversion (t
);
8265 if (t
->kind
== ck_ptr
)
8266 t
= next_conversion (t
);
8267 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
8268 t
= direct_reference_binding (reference_type
, t
);
8270 t
->rvaluedness_matches_p
= 0;
8275 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
8276 and return the initial reference binding conversion. Otherwise,
8277 leave *ICS unchanged and return NULL. */
8280 maybe_handle_ref_bind (conversion
**ics
)
8282 if ((*ics
)->kind
== ck_ref_bind
)
8284 conversion
*old_ics
= *ics
;
8285 *ics
= next_conversion (old_ics
);
8286 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
8293 /* Compare two implicit conversion sequences according to the rules set out in
8294 [over.ics.rank]. Return values:
8296 1: ics1 is better than ics2
8297 -1: ics2 is better than ics1
8298 0: ics1 and ics2 are indistinguishable */
8301 compare_ics (conversion
*ics1
, conversion
*ics2
)
8307 tree deref_from_type1
= NULL_TREE
;
8308 tree deref_from_type2
= NULL_TREE
;
8309 tree deref_to_type1
= NULL_TREE
;
8310 tree deref_to_type2
= NULL_TREE
;
8311 conversion_rank rank1
, rank2
;
8313 /* REF_BINDING is nonzero if the result of the conversion sequence
8314 is a reference type. In that case REF_CONV is the reference
8315 binding conversion. */
8316 conversion
*ref_conv1
;
8317 conversion
*ref_conv2
;
8319 /* Compare badness before stripping the reference conversion. */
8320 if (ics1
->bad_p
> ics2
->bad_p
)
8322 else if (ics1
->bad_p
< ics2
->bad_p
)
8325 /* Handle implicit object parameters. */
8326 maybe_handle_implicit_object (&ics1
);
8327 maybe_handle_implicit_object (&ics2
);
8329 /* Handle reference parameters. */
8330 ref_conv1
= maybe_handle_ref_bind (&ics1
);
8331 ref_conv2
= maybe_handle_ref_bind (&ics2
);
8333 /* List-initialization sequence L1 is a better conversion sequence than
8334 list-initialization sequence L2 if L1 converts to
8335 std::initializer_list<X> for some X and L2 does not. */
8336 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
8338 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
8343 When comparing the basic forms of implicit conversion sequences (as
8344 defined in _over.best.ics_)
8346 --a standard conversion sequence (_over.ics.scs_) is a better
8347 conversion sequence than a user-defined conversion sequence
8348 or an ellipsis conversion sequence, and
8350 --a user-defined conversion sequence (_over.ics.user_) is a
8351 better conversion sequence than an ellipsis conversion sequence
8352 (_over.ics.ellipsis_). */
8353 /* Use BAD_CONVERSION_RANK because we already checked for a badness
8354 mismatch. If both ICS are bad, we try to make a decision based on
8355 what would have happened if they'd been good. This is not an
8356 extension, we'll still give an error when we build up the call; this
8357 just helps us give a more helpful error message. */
8358 rank1
= BAD_CONVERSION_RANK (ics1
);
8359 rank2
= BAD_CONVERSION_RANK (ics2
);
8363 else if (rank1
< rank2
)
8366 if (ics1
->ellipsis_p
)
8367 /* Both conversions are ellipsis conversions. */
8370 /* User-defined conversion sequence U1 is a better conversion sequence
8371 than another user-defined conversion sequence U2 if they contain the
8372 same user-defined conversion operator or constructor and if the sec-
8373 ond standard conversion sequence of U1 is better than the second
8374 standard conversion sequence of U2. */
8376 /* Handle list-conversion with the same code even though it isn't always
8377 ranked as a user-defined conversion and it doesn't have a second
8378 standard conversion sequence; it will still have the desired effect.
8379 Specifically, we need to do the reference binding comparison at the
8380 end of this function. */
8382 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
|| ics1
->kind
== ck_aggr
)
8387 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
8388 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
8389 || t1
->kind
== ck_list
)
8391 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
8392 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
8393 || t2
->kind
== ck_list
)
8396 if (t1
->kind
!= t2
->kind
)
8398 else if (t1
->kind
== ck_user
)
8400 if (t1
->cand
->fn
!= t2
->cand
->fn
)
8405 /* For ambiguous or aggregate conversions, use the target type as
8406 a proxy for the conversion function. */
8407 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
8411 /* We can just fall through here, after setting up
8412 FROM_TYPE1 and FROM_TYPE2. */
8413 from_type1
= t1
->type
;
8414 from_type2
= t2
->type
;
8421 /* We're dealing with two standard conversion sequences.
8425 Standard conversion sequence S1 is a better conversion
8426 sequence than standard conversion sequence S2 if
8428 --S1 is a proper subsequence of S2 (comparing the conversion
8429 sequences in the canonical form defined by _over.ics.scs_,
8430 excluding any Lvalue Transformation; the identity
8431 conversion sequence is considered to be a subsequence of
8432 any non-identity conversion sequence */
8435 while (t1
->kind
!= ck_identity
)
8436 t1
= next_conversion (t1
);
8437 from_type1
= t1
->type
;
8440 while (t2
->kind
!= ck_identity
)
8441 t2
= next_conversion (t2
);
8442 from_type2
= t2
->type
;
8445 /* One sequence can only be a subsequence of the other if they start with
8446 the same type. They can start with different types when comparing the
8447 second standard conversion sequence in two user-defined conversion
8449 if (same_type_p (from_type1
, from_type2
))
8451 if (is_subseq (ics1
, ics2
))
8453 if (is_subseq (ics2
, ics1
))
8461 --the rank of S1 is better than the rank of S2 (by the rules
8464 Standard conversion sequences are ordered by their ranks: an Exact
8465 Match is a better conversion than a Promotion, which is a better
8466 conversion than a Conversion.
8468 Two conversion sequences with the same rank are indistinguishable
8469 unless one of the following rules applies:
8471 --A conversion that does not a convert a pointer, pointer to member,
8472 or std::nullptr_t to bool is better than one that does.
8474 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
8475 so that we do not have to check it explicitly. */
8476 if (ics1
->rank
< ics2
->rank
)
8478 else if (ics2
->rank
< ics1
->rank
)
8481 to_type1
= ics1
->type
;
8482 to_type2
= ics2
->type
;
8484 /* A conversion from scalar arithmetic type to complex is worse than a
8485 conversion between scalar arithmetic types. */
8486 if (same_type_p (from_type1
, from_type2
)
8487 && ARITHMETIC_TYPE_P (from_type1
)
8488 && ARITHMETIC_TYPE_P (to_type1
)
8489 && ARITHMETIC_TYPE_P (to_type2
)
8490 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
8491 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
8493 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
8499 if (TYPE_PTR_P (from_type1
)
8500 && TYPE_PTR_P (from_type2
)
8501 && TYPE_PTR_P (to_type1
)
8502 && TYPE_PTR_P (to_type2
))
8504 deref_from_type1
= TREE_TYPE (from_type1
);
8505 deref_from_type2
= TREE_TYPE (from_type2
);
8506 deref_to_type1
= TREE_TYPE (to_type1
);
8507 deref_to_type2
= TREE_TYPE (to_type2
);
8509 /* The rules for pointers to members A::* are just like the rules
8510 for pointers A*, except opposite: if B is derived from A then
8511 A::* converts to B::*, not vice versa. For that reason, we
8512 switch the from_ and to_ variables here. */
8513 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
8514 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
8515 || (TYPE_PTRMEMFUNC_P (from_type1
)
8516 && TYPE_PTRMEMFUNC_P (from_type2
)
8517 && TYPE_PTRMEMFUNC_P (to_type1
)
8518 && TYPE_PTRMEMFUNC_P (to_type2
)))
8520 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
8521 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
8522 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
8523 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
8526 if (deref_from_type1
!= NULL_TREE
8527 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
8528 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
8530 /* This was one of the pointer or pointer-like conversions.
8534 --If class B is derived directly or indirectly from class A,
8535 conversion of B* to A* is better than conversion of B* to
8536 void*, and conversion of A* to void* is better than
8537 conversion of B* to void*. */
8538 if (VOID_TYPE_P (deref_to_type1
)
8539 && VOID_TYPE_P (deref_to_type2
))
8541 if (is_properly_derived_from (deref_from_type1
,
8544 else if (is_properly_derived_from (deref_from_type2
,
8548 else if (VOID_TYPE_P (deref_to_type1
)
8549 || VOID_TYPE_P (deref_to_type2
))
8551 if (same_type_p (deref_from_type1
, deref_from_type2
))
8553 if (VOID_TYPE_P (deref_to_type2
))
8555 if (is_properly_derived_from (deref_from_type1
,
8559 /* We know that DEREF_TO_TYPE1 is `void' here. */
8560 else if (is_properly_derived_from (deref_from_type1
,
8565 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
8566 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
8570 --If class B is derived directly or indirectly from class A
8571 and class C is derived directly or indirectly from B,
8573 --conversion of C* to B* is better than conversion of C* to
8576 --conversion of B* to A* is better than conversion of C* to
8578 if (same_type_p (deref_from_type1
, deref_from_type2
))
8580 if (is_properly_derived_from (deref_to_type1
,
8583 else if (is_properly_derived_from (deref_to_type2
,
8587 else if (same_type_p (deref_to_type1
, deref_to_type2
))
8589 if (is_properly_derived_from (deref_from_type2
,
8592 else if (is_properly_derived_from (deref_from_type1
,
8598 else if (CLASS_TYPE_P (non_reference (from_type1
))
8599 && same_type_p (from_type1
, from_type2
))
8601 tree from
= non_reference (from_type1
);
8605 --binding of an expression of type C to a reference of type
8606 B& is better than binding an expression of type C to a
8607 reference of type A&
8609 --conversion of C to B is better than conversion of C to A, */
8610 if (is_properly_derived_from (from
, to_type1
)
8611 && is_properly_derived_from (from
, to_type2
))
8613 if (is_properly_derived_from (to_type1
, to_type2
))
8615 else if (is_properly_derived_from (to_type2
, to_type1
))
8619 else if (CLASS_TYPE_P (non_reference (to_type1
))
8620 && same_type_p (to_type1
, to_type2
))
8622 tree to
= non_reference (to_type1
);
8626 --binding of an expression of type B to a reference of type
8627 A& is better than binding an expression of type C to a
8628 reference of type A&,
8630 --conversion of B to A is better than conversion of C to A */
8631 if (is_properly_derived_from (from_type1
, to
)
8632 && is_properly_derived_from (from_type2
, to
))
8634 if (is_properly_derived_from (from_type2
, from_type1
))
8636 else if (is_properly_derived_from (from_type1
, from_type2
))
8643 --S1 and S2 differ only in their qualification conversion and yield
8644 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
8645 qualification signature of type T1 is a proper subset of the cv-
8646 qualification signature of type T2 */
8647 if (ics1
->kind
== ck_qual
8648 && ics2
->kind
== ck_qual
8649 && same_type_p (from_type1
, from_type2
))
8651 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
8658 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
8659 to an implicit object parameter of a non-static member function
8660 declared without a ref-qualifier, and either S1 binds an lvalue
8661 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
8662 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
8663 draft standard, 13.3.3.2)
8665 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
8666 types to which the references refer are the same type except for
8667 top-level cv-qualifiers, and the type to which the reference
8668 initialized by S2 refers is more cv-qualified than the type to
8669 which the reference initialized by S1 refers.
8671 DR 1328 [over.match.best]: the context is an initialization by
8672 conversion function for direct reference binding (13.3.1.6) of a
8673 reference to function type, the return type of F1 is the same kind of
8674 reference (i.e. lvalue or rvalue) as the reference being initialized,
8675 and the return type of F2 is not. */
8677 if (ref_conv1
&& ref_conv2
)
8679 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
8680 && (ref_conv1
->rvaluedness_matches_p
8681 != ref_conv2
->rvaluedness_matches_p
)
8682 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
8683 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
8684 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
8686 if (ref_conv1
->bad_p
8687 && !same_type_p (TREE_TYPE (ref_conv1
->type
),
8688 TREE_TYPE (ref_conv2
->type
)))
8689 /* Don't prefer a bad conversion that drops cv-quals to a bad
8690 conversion with the wrong rvalueness. */
8692 return (ref_conv1
->rvaluedness_matches_p
8693 - ref_conv2
->rvaluedness_matches_p
);
8696 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
8698 int q1
= cp_type_quals (TREE_TYPE (ref_conv1
->type
));
8699 int q2
= cp_type_quals (TREE_TYPE (ref_conv2
->type
));
8700 if (ref_conv1
->bad_p
)
8702 /* Prefer the one that drops fewer cv-quals. */
8703 tree ftype
= next_conversion (ref_conv1
)->type
;
8704 int fquals
= cp_type_quals (ftype
);
8708 return comp_cv_qualification (q2
, q1
);
8712 /* Neither conversion sequence is better than the other. */
8716 /* The source type for this standard conversion sequence. */
8719 source_type (conversion
*t
)
8721 for (;; t
= next_conversion (t
))
8723 if (t
->kind
== ck_user
8724 || t
->kind
== ck_ambig
8725 || t
->kind
== ck_identity
)
8731 /* Note a warning about preferring WINNER to LOSER. We do this by storing
8732 a pointer to LOSER and re-running joust to produce the warning if WINNER
8733 is actually used. */
8736 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
8738 candidate_warning
*cw
= (candidate_warning
*)
8739 conversion_obstack_alloc (sizeof (candidate_warning
));
8741 cw
->next
= winner
->warnings
;
8742 winner
->warnings
= cw
;
8745 // Returns the template declaration associated with the candidate
8746 // function. For actual templates, this is directly associated
8747 // with the candidate. For temploids, we return the template
8748 // associated with the specialization.
8750 template_decl_for_candidate (struct z_candidate
*cand
)
8752 tree r
= cand
->template_decl
;
8754 if (!r
&& DECL_P (d
) && DECL_USE_TEMPLATE (d
))
8755 r
= DECL_TI_TEMPLATE (d
);
8756 if (r
&& TREE_CODE (r
) == TEMPLATE_INFO
)
8757 r
= TI_TEMPLATE (r
);
8761 /* Compare two candidates for overloading as described in
8762 [over.match.best]. Return values:
8764 1: cand1 is better than cand2
8765 -1: cand2 is better than cand1
8766 0: cand1 and cand2 are indistinguishable */
8769 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
8770 tsubst_flags_t complain
)
8773 int off1
= 0, off2
= 0;
8777 // Get the actual template decls associated with the candidates.
8778 tree tmpl1
= template_decl_for_candidate (cand1
);
8779 tree tmpl2
= template_decl_for_candidate (cand2
);
8781 /* Candidates that involve bad conversions are always worse than those
8783 if (cand1
->viable
> cand2
->viable
)
8785 if (cand1
->viable
< cand2
->viable
)
8788 /* If we have two pseudo-candidates for conversions to the same type,
8789 or two candidates for the same function, arbitrarily pick one. */
8790 if (cand1
->fn
== cand2
->fn
8791 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
8794 /* Prefer a non-deleted function over an implicitly deleted move
8795 constructor or assignment operator. This differs slightly from the
8796 wording for issue 1402 (which says the move op is ignored by overload
8797 resolution), but this way produces better error messages. */
8798 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
8799 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
8800 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
8802 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
8803 && move_fn_p (cand1
->fn
))
8805 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
8806 && move_fn_p (cand2
->fn
))
8810 /* a viable function F1
8811 is defined to be a better function than another viable function F2 if
8812 for all arguments i, ICSi(F1) is not a worse conversion sequence than
8813 ICSi(F2), and then */
8815 /* for some argument j, ICSj(F1) is a better conversion sequence than
8818 /* For comparing static and non-static member functions, we ignore
8819 the implicit object parameter of the non-static function. The
8820 standard says to pretend that the static function has an object
8821 parm, but that won't work with operator overloading. */
8822 len
= cand1
->num_convs
;
8823 if (len
!= cand2
->num_convs
)
8825 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
8826 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
8828 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
8829 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
8830 /* We're comparing a near-match list constructor and a near-match
8831 non-list constructor. Just treat them as unordered. */
8834 gcc_assert (static_1
!= static_2
);
8845 for (i
= 0; i
< len
; ++i
)
8847 conversion
*t1
= cand1
->convs
[i
+ off1
];
8848 conversion
*t2
= cand2
->convs
[i
+ off2
];
8849 int comp
= compare_ics (t1
, t2
);
8853 if ((complain
& tf_warning
)
8855 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
8856 == cr_std
+ cr_promotion
)
8857 && t1
->kind
== ck_std
8858 && t2
->kind
== ck_std
8859 && TREE_CODE (t1
->type
) == INTEGER_TYPE
8860 && TREE_CODE (t2
->type
) == INTEGER_TYPE
8861 && (TYPE_PRECISION (t1
->type
)
8862 == TYPE_PRECISION (t2
->type
))
8863 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
8864 || (TREE_CODE (next_conversion (t1
)->type
)
8867 tree type
= next_conversion (t1
)->type
;
8869 struct z_candidate
*w
, *l
;
8871 type1
= t1
->type
, type2
= t2
->type
,
8872 w
= cand1
, l
= cand2
;
8874 type1
= t2
->type
, type2
= t1
->type
,
8875 w
= cand2
, l
= cand1
;
8879 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
8880 type
, type1
, type2
);
8881 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
8887 if (winner
&& comp
!= winner
)
8896 /* warn about confusing overload resolution for user-defined conversions,
8897 either between a constructor and a conversion op, or between two
8899 if ((complain
& tf_warning
)
8900 && winner
&& warn_conversion
&& cand1
->second_conv
8901 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
8902 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
8904 struct z_candidate
*w
, *l
;
8905 bool give_warning
= false;
8908 w
= cand1
, l
= cand2
;
8910 w
= cand2
, l
= cand1
;
8912 /* We don't want to complain about `X::operator T1 ()'
8913 beating `X::operator T2 () const', when T2 is a no less
8914 cv-qualified version of T1. */
8915 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
8916 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
8918 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
8919 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
8921 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
8926 if (!comp_ptr_ttypes (t
, f
))
8927 give_warning
= true;
8930 give_warning
= true;
8936 tree source
= source_type (w
->convs
[0]);
8937 if (! DECL_CONSTRUCTOR_P (w
->fn
))
8938 source
= TREE_TYPE (source
);
8939 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
8940 && warning (OPT_Wconversion
, " for conversion from %qT to %qT",
8941 source
, w
->second_conv
->type
))
8943 inform (input_location
, " because conversion sequence for the argument is better");
8953 /* DR 495 moved this tiebreaker above the template ones. */
8955 the context is an initialization by user-defined conversion (see
8956 _dcl.init_ and _over.match.user_) and the standard conversion
8957 sequence from the return type of F1 to the destination type (i.e.,
8958 the type of the entity being initialized) is a better conversion
8959 sequence than the standard conversion sequence from the return type
8960 of F2 to the destination type. */
8962 if (cand1
->second_conv
)
8964 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
8970 F1 is a non-template function and F2 is a template function
8973 if (!cand1
->template_decl
&& cand2
->template_decl
)
8975 else if (cand1
->template_decl
&& !cand2
->template_decl
)
8979 F1 and F2 are template functions and the function template for F1 is
8980 more specialized than the template for F2 according to the partial
8985 /* [temp.func.order]: The presence of unused ellipsis and default
8986 arguments has no effect on the partial ordering of function
8987 templates. add_function_candidate() will not have
8988 counted the "this" argument for constructors. */
8989 int nparms
= cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
);
8990 winner
= more_specialized_fn (tmpl1
, tmpl2
, nparms
);
8995 /* Check whether we can discard a builtin candidate, either because we
8996 have two identical ones or matching builtin and non-builtin candidates.
8998 (Pedantically in the latter case the builtin which matched the user
8999 function should not be added to the overload set, but we spot it here.
9002 ... the builtin candidates include ...
9003 - do not have the same parameter type list as any non-template
9004 non-member candidate. */
9006 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
9008 for (i
= 0; i
< len
; ++i
)
9009 if (!same_type_p (cand1
->convs
[i
]->type
,
9010 cand2
->convs
[i
]->type
))
9012 if (i
== cand1
->num_convs
)
9014 if (cand1
->fn
== cand2
->fn
)
9015 /* Two built-in candidates; arbitrarily pick one. */
9017 else if (identifier_p (cand1
->fn
))
9018 /* cand1 is built-in; prefer cand2. */
9021 /* cand2 is built-in; prefer cand1. */
9026 /* For candidates of a multi-versioned function, make the version with
9027 the highest priority win. This version will be checked for dispatching
9028 first. If this version can be inlined into the caller, the front-end
9029 will simply make a direct call to this function. */
9031 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
9032 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
9033 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
9034 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
9036 tree f1
= TREE_TYPE (cand1
->fn
);
9037 tree f2
= TREE_TYPE (cand2
->fn
);
9038 tree p1
= TYPE_ARG_TYPES (f1
);
9039 tree p2
= TYPE_ARG_TYPES (f2
);
9041 /* Check if cand1->fn and cand2->fn are versions of the same function. It
9042 is possible that cand1->fn and cand2->fn are function versions but of
9043 different functions. Check types to see if they are versions of the same
9045 if (compparms (p1
, p2
)
9046 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
9048 /* Always make the version with the higher priority, more
9049 specialized, win. */
9050 gcc_assert (targetm
.compare_version_priority
);
9051 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
9058 /* If the two function declarations represent the same function (this can
9059 happen with declarations in multiple scopes and arg-dependent lookup),
9060 arbitrarily choose one. But first make sure the default args we're
9062 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
9063 && equal_functions (cand1
->fn
, cand2
->fn
))
9065 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
9066 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
9068 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
9070 for (i
= 0; i
< len
; ++i
)
9072 /* Don't crash if the fn is variadic. */
9075 parms1
= TREE_CHAIN (parms1
);
9076 parms2
= TREE_CHAIN (parms2
);
9080 parms1
= TREE_CHAIN (parms1
);
9082 parms2
= TREE_CHAIN (parms2
);
9086 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
9087 TREE_PURPOSE (parms2
)))
9091 if (complain
& tf_error
)
9093 if (permerror (input_location
,
9094 "default argument mismatch in "
9095 "overload resolution"))
9097 inform (input_location
,
9098 " candidate 1: %q+#F", cand1
->fn
);
9099 inform (input_location
,
9100 " candidate 2: %q+#F", cand2
->fn
);
9107 add_warning (cand1
, cand2
);
9110 parms1
= TREE_CHAIN (parms1
);
9111 parms2
= TREE_CHAIN (parms2
);
9119 /* Extension: If the worst conversion for one candidate is worse than the
9120 worst conversion for the other, take the first. */
9121 if (!pedantic
&& (complain
& tf_warning_or_error
))
9123 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
9124 struct z_candidate
*w
= 0, *l
= 0;
9126 for (i
= 0; i
< len
; ++i
)
9128 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
9129 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
9130 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
9131 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
9134 winner
= 1, w
= cand1
, l
= cand2
;
9136 winner
= -1, w
= cand2
, l
= cand1
;
9139 /* Don't choose a deleted function over ambiguity. */
9140 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
9144 pedwarn (input_location
, 0,
9145 "ISO C++ says that these are ambiguous, even "
9146 "though the worst conversion for the first is better than "
9147 "the worst conversion for the second:");
9148 print_z_candidate (input_location
, _("candidate 1:"), w
);
9149 print_z_candidate (input_location
, _("candidate 2:"), l
);
9157 gcc_assert (!winner
);
9161 /* Given a list of candidates for overloading, find the best one, if any.
9162 This algorithm has a worst case of O(2n) (winner is last), and a best
9163 case of O(n/2) (totally ambiguous); much better than a sorting
9166 static struct z_candidate
*
9167 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
9169 struct z_candidate
*champ
= candidates
, *challenger
;
9171 int champ_compared_to_predecessor
= 0;
9173 /* Walk through the list once, comparing each current champ to the next
9174 candidate, knocking out a candidate or two with each comparison. */
9176 for (challenger
= champ
->next
; challenger
; )
9178 fate
= joust (champ
, challenger
, 0, complain
);
9180 challenger
= challenger
->next
;
9185 champ
= challenger
->next
;
9188 champ_compared_to_predecessor
= 0;
9193 champ_compared_to_predecessor
= 1;
9196 challenger
= champ
->next
;
9200 /* Make sure the champ is better than all the candidates it hasn't yet
9201 been compared to. */
9203 for (challenger
= candidates
;
9205 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
9206 challenger
= challenger
->next
)
9208 fate
= joust (champ
, challenger
, 0, complain
);
9217 // Returns true if things of type FROM can be implicitly converted to TO.
9219 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
9221 tree arg
= NULL_TREE
;
9222 /* implicit_conversion only considers user-defined conversions
9223 if it has an expression for the call argument list. */
9224 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
9225 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
9226 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
9229 /* Returns nonzero if things of type FROM can be converted to TO with a
9230 standard conversion. */
9233 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
9235 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
9238 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
9241 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
9242 tsubst_flags_t complain
)
9248 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9249 p
= conversion_obstack_alloc (0);
9250 /* We want to discard any access checks done for this test,
9251 as we might not be in the appropriate access context and
9252 we'll do the check again when we actually perform the
9254 push_deferring_access_checks (dk_deferred
);
9256 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
9258 ok_p
= (t
&& !t
->bad_p
);
9260 /* Discard the access checks now. */
9261 pop_deferring_access_checks ();
9262 /* Free all the conversions we allocated. */
9263 obstack_free (&conversion_obstack
, p
);
9268 /* Like can_convert_arg, but allows dubious conversions as well. */
9271 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
9272 tsubst_flags_t complain
)
9277 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9278 p
= conversion_obstack_alloc (0);
9279 /* Try to perform the conversion. */
9280 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
9282 /* Free all the conversions we allocated. */
9283 obstack_free (&conversion_obstack
, p
);
9288 /* Convert EXPR to TYPE. Return the converted expression.
9290 Note that we allow bad conversions here because by the time we get to
9291 this point we are committed to doing the conversion. If we end up
9292 doing a bad conversion, convert_like will complain. */
9295 perform_implicit_conversion_flags (tree type
, tree expr
,
9296 tsubst_flags_t complain
, int flags
)
9300 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
9302 if (error_operand_p (expr
))
9303 return error_mark_node
;
9305 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9306 p
= conversion_obstack_alloc (0);
9308 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
9314 if (complain
& tf_error
)
9316 /* If expr has unknown type, then it is an overloaded function.
9317 Call instantiate_type to get good error messages. */
9318 if (TREE_TYPE (expr
) == unknown_type_node
)
9319 instantiate_type (type
, expr
, complain
);
9320 else if (invalid_nonstatic_memfn_p (expr
, complain
))
9321 /* We gave an error. */;
9323 error_at (loc
, "could not convert %qE from %qT to %qT", expr
,
9324 TREE_TYPE (expr
), type
);
9326 expr
= error_mark_node
;
9328 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
9330 /* In a template, we are only concerned about determining the
9331 type of non-dependent expressions, so we do not have to
9332 perform the actual conversion. But for initializers, we
9333 need to be able to perform it at instantiation
9334 (or fold_non_dependent_expr) time. */
9335 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
9336 if (!(flags
& LOOKUP_ONLYCONVERTING
))
9337 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
9340 expr
= convert_like (conv
, expr
, complain
);
9342 /* Free all the conversions we allocated. */
9343 obstack_free (&conversion_obstack
, p
);
9349 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
9351 return perform_implicit_conversion_flags (type
, expr
, complain
,
9355 /* Convert EXPR to TYPE (as a direct-initialization) if that is
9356 permitted. If the conversion is valid, the converted expression is
9357 returned. Otherwise, NULL_TREE is returned, except in the case
9358 that TYPE is a class type; in that case, an error is issued. If
9359 C_CAST_P is true, then this direct-initialization is taking
9360 place as part of a static_cast being attempted as part of a C-style
9364 perform_direct_initialization_if_possible (tree type
,
9367 tsubst_flags_t complain
)
9372 if (type
== error_mark_node
|| error_operand_p (expr
))
9373 return error_mark_node
;
9376 If the destination type is a (possibly cv-qualified) class type:
9378 -- If the initialization is direct-initialization ...,
9379 constructors are considered. ... If no constructor applies, or
9380 the overload resolution is ambiguous, the initialization is
9382 if (CLASS_TYPE_P (type
))
9384 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
9385 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
9386 &args
, type
, LOOKUP_NORMAL
, complain
);
9387 release_tree_vector (args
);
9388 return build_cplus_new (type
, expr
, complain
);
9391 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9392 p
= conversion_obstack_alloc (0);
9394 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
9396 LOOKUP_NORMAL
, complain
);
9397 if (!conv
|| conv
->bad_p
)
9400 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0, 0,
9401 /*issue_conversion_warnings=*/false,
9405 /* Free all the conversions we allocated. */
9406 obstack_free (&conversion_obstack
, p
);
9411 /* When initializing a reference that lasts longer than a full-expression,
9412 this special rule applies:
9416 The temporary to which the reference is bound or the temporary
9417 that is the complete object to which the reference is bound
9418 persists for the lifetime of the reference.
9420 The temporaries created during the evaluation of the expression
9421 initializing the reference, except the temporary to which the
9422 reference is bound, are destroyed at the end of the
9423 full-expression in which they are created.
9425 In that case, we store the converted expression into a new
9426 VAR_DECL in a new scope.
9428 However, we want to be careful not to create temporaries when
9429 they are not required. For example, given:
9432 struct D : public B {};
9436 there is no need to copy the return value from "f"; we can just
9437 extend its lifetime. Similarly, given:
9440 struct T { operator S(); };
9444 we can extend the lifetime of the return value of the conversion
9447 The next several functions are involved in this lifetime extension. */
9449 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
9450 reference is being bound to a temporary. Create and return a new
9451 VAR_DECL with the indicated TYPE; this variable will store the value to
9452 which the reference is bound. */
9455 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
9459 /* Create the variable. */
9460 var
= create_temporary_var (type
);
9462 /* Register the variable. */
9464 && (TREE_STATIC (decl
) || DECL_THREAD_LOCAL_P (decl
)))
9466 /* Namespace-scope or local static; give it a mangled name. */
9467 /* FIXME share comdat with decl? */
9470 TREE_STATIC (var
) = TREE_STATIC (decl
);
9471 set_decl_tls_model (var
, DECL_TLS_MODEL (decl
));
9472 name
= mangle_ref_init_variable (decl
);
9473 DECL_NAME (var
) = name
;
9474 SET_DECL_ASSEMBLER_NAME (var
, name
);
9475 var
= pushdecl_top_level (var
);
9478 /* Create a new cleanup level if necessary. */
9479 maybe_push_cleanup_level (type
);
9484 /* EXPR is the initializer for a variable DECL of reference or
9485 std::initializer_list type. Create, push and return a new VAR_DECL
9486 for the initializer so that it will live as long as DECL. Any
9487 cleanup for the new variable is returned through CLEANUP, and the
9488 code to initialize the new variable is returned through INITP. */
9491 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
9498 /* Create the temporary variable. */
9499 type
= TREE_TYPE (expr
);
9500 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
9501 layout_decl (var
, 0);
9502 /* If the rvalue is the result of a function call it will be
9503 a TARGET_EXPR. If it is some other construct (such as a
9504 member access expression where the underlying object is
9505 itself the result of a function call), turn it into a
9506 TARGET_EXPR here. It is important that EXPR be a
9507 TARGET_EXPR below since otherwise the INIT_EXPR will
9508 attempt to make a bitwise copy of EXPR to initialize
9510 if (TREE_CODE (expr
) != TARGET_EXPR
)
9511 expr
= get_target_expr (expr
);
9513 if (TREE_CODE (decl
) == FIELD_DECL
9514 && extra_warnings
&& !TREE_NO_WARNING (decl
))
9516 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
9517 "until the constructor exits", decl
);
9518 TREE_NO_WARNING (decl
) = true;
9521 /* Recursively extend temps in this initializer. */
9522 TARGET_EXPR_INITIAL (expr
)
9523 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
9525 /* Any reference temp has a non-trivial initializer. */
9526 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
9528 /* If the initializer is constant, put it in DECL_INITIAL so we get
9529 static initialization and use in constant expressions. */
9530 init
= maybe_constant_init (expr
);
9531 if (TREE_CONSTANT (init
))
9533 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
9535 /* 5.19 says that a constant expression can include an
9536 lvalue-rvalue conversion applied to "a glvalue of literal type
9537 that refers to a non-volatile temporary object initialized
9538 with a constant expression". Rather than try to communicate
9539 that this VAR_DECL is a temporary, just mark it constexpr.
9541 Currently this is only useful for initializer_list temporaries,
9542 since reference vars can't appear in constant expressions. */
9543 DECL_DECLARED_CONSTEXPR_P (var
) = true;
9544 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
9545 TREE_CONSTANT (var
) = true;
9547 DECL_INITIAL (var
) = init
;
9551 /* Create the INIT_EXPR that will initialize the temporary
9553 init
= build2 (INIT_EXPR
, type
, var
, expr
);
9554 if (at_function_scope_p ())
9556 add_decl_expr (var
);
9558 if (TREE_STATIC (var
))
9559 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
9562 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
9564 vec_safe_push (*cleanups
, cleanup
);
9567 /* We must be careful to destroy the temporary only
9568 after its initialization has taken place. If the
9569 initialization throws an exception, then the
9570 destructor should not be run. We cannot simply
9571 transform INIT into something like:
9573 (INIT, ({ CLEANUP_STMT; }))
9575 because emit_local_var always treats the
9576 initializer as a full-expression. Thus, the
9577 destructor would run too early; it would run at the
9578 end of initializing the reference variable, rather
9579 than at the end of the block enclosing the
9582 The solution is to pass back a cleanup expression
9583 which the caller is responsible for attaching to
9584 the statement tree. */
9588 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
9589 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
9591 if (DECL_THREAD_LOCAL_P (var
))
9592 tls_aggregates
= tree_cons (NULL_TREE
, var
,
9595 static_aggregates
= tree_cons (NULL_TREE
, var
,
9599 /* Check whether the dtor is callable. */
9600 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
9607 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
9608 initializing a variable of that TYPE. */
9611 initialize_reference (tree type
, tree expr
,
9612 int flags
, tsubst_flags_t complain
)
9616 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
9618 if (type
== error_mark_node
|| error_operand_p (expr
))
9619 return error_mark_node
;
9621 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9622 p
= conversion_obstack_alloc (0);
9624 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
9626 if (!conv
|| conv
->bad_p
)
9628 if (complain
& tf_error
)
9631 convert_like (conv
, expr
, complain
);
9632 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
9633 && !TYPE_REF_IS_RVALUE (type
)
9634 && !real_lvalue_p (expr
))
9635 error_at (loc
, "invalid initialization of non-const reference of "
9636 "type %qT from an rvalue of type %qT",
9637 type
, TREE_TYPE (expr
));
9639 error_at (loc
, "invalid initialization of reference of type "
9640 "%qT from expression of type %qT", type
,
9643 return error_mark_node
;
9646 if (conv
->kind
== ck_ref_bind
)
9647 /* Perform the conversion. */
9648 expr
= convert_like (conv
, expr
, complain
);
9649 else if (conv
->kind
== ck_ambig
)
9650 /* We gave an error in build_user_type_conversion_1. */
9651 expr
= error_mark_node
;
9655 /* Free all the conversions we allocated. */
9656 obstack_free (&conversion_obstack
, p
);
9661 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
9662 which is bound either to a reference or a std::initializer_list. */
9665 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
9670 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
9672 TREE_OPERAND (sub
, 1)
9673 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
9676 if (TREE_CODE (sub
) != ADDR_EXPR
)
9678 /* Deal with binding to a subobject. */
9679 for (p
= &TREE_OPERAND (sub
, 0); TREE_CODE (*p
) == COMPONENT_REF
; )
9680 p
= &TREE_OPERAND (*p
, 0);
9681 if (TREE_CODE (*p
) == TARGET_EXPR
)
9683 tree subinit
= NULL_TREE
;
9684 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
9686 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
9687 recompute_tree_invariant_for_addr_expr (sub
);
9692 /* INIT is part of the initializer for DECL. If there are any
9693 reference or initializer lists being initialized, extend their
9694 lifetime to match that of DECL. */
9697 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
9699 tree type
= TREE_TYPE (init
);
9700 if (processing_template_decl
)
9702 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9703 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
9704 else if (is_std_init_list (type
))
9706 /* The temporary array underlying a std::initializer_list
9707 is handled like a reference temporary. */
9709 if (TREE_CODE (ctor
) == TARGET_EXPR
)
9710 ctor
= TARGET_EXPR_INITIAL (ctor
);
9711 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
9713 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
9714 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
9715 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
9718 else if (TREE_CODE (init
) == CONSTRUCTOR
)
9722 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (init
);
9723 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
9724 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
9730 /* Returns true iff an initializer for TYPE could contain temporaries that
9731 need to be extended because they are bound to references or
9732 std::initializer_list. */
9735 type_has_extended_temps (tree type
)
9737 type
= strip_array_types (type
);
9738 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9740 if (CLASS_TYPE_P (type
))
9742 if (is_std_init_list (type
))
9744 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
9745 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
9746 if (type_has_extended_temps (TREE_TYPE (f
)))
9752 /* Returns true iff TYPE is some variant of std::initializer_list. */
9755 is_std_init_list (tree type
)
9757 /* Look through typedefs. */
9760 if (cxx_dialect
== cxx98
)
9762 type
= TYPE_MAIN_VARIANT (type
);
9763 return (CLASS_TYPE_P (type
)
9764 && CP_TYPE_CONTEXT (type
) == std_node
9765 && CLASSTYPE_TEMPLATE_INFO (type
)
9766 && strcmp (TYPE_NAME_STRING (type
), "initializer_list") == 0);
9769 /* Returns true iff DECL is a list constructor: i.e. a constructor which
9770 will accept an argument list of a single std::initializer_list<T>. */
9773 is_list_ctor (tree decl
)
9775 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
9778 if (!args
|| args
== void_list_node
)
9781 arg
= non_reference (TREE_VALUE (args
));
9782 if (!is_std_init_list (arg
))
9785 args
= TREE_CHAIN (args
);
9787 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
9788 /* There are more non-defaulted parms. */
9794 #include "gt-cp-call.h"