1 /* Functions related to invoking methods and overloaded functions.
2 Copyright (C) 1987-2013 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_HERE (expr
);
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
)
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 tree arg1_type
= TREE_TYPE (arg1
);
4406 arg2_type
= TREE_TYPE (arg2
);
4407 arg3_type
= TREE_TYPE (arg3
);
4409 if (TREE_CODE (arg2_type
) != VECTOR_TYPE
4410 && TREE_CODE (arg3_type
) != VECTOR_TYPE
)
4412 /* Rely on the error messages of the scalar version. */
4413 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
4414 orig_arg2
, orig_arg3
, complain
);
4415 if (scal
== error_mark_node
)
4416 return error_mark_node
;
4417 tree stype
= TREE_TYPE (scal
);
4418 tree ctype
= TREE_TYPE (arg1_type
);
4419 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
4420 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
4422 if (complain
& tf_error
)
4423 error_at (loc
, "inferred scalar type %qT is not an integer or "
4424 "floating point type of the same size as %qT", stype
,
4425 COMPARISON_CLASS_P (arg1
)
4426 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
4428 return error_mark_node
;
4431 tree vtype
= build_opaque_vector_type (stype
,
4432 TYPE_VECTOR_SUBPARTS (arg1_type
));
4433 /* We could pass complain & tf_warning to unsafe_conversion_p,
4434 but the warnings (like Wsign-conversion) have already been
4435 given by the scalar build_conditional_expr_1. We still check
4436 unsafe_conversion_p to forbid truncating long long -> float. */
4437 if (unsafe_conversion_p (stype
, arg2
, false))
4439 if (complain
& tf_error
)
4440 error_at (loc
, "conversion of scalar %qT to vector %qT "
4441 "involves truncation", arg2_type
, vtype
);
4442 return error_mark_node
;
4444 if (unsafe_conversion_p (stype
, arg3
, false))
4446 if (complain
& tf_error
)
4447 error_at (loc
, "conversion of scalar %qT to vector %qT "
4448 "involves truncation", arg3_type
, vtype
);
4449 return error_mark_node
;
4452 arg2
= cp_convert (stype
, arg2
, complain
);
4453 arg2
= save_expr (arg2
);
4454 arg2
= build_vector_from_val (vtype
, arg2
);
4456 arg3
= cp_convert (stype
, arg3
, complain
);
4457 arg3
= save_expr (arg3
);
4458 arg3
= build_vector_from_val (vtype
, arg3
);
4462 if ((TREE_CODE (arg2_type
) == VECTOR_TYPE
)
4463 != (TREE_CODE (arg3_type
) == VECTOR_TYPE
))
4465 enum stv_conv convert_flag
=
4466 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
4467 complain
& tf_error
);
4469 switch (convert_flag
)
4472 return error_mark_node
;
4475 arg2
= save_expr (arg2
);
4476 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
4477 arg2
= build_vector_from_val (arg3_type
, arg2
);
4478 arg2_type
= TREE_TYPE (arg2
);
4483 arg3
= save_expr (arg3
);
4484 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
4485 arg3
= build_vector_from_val (arg2_type
, arg3
);
4486 arg3_type
= TREE_TYPE (arg3
);
4494 if (!same_type_p (arg2_type
, arg3_type
)
4495 || TYPE_VECTOR_SUBPARTS (arg1_type
)
4496 != TYPE_VECTOR_SUBPARTS (arg2_type
)
4497 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
4499 if (complain
& tf_error
)
4501 "incompatible vector types in conditional expression: "
4502 "%qT, %qT and %qT", TREE_TYPE (arg1
),
4503 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
4504 return error_mark_node
;
4507 if (!COMPARISON_CLASS_P (arg1
))
4508 arg1
= cp_build_binary_op (loc
, NE_EXPR
, arg1
,
4509 build_zero_cst (arg1_type
), complain
);
4510 return fold_build3 (VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
4515 The first expression is implicitly converted to bool (clause
4517 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
4519 if (error_operand_p (arg1
))
4520 return error_mark_node
;
4524 If either the second or the third operand has type (possibly
4525 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4526 array-to-pointer (_conv.array_), and function-to-pointer
4527 (_conv.func_) standard conversions are performed on the second
4528 and third operands. */
4529 arg2_type
= unlowered_expr_type (arg2
);
4530 arg3_type
= unlowered_expr_type (arg3
);
4531 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
4533 /* Do the conversions. We don't these for `void' type arguments
4534 since it can't have any effect and since decay_conversion
4535 does not handle that case gracefully. */
4536 if (!VOID_TYPE_P (arg2_type
))
4537 arg2
= decay_conversion (arg2
, complain
);
4538 if (!VOID_TYPE_P (arg3_type
))
4539 arg3
= decay_conversion (arg3
, complain
);
4540 arg2_type
= TREE_TYPE (arg2
);
4541 arg3_type
= TREE_TYPE (arg3
);
4545 One of the following shall hold:
4547 --The second or the third operand (but not both) is a
4548 throw-expression (_except.throw_); the result is of the
4549 type of the other and is an rvalue.
4551 --Both the second and the third operands have type void; the
4552 result is of type void and is an rvalue.
4554 We must avoid calling force_rvalue for expressions of type
4555 "void" because it will complain that their value is being
4557 if (TREE_CODE (arg2
) == THROW_EXPR
4558 && TREE_CODE (arg3
) != THROW_EXPR
)
4560 if (!VOID_TYPE_P (arg3_type
))
4562 arg3
= force_rvalue (arg3
, complain
);
4563 if (arg3
== error_mark_node
)
4564 return error_mark_node
;
4566 arg3_type
= TREE_TYPE (arg3
);
4567 result_type
= arg3_type
;
4569 else if (TREE_CODE (arg2
) != THROW_EXPR
4570 && TREE_CODE (arg3
) == THROW_EXPR
)
4572 if (!VOID_TYPE_P (arg2_type
))
4574 arg2
= force_rvalue (arg2
, complain
);
4575 if (arg2
== error_mark_node
)
4576 return error_mark_node
;
4578 arg2_type
= TREE_TYPE (arg2
);
4579 result_type
= arg2_type
;
4581 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
4582 result_type
= void_type_node
;
4585 if (complain
& tf_error
)
4587 if (VOID_TYPE_P (arg2_type
))
4588 error_at (EXPR_LOC_OR_LOC (arg3
, loc
),
4589 "second operand to the conditional operator "
4590 "is of type %<void%>, but the third operand is "
4591 "neither a throw-expression nor of type %<void%>");
4593 error_at (EXPR_LOC_OR_LOC (arg2
, loc
),
4594 "third operand to the conditional operator "
4595 "is of type %<void%>, but the second operand is "
4596 "neither a throw-expression nor of type %<void%>");
4598 return error_mark_node
;
4602 goto valid_operands
;
4606 Otherwise, if the second and third operand have different types,
4607 and either has (possibly cv-qualified) class type, an attempt is
4608 made to convert each of those operands to the type of the other. */
4609 else if (!same_type_p (arg2_type
, arg3_type
)
4610 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
4615 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4616 p
= conversion_obstack_alloc (0);
4618 conv2
= conditional_conversion (arg2
, arg3
, complain
);
4619 conv3
= conditional_conversion (arg3
, arg2
, complain
);
4623 If both can be converted, or one can be converted but the
4624 conversion is ambiguous, the program is ill-formed. If
4625 neither can be converted, the operands are left unchanged and
4626 further checking is performed as described below. If exactly
4627 one conversion is possible, that conversion is applied to the
4628 chosen operand and the converted operand is used in place of
4629 the original operand for the remainder of this section. */
4630 if ((conv2
&& !conv2
->bad_p
4631 && conv3
&& !conv3
->bad_p
)
4632 || (conv2
&& conv2
->kind
== ck_ambig
)
4633 || (conv3
&& conv3
->kind
== ck_ambig
))
4635 if (complain
& tf_error
)
4636 error_at (loc
, "operands to ?: have different types %qT and %qT",
4637 arg2_type
, arg3_type
);
4638 result
= error_mark_node
;
4640 else if (conv2
&& (!conv2
->bad_p
|| !conv3
))
4642 arg2
= convert_like (conv2
, arg2
, complain
);
4643 arg2
= convert_from_reference (arg2
);
4644 arg2_type
= TREE_TYPE (arg2
);
4645 /* Even if CONV2 is a valid conversion, the result of the
4646 conversion may be invalid. For example, if ARG3 has type
4647 "volatile X", and X does not have a copy constructor
4648 accepting a "volatile X&", then even if ARG2 can be
4649 converted to X, the conversion will fail. */
4650 if (error_operand_p (arg2
))
4651 result
= error_mark_node
;
4653 else if (conv3
&& (!conv3
->bad_p
|| !conv2
))
4655 arg3
= convert_like (conv3
, arg3
, complain
);
4656 arg3
= convert_from_reference (arg3
);
4657 arg3_type
= TREE_TYPE (arg3
);
4658 if (error_operand_p (arg3
))
4659 result
= error_mark_node
;
4662 /* Free all the conversions we allocated. */
4663 obstack_free (&conversion_obstack
, p
);
4668 /* If, after the conversion, both operands have class type,
4669 treat the cv-qualification of both operands as if it were the
4670 union of the cv-qualification of the operands.
4672 The standard is not clear about what to do in this
4673 circumstance. For example, if the first operand has type
4674 "const X" and the second operand has a user-defined
4675 conversion to "volatile X", what is the type of the second
4676 operand after this step? Making it be "const X" (matching
4677 the first operand) seems wrong, as that discards the
4678 qualification without actually performing a copy. Leaving it
4679 as "volatile X" seems wrong as that will result in the
4680 conditional expression failing altogether, even though,
4681 according to this step, the one operand could be converted to
4682 the type of the other. */
4683 if ((conv2
|| conv3
)
4684 && CLASS_TYPE_P (arg2_type
)
4685 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
4686 arg2_type
= arg3_type
=
4687 cp_build_qualified_type (arg2_type
,
4688 cp_type_quals (arg2_type
)
4689 | cp_type_quals (arg3_type
));
4694 If the second and third operands are glvalues of the same value
4695 category and have the same type, the result is of that type and
4697 if (((real_lvalue_p (arg2
) && real_lvalue_p (arg3
))
4698 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
4699 && same_type_p (arg2_type
, arg3_type
))
4701 result_type
= arg2_type
;
4702 arg2
= mark_lvalue_use (arg2
);
4703 arg3
= mark_lvalue_use (arg3
);
4704 goto valid_operands
;
4709 Otherwise, the result is an rvalue. If the second and third
4710 operand do not have the same type, and either has (possibly
4711 cv-qualified) class type, overload resolution is used to
4712 determine the conversions (if any) to be applied to the operands
4713 (_over.match.oper_, _over.built_). */
4715 if (!same_type_p (arg2_type
, arg3_type
)
4716 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
4722 /* Rearrange the arguments so that add_builtin_candidate only has
4723 to know about two args. In build_builtin_candidate, the
4724 arguments are unscrambled. */
4728 add_builtin_candidates (&candidates
,
4731 ansi_opname (COND_EXPR
),
4733 LOOKUP_NORMAL
, complain
);
4737 If the overload resolution fails, the program is
4739 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
4742 if (complain
& tf_error
)
4744 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
4745 print_z_candidates (loc
, candidates
);
4747 return error_mark_node
;
4749 cand
= tourney (candidates
, complain
);
4752 if (complain
& tf_error
)
4754 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
4755 print_z_candidates (loc
, candidates
);
4757 return error_mark_node
;
4762 Otherwise, the conversions thus determined are applied, and
4763 the converted operands are used in place of the original
4764 operands for the remainder of this section. */
4765 conv
= cand
->convs
[0];
4766 arg1
= convert_like (conv
, arg1
, complain
);
4767 conv
= cand
->convs
[1];
4768 arg2
= convert_like (conv
, arg2
, complain
);
4769 arg2_type
= TREE_TYPE (arg2
);
4770 conv
= cand
->convs
[2];
4771 arg3
= convert_like (conv
, arg3
, complain
);
4772 arg3_type
= TREE_TYPE (arg3
);
4777 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
4778 and function-to-pointer (_conv.func_) standard conversions are
4779 performed on the second and third operands.
4781 We need to force the lvalue-to-rvalue conversion here for class types,
4782 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
4783 that isn't wrapped with a TARGET_EXPR plays havoc with exception
4786 arg2
= force_rvalue (arg2
, complain
);
4787 if (!CLASS_TYPE_P (arg2_type
))
4788 arg2_type
= TREE_TYPE (arg2
);
4790 arg3
= force_rvalue (arg3
, complain
);
4791 if (!CLASS_TYPE_P (arg3_type
))
4792 arg3_type
= TREE_TYPE (arg3
);
4794 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
4795 return error_mark_node
;
4799 After those conversions, one of the following shall hold:
4801 --The second and third operands have the same type; the result is of
4803 if (same_type_p (arg2_type
, arg3_type
))
4804 result_type
= arg2_type
;
4807 --The second and third operands have arithmetic or enumeration
4808 type; the usual arithmetic conversions are performed to bring
4809 them to a common type, and the result is of that type. */
4810 else if ((ARITHMETIC_TYPE_P (arg2_type
)
4811 || UNSCOPED_ENUM_P (arg2_type
))
4812 && (ARITHMETIC_TYPE_P (arg3_type
)
4813 || UNSCOPED_ENUM_P (arg3_type
)))
4815 /* In this case, there is always a common type. */
4816 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
4818 if (complain
& tf_warning
)
4819 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
4820 "implicit conversion from %qT to %qT to "
4821 "match other result of conditional",
4824 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
4825 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
4827 if (TREE_CODE (orig_arg2
) == CONST_DECL
4828 && TREE_CODE (orig_arg3
) == CONST_DECL
4829 && DECL_CONTEXT (orig_arg2
) == DECL_CONTEXT (orig_arg3
))
4830 /* Two enumerators from the same enumeration can have different
4831 types when the enumeration is still being defined. */;
4832 else if (complain
& tf_warning
)
4833 warning_at (loc
, OPT_Wenum_compare
, "enumeral mismatch in "
4834 "conditional expression: %qT vs %qT",
4835 arg2_type
, arg3_type
);
4837 else if (extra_warnings
4838 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
4839 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
4840 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
4841 && !same_type_p (arg2_type
,
4842 type_promotes_to (arg3_type
)))))
4844 if (complain
& tf_warning
)
4845 warning_at (loc
, 0, "enumeral and non-enumeral type in "
4846 "conditional expression");
4849 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
4850 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
4854 --The second and third operands have pointer type, or one has
4855 pointer type and the other is a null pointer constant; pointer
4856 conversions (_conv.ptr_) and qualification conversions
4857 (_conv.qual_) are performed to bring them to their composite
4858 pointer type (_expr.rel_). The result is of the composite
4861 --The second and third operands have pointer to member type, or
4862 one has pointer to member type and the other is a null pointer
4863 constant; pointer to member conversions (_conv.mem_) and
4864 qualification conversions (_conv.qual_) are performed to bring
4865 them to a common type, whose cv-qualification shall match the
4866 cv-qualification of either the second or the third operand.
4867 The result is of the common type. */
4868 else if ((null_ptr_cst_p (arg2
)
4869 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
4870 || (null_ptr_cst_p (arg3
)
4871 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
4872 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
4873 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
4874 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
4876 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
4877 arg3
, CPO_CONDITIONAL_EXPR
,
4879 if (result_type
== error_mark_node
)
4880 return error_mark_node
;
4881 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
4882 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
4887 if (complain
& tf_error
)
4888 error_at (loc
, "operands to ?: have different types %qT and %qT",
4889 arg2_type
, arg3_type
);
4890 return error_mark_node
;
4893 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
4894 return error_mark_node
;
4897 result
= build3 (COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
4898 if (!cp_unevaluated_operand
)
4899 /* Avoid folding within decltype (c++/42013) and noexcept. */
4900 result
= fold_if_not_in_template (result
);
4902 /* We can't use result_type below, as fold might have returned a
4907 /* Expand both sides into the same slot, hopefully the target of
4908 the ?: expression. We used to check for TARGET_EXPRs here,
4909 but now we sometimes wrap them in NOP_EXPRs so the test would
4911 if (CLASS_TYPE_P (TREE_TYPE (result
)))
4912 result
= get_target_expr_sfinae (result
, complain
);
4913 /* If this expression is an rvalue, but might be mistaken for an
4914 lvalue, we must add a NON_LVALUE_EXPR. */
4915 result
= rvalue (result
);
4918 result
= force_paren_expr (result
);
4923 /* Wrapper for above. */
4926 build_conditional_expr (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
4927 tsubst_flags_t complain
)
4930 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4931 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
4932 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4936 /* OPERAND is an operand to an expression. Perform necessary steps
4937 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
4941 prep_operand (tree operand
)
4945 if (CLASS_TYPE_P (TREE_TYPE (operand
))
4946 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
4947 /* Make sure the template type is instantiated now. */
4948 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
4954 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
4955 OVERLOAD) to the CANDIDATES, returning an updated list of
4956 CANDIDATES. The ARGS are the arguments provided to the call;
4957 if FIRST_ARG is non-null it is the implicit object argument,
4958 otherwise the first element of ARGS is used if needed. The
4959 EXPLICIT_TARGS are explicit template arguments provided.
4960 TEMPLATE_ONLY is true if only template functions should be
4961 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
4962 add_function_candidate. */
4965 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
4967 tree explicit_targs
, bool template_only
,
4968 tree conversion_path
, tree access_path
,
4970 struct z_candidate
**candidates
,
4971 tsubst_flags_t complain
)
4974 const vec
<tree
, va_gc
> *non_static_args
;
4975 bool check_list_ctor
;
4976 bool check_converting
;
4977 unification_kind_t strict
;
4983 /* Precalculate special handling of constructors and conversion ops. */
4984 fn
= OVL_CURRENT (fns
);
4985 if (DECL_CONV_FN_P (fn
))
4987 check_list_ctor
= false;
4988 check_converting
= !!(flags
& LOOKUP_ONLYCONVERTING
);
4989 if (flags
& LOOKUP_NO_CONVERSION
)
4990 /* We're doing return_type(x). */
4991 strict
= DEDUCE_CONV
;
4993 /* We're doing x.operator return_type(). */
4994 strict
= DEDUCE_EXACT
;
4995 /* [over.match.funcs] For conversion functions, the function
4996 is considered to be a member of the class of the implicit
4997 object argument for the purpose of defining the type of
4998 the implicit object parameter. */
4999 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5003 if (DECL_CONSTRUCTOR_P (fn
))
5005 check_list_ctor
= !!(flags
& LOOKUP_LIST_ONLY
);
5006 /* For list-initialization we consider explicit constructors
5007 and complain if one is chosen. */
5009 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5010 == LOOKUP_ONLYCONVERTING
);
5014 check_list_ctor
= false;
5015 check_converting
= false;
5017 strict
= DEDUCE_CALL
;
5018 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5022 non_static_args
= args
;
5024 /* Delay creating the implicit this parameter until it is needed. */
5025 non_static_args
= NULL
;
5027 for (; fns
; fns
= OVL_NEXT (fns
))
5030 const vec
<tree
, va_gc
> *fn_args
;
5032 fn
= OVL_CURRENT (fns
);
5034 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5036 if (check_list_ctor
&& !is_list_ctor (fn
))
5039 /* Figure out which set of arguments to use. */
5040 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5042 /* If this function is a non-static member and we didn't get an
5043 implicit object argument, move it out of args. */
5044 if (first_arg
== NULL_TREE
)
5048 vec
<tree
, va_gc
> *tempvec
;
5049 vec_alloc (tempvec
, args
->length () - 1);
5050 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5051 tempvec
->quick_push (arg
);
5052 non_static_args
= tempvec
;
5053 first_arg
= (*args
)[0];
5056 fn_first_arg
= first_arg
;
5057 fn_args
= non_static_args
;
5061 /* Otherwise, just use the list of arguments provided. */
5062 fn_first_arg
= NULL_TREE
;
5066 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5067 add_template_candidate (candidates
,
5079 else if (!template_only
)
5080 add_function_candidate (candidates
,
5093 build_new_op_1 (location_t loc
, enum tree_code code
, int flags
, tree arg1
,
5094 tree arg2
, tree arg3
, tree
*overload
, tsubst_flags_t complain
)
5096 struct z_candidate
*candidates
= 0, *cand
;
5097 vec
<tree
, va_gc
> *arglist
;
5100 tree result
= NULL_TREE
;
5101 bool result_valid_p
= false;
5102 enum tree_code code2
= NOP_EXPR
;
5103 enum tree_code code_orig_arg1
= ERROR_MARK
;
5104 enum tree_code code_orig_arg2
= ERROR_MARK
;
5110 if (error_operand_p (arg1
)
5111 || error_operand_p (arg2
)
5112 || error_operand_p (arg3
))
5113 return error_mark_node
;
5115 if (code
== MODIFY_EXPR
)
5117 code2
= TREE_CODE (arg3
);
5119 fnname
= ansi_assopname (code2
);
5122 fnname
= ansi_opname (code
);
5124 arg1
= prep_operand (arg1
);
5130 case VEC_DELETE_EXPR
:
5132 /* Use build_op_new_call and build_op_delete_call instead. */
5136 /* Use build_op_call instead. */
5139 case TRUTH_ORIF_EXPR
:
5140 case TRUTH_ANDIF_EXPR
:
5141 case TRUTH_AND_EXPR
:
5143 /* These are saved for the sake of warn_logical_operator. */
5144 code_orig_arg1
= TREE_CODE (arg1
);
5145 code_orig_arg2
= TREE_CODE (arg2
);
5151 arg2
= prep_operand (arg2
);
5152 arg3
= prep_operand (arg3
);
5154 if (code
== COND_EXPR
)
5155 /* Use build_conditional_expr instead. */
5157 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5158 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5161 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5162 arg2
= integer_zero_node
;
5164 vec_alloc (arglist
, 3);
5165 arglist
->quick_push (arg1
);
5166 if (arg2
!= NULL_TREE
)
5167 arglist
->quick_push (arg2
);
5168 if (arg3
!= NULL_TREE
)
5169 arglist
->quick_push (arg3
);
5171 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5172 p
= conversion_obstack_alloc (0);
5174 /* Add namespace-scope operators to the list of functions to
5176 add_candidates (lookup_function_nonclass (fnname
, arglist
, /*block_p=*/true),
5177 NULL_TREE
, arglist
, NULL_TREE
,
5178 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5179 flags
, &candidates
, complain
);
5183 args
[2] = NULL_TREE
;
5185 /* Add class-member operators to the candidate set. */
5186 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5190 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5191 if (fns
== error_mark_node
)
5193 result
= error_mark_node
;
5194 goto user_defined_result_ready
;
5197 add_candidates (BASELINK_FUNCTIONS (fns
),
5198 NULL_TREE
, arglist
, NULL_TREE
,
5200 BASELINK_BINFO (fns
),
5201 BASELINK_ACCESS_BINFO (fns
),
5202 flags
, &candidates
, complain
);
5204 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5205 only non-member functions that have type T1 or reference to
5206 cv-qualified-opt T1 for the first argument, if the first argument
5207 has an enumeration type, or T2 or reference to cv-qualified-opt
5208 T2 for the second argument, if the the second argument has an
5209 enumeration type. Filter out those that don't match. */
5210 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5212 struct z_candidate
**candp
, **next
;
5214 for (candp
= &candidates
; *candp
; candp
= next
)
5216 tree parmlist
, parmtype
;
5217 int i
, nargs
= (arg2
? 2 : 1);
5222 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5224 for (i
= 0; i
< nargs
; ++i
)
5226 parmtype
= TREE_VALUE (parmlist
);
5228 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
5229 parmtype
= TREE_TYPE (parmtype
);
5230 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5231 && (same_type_ignoring_top_level_qualifiers_p
5232 (TREE_TYPE (args
[i
]), parmtype
)))
5235 parmlist
= TREE_CHAIN (parmlist
);
5238 /* No argument has an appropriate type, so remove this
5239 candidate function from the list. */
5242 *candp
= cand
->next
;
5248 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5255 /* For these, the built-in candidates set is empty
5256 [over.match.oper]/3. We don't want non-strict matches
5257 because exact matches are always possible with built-in
5258 operators. The built-in candidate set for COMPONENT_REF
5259 would be empty too, but since there are no such built-in
5260 operators, we accept non-strict matches for them. */
5265 strict_p
= pedantic
;
5269 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5274 case POSTINCREMENT_EXPR
:
5275 case POSTDECREMENT_EXPR
:
5276 /* Don't try anything fancy if we're not allowed to produce
5278 if (!(complain
& tf_error
))
5279 return error_mark_node
;
5281 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5282 distinguish between prefix and postfix ++ and
5283 operator++() was used for both, so we allow this with
5287 const char *msg
= (flag_permissive
)
5288 ? G_("no %<%D(int)%> declared for postfix %qs,"
5289 " trying prefix operator instead")
5290 : G_("no %<%D(int)%> declared for postfix %qs");
5291 permerror (loc
, msg
, fnname
, operator_name_info
[code
].name
);
5294 if (!flag_permissive
)
5295 return error_mark_node
;
5297 if (code
== POSTINCREMENT_EXPR
)
5298 code
= PREINCREMENT_EXPR
;
5300 code
= PREDECREMENT_EXPR
;
5301 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5302 NULL_TREE
, overload
, complain
);
5305 /* The caller will deal with these. */
5310 result_valid_p
= true;
5314 if (complain
& tf_error
)
5316 /* If one of the arguments of the operator represents
5317 an invalid use of member function pointer, try to report
5318 a meaningful error ... */
5319 if (invalid_nonstatic_memfn_p (arg1
, tf_error
)
5320 || invalid_nonstatic_memfn_p (arg2
, tf_error
)
5321 || invalid_nonstatic_memfn_p (arg3
, tf_error
))
5322 /* We displayed the error message. */;
5325 /* ... Otherwise, report the more generic
5326 "no matching operator found" error */
5327 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
5328 print_z_candidates (loc
, candidates
);
5331 result
= error_mark_node
;
5337 cand
= tourney (candidates
, complain
);
5340 if (complain
& tf_error
)
5342 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
5343 print_z_candidates (loc
, candidates
);
5345 result
= error_mark_node
;
5347 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
5350 *overload
= cand
->fn
;
5352 if (resolve_args (arglist
, complain
) == NULL
)
5353 result
= error_mark_node
;
5355 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5359 /* Give any warnings we noticed during overload resolution. */
5360 if (cand
->warnings
&& (complain
& tf_warning
))
5362 struct candidate_warning
*w
;
5363 for (w
= cand
->warnings
; w
; w
= w
->next
)
5364 joust (cand
, w
->loser
, 1, complain
);
5367 /* Check for comparison of different enum types. */
5376 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
5377 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
5378 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
5379 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
5380 && (complain
& tf_warning
))
5382 warning (OPT_Wenum_compare
,
5383 "comparison between %q#T and %q#T",
5384 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
5391 /* We need to strip any leading REF_BIND so that bitfields
5392 don't cause errors. This should not remove any important
5393 conversions, because builtins don't apply to class
5394 objects directly. */
5395 conv
= cand
->convs
[0];
5396 if (conv
->kind
== ck_ref_bind
)
5397 conv
= next_conversion (conv
);
5398 arg1
= convert_like (conv
, arg1
, complain
);
5402 conv
= cand
->convs
[1];
5403 if (conv
->kind
== ck_ref_bind
)
5404 conv
= next_conversion (conv
);
5406 arg2
= decay_conversion (arg2
, complain
);
5408 /* We need to call warn_logical_operator before
5409 converting arg2 to a boolean_type, but after
5410 decaying an enumerator to its value. */
5411 if (complain
& tf_warning
)
5412 warn_logical_operator (loc
, code
, boolean_type_node
,
5413 code_orig_arg1
, arg1
,
5414 code_orig_arg2
, arg2
);
5416 arg2
= convert_like (conv
, arg2
, complain
);
5420 conv
= cand
->convs
[2];
5421 if (conv
->kind
== ck_ref_bind
)
5422 conv
= next_conversion (conv
);
5423 arg3
= convert_like (conv
, arg3
, complain
);
5429 user_defined_result_ready
:
5431 /* Free all the conversions we allocated. */
5432 obstack_free (&conversion_obstack
, p
);
5434 if (result
|| result_valid_p
)
5441 return cp_build_modify_expr (arg1
, code2
, arg2
, complain
);
5444 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
5446 case TRUTH_ANDIF_EXPR
:
5447 case TRUTH_ORIF_EXPR
:
5448 case TRUTH_AND_EXPR
:
5450 warn_logical_operator (loc
, code
, boolean_type_node
,
5451 code_orig_arg1
, arg1
, code_orig_arg2
, arg2
);
5456 case TRUNC_DIV_EXPR
:
5467 case TRUNC_MOD_EXPR
:
5471 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
5473 case UNARY_PLUS_EXPR
:
5476 case TRUTH_NOT_EXPR
:
5477 case PREINCREMENT_EXPR
:
5478 case POSTINCREMENT_EXPR
:
5479 case PREDECREMENT_EXPR
:
5480 case POSTDECREMENT_EXPR
:
5484 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
5487 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
5490 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
5494 /* The caller will deal with these. */
5506 /* Wrapper for above. */
5509 build_new_op (location_t loc
, enum tree_code code
, int flags
,
5510 tree arg1
, tree arg2
, tree arg3
,
5511 tree
*overload
, tsubst_flags_t complain
)
5514 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5515 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
5516 overload
, complain
);
5517 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5521 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
5522 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
5525 non_placement_deallocation_fn_p (tree t
)
5527 /* A template instance is never a usual deallocation function,
5528 regardless of its signature. */
5529 if (TREE_CODE (t
) == TEMPLATE_DECL
5530 || primary_template_instantiation_p (t
))
5533 /* If a class T has a member deallocation function named operator delete
5534 with exactly one parameter, then that function is a usual
5535 (non-placement) deallocation function. If class T does not declare
5536 such an operator delete but does declare a member deallocation
5537 function named operator delete with exactly two parameters, the second
5538 of which has type std::size_t (18.2), then this function is a usual
5539 deallocation function. */
5540 t
= FUNCTION_ARG_CHAIN (t
);
5541 if (t
== void_list_node
5542 || (t
&& same_type_p (TREE_VALUE (t
), size_type_node
)
5543 && TREE_CHAIN (t
) == void_list_node
))
5548 /* Build a call to operator delete. This has to be handled very specially,
5549 because the restrictions on what signatures match are different from all
5550 other call instances. For a normal delete, only a delete taking (void *)
5551 or (void *, size_t) is accepted. For a placement delete, only an exact
5552 match with the placement new is accepted.
5554 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
5555 ADDR is the pointer to be deleted.
5556 SIZE is the size of the memory block to be deleted.
5557 GLOBAL_P is true if the delete-expression should not consider
5558 class-specific delete operators.
5559 PLACEMENT is the corresponding placement new call, or NULL_TREE.
5561 If this call to "operator delete" is being generated as part to
5562 deallocate memory allocated via a new-expression (as per [expr.new]
5563 which requires that if the initialization throws an exception then
5564 we call a deallocation function), then ALLOC_FN is the allocation
5568 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
5569 bool global_p
, tree placement
,
5570 tree alloc_fn
, tsubst_flags_t complain
)
5572 tree fn
= NULL_TREE
;
5573 tree fns
, fnname
, type
, t
;
5575 if (addr
== error_mark_node
)
5576 return error_mark_node
;
5578 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
5580 fnname
= ansi_opname (code
);
5582 if (CLASS_TYPE_P (type
)
5583 && COMPLETE_TYPE_P (complete_type (type
))
5587 If the result of the lookup is ambiguous or inaccessible, or if
5588 the lookup selects a placement deallocation function, the
5589 program is ill-formed.
5591 Therefore, we ask lookup_fnfields to complain about ambiguity. */
5593 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
5594 if (fns
== error_mark_node
)
5595 return error_mark_node
;
5600 if (fns
== NULL_TREE
)
5601 fns
= lookup_name_nonclass (fnname
);
5603 /* Strip const and volatile from addr. */
5604 addr
= cp_convert (ptr_type_node
, addr
, complain
);
5608 /* "A declaration of a placement deallocation function matches the
5609 declaration of a placement allocation function if it has the same
5610 number of parameters and, after parameter transformations (8.3.5),
5611 all parameter types except the first are identical."
5613 So we build up the function type we want and ask instantiate_type
5614 to get it for us. */
5615 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
5616 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
5617 t
= build_function_type (void_type_node
, t
);
5619 fn
= instantiate_type (t
, fns
, tf_none
);
5620 if (fn
== error_mark_node
)
5623 if (BASELINK_P (fn
))
5624 fn
= BASELINK_FUNCTIONS (fn
);
5626 /* "If the lookup finds the two-parameter form of a usual deallocation
5627 function (3.7.4.2) and that function, considered as a placement
5628 deallocation function, would have been selected as a match for the
5629 allocation function, the program is ill-formed." */
5630 if (non_placement_deallocation_fn_p (fn
))
5632 /* But if the class has an operator delete (void *), then that is
5633 the usual deallocation function, so we shouldn't complain
5634 about using the operator delete (void *, size_t). */
5635 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
5636 t
; t
= OVL_NEXT (t
))
5638 tree elt
= OVL_CURRENT (t
);
5639 if (non_placement_deallocation_fn_p (elt
)
5640 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
5643 if (complain
& tf_error
)
5645 permerror (0, "non-placement deallocation function %q+D", fn
);
5646 permerror (input_location
, "selected for placement delete");
5649 return error_mark_node
;
5654 /* "Any non-placement deallocation function matches a non-placement
5655 allocation function. If the lookup finds a single matching
5656 deallocation function, that function will be called; otherwise, no
5657 deallocation function will be called." */
5658 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
5659 t
; t
= OVL_NEXT (t
))
5661 tree elt
= OVL_CURRENT (t
);
5662 if (non_placement_deallocation_fn_p (elt
))
5665 /* "If a class T has a member deallocation function named
5666 operator delete with exactly one parameter, then that
5667 function is a usual (non-placement) deallocation
5668 function. If class T does not declare such an operator
5669 delete but does declare a member deallocation function named
5670 operator delete with exactly two parameters, the second of
5671 which has type std::size_t (18.2), then this function is a
5672 usual deallocation function."
5674 So (void*) beats (void*, size_t). */
5675 if (FUNCTION_ARG_CHAIN (fn
) == void_list_node
)
5680 /* If we have a matching function, call it. */
5683 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
5685 /* If the FN is a member function, make sure that it is
5687 if (BASELINK_P (fns
))
5688 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
5691 /* Core issue 901: It's ok to new a type with deleted delete. */
5692 if (DECL_DELETED_FN (fn
) && alloc_fn
)
5697 /* The placement args might not be suitable for overload
5698 resolution at this point, so build the call directly. */
5699 int nargs
= call_expr_nargs (placement
);
5700 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
5703 for (i
= 1; i
< nargs
; i
++)
5704 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
5706 return build_cxx_call (fn
, nargs
, argarray
, complain
);
5711 vec
<tree
, va_gc
> *args
;
5712 vec_alloc (args
, 2);
5713 args
->quick_push (addr
);
5714 if (FUNCTION_ARG_CHAIN (fn
) != void_list_node
)
5715 args
->quick_push (size
);
5716 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
5724 If no unambiguous matching deallocation function can be found,
5725 propagating the exception does not cause the object's memory to
5729 if ((complain
& tf_warning
)
5731 warning (0, "no corresponding deallocation function for %qD",
5736 if (complain
& tf_error
)
5737 error ("no suitable %<operator %s%> for %qT",
5738 operator_name_info
[(int)code
].name
, type
);
5739 return error_mark_node
;
5742 /* If the current scope isn't allowed to access DECL along
5743 BASETYPE_PATH, give an error. The most derived class in
5744 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
5745 the declaration to use in the error diagnostic. */
5748 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
5749 tsubst_flags_t complain
)
5751 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
5753 if (!accessible_p (basetype_path
, decl
, true))
5755 if (complain
& tf_error
)
5757 if (TREE_PRIVATE (decl
))
5758 error ("%q+#D is private", diag_decl
);
5759 else if (TREE_PROTECTED (decl
))
5760 error ("%q+#D is protected", diag_decl
);
5762 error ("%q+#D is inaccessible", diag_decl
);
5763 error ("within this context");
5771 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
5772 bitwise or of LOOKUP_* values. If any errors are warnings are
5773 generated, set *DIAGNOSTIC_FN to "error" or "warning",
5774 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
5778 build_temp (tree expr
, tree type
, int flags
,
5779 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
5782 vec
<tree
, va_gc
> *args
;
5784 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
5785 args
= make_tree_vector_single (expr
);
5786 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
5787 &args
, type
, flags
, complain
);
5788 release_tree_vector (args
);
5789 if (warningcount
+ werrorcount
> savew
)
5790 *diagnostic_kind
= DK_WARNING
;
5791 else if (errorcount
> savee
)
5792 *diagnostic_kind
= DK_ERROR
;
5794 *diagnostic_kind
= DK_UNSPECIFIED
;
5798 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
5799 EXPR is implicitly converted to type TOTYPE.
5800 FN and ARGNUM are used for diagnostics. */
5803 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
5805 /* Issue warnings about peculiar, but valid, uses of NULL. */
5806 if (expr
== null_node
&& TREE_CODE (totype
) != BOOLEAN_TYPE
5807 && ARITHMETIC_TYPE_P (totype
))
5809 source_location loc
=
5810 expansion_point_location_if_in_system_header (input_location
);
5813 warning_at (loc
, OPT_Wconversion_null
,
5814 "passing NULL to non-pointer argument %P of %qD",
5817 warning_at (loc
, OPT_Wconversion_null
,
5818 "converting to non-pointer type %qT from NULL", totype
);
5821 /* Issue warnings if "false" is converted to a NULL pointer */
5822 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
5823 && TYPE_PTR_P (totype
))
5826 warning_at (input_location
, OPT_Wconversion_null
,
5827 "converting %<false%> to pointer type for argument %P "
5828 "of %qD", argnum
, fn
);
5830 warning_at (input_location
, OPT_Wconversion_null
,
5831 "converting %<false%> to pointer type %qT", totype
);
5835 /* Perform the conversions in CONVS on the expression EXPR. FN and
5836 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
5837 indicates the `this' argument of a method. INNER is nonzero when
5838 being called to continue a conversion chain. It is negative when a
5839 reference binding will be applied, positive otherwise. If
5840 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
5841 conversions will be emitted if appropriate. If C_CAST_P is true,
5842 this conversion is coming from a C-style cast; in that case,
5843 conversions to inaccessible bases are permitted. */
5846 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
5847 int inner
, bool issue_conversion_warnings
,
5848 bool c_cast_p
, tsubst_flags_t complain
)
5850 tree totype
= convs
->type
;
5851 diagnostic_t diag_kind
;
5853 location_t loc
= EXPR_LOC_OR_HERE (expr
);
5855 if (convs
->bad_p
&& !(complain
& tf_error
))
5856 return error_mark_node
;
5859 && convs
->kind
!= ck_user
5860 && convs
->kind
!= ck_list
5861 && convs
->kind
!= ck_ambig
5862 && (convs
->kind
!= ck_ref_bind
5863 || convs
->user_conv_p
)
5864 && convs
->kind
!= ck_rvalue
5865 && convs
->kind
!= ck_base
)
5867 conversion
*t
= convs
;
5869 /* Give a helpful error if this is bad because of excess braces. */
5870 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
5871 && SCALAR_TYPE_P (totype
)
5872 && CONSTRUCTOR_NELTS (expr
) > 0
5873 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
5874 permerror (loc
, "too many braces around initializer for %qT", totype
);
5876 for (; t
; t
= next_conversion (t
))
5878 if (t
->kind
== ck_user
&& t
->cand
->reason
)
5880 permerror (loc
, "invalid user-defined conversion "
5881 "from %qT to %qT", TREE_TYPE (expr
), totype
);
5882 print_z_candidate (loc
, "candidate is:", t
->cand
);
5883 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
5884 /*issue_conversion_warnings=*/false,
5887 if (convs
->kind
== ck_ref_bind
)
5888 return convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
5889 LOOKUP_NORMAL
, NULL_TREE
,
5892 return cp_convert (totype
, expr
, complain
);
5894 else if (t
->kind
== ck_user
|| !t
->bad_p
)
5896 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
5897 /*issue_conversion_warnings=*/false,
5902 else if (t
->kind
== ck_ambig
)
5903 return convert_like_real (t
, expr
, fn
, argnum
, 1,
5904 /*issue_conversion_warnings=*/false,
5907 else if (t
->kind
== ck_identity
)
5910 if (permerror (loc
, "invalid conversion from %qT to %qT",
5911 TREE_TYPE (expr
), totype
)
5913 inform (DECL_SOURCE_LOCATION (fn
),
5914 "initializing argument %P of %qD", argnum
, fn
);
5916 return cp_convert (totype
, expr
, complain
);
5919 if (issue_conversion_warnings
&& (complain
& tf_warning
))
5920 conversion_null_warnings (totype
, expr
, fn
, argnum
);
5922 switch (convs
->kind
)
5926 struct z_candidate
*cand
= convs
->cand
;
5927 tree convfn
= cand
->fn
;
5930 /* When converting from an init list we consider explicit
5931 constructors, but actually trying to call one is an error. */
5932 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
5933 /* Unless this is for direct-list-initialization. */
5934 && !(BRACE_ENCLOSED_INITIALIZER_P (expr
)
5935 && CONSTRUCTOR_IS_DIRECT_INIT (expr
)))
5937 error ("converting to %qT from initializer list would use "
5938 "explicit constructor %qD", totype
, convfn
);
5941 /* If we're initializing from {}, it's value-initialization. */
5942 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
5943 && CONSTRUCTOR_NELTS (expr
) == 0
5944 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
5946 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
5947 expr
= build_value_init (totype
, complain
);
5948 expr
= get_target_expr_sfinae (expr
, complain
);
5949 if (expr
!= error_mark_node
)
5951 TARGET_EXPR_LIST_INIT_P (expr
) = true;
5952 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
5957 expr
= mark_rvalue_use (expr
);
5959 /* Set user_conv_p on the argument conversions, so rvalue/base
5960 handling knows not to allow any more UDCs. */
5961 for (i
= 0; i
< cand
->num_convs
; ++i
)
5962 cand
->convs
[i
]->user_conv_p
= true;
5964 expr
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5966 /* If this is a constructor or a function returning an aggr type,
5967 we need to build up a TARGET_EXPR. */
5968 if (DECL_CONSTRUCTOR_P (convfn
))
5970 expr
= build_cplus_new (totype
, expr
, complain
);
5972 /* Remember that this was list-initialization. */
5973 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
5974 TARGET_EXPR_LIST_INIT_P (expr
) = true;
5980 expr
= mark_rvalue_use (expr
);
5981 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
5983 int nelts
= CONSTRUCTOR_NELTS (expr
);
5985 expr
= build_value_init (totype
, complain
);
5986 else if (nelts
== 1)
5987 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
5992 if (type_unknown_p (expr
))
5993 expr
= instantiate_type (totype
, expr
, complain
);
5994 /* Convert a constant to its underlying value, unless we are
5995 about to bind it to a reference, in which case we need to
5996 leave it as an lvalue. */
5999 expr
= decl_constant_value_safe (expr
);
6000 if (expr
== null_node
&& INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
6001 /* If __null has been converted to an integer type, we do not
6002 want to warn about uses of EXPR as an integer, rather than
6004 expr
= build_int_cst (totype
, 0);
6008 /* We leave bad_p off ck_ambig because overload resolution considers
6009 it valid, it just fails when we try to perform it. So we need to
6010 check complain here, too. */
6011 if (complain
& tf_error
)
6013 /* Call build_user_type_conversion again for the error. */
6014 build_user_type_conversion (totype
, convs
->u
.expr
, LOOKUP_NORMAL
,
6017 inform (input_location
, "initializing argument %P of %q+D",
6020 return error_mark_node
;
6024 /* Conversion to std::initializer_list<T>. */
6025 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
6026 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
6027 unsigned len
= CONSTRUCTOR_NELTS (expr
);
6028 tree array
, val
, field
;
6029 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
6032 /* Convert all the elements. */
6033 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
6035 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
6036 1, false, false, complain
);
6037 if (sub
== error_mark_node
)
6039 if (!BRACE_ENCLOSED_INITIALIZER_P (val
))
6040 check_narrowing (TREE_TYPE (sub
), val
);
6041 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
6042 if (!TREE_CONSTANT (sub
))
6043 TREE_CONSTANT (new_ctor
) = false;
6045 /* Build up the array. */
6046 elttype
= cp_build_qualified_type
6047 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
6048 array
= build_array_of_n_type (elttype
, len
);
6049 array
= finish_compound_literal (array
, new_ctor
, complain
);
6050 /* Take the address explicitly rather than via decay_conversion
6051 to avoid the error about taking the address of a temporary. */
6052 array
= cp_build_addr_expr (array
, complain
);
6053 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
6055 /* Build up the initializer_list object. */
6056 totype
= complete_type (totype
);
6057 field
= next_initializable_field (TYPE_FIELDS (totype
));
6058 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
6059 field
= next_initializable_field (DECL_CHAIN (field
));
6060 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
6061 new_ctor
= build_constructor (totype
, vec
);
6062 return get_target_expr_sfinae (new_ctor
, complain
);
6066 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
6068 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6069 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
6070 real
= perform_implicit_conversion (TREE_TYPE (totype
),
6072 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
6074 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
6075 return fold_if_not_in_template (expr
);
6077 expr
= reshape_init (totype
, expr
, complain
);
6078 return get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
6085 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
6086 convs
->kind
== ck_ref_bind
? -1 : 1,
6087 convs
->kind
== ck_ref_bind
? issue_conversion_warnings
: false,
6090 if (expr
== error_mark_node
)
6091 return error_mark_node
;
6093 switch (convs
->kind
)
6096 expr
= decay_conversion (expr
, complain
);
6097 if (expr
== error_mark_node
)
6098 return error_mark_node
;
6100 if (! MAYBE_CLASS_TYPE_P (totype
))
6102 /* Else fall through. */
6104 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
6106 /* We are going to bind a reference directly to a base-class
6107 subobject of EXPR. */
6108 /* Build an expression for `*((base*) &expr)'. */
6109 expr
= cp_build_addr_expr (expr
, complain
);
6110 expr
= convert_to_base (expr
, build_pointer_type (totype
),
6111 !c_cast_p
, /*nonnull=*/true, complain
);
6112 expr
= cp_build_indirect_ref (expr
, RO_IMPLICIT_CONVERSION
, complain
);
6116 /* Copy-initialization where the cv-unqualified version of the source
6117 type is the same class as, or a derived class of, the class of the
6118 destination [is treated as direct-initialization]. [dcl.init] */
6119 flags
= LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
;
6120 if (convs
->user_conv_p
)
6121 /* This conversion is being done in the context of a user-defined
6122 conversion (i.e. the second step of copy-initialization), so
6123 don't allow any more. */
6124 flags
|= LOOKUP_NO_CONVERSION
;
6125 if (convs
->rvaluedness_matches_p
)
6126 flags
|= LOOKUP_PREFER_RVALUE
;
6127 if (TREE_CODE (expr
) == TARGET_EXPR
6128 && TARGET_EXPR_LIST_INIT_P (expr
))
6129 /* Copy-list-initialization doesn't actually involve a copy. */
6131 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
6132 if (diag_kind
&& fn
&& complain
)
6133 emit_diagnostic (diag_kind
, DECL_SOURCE_LOCATION (fn
), 0,
6134 " initializing argument %P of %qD", argnum
, fn
);
6135 return build_cplus_new (totype
, expr
, complain
);
6139 tree ref_type
= totype
;
6141 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
6143 gcc_assert (TYPE_REF_IS_RVALUE (ref_type
)
6144 && real_lvalue_p (expr
));
6146 error_at (loc
, "cannot bind %qT lvalue to %qT",
6147 TREE_TYPE (expr
), totype
);
6149 inform (input_location
,
6150 "initializing argument %P of %q+D", argnum
, fn
);
6151 return error_mark_node
;
6154 /* If necessary, create a temporary.
6156 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
6157 that need temporaries, even when their types are reference
6158 compatible with the type of reference being bound, so the
6159 upcoming call to cp_build_addr_expr doesn't fail. */
6160 if (convs
->need_temporary_p
6161 || TREE_CODE (expr
) == CONSTRUCTOR
6162 || TREE_CODE (expr
) == VA_ARG_EXPR
)
6164 /* Otherwise, a temporary of type "cv1 T1" is created and
6165 initialized from the initializer expression using the rules
6166 for a non-reference copy-initialization (8.5). */
6168 tree type
= TREE_TYPE (ref_type
);
6169 cp_lvalue_kind lvalue
= real_lvalue_p (expr
);
6171 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6172 (type
, next_conversion (convs
)->type
));
6173 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
6174 && !TYPE_REF_IS_RVALUE (ref_type
))
6176 /* If the reference is volatile or non-const, we
6177 cannot create a temporary. */
6178 if (lvalue
& clk_bitfield
)
6179 error_at (loc
, "cannot bind bitfield %qE to %qT",
6181 else if (lvalue
& clk_packed
)
6182 error_at (loc
, "cannot bind packed field %qE to %qT",
6185 error_at (loc
, "cannot bind rvalue %qE to %qT",
6187 return error_mark_node
;
6189 /* If the source is a packed field, and we must use a copy
6190 constructor, then building the target expr will require
6191 binding the field to the reference parameter to the
6192 copy constructor, and we'll end up with an infinite
6193 loop. If we can use a bitwise copy, then we'll be
6195 if ((lvalue
& clk_packed
)
6196 && CLASS_TYPE_P (type
)
6197 && type_has_nontrivial_copy_init (type
))
6199 error_at (loc
, "cannot bind packed field %qE to %qT",
6201 return error_mark_node
;
6203 if (lvalue
& clk_bitfield
)
6205 expr
= convert_bitfield_to_declared_type (expr
);
6206 expr
= fold_convert (type
, expr
);
6208 expr
= build_target_expr_with_type (expr
, type
, complain
);
6211 /* Take the address of the thing to which we will bind the
6213 expr
= cp_build_addr_expr (expr
, complain
);
6214 if (expr
== error_mark_node
)
6215 return error_mark_node
;
6217 /* Convert it to a pointer to the type referred to by the
6218 reference. This will adjust the pointer if a derived to
6219 base conversion is being performed. */
6220 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
6222 /* Convert the pointer to the desired reference type. */
6223 return build_nop (ref_type
, expr
);
6227 return decay_conversion (expr
, complain
);
6230 /* Warn about deprecated conversion if appropriate. */
6231 string_conv_p (totype
, expr
, 1);
6236 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
6237 /*nonnull=*/false, complain
);
6238 return build_nop (totype
, expr
);
6241 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
6242 c_cast_p
, complain
);
6248 if (convs
->check_narrowing
)
6249 check_narrowing (totype
, expr
);
6251 if (issue_conversion_warnings
)
6252 expr
= cp_convert_and_check (totype
, expr
, complain
);
6254 expr
= cp_convert (totype
, expr
, complain
);
6259 /* ARG is being passed to a varargs function. Perform any conversions
6260 required. Return the converted value. */
6263 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
6266 location_t loc
= EXPR_LOC_OR_HERE (arg
);
6270 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6271 standard conversions are performed. */
6272 arg
= decay_conversion (arg
, complain
);
6273 arg_type
= TREE_TYPE (arg
);
6276 If the argument has integral or enumeration type that is subject
6277 to the integral promotions (_conv.prom_), or a floating point
6278 type that is subject to the floating point promotion
6279 (_conv.fpprom_), the value of the argument is converted to the
6280 promoted type before the call. */
6281 if (TREE_CODE (arg_type
) == REAL_TYPE
6282 && (TYPE_PRECISION (arg_type
)
6283 < TYPE_PRECISION (double_type_node
))
6284 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
6286 if ((complain
& tf_warning
)
6287 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
6288 warning_at (loc
, OPT_Wdouble_promotion
,
6289 "implicit conversion from %qT to %qT when passing "
6290 "argument to function",
6291 arg_type
, double_type_node
);
6292 arg
= convert_to_real (double_type_node
, arg
);
6294 else if (NULLPTR_TYPE_P (arg_type
))
6295 arg
= null_pointer_node
;
6296 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
6298 if (SCOPED_ENUM_P (arg_type
) && !abi_version_at_least (6))
6300 if (complain
& tf_warning
)
6301 warning_at (loc
, OPT_Wabi
, "scoped enum %qT will not promote to an "
6302 "integral type in a future version of GCC", arg_type
);
6303 arg
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
, complain
);
6305 arg
= cp_perform_integral_promotions (arg
, complain
);
6308 arg
= require_complete_type_sfinae (arg
, complain
);
6309 arg_type
= TREE_TYPE (arg
);
6311 if (arg
!= error_mark_node
6312 /* In a template (or ill-formed code), we can have an incomplete type
6313 even after require_complete_type_sfinae, in which case we don't know
6314 whether it has trivial copy or not. */
6315 && COMPLETE_TYPE_P (arg_type
))
6317 /* Build up a real lvalue-to-rvalue conversion in case the
6318 copy constructor is trivial but not callable. */
6319 if (!cp_unevaluated_operand
&& CLASS_TYPE_P (arg_type
))
6320 force_rvalue (arg
, complain
);
6322 /* [expr.call] 5.2.2/7:
6323 Passing a potentially-evaluated argument of class type (Clause 9)
6324 with a non-trivial copy constructor or a non-trivial destructor
6325 with no corresponding parameter is conditionally-supported, with
6326 implementation-defined semantics.
6328 We used to just warn here and do a bitwise copy, but now
6329 cp_expr_size will abort if we try to do that.
6331 If the call appears in the context of a sizeof expression,
6332 it is not potentially-evaluated. */
6333 if (cp_unevaluated_operand
== 0
6334 && (type_has_nontrivial_copy_init (arg_type
)
6335 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
)))
6337 if (complain
& tf_error
)
6338 error_at (loc
, "cannot pass objects of non-trivially-copyable "
6339 "type %q#T through %<...%>", arg_type
);
6341 return error_mark_node
;
6348 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
6351 build_x_va_arg (source_location loc
, tree expr
, tree type
)
6353 if (processing_template_decl
)
6354 return build_min (VA_ARG_EXPR
, type
, expr
);
6356 type
= complete_type_or_else (type
, NULL_TREE
);
6358 if (expr
== error_mark_node
|| !type
)
6359 return error_mark_node
;
6361 expr
= mark_lvalue_use (expr
);
6363 if (type_has_nontrivial_copy_init (type
)
6364 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
6365 || TREE_CODE (type
) == REFERENCE_TYPE
)
6367 /* Remove reference types so we don't ICE later on. */
6368 tree type1
= non_reference (type
);
6369 /* conditionally-supported behavior [expr.call] 5.2.2/7. */
6370 error ("cannot receive objects of non-trivially-copyable type %q#T "
6371 "through %<...%>; ", type
);
6372 expr
= convert (build_pointer_type (type1
), null_node
);
6373 expr
= cp_build_indirect_ref (expr
, RO_NULL
, tf_warning_or_error
);
6377 return build_va_arg (loc
, expr
, type
);
6380 /* TYPE has been given to va_arg. Apply the default conversions which
6381 would have happened when passed via ellipsis. Return the promoted
6382 type, or the passed type if there is no change. */
6385 cxx_type_promotes_to (tree type
)
6389 /* Perform the array-to-pointer and function-to-pointer
6391 type
= type_decays_to (type
);
6393 promote
= type_promotes_to (type
);
6394 if (same_type_p (type
, promote
))
6400 /* ARG is a default argument expression being passed to a parameter of
6401 the indicated TYPE, which is a parameter to FN. PARMNUM is the
6402 zero-based argument number. Do any required conversions. Return
6403 the converted value. */
6405 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
6407 push_defarg_context (tree fn
)
6408 { vec_safe_push (default_arg_context
, fn
); }
6411 pop_defarg_context (void)
6412 { default_arg_context
->pop (); }
6415 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
6416 tsubst_flags_t complain
)
6421 /* See through clones. */
6422 fn
= DECL_ORIGIN (fn
);
6424 /* Detect recursion. */
6425 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
6428 if (complain
& tf_error
)
6429 error ("recursive evaluation of default argument for %q#D", fn
);
6430 return error_mark_node
;
6433 /* If the ARG is an unparsed default argument expression, the
6434 conversion cannot be performed. */
6435 if (TREE_CODE (arg
) == DEFAULT_ARG
)
6437 if (complain
& tf_error
)
6438 error ("call to %qD uses the default argument for parameter %P, which "
6439 "is not yet defined", fn
, parmnum
);
6440 return error_mark_node
;
6443 push_defarg_context (fn
);
6445 if (fn
&& DECL_TEMPLATE_INFO (fn
))
6446 arg
= tsubst_default_argument (fn
, type
, arg
, complain
);
6452 The names in the expression are bound, and the semantic
6453 constraints are checked, at the point where the default
6454 expressions appears.
6456 we must not perform access checks here. */
6457 push_deferring_access_checks (dk_no_check
);
6458 /* We must make a copy of ARG, in case subsequent processing
6459 alters any part of it. */
6460 arg
= break_out_target_exprs (arg
);
6461 if (TREE_CODE (arg
) == CONSTRUCTOR
)
6463 arg
= digest_init (type
, arg
, complain
);
6464 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
6465 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
6470 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
6471 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
6473 arg
= convert_for_arg_passing (type
, arg
, complain
);
6475 pop_deferring_access_checks();
6477 pop_defarg_context ();
6482 /* Returns the type which will really be used for passing an argument of
6486 type_passed_as (tree type
)
6488 /* Pass classes with copy ctors by invisible reference. */
6489 if (TREE_ADDRESSABLE (type
))
6491 type
= build_reference_type (type
);
6492 /* There are no other pointers to this temporary. */
6493 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
6495 else if (targetm
.calls
.promote_prototypes (type
)
6496 && INTEGRAL_TYPE_P (type
)
6497 && COMPLETE_TYPE_P (type
)
6498 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
),
6499 TYPE_SIZE (integer_type_node
)))
6500 type
= integer_type_node
;
6505 /* Actually perform the appropriate conversion. */
6508 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
6512 /* If VAL is a bitfield, then -- since it has already been converted
6513 to TYPE -- it cannot have a precision greater than TYPE.
6515 If it has a smaller precision, we must widen it here. For
6516 example, passing "int f:3;" to a function expecting an "int" will
6517 not result in any conversion before this point.
6519 If the precision is the same we must not risk widening. For
6520 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
6521 often have type "int", even though the C++ type for the field is
6522 "long long". If the value is being passed to a function
6523 expecting an "int", then no conversions will be required. But,
6524 if we call convert_bitfield_to_declared_type, the bitfield will
6525 be converted to "long long". */
6526 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
6528 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
6529 val
= convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type
), val
);
6531 if (val
== error_mark_node
)
6533 /* Pass classes with copy ctors by invisible reference. */
6534 else if (TREE_ADDRESSABLE (type
))
6535 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
6536 else if (targetm
.calls
.promote_prototypes (type
)
6537 && INTEGRAL_TYPE_P (type
)
6538 && COMPLETE_TYPE_P (type
)
6539 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
),
6540 TYPE_SIZE (integer_type_node
)))
6541 val
= cp_perform_integral_promotions (val
, complain
);
6542 if ((complain
& tf_warning
)
6543 && warn_suggest_attribute_format
)
6545 tree rhstype
= TREE_TYPE (val
);
6546 const enum tree_code coder
= TREE_CODE (rhstype
);
6547 const enum tree_code codel
= TREE_CODE (type
);
6548 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
6550 && check_missing_format_attribute (type
, rhstype
))
6551 warning (OPT_Wsuggest_attribute_format
,
6552 "argument of function call might be a candidate for a format attribute");
6557 /* Returns true iff FN is a function with magic varargs, i.e. ones for
6558 which no conversions at all should be done. This is true for some
6559 builtins which don't act like normal functions. */
6562 magic_varargs_p (tree fn
)
6564 if (flag_enable_cilkplus
&& is_cilkplus_reduce_builtin (fn
) != BUILT_IN_NONE
)
6567 if (DECL_BUILT_IN (fn
))
6568 switch (DECL_FUNCTION_CODE (fn
))
6570 case BUILT_IN_CLASSIFY_TYPE
:
6571 case BUILT_IN_CONSTANT_P
:
6572 case BUILT_IN_NEXT_ARG
:
6573 case BUILT_IN_VA_START
:
6577 return lookup_attribute ("type generic",
6578 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
6584 /* Returns the decl of the dispatcher function if FN is a function version. */
6587 get_function_version_dispatcher (tree fn
)
6589 tree dispatcher_decl
= NULL
;
6591 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
6592 && DECL_FUNCTION_VERSIONED (fn
));
6594 gcc_assert (targetm
.get_function_versions_dispatcher
);
6595 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
6597 if (dispatcher_decl
== NULL
)
6599 error_at (input_location
, "use of multiversioned function "
6600 "without a default");
6604 retrofit_lang_decl (dispatcher_decl
);
6605 gcc_assert (dispatcher_decl
!= NULL
);
6606 return dispatcher_decl
;
6609 /* fn is a function version dispatcher that is marked used. Mark all the
6610 semantically identical function versions it will dispatch as used. */
6613 mark_versions_used (tree fn
)
6615 struct cgraph_node
*node
;
6616 struct cgraph_function_version_info
*node_v
;
6617 struct cgraph_function_version_info
*it_v
;
6619 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6621 node
= cgraph_get_node (fn
);
6625 gcc_assert (node
->dispatcher_function
);
6627 node_v
= get_cgraph_node_version (node
);
6631 /* All semantically identical versions are chained. Traverse and mark each
6632 one of them as used. */
6633 it_v
= node_v
->next
;
6634 while (it_v
!= NULL
)
6636 mark_used (it_v
->this_node
->decl
);
6641 /* Subroutine of the various build_*_call functions. Overload resolution
6642 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
6643 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
6644 bitmask of various LOOKUP_* flags which apply to the call itself. */
6647 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
6650 const vec
<tree
, va_gc
> *args
= cand
->args
;
6651 tree first_arg
= cand
->first_arg
;
6652 conversion
**convs
= cand
->convs
;
6654 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
6659 unsigned int arg_index
= 0;
6663 bool already_used
= false;
6665 /* In a template, there is no need to perform all of the work that
6666 is normally done. We are only interested in the type of the call
6667 expression, i.e., the return type of the function. Any semantic
6668 errors will be deferred until the template is instantiated. */
6669 if (processing_template_decl
)
6673 const tree
*argarray
;
6676 return_type
= TREE_TYPE (TREE_TYPE (fn
));
6677 nargs
= vec_safe_length (args
);
6678 if (first_arg
== NULL_TREE
)
6679 argarray
= args
->address ();
6687 alcarray
= XALLOCAVEC (tree
, nargs
);
6688 alcarray
[0] = first_arg
;
6689 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
6690 alcarray
[ix
+ 1] = arg
;
6691 argarray
= alcarray
;
6694 addr
= build_addr_func (fn
, complain
);
6695 if (addr
== error_mark_node
)
6696 return error_mark_node
;
6697 expr
= build_call_array_loc (input_location
, return_type
,
6698 addr
, nargs
, argarray
);
6699 if (TREE_THIS_VOLATILE (fn
) && cfun
)
6700 current_function_returns_abnormally
= 1;
6701 return convert_from_reference (expr
);
6704 /* Give any warnings we noticed during overload resolution. */
6705 if (cand
->warnings
&& (complain
& tf_warning
))
6707 struct candidate_warning
*w
;
6708 for (w
= cand
->warnings
; w
; w
= w
->next
)
6709 joust (cand
, w
->loser
, 1, complain
);
6712 /* Make =delete work with SFINAE. */
6713 if (DECL_DELETED_FN (fn
) && !(complain
& tf_error
))
6714 return error_mark_node
;
6716 if (DECL_FUNCTION_MEMBER_P (fn
))
6719 /* If FN is a template function, two cases must be considered.
6724 template <class T> void f();
6726 template <class T> struct B {
6730 struct C : A, B<int> {
6732 using B<int>::g; // #2
6735 In case #1 where `A::f' is a member template, DECL_ACCESS is
6736 recorded in the primary template but not in its specialization.
6737 We check access of FN using its primary template.
6739 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
6740 because it is a member of class template B, DECL_ACCESS is
6741 recorded in the specialization `B<int>::g'. We cannot use its
6742 primary template because `B<T>::g' and `B<int>::g' may have
6743 different access. */
6744 if (DECL_TEMPLATE_INFO (fn
)
6745 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
6746 access_fn
= DECL_TI_TEMPLATE (fn
);
6749 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
6751 return error_mark_node
;
6754 /* If we're checking for implicit delete, don't bother with argument
6756 if (flags
& LOOKUP_SPECULATIVE
)
6758 if (DECL_DELETED_FN (fn
))
6760 if (complain
& tf_error
)
6762 return error_mark_node
;
6764 if (cand
->viable
== 1)
6766 else if (!(complain
& tf_error
))
6767 /* Reject bad conversions now. */
6768 return error_mark_node
;
6769 /* else continue to get conversion error. */
6772 /* N3276 magic doesn't apply to nested calls. */
6773 int decltype_flag
= (complain
& tf_decltype
);
6774 complain
&= ~tf_decltype
;
6776 /* Find maximum size of vector to hold converted arguments. */
6777 parmlen
= list_length (parm
);
6778 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
6779 if (parmlen
> nargs
)
6781 argarray
= XALLOCAVEC (tree
, nargs
);
6783 /* The implicit parameters to a constructor are not considered by overload
6784 resolution, and must be of the proper type. */
6785 if (DECL_CONSTRUCTOR_P (fn
))
6788 if (first_arg
!= NULL_TREE
)
6790 object_arg
= first_arg
;
6791 first_arg
= NULL_TREE
;
6795 object_arg
= (*args
)[arg_index
];
6798 argarray
[j
++] = build_this (object_arg
);
6799 parm
= TREE_CHAIN (parm
);
6800 /* We should never try to call the abstract constructor. */
6801 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
6803 if (DECL_HAS_VTT_PARM_P (fn
))
6805 argarray
[j
++] = (*args
)[arg_index
];
6807 parm
= TREE_CHAIN (parm
);
6810 /* Bypass access control for 'this' parameter. */
6811 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
6813 tree parmtype
= TREE_VALUE (parm
);
6814 tree arg
= build_this (first_arg
!= NULL_TREE
6816 : (*args
)[arg_index
]);
6817 tree argtype
= TREE_TYPE (arg
);
6821 if (convs
[i
]->bad_p
)
6823 if (complain
& tf_error
)
6824 permerror (input_location
, "passing %qT as %<this%> argument of %q#D discards qualifiers",
6825 TREE_TYPE (argtype
), fn
);
6827 return error_mark_node
;
6830 /* See if the function member or the whole class type is declared
6831 final and the call can be devirtualized. */
6832 if (DECL_FINAL_P (fn
)
6833 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
6834 flags
|= LOOKUP_NONVIRTUAL
;
6836 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
6837 X is called for an object that is not of type X, or of a type
6838 derived from X, the behavior is undefined.
6840 So we can assume that anything passed as 'this' is non-null, and
6841 optimize accordingly. */
6842 gcc_assert (TYPE_PTR_P (parmtype
));
6843 /* Convert to the base in which the function was declared. */
6844 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
6845 converted_arg
= build_base_path (PLUS_EXPR
,
6847 cand
->conversion_path
,
6849 /* Check that the base class is accessible. */
6850 if (!accessible_base_p (TREE_TYPE (argtype
),
6851 BINFO_TYPE (cand
->conversion_path
), true))
6853 if (complain
& tf_error
)
6854 error ("%qT is not an accessible base of %qT",
6855 BINFO_TYPE (cand
->conversion_path
),
6856 TREE_TYPE (argtype
));
6858 return error_mark_node
;
6860 /* If fn was found by a using declaration, the conversion path
6861 will be to the derived class, not the base declaring fn. We
6862 must convert from derived to base. */
6863 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
6864 TREE_TYPE (parmtype
), ba_unique
,
6866 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
6867 base_binfo
, 1, complain
);
6869 argarray
[j
++] = converted_arg
;
6870 parm
= TREE_CHAIN (parm
);
6871 if (first_arg
!= NULL_TREE
)
6872 first_arg
= NULL_TREE
;
6879 gcc_assert (first_arg
== NULL_TREE
);
6880 for (; arg_index
< vec_safe_length (args
) && parm
;
6881 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
6883 tree type
= TREE_VALUE (parm
);
6884 tree arg
= (*args
)[arg_index
];
6885 bool conversion_warning
= true;
6889 /* If the argument is NULL and used to (implicitly) instantiate a
6890 template function (and bind one of the template arguments to
6891 the type of 'long int'), we don't want to warn about passing NULL
6892 to non-pointer argument.
6893 For example, if we have this template function:
6895 template<typename T> void func(T x) {}
6897 we want to warn (when -Wconversion is enabled) in this case:
6903 but not in this case:
6909 if (arg
== null_node
6910 && DECL_TEMPLATE_INFO (fn
)
6911 && cand
->template_decl
6912 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
6913 conversion_warning
= false;
6915 /* Warn about initializer_list deduction that isn't currently in the
6917 if (cxx_dialect
> cxx98
6918 && flag_deduce_init_list
6919 && cand
->template_decl
6920 && is_std_init_list (non_reference (type
))
6921 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
6923 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
6924 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
6925 tree patparm
= get_pattern_parm (realparm
, tmpl
);
6926 tree pattype
= TREE_TYPE (patparm
);
6927 if (PACK_EXPANSION_P (pattype
))
6928 pattype
= PACK_EXPANSION_PATTERN (pattype
);
6929 pattype
= non_reference (pattype
);
6931 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
6932 && (cand
->explicit_targs
== NULL_TREE
6933 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
6934 <= TEMPLATE_TYPE_IDX (pattype
))))
6936 pedwarn (input_location
, 0, "deducing %qT as %qT",
6937 non_reference (TREE_TYPE (patparm
)),
6938 non_reference (type
));
6939 pedwarn (input_location
, 0, " in call to %q+D", cand
->fn
);
6940 pedwarn (input_location
, 0,
6941 " (you can disable this with -fno-deduce-init-list)");
6944 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
6947 : complain
& (~tf_warning
));
6949 val
= convert_for_arg_passing (type
, val
, complain
);
6951 if (val
== error_mark_node
)
6952 return error_mark_node
;
6954 argarray
[j
++] = val
;
6957 /* Default arguments */
6958 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
6960 if (TREE_VALUE (parm
) == error_mark_node
)
6961 return error_mark_node
;
6962 argarray
[j
++] = convert_default_arg (TREE_VALUE (parm
),
6963 TREE_PURPOSE (parm
),
6969 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
6971 tree a
= (*args
)[arg_index
];
6972 if (magic_varargs_p (fn
))
6973 /* Do no conversions for magic varargs. */
6974 a
= mark_type_use (a
);
6976 a
= convert_arg_to_ellipsis (a
, complain
);
6980 gcc_assert (j
<= nargs
);
6983 check_function_arguments (TREE_TYPE (fn
), nargs
, argarray
);
6985 /* Avoid actually calling copy constructors and copy assignment operators,
6988 if (! flag_elide_constructors
)
6989 /* Do things the hard way. */;
6990 else if (cand
->num_convs
== 1
6991 && (DECL_COPY_CONSTRUCTOR_P (fn
)
6992 || DECL_MOVE_CONSTRUCTOR_P (fn
)))
6995 tree arg
= argarray
[num_artificial_parms_for (fn
)];
6997 bool trivial
= trivial_fn_p (fn
);
6999 /* Pull out the real argument, disregarding const-correctness. */
7001 while (CONVERT_EXPR_P (targ
)
7002 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
7003 targ
= TREE_OPERAND (targ
, 0);
7004 if (TREE_CODE (targ
) == ADDR_EXPR
)
7006 targ
= TREE_OPERAND (targ
, 0);
7007 if (!same_type_ignoring_top_level_qualifiers_p
7008 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
7017 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
7019 /* [class.copy]: the copy constructor is implicitly defined even if
7020 the implementation elided its use. */
7021 if (!trivial
|| DECL_DELETED_FN (fn
))
7024 already_used
= true;
7027 /* If we're creating a temp and we already have one, don't create a
7028 new one. If we're not creating a temp but we get one, use
7029 INIT_EXPR to collapse the temp into our target. Otherwise, if the
7030 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
7031 temp or an INIT_EXPR otherwise. */
7033 if (integer_zerop (fa
))
7035 if (TREE_CODE (arg
) == TARGET_EXPR
)
7038 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
7040 else if (TREE_CODE (arg
) == TARGET_EXPR
|| trivial
)
7042 tree to
= stabilize_reference (cp_build_indirect_ref (fa
, RO_NULL
,
7045 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
7049 else if (DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
7050 && trivial_fn_p (fn
)
7051 && !DECL_DELETED_FN (fn
))
7053 tree to
= stabilize_reference
7054 (cp_build_indirect_ref (argarray
[0], RO_NULL
, complain
));
7055 tree type
= TREE_TYPE (to
);
7056 tree as_base
= CLASSTYPE_AS_BASE (type
);
7057 tree arg
= argarray
[1];
7059 if (is_really_empty_class (type
))
7061 /* Avoid copying empty classes. */
7062 val
= build2 (COMPOUND_EXPR
, void_type_node
, to
, arg
);
7063 TREE_NO_WARNING (val
) = 1;
7064 val
= build2 (COMPOUND_EXPR
, type
, val
, to
);
7065 TREE_NO_WARNING (val
) = 1;
7067 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
7069 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
7070 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
7074 /* We must only copy the non-tail padding parts. */
7076 tree array_type
, alias_set
;
7078 arg2
= TYPE_SIZE_UNIT (as_base
);
7079 arg0
= cp_build_addr_expr (to
, complain
);
7081 array_type
= build_array_type (char_type_node
,
7083 (size_binop (MINUS_EXPR
,
7084 arg2
, size_int (1))));
7085 alias_set
= build_int_cst (build_pointer_type (type
), 0);
7086 t
= build2 (MODIFY_EXPR
, void_type_node
,
7087 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
7088 build2 (MEM_REF
, array_type
, arg
, alias_set
));
7089 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
7090 TREE_NO_WARNING (val
) = 1;
7095 else if (DECL_DESTRUCTOR_P (fn
)
7096 && trivial_fn_p (fn
)
7097 && !DECL_DELETED_FN (fn
))
7098 return fold_convert (void_type_node
, argarray
[0]);
7099 /* FIXME handle trivial default constructor, too. */
7101 /* For calls to a multi-versioned function, overload resolution
7102 returns the function with the highest target priority, that is,
7103 the version that will checked for dispatching first. If this
7104 version is inlinable, a direct call to this version can be made
7105 otherwise the call should go through the dispatcher. */
7107 if (DECL_FUNCTION_VERSIONED (fn
)
7108 && (current_function_decl
== NULL
7109 || !targetm
.target_option
.can_inline_p (current_function_decl
, fn
)))
7111 fn
= get_function_version_dispatcher (fn
);
7115 mark_versions_used (fn
);
7120 return error_mark_node
;
7122 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0
7123 /* Don't mess with virtual lookup in fold_non_dependent_expr; virtual
7124 functions can't be constexpr. */
7125 && !in_template_function ())
7128 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
7130 ba_any
, NULL
, complain
);
7131 gcc_assert (binfo
&& binfo
!= error_mark_node
);
7133 /* Warn about deprecated virtual functions now, since we're about
7134 to throw away the decl. */
7135 if (TREE_DEPRECATED (fn
))
7136 warn_deprecated_use (fn
, NULL_TREE
);
7138 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
7140 if (TREE_SIDE_EFFECTS (argarray
[0]))
7141 argarray
[0] = save_expr (argarray
[0]);
7142 t
= build_pointer_type (TREE_TYPE (fn
));
7143 if (DECL_CONTEXT (fn
) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn
)))
7144 fn
= build_java_interface_fn_ref (fn
, argarray
[0]);
7146 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
7151 fn
= build_addr_func (fn
, complain
);
7152 if (fn
== error_mark_node
)
7153 return error_mark_node
;
7156 return build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
7159 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
7160 This function performs no overload resolution, conversion, or other
7161 high-level operations. */
7164 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
7165 tsubst_flags_t complain
)
7170 /* Remember roughly where this call is. */
7171 location_t loc
= EXPR_LOC_OR_HERE (fn
);
7172 fn
= build_call_a (fn
, nargs
, argarray
);
7173 SET_EXPR_LOCATION (fn
, loc
);
7175 fndecl
= get_callee_fndecl (fn
);
7177 /* Check that arguments to builtin functions match the expectations. */
7179 && DECL_BUILT_IN (fndecl
)
7180 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
7181 && !check_builtin_function_arguments (fndecl
, nargs
, argarray
))
7182 return error_mark_node
;
7184 /* If it is a built-in array notation function, then the return type of
7185 the function is the element type of the array passed in as array
7186 notation (i.e. the first parameter of the function). */
7187 if (flag_enable_cilkplus
&& TREE_CODE (fn
) == CALL_EXPR
)
7189 enum built_in_function bif
=
7190 is_cilkplus_reduce_builtin (CALL_EXPR_FN (fn
));
7191 if (bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_ADD
7192 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MUL
7193 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MAX
7194 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MIN
7195 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE
7196 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MUTATING
)
7198 /* for bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_ZERO or
7199 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_ZERO or
7200 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_NONZERO or
7201 BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_NONZERO or
7202 BUILT_IN_CILKPLUS_SEC_REDUCE_MIN_IND or
7203 BUILT_IN_CILKPLUS_SEC_REDUCE_MAX_IND
7204 The pre-defined return-type is the correct one. */
7205 tree array_ntn
= CALL_EXPR_ARG (fn
, 0);
7206 TREE_TYPE (fn
) = TREE_TYPE (array_ntn
);
7211 /* Some built-in function calls will be evaluated at compile-time in
7212 fold (). Set optimize to 1 when folding __builtin_constant_p inside
7213 a constexpr function so that fold_builtin_1 doesn't fold it to 0. */
7214 optimize_sav
= optimize
;
7215 if (!optimize
&& fndecl
&& DECL_IS_BUILTIN_CONSTANT_P (fndecl
)
7216 && current_function_decl
7217 && DECL_DECLARED_CONSTEXPR_P (current_function_decl
))
7219 fn
= fold_if_not_in_template (fn
);
7220 optimize
= optimize_sav
;
7222 if (VOID_TYPE_P (TREE_TYPE (fn
)))
7225 /* 5.2.2/11: If a function call is a prvalue of object type: if the
7226 function call is either the operand of a decltype-specifier or the
7227 right operand of a comma operator that is the operand of a
7228 decltype-specifier, a temporary object is not introduced for the
7229 prvalue. The type of the prvalue may be incomplete. */
7230 if (!(complain
& tf_decltype
))
7232 fn
= require_complete_type_sfinae (fn
, complain
);
7233 if (fn
== error_mark_node
)
7234 return error_mark_node
;
7236 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
7237 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
7239 return convert_from_reference (fn
);
7242 static GTY(()) tree java_iface_lookup_fn
;
7244 /* Make an expression which yields the address of the Java interface
7245 method FN. This is achieved by generating a call to libjava's
7246 _Jv_LookupInterfaceMethodIdx(). */
7249 build_java_interface_fn_ref (tree fn
, tree instance
)
7251 tree lookup_fn
, method
, idx
;
7252 tree klass_ref
, iface
, iface_ref
;
7255 if (!java_iface_lookup_fn
)
7257 tree ftype
= build_function_type_list (ptr_type_node
,
7258 ptr_type_node
, ptr_type_node
,
7259 java_int_type_node
, NULL_TREE
);
7260 java_iface_lookup_fn
7261 = add_builtin_function ("_Jv_LookupInterfaceMethodIdx", ftype
,
7262 0, NOT_BUILT_IN
, NULL
, NULL_TREE
);
7265 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
7266 This is the first entry in the vtable. */
7267 klass_ref
= build_vtbl_ref (cp_build_indirect_ref (instance
, RO_NULL
,
7268 tf_warning_or_error
),
7271 /* Get the java.lang.Class pointer for the interface being called. */
7272 iface
= DECL_CONTEXT (fn
);
7273 iface_ref
= lookup_field (iface
, get_identifier ("class$"), 0, false);
7274 if (!iface_ref
|| !VAR_P (iface_ref
)
7275 || DECL_CONTEXT (iface_ref
) != iface
)
7277 error ("could not find class$ field in java interface type %qT",
7279 return error_mark_node
;
7281 iface_ref
= build_address (iface_ref
);
7282 iface_ref
= convert (build_pointer_type (iface
), iface_ref
);
7284 /* Determine the itable index of FN. */
7286 for (method
= TYPE_METHODS (iface
); method
; method
= DECL_CHAIN (method
))
7288 if (!DECL_VIRTUAL_P (method
))
7294 idx
= build_int_cst (NULL_TREE
, i
);
7296 lookup_fn
= build1 (ADDR_EXPR
,
7297 build_pointer_type (TREE_TYPE (java_iface_lookup_fn
)),
7298 java_iface_lookup_fn
);
7299 return build_call_nary (ptr_type_node
, lookup_fn
,
7300 3, klass_ref
, iface_ref
, idx
);
7303 /* Returns the value to use for the in-charge parameter when making a
7304 call to a function with the indicated NAME.
7306 FIXME:Can't we find a neater way to do this mapping? */
7309 in_charge_arg_for_name (tree name
)
7311 if (name
== base_ctor_identifier
7312 || name
== base_dtor_identifier
)
7313 return integer_zero_node
;
7314 else if (name
== complete_ctor_identifier
)
7315 return integer_one_node
;
7316 else if (name
== complete_dtor_identifier
)
7317 return integer_two_node
;
7318 else if (name
== deleting_dtor_identifier
)
7319 return integer_three_node
;
7321 /* This function should only be called with one of the names listed
7327 /* Build a call to a constructor, destructor, or an assignment
7328 operator for INSTANCE, an expression with class type. NAME
7329 indicates the special member function to call; *ARGS are the
7330 arguments. ARGS may be NULL. This may change ARGS. BINFO
7331 indicates the base of INSTANCE that is to be passed as the `this'
7332 parameter to the member function called.
7334 FLAGS are the LOOKUP_* flags to use when processing the call.
7336 If NAME indicates a complete object constructor, INSTANCE may be
7337 NULL_TREE. In this case, the caller will call build_cplus_new to
7338 store the newly constructed object into a VAR_DECL. */
7341 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
7342 tree binfo
, int flags
, tsubst_flags_t complain
)
7345 /* The type of the subobject to be constructed or destroyed. */
7347 vec
<tree
, va_gc
> *allocated
= NULL
;
7350 gcc_assert (name
== complete_ctor_identifier
7351 || name
== base_ctor_identifier
7352 || name
== complete_dtor_identifier
7353 || name
== base_dtor_identifier
7354 || name
== deleting_dtor_identifier
7355 || name
== ansi_assopname (NOP_EXPR
));
7358 /* Resolve the name. */
7359 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
7360 return error_mark_node
;
7362 binfo
= TYPE_BINFO (binfo
);
7365 gcc_assert (binfo
!= NULL_TREE
);
7367 class_type
= BINFO_TYPE (binfo
);
7369 /* Handle the special case where INSTANCE is NULL_TREE. */
7370 if (name
== complete_ctor_identifier
&& !instance
)
7372 instance
= build_int_cst (build_pointer_type (class_type
), 0);
7373 instance
= build1 (INDIRECT_REF
, class_type
, instance
);
7377 if (name
== complete_dtor_identifier
7378 || name
== base_dtor_identifier
7379 || name
== deleting_dtor_identifier
)
7380 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
7382 /* Convert to the base class, if necessary. */
7383 if (!same_type_ignoring_top_level_qualifiers_p
7384 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
7386 if (name
!= ansi_assopname (NOP_EXPR
))
7387 /* For constructors and destructors, either the base is
7388 non-virtual, or it is virtual but we are doing the
7389 conversion from a constructor or destructor for the
7390 complete object. In either case, we can convert
7392 instance
= convert_to_base_statically (instance
, binfo
);
7394 /* However, for assignment operators, we must convert
7395 dynamically if the base is virtual. */
7396 instance
= build_base_path (PLUS_EXPR
, instance
,
7397 binfo
, /*nonnull=*/1, complain
);
7401 gcc_assert (instance
!= NULL_TREE
);
7403 fns
= lookup_fnfields (binfo
, name
, 1);
7405 /* When making a call to a constructor or destructor for a subobject
7406 that uses virtual base classes, pass down a pointer to a VTT for
7408 if ((name
== base_ctor_identifier
7409 || name
== base_dtor_identifier
)
7410 && CLASSTYPE_VBASECLASSES (class_type
))
7415 /* If the current function is a complete object constructor
7416 or destructor, then we fetch the VTT directly.
7417 Otherwise, we look it up using the VTT we were given. */
7418 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
7419 vtt
= decay_conversion (vtt
, complain
);
7420 if (vtt
== error_mark_node
)
7421 return error_mark_node
;
7422 vtt
= build3 (COND_EXPR
, TREE_TYPE (vtt
),
7423 build2 (EQ_EXPR
, boolean_type_node
,
7424 current_in_charge_parm
, integer_zero_node
),
7427 if (BINFO_SUBVTT_INDEX (binfo
))
7428 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
7434 allocated
= make_tree_vector ();
7438 vec_safe_insert (*args
, 0, sub_vtt
);
7441 ret
= build_new_method_call (instance
, fns
, args
,
7442 TYPE_BINFO (BINFO_TYPE (binfo
)),
7446 if (allocated
!= NULL
)
7447 release_tree_vector (allocated
);
7449 if ((complain
& tf_error
)
7450 && (flags
& LOOKUP_DELEGATING_CONS
)
7451 && name
== complete_ctor_identifier
7452 && TREE_CODE (ret
) == CALL_EXPR
7453 && (DECL_ABSTRACT_ORIGIN (TREE_OPERAND (CALL_EXPR_FN (ret
), 0))
7454 == current_function_decl
))
7455 error ("constructor delegates to itself");
7460 /* Return the NAME, as a C string. The NAME indicates a function that
7461 is a member of TYPE. *FREE_P is set to true if the caller must
7462 free the memory returned.
7464 Rather than go through all of this, we should simply set the names
7465 of constructors and destructors appropriately, and dispense with
7466 ctor_identifier, dtor_identifier, etc. */
7469 name_as_c_string (tree name
, tree type
, bool *free_p
)
7473 /* Assume that we will not allocate memory. */
7475 /* Constructors and destructors are special. */
7476 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
7479 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
))));
7480 /* For a destructor, add the '~'. */
7481 if (name
== complete_dtor_identifier
7482 || name
== base_dtor_identifier
7483 || name
== deleting_dtor_identifier
)
7485 pretty_name
= concat ("~", pretty_name
, NULL
);
7486 /* Remember that we need to free the memory allocated. */
7490 else if (IDENTIFIER_TYPENAME_P (name
))
7492 pretty_name
= concat ("operator ",
7493 type_as_string_translate (TREE_TYPE (name
),
7494 TFF_PLAIN_IDENTIFIER
),
7496 /* Remember that we need to free the memory allocated. */
7500 pretty_name
= CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name
)));
7505 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
7506 be set, upon return, to the function called. ARGS may be NULL.
7507 This may change ARGS. */
7510 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
7511 tree conversion_path
, int flags
,
7512 tree
*fn_p
, tsubst_flags_t complain
)
7514 struct z_candidate
*candidates
= 0, *cand
;
7515 tree explicit_targs
= NULL_TREE
;
7516 tree basetype
= NULL_TREE
;
7519 tree first_mem_arg
= NULL_TREE
;
7521 bool skip_first_for_error
;
7522 vec
<tree
, va_gc
> *user_args
;
7525 int template_only
= 0;
7529 vec
<tree
, va_gc
> *orig_args
= NULL
;
7532 gcc_assert (instance
!= NULL_TREE
);
7534 /* We don't know what function we're going to call, yet. */
7538 if (error_operand_p (instance
)
7539 || !fns
|| error_operand_p (fns
))
7540 return error_mark_node
;
7542 if (!BASELINK_P (fns
))
7544 if (complain
& tf_error
)
7545 error ("call to non-function %qD", fns
);
7546 return error_mark_node
;
7549 orig_instance
= instance
;
7552 /* Dismantle the baselink to collect all the information we need. */
7553 if (!conversion_path
)
7554 conversion_path
= BASELINK_BINFO (fns
);
7555 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
7556 optype
= BASELINK_OPTYPE (fns
);
7557 fns
= BASELINK_FUNCTIONS (fns
);
7558 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
7560 explicit_targs
= TREE_OPERAND (fns
, 1);
7561 fns
= TREE_OPERAND (fns
, 0);
7564 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
7565 || TREE_CODE (fns
) == TEMPLATE_DECL
7566 || TREE_CODE (fns
) == OVERLOAD
);
7567 fn
= get_first_fn (fns
);
7568 name
= DECL_NAME (fn
);
7570 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
7571 gcc_assert (CLASS_TYPE_P (basetype
));
7573 if (processing_template_decl
)
7575 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
7576 instance
= build_non_dependent_expr (instance
);
7578 make_args_non_dependent (*args
);
7581 user_args
= args
== NULL
? NULL
: *args
;
7582 /* Under DR 147 A::A() is an invalid constructor call,
7583 not a functional cast. */
7584 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
7586 if (! (complain
& tf_error
))
7587 return error_mark_node
;
7589 if (permerror (input_location
,
7590 "cannot call constructor %<%T::%D%> directly",
7592 inform (input_location
, "for a function-style cast, remove the "
7593 "redundant %<::%D%>", name
);
7594 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
7599 /* Figure out whether to skip the first argument for the error
7600 message we will display to users if an error occurs. We don't
7601 want to display any compiler-generated arguments. The "this"
7602 pointer hasn't been added yet. However, we must remove the VTT
7603 pointer if this is a call to a base-class constructor or
7605 skip_first_for_error
= false;
7606 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
7608 /* Callers should explicitly indicate whether they want to construct
7609 the complete object or just the part without virtual bases. */
7610 gcc_assert (name
!= ctor_identifier
);
7611 /* Similarly for destructors. */
7612 gcc_assert (name
!= dtor_identifier
);
7613 /* Remove the VTT pointer, if present. */
7614 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
7615 && CLASSTYPE_VBASECLASSES (basetype
))
7616 skip_first_for_error
= true;
7619 /* Process the argument list. */
7620 if (args
!= NULL
&& *args
!= NULL
)
7622 *args
= resolve_args (*args
, complain
);
7624 return error_mark_node
;
7627 /* Consider the object argument to be used even if we end up selecting a
7628 static member function. */
7629 instance
= mark_type_use (instance
);
7631 /* It's OK to call destructors and constructors on cv-qualified objects.
7632 Therefore, convert the INSTANCE to the unqualified type, if
7634 if (DECL_DESTRUCTOR_P (fn
)
7635 || DECL_CONSTRUCTOR_P (fn
))
7637 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
7639 instance
= build_this (instance
);
7640 instance
= build_nop (build_pointer_type (basetype
), instance
);
7641 instance
= build_fold_indirect_ref (instance
);
7644 if (DECL_DESTRUCTOR_P (fn
))
7645 name
= complete_dtor_identifier
;
7647 first_mem_arg
= instance
;
7649 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7650 p
= conversion_obstack_alloc (0);
7652 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
7653 initializer, not T({ }). */
7654 if (DECL_CONSTRUCTOR_P (fn
) && args
!= NULL
&& !vec_safe_is_empty (*args
)
7655 && BRACE_ENCLOSED_INITIALIZER_P ((**args
)[0])
7656 && CONSTRUCTOR_IS_DIRECT_INIT ((**args
)[0]))
7658 tree init_list
= (**args
)[0];
7659 tree init
= NULL_TREE
;
7661 gcc_assert ((*args
)->length () == 1
7662 && !(flags
& LOOKUP_ONLYCONVERTING
));
7664 /* If the initializer list has no elements and T is a class type with
7665 a default constructor, the object is value-initialized. Handle
7666 this here so we don't need to handle it wherever we use
7667 build_special_member_call. */
7668 if (CONSTRUCTOR_NELTS (init_list
) == 0
7669 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
7670 /* For a user-provided default constructor, use the normal
7671 mechanisms so that protected access works. */
7672 && !type_has_user_provided_default_constructor (basetype
)
7673 && !processing_template_decl
)
7674 init
= build_value_init (basetype
, complain
);
7676 /* If BASETYPE is an aggregate, we need to do aggregate
7678 else if (CP_AGGREGATE_TYPE_P (basetype
))
7679 init
= digest_init (basetype
, init_list
, complain
);
7683 if (INDIRECT_REF_P (instance
)
7684 && integer_zerop (TREE_OPERAND (instance
, 0)))
7685 return get_target_expr_sfinae (init
, complain
);
7686 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
7687 TREE_SIDE_EFFECTS (init
) = true;
7691 /* Otherwise go ahead with overload resolution. */
7692 add_list_candidates (fns
, first_mem_arg
, init_list
,
7693 basetype
, explicit_targs
, template_only
,
7694 conversion_path
, access_binfo
, flags
,
7695 &candidates
, complain
);
7699 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
7700 explicit_targs
, template_only
, conversion_path
,
7701 access_binfo
, flags
, &candidates
, complain
);
7703 any_viable_p
= false;
7704 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
7708 if (complain
& tf_error
)
7710 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
7711 cxx_incomplete_type_error (instance
, basetype
);
7713 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
7714 basetype
, optype
, build_tree_list_vec (user_args
),
7715 TREE_TYPE (instance
));
7722 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
7723 arglist
= build_tree_list_vec (user_args
);
7724 if (skip_first_for_error
)
7725 arglist
= TREE_CHAIN (arglist
);
7726 error ("no matching function for call to %<%T::%s(%A)%#V%>",
7727 basetype
, pretty_name
, arglist
,
7728 TREE_TYPE (instance
));
7732 print_z_candidates (location_of (name
), candidates
);
7734 call
= error_mark_node
;
7738 cand
= tourney (candidates
, complain
);
7745 if (complain
& tf_error
)
7747 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
7748 arglist
= build_tree_list_vec (user_args
);
7749 if (skip_first_for_error
)
7750 arglist
= TREE_CHAIN (arglist
);
7751 error ("call of overloaded %<%s(%A)%> is ambiguous", pretty_name
,
7753 print_z_candidates (location_of (name
), candidates
);
7757 call
= error_mark_node
;
7764 if (!(flags
& LOOKUP_NONVIRTUAL
)
7765 && DECL_PURE_VIRTUAL_P (fn
)
7766 && instance
== current_class_ref
7767 && (DECL_CONSTRUCTOR_P (current_function_decl
)
7768 || DECL_DESTRUCTOR_P (current_function_decl
))
7769 && (complain
& tf_warning
))
7770 /* This is not an error, it is runtime undefined
7772 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
) ?
7773 "pure virtual %q#D called from constructor"
7774 : "pure virtual %q#D called from destructor"),
7777 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
7778 && is_dummy_object (instance
))
7780 instance
= maybe_resolve_dummy (instance
);
7781 if (instance
== error_mark_node
)
7782 call
= error_mark_node
;
7783 else if (!is_dummy_object (instance
))
7785 /* We captured 'this' in the current lambda now that
7786 we know we really need it. */
7787 cand
->first_arg
= instance
;
7791 if (complain
& tf_error
)
7792 error ("cannot call member function %qD without object",
7794 call
= error_mark_node
;
7798 if (call
!= error_mark_node
)
7800 /* Optimize away vtable lookup if we know that this
7801 function can't be overridden. We need to check if
7802 the context and the instance type are the same,
7803 actually FN might be defined in a different class
7804 type because of a using-declaration. In this case, we
7805 do not want to perform a non-virtual call. */
7806 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
7807 && same_type_ignoring_top_level_qualifiers_p
7808 (DECL_CONTEXT (fn
), TREE_TYPE (instance
))
7809 && resolves_to_fixed_type_p (instance
, 0))
7810 flags
|= LOOKUP_NONVIRTUAL
;
7812 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
7813 /* Now we know what function is being called. */
7816 /* Build the actual CALL_EXPR. */
7817 call
= build_over_call (cand
, flags
, complain
);
7818 /* In an expression of the form `a->f()' where `f' turns
7819 out to be a static member function, `a' is
7820 none-the-less evaluated. */
7821 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
7822 && !is_dummy_object (instance
)
7823 && TREE_SIDE_EFFECTS (instance
))
7824 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
),
7826 else if (call
!= error_mark_node
7827 && DECL_DESTRUCTOR_P (cand
->fn
)
7828 && !VOID_TYPE_P (TREE_TYPE (call
)))
7829 /* An explicit call of the form "x->~X()" has type
7830 "void". However, on platforms where destructors
7831 return "this" (i.e., those where
7832 targetm.cxx.cdtor_returns_this is true), such calls
7833 will appear to have a return value of pointer type
7834 to the low-level call machinery. We do not want to
7835 change the low-level machinery, since we want to be
7836 able to optimize "delete f()" on such platforms as
7837 "operator delete(~X(f()))" (rather than generating
7838 "t = f(), ~X(t), operator delete (t)"). */
7839 call
= build_nop (void_type_node
, call
);
7844 if (processing_template_decl
&& call
!= error_mark_node
)
7846 bool cast_to_void
= false;
7848 if (TREE_CODE (call
) == COMPOUND_EXPR
)
7849 call
= TREE_OPERAND (call
, 1);
7850 else if (TREE_CODE (call
) == NOP_EXPR
)
7852 cast_to_void
= true;
7853 call
= TREE_OPERAND (call
, 0);
7855 if (INDIRECT_REF_P (call
))
7856 call
= TREE_OPERAND (call
, 0);
7857 call
= (build_min_non_dep_call_vec
7859 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
7860 orig_instance
, orig_fns
, NULL_TREE
),
7862 SET_EXPR_LOCATION (call
, input_location
);
7863 call
= convert_from_reference (call
);
7865 call
= build_nop (void_type_node
, call
);
7868 /* Free all the conversions we allocated. */
7869 obstack_free (&conversion_obstack
, p
);
7871 if (orig_args
!= NULL
)
7872 release_tree_vector (orig_args
);
7877 /* Wrapper for above. */
7880 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
7881 tree conversion_path
, int flags
,
7882 tree
*fn_p
, tsubst_flags_t complain
)
7885 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
7886 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
7888 timevar_cond_stop (TV_OVERLOAD
, subtime
);
7892 /* Returns true iff standard conversion sequence ICS1 is a proper
7893 subsequence of ICS2. */
7896 is_subseq (conversion
*ics1
, conversion
*ics2
)
7898 /* We can assume that a conversion of the same code
7899 between the same types indicates a subsequence since we only get
7900 here if the types we are converting from are the same. */
7902 while (ics1
->kind
== ck_rvalue
7903 || ics1
->kind
== ck_lvalue
)
7904 ics1
= next_conversion (ics1
);
7908 while (ics2
->kind
== ck_rvalue
7909 || ics2
->kind
== ck_lvalue
)
7910 ics2
= next_conversion (ics2
);
7912 if (ics2
->kind
== ck_user
7913 || ics2
->kind
== ck_ambig
7914 || ics2
->kind
== ck_aggr
7915 || ics2
->kind
== ck_list
7916 || ics2
->kind
== ck_identity
)
7917 /* At this point, ICS1 cannot be a proper subsequence of
7918 ICS2. We can get a USER_CONV when we are comparing the
7919 second standard conversion sequence of two user conversion
7923 ics2
= next_conversion (ics2
);
7925 if (ics2
->kind
== ics1
->kind
7926 && same_type_p (ics2
->type
, ics1
->type
)
7927 && same_type_p (next_conversion (ics2
)->type
,
7928 next_conversion (ics1
)->type
))
7933 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
7934 be any _TYPE nodes. */
7937 is_properly_derived_from (tree derived
, tree base
)
7939 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
7942 /* We only allow proper derivation here. The DERIVED_FROM_P macro
7943 considers every class derived from itself. */
7944 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
7945 && DERIVED_FROM_P (base
, derived
));
7948 /* We build the ICS for an implicit object parameter as a pointer
7949 conversion sequence. However, such a sequence should be compared
7950 as if it were a reference conversion sequence. If ICS is the
7951 implicit conversion sequence for an implicit object parameter,
7952 modify it accordingly. */
7955 maybe_handle_implicit_object (conversion
**ics
)
7959 /* [over.match.funcs]
7961 For non-static member functions, the type of the
7962 implicit object parameter is "reference to cv X"
7963 where X is the class of which the function is a
7964 member and cv is the cv-qualification on the member
7965 function declaration. */
7966 conversion
*t
= *ics
;
7967 tree reference_type
;
7969 /* The `this' parameter is a pointer to a class type. Make the
7970 implicit conversion talk about a reference to that same class
7972 reference_type
= TREE_TYPE (t
->type
);
7973 reference_type
= build_reference_type (reference_type
);
7975 if (t
->kind
== ck_qual
)
7976 t
= next_conversion (t
);
7977 if (t
->kind
== ck_ptr
)
7978 t
= next_conversion (t
);
7979 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
7980 t
= direct_reference_binding (reference_type
, t
);
7982 t
->rvaluedness_matches_p
= 0;
7987 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
7988 and return the initial reference binding conversion. Otherwise,
7989 leave *ICS unchanged and return NULL. */
7992 maybe_handle_ref_bind (conversion
**ics
)
7994 if ((*ics
)->kind
== ck_ref_bind
)
7996 conversion
*old_ics
= *ics
;
7997 *ics
= next_conversion (old_ics
);
7998 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
8005 /* Compare two implicit conversion sequences according to the rules set out in
8006 [over.ics.rank]. Return values:
8008 1: ics1 is better than ics2
8009 -1: ics2 is better than ics1
8010 0: ics1 and ics2 are indistinguishable */
8013 compare_ics (conversion
*ics1
, conversion
*ics2
)
8019 tree deref_from_type1
= NULL_TREE
;
8020 tree deref_from_type2
= NULL_TREE
;
8021 tree deref_to_type1
= NULL_TREE
;
8022 tree deref_to_type2
= NULL_TREE
;
8023 conversion_rank rank1
, rank2
;
8025 /* REF_BINDING is nonzero if the result of the conversion sequence
8026 is a reference type. In that case REF_CONV is the reference
8027 binding conversion. */
8028 conversion
*ref_conv1
;
8029 conversion
*ref_conv2
;
8031 /* Handle implicit object parameters. */
8032 maybe_handle_implicit_object (&ics1
);
8033 maybe_handle_implicit_object (&ics2
);
8035 /* Handle reference parameters. */
8036 ref_conv1
= maybe_handle_ref_bind (&ics1
);
8037 ref_conv2
= maybe_handle_ref_bind (&ics2
);
8039 /* List-initialization sequence L1 is a better conversion sequence than
8040 list-initialization sequence L2 if L1 converts to
8041 std::initializer_list<X> for some X and L2 does not. */
8042 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
8044 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
8049 When comparing the basic forms of implicit conversion sequences (as
8050 defined in _over.best.ics_)
8052 --a standard conversion sequence (_over.ics.scs_) is a better
8053 conversion sequence than a user-defined conversion sequence
8054 or an ellipsis conversion sequence, and
8056 --a user-defined conversion sequence (_over.ics.user_) is a
8057 better conversion sequence than an ellipsis conversion sequence
8058 (_over.ics.ellipsis_). */
8059 rank1
= CONVERSION_RANK (ics1
);
8060 rank2
= CONVERSION_RANK (ics2
);
8064 else if (rank1
< rank2
)
8067 if (rank1
== cr_bad
)
8069 /* Both ICS are bad. We try to make a decision based on what would
8070 have happened if they'd been good. This is not an extension,
8071 we'll still give an error when we build up the call; this just
8072 helps us give a more helpful error message. */
8073 rank1
= BAD_CONVERSION_RANK (ics1
);
8074 rank2
= BAD_CONVERSION_RANK (ics2
);
8078 else if (rank1
< rank2
)
8081 /* We couldn't make up our minds; try to figure it out below. */
8084 if (ics1
->ellipsis_p
)
8085 /* Both conversions are ellipsis conversions. */
8088 /* User-defined conversion sequence U1 is a better conversion sequence
8089 than another user-defined conversion sequence U2 if they contain the
8090 same user-defined conversion operator or constructor and if the sec-
8091 ond standard conversion sequence of U1 is better than the second
8092 standard conversion sequence of U2. */
8094 /* Handle list-conversion with the same code even though it isn't always
8095 ranked as a user-defined conversion and it doesn't have a second
8096 standard conversion sequence; it will still have the desired effect.
8097 Specifically, we need to do the reference binding comparison at the
8098 end of this function. */
8100 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
|| ics1
->kind
== ck_aggr
)
8105 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
8106 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
8107 || t1
->kind
== ck_list
)
8109 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
8110 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
8111 || t2
->kind
== ck_list
)
8114 if (t1
->kind
!= t2
->kind
)
8116 else if (t1
->kind
== ck_user
)
8118 if (t1
->cand
->fn
!= t2
->cand
->fn
)
8123 /* For ambiguous or aggregate conversions, use the target type as
8124 a proxy for the conversion function. */
8125 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
8129 /* We can just fall through here, after setting up
8130 FROM_TYPE1 and FROM_TYPE2. */
8131 from_type1
= t1
->type
;
8132 from_type2
= t2
->type
;
8139 /* We're dealing with two standard conversion sequences.
8143 Standard conversion sequence S1 is a better conversion
8144 sequence than standard conversion sequence S2 if
8146 --S1 is a proper subsequence of S2 (comparing the conversion
8147 sequences in the canonical form defined by _over.ics.scs_,
8148 excluding any Lvalue Transformation; the identity
8149 conversion sequence is considered to be a subsequence of
8150 any non-identity conversion sequence */
8153 while (t1
->kind
!= ck_identity
)
8154 t1
= next_conversion (t1
);
8155 from_type1
= t1
->type
;
8158 while (t2
->kind
!= ck_identity
)
8159 t2
= next_conversion (t2
);
8160 from_type2
= t2
->type
;
8163 /* One sequence can only be a subsequence of the other if they start with
8164 the same type. They can start with different types when comparing the
8165 second standard conversion sequence in two user-defined conversion
8167 if (same_type_p (from_type1
, from_type2
))
8169 if (is_subseq (ics1
, ics2
))
8171 if (is_subseq (ics2
, ics1
))
8179 --the rank of S1 is better than the rank of S2 (by the rules
8182 Standard conversion sequences are ordered by their ranks: an Exact
8183 Match is a better conversion than a Promotion, which is a better
8184 conversion than a Conversion.
8186 Two conversion sequences with the same rank are indistinguishable
8187 unless one of the following rules applies:
8189 --A conversion that does not a convert a pointer, pointer to member,
8190 or std::nullptr_t to bool is better than one that does.
8192 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
8193 so that we do not have to check it explicitly. */
8194 if (ics1
->rank
< ics2
->rank
)
8196 else if (ics2
->rank
< ics1
->rank
)
8199 to_type1
= ics1
->type
;
8200 to_type2
= ics2
->type
;
8202 /* A conversion from scalar arithmetic type to complex is worse than a
8203 conversion between scalar arithmetic types. */
8204 if (same_type_p (from_type1
, from_type2
)
8205 && ARITHMETIC_TYPE_P (from_type1
)
8206 && ARITHMETIC_TYPE_P (to_type1
)
8207 && ARITHMETIC_TYPE_P (to_type2
)
8208 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
8209 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
8211 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
8217 if (TYPE_PTR_P (from_type1
)
8218 && TYPE_PTR_P (from_type2
)
8219 && TYPE_PTR_P (to_type1
)
8220 && TYPE_PTR_P (to_type2
))
8222 deref_from_type1
= TREE_TYPE (from_type1
);
8223 deref_from_type2
= TREE_TYPE (from_type2
);
8224 deref_to_type1
= TREE_TYPE (to_type1
);
8225 deref_to_type2
= TREE_TYPE (to_type2
);
8227 /* The rules for pointers to members A::* are just like the rules
8228 for pointers A*, except opposite: if B is derived from A then
8229 A::* converts to B::*, not vice versa. For that reason, we
8230 switch the from_ and to_ variables here. */
8231 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
8232 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
8233 || (TYPE_PTRMEMFUNC_P (from_type1
)
8234 && TYPE_PTRMEMFUNC_P (from_type2
)
8235 && TYPE_PTRMEMFUNC_P (to_type1
)
8236 && TYPE_PTRMEMFUNC_P (to_type2
)))
8238 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
8239 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
8240 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
8241 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
8244 if (deref_from_type1
!= NULL_TREE
8245 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
8246 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
8248 /* This was one of the pointer or pointer-like conversions.
8252 --If class B is derived directly or indirectly from class A,
8253 conversion of B* to A* is better than conversion of B* to
8254 void*, and conversion of A* to void* is better than
8255 conversion of B* to void*. */
8256 if (VOID_TYPE_P (deref_to_type1
)
8257 && VOID_TYPE_P (deref_to_type2
))
8259 if (is_properly_derived_from (deref_from_type1
,
8262 else if (is_properly_derived_from (deref_from_type2
,
8266 else if (VOID_TYPE_P (deref_to_type1
)
8267 || VOID_TYPE_P (deref_to_type2
))
8269 if (same_type_p (deref_from_type1
, deref_from_type2
))
8271 if (VOID_TYPE_P (deref_to_type2
))
8273 if (is_properly_derived_from (deref_from_type1
,
8277 /* We know that DEREF_TO_TYPE1 is `void' here. */
8278 else if (is_properly_derived_from (deref_from_type1
,
8283 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
8284 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
8288 --If class B is derived directly or indirectly from class A
8289 and class C is derived directly or indirectly from B,
8291 --conversion of C* to B* is better than conversion of C* to
8294 --conversion of B* to A* is better than conversion of C* to
8296 if (same_type_p (deref_from_type1
, deref_from_type2
))
8298 if (is_properly_derived_from (deref_to_type1
,
8301 else if (is_properly_derived_from (deref_to_type2
,
8305 else if (same_type_p (deref_to_type1
, deref_to_type2
))
8307 if (is_properly_derived_from (deref_from_type2
,
8310 else if (is_properly_derived_from (deref_from_type1
,
8316 else if (CLASS_TYPE_P (non_reference (from_type1
))
8317 && same_type_p (from_type1
, from_type2
))
8319 tree from
= non_reference (from_type1
);
8323 --binding of an expression of type C to a reference of type
8324 B& is better than binding an expression of type C to a
8325 reference of type A&
8327 --conversion of C to B is better than conversion of C to A, */
8328 if (is_properly_derived_from (from
, to_type1
)
8329 && is_properly_derived_from (from
, to_type2
))
8331 if (is_properly_derived_from (to_type1
, to_type2
))
8333 else if (is_properly_derived_from (to_type2
, to_type1
))
8337 else if (CLASS_TYPE_P (non_reference (to_type1
))
8338 && same_type_p (to_type1
, to_type2
))
8340 tree to
= non_reference (to_type1
);
8344 --binding of an expression of type B to a reference of type
8345 A& is better than binding an expression of type C to a
8346 reference of type A&,
8348 --conversion of B to A is better than conversion of C to A */
8349 if (is_properly_derived_from (from_type1
, to
)
8350 && is_properly_derived_from (from_type2
, to
))
8352 if (is_properly_derived_from (from_type2
, from_type1
))
8354 else if (is_properly_derived_from (from_type1
, from_type2
))
8361 --S1 and S2 differ only in their qualification conversion and yield
8362 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
8363 qualification signature of type T1 is a proper subset of the cv-
8364 qualification signature of type T2 */
8365 if (ics1
->kind
== ck_qual
8366 && ics2
->kind
== ck_qual
8367 && same_type_p (from_type1
, from_type2
))
8369 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
8376 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
8377 to an implicit object parameter, and either S1 binds an lvalue reference
8378 to an lvalue and S2 binds an rvalue reference or S1 binds an rvalue
8379 reference to an rvalue and S2 binds an lvalue reference
8380 (C++0x draft standard, 13.3.3.2)
8382 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
8383 types to which the references refer are the same type except for
8384 top-level cv-qualifiers, and the type to which the reference
8385 initialized by S2 refers is more cv-qualified than the type to
8386 which the reference initialized by S1 refers.
8388 DR 1328 [over.match.best]: the context is an initialization by
8389 conversion function for direct reference binding (13.3.1.6) of a
8390 reference to function type, the return type of F1 is the same kind of
8391 reference (i.e. lvalue or rvalue) as the reference being initialized,
8392 and the return type of F2 is not. */
8394 if (ref_conv1
&& ref_conv2
)
8396 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
8397 && (ref_conv1
->rvaluedness_matches_p
8398 != ref_conv2
->rvaluedness_matches_p
)
8399 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
8400 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
8401 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
8403 return (ref_conv1
->rvaluedness_matches_p
8404 - ref_conv2
->rvaluedness_matches_p
);
8407 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
8408 return comp_cv_qualification (TREE_TYPE (ref_conv2
->type
),
8409 TREE_TYPE (ref_conv1
->type
));
8412 /* Neither conversion sequence is better than the other. */
8416 /* The source type for this standard conversion sequence. */
8419 source_type (conversion
*t
)
8421 for (;; t
= next_conversion (t
))
8423 if (t
->kind
== ck_user
8424 || t
->kind
== ck_ambig
8425 || t
->kind
== ck_identity
)
8431 /* Note a warning about preferring WINNER to LOSER. We do this by storing
8432 a pointer to LOSER and re-running joust to produce the warning if WINNER
8433 is actually used. */
8436 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
8438 candidate_warning
*cw
= (candidate_warning
*)
8439 conversion_obstack_alloc (sizeof (candidate_warning
));
8441 cw
->next
= winner
->warnings
;
8442 winner
->warnings
= cw
;
8445 /* Compare two candidates for overloading as described in
8446 [over.match.best]. Return values:
8448 1: cand1 is better than cand2
8449 -1: cand2 is better than cand1
8450 0: cand1 and cand2 are indistinguishable */
8453 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
8454 tsubst_flags_t complain
)
8457 int off1
= 0, off2
= 0;
8461 /* Candidates that involve bad conversions are always worse than those
8463 if (cand1
->viable
> cand2
->viable
)
8465 if (cand1
->viable
< cand2
->viable
)
8468 /* If we have two pseudo-candidates for conversions to the same type,
8469 or two candidates for the same function, arbitrarily pick one. */
8470 if (cand1
->fn
== cand2
->fn
8471 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
8474 /* Prefer a non-deleted function over an implicitly deleted move
8475 constructor or assignment operator. This differs slightly from the
8476 wording for issue 1402 (which says the move op is ignored by overload
8477 resolution), but this way produces better error messages. */
8478 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
8479 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
8480 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
8482 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
8483 && move_fn_p (cand1
->fn
))
8485 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
8486 && move_fn_p (cand2
->fn
))
8490 /* a viable function F1
8491 is defined to be a better function than another viable function F2 if
8492 for all arguments i, ICSi(F1) is not a worse conversion sequence than
8493 ICSi(F2), and then */
8495 /* for some argument j, ICSj(F1) is a better conversion sequence than
8498 /* For comparing static and non-static member functions, we ignore
8499 the implicit object parameter of the non-static function. The
8500 standard says to pretend that the static function has an object
8501 parm, but that won't work with operator overloading. */
8502 len
= cand1
->num_convs
;
8503 if (len
!= cand2
->num_convs
)
8505 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
8506 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
8508 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
8509 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
8510 /* We're comparing a near-match list constructor and a near-match
8511 non-list constructor. Just treat them as unordered. */
8514 gcc_assert (static_1
!= static_2
);
8525 for (i
= 0; i
< len
; ++i
)
8527 conversion
*t1
= cand1
->convs
[i
+ off1
];
8528 conversion
*t2
= cand2
->convs
[i
+ off2
];
8529 int comp
= compare_ics (t1
, t2
);
8533 if ((complain
& tf_warning
)
8535 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
8536 == cr_std
+ cr_promotion
)
8537 && t1
->kind
== ck_std
8538 && t2
->kind
== ck_std
8539 && TREE_CODE (t1
->type
) == INTEGER_TYPE
8540 && TREE_CODE (t2
->type
) == INTEGER_TYPE
8541 && (TYPE_PRECISION (t1
->type
)
8542 == TYPE_PRECISION (t2
->type
))
8543 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
8544 || (TREE_CODE (next_conversion (t1
)->type
)
8547 tree type
= next_conversion (t1
)->type
;
8549 struct z_candidate
*w
, *l
;
8551 type1
= t1
->type
, type2
= t2
->type
,
8552 w
= cand1
, l
= cand2
;
8554 type1
= t2
->type
, type2
= t1
->type
,
8555 w
= cand2
, l
= cand1
;
8559 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
8560 type
, type1
, type2
);
8561 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
8567 if (winner
&& comp
!= winner
)
8576 /* warn about confusing overload resolution for user-defined conversions,
8577 either between a constructor and a conversion op, or between two
8579 if ((complain
& tf_warning
)
8580 && winner
&& warn_conversion
&& cand1
->second_conv
8581 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
8582 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
8584 struct z_candidate
*w
, *l
;
8585 bool give_warning
= false;
8588 w
= cand1
, l
= cand2
;
8590 w
= cand2
, l
= cand1
;
8592 /* We don't want to complain about `X::operator T1 ()'
8593 beating `X::operator T2 () const', when T2 is a no less
8594 cv-qualified version of T1. */
8595 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
8596 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
8598 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
8599 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
8601 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
8606 if (!comp_ptr_ttypes (t
, f
))
8607 give_warning
= true;
8610 give_warning
= true;
8616 tree source
= source_type (w
->convs
[0]);
8617 if (! DECL_CONSTRUCTOR_P (w
->fn
))
8618 source
= TREE_TYPE (source
);
8619 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
8620 && warning (OPT_Wconversion
, " for conversion from %qT to %qT",
8621 source
, w
->second_conv
->type
))
8623 inform (input_location
, " because conversion sequence for the argument is better");
8633 /* DR 495 moved this tiebreaker above the template ones. */
8635 the context is an initialization by user-defined conversion (see
8636 _dcl.init_ and _over.match.user_) and the standard conversion
8637 sequence from the return type of F1 to the destination type (i.e.,
8638 the type of the entity being initialized) is a better conversion
8639 sequence than the standard conversion sequence from the return type
8640 of F2 to the destination type. */
8642 if (cand1
->second_conv
)
8644 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
8650 F1 is a non-template function and F2 is a template function
8653 if (!cand1
->template_decl
&& cand2
->template_decl
)
8655 else if (cand1
->template_decl
&& !cand2
->template_decl
)
8659 F1 and F2 are template functions and the function template for F1 is
8660 more specialized than the template for F2 according to the partial
8663 if (cand1
->template_decl
&& cand2
->template_decl
)
8665 winner
= more_specialized_fn
8666 (TI_TEMPLATE (cand1
->template_decl
),
8667 TI_TEMPLATE (cand2
->template_decl
),
8668 /* [temp.func.order]: The presence of unused ellipsis and default
8669 arguments has no effect on the partial ordering of function
8670 templates. add_function_candidate() will not have
8671 counted the "this" argument for constructors. */
8672 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
8677 /* Check whether we can discard a builtin candidate, either because we
8678 have two identical ones or matching builtin and non-builtin candidates.
8680 (Pedantically in the latter case the builtin which matched the user
8681 function should not be added to the overload set, but we spot it here.
8684 ... the builtin candidates include ...
8685 - do not have the same parameter type list as any non-template
8686 non-member candidate. */
8688 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
8690 for (i
= 0; i
< len
; ++i
)
8691 if (!same_type_p (cand1
->convs
[i
]->type
,
8692 cand2
->convs
[i
]->type
))
8694 if (i
== cand1
->num_convs
)
8696 if (cand1
->fn
== cand2
->fn
)
8697 /* Two built-in candidates; arbitrarily pick one. */
8699 else if (identifier_p (cand1
->fn
))
8700 /* cand1 is built-in; prefer cand2. */
8703 /* cand2 is built-in; prefer cand1. */
8708 /* For candidates of a multi-versioned function, make the version with
8709 the highest priority win. This version will be checked for dispatching
8710 first. If this version can be inlined into the caller, the front-end
8711 will simply make a direct call to this function. */
8713 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
8714 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
8715 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
8716 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
8718 tree f1
= TREE_TYPE (cand1
->fn
);
8719 tree f2
= TREE_TYPE (cand2
->fn
);
8720 tree p1
= TYPE_ARG_TYPES (f1
);
8721 tree p2
= TYPE_ARG_TYPES (f2
);
8723 /* Check if cand1->fn and cand2->fn are versions of the same function. It
8724 is possible that cand1->fn and cand2->fn are function versions but of
8725 different functions. Check types to see if they are versions of the same
8727 if (compparms (p1
, p2
)
8728 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
8730 /* Always make the version with the higher priority, more
8731 specialized, win. */
8732 gcc_assert (targetm
.compare_version_priority
);
8733 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
8740 /* If the two function declarations represent the same function (this can
8741 happen with declarations in multiple scopes and arg-dependent lookup),
8742 arbitrarily choose one. But first make sure the default args we're
8744 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
8745 && equal_functions (cand1
->fn
, cand2
->fn
))
8747 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
8748 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
8750 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
8752 for (i
= 0; i
< len
; ++i
)
8754 /* Don't crash if the fn is variadic. */
8757 parms1
= TREE_CHAIN (parms1
);
8758 parms2
= TREE_CHAIN (parms2
);
8762 parms1
= TREE_CHAIN (parms1
);
8764 parms2
= TREE_CHAIN (parms2
);
8768 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
8769 TREE_PURPOSE (parms2
)))
8773 if (complain
& tf_error
)
8775 if (permerror (input_location
,
8776 "default argument mismatch in "
8777 "overload resolution"))
8779 inform (input_location
,
8780 " candidate 1: %q+#F", cand1
->fn
);
8781 inform (input_location
,
8782 " candidate 2: %q+#F", cand2
->fn
);
8789 add_warning (cand1
, cand2
);
8792 parms1
= TREE_CHAIN (parms1
);
8793 parms2
= TREE_CHAIN (parms2
);
8801 /* Extension: If the worst conversion for one candidate is worse than the
8802 worst conversion for the other, take the first. */
8803 if (!pedantic
&& (complain
& tf_warning_or_error
))
8805 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
8806 struct z_candidate
*w
= 0, *l
= 0;
8808 for (i
= 0; i
< len
; ++i
)
8810 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
8811 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
8812 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
8813 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
8816 winner
= 1, w
= cand1
, l
= cand2
;
8818 winner
= -1, w
= cand2
, l
= cand1
;
8821 /* Don't choose a deleted function over ambiguity. */
8822 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
8826 pedwarn (input_location
, 0,
8827 "ISO C++ says that these are ambiguous, even "
8828 "though the worst conversion for the first is better than "
8829 "the worst conversion for the second:");
8830 print_z_candidate (input_location
, _("candidate 1:"), w
);
8831 print_z_candidate (input_location
, _("candidate 2:"), l
);
8839 gcc_assert (!winner
);
8843 /* Given a list of candidates for overloading, find the best one, if any.
8844 This algorithm has a worst case of O(2n) (winner is last), and a best
8845 case of O(n/2) (totally ambiguous); much better than a sorting
8848 static struct z_candidate
*
8849 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
8851 struct z_candidate
*champ
= candidates
, *challenger
;
8853 int champ_compared_to_predecessor
= 0;
8855 /* Walk through the list once, comparing each current champ to the next
8856 candidate, knocking out a candidate or two with each comparison. */
8858 for (challenger
= champ
->next
; challenger
; )
8860 fate
= joust (champ
, challenger
, 0, complain
);
8862 challenger
= challenger
->next
;
8867 champ
= challenger
->next
;
8870 champ_compared_to_predecessor
= 0;
8875 champ_compared_to_predecessor
= 1;
8878 challenger
= champ
->next
;
8882 /* Make sure the champ is better than all the candidates it hasn't yet
8883 been compared to. */
8885 for (challenger
= candidates
;
8887 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
8888 challenger
= challenger
->next
)
8890 fate
= joust (champ
, challenger
, 0, complain
);
8898 /* Returns nonzero if things of type FROM can be converted to TO. */
8901 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
8903 tree arg
= NULL_TREE
;
8904 /* implicit_conversion only considers user-defined conversions
8905 if it has an expression for the call argument list. */
8906 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
8907 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
8908 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
8911 /* Returns nonzero if things of type FROM can be converted to TO with a
8912 standard conversion. */
8915 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
8917 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
8920 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
8923 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
8924 tsubst_flags_t complain
)
8930 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8931 p
= conversion_obstack_alloc (0);
8932 /* We want to discard any access checks done for this test,
8933 as we might not be in the appropriate access context and
8934 we'll do the check again when we actually perform the
8936 push_deferring_access_checks (dk_deferred
);
8938 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
8940 ok_p
= (t
&& !t
->bad_p
);
8942 /* Discard the access checks now. */
8943 pop_deferring_access_checks ();
8944 /* Free all the conversions we allocated. */
8945 obstack_free (&conversion_obstack
, p
);
8950 /* Like can_convert_arg, but allows dubious conversions as well. */
8953 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
8954 tsubst_flags_t complain
)
8959 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8960 p
= conversion_obstack_alloc (0);
8961 /* Try to perform the conversion. */
8962 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
8964 /* Free all the conversions we allocated. */
8965 obstack_free (&conversion_obstack
, p
);
8970 /* Convert EXPR to TYPE. Return the converted expression.
8972 Note that we allow bad conversions here because by the time we get to
8973 this point we are committed to doing the conversion. If we end up
8974 doing a bad conversion, convert_like will complain. */
8977 perform_implicit_conversion_flags (tree type
, tree expr
,
8978 tsubst_flags_t complain
, int flags
)
8982 location_t loc
= EXPR_LOC_OR_HERE (expr
);
8984 if (error_operand_p (expr
))
8985 return error_mark_node
;
8987 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8988 p
= conversion_obstack_alloc (0);
8990 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
8996 if (complain
& tf_error
)
8998 /* If expr has unknown type, then it is an overloaded function.
8999 Call instantiate_type to get good error messages. */
9000 if (TREE_TYPE (expr
) == unknown_type_node
)
9001 instantiate_type (type
, expr
, complain
);
9002 else if (invalid_nonstatic_memfn_p (expr
, complain
))
9003 /* We gave an error. */;
9005 error_at (loc
, "could not convert %qE from %qT to %qT", expr
,
9006 TREE_TYPE (expr
), type
);
9008 expr
= error_mark_node
;
9010 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
9012 /* In a template, we are only concerned about determining the
9013 type of non-dependent expressions, so we do not have to
9014 perform the actual conversion. But for initializers, we
9015 need to be able to perform it at instantiation
9016 (or fold_non_dependent_expr) time. */
9017 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
9018 if (!(flags
& LOOKUP_ONLYCONVERTING
))
9019 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
9022 expr
= convert_like (conv
, expr
, complain
);
9024 /* Free all the conversions we allocated. */
9025 obstack_free (&conversion_obstack
, p
);
9031 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
9033 return perform_implicit_conversion_flags (type
, expr
, complain
,
9037 /* Convert EXPR to TYPE (as a direct-initialization) if that is
9038 permitted. If the conversion is valid, the converted expression is
9039 returned. Otherwise, NULL_TREE is returned, except in the case
9040 that TYPE is a class type; in that case, an error is issued. If
9041 C_CAST_P is true, then this direct-initialization is taking
9042 place as part of a static_cast being attempted as part of a C-style
9046 perform_direct_initialization_if_possible (tree type
,
9049 tsubst_flags_t complain
)
9054 if (type
== error_mark_node
|| error_operand_p (expr
))
9055 return error_mark_node
;
9058 If the destination type is a (possibly cv-qualified) class type:
9060 -- If the initialization is direct-initialization ...,
9061 constructors are considered. ... If no constructor applies, or
9062 the overload resolution is ambiguous, the initialization is
9064 if (CLASS_TYPE_P (type
))
9066 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
9067 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
9068 &args
, type
, LOOKUP_NORMAL
, complain
);
9069 release_tree_vector (args
);
9070 return build_cplus_new (type
, expr
, complain
);
9073 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9074 p
= conversion_obstack_alloc (0);
9076 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
9078 LOOKUP_NORMAL
, complain
);
9079 if (!conv
|| conv
->bad_p
)
9082 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0, 0,
9083 /*issue_conversion_warnings=*/false,
9087 /* Free all the conversions we allocated. */
9088 obstack_free (&conversion_obstack
, p
);
9093 /* When initializing a reference that lasts longer than a full-expression,
9094 this special rule applies:
9098 The temporary to which the reference is bound or the temporary
9099 that is the complete object to which the reference is bound
9100 persists for the lifetime of the reference.
9102 The temporaries created during the evaluation of the expression
9103 initializing the reference, except the temporary to which the
9104 reference is bound, are destroyed at the end of the
9105 full-expression in which they are created.
9107 In that case, we store the converted expression into a new
9108 VAR_DECL in a new scope.
9110 However, we want to be careful not to create temporaries when
9111 they are not required. For example, given:
9114 struct D : public B {};
9118 there is no need to copy the return value from "f"; we can just
9119 extend its lifetime. Similarly, given:
9122 struct T { operator S(); };
9126 we can extend the lifetime of the return value of the conversion
9129 The next several functions are involved in this lifetime extension. */
9131 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
9132 reference is being bound to a temporary. Create and return a new
9133 VAR_DECL with the indicated TYPE; this variable will store the value to
9134 which the reference is bound. */
9137 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
9141 /* Create the variable. */
9142 var
= create_temporary_var (type
);
9144 /* Register the variable. */
9146 && (TREE_STATIC (decl
) || DECL_THREAD_LOCAL_P (decl
)))
9148 /* Namespace-scope or local static; give it a mangled name. */
9149 /* FIXME share comdat with decl? */
9152 TREE_STATIC (var
) = TREE_STATIC (decl
);
9153 DECL_TLS_MODEL (var
) = DECL_TLS_MODEL (decl
);
9154 name
= mangle_ref_init_variable (decl
);
9155 DECL_NAME (var
) = name
;
9156 SET_DECL_ASSEMBLER_NAME (var
, name
);
9157 var
= pushdecl_top_level (var
);
9160 /* Create a new cleanup level if necessary. */
9161 maybe_push_cleanup_level (type
);
9166 /* EXPR is the initializer for a variable DECL of reference or
9167 std::initializer_list type. Create, push and return a new VAR_DECL
9168 for the initializer so that it will live as long as DECL. Any
9169 cleanup for the new variable is returned through CLEANUP, and the
9170 code to initialize the new variable is returned through INITP. */
9173 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
9180 /* Create the temporary variable. */
9181 type
= TREE_TYPE (expr
);
9182 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
9183 layout_decl (var
, 0);
9184 /* If the rvalue is the result of a function call it will be
9185 a TARGET_EXPR. If it is some other construct (such as a
9186 member access expression where the underlying object is
9187 itself the result of a function call), turn it into a
9188 TARGET_EXPR here. It is important that EXPR be a
9189 TARGET_EXPR below since otherwise the INIT_EXPR will
9190 attempt to make a bitwise copy of EXPR to initialize
9192 if (TREE_CODE (expr
) != TARGET_EXPR
)
9193 expr
= get_target_expr (expr
);
9195 if (TREE_CODE (decl
) == FIELD_DECL
9196 && extra_warnings
&& !TREE_NO_WARNING (decl
))
9198 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
9199 "until the constructor exits", decl
);
9200 TREE_NO_WARNING (decl
) = true;
9203 /* Recursively extend temps in this initializer. */
9204 TARGET_EXPR_INITIAL (expr
)
9205 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
9207 /* Any reference temp has a non-trivial initializer. */
9208 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
9210 /* If the initializer is constant, put it in DECL_INITIAL so we get
9211 static initialization and use in constant expressions. */
9212 init
= maybe_constant_init (expr
);
9213 if (TREE_CONSTANT (init
))
9215 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
9217 /* 5.19 says that a constant expression can include an
9218 lvalue-rvalue conversion applied to "a glvalue of literal type
9219 that refers to a non-volatile temporary object initialized
9220 with a constant expression". Rather than try to communicate
9221 that this VAR_DECL is a temporary, just mark it constexpr.
9223 Currently this is only useful for initializer_list temporaries,
9224 since reference vars can't appear in constant expressions. */
9225 DECL_DECLARED_CONSTEXPR_P (var
) = true;
9226 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
9227 TREE_CONSTANT (var
) = true;
9229 DECL_INITIAL (var
) = init
;
9233 /* Create the INIT_EXPR that will initialize the temporary
9235 init
= build2 (INIT_EXPR
, type
, var
, expr
);
9236 if (at_function_scope_p ())
9238 add_decl_expr (var
);
9240 if (TREE_STATIC (var
))
9241 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
9244 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
9246 vec_safe_push (*cleanups
, cleanup
);
9249 /* We must be careful to destroy the temporary only
9250 after its initialization has taken place. If the
9251 initialization throws an exception, then the
9252 destructor should not be run. We cannot simply
9253 transform INIT into something like:
9255 (INIT, ({ CLEANUP_STMT; }))
9257 because emit_local_var always treats the
9258 initializer as a full-expression. Thus, the
9259 destructor would run too early; it would run at the
9260 end of initializing the reference variable, rather
9261 than at the end of the block enclosing the
9264 The solution is to pass back a cleanup expression
9265 which the caller is responsible for attaching to
9266 the statement tree. */
9270 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
9271 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
9273 if (DECL_THREAD_LOCAL_P (var
))
9274 tls_aggregates
= tree_cons (NULL_TREE
, var
,
9277 static_aggregates
= tree_cons (NULL_TREE
, var
,
9281 /* Check whether the dtor is callable. */
9282 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
9289 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
9290 initializing a variable of that TYPE. */
9293 initialize_reference (tree type
, tree expr
,
9294 int flags
, tsubst_flags_t complain
)
9298 location_t loc
= EXPR_LOC_OR_HERE (expr
);
9300 if (type
== error_mark_node
|| error_operand_p (expr
))
9301 return error_mark_node
;
9303 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9304 p
= conversion_obstack_alloc (0);
9306 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
9308 if (!conv
|| conv
->bad_p
)
9310 if (complain
& tf_error
)
9313 convert_like (conv
, expr
, complain
);
9314 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
9315 && !TYPE_REF_IS_RVALUE (type
)
9316 && !real_lvalue_p (expr
))
9317 error_at (loc
, "invalid initialization of non-const reference of "
9318 "type %qT from an rvalue of type %qT",
9319 type
, TREE_TYPE (expr
));
9321 error_at (loc
, "invalid initialization of reference of type "
9322 "%qT from expression of type %qT", type
,
9325 return error_mark_node
;
9328 if (conv
->kind
== ck_ref_bind
)
9329 /* Perform the conversion. */
9330 expr
= convert_like (conv
, expr
, complain
);
9331 else if (conv
->kind
== ck_ambig
)
9332 /* We gave an error in build_user_type_conversion_1. */
9333 expr
= error_mark_node
;
9337 /* Free all the conversions we allocated. */
9338 obstack_free (&conversion_obstack
, p
);
9343 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
9344 which is bound either to a reference or a std::initializer_list. */
9347 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
9352 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
9354 TREE_OPERAND (sub
, 1)
9355 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
9358 if (TREE_CODE (sub
) != ADDR_EXPR
)
9360 /* Deal with binding to a subobject. */
9361 for (p
= &TREE_OPERAND (sub
, 0); TREE_CODE (*p
) == COMPONENT_REF
; )
9362 p
= &TREE_OPERAND (*p
, 0);
9363 if (TREE_CODE (*p
) == TARGET_EXPR
)
9365 tree subinit
= NULL_TREE
;
9366 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
9368 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
9369 recompute_tree_invariant_for_addr_expr (sub
);
9374 /* INIT is part of the initializer for DECL. If there are any
9375 reference or initializer lists being initialized, extend their
9376 lifetime to match that of DECL. */
9379 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
9381 tree type
= TREE_TYPE (init
);
9382 if (processing_template_decl
)
9384 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9385 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
9386 else if (is_std_init_list (type
))
9388 /* The temporary array underlying a std::initializer_list
9389 is handled like a reference temporary. */
9391 if (TREE_CODE (ctor
) == TARGET_EXPR
)
9392 ctor
= TARGET_EXPR_INITIAL (ctor
);
9393 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
9395 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
9396 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
9397 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
9400 else if (TREE_CODE (init
) == CONSTRUCTOR
)
9404 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (init
);
9405 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
9406 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
9412 /* Returns true iff an initializer for TYPE could contain temporaries that
9413 need to be extended because they are bound to references or
9414 std::initializer_list. */
9417 type_has_extended_temps (tree type
)
9419 type
= strip_array_types (type
);
9420 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9422 if (CLASS_TYPE_P (type
))
9424 if (is_std_init_list (type
))
9426 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
9427 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
9428 if (type_has_extended_temps (TREE_TYPE (f
)))
9434 /* Returns true iff TYPE is some variant of std::initializer_list. */
9437 is_std_init_list (tree type
)
9439 /* Look through typedefs. */
9442 if (cxx_dialect
== cxx98
)
9444 type
= TYPE_MAIN_VARIANT (type
);
9445 return (CLASS_TYPE_P (type
)
9446 && CP_TYPE_CONTEXT (type
) == std_node
9447 && strcmp (TYPE_NAME_STRING (type
), "initializer_list") == 0);
9450 /* Returns true iff DECL is a list constructor: i.e. a constructor which
9451 will accept an argument list of a single std::initializer_list<T>. */
9454 is_list_ctor (tree decl
)
9456 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
9459 if (!args
|| args
== void_list_node
)
9462 arg
= non_reference (TREE_VALUE (args
));
9463 if (!is_std_init_list (arg
))
9466 args
= TREE_CHAIN (args
);
9468 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
9469 /* There are more non-defaulted parms. */
9475 #include "gt-cp-call.h"