1 /* Functions related to invoking methods and overloaded functions.
2 Copyright (C) 1987-2015 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"
32 #include "stor-layout.h"
33 #include "trans-mem.h"
34 #include "stringpool.h"
38 #include "diagnostic-core.h"
42 #include "langhooks.h"
43 #include "c-family/c-objc.h"
45 #include "plugin-api.h"
46 #include "hard-reg-set.h"
50 #include "internal-fn.h"
52 /* The various kinds of conversion. */
54 typedef enum conversion_kind
{
70 /* The rank of the conversion. Order of the enumerals matters; better
71 conversions should come earlier in the list. */
73 typedef enum conversion_rank
{
84 /* An implicit conversion sequence, in the sense of [over.best.ics].
85 The first conversion to be performed is at the end of the chain.
86 That conversion is always a cr_identity conversion. */
88 typedef struct conversion conversion
;
90 /* The kind of conversion represented by this step. */
92 /* The rank of this conversion. */
94 BOOL_BITFIELD user_conv_p
: 1;
95 BOOL_BITFIELD ellipsis_p
: 1;
96 BOOL_BITFIELD this_p
: 1;
97 /* True if this conversion would be permitted with a bending of
98 language standards, e.g. disregarding pointer qualifiers or
99 converting integers to pointers. */
100 BOOL_BITFIELD bad_p
: 1;
101 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
102 temporary should be created to hold the result of the
104 BOOL_BITFIELD need_temporary_p
: 1;
105 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
106 from a pointer-to-derived to pointer-to-base is being performed. */
107 BOOL_BITFIELD base_p
: 1;
108 /* If KIND is ck_ref_bind, true when either an lvalue reference is
109 being bound to an lvalue expression or an rvalue reference is
110 being bound to an rvalue expression. If KIND is ck_rvalue,
111 true when we should treat an lvalue as an rvalue (12.8p33). If
112 KIND is ck_base, always false. */
113 BOOL_BITFIELD rvaluedness_matches_p
: 1;
114 BOOL_BITFIELD check_narrowing
: 1;
115 /* The type of the expression resulting from the conversion. */
118 /* The next conversion in the chain. Since the conversions are
119 arranged from outermost to innermost, the NEXT conversion will
120 actually be performed before this conversion. This variant is
121 used only when KIND is neither ck_identity, ck_ambig nor
122 ck_list. Please use the next_conversion function instead
123 of using this field directly. */
125 /* The expression at the beginning of the conversion chain. This
126 variant is used only if KIND is ck_identity or ck_ambig. */
128 /* The array of conversions for an initializer_list, so this
129 variant is used only when KIN D is ck_list. */
132 /* The function candidate corresponding to this conversion
133 sequence. This field is only used if KIND is ck_user. */
134 struct z_candidate
*cand
;
137 #define CONVERSION_RANK(NODE) \
138 ((NODE)->bad_p ? cr_bad \
139 : (NODE)->ellipsis_p ? cr_ellipsis \
140 : (NODE)->user_conv_p ? cr_user \
143 #define BAD_CONVERSION_RANK(NODE) \
144 ((NODE)->ellipsis_p ? cr_ellipsis \
145 : (NODE)->user_conv_p ? cr_user \
148 static struct obstack conversion_obstack
;
149 static bool conversion_obstack_initialized
;
150 struct rejection_reason
;
152 static struct z_candidate
* tourney (struct z_candidate
*, tsubst_flags_t
);
153 static int equal_functions (tree
, tree
);
154 static int joust (struct z_candidate
*, struct z_candidate
*, bool,
156 static int compare_ics (conversion
*, conversion
*);
157 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
158 static tree
build_java_interface_fn_ref (tree
, tree
);
159 #define convert_like(CONV, EXPR, COMPLAIN) \
160 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
161 /*issue_conversion_warnings=*/true, \
162 /*c_cast_p=*/false, (COMPLAIN))
163 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
164 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
165 /*issue_conversion_warnings=*/true, \
166 /*c_cast_p=*/false, (COMPLAIN))
167 static tree
convert_like_real (conversion
*, tree
, tree
, int, int, bool,
168 bool, tsubst_flags_t
);
169 static void op_error (location_t
, enum tree_code
, enum tree_code
, tree
,
171 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int,
173 static void print_z_candidate (location_t
, const char *, struct z_candidate
*);
174 static void print_z_candidates (location_t
, struct z_candidate
*);
175 static tree
build_this (tree
);
176 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
177 static bool any_strictly_viable (struct z_candidate
*);
178 static struct z_candidate
*add_template_candidate
179 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
180 tree
, tree
, tree
, int, unification_kind_t
, tsubst_flags_t
);
181 static struct z_candidate
*add_template_candidate_real
182 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
183 tree
, tree
, tree
, int, tree
, unification_kind_t
, tsubst_flags_t
);
184 static struct z_candidate
*add_template_conv_candidate
185 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
186 tree
, tree
, tree
, tsubst_flags_t
);
187 static void add_builtin_candidates
188 (struct z_candidate
**, enum tree_code
, enum tree_code
,
189 tree
, tree
*, int, tsubst_flags_t
);
190 static void add_builtin_candidate
191 (struct z_candidate
**, enum tree_code
, enum tree_code
,
192 tree
, tree
, tree
, tree
*, tree
*, int, tsubst_flags_t
);
193 static bool is_complete (tree
);
194 static void build_builtin_candidate
195 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
196 int, tsubst_flags_t
);
197 static struct z_candidate
*add_conv_candidate
198 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
199 tree
, tsubst_flags_t
);
200 static struct z_candidate
*add_function_candidate
201 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
202 tree
, int, tsubst_flags_t
);
203 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int,
205 static conversion
*standard_conversion (tree
, tree
, tree
, bool, int);
206 static conversion
*reference_binding (tree
, tree
, tree
, bool, int,
208 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
209 static conversion
*build_list_conv (tree
, tree
, int, tsubst_flags_t
);
210 static conversion
*next_conversion (conversion
*);
211 static bool is_subseq (conversion
*, conversion
*);
212 static conversion
*maybe_handle_ref_bind (conversion
**);
213 static void maybe_handle_implicit_object (conversion
**);
214 static struct z_candidate
*add_candidate
215 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, size_t,
216 conversion
**, tree
, tree
, int, struct rejection_reason
*, int);
217 static tree
source_type (conversion
*);
218 static void add_warning (struct z_candidate
*, struct z_candidate
*);
219 static bool reference_compatible_p (tree
, tree
);
220 static conversion
*direct_reference_binding (tree
, conversion
*);
221 static bool promoted_arithmetic_type_p (tree
);
222 static conversion
*conditional_conversion (tree
, tree
, tsubst_flags_t
);
223 static char *name_as_c_string (tree
, tree
, bool *);
224 static tree
prep_operand (tree
);
225 static void add_candidates (tree
, tree
, const vec
<tree
, va_gc
> *, tree
, tree
,
226 bool, tree
, tree
, int, struct z_candidate
**,
228 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
229 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
231 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
232 NAME can take many forms... */
235 check_dtor_name (tree basetype
, tree name
)
237 /* Just accept something we've already complained about. */
238 if (name
== error_mark_node
)
241 if (TREE_CODE (name
) == TYPE_DECL
)
242 name
= TREE_TYPE (name
);
243 else if (TYPE_P (name
))
245 else if (identifier_p (name
))
247 if ((MAYBE_CLASS_TYPE_P (basetype
)
248 && name
== constructor_name (basetype
))
249 || (TREE_CODE (basetype
) == ENUMERAL_TYPE
250 && name
== TYPE_IDENTIFIER (basetype
)))
253 name
= get_type_value (name
);
259 template <class T> struct S { ~S(); };
263 NAME will be a class template. */
264 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
268 if (!name
|| name
== error_mark_node
)
270 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
273 /* We want the address of a function or method. We avoid creating a
274 pointer-to-member function. */
277 build_addr_func (tree function
, tsubst_flags_t complain
)
279 tree type
= TREE_TYPE (function
);
281 /* We have to do these by hand to avoid real pointer to member
283 if (TREE_CODE (type
) == METHOD_TYPE
)
285 if (TREE_CODE (function
) == OFFSET_REF
)
287 tree object
= build_address (TREE_OPERAND (function
, 0));
288 return get_member_function_from_ptrfunc (&object
,
289 TREE_OPERAND (function
, 1),
292 function
= build_address (function
);
295 function
= decay_conversion (function
, complain
);
300 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
301 POINTER_TYPE to those. Note, pointer to member function types
302 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
303 two variants. build_call_a is the primitive taking an array of
304 arguments, while build_call_n is a wrapper that handles varargs. */
307 build_call_n (tree function
, int n
, ...)
310 return build_call_a (function
, 0, NULL
);
313 tree
*argarray
= XALLOCAVEC (tree
, n
);
318 for (i
= 0; i
< n
; i
++)
319 argarray
[i
] = va_arg (ap
, tree
);
321 return build_call_a (function
, n
, argarray
);
325 /* Update various flags in cfun and the call itself based on what is being
326 called. Split out of build_call_a so that bot_manip can use it too. */
329 set_flags_from_callee (tree call
)
332 tree decl
= get_callee_fndecl (call
);
334 /* We check both the decl and the type; a function may be known not to
335 throw without being declared throw(). */
336 nothrow
= decl
&& TREE_NOTHROW (decl
);
337 if (CALL_EXPR_FN (call
))
338 nothrow
|= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call
))));
339 else if (internal_fn_flags (CALL_EXPR_IFN (call
)) & ECF_NOTHROW
)
342 if (!nothrow
&& at_function_scope_p () && cfun
&& cp_function_chain
)
343 cp_function_chain
->can_throw
= 1;
345 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
346 current_function_returns_abnormally
= 1;
348 TREE_NOTHROW (call
) = nothrow
;
352 build_call_a (tree function
, int n
, tree
*argarray
)
359 function
= build_addr_func (function
, tf_warning_or_error
);
361 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
362 fntype
= TREE_TYPE (TREE_TYPE (function
));
363 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
364 || TREE_CODE (fntype
) == METHOD_TYPE
);
365 result_type
= TREE_TYPE (fntype
);
366 /* An rvalue has no cv-qualifiers. */
367 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
368 result_type
= cv_unqualified (result_type
);
370 function
= build_call_array_loc (input_location
,
371 result_type
, function
, n
, argarray
);
372 set_flags_from_callee (function
);
374 decl
= get_callee_fndecl (function
);
376 if (decl
&& !TREE_USED (decl
))
378 /* We invoke build_call directly for several library
379 functions. These may have been declared normally if
380 we're building libgcc, so we can't just check
382 gcc_assert (DECL_ARTIFICIAL (decl
)
383 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
388 require_complete_eh_spec_types (fntype
, decl
);
390 TREE_HAS_CONSTRUCTOR (function
) = (decl
&& DECL_CONSTRUCTOR_P (decl
));
392 /* Don't pass empty class objects by value. This is useful
393 for tags in STL, which are used to control overload resolution.
394 We don't need to handle other cases of copying empty classes. */
395 if (! decl
|| ! DECL_BUILT_IN (decl
))
396 for (i
= 0; i
< n
; i
++)
398 tree arg
= CALL_EXPR_ARG (function
, i
);
399 if (is_empty_class (TREE_TYPE (arg
))
400 && ! TREE_ADDRESSABLE (TREE_TYPE (arg
)))
402 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (arg
));
403 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (t
), arg
, t
);
404 CALL_EXPR_ARG (function
, i
) = arg
;
411 /* New overloading code. */
413 typedef struct z_candidate z_candidate
;
415 typedef struct candidate_warning candidate_warning
;
416 struct candidate_warning
{
418 candidate_warning
*next
;
421 /* Information for providing diagnostics about why overloading failed. */
423 enum rejection_reason_code
{
426 rr_explicit_conversion
,
427 rr_template_conversion
,
429 rr_bad_arg_conversion
,
430 rr_template_unification
,
434 struct conversion_info
{
435 /* The index of the argument, 0-based. */
437 /* The actual argument or its type. */
439 /* The type of the parameter. */
443 struct rejection_reason
{
444 enum rejection_reason_code code
;
446 /* Information about an arity mismatch. */
448 /* The expected number of arguments. */
450 /* The actual number of arguments in the call. */
452 /* Whether the call was a varargs call. */
455 /* Information about an argument conversion mismatch. */
456 struct conversion_info conversion
;
457 /* Same, but for bad argument conversions. */
458 struct conversion_info bad_conversion
;
459 /* Information about template unification failures. These are the
460 parameters passed to fn_type_unification. */
468 unification_kind_t strict
;
470 } template_unification
;
471 /* Information about template instantiation failures. These are the
472 parameters passed to instantiate_template. */
476 } template_instantiation
;
481 /* The FUNCTION_DECL that will be called if this candidate is
482 selected by overload resolution. */
484 /* If not NULL_TREE, the first argument to use when calling this
487 /* The rest of the arguments to use when calling this function. If
488 there are no further arguments this may be NULL or it may be an
490 const vec
<tree
, va_gc
> *args
;
491 /* The implicit conversion sequences for each of the arguments to
494 /* The number of implicit conversion sequences. */
496 /* If FN is a user-defined conversion, the standard conversion
497 sequence from the type returned by FN to the desired destination
499 conversion
*second_conv
;
500 struct rejection_reason
*reason
;
501 /* If FN is a member function, the binfo indicating the path used to
502 qualify the name of FN at the call site. This path is used to
503 determine whether or not FN is accessible if it is selected by
504 overload resolution. The DECL_CONTEXT of FN will always be a
505 (possibly improper) base of this binfo. */
507 /* If FN is a non-static member function, the binfo indicating the
508 subobject to which the `this' pointer should be converted if FN
509 is selected by overload resolution. The type pointed to by
510 the `this' pointer must correspond to the most derived class
511 indicated by the CONVERSION_PATH. */
512 tree conversion_path
;
515 candidate_warning
*warnings
;
519 /* The flags active in add_candidate. */
523 /* Returns true iff T is a null pointer constant in the sense of
527 null_ptr_cst_p (tree t
)
531 A null pointer constant is an integral constant expression
532 (_expr.const_) rvalue of integer type that evaluates to zero or
533 an rvalue of type std::nullptr_t. */
534 if (NULLPTR_TYPE_P (TREE_TYPE (t
)))
536 if (CP_INTEGRAL_TYPE_P (TREE_TYPE (t
)))
538 /* Core issue 903 says only literal 0 is a null pointer constant. */
539 if (cxx_dialect
< cxx11
)
540 t
= fold_non_dependent_expr (t
);
542 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
548 /* Returns true iff T is a null member pointer value (4.11). */
551 null_member_pointer_value_p (tree t
)
553 tree type
= TREE_TYPE (t
);
556 else if (TYPE_PTRMEMFUNC_P (type
))
557 return (TREE_CODE (t
) == CONSTRUCTOR
558 && integer_zerop (CONSTRUCTOR_ELT (t
, 0)->value
));
559 else if (TYPE_PTRDATAMEM_P (type
))
560 return integer_all_onesp (t
);
565 /* Returns nonzero if PARMLIST consists of only default parms,
566 ellipsis, and/or undeduced parameter packs. */
569 sufficient_parms_p (const_tree parmlist
)
571 for (; parmlist
&& parmlist
!= void_list_node
;
572 parmlist
= TREE_CHAIN (parmlist
))
573 if (!TREE_PURPOSE (parmlist
)
574 && !PACK_EXPANSION_P (TREE_VALUE (parmlist
)))
579 /* Allocate N bytes of memory from the conversion obstack. The memory
580 is zeroed before being returned. */
583 conversion_obstack_alloc (size_t n
)
586 if (!conversion_obstack_initialized
)
588 gcc_obstack_init (&conversion_obstack
);
589 conversion_obstack_initialized
= true;
591 p
= obstack_alloc (&conversion_obstack
, n
);
596 /* Allocate rejection reasons. */
598 static struct rejection_reason
*
599 alloc_rejection (enum rejection_reason_code code
)
601 struct rejection_reason
*p
;
602 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
607 static struct rejection_reason
*
608 arity_rejection (tree first_arg
, int expected
, int actual
)
610 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
611 int adjust
= first_arg
!= NULL_TREE
;
612 r
->u
.arity
.expected
= expected
- adjust
;
613 r
->u
.arity
.actual
= actual
- adjust
;
617 static struct rejection_reason
*
618 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
620 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
621 int adjust
= first_arg
!= NULL_TREE
;
622 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
623 r
->u
.conversion
.from
= from
;
624 r
->u
.conversion
.to_type
= to
;
628 static struct rejection_reason
*
629 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
631 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
632 int adjust
= first_arg
!= NULL_TREE
;
633 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
634 r
->u
.bad_conversion
.from
= from
;
635 r
->u
.bad_conversion
.to_type
= to
;
639 static struct rejection_reason
*
640 explicit_conversion_rejection (tree from
, tree to
)
642 struct rejection_reason
*r
= alloc_rejection (rr_explicit_conversion
);
643 r
->u
.conversion
.n_arg
= 0;
644 r
->u
.conversion
.from
= from
;
645 r
->u
.conversion
.to_type
= to
;
649 static struct rejection_reason
*
650 template_conversion_rejection (tree from
, tree to
)
652 struct rejection_reason
*r
= alloc_rejection (rr_template_conversion
);
653 r
->u
.conversion
.n_arg
= 0;
654 r
->u
.conversion
.from
= from
;
655 r
->u
.conversion
.to_type
= to
;
659 static struct rejection_reason
*
660 template_unification_rejection (tree tmpl
, tree explicit_targs
, tree targs
,
661 const tree
*args
, unsigned int nargs
,
662 tree return_type
, unification_kind_t strict
,
665 size_t args_n_bytes
= sizeof (*args
) * nargs
;
666 tree
*args1
= (tree
*) conversion_obstack_alloc (args_n_bytes
);
667 struct rejection_reason
*r
= alloc_rejection (rr_template_unification
);
668 r
->u
.template_unification
.tmpl
= tmpl
;
669 r
->u
.template_unification
.explicit_targs
= explicit_targs
;
670 r
->u
.template_unification
.num_targs
= TREE_VEC_LENGTH (targs
);
671 /* Copy args to our own storage. */
672 memcpy (args1
, args
, args_n_bytes
);
673 r
->u
.template_unification
.args
= args1
;
674 r
->u
.template_unification
.nargs
= nargs
;
675 r
->u
.template_unification
.return_type
= return_type
;
676 r
->u
.template_unification
.strict
= strict
;
677 r
->u
.template_unification
.flags
= flags
;
681 static struct rejection_reason
*
682 template_unification_error_rejection (void)
684 return alloc_rejection (rr_template_unification
);
687 static struct rejection_reason
*
688 invalid_copy_with_fn_template_rejection (void)
690 struct rejection_reason
*r
= alloc_rejection (rr_invalid_copy
);
694 /* Dynamically allocate a conversion. */
697 alloc_conversion (conversion_kind kind
)
700 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
705 #ifdef ENABLE_CHECKING
707 /* Make sure that all memory on the conversion obstack has been
711 validate_conversion_obstack (void)
713 if (conversion_obstack_initialized
)
714 gcc_assert ((obstack_next_free (&conversion_obstack
)
715 == obstack_base (&conversion_obstack
)));
718 #endif /* ENABLE_CHECKING */
720 /* Dynamically allocate an array of N conversions. */
723 alloc_conversions (size_t n
)
725 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
729 build_conv (conversion_kind code
, tree type
, conversion
*from
)
732 conversion_rank rank
= CONVERSION_RANK (from
);
734 /* Note that the caller is responsible for filling in t->cand for
735 user-defined conversions. */
736 t
= alloc_conversion (code
);
759 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
760 t
->bad_p
= from
->bad_p
;
765 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
766 specialization of std::initializer_list<T>, if such a conversion is
770 build_list_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
772 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
773 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
774 conversion
**subconvs
= alloc_conversions (len
);
779 /* Within a list-initialization we can have more user-defined
781 flags
&= ~LOOKUP_NO_CONVERSION
;
782 /* But no narrowing conversions. */
783 flags
|= LOOKUP_NO_NARROWING
;
785 /* Can't make an array of these types. */
786 if (TREE_CODE (elttype
) == REFERENCE_TYPE
787 || TREE_CODE (elttype
) == FUNCTION_TYPE
788 || VOID_TYPE_P (elttype
))
791 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
794 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
795 false, flags
, complain
);
802 t
= alloc_conversion (ck_list
);
804 t
->u
.list
= subconvs
;
807 for (i
= 0; i
< len
; ++i
)
809 conversion
*sub
= subconvs
[i
];
810 if (sub
->rank
> t
->rank
)
812 if (sub
->user_conv_p
)
813 t
->user_conv_p
= true;
821 /* Return the next conversion of the conversion chain (if applicable),
822 or NULL otherwise. Please use this function instead of directly
823 accessing fields of struct conversion. */
826 next_conversion (conversion
*conv
)
829 || conv
->kind
== ck_identity
830 || conv
->kind
== ck_ambig
831 || conv
->kind
== ck_list
)
836 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
837 is a valid aggregate initializer for array type ATYPE. */
840 can_convert_array (tree atype
, tree ctor
, int flags
, tsubst_flags_t complain
)
843 tree elttype
= TREE_TYPE (atype
);
844 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
846 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
848 if (TREE_CODE (elttype
) == ARRAY_TYPE
849 && TREE_CODE (val
) == CONSTRUCTOR
)
850 ok
= can_convert_array (elttype
, val
, flags
, complain
);
852 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
,
860 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
861 aggregate class, if such a conversion is possible. */
864 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
866 unsigned HOST_WIDE_INT i
= 0;
868 tree field
= next_initializable_field (TYPE_FIELDS (type
));
869 tree empty_ctor
= NULL_TREE
;
871 /* We already called reshape_init in implicit_conversion. */
873 /* The conversions within the init-list aren't affected by the enclosing
874 context; they're always simple copy-initialization. */
875 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
877 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
879 tree ftype
= TREE_TYPE (field
);
883 if (i
< CONSTRUCTOR_NELTS (ctor
))
884 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
885 else if (TREE_CODE (ftype
) == REFERENCE_TYPE
)
886 /* Value-initialization of reference is ill-formed. */
890 if (empty_ctor
== NULL_TREE
)
891 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
896 if (TREE_CODE (ftype
) == ARRAY_TYPE
897 && TREE_CODE (val
) == CONSTRUCTOR
)
898 ok
= can_convert_array (ftype
, val
, flags
, complain
);
900 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
906 if (TREE_CODE (type
) == UNION_TYPE
)
910 if (i
< CONSTRUCTOR_NELTS (ctor
))
913 c
= alloc_conversion (ck_aggr
);
916 c
->user_conv_p
= true;
917 c
->check_narrowing
= true;
922 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
923 array type, if such a conversion is possible. */
926 build_array_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
929 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
930 tree elttype
= TREE_TYPE (type
);
935 enum conversion_rank rank
= cr_exact
;
937 /* We might need to propagate the size from the element to the array. */
938 complete_type (type
);
940 if (TYPE_DOMAIN (type
)
941 && !variably_modified_type_p (TYPE_DOMAIN (type
), NULL_TREE
))
943 unsigned HOST_WIDE_INT alen
= tree_to_uhwi (array_type_nelts_top (type
));
948 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
950 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
953 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
954 false, flags
, complain
);
958 if (sub
->rank
> rank
)
960 if (sub
->user_conv_p
)
966 c
= alloc_conversion (ck_aggr
);
969 c
->user_conv_p
= user
;
975 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
976 complex type, if such a conversion is possible. */
979 build_complex_conv (tree type
, tree ctor
, int flags
,
980 tsubst_flags_t complain
)
983 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
984 tree elttype
= TREE_TYPE (type
);
989 enum conversion_rank rank
= cr_exact
;
994 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
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 (expr
&& type_unknown_p (expr
))
1086 if (TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1088 tsubst_flags_t tflags
= tf_conv
;
1089 expr
= instantiate_type (to
, expr
, tflags
);
1090 if (expr
== error_mark_node
)
1092 from
= TREE_TYPE (expr
);
1094 else if (TREE_CODE (to
) == BOOLEAN_TYPE
)
1096 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1097 expr
= resolve_nondeduced_context (expr
);
1098 from
= TREE_TYPE (expr
);
1102 fcode
= TREE_CODE (from
);
1103 tcode
= TREE_CODE (to
);
1105 conv
= build_identity_conv (from
, expr
);
1106 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1108 from
= type_decays_to (from
);
1109 fcode
= TREE_CODE (from
);
1110 conv
= build_conv (ck_lvalue
, from
, conv
);
1112 else if (fromref
|| (expr
&& lvalue_p (expr
)))
1117 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1120 from
= strip_top_quals (bitfield_type
);
1121 fcode
= TREE_CODE (from
);
1124 conv
= build_conv (ck_rvalue
, from
, conv
);
1125 if (flags
& LOOKUP_PREFER_RVALUE
)
1126 conv
->rvaluedness_matches_p
= true;
1129 /* Allow conversion between `__complex__' data types. */
1130 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1132 /* The standard conversion sequence to convert FROM to TO is
1133 the standard conversion sequence to perform componentwise
1135 conversion
*part_conv
= standard_conversion
1136 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
);
1140 conv
= build_conv (part_conv
->kind
, to
, conv
);
1141 conv
->rank
= part_conv
->rank
;
1149 if (same_type_p (from
, to
))
1151 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1152 conv
->type
= qualified_to
;
1157 A null pointer constant can be converted to a pointer type; ... A
1158 null pointer constant of integral type can be converted to an
1159 rvalue of type std::nullptr_t. */
1160 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1161 || NULLPTR_TYPE_P (to
))
1162 && ((expr
&& null_ptr_cst_p (expr
))
1163 || NULLPTR_TYPE_P (from
)))
1164 conv
= build_conv (ck_std
, to
, conv
);
1165 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1166 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1168 /* For backwards brain damage compatibility, allow interconversion of
1169 pointers and integers with a pedwarn. */
1170 conv
= build_conv (ck_std
, to
, conv
);
1173 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1175 /* For backwards brain damage compatibility, allow interconversion of
1176 enums and integers with a pedwarn. */
1177 conv
= build_conv (ck_std
, to
, conv
);
1180 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1181 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1186 if (tcode
== POINTER_TYPE
1187 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from
),
1190 else if (VOID_TYPE_P (TREE_TYPE (to
))
1191 && !TYPE_PTRDATAMEM_P (from
)
1192 && TREE_CODE (TREE_TYPE (from
)) != FUNCTION_TYPE
)
1194 tree nfrom
= TREE_TYPE (from
);
1195 /* Don't try to apply restrict to void. */
1196 int quals
= cp_type_quals (nfrom
) & ~TYPE_QUAL_RESTRICT
;
1197 from
= build_pointer_type
1198 (cp_build_qualified_type (void_type_node
, quals
));
1199 conv
= build_conv (ck_ptr
, from
, conv
);
1201 else if (TYPE_PTRDATAMEM_P (from
))
1203 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1204 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1206 if (DERIVED_FROM_P (fbase
, tbase
)
1207 && (same_type_ignoring_top_level_qualifiers_p
1208 (TYPE_PTRMEM_POINTED_TO_TYPE (from
),
1209 TYPE_PTRMEM_POINTED_TO_TYPE (to
))))
1211 from
= build_ptrmem_type (tbase
,
1212 TYPE_PTRMEM_POINTED_TO_TYPE (from
));
1213 conv
= build_conv (ck_pmem
, from
, conv
);
1215 else if (!same_type_p (fbase
, tbase
))
1218 else if (CLASS_TYPE_P (TREE_TYPE (from
))
1219 && CLASS_TYPE_P (TREE_TYPE (to
))
1222 An rvalue of type "pointer to cv D," where D is a
1223 class type, can be converted to an rvalue of type
1224 "pointer to cv B," where B is a base class (clause
1225 _class.derived_) of D. If B is an inaccessible
1226 (clause _class.access_) or ambiguous
1227 (_class.member.lookup_) base class of D, a program
1228 that necessitates this conversion is ill-formed.
1229 Therefore, we use DERIVED_FROM_P, and do not check
1230 access or uniqueness. */
1231 && DERIVED_FROM_P (TREE_TYPE (to
), TREE_TYPE (from
)))
1234 cp_build_qualified_type (TREE_TYPE (to
),
1235 cp_type_quals (TREE_TYPE (from
)));
1236 from
= build_pointer_type (from
);
1237 conv
= build_conv (ck_ptr
, from
, conv
);
1238 conv
->base_p
= true;
1241 if (tcode
== POINTER_TYPE
)
1243 to_pointee
= TREE_TYPE (to
);
1244 from_pointee
= TREE_TYPE (from
);
1248 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1249 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1252 if (same_type_p (from
, to
))
1254 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
1255 /* In a C-style cast, we ignore CV-qualification because we
1256 are allowed to perform a static_cast followed by a
1258 conv
= build_conv (ck_qual
, to
, conv
);
1259 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1260 conv
= build_conv (ck_qual
, to
, conv
);
1261 else if (expr
&& string_conv_p (to
, expr
, 0))
1262 /* converting from string constant to char *. */
1263 conv
= build_conv (ck_qual
, to
, conv
);
1264 /* Allow conversions among compatible ObjC pointer types (base
1265 conversions have been already handled above). */
1266 else if (c_dialect_objc ()
1267 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1268 conv
= build_conv (ck_ptr
, to
, conv
);
1269 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1271 conv
= build_conv (ck_ptr
, to
, conv
);
1279 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1281 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1282 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1283 tree fbase
= class_of_this_parm (fromfn
);
1284 tree tbase
= class_of_this_parm (tofn
);
1286 if (!DERIVED_FROM_P (fbase
, tbase
)
1287 || !same_type_p (static_fn_type (fromfn
),
1288 static_fn_type (tofn
)))
1291 from
= build_memfn_type (fromfn
,
1293 cp_type_quals (tbase
),
1294 type_memfn_rqual (tofn
));
1295 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1296 conv
= build_conv (ck_pmem
, from
, conv
);
1297 conv
->base_p
= true;
1299 else if (tcode
== BOOLEAN_TYPE
)
1303 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1304 to member type can be converted to a prvalue of type bool. ...
1305 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1306 std::nullptr_t can be converted to a prvalue of type bool; */
1307 if (ARITHMETIC_TYPE_P (from
)
1308 || UNSCOPED_ENUM_P (from
)
1309 || fcode
== POINTER_TYPE
1310 || TYPE_PTRMEM_P (from
)
1311 || NULLPTR_TYPE_P (from
))
1313 conv
= build_conv (ck_std
, to
, conv
);
1314 if (fcode
== POINTER_TYPE
1315 || TYPE_PTRDATAMEM_P (from
)
1316 || (TYPE_PTRMEMFUNC_P (from
)
1317 && conv
->rank
< cr_pbool
)
1318 || NULLPTR_TYPE_P (from
))
1319 conv
->rank
= cr_pbool
;
1320 if (NULLPTR_TYPE_P (from
) && (flags
& LOOKUP_ONLYCONVERTING
))
1327 /* We don't check for ENUMERAL_TYPE here because there are no standard
1328 conversions to enum type. */
1329 /* As an extension, allow conversion to complex type. */
1330 else if (ARITHMETIC_TYPE_P (to
))
1332 if (! (INTEGRAL_CODE_P (fcode
)
1333 || (fcode
== REAL_TYPE
&& !(flags
& LOOKUP_NO_NON_INTEGRAL
)))
1334 || SCOPED_ENUM_P (from
))
1336 conv
= build_conv (ck_std
, to
, conv
);
1338 /* Give this a better rank if it's a promotion. */
1339 if (same_type_p (to
, type_promotes_to (from
))
1340 && next_conversion (conv
)->rank
<= cr_promotion
)
1341 conv
->rank
= cr_promotion
;
1343 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1344 && vector_types_convertible_p (from
, to
, false))
1345 return build_conv (ck_std
, to
, conv
);
1346 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1347 && is_properly_derived_from (from
, to
))
1349 if (conv
->kind
== ck_rvalue
)
1350 conv
= next_conversion (conv
);
1351 conv
= build_conv (ck_base
, to
, conv
);
1352 /* The derived-to-base conversion indicates the initialization
1353 of a parameter with base type from an object of a derived
1354 type. A temporary object is created to hold the result of
1355 the conversion unless we're binding directly to a reference. */
1356 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1361 if (flags
& LOOKUP_NO_NARROWING
)
1362 conv
->check_narrowing
= true;
1367 /* Returns nonzero if T1 is reference-related to T2. */
1370 reference_related_p (tree t1
, tree t2
)
1372 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1375 t1
= TYPE_MAIN_VARIANT (t1
);
1376 t2
= TYPE_MAIN_VARIANT (t2
);
1380 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1381 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1383 return (same_type_p (t1
, t2
)
1384 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1385 && DERIVED_FROM_P (t1
, t2
)));
1388 /* Returns nonzero if T1 is reference-compatible with T2. */
1391 reference_compatible_p (tree t1
, tree t2
)
1395 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
1396 reference-related to T2 and cv1 is the same cv-qualification as,
1397 or greater cv-qualification than, cv2. */
1398 return (reference_related_p (t1
, t2
)
1399 && at_least_as_qualified_p (t1
, t2
));
1402 /* A reference of the indicated TYPE is being bound directly to the
1403 expression represented by the implicit conversion sequence CONV.
1404 Return a conversion sequence for this binding. */
1407 direct_reference_binding (tree type
, conversion
*conv
)
1411 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
1412 gcc_assert (TREE_CODE (conv
->type
) != REFERENCE_TYPE
);
1414 t
= TREE_TYPE (type
);
1418 When a parameter of reference type binds directly
1419 (_dcl.init.ref_) to an argument expression, the implicit
1420 conversion sequence is the identity conversion, unless the
1421 argument expression has a type that is a derived class of the
1422 parameter type, in which case the implicit conversion sequence is
1423 a derived-to-base Conversion.
1425 If the parameter binds directly to the result of applying a
1426 conversion function to the argument expression, the implicit
1427 conversion sequence is a user-defined conversion sequence
1428 (_over.ics.user_), with the second standard conversion sequence
1429 either an identity conversion or, if the conversion function
1430 returns an entity of a type that is a derived class of the
1431 parameter type, a derived-to-base conversion. */
1432 if (!same_type_ignoring_top_level_qualifiers_p (t
, conv
->type
))
1434 /* Represent the derived-to-base conversion. */
1435 conv
= build_conv (ck_base
, t
, conv
);
1436 /* We will actually be binding to the base-class subobject in
1437 the derived class, so we mark this conversion appropriately.
1438 That way, convert_like knows not to generate a temporary. */
1439 conv
->need_temporary_p
= false;
1441 return build_conv (ck_ref_bind
, type
, conv
);
1444 /* Returns the conversion path from type FROM to reference type TO for
1445 purposes of reference binding. For lvalue binding, either pass a
1446 reference type to FROM or an lvalue expression to EXPR. If the
1447 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1448 the conversion returned. If C_CAST_P is true, this
1449 conversion is coming from a C-style cast. */
1452 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1453 tsubst_flags_t complain
)
1455 conversion
*conv
= NULL
;
1456 tree to
= TREE_TYPE (rto
);
1461 cp_lvalue_kind gl_kind
;
1464 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1466 expr
= instantiate_type (to
, expr
, tf_none
);
1467 if (expr
== error_mark_node
)
1469 from
= TREE_TYPE (expr
);
1472 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1474 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1475 /* DR 1288: Otherwise, if the initializer list has a single element
1476 of type E and ... [T's] referenced type is reference-related to E,
1477 the object or reference is initialized from that element... */
1478 if (CONSTRUCTOR_NELTS (expr
) == 1)
1480 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1481 if (error_operand_p (elt
))
1483 tree etype
= TREE_TYPE (elt
);
1484 if (reference_related_p (to
, etype
))
1491 /* Otherwise, if T is a reference type, a prvalue temporary of the
1492 type referenced by T is copy-list-initialized or
1493 direct-list-initialized, depending on the kind of initialization
1494 for the reference, and the reference is bound to that temporary. */
1495 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1496 flags
|LOOKUP_NO_TEMP_BIND
, complain
);
1500 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1502 from
= TREE_TYPE (from
);
1503 if (!TYPE_REF_IS_RVALUE (rfrom
)
1504 || TREE_CODE (from
) == FUNCTION_TYPE
)
1505 gl_kind
= clk_ordinary
;
1507 gl_kind
= clk_rvalueref
;
1511 gl_kind
= lvalue_kind (expr
);
1512 if (gl_kind
& clk_class
)
1513 /* A class prvalue is not a glvalue. */
1518 is_lvalue
= gl_kind
&& !(gl_kind
& clk_rvalueref
);
1521 if ((gl_kind
& clk_bitfield
) != 0)
1522 tfrom
= unlowered_expr_type (expr
);
1524 /* Figure out whether or not the types are reference-related and
1525 reference compatible. We have do do this after stripping
1526 references from FROM. */
1527 related_p
= reference_related_p (to
, tfrom
);
1528 /* If this is a C cast, first convert to an appropriately qualified
1529 type, so that we can later do a const_cast to the desired type. */
1530 if (related_p
&& c_cast_p
1531 && !at_least_as_qualified_p (to
, tfrom
))
1532 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1533 compatible_p
= reference_compatible_p (to
, tfrom
);
1535 /* Directly bind reference when target expression's type is compatible with
1536 the reference and expression is an lvalue. In DR391, the wording in
1537 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1538 const and rvalue references to rvalues of compatible class type.
1539 We should also do direct bindings for non-class xvalues. */
1542 || (!(flags
& LOOKUP_NO_TEMP_BIND
)
1543 && (CLASS_TYPE_P (from
)
1544 || TREE_CODE (from
) == ARRAY_TYPE
))))
1548 If the initializer expression
1550 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1551 is reference-compatible with "cv2 T2,"
1553 the reference is bound directly to the initializer expression
1557 If the initializer expression is an rvalue, with T2 a class type,
1558 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1559 is bound to the object represented by the rvalue or to a sub-object
1560 within that object. */
1562 conv
= build_identity_conv (tfrom
, expr
);
1563 conv
= direct_reference_binding (rto
, conv
);
1565 if (flags
& LOOKUP_PREFER_RVALUE
)
1566 /* The top-level caller requested that we pretend that the lvalue
1567 be treated as an rvalue. */
1568 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1569 else if (TREE_CODE (rfrom
) == REFERENCE_TYPE
)
1570 /* Handle rvalue reference to function properly. */
1571 conv
->rvaluedness_matches_p
1572 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1574 conv
->rvaluedness_matches_p
1575 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1577 if ((gl_kind
& clk_bitfield
) != 0
1578 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1579 /* For the purposes of overload resolution, we ignore the fact
1580 this expression is a bitfield or packed field. (In particular,
1581 [over.ics.ref] says specifically that a function with a
1582 non-const reference parameter is viable even if the
1583 argument is a bitfield.)
1585 However, when we actually call the function we must create
1586 a temporary to which to bind the reference. If the
1587 reference is volatile, or isn't const, then we cannot make
1588 a temporary, so we just issue an error when the conversion
1590 conv
->need_temporary_p
= true;
1592 /* Don't allow binding of lvalues (other than function lvalues) to
1593 rvalue references. */
1594 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1595 && TREE_CODE (to
) != FUNCTION_TYPE
1596 && !(flags
& LOOKUP_PREFER_RVALUE
))
1599 /* Nor the reverse. */
1600 if (!is_lvalue
&& !TYPE_REF_IS_RVALUE (rto
)
1601 && (!CP_TYPE_CONST_NON_VOLATILE_P (to
)
1602 || (flags
& LOOKUP_NO_RVAL_BIND
))
1603 && TREE_CODE (to
) != FUNCTION_TYPE
)
1611 /* [class.conv.fct] A conversion function is never used to convert a
1612 (possibly cv-qualified) object to the (possibly cv-qualified) same
1613 object type (or a reference to it), to a (possibly cv-qualified) base
1614 class of that type (or a reference to it).... */
1615 else if (CLASS_TYPE_P (from
) && !related_p
1616 && !(flags
& LOOKUP_NO_CONVERSION
))
1620 If the initializer expression
1622 -- has a class type (i.e., T2 is a class type) can be
1623 implicitly converted to an lvalue of type "cv3 T3," where
1624 "cv1 T1" is reference-compatible with "cv3 T3". (this
1625 conversion is selected by enumerating the applicable
1626 conversion functions (_over.match.ref_) and choosing the
1627 best one through overload resolution. (_over.match_).
1629 the reference is bound to the lvalue result of the conversion
1630 in the second case. */
1631 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1634 return cand
->second_conv
;
1637 /* From this point on, we conceptually need temporaries, even if we
1638 elide them. Only the cases above are "direct bindings". */
1639 if (flags
& LOOKUP_NO_TEMP_BIND
)
1644 When a parameter of reference type is not bound directly to an
1645 argument expression, the conversion sequence is the one required
1646 to convert the argument expression to the underlying type of the
1647 reference according to _over.best.ics_. Conceptually, this
1648 conversion sequence corresponds to copy-initializing a temporary
1649 of the underlying type with the argument expression. Any
1650 difference in top-level cv-qualification is subsumed by the
1651 initialization itself and does not constitute a conversion. */
1655 Otherwise, the reference shall be an lvalue reference to a
1656 non-volatile const type, or the reference shall be an rvalue
1659 We try below to treat this as a bad conversion to improve diagnostics,
1660 but if TO is an incomplete class, we need to reject this conversion
1661 now to avoid unnecessary instantiation. */
1662 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
)
1663 && !COMPLETE_TYPE_P (to
))
1666 /* We're generating a temporary now, but don't bind any more in the
1667 conversion (specifically, don't slice the temporary returned by a
1668 conversion operator). */
1669 flags
|= LOOKUP_NO_TEMP_BIND
;
1671 /* Core issue 899: When [copy-]initializing a temporary to be bound
1672 to the first parameter of a copy constructor (12.8) called with
1673 a single argument in the context of direct-initialization,
1674 explicit conversion functions are also considered.
1676 So don't set LOOKUP_ONLYCONVERTING in that case. */
1677 if (!(flags
& LOOKUP_COPY_PARM
))
1678 flags
|= LOOKUP_ONLYCONVERTING
;
1681 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1686 if (conv
->user_conv_p
)
1688 /* If initializing the temporary used a conversion function,
1689 recalculate the second conversion sequence. */
1690 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1691 if (t
->kind
== ck_user
1692 && DECL_CONV_FN_P (t
->cand
->fn
))
1694 tree ftype
= TREE_TYPE (TREE_TYPE (t
->cand
->fn
));
1695 int sflags
= (flags
|LOOKUP_NO_CONVERSION
)&~LOOKUP_NO_TEMP_BIND
;
1696 conversion
*new_second
1697 = reference_binding (rto
, ftype
, NULL_TREE
, c_cast_p
,
1701 return merge_conversion_sequences (t
, new_second
);
1705 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1706 /* This reference binding, unlike those above, requires the
1707 creation of a temporary. */
1708 conv
->need_temporary_p
= true;
1709 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1713 Otherwise, the reference shall be an lvalue reference to a
1714 non-volatile const type, or the reference shall be an rvalue
1716 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1721 Otherwise, a temporary of type "cv1 T1" is created and
1722 initialized from the initializer expression using the rules for a
1723 non-reference copy initialization. If T1 is reference-related to
1724 T2, cv1 must be the same cv-qualification as, or greater
1725 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1726 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1732 /* Returns the implicit conversion sequence (see [over.ics]) from type
1733 FROM to type TO. The optional expression EXPR may affect the
1734 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1735 true, this conversion is coming from a C-style cast. */
1738 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1739 int flags
, tsubst_flags_t complain
)
1743 if (from
== error_mark_node
|| to
== error_mark_node
1744 || expr
== error_mark_node
)
1747 /* Other flags only apply to the primary function in overload
1748 resolution, or after we've chosen one. */
1749 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1750 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1751 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1753 /* FIXME: actually we don't want warnings either, but we can't just
1754 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1755 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1756 We really ought not to issue that warning until we've committed
1757 to that conversion. */
1758 complain
&= ~tf_error
;
1760 /* Call reshape_init early to remove redundant braces. */
1761 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
)
1762 && CLASS_TYPE_P (to
)
1763 && COMPLETE_TYPE_P (complete_type (to
))
1764 && !CLASSTYPE_NON_AGGREGATE (to
))
1766 expr
= reshape_init (to
, expr
, complain
);
1767 if (expr
== error_mark_node
)
1769 from
= TREE_TYPE (expr
);
1772 if (TREE_CODE (to
) == REFERENCE_TYPE
)
1773 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1775 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
);
1780 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1782 if (is_std_init_list (to
))
1783 return build_list_conv (to
, expr
, flags
, complain
);
1785 /* As an extension, allow list-initialization of _Complex. */
1786 if (TREE_CODE (to
) == COMPLEX_TYPE
)
1788 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1793 /* Allow conversion from an initializer-list with one element to a
1795 if (SCALAR_TYPE_P (to
))
1797 int nelts
= CONSTRUCTOR_NELTS (expr
);
1801 elt
= build_value_init (to
, tf_none
);
1802 else if (nelts
== 1)
1803 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1805 elt
= error_mark_node
;
1807 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1808 c_cast_p
, flags
, complain
);
1811 conv
->check_narrowing
= true;
1812 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1813 /* Too many levels of braces, i.e. '{{1}}'. */
1818 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1819 return build_array_conv (to
, expr
, flags
, complain
);
1822 if (expr
!= NULL_TREE
1823 && (MAYBE_CLASS_TYPE_P (from
)
1824 || MAYBE_CLASS_TYPE_P (to
))
1825 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1827 struct z_candidate
*cand
;
1829 if (CLASS_TYPE_P (to
)
1830 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
1831 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
1832 return build_aggr_conv (to
, expr
, flags
, complain
);
1834 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
1836 conv
= cand
->second_conv
;
1838 /* We used to try to bind a reference to a temporary here, but that
1839 is now handled after the recursive call to this function at the end
1840 of reference_binding. */
1847 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1848 functions. ARGS will not be changed until a single candidate is
1851 static struct z_candidate
*
1852 add_candidate (struct z_candidate
**candidates
,
1853 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
1854 size_t num_convs
, conversion
**convs
,
1855 tree access_path
, tree conversion_path
,
1856 int viable
, struct rejection_reason
*reason
,
1859 struct z_candidate
*cand
= (struct z_candidate
*)
1860 conversion_obstack_alloc (sizeof (struct z_candidate
));
1863 cand
->first_arg
= first_arg
;
1865 cand
->convs
= convs
;
1866 cand
->num_convs
= num_convs
;
1867 cand
->access_path
= access_path
;
1868 cand
->conversion_path
= conversion_path
;
1869 cand
->viable
= viable
;
1870 cand
->reason
= reason
;
1871 cand
->next
= *candidates
;
1872 cand
->flags
= flags
;
1878 /* Return the number of remaining arguments in the parameter list
1879 beginning with ARG. */
1882 remaining_arguments (tree arg
)
1886 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
1887 arg
= TREE_CHAIN (arg
))
1893 /* Create an overload candidate for the function or method FN called
1894 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1895 FLAGS is passed on to implicit_conversion.
1897 This does not change ARGS.
1899 CTYPE, if non-NULL, is the type we want to pretend this function
1900 comes from for purposes of overload resolution. */
1902 static struct z_candidate
*
1903 add_function_candidate (struct z_candidate
**candidates
,
1904 tree fn
, tree ctype
, tree first_arg
,
1905 const vec
<tree
, va_gc
> *args
, tree access_path
,
1906 tree conversion_path
, int flags
,
1907 tsubst_flags_t complain
)
1909 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1913 tree orig_first_arg
= first_arg
;
1916 struct rejection_reason
*reason
= NULL
;
1918 /* At this point we should not see any functions which haven't been
1919 explicitly declared, except for friend functions which will have
1920 been found using argument dependent lookup. */
1921 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
1923 /* The `this', `in_chrg' and VTT arguments to constructors are not
1924 considered in overload resolution. */
1925 if (DECL_CONSTRUCTOR_P (fn
))
1927 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
1928 skip
= num_artificial_parms_for (fn
);
1929 if (skip
> 0 && first_arg
!= NULL_TREE
)
1932 first_arg
= NULL_TREE
;
1938 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
1939 convs
= alloc_conversions (len
);
1941 /* 13.3.2 - Viable functions [over.match.viable]
1942 First, to be a viable function, a candidate function shall have enough
1943 parameters to agree in number with the arguments in the list.
1945 We need to check this first; otherwise, checking the ICSes might cause
1946 us to produce an ill-formed template instantiation. */
1948 parmnode
= parmlist
;
1949 for (i
= 0; i
< len
; ++i
)
1951 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
1953 parmnode
= TREE_CHAIN (parmnode
);
1956 if ((i
< len
&& parmnode
)
1957 || !sufficient_parms_p (parmnode
))
1959 int remaining
= remaining_arguments (parmnode
);
1961 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
1963 /* When looking for a function from a subobject from an implicit
1964 copy/move constructor/operator=, don't consider anything that takes (a
1965 reference to) an unrelated type. See c++/44909 and core 1092. */
1966 else if (parmlist
&& (flags
& LOOKUP_DEFAULTED
))
1968 if (DECL_CONSTRUCTOR_P (fn
))
1970 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
1971 && DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
)
1977 parmnode
= chain_index (i
-1, parmlist
);
1978 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
1983 /* This only applies at the top level. */
1984 flags
&= ~LOOKUP_DEFAULTED
;
1990 /* Second, for F to be a viable function, there shall exist for each
1991 argument an implicit conversion sequence that converts that argument
1992 to the corresponding parameter of F. */
1994 parmnode
= parmlist
;
1996 for (i
= 0; i
< len
; ++i
)
1998 tree argtype
, to_type
;
2003 if (parmnode
== void_list_node
)
2006 if (i
== 0 && first_arg
!= NULL_TREE
)
2009 arg
= CONST_CAST_TREE (
2010 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
2011 argtype
= lvalue_type (arg
);
2013 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2014 && ! DECL_CONSTRUCTOR_P (fn
));
2018 tree parmtype
= TREE_VALUE (parmnode
);
2021 parmnode
= TREE_CHAIN (parmnode
);
2023 /* The type of the implicit object parameter ('this') for
2024 overload resolution is not always the same as for the
2025 function itself; conversion functions are considered to
2026 be members of the class being converted, and functions
2027 introduced by a using-declaration are considered to be
2028 members of the class that uses them.
2030 Since build_over_call ignores the ICS for the `this'
2031 parameter, we can just change the parm type. */
2032 if (ctype
&& is_this
)
2034 parmtype
= cp_build_qualified_type
2035 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
2036 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
2038 /* If the function has a ref-qualifier, the implicit
2039 object parameter has reference type. */
2040 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
2041 parmtype
= cp_build_reference_type (parmtype
, rv
);
2042 /* The special handling of 'this' conversions in compare_ics
2043 does not apply if there is a ref-qualifier. */
2048 parmtype
= build_pointer_type (parmtype
);
2049 arg
= build_this (arg
);
2050 argtype
= lvalue_type (arg
);
2054 /* Core issue 899: When [copy-]initializing a temporary to be bound
2055 to the first parameter of a copy constructor (12.8) called with
2056 a single argument in the context of direct-initialization,
2057 explicit conversion functions are also considered.
2059 So set LOOKUP_COPY_PARM to let reference_binding know that
2060 it's being called in that context. We generalize the above
2061 to handle move constructors and template constructors as well;
2062 the standardese should soon be updated similarly. */
2063 if (ctype
&& i
== 0 && (len
-skip
== 1)
2064 && DECL_CONSTRUCTOR_P (fn
)
2065 && parmtype
!= error_mark_node
2066 && (same_type_ignoring_top_level_qualifiers_p
2067 (non_reference (parmtype
), ctype
)))
2069 if (!(flags
& LOOKUP_ONLYCONVERTING
))
2070 lflags
|= LOOKUP_COPY_PARM
;
2071 /* We allow user-defined conversions within init-lists, but
2072 don't list-initialize the copy parm, as that would mean
2073 using two levels of braces for the same type. */
2074 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
2075 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
2076 lflags
|= LOOKUP_NO_CONVERSION
;
2079 lflags
|= LOOKUP_ONLYCONVERTING
;
2081 t
= implicit_conversion (parmtype
, argtype
, arg
,
2082 /*c_cast_p=*/false, lflags
, complain
);
2087 t
= build_identity_conv (argtype
, arg
);
2088 t
->ellipsis_p
= true;
2099 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
);
2106 reason
= bad_arg_conversion_rejection (first_arg
, i
, arg
, to_type
);
2111 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2112 access_path
, conversion_path
, viable
, reason
, flags
);
2115 /* Create an overload candidate for the conversion function FN which will
2116 be invoked for expression OBJ, producing a pointer-to-function which
2117 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2118 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2119 passed on to implicit_conversion.
2121 Actually, we don't really care about FN; we care about the type it
2122 converts to. There may be multiple conversion functions that will
2123 convert to that type, and we rely on build_user_type_conversion_1 to
2124 choose the best one; so when we create our candidate, we record the type
2125 instead of the function. */
2127 static struct z_candidate
*
2128 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2129 tree first_arg
, const vec
<tree
, va_gc
> *arglist
,
2130 tree access_path
, tree conversion_path
,
2131 tsubst_flags_t complain
)
2133 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2134 int i
, len
, viable
, flags
;
2135 tree parmlist
, parmnode
;
2137 struct rejection_reason
*reason
;
2139 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2140 parmlist
= TREE_TYPE (parmlist
);
2141 parmlist
= TYPE_ARG_TYPES (parmlist
);
2143 len
= vec_safe_length (arglist
) + (first_arg
!= NULL_TREE
? 1 : 0) + 1;
2144 convs
= alloc_conversions (len
);
2145 parmnode
= parmlist
;
2147 flags
= LOOKUP_IMPLICIT
;
2150 /* Don't bother looking up the same type twice. */
2151 if (*candidates
&& (*candidates
)->fn
== totype
)
2154 for (i
= 0; i
< len
; ++i
)
2156 tree arg
, argtype
, convert_type
= NULL_TREE
;
2161 else if (i
== 1 && first_arg
!= NULL_TREE
)
2164 arg
= (*arglist
)[i
- (first_arg
!= NULL_TREE
? 1 : 0) - 1];
2165 argtype
= lvalue_type (arg
);
2169 t
= implicit_conversion (totype
, argtype
, arg
, /*c_cast_p=*/false,
2171 convert_type
= totype
;
2173 else if (parmnode
== void_list_node
)
2177 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2178 /*c_cast_p=*/false, flags
, complain
);
2179 convert_type
= TREE_VALUE (parmnode
);
2183 t
= build_identity_conv (argtype
, arg
);
2184 t
->ellipsis_p
= true;
2185 convert_type
= argtype
;
2195 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, arg
, convert_type
);
2202 parmnode
= TREE_CHAIN (parmnode
);
2206 || ! sufficient_parms_p (parmnode
))
2208 int remaining
= remaining_arguments (parmnode
);
2210 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2213 return add_candidate (candidates
, totype
, first_arg
, arglist
, len
, convs
,
2214 access_path
, conversion_path
, viable
, reason
, flags
);
2218 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2219 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2220 int flags
, tsubst_flags_t complain
)
2227 struct rejection_reason
*reason
= NULL
;
2232 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2233 convs
= alloc_conversions (num_convs
);
2235 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2236 conversion ops are allowed. We handle that here by just checking for
2237 boolean_type_node because other operators don't ask for it. COND_EXPR
2238 also does contextual conversion to bool for the first operand, but we
2239 handle that in build_conditional_expr, and type1 here is operand 2. */
2240 if (type1
!= boolean_type_node
)
2241 flags
|= LOOKUP_ONLYCONVERTING
;
2243 for (i
= 0; i
< 2; ++i
)
2248 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2249 /*c_cast_p=*/false, flags
, complain
);
2253 /* We need something for printing the candidate. */
2254 t
= build_identity_conv (types
[i
], NULL_TREE
);
2255 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2261 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, args
[i
],
2267 /* For COND_EXPR we rearranged the arguments; undo that now. */
2270 convs
[2] = convs
[1];
2271 convs
[1] = convs
[0];
2272 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2273 /*c_cast_p=*/false, flags
,
2280 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2285 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2287 /*access_path=*/NULL_TREE
,
2288 /*conversion_path=*/NULL_TREE
,
2289 viable
, reason
, flags
);
2293 is_complete (tree t
)
2295 return COMPLETE_TYPE_P (complete_type (t
));
2298 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2301 promoted_arithmetic_type_p (tree type
)
2305 In this section, the term promoted integral type is used to refer
2306 to those integral types which are preserved by integral promotion
2307 (including e.g. int and long but excluding e.g. char).
2308 Similarly, the term promoted arithmetic type refers to promoted
2309 integral types plus floating types. */
2310 return ((CP_INTEGRAL_TYPE_P (type
)
2311 && same_type_p (type_promotes_to (type
), type
))
2312 || TREE_CODE (type
) == REAL_TYPE
);
2315 /* Create any builtin operator overload candidates for the operator in
2316 question given the converted operand types TYPE1 and TYPE2. The other
2317 args are passed through from add_builtin_candidates to
2318 build_builtin_candidate.
2320 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2321 If CODE is requires candidates operands of the same type of the kind
2322 of which TYPE1 and TYPE2 are, we add both candidates
2323 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2326 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2327 enum tree_code code2
, tree fnname
, tree type1
,
2328 tree type2
, tree
*args
, tree
*argtypes
, int flags
,
2329 tsubst_flags_t complain
)
2333 case POSTINCREMENT_EXPR
:
2334 case POSTDECREMENT_EXPR
:
2335 args
[1] = integer_zero_node
;
2336 type2
= integer_type_node
;
2345 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2346 and VQ is either volatile or empty, there exist candidate operator
2347 functions of the form
2348 VQ T& operator++(VQ T&);
2349 T operator++(VQ T&, int);
2350 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2351 type other than bool, and VQ is either volatile or empty, there exist
2352 candidate operator functions of the form
2353 VQ T& operator--(VQ T&);
2354 T operator--(VQ T&, int);
2355 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2356 complete object type, and VQ is either volatile or empty, there exist
2357 candidate operator functions of the form
2358 T*VQ& operator++(T*VQ&);
2359 T*VQ& operator--(T*VQ&);
2360 T* operator++(T*VQ&, int);
2361 T* operator--(T*VQ&, int); */
2363 case POSTDECREMENT_EXPR
:
2364 case PREDECREMENT_EXPR
:
2365 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2367 case POSTINCREMENT_EXPR
:
2368 case PREINCREMENT_EXPR
:
2369 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2371 type1
= build_reference_type (type1
);
2376 /* 7 For every cv-qualified or cv-unqualified object type T, there
2377 exist candidate operator functions of the form
2381 8 For every function type T, there exist candidate operator functions of
2383 T& operator*(T*); */
2386 if (TYPE_PTR_P (type1
)
2387 && (TYPE_PTROB_P (type1
)
2388 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2392 /* 9 For every type T, there exist candidate operator functions of the form
2395 10For every promoted arithmetic type T, there exist candidate operator
2396 functions of the form
2400 case UNARY_PLUS_EXPR
: /* unary + */
2401 if (TYPE_PTR_P (type1
))
2404 if (ARITHMETIC_TYPE_P (type1
))
2408 /* 11For every promoted integral type T, there exist candidate operator
2409 functions of the form
2413 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2417 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2418 is the same type as C2 or is a derived class of C2, T is a complete
2419 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2420 there exist candidate operator functions of the form
2421 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2422 where CV12 is the union of CV1 and CV2. */
2425 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2427 tree c1
= TREE_TYPE (type1
);
2428 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2430 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2431 && (TYPE_PTRMEMFUNC_P (type2
)
2432 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2437 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2438 didate operator functions of the form
2443 bool operator<(L, R);
2444 bool operator>(L, R);
2445 bool operator<=(L, R);
2446 bool operator>=(L, R);
2447 bool operator==(L, R);
2448 bool operator!=(L, R);
2449 where LR is the result of the usual arithmetic conversions between
2452 14For every pair of types T and I, where T is a cv-qualified or cv-
2453 unqualified complete object type and I is a promoted integral type,
2454 there exist candidate operator functions of the form
2455 T* operator+(T*, I);
2456 T& operator[](T*, I);
2457 T* operator-(T*, I);
2458 T* operator+(I, T*);
2459 T& operator[](I, T*);
2461 15For every T, where T is a pointer to complete object type, there exist
2462 candidate operator functions of the form112)
2463 ptrdiff_t operator-(T, T);
2465 16For every pointer or enumeration type T, there exist candidate operator
2466 functions of the form
2467 bool operator<(T, T);
2468 bool operator>(T, T);
2469 bool operator<=(T, T);
2470 bool operator>=(T, T);
2471 bool operator==(T, T);
2472 bool operator!=(T, T);
2474 17For every pointer to member type T, there exist candidate operator
2475 functions of the form
2476 bool operator==(T, T);
2477 bool operator!=(T, T); */
2480 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2482 if (TYPE_PTROB_P (type1
)
2483 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2485 type2
= ptrdiff_type_node
;
2489 case TRUNC_DIV_EXPR
:
2490 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2496 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2497 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2499 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2504 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2516 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2518 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2520 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2521 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2523 if (TYPE_PTR_P (type1
)
2524 && null_ptr_cst_p (args
[1]))
2529 if (null_ptr_cst_p (args
[0])
2530 && TYPE_PTR_P (type2
))
2538 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2541 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2543 type1
= ptrdiff_type_node
;
2546 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2548 type2
= ptrdiff_type_node
;
2553 /* 18For every pair of promoted integral types L and R, there exist candi-
2554 date operator functions of the form
2561 where LR is the result of the usual arithmetic conversions between
2564 case TRUNC_MOD_EXPR
:
2570 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2574 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2575 type, VQ is either volatile or empty, and R is a promoted arithmetic
2576 type, there exist candidate operator functions of the form
2577 VQ L& operator=(VQ L&, R);
2578 VQ L& operator*=(VQ L&, R);
2579 VQ L& operator/=(VQ L&, R);
2580 VQ L& operator+=(VQ L&, R);
2581 VQ L& operator-=(VQ L&, R);
2583 20For every pair T, VQ), where T is any type and VQ is either volatile
2584 or empty, there exist candidate operator functions of the form
2585 T*VQ& operator=(T*VQ&, T*);
2587 21For every pair T, VQ), where T is a pointer to member type and VQ is
2588 either volatile or empty, there exist candidate operator functions of
2590 VQ T& operator=(VQ T&, T);
2592 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2593 unqualified complete object type, VQ is either volatile or empty, and
2594 I is a promoted integral type, there exist candidate operator func-
2596 T*VQ& operator+=(T*VQ&, I);
2597 T*VQ& operator-=(T*VQ&, I);
2599 23For every triple L, VQ, R), where L is an integral or enumeration
2600 type, VQ is either volatile or empty, and R is a promoted integral
2601 type, there exist candidate operator functions of the form
2603 VQ L& operator%=(VQ L&, R);
2604 VQ L& operator<<=(VQ L&, R);
2605 VQ L& operator>>=(VQ L&, R);
2606 VQ L& operator&=(VQ L&, R);
2607 VQ L& operator^=(VQ L&, R);
2608 VQ L& operator|=(VQ L&, R); */
2615 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2617 type2
= ptrdiff_type_node
;
2621 case TRUNC_DIV_EXPR
:
2622 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2626 case TRUNC_MOD_EXPR
:
2632 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2637 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2639 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2640 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2641 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2642 || ((TYPE_PTRMEMFUNC_P (type1
)
2643 || TYPE_PTR_P (type1
))
2644 && null_ptr_cst_p (args
[1])))
2654 type1
= build_reference_type (type1
);
2660 For every pair of promoted arithmetic types L and R, there
2661 exist candidate operator functions of the form
2663 LR operator?(bool, L, R);
2665 where LR is the result of the usual arithmetic conversions
2666 between types L and R.
2668 For every type T, where T is a pointer or pointer-to-member
2669 type, there exist candidate operator functions of the form T
2670 operator?(bool, T, T); */
2672 if (promoted_arithmetic_type_p (type1
)
2673 && promoted_arithmetic_type_p (type2
))
2677 /* Otherwise, the types should be pointers. */
2678 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2681 /* We don't check that the two types are the same; the logic
2682 below will actually create two candidates; one in which both
2683 parameter types are TYPE1, and one in which both parameter
2689 if (ARITHMETIC_TYPE_P (type1
))
2697 /* Make sure we don't create builtin candidates with dependent types. */
2698 bool u1
= uses_template_parms (type1
);
2699 bool u2
= type2
? uses_template_parms (type2
) : false;
2702 /* Try to recover if one of the types is non-dependent. But if
2703 there's only one type, there's nothing we can do. */
2706 /* And we lose if both are dependent. */
2709 /* Or if they have different forms. */
2710 if (TREE_CODE (type1
) != TREE_CODE (type2
))
2719 /* If we're dealing with two pointer types or two enumeral types,
2720 we need candidates for both of them. */
2721 if (type2
&& !same_type_p (type1
, type2
)
2722 && TREE_CODE (type1
) == TREE_CODE (type2
)
2723 && (TREE_CODE (type1
) == REFERENCE_TYPE
2724 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2725 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2726 || TYPE_PTRMEMFUNC_P (type1
)
2727 || MAYBE_CLASS_TYPE_P (type1
)
2728 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2730 if (TYPE_PTR_OR_PTRMEM_P (type1
))
2732 tree cptype
= composite_pointer_type (type1
, type2
,
2737 if (cptype
!= error_mark_node
)
2739 build_builtin_candidate
2740 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
2746 build_builtin_candidate
2747 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
2748 build_builtin_candidate
2749 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
2753 build_builtin_candidate
2754 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
2758 type_decays_to (tree type
)
2760 if (TREE_CODE (type
) == ARRAY_TYPE
)
2761 return build_pointer_type (TREE_TYPE (type
));
2762 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2763 return build_pointer_type (type
);
2767 /* There are three conditions of builtin candidates:
2769 1) bool-taking candidates. These are the same regardless of the input.
2770 2) pointer-pair taking candidates. These are generated for each type
2771 one of the input types converts to.
2772 3) arithmetic candidates. According to the standard, we should generate
2773 all of these, but I'm trying not to...
2775 Here we generate a superset of the possible candidates for this particular
2776 case. That is a subset of the full set the standard defines, plus some
2777 other cases which the standard disallows. add_builtin_candidate will
2778 filter out the invalid set. */
2781 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2782 enum tree_code code2
, tree fnname
, tree
*args
,
2783 int flags
, tsubst_flags_t complain
)
2787 tree type
, argtypes
[3], t
;
2788 /* TYPES[i] is the set of possible builtin-operator parameter types
2789 we will consider for the Ith argument. */
2790 vec
<tree
, va_gc
> *types
[2];
2793 for (i
= 0; i
< 3; ++i
)
2796 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2798 argtypes
[i
] = NULL_TREE
;
2803 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2804 and VQ is either volatile or empty, there exist candidate operator
2805 functions of the form
2806 VQ T& operator++(VQ T&); */
2808 case POSTINCREMENT_EXPR
:
2809 case PREINCREMENT_EXPR
:
2810 case POSTDECREMENT_EXPR
:
2811 case PREDECREMENT_EXPR
:
2816 /* 24There also exist candidate operator functions of the form
2817 bool operator!(bool);
2818 bool operator&&(bool, bool);
2819 bool operator||(bool, bool); */
2821 case TRUTH_NOT_EXPR
:
2822 build_builtin_candidate
2823 (candidates
, fnname
, boolean_type_node
,
2824 NULL_TREE
, args
, argtypes
, flags
, complain
);
2827 case TRUTH_ORIF_EXPR
:
2828 case TRUTH_ANDIF_EXPR
:
2829 build_builtin_candidate
2830 (candidates
, fnname
, boolean_type_node
,
2831 boolean_type_node
, args
, argtypes
, flags
, complain
);
2853 types
[0] = make_tree_vector ();
2854 types
[1] = make_tree_vector ();
2856 for (i
= 0; i
< 2; ++i
)
2860 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
2864 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
2867 convs
= lookup_conversions (argtypes
[i
]);
2869 if (code
== COND_EXPR
)
2871 if (real_lvalue_p (args
[i
]))
2872 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
2874 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
2880 for (; convs
; convs
= TREE_CHAIN (convs
))
2882 type
= TREE_TYPE (convs
);
2885 && (TREE_CODE (type
) != REFERENCE_TYPE
2886 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
2889 if (code
== COND_EXPR
&& TREE_CODE (type
) == REFERENCE_TYPE
)
2890 vec_safe_push (types
[i
], type
);
2892 type
= non_reference (type
);
2893 if (i
!= 0 || ! ref1
)
2895 type
= cv_unqualified (type_decays_to (type
));
2896 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
2897 vec_safe_push (types
[i
], type
);
2898 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2899 type
= type_promotes_to (type
);
2902 if (! vec_member (type
, types
[i
]))
2903 vec_safe_push (types
[i
], type
);
2908 if (code
== COND_EXPR
&& real_lvalue_p (args
[i
]))
2909 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
2910 type
= non_reference (argtypes
[i
]);
2911 if (i
!= 0 || ! ref1
)
2913 type
= cv_unqualified (type_decays_to (type
));
2914 if (enum_p
&& UNSCOPED_ENUM_P (type
))
2915 vec_safe_push (types
[i
], type
);
2916 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2917 type
= type_promotes_to (type
);
2919 vec_safe_push (types
[i
], type
);
2923 /* Run through the possible parameter types of both arguments,
2924 creating candidates with those parameter types. */
2925 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
2930 if (!types
[1]->is_empty ())
2931 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
2932 add_builtin_candidate
2933 (candidates
, code
, code2
, fnname
, t
,
2934 u
, args
, argtypes
, flags
, complain
);
2936 add_builtin_candidate
2937 (candidates
, code
, code2
, fnname
, t
,
2938 NULL_TREE
, args
, argtypes
, flags
, complain
);
2941 release_tree_vector (types
[0]);
2942 release_tree_vector (types
[1]);
2946 /* If TMPL can be successfully instantiated as indicated by
2947 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2949 TMPL is the template. EXPLICIT_TARGS are any explicit template
2950 arguments. ARGLIST is the arguments provided at the call-site.
2951 This does not change ARGLIST. The RETURN_TYPE is the desired type
2952 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
2953 as for add_function_candidate. If an OBJ is supplied, FLAGS and
2954 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
2956 static struct z_candidate
*
2957 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
2958 tree ctype
, tree explicit_targs
, tree first_arg
,
2959 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
2960 tree access_path
, tree conversion_path
,
2961 int flags
, tree obj
, unification_kind_t strict
,
2962 tsubst_flags_t complain
)
2964 int ntparms
= DECL_NTPARMS (tmpl
);
2965 tree targs
= make_tree_vec (ntparms
);
2966 unsigned int len
= vec_safe_length (arglist
);
2967 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
2968 unsigned int skip_without_in_chrg
= 0;
2969 tree first_arg_without_in_chrg
= first_arg
;
2970 tree
*args_without_in_chrg
;
2971 unsigned int nargs_without_in_chrg
;
2972 unsigned int ia
, ix
;
2974 struct z_candidate
*cand
;
2976 struct rejection_reason
*reason
= NULL
;
2979 /* We don't do deduction on the in-charge parameter, the VTT
2980 parameter or 'this'. */
2981 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
2983 if (first_arg_without_in_chrg
!= NULL_TREE
)
2984 first_arg_without_in_chrg
= NULL_TREE
;
2986 ++skip_without_in_chrg
;
2989 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
2990 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
2991 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
2993 if (first_arg_without_in_chrg
!= NULL_TREE
)
2994 first_arg_without_in_chrg
= NULL_TREE
;
2996 ++skip_without_in_chrg
;
2999 if (len
< skip_without_in_chrg
)
3002 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
3003 + (len
- skip_without_in_chrg
));
3004 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
3006 if (first_arg_without_in_chrg
!= NULL_TREE
)
3008 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
3011 for (ix
= skip_without_in_chrg
;
3012 vec_safe_iterate (arglist
, ix
, &arg
);
3015 args_without_in_chrg
[ia
] = arg
;
3018 gcc_assert (ia
== nargs_without_in_chrg
);
3020 errs
= errorcount
+sorrycount
;
3021 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
3022 args_without_in_chrg
,
3023 nargs_without_in_chrg
,
3024 return_type
, strict
, flags
, false,
3025 complain
& tf_decltype
);
3027 if (fn
== error_mark_node
)
3029 /* Don't repeat unification later if it already resulted in errors. */
3030 if (errorcount
+sorrycount
== errs
)
3031 reason
= template_unification_rejection (tmpl
, explicit_targs
,
3032 targs
, args_without_in_chrg
,
3033 nargs_without_in_chrg
,
3034 return_type
, strict
, flags
);
3036 reason
= template_unification_error_rejection ();
3042 A member function template is never instantiated to perform the
3043 copy of a class object to an object of its class type.
3045 It's a little unclear what this means; the standard explicitly
3046 does allow a template to be used to copy a class. For example,
3051 template <class T> A(const T&);
3054 void g () { A a (f ()); }
3056 the member template will be used to make the copy. The section
3057 quoted above appears in the paragraph that forbids constructors
3058 whose only parameter is (a possibly cv-qualified variant of) the
3059 class type, and a logical interpretation is that the intent was
3060 to forbid the instantiation of member templates which would then
3062 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
3064 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
3065 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
3068 reason
= invalid_copy_with_fn_template_rejection ();
3073 if (obj
!= NULL_TREE
)
3074 /* Aha, this is a conversion function. */
3075 cand
= add_conv_candidate (candidates
, fn
, obj
, first_arg
, arglist
,
3076 access_path
, conversion_path
, complain
);
3078 cand
= add_function_candidate (candidates
, fn
, ctype
,
3079 first_arg
, arglist
, access_path
,
3080 conversion_path
, flags
, complain
);
3081 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
3082 /* This situation can occur if a member template of a template
3083 class is specialized. Then, instantiate_template might return
3084 an instantiation of the specialization, in which case the
3085 DECL_TI_TEMPLATE field will point at the original
3086 specialization. For example:
3088 template <class T> struct S { template <class U> void f(U);
3089 template <> void f(int) {}; };
3093 Here, TMPL will be template <class U> S<double>::f(U).
3094 And, instantiate template will give us the specialization
3095 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3096 for this will point at template <class T> template <> S<T>::f(int),
3097 so that we can find the definition. For the purposes of
3098 overload resolution, however, we want the original TMPL. */
3099 cand
->template_decl
= build_template_info (tmpl
, targs
);
3101 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3102 cand
->explicit_targs
= explicit_targs
;
3106 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3107 access_path
, conversion_path
, 0, reason
, flags
);
3111 static struct z_candidate
*
3112 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3113 tree explicit_targs
, tree first_arg
,
3114 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3115 tree access_path
, tree conversion_path
, int flags
,
3116 unification_kind_t strict
, tsubst_flags_t complain
)
3119 add_template_candidate_real (candidates
, tmpl
, ctype
,
3120 explicit_targs
, first_arg
, arglist
,
3121 return_type
, access_path
, conversion_path
,
3122 flags
, NULL_TREE
, strict
, complain
);
3126 static struct z_candidate
*
3127 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3128 tree obj
, tree first_arg
,
3129 const vec
<tree
, va_gc
> *arglist
,
3130 tree return_type
, tree access_path
,
3131 tree conversion_path
, tsubst_flags_t complain
)
3134 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3135 first_arg
, arglist
, return_type
, access_path
,
3136 conversion_path
, 0, obj
, DEDUCE_CONV
,
3140 /* The CANDS are the set of candidates that were considered for
3141 overload resolution. Return the set of viable candidates, or CANDS
3142 if none are viable. If any of the candidates were viable, set
3143 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3144 considered viable only if it is strictly viable. */
3146 static struct z_candidate
*
3147 splice_viable (struct z_candidate
*cands
,
3151 struct z_candidate
*viable
;
3152 struct z_candidate
**last_viable
;
3153 struct z_candidate
**cand
;
3154 bool found_strictly_viable
= false;
3156 /* Be strict inside templates, since build_over_call won't actually
3157 do the conversions to get pedwarns. */
3158 if (processing_template_decl
)
3162 last_viable
= &viable
;
3163 *any_viable_p
= false;
3168 struct z_candidate
*c
= *cand
;
3170 && (c
->viable
== 1 || TREE_CODE (c
->fn
) == TEMPLATE_DECL
))
3172 /* Be strict in the presence of a viable candidate. Also if
3173 there are template candidates, so that we get deduction errors
3174 for them instead of silently preferring a bad conversion. */
3176 if (viable
&& !found_strictly_viable
)
3178 /* Put any spliced near matches back onto the main list so
3179 that we see them if there is no strict match. */
3180 *any_viable_p
= false;
3181 *last_viable
= cands
;
3184 last_viable
= &viable
;
3188 if (strict_p
? c
->viable
== 1 : c
->viable
)
3193 last_viable
= &c
->next
;
3194 *any_viable_p
= true;
3196 found_strictly_viable
= true;
3202 return viable
? viable
: cands
;
3206 any_strictly_viable (struct z_candidate
*cands
)
3208 for (; cands
; cands
= cands
->next
)
3209 if (cands
->viable
== 1)
3214 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3215 words, it is about to become the "this" pointer for a member
3216 function call. Take the address of the object. */
3219 build_this (tree obj
)
3221 /* In a template, we are only concerned about the type of the
3222 expression, so we can take a shortcut. */
3223 if (processing_template_decl
)
3224 return build_address (obj
);
3226 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3229 /* Returns true iff functions are equivalent. Equivalent functions are
3230 not '==' only if one is a function-local extern function or if
3231 both are extern "C". */
3234 equal_functions (tree fn1
, tree fn2
)
3236 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3238 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3240 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3241 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3242 return decls_match (fn1
, fn2
);
3246 /* Print information about a candidate being rejected due to INFO. */
3249 print_conversion_rejection (location_t loc
, struct conversion_info
*info
)
3251 tree from
= info
->from
;
3253 from
= lvalue_type (from
);
3254 if (info
->n_arg
== -1)
3256 /* Conversion of implicit `this' argument failed. */
3257 if (!TYPE_P (info
->from
))
3258 /* A bad conversion for 'this' must be discarding cv-quals. */
3259 inform (loc
, " passing %qT as %<this%> "
3260 "argument discards qualifiers",
3263 inform (loc
, " no known conversion for implicit "
3264 "%<this%> parameter from %qT to %qT",
3265 from
, info
->to_type
);
3267 else if (!TYPE_P (info
->from
))
3269 if (info
->n_arg
>= 0)
3270 inform (loc
, " conversion of argument %d would be ill-formed:",
3272 perform_implicit_conversion (info
->to_type
, info
->from
,
3273 tf_warning_or_error
);
3275 else if (info
->n_arg
== -2)
3276 /* Conversion of conversion function return value failed. */
3277 inform (loc
, " no known conversion from %qT to %qT",
3278 from
, info
->to_type
);
3280 inform (loc
, " no known conversion for argument %d from %qT to %qT",
3281 info
->n_arg
+ 1, from
, info
->to_type
);
3284 /* Print information about a candidate with WANT parameters and we found
3288 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3290 inform_n (loc
, want
,
3291 " candidate expects %d argument, %d provided",
3292 " candidate expects %d arguments, %d provided",
3296 /* Print information about one overload candidate CANDIDATE. MSGSTR
3297 is the text to print before the candidate itself.
3299 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3300 to have been run through gettext by the caller. This wart makes
3301 life simpler in print_z_candidates and for the translators. */
3304 print_z_candidate (location_t loc
, const char *msgstr
,
3305 struct z_candidate
*candidate
)
3307 const char *msg
= (msgstr
== NULL
3309 : ACONCAT ((msgstr
, " ", NULL
)));
3310 location_t cloc
= location_of (candidate
->fn
);
3312 if (identifier_p (candidate
->fn
))
3315 if (candidate
->num_convs
== 3)
3316 inform (cloc
, "%s%D(%T, %T, %T) <built-in>", msg
, candidate
->fn
,
3317 candidate
->convs
[0]->type
,
3318 candidate
->convs
[1]->type
,
3319 candidate
->convs
[2]->type
);
3320 else if (candidate
->num_convs
== 2)
3321 inform (cloc
, "%s%D(%T, %T) <built-in>", msg
, candidate
->fn
,
3322 candidate
->convs
[0]->type
,
3323 candidate
->convs
[1]->type
);
3325 inform (cloc
, "%s%D(%T) <built-in>", msg
, candidate
->fn
,
3326 candidate
->convs
[0]->type
);
3328 else if (TYPE_P (candidate
->fn
))
3329 inform (cloc
, "%s%T <conversion>", msg
, candidate
->fn
);
3330 else if (candidate
->viable
== -1)
3331 inform (cloc
, "%s%#D <near match>", msg
, candidate
->fn
);
3332 else if (DECL_DELETED_FN (candidate
->fn
))
3333 inform (cloc
, "%s%#D <deleted>", msg
, candidate
->fn
);
3335 inform (cloc
, "%s%#D", msg
, candidate
->fn
);
3336 /* Give the user some information about why this candidate failed. */
3337 if (candidate
->reason
!= NULL
)
3339 struct rejection_reason
*r
= candidate
->reason
;
3344 print_arity_information (cloc
, r
->u
.arity
.actual
,
3345 r
->u
.arity
.expected
);
3347 case rr_arg_conversion
:
3348 print_conversion_rejection (cloc
, &r
->u
.conversion
);
3350 case rr_bad_arg_conversion
:
3351 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
);
3353 case rr_explicit_conversion
:
3354 inform (cloc
, " return type %qT of explicit conversion function "
3355 "cannot be converted to %qT with a qualification "
3356 "conversion", r
->u
.conversion
.from
,
3357 r
->u
.conversion
.to_type
);
3359 case rr_template_conversion
:
3360 inform (cloc
, " conversion from return type %qT of template "
3361 "conversion function specialization to %qT is not an "
3362 "exact match", r
->u
.conversion
.from
,
3363 r
->u
.conversion
.to_type
);
3365 case rr_template_unification
:
3366 /* We use template_unification_error_rejection if unification caused
3367 actual non-SFINAE errors, in which case we don't need to repeat
3369 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3371 inform (cloc
, " substitution of deduced template arguments "
3372 "resulted in errors seen above");
3375 /* Re-run template unification with diagnostics. */
3376 inform (cloc
, " template argument deduction/substitution failed:");
3377 fn_type_unification (r
->u
.template_unification
.tmpl
,
3378 r
->u
.template_unification
.explicit_targs
,
3380 (r
->u
.template_unification
.num_targs
)),
3381 r
->u
.template_unification
.args
,
3382 r
->u
.template_unification
.nargs
,
3383 r
->u
.template_unification
.return_type
,
3384 r
->u
.template_unification
.strict
,
3385 r
->u
.template_unification
.flags
,
3388 case rr_invalid_copy
:
3390 " a constructor taking a single argument of its own "
3391 "class type is invalid");
3395 /* This candidate didn't have any issues or we failed to
3396 handle a particular code. Either way... */
3403 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3405 struct z_candidate
*cand1
;
3406 struct z_candidate
**cand2
;
3411 /* Remove non-viable deleted candidates. */
3413 for (cand2
= &cand1
; *cand2
; )
3415 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3416 && !(*cand2
)->viable
3417 && DECL_DELETED_FN ((*cand2
)->fn
))
3418 *cand2
= (*cand2
)->next
;
3420 cand2
= &(*cand2
)->next
;
3422 /* ...if there are any non-deleted ones. */
3426 /* There may be duplicates in the set of candidates. We put off
3427 checking this condition as long as possible, since we have no way
3428 to eliminate duplicates from a set of functions in less than n^2
3429 time. Now we are about to emit an error message, so it is more
3430 permissible to go slowly. */
3431 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3433 tree fn
= cand1
->fn
;
3434 /* Skip builtin candidates and conversion functions. */
3437 cand2
= &cand1
->next
;
3440 if (DECL_P ((*cand2
)->fn
)
3441 && equal_functions (fn
, (*cand2
)->fn
))
3442 *cand2
= (*cand2
)->next
;
3444 cand2
= &(*cand2
)->next
;
3448 for (; candidates
; candidates
= candidates
->next
)
3449 print_z_candidate (loc
, "candidate:", candidates
);
3452 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3453 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3454 the result of the conversion function to convert it to the final
3455 desired type. Merge the two sequences into a single sequence,
3456 and return the merged sequence. */
3459 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3462 bool bad
= user_seq
->bad_p
;
3464 gcc_assert (user_seq
->kind
== ck_user
);
3466 /* Find the end of the second conversion sequence. */
3467 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3469 /* The entire sequence is a user-conversion sequence. */
3470 (*t
)->user_conv_p
= true;
3475 /* Replace the identity conversion with the user conversion
3482 /* Handle overload resolution for initializing an object of class type from
3483 an initializer list. First we look for a suitable constructor that
3484 takes a std::initializer_list; if we don't find one, we then look for a
3485 non-list constructor.
3487 Parameters are as for add_candidates, except that the arguments are in
3488 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3489 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3492 add_list_candidates (tree fns
, tree first_arg
,
3493 tree init_list
, tree totype
,
3494 tree explicit_targs
, bool template_only
,
3495 tree conversion_path
, tree access_path
,
3497 struct z_candidate
**candidates
,
3498 tsubst_flags_t complain
)
3500 vec
<tree
, va_gc
> *args
;
3502 gcc_assert (*candidates
== NULL
);
3504 /* We're looking for a ctor for list-initialization. */
3505 flags
|= LOOKUP_LIST_INIT_CTOR
;
3506 /* And we don't allow narrowing conversions. We also use this flag to
3507 avoid the copy constructor call for copy-list-initialization. */
3508 flags
|= LOOKUP_NO_NARROWING
;
3510 /* Always use the default constructor if the list is empty (DR 990). */
3511 if (CONSTRUCTOR_NELTS (init_list
) == 0
3512 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3514 /* If the class has a list ctor, try passing the list as a single
3515 argument first, but only consider list ctors. */
3516 else if (TYPE_HAS_LIST_CTOR (totype
))
3518 flags
|= LOOKUP_LIST_ONLY
;
3519 args
= make_tree_vector_single (init_list
);
3520 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3521 explicit_targs
, template_only
, conversion_path
,
3522 access_path
, flags
, candidates
, complain
);
3523 if (any_strictly_viable (*candidates
))
3527 args
= ctor_to_vec (init_list
);
3529 /* We aren't looking for list-ctors anymore. */
3530 flags
&= ~LOOKUP_LIST_ONLY
;
3531 /* We allow more user-defined conversions within an init-list. */
3532 flags
&= ~LOOKUP_NO_CONVERSION
;
3534 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3535 explicit_targs
, template_only
, conversion_path
,
3536 access_path
, flags
, candidates
, complain
);
3539 /* Returns the best overload candidate to perform the requested
3540 conversion. This function is used for three the overloading situations
3541 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3542 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3543 per [dcl.init.ref], so we ignore temporary bindings. */
3545 static struct z_candidate
*
3546 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3547 tsubst_flags_t complain
)
3549 struct z_candidate
*candidates
, *cand
;
3551 tree ctors
= NULL_TREE
;
3552 tree conv_fns
= NULL_TREE
;
3553 conversion
*conv
= NULL
;
3554 tree first_arg
= NULL_TREE
;
3555 vec
<tree
, va_gc
> *args
= NULL
;
3562 fromtype
= TREE_TYPE (expr
);
3564 /* We represent conversion within a hierarchy using RVALUE_CONV and
3565 BASE_CONV, as specified by [over.best.ics]; these become plain
3566 constructor calls, as specified in [dcl.init]. */
3567 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3568 || !DERIVED_FROM_P (totype
, fromtype
));
3570 if (MAYBE_CLASS_TYPE_P (totype
))
3571 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3572 creating a garbage BASELINK; constructors can't be inherited. */
3573 ctors
= lookup_fnfields_slot (totype
, complete_ctor_identifier
);
3575 if (MAYBE_CLASS_TYPE_P (fromtype
))
3577 tree to_nonref
= non_reference (totype
);
3578 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3579 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3580 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3582 /* [class.conv.fct] A conversion function is never used to
3583 convert a (possibly cv-qualified) object to the (possibly
3584 cv-qualified) same object type (or a reference to it), to a
3585 (possibly cv-qualified) base class of that type (or a
3586 reference to it)... */
3589 conv_fns
= lookup_conversions (fromtype
);
3593 flags
|= LOOKUP_NO_CONVERSION
;
3594 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3595 flags
|= LOOKUP_NO_NARROWING
;
3597 /* It's OK to bind a temporary for converting constructor arguments, but
3598 not in converting the return value of a conversion operator. */
3599 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
3600 | (flags
& LOOKUP_NO_NARROWING
));
3601 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3605 int ctorflags
= flags
;
3607 first_arg
= build_dummy_object (totype
);
3609 /* We should never try to call the abstract or base constructor
3611 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors
))
3612 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors
)));
3614 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3616 /* List-initialization. */
3617 add_list_candidates (ctors
, first_arg
, expr
, totype
, NULL_TREE
,
3618 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3619 ctorflags
, &candidates
, complain
);
3623 args
= make_tree_vector_single (expr
);
3624 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3625 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3626 ctorflags
, &candidates
, complain
);
3629 for (cand
= candidates
; cand
; cand
= cand
->next
)
3631 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3633 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3634 set, then this is copy-initialization. In that case, "The
3635 result of the call is then used to direct-initialize the
3636 object that is the destination of the copy-initialization."
3639 We represent this in the conversion sequence with an
3640 rvalue conversion, which means a constructor call. */
3641 if (TREE_CODE (totype
) != REFERENCE_TYPE
3642 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3644 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3651 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3653 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3654 struct z_candidate
*old_candidates
;
3656 /* If we are called to convert to a reference type, we are trying to
3657 find a direct binding, so don't even consider temporaries. If
3658 we don't find a direct binding, the caller will try again to
3659 look for a temporary binding. */
3660 if (TREE_CODE (totype
) == REFERENCE_TYPE
)
3661 convflags
|= LOOKUP_NO_TEMP_BIND
;
3663 old_candidates
= candidates
;
3664 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
3666 conversion_path
, TYPE_BINFO (fromtype
),
3667 flags
, &candidates
, complain
);
3669 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
3671 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
3673 = implicit_conversion (totype
,
3676 /*c_cast_p=*/false, convflags
,
3679 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3680 copy-initialization. In that case, "The result of the
3681 call is then used to direct-initialize the object that is
3682 the destination of the copy-initialization." [dcl.init]
3684 We represent this in the conversion sequence with an
3685 rvalue conversion, which means a constructor call. But
3686 don't add a second rvalue conversion if there's already
3687 one there. Which there really shouldn't be, but it's
3688 harmless since we'd add it here anyway. */
3689 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
3690 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3691 ics
= build_conv (ck_rvalue
, totype
, ics
);
3693 cand
->second_conv
= ics
;
3698 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -2,
3701 else if (DECL_NONCONVERTING_P (cand
->fn
)
3702 && ics
->rank
> cr_exact
)
3704 /* 13.3.1.5: For direct-initialization, those explicit
3705 conversion functions that are not hidden within S and
3706 yield type T or a type that can be converted to type T
3707 with a qualification conversion (4.4) are also candidate
3709 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3710 I've raised this issue with the committee. --jason 9/2011 */
3712 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
3714 else if (cand
->viable
== 1 && ics
->bad_p
)
3718 = bad_arg_conversion_rejection (NULL_TREE
, -2,
3721 else if (primary_template_instantiation_p (cand
->fn
)
3722 && ics
->rank
> cr_exact
)
3724 /* 13.3.3.1.2: If the user-defined conversion is specified by
3725 a specialization of a conversion function template, the
3726 second standard conversion sequence shall have exact match
3729 cand
->reason
= template_conversion_rejection (rettype
, totype
);
3734 candidates
= splice_viable (candidates
, false, &any_viable_p
);
3738 release_tree_vector (args
);
3742 cand
= tourney (candidates
, complain
);
3745 if (complain
& tf_error
)
3747 error ("conversion from %qT to %qT is ambiguous",
3749 print_z_candidates (location_of (expr
), candidates
);
3752 cand
= candidates
; /* any one will do */
3753 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
3754 cand
->second_conv
->user_conv_p
= true;
3755 if (!any_strictly_viable (candidates
))
3756 cand
->second_conv
->bad_p
= true;
3757 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3758 ambiguous conversion is no worse than another user-defined
3765 if (!DECL_CONSTRUCTOR_P (cand
->fn
))
3766 convtype
= non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)));
3767 else if (cand
->second_conv
->kind
== ck_rvalue
)
3768 /* DR 5: [in the first step of copy-initialization]...if the function
3769 is a constructor, the call initializes a temporary of the
3770 cv-unqualified version of the destination type. */
3771 convtype
= cv_unqualified (totype
);
3774 /* Build the user conversion sequence. */
3778 build_identity_conv (TREE_TYPE (expr
), expr
));
3780 if (cand
->viable
== -1)
3783 /* Remember that this was a list-initialization. */
3784 if (flags
& LOOKUP_NO_NARROWING
)
3785 conv
->check_narrowing
= true;
3787 /* Combine it with the second conversion sequence. */
3788 cand
->second_conv
= merge_conversion_sequences (conv
,
3794 /* Wrapper for above. */
3797 build_user_type_conversion (tree totype
, tree expr
, int flags
,
3798 tsubst_flags_t complain
)
3800 struct z_candidate
*cand
;
3803 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
3804 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
3808 if (cand
->second_conv
->kind
== ck_ambig
)
3809 ret
= error_mark_node
;
3812 expr
= convert_like (cand
->second_conv
, expr
, complain
);
3813 ret
= convert_from_reference (expr
);
3819 timevar_cond_stop (TV_OVERLOAD
, subtime
);
3823 /* Subroutine of convert_nontype_argument.
3825 EXPR is an argument for a template non-type parameter of integral or
3826 enumeration type. Do any necessary conversions (that are permitted for
3827 non-type arguments) to convert it to the parameter type.
3829 If conversion is successful, returns the converted expression;
3830 otherwise, returns error_mark_node. */
3833 build_integral_nontype_arg_conv (tree type
, tree expr
, tsubst_flags_t complain
)
3838 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
3840 if (error_operand_p (expr
))
3841 return error_mark_node
;
3843 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
3845 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3846 p
= conversion_obstack_alloc (0);
3848 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
3850 LOOKUP_IMPLICIT
, complain
);
3852 /* for a non-type template-parameter of integral or
3853 enumeration type, integral promotions (4.5) and integral
3854 conversions (4.7) are applied. */
3855 /* It should be sufficient to check the outermost conversion step, since
3856 there are no qualification conversions to integer type. */
3860 /* A conversion function is OK. If it isn't constexpr, we'll
3861 complain later that the argument isn't constant. */
3863 /* The lvalue-to-rvalue conversion is OK. */
3869 t
= next_conversion (conv
)->type
;
3870 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
))
3873 if (complain
& tf_error
)
3874 error_at (loc
, "conversion from %qT to %qT not considered for "
3875 "non-type template argument", t
, type
);
3876 /* and fall through. */
3884 expr
= convert_like (conv
, expr
, complain
);
3886 expr
= error_mark_node
;
3888 /* Free all the conversions we allocated. */
3889 obstack_free (&conversion_obstack
, p
);
3894 /* Do any initial processing on the arguments to a function call. */
3896 static vec
<tree
, va_gc
> *
3897 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
3902 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
3904 if (error_operand_p (arg
))
3906 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
3908 if (complain
& tf_error
)
3909 error ("invalid use of void expression");
3912 else if (invalid_nonstatic_memfn_p (input_location
, arg
, complain
))
3918 /* Perform overload resolution on FN, which is called with the ARGS.
3920 Return the candidate function selected by overload resolution, or
3921 NULL if the event that overload resolution failed. In the case
3922 that overload resolution fails, *CANDIDATES will be the set of
3923 candidates considered, and ANY_VIABLE_P will be set to true or
3924 false to indicate whether or not any of the candidates were
3927 The ARGS should already have gone through RESOLVE_ARGS before this
3928 function is called. */
3930 static struct z_candidate
*
3931 perform_overload_resolution (tree fn
,
3932 const vec
<tree
, va_gc
> *args
,
3933 struct z_candidate
**candidates
,
3934 bool *any_viable_p
, tsubst_flags_t complain
)
3936 struct z_candidate
*cand
;
3937 tree explicit_targs
;
3940 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
3942 explicit_targs
= NULL_TREE
;
3946 *any_viable_p
= true;
3949 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
3950 || TREE_CODE (fn
) == TEMPLATE_DECL
3951 || TREE_CODE (fn
) == OVERLOAD
3952 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
3954 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3956 explicit_targs
= TREE_OPERAND (fn
, 1);
3957 fn
= TREE_OPERAND (fn
, 0);
3961 /* Add the various candidate functions. */
3962 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
3963 explicit_targs
, template_only
,
3964 /*conversion_path=*/NULL_TREE
,
3965 /*access_path=*/NULL_TREE
,
3967 candidates
, complain
);
3969 *candidates
= splice_viable (*candidates
, false, any_viable_p
);
3971 cand
= tourney (*candidates
, complain
);
3975 timevar_cond_stop (TV_OVERLOAD
, subtime
);
3979 /* Print an error message about being unable to build a call to FN with
3980 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
3981 be located; CANDIDATES is a possibly empty list of such
3985 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
,
3986 struct z_candidate
*candidates
)
3988 tree name
= DECL_NAME (OVL_CURRENT (fn
));
3989 location_t loc
= location_of (name
);
3991 if (!any_strictly_viable (candidates
))
3992 error_at (loc
, "no matching function for call to %<%D(%A)%>",
3993 name
, build_tree_list_vec (args
));
3995 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
3996 name
, build_tree_list_vec (args
));
3998 print_z_candidates (loc
, candidates
);
4001 /* Return an expression for a call to FN (a namespace-scope function,
4002 or a static member function) with the ARGS. This may change
4006 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
, bool koenig_p
,
4007 tsubst_flags_t complain
)
4009 struct z_candidate
*candidates
, *cand
;
4014 if (args
!= NULL
&& *args
!= NULL
)
4016 *args
= resolve_args (*args
, complain
);
4018 return error_mark_node
;
4022 tm_malloc_replacement (fn
);
4024 /* If this function was found without using argument dependent
4025 lookup, then we want to ignore any undeclared friend
4031 fn
= remove_hidden_names (fn
);
4034 if (complain
& tf_error
)
4035 print_error_for_call_failure (orig_fn
, *args
, NULL
);
4036 return error_mark_node
;
4040 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4041 p
= conversion_obstack_alloc (0);
4043 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
4048 if (complain
& tf_error
)
4050 if (!any_viable_p
&& candidates
&& ! candidates
->next
4051 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
4052 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
4053 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4054 fn
= TREE_OPERAND (fn
, 0);
4055 print_error_for_call_failure (fn
, *args
, candidates
);
4057 result
= error_mark_node
;
4061 int flags
= LOOKUP_NORMAL
;
4062 /* If fn is template_id_expr, the call has explicit template arguments
4063 (e.g. func<int>(5)), communicate this info to build_over_call
4064 through flags so that later we can use it to decide whether to warn
4065 about peculiar null pointer conversion. */
4066 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4067 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4068 result
= build_over_call (cand
, flags
, complain
);
4071 /* Free all the conversions we allocated. */
4072 obstack_free (&conversion_obstack
, p
);
4077 /* Build a call to a global operator new. FNNAME is the name of the
4078 operator (either "operator new" or "operator new[]") and ARGS are
4079 the arguments provided. This may change ARGS. *SIZE points to the
4080 total number of bytes required by the allocation, and is updated if
4081 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4082 be used. If this function determines that no cookie should be
4083 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4084 is not NULL_TREE, it is evaluated before calculating the final
4085 array size, and if it fails, the array size is replaced with
4086 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4087 is non-NULL, it will be set, upon return, to the allocation
4091 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4092 tree
*size
, tree
*cookie_size
, tree size_check
,
4093 tree
*fn
, tsubst_flags_t complain
)
4095 tree original_size
= *size
;
4097 struct z_candidate
*candidates
;
4098 struct z_candidate
*cand
;
4103 /* Set to (size_t)-1 if the size check fails. */
4104 if (size_check
!= NULL_TREE
)
4106 tree errval
= TYPE_MAX_VALUE (sizetype
);
4107 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4108 errval
= throw_bad_array_new_length ();
4109 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4110 original_size
, errval
);
4112 vec_safe_insert (*args
, 0, *size
);
4113 *args
= resolve_args (*args
, complain
);
4115 return error_mark_node
;
4121 If this lookup fails to find the name, or if the allocated type
4122 is not a class type, the allocation function's name is looked
4123 up in the global scope.
4125 we disregard block-scope declarations of "operator new". */
4126 fns
= lookup_function_nonclass (fnname
, *args
, /*block_p=*/false);
4128 /* Figure out what function is being called. */
4129 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
4132 /* If no suitable function could be found, issue an error message
4136 if (complain
& tf_error
)
4137 print_error_for_call_failure (fns
, *args
, candidates
);
4138 return error_mark_node
;
4141 /* If a cookie is required, add some extra space. Whether
4142 or not a cookie is required cannot be determined until
4143 after we know which function was called. */
4146 bool use_cookie
= true;
4149 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4150 /* Skip the size_t parameter. */
4151 arg_types
= TREE_CHAIN (arg_types
);
4152 /* Check the remaining parameters (if any). */
4154 && TREE_CHAIN (arg_types
) == void_list_node
4155 && same_type_p (TREE_VALUE (arg_types
),
4158 /* If we need a cookie, adjust the number of bytes allocated. */
4161 /* Update the total size. */
4162 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4163 /* Set to (size_t)-1 if the size check fails. */
4164 gcc_assert (size_check
!= NULL_TREE
);
4165 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4166 *size
, TYPE_MAX_VALUE (sizetype
));
4167 /* Update the argument list to reflect the adjusted size. */
4168 (**args
)[0] = *size
;
4171 *cookie_size
= NULL_TREE
;
4174 /* Tell our caller which function we decided to call. */
4178 /* Build the CALL_EXPR. */
4179 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4182 /* Build a new call to operator(). This may change ARGS. */
4185 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4187 struct z_candidate
*candidates
= 0, *cand
;
4188 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4189 tree type
= TREE_TYPE (obj
);
4191 tree result
= NULL_TREE
;
4194 if (error_operand_p (obj
))
4195 return error_mark_node
;
4197 obj
= prep_operand (obj
);
4199 if (TYPE_PTRMEMFUNC_P (type
))
4201 if (complain
& tf_error
)
4202 /* It's no good looking for an overloaded operator() on a
4203 pointer-to-member-function. */
4204 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj
);
4205 return error_mark_node
;
4208 if (TYPE_BINFO (type
))
4210 fns
= lookup_fnfields (TYPE_BINFO (type
), ansi_opname (CALL_EXPR
), 1);
4211 if (fns
== error_mark_node
)
4212 return error_mark_node
;
4217 if (args
!= NULL
&& *args
!= NULL
)
4219 *args
= resolve_args (*args
, complain
);
4221 return error_mark_node
;
4224 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4225 p
= conversion_obstack_alloc (0);
4229 first_mem_arg
= obj
;
4231 add_candidates (BASELINK_FUNCTIONS (fns
),
4232 first_mem_arg
, *args
, NULL_TREE
,
4234 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4235 LOOKUP_NORMAL
, &candidates
, complain
);
4238 convs
= lookup_conversions (type
);
4240 for (; convs
; convs
= TREE_CHAIN (convs
))
4242 tree fns
= TREE_VALUE (convs
);
4243 tree totype
= TREE_TYPE (convs
);
4245 if (TYPE_PTRFN_P (totype
)
4246 || TYPE_REFFN_P (totype
)
4247 || (TREE_CODE (totype
) == REFERENCE_TYPE
4248 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4249 for (; fns
; fns
= OVL_NEXT (fns
))
4251 tree fn
= OVL_CURRENT (fns
);
4253 if (DECL_NONCONVERTING_P (fn
))
4256 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4257 add_template_conv_candidate
4258 (&candidates
, fn
, obj
, NULL_TREE
, *args
, totype
,
4259 /*access_path=*/NULL_TREE
,
4260 /*conversion_path=*/NULL_TREE
, complain
);
4262 add_conv_candidate (&candidates
, fn
, obj
, NULL_TREE
,
4263 *args
, /*conversion_path=*/NULL_TREE
,
4264 /*access_path=*/NULL_TREE
, complain
);
4268 /* Be strict here because if we choose a bad conversion candidate, the
4269 errors we get won't mention the call context. */
4270 candidates
= splice_viable (candidates
, true, &any_viable_p
);
4273 if (complain
& tf_error
)
4275 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4276 build_tree_list_vec (*args
));
4277 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4279 result
= error_mark_node
;
4283 cand
= tourney (candidates
, complain
);
4286 if (complain
& tf_error
)
4288 error ("call of %<(%T) (%A)%> is ambiguous",
4289 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4290 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4292 result
= error_mark_node
;
4294 /* Since cand->fn will be a type, not a function, for a conversion
4295 function, we must be careful not to unconditionally look at
4297 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4298 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
) == CALL_EXPR
)
4299 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4302 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
, -1,
4304 obj
= convert_from_reference (obj
);
4305 result
= cp_build_function_call_vec (obj
, args
, complain
);
4309 /* Free all the conversions we allocated. */
4310 obstack_free (&conversion_obstack
, p
);
4315 /* Wrapper for above. */
4318 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4321 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4322 ret
= build_op_call_1 (obj
, args
, complain
);
4323 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4327 /* Called by op_error to prepare format strings suitable for the error
4328 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4329 and a suffix (controlled by NTYPES). */
4332 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4336 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4337 : G_("no match for "), errmsg
, NULL
);
4340 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4341 else if (ntypes
== 2)
4342 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4344 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4350 op_error (location_t loc
, enum tree_code code
, enum tree_code code2
,
4351 tree arg1
, tree arg2
, tree arg3
, bool match
)
4355 if (code
== MODIFY_EXPR
)
4356 opname
= assignment_operator_name_info
[code2
].name
;
4358 opname
= operator_name_info
[code
].name
;
4363 if (flag_diagnostics_show_caret
)
4364 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4366 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4368 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4369 "in %<%E ? %E : %E%>"), 3, match
),
4371 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4374 case POSTINCREMENT_EXPR
:
4375 case POSTDECREMENT_EXPR
:
4376 if (flag_diagnostics_show_caret
)
4377 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4378 opname
, TREE_TYPE (arg1
));
4380 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4382 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4386 if (flag_diagnostics_show_caret
)
4387 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4388 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4390 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4392 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4397 if (flag_diagnostics_show_caret
)
4398 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4399 opname
, TREE_TYPE (arg1
));
4401 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4402 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4407 if (flag_diagnostics_show_caret
)
4408 error_at (loc
, op_error_string (G_("%<operator%s%>"), 2, match
),
4409 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4411 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4413 opname
, arg1
, opname
, arg2
,
4414 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4416 if (flag_diagnostics_show_caret
)
4417 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4418 opname
, TREE_TYPE (arg1
));
4420 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4422 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4427 /* Return the implicit conversion sequence that could be used to
4428 convert E1 to E2 in [expr.cond]. */
4431 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4433 tree t1
= non_reference (TREE_TYPE (e1
));
4434 tree t2
= non_reference (TREE_TYPE (e2
));
4440 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4441 implicitly converted (clause _conv_) to the type "lvalue reference to
4442 T2", subject to the constraint that in the conversion the
4443 reference must bind directly (_dcl.init.ref_) to an lvalue.
4445 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4446 implicitly converted to the type "rvalue reference to T2", subject to
4447 the constraint that the reference must bind directly. */
4448 if (lvalue_or_rvalue_with_address_p (e2
))
4450 tree rtype
= cp_build_reference_type (t2
, !real_lvalue_p (e2
));
4451 conv
= implicit_conversion (rtype
,
4455 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4456 |LOOKUP_ONLYCONVERTING
,
4458 if (conv
&& !conv
->bad_p
)
4462 /* If E2 is a prvalue or if neither of the conversions above can be done
4463 and at least one of the operands has (possibly cv-qualified) class
4465 if (!CLASS_TYPE_P (t1
) && !CLASS_TYPE_P (t2
))
4470 If E1 and E2 have class type, and the underlying class types are
4471 the same or one is a base class of the other: E1 can be converted
4472 to match E2 if the class of T2 is the same type as, or a base
4473 class of, the class of T1, and the cv-qualification of T2 is the
4474 same cv-qualification as, or a greater cv-qualification than, the
4475 cv-qualification of T1. If the conversion is applied, E1 is
4476 changed to an rvalue of type T2 that still refers to the original
4477 source class object (or the appropriate subobject thereof). */
4478 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4479 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4481 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4483 conv
= build_identity_conv (t1
, e1
);
4484 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4485 TYPE_MAIN_VARIANT (t2
)))
4486 conv
= build_conv (ck_base
, t2
, conv
);
4488 conv
= build_conv (ck_rvalue
, t2
, conv
);
4497 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4498 converted to the type that expression E2 would have if E2 were
4499 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4500 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4501 LOOKUP_IMPLICIT
, complain
);
4504 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4505 arguments to the conditional expression. */
4508 build_conditional_expr_1 (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
4509 tsubst_flags_t complain
)
4513 tree result
= NULL_TREE
;
4514 tree result_type
= NULL_TREE
;
4515 bool lvalue_p
= true;
4516 struct z_candidate
*candidates
= 0;
4517 struct z_candidate
*cand
;
4519 tree orig_arg2
, orig_arg3
;
4521 /* As a G++ extension, the second argument to the conditional can be
4522 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4523 c'.) If the second operand is omitted, make sure it is
4524 calculated only once. */
4527 if (complain
& tf_error
)
4528 pedwarn (loc
, OPT_Wpedantic
,
4529 "ISO C++ forbids omitting the middle term of a ?: expression");
4531 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4532 if (real_lvalue_p (arg1
))
4533 arg2
= arg1
= stabilize_reference (arg1
);
4535 arg2
= arg1
= save_expr (arg1
);
4538 /* If something has already gone wrong, just pass that fact up the
4540 if (error_operand_p (arg1
)
4541 || error_operand_p (arg2
)
4542 || error_operand_p (arg3
))
4543 return error_mark_node
;
4548 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
4550 arg1
= force_rvalue (arg1
, complain
);
4551 arg2
= force_rvalue (arg2
, complain
);
4552 arg3
= force_rvalue (arg3
, complain
);
4554 /* force_rvalue can return error_mark on valid arguments. */
4555 if (error_operand_p (arg1
)
4556 || error_operand_p (arg2
)
4557 || error_operand_p (arg3
))
4558 return error_mark_node
;
4560 tree arg1_type
= TREE_TYPE (arg1
);
4561 arg2_type
= TREE_TYPE (arg2
);
4562 arg3_type
= TREE_TYPE (arg3
);
4564 if (TREE_CODE (arg2_type
) != VECTOR_TYPE
4565 && TREE_CODE (arg3_type
) != VECTOR_TYPE
)
4567 /* Rely on the error messages of the scalar version. */
4568 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
4569 orig_arg2
, orig_arg3
, complain
);
4570 if (scal
== error_mark_node
)
4571 return error_mark_node
;
4572 tree stype
= TREE_TYPE (scal
);
4573 tree ctype
= TREE_TYPE (arg1_type
);
4574 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
4575 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
4577 if (complain
& tf_error
)
4578 error_at (loc
, "inferred scalar type %qT is not an integer or "
4579 "floating point type of the same size as %qT", stype
,
4580 COMPARISON_CLASS_P (arg1
)
4581 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
4583 return error_mark_node
;
4586 tree vtype
= build_opaque_vector_type (stype
,
4587 TYPE_VECTOR_SUBPARTS (arg1_type
));
4588 /* We could pass complain & tf_warning to unsafe_conversion_p,
4589 but the warnings (like Wsign-conversion) have already been
4590 given by the scalar build_conditional_expr_1. We still check
4591 unsafe_conversion_p to forbid truncating long long -> float. */
4592 if (unsafe_conversion_p (loc
, stype
, arg2
, false))
4594 if (complain
& tf_error
)
4595 error_at (loc
, "conversion of scalar %qT to vector %qT "
4596 "involves truncation", arg2_type
, vtype
);
4597 return error_mark_node
;
4599 if (unsafe_conversion_p (loc
, stype
, arg3
, false))
4601 if (complain
& tf_error
)
4602 error_at (loc
, "conversion of scalar %qT to vector %qT "
4603 "involves truncation", arg3_type
, vtype
);
4604 return error_mark_node
;
4607 arg2
= cp_convert (stype
, arg2
, complain
);
4608 arg2
= save_expr (arg2
);
4609 arg2
= build_vector_from_val (vtype
, arg2
);
4611 arg3
= cp_convert (stype
, arg3
, complain
);
4612 arg3
= save_expr (arg3
);
4613 arg3
= build_vector_from_val (vtype
, arg3
);
4617 if ((TREE_CODE (arg2_type
) == VECTOR_TYPE
)
4618 != (TREE_CODE (arg3_type
) == VECTOR_TYPE
))
4620 enum stv_conv convert_flag
=
4621 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
4622 complain
& tf_error
);
4624 switch (convert_flag
)
4627 return error_mark_node
;
4630 arg2
= save_expr (arg2
);
4631 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
4632 arg2
= build_vector_from_val (arg3_type
, arg2
);
4633 arg2_type
= TREE_TYPE (arg2
);
4638 arg3
= save_expr (arg3
);
4639 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
4640 arg3
= build_vector_from_val (arg2_type
, arg3
);
4641 arg3_type
= TREE_TYPE (arg3
);
4649 if (!same_type_p (arg2_type
, arg3_type
)
4650 || TYPE_VECTOR_SUBPARTS (arg1_type
)
4651 != TYPE_VECTOR_SUBPARTS (arg2_type
)
4652 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
4654 if (complain
& tf_error
)
4656 "incompatible vector types in conditional expression: "
4657 "%qT, %qT and %qT", TREE_TYPE (arg1
),
4658 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
4659 return error_mark_node
;
4662 if (!COMPARISON_CLASS_P (arg1
))
4663 arg1
= cp_build_binary_op (loc
, NE_EXPR
, arg1
,
4664 build_zero_cst (arg1_type
), complain
);
4665 return fold_build3 (VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
4670 The first expression is implicitly converted to bool (clause
4672 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
4674 if (error_operand_p (arg1
))
4675 return error_mark_node
;
4679 If either the second or the third operand has type (possibly
4680 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4681 array-to-pointer (_conv.array_), and function-to-pointer
4682 (_conv.func_) standard conversions are performed on the second
4683 and third operands. */
4684 arg2_type
= unlowered_expr_type (arg2
);
4685 arg3_type
= unlowered_expr_type (arg3
);
4686 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
4688 /* Do the conversions. We don't these for `void' type arguments
4689 since it can't have any effect and since decay_conversion
4690 does not handle that case gracefully. */
4691 if (!VOID_TYPE_P (arg2_type
))
4692 arg2
= decay_conversion (arg2
, complain
);
4693 if (!VOID_TYPE_P (arg3_type
))
4694 arg3
= decay_conversion (arg3
, complain
);
4695 arg2_type
= TREE_TYPE (arg2
);
4696 arg3_type
= TREE_TYPE (arg3
);
4700 One of the following shall hold:
4702 --The second or the third operand (but not both) is a
4703 throw-expression (_except.throw_); the result is of the
4704 type of the other and is an rvalue.
4706 --Both the second and the third operands have type void; the
4707 result is of type void and is an rvalue.
4709 We must avoid calling force_rvalue for expressions of type
4710 "void" because it will complain that their value is being
4712 if (TREE_CODE (arg2
) == THROW_EXPR
4713 && TREE_CODE (arg3
) != THROW_EXPR
)
4715 if (!VOID_TYPE_P (arg3_type
))
4717 arg3
= force_rvalue (arg3
, complain
);
4718 if (arg3
== error_mark_node
)
4719 return error_mark_node
;
4721 arg3_type
= TREE_TYPE (arg3
);
4722 result_type
= arg3_type
;
4724 else if (TREE_CODE (arg2
) != THROW_EXPR
4725 && TREE_CODE (arg3
) == THROW_EXPR
)
4727 if (!VOID_TYPE_P (arg2_type
))
4729 arg2
= force_rvalue (arg2
, complain
);
4730 if (arg2
== error_mark_node
)
4731 return error_mark_node
;
4733 arg2_type
= TREE_TYPE (arg2
);
4734 result_type
= arg2_type
;
4736 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
4737 result_type
= void_type_node
;
4740 if (complain
& tf_error
)
4742 if (VOID_TYPE_P (arg2_type
))
4743 error_at (EXPR_LOC_OR_LOC (arg3
, loc
),
4744 "second operand to the conditional operator "
4745 "is of type %<void%>, but the third operand is "
4746 "neither a throw-expression nor of type %<void%>");
4748 error_at (EXPR_LOC_OR_LOC (arg2
, loc
),
4749 "third operand to the conditional operator "
4750 "is of type %<void%>, but the second operand is "
4751 "neither a throw-expression nor of type %<void%>");
4753 return error_mark_node
;
4757 goto valid_operands
;
4761 Otherwise, if the second and third operand have different types,
4762 and either has (possibly cv-qualified) class type, or if both are
4763 glvalues of the same value category and the same type except for
4764 cv-qualification, an attempt is made to convert each of those operands
4765 to the type of the other. */
4766 else if (!same_type_p (arg2_type
, arg3_type
)
4767 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)
4768 || (same_type_ignoring_top_level_qualifiers_p (arg2_type
,
4770 && lvalue_or_rvalue_with_address_p (arg2
)
4771 && lvalue_or_rvalue_with_address_p (arg3
)
4772 && real_lvalue_p (arg2
) == real_lvalue_p (arg3
))))
4776 bool converted
= false;
4778 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4779 p
= conversion_obstack_alloc (0);
4781 conv2
= conditional_conversion (arg2
, arg3
, complain
);
4782 conv3
= conditional_conversion (arg3
, arg2
, complain
);
4786 If both can be converted, or one can be converted but the
4787 conversion is ambiguous, the program is ill-formed. If
4788 neither can be converted, the operands are left unchanged and
4789 further checking is performed as described below. If exactly
4790 one conversion is possible, that conversion is applied to the
4791 chosen operand and the converted operand is used in place of
4792 the original operand for the remainder of this section. */
4793 if ((conv2
&& !conv2
->bad_p
4794 && conv3
&& !conv3
->bad_p
)
4795 || (conv2
&& conv2
->kind
== ck_ambig
)
4796 || (conv3
&& conv3
->kind
== ck_ambig
))
4798 if (complain
& tf_error
)
4800 error_at (loc
, "operands to ?: have different types %qT and %qT",
4801 arg2_type
, arg3_type
);
4802 if (conv2
&& !conv2
->bad_p
&& conv3
&& !conv3
->bad_p
)
4803 inform (loc
, " and each type can be converted to the other");
4804 else if (conv2
&& conv2
->kind
== ck_ambig
)
4805 convert_like (conv2
, arg2
, complain
);
4807 convert_like (conv3
, arg3
, complain
);
4809 result
= error_mark_node
;
4811 else if (conv2
&& !conv2
->bad_p
)
4813 arg2
= convert_like (conv2
, arg2
, complain
);
4814 arg2
= convert_from_reference (arg2
);
4815 arg2_type
= TREE_TYPE (arg2
);
4816 /* Even if CONV2 is a valid conversion, the result of the
4817 conversion may be invalid. For example, if ARG3 has type
4818 "volatile X", and X does not have a copy constructor
4819 accepting a "volatile X&", then even if ARG2 can be
4820 converted to X, the conversion will fail. */
4821 if (error_operand_p (arg2
))
4822 result
= error_mark_node
;
4825 else if (conv3
&& !conv3
->bad_p
)
4827 arg3
= convert_like (conv3
, arg3
, complain
);
4828 arg3
= convert_from_reference (arg3
);
4829 arg3_type
= TREE_TYPE (arg3
);
4830 if (error_operand_p (arg3
))
4831 result
= error_mark_node
;
4835 /* Free all the conversions we allocated. */
4836 obstack_free (&conversion_obstack
, p
);
4841 /* If, after the conversion, both operands have class type,
4842 treat the cv-qualification of both operands as if it were the
4843 union of the cv-qualification of the operands.
4845 The standard is not clear about what to do in this
4846 circumstance. For example, if the first operand has type
4847 "const X" and the second operand has a user-defined
4848 conversion to "volatile X", what is the type of the second
4849 operand after this step? Making it be "const X" (matching
4850 the first operand) seems wrong, as that discards the
4851 qualification without actually performing a copy. Leaving it
4852 as "volatile X" seems wrong as that will result in the
4853 conditional expression failing altogether, even though,
4854 according to this step, the one operand could be converted to
4855 the type of the other. */
4857 && CLASS_TYPE_P (arg2_type
)
4858 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
4859 arg2_type
= arg3_type
=
4860 cp_build_qualified_type (arg2_type
,
4861 cp_type_quals (arg2_type
)
4862 | cp_type_quals (arg3_type
));
4867 If the second and third operands are glvalues of the same value
4868 category and have the same type, the result is of that type and
4870 if (((real_lvalue_p (arg2
) && real_lvalue_p (arg3
))
4871 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
4872 && same_type_p (arg2_type
, arg3_type
))
4874 result_type
= arg2_type
;
4875 arg2
= mark_lvalue_use (arg2
);
4876 arg3
= mark_lvalue_use (arg3
);
4877 goto valid_operands
;
4882 Otherwise, the result is an rvalue. If the second and third
4883 operand do not have the same type, and either has (possibly
4884 cv-qualified) class type, overload resolution is used to
4885 determine the conversions (if any) to be applied to the operands
4886 (_over.match.oper_, _over.built_). */
4888 if (!same_type_p (arg2_type
, arg3_type
)
4889 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
4895 /* Rearrange the arguments so that add_builtin_candidate only has
4896 to know about two args. In build_builtin_candidate, the
4897 arguments are unscrambled. */
4901 add_builtin_candidates (&candidates
,
4904 ansi_opname (COND_EXPR
),
4906 LOOKUP_NORMAL
, complain
);
4910 If the overload resolution fails, the program is
4912 candidates
= splice_viable (candidates
, false, &any_viable_p
);
4915 if (complain
& tf_error
)
4916 error_at (loc
, "operands to ?: have different types %qT and %qT",
4917 arg2_type
, arg3_type
);
4918 return error_mark_node
;
4920 cand
= tourney (candidates
, complain
);
4923 if (complain
& tf_error
)
4925 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
4926 print_z_candidates (loc
, candidates
);
4928 return error_mark_node
;
4933 Otherwise, the conversions thus determined are applied, and
4934 the converted operands are used in place of the original
4935 operands for the remainder of this section. */
4936 conv
= cand
->convs
[0];
4937 arg1
= convert_like (conv
, arg1
, complain
);
4938 conv
= cand
->convs
[1];
4939 arg2
= convert_like (conv
, arg2
, complain
);
4940 arg2_type
= TREE_TYPE (arg2
);
4941 conv
= cand
->convs
[2];
4942 arg3
= convert_like (conv
, arg3
, complain
);
4943 arg3_type
= TREE_TYPE (arg3
);
4948 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
4949 and function-to-pointer (_conv.func_) standard conversions are
4950 performed on the second and third operands.
4952 We need to force the lvalue-to-rvalue conversion here for class types,
4953 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
4954 that isn't wrapped with a TARGET_EXPR plays havoc with exception
4957 arg2
= force_rvalue (arg2
, complain
);
4958 if (!CLASS_TYPE_P (arg2_type
))
4959 arg2_type
= TREE_TYPE (arg2
);
4961 arg3
= force_rvalue (arg3
, complain
);
4962 if (!CLASS_TYPE_P (arg3_type
))
4963 arg3_type
= TREE_TYPE (arg3
);
4965 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
4966 return error_mark_node
;
4970 After those conversions, one of the following shall hold:
4972 --The second and third operands have the same type; the result is of
4974 if (same_type_p (arg2_type
, arg3_type
))
4975 result_type
= arg2_type
;
4978 --The second and third operands have arithmetic or enumeration
4979 type; the usual arithmetic conversions are performed to bring
4980 them to a common type, and the result is of that type. */
4981 else if ((ARITHMETIC_TYPE_P (arg2_type
)
4982 || UNSCOPED_ENUM_P (arg2_type
))
4983 && (ARITHMETIC_TYPE_P (arg3_type
)
4984 || UNSCOPED_ENUM_P (arg3_type
)))
4986 /* In this case, there is always a common type. */
4987 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
4989 if (complain
& tf_warning
)
4990 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
4991 "implicit conversion from %qT to %qT to "
4992 "match other result of conditional",
4995 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
4996 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
4998 if (TREE_CODE (orig_arg2
) == CONST_DECL
4999 && TREE_CODE (orig_arg3
) == CONST_DECL
5000 && DECL_CONTEXT (orig_arg2
) == DECL_CONTEXT (orig_arg3
))
5001 /* Two enumerators from the same enumeration can have different
5002 types when the enumeration is still being defined. */;
5003 else if (complain
& tf_warning
)
5004 warning_at (loc
, OPT_Wenum_compare
, "enumeral mismatch in "
5005 "conditional expression: %qT vs %qT",
5006 arg2_type
, arg3_type
);
5008 else if (extra_warnings
5009 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5010 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
5011 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
5012 && !same_type_p (arg2_type
,
5013 type_promotes_to (arg3_type
)))))
5015 if (complain
& tf_warning
)
5016 warning_at (loc
, OPT_Wextra
, "enumeral and non-enumeral type in "
5017 "conditional expression");
5020 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5021 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5025 --The second and third operands have pointer type, or one has
5026 pointer type and the other is a null pointer constant; pointer
5027 conversions (_conv.ptr_) and qualification conversions
5028 (_conv.qual_) are performed to bring them to their composite
5029 pointer type (_expr.rel_). The result is of the composite
5032 --The second and third operands have pointer to member type, or
5033 one has pointer to member type and the other is a null pointer
5034 constant; pointer to member conversions (_conv.mem_) and
5035 qualification conversions (_conv.qual_) are performed to bring
5036 them to a common type, whose cv-qualification shall match the
5037 cv-qualification of either the second or the third operand.
5038 The result is of the common type. */
5039 else if ((null_ptr_cst_p (arg2
)
5040 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
5041 || (null_ptr_cst_p (arg3
)
5042 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
5043 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
5044 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
5045 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
5047 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
5048 arg3
, CPO_CONDITIONAL_EXPR
,
5050 if (result_type
== error_mark_node
)
5051 return error_mark_node
;
5052 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5053 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5058 if (complain
& tf_error
)
5059 error_at (loc
, "operands to ?: have different types %qT and %qT",
5060 arg2_type
, arg3_type
);
5061 return error_mark_node
;
5064 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5065 return error_mark_node
;
5068 result
= build3 (COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
5069 if (!cp_unevaluated_operand
)
5070 /* Avoid folding within decltype (c++/42013) and noexcept. */
5071 result
= fold_if_not_in_template (result
);
5073 /* We can't use result_type below, as fold might have returned a
5078 /* Expand both sides into the same slot, hopefully the target of
5079 the ?: expression. We used to check for TARGET_EXPRs here,
5080 but now we sometimes wrap them in NOP_EXPRs so the test would
5082 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5083 result
= get_target_expr_sfinae (result
, complain
);
5084 /* If this expression is an rvalue, but might be mistaken for an
5085 lvalue, we must add a NON_LVALUE_EXPR. */
5086 result
= rvalue (result
);
5089 result
= force_paren_expr (result
);
5094 /* Wrapper for above. */
5097 build_conditional_expr (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
5098 tsubst_flags_t complain
)
5101 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5102 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5103 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5107 /* OPERAND is an operand to an expression. Perform necessary steps
5108 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5112 prep_operand (tree operand
)
5116 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5117 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5118 /* Make sure the template type is instantiated now. */
5119 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5125 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5126 OVERLOAD) to the CANDIDATES, returning an updated list of
5127 CANDIDATES. The ARGS are the arguments provided to the call;
5128 if FIRST_ARG is non-null it is the implicit object argument,
5129 otherwise the first element of ARGS is used if needed. The
5130 EXPLICIT_TARGS are explicit template arguments provided.
5131 TEMPLATE_ONLY is true if only template functions should be
5132 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5133 add_function_candidate. */
5136 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5138 tree explicit_targs
, bool template_only
,
5139 tree conversion_path
, tree access_path
,
5141 struct z_candidate
**candidates
,
5142 tsubst_flags_t complain
)
5145 const vec
<tree
, va_gc
> *non_static_args
;
5146 bool check_list_ctor
;
5147 bool check_converting
;
5148 unification_kind_t strict
;
5154 /* Precalculate special handling of constructors and conversion ops. */
5155 fn
= OVL_CURRENT (fns
);
5156 if (DECL_CONV_FN_P (fn
))
5158 check_list_ctor
= false;
5159 check_converting
= !!(flags
& LOOKUP_ONLYCONVERTING
);
5160 if (flags
& LOOKUP_NO_CONVERSION
)
5161 /* We're doing return_type(x). */
5162 strict
= DEDUCE_CONV
;
5164 /* We're doing x.operator return_type(). */
5165 strict
= DEDUCE_EXACT
;
5166 /* [over.match.funcs] For conversion functions, the function
5167 is considered to be a member of the class of the implicit
5168 object argument for the purpose of defining the type of
5169 the implicit object parameter. */
5170 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5174 if (DECL_CONSTRUCTOR_P (fn
))
5176 check_list_ctor
= !!(flags
& LOOKUP_LIST_ONLY
);
5177 /* For list-initialization we consider explicit constructors
5178 and complain if one is chosen. */
5180 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5181 == LOOKUP_ONLYCONVERTING
);
5185 check_list_ctor
= false;
5186 check_converting
= false;
5188 strict
= DEDUCE_CALL
;
5189 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5193 non_static_args
= args
;
5195 /* Delay creating the implicit this parameter until it is needed. */
5196 non_static_args
= NULL
;
5198 for (; fns
; fns
= OVL_NEXT (fns
))
5201 const vec
<tree
, va_gc
> *fn_args
;
5203 fn
= OVL_CURRENT (fns
);
5205 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5207 if (check_list_ctor
&& !is_list_ctor (fn
))
5210 /* Figure out which set of arguments to use. */
5211 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5213 /* If this function is a non-static member and we didn't get an
5214 implicit object argument, move it out of args. */
5215 if (first_arg
== NULL_TREE
)
5219 vec
<tree
, va_gc
> *tempvec
;
5220 vec_alloc (tempvec
, args
->length () - 1);
5221 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5222 tempvec
->quick_push (arg
);
5223 non_static_args
= tempvec
;
5224 first_arg
= (*args
)[0];
5227 fn_first_arg
= first_arg
;
5228 fn_args
= non_static_args
;
5232 /* Otherwise, just use the list of arguments provided. */
5233 fn_first_arg
= NULL_TREE
;
5237 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5238 add_template_candidate (candidates
,
5250 else if (!template_only
)
5251 add_function_candidate (candidates
,
5264 build_new_op_1 (location_t loc
, enum tree_code code
, int flags
, tree arg1
,
5265 tree arg2
, tree arg3
, tree
*overload
, tsubst_flags_t complain
)
5267 struct z_candidate
*candidates
= 0, *cand
;
5268 vec
<tree
, va_gc
> *arglist
;
5271 tree result
= NULL_TREE
;
5272 bool result_valid_p
= false;
5273 enum tree_code code2
= NOP_EXPR
;
5274 enum tree_code code_orig_arg1
= ERROR_MARK
;
5275 enum tree_code code_orig_arg2
= ERROR_MARK
;
5281 if (error_operand_p (arg1
)
5282 || error_operand_p (arg2
)
5283 || error_operand_p (arg3
))
5284 return error_mark_node
;
5286 if (code
== MODIFY_EXPR
)
5288 code2
= TREE_CODE (arg3
);
5290 fnname
= ansi_assopname (code2
);
5293 fnname
= ansi_opname (code
);
5295 arg1
= prep_operand (arg1
);
5297 bool memonly
= false;
5302 case VEC_DELETE_EXPR
:
5304 /* Use build_op_new_call and build_op_delete_call instead. */
5308 /* Use build_op_call instead. */
5311 case TRUTH_ORIF_EXPR
:
5312 case TRUTH_ANDIF_EXPR
:
5313 case TRUTH_AND_EXPR
:
5315 /* These are saved for the sake of warn_logical_operator. */
5316 code_orig_arg1
= TREE_CODE (arg1
);
5317 code_orig_arg2
= TREE_CODE (arg2
);
5325 /* These are saved for the sake of maybe_warn_bool_compare. */
5326 code_orig_arg1
= TREE_CODE (TREE_TYPE (arg1
));
5327 code_orig_arg2
= TREE_CODE (TREE_TYPE (arg2
));
5330 /* =, ->, [], () must be non-static member functions. */
5332 if (code2
!= NOP_EXPR
)
5343 arg2
= prep_operand (arg2
);
5344 arg3
= prep_operand (arg3
);
5346 if (code
== COND_EXPR
)
5347 /* Use build_conditional_expr instead. */
5349 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5350 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5353 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5354 arg2
= integer_zero_node
;
5356 vec_alloc (arglist
, 3);
5357 arglist
->quick_push (arg1
);
5358 if (arg2
!= NULL_TREE
)
5359 arglist
->quick_push (arg2
);
5360 if (arg3
!= NULL_TREE
)
5361 arglist
->quick_push (arg3
);
5363 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5364 p
= conversion_obstack_alloc (0);
5366 /* Add namespace-scope operators to the list of functions to
5369 add_candidates (lookup_function_nonclass (fnname
, arglist
,
5371 NULL_TREE
, arglist
, NULL_TREE
,
5372 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5373 flags
, &candidates
, complain
);
5377 args
[2] = NULL_TREE
;
5379 /* Add class-member operators to the candidate set. */
5380 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5384 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5385 if (fns
== error_mark_node
)
5387 result
= error_mark_node
;
5388 goto user_defined_result_ready
;
5391 add_candidates (BASELINK_FUNCTIONS (fns
),
5392 NULL_TREE
, arglist
, NULL_TREE
,
5394 BASELINK_BINFO (fns
),
5395 BASELINK_ACCESS_BINFO (fns
),
5396 flags
, &candidates
, complain
);
5398 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5399 only non-member functions that have type T1 or reference to
5400 cv-qualified-opt T1 for the first argument, if the first argument
5401 has an enumeration type, or T2 or reference to cv-qualified-opt
5402 T2 for the second argument, if the the second argument has an
5403 enumeration type. Filter out those that don't match. */
5404 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5406 struct z_candidate
**candp
, **next
;
5408 for (candp
= &candidates
; *candp
; candp
= next
)
5410 tree parmlist
, parmtype
;
5411 int i
, nargs
= (arg2
? 2 : 1);
5416 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5418 for (i
= 0; i
< nargs
; ++i
)
5420 parmtype
= TREE_VALUE (parmlist
);
5422 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
5423 parmtype
= TREE_TYPE (parmtype
);
5424 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5425 && (same_type_ignoring_top_level_qualifiers_p
5426 (TREE_TYPE (args
[i
]), parmtype
)))
5429 parmlist
= TREE_CHAIN (parmlist
);
5432 /* No argument has an appropriate type, so remove this
5433 candidate function from the list. */
5436 *candp
= cand
->next
;
5442 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5449 /* For these, the built-in candidates set is empty
5450 [over.match.oper]/3. We don't want non-strict matches
5451 because exact matches are always possible with built-in
5452 operators. The built-in candidate set for COMPONENT_REF
5453 would be empty too, but since there are no such built-in
5454 operators, we accept non-strict matches for them. */
5463 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5468 case POSTINCREMENT_EXPR
:
5469 case POSTDECREMENT_EXPR
:
5470 /* Don't try anything fancy if we're not allowed to produce
5472 if (!(complain
& tf_error
))
5473 return error_mark_node
;
5475 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5476 distinguish between prefix and postfix ++ and
5477 operator++() was used for both, so we allow this with
5481 const char *msg
= (flag_permissive
)
5482 ? G_("no %<%D(int)%> declared for postfix %qs,"
5483 " trying prefix operator instead")
5484 : G_("no %<%D(int)%> declared for postfix %qs");
5485 permerror (loc
, msg
, fnname
, operator_name_info
[code
].name
);
5488 if (!flag_permissive
)
5489 return error_mark_node
;
5491 if (code
== POSTINCREMENT_EXPR
)
5492 code
= PREINCREMENT_EXPR
;
5494 code
= PREDECREMENT_EXPR
;
5495 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5496 NULL_TREE
, overload
, complain
);
5499 /* The caller will deal with these. */
5504 result_valid_p
= true;
5508 if (complain
& tf_error
)
5510 /* If one of the arguments of the operator represents
5511 an invalid use of member function pointer, try to report
5512 a meaningful error ... */
5513 if (invalid_nonstatic_memfn_p (loc
, arg1
, tf_error
)
5514 || invalid_nonstatic_memfn_p (loc
, arg2
, tf_error
)
5515 || invalid_nonstatic_memfn_p (loc
, arg3
, tf_error
))
5516 /* We displayed the error message. */;
5519 /* ... Otherwise, report the more generic
5520 "no matching operator found" error */
5521 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
5522 print_z_candidates (loc
, candidates
);
5525 result
= error_mark_node
;
5531 cand
= tourney (candidates
, complain
);
5534 if (complain
& tf_error
)
5536 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
5537 print_z_candidates (loc
, candidates
);
5539 result
= error_mark_node
;
5541 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
5544 *overload
= cand
->fn
;
5546 if (resolve_args (arglist
, complain
) == NULL
)
5547 result
= error_mark_node
;
5549 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5553 /* Give any warnings we noticed during overload resolution. */
5554 if (cand
->warnings
&& (complain
& tf_warning
))
5556 struct candidate_warning
*w
;
5557 for (w
= cand
->warnings
; w
; w
= w
->next
)
5558 joust (cand
, w
->loser
, 1, complain
);
5561 /* Check for comparison of different enum types. */
5570 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
5571 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
5572 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
5573 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
5574 && (complain
& tf_warning
))
5576 warning (OPT_Wenum_compare
,
5577 "comparison between %q#T and %q#T",
5578 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
5585 /* We need to strip any leading REF_BIND so that bitfields
5586 don't cause errors. This should not remove any important
5587 conversions, because builtins don't apply to class
5588 objects directly. */
5589 conv
= cand
->convs
[0];
5590 if (conv
->kind
== ck_ref_bind
)
5591 conv
= next_conversion (conv
);
5592 arg1
= convert_like (conv
, arg1
, complain
);
5596 conv
= cand
->convs
[1];
5597 if (conv
->kind
== ck_ref_bind
)
5598 conv
= next_conversion (conv
);
5600 arg2
= decay_conversion (arg2
, complain
);
5602 /* We need to call warn_logical_operator before
5603 converting arg2 to a boolean_type, but after
5604 decaying an enumerator to its value. */
5605 if (complain
& tf_warning
)
5606 warn_logical_operator (loc
, code
, boolean_type_node
,
5607 code_orig_arg1
, arg1
,
5608 code_orig_arg2
, arg2
);
5610 arg2
= convert_like (conv
, arg2
, complain
);
5614 conv
= cand
->convs
[2];
5615 if (conv
->kind
== ck_ref_bind
)
5616 conv
= next_conversion (conv
);
5617 arg3
= convert_like (conv
, arg3
, complain
);
5623 user_defined_result_ready
:
5625 /* Free all the conversions we allocated. */
5626 obstack_free (&conversion_obstack
, p
);
5628 if (result
|| result_valid_p
)
5635 return cp_build_modify_expr (arg1
, code2
, arg2
, complain
);
5638 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
5640 case TRUTH_ANDIF_EXPR
:
5641 case TRUTH_ORIF_EXPR
:
5642 case TRUTH_AND_EXPR
:
5644 if (complain
& tf_warning
)
5645 warn_logical_operator (loc
, code
, boolean_type_node
,
5646 code_orig_arg1
, arg1
, code_orig_arg2
, arg2
);
5654 if ((complain
& tf_warning
)
5655 && ((code_orig_arg1
== BOOLEAN_TYPE
)
5656 ^ (code_orig_arg2
== BOOLEAN_TYPE
)))
5657 maybe_warn_bool_compare (loc
, code
, arg1
, arg2
);
5662 case TRUNC_DIV_EXPR
:
5667 case TRUNC_MOD_EXPR
:
5671 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
5673 case UNARY_PLUS_EXPR
:
5676 case TRUTH_NOT_EXPR
:
5677 case PREINCREMENT_EXPR
:
5678 case POSTINCREMENT_EXPR
:
5679 case PREDECREMENT_EXPR
:
5680 case POSTDECREMENT_EXPR
:
5684 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
5687 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
5690 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
5694 /* The caller will deal with these. */
5706 /* Wrapper for above. */
5709 build_new_op (location_t loc
, enum tree_code code
, int flags
,
5710 tree arg1
, tree arg2
, tree arg3
,
5711 tree
*overload
, tsubst_flags_t complain
)
5714 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5715 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
5716 overload
, complain
);
5717 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5721 /* Returns true if FN has two parameters, of which the second has type
5725 second_parm_is_size_t (tree fn
)
5727 tree t
= FUNCTION_ARG_CHAIN (fn
);
5729 && same_type_p (TREE_VALUE (t
), size_type_node
)
5730 && TREE_CHAIN (t
) == void_list_node
);
5733 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
5734 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
5737 non_placement_deallocation_fn_p (tree t
)
5739 /* A template instance is never a usual deallocation function,
5740 regardless of its signature. */
5741 if (TREE_CODE (t
) == TEMPLATE_DECL
5742 || primary_template_instantiation_p (t
))
5745 /* If a class T has a member deallocation function named operator delete
5746 with exactly one parameter, then that function is a usual
5747 (non-placement) deallocation function. If class T does not declare
5748 such an operator delete but does declare a member deallocation
5749 function named operator delete with exactly two parameters, the second
5750 of which has type std::size_t (18.2), then this function is a usual
5751 deallocation function. */
5752 bool global
= DECL_NAMESPACE_SCOPE_P (t
);
5753 if (FUNCTION_ARG_CHAIN (t
) == void_list_node
5754 || ((!global
|| flag_sized_deallocation
)
5755 && second_parm_is_size_t (t
)))
5760 /* Build a call to operator delete. This has to be handled very specially,
5761 because the restrictions on what signatures match are different from all
5762 other call instances. For a normal delete, only a delete taking (void *)
5763 or (void *, size_t) is accepted. For a placement delete, only an exact
5764 match with the placement new is accepted.
5766 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
5767 ADDR is the pointer to be deleted.
5768 SIZE is the size of the memory block to be deleted.
5769 GLOBAL_P is true if the delete-expression should not consider
5770 class-specific delete operators.
5771 PLACEMENT is the corresponding placement new call, or NULL_TREE.
5773 If this call to "operator delete" is being generated as part to
5774 deallocate memory allocated via a new-expression (as per [expr.new]
5775 which requires that if the initialization throws an exception then
5776 we call a deallocation function), then ALLOC_FN is the allocation
5780 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
5781 bool global_p
, tree placement
,
5782 tree alloc_fn
, tsubst_flags_t complain
)
5784 tree fn
= NULL_TREE
;
5785 tree fns
, fnname
, type
, t
;
5787 if (addr
== error_mark_node
)
5788 return error_mark_node
;
5790 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
5792 fnname
= ansi_opname (code
);
5794 if (CLASS_TYPE_P (type
)
5795 && COMPLETE_TYPE_P (complete_type (type
))
5799 If the result of the lookup is ambiguous or inaccessible, or if
5800 the lookup selects a placement deallocation function, the
5801 program is ill-formed.
5803 Therefore, we ask lookup_fnfields to complain about ambiguity. */
5805 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
5806 if (fns
== error_mark_node
)
5807 return error_mark_node
;
5812 if (fns
== NULL_TREE
)
5813 fns
= lookup_name_nonclass (fnname
);
5815 /* Strip const and volatile from addr. */
5816 addr
= cp_convert (ptr_type_node
, addr
, complain
);
5820 /* "A declaration of a placement deallocation function matches the
5821 declaration of a placement allocation function if it has the same
5822 number of parameters and, after parameter transformations (8.3.5),
5823 all parameter types except the first are identical."
5825 So we build up the function type we want and ask instantiate_type
5826 to get it for us. */
5827 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
5828 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
5829 t
= build_function_type (void_type_node
, t
);
5831 fn
= instantiate_type (t
, fns
, tf_none
);
5832 if (fn
== error_mark_node
)
5835 if (BASELINK_P (fn
))
5836 fn
= BASELINK_FUNCTIONS (fn
);
5838 /* "If the lookup finds the two-parameter form of a usual deallocation
5839 function (3.7.4.2) and that function, considered as a placement
5840 deallocation function, would have been selected as a match for the
5841 allocation function, the program is ill-formed." */
5842 if (second_parm_is_size_t (fn
))
5845 = G_("exception cleanup for this placement new selects "
5846 "non-placement operator delete");
5848 = G_("%q+D is a usual (non-placement) deallocation "
5849 "function in C++14 (or with -fsized-deallocation)");
5851 /* But if the class has an operator delete (void *), then that is
5852 the usual deallocation function, so we shouldn't complain
5853 about using the operator delete (void *, size_t). */
5854 if (DECL_CLASS_SCOPE_P (fn
))
5855 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
5856 t
; t
= OVL_NEXT (t
))
5858 tree elt
= OVL_CURRENT (t
);
5859 if (non_placement_deallocation_fn_p (elt
)
5860 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
5863 /* Before C++14 a two-parameter global deallocation function is
5864 always a placement deallocation function, but warn if
5866 else if (!flag_sized_deallocation
)
5868 if ((complain
& tf_warning
)
5869 && warning (OPT_Wc__14_compat
, msg1
))
5870 inform (0, msg2
, fn
);
5874 if (complain
& tf_warning_or_error
)
5876 if (permerror (input_location
, msg1
))
5878 /* Only mention C++14 for namespace-scope delete. */
5879 if (DECL_NAMESPACE_SCOPE_P (fn
))
5880 inform (0, msg2
, fn
);
5882 inform (0, "%q+D is a usual (non-placement) deallocation "
5887 return error_mark_node
;
5892 /* "Any non-placement deallocation function matches a non-placement
5893 allocation function. If the lookup finds a single matching
5894 deallocation function, that function will be called; otherwise, no
5895 deallocation function will be called." */
5896 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
5897 t
; t
= OVL_NEXT (t
))
5899 tree elt
= OVL_CURRENT (t
);
5900 if (non_placement_deallocation_fn_p (elt
))
5903 /* "If a class T has a member deallocation function named
5904 operator delete with exactly one parameter, then that
5905 function is a usual (non-placement) deallocation
5906 function. If class T does not declare such an operator
5907 delete but does declare a member deallocation function named
5908 operator delete with exactly two parameters, the second of
5909 which has type std::size_t (18.2), then this function is a
5910 usual deallocation function."
5912 So in a class (void*) beats (void*, size_t). */
5913 if (DECL_CLASS_SCOPE_P (fn
))
5915 if (FUNCTION_ARG_CHAIN (fn
) == void_list_node
)
5918 /* At global scope (in C++14 and above) the rules are different:
5920 If deallocation function lookup finds both a usual
5921 deallocation function with only a pointer parameter and a
5922 usual deallocation function with both a pointer parameter
5923 and a size parameter, the function to be called is selected
5926 * If the type is complete and if, for the second alternative
5927 (delete array) only, the operand is a pointer to a class
5928 type with a non-trivial destructor or a (possibly
5929 multi-dimensional) array thereof, the function with two
5930 parameters is selected.
5932 * Otherwise, it is unspecified which of the two deallocation
5933 functions is selected. */
5936 bool want_size
= COMPLETE_TYPE_P (type
);
5937 if (code
== VEC_DELETE_EXPR
5938 && !TYPE_VEC_NEW_USES_COOKIE (type
))
5939 /* We need a cookie to determine the array size. */
5941 bool have_size
= (FUNCTION_ARG_CHAIN (fn
) != void_list_node
);
5942 if (want_size
== have_size
)
5948 /* If we have a matching function, call it. */
5951 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
5953 /* If the FN is a member function, make sure that it is
5955 if (BASELINK_P (fns
))
5956 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
5959 /* Core issue 901: It's ok to new a type with deleted delete. */
5960 if (DECL_DELETED_FN (fn
) && alloc_fn
)
5965 /* The placement args might not be suitable for overload
5966 resolution at this point, so build the call directly. */
5967 int nargs
= call_expr_nargs (placement
);
5968 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
5971 for (i
= 1; i
< nargs
; i
++)
5972 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
5973 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
5974 return error_mark_node
;
5975 return build_cxx_call (fn
, nargs
, argarray
, complain
);
5980 vec
<tree
, va_gc
> *args
= make_tree_vector ();
5981 args
->quick_push (addr
);
5982 if (FUNCTION_ARG_CHAIN (fn
) != void_list_node
)
5983 args
->quick_push (size
);
5984 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
5985 release_tree_vector (args
);
5992 If no unambiguous matching deallocation function can be found,
5993 propagating the exception does not cause the object's memory to
5997 if ((complain
& tf_warning
)
5999 warning (0, "no corresponding deallocation function for %qD",
6004 if (complain
& tf_error
)
6005 error ("no suitable %<operator %s%> for %qT",
6006 operator_name_info
[(int)code
].name
, type
);
6007 return error_mark_node
;
6010 /* If the current scope isn't allowed to access DECL along
6011 BASETYPE_PATH, give an error. The most derived class in
6012 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6013 the declaration to use in the error diagnostic. */
6016 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
6017 tsubst_flags_t complain
)
6019 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
6021 if (!accessible_p (basetype_path
, decl
, true))
6023 if (complain
& tf_error
)
6025 if (TREE_PRIVATE (decl
))
6027 error ("%q#D is private within this context", diag_decl
);
6028 inform (DECL_SOURCE_LOCATION (diag_decl
),
6029 "declared private here");
6031 else if (TREE_PROTECTED (decl
))
6033 error ("%q#D is protected within this context", diag_decl
);
6034 inform (DECL_SOURCE_LOCATION (diag_decl
),
6035 "declared protected here");
6039 error ("%q#D is inaccessible within this context", diag_decl
);
6040 inform (DECL_SOURCE_LOCATION (diag_decl
), "declared here");
6049 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6050 bitwise or of LOOKUP_* values. If any errors are warnings are
6051 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6052 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6056 build_temp (tree expr
, tree type
, int flags
,
6057 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
6060 vec
<tree
, va_gc
> *args
;
6062 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
6063 args
= make_tree_vector_single (expr
);
6064 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6065 &args
, type
, flags
, complain
);
6066 release_tree_vector (args
);
6067 if (warningcount
+ werrorcount
> savew
)
6068 *diagnostic_kind
= DK_WARNING
;
6069 else if (errorcount
> savee
)
6070 *diagnostic_kind
= DK_ERROR
;
6072 *diagnostic_kind
= DK_UNSPECIFIED
;
6076 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6077 EXPR is implicitly converted to type TOTYPE.
6078 FN and ARGNUM are used for diagnostics. */
6081 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
6083 /* Issue warnings about peculiar, but valid, uses of NULL. */
6084 if (expr
== null_node
&& TREE_CODE (totype
) != BOOLEAN_TYPE
6085 && ARITHMETIC_TYPE_P (totype
))
6087 source_location loc
=
6088 expansion_point_location_if_in_system_header (input_location
);
6091 warning_at (loc
, OPT_Wconversion_null
,
6092 "passing NULL to non-pointer argument %P of %qD",
6095 warning_at (loc
, OPT_Wconversion_null
,
6096 "converting to non-pointer type %qT from NULL", totype
);
6099 /* Issue warnings if "false" is converted to a NULL pointer */
6100 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
6101 && TYPE_PTR_P (totype
))
6104 warning_at (input_location
, OPT_Wconversion_null
,
6105 "converting %<false%> to pointer type for argument %P "
6106 "of %qD", argnum
, fn
);
6108 warning_at (input_location
, OPT_Wconversion_null
,
6109 "converting %<false%> to pointer type %qT", totype
);
6113 /* We gave a diagnostic during a conversion. If this was in the second
6114 standard conversion sequence of a user-defined conversion sequence, say
6115 which user-defined conversion. */
6118 maybe_print_user_conv_context (conversion
*convs
)
6120 if (convs
->user_conv_p
)
6121 for (conversion
*t
= convs
; t
; t
= next_conversion (t
))
6122 if (t
->kind
== ck_user
)
6124 print_z_candidate (0, " after user-defined conversion:",
6130 /* Perform the conversions in CONVS on the expression EXPR. FN and
6131 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6132 indicates the `this' argument of a method. INNER is nonzero when
6133 being called to continue a conversion chain. It is negative when a
6134 reference binding will be applied, positive otherwise. If
6135 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6136 conversions will be emitted if appropriate. If C_CAST_P is true,
6137 this conversion is coming from a C-style cast; in that case,
6138 conversions to inaccessible bases are permitted. */
6141 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
6142 int inner
, bool issue_conversion_warnings
,
6143 bool c_cast_p
, tsubst_flags_t complain
)
6145 tree totype
= convs
->type
;
6146 diagnostic_t diag_kind
;
6148 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6150 if (convs
->bad_p
&& !(complain
& tf_error
))
6151 return error_mark_node
;
6154 && convs
->kind
!= ck_user
6155 && convs
->kind
!= ck_list
6156 && convs
->kind
!= ck_ambig
6157 && (convs
->kind
!= ck_ref_bind
6158 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
6159 && (convs
->kind
!= ck_rvalue
6160 || SCALAR_TYPE_P (totype
))
6161 && convs
->kind
!= ck_base
)
6163 bool complained
= false;
6164 conversion
*t
= convs
;
6166 /* Give a helpful error if this is bad because of excess braces. */
6167 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6168 && SCALAR_TYPE_P (totype
)
6169 && CONSTRUCTOR_NELTS (expr
) > 0
6170 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
6172 complained
= permerror (loc
, "too many braces around initializer "
6174 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6175 && CONSTRUCTOR_NELTS (expr
) == 1)
6176 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6179 /* Give a helpful error if this is bad because a conversion to bool
6180 from std::nullptr_t requires direct-initialization. */
6181 if (NULLPTR_TYPE_P (TREE_TYPE (expr
))
6182 && TREE_CODE (totype
) == BOOLEAN_TYPE
)
6183 complained
= permerror (loc
, "converting to %qT from %qT requires "
6184 "direct-initialization",
6185 totype
, TREE_TYPE (expr
));
6187 for (; t
; t
= next_conversion (t
))
6189 if (t
->kind
== ck_user
&& t
->cand
->reason
)
6191 complained
= permerror (loc
, "invalid user-defined conversion "
6192 "from %qT to %qT", TREE_TYPE (expr
),
6195 print_z_candidate (loc
, "candidate is:", t
->cand
);
6196 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
6197 /*issue_conversion_warnings=*/false,
6200 if (convs
->kind
== ck_ref_bind
)
6201 expr
= convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
6202 LOOKUP_NORMAL
, NULL_TREE
,
6205 expr
= cp_convert (totype
, expr
, complain
);
6206 if (complained
&& fn
)
6207 inform (DECL_SOURCE_LOCATION (fn
),
6208 " initializing argument %P of %qD", argnum
, fn
);
6211 else if (t
->kind
== ck_user
|| !t
->bad_p
)
6213 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
6214 /*issue_conversion_warnings=*/false,
6219 else if (t
->kind
== ck_ambig
)
6220 return convert_like_real (t
, expr
, fn
, argnum
, 1,
6221 /*issue_conversion_warnings=*/false,
6224 else if (t
->kind
== ck_identity
)
6228 complained
= permerror (loc
, "invalid conversion from %qT to %qT",
6229 TREE_TYPE (expr
), totype
);
6230 if (complained
&& fn
)
6231 inform (DECL_SOURCE_LOCATION (fn
),
6232 " initializing argument %P of %qD", argnum
, fn
);
6234 return cp_convert (totype
, expr
, complain
);
6237 if (issue_conversion_warnings
&& (complain
& tf_warning
))
6238 conversion_null_warnings (totype
, expr
, fn
, argnum
);
6240 switch (convs
->kind
)
6244 struct z_candidate
*cand
= convs
->cand
;
6245 tree convfn
= cand
->fn
;
6248 /* If we're initializing from {}, it's value-initialization. Note
6249 that under the resolution of core 1630, value-initialization can
6250 use explicit constructors. */
6251 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6252 && CONSTRUCTOR_NELTS (expr
) == 0
6253 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
6255 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
6256 expr
= build_value_init (totype
, complain
);
6257 expr
= get_target_expr_sfinae (expr
, complain
);
6258 if (expr
!= error_mark_node
)
6260 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6261 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
6266 /* When converting from an init list we consider explicit
6267 constructors, but actually trying to call one is an error. */
6268 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
6269 /* Unless this is for direct-list-initialization. */
6270 && !DIRECT_LIST_INIT_P (expr
))
6272 if (!(complain
& tf_error
))
6273 return error_mark_node
;
6274 error ("converting to %qT from initializer list would use "
6275 "explicit constructor %qD", totype
, convfn
);
6278 expr
= mark_rvalue_use (expr
);
6280 /* Set user_conv_p on the argument conversions, so rvalue/base
6281 handling knows not to allow any more UDCs. */
6282 for (i
= 0; i
< cand
->num_convs
; ++i
)
6283 cand
->convs
[i
]->user_conv_p
= true;
6285 expr
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
6287 /* If this is a constructor or a function returning an aggr type,
6288 we need to build up a TARGET_EXPR. */
6289 if (DECL_CONSTRUCTOR_P (convfn
))
6291 expr
= build_cplus_new (totype
, expr
, complain
);
6293 /* Remember that this was list-initialization. */
6294 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
6295 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6301 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
6303 int nelts
= CONSTRUCTOR_NELTS (expr
);
6305 expr
= build_value_init (totype
, complain
);
6306 else if (nelts
== 1)
6307 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6311 expr
= mark_rvalue_use (expr
);
6313 if (type_unknown_p (expr
))
6314 expr
= instantiate_type (totype
, expr
, complain
);
6315 /* Convert a constant to its underlying value, unless we are
6316 about to bind it to a reference, in which case we need to
6317 leave it as an lvalue. */
6320 expr
= scalar_constant_value (expr
);
6321 if (expr
== null_node
&& INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
6322 /* If __null has been converted to an integer type, we do not
6323 want to warn about uses of EXPR as an integer, rather than
6325 expr
= build_int_cst (totype
, 0);
6329 /* We leave bad_p off ck_ambig because overload resolution considers
6330 it valid, it just fails when we try to perform it. So we need to
6331 check complain here, too. */
6332 if (complain
& tf_error
)
6334 /* Call build_user_type_conversion again for the error. */
6335 build_user_type_conversion (totype
, convs
->u
.expr
, LOOKUP_NORMAL
,
6338 inform (input_location
, " initializing argument %P of %q+D",
6341 return error_mark_node
;
6345 /* Conversion to std::initializer_list<T>. */
6346 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
6347 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
6348 unsigned len
= CONSTRUCTOR_NELTS (expr
);
6349 tree array
, val
, field
;
6350 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
6353 /* Convert all the elements. */
6354 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
6356 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
6357 1, false, false, complain
);
6358 if (sub
== error_mark_node
)
6360 if (!BRACE_ENCLOSED_INITIALIZER_P (val
)
6361 && !check_narrowing (TREE_TYPE (sub
), val
, complain
))
6362 return error_mark_node
;
6363 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
6364 if (!TREE_CONSTANT (sub
))
6365 TREE_CONSTANT (new_ctor
) = false;
6367 /* Build up the array. */
6368 elttype
= cp_build_qualified_type
6369 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
6370 array
= build_array_of_n_type (elttype
, len
);
6371 array
= finish_compound_literal (array
, new_ctor
, complain
);
6372 /* Take the address explicitly rather than via decay_conversion
6373 to avoid the error about taking the address of a temporary. */
6374 array
= cp_build_addr_expr (array
, complain
);
6375 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
6376 if (array
== error_mark_node
)
6377 return error_mark_node
;
6379 /* Build up the initializer_list object. */
6380 totype
= complete_type (totype
);
6381 field
= next_initializable_field (TYPE_FIELDS (totype
));
6382 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
6383 field
= next_initializable_field (DECL_CHAIN (field
));
6384 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
6385 new_ctor
= build_constructor (totype
, vec
);
6386 return get_target_expr_sfinae (new_ctor
, complain
);
6390 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
6392 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6393 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
6394 real
= perform_implicit_conversion (TREE_TYPE (totype
),
6396 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
6398 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
6399 return fold_if_not_in_template (expr
);
6401 expr
= reshape_init (totype
, expr
, complain
);
6402 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
6404 if (expr
!= error_mark_node
)
6405 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6412 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
6413 convs
->kind
== ck_ref_bind
? -1 : 1,
6414 convs
->kind
== ck_ref_bind
? issue_conversion_warnings
: false,
6417 if (expr
== error_mark_node
)
6418 return error_mark_node
;
6420 switch (convs
->kind
)
6423 expr
= decay_conversion (expr
, complain
);
6424 if (expr
== error_mark_node
)
6425 return error_mark_node
;
6427 if (! MAYBE_CLASS_TYPE_P (totype
))
6429 /* Else fall through. */
6431 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
6433 /* We are going to bind a reference directly to a base-class
6434 subobject of EXPR. */
6435 /* Build an expression for `*((base*) &expr)'. */
6436 expr
= convert_to_base (expr
, totype
,
6437 !c_cast_p
, /*nonnull=*/true, complain
);
6441 /* Copy-initialization where the cv-unqualified version of the source
6442 type is the same class as, or a derived class of, the class of the
6443 destination [is treated as direct-initialization]. [dcl.init] */
6444 flags
= LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
;
6445 if (convs
->user_conv_p
)
6446 /* This conversion is being done in the context of a user-defined
6447 conversion (i.e. the second step of copy-initialization), so
6448 don't allow any more. */
6449 flags
|= LOOKUP_NO_CONVERSION
;
6450 if (convs
->rvaluedness_matches_p
)
6451 flags
|= LOOKUP_PREFER_RVALUE
;
6452 if (TREE_CODE (expr
) == TARGET_EXPR
6453 && TARGET_EXPR_LIST_INIT_P (expr
))
6454 /* Copy-list-initialization doesn't actually involve a copy. */
6456 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
6457 if (diag_kind
&& complain
)
6459 maybe_print_user_conv_context (convs
);
6461 inform (DECL_SOURCE_LOCATION (fn
),
6462 " initializing argument %P of %qD", argnum
, fn
);
6465 return build_cplus_new (totype
, expr
, complain
);
6469 tree ref_type
= totype
;
6471 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
6473 tree extype
= TREE_TYPE (expr
);
6474 if (TYPE_REF_IS_RVALUE (ref_type
)
6475 && real_lvalue_p (expr
))
6476 error_at (loc
, "cannot bind %qT lvalue to %qT",
6478 else if (!TYPE_REF_IS_RVALUE (ref_type
) && !real_lvalue_p (expr
)
6479 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
6480 error_at (loc
, "invalid initialization of non-const reference of "
6481 "type %qT from an rvalue of type %qT", totype
, extype
);
6482 else if (!reference_compatible_p (TREE_TYPE (totype
), extype
))
6483 error_at (loc
, "binding %qT to reference of type %qT "
6484 "discards qualifiers", extype
, totype
);
6487 maybe_print_user_conv_context (convs
);
6489 inform (input_location
,
6490 " initializing argument %P of %q+D", argnum
, fn
);
6491 return error_mark_node
;
6494 /* If necessary, create a temporary.
6496 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
6497 that need temporaries, even when their types are reference
6498 compatible with the type of reference being bound, so the
6499 upcoming call to cp_build_addr_expr doesn't fail. */
6500 if (convs
->need_temporary_p
6501 || TREE_CODE (expr
) == CONSTRUCTOR
6502 || TREE_CODE (expr
) == VA_ARG_EXPR
)
6504 /* Otherwise, a temporary of type "cv1 T1" is created and
6505 initialized from the initializer expression using the rules
6506 for a non-reference copy-initialization (8.5). */
6508 tree type
= TREE_TYPE (ref_type
);
6509 cp_lvalue_kind lvalue
= real_lvalue_p (expr
);
6511 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6512 (type
, next_conversion (convs
)->type
));
6513 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
6514 && !TYPE_REF_IS_RVALUE (ref_type
))
6516 /* If the reference is volatile or non-const, we
6517 cannot create a temporary. */
6518 if (lvalue
& clk_bitfield
)
6519 error_at (loc
, "cannot bind bitfield %qE to %qT",
6521 else if (lvalue
& clk_packed
)
6522 error_at (loc
, "cannot bind packed field %qE to %qT",
6525 error_at (loc
, "cannot bind rvalue %qE to %qT",
6527 return error_mark_node
;
6529 /* If the source is a packed field, and we must use a copy
6530 constructor, then building the target expr will require
6531 binding the field to the reference parameter to the
6532 copy constructor, and we'll end up with an infinite
6533 loop. If we can use a bitwise copy, then we'll be
6535 if ((lvalue
& clk_packed
)
6536 && CLASS_TYPE_P (type
)
6537 && type_has_nontrivial_copy_init (type
))
6539 error_at (loc
, "cannot bind packed field %qE to %qT",
6541 return error_mark_node
;
6543 if (lvalue
& clk_bitfield
)
6545 expr
= convert_bitfield_to_declared_type (expr
);
6546 expr
= fold_convert (type
, expr
);
6548 expr
= build_target_expr_with_type (expr
, type
, complain
);
6551 /* Take the address of the thing to which we will bind the
6553 expr
= cp_build_addr_expr (expr
, complain
);
6554 if (expr
== error_mark_node
)
6555 return error_mark_node
;
6557 /* Convert it to a pointer to the type referred to by the
6558 reference. This will adjust the pointer if a derived to
6559 base conversion is being performed. */
6560 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
6562 /* Convert the pointer to the desired reference type. */
6563 return build_nop (ref_type
, expr
);
6567 return decay_conversion (expr
, complain
);
6570 /* Warn about deprecated conversion if appropriate. */
6571 string_conv_p (totype
, expr
, 1);
6576 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
6577 /*nonnull=*/false, complain
);
6578 return build_nop (totype
, expr
);
6581 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
6582 c_cast_p
, complain
);
6588 if (convs
->check_narrowing
6589 && !check_narrowing (totype
, expr
, complain
))
6590 return error_mark_node
;
6592 if (issue_conversion_warnings
)
6593 expr
= cp_convert_and_check (totype
, expr
, complain
);
6595 expr
= cp_convert (totype
, expr
, complain
);
6600 /* ARG is being passed to a varargs function. Perform any conversions
6601 required. Return the converted value. */
6604 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
6607 location_t loc
= EXPR_LOC_OR_LOC (arg
, input_location
);
6611 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6612 standard conversions are performed. */
6613 arg
= decay_conversion (arg
, complain
);
6614 arg_type
= TREE_TYPE (arg
);
6617 If the argument has integral or enumeration type that is subject
6618 to the integral promotions (_conv.prom_), or a floating point
6619 type that is subject to the floating point promotion
6620 (_conv.fpprom_), the value of the argument is converted to the
6621 promoted type before the call. */
6622 if (TREE_CODE (arg_type
) == REAL_TYPE
6623 && (TYPE_PRECISION (arg_type
)
6624 < TYPE_PRECISION (double_type_node
))
6625 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
6627 if ((complain
& tf_warning
)
6628 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
6629 warning_at (loc
, OPT_Wdouble_promotion
,
6630 "implicit conversion from %qT to %qT when passing "
6631 "argument to function",
6632 arg_type
, double_type_node
);
6633 arg
= convert_to_real (double_type_node
, arg
);
6635 else if (NULLPTR_TYPE_P (arg_type
))
6636 arg
= null_pointer_node
;
6637 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
6639 if (SCOPED_ENUM_P (arg_type
))
6641 tree prom
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
,
6643 prom
= cp_perform_integral_promotions (prom
, complain
);
6644 if (abi_version_crosses (6)
6645 && TYPE_MODE (TREE_TYPE (prom
)) != TYPE_MODE (arg_type
)
6646 && (complain
& tf_warning
))
6647 warning_at (loc
, OPT_Wabi
, "scoped enum %qT passed through ... as "
6648 "%qT before -fabi-version=6, %qT after", arg_type
,
6649 TREE_TYPE (prom
), ENUM_UNDERLYING_TYPE (arg_type
));
6650 if (!abi_version_at_least (6))
6654 arg
= cp_perform_integral_promotions (arg
, complain
);
6657 arg
= require_complete_type_sfinae (arg
, complain
);
6658 arg_type
= TREE_TYPE (arg
);
6660 if (arg
!= error_mark_node
6661 /* In a template (or ill-formed code), we can have an incomplete type
6662 even after require_complete_type_sfinae, in which case we don't know
6663 whether it has trivial copy or not. */
6664 && COMPLETE_TYPE_P (arg_type
))
6666 /* Build up a real lvalue-to-rvalue conversion in case the
6667 copy constructor is trivial but not callable. */
6668 if (!cp_unevaluated_operand
&& CLASS_TYPE_P (arg_type
))
6669 force_rvalue (arg
, complain
);
6671 /* [expr.call] 5.2.2/7:
6672 Passing a potentially-evaluated argument of class type (Clause 9)
6673 with a non-trivial copy constructor or a non-trivial destructor
6674 with no corresponding parameter is conditionally-supported, with
6675 implementation-defined semantics.
6677 We support it as pass-by-invisible-reference, just like a normal
6680 If the call appears in the context of a sizeof expression,
6681 it is not potentially-evaluated. */
6682 if (cp_unevaluated_operand
== 0
6683 && (type_has_nontrivial_copy_init (arg_type
)
6684 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
)))
6686 if (complain
& tf_warning
)
6687 warning (OPT_Wconditionally_supported
,
6688 "passing objects of non-trivially-copyable "
6689 "type %q#T through %<...%> is conditionally supported",
6691 return cp_build_addr_expr (arg
, complain
);
6698 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
6701 build_x_va_arg (source_location loc
, tree expr
, tree type
)
6703 if (processing_template_decl
)
6705 tree r
= build_min (VA_ARG_EXPR
, type
, expr
);
6706 SET_EXPR_LOCATION (r
, loc
);
6710 type
= complete_type_or_else (type
, NULL_TREE
);
6712 if (expr
== error_mark_node
|| !type
)
6713 return error_mark_node
;
6715 expr
= mark_lvalue_use (expr
);
6717 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6719 error ("cannot receive reference type %qT through %<...%>", type
);
6720 return error_mark_node
;
6723 if (type_has_nontrivial_copy_init (type
)
6724 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
6726 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
6727 it as pass by invisible reference. */
6728 warning_at (loc
, OPT_Wconditionally_supported
,
6729 "receiving objects of non-trivially-copyable type %q#T "
6730 "through %<...%> is conditionally-supported", type
);
6732 tree ref
= cp_build_reference_type (type
, false);
6733 expr
= build_va_arg (loc
, expr
, ref
);
6734 return convert_from_reference (expr
);
6737 return build_va_arg (loc
, expr
, type
);
6740 /* TYPE has been given to va_arg. Apply the default conversions which
6741 would have happened when passed via ellipsis. Return the promoted
6742 type, or the passed type if there is no change. */
6745 cxx_type_promotes_to (tree type
)
6749 /* Perform the array-to-pointer and function-to-pointer
6751 type
= type_decays_to (type
);
6753 promote
= type_promotes_to (type
);
6754 if (same_type_p (type
, promote
))
6760 /* ARG is a default argument expression being passed to a parameter of
6761 the indicated TYPE, which is a parameter to FN. PARMNUM is the
6762 zero-based argument number. Do any required conversions. Return
6763 the converted value. */
6765 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
6767 push_defarg_context (tree fn
)
6768 { vec_safe_push (default_arg_context
, fn
); }
6771 pop_defarg_context (void)
6772 { default_arg_context
->pop (); }
6775 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
6776 tsubst_flags_t complain
)
6781 /* See through clones. */
6782 fn
= DECL_ORIGIN (fn
);
6784 /* Detect recursion. */
6785 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
6788 if (complain
& tf_error
)
6789 error ("recursive evaluation of default argument for %q#D", fn
);
6790 return error_mark_node
;
6793 /* If the ARG is an unparsed default argument expression, the
6794 conversion cannot be performed. */
6795 if (TREE_CODE (arg
) == DEFAULT_ARG
)
6797 if (complain
& tf_error
)
6798 error ("call to %qD uses the default argument for parameter %P, which "
6799 "is not yet defined", fn
, parmnum
);
6800 return error_mark_node
;
6803 push_defarg_context (fn
);
6805 if (fn
&& DECL_TEMPLATE_INFO (fn
))
6806 arg
= tsubst_default_argument (fn
, type
, arg
, complain
);
6812 The names in the expression are bound, and the semantic
6813 constraints are checked, at the point where the default
6814 expressions appears.
6816 we must not perform access checks here. */
6817 push_deferring_access_checks (dk_no_check
);
6818 /* We must make a copy of ARG, in case subsequent processing
6819 alters any part of it. */
6820 arg
= break_out_target_exprs (arg
);
6821 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
6822 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
6824 arg
= convert_for_arg_passing (type
, arg
, complain
);
6825 pop_deferring_access_checks();
6827 pop_defarg_context ();
6832 /* Returns the type which will really be used for passing an argument of
6836 type_passed_as (tree type
)
6838 /* Pass classes with copy ctors by invisible reference. */
6839 if (TREE_ADDRESSABLE (type
))
6841 type
= build_reference_type (type
);
6842 /* There are no other pointers to this temporary. */
6843 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
6845 else if (targetm
.calls
.promote_prototypes (type
)
6846 && INTEGRAL_TYPE_P (type
)
6847 && COMPLETE_TYPE_P (type
)
6848 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
6849 type
= integer_type_node
;
6854 /* Actually perform the appropriate conversion. */
6857 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
6861 /* If VAL is a bitfield, then -- since it has already been converted
6862 to TYPE -- it cannot have a precision greater than TYPE.
6864 If it has a smaller precision, we must widen it here. For
6865 example, passing "int f:3;" to a function expecting an "int" will
6866 not result in any conversion before this point.
6868 If the precision is the same we must not risk widening. For
6869 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
6870 often have type "int", even though the C++ type for the field is
6871 "long long". If the value is being passed to a function
6872 expecting an "int", then no conversions will be required. But,
6873 if we call convert_bitfield_to_declared_type, the bitfield will
6874 be converted to "long long". */
6875 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
6877 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
6878 val
= convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type
), val
);
6880 if (val
== error_mark_node
)
6882 /* Pass classes with copy ctors by invisible reference. */
6883 else if (TREE_ADDRESSABLE (type
))
6884 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
6885 else if (targetm
.calls
.promote_prototypes (type
)
6886 && INTEGRAL_TYPE_P (type
)
6887 && COMPLETE_TYPE_P (type
)
6888 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
6889 val
= cp_perform_integral_promotions (val
, complain
);
6890 if ((complain
& tf_warning
)
6891 && warn_suggest_attribute_format
)
6893 tree rhstype
= TREE_TYPE (val
);
6894 const enum tree_code coder
= TREE_CODE (rhstype
);
6895 const enum tree_code codel
= TREE_CODE (type
);
6896 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
6898 && check_missing_format_attribute (type
, rhstype
))
6899 warning (OPT_Wsuggest_attribute_format
,
6900 "argument of function call might be a candidate for a format attribute");
6905 /* Returns true iff FN is a function with magic varargs, i.e. ones for
6906 which no conversions at all should be done. This is true for some
6907 builtins which don't act like normal functions. */
6910 magic_varargs_p (tree fn
)
6912 if (flag_cilkplus
&& is_cilkplus_reduce_builtin (fn
) != BUILT_IN_NONE
)
6915 if (DECL_BUILT_IN (fn
))
6916 switch (DECL_FUNCTION_CODE (fn
))
6918 case BUILT_IN_CLASSIFY_TYPE
:
6919 case BUILT_IN_CONSTANT_P
:
6920 case BUILT_IN_NEXT_ARG
:
6921 case BUILT_IN_VA_START
:
6925 return lookup_attribute ("type generic",
6926 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
6932 /* Returns the decl of the dispatcher function if FN is a function version. */
6935 get_function_version_dispatcher (tree fn
)
6937 tree dispatcher_decl
= NULL
;
6939 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
6940 && DECL_FUNCTION_VERSIONED (fn
));
6942 gcc_assert (targetm
.get_function_versions_dispatcher
);
6943 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
6945 if (dispatcher_decl
== NULL
)
6947 error_at (input_location
, "use of multiversioned function "
6948 "without a default");
6952 retrofit_lang_decl (dispatcher_decl
);
6953 gcc_assert (dispatcher_decl
!= NULL
);
6954 return dispatcher_decl
;
6957 /* fn is a function version dispatcher that is marked used. Mark all the
6958 semantically identical function versions it will dispatch as used. */
6961 mark_versions_used (tree fn
)
6963 struct cgraph_node
*node
;
6964 struct cgraph_function_version_info
*node_v
;
6965 struct cgraph_function_version_info
*it_v
;
6967 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6969 node
= cgraph_node::get (fn
);
6973 gcc_assert (node
->dispatcher_function
);
6975 node_v
= node
->function_version ();
6979 /* All semantically identical versions are chained. Traverse and mark each
6980 one of them as used. */
6981 it_v
= node_v
->next
;
6982 while (it_v
!= NULL
)
6984 mark_used (it_v
->this_node
->decl
);
6989 /* Build a call to "the copy constructor" for the type of A, even if it
6990 wouldn't be selected by normal overload resolution. Used for
6994 call_copy_ctor (tree a
, tsubst_flags_t complain
)
6996 tree ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (a
));
6997 tree binfo
= TYPE_BINFO (ctype
);
6998 tree copy
= get_copy_ctor (ctype
, complain
);
6999 copy
= build_baselink (binfo
, binfo
, copy
, NULL_TREE
);
7000 tree ob
= build_dummy_object (ctype
);
7001 vec
<tree
, va_gc
>* args
= make_tree_vector_single (a
);
7002 tree r
= build_new_method_call (ob
, copy
, &args
, NULL_TREE
,
7003 LOOKUP_NORMAL
, NULL
, complain
);
7004 release_tree_vector (args
);
7008 /* Subroutine of the various build_*_call functions. Overload resolution
7009 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7010 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7011 bitmask of various LOOKUP_* flags which apply to the call itself. */
7014 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
7017 const vec
<tree
, va_gc
> *args
= cand
->args
;
7018 tree first_arg
= cand
->first_arg
;
7019 conversion
**convs
= cand
->convs
;
7021 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
7026 unsigned int arg_index
= 0;
7030 bool already_used
= false;
7032 /* In a template, there is no need to perform all of the work that
7033 is normally done. We are only interested in the type of the call
7034 expression, i.e., the return type of the function. Any semantic
7035 errors will be deferred until the template is instantiated. */
7036 if (processing_template_decl
)
7040 const tree
*argarray
;
7043 return_type
= TREE_TYPE (TREE_TYPE (fn
));
7044 nargs
= vec_safe_length (args
);
7045 if (first_arg
== NULL_TREE
)
7046 argarray
= args
->address ();
7054 alcarray
= XALLOCAVEC (tree
, nargs
);
7055 alcarray
[0] = build_this (first_arg
);
7056 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
7057 alcarray
[ix
+ 1] = arg
;
7058 argarray
= alcarray
;
7061 addr
= build_addr_func (fn
, complain
);
7062 if (addr
== error_mark_node
)
7063 return error_mark_node
;
7064 expr
= build_call_array_loc (input_location
, return_type
,
7065 addr
, nargs
, argarray
);
7066 if (TREE_THIS_VOLATILE (fn
) && cfun
)
7067 current_function_returns_abnormally
= 1;
7068 return convert_from_reference (expr
);
7071 /* Give any warnings we noticed during overload resolution. */
7072 if (cand
->warnings
&& (complain
& tf_warning
))
7074 struct candidate_warning
*w
;
7075 for (w
= cand
->warnings
; w
; w
= w
->next
)
7076 joust (cand
, w
->loser
, 1, complain
);
7079 /* Make =delete work with SFINAE. */
7080 if (DECL_DELETED_FN (fn
) && !(complain
& tf_error
))
7081 return error_mark_node
;
7083 if (DECL_FUNCTION_MEMBER_P (fn
))
7086 /* If FN is a template function, two cases must be considered.
7091 template <class T> void f();
7093 template <class T> struct B {
7097 struct C : A, B<int> {
7099 using B<int>::g; // #2
7102 In case #1 where `A::f' is a member template, DECL_ACCESS is
7103 recorded in the primary template but not in its specialization.
7104 We check access of FN using its primary template.
7106 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7107 because it is a member of class template B, DECL_ACCESS is
7108 recorded in the specialization `B<int>::g'. We cannot use its
7109 primary template because `B<T>::g' and `B<int>::g' may have
7110 different access. */
7111 if (DECL_TEMPLATE_INFO (fn
)
7112 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
7113 access_fn
= DECL_TI_TEMPLATE (fn
);
7116 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
7118 return error_mark_node
;
7121 /* If we're checking for implicit delete, don't bother with argument
7123 if (flags
& LOOKUP_SPECULATIVE
)
7125 if (DECL_DELETED_FN (fn
))
7127 if (complain
& tf_error
)
7129 return error_mark_node
;
7131 if (cand
->viable
== 1)
7133 else if (!(complain
& tf_error
))
7134 /* Reject bad conversions now. */
7135 return error_mark_node
;
7136 /* else continue to get conversion error. */
7139 /* N3276 magic doesn't apply to nested calls. */
7140 int decltype_flag
= (complain
& tf_decltype
);
7141 complain
&= ~tf_decltype
;
7143 /* Find maximum size of vector to hold converted arguments. */
7144 parmlen
= list_length (parm
);
7145 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
7146 if (parmlen
> nargs
)
7148 argarray
= XALLOCAVEC (tree
, nargs
);
7150 /* The implicit parameters to a constructor are not considered by overload
7151 resolution, and must be of the proper type. */
7152 if (DECL_CONSTRUCTOR_P (fn
))
7155 if (first_arg
!= NULL_TREE
)
7157 object_arg
= first_arg
;
7158 first_arg
= NULL_TREE
;
7162 object_arg
= (*args
)[arg_index
];
7165 argarray
[j
++] = build_this (object_arg
);
7166 parm
= TREE_CHAIN (parm
);
7167 /* We should never try to call the abstract constructor. */
7168 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
7170 if (DECL_HAS_VTT_PARM_P (fn
))
7172 argarray
[j
++] = (*args
)[arg_index
];
7174 parm
= TREE_CHAIN (parm
);
7177 /* Bypass access control for 'this' parameter. */
7178 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7180 tree parmtype
= TREE_VALUE (parm
);
7181 tree arg
= build_this (first_arg
!= NULL_TREE
7183 : (*args
)[arg_index
]);
7184 tree argtype
= TREE_TYPE (arg
);
7188 if (convs
[i
]->bad_p
)
7190 if (complain
& tf_error
)
7192 if (permerror (input_location
, "passing %qT as %<this%> "
7193 "argument discards qualifiers",
7194 TREE_TYPE (argtype
)))
7195 inform (DECL_SOURCE_LOCATION (fn
), " in call to %qD", fn
);
7198 return error_mark_node
;
7201 /* See if the function member or the whole class type is declared
7202 final and the call can be devirtualized. */
7203 if (DECL_FINAL_P (fn
)
7204 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
7205 flags
|= LOOKUP_NONVIRTUAL
;
7207 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
7208 X is called for an object that is not of type X, or of a type
7209 derived from X, the behavior is undefined.
7211 So we can assume that anything passed as 'this' is non-null, and
7212 optimize accordingly. */
7213 gcc_assert (TYPE_PTR_P (parmtype
));
7214 /* Convert to the base in which the function was declared. */
7215 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
7216 converted_arg
= build_base_path (PLUS_EXPR
,
7218 cand
->conversion_path
,
7220 /* Check that the base class is accessible. */
7221 if (!accessible_base_p (TREE_TYPE (argtype
),
7222 BINFO_TYPE (cand
->conversion_path
), true))
7224 if (complain
& tf_error
)
7225 error ("%qT is not an accessible base of %qT",
7226 BINFO_TYPE (cand
->conversion_path
),
7227 TREE_TYPE (argtype
));
7229 return error_mark_node
;
7231 /* If fn was found by a using declaration, the conversion path
7232 will be to the derived class, not the base declaring fn. We
7233 must convert from derived to base. */
7234 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
7235 TREE_TYPE (parmtype
), ba_unique
,
7237 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
7238 base_binfo
, 1, complain
);
7240 argarray
[j
++] = converted_arg
;
7241 parm
= TREE_CHAIN (parm
);
7242 if (first_arg
!= NULL_TREE
)
7243 first_arg
= NULL_TREE
;
7250 gcc_assert (first_arg
== NULL_TREE
);
7251 for (; arg_index
< vec_safe_length (args
) && parm
;
7252 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
7254 tree type
= TREE_VALUE (parm
);
7255 tree arg
= (*args
)[arg_index
];
7256 bool conversion_warning
= true;
7260 /* If the argument is NULL and used to (implicitly) instantiate a
7261 template function (and bind one of the template arguments to
7262 the type of 'long int'), we don't want to warn about passing NULL
7263 to non-pointer argument.
7264 For example, if we have this template function:
7266 template<typename T> void func(T x) {}
7268 we want to warn (when -Wconversion is enabled) in this case:
7274 but not in this case:
7280 if (arg
== null_node
7281 && DECL_TEMPLATE_INFO (fn
)
7282 && cand
->template_decl
7283 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
7284 conversion_warning
= false;
7286 /* Warn about initializer_list deduction that isn't currently in the
7288 if (cxx_dialect
> cxx98
7289 && flag_deduce_init_list
7290 && cand
->template_decl
7291 && is_std_init_list (non_reference (type
))
7292 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
7294 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
7295 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
7296 tree patparm
= get_pattern_parm (realparm
, tmpl
);
7297 tree pattype
= TREE_TYPE (patparm
);
7298 if (PACK_EXPANSION_P (pattype
))
7299 pattype
= PACK_EXPANSION_PATTERN (pattype
);
7300 pattype
= non_reference (pattype
);
7302 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
7303 && (cand
->explicit_targs
== NULL_TREE
7304 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
7305 <= TEMPLATE_TYPE_IDX (pattype
))))
7307 pedwarn (input_location
, 0, "deducing %qT as %qT",
7308 non_reference (TREE_TYPE (patparm
)),
7309 non_reference (type
));
7310 pedwarn (input_location
, 0, " in call to %q+D", cand
->fn
);
7311 pedwarn (input_location
, 0,
7312 " (you can disable this with -fno-deduce-init-list)");
7315 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
7318 : complain
& (~tf_warning
));
7320 val
= convert_for_arg_passing (type
, val
, complain
);
7322 if (val
== error_mark_node
)
7323 return error_mark_node
;
7325 argarray
[j
++] = val
;
7328 /* Default arguments */
7329 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
7331 if (TREE_VALUE (parm
) == error_mark_node
)
7332 return error_mark_node
;
7333 argarray
[j
++] = convert_default_arg (TREE_VALUE (parm
),
7334 TREE_PURPOSE (parm
),
7340 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
7342 tree a
= (*args
)[arg_index
];
7343 if (magic_varargs_p (fn
))
7344 /* Do no conversions for magic varargs. */
7345 a
= mark_type_use (a
);
7346 else if (DECL_CONSTRUCTOR_P (fn
)
7347 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn
),
7350 /* Avoid infinite recursion trying to call A(...). */
7351 if (complain
& tf_error
)
7352 /* Try to call the actual copy constructor for a good error. */
7353 call_copy_ctor (a
, complain
);
7354 return error_mark_node
;
7357 a
= convert_arg_to_ellipsis (a
, complain
);
7361 gcc_assert (j
<= nargs
);
7364 check_function_arguments (TREE_TYPE (fn
), nargs
, argarray
);
7366 /* Avoid actually calling copy constructors and copy assignment operators,
7369 if (! flag_elide_constructors
)
7370 /* Do things the hard way. */;
7371 else if (cand
->num_convs
== 1
7372 && (DECL_COPY_CONSTRUCTOR_P (fn
)
7373 || DECL_MOVE_CONSTRUCTOR_P (fn
))
7374 /* It's unsafe to elide the constructor when handling
7375 a noexcept-expression, it may evaluate to the wrong
7376 value (c++/53025). */
7377 && cp_noexcept_operand
== 0)
7380 tree arg
= argarray
[num_artificial_parms_for (fn
)];
7382 bool trivial
= trivial_fn_p (fn
);
7384 /* Pull out the real argument, disregarding const-correctness. */
7386 while (CONVERT_EXPR_P (targ
)
7387 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
7388 targ
= TREE_OPERAND (targ
, 0);
7389 if (TREE_CODE (targ
) == ADDR_EXPR
)
7391 targ
= TREE_OPERAND (targ
, 0);
7392 if (!same_type_ignoring_top_level_qualifiers_p
7393 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
7402 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
7404 /* [class.copy]: the copy constructor is implicitly defined even if
7405 the implementation elided its use. */
7406 if (!trivial
|| DECL_DELETED_FN (fn
))
7408 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
7409 return error_mark_node
;
7410 already_used
= true;
7413 /* If we're creating a temp and we already have one, don't create a
7414 new one. If we're not creating a temp but we get one, use
7415 INIT_EXPR to collapse the temp into our target. Otherwise, if the
7416 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
7417 temp or an INIT_EXPR otherwise. */
7419 if (is_dummy_object (fa
))
7421 if (TREE_CODE (arg
) == TARGET_EXPR
)
7424 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
7426 else if (TREE_CODE (arg
) == TARGET_EXPR
|| trivial
)
7428 tree to
= stabilize_reference (cp_build_indirect_ref (fa
, RO_NULL
,
7431 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
7435 else if (DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
7436 && trivial_fn_p (fn
)
7437 && !DECL_DELETED_FN (fn
))
7439 tree to
= stabilize_reference
7440 (cp_build_indirect_ref (argarray
[0], RO_NULL
, complain
));
7441 tree type
= TREE_TYPE (to
);
7442 tree as_base
= CLASSTYPE_AS_BASE (type
);
7443 tree arg
= argarray
[1];
7445 if (is_really_empty_class (type
))
7447 /* Avoid copying empty classes. */
7448 val
= build2 (COMPOUND_EXPR
, void_type_node
, to
, arg
);
7449 TREE_NO_WARNING (val
) = 1;
7450 val
= build2 (COMPOUND_EXPR
, type
, val
, to
);
7451 TREE_NO_WARNING (val
) = 1;
7453 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
7455 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
7456 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
7460 /* We must only copy the non-tail padding parts. */
7462 tree array_type
, alias_set
;
7464 arg2
= TYPE_SIZE_UNIT (as_base
);
7465 arg0
= cp_build_addr_expr (to
, complain
);
7467 array_type
= build_array_type (char_type_node
,
7469 (size_binop (MINUS_EXPR
,
7470 arg2
, size_int (1))));
7471 alias_set
= build_int_cst (build_pointer_type (type
), 0);
7472 t
= build2 (MODIFY_EXPR
, void_type_node
,
7473 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
7474 build2 (MEM_REF
, array_type
, arg
, alias_set
));
7475 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
7476 TREE_NO_WARNING (val
) = 1;
7481 else if (DECL_DESTRUCTOR_P (fn
)
7482 && trivial_fn_p (fn
)
7483 && !DECL_DELETED_FN (fn
))
7484 return fold_convert (void_type_node
, argarray
[0]);
7485 /* FIXME handle trivial default constructor, too. */
7487 /* For calls to a multi-versioned function, overload resolution
7488 returns the function with the highest target priority, that is,
7489 the version that will checked for dispatching first. If this
7490 version is inlinable, a direct call to this version can be made
7491 otherwise the call should go through the dispatcher. */
7493 if (DECL_FUNCTION_VERSIONED (fn
)
7494 && (current_function_decl
== NULL
7495 || !targetm
.target_option
.can_inline_p (current_function_decl
, fn
)))
7497 fn
= get_function_version_dispatcher (fn
);
7501 mark_versions_used (fn
);
7505 && !mark_used (fn
, complain
))
7506 return error_mark_node
;
7508 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0
7509 /* Don't mess with virtual lookup in instantiate_non_dependent_expr;
7510 virtual functions can't be constexpr. */
7511 && !in_template_function ())
7514 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
7516 ba_any
, NULL
, complain
);
7517 gcc_assert (binfo
&& binfo
!= error_mark_node
);
7519 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
7521 if (TREE_SIDE_EFFECTS (argarray
[0]))
7522 argarray
[0] = save_expr (argarray
[0]);
7523 t
= build_pointer_type (TREE_TYPE (fn
));
7524 if (DECL_CONTEXT (fn
) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn
)))
7525 fn
= build_java_interface_fn_ref (fn
, argarray
[0]);
7527 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
7532 fn
= build_addr_func (fn
, complain
);
7533 if (fn
== error_mark_node
)
7534 return error_mark_node
;
7537 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
7538 if (TREE_CODE (call
) == CALL_EXPR
7539 && (cand
->flags
& LOOKUP_LIST_INIT_CTOR
))
7540 CALL_EXPR_LIST_INIT_P (call
) = true;
7544 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
7545 This function performs no overload resolution, conversion, or other
7546 high-level operations. */
7549 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
7550 tsubst_flags_t complain
)
7555 /* Remember roughly where this call is. */
7556 location_t loc
= EXPR_LOC_OR_LOC (fn
, input_location
);
7557 fn
= build_call_a (fn
, nargs
, argarray
);
7558 SET_EXPR_LOCATION (fn
, loc
);
7560 fndecl
= get_callee_fndecl (fn
);
7562 /* Check that arguments to builtin functions match the expectations. */
7564 && DECL_BUILT_IN (fndecl
)
7565 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
7566 && !check_builtin_function_arguments (fndecl
, nargs
, argarray
))
7567 return error_mark_node
;
7569 /* If it is a built-in array notation function, then the return type of
7570 the function is the element type of the array passed in as array
7571 notation (i.e. the first parameter of the function). */
7572 if (flag_cilkplus
&& TREE_CODE (fn
) == CALL_EXPR
)
7574 enum built_in_function bif
=
7575 is_cilkplus_reduce_builtin (CALL_EXPR_FN (fn
));
7576 if (bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_ADD
7577 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MUL
7578 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MAX
7579 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MIN
7580 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE
7581 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MUTATING
)
7583 if (call_expr_nargs (fn
) == 0)
7585 error_at (EXPR_LOCATION (fn
), "Invalid builtin arguments");
7586 return error_mark_node
;
7588 /* for bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_ZERO or
7589 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_ZERO or
7590 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_NONZERO or
7591 BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_NONZERO or
7592 BUILT_IN_CILKPLUS_SEC_REDUCE_MIN_IND or
7593 BUILT_IN_CILKPLUS_SEC_REDUCE_MAX_IND
7594 The pre-defined return-type is the correct one. */
7595 tree array_ntn
= CALL_EXPR_ARG (fn
, 0);
7596 TREE_TYPE (fn
) = TREE_TYPE (array_ntn
);
7601 /* Some built-in function calls will be evaluated at compile-time in
7602 fold (). Set optimize to 1 when folding __builtin_constant_p inside
7603 a constexpr function so that fold_builtin_1 doesn't fold it to 0. */
7604 optimize_sav
= optimize
;
7605 if (!optimize
&& fndecl
&& DECL_IS_BUILTIN_CONSTANT_P (fndecl
)
7606 && current_function_decl
7607 && DECL_DECLARED_CONSTEXPR_P (current_function_decl
))
7609 fn
= fold_if_not_in_template (fn
);
7610 optimize
= optimize_sav
;
7612 if (VOID_TYPE_P (TREE_TYPE (fn
)))
7615 /* 5.2.2/11: If a function call is a prvalue of object type: if the
7616 function call is either the operand of a decltype-specifier or the
7617 right operand of a comma operator that is the operand of a
7618 decltype-specifier, a temporary object is not introduced for the
7619 prvalue. The type of the prvalue may be incomplete. */
7620 if (!(complain
& tf_decltype
))
7622 fn
= require_complete_type_sfinae (fn
, complain
);
7623 if (fn
== error_mark_node
)
7624 return error_mark_node
;
7626 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
7627 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
7629 return convert_from_reference (fn
);
7632 static GTY(()) tree java_iface_lookup_fn
;
7634 /* Make an expression which yields the address of the Java interface
7635 method FN. This is achieved by generating a call to libjava's
7636 _Jv_LookupInterfaceMethodIdx(). */
7639 build_java_interface_fn_ref (tree fn
, tree instance
)
7641 tree lookup_fn
, method
, idx
;
7642 tree klass_ref
, iface
, iface_ref
;
7645 if (!java_iface_lookup_fn
)
7647 tree ftype
= build_function_type_list (ptr_type_node
,
7648 ptr_type_node
, ptr_type_node
,
7649 java_int_type_node
, NULL_TREE
);
7650 java_iface_lookup_fn
7651 = add_builtin_function ("_Jv_LookupInterfaceMethodIdx", ftype
,
7652 0, NOT_BUILT_IN
, NULL
, NULL_TREE
);
7655 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
7656 This is the first entry in the vtable. */
7657 klass_ref
= build_vtbl_ref (cp_build_indirect_ref (instance
, RO_NULL
,
7658 tf_warning_or_error
),
7661 /* Get the java.lang.Class pointer for the interface being called. */
7662 iface
= DECL_CONTEXT (fn
);
7663 iface_ref
= lookup_field (iface
, get_identifier ("class$"), 0, false);
7664 if (!iface_ref
|| !VAR_P (iface_ref
)
7665 || DECL_CONTEXT (iface_ref
) != iface
)
7667 error ("could not find class$ field in java interface type %qT",
7669 return error_mark_node
;
7671 iface_ref
= build_address (iface_ref
);
7672 iface_ref
= convert (build_pointer_type (iface
), iface_ref
);
7674 /* Determine the itable index of FN. */
7676 for (method
= TYPE_METHODS (iface
); method
; method
= DECL_CHAIN (method
))
7678 if (!DECL_VIRTUAL_P (method
))
7684 idx
= build_int_cst (NULL_TREE
, i
);
7686 lookup_fn
= build1 (ADDR_EXPR
,
7687 build_pointer_type (TREE_TYPE (java_iface_lookup_fn
)),
7688 java_iface_lookup_fn
);
7689 return build_call_nary (ptr_type_node
, lookup_fn
,
7690 3, klass_ref
, iface_ref
, idx
);
7693 /* Returns the value to use for the in-charge parameter when making a
7694 call to a function with the indicated NAME.
7696 FIXME:Can't we find a neater way to do this mapping? */
7699 in_charge_arg_for_name (tree name
)
7701 if (name
== base_ctor_identifier
7702 || name
== base_dtor_identifier
)
7703 return integer_zero_node
;
7704 else if (name
== complete_ctor_identifier
)
7705 return integer_one_node
;
7706 else if (name
== complete_dtor_identifier
)
7707 return integer_two_node
;
7708 else if (name
== deleting_dtor_identifier
)
7709 return integer_three_node
;
7711 /* This function should only be called with one of the names listed
7717 /* Build a call to a constructor, destructor, or an assignment
7718 operator for INSTANCE, an expression with class type. NAME
7719 indicates the special member function to call; *ARGS are the
7720 arguments. ARGS may be NULL. This may change ARGS. BINFO
7721 indicates the base of INSTANCE that is to be passed as the `this'
7722 parameter to the member function called.
7724 FLAGS are the LOOKUP_* flags to use when processing the call.
7726 If NAME indicates a complete object constructor, INSTANCE may be
7727 NULL_TREE. In this case, the caller will call build_cplus_new to
7728 store the newly constructed object into a VAR_DECL. */
7731 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
7732 tree binfo
, int flags
, tsubst_flags_t complain
)
7735 /* The type of the subobject to be constructed or destroyed. */
7737 vec
<tree
, va_gc
> *allocated
= NULL
;
7740 gcc_assert (name
== complete_ctor_identifier
7741 || name
== base_ctor_identifier
7742 || name
== complete_dtor_identifier
7743 || name
== base_dtor_identifier
7744 || name
== deleting_dtor_identifier
7745 || name
== ansi_assopname (NOP_EXPR
));
7748 /* Resolve the name. */
7749 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
7750 return error_mark_node
;
7752 binfo
= TYPE_BINFO (binfo
);
7755 gcc_assert (binfo
!= NULL_TREE
);
7757 class_type
= BINFO_TYPE (binfo
);
7759 /* Handle the special case where INSTANCE is NULL_TREE. */
7760 if (name
== complete_ctor_identifier
&& !instance
)
7761 instance
= build_dummy_object (class_type
);
7764 if (name
== complete_dtor_identifier
7765 || name
== base_dtor_identifier
7766 || name
== deleting_dtor_identifier
)
7767 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
7769 /* Convert to the base class, if necessary. */
7770 if (!same_type_ignoring_top_level_qualifiers_p
7771 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
7773 if (name
!= ansi_assopname (NOP_EXPR
))
7774 /* For constructors and destructors, either the base is
7775 non-virtual, or it is virtual but we are doing the
7776 conversion from a constructor or destructor for the
7777 complete object. In either case, we can convert
7779 instance
= convert_to_base_statically (instance
, binfo
);
7781 /* However, for assignment operators, we must convert
7782 dynamically if the base is virtual. */
7783 instance
= build_base_path (PLUS_EXPR
, instance
,
7784 binfo
, /*nonnull=*/1, complain
);
7788 gcc_assert (instance
!= NULL_TREE
);
7790 fns
= lookup_fnfields (binfo
, name
, 1);
7792 /* When making a call to a constructor or destructor for a subobject
7793 that uses virtual base classes, pass down a pointer to a VTT for
7795 if ((name
== base_ctor_identifier
7796 || name
== base_dtor_identifier
)
7797 && CLASSTYPE_VBASECLASSES (class_type
))
7802 /* If the current function is a complete object constructor
7803 or destructor, then we fetch the VTT directly.
7804 Otherwise, we look it up using the VTT we were given. */
7805 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
7806 vtt
= decay_conversion (vtt
, complain
);
7807 if (vtt
== error_mark_node
)
7808 return error_mark_node
;
7809 vtt
= build3 (COND_EXPR
, TREE_TYPE (vtt
),
7810 build2 (EQ_EXPR
, boolean_type_node
,
7811 current_in_charge_parm
, integer_zero_node
),
7814 if (BINFO_SUBVTT_INDEX (binfo
))
7815 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
7821 allocated
= make_tree_vector ();
7825 vec_safe_insert (*args
, 0, sub_vtt
);
7828 ret
= build_new_method_call (instance
, fns
, args
,
7829 TYPE_BINFO (BINFO_TYPE (binfo
)),
7833 if (allocated
!= NULL
)
7834 release_tree_vector (allocated
);
7836 if ((complain
& tf_error
)
7837 && (flags
& LOOKUP_DELEGATING_CONS
)
7838 && name
== complete_ctor_identifier
7839 && TREE_CODE (ret
) == CALL_EXPR
7840 && (DECL_ABSTRACT_ORIGIN (TREE_OPERAND (CALL_EXPR_FN (ret
), 0))
7841 == current_function_decl
))
7842 error ("constructor delegates to itself");
7847 /* Return the NAME, as a C string. The NAME indicates a function that
7848 is a member of TYPE. *FREE_P is set to true if the caller must
7849 free the memory returned.
7851 Rather than go through all of this, we should simply set the names
7852 of constructors and destructors appropriately, and dispense with
7853 ctor_identifier, dtor_identifier, etc. */
7856 name_as_c_string (tree name
, tree type
, bool *free_p
)
7860 /* Assume that we will not allocate memory. */
7862 /* Constructors and destructors are special. */
7863 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
7866 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
))));
7867 /* For a destructor, add the '~'. */
7868 if (name
== complete_dtor_identifier
7869 || name
== base_dtor_identifier
7870 || name
== deleting_dtor_identifier
)
7872 pretty_name
= concat ("~", pretty_name
, NULL
);
7873 /* Remember that we need to free the memory allocated. */
7877 else if (IDENTIFIER_TYPENAME_P (name
))
7879 pretty_name
= concat ("operator ",
7880 type_as_string_translate (TREE_TYPE (name
),
7881 TFF_PLAIN_IDENTIFIER
),
7883 /* Remember that we need to free the memory allocated. */
7887 pretty_name
= CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name
)));
7892 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
7893 be set, upon return, to the function called. ARGS may be NULL.
7894 This may change ARGS. */
7897 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
7898 tree conversion_path
, int flags
,
7899 tree
*fn_p
, tsubst_flags_t complain
)
7901 struct z_candidate
*candidates
= 0, *cand
;
7902 tree explicit_targs
= NULL_TREE
;
7903 tree basetype
= NULL_TREE
;
7904 tree access_binfo
, binfo
;
7906 tree first_mem_arg
= NULL_TREE
;
7908 bool skip_first_for_error
;
7909 vec
<tree
, va_gc
> *user_args
;
7912 int template_only
= 0;
7916 vec
<tree
, va_gc
> *orig_args
= NULL
;
7919 gcc_assert (instance
!= NULL_TREE
);
7921 /* We don't know what function we're going to call, yet. */
7925 if (error_operand_p (instance
)
7926 || !fns
|| error_operand_p (fns
))
7927 return error_mark_node
;
7929 if (!BASELINK_P (fns
))
7931 if (complain
& tf_error
)
7932 error ("call to non-function %qD", fns
);
7933 return error_mark_node
;
7936 orig_instance
= instance
;
7939 /* Dismantle the baselink to collect all the information we need. */
7940 if (!conversion_path
)
7941 conversion_path
= BASELINK_BINFO (fns
);
7942 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
7943 binfo
= BASELINK_BINFO (fns
);
7944 optype
= BASELINK_OPTYPE (fns
);
7945 fns
= BASELINK_FUNCTIONS (fns
);
7946 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
7948 explicit_targs
= TREE_OPERAND (fns
, 1);
7949 fns
= TREE_OPERAND (fns
, 0);
7952 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
7953 || TREE_CODE (fns
) == TEMPLATE_DECL
7954 || TREE_CODE (fns
) == OVERLOAD
);
7955 fn
= get_first_fn (fns
);
7956 name
= DECL_NAME (fn
);
7958 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
7959 gcc_assert (CLASS_TYPE_P (basetype
));
7961 if (processing_template_decl
)
7963 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
7964 instance
= build_non_dependent_expr (instance
);
7966 make_args_non_dependent (*args
);
7969 user_args
= args
== NULL
? NULL
: *args
;
7970 /* Under DR 147 A::A() is an invalid constructor call,
7971 not a functional cast. */
7972 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
7974 if (! (complain
& tf_error
))
7975 return error_mark_node
;
7977 if (permerror (input_location
,
7978 "cannot call constructor %<%T::%D%> directly",
7980 inform (input_location
, "for a function-style cast, remove the "
7981 "redundant %<::%D%>", name
);
7982 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
7987 /* Figure out whether to skip the first argument for the error
7988 message we will display to users if an error occurs. We don't
7989 want to display any compiler-generated arguments. The "this"
7990 pointer hasn't been added yet. However, we must remove the VTT
7991 pointer if this is a call to a base-class constructor or
7993 skip_first_for_error
= false;
7994 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
7996 /* Callers should explicitly indicate whether they want to construct
7997 the complete object or just the part without virtual bases. */
7998 gcc_assert (name
!= ctor_identifier
);
7999 /* Similarly for destructors. */
8000 gcc_assert (name
!= dtor_identifier
);
8001 /* Remove the VTT pointer, if present. */
8002 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
8003 && CLASSTYPE_VBASECLASSES (basetype
))
8004 skip_first_for_error
= true;
8007 /* Process the argument list. */
8008 if (args
!= NULL
&& *args
!= NULL
)
8010 *args
= resolve_args (*args
, complain
);
8012 return error_mark_node
;
8015 /* Consider the object argument to be used even if we end up selecting a
8016 static member function. */
8017 instance
= mark_type_use (instance
);
8019 /* It's OK to call destructors and constructors on cv-qualified objects.
8020 Therefore, convert the INSTANCE to the unqualified type, if
8022 if (DECL_DESTRUCTOR_P (fn
)
8023 || DECL_CONSTRUCTOR_P (fn
))
8025 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
8027 instance
= build_this (instance
);
8028 instance
= build_nop (build_pointer_type (basetype
), instance
);
8029 instance
= build_fold_indirect_ref (instance
);
8032 if (DECL_DESTRUCTOR_P (fn
))
8033 name
= complete_dtor_identifier
;
8035 /* For the overload resolution we need to find the actual `this`
8036 that would be captured if the call turns out to be to a
8037 non-static member function. Do not actually capture it at this
8039 if (DECL_CONSTRUCTOR_P (fn
))
8040 /* Constructors don't use the enclosing 'this'. */
8041 first_mem_arg
= instance
;
8043 first_mem_arg
= maybe_resolve_dummy (instance
, false);
8045 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8046 p
= conversion_obstack_alloc (0);
8048 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
8049 initializer, not T({ }). */
8050 if (DECL_CONSTRUCTOR_P (fn
) && args
!= NULL
&& !vec_safe_is_empty (*args
)
8051 && DIRECT_LIST_INIT_P ((**args
)[0]))
8053 tree init_list
= (**args
)[0];
8054 tree init
= NULL_TREE
;
8056 gcc_assert ((*args
)->length () == 1
8057 && !(flags
& LOOKUP_ONLYCONVERTING
));
8059 /* If the initializer list has no elements and T is a class type with
8060 a default constructor, the object is value-initialized. Handle
8061 this here so we don't need to handle it wherever we use
8062 build_special_member_call. */
8063 if (CONSTRUCTOR_NELTS (init_list
) == 0
8064 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
8065 /* For a user-provided default constructor, use the normal
8066 mechanisms so that protected access works. */
8067 && type_has_non_user_provided_default_constructor (basetype
)
8068 && !processing_template_decl
)
8069 init
= build_value_init (basetype
, complain
);
8071 /* If BASETYPE is an aggregate, we need to do aggregate
8073 else if (CP_AGGREGATE_TYPE_P (basetype
))
8074 init
= digest_init (basetype
, init_list
, complain
);
8078 if (is_dummy_object (instance
))
8079 return get_target_expr_sfinae (init
, complain
);
8080 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
8081 TREE_SIDE_EFFECTS (init
) = true;
8085 /* Otherwise go ahead with overload resolution. */
8086 add_list_candidates (fns
, first_mem_arg
, init_list
,
8087 basetype
, explicit_targs
, template_only
,
8088 conversion_path
, access_binfo
, flags
,
8089 &candidates
, complain
);
8093 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
8094 explicit_targs
, template_only
, conversion_path
,
8095 access_binfo
, flags
, &candidates
, complain
);
8097 any_viable_p
= false;
8098 candidates
= splice_viable (candidates
, false, &any_viable_p
);
8102 if (complain
& tf_error
)
8104 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
8105 cxx_incomplete_type_error (instance
, basetype
);
8107 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
8108 basetype
, optype
, build_tree_list_vec (user_args
),
8109 TREE_TYPE (instance
));
8116 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
8117 arglist
= build_tree_list_vec (user_args
);
8118 if (skip_first_for_error
)
8119 arglist
= TREE_CHAIN (arglist
);
8120 error ("no matching function for call to %<%T::%s(%A)%#V%>",
8121 basetype
, pretty_name
, arglist
,
8122 TREE_TYPE (instance
));
8126 print_z_candidates (location_of (name
), candidates
);
8128 call
= error_mark_node
;
8132 cand
= tourney (candidates
, complain
);
8139 if (complain
& tf_error
)
8141 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
8142 arglist
= build_tree_list_vec (user_args
);
8143 if (skip_first_for_error
)
8144 arglist
= TREE_CHAIN (arglist
);
8145 if (!any_strictly_viable (candidates
))
8146 error ("no matching function for call to %<%s(%A)%>",
8147 pretty_name
, arglist
);
8149 error ("call of overloaded %<%s(%A)%> is ambiguous",
8150 pretty_name
, arglist
);
8151 print_z_candidates (location_of (name
), candidates
);
8155 call
= error_mark_node
;
8162 if (!(flags
& LOOKUP_NONVIRTUAL
)
8163 && DECL_PURE_VIRTUAL_P (fn
)
8164 && instance
== current_class_ref
8165 && (complain
& tf_warning
))
8167 /* This is not an error, it is runtime undefined
8169 if (!current_function_decl
)
8170 warning (0, "pure virtual %q#D called from "
8171 "non-static data member initializer", fn
);
8172 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
8173 || DECL_DESTRUCTOR_P (current_function_decl
))
8174 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
8175 ? "pure virtual %q#D called from constructor"
8176 : "pure virtual %q#D called from destructor"),
8180 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
8181 && !DECL_CONSTRUCTOR_P (fn
)
8182 && is_dummy_object (instance
))
8184 instance
= maybe_resolve_dummy (instance
, true);
8185 if (instance
== error_mark_node
)
8186 call
= error_mark_node
;
8187 else if (!is_dummy_object (instance
))
8189 /* We captured 'this' in the current lambda now that
8190 we know we really need it. */
8191 cand
->first_arg
= instance
;
8195 if (complain
& tf_error
)
8196 error ("cannot call member function %qD without object",
8198 call
= error_mark_node
;
8202 if (call
!= error_mark_node
)
8204 /* Optimize away vtable lookup if we know that this
8205 function can't be overridden. We need to check if
8206 the context and the type where we found fn are the same,
8207 actually FN might be defined in a different class
8208 type because of a using-declaration. In this case, we
8209 do not want to perform a non-virtual call. */
8210 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
8211 && same_type_ignoring_top_level_qualifiers_p
8212 (DECL_CONTEXT (fn
), BINFO_TYPE (binfo
))
8213 && resolves_to_fixed_type_p (instance
, 0))
8214 flags
|= LOOKUP_NONVIRTUAL
;
8216 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
8217 /* Now we know what function is being called. */
8220 /* Build the actual CALL_EXPR. */
8221 call
= build_over_call (cand
, flags
, complain
);
8222 /* In an expression of the form `a->f()' where `f' turns
8223 out to be a static member function, `a' is
8224 none-the-less evaluated. */
8225 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
8226 && !is_dummy_object (instance
)
8227 && TREE_SIDE_EFFECTS (instance
))
8228 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
),
8230 else if (call
!= error_mark_node
8231 && DECL_DESTRUCTOR_P (cand
->fn
)
8232 && !VOID_TYPE_P (TREE_TYPE (call
)))
8233 /* An explicit call of the form "x->~X()" has type
8234 "void". However, on platforms where destructors
8235 return "this" (i.e., those where
8236 targetm.cxx.cdtor_returns_this is true), such calls
8237 will appear to have a return value of pointer type
8238 to the low-level call machinery. We do not want to
8239 change the low-level machinery, since we want to be
8240 able to optimize "delete f()" on such platforms as
8241 "operator delete(~X(f()))" (rather than generating
8242 "t = f(), ~X(t), operator delete (t)"). */
8243 call
= build_nop (void_type_node
, call
);
8248 if (processing_template_decl
&& call
!= error_mark_node
)
8250 bool cast_to_void
= false;
8252 if (TREE_CODE (call
) == COMPOUND_EXPR
)
8253 call
= TREE_OPERAND (call
, 1);
8254 else if (TREE_CODE (call
) == NOP_EXPR
)
8256 cast_to_void
= true;
8257 call
= TREE_OPERAND (call
, 0);
8259 if (INDIRECT_REF_P (call
))
8260 call
= TREE_OPERAND (call
, 0);
8261 call
= (build_min_non_dep_call_vec
8263 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
8264 orig_instance
, orig_fns
, NULL_TREE
),
8266 SET_EXPR_LOCATION (call
, input_location
);
8267 call
= convert_from_reference (call
);
8269 call
= build_nop (void_type_node
, call
);
8272 /* Free all the conversions we allocated. */
8273 obstack_free (&conversion_obstack
, p
);
8275 if (orig_args
!= NULL
)
8276 release_tree_vector (orig_args
);
8281 /* Wrapper for above. */
8284 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
8285 tree conversion_path
, int flags
,
8286 tree
*fn_p
, tsubst_flags_t complain
)
8289 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
8290 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
8292 timevar_cond_stop (TV_OVERLOAD
, subtime
);
8296 /* Returns true iff standard conversion sequence ICS1 is a proper
8297 subsequence of ICS2. */
8300 is_subseq (conversion
*ics1
, conversion
*ics2
)
8302 /* We can assume that a conversion of the same code
8303 between the same types indicates a subsequence since we only get
8304 here if the types we are converting from are the same. */
8306 while (ics1
->kind
== ck_rvalue
8307 || ics1
->kind
== ck_lvalue
)
8308 ics1
= next_conversion (ics1
);
8312 while (ics2
->kind
== ck_rvalue
8313 || ics2
->kind
== ck_lvalue
)
8314 ics2
= next_conversion (ics2
);
8316 if (ics2
->kind
== ck_user
8317 || ics2
->kind
== ck_ambig
8318 || ics2
->kind
== ck_aggr
8319 || ics2
->kind
== ck_list
8320 || ics2
->kind
== ck_identity
)
8321 /* At this point, ICS1 cannot be a proper subsequence of
8322 ICS2. We can get a USER_CONV when we are comparing the
8323 second standard conversion sequence of two user conversion
8327 ics2
= next_conversion (ics2
);
8329 if (ics2
->kind
== ics1
->kind
8330 && same_type_p (ics2
->type
, ics1
->type
)
8331 && same_type_p (next_conversion (ics2
)->type
,
8332 next_conversion (ics1
)->type
))
8337 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
8338 be any _TYPE nodes. */
8341 is_properly_derived_from (tree derived
, tree base
)
8343 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
8346 /* We only allow proper derivation here. The DERIVED_FROM_P macro
8347 considers every class derived from itself. */
8348 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
8349 && DERIVED_FROM_P (base
, derived
));
8352 /* We build the ICS for an implicit object parameter as a pointer
8353 conversion sequence. However, such a sequence should be compared
8354 as if it were a reference conversion sequence. If ICS is the
8355 implicit conversion sequence for an implicit object parameter,
8356 modify it accordingly. */
8359 maybe_handle_implicit_object (conversion
**ics
)
8363 /* [over.match.funcs]
8365 For non-static member functions, the type of the
8366 implicit object parameter is "reference to cv X"
8367 where X is the class of which the function is a
8368 member and cv is the cv-qualification on the member
8369 function declaration. */
8370 conversion
*t
= *ics
;
8371 tree reference_type
;
8373 /* The `this' parameter is a pointer to a class type. Make the
8374 implicit conversion talk about a reference to that same class
8376 reference_type
= TREE_TYPE (t
->type
);
8377 reference_type
= build_reference_type (reference_type
);
8379 if (t
->kind
== ck_qual
)
8380 t
= next_conversion (t
);
8381 if (t
->kind
== ck_ptr
)
8382 t
= next_conversion (t
);
8383 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
8384 t
= direct_reference_binding (reference_type
, t
);
8386 t
->rvaluedness_matches_p
= 0;
8391 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
8392 and return the initial reference binding conversion. Otherwise,
8393 leave *ICS unchanged and return NULL. */
8396 maybe_handle_ref_bind (conversion
**ics
)
8398 if ((*ics
)->kind
== ck_ref_bind
)
8400 conversion
*old_ics
= *ics
;
8401 *ics
= next_conversion (old_ics
);
8402 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
8409 /* Compare two implicit conversion sequences according to the rules set out in
8410 [over.ics.rank]. Return values:
8412 1: ics1 is better than ics2
8413 -1: ics2 is better than ics1
8414 0: ics1 and ics2 are indistinguishable */
8417 compare_ics (conversion
*ics1
, conversion
*ics2
)
8423 tree deref_from_type1
= NULL_TREE
;
8424 tree deref_from_type2
= NULL_TREE
;
8425 tree deref_to_type1
= NULL_TREE
;
8426 tree deref_to_type2
= NULL_TREE
;
8427 conversion_rank rank1
, rank2
;
8429 /* REF_BINDING is nonzero if the result of the conversion sequence
8430 is a reference type. In that case REF_CONV is the reference
8431 binding conversion. */
8432 conversion
*ref_conv1
;
8433 conversion
*ref_conv2
;
8435 /* Compare badness before stripping the reference conversion. */
8436 if (ics1
->bad_p
> ics2
->bad_p
)
8438 else if (ics1
->bad_p
< ics2
->bad_p
)
8441 /* Handle implicit object parameters. */
8442 maybe_handle_implicit_object (&ics1
);
8443 maybe_handle_implicit_object (&ics2
);
8445 /* Handle reference parameters. */
8446 ref_conv1
= maybe_handle_ref_bind (&ics1
);
8447 ref_conv2
= maybe_handle_ref_bind (&ics2
);
8449 /* List-initialization sequence L1 is a better conversion sequence than
8450 list-initialization sequence L2 if L1 converts to
8451 std::initializer_list<X> for some X and L2 does not. */
8452 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
8454 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
8459 When comparing the basic forms of implicit conversion sequences (as
8460 defined in _over.best.ics_)
8462 --a standard conversion sequence (_over.ics.scs_) is a better
8463 conversion sequence than a user-defined conversion sequence
8464 or an ellipsis conversion sequence, and
8466 --a user-defined conversion sequence (_over.ics.user_) is a
8467 better conversion sequence than an ellipsis conversion sequence
8468 (_over.ics.ellipsis_). */
8469 /* Use BAD_CONVERSION_RANK because we already checked for a badness
8470 mismatch. If both ICS are bad, we try to make a decision based on
8471 what would have happened if they'd been good. This is not an
8472 extension, we'll still give an error when we build up the call; this
8473 just helps us give a more helpful error message. */
8474 rank1
= BAD_CONVERSION_RANK (ics1
);
8475 rank2
= BAD_CONVERSION_RANK (ics2
);
8479 else if (rank1
< rank2
)
8482 if (ics1
->ellipsis_p
)
8483 /* Both conversions are ellipsis conversions. */
8486 /* User-defined conversion sequence U1 is a better conversion sequence
8487 than another user-defined conversion sequence U2 if they contain the
8488 same user-defined conversion operator or constructor and if the sec-
8489 ond standard conversion sequence of U1 is better than the second
8490 standard conversion sequence of U2. */
8492 /* Handle list-conversion with the same code even though it isn't always
8493 ranked as a user-defined conversion and it doesn't have a second
8494 standard conversion sequence; it will still have the desired effect.
8495 Specifically, we need to do the reference binding comparison at the
8496 end of this function. */
8498 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
|| ics1
->kind
== ck_aggr
)
8503 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
8504 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
8505 || t1
->kind
== ck_list
)
8507 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
8508 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
8509 || t2
->kind
== ck_list
)
8512 if (t1
->kind
!= t2
->kind
)
8514 else if (t1
->kind
== ck_user
)
8516 if (t1
->cand
->fn
!= t2
->cand
->fn
)
8521 /* For ambiguous or aggregate conversions, use the target type as
8522 a proxy for the conversion function. */
8523 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
8527 /* We can just fall through here, after setting up
8528 FROM_TYPE1 and FROM_TYPE2. */
8529 from_type1
= t1
->type
;
8530 from_type2
= t2
->type
;
8537 /* We're dealing with two standard conversion sequences.
8541 Standard conversion sequence S1 is a better conversion
8542 sequence than standard conversion sequence S2 if
8544 --S1 is a proper subsequence of S2 (comparing the conversion
8545 sequences in the canonical form defined by _over.ics.scs_,
8546 excluding any Lvalue Transformation; the identity
8547 conversion sequence is considered to be a subsequence of
8548 any non-identity conversion sequence */
8551 while (t1
->kind
!= ck_identity
)
8552 t1
= next_conversion (t1
);
8553 from_type1
= t1
->type
;
8556 while (t2
->kind
!= ck_identity
)
8557 t2
= next_conversion (t2
);
8558 from_type2
= t2
->type
;
8561 /* One sequence can only be a subsequence of the other if they start with
8562 the same type. They can start with different types when comparing the
8563 second standard conversion sequence in two user-defined conversion
8565 if (same_type_p (from_type1
, from_type2
))
8567 if (is_subseq (ics1
, ics2
))
8569 if (is_subseq (ics2
, ics1
))
8577 --the rank of S1 is better than the rank of S2 (by the rules
8580 Standard conversion sequences are ordered by their ranks: an Exact
8581 Match is a better conversion than a Promotion, which is a better
8582 conversion than a Conversion.
8584 Two conversion sequences with the same rank are indistinguishable
8585 unless one of the following rules applies:
8587 --A conversion that does not a convert a pointer, pointer to member,
8588 or std::nullptr_t to bool is better than one that does.
8590 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
8591 so that we do not have to check it explicitly. */
8592 if (ics1
->rank
< ics2
->rank
)
8594 else if (ics2
->rank
< ics1
->rank
)
8597 to_type1
= ics1
->type
;
8598 to_type2
= ics2
->type
;
8600 /* A conversion from scalar arithmetic type to complex is worse than a
8601 conversion between scalar arithmetic types. */
8602 if (same_type_p (from_type1
, from_type2
)
8603 && ARITHMETIC_TYPE_P (from_type1
)
8604 && ARITHMETIC_TYPE_P (to_type1
)
8605 && ARITHMETIC_TYPE_P (to_type2
)
8606 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
8607 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
8609 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
8615 if (TYPE_PTR_P (from_type1
)
8616 && TYPE_PTR_P (from_type2
)
8617 && TYPE_PTR_P (to_type1
)
8618 && TYPE_PTR_P (to_type2
))
8620 deref_from_type1
= TREE_TYPE (from_type1
);
8621 deref_from_type2
= TREE_TYPE (from_type2
);
8622 deref_to_type1
= TREE_TYPE (to_type1
);
8623 deref_to_type2
= TREE_TYPE (to_type2
);
8625 /* The rules for pointers to members A::* are just like the rules
8626 for pointers A*, except opposite: if B is derived from A then
8627 A::* converts to B::*, not vice versa. For that reason, we
8628 switch the from_ and to_ variables here. */
8629 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
8630 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
8631 || (TYPE_PTRMEMFUNC_P (from_type1
)
8632 && TYPE_PTRMEMFUNC_P (from_type2
)
8633 && TYPE_PTRMEMFUNC_P (to_type1
)
8634 && TYPE_PTRMEMFUNC_P (to_type2
)))
8636 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
8637 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
8638 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
8639 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
8642 if (deref_from_type1
!= NULL_TREE
8643 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
8644 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
8646 /* This was one of the pointer or pointer-like conversions.
8650 --If class B is derived directly or indirectly from class A,
8651 conversion of B* to A* is better than conversion of B* to
8652 void*, and conversion of A* to void* is better than
8653 conversion of B* to void*. */
8654 if (VOID_TYPE_P (deref_to_type1
)
8655 && VOID_TYPE_P (deref_to_type2
))
8657 if (is_properly_derived_from (deref_from_type1
,
8660 else if (is_properly_derived_from (deref_from_type2
,
8664 else if (VOID_TYPE_P (deref_to_type1
)
8665 || VOID_TYPE_P (deref_to_type2
))
8667 if (same_type_p (deref_from_type1
, deref_from_type2
))
8669 if (VOID_TYPE_P (deref_to_type2
))
8671 if (is_properly_derived_from (deref_from_type1
,
8675 /* We know that DEREF_TO_TYPE1 is `void' here. */
8676 else if (is_properly_derived_from (deref_from_type1
,
8681 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
8682 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
8686 --If class B is derived directly or indirectly from class A
8687 and class C is derived directly or indirectly from B,
8689 --conversion of C* to B* is better than conversion of C* to
8692 --conversion of B* to A* is better than conversion of C* to
8694 if (same_type_p (deref_from_type1
, deref_from_type2
))
8696 if (is_properly_derived_from (deref_to_type1
,
8699 else if (is_properly_derived_from (deref_to_type2
,
8703 else if (same_type_p (deref_to_type1
, deref_to_type2
))
8705 if (is_properly_derived_from (deref_from_type2
,
8708 else if (is_properly_derived_from (deref_from_type1
,
8714 else if (CLASS_TYPE_P (non_reference (from_type1
))
8715 && same_type_p (from_type1
, from_type2
))
8717 tree from
= non_reference (from_type1
);
8721 --binding of an expression of type C to a reference of type
8722 B& is better than binding an expression of type C to a
8723 reference of type A&
8725 --conversion of C to B is better than conversion of C to A, */
8726 if (is_properly_derived_from (from
, to_type1
)
8727 && is_properly_derived_from (from
, to_type2
))
8729 if (is_properly_derived_from (to_type1
, to_type2
))
8731 else if (is_properly_derived_from (to_type2
, to_type1
))
8735 else if (CLASS_TYPE_P (non_reference (to_type1
))
8736 && same_type_p (to_type1
, to_type2
))
8738 tree to
= non_reference (to_type1
);
8742 --binding of an expression of type B to a reference of type
8743 A& is better than binding an expression of type C to a
8744 reference of type A&,
8746 --conversion of B to A is better than conversion of C to A */
8747 if (is_properly_derived_from (from_type1
, to
)
8748 && is_properly_derived_from (from_type2
, to
))
8750 if (is_properly_derived_from (from_type2
, from_type1
))
8752 else if (is_properly_derived_from (from_type1
, from_type2
))
8759 --S1 and S2 differ only in their qualification conversion and yield
8760 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
8761 qualification signature of type T1 is a proper subset of the cv-
8762 qualification signature of type T2 */
8763 if (ics1
->kind
== ck_qual
8764 && ics2
->kind
== ck_qual
8765 && same_type_p (from_type1
, from_type2
))
8767 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
8774 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
8775 to an implicit object parameter of a non-static member function
8776 declared without a ref-qualifier, and either S1 binds an lvalue
8777 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
8778 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
8779 draft standard, 13.3.3.2)
8781 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
8782 types to which the references refer are the same type except for
8783 top-level cv-qualifiers, and the type to which the reference
8784 initialized by S2 refers is more cv-qualified than the type to
8785 which the reference initialized by S1 refers.
8787 DR 1328 [over.match.best]: the context is an initialization by
8788 conversion function for direct reference binding (13.3.1.6) of a
8789 reference to function type, the return type of F1 is the same kind of
8790 reference (i.e. lvalue or rvalue) as the reference being initialized,
8791 and the return type of F2 is not. */
8793 if (ref_conv1
&& ref_conv2
)
8795 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
8796 && (ref_conv1
->rvaluedness_matches_p
8797 != ref_conv2
->rvaluedness_matches_p
)
8798 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
8799 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
8800 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
8802 if (ref_conv1
->bad_p
8803 && !same_type_p (TREE_TYPE (ref_conv1
->type
),
8804 TREE_TYPE (ref_conv2
->type
)))
8805 /* Don't prefer a bad conversion that drops cv-quals to a bad
8806 conversion with the wrong rvalueness. */
8808 return (ref_conv1
->rvaluedness_matches_p
8809 - ref_conv2
->rvaluedness_matches_p
);
8812 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
8814 int q1
= cp_type_quals (TREE_TYPE (ref_conv1
->type
));
8815 int q2
= cp_type_quals (TREE_TYPE (ref_conv2
->type
));
8816 if (ref_conv1
->bad_p
)
8818 /* Prefer the one that drops fewer cv-quals. */
8819 tree ftype
= next_conversion (ref_conv1
)->type
;
8820 int fquals
= cp_type_quals (ftype
);
8824 return comp_cv_qualification (q2
, q1
);
8828 /* Neither conversion sequence is better than the other. */
8832 /* The source type for this standard conversion sequence. */
8835 source_type (conversion
*t
)
8837 for (;; t
= next_conversion (t
))
8839 if (t
->kind
== ck_user
8840 || t
->kind
== ck_ambig
8841 || t
->kind
== ck_identity
)
8847 /* Note a warning about preferring WINNER to LOSER. We do this by storing
8848 a pointer to LOSER and re-running joust to produce the warning if WINNER
8849 is actually used. */
8852 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
8854 candidate_warning
*cw
= (candidate_warning
*)
8855 conversion_obstack_alloc (sizeof (candidate_warning
));
8857 cw
->next
= winner
->warnings
;
8858 winner
->warnings
= cw
;
8861 /* Compare two candidates for overloading as described in
8862 [over.match.best]. Return values:
8864 1: cand1 is better than cand2
8865 -1: cand2 is better than cand1
8866 0: cand1 and cand2 are indistinguishable */
8869 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
8870 tsubst_flags_t complain
)
8873 int off1
= 0, off2
= 0;
8877 /* Candidates that involve bad conversions are always worse than those
8879 if (cand1
->viable
> cand2
->viable
)
8881 if (cand1
->viable
< cand2
->viable
)
8884 /* If we have two pseudo-candidates for conversions to the same type,
8885 or two candidates for the same function, arbitrarily pick one. */
8886 if (cand1
->fn
== cand2
->fn
8887 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
8890 /* Prefer a non-deleted function over an implicitly deleted move
8891 constructor or assignment operator. This differs slightly from the
8892 wording for issue 1402 (which says the move op is ignored by overload
8893 resolution), but this way produces better error messages. */
8894 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
8895 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
8896 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
8898 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
8899 && move_fn_p (cand1
->fn
))
8901 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
8902 && move_fn_p (cand2
->fn
))
8906 /* a viable function F1
8907 is defined to be a better function than another viable function F2 if
8908 for all arguments i, ICSi(F1) is not a worse conversion sequence than
8909 ICSi(F2), and then */
8911 /* for some argument j, ICSj(F1) is a better conversion sequence than
8914 /* For comparing static and non-static member functions, we ignore
8915 the implicit object parameter of the non-static function. The
8916 standard says to pretend that the static function has an object
8917 parm, but that won't work with operator overloading. */
8918 len
= cand1
->num_convs
;
8919 if (len
!= cand2
->num_convs
)
8921 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
8922 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
8924 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
8925 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
8926 /* We're comparing a near-match list constructor and a near-match
8927 non-list constructor. Just treat them as unordered. */
8930 gcc_assert (static_1
!= static_2
);
8941 for (i
= 0; i
< len
; ++i
)
8943 conversion
*t1
= cand1
->convs
[i
+ off1
];
8944 conversion
*t2
= cand2
->convs
[i
+ off2
];
8945 int comp
= compare_ics (t1
, t2
);
8949 if ((complain
& tf_warning
)
8951 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
8952 == cr_std
+ cr_promotion
)
8953 && t1
->kind
== ck_std
8954 && t2
->kind
== ck_std
8955 && TREE_CODE (t1
->type
) == INTEGER_TYPE
8956 && TREE_CODE (t2
->type
) == INTEGER_TYPE
8957 && (TYPE_PRECISION (t1
->type
)
8958 == TYPE_PRECISION (t2
->type
))
8959 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
8960 || (TREE_CODE (next_conversion (t1
)->type
)
8963 tree type
= next_conversion (t1
)->type
;
8965 struct z_candidate
*w
, *l
;
8967 type1
= t1
->type
, type2
= t2
->type
,
8968 w
= cand1
, l
= cand2
;
8970 type1
= t2
->type
, type2
= t1
->type
,
8971 w
= cand2
, l
= cand1
;
8975 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
8976 type
, type1
, type2
);
8977 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
8983 if (winner
&& comp
!= winner
)
8992 /* warn about confusing overload resolution for user-defined conversions,
8993 either between a constructor and a conversion op, or between two
8995 if ((complain
& tf_warning
)
8996 && winner
&& warn_conversion
&& cand1
->second_conv
8997 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
8998 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
9000 struct z_candidate
*w
, *l
;
9001 bool give_warning
= false;
9004 w
= cand1
, l
= cand2
;
9006 w
= cand2
, l
= cand1
;
9008 /* We don't want to complain about `X::operator T1 ()'
9009 beating `X::operator T2 () const', when T2 is a no less
9010 cv-qualified version of T1. */
9011 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
9012 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
9014 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
9015 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
9017 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
9022 if (!comp_ptr_ttypes (t
, f
))
9023 give_warning
= true;
9026 give_warning
= true;
9032 tree source
= source_type (w
->convs
[0]);
9033 if (! DECL_CONSTRUCTOR_P (w
->fn
))
9034 source
= TREE_TYPE (source
);
9035 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
9036 && warning (OPT_Wconversion
, " for conversion from %qT to %qT",
9037 source
, w
->second_conv
->type
))
9039 inform (input_location
, " because conversion sequence for the argument is better");
9049 /* DR 495 moved this tiebreaker above the template ones. */
9051 the context is an initialization by user-defined conversion (see
9052 _dcl.init_ and _over.match.user_) and the standard conversion
9053 sequence from the return type of F1 to the destination type (i.e.,
9054 the type of the entity being initialized) is a better conversion
9055 sequence than the standard conversion sequence from the return type
9056 of F2 to the destination type. */
9058 if (cand1
->second_conv
)
9060 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
9066 F1 is a non-template function and F2 is a template function
9069 if (!cand1
->template_decl
&& cand2
->template_decl
)
9071 else if (cand1
->template_decl
&& !cand2
->template_decl
)
9075 F1 and F2 are template functions and the function template for F1 is
9076 more specialized than the template for F2 according to the partial
9079 if (cand1
->template_decl
&& cand2
->template_decl
)
9081 winner
= more_specialized_fn
9082 (TI_TEMPLATE (cand1
->template_decl
),
9083 TI_TEMPLATE (cand2
->template_decl
),
9084 /* [temp.func.order]: The presence of unused ellipsis and default
9085 arguments has no effect on the partial ordering of function
9086 templates. add_function_candidate() will not have
9087 counted the "this" argument for constructors. */
9088 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
9093 /* Check whether we can discard a builtin candidate, either because we
9094 have two identical ones or matching builtin and non-builtin candidates.
9096 (Pedantically in the latter case the builtin which matched the user
9097 function should not be added to the overload set, but we spot it here.
9100 ... the builtin candidates include ...
9101 - do not have the same parameter type list as any non-template
9102 non-member candidate. */
9104 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
9106 for (i
= 0; i
< len
; ++i
)
9107 if (!same_type_p (cand1
->convs
[i
]->type
,
9108 cand2
->convs
[i
]->type
))
9110 if (i
== cand1
->num_convs
)
9112 if (cand1
->fn
== cand2
->fn
)
9113 /* Two built-in candidates; arbitrarily pick one. */
9115 else if (identifier_p (cand1
->fn
))
9116 /* cand1 is built-in; prefer cand2. */
9119 /* cand2 is built-in; prefer cand1. */
9124 /* For candidates of a multi-versioned function, make the version with
9125 the highest priority win. This version will be checked for dispatching
9126 first. If this version can be inlined into the caller, the front-end
9127 will simply make a direct call to this function. */
9129 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
9130 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
9131 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
9132 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
9134 tree f1
= TREE_TYPE (cand1
->fn
);
9135 tree f2
= TREE_TYPE (cand2
->fn
);
9136 tree p1
= TYPE_ARG_TYPES (f1
);
9137 tree p2
= TYPE_ARG_TYPES (f2
);
9139 /* Check if cand1->fn and cand2->fn are versions of the same function. It
9140 is possible that cand1->fn and cand2->fn are function versions but of
9141 different functions. Check types to see if they are versions of the same
9143 if (compparms (p1
, p2
)
9144 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
9146 /* Always make the version with the higher priority, more
9147 specialized, win. */
9148 gcc_assert (targetm
.compare_version_priority
);
9149 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
9156 /* If the two function declarations represent the same function (this can
9157 happen with declarations in multiple scopes and arg-dependent lookup),
9158 arbitrarily choose one. But first make sure the default args we're
9160 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
9161 && equal_functions (cand1
->fn
, cand2
->fn
))
9163 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
9164 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
9166 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
9168 for (i
= 0; i
< len
; ++i
)
9170 /* Don't crash if the fn is variadic. */
9173 parms1
= TREE_CHAIN (parms1
);
9174 parms2
= TREE_CHAIN (parms2
);
9178 parms1
= TREE_CHAIN (parms1
);
9180 parms2
= TREE_CHAIN (parms2
);
9184 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
9185 TREE_PURPOSE (parms2
)))
9189 if (complain
& tf_error
)
9191 if (permerror (input_location
,
9192 "default argument mismatch in "
9193 "overload resolution"))
9195 inform (input_location
,
9196 " candidate 1: %q+#F", cand1
->fn
);
9197 inform (input_location
,
9198 " candidate 2: %q+#F", cand2
->fn
);
9205 add_warning (cand1
, cand2
);
9208 parms1
= TREE_CHAIN (parms1
);
9209 parms2
= TREE_CHAIN (parms2
);
9217 /* Extension: If the worst conversion for one candidate is worse than the
9218 worst conversion for the other, take the first. */
9219 if (!pedantic
&& (complain
& tf_warning_or_error
))
9221 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
9222 struct z_candidate
*w
= 0, *l
= 0;
9224 for (i
= 0; i
< len
; ++i
)
9226 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
9227 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
9228 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
9229 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
9232 winner
= 1, w
= cand1
, l
= cand2
;
9234 winner
= -1, w
= cand2
, l
= cand1
;
9237 /* Don't choose a deleted function over ambiguity. */
9238 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
9242 pedwarn (input_location
, 0,
9243 "ISO C++ says that these are ambiguous, even "
9244 "though the worst conversion for the first is better than "
9245 "the worst conversion for the second:");
9246 print_z_candidate (input_location
, _("candidate 1:"), w
);
9247 print_z_candidate (input_location
, _("candidate 2:"), l
);
9255 gcc_assert (!winner
);
9259 /* Given a list of candidates for overloading, find the best one, if any.
9260 This algorithm has a worst case of O(2n) (winner is last), and a best
9261 case of O(n/2) (totally ambiguous); much better than a sorting
9264 static struct z_candidate
*
9265 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
9267 struct z_candidate
*champ
= candidates
, *challenger
;
9269 int champ_compared_to_predecessor
= 0;
9271 /* Walk through the list once, comparing each current champ to the next
9272 candidate, knocking out a candidate or two with each comparison. */
9274 for (challenger
= champ
->next
; challenger
; )
9276 fate
= joust (champ
, challenger
, 0, complain
);
9278 challenger
= challenger
->next
;
9283 champ
= challenger
->next
;
9286 champ_compared_to_predecessor
= 0;
9291 champ_compared_to_predecessor
= 1;
9294 challenger
= champ
->next
;
9298 /* Make sure the champ is better than all the candidates it hasn't yet
9299 been compared to. */
9301 for (challenger
= candidates
;
9303 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
9304 challenger
= challenger
->next
)
9306 fate
= joust (champ
, challenger
, 0, complain
);
9314 /* Returns nonzero if things of type FROM can be converted to TO. */
9317 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
9319 tree arg
= NULL_TREE
;
9320 /* implicit_conversion only considers user-defined conversions
9321 if it has an expression for the call argument list. */
9322 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
9323 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
9324 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
9327 /* Returns nonzero if things of type FROM can be converted to TO with a
9328 standard conversion. */
9331 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
9333 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
9336 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
9339 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
9340 tsubst_flags_t complain
)
9346 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9347 p
= conversion_obstack_alloc (0);
9348 /* We want to discard any access checks done for this test,
9349 as we might not be in the appropriate access context and
9350 we'll do the check again when we actually perform the
9352 push_deferring_access_checks (dk_deferred
);
9354 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
9356 ok_p
= (t
&& !t
->bad_p
);
9358 /* Discard the access checks now. */
9359 pop_deferring_access_checks ();
9360 /* Free all the conversions we allocated. */
9361 obstack_free (&conversion_obstack
, p
);
9366 /* Like can_convert_arg, but allows dubious conversions as well. */
9369 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
9370 tsubst_flags_t complain
)
9375 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9376 p
= conversion_obstack_alloc (0);
9377 /* Try to perform the conversion. */
9378 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
9380 /* Free all the conversions we allocated. */
9381 obstack_free (&conversion_obstack
, p
);
9386 /* Convert EXPR to TYPE. Return the converted expression.
9388 Note that we allow bad conversions here because by the time we get to
9389 this point we are committed to doing the conversion. If we end up
9390 doing a bad conversion, convert_like will complain. */
9393 perform_implicit_conversion_flags (tree type
, tree expr
,
9394 tsubst_flags_t complain
, int flags
)
9398 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
9400 if (error_operand_p (expr
))
9401 return error_mark_node
;
9403 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9404 p
= conversion_obstack_alloc (0);
9406 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
9412 if (complain
& tf_error
)
9414 /* If expr has unknown type, then it is an overloaded function.
9415 Call instantiate_type to get good error messages. */
9416 if (TREE_TYPE (expr
) == unknown_type_node
)
9417 instantiate_type (type
, expr
, complain
);
9418 else if (invalid_nonstatic_memfn_p (loc
, expr
, complain
))
9419 /* We gave an error. */;
9421 error_at (loc
, "could not convert %qE from %qT to %qT", expr
,
9422 TREE_TYPE (expr
), type
);
9424 expr
= error_mark_node
;
9426 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
9428 /* In a template, we are only concerned about determining the
9429 type of non-dependent expressions, so we do not have to
9430 perform the actual conversion. But for initializers, we
9431 need to be able to perform it at instantiation
9432 (or instantiate_non_dependent_expr) time. */
9433 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
9434 if (!(flags
& LOOKUP_ONLYCONVERTING
))
9435 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
9438 expr
= convert_like (conv
, expr
, complain
);
9440 /* Free all the conversions we allocated. */
9441 obstack_free (&conversion_obstack
, p
);
9447 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
9449 return perform_implicit_conversion_flags (type
, expr
, complain
,
9453 /* Convert EXPR to TYPE (as a direct-initialization) if that is
9454 permitted. If the conversion is valid, the converted expression is
9455 returned. Otherwise, NULL_TREE is returned, except in the case
9456 that TYPE is a class type; in that case, an error is issued. If
9457 C_CAST_P is true, then this direct-initialization is taking
9458 place as part of a static_cast being attempted as part of a C-style
9462 perform_direct_initialization_if_possible (tree type
,
9465 tsubst_flags_t complain
)
9470 if (type
== error_mark_node
|| error_operand_p (expr
))
9471 return error_mark_node
;
9474 If the destination type is a (possibly cv-qualified) class type:
9476 -- If the initialization is direct-initialization ...,
9477 constructors are considered. ... If no constructor applies, or
9478 the overload resolution is ambiguous, the initialization is
9480 if (CLASS_TYPE_P (type
))
9482 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
9483 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
9484 &args
, type
, LOOKUP_NORMAL
, complain
);
9485 release_tree_vector (args
);
9486 return build_cplus_new (type
, expr
, complain
);
9489 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9490 p
= conversion_obstack_alloc (0);
9492 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
9494 LOOKUP_NORMAL
, complain
);
9495 if (!conv
|| conv
->bad_p
)
9498 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0, 0,
9499 /*issue_conversion_warnings=*/false,
9503 /* Free all the conversions we allocated. */
9504 obstack_free (&conversion_obstack
, p
);
9509 /* When initializing a reference that lasts longer than a full-expression,
9510 this special rule applies:
9514 The temporary to which the reference is bound or the temporary
9515 that is the complete object to which the reference is bound
9516 persists for the lifetime of the reference.
9518 The temporaries created during the evaluation of the expression
9519 initializing the reference, except the temporary to which the
9520 reference is bound, are destroyed at the end of the
9521 full-expression in which they are created.
9523 In that case, we store the converted expression into a new
9524 VAR_DECL in a new scope.
9526 However, we want to be careful not to create temporaries when
9527 they are not required. For example, given:
9530 struct D : public B {};
9534 there is no need to copy the return value from "f"; we can just
9535 extend its lifetime. Similarly, given:
9538 struct T { operator S(); };
9542 we can extend the lifetime of the return value of the conversion
9545 The next several functions are involved in this lifetime extension. */
9547 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
9548 reference is being bound to a temporary. Create and return a new
9549 VAR_DECL with the indicated TYPE; this variable will store the value to
9550 which the reference is bound. */
9553 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
9557 /* Create the variable. */
9558 var
= create_temporary_var (type
);
9560 /* Register the variable. */
9562 && (TREE_STATIC (decl
) || DECL_THREAD_LOCAL_P (decl
)))
9564 /* Namespace-scope or local static; give it a mangled name. */
9565 /* FIXME share comdat with decl? */
9568 TREE_STATIC (var
) = TREE_STATIC (decl
);
9569 set_decl_tls_model (var
, DECL_TLS_MODEL (decl
));
9570 name
= mangle_ref_init_variable (decl
);
9571 DECL_NAME (var
) = name
;
9572 SET_DECL_ASSEMBLER_NAME (var
, name
);
9573 var
= pushdecl_top_level (var
);
9576 /* Create a new cleanup level if necessary. */
9577 maybe_push_cleanup_level (type
);
9582 /* EXPR is the initializer for a variable DECL of reference or
9583 std::initializer_list type. Create, push and return a new VAR_DECL
9584 for the initializer so that it will live as long as DECL. Any
9585 cleanup for the new variable is returned through CLEANUP, and the
9586 code to initialize the new variable is returned through INITP. */
9589 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
9596 /* Create the temporary variable. */
9597 type
= TREE_TYPE (expr
);
9598 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
9599 layout_decl (var
, 0);
9600 /* If the rvalue is the result of a function call it will be
9601 a TARGET_EXPR. If it is some other construct (such as a
9602 member access expression where the underlying object is
9603 itself the result of a function call), turn it into a
9604 TARGET_EXPR here. It is important that EXPR be a
9605 TARGET_EXPR below since otherwise the INIT_EXPR will
9606 attempt to make a bitwise copy of EXPR to initialize
9608 if (TREE_CODE (expr
) != TARGET_EXPR
)
9609 expr
= get_target_expr (expr
);
9611 if (TREE_CODE (decl
) == FIELD_DECL
9612 && extra_warnings
&& !TREE_NO_WARNING (decl
))
9614 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
9615 "until the constructor exits", decl
);
9616 TREE_NO_WARNING (decl
) = true;
9619 /* Recursively extend temps in this initializer. */
9620 TARGET_EXPR_INITIAL (expr
)
9621 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
9623 /* Any reference temp has a non-trivial initializer. */
9624 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
9626 /* If the initializer is constant, put it in DECL_INITIAL so we get
9627 static initialization and use in constant expressions. */
9628 init
= maybe_constant_init (expr
);
9629 if (TREE_CONSTANT (init
))
9631 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
9633 /* 5.19 says that a constant expression can include an
9634 lvalue-rvalue conversion applied to "a glvalue of literal type
9635 that refers to a non-volatile temporary object initialized
9636 with a constant expression". Rather than try to communicate
9637 that this VAR_DECL is a temporary, just mark it constexpr.
9639 Currently this is only useful for initializer_list temporaries,
9640 since reference vars can't appear in constant expressions. */
9641 DECL_DECLARED_CONSTEXPR_P (var
) = true;
9642 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
9643 TREE_CONSTANT (var
) = true;
9645 DECL_INITIAL (var
) = init
;
9649 /* Create the INIT_EXPR that will initialize the temporary
9651 init
= split_nonconstant_init (var
, expr
);
9652 if (at_function_scope_p ())
9654 add_decl_expr (var
);
9656 if (TREE_STATIC (var
))
9657 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
9660 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
9662 vec_safe_push (*cleanups
, cleanup
);
9665 /* We must be careful to destroy the temporary only
9666 after its initialization has taken place. If the
9667 initialization throws an exception, then the
9668 destructor should not be run. We cannot simply
9669 transform INIT into something like:
9671 (INIT, ({ CLEANUP_STMT; }))
9673 because emit_local_var always treats the
9674 initializer as a full-expression. Thus, the
9675 destructor would run too early; it would run at the
9676 end of initializing the reference variable, rather
9677 than at the end of the block enclosing the
9680 The solution is to pass back a cleanup expression
9681 which the caller is responsible for attaching to
9682 the statement tree. */
9686 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
9687 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
9689 if (DECL_THREAD_LOCAL_P (var
))
9690 tls_aggregates
= tree_cons (NULL_TREE
, var
,
9693 static_aggregates
= tree_cons (NULL_TREE
, var
,
9697 /* Check whether the dtor is callable. */
9698 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
9700 /* Avoid -Wunused-variable warning (c++/38958). */
9701 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
9702 && TREE_CODE (decl
) == VAR_DECL
)
9703 TREE_USED (decl
) = DECL_READ_P (decl
) = true;
9709 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
9710 initializing a variable of that TYPE. */
9713 initialize_reference (tree type
, tree expr
,
9714 int flags
, tsubst_flags_t complain
)
9718 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
9720 if (type
== error_mark_node
|| error_operand_p (expr
))
9721 return error_mark_node
;
9723 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9724 p
= conversion_obstack_alloc (0);
9726 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
9728 if (!conv
|| conv
->bad_p
)
9730 if (complain
& tf_error
)
9733 convert_like (conv
, expr
, complain
);
9734 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
9735 && !TYPE_REF_IS_RVALUE (type
)
9736 && !real_lvalue_p (expr
))
9737 error_at (loc
, "invalid initialization of non-const reference of "
9738 "type %qT from an rvalue of type %qT",
9739 type
, TREE_TYPE (expr
));
9741 error_at (loc
, "invalid initialization of reference of type "
9742 "%qT from expression of type %qT", type
,
9745 return error_mark_node
;
9748 if (conv
->kind
== ck_ref_bind
)
9749 /* Perform the conversion. */
9750 expr
= convert_like (conv
, expr
, complain
);
9751 else if (conv
->kind
== ck_ambig
)
9752 /* We gave an error in build_user_type_conversion_1. */
9753 expr
= error_mark_node
;
9757 /* Free all the conversions we allocated. */
9758 obstack_free (&conversion_obstack
, p
);
9763 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
9764 which is bound either to a reference or a std::initializer_list. */
9767 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
9772 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
9774 TREE_OPERAND (sub
, 1)
9775 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
9778 if (TREE_CODE (sub
) != ADDR_EXPR
)
9780 /* Deal with binding to a subobject. */
9781 for (p
= &TREE_OPERAND (sub
, 0); TREE_CODE (*p
) == COMPONENT_REF
; )
9782 p
= &TREE_OPERAND (*p
, 0);
9783 if (TREE_CODE (*p
) == TARGET_EXPR
)
9785 tree subinit
= NULL_TREE
;
9786 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
9787 recompute_tree_invariant_for_addr_expr (sub
);
9789 init
= fold_convert (TREE_TYPE (init
), sub
);
9791 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
9796 /* INIT is part of the initializer for DECL. If there are any
9797 reference or initializer lists being initialized, extend their
9798 lifetime to match that of DECL. */
9801 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
9803 tree type
= TREE_TYPE (init
);
9804 if (processing_template_decl
)
9806 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9807 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
9808 else if (is_std_init_list (type
))
9810 /* The temporary array underlying a std::initializer_list
9811 is handled like a reference temporary. */
9813 if (TREE_CODE (ctor
) == TARGET_EXPR
)
9814 ctor
= TARGET_EXPR_INITIAL (ctor
);
9815 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
9817 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
9818 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
9819 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
9822 else if (TREE_CODE (init
) == CONSTRUCTOR
)
9826 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (init
);
9827 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
9828 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
9834 /* Returns true iff an initializer for TYPE could contain temporaries that
9835 need to be extended because they are bound to references or
9836 std::initializer_list. */
9839 type_has_extended_temps (tree type
)
9841 type
= strip_array_types (type
);
9842 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9844 if (CLASS_TYPE_P (type
))
9846 if (is_std_init_list (type
))
9848 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
9849 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
9850 if (type_has_extended_temps (TREE_TYPE (f
)))
9856 /* Returns true iff TYPE is some variant of std::initializer_list. */
9859 is_std_init_list (tree type
)
9861 /* Look through typedefs. */
9864 if (cxx_dialect
== cxx98
)
9866 type
= TYPE_MAIN_VARIANT (type
);
9867 return (CLASS_TYPE_P (type
)
9868 && CP_TYPE_CONTEXT (type
) == std_node
9869 && strcmp (TYPE_NAME_STRING (type
), "initializer_list") == 0);
9872 /* Returns true iff DECL is a list constructor: i.e. a constructor which
9873 will accept an argument list of a single std::initializer_list<T>. */
9876 is_list_ctor (tree decl
)
9878 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
9881 if (!args
|| args
== void_list_node
)
9884 arg
= non_reference (TREE_VALUE (args
));
9885 if (!is_std_init_list (arg
))
9888 args
= TREE_CHAIN (args
);
9890 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
9891 /* There are more non-defaulted parms. */
9897 #include "gt-cp-call.h"