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"
45 /* The various kinds of conversion. */
47 typedef enum conversion_kind
{
63 /* The rank of the conversion. Order of the enumerals matters; better
64 conversions should come earlier in the list. */
66 typedef enum conversion_rank
{
77 /* An implicit conversion sequence, in the sense of [over.best.ics].
78 The first conversion to be performed is at the end of the chain.
79 That conversion is always a cr_identity conversion. */
81 typedef struct conversion conversion
;
83 /* The kind of conversion represented by this step. */
85 /* The rank of this conversion. */
87 BOOL_BITFIELD user_conv_p
: 1;
88 BOOL_BITFIELD ellipsis_p
: 1;
89 BOOL_BITFIELD this_p
: 1;
90 /* True if this conversion would be permitted with a bending of
91 language standards, e.g. disregarding pointer qualifiers or
92 converting integers to pointers. */
93 BOOL_BITFIELD bad_p
: 1;
94 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
95 temporary should be created to hold the result of the
97 BOOL_BITFIELD need_temporary_p
: 1;
98 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
99 from a pointer-to-derived to pointer-to-base is being performed. */
100 BOOL_BITFIELD base_p
: 1;
101 /* If KIND is ck_ref_bind, true when either an lvalue reference is
102 being bound to an lvalue expression or an rvalue reference is
103 being bound to an rvalue expression. If KIND is ck_rvalue,
104 true when we should treat an lvalue as an rvalue (12.8p33). If
105 KIND is ck_base, always false. */
106 BOOL_BITFIELD rvaluedness_matches_p
: 1;
107 BOOL_BITFIELD check_narrowing
: 1;
108 /* The type of the expression resulting from the conversion. */
111 /* The next conversion in the chain. Since the conversions are
112 arranged from outermost to innermost, the NEXT conversion will
113 actually be performed before this conversion. This variant is
114 used only when KIND is neither ck_identity, ck_ambig nor
115 ck_list. Please use the next_conversion function instead
116 of using this field directly. */
118 /* The expression at the beginning of the conversion chain. This
119 variant is used only if KIND is ck_identity or ck_ambig. */
121 /* The array of conversions for an initializer_list, so this
122 variant is used only when KIN D is ck_list. */
125 /* The function candidate corresponding to this conversion
126 sequence. This field is only used if KIND is ck_user. */
127 struct z_candidate
*cand
;
130 #define CONVERSION_RANK(NODE) \
131 ((NODE)->bad_p ? cr_bad \
132 : (NODE)->ellipsis_p ? cr_ellipsis \
133 : (NODE)->user_conv_p ? cr_user \
136 #define BAD_CONVERSION_RANK(NODE) \
137 ((NODE)->ellipsis_p ? cr_ellipsis \
138 : (NODE)->user_conv_p ? cr_user \
141 static struct obstack conversion_obstack
;
142 static bool conversion_obstack_initialized
;
143 struct rejection_reason
;
145 static struct z_candidate
* tourney (struct z_candidate
*, tsubst_flags_t
);
146 static int equal_functions (tree
, tree
);
147 static int joust (struct z_candidate
*, struct z_candidate
*, bool,
149 static int compare_ics (conversion
*, conversion
*);
150 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
151 static tree
build_java_interface_fn_ref (tree
, tree
);
152 #define convert_like(CONV, EXPR, COMPLAIN) \
153 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
154 /*issue_conversion_warnings=*/true, \
155 /*c_cast_p=*/false, (COMPLAIN))
156 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
157 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
158 /*issue_conversion_warnings=*/true, \
159 /*c_cast_p=*/false, (COMPLAIN))
160 static tree
convert_like_real (conversion
*, tree
, tree
, int, int, bool,
161 bool, tsubst_flags_t
);
162 static void op_error (location_t
, enum tree_code
, enum tree_code
, tree
,
164 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int,
166 static void print_z_candidate (location_t
, const char *, struct z_candidate
*);
167 static void print_z_candidates (location_t
, struct z_candidate
*);
168 static tree
build_this (tree
);
169 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
170 static bool any_strictly_viable (struct z_candidate
*);
171 static struct z_candidate
*add_template_candidate
172 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
173 tree
, tree
, tree
, int, unification_kind_t
, tsubst_flags_t
);
174 static struct z_candidate
*add_template_candidate_real
175 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
176 tree
, tree
, tree
, int, tree
, unification_kind_t
, tsubst_flags_t
);
177 static struct z_candidate
*add_template_conv_candidate
178 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
179 tree
, tree
, tree
, tsubst_flags_t
);
180 static void add_builtin_candidates
181 (struct z_candidate
**, enum tree_code
, enum tree_code
,
182 tree
, tree
*, int, tsubst_flags_t
);
183 static void add_builtin_candidate
184 (struct z_candidate
**, enum tree_code
, enum tree_code
,
185 tree
, tree
, tree
, tree
*, tree
*, int, tsubst_flags_t
);
186 static bool is_complete (tree
);
187 static void build_builtin_candidate
188 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
189 int, tsubst_flags_t
);
190 static struct z_candidate
*add_conv_candidate
191 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
192 tree
, tsubst_flags_t
);
193 static struct z_candidate
*add_function_candidate
194 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
195 tree
, int, tsubst_flags_t
);
196 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int,
198 static conversion
*standard_conversion (tree
, tree
, tree
, bool, int);
199 static conversion
*reference_binding (tree
, tree
, tree
, bool, int,
201 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
202 static conversion
*build_list_conv (tree
, tree
, int, tsubst_flags_t
);
203 static conversion
*next_conversion (conversion
*);
204 static bool is_subseq (conversion
*, conversion
*);
205 static conversion
*maybe_handle_ref_bind (conversion
**);
206 static void maybe_handle_implicit_object (conversion
**);
207 static struct z_candidate
*add_candidate
208 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, size_t,
209 conversion
**, tree
, tree
, int, struct rejection_reason
*);
210 static tree
source_type (conversion
*);
211 static void add_warning (struct z_candidate
*, struct z_candidate
*);
212 static bool reference_compatible_p (tree
, tree
);
213 static conversion
*direct_reference_binding (tree
, conversion
*);
214 static bool promoted_arithmetic_type_p (tree
);
215 static conversion
*conditional_conversion (tree
, tree
, tsubst_flags_t
);
216 static char *name_as_c_string (tree
, tree
, bool *);
217 static tree
prep_operand (tree
);
218 static void add_candidates (tree
, tree
, const vec
<tree
, va_gc
> *, tree
, tree
,
219 bool, tree
, tree
, int, struct z_candidate
**,
221 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
222 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
224 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
225 NAME can take many forms... */
228 check_dtor_name (tree basetype
, tree name
)
230 /* Just accept something we've already complained about. */
231 if (name
== error_mark_node
)
234 if (TREE_CODE (name
) == TYPE_DECL
)
235 name
= TREE_TYPE (name
);
236 else if (TYPE_P (name
))
238 else if (identifier_p (name
))
240 if ((MAYBE_CLASS_TYPE_P (basetype
)
241 && name
== constructor_name (basetype
))
242 || (TREE_CODE (basetype
) == ENUMERAL_TYPE
243 && name
== TYPE_IDENTIFIER (basetype
)))
246 name
= get_type_value (name
);
252 template <class T> struct S { ~S(); };
256 NAME will be a class template. */
257 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
261 if (!name
|| name
== error_mark_node
)
263 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
266 /* We want the address of a function or method. We avoid creating a
267 pointer-to-member function. */
270 build_addr_func (tree function
, tsubst_flags_t complain
)
272 tree type
= TREE_TYPE (function
);
274 /* We have to do these by hand to avoid real pointer to member
276 if (TREE_CODE (type
) == METHOD_TYPE
)
278 if (TREE_CODE (function
) == OFFSET_REF
)
280 tree object
= build_address (TREE_OPERAND (function
, 0));
281 return get_member_function_from_ptrfunc (&object
,
282 TREE_OPERAND (function
, 1),
285 function
= build_address (function
);
288 function
= decay_conversion (function
, complain
);
293 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
294 POINTER_TYPE to those. Note, pointer to member function types
295 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
296 two variants. build_call_a is the primitive taking an array of
297 arguments, while build_call_n is a wrapper that handles varargs. */
300 build_call_n (tree function
, int n
, ...)
303 return build_call_a (function
, 0, NULL
);
306 tree
*argarray
= XALLOCAVEC (tree
, n
);
311 for (i
= 0; i
< n
; i
++)
312 argarray
[i
] = va_arg (ap
, tree
);
314 return build_call_a (function
, n
, argarray
);
318 /* Update various flags in cfun and the call itself based on what is being
319 called. Split out of build_call_a so that bot_manip can use it too. */
322 set_flags_from_callee (tree call
)
325 tree decl
= get_callee_fndecl (call
);
327 /* We check both the decl and the type; a function may be known not to
328 throw without being declared throw(). */
329 nothrow
= ((decl
&& TREE_NOTHROW (decl
))
330 || TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call
)))));
332 if (!nothrow
&& at_function_scope_p () && cfun
&& cp_function_chain
)
333 cp_function_chain
->can_throw
= 1;
335 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
336 current_function_returns_abnormally
= 1;
338 TREE_NOTHROW (call
) = nothrow
;
342 build_call_a (tree function
, int n
, tree
*argarray
)
349 function
= build_addr_func (function
, tf_warning_or_error
);
351 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
352 fntype
= TREE_TYPE (TREE_TYPE (function
));
353 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
354 || TREE_CODE (fntype
) == METHOD_TYPE
);
355 result_type
= TREE_TYPE (fntype
);
356 /* An rvalue has no cv-qualifiers. */
357 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
358 result_type
= cv_unqualified (result_type
);
360 function
= build_call_array_loc (input_location
,
361 result_type
, function
, n
, argarray
);
362 set_flags_from_callee (function
);
364 decl
= get_callee_fndecl (function
);
366 if (decl
&& !TREE_USED (decl
))
368 /* We invoke build_call directly for several library
369 functions. These may have been declared normally if
370 we're building libgcc, so we can't just check
372 gcc_assert (DECL_ARTIFICIAL (decl
)
373 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
378 if (decl
&& TREE_DEPRECATED (decl
))
379 warn_deprecated_use (decl
, NULL_TREE
);
380 require_complete_eh_spec_types (fntype
, decl
);
382 TREE_HAS_CONSTRUCTOR (function
) = (decl
&& DECL_CONSTRUCTOR_P (decl
));
384 /* Don't pass empty class objects by value. This is useful
385 for tags in STL, which are used to control overload resolution.
386 We don't need to handle other cases of copying empty classes. */
387 if (! decl
|| ! DECL_BUILT_IN (decl
))
388 for (i
= 0; i
< n
; i
++)
390 tree arg
= CALL_EXPR_ARG (function
, i
);
391 if (is_empty_class (TREE_TYPE (arg
))
392 && ! TREE_ADDRESSABLE (TREE_TYPE (arg
)))
394 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (arg
));
395 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (t
), arg
, t
);
396 CALL_EXPR_ARG (function
, i
) = arg
;
403 /* Build something of the form ptr->method (args)
404 or object.method (args). This can also build
405 calls to constructors, and find friends.
407 Member functions always take their class variable
410 INSTANCE is a class instance.
412 NAME is the name of the method desired, usually an IDENTIFIER_NODE.
414 PARMS help to figure out what that NAME really refers to.
416 BASETYPE_PATH, if non-NULL, contains a chain from the type of INSTANCE
417 down to the real instance type to use for access checking. We need this
418 information to get protected accesses correct.
420 FLAGS is the logical disjunction of zero or more LOOKUP_
421 flags. See cp-tree.h for more info.
423 If this is all OK, calls build_function_call with the resolved
426 This function must also handle being called to perform
427 initialization, promotion/coercion of arguments, and
428 instantiation of default parameters.
430 Note that NAME may refer to an instance variable name. If
431 `operator()()' is defined for the type of that field, then we return
434 /* New overloading code. */
436 typedef struct z_candidate z_candidate
;
438 typedef struct candidate_warning candidate_warning
;
439 struct candidate_warning
{
441 candidate_warning
*next
;
444 /* Information for providing diagnostics about why overloading failed. */
446 enum rejection_reason_code
{
449 rr_explicit_conversion
,
450 rr_template_conversion
,
452 rr_bad_arg_conversion
,
453 rr_template_unification
,
457 struct conversion_info
{
458 /* The index of the argument, 0-based. */
460 /* The type of the actual argument. */
462 /* The type of the formal argument. */
466 struct rejection_reason
{
467 enum rejection_reason_code code
;
469 /* Information about an arity mismatch. */
471 /* The expected number of arguments. */
473 /* The actual number of arguments in the call. */
475 /* Whether the call was a varargs call. */
478 /* Information about an argument conversion mismatch. */
479 struct conversion_info conversion
;
480 /* Same, but for bad argument conversions. */
481 struct conversion_info bad_conversion
;
482 /* Information about template unification failures. These are the
483 parameters passed to fn_type_unification. */
491 unification_kind_t strict
;
493 } template_unification
;
494 /* Information about template instantiation failures. These are the
495 parameters passed to instantiate_template. */
499 } template_instantiation
;
504 /* The FUNCTION_DECL that will be called if this candidate is
505 selected by overload resolution. */
507 /* If not NULL_TREE, the first argument to use when calling this
510 /* The rest of the arguments to use when calling this function. If
511 there are no further arguments this may be NULL or it may be an
513 const vec
<tree
, va_gc
> *args
;
514 /* The implicit conversion sequences for each of the arguments to
517 /* The number of implicit conversion sequences. */
519 /* If FN is a user-defined conversion, the standard conversion
520 sequence from the type returned by FN to the desired destination
522 conversion
*second_conv
;
524 struct rejection_reason
*reason
;
525 /* If FN is a member function, the binfo indicating the path used to
526 qualify the name of FN at the call site. This path is used to
527 determine whether or not FN is accessible if it is selected by
528 overload resolution. The DECL_CONTEXT of FN will always be a
529 (possibly improper) base of this binfo. */
531 /* If FN is a non-static member function, the binfo indicating the
532 subobject to which the `this' pointer should be converted if FN
533 is selected by overload resolution. The type pointed to by
534 the `this' pointer must correspond to the most derived class
535 indicated by the CONVERSION_PATH. */
536 tree conversion_path
;
539 candidate_warning
*warnings
;
543 /* Returns true iff T is a null pointer constant in the sense of
547 null_ptr_cst_p (tree t
)
551 A null pointer constant is an integral constant expression
552 (_expr.const_) rvalue of integer type that evaluates to zero or
553 an rvalue of type std::nullptr_t. */
554 if (NULLPTR_TYPE_P (TREE_TYPE (t
)))
556 if (CP_INTEGRAL_TYPE_P (TREE_TYPE (t
)))
558 /* Core issue 903 says only literal 0 is a null pointer constant. */
559 if (cxx_dialect
< cxx11
)
560 t
= maybe_constant_value (fold_non_dependent_expr_sfinae (t
, tf_none
));
562 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
568 /* Returns true iff T is a null member pointer value (4.11). */
571 null_member_pointer_value_p (tree t
)
573 tree type
= TREE_TYPE (t
);
576 else if (TYPE_PTRMEMFUNC_P (type
))
577 return (TREE_CODE (t
) == CONSTRUCTOR
578 && integer_zerop (CONSTRUCTOR_ELT (t
, 0)->value
));
579 else if (TYPE_PTRDATAMEM_P (type
))
580 return integer_all_onesp (t
);
585 /* Returns nonzero if PARMLIST consists of only default parms,
586 ellipsis, and/or undeduced parameter packs. */
589 sufficient_parms_p (const_tree parmlist
)
591 for (; parmlist
&& parmlist
!= void_list_node
;
592 parmlist
= TREE_CHAIN (parmlist
))
593 if (!TREE_PURPOSE (parmlist
)
594 && !PACK_EXPANSION_P (TREE_VALUE (parmlist
)))
599 /* Allocate N bytes of memory from the conversion obstack. The memory
600 is zeroed before being returned. */
603 conversion_obstack_alloc (size_t n
)
606 if (!conversion_obstack_initialized
)
608 gcc_obstack_init (&conversion_obstack
);
609 conversion_obstack_initialized
= true;
611 p
= obstack_alloc (&conversion_obstack
, n
);
616 /* Allocate rejection reasons. */
618 static struct rejection_reason
*
619 alloc_rejection (enum rejection_reason_code code
)
621 struct rejection_reason
*p
;
622 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
627 static struct rejection_reason
*
628 arity_rejection (tree first_arg
, int expected
, int actual
)
630 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
631 int adjust
= first_arg
!= NULL_TREE
;
632 r
->u
.arity
.expected
= expected
- adjust
;
633 r
->u
.arity
.actual
= actual
- adjust
;
637 static struct rejection_reason
*
638 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
640 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
641 int adjust
= first_arg
!= NULL_TREE
;
642 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
643 r
->u
.conversion
.from_type
= from
;
644 r
->u
.conversion
.to_type
= to
;
648 static struct rejection_reason
*
649 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
651 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
652 int adjust
= first_arg
!= NULL_TREE
;
653 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
654 r
->u
.bad_conversion
.from_type
= from
;
655 r
->u
.bad_conversion
.to_type
= to
;
659 static struct rejection_reason
*
660 explicit_conversion_rejection (tree from
, tree to
)
662 struct rejection_reason
*r
= alloc_rejection (rr_explicit_conversion
);
663 r
->u
.conversion
.n_arg
= 0;
664 r
->u
.conversion
.from_type
= from
;
665 r
->u
.conversion
.to_type
= to
;
669 static struct rejection_reason
*
670 template_conversion_rejection (tree from
, tree to
)
672 struct rejection_reason
*r
= alloc_rejection (rr_template_conversion
);
673 r
->u
.conversion
.n_arg
= 0;
674 r
->u
.conversion
.from_type
= from
;
675 r
->u
.conversion
.to_type
= to
;
679 static struct rejection_reason
*
680 template_unification_rejection (tree tmpl
, tree explicit_targs
, tree targs
,
681 const tree
*args
, unsigned int nargs
,
682 tree return_type
, unification_kind_t strict
,
685 size_t args_n_bytes
= sizeof (*args
) * nargs
;
686 tree
*args1
= (tree
*) conversion_obstack_alloc (args_n_bytes
);
687 struct rejection_reason
*r
= alloc_rejection (rr_template_unification
);
688 r
->u
.template_unification
.tmpl
= tmpl
;
689 r
->u
.template_unification
.explicit_targs
= explicit_targs
;
690 r
->u
.template_unification
.num_targs
= TREE_VEC_LENGTH (targs
);
691 /* Copy args to our own storage. */
692 memcpy (args1
, args
, args_n_bytes
);
693 r
->u
.template_unification
.args
= args1
;
694 r
->u
.template_unification
.nargs
= nargs
;
695 r
->u
.template_unification
.return_type
= return_type
;
696 r
->u
.template_unification
.strict
= strict
;
697 r
->u
.template_unification
.flags
= flags
;
701 static struct rejection_reason
*
702 template_unification_error_rejection (void)
704 return alloc_rejection (rr_template_unification
);
707 static struct rejection_reason
*
708 invalid_copy_with_fn_template_rejection (void)
710 struct rejection_reason
*r
= alloc_rejection (rr_invalid_copy
);
714 /* Dynamically allocate a conversion. */
717 alloc_conversion (conversion_kind kind
)
720 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
725 #ifdef ENABLE_CHECKING
727 /* Make sure that all memory on the conversion obstack has been
731 validate_conversion_obstack (void)
733 if (conversion_obstack_initialized
)
734 gcc_assert ((obstack_next_free (&conversion_obstack
)
735 == obstack_base (&conversion_obstack
)));
738 #endif /* ENABLE_CHECKING */
740 /* Dynamically allocate an array of N conversions. */
743 alloc_conversions (size_t n
)
745 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
749 build_conv (conversion_kind code
, tree type
, conversion
*from
)
752 conversion_rank rank
= CONVERSION_RANK (from
);
754 /* Note that the caller is responsible for filling in t->cand for
755 user-defined conversions. */
756 t
= alloc_conversion (code
);
779 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
780 t
->bad_p
= from
->bad_p
;
785 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
786 specialization of std::initializer_list<T>, if such a conversion is
790 build_list_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
792 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
793 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
794 conversion
**subconvs
= alloc_conversions (len
);
799 /* Within a list-initialization we can have more user-defined
801 flags
&= ~LOOKUP_NO_CONVERSION
;
802 /* But no narrowing conversions. */
803 flags
|= LOOKUP_NO_NARROWING
;
805 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
808 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
809 false, flags
, complain
);
816 t
= alloc_conversion (ck_list
);
818 t
->u
.list
= subconvs
;
821 for (i
= 0; i
< len
; ++i
)
823 conversion
*sub
= subconvs
[i
];
824 if (sub
->rank
> t
->rank
)
826 if (sub
->user_conv_p
)
827 t
->user_conv_p
= true;
835 /* Return the next conversion of the conversion chain (if applicable),
836 or NULL otherwise. Please use this function instead of directly
837 accessing fields of struct conversion. */
840 next_conversion (conversion
*conv
)
843 || conv
->kind
== ck_identity
844 || conv
->kind
== ck_ambig
845 || conv
->kind
== ck_list
)
850 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
851 is a valid aggregate initializer for array type ATYPE. */
854 can_convert_array (tree atype
, tree ctor
, int flags
, tsubst_flags_t complain
)
857 tree elttype
= TREE_TYPE (atype
);
858 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
860 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
862 if (TREE_CODE (elttype
) == ARRAY_TYPE
863 && TREE_CODE (val
) == CONSTRUCTOR
)
864 ok
= can_convert_array (elttype
, val
, flags
, complain
);
866 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
,
874 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
875 aggregate class, if such a conversion is possible. */
878 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
880 unsigned HOST_WIDE_INT i
= 0;
882 tree field
= next_initializable_field (TYPE_FIELDS (type
));
883 tree empty_ctor
= NULL_TREE
;
885 ctor
= reshape_init (type
, ctor
, tf_none
);
886 if (ctor
== error_mark_node
)
889 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
891 tree ftype
= TREE_TYPE (field
);
895 if (i
< CONSTRUCTOR_NELTS (ctor
))
896 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
899 if (empty_ctor
== NULL_TREE
)
900 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
905 if (TREE_CODE (ftype
) == ARRAY_TYPE
906 && TREE_CODE (val
) == CONSTRUCTOR
)
907 ok
= can_convert_array (ftype
, val
, flags
, complain
);
909 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
915 if (TREE_CODE (type
) == UNION_TYPE
)
919 if (i
< CONSTRUCTOR_NELTS (ctor
))
922 c
= alloc_conversion (ck_aggr
);
925 c
->user_conv_p
= true;
930 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
931 array type, if such a conversion is possible. */
934 build_array_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
937 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
938 tree elttype
= TREE_TYPE (type
);
943 enum conversion_rank rank
= cr_exact
;
945 if (TYPE_DOMAIN (type
))
947 unsigned HOST_WIDE_INT alen
= tree_to_uhwi (array_type_nelts_top (type
));
952 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
955 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
956 false, flags
, complain
);
960 if (sub
->rank
> rank
)
962 if (sub
->user_conv_p
)
968 c
= alloc_conversion (ck_aggr
);
971 c
->user_conv_p
= user
;
977 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
978 complex type, if such a conversion is possible. */
981 build_complex_conv (tree type
, tree ctor
, int flags
,
982 tsubst_flags_t complain
)
985 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
986 tree elttype
= TREE_TYPE (type
);
991 enum conversion_rank rank
= cr_exact
;
996 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
999 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1000 false, flags
, complain
);
1004 if (sub
->rank
> rank
)
1006 if (sub
->user_conv_p
)
1012 c
= alloc_conversion (ck_aggr
);
1015 c
->user_conv_p
= user
;
1021 /* Build a representation of the identity conversion from EXPR to
1022 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1025 build_identity_conv (tree type
, tree expr
)
1029 c
= alloc_conversion (ck_identity
);
1036 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1037 were multiple user-defined conversions to accomplish the job.
1038 Build a conversion that indicates that ambiguity. */
1041 build_ambiguous_conv (tree type
, tree expr
)
1045 c
= alloc_conversion (ck_ambig
);
1053 strip_top_quals (tree t
)
1055 if (TREE_CODE (t
) == ARRAY_TYPE
)
1057 return cp_build_qualified_type (t
, 0);
1060 /* Returns the standard conversion path (see [conv]) from type FROM to type
1061 TO, if any. For proper handling of null pointer constants, you must
1062 also pass the expression EXPR to convert from. If C_CAST_P is true,
1063 this conversion is coming from a C-style cast. */
1066 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1069 enum tree_code fcode
, tcode
;
1071 bool fromref
= false;
1074 to
= non_reference (to
);
1075 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1078 from
= TREE_TYPE (from
);
1081 to
= strip_top_quals (to
);
1082 from
= strip_top_quals (from
);
1084 if ((TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1085 && expr
&& type_unknown_p (expr
))
1087 tsubst_flags_t tflags
= tf_conv
;
1088 expr
= instantiate_type (to
, expr
, tflags
);
1089 if (expr
== error_mark_node
)
1091 from
= TREE_TYPE (expr
);
1094 fcode
= TREE_CODE (from
);
1095 tcode
= TREE_CODE (to
);
1097 conv
= build_identity_conv (from
, expr
);
1098 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1100 from
= type_decays_to (from
);
1101 fcode
= TREE_CODE (from
);
1102 conv
= build_conv (ck_lvalue
, from
, conv
);
1104 else if (fromref
|| (expr
&& lvalue_p (expr
)))
1109 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1112 from
= strip_top_quals (bitfield_type
);
1113 fcode
= TREE_CODE (from
);
1116 conv
= build_conv (ck_rvalue
, from
, conv
);
1117 if (flags
& LOOKUP_PREFER_RVALUE
)
1118 conv
->rvaluedness_matches_p
= true;
1121 /* Allow conversion between `__complex__' data types. */
1122 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1124 /* The standard conversion sequence to convert FROM to TO is
1125 the standard conversion sequence to perform componentwise
1127 conversion
*part_conv
= standard_conversion
1128 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
);
1132 conv
= build_conv (part_conv
->kind
, to
, conv
);
1133 conv
->rank
= part_conv
->rank
;
1141 if (same_type_p (from
, to
))
1143 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1144 conv
->type
= qualified_to
;
1149 A null pointer constant can be converted to a pointer type; ... A
1150 null pointer constant of integral type can be converted to an
1151 rvalue of type std::nullptr_t. */
1152 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1153 || NULLPTR_TYPE_P (to
))
1154 && expr
&& null_ptr_cst_p (expr
))
1155 conv
= build_conv (ck_std
, to
, conv
);
1156 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1157 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1159 /* For backwards brain damage compatibility, allow interconversion of
1160 pointers and integers with a pedwarn. */
1161 conv
= build_conv (ck_std
, to
, conv
);
1164 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1166 /* For backwards brain damage compatibility, allow interconversion of
1167 enums and integers with a pedwarn. */
1168 conv
= build_conv (ck_std
, to
, conv
);
1171 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1172 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1177 if (tcode
== POINTER_TYPE
1178 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from
),
1181 else if (VOID_TYPE_P (TREE_TYPE (to
))
1182 && !TYPE_PTRDATAMEM_P (from
)
1183 && TREE_CODE (TREE_TYPE (from
)) != FUNCTION_TYPE
)
1185 tree nfrom
= TREE_TYPE (from
);
1186 from
= build_pointer_type
1187 (cp_build_qualified_type (void_type_node
,
1188 cp_type_quals (nfrom
)));
1189 conv
= build_conv (ck_ptr
, from
, conv
);
1191 else if (TYPE_PTRDATAMEM_P (from
))
1193 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1194 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1196 if (DERIVED_FROM_P (fbase
, tbase
)
1197 && (same_type_ignoring_top_level_qualifiers_p
1198 (TYPE_PTRMEM_POINTED_TO_TYPE (from
),
1199 TYPE_PTRMEM_POINTED_TO_TYPE (to
))))
1201 from
= build_ptrmem_type (tbase
,
1202 TYPE_PTRMEM_POINTED_TO_TYPE (from
));
1203 conv
= build_conv (ck_pmem
, from
, conv
);
1205 else if (!same_type_p (fbase
, tbase
))
1208 else if (CLASS_TYPE_P (TREE_TYPE (from
))
1209 && CLASS_TYPE_P (TREE_TYPE (to
))
1212 An rvalue of type "pointer to cv D," where D is a
1213 class type, can be converted to an rvalue of type
1214 "pointer to cv B," where B is a base class (clause
1215 _class.derived_) of D. If B is an inaccessible
1216 (clause _class.access_) or ambiguous
1217 (_class.member.lookup_) base class of D, a program
1218 that necessitates this conversion is ill-formed.
1219 Therefore, we use DERIVED_FROM_P, and do not check
1220 access or uniqueness. */
1221 && DERIVED_FROM_P (TREE_TYPE (to
), TREE_TYPE (from
)))
1224 cp_build_qualified_type (TREE_TYPE (to
),
1225 cp_type_quals (TREE_TYPE (from
)));
1226 from
= build_pointer_type (from
);
1227 conv
= build_conv (ck_ptr
, from
, conv
);
1228 conv
->base_p
= true;
1231 if (tcode
== POINTER_TYPE
)
1233 to_pointee
= TREE_TYPE (to
);
1234 from_pointee
= TREE_TYPE (from
);
1238 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1239 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1242 if (same_type_p (from
, to
))
1244 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
1245 /* In a C-style cast, we ignore CV-qualification because we
1246 are allowed to perform a static_cast followed by a
1248 conv
= build_conv (ck_qual
, to
, conv
);
1249 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1250 conv
= build_conv (ck_qual
, to
, conv
);
1251 else if (expr
&& string_conv_p (to
, expr
, 0))
1252 /* converting from string constant to char *. */
1253 conv
= build_conv (ck_qual
, to
, conv
);
1254 /* Allow conversions among compatible ObjC pointer types (base
1255 conversions have been already handled above). */
1256 else if (c_dialect_objc ()
1257 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1258 conv
= build_conv (ck_ptr
, to
, conv
);
1259 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1261 conv
= build_conv (ck_ptr
, to
, conv
);
1269 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1271 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1272 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1273 tree fbase
= class_of_this_parm (fromfn
);
1274 tree tbase
= class_of_this_parm (tofn
);
1276 if (!DERIVED_FROM_P (fbase
, tbase
)
1277 || !same_type_p (static_fn_type (fromfn
),
1278 static_fn_type (tofn
)))
1281 from
= build_memfn_type (fromfn
,
1283 cp_type_quals (tbase
),
1284 type_memfn_rqual (tofn
));
1285 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1286 conv
= build_conv (ck_pmem
, from
, conv
);
1287 conv
->base_p
= true;
1289 else if (tcode
== BOOLEAN_TYPE
)
1293 An rvalue of arithmetic, unscoped enumeration, pointer, or
1294 pointer to member type can be converted to an rvalue of type
1295 bool. ... An rvalue of type std::nullptr_t can be converted
1296 to an rvalue of type bool; */
1297 if (ARITHMETIC_TYPE_P (from
)
1298 || UNSCOPED_ENUM_P (from
)
1299 || fcode
== POINTER_TYPE
1300 || TYPE_PTRMEM_P (from
)
1301 || NULLPTR_TYPE_P (from
))
1303 conv
= build_conv (ck_std
, to
, conv
);
1304 if (fcode
== POINTER_TYPE
1305 || TYPE_PTRDATAMEM_P (from
)
1306 || (TYPE_PTRMEMFUNC_P (from
)
1307 && conv
->rank
< cr_pbool
)
1308 || NULLPTR_TYPE_P (from
))
1309 conv
->rank
= cr_pbool
;
1315 /* We don't check for ENUMERAL_TYPE here because there are no standard
1316 conversions to enum type. */
1317 /* As an extension, allow conversion to complex type. */
1318 else if (ARITHMETIC_TYPE_P (to
))
1320 if (! (INTEGRAL_CODE_P (fcode
)
1321 || (fcode
== REAL_TYPE
&& !(flags
& LOOKUP_NO_NON_INTEGRAL
)))
1322 || SCOPED_ENUM_P (from
))
1324 conv
= build_conv (ck_std
, to
, conv
);
1326 /* Give this a better rank if it's a promotion. */
1327 if (same_type_p (to
, type_promotes_to (from
))
1328 && next_conversion (conv
)->rank
<= cr_promotion
)
1329 conv
->rank
= cr_promotion
;
1331 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1332 && vector_types_convertible_p (from
, to
, false))
1333 return build_conv (ck_std
, to
, conv
);
1334 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1335 && is_properly_derived_from (from
, to
))
1337 if (conv
->kind
== ck_rvalue
)
1338 conv
= next_conversion (conv
);
1339 conv
= build_conv (ck_base
, to
, conv
);
1340 /* The derived-to-base conversion indicates the initialization
1341 of a parameter with base type from an object of a derived
1342 type. A temporary object is created to hold the result of
1343 the conversion unless we're binding directly to a reference. */
1344 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1349 if (flags
& LOOKUP_NO_NARROWING
)
1350 conv
->check_narrowing
= true;
1355 /* Returns nonzero if T1 is reference-related to T2. */
1358 reference_related_p (tree t1
, tree t2
)
1360 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1363 t1
= TYPE_MAIN_VARIANT (t1
);
1364 t2
= TYPE_MAIN_VARIANT (t2
);
1368 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1369 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1371 return (same_type_p (t1
, t2
)
1372 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1373 && DERIVED_FROM_P (t1
, t2
)));
1376 /* Returns nonzero if T1 is reference-compatible with T2. */
1379 reference_compatible_p (tree t1
, tree t2
)
1383 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
1384 reference-related to T2 and cv1 is the same cv-qualification as,
1385 or greater cv-qualification than, cv2. */
1386 return (reference_related_p (t1
, t2
)
1387 && at_least_as_qualified_p (t1
, t2
));
1390 /* A reference of the indicated TYPE is being bound directly to the
1391 expression represented by the implicit conversion sequence CONV.
1392 Return a conversion sequence for this binding. */
1395 direct_reference_binding (tree type
, conversion
*conv
)
1399 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
1400 gcc_assert (TREE_CODE (conv
->type
) != REFERENCE_TYPE
);
1402 t
= TREE_TYPE (type
);
1406 When a parameter of reference type binds directly
1407 (_dcl.init.ref_) to an argument expression, the implicit
1408 conversion sequence is the identity conversion, unless the
1409 argument expression has a type that is a derived class of the
1410 parameter type, in which case the implicit conversion sequence is
1411 a derived-to-base Conversion.
1413 If the parameter binds directly to the result of applying a
1414 conversion function to the argument expression, the implicit
1415 conversion sequence is a user-defined conversion sequence
1416 (_over.ics.user_), with the second standard conversion sequence
1417 either an identity conversion or, if the conversion function
1418 returns an entity of a type that is a derived class of the
1419 parameter type, a derived-to-base conversion. */
1420 if (!same_type_ignoring_top_level_qualifiers_p (t
, conv
->type
))
1422 /* Represent the derived-to-base conversion. */
1423 conv
= build_conv (ck_base
, t
, conv
);
1424 /* We will actually be binding to the base-class subobject in
1425 the derived class, so we mark this conversion appropriately.
1426 That way, convert_like knows not to generate a temporary. */
1427 conv
->need_temporary_p
= false;
1429 return build_conv (ck_ref_bind
, type
, conv
);
1432 /* Returns the conversion path from type FROM to reference type TO for
1433 purposes of reference binding. For lvalue binding, either pass a
1434 reference type to FROM or an lvalue expression to EXPR. If the
1435 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1436 the conversion returned. If C_CAST_P is true, this
1437 conversion is coming from a C-style cast. */
1440 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1441 tsubst_flags_t complain
)
1443 conversion
*conv
= NULL
;
1444 tree to
= TREE_TYPE (rto
);
1449 cp_lvalue_kind gl_kind
;
1452 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1454 expr
= instantiate_type (to
, expr
, tf_none
);
1455 if (expr
== error_mark_node
)
1457 from
= TREE_TYPE (expr
);
1460 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1462 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1463 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1465 if (!CLASS_TYPE_P (to
)
1466 && CONSTRUCTOR_NELTS (expr
) == 1)
1468 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1469 if (error_operand_p (expr
))
1471 from
= TREE_TYPE (expr
);
1475 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1477 from
= TREE_TYPE (from
);
1478 if (!TYPE_REF_IS_RVALUE (rfrom
)
1479 || TREE_CODE (from
) == FUNCTION_TYPE
)
1480 gl_kind
= clk_ordinary
;
1482 gl_kind
= clk_rvalueref
;
1486 gl_kind
= lvalue_kind (expr
);
1487 if (gl_kind
& clk_class
)
1488 /* A class prvalue is not a glvalue. */
1493 is_lvalue
= gl_kind
&& !(gl_kind
& clk_rvalueref
);
1496 if ((gl_kind
& clk_bitfield
) != 0)
1497 tfrom
= unlowered_expr_type (expr
);
1499 /* Figure out whether or not the types are reference-related and
1500 reference compatible. We have do do this after stripping
1501 references from FROM. */
1502 related_p
= reference_related_p (to
, tfrom
);
1503 /* If this is a C cast, first convert to an appropriately qualified
1504 type, so that we can later do a const_cast to the desired type. */
1505 if (related_p
&& c_cast_p
1506 && !at_least_as_qualified_p (to
, tfrom
))
1507 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1508 compatible_p
= reference_compatible_p (to
, tfrom
);
1510 /* Directly bind reference when target expression's type is compatible with
1511 the reference and expression is an lvalue. In DR391, the wording in
1512 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1513 const and rvalue references to rvalues of compatible class type.
1514 We should also do direct bindings for non-class xvalues. */
1517 || (((CP_TYPE_CONST_NON_VOLATILE_P (to
)
1518 && !(flags
& LOOKUP_NO_RVAL_BIND
))
1519 || TYPE_REF_IS_RVALUE (rto
))
1521 || (!(flags
& LOOKUP_NO_TEMP_BIND
)
1522 && (CLASS_TYPE_P (from
)
1523 || TREE_CODE (from
) == ARRAY_TYPE
))))))
1527 If the initializer expression
1529 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1530 is reference-compatible with "cv2 T2,"
1532 the reference is bound directly to the initializer expression
1536 If the initializer expression is an rvalue, with T2 a class type,
1537 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1538 is bound to the object represented by the rvalue or to a sub-object
1539 within that object. */
1541 conv
= build_identity_conv (tfrom
, expr
);
1542 conv
= direct_reference_binding (rto
, conv
);
1544 if (flags
& LOOKUP_PREFER_RVALUE
)
1545 /* The top-level caller requested that we pretend that the lvalue
1546 be treated as an rvalue. */
1547 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1548 else if (TREE_CODE (rfrom
) == REFERENCE_TYPE
)
1549 /* Handle rvalue reference to function properly. */
1550 conv
->rvaluedness_matches_p
1551 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1553 conv
->rvaluedness_matches_p
1554 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1556 if ((gl_kind
& clk_bitfield
) != 0
1557 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1558 /* For the purposes of overload resolution, we ignore the fact
1559 this expression is a bitfield or packed field. (In particular,
1560 [over.ics.ref] says specifically that a function with a
1561 non-const reference parameter is viable even if the
1562 argument is a bitfield.)
1564 However, when we actually call the function we must create
1565 a temporary to which to bind the reference. If the
1566 reference is volatile, or isn't const, then we cannot make
1567 a temporary, so we just issue an error when the conversion
1569 conv
->need_temporary_p
= true;
1571 /* Don't allow binding of lvalues (other than function lvalues) to
1572 rvalue references. */
1573 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1574 && TREE_CODE (to
) != FUNCTION_TYPE
1575 && !(flags
& LOOKUP_PREFER_RVALUE
))
1580 /* [class.conv.fct] A conversion function is never used to convert a
1581 (possibly cv-qualified) object to the (possibly cv-qualified) same
1582 object type (or a reference to it), to a (possibly cv-qualified) base
1583 class of that type (or a reference to it).... */
1584 else if (CLASS_TYPE_P (from
) && !related_p
1585 && !(flags
& LOOKUP_NO_CONVERSION
))
1589 If the initializer expression
1591 -- has a class type (i.e., T2 is a class type) can be
1592 implicitly converted to an lvalue of type "cv3 T3," where
1593 "cv1 T1" is reference-compatible with "cv3 T3". (this
1594 conversion is selected by enumerating the applicable
1595 conversion functions (_over.match.ref_) and choosing the
1596 best one through overload resolution. (_over.match_).
1598 the reference is bound to the lvalue result of the conversion
1599 in the second case. */
1600 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1603 return cand
->second_conv
;
1606 /* From this point on, we conceptually need temporaries, even if we
1607 elide them. Only the cases above are "direct bindings". */
1608 if (flags
& LOOKUP_NO_TEMP_BIND
)
1613 When a parameter of reference type is not bound directly to an
1614 argument expression, the conversion sequence is the one required
1615 to convert the argument expression to the underlying type of the
1616 reference according to _over.best.ics_. Conceptually, this
1617 conversion sequence corresponds to copy-initializing a temporary
1618 of the underlying type with the argument expression. Any
1619 difference in top-level cv-qualification is subsumed by the
1620 initialization itself and does not constitute a conversion. */
1624 Otherwise, the reference shall be to a non-volatile const type.
1626 Under C++0x, [8.5.3/5 dcl.init.ref] it may also be an rvalue reference */
1627 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1632 Otherwise, a temporary of type "cv1 T1" is created and
1633 initialized from the initializer expression using the rules for a
1634 non-reference copy initialization. If T1 is reference-related to
1635 T2, cv1 must be the same cv-qualification as, or greater
1636 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1637 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1640 /* We're generating a temporary now, but don't bind any more in the
1641 conversion (specifically, don't slice the temporary returned by a
1642 conversion operator). */
1643 flags
|= LOOKUP_NO_TEMP_BIND
;
1645 /* Core issue 899: When [copy-]initializing a temporary to be bound
1646 to the first parameter of a copy constructor (12.8) called with
1647 a single argument in the context of direct-initialization,
1648 explicit conversion functions are also considered.
1650 So don't set LOOKUP_ONLYCONVERTING in that case. */
1651 if (!(flags
& LOOKUP_COPY_PARM
))
1652 flags
|= LOOKUP_ONLYCONVERTING
;
1655 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1660 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1661 /* This reference binding, unlike those above, requires the
1662 creation of a temporary. */
1663 conv
->need_temporary_p
= true;
1664 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1669 /* Returns the implicit conversion sequence (see [over.ics]) from type
1670 FROM to type TO. The optional expression EXPR may affect the
1671 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1672 true, this conversion is coming from a C-style cast. */
1675 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1676 int flags
, tsubst_flags_t complain
)
1680 if (from
== error_mark_node
|| to
== error_mark_node
1681 || expr
== error_mark_node
)
1684 /* Other flags only apply to the primary function in overload
1685 resolution, or after we've chosen one. */
1686 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1687 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1688 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1690 /* FIXME: actually we don't want warnings either, but we can't just
1691 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1692 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1693 We really ought not to issue that warning until we've committed
1694 to that conversion. */
1695 complain
&= ~tf_error
;
1697 if (TREE_CODE (to
) == REFERENCE_TYPE
)
1698 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1700 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
);
1705 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1707 if (is_std_init_list (to
))
1708 return build_list_conv (to
, expr
, flags
, complain
);
1710 /* As an extension, allow list-initialization of _Complex. */
1711 if (TREE_CODE (to
) == COMPLEX_TYPE
)
1713 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1718 /* Allow conversion from an initializer-list with one element to a
1720 if (SCALAR_TYPE_P (to
))
1722 int nelts
= CONSTRUCTOR_NELTS (expr
);
1726 elt
= build_value_init (to
, tf_none
);
1727 else if (nelts
== 1)
1728 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1730 elt
= error_mark_node
;
1732 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1733 c_cast_p
, flags
, complain
);
1736 conv
->check_narrowing
= true;
1737 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1738 /* Too many levels of braces, i.e. '{{1}}'. */
1743 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1744 return build_array_conv (to
, expr
, flags
, complain
);
1747 if (expr
!= NULL_TREE
1748 && (MAYBE_CLASS_TYPE_P (from
)
1749 || MAYBE_CLASS_TYPE_P (to
))
1750 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1752 struct z_candidate
*cand
;
1754 if (CLASS_TYPE_P (to
)
1755 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
1756 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
1757 return build_aggr_conv (to
, expr
, flags
, complain
);
1759 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
1761 conv
= cand
->second_conv
;
1763 /* We used to try to bind a reference to a temporary here, but that
1764 is now handled after the recursive call to this function at the end
1765 of reference_binding. */
1772 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1773 functions. ARGS will not be changed until a single candidate is
1776 static struct z_candidate
*
1777 add_candidate (struct z_candidate
**candidates
,
1778 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
1779 size_t num_convs
, conversion
**convs
,
1780 tree access_path
, tree conversion_path
,
1781 int viable
, struct rejection_reason
*reason
)
1783 struct z_candidate
*cand
= (struct z_candidate
*)
1784 conversion_obstack_alloc (sizeof (struct z_candidate
));
1787 cand
->first_arg
= first_arg
;
1789 cand
->convs
= convs
;
1790 cand
->num_convs
= num_convs
;
1791 cand
->access_path
= access_path
;
1792 cand
->conversion_path
= conversion_path
;
1793 cand
->viable
= viable
;
1794 cand
->reason
= reason
;
1795 cand
->next
= *candidates
;
1801 /* Return the number of remaining arguments in the parameter list
1802 beginning with ARG. */
1805 remaining_arguments (tree arg
)
1809 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
1810 arg
= TREE_CHAIN (arg
))
1816 /* Create an overload candidate for the function or method FN called
1817 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1818 FLAGS is passed on to implicit_conversion.
1820 This does not change ARGS.
1822 CTYPE, if non-NULL, is the type we want to pretend this function
1823 comes from for purposes of overload resolution. */
1825 static struct z_candidate
*
1826 add_function_candidate (struct z_candidate
**candidates
,
1827 tree fn
, tree ctype
, tree first_arg
,
1828 const vec
<tree
, va_gc
> *args
, tree access_path
,
1829 tree conversion_path
, int flags
,
1830 tsubst_flags_t complain
)
1832 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1836 tree orig_first_arg
= first_arg
;
1839 struct rejection_reason
*reason
= NULL
;
1841 /* At this point we should not see any functions which haven't been
1842 explicitly declared, except for friend functions which will have
1843 been found using argument dependent lookup. */
1844 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
1846 /* The `this', `in_chrg' and VTT arguments to constructors are not
1847 considered in overload resolution. */
1848 if (DECL_CONSTRUCTOR_P (fn
))
1850 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
1851 skip
= num_artificial_parms_for (fn
);
1852 if (skip
> 0 && first_arg
!= NULL_TREE
)
1855 first_arg
= NULL_TREE
;
1861 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
1862 convs
= alloc_conversions (len
);
1864 /* 13.3.2 - Viable functions [over.match.viable]
1865 First, to be a viable function, a candidate function shall have enough
1866 parameters to agree in number with the arguments in the list.
1868 We need to check this first; otherwise, checking the ICSes might cause
1869 us to produce an ill-formed template instantiation. */
1871 parmnode
= parmlist
;
1872 for (i
= 0; i
< len
; ++i
)
1874 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
1876 parmnode
= TREE_CHAIN (parmnode
);
1879 if ((i
< len
&& parmnode
)
1880 || !sufficient_parms_p (parmnode
))
1882 int remaining
= remaining_arguments (parmnode
);
1884 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
1886 /* When looking for a function from a subobject from an implicit
1887 copy/move constructor/operator=, don't consider anything that takes (a
1888 reference to) an unrelated type. See c++/44909 and core 1092. */
1889 else if (parmlist
&& (flags
& LOOKUP_DEFAULTED
))
1891 if (DECL_CONSTRUCTOR_P (fn
))
1893 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
1894 && DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
)
1900 parmnode
= chain_index (i
-1, parmlist
);
1901 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
1906 /* This only applies at the top level. */
1907 flags
&= ~LOOKUP_DEFAULTED
;
1913 /* Second, for F to be a viable function, there shall exist for each
1914 argument an implicit conversion sequence that converts that argument
1915 to the corresponding parameter of F. */
1917 parmnode
= parmlist
;
1919 for (i
= 0; i
< len
; ++i
)
1921 tree argtype
, to_type
;
1926 if (parmnode
== void_list_node
)
1929 if (i
== 0 && first_arg
!= NULL_TREE
)
1932 arg
= CONST_CAST_TREE (
1933 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
1934 argtype
= lvalue_type (arg
);
1936 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1937 && ! DECL_CONSTRUCTOR_P (fn
));
1941 tree parmtype
= TREE_VALUE (parmnode
);
1944 parmnode
= TREE_CHAIN (parmnode
);
1946 /* The type of the implicit object parameter ('this') for
1947 overload resolution is not always the same as for the
1948 function itself; conversion functions are considered to
1949 be members of the class being converted, and functions
1950 introduced by a using-declaration are considered to be
1951 members of the class that uses them.
1953 Since build_over_call ignores the ICS for the `this'
1954 parameter, we can just change the parm type. */
1955 if (ctype
&& is_this
)
1957 parmtype
= cp_build_qualified_type
1958 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
1959 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
1961 /* If the function has a ref-qualifier, the implicit
1962 object parameter has reference type. */
1963 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
1964 parmtype
= cp_build_reference_type (parmtype
, rv
);
1968 parmtype
= build_pointer_type (parmtype
);
1969 arg
= build_this (arg
);
1970 argtype
= lvalue_type (arg
);
1974 /* Core issue 899: When [copy-]initializing a temporary to be bound
1975 to the first parameter of a copy constructor (12.8) called with
1976 a single argument in the context of direct-initialization,
1977 explicit conversion functions are also considered.
1979 So set LOOKUP_COPY_PARM to let reference_binding know that
1980 it's being called in that context. We generalize the above
1981 to handle move constructors and template constructors as well;
1982 the standardese should soon be updated similarly. */
1983 if (ctype
&& i
== 0 && (len
-skip
== 1)
1984 && DECL_CONSTRUCTOR_P (fn
)
1985 && parmtype
!= error_mark_node
1986 && (same_type_ignoring_top_level_qualifiers_p
1987 (non_reference (parmtype
), ctype
)))
1989 if (!(flags
& LOOKUP_ONLYCONVERTING
))
1990 lflags
|= LOOKUP_COPY_PARM
;
1991 /* We allow user-defined conversions within init-lists, but
1992 don't list-initialize the copy parm, as that would mean
1993 using two levels of braces for the same type. */
1994 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
1995 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
1996 lflags
|= LOOKUP_NO_CONVERSION
;
1999 lflags
|= LOOKUP_ONLYCONVERTING
;
2001 t
= implicit_conversion (parmtype
, argtype
, arg
,
2002 /*c_cast_p=*/false, lflags
, complain
);
2007 t
= build_identity_conv (argtype
, arg
);
2008 t
->ellipsis_p
= true;
2019 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
);
2026 reason
= bad_arg_conversion_rejection (first_arg
, i
, argtype
, to_type
);
2031 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2032 access_path
, conversion_path
, viable
, reason
);
2035 /* Create an overload candidate for the conversion function FN which will
2036 be invoked for expression OBJ, producing a pointer-to-function which
2037 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2038 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2039 passed on to implicit_conversion.
2041 Actually, we don't really care about FN; we care about the type it
2042 converts to. There may be multiple conversion functions that will
2043 convert to that type, and we rely on build_user_type_conversion_1 to
2044 choose the best one; so when we create our candidate, we record the type
2045 instead of the function. */
2047 static struct z_candidate
*
2048 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2049 tree first_arg
, const vec
<tree
, va_gc
> *arglist
,
2050 tree access_path
, tree conversion_path
,
2051 tsubst_flags_t complain
)
2053 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2054 int i
, len
, viable
, flags
;
2055 tree parmlist
, parmnode
;
2057 struct rejection_reason
*reason
;
2059 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2060 parmlist
= TREE_TYPE (parmlist
);
2061 parmlist
= TYPE_ARG_TYPES (parmlist
);
2063 len
= vec_safe_length (arglist
) + (first_arg
!= NULL_TREE
? 1 : 0) + 1;
2064 convs
= alloc_conversions (len
);
2065 parmnode
= parmlist
;
2067 flags
= LOOKUP_IMPLICIT
;
2070 /* Don't bother looking up the same type twice. */
2071 if (*candidates
&& (*candidates
)->fn
== totype
)
2074 for (i
= 0; i
< len
; ++i
)
2076 tree arg
, argtype
, convert_type
= NULL_TREE
;
2081 else if (i
== 1 && first_arg
!= NULL_TREE
)
2084 arg
= (*arglist
)[i
- (first_arg
!= NULL_TREE
? 1 : 0) - 1];
2085 argtype
= lvalue_type (arg
);
2089 t
= implicit_conversion (totype
, argtype
, arg
, /*c_cast_p=*/false,
2091 convert_type
= totype
;
2093 else if (parmnode
== void_list_node
)
2097 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2098 /*c_cast_p=*/false, flags
, complain
);
2099 convert_type
= TREE_VALUE (parmnode
);
2103 t
= build_identity_conv (argtype
, arg
);
2104 t
->ellipsis_p
= true;
2105 convert_type
= argtype
;
2115 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, argtype
, convert_type
);
2122 parmnode
= TREE_CHAIN (parmnode
);
2126 || ! sufficient_parms_p (parmnode
))
2128 int remaining
= remaining_arguments (parmnode
);
2130 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2133 return add_candidate (candidates
, totype
, first_arg
, arglist
, len
, convs
,
2134 access_path
, conversion_path
, viable
, reason
);
2138 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2139 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2140 int flags
, tsubst_flags_t complain
)
2147 struct rejection_reason
*reason
= NULL
;
2152 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2153 convs
= alloc_conversions (num_convs
);
2155 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2156 conversion ops are allowed. We handle that here by just checking for
2157 boolean_type_node because other operators don't ask for it. COND_EXPR
2158 also does contextual conversion to bool for the first operand, but we
2159 handle that in build_conditional_expr, and type1 here is operand 2. */
2160 if (type1
!= boolean_type_node
)
2161 flags
|= LOOKUP_ONLYCONVERTING
;
2163 for (i
= 0; i
< 2; ++i
)
2168 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2169 /*c_cast_p=*/false, flags
, complain
);
2173 /* We need something for printing the candidate. */
2174 t
= build_identity_conv (types
[i
], NULL_TREE
);
2175 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2181 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2187 /* For COND_EXPR we rearranged the arguments; undo that now. */
2190 convs
[2] = convs
[1];
2191 convs
[1] = convs
[0];
2192 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2193 /*c_cast_p=*/false, flags
,
2200 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2205 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2207 /*access_path=*/NULL_TREE
,
2208 /*conversion_path=*/NULL_TREE
,
2213 is_complete (tree t
)
2215 return COMPLETE_TYPE_P (complete_type (t
));
2218 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2221 promoted_arithmetic_type_p (tree type
)
2225 In this section, the term promoted integral type is used to refer
2226 to those integral types which are preserved by integral promotion
2227 (including e.g. int and long but excluding e.g. char).
2228 Similarly, the term promoted arithmetic type refers to promoted
2229 integral types plus floating types. */
2230 return ((CP_INTEGRAL_TYPE_P (type
)
2231 && same_type_p (type_promotes_to (type
), type
))
2232 || TREE_CODE (type
) == REAL_TYPE
);
2235 /* Create any builtin operator overload candidates for the operator in
2236 question given the converted operand types TYPE1 and TYPE2. The other
2237 args are passed through from add_builtin_candidates to
2238 build_builtin_candidate.
2240 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2241 If CODE is requires candidates operands of the same type of the kind
2242 of which TYPE1 and TYPE2 are, we add both candidates
2243 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2246 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2247 enum tree_code code2
, tree fnname
, tree type1
,
2248 tree type2
, tree
*args
, tree
*argtypes
, int flags
,
2249 tsubst_flags_t complain
)
2253 case POSTINCREMENT_EXPR
:
2254 case POSTDECREMENT_EXPR
:
2255 args
[1] = integer_zero_node
;
2256 type2
= integer_type_node
;
2265 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2266 and VQ is either volatile or empty, there exist candidate operator
2267 functions of the form
2268 VQ T& operator++(VQ T&);
2269 T operator++(VQ T&, int);
2270 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2271 type other than bool, and VQ is either volatile or empty, there exist
2272 candidate operator functions of the form
2273 VQ T& operator--(VQ T&);
2274 T operator--(VQ T&, int);
2275 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2276 complete object type, and VQ is either volatile or empty, there exist
2277 candidate operator functions of the form
2278 T*VQ& operator++(T*VQ&);
2279 T*VQ& operator--(T*VQ&);
2280 T* operator++(T*VQ&, int);
2281 T* operator--(T*VQ&, int); */
2283 case POSTDECREMENT_EXPR
:
2284 case PREDECREMENT_EXPR
:
2285 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2287 case POSTINCREMENT_EXPR
:
2288 case PREINCREMENT_EXPR
:
2289 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2291 type1
= build_reference_type (type1
);
2296 /* 7 For every cv-qualified or cv-unqualified object type T, there
2297 exist candidate operator functions of the form
2301 8 For every function type T, there exist candidate operator functions of
2303 T& operator*(T*); */
2306 if (TYPE_PTR_P (type1
)
2307 && !uses_template_parms (TREE_TYPE (type1
))
2308 && (TYPE_PTROB_P (type1
)
2309 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2313 /* 9 For every type T, there exist candidate operator functions of the form
2316 10For every promoted arithmetic type T, there exist candidate operator
2317 functions of the form
2321 case UNARY_PLUS_EXPR
: /* unary + */
2322 if (TYPE_PTR_P (type1
))
2325 if (ARITHMETIC_TYPE_P (type1
))
2329 /* 11For every promoted integral type T, there exist candidate operator
2330 functions of the form
2334 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2338 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2339 is the same type as C2 or is a derived class of C2, T is a complete
2340 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2341 there exist candidate operator functions of the form
2342 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2343 where CV12 is the union of CV1 and CV2. */
2346 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2348 tree c1
= TREE_TYPE (type1
);
2349 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2351 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2352 && (TYPE_PTRMEMFUNC_P (type2
)
2353 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2358 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2359 didate operator functions of the form
2364 bool operator<(L, R);
2365 bool operator>(L, R);
2366 bool operator<=(L, R);
2367 bool operator>=(L, R);
2368 bool operator==(L, R);
2369 bool operator!=(L, R);
2370 where LR is the result of the usual arithmetic conversions between
2373 14For every pair of types T and I, where T is a cv-qualified or cv-
2374 unqualified complete object type and I is a promoted integral type,
2375 there exist candidate operator functions of the form
2376 T* operator+(T*, I);
2377 T& operator[](T*, I);
2378 T* operator-(T*, I);
2379 T* operator+(I, T*);
2380 T& operator[](I, T*);
2382 15For every T, where T is a pointer to complete object type, there exist
2383 candidate operator functions of the form112)
2384 ptrdiff_t operator-(T, T);
2386 16For every pointer or enumeration type T, there exist candidate operator
2387 functions of the form
2388 bool operator<(T, T);
2389 bool operator>(T, T);
2390 bool operator<=(T, T);
2391 bool operator>=(T, T);
2392 bool operator==(T, T);
2393 bool operator!=(T, T);
2395 17For every pointer to member type T, there exist candidate operator
2396 functions of the form
2397 bool operator==(T, T);
2398 bool operator!=(T, T); */
2401 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2403 if (TYPE_PTROB_P (type1
)
2404 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2406 type2
= ptrdiff_type_node
;
2410 case TRUNC_DIV_EXPR
:
2411 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2417 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2418 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2420 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2425 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2437 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2439 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2441 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2442 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2444 if (TYPE_PTR_P (type1
)
2445 && null_ptr_cst_p (args
[1])
2446 && !uses_template_parms (type1
))
2451 if (null_ptr_cst_p (args
[0])
2452 && TYPE_PTR_P (type2
)
2453 && !uses_template_parms (type2
))
2461 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2464 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2466 type1
= ptrdiff_type_node
;
2469 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2471 type2
= ptrdiff_type_node
;
2476 /* 18For every pair of promoted integral types L and R, there exist candi-
2477 date operator functions of the form
2484 where LR is the result of the usual arithmetic conversions between
2487 case TRUNC_MOD_EXPR
:
2493 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2497 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2498 type, VQ is either volatile or empty, and R is a promoted arithmetic
2499 type, there exist candidate operator functions of the form
2500 VQ L& operator=(VQ L&, R);
2501 VQ L& operator*=(VQ L&, R);
2502 VQ L& operator/=(VQ L&, R);
2503 VQ L& operator+=(VQ L&, R);
2504 VQ L& operator-=(VQ L&, R);
2506 20For every pair T, VQ), where T is any type and VQ is either volatile
2507 or empty, there exist candidate operator functions of the form
2508 T*VQ& operator=(T*VQ&, T*);
2510 21For every pair T, VQ), where T is a pointer to member type and VQ is
2511 either volatile or empty, there exist candidate operator functions of
2513 VQ T& operator=(VQ T&, T);
2515 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2516 unqualified complete object type, VQ is either volatile or empty, and
2517 I is a promoted integral type, there exist candidate operator func-
2519 T*VQ& operator+=(T*VQ&, I);
2520 T*VQ& operator-=(T*VQ&, I);
2522 23For every triple L, VQ, R), where L is an integral or enumeration
2523 type, VQ is either volatile or empty, and R is a promoted integral
2524 type, there exist candidate operator functions of the form
2526 VQ L& operator%=(VQ L&, R);
2527 VQ L& operator<<=(VQ L&, R);
2528 VQ L& operator>>=(VQ L&, R);
2529 VQ L& operator&=(VQ L&, R);
2530 VQ L& operator^=(VQ L&, R);
2531 VQ L& operator|=(VQ L&, R); */
2538 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2540 type2
= ptrdiff_type_node
;
2544 case TRUNC_DIV_EXPR
:
2545 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2549 case TRUNC_MOD_EXPR
:
2555 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2560 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2562 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2563 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2564 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2565 || ((TYPE_PTRMEMFUNC_P (type1
)
2566 || TYPE_PTR_P (type1
))
2567 && null_ptr_cst_p (args
[1])))
2577 type1
= build_reference_type (type1
);
2583 For every pair of promoted arithmetic types L and R, there
2584 exist candidate operator functions of the form
2586 LR operator?(bool, L, R);
2588 where LR is the result of the usual arithmetic conversions
2589 between types L and R.
2591 For every type T, where T is a pointer or pointer-to-member
2592 type, there exist candidate operator functions of the form T
2593 operator?(bool, T, T); */
2595 if (promoted_arithmetic_type_p (type1
)
2596 && promoted_arithmetic_type_p (type2
))
2600 /* Otherwise, the types should be pointers. */
2601 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2604 /* We don't check that the two types are the same; the logic
2605 below will actually create two candidates; one in which both
2606 parameter types are TYPE1, and one in which both parameter
2612 if (ARITHMETIC_TYPE_P (type1
))
2620 /* If we're dealing with two pointer types or two enumeral types,
2621 we need candidates for both of them. */
2622 if (type2
&& !same_type_p (type1
, type2
)
2623 && TREE_CODE (type1
) == TREE_CODE (type2
)
2624 && (TREE_CODE (type1
) == REFERENCE_TYPE
2625 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2626 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2627 || TYPE_PTRMEMFUNC_P (type1
)
2628 || MAYBE_CLASS_TYPE_P (type1
)
2629 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2631 if (TYPE_PTR_OR_PTRMEM_P (type1
))
2633 tree cptype
= composite_pointer_type (type1
, type2
,
2638 if (cptype
!= error_mark_node
)
2640 build_builtin_candidate
2641 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
2647 build_builtin_candidate
2648 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
2649 build_builtin_candidate
2650 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
2654 build_builtin_candidate
2655 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
2659 type_decays_to (tree type
)
2661 if (TREE_CODE (type
) == ARRAY_TYPE
)
2662 return build_pointer_type (TREE_TYPE (type
));
2663 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2664 return build_pointer_type (type
);
2668 /* There are three conditions of builtin candidates:
2670 1) bool-taking candidates. These are the same regardless of the input.
2671 2) pointer-pair taking candidates. These are generated for each type
2672 one of the input types converts to.
2673 3) arithmetic candidates. According to the standard, we should generate
2674 all of these, but I'm trying not to...
2676 Here we generate a superset of the possible candidates for this particular
2677 case. That is a subset of the full set the standard defines, plus some
2678 other cases which the standard disallows. add_builtin_candidate will
2679 filter out the invalid set. */
2682 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2683 enum tree_code code2
, tree fnname
, tree
*args
,
2684 int flags
, tsubst_flags_t complain
)
2688 tree type
, argtypes
[3], t
;
2689 /* TYPES[i] is the set of possible builtin-operator parameter types
2690 we will consider for the Ith argument. */
2691 vec
<tree
, va_gc
> *types
[2];
2694 for (i
= 0; i
< 3; ++i
)
2697 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2699 argtypes
[i
] = NULL_TREE
;
2704 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2705 and VQ is either volatile or empty, there exist candidate operator
2706 functions of the form
2707 VQ T& operator++(VQ T&); */
2709 case POSTINCREMENT_EXPR
:
2710 case PREINCREMENT_EXPR
:
2711 case POSTDECREMENT_EXPR
:
2712 case PREDECREMENT_EXPR
:
2717 /* 24There also exist candidate operator functions of the form
2718 bool operator!(bool);
2719 bool operator&&(bool, bool);
2720 bool operator||(bool, bool); */
2722 case TRUTH_NOT_EXPR
:
2723 build_builtin_candidate
2724 (candidates
, fnname
, boolean_type_node
,
2725 NULL_TREE
, args
, argtypes
, flags
, complain
);
2728 case TRUTH_ORIF_EXPR
:
2729 case TRUTH_ANDIF_EXPR
:
2730 build_builtin_candidate
2731 (candidates
, fnname
, boolean_type_node
,
2732 boolean_type_node
, args
, argtypes
, flags
, complain
);
2754 types
[0] = make_tree_vector ();
2755 types
[1] = make_tree_vector ();
2757 for (i
= 0; i
< 2; ++i
)
2761 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
2765 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
2768 convs
= lookup_conversions (argtypes
[i
]);
2770 if (code
== COND_EXPR
)
2772 if (real_lvalue_p (args
[i
]))
2773 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
2775 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
2781 for (; convs
; convs
= TREE_CHAIN (convs
))
2783 type
= TREE_TYPE (convs
);
2786 && (TREE_CODE (type
) != REFERENCE_TYPE
2787 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
2790 if (code
== COND_EXPR
&& TREE_CODE (type
) == REFERENCE_TYPE
)
2791 vec_safe_push (types
[i
], type
);
2793 type
= non_reference (type
);
2794 if (i
!= 0 || ! ref1
)
2796 type
= cv_unqualified (type_decays_to (type
));
2797 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
2798 vec_safe_push (types
[i
], type
);
2799 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2800 type
= type_promotes_to (type
);
2803 if (! vec_member (type
, types
[i
]))
2804 vec_safe_push (types
[i
], type
);
2809 if (code
== COND_EXPR
&& real_lvalue_p (args
[i
]))
2810 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
2811 type
= non_reference (argtypes
[i
]);
2812 if (i
!= 0 || ! ref1
)
2814 type
= cv_unqualified (type_decays_to (type
));
2815 if (enum_p
&& UNSCOPED_ENUM_P (type
))
2816 vec_safe_push (types
[i
], type
);
2817 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2818 type
= type_promotes_to (type
);
2820 vec_safe_push (types
[i
], type
);
2824 /* Run through the possible parameter types of both arguments,
2825 creating candidates with those parameter types. */
2826 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
2831 if (!types
[1]->is_empty ())
2832 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
2833 add_builtin_candidate
2834 (candidates
, code
, code2
, fnname
, t
,
2835 u
, args
, argtypes
, flags
, complain
);
2837 add_builtin_candidate
2838 (candidates
, code
, code2
, fnname
, t
,
2839 NULL_TREE
, args
, argtypes
, flags
, complain
);
2842 release_tree_vector (types
[0]);
2843 release_tree_vector (types
[1]);
2847 /* If TMPL can be successfully instantiated as indicated by
2848 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2850 TMPL is the template. EXPLICIT_TARGS are any explicit template
2851 arguments. ARGLIST is the arguments provided at the call-site.
2852 This does not change ARGLIST. The RETURN_TYPE is the desired type
2853 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
2854 as for add_function_candidate. If an OBJ is supplied, FLAGS and
2855 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
2857 static struct z_candidate
*
2858 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
2859 tree ctype
, tree explicit_targs
, tree first_arg
,
2860 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
2861 tree access_path
, tree conversion_path
,
2862 int flags
, tree obj
, unification_kind_t strict
,
2863 tsubst_flags_t complain
)
2865 int ntparms
= DECL_NTPARMS (tmpl
);
2866 tree targs
= make_tree_vec (ntparms
);
2867 unsigned int len
= vec_safe_length (arglist
);
2868 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
2869 unsigned int skip_without_in_chrg
= 0;
2870 tree first_arg_without_in_chrg
= first_arg
;
2871 tree
*args_without_in_chrg
;
2872 unsigned int nargs_without_in_chrg
;
2873 unsigned int ia
, ix
;
2875 struct z_candidate
*cand
;
2877 struct rejection_reason
*reason
= NULL
;
2880 /* We don't do deduction on the in-charge parameter, the VTT
2881 parameter or 'this'. */
2882 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
2884 if (first_arg_without_in_chrg
!= NULL_TREE
)
2885 first_arg_without_in_chrg
= NULL_TREE
;
2887 ++skip_without_in_chrg
;
2890 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
2891 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
2892 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
2894 if (first_arg_without_in_chrg
!= NULL_TREE
)
2895 first_arg_without_in_chrg
= NULL_TREE
;
2897 ++skip_without_in_chrg
;
2900 if (len
< skip_without_in_chrg
)
2903 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
2904 + (len
- skip_without_in_chrg
));
2905 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
2907 if (first_arg_without_in_chrg
!= NULL_TREE
)
2909 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
2912 for (ix
= skip_without_in_chrg
;
2913 vec_safe_iterate (arglist
, ix
, &arg
);
2916 args_without_in_chrg
[ia
] = arg
;
2919 gcc_assert (ia
== nargs_without_in_chrg
);
2921 errs
= errorcount
+sorrycount
;
2922 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
2923 args_without_in_chrg
,
2924 nargs_without_in_chrg
,
2925 return_type
, strict
, flags
, false,
2926 complain
& tf_decltype
);
2928 if (fn
== error_mark_node
)
2930 /* Don't repeat unification later if it already resulted in errors. */
2931 if (errorcount
+sorrycount
== errs
)
2932 reason
= template_unification_rejection (tmpl
, explicit_targs
,
2933 targs
, args_without_in_chrg
,
2934 nargs_without_in_chrg
,
2935 return_type
, strict
, flags
);
2937 reason
= template_unification_error_rejection ();
2943 A member function template is never instantiated to perform the
2944 copy of a class object to an object of its class type.
2946 It's a little unclear what this means; the standard explicitly
2947 does allow a template to be used to copy a class. For example,
2952 template <class T> A(const T&);
2955 void g () { A a (f ()); }
2957 the member template will be used to make the copy. The section
2958 quoted above appears in the paragraph that forbids constructors
2959 whose only parameter is (a possibly cv-qualified variant of) the
2960 class type, and a logical interpretation is that the intent was
2961 to forbid the instantiation of member templates which would then
2963 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
2965 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
2966 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
2969 reason
= invalid_copy_with_fn_template_rejection ();
2974 if (obj
!= NULL_TREE
)
2975 /* Aha, this is a conversion function. */
2976 cand
= add_conv_candidate (candidates
, fn
, obj
, first_arg
, arglist
,
2977 access_path
, conversion_path
, complain
);
2979 cand
= add_function_candidate (candidates
, fn
, ctype
,
2980 first_arg
, arglist
, access_path
,
2981 conversion_path
, flags
, complain
);
2982 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
2983 /* This situation can occur if a member template of a template
2984 class is specialized. Then, instantiate_template might return
2985 an instantiation of the specialization, in which case the
2986 DECL_TI_TEMPLATE field will point at the original
2987 specialization. For example:
2989 template <class T> struct S { template <class U> void f(U);
2990 template <> void f(int) {}; };
2994 Here, TMPL will be template <class U> S<double>::f(U).
2995 And, instantiate template will give us the specialization
2996 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
2997 for this will point at template <class T> template <> S<T>::f(int),
2998 so that we can find the definition. For the purposes of
2999 overload resolution, however, we want the original TMPL. */
3000 cand
->template_decl
= build_template_info (tmpl
, targs
);
3002 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3003 cand
->explicit_targs
= explicit_targs
;
3007 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3008 access_path
, conversion_path
, 0, reason
);
3012 static struct z_candidate
*
3013 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3014 tree explicit_targs
, tree first_arg
,
3015 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3016 tree access_path
, tree conversion_path
, int flags
,
3017 unification_kind_t strict
, tsubst_flags_t complain
)
3020 add_template_candidate_real (candidates
, tmpl
, ctype
,
3021 explicit_targs
, first_arg
, arglist
,
3022 return_type
, access_path
, conversion_path
,
3023 flags
, NULL_TREE
, strict
, complain
);
3027 static struct z_candidate
*
3028 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3029 tree obj
, tree first_arg
,
3030 const vec
<tree
, va_gc
> *arglist
,
3031 tree return_type
, tree access_path
,
3032 tree conversion_path
, tsubst_flags_t complain
)
3035 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3036 first_arg
, arglist
, return_type
, access_path
,
3037 conversion_path
, 0, obj
, DEDUCE_CONV
,
3041 /* The CANDS are the set of candidates that were considered for
3042 overload resolution. Return the set of viable candidates, or CANDS
3043 if none are viable. If any of the candidates were viable, set
3044 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3045 considered viable only if it is strictly viable. */
3047 static struct z_candidate
*
3048 splice_viable (struct z_candidate
*cands
,
3052 struct z_candidate
*viable
;
3053 struct z_candidate
**last_viable
;
3054 struct z_candidate
**cand
;
3056 /* Be strict inside templates, since build_over_call won't actually
3057 do the conversions to get pedwarns. */
3058 if (processing_template_decl
)
3062 last_viable
= &viable
;
3063 *any_viable_p
= false;
3068 struct z_candidate
*c
= *cand
;
3069 if (strict_p
? c
->viable
== 1 : c
->viable
)
3074 last_viable
= &c
->next
;
3075 *any_viable_p
= true;
3081 return viable
? viable
: cands
;
3085 any_strictly_viable (struct z_candidate
*cands
)
3087 for (; cands
; cands
= cands
->next
)
3088 if (cands
->viable
== 1)
3093 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3094 words, it is about to become the "this" pointer for a member
3095 function call. Take the address of the object. */
3098 build_this (tree obj
)
3100 /* In a template, we are only concerned about the type of the
3101 expression, so we can take a shortcut. */
3102 if (processing_template_decl
)
3103 return build_address (obj
);
3105 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3108 /* Returns true iff functions are equivalent. Equivalent functions are
3109 not '==' only if one is a function-local extern function or if
3110 both are extern "C". */
3113 equal_functions (tree fn1
, tree fn2
)
3115 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3117 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3119 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3120 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3121 return decls_match (fn1
, fn2
);
3125 /* Print information about a candidate being rejected due to INFO. */
3128 print_conversion_rejection (location_t loc
, struct conversion_info
*info
)
3130 if (info
->n_arg
== -1)
3131 /* Conversion of implicit `this' argument failed. */
3132 inform (loc
, " no known conversion for implicit "
3133 "%<this%> parameter from %qT to %qT",
3134 info
->from_type
, info
->to_type
);
3136 inform (loc
, " no known conversion for argument %d from %qT to %qT",
3137 info
->n_arg
+1, info
->from_type
, info
->to_type
);
3140 /* Print information about a candidate with WANT parameters and we found
3144 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3146 inform_n (loc
, want
,
3147 " candidate expects %d argument, %d provided",
3148 " candidate expects %d arguments, %d provided",
3152 /* Print information about one overload candidate CANDIDATE. MSGSTR
3153 is the text to print before the candidate itself.
3155 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3156 to have been run through gettext by the caller. This wart makes
3157 life simpler in print_z_candidates and for the translators. */
3160 print_z_candidate (location_t loc
, const char *msgstr
,
3161 struct z_candidate
*candidate
)
3163 const char *msg
= (msgstr
== NULL
3165 : ACONCAT ((msgstr
, " ", NULL
)));
3166 location_t cloc
= location_of (candidate
->fn
);
3168 if (identifier_p (candidate
->fn
))
3171 if (candidate
->num_convs
== 3)
3172 inform (cloc
, "%s%D(%T, %T, %T) <built-in>", msg
, candidate
->fn
,
3173 candidate
->convs
[0]->type
,
3174 candidate
->convs
[1]->type
,
3175 candidate
->convs
[2]->type
);
3176 else if (candidate
->num_convs
== 2)
3177 inform (cloc
, "%s%D(%T, %T) <built-in>", msg
, candidate
->fn
,
3178 candidate
->convs
[0]->type
,
3179 candidate
->convs
[1]->type
);
3181 inform (cloc
, "%s%D(%T) <built-in>", msg
, candidate
->fn
,
3182 candidate
->convs
[0]->type
);
3184 else if (TYPE_P (candidate
->fn
))
3185 inform (cloc
, "%s%T <conversion>", msg
, candidate
->fn
);
3186 else if (candidate
->viable
== -1)
3187 inform (cloc
, "%s%#D <near match>", msg
, candidate
->fn
);
3188 else if (DECL_DELETED_FN (STRIP_TEMPLATE (candidate
->fn
)))
3189 inform (cloc
, "%s%#D <deleted>", msg
, candidate
->fn
);
3191 inform (cloc
, "%s%#D", msg
, candidate
->fn
);
3192 /* Give the user some information about why this candidate failed. */
3193 if (candidate
->reason
!= NULL
)
3195 struct rejection_reason
*r
= candidate
->reason
;
3200 print_arity_information (cloc
, r
->u
.arity
.actual
,
3201 r
->u
.arity
.expected
);
3203 case rr_arg_conversion
:
3204 print_conversion_rejection (cloc
, &r
->u
.conversion
);
3206 case rr_bad_arg_conversion
:
3207 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
);
3209 case rr_explicit_conversion
:
3210 inform (cloc
, " return type %qT of explicit conversion function "
3211 "cannot be converted to %qT with a qualification "
3212 "conversion", r
->u
.conversion
.from_type
,
3213 r
->u
.conversion
.to_type
);
3215 case rr_template_conversion
:
3216 inform (cloc
, " conversion from return type %qT of template "
3217 "conversion function specialization to %qT is not an "
3218 "exact match", r
->u
.conversion
.from_type
,
3219 r
->u
.conversion
.to_type
);
3221 case rr_template_unification
:
3222 /* We use template_unification_error_rejection if unification caused
3223 actual non-SFINAE errors, in which case we don't need to repeat
3225 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3227 inform (cloc
, " substitution of deduced template arguments "
3228 "resulted in errors seen above");
3231 /* Re-run template unification with diagnostics. */
3232 inform (cloc
, " template argument deduction/substitution failed:");
3233 fn_type_unification (r
->u
.template_unification
.tmpl
,
3234 r
->u
.template_unification
.explicit_targs
,
3236 (r
->u
.template_unification
.num_targs
)),
3237 r
->u
.template_unification
.args
,
3238 r
->u
.template_unification
.nargs
,
3239 r
->u
.template_unification
.return_type
,
3240 r
->u
.template_unification
.strict
,
3241 r
->u
.template_unification
.flags
,
3244 case rr_invalid_copy
:
3246 " a constructor taking a single argument of its own "
3247 "class type is invalid");
3251 /* This candidate didn't have any issues or we failed to
3252 handle a particular code. Either way... */
3259 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3261 struct z_candidate
*cand1
;
3262 struct z_candidate
**cand2
;
3268 /* Remove non-viable deleted candidates. */
3270 for (cand2
= &cand1
; *cand2
; )
3272 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3273 && !(*cand2
)->viable
3274 && DECL_DELETED_FN ((*cand2
)->fn
))
3275 *cand2
= (*cand2
)->next
;
3277 cand2
= &(*cand2
)->next
;
3279 /* ...if there are any non-deleted ones. */
3283 /* There may be duplicates in the set of candidates. We put off
3284 checking this condition as long as possible, since we have no way
3285 to eliminate duplicates from a set of functions in less than n^2
3286 time. Now we are about to emit an error message, so it is more
3287 permissible to go slowly. */
3288 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3290 tree fn
= cand1
->fn
;
3291 /* Skip builtin candidates and conversion functions. */
3294 cand2
= &cand1
->next
;
3297 if (DECL_P ((*cand2
)->fn
)
3298 && equal_functions (fn
, (*cand2
)->fn
))
3299 *cand2
= (*cand2
)->next
;
3301 cand2
= &(*cand2
)->next
;
3305 for (n_candidates
= 0, cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3308 inform_n (loc
, n_candidates
, "candidate is:", "candidates are:");
3309 for (; candidates
; candidates
= candidates
->next
)
3310 print_z_candidate (loc
, NULL
, candidates
);
3313 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3314 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3315 the result of the conversion function to convert it to the final
3316 desired type. Merge the two sequences into a single sequence,
3317 and return the merged sequence. */
3320 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3323 bool bad
= user_seq
->bad_p
;
3325 gcc_assert (user_seq
->kind
== ck_user
);
3327 /* Find the end of the second conversion sequence. */
3328 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3330 /* The entire sequence is a user-conversion sequence. */
3331 (*t
)->user_conv_p
= true;
3336 /* Replace the identity conversion with the user conversion
3343 /* Handle overload resolution for initializing an object of class type from
3344 an initializer list. First we look for a suitable constructor that
3345 takes a std::initializer_list; if we don't find one, we then look for a
3346 non-list constructor.
3348 Parameters are as for add_candidates, except that the arguments are in
3349 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3350 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3353 add_list_candidates (tree fns
, tree first_arg
,
3354 tree init_list
, tree totype
,
3355 tree explicit_targs
, bool template_only
,
3356 tree conversion_path
, tree access_path
,
3358 struct z_candidate
**candidates
,
3359 tsubst_flags_t complain
)
3361 vec
<tree
, va_gc
> *args
;
3363 gcc_assert (*candidates
== NULL
);
3365 /* We're looking for a ctor for list-initialization. */
3366 flags
|= LOOKUP_LIST_INIT_CTOR
;
3367 /* And we don't allow narrowing conversions. We also use this flag to
3368 avoid the copy constructor call for copy-list-initialization. */
3369 flags
|= LOOKUP_NO_NARROWING
;
3371 /* Always use the default constructor if the list is empty (DR 990). */
3372 if (CONSTRUCTOR_NELTS (init_list
) == 0
3373 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3375 /* If the class has a list ctor, try passing the list as a single
3376 argument first, but only consider list ctors. */
3377 else if (TYPE_HAS_LIST_CTOR (totype
))
3379 flags
|= LOOKUP_LIST_ONLY
;
3380 args
= make_tree_vector_single (init_list
);
3381 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3382 explicit_targs
, template_only
, conversion_path
,
3383 access_path
, flags
, candidates
, complain
);
3384 if (any_strictly_viable (*candidates
))
3388 args
= ctor_to_vec (init_list
);
3390 /* We aren't looking for list-ctors anymore. */
3391 flags
&= ~LOOKUP_LIST_ONLY
;
3392 /* We allow more user-defined conversions within an init-list. */
3393 flags
&= ~LOOKUP_NO_CONVERSION
;
3395 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3396 explicit_targs
, template_only
, conversion_path
,
3397 access_path
, flags
, candidates
, complain
);
3400 /* Returns the best overload candidate to perform the requested
3401 conversion. This function is used for three the overloading situations
3402 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3403 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3404 per [dcl.init.ref], so we ignore temporary bindings. */
3406 static struct z_candidate
*
3407 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3408 tsubst_flags_t complain
)
3410 struct z_candidate
*candidates
, *cand
;
3412 tree ctors
= NULL_TREE
;
3413 tree conv_fns
= NULL_TREE
;
3414 conversion
*conv
= NULL
;
3415 tree first_arg
= NULL_TREE
;
3416 vec
<tree
, va_gc
> *args
= NULL
;
3423 fromtype
= TREE_TYPE (expr
);
3425 /* We represent conversion within a hierarchy using RVALUE_CONV and
3426 BASE_CONV, as specified by [over.best.ics]; these become plain
3427 constructor calls, as specified in [dcl.init]. */
3428 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3429 || !DERIVED_FROM_P (totype
, fromtype
));
3431 if (MAYBE_CLASS_TYPE_P (totype
))
3432 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3433 creating a garbage BASELINK; constructors can't be inherited. */
3434 ctors
= lookup_fnfields_slot (totype
, complete_ctor_identifier
);
3436 if (MAYBE_CLASS_TYPE_P (fromtype
))
3438 tree to_nonref
= non_reference (totype
);
3439 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3440 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3441 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3443 /* [class.conv.fct] A conversion function is never used to
3444 convert a (possibly cv-qualified) object to the (possibly
3445 cv-qualified) same object type (or a reference to it), to a
3446 (possibly cv-qualified) base class of that type (or a
3447 reference to it)... */
3450 conv_fns
= lookup_conversions (fromtype
);
3454 flags
|= LOOKUP_NO_CONVERSION
;
3455 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3456 flags
|= LOOKUP_NO_NARROWING
;
3458 /* It's OK to bind a temporary for converting constructor arguments, but
3459 not in converting the return value of a conversion operator. */
3460 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
);
3461 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3465 int ctorflags
= flags
;
3467 first_arg
= build_int_cst (build_pointer_type (totype
), 0);
3468 first_arg
= build_fold_indirect_ref (first_arg
);
3470 /* We should never try to call the abstract or base constructor
3472 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors
))
3473 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors
)));
3475 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3477 /* List-initialization. */
3478 add_list_candidates (ctors
, first_arg
, expr
, totype
, NULL_TREE
,
3479 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3480 ctorflags
, &candidates
, complain
);
3484 args
= make_tree_vector_single (expr
);
3485 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3486 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3487 ctorflags
, &candidates
, complain
);
3490 for (cand
= candidates
; cand
; cand
= cand
->next
)
3492 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3494 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3495 set, then this is copy-initialization. In that case, "The
3496 result of the call is then used to direct-initialize the
3497 object that is the destination of the copy-initialization."
3500 We represent this in the conversion sequence with an
3501 rvalue conversion, which means a constructor call. */
3502 if (TREE_CODE (totype
) != REFERENCE_TYPE
3503 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3505 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3512 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3514 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3515 struct z_candidate
*old_candidates
;
3517 /* If we are called to convert to a reference type, we are trying to
3518 find a direct binding, so don't even consider temporaries. If
3519 we don't find a direct binding, the caller will try again to
3520 look for a temporary binding. */
3521 if (TREE_CODE (totype
) == REFERENCE_TYPE
)
3522 convflags
|= LOOKUP_NO_TEMP_BIND
;
3524 old_candidates
= candidates
;
3525 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
3527 conversion_path
, TYPE_BINFO (fromtype
),
3528 flags
, &candidates
, complain
);
3530 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
3532 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
3534 = implicit_conversion (totype
,
3537 /*c_cast_p=*/false, convflags
,
3540 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3541 copy-initialization. In that case, "The result of the
3542 call is then used to direct-initialize the object that is
3543 the destination of the copy-initialization." [dcl.init]
3545 We represent this in the conversion sequence with an
3546 rvalue conversion, which means a constructor call. But
3547 don't add a second rvalue conversion if there's already
3548 one there. Which there really shouldn't be, but it's
3549 harmless since we'd add it here anyway. */
3550 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
3551 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3552 ics
= build_conv (ck_rvalue
, totype
, ics
);
3554 cand
->second_conv
= ics
;
3559 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -1,
3562 else if (DECL_NONCONVERTING_P (cand
->fn
)
3563 && ics
->rank
> cr_exact
)
3565 /* 13.3.1.5: For direct-initialization, those explicit
3566 conversion functions that are not hidden within S and
3567 yield type T or a type that can be converted to type T
3568 with a qualification conversion (4.4) are also candidate
3570 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3571 I've raised this issue with the committee. --jason 9/2011 */
3573 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
3575 else if (cand
->viable
== 1 && ics
->bad_p
)
3579 = bad_arg_conversion_rejection (NULL_TREE
, -1,
3582 else if (primary_template_instantiation_p (cand
->fn
)
3583 && ics
->rank
> cr_exact
)
3585 /* 13.3.3.1.2: If the user-defined conversion is specified by
3586 a specialization of a conversion function template, the
3587 second standard conversion sequence shall have exact match
3590 cand
->reason
= template_conversion_rejection (rettype
, totype
);
3595 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
3599 release_tree_vector (args
);
3603 cand
= tourney (candidates
, complain
);
3606 if (complain
& tf_error
)
3608 error ("conversion from %qT to %qT is ambiguous",
3610 print_z_candidates (location_of (expr
), candidates
);
3613 cand
= candidates
; /* any one will do */
3614 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
3615 cand
->second_conv
->user_conv_p
= true;
3616 if (!any_strictly_viable (candidates
))
3617 cand
->second_conv
->bad_p
= true;
3618 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3619 ambiguous conversion is no worse than another user-defined
3625 /* Build the user conversion sequence. */
3628 (DECL_CONSTRUCTOR_P (cand
->fn
)
3629 ? totype
: non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)))),
3630 build_identity_conv (TREE_TYPE (expr
), expr
));
3632 if (cand
->viable
== -1)
3635 /* Remember that this was a list-initialization. */
3636 if (flags
& LOOKUP_NO_NARROWING
)
3637 conv
->check_narrowing
= true;
3639 /* Combine it with the second conversion sequence. */
3640 cand
->second_conv
= merge_conversion_sequences (conv
,
3646 /* Wrapper for above. */
3649 build_user_type_conversion (tree totype
, tree expr
, int flags
,
3650 tsubst_flags_t complain
)
3652 struct z_candidate
*cand
;
3655 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
3656 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
3660 if (cand
->second_conv
->kind
== ck_ambig
)
3661 ret
= error_mark_node
;
3664 expr
= convert_like (cand
->second_conv
, expr
, complain
);
3665 ret
= convert_from_reference (expr
);
3671 timevar_cond_stop (TV_OVERLOAD
, subtime
);
3675 /* Subroutine of convert_nontype_argument.
3677 EXPR is an argument for a template non-type parameter of integral or
3678 enumeration type. Do any necessary conversions (that are permitted for
3679 non-type arguments) to convert it to the parameter type.
3681 If conversion is successful, returns the converted expression;
3682 otherwise, returns error_mark_node. */
3685 build_integral_nontype_arg_conv (tree type
, tree expr
, tsubst_flags_t complain
)
3690 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
3692 if (error_operand_p (expr
))
3693 return error_mark_node
;
3695 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
3697 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3698 p
= conversion_obstack_alloc (0);
3700 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
3702 LOOKUP_IMPLICIT
, complain
);
3704 /* for a non-type template-parameter of integral or
3705 enumeration type, integral promotions (4.5) and integral
3706 conversions (4.7) are applied. */
3707 /* It should be sufficient to check the outermost conversion step, since
3708 there are no qualification conversions to integer type. */
3712 /* A conversion function is OK. If it isn't constexpr, we'll
3713 complain later that the argument isn't constant. */
3715 /* The lvalue-to-rvalue conversion is OK. */
3721 t
= next_conversion (conv
)->type
;
3722 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
))
3725 if (complain
& tf_error
)
3726 error_at (loc
, "conversion from %qT to %qT not considered for "
3727 "non-type template argument", t
, type
);
3728 /* and fall through. */
3736 expr
= convert_like (conv
, expr
, complain
);
3738 expr
= error_mark_node
;
3740 /* Free all the conversions we allocated. */
3741 obstack_free (&conversion_obstack
, p
);
3746 /* Do any initial processing on the arguments to a function call. */
3748 static vec
<tree
, va_gc
> *
3749 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
3754 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
3756 if (error_operand_p (arg
))
3758 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
3760 if (complain
& tf_error
)
3761 error ("invalid use of void expression");
3764 else if (invalid_nonstatic_memfn_p (arg
, complain
))
3770 /* Perform overload resolution on FN, which is called with the ARGS.
3772 Return the candidate function selected by overload resolution, or
3773 NULL if the event that overload resolution failed. In the case
3774 that overload resolution fails, *CANDIDATES will be the set of
3775 candidates considered, and ANY_VIABLE_P will be set to true or
3776 false to indicate whether or not any of the candidates were
3779 The ARGS should already have gone through RESOLVE_ARGS before this
3780 function is called. */
3782 static struct z_candidate
*
3783 perform_overload_resolution (tree fn
,
3784 const vec
<tree
, va_gc
> *args
,
3785 struct z_candidate
**candidates
,
3786 bool *any_viable_p
, tsubst_flags_t complain
)
3788 struct z_candidate
*cand
;
3789 tree explicit_targs
;
3792 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
3794 explicit_targs
= NULL_TREE
;
3798 *any_viable_p
= true;
3801 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
3802 || TREE_CODE (fn
) == TEMPLATE_DECL
3803 || TREE_CODE (fn
) == OVERLOAD
3804 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
3806 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3808 explicit_targs
= TREE_OPERAND (fn
, 1);
3809 fn
= TREE_OPERAND (fn
, 0);
3813 /* Add the various candidate functions. */
3814 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
3815 explicit_targs
, template_only
,
3816 /*conversion_path=*/NULL_TREE
,
3817 /*access_path=*/NULL_TREE
,
3819 candidates
, complain
);
3821 *candidates
= splice_viable (*candidates
, pedantic
, any_viable_p
);
3823 cand
= tourney (*candidates
, complain
);
3827 timevar_cond_stop (TV_OVERLOAD
, subtime
);
3831 /* Print an error message about being unable to build a call to FN with
3832 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
3833 be located; CANDIDATES is a possibly empty list of such
3837 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
, bool any_viable_p
,
3838 struct z_candidate
*candidates
)
3840 tree name
= DECL_NAME (OVL_CURRENT (fn
));
3841 location_t loc
= location_of (name
);
3844 error_at (loc
, "no matching function for call to %<%D(%A)%>",
3845 name
, build_tree_list_vec (args
));
3847 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
3848 name
, build_tree_list_vec (args
));
3850 print_z_candidates (loc
, candidates
);
3853 /* Return an expression for a call to FN (a namespace-scope function,
3854 or a static member function) with the ARGS. This may change
3858 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
, bool koenig_p
,
3859 tsubst_flags_t complain
)
3861 struct z_candidate
*candidates
, *cand
;
3866 if (args
!= NULL
&& *args
!= NULL
)
3868 *args
= resolve_args (*args
, complain
);
3870 return error_mark_node
;
3874 tm_malloc_replacement (fn
);
3876 /* If this function was found without using argument dependent
3877 lookup, then we want to ignore any undeclared friend
3883 fn
= remove_hidden_names (fn
);
3886 if (complain
& tf_error
)
3887 print_error_for_call_failure (orig_fn
, *args
, false, NULL
);
3888 return error_mark_node
;
3892 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3893 p
= conversion_obstack_alloc (0);
3895 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
3900 if (complain
& tf_error
)
3902 if (!any_viable_p
&& candidates
&& ! candidates
->next
3903 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
3904 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
3905 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3906 fn
= TREE_OPERAND (fn
, 0);
3907 print_error_for_call_failure (fn
, *args
, any_viable_p
, candidates
);
3909 result
= error_mark_node
;
3913 int flags
= LOOKUP_NORMAL
;
3914 /* If fn is template_id_expr, the call has explicit template arguments
3915 (e.g. func<int>(5)), communicate this info to build_over_call
3916 through flags so that later we can use it to decide whether to warn
3917 about peculiar null pointer conversion. */
3918 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3919 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
3920 result
= build_over_call (cand
, flags
, complain
);
3923 /* Free all the conversions we allocated. */
3924 obstack_free (&conversion_obstack
, p
);
3929 /* Build a call to a global operator new. FNNAME is the name of the
3930 operator (either "operator new" or "operator new[]") and ARGS are
3931 the arguments provided. This may change ARGS. *SIZE points to the
3932 total number of bytes required by the allocation, and is updated if
3933 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
3934 be used. If this function determines that no cookie should be
3935 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
3936 is not NULL_TREE, it is evaluated before calculating the final
3937 array size, and if it fails, the array size is replaced with
3938 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
3939 is non-NULL, it will be set, upon return, to the allocation
3943 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
3944 tree
*size
, tree
*cookie_size
, tree size_check
,
3945 tree
*fn
, tsubst_flags_t complain
)
3947 tree original_size
= *size
;
3949 struct z_candidate
*candidates
;
3950 struct z_candidate
*cand
;
3955 /* Set to (size_t)-1 if the size check fails. */
3956 if (size_check
!= NULL_TREE
)
3958 tree errval
= TYPE_MAX_VALUE (sizetype
);
3959 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
3960 errval
= throw_bad_array_new_length ();
3961 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
3962 original_size
, errval
);
3964 vec_safe_insert (*args
, 0, *size
);
3965 *args
= resolve_args (*args
, complain
);
3967 return error_mark_node
;
3973 If this lookup fails to find the name, or if the allocated type
3974 is not a class type, the allocation function's name is looked
3975 up in the global scope.
3977 we disregard block-scope declarations of "operator new". */
3978 fns
= lookup_function_nonclass (fnname
, *args
, /*block_p=*/false);
3980 /* Figure out what function is being called. */
3981 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
3984 /* If no suitable function could be found, issue an error message
3988 if (complain
& tf_error
)
3989 print_error_for_call_failure (fns
, *args
, any_viable_p
, candidates
);
3990 return error_mark_node
;
3993 /* If a cookie is required, add some extra space. Whether
3994 or not a cookie is required cannot be determined until
3995 after we know which function was called. */
3998 bool use_cookie
= true;
3999 if (!abi_version_at_least (2))
4001 /* In G++ 3.2, the check was implemented incorrectly; it
4002 looked at the placement expression, rather than the
4003 type of the function. */
4004 if ((*args
)->length () == 2
4005 && same_type_p (TREE_TYPE ((**args
)[1]), ptr_type_node
))
4012 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4013 /* Skip the size_t parameter. */
4014 arg_types
= TREE_CHAIN (arg_types
);
4015 /* Check the remaining parameters (if any). */
4017 && TREE_CHAIN (arg_types
) == void_list_node
4018 && same_type_p (TREE_VALUE (arg_types
),
4022 /* If we need a cookie, adjust the number of bytes allocated. */
4025 /* Update the total size. */
4026 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4027 /* Set to (size_t)-1 if the size check fails. */
4028 gcc_assert (size_check
!= NULL_TREE
);
4029 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4030 *size
, TYPE_MAX_VALUE (sizetype
));
4031 /* Update the argument list to reflect the adjusted size. */
4032 (**args
)[0] = *size
;
4035 *cookie_size
= NULL_TREE
;
4038 /* Tell our caller which function we decided to call. */
4042 /* Build the CALL_EXPR. */
4043 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4046 /* Build a new call to operator(). This may change ARGS. */
4049 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4051 struct z_candidate
*candidates
= 0, *cand
;
4052 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4053 tree type
= TREE_TYPE (obj
);
4055 tree result
= NULL_TREE
;
4058 if (error_operand_p (obj
))
4059 return error_mark_node
;
4061 obj
= prep_operand (obj
);
4063 if (TYPE_PTRMEMFUNC_P (type
))
4065 if (complain
& tf_error
)
4066 /* It's no good looking for an overloaded operator() on a
4067 pointer-to-member-function. */
4068 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj
);
4069 return error_mark_node
;
4072 if (TYPE_BINFO (type
))
4074 fns
= lookup_fnfields (TYPE_BINFO (type
), ansi_opname (CALL_EXPR
), 1);
4075 if (fns
== error_mark_node
)
4076 return error_mark_node
;
4081 if (args
!= NULL
&& *args
!= NULL
)
4083 *args
= resolve_args (*args
, complain
);
4085 return error_mark_node
;
4088 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4089 p
= conversion_obstack_alloc (0);
4093 first_mem_arg
= obj
;
4095 add_candidates (BASELINK_FUNCTIONS (fns
),
4096 first_mem_arg
, *args
, NULL_TREE
,
4098 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4099 LOOKUP_NORMAL
, &candidates
, complain
);
4102 convs
= lookup_conversions (type
);
4104 for (; convs
; convs
= TREE_CHAIN (convs
))
4106 tree fns
= TREE_VALUE (convs
);
4107 tree totype
= TREE_TYPE (convs
);
4109 if (TYPE_PTRFN_P (totype
)
4110 || TYPE_REFFN_P (totype
)
4111 || (TREE_CODE (totype
) == REFERENCE_TYPE
4112 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4113 for (; fns
; fns
= OVL_NEXT (fns
))
4115 tree fn
= OVL_CURRENT (fns
);
4117 if (DECL_NONCONVERTING_P (fn
))
4120 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4121 add_template_conv_candidate
4122 (&candidates
, fn
, obj
, NULL_TREE
, *args
, totype
,
4123 /*access_path=*/NULL_TREE
,
4124 /*conversion_path=*/NULL_TREE
, complain
);
4126 add_conv_candidate (&candidates
, fn
, obj
, NULL_TREE
,
4127 *args
, /*conversion_path=*/NULL_TREE
,
4128 /*access_path=*/NULL_TREE
, complain
);
4132 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
4135 if (complain
& tf_error
)
4137 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4138 build_tree_list_vec (*args
));
4139 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4141 result
= error_mark_node
;
4145 cand
= tourney (candidates
, complain
);
4148 if (complain
& tf_error
)
4150 error ("call of %<(%T) (%A)%> is ambiguous",
4151 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4152 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4154 result
= error_mark_node
;
4156 /* Since cand->fn will be a type, not a function, for a conversion
4157 function, we must be careful not to unconditionally look at
4159 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4160 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
) == CALL_EXPR
)
4161 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4164 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
, -1,
4166 obj
= convert_from_reference (obj
);
4167 result
= cp_build_function_call_vec (obj
, args
, complain
);
4171 /* Free all the conversions we allocated. */
4172 obstack_free (&conversion_obstack
, p
);
4177 /* Wrapper for above. */
4180 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4183 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4184 ret
= build_op_call_1 (obj
, args
, complain
);
4185 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4189 /* Called by op_error to prepare format strings suitable for the error
4190 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4191 and a suffix (controlled by NTYPES). */
4194 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4198 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4199 : G_("no match for "), errmsg
, NULL
);
4202 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4203 else if (ntypes
== 2)
4204 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4206 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4212 op_error (location_t loc
, enum tree_code code
, enum tree_code code2
,
4213 tree arg1
, tree arg2
, tree arg3
, bool match
)
4217 if (code
== MODIFY_EXPR
)
4218 opname
= assignment_operator_name_info
[code2
].name
;
4220 opname
= operator_name_info
[code
].name
;
4225 if (flag_diagnostics_show_caret
)
4226 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4228 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4230 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4231 "in %<%E ? %E : %E%>"), 3, match
),
4233 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4236 case POSTINCREMENT_EXPR
:
4237 case POSTDECREMENT_EXPR
:
4238 if (flag_diagnostics_show_caret
)
4239 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4240 opname
, TREE_TYPE (arg1
));
4242 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4244 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4248 if (flag_diagnostics_show_caret
)
4249 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4250 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4252 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4254 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4259 if (flag_diagnostics_show_caret
)
4260 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4261 opname
, TREE_TYPE (arg1
));
4263 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4264 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4269 if (flag_diagnostics_show_caret
)
4270 error_at (loc
, op_error_string (G_("%<operator%s%>"), 2, match
),
4271 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4273 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4275 opname
, arg1
, opname
, arg2
,
4276 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4278 if (flag_diagnostics_show_caret
)
4279 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4280 opname
, TREE_TYPE (arg1
));
4282 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4284 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4289 /* Return the implicit conversion sequence that could be used to
4290 convert E1 to E2 in [expr.cond]. */
4293 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4295 tree t1
= non_reference (TREE_TYPE (e1
));
4296 tree t2
= non_reference (TREE_TYPE (e2
));
4302 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4303 implicitly converted (clause _conv_) to the type "lvalue reference to
4304 T2", subject to the constraint that in the conversion the
4305 reference must bind directly (_dcl.init.ref_) to an lvalue. */
4306 if (real_lvalue_p (e2
))
4308 conv
= implicit_conversion (build_reference_type (t2
),
4312 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4313 |LOOKUP_ONLYCONVERTING
,
4321 If E1 and E2 have class type, and the underlying class types are
4322 the same or one is a base class of the other: E1 can be converted
4323 to match E2 if the class of T2 is the same type as, or a base
4324 class of, the class of T1, and the cv-qualification of T2 is the
4325 same cv-qualification as, or a greater cv-qualification than, the
4326 cv-qualification of T1. If the conversion is applied, E1 is
4327 changed to an rvalue of type T2 that still refers to the original
4328 source class object (or the appropriate subobject thereof). */
4329 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4330 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4332 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4334 conv
= build_identity_conv (t1
, e1
);
4335 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4336 TYPE_MAIN_VARIANT (t2
)))
4337 conv
= build_conv (ck_base
, t2
, conv
);
4339 conv
= build_conv (ck_rvalue
, t2
, conv
);
4348 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4349 converted to the type that expression E2 would have if E2 were
4350 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4351 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4352 LOOKUP_IMPLICIT
, complain
);
4355 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4356 arguments to the conditional expression. */
4359 build_conditional_expr_1 (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
4360 tsubst_flags_t complain
)
4364 tree result
= NULL_TREE
;
4365 tree result_type
= NULL_TREE
;
4366 bool lvalue_p
= true;
4367 struct z_candidate
*candidates
= 0;
4368 struct z_candidate
*cand
;
4370 tree orig_arg2
, orig_arg3
;
4372 /* As a G++ extension, the second argument to the conditional can be
4373 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4374 c'.) If the second operand is omitted, make sure it is
4375 calculated only once. */
4378 if (complain
& tf_error
)
4379 pedwarn (loc
, OPT_Wpedantic
,
4380 "ISO C++ forbids omitting the middle term of a ?: expression");
4382 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4383 if (real_lvalue_p (arg1
))
4384 arg2
= arg1
= stabilize_reference (arg1
);
4386 arg2
= arg1
= save_expr (arg1
);
4389 /* If something has already gone wrong, just pass that fact up the
4391 if (error_operand_p (arg1
)
4392 || error_operand_p (arg2
)
4393 || error_operand_p (arg3
))
4394 return error_mark_node
;
4399 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
4401 arg1
= force_rvalue (arg1
, complain
);
4402 arg2
= force_rvalue (arg2
, complain
);
4403 arg3
= force_rvalue (arg3
, complain
);
4405 /* force_rvalue can return error_mark on valid arguments. */
4406 if (error_operand_p (arg1
)
4407 || error_operand_p (arg2
)
4408 || error_operand_p (arg3
))
4409 return error_mark_node
;
4411 tree arg1_type
= TREE_TYPE (arg1
);
4412 arg2_type
= TREE_TYPE (arg2
);
4413 arg3_type
= TREE_TYPE (arg3
);
4415 if (TREE_CODE (arg2_type
) != VECTOR_TYPE
4416 && TREE_CODE (arg3_type
) != VECTOR_TYPE
)
4418 /* Rely on the error messages of the scalar version. */
4419 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
4420 orig_arg2
, orig_arg3
, complain
);
4421 if (scal
== error_mark_node
)
4422 return error_mark_node
;
4423 tree stype
= TREE_TYPE (scal
);
4424 tree ctype
= TREE_TYPE (arg1_type
);
4425 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
4426 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
4428 if (complain
& tf_error
)
4429 error_at (loc
, "inferred scalar type %qT is not an integer or "
4430 "floating point type of the same size as %qT", stype
,
4431 COMPARISON_CLASS_P (arg1
)
4432 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
4434 return error_mark_node
;
4437 tree vtype
= build_opaque_vector_type (stype
,
4438 TYPE_VECTOR_SUBPARTS (arg1_type
));
4439 /* We could pass complain & tf_warning to unsafe_conversion_p,
4440 but the warnings (like Wsign-conversion) have already been
4441 given by the scalar build_conditional_expr_1. We still check
4442 unsafe_conversion_p to forbid truncating long long -> float. */
4443 if (unsafe_conversion_p (stype
, arg2
, false))
4445 if (complain
& tf_error
)
4446 error_at (loc
, "conversion of scalar %qT to vector %qT "
4447 "involves truncation", arg2_type
, vtype
);
4448 return error_mark_node
;
4450 if (unsafe_conversion_p (stype
, arg3
, false))
4452 if (complain
& tf_error
)
4453 error_at (loc
, "conversion of scalar %qT to vector %qT "
4454 "involves truncation", arg3_type
, vtype
);
4455 return error_mark_node
;
4458 arg2
= cp_convert (stype
, arg2
, complain
);
4459 arg2
= save_expr (arg2
);
4460 arg2
= build_vector_from_val (vtype
, arg2
);
4462 arg3
= cp_convert (stype
, arg3
, complain
);
4463 arg3
= save_expr (arg3
);
4464 arg3
= build_vector_from_val (vtype
, arg3
);
4468 if ((TREE_CODE (arg2_type
) == VECTOR_TYPE
)
4469 != (TREE_CODE (arg3_type
) == VECTOR_TYPE
))
4471 enum stv_conv convert_flag
=
4472 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
4473 complain
& tf_error
);
4475 switch (convert_flag
)
4478 return error_mark_node
;
4481 arg2
= save_expr (arg2
);
4482 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
4483 arg2
= build_vector_from_val (arg3_type
, arg2
);
4484 arg2_type
= TREE_TYPE (arg2
);
4489 arg3
= save_expr (arg3
);
4490 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
4491 arg3
= build_vector_from_val (arg2_type
, arg3
);
4492 arg3_type
= TREE_TYPE (arg3
);
4500 if (!same_type_p (arg2_type
, arg3_type
)
4501 || TYPE_VECTOR_SUBPARTS (arg1_type
)
4502 != TYPE_VECTOR_SUBPARTS (arg2_type
)
4503 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
4505 if (complain
& tf_error
)
4507 "incompatible vector types in conditional expression: "
4508 "%qT, %qT and %qT", TREE_TYPE (arg1
),
4509 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
4510 return error_mark_node
;
4513 if (!COMPARISON_CLASS_P (arg1
))
4514 arg1
= cp_build_binary_op (loc
, NE_EXPR
, arg1
,
4515 build_zero_cst (arg1_type
), complain
);
4516 return fold_build3 (VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
4521 The first expression is implicitly converted to bool (clause
4523 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
4525 if (error_operand_p (arg1
))
4526 return error_mark_node
;
4530 If either the second or the third operand has type (possibly
4531 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4532 array-to-pointer (_conv.array_), and function-to-pointer
4533 (_conv.func_) standard conversions are performed on the second
4534 and third operands. */
4535 arg2_type
= unlowered_expr_type (arg2
);
4536 arg3_type
= unlowered_expr_type (arg3
);
4537 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
4539 /* Do the conversions. We don't these for `void' type arguments
4540 since it can't have any effect and since decay_conversion
4541 does not handle that case gracefully. */
4542 if (!VOID_TYPE_P (arg2_type
))
4543 arg2
= decay_conversion (arg2
, complain
);
4544 if (!VOID_TYPE_P (arg3_type
))
4545 arg3
= decay_conversion (arg3
, complain
);
4546 arg2_type
= TREE_TYPE (arg2
);
4547 arg3_type
= TREE_TYPE (arg3
);
4551 One of the following shall hold:
4553 --The second or the third operand (but not both) is a
4554 throw-expression (_except.throw_); the result is of the
4555 type of the other and is an rvalue.
4557 --Both the second and the third operands have type void; the
4558 result is of type void and is an rvalue.
4560 We must avoid calling force_rvalue for expressions of type
4561 "void" because it will complain that their value is being
4563 if (TREE_CODE (arg2
) == THROW_EXPR
4564 && TREE_CODE (arg3
) != THROW_EXPR
)
4566 if (!VOID_TYPE_P (arg3_type
))
4568 arg3
= force_rvalue (arg3
, complain
);
4569 if (arg3
== error_mark_node
)
4570 return error_mark_node
;
4572 arg3_type
= TREE_TYPE (arg3
);
4573 result_type
= arg3_type
;
4575 else if (TREE_CODE (arg2
) != THROW_EXPR
4576 && TREE_CODE (arg3
) == THROW_EXPR
)
4578 if (!VOID_TYPE_P (arg2_type
))
4580 arg2
= force_rvalue (arg2
, complain
);
4581 if (arg2
== error_mark_node
)
4582 return error_mark_node
;
4584 arg2_type
= TREE_TYPE (arg2
);
4585 result_type
= arg2_type
;
4587 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
4588 result_type
= void_type_node
;
4591 if (complain
& tf_error
)
4593 if (VOID_TYPE_P (arg2_type
))
4594 error_at (EXPR_LOC_OR_LOC (arg3
, loc
),
4595 "second operand to the conditional operator "
4596 "is of type %<void%>, but the third operand is "
4597 "neither a throw-expression nor of type %<void%>");
4599 error_at (EXPR_LOC_OR_LOC (arg2
, loc
),
4600 "third operand to the conditional operator "
4601 "is of type %<void%>, but the second operand is "
4602 "neither a throw-expression nor of type %<void%>");
4604 return error_mark_node
;
4608 goto valid_operands
;
4612 Otherwise, if the second and third operand have different types,
4613 and either has (possibly cv-qualified) class type, an attempt is
4614 made to convert each of those operands to the type of the other. */
4615 else if (!same_type_p (arg2_type
, arg3_type
)
4616 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
4621 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4622 p
= conversion_obstack_alloc (0);
4624 conv2
= conditional_conversion (arg2
, arg3
, complain
);
4625 conv3
= conditional_conversion (arg3
, arg2
, complain
);
4629 If both can be converted, or one can be converted but the
4630 conversion is ambiguous, the program is ill-formed. If
4631 neither can be converted, the operands are left unchanged and
4632 further checking is performed as described below. If exactly
4633 one conversion is possible, that conversion is applied to the
4634 chosen operand and the converted operand is used in place of
4635 the original operand for the remainder of this section. */
4636 if ((conv2
&& !conv2
->bad_p
4637 && conv3
&& !conv3
->bad_p
)
4638 || (conv2
&& conv2
->kind
== ck_ambig
)
4639 || (conv3
&& conv3
->kind
== ck_ambig
))
4641 if (complain
& tf_error
)
4642 error_at (loc
, "operands to ?: have different types %qT and %qT",
4643 arg2_type
, arg3_type
);
4644 result
= error_mark_node
;
4646 else if (conv2
&& (!conv2
->bad_p
|| !conv3
))
4648 arg2
= convert_like (conv2
, arg2
, complain
);
4649 arg2
= convert_from_reference (arg2
);
4650 arg2_type
= TREE_TYPE (arg2
);
4651 /* Even if CONV2 is a valid conversion, the result of the
4652 conversion may be invalid. For example, if ARG3 has type
4653 "volatile X", and X does not have a copy constructor
4654 accepting a "volatile X&", then even if ARG2 can be
4655 converted to X, the conversion will fail. */
4656 if (error_operand_p (arg2
))
4657 result
= error_mark_node
;
4659 else if (conv3
&& (!conv3
->bad_p
|| !conv2
))
4661 arg3
= convert_like (conv3
, arg3
, complain
);
4662 arg3
= convert_from_reference (arg3
);
4663 arg3_type
= TREE_TYPE (arg3
);
4664 if (error_operand_p (arg3
))
4665 result
= error_mark_node
;
4668 /* Free all the conversions we allocated. */
4669 obstack_free (&conversion_obstack
, p
);
4674 /* If, after the conversion, both operands have class type,
4675 treat the cv-qualification of both operands as if it were the
4676 union of the cv-qualification of the operands.
4678 The standard is not clear about what to do in this
4679 circumstance. For example, if the first operand has type
4680 "const X" and the second operand has a user-defined
4681 conversion to "volatile X", what is the type of the second
4682 operand after this step? Making it be "const X" (matching
4683 the first operand) seems wrong, as that discards the
4684 qualification without actually performing a copy. Leaving it
4685 as "volatile X" seems wrong as that will result in the
4686 conditional expression failing altogether, even though,
4687 according to this step, the one operand could be converted to
4688 the type of the other. */
4689 if ((conv2
|| conv3
)
4690 && CLASS_TYPE_P (arg2_type
)
4691 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
4692 arg2_type
= arg3_type
=
4693 cp_build_qualified_type (arg2_type
,
4694 cp_type_quals (arg2_type
)
4695 | cp_type_quals (arg3_type
));
4700 If the second and third operands are glvalues of the same value
4701 category and have the same type, the result is of that type and
4703 if (((real_lvalue_p (arg2
) && real_lvalue_p (arg3
))
4704 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
4705 && same_type_p (arg2_type
, arg3_type
))
4707 result_type
= arg2_type
;
4708 arg2
= mark_lvalue_use (arg2
);
4709 arg3
= mark_lvalue_use (arg3
);
4710 goto valid_operands
;
4715 Otherwise, the result is an rvalue. If the second and third
4716 operand do not have the same type, and either has (possibly
4717 cv-qualified) class type, overload resolution is used to
4718 determine the conversions (if any) to be applied to the operands
4719 (_over.match.oper_, _over.built_). */
4721 if (!same_type_p (arg2_type
, arg3_type
)
4722 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
4728 /* Rearrange the arguments so that add_builtin_candidate only has
4729 to know about two args. In build_builtin_candidate, the
4730 arguments are unscrambled. */
4734 add_builtin_candidates (&candidates
,
4737 ansi_opname (COND_EXPR
),
4739 LOOKUP_NORMAL
, complain
);
4743 If the overload resolution fails, the program is
4745 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
4748 if (complain
& tf_error
)
4750 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
4751 print_z_candidates (loc
, candidates
);
4753 return error_mark_node
;
4755 cand
= tourney (candidates
, complain
);
4758 if (complain
& tf_error
)
4760 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
4761 print_z_candidates (loc
, candidates
);
4763 return error_mark_node
;
4768 Otherwise, the conversions thus determined are applied, and
4769 the converted operands are used in place of the original
4770 operands for the remainder of this section. */
4771 conv
= cand
->convs
[0];
4772 arg1
= convert_like (conv
, arg1
, complain
);
4773 conv
= cand
->convs
[1];
4774 arg2
= convert_like (conv
, arg2
, complain
);
4775 arg2_type
= TREE_TYPE (arg2
);
4776 conv
= cand
->convs
[2];
4777 arg3
= convert_like (conv
, arg3
, complain
);
4778 arg3_type
= TREE_TYPE (arg3
);
4783 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
4784 and function-to-pointer (_conv.func_) standard conversions are
4785 performed on the second and third operands.
4787 We need to force the lvalue-to-rvalue conversion here for class types,
4788 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
4789 that isn't wrapped with a TARGET_EXPR plays havoc with exception
4792 arg2
= force_rvalue (arg2
, complain
);
4793 if (!CLASS_TYPE_P (arg2_type
))
4794 arg2_type
= TREE_TYPE (arg2
);
4796 arg3
= force_rvalue (arg3
, complain
);
4797 if (!CLASS_TYPE_P (arg3_type
))
4798 arg3_type
= TREE_TYPE (arg3
);
4800 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
4801 return error_mark_node
;
4805 After those conversions, one of the following shall hold:
4807 --The second and third operands have the same type; the result is of
4809 if (same_type_p (arg2_type
, arg3_type
))
4810 result_type
= arg2_type
;
4813 --The second and third operands have arithmetic or enumeration
4814 type; the usual arithmetic conversions are performed to bring
4815 them to a common type, and the result is of that type. */
4816 else if ((ARITHMETIC_TYPE_P (arg2_type
)
4817 || UNSCOPED_ENUM_P (arg2_type
))
4818 && (ARITHMETIC_TYPE_P (arg3_type
)
4819 || UNSCOPED_ENUM_P (arg3_type
)))
4821 /* In this case, there is always a common type. */
4822 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
4824 if (complain
& tf_warning
)
4825 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
4826 "implicit conversion from %qT to %qT to "
4827 "match other result of conditional",
4830 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
4831 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
4833 if (TREE_CODE (orig_arg2
) == CONST_DECL
4834 && TREE_CODE (orig_arg3
) == CONST_DECL
4835 && DECL_CONTEXT (orig_arg2
) == DECL_CONTEXT (orig_arg3
))
4836 /* Two enumerators from the same enumeration can have different
4837 types when the enumeration is still being defined. */;
4838 else if (complain
& tf_warning
)
4839 warning_at (loc
, OPT_Wenum_compare
, "enumeral mismatch in "
4840 "conditional expression: %qT vs %qT",
4841 arg2_type
, arg3_type
);
4843 else if (extra_warnings
4844 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
4845 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
4846 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
4847 && !same_type_p (arg2_type
,
4848 type_promotes_to (arg3_type
)))))
4850 if (complain
& tf_warning
)
4851 warning_at (loc
, 0, "enumeral and non-enumeral type in "
4852 "conditional expression");
4855 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
4856 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
4860 --The second and third operands have pointer type, or one has
4861 pointer type and the other is a null pointer constant; pointer
4862 conversions (_conv.ptr_) and qualification conversions
4863 (_conv.qual_) are performed to bring them to their composite
4864 pointer type (_expr.rel_). The result is of the composite
4867 --The second and third operands have pointer to member type, or
4868 one has pointer to member type and the other is a null pointer
4869 constant; pointer to member conversions (_conv.mem_) and
4870 qualification conversions (_conv.qual_) are performed to bring
4871 them to a common type, whose cv-qualification shall match the
4872 cv-qualification of either the second or the third operand.
4873 The result is of the common type. */
4874 else if ((null_ptr_cst_p (arg2
)
4875 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
4876 || (null_ptr_cst_p (arg3
)
4877 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
4878 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
4879 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
4880 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
4882 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
4883 arg3
, CPO_CONDITIONAL_EXPR
,
4885 if (result_type
== error_mark_node
)
4886 return error_mark_node
;
4887 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
4888 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
4893 if (complain
& tf_error
)
4894 error_at (loc
, "operands to ?: have different types %qT and %qT",
4895 arg2_type
, arg3_type
);
4896 return error_mark_node
;
4899 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
4900 return error_mark_node
;
4903 result
= build3 (COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
4904 if (!cp_unevaluated_operand
)
4905 /* Avoid folding within decltype (c++/42013) and noexcept. */
4906 result
= fold_if_not_in_template (result
);
4908 /* We can't use result_type below, as fold might have returned a
4913 /* Expand both sides into the same slot, hopefully the target of
4914 the ?: expression. We used to check for TARGET_EXPRs here,
4915 but now we sometimes wrap them in NOP_EXPRs so the test would
4917 if (CLASS_TYPE_P (TREE_TYPE (result
)))
4918 result
= get_target_expr_sfinae (result
, complain
);
4919 /* If this expression is an rvalue, but might be mistaken for an
4920 lvalue, we must add a NON_LVALUE_EXPR. */
4921 result
= rvalue (result
);
4924 result
= force_paren_expr (result
);
4929 /* Wrapper for above. */
4932 build_conditional_expr (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
4933 tsubst_flags_t complain
)
4936 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4937 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
4938 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4942 /* OPERAND is an operand to an expression. Perform necessary steps
4943 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
4947 prep_operand (tree operand
)
4951 if (CLASS_TYPE_P (TREE_TYPE (operand
))
4952 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
4953 /* Make sure the template type is instantiated now. */
4954 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
4960 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
4961 OVERLOAD) to the CANDIDATES, returning an updated list of
4962 CANDIDATES. The ARGS are the arguments provided to the call;
4963 if FIRST_ARG is non-null it is the implicit object argument,
4964 otherwise the first element of ARGS is used if needed. The
4965 EXPLICIT_TARGS are explicit template arguments provided.
4966 TEMPLATE_ONLY is true if only template functions should be
4967 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
4968 add_function_candidate. */
4971 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
4973 tree explicit_targs
, bool template_only
,
4974 tree conversion_path
, tree access_path
,
4976 struct z_candidate
**candidates
,
4977 tsubst_flags_t complain
)
4980 const vec
<tree
, va_gc
> *non_static_args
;
4981 bool check_list_ctor
;
4982 bool check_converting
;
4983 unification_kind_t strict
;
4989 /* Precalculate special handling of constructors and conversion ops. */
4990 fn
= OVL_CURRENT (fns
);
4991 if (DECL_CONV_FN_P (fn
))
4993 check_list_ctor
= false;
4994 check_converting
= !!(flags
& LOOKUP_ONLYCONVERTING
);
4995 if (flags
& LOOKUP_NO_CONVERSION
)
4996 /* We're doing return_type(x). */
4997 strict
= DEDUCE_CONV
;
4999 /* We're doing x.operator return_type(). */
5000 strict
= DEDUCE_EXACT
;
5001 /* [over.match.funcs] For conversion functions, the function
5002 is considered to be a member of the class of the implicit
5003 object argument for the purpose of defining the type of
5004 the implicit object parameter. */
5005 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5009 if (DECL_CONSTRUCTOR_P (fn
))
5011 check_list_ctor
= !!(flags
& LOOKUP_LIST_ONLY
);
5012 /* For list-initialization we consider explicit constructors
5013 and complain if one is chosen. */
5015 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5016 == LOOKUP_ONLYCONVERTING
);
5020 check_list_ctor
= false;
5021 check_converting
= false;
5023 strict
= DEDUCE_CALL
;
5024 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5028 non_static_args
= args
;
5030 /* Delay creating the implicit this parameter until it is needed. */
5031 non_static_args
= NULL
;
5033 for (; fns
; fns
= OVL_NEXT (fns
))
5036 const vec
<tree
, va_gc
> *fn_args
;
5038 fn
= OVL_CURRENT (fns
);
5040 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5042 if (check_list_ctor
&& !is_list_ctor (fn
))
5045 /* Figure out which set of arguments to use. */
5046 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5048 /* If this function is a non-static member and we didn't get an
5049 implicit object argument, move it out of args. */
5050 if (first_arg
== NULL_TREE
)
5054 vec
<tree
, va_gc
> *tempvec
;
5055 vec_alloc (tempvec
, args
->length () - 1);
5056 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5057 tempvec
->quick_push (arg
);
5058 non_static_args
= tempvec
;
5059 first_arg
= (*args
)[0];
5062 fn_first_arg
= first_arg
;
5063 fn_args
= non_static_args
;
5067 /* Otherwise, just use the list of arguments provided. */
5068 fn_first_arg
= NULL_TREE
;
5072 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5073 add_template_candidate (candidates
,
5085 else if (!template_only
)
5086 add_function_candidate (candidates
,
5099 build_new_op_1 (location_t loc
, enum tree_code code
, int flags
, tree arg1
,
5100 tree arg2
, tree arg3
, tree
*overload
, tsubst_flags_t complain
)
5102 struct z_candidate
*candidates
= 0, *cand
;
5103 vec
<tree
, va_gc
> *arglist
;
5106 tree result
= NULL_TREE
;
5107 bool result_valid_p
= false;
5108 enum tree_code code2
= NOP_EXPR
;
5109 enum tree_code code_orig_arg1
= ERROR_MARK
;
5110 enum tree_code code_orig_arg2
= ERROR_MARK
;
5116 if (error_operand_p (arg1
)
5117 || error_operand_p (arg2
)
5118 || error_operand_p (arg3
))
5119 return error_mark_node
;
5121 if (code
== MODIFY_EXPR
)
5123 code2
= TREE_CODE (arg3
);
5125 fnname
= ansi_assopname (code2
);
5128 fnname
= ansi_opname (code
);
5130 arg1
= prep_operand (arg1
);
5136 case VEC_DELETE_EXPR
:
5138 /* Use build_op_new_call and build_op_delete_call instead. */
5142 /* Use build_op_call instead. */
5145 case TRUTH_ORIF_EXPR
:
5146 case TRUTH_ANDIF_EXPR
:
5147 case TRUTH_AND_EXPR
:
5149 /* These are saved for the sake of warn_logical_operator. */
5150 code_orig_arg1
= TREE_CODE (arg1
);
5151 code_orig_arg2
= TREE_CODE (arg2
);
5157 arg2
= prep_operand (arg2
);
5158 arg3
= prep_operand (arg3
);
5160 if (code
== COND_EXPR
)
5161 /* Use build_conditional_expr instead. */
5163 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5164 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5167 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5168 arg2
= integer_zero_node
;
5170 vec_alloc (arglist
, 3);
5171 arglist
->quick_push (arg1
);
5172 if (arg2
!= NULL_TREE
)
5173 arglist
->quick_push (arg2
);
5174 if (arg3
!= NULL_TREE
)
5175 arglist
->quick_push (arg3
);
5177 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5178 p
= conversion_obstack_alloc (0);
5180 /* Add namespace-scope operators to the list of functions to
5182 add_candidates (lookup_function_nonclass (fnname
, arglist
, /*block_p=*/true),
5183 NULL_TREE
, arglist
, NULL_TREE
,
5184 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5185 flags
, &candidates
, complain
);
5189 args
[2] = NULL_TREE
;
5191 /* Add class-member operators to the candidate set. */
5192 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5196 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5197 if (fns
== error_mark_node
)
5199 result
= error_mark_node
;
5200 goto user_defined_result_ready
;
5203 add_candidates (BASELINK_FUNCTIONS (fns
),
5204 NULL_TREE
, arglist
, NULL_TREE
,
5206 BASELINK_BINFO (fns
),
5207 BASELINK_ACCESS_BINFO (fns
),
5208 flags
, &candidates
, complain
);
5210 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5211 only non-member functions that have type T1 or reference to
5212 cv-qualified-opt T1 for the first argument, if the first argument
5213 has an enumeration type, or T2 or reference to cv-qualified-opt
5214 T2 for the second argument, if the the second argument has an
5215 enumeration type. Filter out those that don't match. */
5216 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5218 struct z_candidate
**candp
, **next
;
5220 for (candp
= &candidates
; *candp
; candp
= next
)
5222 tree parmlist
, parmtype
;
5223 int i
, nargs
= (arg2
? 2 : 1);
5228 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5230 for (i
= 0; i
< nargs
; ++i
)
5232 parmtype
= TREE_VALUE (parmlist
);
5234 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
5235 parmtype
= TREE_TYPE (parmtype
);
5236 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5237 && (same_type_ignoring_top_level_qualifiers_p
5238 (TREE_TYPE (args
[i
]), parmtype
)))
5241 parmlist
= TREE_CHAIN (parmlist
);
5244 /* No argument has an appropriate type, so remove this
5245 candidate function from the list. */
5248 *candp
= cand
->next
;
5254 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5261 /* For these, the built-in candidates set is empty
5262 [over.match.oper]/3. We don't want non-strict matches
5263 because exact matches are always possible with built-in
5264 operators. The built-in candidate set for COMPONENT_REF
5265 would be empty too, but since there are no such built-in
5266 operators, we accept non-strict matches for them. */
5271 strict_p
= pedantic
;
5275 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5280 case POSTINCREMENT_EXPR
:
5281 case POSTDECREMENT_EXPR
:
5282 /* Don't try anything fancy if we're not allowed to produce
5284 if (!(complain
& tf_error
))
5285 return error_mark_node
;
5287 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5288 distinguish between prefix and postfix ++ and
5289 operator++() was used for both, so we allow this with
5293 const char *msg
= (flag_permissive
)
5294 ? G_("no %<%D(int)%> declared for postfix %qs,"
5295 " trying prefix operator instead")
5296 : G_("no %<%D(int)%> declared for postfix %qs");
5297 permerror (loc
, msg
, fnname
, operator_name_info
[code
].name
);
5300 if (!flag_permissive
)
5301 return error_mark_node
;
5303 if (code
== POSTINCREMENT_EXPR
)
5304 code
= PREINCREMENT_EXPR
;
5306 code
= PREDECREMENT_EXPR
;
5307 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5308 NULL_TREE
, overload
, complain
);
5311 /* The caller will deal with these. */
5316 result_valid_p
= true;
5320 if (complain
& tf_error
)
5322 /* If one of the arguments of the operator represents
5323 an invalid use of member function pointer, try to report
5324 a meaningful error ... */
5325 if (invalid_nonstatic_memfn_p (arg1
, tf_error
)
5326 || invalid_nonstatic_memfn_p (arg2
, tf_error
)
5327 || invalid_nonstatic_memfn_p (arg3
, tf_error
))
5328 /* We displayed the error message. */;
5331 /* ... Otherwise, report the more generic
5332 "no matching operator found" error */
5333 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
5334 print_z_candidates (loc
, candidates
);
5337 result
= error_mark_node
;
5343 cand
= tourney (candidates
, complain
);
5346 if (complain
& tf_error
)
5348 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
5349 print_z_candidates (loc
, candidates
);
5351 result
= error_mark_node
;
5353 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
5356 *overload
= cand
->fn
;
5358 if (resolve_args (arglist
, complain
) == NULL
)
5359 result
= error_mark_node
;
5361 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5365 /* Give any warnings we noticed during overload resolution. */
5366 if (cand
->warnings
&& (complain
& tf_warning
))
5368 struct candidate_warning
*w
;
5369 for (w
= cand
->warnings
; w
; w
= w
->next
)
5370 joust (cand
, w
->loser
, 1, complain
);
5373 /* Check for comparison of different enum types. */
5382 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
5383 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
5384 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
5385 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
5386 && (complain
& tf_warning
))
5388 warning (OPT_Wenum_compare
,
5389 "comparison between %q#T and %q#T",
5390 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
5397 /* We need to strip any leading REF_BIND so that bitfields
5398 don't cause errors. This should not remove any important
5399 conversions, because builtins don't apply to class
5400 objects directly. */
5401 conv
= cand
->convs
[0];
5402 if (conv
->kind
== ck_ref_bind
)
5403 conv
= next_conversion (conv
);
5404 arg1
= convert_like (conv
, arg1
, complain
);
5408 conv
= cand
->convs
[1];
5409 if (conv
->kind
== ck_ref_bind
)
5410 conv
= next_conversion (conv
);
5412 arg2
= decay_conversion (arg2
, complain
);
5414 /* We need to call warn_logical_operator before
5415 converting arg2 to a boolean_type, but after
5416 decaying an enumerator to its value. */
5417 if (complain
& tf_warning
)
5418 warn_logical_operator (loc
, code
, boolean_type_node
,
5419 code_orig_arg1
, arg1
,
5420 code_orig_arg2
, arg2
);
5422 arg2
= convert_like (conv
, arg2
, complain
);
5426 conv
= cand
->convs
[2];
5427 if (conv
->kind
== ck_ref_bind
)
5428 conv
= next_conversion (conv
);
5429 arg3
= convert_like (conv
, arg3
, complain
);
5435 user_defined_result_ready
:
5437 /* Free all the conversions we allocated. */
5438 obstack_free (&conversion_obstack
, p
);
5440 if (result
|| result_valid_p
)
5447 return cp_build_modify_expr (arg1
, code2
, arg2
, complain
);
5450 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
5452 case TRUTH_ANDIF_EXPR
:
5453 case TRUTH_ORIF_EXPR
:
5454 case TRUTH_AND_EXPR
:
5456 warn_logical_operator (loc
, code
, boolean_type_node
,
5457 code_orig_arg1
, arg1
, code_orig_arg2
, arg2
);
5462 case TRUNC_DIV_EXPR
:
5473 case TRUNC_MOD_EXPR
:
5477 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
5479 case UNARY_PLUS_EXPR
:
5482 case TRUTH_NOT_EXPR
:
5483 case PREINCREMENT_EXPR
:
5484 case POSTINCREMENT_EXPR
:
5485 case PREDECREMENT_EXPR
:
5486 case POSTDECREMENT_EXPR
:
5490 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
5493 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
5496 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
5500 /* The caller will deal with these. */
5512 /* Wrapper for above. */
5515 build_new_op (location_t loc
, enum tree_code code
, int flags
,
5516 tree arg1
, tree arg2
, tree arg3
,
5517 tree
*overload
, tsubst_flags_t complain
)
5520 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5521 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
5522 overload
, complain
);
5523 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5527 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
5528 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
5531 non_placement_deallocation_fn_p (tree t
)
5533 /* A template instance is never a usual deallocation function,
5534 regardless of its signature. */
5535 if (TREE_CODE (t
) == TEMPLATE_DECL
5536 || primary_template_instantiation_p (t
))
5539 /* If a class T has a member deallocation function named operator delete
5540 with exactly one parameter, then that function is a usual
5541 (non-placement) deallocation function. If class T does not declare
5542 such an operator delete but does declare a member deallocation
5543 function named operator delete with exactly two parameters, the second
5544 of which has type std::size_t (18.2), then this function is a usual
5545 deallocation function. */
5546 t
= FUNCTION_ARG_CHAIN (t
);
5547 if (t
== void_list_node
5548 || (t
&& same_type_p (TREE_VALUE (t
), size_type_node
)
5549 && TREE_CHAIN (t
) == void_list_node
))
5554 /* Build a call to operator delete. This has to be handled very specially,
5555 because the restrictions on what signatures match are different from all
5556 other call instances. For a normal delete, only a delete taking (void *)
5557 or (void *, size_t) is accepted. For a placement delete, only an exact
5558 match with the placement new is accepted.
5560 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
5561 ADDR is the pointer to be deleted.
5562 SIZE is the size of the memory block to be deleted.
5563 GLOBAL_P is true if the delete-expression should not consider
5564 class-specific delete operators.
5565 PLACEMENT is the corresponding placement new call, or NULL_TREE.
5567 If this call to "operator delete" is being generated as part to
5568 deallocate memory allocated via a new-expression (as per [expr.new]
5569 which requires that if the initialization throws an exception then
5570 we call a deallocation function), then ALLOC_FN is the allocation
5574 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
5575 bool global_p
, tree placement
,
5576 tree alloc_fn
, tsubst_flags_t complain
)
5578 tree fn
= NULL_TREE
;
5579 tree fns
, fnname
, type
, t
;
5581 if (addr
== error_mark_node
)
5582 return error_mark_node
;
5584 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
5586 fnname
= ansi_opname (code
);
5588 if (CLASS_TYPE_P (type
)
5589 && COMPLETE_TYPE_P (complete_type (type
))
5593 If the result of the lookup is ambiguous or inaccessible, or if
5594 the lookup selects a placement deallocation function, the
5595 program is ill-formed.
5597 Therefore, we ask lookup_fnfields to complain about ambiguity. */
5599 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
5600 if (fns
== error_mark_node
)
5601 return error_mark_node
;
5606 if (fns
== NULL_TREE
)
5607 fns
= lookup_name_nonclass (fnname
);
5609 /* Strip const and volatile from addr. */
5610 addr
= cp_convert (ptr_type_node
, addr
, complain
);
5614 /* "A declaration of a placement deallocation function matches the
5615 declaration of a placement allocation function if it has the same
5616 number of parameters and, after parameter transformations (8.3.5),
5617 all parameter types except the first are identical."
5619 So we build up the function type we want and ask instantiate_type
5620 to get it for us. */
5621 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
5622 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
5623 t
= build_function_type (void_type_node
, t
);
5625 fn
= instantiate_type (t
, fns
, tf_none
);
5626 if (fn
== error_mark_node
)
5629 if (BASELINK_P (fn
))
5630 fn
= BASELINK_FUNCTIONS (fn
);
5632 /* "If the lookup finds the two-parameter form of a usual deallocation
5633 function (3.7.4.2) and that function, considered as a placement
5634 deallocation function, would have been selected as a match for the
5635 allocation function, the program is ill-formed." */
5636 if (non_placement_deallocation_fn_p (fn
))
5638 /* But if the class has an operator delete (void *), then that is
5639 the usual deallocation function, so we shouldn't complain
5640 about using the operator delete (void *, size_t). */
5641 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
5642 t
; t
= OVL_NEXT (t
))
5644 tree elt
= OVL_CURRENT (t
);
5645 if (non_placement_deallocation_fn_p (elt
)
5646 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
5649 if (complain
& tf_error
)
5651 permerror (0, "non-placement deallocation function %q+D", fn
);
5652 permerror (input_location
, "selected for placement delete");
5655 return error_mark_node
;
5660 /* "Any non-placement deallocation function matches a non-placement
5661 allocation function. If the lookup finds a single matching
5662 deallocation function, that function will be called; otherwise, no
5663 deallocation function will be called." */
5664 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
5665 t
; t
= OVL_NEXT (t
))
5667 tree elt
= OVL_CURRENT (t
);
5668 if (non_placement_deallocation_fn_p (elt
))
5671 /* "If a class T has a member deallocation function named
5672 operator delete with exactly one parameter, then that
5673 function is a usual (non-placement) deallocation
5674 function. If class T does not declare such an operator
5675 delete but does declare a member deallocation function named
5676 operator delete with exactly two parameters, the second of
5677 which has type std::size_t (18.2), then this function is a
5678 usual deallocation function."
5680 So (void*) beats (void*, size_t). */
5681 if (FUNCTION_ARG_CHAIN (fn
) == void_list_node
)
5686 /* If we have a matching function, call it. */
5689 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
5691 /* If the FN is a member function, make sure that it is
5693 if (BASELINK_P (fns
))
5694 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
5697 /* Core issue 901: It's ok to new a type with deleted delete. */
5698 if (DECL_DELETED_FN (fn
) && alloc_fn
)
5703 /* The placement args might not be suitable for overload
5704 resolution at this point, so build the call directly. */
5705 int nargs
= call_expr_nargs (placement
);
5706 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
5709 for (i
= 1; i
< nargs
; i
++)
5710 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
5712 return build_cxx_call (fn
, nargs
, argarray
, complain
);
5717 vec
<tree
, va_gc
> *args
= make_tree_vector ();
5718 args
->quick_push (addr
);
5719 if (FUNCTION_ARG_CHAIN (fn
) != void_list_node
)
5720 args
->quick_push (size
);
5721 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
5722 release_tree_vector (args
);
5729 If no unambiguous matching deallocation function can be found,
5730 propagating the exception does not cause the object's memory to
5734 if ((complain
& tf_warning
)
5736 warning (0, "no corresponding deallocation function for %qD",
5741 if (complain
& tf_error
)
5742 error ("no suitable %<operator %s%> for %qT",
5743 operator_name_info
[(int)code
].name
, type
);
5744 return error_mark_node
;
5747 /* If the current scope isn't allowed to access DECL along
5748 BASETYPE_PATH, give an error. The most derived class in
5749 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
5750 the declaration to use in the error diagnostic. */
5753 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
5754 tsubst_flags_t complain
)
5756 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
5758 if (!accessible_p (basetype_path
, decl
, true))
5760 if (complain
& tf_error
)
5762 if (TREE_PRIVATE (decl
))
5763 error ("%q+#D is private", diag_decl
);
5764 else if (TREE_PROTECTED (decl
))
5765 error ("%q+#D is protected", diag_decl
);
5767 error ("%q+#D is inaccessible", diag_decl
);
5768 error ("within this context");
5776 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
5777 bitwise or of LOOKUP_* values. If any errors are warnings are
5778 generated, set *DIAGNOSTIC_FN to "error" or "warning",
5779 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
5783 build_temp (tree expr
, tree type
, int flags
,
5784 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
5787 vec
<tree
, va_gc
> *args
;
5789 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
5790 args
= make_tree_vector_single (expr
);
5791 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
5792 &args
, type
, flags
, complain
);
5793 release_tree_vector (args
);
5794 if (warningcount
+ werrorcount
> savew
)
5795 *diagnostic_kind
= DK_WARNING
;
5796 else if (errorcount
> savee
)
5797 *diagnostic_kind
= DK_ERROR
;
5799 *diagnostic_kind
= DK_UNSPECIFIED
;
5803 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
5804 EXPR is implicitly converted to type TOTYPE.
5805 FN and ARGNUM are used for diagnostics. */
5808 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
5810 /* Issue warnings about peculiar, but valid, uses of NULL. */
5811 if (expr
== null_node
&& TREE_CODE (totype
) != BOOLEAN_TYPE
5812 && ARITHMETIC_TYPE_P (totype
))
5814 source_location loc
=
5815 expansion_point_location_if_in_system_header (input_location
);
5818 warning_at (loc
, OPT_Wconversion_null
,
5819 "passing NULL to non-pointer argument %P of %qD",
5822 warning_at (loc
, OPT_Wconversion_null
,
5823 "converting to non-pointer type %qT from NULL", totype
);
5826 /* Issue warnings if "false" is converted to a NULL pointer */
5827 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
5828 && TYPE_PTR_P (totype
))
5831 warning_at (input_location
, OPT_Wconversion_null
,
5832 "converting %<false%> to pointer type for argument %P "
5833 "of %qD", argnum
, fn
);
5835 warning_at (input_location
, OPT_Wconversion_null
,
5836 "converting %<false%> to pointer type %qT", totype
);
5840 /* Perform the conversions in CONVS on the expression EXPR. FN and
5841 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
5842 indicates the `this' argument of a method. INNER is nonzero when
5843 being called to continue a conversion chain. It is negative when a
5844 reference binding will be applied, positive otherwise. If
5845 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
5846 conversions will be emitted if appropriate. If C_CAST_P is true,
5847 this conversion is coming from a C-style cast; in that case,
5848 conversions to inaccessible bases are permitted. */
5851 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
5852 int inner
, bool issue_conversion_warnings
,
5853 bool c_cast_p
, tsubst_flags_t complain
)
5855 tree totype
= convs
->type
;
5856 diagnostic_t diag_kind
;
5858 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
5860 if (convs
->bad_p
&& !(complain
& tf_error
))
5861 return error_mark_node
;
5864 && convs
->kind
!= ck_user
5865 && convs
->kind
!= ck_list
5866 && convs
->kind
!= ck_ambig
5867 && (convs
->kind
!= ck_ref_bind
5868 || convs
->user_conv_p
)
5869 && convs
->kind
!= ck_rvalue
5870 && convs
->kind
!= ck_base
)
5872 conversion
*t
= convs
;
5874 /* Give a helpful error if this is bad because of excess braces. */
5875 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
5876 && SCALAR_TYPE_P (totype
)
5877 && CONSTRUCTOR_NELTS (expr
) > 0
5878 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
5879 permerror (loc
, "too many braces around initializer for %qT", totype
);
5881 for (; t
; t
= next_conversion (t
))
5883 if (t
->kind
== ck_user
&& t
->cand
->reason
)
5885 permerror (loc
, "invalid user-defined conversion "
5886 "from %qT to %qT", TREE_TYPE (expr
), totype
);
5887 print_z_candidate (loc
, "candidate is:", t
->cand
);
5888 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
5889 /*issue_conversion_warnings=*/false,
5892 if (convs
->kind
== ck_ref_bind
)
5893 return convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
5894 LOOKUP_NORMAL
, NULL_TREE
,
5897 return cp_convert (totype
, expr
, complain
);
5899 else if (t
->kind
== ck_user
|| !t
->bad_p
)
5901 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
5902 /*issue_conversion_warnings=*/false,
5907 else if (t
->kind
== ck_ambig
)
5908 return convert_like_real (t
, expr
, fn
, argnum
, 1,
5909 /*issue_conversion_warnings=*/false,
5912 else if (t
->kind
== ck_identity
)
5915 if (permerror (loc
, "invalid conversion from %qT to %qT",
5916 TREE_TYPE (expr
), totype
)
5918 inform (DECL_SOURCE_LOCATION (fn
),
5919 "initializing argument %P of %qD", argnum
, fn
);
5921 return cp_convert (totype
, expr
, complain
);
5924 if (issue_conversion_warnings
&& (complain
& tf_warning
))
5925 conversion_null_warnings (totype
, expr
, fn
, argnum
);
5927 switch (convs
->kind
)
5931 struct z_candidate
*cand
= convs
->cand
;
5932 tree convfn
= cand
->fn
;
5935 /* When converting from an init list we consider explicit
5936 constructors, but actually trying to call one is an error. */
5937 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
5938 /* Unless this is for direct-list-initialization. */
5939 && !(BRACE_ENCLOSED_INITIALIZER_P (expr
)
5940 && CONSTRUCTOR_IS_DIRECT_INIT (expr
)))
5942 if (!(complain
& tf_error
))
5943 return error_mark_node
;
5944 error ("converting to %qT from initializer list would use "
5945 "explicit constructor %qD", totype
, convfn
);
5948 /* If we're initializing from {}, it's value-initialization. */
5949 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
5950 && CONSTRUCTOR_NELTS (expr
) == 0
5951 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
5953 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
5954 expr
= build_value_init (totype
, complain
);
5955 expr
= get_target_expr_sfinae (expr
, complain
);
5956 if (expr
!= error_mark_node
)
5958 TARGET_EXPR_LIST_INIT_P (expr
) = true;
5959 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
5964 expr
= mark_rvalue_use (expr
);
5966 /* Set user_conv_p on the argument conversions, so rvalue/base
5967 handling knows not to allow any more UDCs. */
5968 for (i
= 0; i
< cand
->num_convs
; ++i
)
5969 cand
->convs
[i
]->user_conv_p
= true;
5971 expr
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5973 /* If this is a constructor or a function returning an aggr type,
5974 we need to build up a TARGET_EXPR. */
5975 if (DECL_CONSTRUCTOR_P (convfn
))
5977 expr
= build_cplus_new (totype
, expr
, complain
);
5979 /* Remember that this was list-initialization. */
5980 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
5981 TARGET_EXPR_LIST_INIT_P (expr
) = true;
5987 expr
= mark_rvalue_use (expr
);
5988 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
5990 int nelts
= CONSTRUCTOR_NELTS (expr
);
5992 expr
= build_value_init (totype
, complain
);
5993 else if (nelts
== 1)
5994 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
5999 if (type_unknown_p (expr
))
6000 expr
= instantiate_type (totype
, expr
, complain
);
6001 /* Convert a constant to its underlying value, unless we are
6002 about to bind it to a reference, in which case we need to
6003 leave it as an lvalue. */
6006 expr
= decl_constant_value_safe (expr
);
6007 if (expr
== null_node
&& INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
6008 /* If __null has been converted to an integer type, we do not
6009 want to warn about uses of EXPR as an integer, rather than
6011 expr
= build_int_cst (totype
, 0);
6015 /* We leave bad_p off ck_ambig because overload resolution considers
6016 it valid, it just fails when we try to perform it. So we need to
6017 check complain here, too. */
6018 if (complain
& tf_error
)
6020 /* Call build_user_type_conversion again for the error. */
6021 build_user_type_conversion (totype
, convs
->u
.expr
, LOOKUP_NORMAL
,
6024 inform (input_location
, "initializing argument %P of %q+D",
6027 return error_mark_node
;
6031 /* Conversion to std::initializer_list<T>. */
6032 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
6033 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
6034 unsigned len
= CONSTRUCTOR_NELTS (expr
);
6035 tree array
, val
, field
;
6036 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
6039 /* Convert all the elements. */
6040 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
6042 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
6043 1, false, false, complain
);
6044 if (sub
== error_mark_node
)
6046 if (!BRACE_ENCLOSED_INITIALIZER_P (val
))
6047 check_narrowing (TREE_TYPE (sub
), val
);
6048 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
6049 if (!TREE_CONSTANT (sub
))
6050 TREE_CONSTANT (new_ctor
) = false;
6052 /* Build up the array. */
6053 elttype
= cp_build_qualified_type
6054 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
6055 array
= build_array_of_n_type (elttype
, len
);
6056 array
= finish_compound_literal (array
, new_ctor
, complain
);
6057 /* Take the address explicitly rather than via decay_conversion
6058 to avoid the error about taking the address of a temporary. */
6059 array
= cp_build_addr_expr (array
, complain
);
6060 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
6062 /* Build up the initializer_list object. */
6063 totype
= complete_type (totype
);
6064 field
= next_initializable_field (TYPE_FIELDS (totype
));
6065 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
6066 field
= next_initializable_field (DECL_CHAIN (field
));
6067 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
6068 new_ctor
= build_constructor (totype
, vec
);
6069 return get_target_expr_sfinae (new_ctor
, complain
);
6073 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
6075 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6076 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
6077 real
= perform_implicit_conversion (TREE_TYPE (totype
),
6079 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
6081 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
6082 return fold_if_not_in_template (expr
);
6084 expr
= reshape_init (totype
, expr
, complain
);
6085 return get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
6092 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
6093 convs
->kind
== ck_ref_bind
? -1 : 1,
6094 convs
->kind
== ck_ref_bind
? issue_conversion_warnings
: false,
6097 if (expr
== error_mark_node
)
6098 return error_mark_node
;
6100 switch (convs
->kind
)
6103 expr
= decay_conversion (expr
, complain
);
6104 if (expr
== error_mark_node
)
6105 return error_mark_node
;
6107 if (! MAYBE_CLASS_TYPE_P (totype
))
6109 /* Else fall through. */
6111 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
6113 /* We are going to bind a reference directly to a base-class
6114 subobject of EXPR. */
6115 /* Build an expression for `*((base*) &expr)'. */
6116 expr
= cp_build_addr_expr (expr
, complain
);
6117 expr
= convert_to_base (expr
, build_pointer_type (totype
),
6118 !c_cast_p
, /*nonnull=*/true, complain
);
6119 expr
= cp_build_indirect_ref (expr
, RO_IMPLICIT_CONVERSION
, complain
);
6123 /* Copy-initialization where the cv-unqualified version of the source
6124 type is the same class as, or a derived class of, the class of the
6125 destination [is treated as direct-initialization]. [dcl.init] */
6126 flags
= LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
;
6127 if (convs
->user_conv_p
)
6128 /* This conversion is being done in the context of a user-defined
6129 conversion (i.e. the second step of copy-initialization), so
6130 don't allow any more. */
6131 flags
|= LOOKUP_NO_CONVERSION
;
6132 if (convs
->rvaluedness_matches_p
)
6133 flags
|= LOOKUP_PREFER_RVALUE
;
6134 if (TREE_CODE (expr
) == TARGET_EXPR
6135 && TARGET_EXPR_LIST_INIT_P (expr
))
6136 /* Copy-list-initialization doesn't actually involve a copy. */
6138 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
6139 if (diag_kind
&& fn
&& complain
)
6140 emit_diagnostic (diag_kind
, DECL_SOURCE_LOCATION (fn
), 0,
6141 " initializing argument %P of %qD", argnum
, fn
);
6142 return build_cplus_new (totype
, expr
, complain
);
6146 tree ref_type
= totype
;
6148 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
6150 gcc_assert (TYPE_REF_IS_RVALUE (ref_type
)
6151 && real_lvalue_p (expr
));
6153 error_at (loc
, "cannot bind %qT lvalue to %qT",
6154 TREE_TYPE (expr
), totype
);
6156 inform (input_location
,
6157 "initializing argument %P of %q+D", argnum
, fn
);
6158 return error_mark_node
;
6161 /* If necessary, create a temporary.
6163 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
6164 that need temporaries, even when their types are reference
6165 compatible with the type of reference being bound, so the
6166 upcoming call to cp_build_addr_expr doesn't fail. */
6167 if (convs
->need_temporary_p
6168 || TREE_CODE (expr
) == CONSTRUCTOR
6169 || TREE_CODE (expr
) == VA_ARG_EXPR
)
6171 /* Otherwise, a temporary of type "cv1 T1" is created and
6172 initialized from the initializer expression using the rules
6173 for a non-reference copy-initialization (8.5). */
6175 tree type
= TREE_TYPE (ref_type
);
6176 cp_lvalue_kind lvalue
= real_lvalue_p (expr
);
6178 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6179 (type
, next_conversion (convs
)->type
));
6180 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
6181 && !TYPE_REF_IS_RVALUE (ref_type
))
6183 /* If the reference is volatile or non-const, we
6184 cannot create a temporary. */
6185 if (lvalue
& clk_bitfield
)
6186 error_at (loc
, "cannot bind bitfield %qE to %qT",
6188 else if (lvalue
& clk_packed
)
6189 error_at (loc
, "cannot bind packed field %qE to %qT",
6192 error_at (loc
, "cannot bind rvalue %qE to %qT",
6194 return error_mark_node
;
6196 /* If the source is a packed field, and we must use a copy
6197 constructor, then building the target expr will require
6198 binding the field to the reference parameter to the
6199 copy constructor, and we'll end up with an infinite
6200 loop. If we can use a bitwise copy, then we'll be
6202 if ((lvalue
& clk_packed
)
6203 && CLASS_TYPE_P (type
)
6204 && type_has_nontrivial_copy_init (type
))
6206 error_at (loc
, "cannot bind packed field %qE to %qT",
6208 return error_mark_node
;
6210 if (lvalue
& clk_bitfield
)
6212 expr
= convert_bitfield_to_declared_type (expr
);
6213 expr
= fold_convert (type
, expr
);
6215 expr
= build_target_expr_with_type (expr
, type
, complain
);
6218 /* Take the address of the thing to which we will bind the
6220 expr
= cp_build_addr_expr (expr
, complain
);
6221 if (expr
== error_mark_node
)
6222 return error_mark_node
;
6224 /* Convert it to a pointer to the type referred to by the
6225 reference. This will adjust the pointer if a derived to
6226 base conversion is being performed. */
6227 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
6229 /* Convert the pointer to the desired reference type. */
6230 return build_nop (ref_type
, expr
);
6234 return decay_conversion (expr
, complain
);
6237 /* Warn about deprecated conversion if appropriate. */
6238 string_conv_p (totype
, expr
, 1);
6243 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
6244 /*nonnull=*/false, complain
);
6245 return build_nop (totype
, expr
);
6248 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
6249 c_cast_p
, complain
);
6255 if (convs
->check_narrowing
)
6256 check_narrowing (totype
, expr
);
6258 if (issue_conversion_warnings
)
6259 expr
= cp_convert_and_check (totype
, expr
, complain
);
6261 expr
= cp_convert (totype
, expr
, complain
);
6266 /* ARG is being passed to a varargs function. Perform any conversions
6267 required. Return the converted value. */
6270 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
6273 location_t loc
= EXPR_LOC_OR_LOC (arg
, input_location
);
6277 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6278 standard conversions are performed. */
6279 arg
= decay_conversion (arg
, complain
);
6280 arg_type
= TREE_TYPE (arg
);
6283 If the argument has integral or enumeration type that is subject
6284 to the integral promotions (_conv.prom_), or a floating point
6285 type that is subject to the floating point promotion
6286 (_conv.fpprom_), the value of the argument is converted to the
6287 promoted type before the call. */
6288 if (TREE_CODE (arg_type
) == REAL_TYPE
6289 && (TYPE_PRECISION (arg_type
)
6290 < TYPE_PRECISION (double_type_node
))
6291 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
6293 if ((complain
& tf_warning
)
6294 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
6295 warning_at (loc
, OPT_Wdouble_promotion
,
6296 "implicit conversion from %qT to %qT when passing "
6297 "argument to function",
6298 arg_type
, double_type_node
);
6299 arg
= convert_to_real (double_type_node
, arg
);
6301 else if (NULLPTR_TYPE_P (arg_type
))
6302 arg
= null_pointer_node
;
6303 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
6305 if (SCOPED_ENUM_P (arg_type
) && !abi_version_at_least (6))
6307 if (complain
& tf_warning
)
6308 warning_at (loc
, OPT_Wabi
, "scoped enum %qT will not promote to an "
6309 "integral type in a future version of GCC", arg_type
);
6310 arg
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
, complain
);
6312 arg
= cp_perform_integral_promotions (arg
, complain
);
6315 arg
= require_complete_type_sfinae (arg
, complain
);
6316 arg_type
= TREE_TYPE (arg
);
6318 if (arg
!= error_mark_node
6319 /* In a template (or ill-formed code), we can have an incomplete type
6320 even after require_complete_type_sfinae, in which case we don't know
6321 whether it has trivial copy or not. */
6322 && COMPLETE_TYPE_P (arg_type
))
6324 /* Build up a real lvalue-to-rvalue conversion in case the
6325 copy constructor is trivial but not callable. */
6326 if (!cp_unevaluated_operand
&& CLASS_TYPE_P (arg_type
))
6327 force_rvalue (arg
, complain
);
6329 /* [expr.call] 5.2.2/7:
6330 Passing a potentially-evaluated argument of class type (Clause 9)
6331 with a non-trivial copy constructor or a non-trivial destructor
6332 with no corresponding parameter is conditionally-supported, with
6333 implementation-defined semantics.
6335 We used to just warn here and do a bitwise copy, but now
6336 cp_expr_size will abort if we try to do that.
6338 If the call appears in the context of a sizeof expression,
6339 it is not potentially-evaluated. */
6340 if (cp_unevaluated_operand
== 0
6341 && (type_has_nontrivial_copy_init (arg_type
)
6342 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
)))
6344 if (complain
& tf_error
)
6345 error_at (loc
, "cannot pass objects of non-trivially-copyable "
6346 "type %q#T through %<...%>", arg_type
);
6348 return error_mark_node
;
6355 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
6358 build_x_va_arg (source_location loc
, tree expr
, tree type
)
6360 if (processing_template_decl
)
6361 return build_min (VA_ARG_EXPR
, type
, expr
);
6363 type
= complete_type_or_else (type
, NULL_TREE
);
6365 if (expr
== error_mark_node
|| !type
)
6366 return error_mark_node
;
6368 expr
= mark_lvalue_use (expr
);
6370 if (type_has_nontrivial_copy_init (type
)
6371 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
6372 || TREE_CODE (type
) == REFERENCE_TYPE
)
6374 /* Remove reference types so we don't ICE later on. */
6375 tree type1
= non_reference (type
);
6376 /* conditionally-supported behavior [expr.call] 5.2.2/7. */
6377 error ("cannot receive objects of non-trivially-copyable type %q#T "
6378 "through %<...%>; ", type
);
6379 expr
= convert (build_pointer_type (type1
), null_node
);
6380 expr
= cp_build_indirect_ref (expr
, RO_NULL
, tf_warning_or_error
);
6384 return build_va_arg (loc
, expr
, type
);
6387 /* TYPE has been given to va_arg. Apply the default conversions which
6388 would have happened when passed via ellipsis. Return the promoted
6389 type, or the passed type if there is no change. */
6392 cxx_type_promotes_to (tree type
)
6396 /* Perform the array-to-pointer and function-to-pointer
6398 type
= type_decays_to (type
);
6400 promote
= type_promotes_to (type
);
6401 if (same_type_p (type
, promote
))
6407 /* ARG is a default argument expression being passed to a parameter of
6408 the indicated TYPE, which is a parameter to FN. PARMNUM is the
6409 zero-based argument number. Do any required conversions. Return
6410 the converted value. */
6412 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
6414 push_defarg_context (tree fn
)
6415 { vec_safe_push (default_arg_context
, fn
); }
6418 pop_defarg_context (void)
6419 { default_arg_context
->pop (); }
6422 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
6423 tsubst_flags_t complain
)
6428 /* See through clones. */
6429 fn
= DECL_ORIGIN (fn
);
6431 /* Detect recursion. */
6432 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
6435 if (complain
& tf_error
)
6436 error ("recursive evaluation of default argument for %q#D", fn
);
6437 return error_mark_node
;
6440 /* If the ARG is an unparsed default argument expression, the
6441 conversion cannot be performed. */
6442 if (TREE_CODE (arg
) == DEFAULT_ARG
)
6444 if (complain
& tf_error
)
6445 error ("call to %qD uses the default argument for parameter %P, which "
6446 "is not yet defined", fn
, parmnum
);
6447 return error_mark_node
;
6450 push_defarg_context (fn
);
6452 if (fn
&& DECL_TEMPLATE_INFO (fn
))
6453 arg
= tsubst_default_argument (fn
, type
, arg
, complain
);
6459 The names in the expression are bound, and the semantic
6460 constraints are checked, at the point where the default
6461 expressions appears.
6463 we must not perform access checks here. */
6464 push_deferring_access_checks (dk_no_check
);
6465 /* We must make a copy of ARG, in case subsequent processing
6466 alters any part of it. */
6467 arg
= break_out_target_exprs (arg
);
6468 if (TREE_CODE (arg
) == CONSTRUCTOR
)
6470 arg
= digest_init (type
, arg
, complain
);
6471 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
6472 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
6477 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
6478 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
6480 arg
= convert_for_arg_passing (type
, arg
, complain
);
6482 pop_deferring_access_checks();
6484 pop_defarg_context ();
6489 /* Returns the type which will really be used for passing an argument of
6493 type_passed_as (tree type
)
6495 /* Pass classes with copy ctors by invisible reference. */
6496 if (TREE_ADDRESSABLE (type
))
6498 type
= build_reference_type (type
);
6499 /* There are no other pointers to this temporary. */
6500 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
6502 else if (targetm
.calls
.promote_prototypes (type
)
6503 && INTEGRAL_TYPE_P (type
)
6504 && COMPLETE_TYPE_P (type
)
6505 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
),
6506 TYPE_SIZE (integer_type_node
)))
6507 type
= integer_type_node
;
6512 /* Actually perform the appropriate conversion. */
6515 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
6519 /* If VAL is a bitfield, then -- since it has already been converted
6520 to TYPE -- it cannot have a precision greater than TYPE.
6522 If it has a smaller precision, we must widen it here. For
6523 example, passing "int f:3;" to a function expecting an "int" will
6524 not result in any conversion before this point.
6526 If the precision is the same we must not risk widening. For
6527 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
6528 often have type "int", even though the C++ type for the field is
6529 "long long". If the value is being passed to a function
6530 expecting an "int", then no conversions will be required. But,
6531 if we call convert_bitfield_to_declared_type, the bitfield will
6532 be converted to "long long". */
6533 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
6535 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
6536 val
= convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type
), val
);
6538 if (val
== error_mark_node
)
6540 /* Pass classes with copy ctors by invisible reference. */
6541 else if (TREE_ADDRESSABLE (type
))
6542 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
6543 else if (targetm
.calls
.promote_prototypes (type
)
6544 && INTEGRAL_TYPE_P (type
)
6545 && COMPLETE_TYPE_P (type
)
6546 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
),
6547 TYPE_SIZE (integer_type_node
)))
6548 val
= cp_perform_integral_promotions (val
, complain
);
6549 if ((complain
& tf_warning
)
6550 && warn_suggest_attribute_format
)
6552 tree rhstype
= TREE_TYPE (val
);
6553 const enum tree_code coder
= TREE_CODE (rhstype
);
6554 const enum tree_code codel
= TREE_CODE (type
);
6555 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
6557 && check_missing_format_attribute (type
, rhstype
))
6558 warning (OPT_Wsuggest_attribute_format
,
6559 "argument of function call might be a candidate for a format attribute");
6564 /* Returns true iff FN is a function with magic varargs, i.e. ones for
6565 which no conversions at all should be done. This is true for some
6566 builtins which don't act like normal functions. */
6569 magic_varargs_p (tree fn
)
6571 if (flag_cilkplus
&& is_cilkplus_reduce_builtin (fn
) != BUILT_IN_NONE
)
6574 if (DECL_BUILT_IN (fn
))
6575 switch (DECL_FUNCTION_CODE (fn
))
6577 case BUILT_IN_CLASSIFY_TYPE
:
6578 case BUILT_IN_CONSTANT_P
:
6579 case BUILT_IN_NEXT_ARG
:
6580 case BUILT_IN_VA_START
:
6584 return lookup_attribute ("type generic",
6585 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
6591 /* Returns the decl of the dispatcher function if FN is a function version. */
6594 get_function_version_dispatcher (tree fn
)
6596 tree dispatcher_decl
= NULL
;
6598 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
6599 && DECL_FUNCTION_VERSIONED (fn
));
6601 gcc_assert (targetm
.get_function_versions_dispatcher
);
6602 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
6604 if (dispatcher_decl
== NULL
)
6606 error_at (input_location
, "use of multiversioned function "
6607 "without a default");
6611 retrofit_lang_decl (dispatcher_decl
);
6612 gcc_assert (dispatcher_decl
!= NULL
);
6613 return dispatcher_decl
;
6616 /* fn is a function version dispatcher that is marked used. Mark all the
6617 semantically identical function versions it will dispatch as used. */
6620 mark_versions_used (tree fn
)
6622 struct cgraph_node
*node
;
6623 struct cgraph_function_version_info
*node_v
;
6624 struct cgraph_function_version_info
*it_v
;
6626 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6628 node
= cgraph_get_node (fn
);
6632 gcc_assert (node
->dispatcher_function
);
6634 node_v
= get_cgraph_node_version (node
);
6638 /* All semantically identical versions are chained. Traverse and mark each
6639 one of them as used. */
6640 it_v
= node_v
->next
;
6641 while (it_v
!= NULL
)
6643 mark_used (it_v
->this_node
->decl
);
6648 /* Subroutine of the various build_*_call functions. Overload resolution
6649 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
6650 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
6651 bitmask of various LOOKUP_* flags which apply to the call itself. */
6654 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
6657 const vec
<tree
, va_gc
> *args
= cand
->args
;
6658 tree first_arg
= cand
->first_arg
;
6659 conversion
**convs
= cand
->convs
;
6661 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
6666 unsigned int arg_index
= 0;
6670 bool already_used
= false;
6672 /* In a template, there is no need to perform all of the work that
6673 is normally done. We are only interested in the type of the call
6674 expression, i.e., the return type of the function. Any semantic
6675 errors will be deferred until the template is instantiated. */
6676 if (processing_template_decl
)
6680 const tree
*argarray
;
6683 return_type
= TREE_TYPE (TREE_TYPE (fn
));
6684 nargs
= vec_safe_length (args
);
6685 if (first_arg
== NULL_TREE
)
6686 argarray
= args
->address ();
6694 alcarray
= XALLOCAVEC (tree
, nargs
);
6695 alcarray
[0] = first_arg
;
6696 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
6697 alcarray
[ix
+ 1] = arg
;
6698 argarray
= alcarray
;
6701 addr
= build_addr_func (fn
, complain
);
6702 if (addr
== error_mark_node
)
6703 return error_mark_node
;
6704 expr
= build_call_array_loc (input_location
, return_type
,
6705 addr
, nargs
, argarray
);
6706 if (TREE_THIS_VOLATILE (fn
) && cfun
)
6707 current_function_returns_abnormally
= 1;
6708 return convert_from_reference (expr
);
6711 /* Give any warnings we noticed during overload resolution. */
6712 if (cand
->warnings
&& (complain
& tf_warning
))
6714 struct candidate_warning
*w
;
6715 for (w
= cand
->warnings
; w
; w
= w
->next
)
6716 joust (cand
, w
->loser
, 1, complain
);
6719 /* Make =delete work with SFINAE. */
6720 if (DECL_DELETED_FN (fn
) && !(complain
& tf_error
))
6721 return error_mark_node
;
6723 if (DECL_FUNCTION_MEMBER_P (fn
))
6726 /* If FN is a template function, two cases must be considered.
6731 template <class T> void f();
6733 template <class T> struct B {
6737 struct C : A, B<int> {
6739 using B<int>::g; // #2
6742 In case #1 where `A::f' is a member template, DECL_ACCESS is
6743 recorded in the primary template but not in its specialization.
6744 We check access of FN using its primary template.
6746 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
6747 because it is a member of class template B, DECL_ACCESS is
6748 recorded in the specialization `B<int>::g'. We cannot use its
6749 primary template because `B<T>::g' and `B<int>::g' may have
6750 different access. */
6751 if (DECL_TEMPLATE_INFO (fn
)
6752 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
6753 access_fn
= DECL_TI_TEMPLATE (fn
);
6756 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
6758 return error_mark_node
;
6761 /* If we're checking for implicit delete, don't bother with argument
6763 if (flags
& LOOKUP_SPECULATIVE
)
6765 if (DECL_DELETED_FN (fn
))
6767 if (complain
& tf_error
)
6769 return error_mark_node
;
6771 if (cand
->viable
== 1)
6773 else if (!(complain
& tf_error
))
6774 /* Reject bad conversions now. */
6775 return error_mark_node
;
6776 /* else continue to get conversion error. */
6779 /* N3276 magic doesn't apply to nested calls. */
6780 int decltype_flag
= (complain
& tf_decltype
);
6781 complain
&= ~tf_decltype
;
6783 /* Find maximum size of vector to hold converted arguments. */
6784 parmlen
= list_length (parm
);
6785 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
6786 if (parmlen
> nargs
)
6788 argarray
= XALLOCAVEC (tree
, nargs
);
6790 /* The implicit parameters to a constructor are not considered by overload
6791 resolution, and must be of the proper type. */
6792 if (DECL_CONSTRUCTOR_P (fn
))
6795 if (first_arg
!= NULL_TREE
)
6797 object_arg
= first_arg
;
6798 first_arg
= NULL_TREE
;
6802 object_arg
= (*args
)[arg_index
];
6805 argarray
[j
++] = build_this (object_arg
);
6806 parm
= TREE_CHAIN (parm
);
6807 /* We should never try to call the abstract constructor. */
6808 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
6810 if (DECL_HAS_VTT_PARM_P (fn
))
6812 argarray
[j
++] = (*args
)[arg_index
];
6814 parm
= TREE_CHAIN (parm
);
6817 /* Bypass access control for 'this' parameter. */
6818 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
6820 tree parmtype
= TREE_VALUE (parm
);
6821 tree arg
= build_this (first_arg
!= NULL_TREE
6823 : (*args
)[arg_index
]);
6824 tree argtype
= TREE_TYPE (arg
);
6828 if (convs
[i
]->bad_p
)
6830 if (complain
& tf_error
)
6831 permerror (input_location
, "passing %qT as %<this%> argument of %q#D discards qualifiers",
6832 TREE_TYPE (argtype
), fn
);
6834 return error_mark_node
;
6837 /* See if the function member or the whole class type is declared
6838 final and the call can be devirtualized. */
6839 if (DECL_FINAL_P (fn
)
6840 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
6841 flags
|= LOOKUP_NONVIRTUAL
;
6843 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
6844 X is called for an object that is not of type X, or of a type
6845 derived from X, the behavior is undefined.
6847 So we can assume that anything passed as 'this' is non-null, and
6848 optimize accordingly. */
6849 gcc_assert (TYPE_PTR_P (parmtype
));
6850 /* Convert to the base in which the function was declared. */
6851 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
6852 converted_arg
= build_base_path (PLUS_EXPR
,
6854 cand
->conversion_path
,
6856 /* Check that the base class is accessible. */
6857 if (!accessible_base_p (TREE_TYPE (argtype
),
6858 BINFO_TYPE (cand
->conversion_path
), true))
6860 if (complain
& tf_error
)
6861 error ("%qT is not an accessible base of %qT",
6862 BINFO_TYPE (cand
->conversion_path
),
6863 TREE_TYPE (argtype
));
6865 return error_mark_node
;
6867 /* If fn was found by a using declaration, the conversion path
6868 will be to the derived class, not the base declaring fn. We
6869 must convert from derived to base. */
6870 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
6871 TREE_TYPE (parmtype
), ba_unique
,
6873 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
6874 base_binfo
, 1, complain
);
6876 argarray
[j
++] = converted_arg
;
6877 parm
= TREE_CHAIN (parm
);
6878 if (first_arg
!= NULL_TREE
)
6879 first_arg
= NULL_TREE
;
6886 gcc_assert (first_arg
== NULL_TREE
);
6887 for (; arg_index
< vec_safe_length (args
) && parm
;
6888 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
6890 tree type
= TREE_VALUE (parm
);
6891 tree arg
= (*args
)[arg_index
];
6892 bool conversion_warning
= true;
6896 /* If the argument is NULL and used to (implicitly) instantiate a
6897 template function (and bind one of the template arguments to
6898 the type of 'long int'), we don't want to warn about passing NULL
6899 to non-pointer argument.
6900 For example, if we have this template function:
6902 template<typename T> void func(T x) {}
6904 we want to warn (when -Wconversion is enabled) in this case:
6910 but not in this case:
6916 if (arg
== null_node
6917 && DECL_TEMPLATE_INFO (fn
)
6918 && cand
->template_decl
6919 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
6920 conversion_warning
= false;
6922 /* Warn about initializer_list deduction that isn't currently in the
6924 if (cxx_dialect
> cxx98
6925 && flag_deduce_init_list
6926 && cand
->template_decl
6927 && is_std_init_list (non_reference (type
))
6928 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
6930 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
6931 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
6932 tree patparm
= get_pattern_parm (realparm
, tmpl
);
6933 tree pattype
= TREE_TYPE (patparm
);
6934 if (PACK_EXPANSION_P (pattype
))
6935 pattype
= PACK_EXPANSION_PATTERN (pattype
);
6936 pattype
= non_reference (pattype
);
6938 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
6939 && (cand
->explicit_targs
== NULL_TREE
6940 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
6941 <= TEMPLATE_TYPE_IDX (pattype
))))
6943 pedwarn (input_location
, 0, "deducing %qT as %qT",
6944 non_reference (TREE_TYPE (patparm
)),
6945 non_reference (type
));
6946 pedwarn (input_location
, 0, " in call to %q+D", cand
->fn
);
6947 pedwarn (input_location
, 0,
6948 " (you can disable this with -fno-deduce-init-list)");
6951 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
6954 : complain
& (~tf_warning
));
6956 val
= convert_for_arg_passing (type
, val
, complain
);
6958 if (val
== error_mark_node
)
6959 return error_mark_node
;
6961 argarray
[j
++] = val
;
6964 /* Default arguments */
6965 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
6967 if (TREE_VALUE (parm
) == error_mark_node
)
6968 return error_mark_node
;
6969 argarray
[j
++] = convert_default_arg (TREE_VALUE (parm
),
6970 TREE_PURPOSE (parm
),
6976 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
6978 tree a
= (*args
)[arg_index
];
6979 if (magic_varargs_p (fn
))
6980 /* Do no conversions for magic varargs. */
6981 a
= mark_type_use (a
);
6983 a
= convert_arg_to_ellipsis (a
, complain
);
6987 gcc_assert (j
<= nargs
);
6990 check_function_arguments (TREE_TYPE (fn
), nargs
, argarray
);
6992 /* Avoid actually calling copy constructors and copy assignment operators,
6995 if (! flag_elide_constructors
)
6996 /* Do things the hard way. */;
6997 else if (cand
->num_convs
== 1
6998 && (DECL_COPY_CONSTRUCTOR_P (fn
)
6999 || DECL_MOVE_CONSTRUCTOR_P (fn
)))
7002 tree arg
= argarray
[num_artificial_parms_for (fn
)];
7004 bool trivial
= trivial_fn_p (fn
);
7006 /* Pull out the real argument, disregarding const-correctness. */
7008 while (CONVERT_EXPR_P (targ
)
7009 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
7010 targ
= TREE_OPERAND (targ
, 0);
7011 if (TREE_CODE (targ
) == ADDR_EXPR
)
7013 targ
= TREE_OPERAND (targ
, 0);
7014 if (!same_type_ignoring_top_level_qualifiers_p
7015 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
7024 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
7026 /* [class.copy]: the copy constructor is implicitly defined even if
7027 the implementation elided its use. */
7028 if (!trivial
|| DECL_DELETED_FN (fn
))
7031 already_used
= true;
7034 /* If we're creating a temp and we already have one, don't create a
7035 new one. If we're not creating a temp but we get one, use
7036 INIT_EXPR to collapse the temp into our target. Otherwise, if the
7037 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
7038 temp or an INIT_EXPR otherwise. */
7040 if (integer_zerop (fa
))
7042 if (TREE_CODE (arg
) == TARGET_EXPR
)
7045 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
7047 else if (TREE_CODE (arg
) == TARGET_EXPR
|| trivial
)
7049 tree to
= stabilize_reference (cp_build_indirect_ref (fa
, RO_NULL
,
7052 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
7056 else if (DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
7057 && trivial_fn_p (fn
)
7058 && !DECL_DELETED_FN (fn
))
7060 tree to
= stabilize_reference
7061 (cp_build_indirect_ref (argarray
[0], RO_NULL
, complain
));
7062 tree type
= TREE_TYPE (to
);
7063 tree as_base
= CLASSTYPE_AS_BASE (type
);
7064 tree arg
= argarray
[1];
7066 if (is_really_empty_class (type
))
7068 /* Avoid copying empty classes. */
7069 val
= build2 (COMPOUND_EXPR
, void_type_node
, to
, arg
);
7070 TREE_NO_WARNING (val
) = 1;
7071 val
= build2 (COMPOUND_EXPR
, type
, val
, to
);
7072 TREE_NO_WARNING (val
) = 1;
7074 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
7076 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
7077 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
7081 /* We must only copy the non-tail padding parts. */
7083 tree array_type
, alias_set
;
7085 arg2
= TYPE_SIZE_UNIT (as_base
);
7086 arg0
= cp_build_addr_expr (to
, complain
);
7088 array_type
= build_array_type (char_type_node
,
7090 (size_binop (MINUS_EXPR
,
7091 arg2
, size_int (1))));
7092 alias_set
= build_int_cst (build_pointer_type (type
), 0);
7093 t
= build2 (MODIFY_EXPR
, void_type_node
,
7094 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
7095 build2 (MEM_REF
, array_type
, arg
, alias_set
));
7096 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
7097 TREE_NO_WARNING (val
) = 1;
7102 else if (DECL_DESTRUCTOR_P (fn
)
7103 && trivial_fn_p (fn
)
7104 && !DECL_DELETED_FN (fn
))
7105 return fold_convert (void_type_node
, argarray
[0]);
7106 /* FIXME handle trivial default constructor, too. */
7108 /* For calls to a multi-versioned function, overload resolution
7109 returns the function with the highest target priority, that is,
7110 the version that will checked for dispatching first. If this
7111 version is inlinable, a direct call to this version can be made
7112 otherwise the call should go through the dispatcher. */
7114 if (DECL_FUNCTION_VERSIONED (fn
)
7115 && (current_function_decl
== NULL
7116 || !targetm
.target_option
.can_inline_p (current_function_decl
, fn
)))
7118 fn
= get_function_version_dispatcher (fn
);
7122 mark_versions_used (fn
);
7127 return error_mark_node
;
7129 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0
7130 /* Don't mess with virtual lookup in fold_non_dependent_expr; virtual
7131 functions can't be constexpr. */
7132 && !in_template_function ())
7135 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
7137 ba_any
, NULL
, complain
);
7138 gcc_assert (binfo
&& binfo
!= error_mark_node
);
7140 /* Warn about deprecated virtual functions now, since we're about
7141 to throw away the decl. */
7142 if (TREE_DEPRECATED (fn
))
7143 warn_deprecated_use (fn
, NULL_TREE
);
7145 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
7147 if (TREE_SIDE_EFFECTS (argarray
[0]))
7148 argarray
[0] = save_expr (argarray
[0]);
7149 t
= build_pointer_type (TREE_TYPE (fn
));
7150 if (DECL_CONTEXT (fn
) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn
)))
7151 fn
= build_java_interface_fn_ref (fn
, argarray
[0]);
7153 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
7158 fn
= build_addr_func (fn
, complain
);
7159 if (fn
== error_mark_node
)
7160 return error_mark_node
;
7163 return build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
7166 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
7167 This function performs no overload resolution, conversion, or other
7168 high-level operations. */
7171 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
7172 tsubst_flags_t complain
)
7177 /* Remember roughly where this call is. */
7178 location_t loc
= EXPR_LOC_OR_LOC (fn
, input_location
);
7179 fn
= build_call_a (fn
, nargs
, argarray
);
7180 SET_EXPR_LOCATION (fn
, loc
);
7182 fndecl
= get_callee_fndecl (fn
);
7184 /* Check that arguments to builtin functions match the expectations. */
7186 && DECL_BUILT_IN (fndecl
)
7187 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
7188 && !check_builtin_function_arguments (fndecl
, nargs
, argarray
))
7189 return error_mark_node
;
7191 /* If it is a built-in array notation function, then the return type of
7192 the function is the element type of the array passed in as array
7193 notation (i.e. the first parameter of the function). */
7194 if (flag_cilkplus
&& TREE_CODE (fn
) == CALL_EXPR
)
7196 enum built_in_function bif
=
7197 is_cilkplus_reduce_builtin (CALL_EXPR_FN (fn
));
7198 if (bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_ADD
7199 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MUL
7200 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MAX
7201 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MIN
7202 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE
7203 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MUTATING
)
7205 /* for bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_ZERO or
7206 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_ZERO or
7207 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_NONZERO or
7208 BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_NONZERO or
7209 BUILT_IN_CILKPLUS_SEC_REDUCE_MIN_IND or
7210 BUILT_IN_CILKPLUS_SEC_REDUCE_MAX_IND
7211 The pre-defined return-type is the correct one. */
7212 tree array_ntn
= CALL_EXPR_ARG (fn
, 0);
7213 TREE_TYPE (fn
) = TREE_TYPE (array_ntn
);
7218 /* Some built-in function calls will be evaluated at compile-time in
7219 fold (). Set optimize to 1 when folding __builtin_constant_p inside
7220 a constexpr function so that fold_builtin_1 doesn't fold it to 0. */
7221 optimize_sav
= optimize
;
7222 if (!optimize
&& fndecl
&& DECL_IS_BUILTIN_CONSTANT_P (fndecl
)
7223 && current_function_decl
7224 && DECL_DECLARED_CONSTEXPR_P (current_function_decl
))
7226 fn
= fold_if_not_in_template (fn
);
7227 optimize
= optimize_sav
;
7229 if (VOID_TYPE_P (TREE_TYPE (fn
)))
7232 /* 5.2.2/11: If a function call is a prvalue of object type: if the
7233 function call is either the operand of a decltype-specifier or the
7234 right operand of a comma operator that is the operand of a
7235 decltype-specifier, a temporary object is not introduced for the
7236 prvalue. The type of the prvalue may be incomplete. */
7237 if (!(complain
& tf_decltype
))
7239 fn
= require_complete_type_sfinae (fn
, complain
);
7240 if (fn
== error_mark_node
)
7241 return error_mark_node
;
7243 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
7244 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
7246 return convert_from_reference (fn
);
7249 static GTY(()) tree java_iface_lookup_fn
;
7251 /* Make an expression which yields the address of the Java interface
7252 method FN. This is achieved by generating a call to libjava's
7253 _Jv_LookupInterfaceMethodIdx(). */
7256 build_java_interface_fn_ref (tree fn
, tree instance
)
7258 tree lookup_fn
, method
, idx
;
7259 tree klass_ref
, iface
, iface_ref
;
7262 if (!java_iface_lookup_fn
)
7264 tree ftype
= build_function_type_list (ptr_type_node
,
7265 ptr_type_node
, ptr_type_node
,
7266 java_int_type_node
, NULL_TREE
);
7267 java_iface_lookup_fn
7268 = add_builtin_function ("_Jv_LookupInterfaceMethodIdx", ftype
,
7269 0, NOT_BUILT_IN
, NULL
, NULL_TREE
);
7272 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
7273 This is the first entry in the vtable. */
7274 klass_ref
= build_vtbl_ref (cp_build_indirect_ref (instance
, RO_NULL
,
7275 tf_warning_or_error
),
7278 /* Get the java.lang.Class pointer for the interface being called. */
7279 iface
= DECL_CONTEXT (fn
);
7280 iface_ref
= lookup_field (iface
, get_identifier ("class$"), 0, false);
7281 if (!iface_ref
|| !VAR_P (iface_ref
)
7282 || DECL_CONTEXT (iface_ref
) != iface
)
7284 error ("could not find class$ field in java interface type %qT",
7286 return error_mark_node
;
7288 iface_ref
= build_address (iface_ref
);
7289 iface_ref
= convert (build_pointer_type (iface
), iface_ref
);
7291 /* Determine the itable index of FN. */
7293 for (method
= TYPE_METHODS (iface
); method
; method
= DECL_CHAIN (method
))
7295 if (!DECL_VIRTUAL_P (method
))
7301 idx
= build_int_cst (NULL_TREE
, i
);
7303 lookup_fn
= build1 (ADDR_EXPR
,
7304 build_pointer_type (TREE_TYPE (java_iface_lookup_fn
)),
7305 java_iface_lookup_fn
);
7306 return build_call_nary (ptr_type_node
, lookup_fn
,
7307 3, klass_ref
, iface_ref
, idx
);
7310 /* Returns the value to use for the in-charge parameter when making a
7311 call to a function with the indicated NAME.
7313 FIXME:Can't we find a neater way to do this mapping? */
7316 in_charge_arg_for_name (tree name
)
7318 if (name
== base_ctor_identifier
7319 || name
== base_dtor_identifier
)
7320 return integer_zero_node
;
7321 else if (name
== complete_ctor_identifier
)
7322 return integer_one_node
;
7323 else if (name
== complete_dtor_identifier
)
7324 return integer_two_node
;
7325 else if (name
== deleting_dtor_identifier
)
7326 return integer_three_node
;
7328 /* This function should only be called with one of the names listed
7334 /* Build a call to a constructor, destructor, or an assignment
7335 operator for INSTANCE, an expression with class type. NAME
7336 indicates the special member function to call; *ARGS are the
7337 arguments. ARGS may be NULL. This may change ARGS. BINFO
7338 indicates the base of INSTANCE that is to be passed as the `this'
7339 parameter to the member function called.
7341 FLAGS are the LOOKUP_* flags to use when processing the call.
7343 If NAME indicates a complete object constructor, INSTANCE may be
7344 NULL_TREE. In this case, the caller will call build_cplus_new to
7345 store the newly constructed object into a VAR_DECL. */
7348 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
7349 tree binfo
, int flags
, tsubst_flags_t complain
)
7352 /* The type of the subobject to be constructed or destroyed. */
7354 vec
<tree
, va_gc
> *allocated
= NULL
;
7357 gcc_assert (name
== complete_ctor_identifier
7358 || name
== base_ctor_identifier
7359 || name
== complete_dtor_identifier
7360 || name
== base_dtor_identifier
7361 || name
== deleting_dtor_identifier
7362 || name
== ansi_assopname (NOP_EXPR
));
7365 /* Resolve the name. */
7366 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
7367 return error_mark_node
;
7369 binfo
= TYPE_BINFO (binfo
);
7372 gcc_assert (binfo
!= NULL_TREE
);
7374 class_type
= BINFO_TYPE (binfo
);
7376 /* Handle the special case where INSTANCE is NULL_TREE. */
7377 if (name
== complete_ctor_identifier
&& !instance
)
7379 instance
= build_int_cst (build_pointer_type (class_type
), 0);
7380 instance
= build1 (INDIRECT_REF
, class_type
, instance
);
7384 if (name
== complete_dtor_identifier
7385 || name
== base_dtor_identifier
7386 || name
== deleting_dtor_identifier
)
7387 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
7389 /* Convert to the base class, if necessary. */
7390 if (!same_type_ignoring_top_level_qualifiers_p
7391 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
7393 if (name
!= ansi_assopname (NOP_EXPR
))
7394 /* For constructors and destructors, either the base is
7395 non-virtual, or it is virtual but we are doing the
7396 conversion from a constructor or destructor for the
7397 complete object. In either case, we can convert
7399 instance
= convert_to_base_statically (instance
, binfo
);
7401 /* However, for assignment operators, we must convert
7402 dynamically if the base is virtual. */
7403 instance
= build_base_path (PLUS_EXPR
, instance
,
7404 binfo
, /*nonnull=*/1, complain
);
7408 gcc_assert (instance
!= NULL_TREE
);
7410 fns
= lookup_fnfields (binfo
, name
, 1);
7412 /* When making a call to a constructor or destructor for a subobject
7413 that uses virtual base classes, pass down a pointer to a VTT for
7415 if ((name
== base_ctor_identifier
7416 || name
== base_dtor_identifier
)
7417 && CLASSTYPE_VBASECLASSES (class_type
))
7422 /* If the current function is a complete object constructor
7423 or destructor, then we fetch the VTT directly.
7424 Otherwise, we look it up using the VTT we were given. */
7425 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
7426 vtt
= decay_conversion (vtt
, complain
);
7427 if (vtt
== error_mark_node
)
7428 return error_mark_node
;
7429 vtt
= build3 (COND_EXPR
, TREE_TYPE (vtt
),
7430 build2 (EQ_EXPR
, boolean_type_node
,
7431 current_in_charge_parm
, integer_zero_node
),
7434 if (BINFO_SUBVTT_INDEX (binfo
))
7435 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
7441 allocated
= make_tree_vector ();
7445 vec_safe_insert (*args
, 0, sub_vtt
);
7448 ret
= build_new_method_call (instance
, fns
, args
,
7449 TYPE_BINFO (BINFO_TYPE (binfo
)),
7453 if (allocated
!= NULL
)
7454 release_tree_vector (allocated
);
7456 if ((complain
& tf_error
)
7457 && (flags
& LOOKUP_DELEGATING_CONS
)
7458 && name
== complete_ctor_identifier
7459 && TREE_CODE (ret
) == CALL_EXPR
7460 && (DECL_ABSTRACT_ORIGIN (TREE_OPERAND (CALL_EXPR_FN (ret
), 0))
7461 == current_function_decl
))
7462 error ("constructor delegates to itself");
7467 /* Return the NAME, as a C string. The NAME indicates a function that
7468 is a member of TYPE. *FREE_P is set to true if the caller must
7469 free the memory returned.
7471 Rather than go through all of this, we should simply set the names
7472 of constructors and destructors appropriately, and dispense with
7473 ctor_identifier, dtor_identifier, etc. */
7476 name_as_c_string (tree name
, tree type
, bool *free_p
)
7480 /* Assume that we will not allocate memory. */
7482 /* Constructors and destructors are special. */
7483 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
7486 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
))));
7487 /* For a destructor, add the '~'. */
7488 if (name
== complete_dtor_identifier
7489 || name
== base_dtor_identifier
7490 || name
== deleting_dtor_identifier
)
7492 pretty_name
= concat ("~", pretty_name
, NULL
);
7493 /* Remember that we need to free the memory allocated. */
7497 else if (IDENTIFIER_TYPENAME_P (name
))
7499 pretty_name
= concat ("operator ",
7500 type_as_string_translate (TREE_TYPE (name
),
7501 TFF_PLAIN_IDENTIFIER
),
7503 /* Remember that we need to free the memory allocated. */
7507 pretty_name
= CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name
)));
7512 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
7513 be set, upon return, to the function called. ARGS may be NULL.
7514 This may change ARGS. */
7517 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
7518 tree conversion_path
, int flags
,
7519 tree
*fn_p
, tsubst_flags_t complain
)
7521 struct z_candidate
*candidates
= 0, *cand
;
7522 tree explicit_targs
= NULL_TREE
;
7523 tree basetype
= NULL_TREE
;
7524 tree access_binfo
, binfo
;
7526 tree first_mem_arg
= NULL_TREE
;
7528 bool skip_first_for_error
;
7529 vec
<tree
, va_gc
> *user_args
;
7532 int template_only
= 0;
7536 vec
<tree
, va_gc
> *orig_args
= NULL
;
7539 gcc_assert (instance
!= NULL_TREE
);
7541 /* We don't know what function we're going to call, yet. */
7545 if (error_operand_p (instance
)
7546 || !fns
|| error_operand_p (fns
))
7547 return error_mark_node
;
7549 if (!BASELINK_P (fns
))
7551 if (complain
& tf_error
)
7552 error ("call to non-function %qD", fns
);
7553 return error_mark_node
;
7556 orig_instance
= instance
;
7559 /* Dismantle the baselink to collect all the information we need. */
7560 if (!conversion_path
)
7561 conversion_path
= BASELINK_BINFO (fns
);
7562 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
7563 binfo
= BASELINK_BINFO (fns
);
7564 optype
= BASELINK_OPTYPE (fns
);
7565 fns
= BASELINK_FUNCTIONS (fns
);
7566 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
7568 explicit_targs
= TREE_OPERAND (fns
, 1);
7569 fns
= TREE_OPERAND (fns
, 0);
7572 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
7573 || TREE_CODE (fns
) == TEMPLATE_DECL
7574 || TREE_CODE (fns
) == OVERLOAD
);
7575 fn
= get_first_fn (fns
);
7576 name
= DECL_NAME (fn
);
7578 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
7579 gcc_assert (CLASS_TYPE_P (basetype
));
7581 if (processing_template_decl
)
7583 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
7584 instance
= build_non_dependent_expr (instance
);
7586 make_args_non_dependent (*args
);
7589 user_args
= args
== NULL
? NULL
: *args
;
7590 /* Under DR 147 A::A() is an invalid constructor call,
7591 not a functional cast. */
7592 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
7594 if (! (complain
& tf_error
))
7595 return error_mark_node
;
7597 if (permerror (input_location
,
7598 "cannot call constructor %<%T::%D%> directly",
7600 inform (input_location
, "for a function-style cast, remove the "
7601 "redundant %<::%D%>", name
);
7602 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
7607 /* Figure out whether to skip the first argument for the error
7608 message we will display to users if an error occurs. We don't
7609 want to display any compiler-generated arguments. The "this"
7610 pointer hasn't been added yet. However, we must remove the VTT
7611 pointer if this is a call to a base-class constructor or
7613 skip_first_for_error
= false;
7614 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
7616 /* Callers should explicitly indicate whether they want to construct
7617 the complete object or just the part without virtual bases. */
7618 gcc_assert (name
!= ctor_identifier
);
7619 /* Similarly for destructors. */
7620 gcc_assert (name
!= dtor_identifier
);
7621 /* Remove the VTT pointer, if present. */
7622 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
7623 && CLASSTYPE_VBASECLASSES (basetype
))
7624 skip_first_for_error
= true;
7627 /* Process the argument list. */
7628 if (args
!= NULL
&& *args
!= NULL
)
7630 *args
= resolve_args (*args
, complain
);
7632 return error_mark_node
;
7635 /* Consider the object argument to be used even if we end up selecting a
7636 static member function. */
7637 instance
= mark_type_use (instance
);
7639 /* It's OK to call destructors and constructors on cv-qualified objects.
7640 Therefore, convert the INSTANCE to the unqualified type, if
7642 if (DECL_DESTRUCTOR_P (fn
)
7643 || DECL_CONSTRUCTOR_P (fn
))
7645 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
7647 instance
= build_this (instance
);
7648 instance
= build_nop (build_pointer_type (basetype
), instance
);
7649 instance
= build_fold_indirect_ref (instance
);
7652 if (DECL_DESTRUCTOR_P (fn
))
7653 name
= complete_dtor_identifier
;
7655 first_mem_arg
= instance
;
7657 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7658 p
= conversion_obstack_alloc (0);
7660 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
7661 initializer, not T({ }). */
7662 if (DECL_CONSTRUCTOR_P (fn
) && args
!= NULL
&& !vec_safe_is_empty (*args
)
7663 && BRACE_ENCLOSED_INITIALIZER_P ((**args
)[0])
7664 && CONSTRUCTOR_IS_DIRECT_INIT ((**args
)[0]))
7666 tree init_list
= (**args
)[0];
7667 tree init
= NULL_TREE
;
7669 gcc_assert ((*args
)->length () == 1
7670 && !(flags
& LOOKUP_ONLYCONVERTING
));
7672 /* If the initializer list has no elements and T is a class type with
7673 a default constructor, the object is value-initialized. Handle
7674 this here so we don't need to handle it wherever we use
7675 build_special_member_call. */
7676 if (CONSTRUCTOR_NELTS (init_list
) == 0
7677 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
7678 /* For a user-provided default constructor, use the normal
7679 mechanisms so that protected access works. */
7680 && !type_has_user_provided_default_constructor (basetype
)
7681 && !processing_template_decl
)
7682 init
= build_value_init (basetype
, complain
);
7684 /* If BASETYPE is an aggregate, we need to do aggregate
7686 else if (CP_AGGREGATE_TYPE_P (basetype
))
7687 init
= digest_init (basetype
, init_list
, complain
);
7691 if (INDIRECT_REF_P (instance
)
7692 && integer_zerop (TREE_OPERAND (instance
, 0)))
7693 return get_target_expr_sfinae (init
, complain
);
7694 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
7695 TREE_SIDE_EFFECTS (init
) = true;
7699 /* Otherwise go ahead with overload resolution. */
7700 add_list_candidates (fns
, first_mem_arg
, init_list
,
7701 basetype
, explicit_targs
, template_only
,
7702 conversion_path
, access_binfo
, flags
,
7703 &candidates
, complain
);
7707 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
7708 explicit_targs
, template_only
, conversion_path
,
7709 access_binfo
, flags
, &candidates
, complain
);
7711 any_viable_p
= false;
7712 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
7716 if (complain
& tf_error
)
7718 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
7719 cxx_incomplete_type_error (instance
, basetype
);
7721 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
7722 basetype
, optype
, build_tree_list_vec (user_args
),
7723 TREE_TYPE (instance
));
7730 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
7731 arglist
= build_tree_list_vec (user_args
);
7732 if (skip_first_for_error
)
7733 arglist
= TREE_CHAIN (arglist
);
7734 error ("no matching function for call to %<%T::%s(%A)%#V%>",
7735 basetype
, pretty_name
, arglist
,
7736 TREE_TYPE (instance
));
7740 print_z_candidates (location_of (name
), candidates
);
7742 call
= error_mark_node
;
7746 cand
= tourney (candidates
, complain
);
7753 if (complain
& tf_error
)
7755 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
7756 arglist
= build_tree_list_vec (user_args
);
7757 if (skip_first_for_error
)
7758 arglist
= TREE_CHAIN (arglist
);
7759 error ("call of overloaded %<%s(%A)%> is ambiguous", pretty_name
,
7761 print_z_candidates (location_of (name
), candidates
);
7765 call
= error_mark_node
;
7772 if (!(flags
& LOOKUP_NONVIRTUAL
)
7773 && DECL_PURE_VIRTUAL_P (fn
)
7774 && instance
== current_class_ref
7775 && (DECL_CONSTRUCTOR_P (current_function_decl
)
7776 || DECL_DESTRUCTOR_P (current_function_decl
))
7777 && (complain
& tf_warning
))
7778 /* This is not an error, it is runtime undefined
7780 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
) ?
7781 "pure virtual %q#D called from constructor"
7782 : "pure virtual %q#D called from destructor"),
7785 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
7786 && is_dummy_object (instance
))
7788 instance
= maybe_resolve_dummy (instance
);
7789 if (instance
== error_mark_node
)
7790 call
= error_mark_node
;
7791 else if (!is_dummy_object (instance
))
7793 /* We captured 'this' in the current lambda now that
7794 we know we really need it. */
7795 cand
->first_arg
= instance
;
7799 if (complain
& tf_error
)
7800 error ("cannot call member function %qD without object",
7802 call
= error_mark_node
;
7806 if (call
!= error_mark_node
)
7808 /* Optimize away vtable lookup if we know that this
7809 function can't be overridden. We need to check if
7810 the context and the type where we found fn are the same,
7811 actually FN might be defined in a different class
7812 type because of a using-declaration. In this case, we
7813 do not want to perform a non-virtual call. */
7814 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
7815 && same_type_ignoring_top_level_qualifiers_p
7816 (DECL_CONTEXT (fn
), BINFO_TYPE (binfo
))
7817 && resolves_to_fixed_type_p (instance
, 0))
7818 flags
|= LOOKUP_NONVIRTUAL
;
7820 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
7821 /* Now we know what function is being called. */
7824 /* Build the actual CALL_EXPR. */
7825 call
= build_over_call (cand
, flags
, complain
);
7826 /* In an expression of the form `a->f()' where `f' turns
7827 out to be a static member function, `a' is
7828 none-the-less evaluated. */
7829 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
7830 && !is_dummy_object (instance
)
7831 && TREE_SIDE_EFFECTS (instance
))
7832 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
),
7834 else if (call
!= error_mark_node
7835 && DECL_DESTRUCTOR_P (cand
->fn
)
7836 && !VOID_TYPE_P (TREE_TYPE (call
)))
7837 /* An explicit call of the form "x->~X()" has type
7838 "void". However, on platforms where destructors
7839 return "this" (i.e., those where
7840 targetm.cxx.cdtor_returns_this is true), such calls
7841 will appear to have a return value of pointer type
7842 to the low-level call machinery. We do not want to
7843 change the low-level machinery, since we want to be
7844 able to optimize "delete f()" on such platforms as
7845 "operator delete(~X(f()))" (rather than generating
7846 "t = f(), ~X(t), operator delete (t)"). */
7847 call
= build_nop (void_type_node
, call
);
7852 if (processing_template_decl
&& call
!= error_mark_node
)
7854 bool cast_to_void
= false;
7856 if (TREE_CODE (call
) == COMPOUND_EXPR
)
7857 call
= TREE_OPERAND (call
, 1);
7858 else if (TREE_CODE (call
) == NOP_EXPR
)
7860 cast_to_void
= true;
7861 call
= TREE_OPERAND (call
, 0);
7863 if (INDIRECT_REF_P (call
))
7864 call
= TREE_OPERAND (call
, 0);
7865 call
= (build_min_non_dep_call_vec
7867 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
7868 orig_instance
, orig_fns
, NULL_TREE
),
7870 SET_EXPR_LOCATION (call
, input_location
);
7871 call
= convert_from_reference (call
);
7873 call
= build_nop (void_type_node
, call
);
7876 /* Free all the conversions we allocated. */
7877 obstack_free (&conversion_obstack
, p
);
7879 if (orig_args
!= NULL
)
7880 release_tree_vector (orig_args
);
7885 /* Wrapper for above. */
7888 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
7889 tree conversion_path
, int flags
,
7890 tree
*fn_p
, tsubst_flags_t complain
)
7893 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
7894 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
7896 timevar_cond_stop (TV_OVERLOAD
, subtime
);
7900 /* Returns true iff standard conversion sequence ICS1 is a proper
7901 subsequence of ICS2. */
7904 is_subseq (conversion
*ics1
, conversion
*ics2
)
7906 /* We can assume that a conversion of the same code
7907 between the same types indicates a subsequence since we only get
7908 here if the types we are converting from are the same. */
7910 while (ics1
->kind
== ck_rvalue
7911 || ics1
->kind
== ck_lvalue
)
7912 ics1
= next_conversion (ics1
);
7916 while (ics2
->kind
== ck_rvalue
7917 || ics2
->kind
== ck_lvalue
)
7918 ics2
= next_conversion (ics2
);
7920 if (ics2
->kind
== ck_user
7921 || ics2
->kind
== ck_ambig
7922 || ics2
->kind
== ck_aggr
7923 || ics2
->kind
== ck_list
7924 || ics2
->kind
== ck_identity
)
7925 /* At this point, ICS1 cannot be a proper subsequence of
7926 ICS2. We can get a USER_CONV when we are comparing the
7927 second standard conversion sequence of two user conversion
7931 ics2
= next_conversion (ics2
);
7933 if (ics2
->kind
== ics1
->kind
7934 && same_type_p (ics2
->type
, ics1
->type
)
7935 && same_type_p (next_conversion (ics2
)->type
,
7936 next_conversion (ics1
)->type
))
7941 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
7942 be any _TYPE nodes. */
7945 is_properly_derived_from (tree derived
, tree base
)
7947 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
7950 /* We only allow proper derivation here. The DERIVED_FROM_P macro
7951 considers every class derived from itself. */
7952 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
7953 && DERIVED_FROM_P (base
, derived
));
7956 /* We build the ICS for an implicit object parameter as a pointer
7957 conversion sequence. However, such a sequence should be compared
7958 as if it were a reference conversion sequence. If ICS is the
7959 implicit conversion sequence for an implicit object parameter,
7960 modify it accordingly. */
7963 maybe_handle_implicit_object (conversion
**ics
)
7967 /* [over.match.funcs]
7969 For non-static member functions, the type of the
7970 implicit object parameter is "reference to cv X"
7971 where X is the class of which the function is a
7972 member and cv is the cv-qualification on the member
7973 function declaration. */
7974 conversion
*t
= *ics
;
7975 tree reference_type
;
7977 /* The `this' parameter is a pointer to a class type. Make the
7978 implicit conversion talk about a reference to that same class
7980 reference_type
= TREE_TYPE (t
->type
);
7981 reference_type
= build_reference_type (reference_type
);
7983 if (t
->kind
== ck_qual
)
7984 t
= next_conversion (t
);
7985 if (t
->kind
== ck_ptr
)
7986 t
= next_conversion (t
);
7987 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
7988 t
= direct_reference_binding (reference_type
, t
);
7990 t
->rvaluedness_matches_p
= 0;
7995 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
7996 and return the initial reference binding conversion. Otherwise,
7997 leave *ICS unchanged and return NULL. */
8000 maybe_handle_ref_bind (conversion
**ics
)
8002 if ((*ics
)->kind
== ck_ref_bind
)
8004 conversion
*old_ics
= *ics
;
8005 *ics
= next_conversion (old_ics
);
8006 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
8013 /* Compare two implicit conversion sequences according to the rules set out in
8014 [over.ics.rank]. Return values:
8016 1: ics1 is better than ics2
8017 -1: ics2 is better than ics1
8018 0: ics1 and ics2 are indistinguishable */
8021 compare_ics (conversion
*ics1
, conversion
*ics2
)
8027 tree deref_from_type1
= NULL_TREE
;
8028 tree deref_from_type2
= NULL_TREE
;
8029 tree deref_to_type1
= NULL_TREE
;
8030 tree deref_to_type2
= NULL_TREE
;
8031 conversion_rank rank1
, rank2
;
8033 /* REF_BINDING is nonzero if the result of the conversion sequence
8034 is a reference type. In that case REF_CONV is the reference
8035 binding conversion. */
8036 conversion
*ref_conv1
;
8037 conversion
*ref_conv2
;
8039 /* Handle implicit object parameters. */
8040 maybe_handle_implicit_object (&ics1
);
8041 maybe_handle_implicit_object (&ics2
);
8043 /* Handle reference parameters. */
8044 ref_conv1
= maybe_handle_ref_bind (&ics1
);
8045 ref_conv2
= maybe_handle_ref_bind (&ics2
);
8047 /* List-initialization sequence L1 is a better conversion sequence than
8048 list-initialization sequence L2 if L1 converts to
8049 std::initializer_list<X> for some X and L2 does not. */
8050 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
8052 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
8057 When comparing the basic forms of implicit conversion sequences (as
8058 defined in _over.best.ics_)
8060 --a standard conversion sequence (_over.ics.scs_) is a better
8061 conversion sequence than a user-defined conversion sequence
8062 or an ellipsis conversion sequence, and
8064 --a user-defined conversion sequence (_over.ics.user_) is a
8065 better conversion sequence than an ellipsis conversion sequence
8066 (_over.ics.ellipsis_). */
8067 rank1
= CONVERSION_RANK (ics1
);
8068 rank2
= CONVERSION_RANK (ics2
);
8072 else if (rank1
< rank2
)
8075 if (rank1
== cr_bad
)
8077 /* Both ICS are bad. We try to make a decision based on what would
8078 have happened if they'd been good. This is not an extension,
8079 we'll still give an error when we build up the call; this just
8080 helps us give a more helpful error message. */
8081 rank1
= BAD_CONVERSION_RANK (ics1
);
8082 rank2
= BAD_CONVERSION_RANK (ics2
);
8086 else if (rank1
< rank2
)
8089 /* We couldn't make up our minds; try to figure it out below. */
8092 if (ics1
->ellipsis_p
)
8093 /* Both conversions are ellipsis conversions. */
8096 /* User-defined conversion sequence U1 is a better conversion sequence
8097 than another user-defined conversion sequence U2 if they contain the
8098 same user-defined conversion operator or constructor and if the sec-
8099 ond standard conversion sequence of U1 is better than the second
8100 standard conversion sequence of U2. */
8102 /* Handle list-conversion with the same code even though it isn't always
8103 ranked as a user-defined conversion and it doesn't have a second
8104 standard conversion sequence; it will still have the desired effect.
8105 Specifically, we need to do the reference binding comparison at the
8106 end of this function. */
8108 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
|| ics1
->kind
== ck_aggr
)
8113 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
8114 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
8115 || t1
->kind
== ck_list
)
8117 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
8118 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
8119 || t2
->kind
== ck_list
)
8122 if (t1
->kind
!= t2
->kind
)
8124 else if (t1
->kind
== ck_user
)
8126 if (t1
->cand
->fn
!= t2
->cand
->fn
)
8131 /* For ambiguous or aggregate conversions, use the target type as
8132 a proxy for the conversion function. */
8133 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
8137 /* We can just fall through here, after setting up
8138 FROM_TYPE1 and FROM_TYPE2. */
8139 from_type1
= t1
->type
;
8140 from_type2
= t2
->type
;
8147 /* We're dealing with two standard conversion sequences.
8151 Standard conversion sequence S1 is a better conversion
8152 sequence than standard conversion sequence S2 if
8154 --S1 is a proper subsequence of S2 (comparing the conversion
8155 sequences in the canonical form defined by _over.ics.scs_,
8156 excluding any Lvalue Transformation; the identity
8157 conversion sequence is considered to be a subsequence of
8158 any non-identity conversion sequence */
8161 while (t1
->kind
!= ck_identity
)
8162 t1
= next_conversion (t1
);
8163 from_type1
= t1
->type
;
8166 while (t2
->kind
!= ck_identity
)
8167 t2
= next_conversion (t2
);
8168 from_type2
= t2
->type
;
8171 /* One sequence can only be a subsequence of the other if they start with
8172 the same type. They can start with different types when comparing the
8173 second standard conversion sequence in two user-defined conversion
8175 if (same_type_p (from_type1
, from_type2
))
8177 if (is_subseq (ics1
, ics2
))
8179 if (is_subseq (ics2
, ics1
))
8187 --the rank of S1 is better than the rank of S2 (by the rules
8190 Standard conversion sequences are ordered by their ranks: an Exact
8191 Match is a better conversion than a Promotion, which is a better
8192 conversion than a Conversion.
8194 Two conversion sequences with the same rank are indistinguishable
8195 unless one of the following rules applies:
8197 --A conversion that does not a convert a pointer, pointer to member,
8198 or std::nullptr_t to bool is better than one that does.
8200 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
8201 so that we do not have to check it explicitly. */
8202 if (ics1
->rank
< ics2
->rank
)
8204 else if (ics2
->rank
< ics1
->rank
)
8207 to_type1
= ics1
->type
;
8208 to_type2
= ics2
->type
;
8210 /* A conversion from scalar arithmetic type to complex is worse than a
8211 conversion between scalar arithmetic types. */
8212 if (same_type_p (from_type1
, from_type2
)
8213 && ARITHMETIC_TYPE_P (from_type1
)
8214 && ARITHMETIC_TYPE_P (to_type1
)
8215 && ARITHMETIC_TYPE_P (to_type2
)
8216 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
8217 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
8219 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
8225 if (TYPE_PTR_P (from_type1
)
8226 && TYPE_PTR_P (from_type2
)
8227 && TYPE_PTR_P (to_type1
)
8228 && TYPE_PTR_P (to_type2
))
8230 deref_from_type1
= TREE_TYPE (from_type1
);
8231 deref_from_type2
= TREE_TYPE (from_type2
);
8232 deref_to_type1
= TREE_TYPE (to_type1
);
8233 deref_to_type2
= TREE_TYPE (to_type2
);
8235 /* The rules for pointers to members A::* are just like the rules
8236 for pointers A*, except opposite: if B is derived from A then
8237 A::* converts to B::*, not vice versa. For that reason, we
8238 switch the from_ and to_ variables here. */
8239 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
8240 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
8241 || (TYPE_PTRMEMFUNC_P (from_type1
)
8242 && TYPE_PTRMEMFUNC_P (from_type2
)
8243 && TYPE_PTRMEMFUNC_P (to_type1
)
8244 && TYPE_PTRMEMFUNC_P (to_type2
)))
8246 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
8247 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
8248 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
8249 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
8252 if (deref_from_type1
!= NULL_TREE
8253 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
8254 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
8256 /* This was one of the pointer or pointer-like conversions.
8260 --If class B is derived directly or indirectly from class A,
8261 conversion of B* to A* is better than conversion of B* to
8262 void*, and conversion of A* to void* is better than
8263 conversion of B* to void*. */
8264 if (VOID_TYPE_P (deref_to_type1
)
8265 && VOID_TYPE_P (deref_to_type2
))
8267 if (is_properly_derived_from (deref_from_type1
,
8270 else if (is_properly_derived_from (deref_from_type2
,
8274 else if (VOID_TYPE_P (deref_to_type1
)
8275 || VOID_TYPE_P (deref_to_type2
))
8277 if (same_type_p (deref_from_type1
, deref_from_type2
))
8279 if (VOID_TYPE_P (deref_to_type2
))
8281 if (is_properly_derived_from (deref_from_type1
,
8285 /* We know that DEREF_TO_TYPE1 is `void' here. */
8286 else if (is_properly_derived_from (deref_from_type1
,
8291 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
8292 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
8296 --If class B is derived directly or indirectly from class A
8297 and class C is derived directly or indirectly from B,
8299 --conversion of C* to B* is better than conversion of C* to
8302 --conversion of B* to A* is better than conversion of C* to
8304 if (same_type_p (deref_from_type1
, deref_from_type2
))
8306 if (is_properly_derived_from (deref_to_type1
,
8309 else if (is_properly_derived_from (deref_to_type2
,
8313 else if (same_type_p (deref_to_type1
, deref_to_type2
))
8315 if (is_properly_derived_from (deref_from_type2
,
8318 else if (is_properly_derived_from (deref_from_type1
,
8324 else if (CLASS_TYPE_P (non_reference (from_type1
))
8325 && same_type_p (from_type1
, from_type2
))
8327 tree from
= non_reference (from_type1
);
8331 --binding of an expression of type C to a reference of type
8332 B& is better than binding an expression of type C to a
8333 reference of type A&
8335 --conversion of C to B is better than conversion of C to A, */
8336 if (is_properly_derived_from (from
, to_type1
)
8337 && is_properly_derived_from (from
, to_type2
))
8339 if (is_properly_derived_from (to_type1
, to_type2
))
8341 else if (is_properly_derived_from (to_type2
, to_type1
))
8345 else if (CLASS_TYPE_P (non_reference (to_type1
))
8346 && same_type_p (to_type1
, to_type2
))
8348 tree to
= non_reference (to_type1
);
8352 --binding of an expression of type B to a reference of type
8353 A& is better than binding an expression of type C to a
8354 reference of type A&,
8356 --conversion of B to A is better than conversion of C to A */
8357 if (is_properly_derived_from (from_type1
, to
)
8358 && is_properly_derived_from (from_type2
, to
))
8360 if (is_properly_derived_from (from_type2
, from_type1
))
8362 else if (is_properly_derived_from (from_type1
, from_type2
))
8369 --S1 and S2 differ only in their qualification conversion and yield
8370 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
8371 qualification signature of type T1 is a proper subset of the cv-
8372 qualification signature of type T2 */
8373 if (ics1
->kind
== ck_qual
8374 && ics2
->kind
== ck_qual
8375 && same_type_p (from_type1
, from_type2
))
8377 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
8384 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
8385 to an implicit object parameter, and either S1 binds an lvalue reference
8386 to an lvalue and S2 binds an rvalue reference or S1 binds an rvalue
8387 reference to an rvalue and S2 binds an lvalue reference
8388 (C++0x draft standard, 13.3.3.2)
8390 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
8391 types to which the references refer are the same type except for
8392 top-level cv-qualifiers, and the type to which the reference
8393 initialized by S2 refers is more cv-qualified than the type to
8394 which the reference initialized by S1 refers.
8396 DR 1328 [over.match.best]: the context is an initialization by
8397 conversion function for direct reference binding (13.3.1.6) of a
8398 reference to function type, the return type of F1 is the same kind of
8399 reference (i.e. lvalue or rvalue) as the reference being initialized,
8400 and the return type of F2 is not. */
8402 if (ref_conv1
&& ref_conv2
)
8404 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
8405 && (ref_conv1
->rvaluedness_matches_p
8406 != ref_conv2
->rvaluedness_matches_p
)
8407 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
8408 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
8409 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
8411 return (ref_conv1
->rvaluedness_matches_p
8412 - ref_conv2
->rvaluedness_matches_p
);
8415 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
8416 return comp_cv_qualification (TREE_TYPE (ref_conv2
->type
),
8417 TREE_TYPE (ref_conv1
->type
));
8420 /* Neither conversion sequence is better than the other. */
8424 /* The source type for this standard conversion sequence. */
8427 source_type (conversion
*t
)
8429 for (;; t
= next_conversion (t
))
8431 if (t
->kind
== ck_user
8432 || t
->kind
== ck_ambig
8433 || t
->kind
== ck_identity
)
8439 /* Note a warning about preferring WINNER to LOSER. We do this by storing
8440 a pointer to LOSER and re-running joust to produce the warning if WINNER
8441 is actually used. */
8444 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
8446 candidate_warning
*cw
= (candidate_warning
*)
8447 conversion_obstack_alloc (sizeof (candidate_warning
));
8449 cw
->next
= winner
->warnings
;
8450 winner
->warnings
= cw
;
8453 /* Compare two candidates for overloading as described in
8454 [over.match.best]. Return values:
8456 1: cand1 is better than cand2
8457 -1: cand2 is better than cand1
8458 0: cand1 and cand2 are indistinguishable */
8461 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
8462 tsubst_flags_t complain
)
8465 int off1
= 0, off2
= 0;
8469 /* Candidates that involve bad conversions are always worse than those
8471 if (cand1
->viable
> cand2
->viable
)
8473 if (cand1
->viable
< cand2
->viable
)
8476 /* If we have two pseudo-candidates for conversions to the same type,
8477 or two candidates for the same function, arbitrarily pick one. */
8478 if (cand1
->fn
== cand2
->fn
8479 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
8482 /* Prefer a non-deleted function over an implicitly deleted move
8483 constructor or assignment operator. This differs slightly from the
8484 wording for issue 1402 (which says the move op is ignored by overload
8485 resolution), but this way produces better error messages. */
8486 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
8487 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
8488 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
8490 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
8491 && move_fn_p (cand1
->fn
))
8493 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
8494 && move_fn_p (cand2
->fn
))
8498 /* a viable function F1
8499 is defined to be a better function than another viable function F2 if
8500 for all arguments i, ICSi(F1) is not a worse conversion sequence than
8501 ICSi(F2), and then */
8503 /* for some argument j, ICSj(F1) is a better conversion sequence than
8506 /* For comparing static and non-static member functions, we ignore
8507 the implicit object parameter of the non-static function. The
8508 standard says to pretend that the static function has an object
8509 parm, but that won't work with operator overloading. */
8510 len
= cand1
->num_convs
;
8511 if (len
!= cand2
->num_convs
)
8513 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
8514 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
8516 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
8517 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
8518 /* We're comparing a near-match list constructor and a near-match
8519 non-list constructor. Just treat them as unordered. */
8522 gcc_assert (static_1
!= static_2
);
8533 for (i
= 0; i
< len
; ++i
)
8535 conversion
*t1
= cand1
->convs
[i
+ off1
];
8536 conversion
*t2
= cand2
->convs
[i
+ off2
];
8537 int comp
= compare_ics (t1
, t2
);
8541 if ((complain
& tf_warning
)
8543 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
8544 == cr_std
+ cr_promotion
)
8545 && t1
->kind
== ck_std
8546 && t2
->kind
== ck_std
8547 && TREE_CODE (t1
->type
) == INTEGER_TYPE
8548 && TREE_CODE (t2
->type
) == INTEGER_TYPE
8549 && (TYPE_PRECISION (t1
->type
)
8550 == TYPE_PRECISION (t2
->type
))
8551 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
8552 || (TREE_CODE (next_conversion (t1
)->type
)
8555 tree type
= next_conversion (t1
)->type
;
8557 struct z_candidate
*w
, *l
;
8559 type1
= t1
->type
, type2
= t2
->type
,
8560 w
= cand1
, l
= cand2
;
8562 type1
= t2
->type
, type2
= t1
->type
,
8563 w
= cand2
, l
= cand1
;
8567 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
8568 type
, type1
, type2
);
8569 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
8575 if (winner
&& comp
!= winner
)
8584 /* warn about confusing overload resolution for user-defined conversions,
8585 either between a constructor and a conversion op, or between two
8587 if ((complain
& tf_warning
)
8588 && winner
&& warn_conversion
&& cand1
->second_conv
8589 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
8590 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
8592 struct z_candidate
*w
, *l
;
8593 bool give_warning
= false;
8596 w
= cand1
, l
= cand2
;
8598 w
= cand2
, l
= cand1
;
8600 /* We don't want to complain about `X::operator T1 ()'
8601 beating `X::operator T2 () const', when T2 is a no less
8602 cv-qualified version of T1. */
8603 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
8604 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
8606 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
8607 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
8609 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
8614 if (!comp_ptr_ttypes (t
, f
))
8615 give_warning
= true;
8618 give_warning
= true;
8624 tree source
= source_type (w
->convs
[0]);
8625 if (! DECL_CONSTRUCTOR_P (w
->fn
))
8626 source
= TREE_TYPE (source
);
8627 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
8628 && warning (OPT_Wconversion
, " for conversion from %qT to %qT",
8629 source
, w
->second_conv
->type
))
8631 inform (input_location
, " because conversion sequence for the argument is better");
8641 /* DR 495 moved this tiebreaker above the template ones. */
8643 the context is an initialization by user-defined conversion (see
8644 _dcl.init_ and _over.match.user_) and the standard conversion
8645 sequence from the return type of F1 to the destination type (i.e.,
8646 the type of the entity being initialized) is a better conversion
8647 sequence than the standard conversion sequence from the return type
8648 of F2 to the destination type. */
8650 if (cand1
->second_conv
)
8652 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
8658 F1 is a non-template function and F2 is a template function
8661 if (!cand1
->template_decl
&& cand2
->template_decl
)
8663 else if (cand1
->template_decl
&& !cand2
->template_decl
)
8667 F1 and F2 are template functions and the function template for F1 is
8668 more specialized than the template for F2 according to the partial
8671 if (cand1
->template_decl
&& cand2
->template_decl
)
8673 winner
= more_specialized_fn
8674 (TI_TEMPLATE (cand1
->template_decl
),
8675 TI_TEMPLATE (cand2
->template_decl
),
8676 /* [temp.func.order]: The presence of unused ellipsis and default
8677 arguments has no effect on the partial ordering of function
8678 templates. add_function_candidate() will not have
8679 counted the "this" argument for constructors. */
8680 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
8685 /* Check whether we can discard a builtin candidate, either because we
8686 have two identical ones or matching builtin and non-builtin candidates.
8688 (Pedantically in the latter case the builtin which matched the user
8689 function should not be added to the overload set, but we spot it here.
8692 ... the builtin candidates include ...
8693 - do not have the same parameter type list as any non-template
8694 non-member candidate. */
8696 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
8698 for (i
= 0; i
< len
; ++i
)
8699 if (!same_type_p (cand1
->convs
[i
]->type
,
8700 cand2
->convs
[i
]->type
))
8702 if (i
== cand1
->num_convs
)
8704 if (cand1
->fn
== cand2
->fn
)
8705 /* Two built-in candidates; arbitrarily pick one. */
8707 else if (identifier_p (cand1
->fn
))
8708 /* cand1 is built-in; prefer cand2. */
8711 /* cand2 is built-in; prefer cand1. */
8716 /* For candidates of a multi-versioned function, make the version with
8717 the highest priority win. This version will be checked for dispatching
8718 first. If this version can be inlined into the caller, the front-end
8719 will simply make a direct call to this function. */
8721 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
8722 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
8723 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
8724 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
8726 tree f1
= TREE_TYPE (cand1
->fn
);
8727 tree f2
= TREE_TYPE (cand2
->fn
);
8728 tree p1
= TYPE_ARG_TYPES (f1
);
8729 tree p2
= TYPE_ARG_TYPES (f2
);
8731 /* Check if cand1->fn and cand2->fn are versions of the same function. It
8732 is possible that cand1->fn and cand2->fn are function versions but of
8733 different functions. Check types to see if they are versions of the same
8735 if (compparms (p1
, p2
)
8736 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
8738 /* Always make the version with the higher priority, more
8739 specialized, win. */
8740 gcc_assert (targetm
.compare_version_priority
);
8741 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
8748 /* If the two function declarations represent the same function (this can
8749 happen with declarations in multiple scopes and arg-dependent lookup),
8750 arbitrarily choose one. But first make sure the default args we're
8752 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
8753 && equal_functions (cand1
->fn
, cand2
->fn
))
8755 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
8756 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
8758 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
8760 for (i
= 0; i
< len
; ++i
)
8762 /* Don't crash if the fn is variadic. */
8765 parms1
= TREE_CHAIN (parms1
);
8766 parms2
= TREE_CHAIN (parms2
);
8770 parms1
= TREE_CHAIN (parms1
);
8772 parms2
= TREE_CHAIN (parms2
);
8776 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
8777 TREE_PURPOSE (parms2
)))
8781 if (complain
& tf_error
)
8783 if (permerror (input_location
,
8784 "default argument mismatch in "
8785 "overload resolution"))
8787 inform (input_location
,
8788 " candidate 1: %q+#F", cand1
->fn
);
8789 inform (input_location
,
8790 " candidate 2: %q+#F", cand2
->fn
);
8797 add_warning (cand1
, cand2
);
8800 parms1
= TREE_CHAIN (parms1
);
8801 parms2
= TREE_CHAIN (parms2
);
8809 /* Extension: If the worst conversion for one candidate is worse than the
8810 worst conversion for the other, take the first. */
8811 if (!pedantic
&& (complain
& tf_warning_or_error
))
8813 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
8814 struct z_candidate
*w
= 0, *l
= 0;
8816 for (i
= 0; i
< len
; ++i
)
8818 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
8819 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
8820 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
8821 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
8824 winner
= 1, w
= cand1
, l
= cand2
;
8826 winner
= -1, w
= cand2
, l
= cand1
;
8829 /* Don't choose a deleted function over ambiguity. */
8830 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
8834 pedwarn (input_location
, 0,
8835 "ISO C++ says that these are ambiguous, even "
8836 "though the worst conversion for the first is better than "
8837 "the worst conversion for the second:");
8838 print_z_candidate (input_location
, _("candidate 1:"), w
);
8839 print_z_candidate (input_location
, _("candidate 2:"), l
);
8847 gcc_assert (!winner
);
8851 /* Given a list of candidates for overloading, find the best one, if any.
8852 This algorithm has a worst case of O(2n) (winner is last), and a best
8853 case of O(n/2) (totally ambiguous); much better than a sorting
8856 static struct z_candidate
*
8857 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
8859 struct z_candidate
*champ
= candidates
, *challenger
;
8861 int champ_compared_to_predecessor
= 0;
8863 /* Walk through the list once, comparing each current champ to the next
8864 candidate, knocking out a candidate or two with each comparison. */
8866 for (challenger
= champ
->next
; challenger
; )
8868 fate
= joust (champ
, challenger
, 0, complain
);
8870 challenger
= challenger
->next
;
8875 champ
= challenger
->next
;
8878 champ_compared_to_predecessor
= 0;
8883 champ_compared_to_predecessor
= 1;
8886 challenger
= champ
->next
;
8890 /* Make sure the champ is better than all the candidates it hasn't yet
8891 been compared to. */
8893 for (challenger
= candidates
;
8895 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
8896 challenger
= challenger
->next
)
8898 fate
= joust (champ
, challenger
, 0, complain
);
8906 /* Returns nonzero if things of type FROM can be converted to TO. */
8909 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
8911 tree arg
= NULL_TREE
;
8912 /* implicit_conversion only considers user-defined conversions
8913 if it has an expression for the call argument list. */
8914 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
8915 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
8916 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
8919 /* Returns nonzero if things of type FROM can be converted to TO with a
8920 standard conversion. */
8923 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
8925 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
8928 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
8931 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
8932 tsubst_flags_t complain
)
8938 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8939 p
= conversion_obstack_alloc (0);
8940 /* We want to discard any access checks done for this test,
8941 as we might not be in the appropriate access context and
8942 we'll do the check again when we actually perform the
8944 push_deferring_access_checks (dk_deferred
);
8946 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
8948 ok_p
= (t
&& !t
->bad_p
);
8950 /* Discard the access checks now. */
8951 pop_deferring_access_checks ();
8952 /* Free all the conversions we allocated. */
8953 obstack_free (&conversion_obstack
, p
);
8958 /* Like can_convert_arg, but allows dubious conversions as well. */
8961 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
8962 tsubst_flags_t complain
)
8967 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8968 p
= conversion_obstack_alloc (0);
8969 /* Try to perform the conversion. */
8970 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
8972 /* Free all the conversions we allocated. */
8973 obstack_free (&conversion_obstack
, p
);
8978 /* Convert EXPR to TYPE. Return the converted expression.
8980 Note that we allow bad conversions here because by the time we get to
8981 this point we are committed to doing the conversion. If we end up
8982 doing a bad conversion, convert_like will complain. */
8985 perform_implicit_conversion_flags (tree type
, tree expr
,
8986 tsubst_flags_t complain
, int flags
)
8990 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
8992 if (error_operand_p (expr
))
8993 return error_mark_node
;
8995 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8996 p
= conversion_obstack_alloc (0);
8998 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
9004 if (complain
& tf_error
)
9006 /* If expr has unknown type, then it is an overloaded function.
9007 Call instantiate_type to get good error messages. */
9008 if (TREE_TYPE (expr
) == unknown_type_node
)
9009 instantiate_type (type
, expr
, complain
);
9010 else if (invalid_nonstatic_memfn_p (expr
, complain
))
9011 /* We gave an error. */;
9013 error_at (loc
, "could not convert %qE from %qT to %qT", expr
,
9014 TREE_TYPE (expr
), type
);
9016 expr
= error_mark_node
;
9018 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
9020 /* In a template, we are only concerned about determining the
9021 type of non-dependent expressions, so we do not have to
9022 perform the actual conversion. But for initializers, we
9023 need to be able to perform it at instantiation
9024 (or fold_non_dependent_expr) time. */
9025 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
9026 if (!(flags
& LOOKUP_ONLYCONVERTING
))
9027 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
9030 expr
= convert_like (conv
, expr
, complain
);
9032 /* Free all the conversions we allocated. */
9033 obstack_free (&conversion_obstack
, p
);
9039 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
9041 return perform_implicit_conversion_flags (type
, expr
, complain
,
9045 /* Convert EXPR to TYPE (as a direct-initialization) if that is
9046 permitted. If the conversion is valid, the converted expression is
9047 returned. Otherwise, NULL_TREE is returned, except in the case
9048 that TYPE is a class type; in that case, an error is issued. If
9049 C_CAST_P is true, then this direct-initialization is taking
9050 place as part of a static_cast being attempted as part of a C-style
9054 perform_direct_initialization_if_possible (tree type
,
9057 tsubst_flags_t complain
)
9062 if (type
== error_mark_node
|| error_operand_p (expr
))
9063 return error_mark_node
;
9066 If the destination type is a (possibly cv-qualified) class type:
9068 -- If the initialization is direct-initialization ...,
9069 constructors are considered. ... If no constructor applies, or
9070 the overload resolution is ambiguous, the initialization is
9072 if (CLASS_TYPE_P (type
))
9074 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
9075 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
9076 &args
, type
, LOOKUP_NORMAL
, complain
);
9077 release_tree_vector (args
);
9078 return build_cplus_new (type
, expr
, complain
);
9081 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9082 p
= conversion_obstack_alloc (0);
9084 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
9086 LOOKUP_NORMAL
, complain
);
9087 if (!conv
|| conv
->bad_p
)
9090 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0, 0,
9091 /*issue_conversion_warnings=*/false,
9095 /* Free all the conversions we allocated. */
9096 obstack_free (&conversion_obstack
, p
);
9101 /* When initializing a reference that lasts longer than a full-expression,
9102 this special rule applies:
9106 The temporary to which the reference is bound or the temporary
9107 that is the complete object to which the reference is bound
9108 persists for the lifetime of the reference.
9110 The temporaries created during the evaluation of the expression
9111 initializing the reference, except the temporary to which the
9112 reference is bound, are destroyed at the end of the
9113 full-expression in which they are created.
9115 In that case, we store the converted expression into a new
9116 VAR_DECL in a new scope.
9118 However, we want to be careful not to create temporaries when
9119 they are not required. For example, given:
9122 struct D : public B {};
9126 there is no need to copy the return value from "f"; we can just
9127 extend its lifetime. Similarly, given:
9130 struct T { operator S(); };
9134 we can extend the lifetime of the return value of the conversion
9137 The next several functions are involved in this lifetime extension. */
9139 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
9140 reference is being bound to a temporary. Create and return a new
9141 VAR_DECL with the indicated TYPE; this variable will store the value to
9142 which the reference is bound. */
9145 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
9149 /* Create the variable. */
9150 var
= create_temporary_var (type
);
9152 /* Register the variable. */
9154 && (TREE_STATIC (decl
) || DECL_THREAD_LOCAL_P (decl
)))
9156 /* Namespace-scope or local static; give it a mangled name. */
9157 /* FIXME share comdat with decl? */
9160 TREE_STATIC (var
) = TREE_STATIC (decl
);
9161 DECL_TLS_MODEL (var
) = DECL_TLS_MODEL (decl
);
9162 name
= mangle_ref_init_variable (decl
);
9163 DECL_NAME (var
) = name
;
9164 SET_DECL_ASSEMBLER_NAME (var
, name
);
9165 var
= pushdecl_top_level (var
);
9168 /* Create a new cleanup level if necessary. */
9169 maybe_push_cleanup_level (type
);
9174 /* EXPR is the initializer for a variable DECL of reference or
9175 std::initializer_list type. Create, push and return a new VAR_DECL
9176 for the initializer so that it will live as long as DECL. Any
9177 cleanup for the new variable is returned through CLEANUP, and the
9178 code to initialize the new variable is returned through INITP. */
9181 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
9188 /* Create the temporary variable. */
9189 type
= TREE_TYPE (expr
);
9190 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
9191 layout_decl (var
, 0);
9192 /* If the rvalue is the result of a function call it will be
9193 a TARGET_EXPR. If it is some other construct (such as a
9194 member access expression where the underlying object is
9195 itself the result of a function call), turn it into a
9196 TARGET_EXPR here. It is important that EXPR be a
9197 TARGET_EXPR below since otherwise the INIT_EXPR will
9198 attempt to make a bitwise copy of EXPR to initialize
9200 if (TREE_CODE (expr
) != TARGET_EXPR
)
9201 expr
= get_target_expr (expr
);
9203 if (TREE_CODE (decl
) == FIELD_DECL
9204 && extra_warnings
&& !TREE_NO_WARNING (decl
))
9206 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
9207 "until the constructor exits", decl
);
9208 TREE_NO_WARNING (decl
) = true;
9211 /* Recursively extend temps in this initializer. */
9212 TARGET_EXPR_INITIAL (expr
)
9213 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
9215 /* Any reference temp has a non-trivial initializer. */
9216 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
9218 /* If the initializer is constant, put it in DECL_INITIAL so we get
9219 static initialization and use in constant expressions. */
9220 init
= maybe_constant_init (expr
);
9221 if (TREE_CONSTANT (init
))
9223 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
9225 /* 5.19 says that a constant expression can include an
9226 lvalue-rvalue conversion applied to "a glvalue of literal type
9227 that refers to a non-volatile temporary object initialized
9228 with a constant expression". Rather than try to communicate
9229 that this VAR_DECL is a temporary, just mark it constexpr.
9231 Currently this is only useful for initializer_list temporaries,
9232 since reference vars can't appear in constant expressions. */
9233 DECL_DECLARED_CONSTEXPR_P (var
) = true;
9234 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
9235 TREE_CONSTANT (var
) = true;
9237 DECL_INITIAL (var
) = init
;
9241 /* Create the INIT_EXPR that will initialize the temporary
9243 init
= build2 (INIT_EXPR
, type
, var
, expr
);
9244 if (at_function_scope_p ())
9246 add_decl_expr (var
);
9248 if (TREE_STATIC (var
))
9249 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
9252 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
9254 vec_safe_push (*cleanups
, cleanup
);
9257 /* We must be careful to destroy the temporary only
9258 after its initialization has taken place. If the
9259 initialization throws an exception, then the
9260 destructor should not be run. We cannot simply
9261 transform INIT into something like:
9263 (INIT, ({ CLEANUP_STMT; }))
9265 because emit_local_var always treats the
9266 initializer as a full-expression. Thus, the
9267 destructor would run too early; it would run at the
9268 end of initializing the reference variable, rather
9269 than at the end of the block enclosing the
9272 The solution is to pass back a cleanup expression
9273 which the caller is responsible for attaching to
9274 the statement tree. */
9278 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
9279 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
9281 if (DECL_THREAD_LOCAL_P (var
))
9282 tls_aggregates
= tree_cons (NULL_TREE
, var
,
9285 static_aggregates
= tree_cons (NULL_TREE
, var
,
9289 /* Check whether the dtor is callable. */
9290 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
9297 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
9298 initializing a variable of that TYPE. */
9301 initialize_reference (tree type
, tree expr
,
9302 int flags
, tsubst_flags_t complain
)
9306 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
9308 if (type
== error_mark_node
|| error_operand_p (expr
))
9309 return error_mark_node
;
9311 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9312 p
= conversion_obstack_alloc (0);
9314 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
9316 if (!conv
|| conv
->bad_p
)
9318 if (complain
& tf_error
)
9321 convert_like (conv
, expr
, complain
);
9322 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
9323 && !TYPE_REF_IS_RVALUE (type
)
9324 && !real_lvalue_p (expr
))
9325 error_at (loc
, "invalid initialization of non-const reference of "
9326 "type %qT from an rvalue of type %qT",
9327 type
, TREE_TYPE (expr
));
9329 error_at (loc
, "invalid initialization of reference of type "
9330 "%qT from expression of type %qT", type
,
9333 return error_mark_node
;
9336 if (conv
->kind
== ck_ref_bind
)
9337 /* Perform the conversion. */
9338 expr
= convert_like (conv
, expr
, complain
);
9339 else if (conv
->kind
== ck_ambig
)
9340 /* We gave an error in build_user_type_conversion_1. */
9341 expr
= error_mark_node
;
9345 /* Free all the conversions we allocated. */
9346 obstack_free (&conversion_obstack
, p
);
9351 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
9352 which is bound either to a reference or a std::initializer_list. */
9355 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
9360 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
9362 TREE_OPERAND (sub
, 1)
9363 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
9366 if (TREE_CODE (sub
) != ADDR_EXPR
)
9368 /* Deal with binding to a subobject. */
9369 for (p
= &TREE_OPERAND (sub
, 0); TREE_CODE (*p
) == COMPONENT_REF
; )
9370 p
= &TREE_OPERAND (*p
, 0);
9371 if (TREE_CODE (*p
) == TARGET_EXPR
)
9373 tree subinit
= NULL_TREE
;
9374 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
9376 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
9377 recompute_tree_invariant_for_addr_expr (sub
);
9382 /* INIT is part of the initializer for DECL. If there are any
9383 reference or initializer lists being initialized, extend their
9384 lifetime to match that of DECL. */
9387 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
9389 tree type
= TREE_TYPE (init
);
9390 if (processing_template_decl
)
9392 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9393 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
9394 else if (is_std_init_list (type
))
9396 /* The temporary array underlying a std::initializer_list
9397 is handled like a reference temporary. */
9399 if (TREE_CODE (ctor
) == TARGET_EXPR
)
9400 ctor
= TARGET_EXPR_INITIAL (ctor
);
9401 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
9403 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
9404 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
9405 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
9408 else if (TREE_CODE (init
) == CONSTRUCTOR
)
9412 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (init
);
9413 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
9414 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
9420 /* Returns true iff an initializer for TYPE could contain temporaries that
9421 need to be extended because they are bound to references or
9422 std::initializer_list. */
9425 type_has_extended_temps (tree type
)
9427 type
= strip_array_types (type
);
9428 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9430 if (CLASS_TYPE_P (type
))
9432 if (is_std_init_list (type
))
9434 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
9435 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
9436 if (type_has_extended_temps (TREE_TYPE (f
)))
9442 /* Returns true iff TYPE is some variant of std::initializer_list. */
9445 is_std_init_list (tree type
)
9447 /* Look through typedefs. */
9450 if (cxx_dialect
== cxx98
)
9452 type
= TYPE_MAIN_VARIANT (type
);
9453 return (CLASS_TYPE_P (type
)
9454 && CP_TYPE_CONTEXT (type
) == std_node
9455 && strcmp (TYPE_NAME_STRING (type
), "initializer_list") == 0);
9458 /* Returns true iff DECL is a list constructor: i.e. a constructor which
9459 will accept an argument list of a single std::initializer_list<T>. */
9462 is_list_ctor (tree decl
)
9464 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
9467 if (!args
|| args
== void_list_node
)
9470 arg
= non_reference (TREE_VALUE (args
));
9471 if (!is_std_init_list (arg
))
9474 args
= TREE_CHAIN (args
);
9476 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
9477 /* There are more non-defaulted parms. */
9483 #include "gt-cp-call.h"