1 /* Functions related to invoking methods and overloaded functions.
2 Copyright (C) 1987-2014 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com) and
4 modified by Brendan Kehoe (brendan@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* High-level class interface. */
27 #include "coretypes.h"
30 #include "stor-layout.h"
31 #include "trans-mem.h"
32 #include "stringpool.h"
36 #include "diagnostic-core.h"
40 #include "langhooks.h"
41 #include "c-family/c-objc.h"
46 /* The various kinds of conversion. */
48 typedef enum conversion_kind
{
64 /* The rank of the conversion. Order of the enumerals matters; better
65 conversions should come earlier in the list. */
67 typedef enum conversion_rank
{
78 /* An implicit conversion sequence, in the sense of [over.best.ics].
79 The first conversion to be performed is at the end of the chain.
80 That conversion is always a cr_identity conversion. */
82 typedef struct conversion conversion
;
84 /* The kind of conversion represented by this step. */
86 /* The rank of this conversion. */
88 BOOL_BITFIELD user_conv_p
: 1;
89 BOOL_BITFIELD ellipsis_p
: 1;
90 BOOL_BITFIELD this_p
: 1;
91 /* True if this conversion would be permitted with a bending of
92 language standards, e.g. disregarding pointer qualifiers or
93 converting integers to pointers. */
94 BOOL_BITFIELD bad_p
: 1;
95 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
96 temporary should be created to hold the result of the
98 BOOL_BITFIELD need_temporary_p
: 1;
99 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
100 from a pointer-to-derived to pointer-to-base is being performed. */
101 BOOL_BITFIELD base_p
: 1;
102 /* If KIND is ck_ref_bind, true when either an lvalue reference is
103 being bound to an lvalue expression or an rvalue reference is
104 being bound to an rvalue expression. If KIND is ck_rvalue,
105 true when we should treat an lvalue as an rvalue (12.8p33). If
106 KIND is ck_base, always false. */
107 BOOL_BITFIELD rvaluedness_matches_p
: 1;
108 BOOL_BITFIELD check_narrowing
: 1;
109 /* The type of the expression resulting from the conversion. */
112 /* The next conversion in the chain. Since the conversions are
113 arranged from outermost to innermost, the NEXT conversion will
114 actually be performed before this conversion. This variant is
115 used only when KIND is neither ck_identity, ck_ambig nor
116 ck_list. Please use the next_conversion function instead
117 of using this field directly. */
119 /* The expression at the beginning of the conversion chain. This
120 variant is used only if KIND is ck_identity or ck_ambig. */
122 /* The array of conversions for an initializer_list, so this
123 variant is used only when KIN D is ck_list. */
126 /* The function candidate corresponding to this conversion
127 sequence. This field is only used if KIND is ck_user. */
128 struct z_candidate
*cand
;
131 #define CONVERSION_RANK(NODE) \
132 ((NODE)->bad_p ? cr_bad \
133 : (NODE)->ellipsis_p ? cr_ellipsis \
134 : (NODE)->user_conv_p ? cr_user \
137 #define BAD_CONVERSION_RANK(NODE) \
138 ((NODE)->ellipsis_p ? cr_ellipsis \
139 : (NODE)->user_conv_p ? cr_user \
142 static struct obstack conversion_obstack
;
143 static bool conversion_obstack_initialized
;
144 struct rejection_reason
;
146 static struct z_candidate
* tourney (struct z_candidate
*, tsubst_flags_t
);
147 static int equal_functions (tree
, tree
);
148 static int joust (struct z_candidate
*, struct z_candidate
*, bool,
150 static int compare_ics (conversion
*, conversion
*);
151 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
152 static tree
build_java_interface_fn_ref (tree
, tree
);
153 #define convert_like(CONV, EXPR, COMPLAIN) \
154 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
155 /*issue_conversion_warnings=*/true, \
156 /*c_cast_p=*/false, (COMPLAIN))
157 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
158 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
159 /*issue_conversion_warnings=*/true, \
160 /*c_cast_p=*/false, (COMPLAIN))
161 static tree
convert_like_real (conversion
*, tree
, tree
, int, int, bool,
162 bool, tsubst_flags_t
);
163 static void op_error (location_t
, enum tree_code
, enum tree_code
, tree
,
165 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int,
167 static void print_z_candidate (location_t
, const char *, struct z_candidate
*);
168 static void print_z_candidates (location_t
, struct z_candidate
*);
169 static tree
build_this (tree
);
170 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
171 static bool any_strictly_viable (struct z_candidate
*);
172 static struct z_candidate
*add_template_candidate
173 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
174 tree
, tree
, tree
, int, unification_kind_t
, tsubst_flags_t
);
175 static struct z_candidate
*add_template_candidate_real
176 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
177 tree
, tree
, tree
, int, tree
, unification_kind_t
, tsubst_flags_t
);
178 static struct z_candidate
*add_template_conv_candidate
179 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
180 tree
, tree
, tree
, tsubst_flags_t
);
181 static void add_builtin_candidates
182 (struct z_candidate
**, enum tree_code
, enum tree_code
,
183 tree
, tree
*, int, tsubst_flags_t
);
184 static void add_builtin_candidate
185 (struct z_candidate
**, enum tree_code
, enum tree_code
,
186 tree
, tree
, tree
, tree
*, tree
*, int, tsubst_flags_t
);
187 static bool is_complete (tree
);
188 static void build_builtin_candidate
189 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
190 int, tsubst_flags_t
);
191 static struct z_candidate
*add_conv_candidate
192 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
193 tree
, tsubst_flags_t
);
194 static struct z_candidate
*add_function_candidate
195 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
196 tree
, int, tsubst_flags_t
);
197 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int,
199 static conversion
*standard_conversion (tree
, tree
, tree
, bool, int);
200 static conversion
*reference_binding (tree
, tree
, tree
, bool, int,
202 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
203 static conversion
*build_list_conv (tree
, tree
, int, tsubst_flags_t
);
204 static conversion
*next_conversion (conversion
*);
205 static bool is_subseq (conversion
*, conversion
*);
206 static conversion
*maybe_handle_ref_bind (conversion
**);
207 static void maybe_handle_implicit_object (conversion
**);
208 static struct z_candidate
*add_candidate
209 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, size_t,
210 conversion
**, tree
, tree
, int, struct rejection_reason
*, int);
211 static tree
source_type (conversion
*);
212 static void add_warning (struct z_candidate
*, struct z_candidate
*);
213 static bool reference_compatible_p (tree
, tree
);
214 static conversion
*direct_reference_binding (tree
, conversion
*);
215 static bool promoted_arithmetic_type_p (tree
);
216 static conversion
*conditional_conversion (tree
, tree
, tsubst_flags_t
);
217 static char *name_as_c_string (tree
, tree
, bool *);
218 static tree
prep_operand (tree
);
219 static void add_candidates (tree
, tree
, const vec
<tree
, va_gc
> *, tree
, tree
,
220 bool, tree
, tree
, int, struct z_candidate
**,
222 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
223 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
225 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
226 NAME can take many forms... */
229 check_dtor_name (tree basetype
, tree name
)
231 /* Just accept something we've already complained about. */
232 if (name
== error_mark_node
)
235 if (TREE_CODE (name
) == TYPE_DECL
)
236 name
= TREE_TYPE (name
);
237 else if (TYPE_P (name
))
239 else if (identifier_p (name
))
241 if ((MAYBE_CLASS_TYPE_P (basetype
)
242 && name
== constructor_name (basetype
))
243 || (TREE_CODE (basetype
) == ENUMERAL_TYPE
244 && name
== TYPE_IDENTIFIER (basetype
)))
247 name
= get_type_value (name
);
253 template <class T> struct S { ~S(); };
257 NAME will be a class template. */
258 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
262 if (!name
|| name
== error_mark_node
)
264 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
267 /* We want the address of a function or method. We avoid creating a
268 pointer-to-member function. */
271 build_addr_func (tree function
, tsubst_flags_t complain
)
273 tree type
= TREE_TYPE (function
);
275 /* We have to do these by hand to avoid real pointer to member
277 if (TREE_CODE (type
) == METHOD_TYPE
)
279 if (TREE_CODE (function
) == OFFSET_REF
)
281 tree object
= build_address (TREE_OPERAND (function
, 0));
282 return get_member_function_from_ptrfunc (&object
,
283 TREE_OPERAND (function
, 1),
286 function
= build_address (function
);
289 function
= decay_conversion (function
, complain
);
294 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
295 POINTER_TYPE to those. Note, pointer to member function types
296 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
297 two variants. build_call_a is the primitive taking an array of
298 arguments, while build_call_n is a wrapper that handles varargs. */
301 build_call_n (tree function
, int n
, ...)
304 return build_call_a (function
, 0, NULL
);
307 tree
*argarray
= XALLOCAVEC (tree
, n
);
312 for (i
= 0; i
< n
; i
++)
313 argarray
[i
] = va_arg (ap
, tree
);
315 return build_call_a (function
, n
, argarray
);
319 /* Update various flags in cfun and the call itself based on what is being
320 called. Split out of build_call_a so that bot_manip can use it too. */
323 set_flags_from_callee (tree call
)
326 tree decl
= get_callee_fndecl (call
);
328 /* We check both the decl and the type; a function may be known not to
329 throw without being declared throw(). */
330 nothrow
= ((decl
&& TREE_NOTHROW (decl
))
331 || TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call
)))));
333 if (!nothrow
&& at_function_scope_p () && cfun
&& cp_function_chain
)
334 cp_function_chain
->can_throw
= 1;
336 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
337 current_function_returns_abnormally
= 1;
339 TREE_NOTHROW (call
) = nothrow
;
343 build_call_a (tree function
, int n
, tree
*argarray
)
350 function
= build_addr_func (function
, tf_warning_or_error
);
352 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
353 fntype
= TREE_TYPE (TREE_TYPE (function
));
354 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
355 || TREE_CODE (fntype
) == METHOD_TYPE
);
356 result_type
= TREE_TYPE (fntype
);
357 /* An rvalue has no cv-qualifiers. */
358 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
359 result_type
= cv_unqualified (result_type
);
361 function
= build_call_array_loc (input_location
,
362 result_type
, function
, n
, argarray
);
363 set_flags_from_callee (function
);
365 decl
= get_callee_fndecl (function
);
367 if (decl
&& !TREE_USED (decl
))
369 /* We invoke build_call directly for several library
370 functions. These may have been declared normally if
371 we're building libgcc, so we can't just check
373 gcc_assert (DECL_ARTIFICIAL (decl
)
374 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
379 if (decl
&& TREE_DEPRECATED (decl
))
380 warn_deprecated_use (decl
, NULL_TREE
);
381 require_complete_eh_spec_types (fntype
, decl
);
383 TREE_HAS_CONSTRUCTOR (function
) = (decl
&& DECL_CONSTRUCTOR_P (decl
));
385 /* Don't pass empty class objects by value. This is useful
386 for tags in STL, which are used to control overload resolution.
387 We don't need to handle other cases of copying empty classes. */
388 if (! decl
|| ! DECL_BUILT_IN (decl
))
389 for (i
= 0; i
< n
; i
++)
391 tree arg
= CALL_EXPR_ARG (function
, i
);
392 if (is_empty_class (TREE_TYPE (arg
))
393 && ! TREE_ADDRESSABLE (TREE_TYPE (arg
)))
395 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (arg
));
396 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (t
), arg
, t
);
397 CALL_EXPR_ARG (function
, i
) = arg
;
404 /* Build something of the form ptr->method (args)
405 or object.method (args). This can also build
406 calls to constructors, and find friends.
408 Member functions always take their class variable
411 INSTANCE is a class instance.
413 NAME is the name of the method desired, usually an IDENTIFIER_NODE.
415 PARMS help to figure out what that NAME really refers to.
417 BASETYPE_PATH, if non-NULL, contains a chain from the type of INSTANCE
418 down to the real instance type to use for access checking. We need this
419 information to get protected accesses correct.
421 FLAGS is the logical disjunction of zero or more LOOKUP_
422 flags. See cp-tree.h for more info.
424 If this is all OK, calls build_function_call with the resolved
427 This function must also handle being called to perform
428 initialization, promotion/coercion of arguments, and
429 instantiation of default parameters.
431 Note that NAME may refer to an instance variable name. If
432 `operator()()' is defined for the type of that field, then we return
435 /* New overloading code. */
437 typedef struct z_candidate z_candidate
;
439 typedef struct candidate_warning candidate_warning
;
440 struct candidate_warning
{
442 candidate_warning
*next
;
445 /* Information for providing diagnostics about why overloading failed. */
447 enum rejection_reason_code
{
450 rr_explicit_conversion
,
451 rr_template_conversion
,
453 rr_bad_arg_conversion
,
454 rr_template_unification
,
458 struct conversion_info
{
459 /* The index of the argument, 0-based. */
461 /* The type of the actual argument. */
463 /* The type of the formal argument. */
467 struct rejection_reason
{
468 enum rejection_reason_code code
;
470 /* Information about an arity mismatch. */
472 /* The expected number of arguments. */
474 /* The actual number of arguments in the call. */
476 /* Whether the call was a varargs call. */
479 /* Information about an argument conversion mismatch. */
480 struct conversion_info conversion
;
481 /* Same, but for bad argument conversions. */
482 struct conversion_info bad_conversion
;
483 /* Information about template unification failures. These are the
484 parameters passed to fn_type_unification. */
492 unification_kind_t strict
;
494 } template_unification
;
495 /* Information about template instantiation failures. These are the
496 parameters passed to instantiate_template. */
500 } template_instantiation
;
505 /* The FUNCTION_DECL that will be called if this candidate is
506 selected by overload resolution. */
508 /* If not NULL_TREE, the first argument to use when calling this
511 /* The rest of the arguments to use when calling this function. If
512 there are no further arguments this may be NULL or it may be an
514 const vec
<tree
, va_gc
> *args
;
515 /* The implicit conversion sequences for each of the arguments to
518 /* The number of implicit conversion sequences. */
520 /* If FN is a user-defined conversion, the standard conversion
521 sequence from the type returned by FN to the desired destination
523 conversion
*second_conv
;
524 struct rejection_reason
*reason
;
525 /* If FN is a member function, the binfo indicating the path used to
526 qualify the name of FN at the call site. This path is used to
527 determine whether or not FN is accessible if it is selected by
528 overload resolution. The DECL_CONTEXT of FN will always be a
529 (possibly improper) base of this binfo. */
531 /* If FN is a non-static member function, the binfo indicating the
532 subobject to which the `this' pointer should be converted if FN
533 is selected by overload resolution. The type pointed to by
534 the `this' pointer must correspond to the most derived class
535 indicated by the CONVERSION_PATH. */
536 tree conversion_path
;
539 candidate_warning
*warnings
;
543 /* The flags active in add_candidate. */
547 /* Returns true iff T is a null pointer constant in the sense of
551 null_ptr_cst_p (tree t
)
555 A null pointer constant is an integral constant expression
556 (_expr.const_) rvalue of integer type that evaluates to zero or
557 an rvalue of type std::nullptr_t. */
558 if (NULLPTR_TYPE_P (TREE_TYPE (t
)))
560 if (CP_INTEGRAL_TYPE_P (TREE_TYPE (t
)))
562 /* Core issue 903 says only literal 0 is a null pointer constant. */
563 if (cxx_dialect
< cxx11
)
564 t
= maybe_constant_value (fold_non_dependent_expr_sfinae (t
, tf_none
));
566 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
572 /* Returns true iff T is a null member pointer value (4.11). */
575 null_member_pointer_value_p (tree t
)
577 tree type
= TREE_TYPE (t
);
580 else if (TYPE_PTRMEMFUNC_P (type
))
581 return (TREE_CODE (t
) == CONSTRUCTOR
582 && integer_zerop (CONSTRUCTOR_ELT (t
, 0)->value
));
583 else if (TYPE_PTRDATAMEM_P (type
))
584 return integer_all_onesp (t
);
589 /* Returns nonzero if PARMLIST consists of only default parms,
590 ellipsis, and/or undeduced parameter packs. */
593 sufficient_parms_p (const_tree parmlist
)
595 for (; parmlist
&& parmlist
!= void_list_node
;
596 parmlist
= TREE_CHAIN (parmlist
))
597 if (!TREE_PURPOSE (parmlist
)
598 && !PACK_EXPANSION_P (TREE_VALUE (parmlist
)))
603 /* Allocate N bytes of memory from the conversion obstack. The memory
604 is zeroed before being returned. */
607 conversion_obstack_alloc (size_t n
)
610 if (!conversion_obstack_initialized
)
612 gcc_obstack_init (&conversion_obstack
);
613 conversion_obstack_initialized
= true;
615 p
= obstack_alloc (&conversion_obstack
, n
);
620 /* Allocate rejection reasons. */
622 static struct rejection_reason
*
623 alloc_rejection (enum rejection_reason_code code
)
625 struct rejection_reason
*p
;
626 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
631 static struct rejection_reason
*
632 arity_rejection (tree first_arg
, int expected
, int actual
)
634 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
635 int adjust
= first_arg
!= NULL_TREE
;
636 r
->u
.arity
.expected
= expected
- adjust
;
637 r
->u
.arity
.actual
= actual
- adjust
;
641 static struct rejection_reason
*
642 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
644 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
645 int adjust
= first_arg
!= NULL_TREE
;
646 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
647 r
->u
.conversion
.from_type
= from
;
648 r
->u
.conversion
.to_type
= to
;
652 static struct rejection_reason
*
653 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
655 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
656 int adjust
= first_arg
!= NULL_TREE
;
657 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
658 r
->u
.bad_conversion
.from_type
= from
;
659 r
->u
.bad_conversion
.to_type
= to
;
663 static struct rejection_reason
*
664 explicit_conversion_rejection (tree from
, tree to
)
666 struct rejection_reason
*r
= alloc_rejection (rr_explicit_conversion
);
667 r
->u
.conversion
.n_arg
= 0;
668 r
->u
.conversion
.from_type
= from
;
669 r
->u
.conversion
.to_type
= to
;
673 static struct rejection_reason
*
674 template_conversion_rejection (tree from
, tree to
)
676 struct rejection_reason
*r
= alloc_rejection (rr_template_conversion
);
677 r
->u
.conversion
.n_arg
= 0;
678 r
->u
.conversion
.from_type
= from
;
679 r
->u
.conversion
.to_type
= to
;
683 static struct rejection_reason
*
684 template_unification_rejection (tree tmpl
, tree explicit_targs
, tree targs
,
685 const tree
*args
, unsigned int nargs
,
686 tree return_type
, unification_kind_t strict
,
689 size_t args_n_bytes
= sizeof (*args
) * nargs
;
690 tree
*args1
= (tree
*) conversion_obstack_alloc (args_n_bytes
);
691 struct rejection_reason
*r
= alloc_rejection (rr_template_unification
);
692 r
->u
.template_unification
.tmpl
= tmpl
;
693 r
->u
.template_unification
.explicit_targs
= explicit_targs
;
694 r
->u
.template_unification
.num_targs
= TREE_VEC_LENGTH (targs
);
695 /* Copy args to our own storage. */
696 memcpy (args1
, args
, args_n_bytes
);
697 r
->u
.template_unification
.args
= args1
;
698 r
->u
.template_unification
.nargs
= nargs
;
699 r
->u
.template_unification
.return_type
= return_type
;
700 r
->u
.template_unification
.strict
= strict
;
701 r
->u
.template_unification
.flags
= flags
;
705 static struct rejection_reason
*
706 template_unification_error_rejection (void)
708 return alloc_rejection (rr_template_unification
);
711 static struct rejection_reason
*
712 invalid_copy_with_fn_template_rejection (void)
714 struct rejection_reason
*r
= alloc_rejection (rr_invalid_copy
);
718 /* Dynamically allocate a conversion. */
721 alloc_conversion (conversion_kind kind
)
724 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
729 #ifdef ENABLE_CHECKING
731 /* Make sure that all memory on the conversion obstack has been
735 validate_conversion_obstack (void)
737 if (conversion_obstack_initialized
)
738 gcc_assert ((obstack_next_free (&conversion_obstack
)
739 == obstack_base (&conversion_obstack
)));
742 #endif /* ENABLE_CHECKING */
744 /* Dynamically allocate an array of N conversions. */
747 alloc_conversions (size_t n
)
749 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
753 build_conv (conversion_kind code
, tree type
, conversion
*from
)
756 conversion_rank rank
= CONVERSION_RANK (from
);
758 /* Note that the caller is responsible for filling in t->cand for
759 user-defined conversions. */
760 t
= alloc_conversion (code
);
783 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
784 t
->bad_p
= from
->bad_p
;
789 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
790 specialization of std::initializer_list<T>, if such a conversion is
794 build_list_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
796 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
797 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
798 conversion
**subconvs
= alloc_conversions (len
);
803 /* Within a list-initialization we can have more user-defined
805 flags
&= ~LOOKUP_NO_CONVERSION
;
806 /* But no narrowing conversions. */
807 flags
|= LOOKUP_NO_NARROWING
;
809 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
812 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
813 false, flags
, complain
);
820 t
= alloc_conversion (ck_list
);
822 t
->u
.list
= subconvs
;
825 for (i
= 0; i
< len
; ++i
)
827 conversion
*sub
= subconvs
[i
];
828 if (sub
->rank
> t
->rank
)
830 if (sub
->user_conv_p
)
831 t
->user_conv_p
= true;
839 /* Return the next conversion of the conversion chain (if applicable),
840 or NULL otherwise. Please use this function instead of directly
841 accessing fields of struct conversion. */
844 next_conversion (conversion
*conv
)
847 || conv
->kind
== ck_identity
848 || conv
->kind
== ck_ambig
849 || conv
->kind
== ck_list
)
854 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
855 is a valid aggregate initializer for array type ATYPE. */
858 can_convert_array (tree atype
, tree ctor
, int flags
, tsubst_flags_t complain
)
861 tree elttype
= TREE_TYPE (atype
);
862 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
864 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
866 if (TREE_CODE (elttype
) == ARRAY_TYPE
867 && TREE_CODE (val
) == CONSTRUCTOR
)
868 ok
= can_convert_array (elttype
, val
, flags
, complain
);
870 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
,
878 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
879 aggregate class, if such a conversion is possible. */
882 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
884 unsigned HOST_WIDE_INT i
= 0;
886 tree field
= next_initializable_field (TYPE_FIELDS (type
));
887 tree empty_ctor
= NULL_TREE
;
889 ctor
= reshape_init (type
, ctor
, tf_none
);
890 if (ctor
== error_mark_node
)
893 flags
|= LOOKUP_NO_NARROWING
;
895 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
897 tree ftype
= TREE_TYPE (field
);
901 if (i
< CONSTRUCTOR_NELTS (ctor
))
902 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
903 else if (TREE_CODE (ftype
) == REFERENCE_TYPE
)
904 /* Value-initialization of reference is ill-formed. */
908 if (empty_ctor
== NULL_TREE
)
909 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
914 if (TREE_CODE (ftype
) == ARRAY_TYPE
915 && TREE_CODE (val
) == CONSTRUCTOR
)
916 ok
= can_convert_array (ftype
, val
, flags
, complain
);
918 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
924 if (TREE_CODE (type
) == UNION_TYPE
)
928 if (i
< CONSTRUCTOR_NELTS (ctor
))
931 c
= alloc_conversion (ck_aggr
);
934 c
->user_conv_p
= true;
935 c
->check_narrowing
= true;
940 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
941 array type, if such a conversion is possible. */
944 build_array_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
947 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
948 tree elttype
= TREE_TYPE (type
);
953 enum conversion_rank rank
= cr_exact
;
955 /* We might need to propagate the size from the element to the array. */
956 complete_type (type
);
958 if (TYPE_DOMAIN (type
)
959 && !variably_modified_type_p (TYPE_DOMAIN (type
), NULL_TREE
))
961 unsigned HOST_WIDE_INT alen
= tree_to_uhwi (array_type_nelts_top (type
));
966 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
969 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
970 false, flags
, complain
);
974 if (sub
->rank
> rank
)
976 if (sub
->user_conv_p
)
982 c
= alloc_conversion (ck_aggr
);
985 c
->user_conv_p
= user
;
991 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
992 complex type, if such a conversion is possible. */
995 build_complex_conv (tree type
, tree ctor
, int flags
,
996 tsubst_flags_t complain
)
999 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1000 tree elttype
= TREE_TYPE (type
);
1005 enum conversion_rank rank
= cr_exact
;
1010 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1013 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1014 false, flags
, complain
);
1018 if (sub
->rank
> rank
)
1020 if (sub
->user_conv_p
)
1026 c
= alloc_conversion (ck_aggr
);
1029 c
->user_conv_p
= user
;
1035 /* Build a representation of the identity conversion from EXPR to
1036 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1039 build_identity_conv (tree type
, tree expr
)
1043 c
= alloc_conversion (ck_identity
);
1050 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1051 were multiple user-defined conversions to accomplish the job.
1052 Build a conversion that indicates that ambiguity. */
1055 build_ambiguous_conv (tree type
, tree expr
)
1059 c
= alloc_conversion (ck_ambig
);
1067 strip_top_quals (tree t
)
1069 if (TREE_CODE (t
) == ARRAY_TYPE
)
1071 return cp_build_qualified_type (t
, 0);
1074 /* Returns the standard conversion path (see [conv]) from type FROM to type
1075 TO, if any. For proper handling of null pointer constants, you must
1076 also pass the expression EXPR to convert from. If C_CAST_P is true,
1077 this conversion is coming from a C-style cast. */
1080 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1083 enum tree_code fcode
, tcode
;
1085 bool fromref
= false;
1088 to
= non_reference (to
);
1089 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1092 from
= TREE_TYPE (from
);
1095 to
= strip_top_quals (to
);
1096 from
= strip_top_quals (from
);
1098 if ((TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1099 && expr
&& type_unknown_p (expr
))
1101 tsubst_flags_t tflags
= tf_conv
;
1102 expr
= instantiate_type (to
, expr
, tflags
);
1103 if (expr
== error_mark_node
)
1105 from
= TREE_TYPE (expr
);
1108 fcode
= TREE_CODE (from
);
1109 tcode
= TREE_CODE (to
);
1111 conv
= build_identity_conv (from
, expr
);
1112 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1114 from
= type_decays_to (from
);
1115 fcode
= TREE_CODE (from
);
1116 conv
= build_conv (ck_lvalue
, from
, conv
);
1118 else if (fromref
|| (expr
&& lvalue_p (expr
)))
1123 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1126 from
= strip_top_quals (bitfield_type
);
1127 fcode
= TREE_CODE (from
);
1130 conv
= build_conv (ck_rvalue
, from
, conv
);
1131 if (flags
& LOOKUP_PREFER_RVALUE
)
1132 conv
->rvaluedness_matches_p
= true;
1135 /* Allow conversion between `__complex__' data types. */
1136 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1138 /* The standard conversion sequence to convert FROM to TO is
1139 the standard conversion sequence to perform componentwise
1141 conversion
*part_conv
= standard_conversion
1142 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
);
1146 conv
= build_conv (part_conv
->kind
, to
, conv
);
1147 conv
->rank
= part_conv
->rank
;
1155 if (same_type_p (from
, to
))
1157 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1158 conv
->type
= qualified_to
;
1163 A null pointer constant can be converted to a pointer type; ... A
1164 null pointer constant of integral type can be converted to an
1165 rvalue of type std::nullptr_t. */
1166 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1167 || NULLPTR_TYPE_P (to
))
1168 && expr
&& null_ptr_cst_p (expr
))
1169 conv
= build_conv (ck_std
, to
, conv
);
1170 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1171 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1173 /* For backwards brain damage compatibility, allow interconversion of
1174 pointers and integers with a pedwarn. */
1175 conv
= build_conv (ck_std
, to
, conv
);
1178 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1180 /* For backwards brain damage compatibility, allow interconversion of
1181 enums and integers with a pedwarn. */
1182 conv
= build_conv (ck_std
, to
, conv
);
1185 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1186 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1191 if (tcode
== POINTER_TYPE
1192 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from
),
1195 else if (VOID_TYPE_P (TREE_TYPE (to
))
1196 && !TYPE_PTRDATAMEM_P (from
)
1197 && TREE_CODE (TREE_TYPE (from
)) != FUNCTION_TYPE
)
1199 tree nfrom
= TREE_TYPE (from
);
1200 /* Don't try to apply restrict to void. */
1201 int quals
= cp_type_quals (nfrom
) & ~TYPE_QUAL_RESTRICT
;
1202 from
= build_pointer_type
1203 (cp_build_qualified_type (void_type_node
, quals
));
1204 conv
= build_conv (ck_ptr
, from
, conv
);
1206 else if (TYPE_PTRDATAMEM_P (from
))
1208 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1209 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1211 if (DERIVED_FROM_P (fbase
, tbase
)
1212 && (same_type_ignoring_top_level_qualifiers_p
1213 (TYPE_PTRMEM_POINTED_TO_TYPE (from
),
1214 TYPE_PTRMEM_POINTED_TO_TYPE (to
))))
1216 from
= build_ptrmem_type (tbase
,
1217 TYPE_PTRMEM_POINTED_TO_TYPE (from
));
1218 conv
= build_conv (ck_pmem
, from
, conv
);
1220 else if (!same_type_p (fbase
, tbase
))
1223 else if (CLASS_TYPE_P (TREE_TYPE (from
))
1224 && CLASS_TYPE_P (TREE_TYPE (to
))
1227 An rvalue of type "pointer to cv D," where D is a
1228 class type, can be converted to an rvalue of type
1229 "pointer to cv B," where B is a base class (clause
1230 _class.derived_) of D. If B is an inaccessible
1231 (clause _class.access_) or ambiguous
1232 (_class.member.lookup_) base class of D, a program
1233 that necessitates this conversion is ill-formed.
1234 Therefore, we use DERIVED_FROM_P, and do not check
1235 access or uniqueness. */
1236 && DERIVED_FROM_P (TREE_TYPE (to
), TREE_TYPE (from
)))
1239 cp_build_qualified_type (TREE_TYPE (to
),
1240 cp_type_quals (TREE_TYPE (from
)));
1241 from
= build_pointer_type (from
);
1242 conv
= build_conv (ck_ptr
, from
, conv
);
1243 conv
->base_p
= true;
1246 if (tcode
== POINTER_TYPE
)
1248 to_pointee
= TREE_TYPE (to
);
1249 from_pointee
= TREE_TYPE (from
);
1253 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1254 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1257 if (same_type_p (from
, to
))
1259 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
1260 /* In a C-style cast, we ignore CV-qualification because we
1261 are allowed to perform a static_cast followed by a
1263 conv
= build_conv (ck_qual
, to
, conv
);
1264 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1265 conv
= build_conv (ck_qual
, to
, conv
);
1266 else if (expr
&& string_conv_p (to
, expr
, 0))
1267 /* converting from string constant to char *. */
1268 conv
= build_conv (ck_qual
, to
, conv
);
1269 /* Allow conversions among compatible ObjC pointer types (base
1270 conversions have been already handled above). */
1271 else if (c_dialect_objc ()
1272 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1273 conv
= build_conv (ck_ptr
, to
, conv
);
1274 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1276 conv
= build_conv (ck_ptr
, to
, conv
);
1284 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1286 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1287 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1288 tree fbase
= class_of_this_parm (fromfn
);
1289 tree tbase
= class_of_this_parm (tofn
);
1291 if (!DERIVED_FROM_P (fbase
, tbase
)
1292 || !same_type_p (static_fn_type (fromfn
),
1293 static_fn_type (tofn
)))
1296 from
= build_memfn_type (fromfn
,
1298 cp_type_quals (tbase
),
1299 type_memfn_rqual (tofn
));
1300 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1301 conv
= build_conv (ck_pmem
, from
, conv
);
1302 conv
->base_p
= true;
1304 else if (tcode
== BOOLEAN_TYPE
)
1308 An rvalue of arithmetic, unscoped enumeration, pointer, or
1309 pointer to member type can be converted to an rvalue of type
1310 bool. ... An rvalue of type std::nullptr_t can be converted
1311 to an rvalue of type bool; */
1312 if (ARITHMETIC_TYPE_P (from
)
1313 || UNSCOPED_ENUM_P (from
)
1314 || fcode
== POINTER_TYPE
1315 || TYPE_PTRMEM_P (from
)
1316 || NULLPTR_TYPE_P (from
))
1318 conv
= build_conv (ck_std
, to
, conv
);
1319 if (fcode
== POINTER_TYPE
1320 || TYPE_PTRDATAMEM_P (from
)
1321 || (TYPE_PTRMEMFUNC_P (from
)
1322 && conv
->rank
< cr_pbool
)
1323 || NULLPTR_TYPE_P (from
))
1324 conv
->rank
= cr_pbool
;
1330 /* We don't check for ENUMERAL_TYPE here because there are no standard
1331 conversions to enum type. */
1332 /* As an extension, allow conversion to complex type. */
1333 else if (ARITHMETIC_TYPE_P (to
))
1335 if (! (INTEGRAL_CODE_P (fcode
)
1336 || (fcode
== REAL_TYPE
&& !(flags
& LOOKUP_NO_NON_INTEGRAL
)))
1337 || SCOPED_ENUM_P (from
))
1339 conv
= build_conv (ck_std
, to
, conv
);
1341 /* Give this a better rank if it's a promotion. */
1342 if (same_type_p (to
, type_promotes_to (from
))
1343 && next_conversion (conv
)->rank
<= cr_promotion
)
1344 conv
->rank
= cr_promotion
;
1346 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1347 && vector_types_convertible_p (from
, to
, false))
1348 return build_conv (ck_std
, to
, conv
);
1349 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1350 && is_properly_derived_from (from
, to
))
1352 if (conv
->kind
== ck_rvalue
)
1353 conv
= next_conversion (conv
);
1354 conv
= build_conv (ck_base
, to
, conv
);
1355 /* The derived-to-base conversion indicates the initialization
1356 of a parameter with base type from an object of a derived
1357 type. A temporary object is created to hold the result of
1358 the conversion unless we're binding directly to a reference. */
1359 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1364 if (flags
& LOOKUP_NO_NARROWING
)
1365 conv
->check_narrowing
= true;
1370 /* Returns nonzero if T1 is reference-related to T2. */
1373 reference_related_p (tree t1
, tree t2
)
1375 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1378 t1
= TYPE_MAIN_VARIANT (t1
);
1379 t2
= TYPE_MAIN_VARIANT (t2
);
1383 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1384 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1386 return (same_type_p (t1
, t2
)
1387 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1388 && DERIVED_FROM_P (t1
, t2
)));
1391 /* Returns nonzero if T1 is reference-compatible with T2. */
1394 reference_compatible_p (tree t1
, tree t2
)
1398 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
1399 reference-related to T2 and cv1 is the same cv-qualification as,
1400 or greater cv-qualification than, cv2. */
1401 return (reference_related_p (t1
, t2
)
1402 && at_least_as_qualified_p (t1
, t2
));
1405 /* A reference of the indicated TYPE is being bound directly to the
1406 expression represented by the implicit conversion sequence CONV.
1407 Return a conversion sequence for this binding. */
1410 direct_reference_binding (tree type
, conversion
*conv
)
1414 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
1415 gcc_assert (TREE_CODE (conv
->type
) != REFERENCE_TYPE
);
1417 t
= TREE_TYPE (type
);
1421 When a parameter of reference type binds directly
1422 (_dcl.init.ref_) to an argument expression, the implicit
1423 conversion sequence is the identity conversion, unless the
1424 argument expression has a type that is a derived class of the
1425 parameter type, in which case the implicit conversion sequence is
1426 a derived-to-base Conversion.
1428 If the parameter binds directly to the result of applying a
1429 conversion function to the argument expression, the implicit
1430 conversion sequence is a user-defined conversion sequence
1431 (_over.ics.user_), with the second standard conversion sequence
1432 either an identity conversion or, if the conversion function
1433 returns an entity of a type that is a derived class of the
1434 parameter type, a derived-to-base conversion. */
1435 if (!same_type_ignoring_top_level_qualifiers_p (t
, conv
->type
))
1437 /* Represent the derived-to-base conversion. */
1438 conv
= build_conv (ck_base
, t
, conv
);
1439 /* We will actually be binding to the base-class subobject in
1440 the derived class, so we mark this conversion appropriately.
1441 That way, convert_like knows not to generate a temporary. */
1442 conv
->need_temporary_p
= false;
1444 return build_conv (ck_ref_bind
, type
, conv
);
1447 /* Returns the conversion path from type FROM to reference type TO for
1448 purposes of reference binding. For lvalue binding, either pass a
1449 reference type to FROM or an lvalue expression to EXPR. If the
1450 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1451 the conversion returned. If C_CAST_P is true, this
1452 conversion is coming from a C-style cast. */
1455 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1456 tsubst_flags_t complain
)
1458 conversion
*conv
= NULL
;
1459 tree to
= TREE_TYPE (rto
);
1464 cp_lvalue_kind gl_kind
;
1467 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1469 expr
= instantiate_type (to
, expr
, tf_none
);
1470 if (expr
== error_mark_node
)
1472 from
= TREE_TYPE (expr
);
1475 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1477 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1478 /* DR 1288: Otherwise, if the initializer list has a single element
1479 of type E and ... [T's] referenced type is reference-related to E,
1480 the object or reference is initialized from that element... */
1481 if (CONSTRUCTOR_NELTS (expr
) == 1)
1483 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1484 if (error_operand_p (elt
))
1486 tree etype
= TREE_TYPE (elt
);
1487 if (reference_related_p (to
, etype
))
1494 /* Otherwise, if T is a reference type, a prvalue temporary of the
1495 type referenced by T is copy-list-initialized or
1496 direct-list-initialized, depending on the kind of initialization
1497 for the reference, and the reference is bound to that temporary. */
1498 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1499 flags
|LOOKUP_NO_TEMP_BIND
, complain
);
1503 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1505 from
= TREE_TYPE (from
);
1506 if (!TYPE_REF_IS_RVALUE (rfrom
)
1507 || TREE_CODE (from
) == FUNCTION_TYPE
)
1508 gl_kind
= clk_ordinary
;
1510 gl_kind
= clk_rvalueref
;
1514 gl_kind
= lvalue_kind (expr
);
1515 if (gl_kind
& clk_class
)
1516 /* A class prvalue is not a glvalue. */
1521 is_lvalue
= gl_kind
&& !(gl_kind
& clk_rvalueref
);
1524 if ((gl_kind
& clk_bitfield
) != 0)
1525 tfrom
= unlowered_expr_type (expr
);
1527 /* Figure out whether or not the types are reference-related and
1528 reference compatible. We have do do this after stripping
1529 references from FROM. */
1530 related_p
= reference_related_p (to
, tfrom
);
1531 /* If this is a C cast, first convert to an appropriately qualified
1532 type, so that we can later do a const_cast to the desired type. */
1533 if (related_p
&& c_cast_p
1534 && !at_least_as_qualified_p (to
, tfrom
))
1535 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1536 compatible_p
= reference_compatible_p (to
, tfrom
);
1538 /* Directly bind reference when target expression's type is compatible with
1539 the reference and expression is an lvalue. In DR391, the wording in
1540 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1541 const and rvalue references to rvalues of compatible class type.
1542 We should also do direct bindings for non-class xvalues. */
1545 || (((CP_TYPE_CONST_NON_VOLATILE_P (to
)
1546 && !(flags
& LOOKUP_NO_RVAL_BIND
))
1547 || TYPE_REF_IS_RVALUE (rto
))
1549 || (!(flags
& LOOKUP_NO_TEMP_BIND
)
1550 && (CLASS_TYPE_P (from
)
1551 || TREE_CODE (from
) == ARRAY_TYPE
))))))
1555 If the initializer expression
1557 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1558 is reference-compatible with "cv2 T2,"
1560 the reference is bound directly to the initializer expression
1564 If the initializer expression is an rvalue, with T2 a class type,
1565 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1566 is bound to the object represented by the rvalue or to a sub-object
1567 within that object. */
1569 conv
= build_identity_conv (tfrom
, expr
);
1570 conv
= direct_reference_binding (rto
, conv
);
1572 if (flags
& LOOKUP_PREFER_RVALUE
)
1573 /* The top-level caller requested that we pretend that the lvalue
1574 be treated as an rvalue. */
1575 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1576 else if (TREE_CODE (rfrom
) == REFERENCE_TYPE
)
1577 /* Handle rvalue reference to function properly. */
1578 conv
->rvaluedness_matches_p
1579 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1581 conv
->rvaluedness_matches_p
1582 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1584 if ((gl_kind
& clk_bitfield
) != 0
1585 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1586 /* For the purposes of overload resolution, we ignore the fact
1587 this expression is a bitfield or packed field. (In particular,
1588 [over.ics.ref] says specifically that a function with a
1589 non-const reference parameter is viable even if the
1590 argument is a bitfield.)
1592 However, when we actually call the function we must create
1593 a temporary to which to bind the reference. If the
1594 reference is volatile, or isn't const, then we cannot make
1595 a temporary, so we just issue an error when the conversion
1597 conv
->need_temporary_p
= true;
1599 /* Don't allow binding of lvalues (other than function lvalues) to
1600 rvalue references. */
1601 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1602 && TREE_CODE (to
) != FUNCTION_TYPE
1603 && !(flags
& LOOKUP_PREFER_RVALUE
))
1608 /* [class.conv.fct] A conversion function is never used to convert a
1609 (possibly cv-qualified) object to the (possibly cv-qualified) same
1610 object type (or a reference to it), to a (possibly cv-qualified) base
1611 class of that type (or a reference to it).... */
1612 else if (CLASS_TYPE_P (from
) && !related_p
1613 && !(flags
& LOOKUP_NO_CONVERSION
))
1617 If the initializer expression
1619 -- has a class type (i.e., T2 is a class type) can be
1620 implicitly converted to an lvalue of type "cv3 T3," where
1621 "cv1 T1" is reference-compatible with "cv3 T3". (this
1622 conversion is selected by enumerating the applicable
1623 conversion functions (_over.match.ref_) and choosing the
1624 best one through overload resolution. (_over.match_).
1626 the reference is bound to the lvalue result of the conversion
1627 in the second case. */
1628 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1631 return cand
->second_conv
;
1634 /* From this point on, we conceptually need temporaries, even if we
1635 elide them. Only the cases above are "direct bindings". */
1636 if (flags
& LOOKUP_NO_TEMP_BIND
)
1641 When a parameter of reference type is not bound directly to an
1642 argument expression, the conversion sequence is the one required
1643 to convert the argument expression to the underlying type of the
1644 reference according to _over.best.ics_. Conceptually, this
1645 conversion sequence corresponds to copy-initializing a temporary
1646 of the underlying type with the argument expression. Any
1647 difference in top-level cv-qualification is subsumed by the
1648 initialization itself and does not constitute a conversion. */
1652 Otherwise, the reference shall be an lvalue reference to a
1653 non-volatile const type, or the reference shall be an rvalue
1655 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1660 Otherwise, a temporary of type "cv1 T1" is created and
1661 initialized from the initializer expression using the rules for a
1662 non-reference copy initialization. If T1 is reference-related to
1663 T2, cv1 must be the same cv-qualification as, or greater
1664 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1665 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1668 /* We're generating a temporary now, but don't bind any more in the
1669 conversion (specifically, don't slice the temporary returned by a
1670 conversion operator). */
1671 flags
|= LOOKUP_NO_TEMP_BIND
;
1673 /* Core issue 899: When [copy-]initializing a temporary to be bound
1674 to the first parameter of a copy constructor (12.8) called with
1675 a single argument in the context of direct-initialization,
1676 explicit conversion functions are also considered.
1678 So don't set LOOKUP_ONLYCONVERTING in that case. */
1679 if (!(flags
& LOOKUP_COPY_PARM
))
1680 flags
|= LOOKUP_ONLYCONVERTING
;
1683 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1688 if (conv
->user_conv_p
)
1690 /* If initializing the temporary used a conversion function,
1691 recalculate the second conversion sequence. */
1692 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1693 if (t
->kind
== ck_user
1694 && DECL_CONV_FN_P (t
->cand
->fn
))
1696 tree ftype
= TREE_TYPE (TREE_TYPE (t
->cand
->fn
));
1697 int sflags
= (flags
|LOOKUP_NO_CONVERSION
)&~LOOKUP_NO_TEMP_BIND
;
1698 conversion
*new_second
1699 = reference_binding (rto
, ftype
, NULL_TREE
, c_cast_p
,
1703 return merge_conversion_sequences (t
, new_second
);
1707 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1708 /* This reference binding, unlike those above, requires the
1709 creation of a temporary. */
1710 conv
->need_temporary_p
= true;
1711 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1716 /* Returns the implicit conversion sequence (see [over.ics]) from type
1717 FROM to type TO. The optional expression EXPR may affect the
1718 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1719 true, this conversion is coming from a C-style cast. */
1722 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1723 int flags
, tsubst_flags_t complain
)
1727 if (from
== error_mark_node
|| to
== error_mark_node
1728 || expr
== error_mark_node
)
1731 /* Other flags only apply to the primary function in overload
1732 resolution, or after we've chosen one. */
1733 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1734 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1735 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1737 /* FIXME: actually we don't want warnings either, but we can't just
1738 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1739 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1740 We really ought not to issue that warning until we've committed
1741 to that conversion. */
1742 complain
&= ~tf_error
;
1744 if (TREE_CODE (to
) == REFERENCE_TYPE
)
1745 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1747 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
);
1752 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1754 if (is_std_init_list (to
))
1755 return build_list_conv (to
, expr
, flags
, complain
);
1757 /* As an extension, allow list-initialization of _Complex. */
1758 if (TREE_CODE (to
) == COMPLEX_TYPE
)
1760 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1765 /* Allow conversion from an initializer-list with one element to a
1767 if (SCALAR_TYPE_P (to
))
1769 int nelts
= CONSTRUCTOR_NELTS (expr
);
1773 elt
= build_value_init (to
, tf_none
);
1774 else if (nelts
== 1)
1775 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1777 elt
= error_mark_node
;
1779 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1780 c_cast_p
, flags
, complain
);
1783 conv
->check_narrowing
= true;
1784 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1785 /* Too many levels of braces, i.e. '{{1}}'. */
1790 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1791 return build_array_conv (to
, expr
, flags
, complain
);
1794 if (expr
!= NULL_TREE
1795 && (MAYBE_CLASS_TYPE_P (from
)
1796 || MAYBE_CLASS_TYPE_P (to
))
1797 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1799 struct z_candidate
*cand
;
1801 if (CLASS_TYPE_P (to
)
1802 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
1803 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
1804 return build_aggr_conv (to
, expr
, flags
, complain
);
1806 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
1808 conv
= cand
->second_conv
;
1810 /* We used to try to bind a reference to a temporary here, but that
1811 is now handled after the recursive call to this function at the end
1812 of reference_binding. */
1819 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1820 functions. ARGS will not be changed until a single candidate is
1823 static struct z_candidate
*
1824 add_candidate (struct z_candidate
**candidates
,
1825 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
1826 size_t num_convs
, conversion
**convs
,
1827 tree access_path
, tree conversion_path
,
1828 int viable
, struct rejection_reason
*reason
,
1831 struct z_candidate
*cand
= (struct z_candidate
*)
1832 conversion_obstack_alloc (sizeof (struct z_candidate
));
1835 cand
->first_arg
= first_arg
;
1837 cand
->convs
= convs
;
1838 cand
->num_convs
= num_convs
;
1839 cand
->access_path
= access_path
;
1840 cand
->conversion_path
= conversion_path
;
1841 cand
->viable
= viable
;
1842 cand
->reason
= reason
;
1843 cand
->next
= *candidates
;
1844 cand
->flags
= flags
;
1850 /* Return the number of remaining arguments in the parameter list
1851 beginning with ARG. */
1854 remaining_arguments (tree arg
)
1858 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
1859 arg
= TREE_CHAIN (arg
))
1865 /* Create an overload candidate for the function or method FN called
1866 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1867 FLAGS is passed on to implicit_conversion.
1869 This does not change ARGS.
1871 CTYPE, if non-NULL, is the type we want to pretend this function
1872 comes from for purposes of overload resolution. */
1874 static struct z_candidate
*
1875 add_function_candidate (struct z_candidate
**candidates
,
1876 tree fn
, tree ctype
, tree first_arg
,
1877 const vec
<tree
, va_gc
> *args
, tree access_path
,
1878 tree conversion_path
, int flags
,
1879 tsubst_flags_t complain
)
1881 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1885 tree orig_first_arg
= first_arg
;
1888 struct rejection_reason
*reason
= NULL
;
1890 /* At this point we should not see any functions which haven't been
1891 explicitly declared, except for friend functions which will have
1892 been found using argument dependent lookup. */
1893 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
1895 /* The `this', `in_chrg' and VTT arguments to constructors are not
1896 considered in overload resolution. */
1897 if (DECL_CONSTRUCTOR_P (fn
))
1899 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
1900 skip
= num_artificial_parms_for (fn
);
1901 if (skip
> 0 && first_arg
!= NULL_TREE
)
1904 first_arg
= NULL_TREE
;
1910 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
1911 convs
= alloc_conversions (len
);
1913 /* 13.3.2 - Viable functions [over.match.viable]
1914 First, to be a viable function, a candidate function shall have enough
1915 parameters to agree in number with the arguments in the list.
1917 We need to check this first; otherwise, checking the ICSes might cause
1918 us to produce an ill-formed template instantiation. */
1920 parmnode
= parmlist
;
1921 for (i
= 0; i
< len
; ++i
)
1923 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
1925 parmnode
= TREE_CHAIN (parmnode
);
1928 if ((i
< len
&& parmnode
)
1929 || !sufficient_parms_p (parmnode
))
1931 int remaining
= remaining_arguments (parmnode
);
1933 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
1935 /* When looking for a function from a subobject from an implicit
1936 copy/move constructor/operator=, don't consider anything that takes (a
1937 reference to) an unrelated type. See c++/44909 and core 1092. */
1938 else if (parmlist
&& (flags
& LOOKUP_DEFAULTED
))
1940 if (DECL_CONSTRUCTOR_P (fn
))
1942 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
1943 && DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
)
1949 parmnode
= chain_index (i
-1, parmlist
);
1950 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
1955 /* This only applies at the top level. */
1956 flags
&= ~LOOKUP_DEFAULTED
;
1962 /* Second, for F to be a viable function, there shall exist for each
1963 argument an implicit conversion sequence that converts that argument
1964 to the corresponding parameter of F. */
1966 parmnode
= parmlist
;
1968 for (i
= 0; i
< len
; ++i
)
1970 tree argtype
, to_type
;
1975 if (parmnode
== void_list_node
)
1978 if (i
== 0 && first_arg
!= NULL_TREE
)
1981 arg
= CONST_CAST_TREE (
1982 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
1983 argtype
= lvalue_type (arg
);
1985 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1986 && ! DECL_CONSTRUCTOR_P (fn
));
1990 tree parmtype
= TREE_VALUE (parmnode
);
1993 parmnode
= TREE_CHAIN (parmnode
);
1995 /* The type of the implicit object parameter ('this') for
1996 overload resolution is not always the same as for the
1997 function itself; conversion functions are considered to
1998 be members of the class being converted, and functions
1999 introduced by a using-declaration are considered to be
2000 members of the class that uses them.
2002 Since build_over_call ignores the ICS for the `this'
2003 parameter, we can just change the parm type. */
2004 if (ctype
&& is_this
)
2006 parmtype
= cp_build_qualified_type
2007 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
2008 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
2010 /* If the function has a ref-qualifier, the implicit
2011 object parameter has reference type. */
2012 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
2013 parmtype
= cp_build_reference_type (parmtype
, rv
);
2017 parmtype
= build_pointer_type (parmtype
);
2018 arg
= build_this (arg
);
2019 argtype
= lvalue_type (arg
);
2023 /* Core issue 899: When [copy-]initializing a temporary to be bound
2024 to the first parameter of a copy constructor (12.8) called with
2025 a single argument in the context of direct-initialization,
2026 explicit conversion functions are also considered.
2028 So set LOOKUP_COPY_PARM to let reference_binding know that
2029 it's being called in that context. We generalize the above
2030 to handle move constructors and template constructors as well;
2031 the standardese should soon be updated similarly. */
2032 if (ctype
&& i
== 0 && (len
-skip
== 1)
2033 && DECL_CONSTRUCTOR_P (fn
)
2034 && parmtype
!= error_mark_node
2035 && (same_type_ignoring_top_level_qualifiers_p
2036 (non_reference (parmtype
), ctype
)))
2038 if (!(flags
& LOOKUP_ONLYCONVERTING
))
2039 lflags
|= LOOKUP_COPY_PARM
;
2040 /* We allow user-defined conversions within init-lists, but
2041 don't list-initialize the copy parm, as that would mean
2042 using two levels of braces for the same type. */
2043 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
2044 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
2045 lflags
|= LOOKUP_NO_CONVERSION
;
2048 lflags
|= LOOKUP_ONLYCONVERTING
;
2050 t
= implicit_conversion (parmtype
, argtype
, arg
,
2051 /*c_cast_p=*/false, lflags
, complain
);
2056 t
= build_identity_conv (argtype
, arg
);
2057 t
->ellipsis_p
= true;
2068 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
);
2075 reason
= bad_arg_conversion_rejection (first_arg
, i
, argtype
, to_type
);
2080 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2081 access_path
, conversion_path
, viable
, reason
, flags
);
2084 /* Create an overload candidate for the conversion function FN which will
2085 be invoked for expression OBJ, producing a pointer-to-function which
2086 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2087 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2088 passed on to implicit_conversion.
2090 Actually, we don't really care about FN; we care about the type it
2091 converts to. There may be multiple conversion functions that will
2092 convert to that type, and we rely on build_user_type_conversion_1 to
2093 choose the best one; so when we create our candidate, we record the type
2094 instead of the function. */
2096 static struct z_candidate
*
2097 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2098 tree first_arg
, const vec
<tree
, va_gc
> *arglist
,
2099 tree access_path
, tree conversion_path
,
2100 tsubst_flags_t complain
)
2102 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2103 int i
, len
, viable
, flags
;
2104 tree parmlist
, parmnode
;
2106 struct rejection_reason
*reason
;
2108 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2109 parmlist
= TREE_TYPE (parmlist
);
2110 parmlist
= TYPE_ARG_TYPES (parmlist
);
2112 len
= vec_safe_length (arglist
) + (first_arg
!= NULL_TREE
? 1 : 0) + 1;
2113 convs
= alloc_conversions (len
);
2114 parmnode
= parmlist
;
2116 flags
= LOOKUP_IMPLICIT
;
2119 /* Don't bother looking up the same type twice. */
2120 if (*candidates
&& (*candidates
)->fn
== totype
)
2123 for (i
= 0; i
< len
; ++i
)
2125 tree arg
, argtype
, convert_type
= NULL_TREE
;
2130 else if (i
== 1 && first_arg
!= NULL_TREE
)
2133 arg
= (*arglist
)[i
- (first_arg
!= NULL_TREE
? 1 : 0) - 1];
2134 argtype
= lvalue_type (arg
);
2138 t
= implicit_conversion (totype
, argtype
, arg
, /*c_cast_p=*/false,
2140 convert_type
= totype
;
2142 else if (parmnode
== void_list_node
)
2146 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2147 /*c_cast_p=*/false, flags
, complain
);
2148 convert_type
= TREE_VALUE (parmnode
);
2152 t
= build_identity_conv (argtype
, arg
);
2153 t
->ellipsis_p
= true;
2154 convert_type
= argtype
;
2164 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, argtype
, convert_type
);
2171 parmnode
= TREE_CHAIN (parmnode
);
2175 || ! sufficient_parms_p (parmnode
))
2177 int remaining
= remaining_arguments (parmnode
);
2179 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2182 return add_candidate (candidates
, totype
, first_arg
, arglist
, len
, convs
,
2183 access_path
, conversion_path
, viable
, reason
, flags
);
2187 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2188 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2189 int flags
, tsubst_flags_t complain
)
2196 struct rejection_reason
*reason
= NULL
;
2201 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2202 convs
= alloc_conversions (num_convs
);
2204 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2205 conversion ops are allowed. We handle that here by just checking for
2206 boolean_type_node because other operators don't ask for it. COND_EXPR
2207 also does contextual conversion to bool for the first operand, but we
2208 handle that in build_conditional_expr, and type1 here is operand 2. */
2209 if (type1
!= boolean_type_node
)
2210 flags
|= LOOKUP_ONLYCONVERTING
;
2212 for (i
= 0; i
< 2; ++i
)
2217 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2218 /*c_cast_p=*/false, flags
, complain
);
2222 /* We need something for printing the candidate. */
2223 t
= build_identity_conv (types
[i
], NULL_TREE
);
2224 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2230 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2236 /* For COND_EXPR we rearranged the arguments; undo that now. */
2239 convs
[2] = convs
[1];
2240 convs
[1] = convs
[0];
2241 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2242 /*c_cast_p=*/false, flags
,
2249 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2254 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2256 /*access_path=*/NULL_TREE
,
2257 /*conversion_path=*/NULL_TREE
,
2258 viable
, reason
, flags
);
2262 is_complete (tree t
)
2264 return COMPLETE_TYPE_P (complete_type (t
));
2267 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2270 promoted_arithmetic_type_p (tree type
)
2274 In this section, the term promoted integral type is used to refer
2275 to those integral types which are preserved by integral promotion
2276 (including e.g. int and long but excluding e.g. char).
2277 Similarly, the term promoted arithmetic type refers to promoted
2278 integral types plus floating types. */
2279 return ((CP_INTEGRAL_TYPE_P (type
)
2280 && same_type_p (type_promotes_to (type
), type
))
2281 || TREE_CODE (type
) == REAL_TYPE
);
2284 /* Create any builtin operator overload candidates for the operator in
2285 question given the converted operand types TYPE1 and TYPE2. The other
2286 args are passed through from add_builtin_candidates to
2287 build_builtin_candidate.
2289 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2290 If CODE is requires candidates operands of the same type of the kind
2291 of which TYPE1 and TYPE2 are, we add both candidates
2292 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2295 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2296 enum tree_code code2
, tree fnname
, tree type1
,
2297 tree type2
, tree
*args
, tree
*argtypes
, int flags
,
2298 tsubst_flags_t complain
)
2302 case POSTINCREMENT_EXPR
:
2303 case POSTDECREMENT_EXPR
:
2304 args
[1] = integer_zero_node
;
2305 type2
= integer_type_node
;
2314 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2315 and VQ is either volatile or empty, there exist candidate operator
2316 functions of the form
2317 VQ T& operator++(VQ T&);
2318 T operator++(VQ T&, int);
2319 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2320 type other than bool, and VQ is either volatile or empty, there exist
2321 candidate operator functions of the form
2322 VQ T& operator--(VQ T&);
2323 T operator--(VQ T&, int);
2324 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2325 complete object type, and VQ is either volatile or empty, there exist
2326 candidate operator functions of the form
2327 T*VQ& operator++(T*VQ&);
2328 T*VQ& operator--(T*VQ&);
2329 T* operator++(T*VQ&, int);
2330 T* operator--(T*VQ&, int); */
2332 case POSTDECREMENT_EXPR
:
2333 case PREDECREMENT_EXPR
:
2334 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2336 case POSTINCREMENT_EXPR
:
2337 case PREINCREMENT_EXPR
:
2338 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2340 type1
= build_reference_type (type1
);
2345 /* 7 For every cv-qualified or cv-unqualified object type T, there
2346 exist candidate operator functions of the form
2350 8 For every function type T, there exist candidate operator functions of
2352 T& operator*(T*); */
2355 if (TYPE_PTR_P (type1
)
2356 && (TYPE_PTROB_P (type1
)
2357 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2361 /* 9 For every type T, there exist candidate operator functions of the form
2364 10For every promoted arithmetic type T, there exist candidate operator
2365 functions of the form
2369 case UNARY_PLUS_EXPR
: /* unary + */
2370 if (TYPE_PTR_P (type1
))
2373 if (ARITHMETIC_TYPE_P (type1
))
2377 /* 11For every promoted integral type T, there exist candidate operator
2378 functions of the form
2382 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2386 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2387 is the same type as C2 or is a derived class of C2, T is a complete
2388 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2389 there exist candidate operator functions of the form
2390 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2391 where CV12 is the union of CV1 and CV2. */
2394 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2396 tree c1
= TREE_TYPE (type1
);
2397 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2399 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2400 && (TYPE_PTRMEMFUNC_P (type2
)
2401 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2406 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2407 didate operator functions of the form
2412 bool operator<(L, R);
2413 bool operator>(L, R);
2414 bool operator<=(L, R);
2415 bool operator>=(L, R);
2416 bool operator==(L, R);
2417 bool operator!=(L, R);
2418 where LR is the result of the usual arithmetic conversions between
2421 14For every pair of types T and I, where T is a cv-qualified or cv-
2422 unqualified complete object type and I is a promoted integral type,
2423 there exist candidate operator functions of the form
2424 T* operator+(T*, I);
2425 T& operator[](T*, I);
2426 T* operator-(T*, I);
2427 T* operator+(I, T*);
2428 T& operator[](I, T*);
2430 15For every T, where T is a pointer to complete object type, there exist
2431 candidate operator functions of the form112)
2432 ptrdiff_t operator-(T, T);
2434 16For every pointer or enumeration type T, there exist candidate operator
2435 functions of the form
2436 bool operator<(T, T);
2437 bool operator>(T, T);
2438 bool operator<=(T, T);
2439 bool operator>=(T, T);
2440 bool operator==(T, T);
2441 bool operator!=(T, T);
2443 17For every pointer to member type T, there exist candidate operator
2444 functions of the form
2445 bool operator==(T, T);
2446 bool operator!=(T, T); */
2449 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2451 if (TYPE_PTROB_P (type1
)
2452 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2454 type2
= ptrdiff_type_node
;
2458 case TRUNC_DIV_EXPR
:
2459 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2465 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2466 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2468 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2473 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2485 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2487 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2489 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2490 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2492 if (TYPE_PTR_P (type1
)
2493 && null_ptr_cst_p (args
[1]))
2498 if (null_ptr_cst_p (args
[0])
2499 && TYPE_PTR_P (type2
))
2507 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2510 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2512 type1
= ptrdiff_type_node
;
2515 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2517 type2
= ptrdiff_type_node
;
2522 /* 18For every pair of promoted integral types L and R, there exist candi-
2523 date operator functions of the form
2530 where LR is the result of the usual arithmetic conversions between
2533 case TRUNC_MOD_EXPR
:
2539 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2543 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2544 type, VQ is either volatile or empty, and R is a promoted arithmetic
2545 type, there exist candidate operator functions of the form
2546 VQ L& operator=(VQ L&, R);
2547 VQ L& operator*=(VQ L&, R);
2548 VQ L& operator/=(VQ L&, R);
2549 VQ L& operator+=(VQ L&, R);
2550 VQ L& operator-=(VQ L&, R);
2552 20For every pair T, VQ), where T is any type and VQ is either volatile
2553 or empty, there exist candidate operator functions of the form
2554 T*VQ& operator=(T*VQ&, T*);
2556 21For every pair T, VQ), where T is a pointer to member type and VQ is
2557 either volatile or empty, there exist candidate operator functions of
2559 VQ T& operator=(VQ T&, T);
2561 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2562 unqualified complete object type, VQ is either volatile or empty, and
2563 I is a promoted integral type, there exist candidate operator func-
2565 T*VQ& operator+=(T*VQ&, I);
2566 T*VQ& operator-=(T*VQ&, I);
2568 23For every triple L, VQ, R), where L is an integral or enumeration
2569 type, VQ is either volatile or empty, and R is a promoted integral
2570 type, there exist candidate operator functions of the form
2572 VQ L& operator%=(VQ L&, R);
2573 VQ L& operator<<=(VQ L&, R);
2574 VQ L& operator>>=(VQ L&, R);
2575 VQ L& operator&=(VQ L&, R);
2576 VQ L& operator^=(VQ L&, R);
2577 VQ L& operator|=(VQ L&, R); */
2584 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2586 type2
= ptrdiff_type_node
;
2590 case TRUNC_DIV_EXPR
:
2591 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2595 case TRUNC_MOD_EXPR
:
2601 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2606 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2608 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2609 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2610 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2611 || ((TYPE_PTRMEMFUNC_P (type1
)
2612 || TYPE_PTR_P (type1
))
2613 && null_ptr_cst_p (args
[1])))
2623 type1
= build_reference_type (type1
);
2629 For every pair of promoted arithmetic types L and R, there
2630 exist candidate operator functions of the form
2632 LR operator?(bool, L, R);
2634 where LR is the result of the usual arithmetic conversions
2635 between types L and R.
2637 For every type T, where T is a pointer or pointer-to-member
2638 type, there exist candidate operator functions of the form T
2639 operator?(bool, T, T); */
2641 if (promoted_arithmetic_type_p (type1
)
2642 && promoted_arithmetic_type_p (type2
))
2646 /* Otherwise, the types should be pointers. */
2647 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2650 /* We don't check that the two types are the same; the logic
2651 below will actually create two candidates; one in which both
2652 parameter types are TYPE1, and one in which both parameter
2658 if (ARITHMETIC_TYPE_P (type1
))
2666 /* Make sure we don't create builtin candidates with dependent types. */
2667 bool u1
= uses_template_parms (type1
);
2668 bool u2
= type2
? uses_template_parms (type2
) : false;
2671 /* Try to recover if one of the types is non-dependent. But if
2672 there's only one type, there's nothing we can do. */
2675 /* And we lose if both are dependent. */
2678 /* Or if they have different forms. */
2679 if (TREE_CODE (type1
) != TREE_CODE (type2
))
2688 /* If we're dealing with two pointer types or two enumeral types,
2689 we need candidates for both of them. */
2690 if (type2
&& !same_type_p (type1
, type2
)
2691 && TREE_CODE (type1
) == TREE_CODE (type2
)
2692 && (TREE_CODE (type1
) == REFERENCE_TYPE
2693 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2694 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2695 || TYPE_PTRMEMFUNC_P (type1
)
2696 || MAYBE_CLASS_TYPE_P (type1
)
2697 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2699 if (TYPE_PTR_OR_PTRMEM_P (type1
))
2701 tree cptype
= composite_pointer_type (type1
, type2
,
2706 if (cptype
!= error_mark_node
)
2708 build_builtin_candidate
2709 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
2715 build_builtin_candidate
2716 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
2717 build_builtin_candidate
2718 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
2722 build_builtin_candidate
2723 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
2727 type_decays_to (tree type
)
2729 if (TREE_CODE (type
) == ARRAY_TYPE
)
2730 return build_pointer_type (TREE_TYPE (type
));
2731 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2732 return build_pointer_type (type
);
2736 /* There are three conditions of builtin candidates:
2738 1) bool-taking candidates. These are the same regardless of the input.
2739 2) pointer-pair taking candidates. These are generated for each type
2740 one of the input types converts to.
2741 3) arithmetic candidates. According to the standard, we should generate
2742 all of these, but I'm trying not to...
2744 Here we generate a superset of the possible candidates for this particular
2745 case. That is a subset of the full set the standard defines, plus some
2746 other cases which the standard disallows. add_builtin_candidate will
2747 filter out the invalid set. */
2750 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2751 enum tree_code code2
, tree fnname
, tree
*args
,
2752 int flags
, tsubst_flags_t complain
)
2756 tree type
, argtypes
[3], t
;
2757 /* TYPES[i] is the set of possible builtin-operator parameter types
2758 we will consider for the Ith argument. */
2759 vec
<tree
, va_gc
> *types
[2];
2762 for (i
= 0; i
< 3; ++i
)
2765 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2767 argtypes
[i
] = NULL_TREE
;
2772 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2773 and VQ is either volatile or empty, there exist candidate operator
2774 functions of the form
2775 VQ T& operator++(VQ T&); */
2777 case POSTINCREMENT_EXPR
:
2778 case PREINCREMENT_EXPR
:
2779 case POSTDECREMENT_EXPR
:
2780 case PREDECREMENT_EXPR
:
2785 /* 24There also exist candidate operator functions of the form
2786 bool operator!(bool);
2787 bool operator&&(bool, bool);
2788 bool operator||(bool, bool); */
2790 case TRUTH_NOT_EXPR
:
2791 build_builtin_candidate
2792 (candidates
, fnname
, boolean_type_node
,
2793 NULL_TREE
, args
, argtypes
, flags
, complain
);
2796 case TRUTH_ORIF_EXPR
:
2797 case TRUTH_ANDIF_EXPR
:
2798 build_builtin_candidate
2799 (candidates
, fnname
, boolean_type_node
,
2800 boolean_type_node
, args
, argtypes
, flags
, complain
);
2822 types
[0] = make_tree_vector ();
2823 types
[1] = make_tree_vector ();
2825 for (i
= 0; i
< 2; ++i
)
2829 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
2833 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
2836 convs
= lookup_conversions (argtypes
[i
]);
2838 if (code
== COND_EXPR
)
2840 if (real_lvalue_p (args
[i
]))
2841 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
2843 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
2849 for (; convs
; convs
= TREE_CHAIN (convs
))
2851 type
= TREE_TYPE (convs
);
2854 && (TREE_CODE (type
) != REFERENCE_TYPE
2855 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
2858 if (code
== COND_EXPR
&& TREE_CODE (type
) == REFERENCE_TYPE
)
2859 vec_safe_push (types
[i
], type
);
2861 type
= non_reference (type
);
2862 if (i
!= 0 || ! ref1
)
2864 type
= cv_unqualified (type_decays_to (type
));
2865 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
2866 vec_safe_push (types
[i
], type
);
2867 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2868 type
= type_promotes_to (type
);
2871 if (! vec_member (type
, types
[i
]))
2872 vec_safe_push (types
[i
], type
);
2877 if (code
== COND_EXPR
&& real_lvalue_p (args
[i
]))
2878 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
2879 type
= non_reference (argtypes
[i
]);
2880 if (i
!= 0 || ! ref1
)
2882 type
= cv_unqualified (type_decays_to (type
));
2883 if (enum_p
&& UNSCOPED_ENUM_P (type
))
2884 vec_safe_push (types
[i
], type
);
2885 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2886 type
= type_promotes_to (type
);
2888 vec_safe_push (types
[i
], type
);
2892 /* Run through the possible parameter types of both arguments,
2893 creating candidates with those parameter types. */
2894 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
2899 if (!types
[1]->is_empty ())
2900 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
2901 add_builtin_candidate
2902 (candidates
, code
, code2
, fnname
, t
,
2903 u
, args
, argtypes
, flags
, complain
);
2905 add_builtin_candidate
2906 (candidates
, code
, code2
, fnname
, t
,
2907 NULL_TREE
, args
, argtypes
, flags
, complain
);
2910 release_tree_vector (types
[0]);
2911 release_tree_vector (types
[1]);
2915 /* If TMPL can be successfully instantiated as indicated by
2916 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2918 TMPL is the template. EXPLICIT_TARGS are any explicit template
2919 arguments. ARGLIST is the arguments provided at the call-site.
2920 This does not change ARGLIST. The RETURN_TYPE is the desired type
2921 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
2922 as for add_function_candidate. If an OBJ is supplied, FLAGS and
2923 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
2925 static struct z_candidate
*
2926 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
2927 tree ctype
, tree explicit_targs
, tree first_arg
,
2928 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
2929 tree access_path
, tree conversion_path
,
2930 int flags
, tree obj
, unification_kind_t strict
,
2931 tsubst_flags_t complain
)
2933 int ntparms
= DECL_NTPARMS (tmpl
);
2934 tree targs
= make_tree_vec (ntparms
);
2935 unsigned int len
= vec_safe_length (arglist
);
2936 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
2937 unsigned int skip_without_in_chrg
= 0;
2938 tree first_arg_without_in_chrg
= first_arg
;
2939 tree
*args_without_in_chrg
;
2940 unsigned int nargs_without_in_chrg
;
2941 unsigned int ia
, ix
;
2943 struct z_candidate
*cand
;
2945 struct rejection_reason
*reason
= NULL
;
2948 /* We don't do deduction on the in-charge parameter, the VTT
2949 parameter or 'this'. */
2950 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
2952 if (first_arg_without_in_chrg
!= NULL_TREE
)
2953 first_arg_without_in_chrg
= NULL_TREE
;
2955 ++skip_without_in_chrg
;
2958 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
2959 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
2960 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
2962 if (first_arg_without_in_chrg
!= NULL_TREE
)
2963 first_arg_without_in_chrg
= NULL_TREE
;
2965 ++skip_without_in_chrg
;
2968 if (len
< skip_without_in_chrg
)
2971 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
2972 + (len
- skip_without_in_chrg
));
2973 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
2975 if (first_arg_without_in_chrg
!= NULL_TREE
)
2977 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
2980 for (ix
= skip_without_in_chrg
;
2981 vec_safe_iterate (arglist
, ix
, &arg
);
2984 args_without_in_chrg
[ia
] = arg
;
2987 gcc_assert (ia
== nargs_without_in_chrg
);
2989 errs
= errorcount
+sorrycount
;
2990 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
2991 args_without_in_chrg
,
2992 nargs_without_in_chrg
,
2993 return_type
, strict
, flags
, false,
2994 complain
& tf_decltype
);
2996 if (fn
== error_mark_node
)
2998 /* Don't repeat unification later if it already resulted in errors. */
2999 if (errorcount
+sorrycount
== errs
)
3000 reason
= template_unification_rejection (tmpl
, explicit_targs
,
3001 targs
, args_without_in_chrg
,
3002 nargs_without_in_chrg
,
3003 return_type
, strict
, flags
);
3005 reason
= template_unification_error_rejection ();
3011 A member function template is never instantiated to perform the
3012 copy of a class object to an object of its class type.
3014 It's a little unclear what this means; the standard explicitly
3015 does allow a template to be used to copy a class. For example,
3020 template <class T> A(const T&);
3023 void g () { A a (f ()); }
3025 the member template will be used to make the copy. The section
3026 quoted above appears in the paragraph that forbids constructors
3027 whose only parameter is (a possibly cv-qualified variant of) the
3028 class type, and a logical interpretation is that the intent was
3029 to forbid the instantiation of member templates which would then
3031 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
3033 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
3034 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
3037 reason
= invalid_copy_with_fn_template_rejection ();
3042 if (obj
!= NULL_TREE
)
3043 /* Aha, this is a conversion function. */
3044 cand
= add_conv_candidate (candidates
, fn
, obj
, first_arg
, arglist
,
3045 access_path
, conversion_path
, complain
);
3047 cand
= add_function_candidate (candidates
, fn
, ctype
,
3048 first_arg
, arglist
, access_path
,
3049 conversion_path
, flags
, complain
);
3050 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
3051 /* This situation can occur if a member template of a template
3052 class is specialized. Then, instantiate_template might return
3053 an instantiation of the specialization, in which case the
3054 DECL_TI_TEMPLATE field will point at the original
3055 specialization. For example:
3057 template <class T> struct S { template <class U> void f(U);
3058 template <> void f(int) {}; };
3062 Here, TMPL will be template <class U> S<double>::f(U).
3063 And, instantiate template will give us the specialization
3064 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3065 for this will point at template <class T> template <> S<T>::f(int),
3066 so that we can find the definition. For the purposes of
3067 overload resolution, however, we want the original TMPL. */
3068 cand
->template_decl
= build_template_info (tmpl
, targs
);
3070 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3071 cand
->explicit_targs
= explicit_targs
;
3075 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3076 access_path
, conversion_path
, 0, reason
, flags
);
3080 static struct z_candidate
*
3081 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3082 tree explicit_targs
, tree first_arg
,
3083 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3084 tree access_path
, tree conversion_path
, int flags
,
3085 unification_kind_t strict
, tsubst_flags_t complain
)
3088 add_template_candidate_real (candidates
, tmpl
, ctype
,
3089 explicit_targs
, first_arg
, arglist
,
3090 return_type
, access_path
, conversion_path
,
3091 flags
, NULL_TREE
, strict
, complain
);
3095 static struct z_candidate
*
3096 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3097 tree obj
, tree first_arg
,
3098 const vec
<tree
, va_gc
> *arglist
,
3099 tree return_type
, tree access_path
,
3100 tree conversion_path
, tsubst_flags_t complain
)
3103 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3104 first_arg
, arglist
, return_type
, access_path
,
3105 conversion_path
, 0, obj
, DEDUCE_CONV
,
3109 /* The CANDS are the set of candidates that were considered for
3110 overload resolution. Return the set of viable candidates, or CANDS
3111 if none are viable. If any of the candidates were viable, set
3112 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3113 considered viable only if it is strictly viable. */
3115 static struct z_candidate
*
3116 splice_viable (struct z_candidate
*cands
,
3120 struct z_candidate
*viable
;
3121 struct z_candidate
**last_viable
;
3122 struct z_candidate
**cand
;
3124 /* Be strict inside templates, since build_over_call won't actually
3125 do the conversions to get pedwarns. */
3126 if (processing_template_decl
)
3130 last_viable
= &viable
;
3131 *any_viable_p
= false;
3136 struct z_candidate
*c
= *cand
;
3137 if (strict_p
? c
->viable
== 1 : c
->viable
)
3142 last_viable
= &c
->next
;
3143 *any_viable_p
= true;
3149 return viable
? viable
: cands
;
3153 any_strictly_viable (struct z_candidate
*cands
)
3155 for (; cands
; cands
= cands
->next
)
3156 if (cands
->viable
== 1)
3161 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3162 words, it is about to become the "this" pointer for a member
3163 function call. Take the address of the object. */
3166 build_this (tree obj
)
3168 /* In a template, we are only concerned about the type of the
3169 expression, so we can take a shortcut. */
3170 if (processing_template_decl
)
3171 return build_address (obj
);
3173 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3176 /* Returns true iff functions are equivalent. Equivalent functions are
3177 not '==' only if one is a function-local extern function or if
3178 both are extern "C". */
3181 equal_functions (tree fn1
, tree fn2
)
3183 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3185 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3187 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3188 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3189 return decls_match (fn1
, fn2
);
3193 /* Print information about a candidate being rejected due to INFO. */
3196 print_conversion_rejection (location_t loc
, struct conversion_info
*info
)
3198 if (info
->n_arg
== -1)
3199 /* Conversion of implicit `this' argument failed. */
3200 inform (loc
, " no known conversion for implicit "
3201 "%<this%> parameter from %qT to %qT",
3202 info
->from_type
, info
->to_type
);
3203 else if (info
->n_arg
== -2)
3204 /* Conversion of conversion function return value failed. */
3205 inform (loc
, " no known conversion from %qT to %qT",
3206 info
->from_type
, info
->to_type
);
3208 inform (loc
, " no known conversion for argument %d from %qT to %qT",
3209 info
->n_arg
+1, info
->from_type
, info
->to_type
);
3212 /* Print information about a candidate with WANT parameters and we found
3216 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3218 inform_n (loc
, want
,
3219 " candidate expects %d argument, %d provided",
3220 " candidate expects %d arguments, %d provided",
3224 /* Print information about one overload candidate CANDIDATE. MSGSTR
3225 is the text to print before the candidate itself.
3227 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3228 to have been run through gettext by the caller. This wart makes
3229 life simpler in print_z_candidates and for the translators. */
3232 print_z_candidate (location_t loc
, const char *msgstr
,
3233 struct z_candidate
*candidate
)
3235 const char *msg
= (msgstr
== NULL
3237 : ACONCAT ((msgstr
, " ", NULL
)));
3238 location_t cloc
= location_of (candidate
->fn
);
3240 if (identifier_p (candidate
->fn
))
3243 if (candidate
->num_convs
== 3)
3244 inform (cloc
, "%s%D(%T, %T, %T) <built-in>", msg
, candidate
->fn
,
3245 candidate
->convs
[0]->type
,
3246 candidate
->convs
[1]->type
,
3247 candidate
->convs
[2]->type
);
3248 else if (candidate
->num_convs
== 2)
3249 inform (cloc
, "%s%D(%T, %T) <built-in>", msg
, candidate
->fn
,
3250 candidate
->convs
[0]->type
,
3251 candidate
->convs
[1]->type
);
3253 inform (cloc
, "%s%D(%T) <built-in>", msg
, candidate
->fn
,
3254 candidate
->convs
[0]->type
);
3256 else if (TYPE_P (candidate
->fn
))
3257 inform (cloc
, "%s%T <conversion>", msg
, candidate
->fn
);
3258 else if (candidate
->viable
== -1)
3259 inform (cloc
, "%s%#D <near match>", msg
, candidate
->fn
);
3260 else if (DECL_DELETED_FN (candidate
->fn
))
3261 inform (cloc
, "%s%#D <deleted>", msg
, candidate
->fn
);
3263 inform (cloc
, "%s%#D", msg
, candidate
->fn
);
3264 /* Give the user some information about why this candidate failed. */
3265 if (candidate
->reason
!= NULL
)
3267 struct rejection_reason
*r
= candidate
->reason
;
3272 print_arity_information (cloc
, r
->u
.arity
.actual
,
3273 r
->u
.arity
.expected
);
3275 case rr_arg_conversion
:
3276 print_conversion_rejection (cloc
, &r
->u
.conversion
);
3278 case rr_bad_arg_conversion
:
3279 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
);
3281 case rr_explicit_conversion
:
3282 inform (cloc
, " return type %qT of explicit conversion function "
3283 "cannot be converted to %qT with a qualification "
3284 "conversion", r
->u
.conversion
.from_type
,
3285 r
->u
.conversion
.to_type
);
3287 case rr_template_conversion
:
3288 inform (cloc
, " conversion from return type %qT of template "
3289 "conversion function specialization to %qT is not an "
3290 "exact match", r
->u
.conversion
.from_type
,
3291 r
->u
.conversion
.to_type
);
3293 case rr_template_unification
:
3294 /* We use template_unification_error_rejection if unification caused
3295 actual non-SFINAE errors, in which case we don't need to repeat
3297 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3299 inform (cloc
, " substitution of deduced template arguments "
3300 "resulted in errors seen above");
3303 /* Re-run template unification with diagnostics. */
3304 inform (cloc
, " template argument deduction/substitution failed:");
3305 fn_type_unification (r
->u
.template_unification
.tmpl
,
3306 r
->u
.template_unification
.explicit_targs
,
3308 (r
->u
.template_unification
.num_targs
)),
3309 r
->u
.template_unification
.args
,
3310 r
->u
.template_unification
.nargs
,
3311 r
->u
.template_unification
.return_type
,
3312 r
->u
.template_unification
.strict
,
3313 r
->u
.template_unification
.flags
,
3316 case rr_invalid_copy
:
3318 " a constructor taking a single argument of its own "
3319 "class type is invalid");
3323 /* This candidate didn't have any issues or we failed to
3324 handle a particular code. Either way... */
3331 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3333 struct z_candidate
*cand1
;
3334 struct z_candidate
**cand2
;
3340 /* Remove non-viable deleted candidates. */
3342 for (cand2
= &cand1
; *cand2
; )
3344 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3345 && !(*cand2
)->viable
3346 && DECL_DELETED_FN ((*cand2
)->fn
))
3347 *cand2
= (*cand2
)->next
;
3349 cand2
= &(*cand2
)->next
;
3351 /* ...if there are any non-deleted ones. */
3355 /* There may be duplicates in the set of candidates. We put off
3356 checking this condition as long as possible, since we have no way
3357 to eliminate duplicates from a set of functions in less than n^2
3358 time. Now we are about to emit an error message, so it is more
3359 permissible to go slowly. */
3360 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3362 tree fn
= cand1
->fn
;
3363 /* Skip builtin candidates and conversion functions. */
3366 cand2
= &cand1
->next
;
3369 if (DECL_P ((*cand2
)->fn
)
3370 && equal_functions (fn
, (*cand2
)->fn
))
3371 *cand2
= (*cand2
)->next
;
3373 cand2
= &(*cand2
)->next
;
3377 for (n_candidates
= 0, cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3380 inform_n (loc
, n_candidates
, "candidate is:", "candidates are:");
3381 for (; candidates
; candidates
= candidates
->next
)
3382 print_z_candidate (loc
, NULL
, candidates
);
3385 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3386 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3387 the result of the conversion function to convert it to the final
3388 desired type. Merge the two sequences into a single sequence,
3389 and return the merged sequence. */
3392 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3395 bool bad
= user_seq
->bad_p
;
3397 gcc_assert (user_seq
->kind
== ck_user
);
3399 /* Find the end of the second conversion sequence. */
3400 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3402 /* The entire sequence is a user-conversion sequence. */
3403 (*t
)->user_conv_p
= true;
3408 /* Replace the identity conversion with the user conversion
3415 /* Handle overload resolution for initializing an object of class type from
3416 an initializer list. First we look for a suitable constructor that
3417 takes a std::initializer_list; if we don't find one, we then look for a
3418 non-list constructor.
3420 Parameters are as for add_candidates, except that the arguments are in
3421 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3422 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3425 add_list_candidates (tree fns
, tree first_arg
,
3426 tree init_list
, tree totype
,
3427 tree explicit_targs
, bool template_only
,
3428 tree conversion_path
, tree access_path
,
3430 struct z_candidate
**candidates
,
3431 tsubst_flags_t complain
)
3433 vec
<tree
, va_gc
> *args
;
3435 gcc_assert (*candidates
== NULL
);
3437 /* We're looking for a ctor for list-initialization. */
3438 flags
|= LOOKUP_LIST_INIT_CTOR
;
3439 /* And we don't allow narrowing conversions. We also use this flag to
3440 avoid the copy constructor call for copy-list-initialization. */
3441 flags
|= LOOKUP_NO_NARROWING
;
3443 /* Always use the default constructor if the list is empty (DR 990). */
3444 if (CONSTRUCTOR_NELTS (init_list
) == 0
3445 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3447 /* If the class has a list ctor, try passing the list as a single
3448 argument first, but only consider list ctors. */
3449 else if (TYPE_HAS_LIST_CTOR (totype
))
3451 flags
|= LOOKUP_LIST_ONLY
;
3452 args
= make_tree_vector_single (init_list
);
3453 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3454 explicit_targs
, template_only
, conversion_path
,
3455 access_path
, flags
, candidates
, complain
);
3456 if (any_strictly_viable (*candidates
))
3460 args
= ctor_to_vec (init_list
);
3462 /* We aren't looking for list-ctors anymore. */
3463 flags
&= ~LOOKUP_LIST_ONLY
;
3464 /* We allow more user-defined conversions within an init-list. */
3465 flags
&= ~LOOKUP_NO_CONVERSION
;
3467 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3468 explicit_targs
, template_only
, conversion_path
,
3469 access_path
, flags
, candidates
, complain
);
3472 /* Returns the best overload candidate to perform the requested
3473 conversion. This function is used for three the overloading situations
3474 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3475 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3476 per [dcl.init.ref], so we ignore temporary bindings. */
3478 static struct z_candidate
*
3479 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3480 tsubst_flags_t complain
)
3482 struct z_candidate
*candidates
, *cand
;
3484 tree ctors
= NULL_TREE
;
3485 tree conv_fns
= NULL_TREE
;
3486 conversion
*conv
= NULL
;
3487 tree first_arg
= NULL_TREE
;
3488 vec
<tree
, va_gc
> *args
= NULL
;
3495 fromtype
= TREE_TYPE (expr
);
3497 /* We represent conversion within a hierarchy using RVALUE_CONV and
3498 BASE_CONV, as specified by [over.best.ics]; these become plain
3499 constructor calls, as specified in [dcl.init]. */
3500 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3501 || !DERIVED_FROM_P (totype
, fromtype
));
3503 if (MAYBE_CLASS_TYPE_P (totype
))
3504 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3505 creating a garbage BASELINK; constructors can't be inherited. */
3506 ctors
= lookup_fnfields_slot (totype
, complete_ctor_identifier
);
3508 if (MAYBE_CLASS_TYPE_P (fromtype
))
3510 tree to_nonref
= non_reference (totype
);
3511 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3512 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3513 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3515 /* [class.conv.fct] A conversion function is never used to
3516 convert a (possibly cv-qualified) object to the (possibly
3517 cv-qualified) same object type (or a reference to it), to a
3518 (possibly cv-qualified) base class of that type (or a
3519 reference to it)... */
3522 conv_fns
= lookup_conversions (fromtype
);
3526 flags
|= LOOKUP_NO_CONVERSION
;
3527 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3528 flags
|= LOOKUP_NO_NARROWING
;
3530 /* It's OK to bind a temporary for converting constructor arguments, but
3531 not in converting the return value of a conversion operator. */
3532 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
);
3533 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3537 int ctorflags
= flags
;
3539 first_arg
= build_dummy_object (totype
);
3541 /* We should never try to call the abstract or base constructor
3543 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors
))
3544 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors
)));
3546 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3548 /* List-initialization. */
3549 add_list_candidates (ctors
, first_arg
, expr
, totype
, NULL_TREE
,
3550 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3551 ctorflags
, &candidates
, complain
);
3555 args
= make_tree_vector_single (expr
);
3556 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3557 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3558 ctorflags
, &candidates
, complain
);
3561 for (cand
= candidates
; cand
; cand
= cand
->next
)
3563 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3565 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3566 set, then this is copy-initialization. In that case, "The
3567 result of the call is then used to direct-initialize the
3568 object that is the destination of the copy-initialization."
3571 We represent this in the conversion sequence with an
3572 rvalue conversion, which means a constructor call. */
3573 if (TREE_CODE (totype
) != REFERENCE_TYPE
3574 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3576 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3583 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3585 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3586 struct z_candidate
*old_candidates
;
3588 /* If we are called to convert to a reference type, we are trying to
3589 find a direct binding, so don't even consider temporaries. If
3590 we don't find a direct binding, the caller will try again to
3591 look for a temporary binding. */
3592 if (TREE_CODE (totype
) == REFERENCE_TYPE
)
3593 convflags
|= LOOKUP_NO_TEMP_BIND
;
3595 old_candidates
= candidates
;
3596 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
3598 conversion_path
, TYPE_BINFO (fromtype
),
3599 flags
, &candidates
, complain
);
3601 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
3603 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
3605 = implicit_conversion (totype
,
3608 /*c_cast_p=*/false, convflags
,
3611 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3612 copy-initialization. In that case, "The result of the
3613 call is then used to direct-initialize the object that is
3614 the destination of the copy-initialization." [dcl.init]
3616 We represent this in the conversion sequence with an
3617 rvalue conversion, which means a constructor call. But
3618 don't add a second rvalue conversion if there's already
3619 one there. Which there really shouldn't be, but it's
3620 harmless since we'd add it here anyway. */
3621 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
3622 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3623 ics
= build_conv (ck_rvalue
, totype
, ics
);
3625 cand
->second_conv
= ics
;
3630 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -2,
3633 else if (DECL_NONCONVERTING_P (cand
->fn
)
3634 && ics
->rank
> cr_exact
)
3636 /* 13.3.1.5: For direct-initialization, those explicit
3637 conversion functions that are not hidden within S and
3638 yield type T or a type that can be converted to type T
3639 with a qualification conversion (4.4) are also candidate
3641 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3642 I've raised this issue with the committee. --jason 9/2011 */
3644 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
3646 else if (cand
->viable
== 1 && ics
->bad_p
)
3650 = bad_arg_conversion_rejection (NULL_TREE
, -2,
3653 else if (primary_template_instantiation_p (cand
->fn
)
3654 && ics
->rank
> cr_exact
)
3656 /* 13.3.3.1.2: If the user-defined conversion is specified by
3657 a specialization of a conversion function template, the
3658 second standard conversion sequence shall have exact match
3661 cand
->reason
= template_conversion_rejection (rettype
, totype
);
3666 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
3670 release_tree_vector (args
);
3674 cand
= tourney (candidates
, complain
);
3677 if (complain
& tf_error
)
3679 error ("conversion from %qT to %qT is ambiguous",
3681 print_z_candidates (location_of (expr
), candidates
);
3684 cand
= candidates
; /* any one will do */
3685 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
3686 cand
->second_conv
->user_conv_p
= true;
3687 if (!any_strictly_viable (candidates
))
3688 cand
->second_conv
->bad_p
= true;
3689 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3690 ambiguous conversion is no worse than another user-defined
3697 if (!DECL_CONSTRUCTOR_P (cand
->fn
))
3698 convtype
= non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)));
3699 else if (cand
->second_conv
->kind
== ck_rvalue
)
3700 /* DR 5: [in the first step of copy-initialization]...if the function
3701 is a constructor, the call initializes a temporary of the
3702 cv-unqualified version of the destination type. */
3703 convtype
= cv_unqualified (totype
);
3706 /* Build the user conversion sequence. */
3710 build_identity_conv (TREE_TYPE (expr
), expr
));
3712 if (cand
->viable
== -1)
3715 /* Remember that this was a list-initialization. */
3716 if (flags
& LOOKUP_NO_NARROWING
)
3717 conv
->check_narrowing
= true;
3719 /* Combine it with the second conversion sequence. */
3720 cand
->second_conv
= merge_conversion_sequences (conv
,
3726 /* Wrapper for above. */
3729 build_user_type_conversion (tree totype
, tree expr
, int flags
,
3730 tsubst_flags_t complain
)
3732 struct z_candidate
*cand
;
3735 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
3736 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
3740 if (cand
->second_conv
->kind
== ck_ambig
)
3741 ret
= error_mark_node
;
3744 expr
= convert_like (cand
->second_conv
, expr
, complain
);
3745 ret
= convert_from_reference (expr
);
3751 timevar_cond_stop (TV_OVERLOAD
, subtime
);
3755 /* Subroutine of convert_nontype_argument.
3757 EXPR is an argument for a template non-type parameter of integral or
3758 enumeration type. Do any necessary conversions (that are permitted for
3759 non-type arguments) to convert it to the parameter type.
3761 If conversion is successful, returns the converted expression;
3762 otherwise, returns error_mark_node. */
3765 build_integral_nontype_arg_conv (tree type
, tree expr
, tsubst_flags_t complain
)
3770 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
3772 if (error_operand_p (expr
))
3773 return error_mark_node
;
3775 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
3777 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3778 p
= conversion_obstack_alloc (0);
3780 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
3782 LOOKUP_IMPLICIT
, complain
);
3784 /* for a non-type template-parameter of integral or
3785 enumeration type, integral promotions (4.5) and integral
3786 conversions (4.7) are applied. */
3787 /* It should be sufficient to check the outermost conversion step, since
3788 there are no qualification conversions to integer type. */
3792 /* A conversion function is OK. If it isn't constexpr, we'll
3793 complain later that the argument isn't constant. */
3795 /* The lvalue-to-rvalue conversion is OK. */
3801 t
= next_conversion (conv
)->type
;
3802 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
))
3805 if (complain
& tf_error
)
3806 error_at (loc
, "conversion from %qT to %qT not considered for "
3807 "non-type template argument", t
, type
);
3808 /* and fall through. */
3816 expr
= convert_like (conv
, expr
, complain
);
3818 expr
= error_mark_node
;
3820 /* Free all the conversions we allocated. */
3821 obstack_free (&conversion_obstack
, p
);
3826 /* Do any initial processing on the arguments to a function call. */
3828 static vec
<tree
, va_gc
> *
3829 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
3834 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
3836 if (error_operand_p (arg
))
3838 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
3840 if (complain
& tf_error
)
3841 error ("invalid use of void expression");
3844 else if (invalid_nonstatic_memfn_p (arg
, complain
))
3850 /* Perform overload resolution on FN, which is called with the ARGS.
3852 Return the candidate function selected by overload resolution, or
3853 NULL if the event that overload resolution failed. In the case
3854 that overload resolution fails, *CANDIDATES will be the set of
3855 candidates considered, and ANY_VIABLE_P will be set to true or
3856 false to indicate whether or not any of the candidates were
3859 The ARGS should already have gone through RESOLVE_ARGS before this
3860 function is called. */
3862 static struct z_candidate
*
3863 perform_overload_resolution (tree fn
,
3864 const vec
<tree
, va_gc
> *args
,
3865 struct z_candidate
**candidates
,
3866 bool *any_viable_p
, tsubst_flags_t complain
)
3868 struct z_candidate
*cand
;
3869 tree explicit_targs
;
3872 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
3874 explicit_targs
= NULL_TREE
;
3878 *any_viable_p
= true;
3881 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
3882 || TREE_CODE (fn
) == TEMPLATE_DECL
3883 || TREE_CODE (fn
) == OVERLOAD
3884 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
3886 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3888 explicit_targs
= TREE_OPERAND (fn
, 1);
3889 fn
= TREE_OPERAND (fn
, 0);
3893 /* Add the various candidate functions. */
3894 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
3895 explicit_targs
, template_only
,
3896 /*conversion_path=*/NULL_TREE
,
3897 /*access_path=*/NULL_TREE
,
3899 candidates
, complain
);
3901 *candidates
= splice_viable (*candidates
, pedantic
, any_viable_p
);
3903 cand
= tourney (*candidates
, complain
);
3907 timevar_cond_stop (TV_OVERLOAD
, subtime
);
3911 /* Print an error message about being unable to build a call to FN with
3912 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
3913 be located; CANDIDATES is a possibly empty list of such
3917 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
, bool any_viable_p
,
3918 struct z_candidate
*candidates
)
3920 tree name
= DECL_NAME (OVL_CURRENT (fn
));
3921 location_t loc
= location_of (name
);
3924 error_at (loc
, "no matching function for call to %<%D(%A)%>",
3925 name
, build_tree_list_vec (args
));
3927 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
3928 name
, build_tree_list_vec (args
));
3930 print_z_candidates (loc
, candidates
);
3933 /* Return an expression for a call to FN (a namespace-scope function,
3934 or a static member function) with the ARGS. This may change
3938 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
, bool koenig_p
,
3939 tsubst_flags_t complain
)
3941 struct z_candidate
*candidates
, *cand
;
3946 if (args
!= NULL
&& *args
!= NULL
)
3948 *args
= resolve_args (*args
, complain
);
3950 return error_mark_node
;
3954 tm_malloc_replacement (fn
);
3956 /* If this function was found without using argument dependent
3957 lookup, then we want to ignore any undeclared friend
3963 fn
= remove_hidden_names (fn
);
3966 if (complain
& tf_error
)
3967 print_error_for_call_failure (orig_fn
, *args
, false, NULL
);
3968 return error_mark_node
;
3972 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3973 p
= conversion_obstack_alloc (0);
3975 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
3980 if (complain
& tf_error
)
3982 if (!any_viable_p
&& candidates
&& ! candidates
->next
3983 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
3984 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
3985 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3986 fn
= TREE_OPERAND (fn
, 0);
3987 print_error_for_call_failure (fn
, *args
, any_viable_p
, candidates
);
3989 result
= error_mark_node
;
3993 int flags
= LOOKUP_NORMAL
;
3994 /* If fn is template_id_expr, the call has explicit template arguments
3995 (e.g. func<int>(5)), communicate this info to build_over_call
3996 through flags so that later we can use it to decide whether to warn
3997 about peculiar null pointer conversion. */
3998 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3999 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4000 result
= build_over_call (cand
, flags
, complain
);
4003 /* Free all the conversions we allocated. */
4004 obstack_free (&conversion_obstack
, p
);
4009 /* Build a call to a global operator new. FNNAME is the name of the
4010 operator (either "operator new" or "operator new[]") and ARGS are
4011 the arguments provided. This may change ARGS. *SIZE points to the
4012 total number of bytes required by the allocation, and is updated if
4013 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4014 be used. If this function determines that no cookie should be
4015 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4016 is not NULL_TREE, it is evaluated before calculating the final
4017 array size, and if it fails, the array size is replaced with
4018 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4019 is non-NULL, it will be set, upon return, to the allocation
4023 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4024 tree
*size
, tree
*cookie_size
, tree size_check
,
4025 tree
*fn
, tsubst_flags_t complain
)
4027 tree original_size
= *size
;
4029 struct z_candidate
*candidates
;
4030 struct z_candidate
*cand
;
4035 /* Set to (size_t)-1 if the size check fails. */
4036 if (size_check
!= NULL_TREE
)
4038 tree errval
= TYPE_MAX_VALUE (sizetype
);
4039 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4040 errval
= throw_bad_array_new_length ();
4041 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4042 original_size
, errval
);
4044 vec_safe_insert (*args
, 0, *size
);
4045 *args
= resolve_args (*args
, complain
);
4047 return error_mark_node
;
4053 If this lookup fails to find the name, or if the allocated type
4054 is not a class type, the allocation function's name is looked
4055 up in the global scope.
4057 we disregard block-scope declarations of "operator new". */
4058 fns
= lookup_function_nonclass (fnname
, *args
, /*block_p=*/false);
4060 /* Figure out what function is being called. */
4061 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
4064 /* If no suitable function could be found, issue an error message
4068 if (complain
& tf_error
)
4069 print_error_for_call_failure (fns
, *args
, any_viable_p
, candidates
);
4070 return error_mark_node
;
4073 /* If a cookie is required, add some extra space. Whether
4074 or not a cookie is required cannot be determined until
4075 after we know which function was called. */
4078 bool use_cookie
= true;
4079 if (!abi_version_at_least (2))
4081 /* In G++ 3.2, the check was implemented incorrectly; it
4082 looked at the placement expression, rather than the
4083 type of the function. */
4084 if ((*args
)->length () == 2
4085 && same_type_p (TREE_TYPE ((**args
)[1]), ptr_type_node
))
4092 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4093 /* Skip the size_t parameter. */
4094 arg_types
= TREE_CHAIN (arg_types
);
4095 /* Check the remaining parameters (if any). */
4097 && TREE_CHAIN (arg_types
) == void_list_node
4098 && same_type_p (TREE_VALUE (arg_types
),
4102 /* If we need a cookie, adjust the number of bytes allocated. */
4105 /* Update the total size. */
4106 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4107 /* Set to (size_t)-1 if the size check fails. */
4108 gcc_assert (size_check
!= NULL_TREE
);
4109 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4110 *size
, TYPE_MAX_VALUE (sizetype
));
4111 /* Update the argument list to reflect the adjusted size. */
4112 (**args
)[0] = *size
;
4115 *cookie_size
= NULL_TREE
;
4118 /* Tell our caller which function we decided to call. */
4122 /* Build the CALL_EXPR. */
4123 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4126 /* Build a new call to operator(). This may change ARGS. */
4129 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4131 struct z_candidate
*candidates
= 0, *cand
;
4132 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4133 tree type
= TREE_TYPE (obj
);
4135 tree result
= NULL_TREE
;
4138 if (error_operand_p (obj
))
4139 return error_mark_node
;
4141 obj
= prep_operand (obj
);
4143 if (TYPE_PTRMEMFUNC_P (type
))
4145 if (complain
& tf_error
)
4146 /* It's no good looking for an overloaded operator() on a
4147 pointer-to-member-function. */
4148 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj
);
4149 return error_mark_node
;
4152 if (TYPE_BINFO (type
))
4154 fns
= lookup_fnfields (TYPE_BINFO (type
), ansi_opname (CALL_EXPR
), 1);
4155 if (fns
== error_mark_node
)
4156 return error_mark_node
;
4161 if (args
!= NULL
&& *args
!= NULL
)
4163 *args
= resolve_args (*args
, complain
);
4165 return error_mark_node
;
4168 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4169 p
= conversion_obstack_alloc (0);
4173 first_mem_arg
= obj
;
4175 add_candidates (BASELINK_FUNCTIONS (fns
),
4176 first_mem_arg
, *args
, NULL_TREE
,
4178 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4179 LOOKUP_NORMAL
, &candidates
, complain
);
4182 convs
= lookup_conversions (type
);
4184 for (; convs
; convs
= TREE_CHAIN (convs
))
4186 tree fns
= TREE_VALUE (convs
);
4187 tree totype
= TREE_TYPE (convs
);
4189 if (TYPE_PTRFN_P (totype
)
4190 || TYPE_REFFN_P (totype
)
4191 || (TREE_CODE (totype
) == REFERENCE_TYPE
4192 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4193 for (; fns
; fns
= OVL_NEXT (fns
))
4195 tree fn
= OVL_CURRENT (fns
);
4197 if (DECL_NONCONVERTING_P (fn
))
4200 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4201 add_template_conv_candidate
4202 (&candidates
, fn
, obj
, NULL_TREE
, *args
, totype
,
4203 /*access_path=*/NULL_TREE
,
4204 /*conversion_path=*/NULL_TREE
, complain
);
4206 add_conv_candidate (&candidates
, fn
, obj
, NULL_TREE
,
4207 *args
, /*conversion_path=*/NULL_TREE
,
4208 /*access_path=*/NULL_TREE
, complain
);
4212 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
4215 if (complain
& tf_error
)
4217 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4218 build_tree_list_vec (*args
));
4219 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4221 result
= error_mark_node
;
4225 cand
= tourney (candidates
, complain
);
4228 if (complain
& tf_error
)
4230 error ("call of %<(%T) (%A)%> is ambiguous",
4231 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4232 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4234 result
= error_mark_node
;
4236 /* Since cand->fn will be a type, not a function, for a conversion
4237 function, we must be careful not to unconditionally look at
4239 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4240 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
) == CALL_EXPR
)
4241 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4244 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
, -1,
4246 obj
= convert_from_reference (obj
);
4247 result
= cp_build_function_call_vec (obj
, args
, complain
);
4251 /* Free all the conversions we allocated. */
4252 obstack_free (&conversion_obstack
, p
);
4257 /* Wrapper for above. */
4260 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4263 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4264 ret
= build_op_call_1 (obj
, args
, complain
);
4265 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4269 /* Called by op_error to prepare format strings suitable for the error
4270 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4271 and a suffix (controlled by NTYPES). */
4274 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4278 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4279 : G_("no match for "), errmsg
, NULL
);
4282 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4283 else if (ntypes
== 2)
4284 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4286 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4292 op_error (location_t loc
, enum tree_code code
, enum tree_code code2
,
4293 tree arg1
, tree arg2
, tree arg3
, bool match
)
4297 if (code
== MODIFY_EXPR
)
4298 opname
= assignment_operator_name_info
[code2
].name
;
4300 opname
= operator_name_info
[code
].name
;
4305 if (flag_diagnostics_show_caret
)
4306 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4308 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4310 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4311 "in %<%E ? %E : %E%>"), 3, match
),
4313 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4316 case POSTINCREMENT_EXPR
:
4317 case POSTDECREMENT_EXPR
:
4318 if (flag_diagnostics_show_caret
)
4319 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4320 opname
, TREE_TYPE (arg1
));
4322 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4324 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4328 if (flag_diagnostics_show_caret
)
4329 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4330 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4332 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4334 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4339 if (flag_diagnostics_show_caret
)
4340 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4341 opname
, TREE_TYPE (arg1
));
4343 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4344 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4349 if (flag_diagnostics_show_caret
)
4350 error_at (loc
, op_error_string (G_("%<operator%s%>"), 2, match
),
4351 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4353 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4355 opname
, arg1
, opname
, arg2
,
4356 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4358 if (flag_diagnostics_show_caret
)
4359 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4360 opname
, TREE_TYPE (arg1
));
4362 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4364 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4369 /* Return the implicit conversion sequence that could be used to
4370 convert E1 to E2 in [expr.cond]. */
4373 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4375 tree t1
= non_reference (TREE_TYPE (e1
));
4376 tree t2
= non_reference (TREE_TYPE (e2
));
4382 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4383 implicitly converted (clause _conv_) to the type "lvalue reference to
4384 T2", subject to the constraint that in the conversion the
4385 reference must bind directly (_dcl.init.ref_) to an lvalue.
4387 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4388 implicitly converted to the type "rvalue reference to T2", subject to
4389 the constraint that the reference must bind directly. */
4390 if (lvalue_or_rvalue_with_address_p (e2
))
4392 tree rtype
= cp_build_reference_type (t2
, !real_lvalue_p (e2
));
4393 conv
= implicit_conversion (rtype
,
4397 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4398 |LOOKUP_ONLYCONVERTING
,
4400 if (conv
&& !conv
->bad_p
)
4404 /* If E2 is a prvalue or if neither of the conversions above can be done
4405 and at least one of the operands has (possibly cv-qualified) class
4407 if (!CLASS_TYPE_P (t1
) && !CLASS_TYPE_P (t2
))
4412 If E1 and E2 have class type, and the underlying class types are
4413 the same or one is a base class of the other: E1 can be converted
4414 to match E2 if the class of T2 is the same type as, or a base
4415 class of, the class of T1, and the cv-qualification of T2 is the
4416 same cv-qualification as, or a greater cv-qualification than, the
4417 cv-qualification of T1. If the conversion is applied, E1 is
4418 changed to an rvalue of type T2 that still refers to the original
4419 source class object (or the appropriate subobject thereof). */
4420 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4421 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4423 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4425 conv
= build_identity_conv (t1
, e1
);
4426 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4427 TYPE_MAIN_VARIANT (t2
)))
4428 conv
= build_conv (ck_base
, t2
, conv
);
4430 conv
= build_conv (ck_rvalue
, t2
, conv
);
4439 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4440 converted to the type that expression E2 would have if E2 were
4441 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4442 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4443 LOOKUP_IMPLICIT
, complain
);
4446 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4447 arguments to the conditional expression. */
4450 build_conditional_expr_1 (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
4451 tsubst_flags_t complain
)
4455 tree result
= NULL_TREE
;
4456 tree result_type
= NULL_TREE
;
4457 bool lvalue_p
= true;
4458 struct z_candidate
*candidates
= 0;
4459 struct z_candidate
*cand
;
4461 tree orig_arg2
, orig_arg3
;
4463 /* As a G++ extension, the second argument to the conditional can be
4464 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4465 c'.) If the second operand is omitted, make sure it is
4466 calculated only once. */
4469 if (complain
& tf_error
)
4470 pedwarn (loc
, OPT_Wpedantic
,
4471 "ISO C++ forbids omitting the middle term of a ?: expression");
4473 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4474 if (real_lvalue_p (arg1
))
4475 arg2
= arg1
= stabilize_reference (arg1
);
4477 arg2
= arg1
= save_expr (arg1
);
4480 /* If something has already gone wrong, just pass that fact up the
4482 if (error_operand_p (arg1
)
4483 || error_operand_p (arg2
)
4484 || error_operand_p (arg3
))
4485 return error_mark_node
;
4490 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
4492 arg1
= force_rvalue (arg1
, complain
);
4493 arg2
= force_rvalue (arg2
, complain
);
4494 arg3
= force_rvalue (arg3
, complain
);
4496 /* force_rvalue can return error_mark on valid arguments. */
4497 if (error_operand_p (arg1
)
4498 || error_operand_p (arg2
)
4499 || error_operand_p (arg3
))
4500 return error_mark_node
;
4502 tree arg1_type
= TREE_TYPE (arg1
);
4503 arg2_type
= TREE_TYPE (arg2
);
4504 arg3_type
= TREE_TYPE (arg3
);
4506 if (TREE_CODE (arg2_type
) != VECTOR_TYPE
4507 && TREE_CODE (arg3_type
) != VECTOR_TYPE
)
4509 /* Rely on the error messages of the scalar version. */
4510 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
4511 orig_arg2
, orig_arg3
, complain
);
4512 if (scal
== error_mark_node
)
4513 return error_mark_node
;
4514 tree stype
= TREE_TYPE (scal
);
4515 tree ctype
= TREE_TYPE (arg1_type
);
4516 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
4517 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
4519 if (complain
& tf_error
)
4520 error_at (loc
, "inferred scalar type %qT is not an integer or "
4521 "floating point type of the same size as %qT", stype
,
4522 COMPARISON_CLASS_P (arg1
)
4523 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
4525 return error_mark_node
;
4528 tree vtype
= build_opaque_vector_type (stype
,
4529 TYPE_VECTOR_SUBPARTS (arg1_type
));
4530 /* We could pass complain & tf_warning to unsafe_conversion_p,
4531 but the warnings (like Wsign-conversion) have already been
4532 given by the scalar build_conditional_expr_1. We still check
4533 unsafe_conversion_p to forbid truncating long long -> float. */
4534 if (unsafe_conversion_p (loc
, stype
, arg2
, false))
4536 if (complain
& tf_error
)
4537 error_at (loc
, "conversion of scalar %qT to vector %qT "
4538 "involves truncation", arg2_type
, vtype
);
4539 return error_mark_node
;
4541 if (unsafe_conversion_p (loc
, stype
, arg3
, false))
4543 if (complain
& tf_error
)
4544 error_at (loc
, "conversion of scalar %qT to vector %qT "
4545 "involves truncation", arg3_type
, vtype
);
4546 return error_mark_node
;
4549 arg2
= cp_convert (stype
, arg2
, complain
);
4550 arg2
= save_expr (arg2
);
4551 arg2
= build_vector_from_val (vtype
, arg2
);
4553 arg3
= cp_convert (stype
, arg3
, complain
);
4554 arg3
= save_expr (arg3
);
4555 arg3
= build_vector_from_val (vtype
, arg3
);
4559 if ((TREE_CODE (arg2_type
) == VECTOR_TYPE
)
4560 != (TREE_CODE (arg3_type
) == VECTOR_TYPE
))
4562 enum stv_conv convert_flag
=
4563 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
4564 complain
& tf_error
);
4566 switch (convert_flag
)
4569 return error_mark_node
;
4572 arg2
= save_expr (arg2
);
4573 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
4574 arg2
= build_vector_from_val (arg3_type
, arg2
);
4575 arg2_type
= TREE_TYPE (arg2
);
4580 arg3
= save_expr (arg3
);
4581 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
4582 arg3
= build_vector_from_val (arg2_type
, arg3
);
4583 arg3_type
= TREE_TYPE (arg3
);
4591 if (!same_type_p (arg2_type
, arg3_type
)
4592 || TYPE_VECTOR_SUBPARTS (arg1_type
)
4593 != TYPE_VECTOR_SUBPARTS (arg2_type
)
4594 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
4596 if (complain
& tf_error
)
4598 "incompatible vector types in conditional expression: "
4599 "%qT, %qT and %qT", TREE_TYPE (arg1
),
4600 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
4601 return error_mark_node
;
4604 if (!COMPARISON_CLASS_P (arg1
))
4605 arg1
= cp_build_binary_op (loc
, NE_EXPR
, arg1
,
4606 build_zero_cst (arg1_type
), complain
);
4607 return fold_build3 (VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
4612 The first expression is implicitly converted to bool (clause
4614 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
4616 if (error_operand_p (arg1
))
4617 return error_mark_node
;
4621 If either the second or the third operand has type (possibly
4622 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4623 array-to-pointer (_conv.array_), and function-to-pointer
4624 (_conv.func_) standard conversions are performed on the second
4625 and third operands. */
4626 arg2_type
= unlowered_expr_type (arg2
);
4627 arg3_type
= unlowered_expr_type (arg3
);
4628 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
4630 /* Do the conversions. We don't these for `void' type arguments
4631 since it can't have any effect and since decay_conversion
4632 does not handle that case gracefully. */
4633 if (!VOID_TYPE_P (arg2_type
))
4634 arg2
= decay_conversion (arg2
, complain
);
4635 if (!VOID_TYPE_P (arg3_type
))
4636 arg3
= decay_conversion (arg3
, complain
);
4637 arg2_type
= TREE_TYPE (arg2
);
4638 arg3_type
= TREE_TYPE (arg3
);
4642 One of the following shall hold:
4644 --The second or the third operand (but not both) is a
4645 throw-expression (_except.throw_); the result is of the
4646 type of the other and is an rvalue.
4648 --Both the second and the third operands have type void; the
4649 result is of type void and is an rvalue.
4651 We must avoid calling force_rvalue for expressions of type
4652 "void" because it will complain that their value is being
4654 if (TREE_CODE (arg2
) == THROW_EXPR
4655 && TREE_CODE (arg3
) != THROW_EXPR
)
4657 if (!VOID_TYPE_P (arg3_type
))
4659 arg3
= force_rvalue (arg3
, complain
);
4660 if (arg3
== error_mark_node
)
4661 return error_mark_node
;
4663 arg3_type
= TREE_TYPE (arg3
);
4664 result_type
= arg3_type
;
4666 else if (TREE_CODE (arg2
) != THROW_EXPR
4667 && TREE_CODE (arg3
) == THROW_EXPR
)
4669 if (!VOID_TYPE_P (arg2_type
))
4671 arg2
= force_rvalue (arg2
, complain
);
4672 if (arg2
== error_mark_node
)
4673 return error_mark_node
;
4675 arg2_type
= TREE_TYPE (arg2
);
4676 result_type
= arg2_type
;
4678 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
4679 result_type
= void_type_node
;
4682 if (complain
& tf_error
)
4684 if (VOID_TYPE_P (arg2_type
))
4685 error_at (EXPR_LOC_OR_LOC (arg3
, loc
),
4686 "second operand to the conditional operator "
4687 "is of type %<void%>, but the third operand is "
4688 "neither a throw-expression nor of type %<void%>");
4690 error_at (EXPR_LOC_OR_LOC (arg2
, loc
),
4691 "third operand to the conditional operator "
4692 "is of type %<void%>, but the second operand is "
4693 "neither a throw-expression nor of type %<void%>");
4695 return error_mark_node
;
4699 goto valid_operands
;
4703 Otherwise, if the second and third operand have different types,
4704 and either has (possibly cv-qualified) class type, or if both are
4705 glvalues of the same value category and the same type except for
4706 cv-qualification, an attempt is made to convert each of those operands
4707 to the type of the other. */
4708 else if (!same_type_p (arg2_type
, arg3_type
)
4709 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)
4710 || (same_type_ignoring_top_level_qualifiers_p (arg2_type
,
4712 && lvalue_or_rvalue_with_address_p (arg2
)
4713 && lvalue_or_rvalue_with_address_p (arg3
)
4714 && real_lvalue_p (arg2
) == real_lvalue_p (arg3
))))
4719 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4720 p
= conversion_obstack_alloc (0);
4722 conv2
= conditional_conversion (arg2
, arg3
, complain
);
4723 conv3
= conditional_conversion (arg3
, arg2
, complain
);
4727 If both can be converted, or one can be converted but the
4728 conversion is ambiguous, the program is ill-formed. If
4729 neither can be converted, the operands are left unchanged and
4730 further checking is performed as described below. If exactly
4731 one conversion is possible, that conversion is applied to the
4732 chosen operand and the converted operand is used in place of
4733 the original operand for the remainder of this section. */
4734 if ((conv2
&& !conv2
->bad_p
4735 && conv3
&& !conv3
->bad_p
)
4736 || (conv2
&& conv2
->kind
== ck_ambig
)
4737 || (conv3
&& conv3
->kind
== ck_ambig
))
4739 if (complain
& tf_error
)
4741 error_at (loc
, "operands to ?: have different types %qT and %qT",
4742 arg2_type
, arg3_type
);
4743 if (conv2
&& !conv2
->bad_p
&& conv3
&& !conv3
->bad_p
)
4744 inform (loc
, " and each type can be converted to the other");
4745 else if (conv2
&& conv2
->kind
== ck_ambig
)
4746 convert_like (conv2
, arg2
, complain
);
4748 convert_like (conv3
, arg3
, complain
);
4750 result
= error_mark_node
;
4752 else if (conv2
&& !conv2
->bad_p
)
4754 arg2
= convert_like (conv2
, arg2
, complain
);
4755 arg2
= convert_from_reference (arg2
);
4756 arg2_type
= TREE_TYPE (arg2
);
4757 /* Even if CONV2 is a valid conversion, the result of the
4758 conversion may be invalid. For example, if ARG3 has type
4759 "volatile X", and X does not have a copy constructor
4760 accepting a "volatile X&", then even if ARG2 can be
4761 converted to X, the conversion will fail. */
4762 if (error_operand_p (arg2
))
4763 result
= error_mark_node
;
4765 else if (conv3
&& !conv3
->bad_p
)
4767 arg3
= convert_like (conv3
, arg3
, complain
);
4768 arg3
= convert_from_reference (arg3
);
4769 arg3_type
= TREE_TYPE (arg3
);
4770 if (error_operand_p (arg3
))
4771 result
= error_mark_node
;
4774 /* Free all the conversions we allocated. */
4775 obstack_free (&conversion_obstack
, p
);
4780 /* If, after the conversion, both operands have class type,
4781 treat the cv-qualification of both operands as if it were the
4782 union of the cv-qualification of the operands.
4784 The standard is not clear about what to do in this
4785 circumstance. For example, if the first operand has type
4786 "const X" and the second operand has a user-defined
4787 conversion to "volatile X", what is the type of the second
4788 operand after this step? Making it be "const X" (matching
4789 the first operand) seems wrong, as that discards the
4790 qualification without actually performing a copy. Leaving it
4791 as "volatile X" seems wrong as that will result in the
4792 conditional expression failing altogether, even though,
4793 according to this step, the one operand could be converted to
4794 the type of the other. */
4795 if (((conv2
&& !conv2
->bad_p
)
4796 || (conv3
&& !conv3
->bad_p
))
4797 && CLASS_TYPE_P (arg2_type
)
4798 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
4799 arg2_type
= arg3_type
=
4800 cp_build_qualified_type (arg2_type
,
4801 cp_type_quals (arg2_type
)
4802 | cp_type_quals (arg3_type
));
4807 If the second and third operands are glvalues of the same value
4808 category and have the same type, the result is of that type and
4810 if (((real_lvalue_p (arg2
) && real_lvalue_p (arg3
))
4811 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
4812 && same_type_p (arg2_type
, arg3_type
))
4814 result_type
= arg2_type
;
4815 arg2
= mark_lvalue_use (arg2
);
4816 arg3
= mark_lvalue_use (arg3
);
4817 goto valid_operands
;
4822 Otherwise, the result is an rvalue. If the second and third
4823 operand do not have the same type, and either has (possibly
4824 cv-qualified) class type, overload resolution is used to
4825 determine the conversions (if any) to be applied to the operands
4826 (_over.match.oper_, _over.built_). */
4828 if (!same_type_p (arg2_type
, arg3_type
)
4829 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
4835 /* Rearrange the arguments so that add_builtin_candidate only has
4836 to know about two args. In build_builtin_candidate, the
4837 arguments are unscrambled. */
4841 add_builtin_candidates (&candidates
,
4844 ansi_opname (COND_EXPR
),
4846 LOOKUP_NORMAL
, complain
);
4850 If the overload resolution fails, the program is
4852 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
4855 if (complain
& tf_error
)
4856 error_at (loc
, "operands to ?: have different types %qT and %qT",
4857 arg2_type
, arg3_type
);
4858 return error_mark_node
;
4860 cand
= tourney (candidates
, complain
);
4863 if (complain
& tf_error
)
4865 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
4866 print_z_candidates (loc
, candidates
);
4868 return error_mark_node
;
4873 Otherwise, the conversions thus determined are applied, and
4874 the converted operands are used in place of the original
4875 operands for the remainder of this section. */
4876 conv
= cand
->convs
[0];
4877 arg1
= convert_like (conv
, arg1
, complain
);
4878 conv
= cand
->convs
[1];
4879 arg2
= convert_like (conv
, arg2
, complain
);
4880 arg2_type
= TREE_TYPE (arg2
);
4881 conv
= cand
->convs
[2];
4882 arg3
= convert_like (conv
, arg3
, complain
);
4883 arg3_type
= TREE_TYPE (arg3
);
4888 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
4889 and function-to-pointer (_conv.func_) standard conversions are
4890 performed on the second and third operands.
4892 We need to force the lvalue-to-rvalue conversion here for class types,
4893 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
4894 that isn't wrapped with a TARGET_EXPR plays havoc with exception
4897 arg2
= force_rvalue (arg2
, complain
);
4898 if (!CLASS_TYPE_P (arg2_type
))
4899 arg2_type
= TREE_TYPE (arg2
);
4901 arg3
= force_rvalue (arg3
, complain
);
4902 if (!CLASS_TYPE_P (arg3_type
))
4903 arg3_type
= TREE_TYPE (arg3
);
4905 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
4906 return error_mark_node
;
4910 After those conversions, one of the following shall hold:
4912 --The second and third operands have the same type; the result is of
4914 if (same_type_p (arg2_type
, arg3_type
))
4915 result_type
= arg2_type
;
4918 --The second and third operands have arithmetic or enumeration
4919 type; the usual arithmetic conversions are performed to bring
4920 them to a common type, and the result is of that type. */
4921 else if ((ARITHMETIC_TYPE_P (arg2_type
)
4922 || UNSCOPED_ENUM_P (arg2_type
))
4923 && (ARITHMETIC_TYPE_P (arg3_type
)
4924 || UNSCOPED_ENUM_P (arg3_type
)))
4926 /* In this case, there is always a common type. */
4927 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
4929 if (complain
& tf_warning
)
4930 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
4931 "implicit conversion from %qT to %qT to "
4932 "match other result of conditional",
4935 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
4936 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
4938 if (TREE_CODE (orig_arg2
) == CONST_DECL
4939 && TREE_CODE (orig_arg3
) == CONST_DECL
4940 && DECL_CONTEXT (orig_arg2
) == DECL_CONTEXT (orig_arg3
))
4941 /* Two enumerators from the same enumeration can have different
4942 types when the enumeration is still being defined. */;
4943 else if (complain
& tf_warning
)
4944 warning_at (loc
, OPT_Wenum_compare
, "enumeral mismatch in "
4945 "conditional expression: %qT vs %qT",
4946 arg2_type
, arg3_type
);
4948 else if (extra_warnings
4949 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
4950 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
4951 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
4952 && !same_type_p (arg2_type
,
4953 type_promotes_to (arg3_type
)))))
4955 if (complain
& tf_warning
)
4956 warning_at (loc
, 0, "enumeral and non-enumeral type in "
4957 "conditional expression");
4960 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
4961 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
4965 --The second and third operands have pointer type, or one has
4966 pointer type and the other is a null pointer constant; pointer
4967 conversions (_conv.ptr_) and qualification conversions
4968 (_conv.qual_) are performed to bring them to their composite
4969 pointer type (_expr.rel_). The result is of the composite
4972 --The second and third operands have pointer to member type, or
4973 one has pointer to member type and the other is a null pointer
4974 constant; pointer to member conversions (_conv.mem_) and
4975 qualification conversions (_conv.qual_) are performed to bring
4976 them to a common type, whose cv-qualification shall match the
4977 cv-qualification of either the second or the third operand.
4978 The result is of the common type. */
4979 else if ((null_ptr_cst_p (arg2
)
4980 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
4981 || (null_ptr_cst_p (arg3
)
4982 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
4983 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
4984 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
4985 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
4987 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
4988 arg3
, CPO_CONDITIONAL_EXPR
,
4990 if (result_type
== error_mark_node
)
4991 return error_mark_node
;
4992 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
4993 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
4998 if (complain
& tf_error
)
4999 error_at (loc
, "operands to ?: have different types %qT and %qT",
5000 arg2_type
, arg3_type
);
5001 return error_mark_node
;
5004 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5005 return error_mark_node
;
5008 result
= build3 (COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
5009 if (!cp_unevaluated_operand
)
5010 /* Avoid folding within decltype (c++/42013) and noexcept. */
5011 result
= fold_if_not_in_template (result
);
5013 /* We can't use result_type below, as fold might have returned a
5018 /* Expand both sides into the same slot, hopefully the target of
5019 the ?: expression. We used to check for TARGET_EXPRs here,
5020 but now we sometimes wrap them in NOP_EXPRs so the test would
5022 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5023 result
= get_target_expr_sfinae (result
, complain
);
5024 /* If this expression is an rvalue, but might be mistaken for an
5025 lvalue, we must add a NON_LVALUE_EXPR. */
5026 result
= rvalue (result
);
5029 result
= force_paren_expr (result
);
5034 /* Wrapper for above. */
5037 build_conditional_expr (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
5038 tsubst_flags_t complain
)
5041 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5042 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5043 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5047 /* OPERAND is an operand to an expression. Perform necessary steps
5048 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5052 prep_operand (tree operand
)
5056 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5057 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5058 /* Make sure the template type is instantiated now. */
5059 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5065 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5066 OVERLOAD) to the CANDIDATES, returning an updated list of
5067 CANDIDATES. The ARGS are the arguments provided to the call;
5068 if FIRST_ARG is non-null it is the implicit object argument,
5069 otherwise the first element of ARGS is used if needed. The
5070 EXPLICIT_TARGS are explicit template arguments provided.
5071 TEMPLATE_ONLY is true if only template functions should be
5072 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5073 add_function_candidate. */
5076 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5078 tree explicit_targs
, bool template_only
,
5079 tree conversion_path
, tree access_path
,
5081 struct z_candidate
**candidates
,
5082 tsubst_flags_t complain
)
5085 const vec
<tree
, va_gc
> *non_static_args
;
5086 bool check_list_ctor
;
5087 bool check_converting
;
5088 unification_kind_t strict
;
5094 /* Precalculate special handling of constructors and conversion ops. */
5095 fn
= OVL_CURRENT (fns
);
5096 if (DECL_CONV_FN_P (fn
))
5098 check_list_ctor
= false;
5099 check_converting
= !!(flags
& LOOKUP_ONLYCONVERTING
);
5100 if (flags
& LOOKUP_NO_CONVERSION
)
5101 /* We're doing return_type(x). */
5102 strict
= DEDUCE_CONV
;
5104 /* We're doing x.operator return_type(). */
5105 strict
= DEDUCE_EXACT
;
5106 /* [over.match.funcs] For conversion functions, the function
5107 is considered to be a member of the class of the implicit
5108 object argument for the purpose of defining the type of
5109 the implicit object parameter. */
5110 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5114 if (DECL_CONSTRUCTOR_P (fn
))
5116 check_list_ctor
= !!(flags
& LOOKUP_LIST_ONLY
);
5117 /* For list-initialization we consider explicit constructors
5118 and complain if one is chosen. */
5120 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5121 == LOOKUP_ONLYCONVERTING
);
5125 check_list_ctor
= false;
5126 check_converting
= false;
5128 strict
= DEDUCE_CALL
;
5129 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5133 non_static_args
= args
;
5135 /* Delay creating the implicit this parameter until it is needed. */
5136 non_static_args
= NULL
;
5138 for (; fns
; fns
= OVL_NEXT (fns
))
5141 const vec
<tree
, va_gc
> *fn_args
;
5143 fn
= OVL_CURRENT (fns
);
5145 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5147 if (check_list_ctor
&& !is_list_ctor (fn
))
5150 /* Figure out which set of arguments to use. */
5151 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5153 /* If this function is a non-static member and we didn't get an
5154 implicit object argument, move it out of args. */
5155 if (first_arg
== NULL_TREE
)
5159 vec
<tree
, va_gc
> *tempvec
;
5160 vec_alloc (tempvec
, args
->length () - 1);
5161 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5162 tempvec
->quick_push (arg
);
5163 non_static_args
= tempvec
;
5164 first_arg
= (*args
)[0];
5167 fn_first_arg
= first_arg
;
5168 fn_args
= non_static_args
;
5172 /* Otherwise, just use the list of arguments provided. */
5173 fn_first_arg
= NULL_TREE
;
5177 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5178 add_template_candidate (candidates
,
5190 else if (!template_only
)
5191 add_function_candidate (candidates
,
5204 build_new_op_1 (location_t loc
, enum tree_code code
, int flags
, tree arg1
,
5205 tree arg2
, tree arg3
, tree
*overload
, tsubst_flags_t complain
)
5207 struct z_candidate
*candidates
= 0, *cand
;
5208 vec
<tree
, va_gc
> *arglist
;
5211 tree result
= NULL_TREE
;
5212 bool result_valid_p
= false;
5213 enum tree_code code2
= NOP_EXPR
;
5214 enum tree_code code_orig_arg1
= ERROR_MARK
;
5215 enum tree_code code_orig_arg2
= ERROR_MARK
;
5221 if (error_operand_p (arg1
)
5222 || error_operand_p (arg2
)
5223 || error_operand_p (arg3
))
5224 return error_mark_node
;
5226 if (code
== MODIFY_EXPR
)
5228 code2
= TREE_CODE (arg3
);
5230 fnname
= ansi_assopname (code2
);
5233 fnname
= ansi_opname (code
);
5235 arg1
= prep_operand (arg1
);
5241 case VEC_DELETE_EXPR
:
5243 /* Use build_op_new_call and build_op_delete_call instead. */
5247 /* Use build_op_call instead. */
5250 case TRUTH_ORIF_EXPR
:
5251 case TRUTH_ANDIF_EXPR
:
5252 case TRUTH_AND_EXPR
:
5254 /* These are saved for the sake of warn_logical_operator. */
5255 code_orig_arg1
= TREE_CODE (arg1
);
5256 code_orig_arg2
= TREE_CODE (arg2
);
5262 arg2
= prep_operand (arg2
);
5263 arg3
= prep_operand (arg3
);
5265 if (code
== COND_EXPR
)
5266 /* Use build_conditional_expr instead. */
5268 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5269 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5272 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5273 arg2
= integer_zero_node
;
5275 vec_alloc (arglist
, 3);
5276 arglist
->quick_push (arg1
);
5277 if (arg2
!= NULL_TREE
)
5278 arglist
->quick_push (arg2
);
5279 if (arg3
!= NULL_TREE
)
5280 arglist
->quick_push (arg3
);
5282 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5283 p
= conversion_obstack_alloc (0);
5285 /* Add namespace-scope operators to the list of functions to
5287 add_candidates (lookup_function_nonclass (fnname
, arglist
, /*block_p=*/true),
5288 NULL_TREE
, arglist
, NULL_TREE
,
5289 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5290 flags
, &candidates
, complain
);
5294 args
[2] = NULL_TREE
;
5296 /* Add class-member operators to the candidate set. */
5297 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5301 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5302 if (fns
== error_mark_node
)
5304 result
= error_mark_node
;
5305 goto user_defined_result_ready
;
5308 add_candidates (BASELINK_FUNCTIONS (fns
),
5309 NULL_TREE
, arglist
, NULL_TREE
,
5311 BASELINK_BINFO (fns
),
5312 BASELINK_ACCESS_BINFO (fns
),
5313 flags
, &candidates
, complain
);
5315 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5316 only non-member functions that have type T1 or reference to
5317 cv-qualified-opt T1 for the first argument, if the first argument
5318 has an enumeration type, or T2 or reference to cv-qualified-opt
5319 T2 for the second argument, if the the second argument has an
5320 enumeration type. Filter out those that don't match. */
5321 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5323 struct z_candidate
**candp
, **next
;
5325 for (candp
= &candidates
; *candp
; candp
= next
)
5327 tree parmlist
, parmtype
;
5328 int i
, nargs
= (arg2
? 2 : 1);
5333 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5335 for (i
= 0; i
< nargs
; ++i
)
5337 parmtype
= TREE_VALUE (parmlist
);
5339 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
5340 parmtype
= TREE_TYPE (parmtype
);
5341 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5342 && (same_type_ignoring_top_level_qualifiers_p
5343 (TREE_TYPE (args
[i
]), parmtype
)))
5346 parmlist
= TREE_CHAIN (parmlist
);
5349 /* No argument has an appropriate type, so remove this
5350 candidate function from the list. */
5353 *candp
= cand
->next
;
5359 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5366 /* For these, the built-in candidates set is empty
5367 [over.match.oper]/3. We don't want non-strict matches
5368 because exact matches are always possible with built-in
5369 operators. The built-in candidate set for COMPONENT_REF
5370 would be empty too, but since there are no such built-in
5371 operators, we accept non-strict matches for them. */
5376 strict_p
= pedantic
;
5380 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5385 case POSTINCREMENT_EXPR
:
5386 case POSTDECREMENT_EXPR
:
5387 /* Don't try anything fancy if we're not allowed to produce
5389 if (!(complain
& tf_error
))
5390 return error_mark_node
;
5392 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5393 distinguish between prefix and postfix ++ and
5394 operator++() was used for both, so we allow this with
5398 const char *msg
= (flag_permissive
)
5399 ? G_("no %<%D(int)%> declared for postfix %qs,"
5400 " trying prefix operator instead")
5401 : G_("no %<%D(int)%> declared for postfix %qs");
5402 permerror (loc
, msg
, fnname
, operator_name_info
[code
].name
);
5405 if (!flag_permissive
)
5406 return error_mark_node
;
5408 if (code
== POSTINCREMENT_EXPR
)
5409 code
= PREINCREMENT_EXPR
;
5411 code
= PREDECREMENT_EXPR
;
5412 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5413 NULL_TREE
, overload
, complain
);
5416 /* The caller will deal with these. */
5421 result_valid_p
= true;
5425 if (complain
& tf_error
)
5427 /* If one of the arguments of the operator represents
5428 an invalid use of member function pointer, try to report
5429 a meaningful error ... */
5430 if (invalid_nonstatic_memfn_p (arg1
, tf_error
)
5431 || invalid_nonstatic_memfn_p (arg2
, tf_error
)
5432 || invalid_nonstatic_memfn_p (arg3
, tf_error
))
5433 /* We displayed the error message. */;
5436 /* ... Otherwise, report the more generic
5437 "no matching operator found" error */
5438 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
5439 print_z_candidates (loc
, candidates
);
5442 result
= error_mark_node
;
5448 cand
= tourney (candidates
, complain
);
5451 if (complain
& tf_error
)
5453 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
5454 print_z_candidates (loc
, candidates
);
5456 result
= error_mark_node
;
5458 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
5461 *overload
= cand
->fn
;
5463 if (resolve_args (arglist
, complain
) == NULL
)
5464 result
= error_mark_node
;
5466 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5470 /* Give any warnings we noticed during overload resolution. */
5471 if (cand
->warnings
&& (complain
& tf_warning
))
5473 struct candidate_warning
*w
;
5474 for (w
= cand
->warnings
; w
; w
= w
->next
)
5475 joust (cand
, w
->loser
, 1, complain
);
5478 /* Check for comparison of different enum types. */
5487 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
5488 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
5489 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
5490 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
5491 && (complain
& tf_warning
))
5493 warning (OPT_Wenum_compare
,
5494 "comparison between %q#T and %q#T",
5495 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
5502 /* We need to strip any leading REF_BIND so that bitfields
5503 don't cause errors. This should not remove any important
5504 conversions, because builtins don't apply to class
5505 objects directly. */
5506 conv
= cand
->convs
[0];
5507 if (conv
->kind
== ck_ref_bind
)
5508 conv
= next_conversion (conv
);
5509 arg1
= convert_like (conv
, arg1
, complain
);
5513 conv
= cand
->convs
[1];
5514 if (conv
->kind
== ck_ref_bind
)
5515 conv
= next_conversion (conv
);
5517 arg2
= decay_conversion (arg2
, complain
);
5519 /* We need to call warn_logical_operator before
5520 converting arg2 to a boolean_type, but after
5521 decaying an enumerator to its value. */
5522 if (complain
& tf_warning
)
5523 warn_logical_operator (loc
, code
, boolean_type_node
,
5524 code_orig_arg1
, arg1
,
5525 code_orig_arg2
, arg2
);
5527 arg2
= convert_like (conv
, arg2
, complain
);
5531 conv
= cand
->convs
[2];
5532 if (conv
->kind
== ck_ref_bind
)
5533 conv
= next_conversion (conv
);
5534 arg3
= convert_like (conv
, arg3
, complain
);
5540 user_defined_result_ready
:
5542 /* Free all the conversions we allocated. */
5543 obstack_free (&conversion_obstack
, p
);
5545 if (result
|| result_valid_p
)
5552 return cp_build_modify_expr (arg1
, code2
, arg2
, complain
);
5555 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
5557 case TRUTH_ANDIF_EXPR
:
5558 case TRUTH_ORIF_EXPR
:
5559 case TRUTH_AND_EXPR
:
5561 warn_logical_operator (loc
, code
, boolean_type_node
,
5562 code_orig_arg1
, arg1
, code_orig_arg2
, arg2
);
5567 case TRUNC_DIV_EXPR
:
5578 case TRUNC_MOD_EXPR
:
5582 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
5584 case UNARY_PLUS_EXPR
:
5587 case TRUTH_NOT_EXPR
:
5588 case PREINCREMENT_EXPR
:
5589 case POSTINCREMENT_EXPR
:
5590 case PREDECREMENT_EXPR
:
5591 case POSTDECREMENT_EXPR
:
5595 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
5598 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
5601 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
5605 /* The caller will deal with these. */
5617 /* Wrapper for above. */
5620 build_new_op (location_t loc
, enum tree_code code
, int flags
,
5621 tree arg1
, tree arg2
, tree arg3
,
5622 tree
*overload
, tsubst_flags_t complain
)
5625 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5626 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
5627 overload
, complain
);
5628 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5632 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
5633 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
5636 non_placement_deallocation_fn_p (tree t
)
5638 /* A template instance is never a usual deallocation function,
5639 regardless of its signature. */
5640 if (TREE_CODE (t
) == TEMPLATE_DECL
5641 || primary_template_instantiation_p (t
))
5644 /* If a class T has a member deallocation function named operator delete
5645 with exactly one parameter, then that function is a usual
5646 (non-placement) deallocation function. If class T does not declare
5647 such an operator delete but does declare a member deallocation
5648 function named operator delete with exactly two parameters, the second
5649 of which has type std::size_t (18.2), then this function is a usual
5650 deallocation function. */
5651 t
= FUNCTION_ARG_CHAIN (t
);
5652 if (t
== void_list_node
5653 || (t
&& same_type_p (TREE_VALUE (t
), size_type_node
)
5654 && TREE_CHAIN (t
) == void_list_node
))
5659 /* Build a call to operator delete. This has to be handled very specially,
5660 because the restrictions on what signatures match are different from all
5661 other call instances. For a normal delete, only a delete taking (void *)
5662 or (void *, size_t) is accepted. For a placement delete, only an exact
5663 match with the placement new is accepted.
5665 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
5666 ADDR is the pointer to be deleted.
5667 SIZE is the size of the memory block to be deleted.
5668 GLOBAL_P is true if the delete-expression should not consider
5669 class-specific delete operators.
5670 PLACEMENT is the corresponding placement new call, or NULL_TREE.
5672 If this call to "operator delete" is being generated as part to
5673 deallocate memory allocated via a new-expression (as per [expr.new]
5674 which requires that if the initialization throws an exception then
5675 we call a deallocation function), then ALLOC_FN is the allocation
5679 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
5680 bool global_p
, tree placement
,
5681 tree alloc_fn
, tsubst_flags_t complain
)
5683 tree fn
= NULL_TREE
;
5684 tree fns
, fnname
, type
, t
;
5686 if (addr
== error_mark_node
)
5687 return error_mark_node
;
5689 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
5691 fnname
= ansi_opname (code
);
5693 if (CLASS_TYPE_P (type
)
5694 && COMPLETE_TYPE_P (complete_type (type
))
5698 If the result of the lookup is ambiguous or inaccessible, or if
5699 the lookup selects a placement deallocation function, the
5700 program is ill-formed.
5702 Therefore, we ask lookup_fnfields to complain about ambiguity. */
5704 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
5705 if (fns
== error_mark_node
)
5706 return error_mark_node
;
5711 if (fns
== NULL_TREE
)
5712 fns
= lookup_name_nonclass (fnname
);
5714 /* Strip const and volatile from addr. */
5715 addr
= cp_convert (ptr_type_node
, addr
, complain
);
5719 /* "A declaration of a placement deallocation function matches the
5720 declaration of a placement allocation function if it has the same
5721 number of parameters and, after parameter transformations (8.3.5),
5722 all parameter types except the first are identical."
5724 So we build up the function type we want and ask instantiate_type
5725 to get it for us. */
5726 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
5727 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
5728 t
= build_function_type (void_type_node
, t
);
5730 fn
= instantiate_type (t
, fns
, tf_none
);
5731 if (fn
== error_mark_node
)
5734 if (BASELINK_P (fn
))
5735 fn
= BASELINK_FUNCTIONS (fn
);
5737 /* "If the lookup finds the two-parameter form of a usual deallocation
5738 function (3.7.4.2) and that function, considered as a placement
5739 deallocation function, would have been selected as a match for the
5740 allocation function, the program is ill-formed." */
5741 if (non_placement_deallocation_fn_p (fn
))
5743 /* But if the class has an operator delete (void *), then that is
5744 the usual deallocation function, so we shouldn't complain
5745 about using the operator delete (void *, size_t). */
5746 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
5747 t
; t
= OVL_NEXT (t
))
5749 tree elt
= OVL_CURRENT (t
);
5750 if (non_placement_deallocation_fn_p (elt
)
5751 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
5754 if (complain
& tf_error
)
5756 permerror (0, "non-placement deallocation function %q+D", fn
);
5757 permerror (input_location
, "selected for placement delete");
5760 return error_mark_node
;
5765 /* "Any non-placement deallocation function matches a non-placement
5766 allocation function. If the lookup finds a single matching
5767 deallocation function, that function will be called; otherwise, no
5768 deallocation function will be called." */
5769 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
5770 t
; t
= OVL_NEXT (t
))
5772 tree elt
= OVL_CURRENT (t
);
5773 if (non_placement_deallocation_fn_p (elt
))
5776 /* "If a class T has a member deallocation function named
5777 operator delete with exactly one parameter, then that
5778 function is a usual (non-placement) deallocation
5779 function. If class T does not declare such an operator
5780 delete but does declare a member deallocation function named
5781 operator delete with exactly two parameters, the second of
5782 which has type std::size_t (18.2), then this function is a
5783 usual deallocation function."
5785 So (void*) beats (void*, size_t). */
5786 if (FUNCTION_ARG_CHAIN (fn
) == void_list_node
)
5791 /* If we have a matching function, call it. */
5794 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
5796 /* If the FN is a member function, make sure that it is
5798 if (BASELINK_P (fns
))
5799 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
5802 /* Core issue 901: It's ok to new a type with deleted delete. */
5803 if (DECL_DELETED_FN (fn
) && alloc_fn
)
5808 /* The placement args might not be suitable for overload
5809 resolution at this point, so build the call directly. */
5810 int nargs
= call_expr_nargs (placement
);
5811 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
5814 for (i
= 1; i
< nargs
; i
++)
5815 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
5817 return build_cxx_call (fn
, nargs
, argarray
, complain
);
5822 vec
<tree
, va_gc
> *args
= make_tree_vector ();
5823 args
->quick_push (addr
);
5824 if (FUNCTION_ARG_CHAIN (fn
) != void_list_node
)
5825 args
->quick_push (size
);
5826 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
5827 release_tree_vector (args
);
5834 If no unambiguous matching deallocation function can be found,
5835 propagating the exception does not cause the object's memory to
5839 if ((complain
& tf_warning
)
5841 warning (0, "no corresponding deallocation function for %qD",
5846 if (complain
& tf_error
)
5847 error ("no suitable %<operator %s%> for %qT",
5848 operator_name_info
[(int)code
].name
, type
);
5849 return error_mark_node
;
5852 /* If the current scope isn't allowed to access DECL along
5853 BASETYPE_PATH, give an error. The most derived class in
5854 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
5855 the declaration to use in the error diagnostic. */
5858 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
5859 tsubst_flags_t complain
)
5861 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
5863 if (!accessible_p (basetype_path
, decl
, true))
5865 if (complain
& tf_error
)
5867 if (TREE_PRIVATE (decl
))
5868 error ("%q+#D is private", diag_decl
);
5869 else if (TREE_PROTECTED (decl
))
5870 error ("%q+#D is protected", diag_decl
);
5872 error ("%q+#D is inaccessible", diag_decl
);
5873 error ("within this context");
5881 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
5882 bitwise or of LOOKUP_* values. If any errors are warnings are
5883 generated, set *DIAGNOSTIC_FN to "error" or "warning",
5884 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
5888 build_temp (tree expr
, tree type
, int flags
,
5889 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
5892 vec
<tree
, va_gc
> *args
;
5894 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
5895 args
= make_tree_vector_single (expr
);
5896 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
5897 &args
, type
, flags
, complain
);
5898 release_tree_vector (args
);
5899 if (warningcount
+ werrorcount
> savew
)
5900 *diagnostic_kind
= DK_WARNING
;
5901 else if (errorcount
> savee
)
5902 *diagnostic_kind
= DK_ERROR
;
5904 *diagnostic_kind
= DK_UNSPECIFIED
;
5908 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
5909 EXPR is implicitly converted to type TOTYPE.
5910 FN and ARGNUM are used for diagnostics. */
5913 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
5915 /* Issue warnings about peculiar, but valid, uses of NULL. */
5916 if (expr
== null_node
&& TREE_CODE (totype
) != BOOLEAN_TYPE
5917 && ARITHMETIC_TYPE_P (totype
))
5919 source_location loc
=
5920 expansion_point_location_if_in_system_header (input_location
);
5923 warning_at (loc
, OPT_Wconversion_null
,
5924 "passing NULL to non-pointer argument %P of %qD",
5927 warning_at (loc
, OPT_Wconversion_null
,
5928 "converting to non-pointer type %qT from NULL", totype
);
5931 /* Issue warnings if "false" is converted to a NULL pointer */
5932 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
5933 && TYPE_PTR_P (totype
))
5936 warning_at (input_location
, OPT_Wconversion_null
,
5937 "converting %<false%> to pointer type for argument %P "
5938 "of %qD", argnum
, fn
);
5940 warning_at (input_location
, OPT_Wconversion_null
,
5941 "converting %<false%> to pointer type %qT", totype
);
5945 /* Perform the conversions in CONVS on the expression EXPR. FN and
5946 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
5947 indicates the `this' argument of a method. INNER is nonzero when
5948 being called to continue a conversion chain. It is negative when a
5949 reference binding will be applied, positive otherwise. If
5950 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
5951 conversions will be emitted if appropriate. If C_CAST_P is true,
5952 this conversion is coming from a C-style cast; in that case,
5953 conversions to inaccessible bases are permitted. */
5956 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
5957 int inner
, bool issue_conversion_warnings
,
5958 bool c_cast_p
, tsubst_flags_t complain
)
5960 tree totype
= convs
->type
;
5961 diagnostic_t diag_kind
;
5963 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
5965 if (convs
->bad_p
&& !(complain
& tf_error
))
5966 return error_mark_node
;
5969 && convs
->kind
!= ck_user
5970 && convs
->kind
!= ck_list
5971 && convs
->kind
!= ck_ambig
5972 && (convs
->kind
!= ck_ref_bind
5973 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
5974 && (convs
->kind
!= ck_rvalue
5975 || SCALAR_TYPE_P (totype
))
5976 && convs
->kind
!= ck_base
)
5978 bool complained
= false;
5979 conversion
*t
= convs
;
5981 /* Give a helpful error if this is bad because of excess braces. */
5982 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
5983 && SCALAR_TYPE_P (totype
)
5984 && CONSTRUCTOR_NELTS (expr
) > 0
5985 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
5987 complained
= permerror (loc
, "too many braces around initializer "
5989 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
5990 && CONSTRUCTOR_NELTS (expr
) == 1)
5991 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
5994 for (; t
; t
= next_conversion (t
))
5996 if (t
->kind
== ck_user
&& t
->cand
->reason
)
5998 permerror (loc
, "invalid user-defined conversion "
5999 "from %qT to %qT", TREE_TYPE (expr
), totype
);
6000 print_z_candidate (loc
, "candidate is:", t
->cand
);
6001 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
6002 /*issue_conversion_warnings=*/false,
6005 if (convs
->kind
== ck_ref_bind
)
6006 return convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
6007 LOOKUP_NORMAL
, NULL_TREE
,
6010 return cp_convert (totype
, expr
, complain
);
6012 else if (t
->kind
== ck_user
|| !t
->bad_p
)
6014 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
6015 /*issue_conversion_warnings=*/false,
6020 else if (t
->kind
== ck_ambig
)
6021 return convert_like_real (t
, expr
, fn
, argnum
, 1,
6022 /*issue_conversion_warnings=*/false,
6025 else if (t
->kind
== ck_identity
)
6029 complained
= permerror (loc
, "invalid conversion from %qT to %qT",
6030 TREE_TYPE (expr
), totype
);
6031 if (complained
&& fn
)
6032 inform (DECL_SOURCE_LOCATION (fn
),
6033 "initializing argument %P of %qD", argnum
, fn
);
6035 return cp_convert (totype
, expr
, complain
);
6038 if (issue_conversion_warnings
&& (complain
& tf_warning
))
6039 conversion_null_warnings (totype
, expr
, fn
, argnum
);
6041 switch (convs
->kind
)
6045 struct z_candidate
*cand
= convs
->cand
;
6046 tree convfn
= cand
->fn
;
6049 /* When converting from an init list we consider explicit
6050 constructors, but actually trying to call one is an error. */
6051 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
6052 /* Unless this is for direct-list-initialization. */
6053 && !(BRACE_ENCLOSED_INITIALIZER_P (expr
)
6054 && CONSTRUCTOR_IS_DIRECT_INIT (expr
)))
6056 if (!(complain
& tf_error
))
6057 return error_mark_node
;
6058 error ("converting to %qT from initializer list would use "
6059 "explicit constructor %qD", totype
, convfn
);
6062 /* If we're initializing from {}, it's value-initialization. */
6063 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6064 && CONSTRUCTOR_NELTS (expr
) == 0
6065 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
6067 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
6068 expr
= build_value_init (totype
, complain
);
6069 expr
= get_target_expr_sfinae (expr
, complain
);
6070 if (expr
!= error_mark_node
)
6072 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6073 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
6078 expr
= mark_rvalue_use (expr
);
6080 /* Set user_conv_p on the argument conversions, so rvalue/base
6081 handling knows not to allow any more UDCs. */
6082 for (i
= 0; i
< cand
->num_convs
; ++i
)
6083 cand
->convs
[i
]->user_conv_p
= true;
6085 expr
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
6087 /* If this is a constructor or a function returning an aggr type,
6088 we need to build up a TARGET_EXPR. */
6089 if (DECL_CONSTRUCTOR_P (convfn
))
6091 expr
= build_cplus_new (totype
, expr
, complain
);
6093 /* Remember that this was list-initialization. */
6094 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
6095 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6101 expr
= mark_rvalue_use (expr
);
6102 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
6104 int nelts
= CONSTRUCTOR_NELTS (expr
);
6106 expr
= build_value_init (totype
, complain
);
6107 else if (nelts
== 1)
6108 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6113 if (type_unknown_p (expr
))
6114 expr
= instantiate_type (totype
, expr
, complain
);
6115 /* Convert a constant to its underlying value, unless we are
6116 about to bind it to a reference, in which case we need to
6117 leave it as an lvalue. */
6120 expr
= decl_constant_value_safe (expr
);
6121 if (expr
== null_node
&& INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
6122 /* If __null has been converted to an integer type, we do not
6123 want to warn about uses of EXPR as an integer, rather than
6125 expr
= build_int_cst (totype
, 0);
6129 /* We leave bad_p off ck_ambig because overload resolution considers
6130 it valid, it just fails when we try to perform it. So we need to
6131 check complain here, too. */
6132 if (complain
& tf_error
)
6134 /* Call build_user_type_conversion again for the error. */
6135 build_user_type_conversion (totype
, convs
->u
.expr
, LOOKUP_NORMAL
,
6138 inform (input_location
, "initializing argument %P of %q+D",
6141 return error_mark_node
;
6145 /* Conversion to std::initializer_list<T>. */
6146 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
6147 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
6148 unsigned len
= CONSTRUCTOR_NELTS (expr
);
6149 tree array
, val
, field
;
6150 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
6153 /* Convert all the elements. */
6154 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
6156 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
6157 1, false, false, complain
);
6158 if (sub
== error_mark_node
)
6160 if (!BRACE_ENCLOSED_INITIALIZER_P (val
))
6161 check_narrowing (TREE_TYPE (sub
), val
);
6162 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
6163 if (!TREE_CONSTANT (sub
))
6164 TREE_CONSTANT (new_ctor
) = false;
6166 /* Build up the array. */
6167 elttype
= cp_build_qualified_type
6168 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
6169 array
= build_array_of_n_type (elttype
, len
);
6170 array
= finish_compound_literal (array
, new_ctor
, complain
);
6171 /* Take the address explicitly rather than via decay_conversion
6172 to avoid the error about taking the address of a temporary. */
6173 array
= cp_build_addr_expr (array
, complain
);
6174 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
6175 if (array
== error_mark_node
)
6176 return error_mark_node
;
6178 /* Build up the initializer_list object. */
6179 totype
= complete_type (totype
);
6180 field
= next_initializable_field (TYPE_FIELDS (totype
));
6181 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
6182 field
= next_initializable_field (DECL_CHAIN (field
));
6183 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
6184 new_ctor
= build_constructor (totype
, vec
);
6185 return get_target_expr_sfinae (new_ctor
, complain
);
6189 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
6191 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6192 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
6193 real
= perform_implicit_conversion (TREE_TYPE (totype
),
6195 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
6197 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
6198 return fold_if_not_in_template (expr
);
6200 expr
= reshape_init (totype
, expr
, complain
);
6201 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
6203 if (expr
!= error_mark_node
)
6204 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6211 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
6212 convs
->kind
== ck_ref_bind
? -1 : 1,
6213 convs
->kind
== ck_ref_bind
? issue_conversion_warnings
: false,
6216 if (expr
== error_mark_node
)
6217 return error_mark_node
;
6219 switch (convs
->kind
)
6222 expr
= decay_conversion (expr
, complain
);
6223 if (expr
== error_mark_node
)
6224 return error_mark_node
;
6226 if (! MAYBE_CLASS_TYPE_P (totype
))
6228 /* Else fall through. */
6230 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
6232 /* We are going to bind a reference directly to a base-class
6233 subobject of EXPR. */
6234 /* Build an expression for `*((base*) &expr)'. */
6235 expr
= cp_build_addr_expr (expr
, complain
);
6236 expr
= convert_to_base (expr
, build_pointer_type (totype
),
6237 !c_cast_p
, /*nonnull=*/true, complain
);
6238 expr
= cp_build_indirect_ref (expr
, RO_IMPLICIT_CONVERSION
, complain
);
6242 /* Copy-initialization where the cv-unqualified version of the source
6243 type is the same class as, or a derived class of, the class of the
6244 destination [is treated as direct-initialization]. [dcl.init] */
6245 flags
= LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
;
6246 if (convs
->user_conv_p
)
6247 /* This conversion is being done in the context of a user-defined
6248 conversion (i.e. the second step of copy-initialization), so
6249 don't allow any more. */
6250 flags
|= LOOKUP_NO_CONVERSION
;
6251 if (convs
->rvaluedness_matches_p
)
6252 flags
|= LOOKUP_PREFER_RVALUE
;
6253 if (TREE_CODE (expr
) == TARGET_EXPR
6254 && TARGET_EXPR_LIST_INIT_P (expr
))
6255 /* Copy-list-initialization doesn't actually involve a copy. */
6257 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
6258 if (diag_kind
&& fn
&& complain
)
6259 emit_diagnostic (diag_kind
, DECL_SOURCE_LOCATION (fn
), 0,
6260 " initializing argument %P of %qD", argnum
, fn
);
6261 return build_cplus_new (totype
, expr
, complain
);
6265 tree ref_type
= totype
;
6267 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
6269 gcc_assert (TYPE_REF_IS_RVALUE (ref_type
)
6270 && (real_lvalue_p (expr
)
6271 || next_conversion(convs
)->kind
== ck_rvalue
));
6273 error_at (loc
, "cannot bind %qT lvalue to %qT",
6274 TREE_TYPE (expr
), totype
);
6276 inform (input_location
,
6277 "initializing argument %P of %q+D", argnum
, fn
);
6278 return error_mark_node
;
6281 /* If necessary, create a temporary.
6283 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
6284 that need temporaries, even when their types are reference
6285 compatible with the type of reference being bound, so the
6286 upcoming call to cp_build_addr_expr doesn't fail. */
6287 if (convs
->need_temporary_p
6288 || TREE_CODE (expr
) == CONSTRUCTOR
6289 || TREE_CODE (expr
) == VA_ARG_EXPR
)
6291 /* Otherwise, a temporary of type "cv1 T1" is created and
6292 initialized from the initializer expression using the rules
6293 for a non-reference copy-initialization (8.5). */
6295 tree type
= TREE_TYPE (ref_type
);
6296 cp_lvalue_kind lvalue
= real_lvalue_p (expr
);
6298 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6299 (type
, next_conversion (convs
)->type
));
6300 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
6301 && !TYPE_REF_IS_RVALUE (ref_type
))
6303 /* If the reference is volatile or non-const, we
6304 cannot create a temporary. */
6305 if (lvalue
& clk_bitfield
)
6306 error_at (loc
, "cannot bind bitfield %qE to %qT",
6308 else if (lvalue
& clk_packed
)
6309 error_at (loc
, "cannot bind packed field %qE to %qT",
6312 error_at (loc
, "cannot bind rvalue %qE to %qT",
6314 return error_mark_node
;
6316 /* If the source is a packed field, and we must use a copy
6317 constructor, then building the target expr will require
6318 binding the field to the reference parameter to the
6319 copy constructor, and we'll end up with an infinite
6320 loop. If we can use a bitwise copy, then we'll be
6322 if ((lvalue
& clk_packed
)
6323 && CLASS_TYPE_P (type
)
6324 && type_has_nontrivial_copy_init (type
))
6326 error_at (loc
, "cannot bind packed field %qE to %qT",
6328 return error_mark_node
;
6330 if (lvalue
& clk_bitfield
)
6332 expr
= convert_bitfield_to_declared_type (expr
);
6333 expr
= fold_convert (type
, expr
);
6335 expr
= build_target_expr_with_type (expr
, type
, complain
);
6338 /* Take the address of the thing to which we will bind the
6340 expr
= cp_build_addr_expr (expr
, complain
);
6341 if (expr
== error_mark_node
)
6342 return error_mark_node
;
6344 /* Convert it to a pointer to the type referred to by the
6345 reference. This will adjust the pointer if a derived to
6346 base conversion is being performed. */
6347 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
6349 /* Convert the pointer to the desired reference type. */
6350 return build_nop (ref_type
, expr
);
6354 return decay_conversion (expr
, complain
);
6357 /* Warn about deprecated conversion if appropriate. */
6358 string_conv_p (totype
, expr
, 1);
6363 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
6364 /*nonnull=*/false, complain
);
6365 return build_nop (totype
, expr
);
6368 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
6369 c_cast_p
, complain
);
6375 if (convs
->check_narrowing
)
6376 check_narrowing (totype
, expr
);
6378 if (issue_conversion_warnings
)
6379 expr
= cp_convert_and_check (totype
, expr
, complain
);
6381 expr
= cp_convert (totype
, expr
, complain
);
6386 /* ARG is being passed to a varargs function. Perform any conversions
6387 required. Return the converted value. */
6390 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
6393 location_t loc
= EXPR_LOC_OR_LOC (arg
, input_location
);
6397 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6398 standard conversions are performed. */
6399 arg
= decay_conversion (arg
, complain
);
6400 arg_type
= TREE_TYPE (arg
);
6403 If the argument has integral or enumeration type that is subject
6404 to the integral promotions (_conv.prom_), or a floating point
6405 type that is subject to the floating point promotion
6406 (_conv.fpprom_), the value of the argument is converted to the
6407 promoted type before the call. */
6408 if (TREE_CODE (arg_type
) == REAL_TYPE
6409 && (TYPE_PRECISION (arg_type
)
6410 < TYPE_PRECISION (double_type_node
))
6411 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
6413 if ((complain
& tf_warning
)
6414 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
6415 warning_at (loc
, OPT_Wdouble_promotion
,
6416 "implicit conversion from %qT to %qT when passing "
6417 "argument to function",
6418 arg_type
, double_type_node
);
6419 arg
= convert_to_real (double_type_node
, arg
);
6421 else if (NULLPTR_TYPE_P (arg_type
))
6422 arg
= null_pointer_node
;
6423 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
6425 if (SCOPED_ENUM_P (arg_type
) && !abi_version_at_least (6))
6427 if (complain
& tf_warning
)
6428 warning_at (loc
, OPT_Wabi
, "scoped enum %qT will not promote to an "
6429 "integral type in a future version of GCC", arg_type
);
6430 arg
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
, complain
);
6432 arg
= cp_perform_integral_promotions (arg
, complain
);
6435 arg
= require_complete_type_sfinae (arg
, complain
);
6436 arg_type
= TREE_TYPE (arg
);
6438 if (arg
!= error_mark_node
6439 /* In a template (or ill-formed code), we can have an incomplete type
6440 even after require_complete_type_sfinae, in which case we don't know
6441 whether it has trivial copy or not. */
6442 && COMPLETE_TYPE_P (arg_type
))
6444 /* Build up a real lvalue-to-rvalue conversion in case the
6445 copy constructor is trivial but not callable. */
6446 if (!cp_unevaluated_operand
&& CLASS_TYPE_P (arg_type
))
6447 force_rvalue (arg
, complain
);
6449 /* [expr.call] 5.2.2/7:
6450 Passing a potentially-evaluated argument of class type (Clause 9)
6451 with a non-trivial copy constructor or a non-trivial destructor
6452 with no corresponding parameter is conditionally-supported, with
6453 implementation-defined semantics.
6455 We used to just warn here and do a bitwise copy, but now
6456 cp_expr_size will abort if we try to do that.
6458 If the call appears in the context of a sizeof expression,
6459 it is not potentially-evaluated. */
6460 if (cp_unevaluated_operand
== 0
6461 && (type_has_nontrivial_copy_init (arg_type
)
6462 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
)))
6464 if (complain
& tf_error
)
6465 error_at (loc
, "cannot pass objects of non-trivially-copyable "
6466 "type %q#T through %<...%>", arg_type
);
6467 return error_mark_node
;
6474 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
6477 build_x_va_arg (source_location loc
, tree expr
, tree type
)
6479 if (processing_template_decl
)
6480 return build_min (VA_ARG_EXPR
, type
, expr
);
6482 type
= complete_type_or_else (type
, NULL_TREE
);
6484 if (expr
== error_mark_node
|| !type
)
6485 return error_mark_node
;
6487 expr
= mark_lvalue_use (expr
);
6489 if (type_has_nontrivial_copy_init (type
)
6490 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
6491 || TREE_CODE (type
) == REFERENCE_TYPE
)
6493 /* Remove reference types so we don't ICE later on. */
6494 tree type1
= non_reference (type
);
6495 /* conditionally-supported behavior [expr.call] 5.2.2/7. */
6496 error ("cannot receive objects of non-trivially-copyable type %q#T "
6497 "through %<...%>; ", type
);
6498 expr
= convert (build_pointer_type (type1
), null_node
);
6499 expr
= cp_build_indirect_ref (expr
, RO_NULL
, tf_warning_or_error
);
6503 return build_va_arg (loc
, expr
, type
);
6506 /* TYPE has been given to va_arg. Apply the default conversions which
6507 would have happened when passed via ellipsis. Return the promoted
6508 type, or the passed type if there is no change. */
6511 cxx_type_promotes_to (tree type
)
6515 /* Perform the array-to-pointer and function-to-pointer
6517 type
= type_decays_to (type
);
6519 promote
= type_promotes_to (type
);
6520 if (same_type_p (type
, promote
))
6526 /* ARG is a default argument expression being passed to a parameter of
6527 the indicated TYPE, which is a parameter to FN. PARMNUM is the
6528 zero-based argument number. Do any required conversions. Return
6529 the converted value. */
6531 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
6533 push_defarg_context (tree fn
)
6534 { vec_safe_push (default_arg_context
, fn
); }
6537 pop_defarg_context (void)
6538 { default_arg_context
->pop (); }
6541 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
6542 tsubst_flags_t complain
)
6547 /* See through clones. */
6548 fn
= DECL_ORIGIN (fn
);
6550 /* Detect recursion. */
6551 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
6554 if (complain
& tf_error
)
6555 error ("recursive evaluation of default argument for %q#D", fn
);
6556 return error_mark_node
;
6559 /* If the ARG is an unparsed default argument expression, the
6560 conversion cannot be performed. */
6561 if (TREE_CODE (arg
) == DEFAULT_ARG
)
6563 if (complain
& tf_error
)
6564 error ("call to %qD uses the default argument for parameter %P, which "
6565 "is not yet defined", fn
, parmnum
);
6566 return error_mark_node
;
6569 push_defarg_context (fn
);
6571 if (fn
&& DECL_TEMPLATE_INFO (fn
))
6572 arg
= tsubst_default_argument (fn
, type
, arg
, complain
);
6578 The names in the expression are bound, and the semantic
6579 constraints are checked, at the point where the default
6580 expressions appears.
6582 we must not perform access checks here. */
6583 push_deferring_access_checks (dk_no_check
);
6584 /* We must make a copy of ARG, in case subsequent processing
6585 alters any part of it. */
6586 arg
= break_out_target_exprs (arg
);
6587 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
6588 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
6590 arg
= convert_for_arg_passing (type
, arg
, complain
);
6591 pop_deferring_access_checks();
6593 pop_defarg_context ();
6598 /* Returns the type which will really be used for passing an argument of
6602 type_passed_as (tree type
)
6604 /* Pass classes with copy ctors by invisible reference. */
6605 if (TREE_ADDRESSABLE (type
))
6607 type
= build_reference_type (type
);
6608 /* There are no other pointers to this temporary. */
6609 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
6611 else if (targetm
.calls
.promote_prototypes (type
)
6612 && INTEGRAL_TYPE_P (type
)
6613 && COMPLETE_TYPE_P (type
)
6614 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
6615 type
= integer_type_node
;
6620 /* Actually perform the appropriate conversion. */
6623 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
6627 /* If VAL is a bitfield, then -- since it has already been converted
6628 to TYPE -- it cannot have a precision greater than TYPE.
6630 If it has a smaller precision, we must widen it here. For
6631 example, passing "int f:3;" to a function expecting an "int" will
6632 not result in any conversion before this point.
6634 If the precision is the same we must not risk widening. For
6635 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
6636 often have type "int", even though the C++ type for the field is
6637 "long long". If the value is being passed to a function
6638 expecting an "int", then no conversions will be required. But,
6639 if we call convert_bitfield_to_declared_type, the bitfield will
6640 be converted to "long long". */
6641 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
6643 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
6644 val
= convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type
), val
);
6646 if (val
== error_mark_node
)
6648 /* Pass classes with copy ctors by invisible reference. */
6649 else if (TREE_ADDRESSABLE (type
))
6650 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
6651 else if (targetm
.calls
.promote_prototypes (type
)
6652 && INTEGRAL_TYPE_P (type
)
6653 && COMPLETE_TYPE_P (type
)
6654 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
6655 val
= cp_perform_integral_promotions (val
, complain
);
6656 if ((complain
& tf_warning
)
6657 && warn_suggest_attribute_format
)
6659 tree rhstype
= TREE_TYPE (val
);
6660 const enum tree_code coder
= TREE_CODE (rhstype
);
6661 const enum tree_code codel
= TREE_CODE (type
);
6662 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
6664 && check_missing_format_attribute (type
, rhstype
))
6665 warning (OPT_Wsuggest_attribute_format
,
6666 "argument of function call might be a candidate for a format attribute");
6671 /* Returns true iff FN is a function with magic varargs, i.e. ones for
6672 which no conversions at all should be done. This is true for some
6673 builtins which don't act like normal functions. */
6676 magic_varargs_p (tree fn
)
6678 if (flag_cilkplus
&& is_cilkplus_reduce_builtin (fn
) != BUILT_IN_NONE
)
6681 if (DECL_BUILT_IN (fn
))
6682 switch (DECL_FUNCTION_CODE (fn
))
6684 case BUILT_IN_CLASSIFY_TYPE
:
6685 case BUILT_IN_CONSTANT_P
:
6686 case BUILT_IN_NEXT_ARG
:
6687 case BUILT_IN_VA_START
:
6691 return lookup_attribute ("type generic",
6692 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
6698 /* Returns the decl of the dispatcher function if FN is a function version. */
6701 get_function_version_dispatcher (tree fn
)
6703 tree dispatcher_decl
= NULL
;
6705 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
6706 && DECL_FUNCTION_VERSIONED (fn
));
6708 gcc_assert (targetm
.get_function_versions_dispatcher
);
6709 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
6711 if (dispatcher_decl
== NULL
)
6713 error_at (input_location
, "use of multiversioned function "
6714 "without a default");
6718 retrofit_lang_decl (dispatcher_decl
);
6719 gcc_assert (dispatcher_decl
!= NULL
);
6720 return dispatcher_decl
;
6723 /* fn is a function version dispatcher that is marked used. Mark all the
6724 semantically identical function versions it will dispatch as used. */
6727 mark_versions_used (tree fn
)
6729 struct cgraph_node
*node
;
6730 struct cgraph_function_version_info
*node_v
;
6731 struct cgraph_function_version_info
*it_v
;
6733 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6735 node
= cgraph_get_node (fn
);
6739 gcc_assert (node
->dispatcher_function
);
6741 node_v
= get_cgraph_node_version (node
);
6745 /* All semantically identical versions are chained. Traverse and mark each
6746 one of them as used. */
6747 it_v
= node_v
->next
;
6748 while (it_v
!= NULL
)
6750 mark_used (it_v
->this_node
->decl
);
6755 /* Subroutine of the various build_*_call functions. Overload resolution
6756 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
6757 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
6758 bitmask of various LOOKUP_* flags which apply to the call itself. */
6761 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
6764 const vec
<tree
, va_gc
> *args
= cand
->args
;
6765 tree first_arg
= cand
->first_arg
;
6766 conversion
**convs
= cand
->convs
;
6768 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
6773 unsigned int arg_index
= 0;
6777 bool already_used
= false;
6779 /* In a template, there is no need to perform all of the work that
6780 is normally done. We are only interested in the type of the call
6781 expression, i.e., the return type of the function. Any semantic
6782 errors will be deferred until the template is instantiated. */
6783 if (processing_template_decl
)
6787 const tree
*argarray
;
6790 return_type
= TREE_TYPE (TREE_TYPE (fn
));
6791 nargs
= vec_safe_length (args
);
6792 if (first_arg
== NULL_TREE
)
6793 argarray
= args
->address ();
6801 alcarray
= XALLOCAVEC (tree
, nargs
);
6802 alcarray
[0] = first_arg
;
6803 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
6804 alcarray
[ix
+ 1] = arg
;
6805 argarray
= alcarray
;
6808 addr
= build_addr_func (fn
, complain
);
6809 if (addr
== error_mark_node
)
6810 return error_mark_node
;
6811 expr
= build_call_array_loc (input_location
, return_type
,
6812 addr
, nargs
, argarray
);
6813 if (TREE_THIS_VOLATILE (fn
) && cfun
)
6814 current_function_returns_abnormally
= 1;
6815 return convert_from_reference (expr
);
6818 /* Give any warnings we noticed during overload resolution. */
6819 if (cand
->warnings
&& (complain
& tf_warning
))
6821 struct candidate_warning
*w
;
6822 for (w
= cand
->warnings
; w
; w
= w
->next
)
6823 joust (cand
, w
->loser
, 1, complain
);
6826 /* Make =delete work with SFINAE. */
6827 if (DECL_DELETED_FN (fn
) && !(complain
& tf_error
))
6828 return error_mark_node
;
6830 if (DECL_FUNCTION_MEMBER_P (fn
))
6833 /* If FN is a template function, two cases must be considered.
6838 template <class T> void f();
6840 template <class T> struct B {
6844 struct C : A, B<int> {
6846 using B<int>::g; // #2
6849 In case #1 where `A::f' is a member template, DECL_ACCESS is
6850 recorded in the primary template but not in its specialization.
6851 We check access of FN using its primary template.
6853 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
6854 because it is a member of class template B, DECL_ACCESS is
6855 recorded in the specialization `B<int>::g'. We cannot use its
6856 primary template because `B<T>::g' and `B<int>::g' may have
6857 different access. */
6858 if (DECL_TEMPLATE_INFO (fn
)
6859 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
6860 access_fn
= DECL_TI_TEMPLATE (fn
);
6863 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
6865 return error_mark_node
;
6868 /* If we're checking for implicit delete, don't bother with argument
6870 if (flags
& LOOKUP_SPECULATIVE
)
6872 if (DECL_DELETED_FN (fn
))
6874 if (complain
& tf_error
)
6876 return error_mark_node
;
6878 if (cand
->viable
== 1)
6880 else if (!(complain
& tf_error
))
6881 /* Reject bad conversions now. */
6882 return error_mark_node
;
6883 /* else continue to get conversion error. */
6886 /* N3276 magic doesn't apply to nested calls. */
6887 int decltype_flag
= (complain
& tf_decltype
);
6888 complain
&= ~tf_decltype
;
6890 /* Find maximum size of vector to hold converted arguments. */
6891 parmlen
= list_length (parm
);
6892 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
6893 if (parmlen
> nargs
)
6895 argarray
= XALLOCAVEC (tree
, nargs
);
6897 /* The implicit parameters to a constructor are not considered by overload
6898 resolution, and must be of the proper type. */
6899 if (DECL_CONSTRUCTOR_P (fn
))
6902 if (first_arg
!= NULL_TREE
)
6904 object_arg
= first_arg
;
6905 first_arg
= NULL_TREE
;
6909 object_arg
= (*args
)[arg_index
];
6912 argarray
[j
++] = build_this (object_arg
);
6913 parm
= TREE_CHAIN (parm
);
6914 /* We should never try to call the abstract constructor. */
6915 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
6917 if (DECL_HAS_VTT_PARM_P (fn
))
6919 argarray
[j
++] = (*args
)[arg_index
];
6921 parm
= TREE_CHAIN (parm
);
6924 /* Bypass access control for 'this' parameter. */
6925 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
6927 tree parmtype
= TREE_VALUE (parm
);
6928 tree arg
= build_this (first_arg
!= NULL_TREE
6930 : (*args
)[arg_index
]);
6931 tree argtype
= TREE_TYPE (arg
);
6935 if (convs
[i
]->bad_p
)
6937 if (complain
& tf_error
)
6938 permerror (input_location
, "passing %qT as %<this%> argument of %q#D discards qualifiers",
6939 TREE_TYPE (argtype
), fn
);
6941 return error_mark_node
;
6944 /* See if the function member or the whole class type is declared
6945 final and the call can be devirtualized. */
6946 if (DECL_FINAL_P (fn
)
6947 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
6948 flags
|= LOOKUP_NONVIRTUAL
;
6950 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
6951 X is called for an object that is not of type X, or of a type
6952 derived from X, the behavior is undefined.
6954 So we can assume that anything passed as 'this' is non-null, and
6955 optimize accordingly. */
6956 gcc_assert (TYPE_PTR_P (parmtype
));
6957 /* Convert to the base in which the function was declared. */
6958 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
6959 converted_arg
= build_base_path (PLUS_EXPR
,
6961 cand
->conversion_path
,
6963 /* Check that the base class is accessible. */
6964 if (!accessible_base_p (TREE_TYPE (argtype
),
6965 BINFO_TYPE (cand
->conversion_path
), true))
6967 if (complain
& tf_error
)
6968 error ("%qT is not an accessible base of %qT",
6969 BINFO_TYPE (cand
->conversion_path
),
6970 TREE_TYPE (argtype
));
6972 return error_mark_node
;
6974 /* If fn was found by a using declaration, the conversion path
6975 will be to the derived class, not the base declaring fn. We
6976 must convert from derived to base. */
6977 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
6978 TREE_TYPE (parmtype
), ba_unique
,
6980 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
6981 base_binfo
, 1, complain
);
6983 argarray
[j
++] = converted_arg
;
6984 parm
= TREE_CHAIN (parm
);
6985 if (first_arg
!= NULL_TREE
)
6986 first_arg
= NULL_TREE
;
6993 gcc_assert (first_arg
== NULL_TREE
);
6994 for (; arg_index
< vec_safe_length (args
) && parm
;
6995 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
6997 tree type
= TREE_VALUE (parm
);
6998 tree arg
= (*args
)[arg_index
];
6999 bool conversion_warning
= true;
7003 /* If the argument is NULL and used to (implicitly) instantiate a
7004 template function (and bind one of the template arguments to
7005 the type of 'long int'), we don't want to warn about passing NULL
7006 to non-pointer argument.
7007 For example, if we have this template function:
7009 template<typename T> void func(T x) {}
7011 we want to warn (when -Wconversion is enabled) in this case:
7017 but not in this case:
7023 if (arg
== null_node
7024 && DECL_TEMPLATE_INFO (fn
)
7025 && cand
->template_decl
7026 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
7027 conversion_warning
= false;
7029 /* Warn about initializer_list deduction that isn't currently in the
7031 if (cxx_dialect
> cxx98
7032 && flag_deduce_init_list
7033 && cand
->template_decl
7034 && is_std_init_list (non_reference (type
))
7035 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
7037 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
7038 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
7039 tree patparm
= get_pattern_parm (realparm
, tmpl
);
7040 tree pattype
= TREE_TYPE (patparm
);
7041 if (PACK_EXPANSION_P (pattype
))
7042 pattype
= PACK_EXPANSION_PATTERN (pattype
);
7043 pattype
= non_reference (pattype
);
7045 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
7046 && (cand
->explicit_targs
== NULL_TREE
7047 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
7048 <= TEMPLATE_TYPE_IDX (pattype
))))
7050 pedwarn (input_location
, 0, "deducing %qT as %qT",
7051 non_reference (TREE_TYPE (patparm
)),
7052 non_reference (type
));
7053 pedwarn (input_location
, 0, " in call to %q+D", cand
->fn
);
7054 pedwarn (input_location
, 0,
7055 " (you can disable this with -fno-deduce-init-list)");
7058 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
7061 : complain
& (~tf_warning
));
7063 val
= convert_for_arg_passing (type
, val
, complain
);
7065 if (val
== error_mark_node
)
7066 return error_mark_node
;
7068 argarray
[j
++] = val
;
7071 /* Default arguments */
7072 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
7074 if (TREE_VALUE (parm
) == error_mark_node
)
7075 return error_mark_node
;
7076 argarray
[j
++] = convert_default_arg (TREE_VALUE (parm
),
7077 TREE_PURPOSE (parm
),
7083 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
7085 tree a
= (*args
)[arg_index
];
7086 if (magic_varargs_p (fn
))
7087 /* Do no conversions for magic varargs. */
7088 a
= mark_type_use (a
);
7090 a
= convert_arg_to_ellipsis (a
, complain
);
7094 gcc_assert (j
<= nargs
);
7097 check_function_arguments (TREE_TYPE (fn
), nargs
, argarray
);
7099 /* Avoid actually calling copy constructors and copy assignment operators,
7102 if (! flag_elide_constructors
)
7103 /* Do things the hard way. */;
7104 else if (cand
->num_convs
== 1
7105 && (DECL_COPY_CONSTRUCTOR_P (fn
)
7106 || DECL_MOVE_CONSTRUCTOR_P (fn
)))
7109 tree arg
= argarray
[num_artificial_parms_for (fn
)];
7111 bool trivial
= trivial_fn_p (fn
);
7113 /* Pull out the real argument, disregarding const-correctness. */
7115 while (CONVERT_EXPR_P (targ
)
7116 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
7117 targ
= TREE_OPERAND (targ
, 0);
7118 if (TREE_CODE (targ
) == ADDR_EXPR
)
7120 targ
= TREE_OPERAND (targ
, 0);
7121 if (!same_type_ignoring_top_level_qualifiers_p
7122 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
7131 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
7133 /* [class.copy]: the copy constructor is implicitly defined even if
7134 the implementation elided its use. */
7135 if (!trivial
|| DECL_DELETED_FN (fn
))
7138 already_used
= true;
7141 /* If we're creating a temp and we already have one, don't create a
7142 new one. If we're not creating a temp but we get one, use
7143 INIT_EXPR to collapse the temp into our target. Otherwise, if the
7144 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
7145 temp or an INIT_EXPR otherwise. */
7147 if (is_dummy_object (fa
))
7149 if (TREE_CODE (arg
) == TARGET_EXPR
)
7152 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
7154 else if (TREE_CODE (arg
) == TARGET_EXPR
|| trivial
)
7156 tree to
= stabilize_reference (cp_build_indirect_ref (fa
, RO_NULL
,
7159 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
7163 else if (DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
7164 && trivial_fn_p (fn
)
7165 && !DECL_DELETED_FN (fn
))
7167 tree to
= stabilize_reference
7168 (cp_build_indirect_ref (argarray
[0], RO_NULL
, complain
));
7169 tree type
= TREE_TYPE (to
);
7170 tree as_base
= CLASSTYPE_AS_BASE (type
);
7171 tree arg
= argarray
[1];
7173 if (is_really_empty_class (type
))
7175 /* Avoid copying empty classes. */
7176 val
= build2 (COMPOUND_EXPR
, void_type_node
, to
, arg
);
7177 TREE_NO_WARNING (val
) = 1;
7178 val
= build2 (COMPOUND_EXPR
, type
, val
, to
);
7179 TREE_NO_WARNING (val
) = 1;
7181 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
7183 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
7184 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
7188 /* We must only copy the non-tail padding parts. */
7190 tree array_type
, alias_set
;
7192 arg2
= TYPE_SIZE_UNIT (as_base
);
7193 arg0
= cp_build_addr_expr (to
, complain
);
7195 array_type
= build_array_type (char_type_node
,
7197 (size_binop (MINUS_EXPR
,
7198 arg2
, size_int (1))));
7199 alias_set
= build_int_cst (build_pointer_type (type
), 0);
7200 t
= build2 (MODIFY_EXPR
, void_type_node
,
7201 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
7202 build2 (MEM_REF
, array_type
, arg
, alias_set
));
7203 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
7204 TREE_NO_WARNING (val
) = 1;
7209 else if (DECL_DESTRUCTOR_P (fn
)
7210 && trivial_fn_p (fn
)
7211 && !DECL_DELETED_FN (fn
))
7212 return fold_convert (void_type_node
, argarray
[0]);
7213 /* FIXME handle trivial default constructor, too. */
7215 /* For calls to a multi-versioned function, overload resolution
7216 returns the function with the highest target priority, that is,
7217 the version that will checked for dispatching first. If this
7218 version is inlinable, a direct call to this version can be made
7219 otherwise the call should go through the dispatcher. */
7221 if (DECL_FUNCTION_VERSIONED (fn
)
7222 && (current_function_decl
== NULL
7223 || !targetm
.target_option
.can_inline_p (current_function_decl
, fn
)))
7225 fn
= get_function_version_dispatcher (fn
);
7229 mark_versions_used (fn
);
7234 return error_mark_node
;
7236 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0
7237 /* Don't mess with virtual lookup in fold_non_dependent_expr; virtual
7238 functions can't be constexpr. */
7239 && !in_template_function ())
7242 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
7244 ba_any
, NULL
, complain
);
7245 gcc_assert (binfo
&& binfo
!= error_mark_node
);
7247 /* Warn about deprecated virtual functions now, since we're about
7248 to throw away the decl. */
7249 if (TREE_DEPRECATED (fn
))
7250 warn_deprecated_use (fn
, NULL_TREE
);
7252 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
7254 if (TREE_SIDE_EFFECTS (argarray
[0]))
7255 argarray
[0] = save_expr (argarray
[0]);
7256 t
= build_pointer_type (TREE_TYPE (fn
));
7257 if (DECL_CONTEXT (fn
) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn
)))
7258 fn
= build_java_interface_fn_ref (fn
, argarray
[0]);
7260 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
7265 fn
= build_addr_func (fn
, complain
);
7266 if (fn
== error_mark_node
)
7267 return error_mark_node
;
7270 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
7271 if (TREE_CODE (call
) == CALL_EXPR
7272 && (cand
->flags
& LOOKUP_LIST_INIT_CTOR
))
7273 CALL_EXPR_LIST_INIT_P (call
) = true;
7277 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
7278 This function performs no overload resolution, conversion, or other
7279 high-level operations. */
7282 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
7283 tsubst_flags_t complain
)
7288 /* Remember roughly where this call is. */
7289 location_t loc
= EXPR_LOC_OR_LOC (fn
, input_location
);
7290 fn
= build_call_a (fn
, nargs
, argarray
);
7291 SET_EXPR_LOCATION (fn
, loc
);
7293 fndecl
= get_callee_fndecl (fn
);
7295 /* Check that arguments to builtin functions match the expectations. */
7297 && DECL_BUILT_IN (fndecl
)
7298 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
7299 && !check_builtin_function_arguments (fndecl
, nargs
, argarray
))
7300 return error_mark_node
;
7302 /* If it is a built-in array notation function, then the return type of
7303 the function is the element type of the array passed in as array
7304 notation (i.e. the first parameter of the function). */
7305 if (flag_cilkplus
&& TREE_CODE (fn
) == CALL_EXPR
)
7307 enum built_in_function bif
=
7308 is_cilkplus_reduce_builtin (CALL_EXPR_FN (fn
));
7309 if (bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_ADD
7310 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MUL
7311 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MAX
7312 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MIN
7313 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE
7314 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MUTATING
)
7316 /* for bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_ZERO or
7317 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_ZERO or
7318 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_NONZERO or
7319 BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_NONZERO or
7320 BUILT_IN_CILKPLUS_SEC_REDUCE_MIN_IND or
7321 BUILT_IN_CILKPLUS_SEC_REDUCE_MAX_IND
7322 The pre-defined return-type is the correct one. */
7323 tree array_ntn
= CALL_EXPR_ARG (fn
, 0);
7324 TREE_TYPE (fn
) = TREE_TYPE (array_ntn
);
7329 /* Some built-in function calls will be evaluated at compile-time in
7330 fold (). Set optimize to 1 when folding __builtin_constant_p inside
7331 a constexpr function so that fold_builtin_1 doesn't fold it to 0. */
7332 optimize_sav
= optimize
;
7333 if (!optimize
&& fndecl
&& DECL_IS_BUILTIN_CONSTANT_P (fndecl
)
7334 && current_function_decl
7335 && DECL_DECLARED_CONSTEXPR_P (current_function_decl
))
7337 fn
= fold_if_not_in_template (fn
);
7338 optimize
= optimize_sav
;
7340 if (VOID_TYPE_P (TREE_TYPE (fn
)))
7343 /* 5.2.2/11: If a function call is a prvalue of object type: if the
7344 function call is either the operand of a decltype-specifier or the
7345 right operand of a comma operator that is the operand of a
7346 decltype-specifier, a temporary object is not introduced for the
7347 prvalue. The type of the prvalue may be incomplete. */
7348 if (!(complain
& tf_decltype
))
7350 fn
= require_complete_type_sfinae (fn
, complain
);
7351 if (fn
== error_mark_node
)
7352 return error_mark_node
;
7354 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
7355 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
7357 return convert_from_reference (fn
);
7360 static GTY(()) tree java_iface_lookup_fn
;
7362 /* Make an expression which yields the address of the Java interface
7363 method FN. This is achieved by generating a call to libjava's
7364 _Jv_LookupInterfaceMethodIdx(). */
7367 build_java_interface_fn_ref (tree fn
, tree instance
)
7369 tree lookup_fn
, method
, idx
;
7370 tree klass_ref
, iface
, iface_ref
;
7373 if (!java_iface_lookup_fn
)
7375 tree ftype
= build_function_type_list (ptr_type_node
,
7376 ptr_type_node
, ptr_type_node
,
7377 java_int_type_node
, NULL_TREE
);
7378 java_iface_lookup_fn
7379 = add_builtin_function ("_Jv_LookupInterfaceMethodIdx", ftype
,
7380 0, NOT_BUILT_IN
, NULL
, NULL_TREE
);
7383 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
7384 This is the first entry in the vtable. */
7385 klass_ref
= build_vtbl_ref (cp_build_indirect_ref (instance
, RO_NULL
,
7386 tf_warning_or_error
),
7389 /* Get the java.lang.Class pointer for the interface being called. */
7390 iface
= DECL_CONTEXT (fn
);
7391 iface_ref
= lookup_field (iface
, get_identifier ("class$"), 0, false);
7392 if (!iface_ref
|| !VAR_P (iface_ref
)
7393 || DECL_CONTEXT (iface_ref
) != iface
)
7395 error ("could not find class$ field in java interface type %qT",
7397 return error_mark_node
;
7399 iface_ref
= build_address (iface_ref
);
7400 iface_ref
= convert (build_pointer_type (iface
), iface_ref
);
7402 /* Determine the itable index of FN. */
7404 for (method
= TYPE_METHODS (iface
); method
; method
= DECL_CHAIN (method
))
7406 if (!DECL_VIRTUAL_P (method
))
7412 idx
= build_int_cst (NULL_TREE
, i
);
7414 lookup_fn
= build1 (ADDR_EXPR
,
7415 build_pointer_type (TREE_TYPE (java_iface_lookup_fn
)),
7416 java_iface_lookup_fn
);
7417 return build_call_nary (ptr_type_node
, lookup_fn
,
7418 3, klass_ref
, iface_ref
, idx
);
7421 /* Returns the value to use for the in-charge parameter when making a
7422 call to a function with the indicated NAME.
7424 FIXME:Can't we find a neater way to do this mapping? */
7427 in_charge_arg_for_name (tree name
)
7429 if (name
== base_ctor_identifier
7430 || name
== base_dtor_identifier
)
7431 return integer_zero_node
;
7432 else if (name
== complete_ctor_identifier
)
7433 return integer_one_node
;
7434 else if (name
== complete_dtor_identifier
)
7435 return integer_two_node
;
7436 else if (name
== deleting_dtor_identifier
)
7437 return integer_three_node
;
7439 /* This function should only be called with one of the names listed
7445 /* Build a call to a constructor, destructor, or an assignment
7446 operator for INSTANCE, an expression with class type. NAME
7447 indicates the special member function to call; *ARGS are the
7448 arguments. ARGS may be NULL. This may change ARGS. BINFO
7449 indicates the base of INSTANCE that is to be passed as the `this'
7450 parameter to the member function called.
7452 FLAGS are the LOOKUP_* flags to use when processing the call.
7454 If NAME indicates a complete object constructor, INSTANCE may be
7455 NULL_TREE. In this case, the caller will call build_cplus_new to
7456 store the newly constructed object into a VAR_DECL. */
7459 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
7460 tree binfo
, int flags
, tsubst_flags_t complain
)
7463 /* The type of the subobject to be constructed or destroyed. */
7465 vec
<tree
, va_gc
> *allocated
= NULL
;
7468 gcc_assert (name
== complete_ctor_identifier
7469 || name
== base_ctor_identifier
7470 || name
== complete_dtor_identifier
7471 || name
== base_dtor_identifier
7472 || name
== deleting_dtor_identifier
7473 || name
== ansi_assopname (NOP_EXPR
));
7476 /* Resolve the name. */
7477 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
7478 return error_mark_node
;
7480 binfo
= TYPE_BINFO (binfo
);
7483 gcc_assert (binfo
!= NULL_TREE
);
7485 class_type
= BINFO_TYPE (binfo
);
7487 /* Handle the special case where INSTANCE is NULL_TREE. */
7488 if (name
== complete_ctor_identifier
&& !instance
)
7489 instance
= build_dummy_object (class_type
);
7492 if (name
== complete_dtor_identifier
7493 || name
== base_dtor_identifier
7494 || name
== deleting_dtor_identifier
)
7495 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
7497 /* Convert to the base class, if necessary. */
7498 if (!same_type_ignoring_top_level_qualifiers_p
7499 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
7501 if (name
!= ansi_assopname (NOP_EXPR
))
7502 /* For constructors and destructors, either the base is
7503 non-virtual, or it is virtual but we are doing the
7504 conversion from a constructor or destructor for the
7505 complete object. In either case, we can convert
7507 instance
= convert_to_base_statically (instance
, binfo
);
7509 /* However, for assignment operators, we must convert
7510 dynamically if the base is virtual. */
7511 instance
= build_base_path (PLUS_EXPR
, instance
,
7512 binfo
, /*nonnull=*/1, complain
);
7516 gcc_assert (instance
!= NULL_TREE
);
7518 fns
= lookup_fnfields (binfo
, name
, 1);
7520 /* When making a call to a constructor or destructor for a subobject
7521 that uses virtual base classes, pass down a pointer to a VTT for
7523 if ((name
== base_ctor_identifier
7524 || name
== base_dtor_identifier
)
7525 && CLASSTYPE_VBASECLASSES (class_type
))
7530 /* If the current function is a complete object constructor
7531 or destructor, then we fetch the VTT directly.
7532 Otherwise, we look it up using the VTT we were given. */
7533 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
7534 vtt
= decay_conversion (vtt
, complain
);
7535 if (vtt
== error_mark_node
)
7536 return error_mark_node
;
7537 vtt
= build3 (COND_EXPR
, TREE_TYPE (vtt
),
7538 build2 (EQ_EXPR
, boolean_type_node
,
7539 current_in_charge_parm
, integer_zero_node
),
7542 if (BINFO_SUBVTT_INDEX (binfo
))
7543 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
7549 allocated
= make_tree_vector ();
7553 vec_safe_insert (*args
, 0, sub_vtt
);
7556 ret
= build_new_method_call (instance
, fns
, args
,
7557 TYPE_BINFO (BINFO_TYPE (binfo
)),
7561 if (allocated
!= NULL
)
7562 release_tree_vector (allocated
);
7564 if ((complain
& tf_error
)
7565 && (flags
& LOOKUP_DELEGATING_CONS
)
7566 && name
== complete_ctor_identifier
7567 && TREE_CODE (ret
) == CALL_EXPR
7568 && (DECL_ABSTRACT_ORIGIN (TREE_OPERAND (CALL_EXPR_FN (ret
), 0))
7569 == current_function_decl
))
7570 error ("constructor delegates to itself");
7575 /* Return the NAME, as a C string. The NAME indicates a function that
7576 is a member of TYPE. *FREE_P is set to true if the caller must
7577 free the memory returned.
7579 Rather than go through all of this, we should simply set the names
7580 of constructors and destructors appropriately, and dispense with
7581 ctor_identifier, dtor_identifier, etc. */
7584 name_as_c_string (tree name
, tree type
, bool *free_p
)
7588 /* Assume that we will not allocate memory. */
7590 /* Constructors and destructors are special. */
7591 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
7594 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
))));
7595 /* For a destructor, add the '~'. */
7596 if (name
== complete_dtor_identifier
7597 || name
== base_dtor_identifier
7598 || name
== deleting_dtor_identifier
)
7600 pretty_name
= concat ("~", pretty_name
, NULL
);
7601 /* Remember that we need to free the memory allocated. */
7605 else if (IDENTIFIER_TYPENAME_P (name
))
7607 pretty_name
= concat ("operator ",
7608 type_as_string_translate (TREE_TYPE (name
),
7609 TFF_PLAIN_IDENTIFIER
),
7611 /* Remember that we need to free the memory allocated. */
7615 pretty_name
= CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name
)));
7620 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
7621 be set, upon return, to the function called. ARGS may be NULL.
7622 This may change ARGS. */
7625 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
7626 tree conversion_path
, int flags
,
7627 tree
*fn_p
, tsubst_flags_t complain
)
7629 struct z_candidate
*candidates
= 0, *cand
;
7630 tree explicit_targs
= NULL_TREE
;
7631 tree basetype
= NULL_TREE
;
7632 tree access_binfo
, binfo
;
7634 tree first_mem_arg
= NULL_TREE
;
7636 bool skip_first_for_error
;
7637 vec
<tree
, va_gc
> *user_args
;
7640 int template_only
= 0;
7644 vec
<tree
, va_gc
> *orig_args
= NULL
;
7647 gcc_assert (instance
!= NULL_TREE
);
7649 /* We don't know what function we're going to call, yet. */
7653 if (error_operand_p (instance
)
7654 || !fns
|| error_operand_p (fns
))
7655 return error_mark_node
;
7657 if (!BASELINK_P (fns
))
7659 if (complain
& tf_error
)
7660 error ("call to non-function %qD", fns
);
7661 return error_mark_node
;
7664 orig_instance
= instance
;
7667 /* Dismantle the baselink to collect all the information we need. */
7668 if (!conversion_path
)
7669 conversion_path
= BASELINK_BINFO (fns
);
7670 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
7671 binfo
= BASELINK_BINFO (fns
);
7672 optype
= BASELINK_OPTYPE (fns
);
7673 fns
= BASELINK_FUNCTIONS (fns
);
7674 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
7676 explicit_targs
= TREE_OPERAND (fns
, 1);
7677 fns
= TREE_OPERAND (fns
, 0);
7680 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
7681 || TREE_CODE (fns
) == TEMPLATE_DECL
7682 || TREE_CODE (fns
) == OVERLOAD
);
7683 fn
= get_first_fn (fns
);
7684 name
= DECL_NAME (fn
);
7686 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
7687 gcc_assert (CLASS_TYPE_P (basetype
));
7689 if (processing_template_decl
)
7691 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
7692 instance
= build_non_dependent_expr (instance
);
7694 make_args_non_dependent (*args
);
7697 user_args
= args
== NULL
? NULL
: *args
;
7698 /* Under DR 147 A::A() is an invalid constructor call,
7699 not a functional cast. */
7700 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
7702 if (! (complain
& tf_error
))
7703 return error_mark_node
;
7705 if (permerror (input_location
,
7706 "cannot call constructor %<%T::%D%> directly",
7708 inform (input_location
, "for a function-style cast, remove the "
7709 "redundant %<::%D%>", name
);
7710 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
7715 /* Figure out whether to skip the first argument for the error
7716 message we will display to users if an error occurs. We don't
7717 want to display any compiler-generated arguments. The "this"
7718 pointer hasn't been added yet. However, we must remove the VTT
7719 pointer if this is a call to a base-class constructor or
7721 skip_first_for_error
= false;
7722 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
7724 /* Callers should explicitly indicate whether they want to construct
7725 the complete object or just the part without virtual bases. */
7726 gcc_assert (name
!= ctor_identifier
);
7727 /* Similarly for destructors. */
7728 gcc_assert (name
!= dtor_identifier
);
7729 /* Remove the VTT pointer, if present. */
7730 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
7731 && CLASSTYPE_VBASECLASSES (basetype
))
7732 skip_first_for_error
= true;
7735 /* Process the argument list. */
7736 if (args
!= NULL
&& *args
!= NULL
)
7738 *args
= resolve_args (*args
, complain
);
7740 return error_mark_node
;
7743 /* Consider the object argument to be used even if we end up selecting a
7744 static member function. */
7745 instance
= mark_type_use (instance
);
7747 /* It's OK to call destructors and constructors on cv-qualified objects.
7748 Therefore, convert the INSTANCE to the unqualified type, if
7750 if (DECL_DESTRUCTOR_P (fn
)
7751 || DECL_CONSTRUCTOR_P (fn
))
7753 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
7755 instance
= build_this (instance
);
7756 instance
= build_nop (build_pointer_type (basetype
), instance
);
7757 instance
= build_fold_indirect_ref (instance
);
7760 if (DECL_DESTRUCTOR_P (fn
))
7761 name
= complete_dtor_identifier
;
7763 /* For the overload resolution we need to find the actual `this`
7764 that would be captured if the call turns out to be to a
7765 non-static member function. Do not actually capture it at this
7767 first_mem_arg
= maybe_resolve_dummy (instance
, false);
7769 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7770 p
= conversion_obstack_alloc (0);
7772 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
7773 initializer, not T({ }). */
7774 if (DECL_CONSTRUCTOR_P (fn
) && args
!= NULL
&& !vec_safe_is_empty (*args
)
7775 && BRACE_ENCLOSED_INITIALIZER_P ((**args
)[0])
7776 && CONSTRUCTOR_IS_DIRECT_INIT ((**args
)[0]))
7778 tree init_list
= (**args
)[0];
7779 tree init
= NULL_TREE
;
7781 gcc_assert ((*args
)->length () == 1
7782 && !(flags
& LOOKUP_ONLYCONVERTING
));
7784 /* If the initializer list has no elements and T is a class type with
7785 a default constructor, the object is value-initialized. Handle
7786 this here so we don't need to handle it wherever we use
7787 build_special_member_call. */
7788 if (CONSTRUCTOR_NELTS (init_list
) == 0
7789 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
7790 /* For a user-provided default constructor, use the normal
7791 mechanisms so that protected access works. */
7792 && !type_has_user_provided_default_constructor (basetype
)
7793 && !processing_template_decl
)
7794 init
= build_value_init (basetype
, complain
);
7796 /* If BASETYPE is an aggregate, we need to do aggregate
7798 else if (CP_AGGREGATE_TYPE_P (basetype
))
7799 init
= digest_init (basetype
, init_list
, complain
);
7803 if (is_dummy_object (instance
))
7804 return get_target_expr_sfinae (init
, complain
);
7805 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
7806 TREE_SIDE_EFFECTS (init
) = true;
7810 /* Otherwise go ahead with overload resolution. */
7811 add_list_candidates (fns
, first_mem_arg
, init_list
,
7812 basetype
, explicit_targs
, template_only
,
7813 conversion_path
, access_binfo
, flags
,
7814 &candidates
, complain
);
7818 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
7819 explicit_targs
, template_only
, conversion_path
,
7820 access_binfo
, flags
, &candidates
, complain
);
7822 any_viable_p
= false;
7823 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
7827 if (complain
& tf_error
)
7829 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
7830 cxx_incomplete_type_error (instance
, basetype
);
7832 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
7833 basetype
, optype
, build_tree_list_vec (user_args
),
7834 TREE_TYPE (instance
));
7841 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
7842 arglist
= build_tree_list_vec (user_args
);
7843 if (skip_first_for_error
)
7844 arglist
= TREE_CHAIN (arglist
);
7845 error ("no matching function for call to %<%T::%s(%A)%#V%>",
7846 basetype
, pretty_name
, arglist
,
7847 TREE_TYPE (instance
));
7851 print_z_candidates (location_of (name
), candidates
);
7853 call
= error_mark_node
;
7857 cand
= tourney (candidates
, complain
);
7864 if (complain
& tf_error
)
7866 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
7867 arglist
= build_tree_list_vec (user_args
);
7868 if (skip_first_for_error
)
7869 arglist
= TREE_CHAIN (arglist
);
7870 error ("call of overloaded %<%s(%A)%> is ambiguous", pretty_name
,
7872 print_z_candidates (location_of (name
), candidates
);
7876 call
= error_mark_node
;
7883 if (!(flags
& LOOKUP_NONVIRTUAL
)
7884 && DECL_PURE_VIRTUAL_P (fn
)
7885 && instance
== current_class_ref
7886 && (complain
& tf_warning
))
7888 /* This is not an error, it is runtime undefined
7890 if (!current_function_decl
)
7891 warning (0, "pure virtual %q#D called from "
7892 "non-static data member initializer", fn
);
7893 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
7894 || DECL_DESTRUCTOR_P (current_function_decl
))
7895 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
7896 ? "pure virtual %q#D called from constructor"
7897 : "pure virtual %q#D called from destructor"),
7901 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
7902 && !DECL_CONSTRUCTOR_P (fn
)
7903 && is_dummy_object (instance
))
7905 instance
= maybe_resolve_dummy (instance
, true);
7906 if (instance
== error_mark_node
)
7907 call
= error_mark_node
;
7908 else if (!is_dummy_object (instance
))
7910 /* We captured 'this' in the current lambda now that
7911 we know we really need it. */
7912 cand
->first_arg
= instance
;
7916 if (complain
& tf_error
)
7917 error ("cannot call member function %qD without object",
7919 call
= error_mark_node
;
7923 if (call
!= error_mark_node
)
7925 /* Optimize away vtable lookup if we know that this
7926 function can't be overridden. We need to check if
7927 the context and the type where we found fn are the same,
7928 actually FN might be defined in a different class
7929 type because of a using-declaration. In this case, we
7930 do not want to perform a non-virtual call. */
7931 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
7932 && same_type_ignoring_top_level_qualifiers_p
7933 (DECL_CONTEXT (fn
), BINFO_TYPE (binfo
))
7934 && resolves_to_fixed_type_p (instance
, 0))
7935 flags
|= LOOKUP_NONVIRTUAL
;
7937 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
7938 /* Now we know what function is being called. */
7941 /* Build the actual CALL_EXPR. */
7942 call
= build_over_call (cand
, flags
, complain
);
7943 /* In an expression of the form `a->f()' where `f' turns
7944 out to be a static member function, `a' is
7945 none-the-less evaluated. */
7946 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
7947 && !is_dummy_object (instance
)
7948 && TREE_SIDE_EFFECTS (instance
))
7949 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
),
7951 else if (call
!= error_mark_node
7952 && DECL_DESTRUCTOR_P (cand
->fn
)
7953 && !VOID_TYPE_P (TREE_TYPE (call
)))
7954 /* An explicit call of the form "x->~X()" has type
7955 "void". However, on platforms where destructors
7956 return "this" (i.e., those where
7957 targetm.cxx.cdtor_returns_this is true), such calls
7958 will appear to have a return value of pointer type
7959 to the low-level call machinery. We do not want to
7960 change the low-level machinery, since we want to be
7961 able to optimize "delete f()" on such platforms as
7962 "operator delete(~X(f()))" (rather than generating
7963 "t = f(), ~X(t), operator delete (t)"). */
7964 call
= build_nop (void_type_node
, call
);
7969 if (processing_template_decl
&& call
!= error_mark_node
)
7971 bool cast_to_void
= false;
7973 if (TREE_CODE (call
) == COMPOUND_EXPR
)
7974 call
= TREE_OPERAND (call
, 1);
7975 else if (TREE_CODE (call
) == NOP_EXPR
)
7977 cast_to_void
= true;
7978 call
= TREE_OPERAND (call
, 0);
7980 if (INDIRECT_REF_P (call
))
7981 call
= TREE_OPERAND (call
, 0);
7982 call
= (build_min_non_dep_call_vec
7984 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
7985 orig_instance
, orig_fns
, NULL_TREE
),
7987 SET_EXPR_LOCATION (call
, input_location
);
7988 call
= convert_from_reference (call
);
7990 call
= build_nop (void_type_node
, call
);
7993 /* Free all the conversions we allocated. */
7994 obstack_free (&conversion_obstack
, p
);
7996 if (orig_args
!= NULL
)
7997 release_tree_vector (orig_args
);
8002 /* Wrapper for above. */
8005 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
8006 tree conversion_path
, int flags
,
8007 tree
*fn_p
, tsubst_flags_t complain
)
8010 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
8011 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
8013 timevar_cond_stop (TV_OVERLOAD
, subtime
);
8017 /* Returns true iff standard conversion sequence ICS1 is a proper
8018 subsequence of ICS2. */
8021 is_subseq (conversion
*ics1
, conversion
*ics2
)
8023 /* We can assume that a conversion of the same code
8024 between the same types indicates a subsequence since we only get
8025 here if the types we are converting from are the same. */
8027 while (ics1
->kind
== ck_rvalue
8028 || ics1
->kind
== ck_lvalue
)
8029 ics1
= next_conversion (ics1
);
8033 while (ics2
->kind
== ck_rvalue
8034 || ics2
->kind
== ck_lvalue
)
8035 ics2
= next_conversion (ics2
);
8037 if (ics2
->kind
== ck_user
8038 || ics2
->kind
== ck_ambig
8039 || ics2
->kind
== ck_aggr
8040 || ics2
->kind
== ck_list
8041 || ics2
->kind
== ck_identity
)
8042 /* At this point, ICS1 cannot be a proper subsequence of
8043 ICS2. We can get a USER_CONV when we are comparing the
8044 second standard conversion sequence of two user conversion
8048 ics2
= next_conversion (ics2
);
8050 if (ics2
->kind
== ics1
->kind
8051 && same_type_p (ics2
->type
, ics1
->type
)
8052 && same_type_p (next_conversion (ics2
)->type
,
8053 next_conversion (ics1
)->type
))
8058 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
8059 be any _TYPE nodes. */
8062 is_properly_derived_from (tree derived
, tree base
)
8064 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
8067 /* We only allow proper derivation here. The DERIVED_FROM_P macro
8068 considers every class derived from itself. */
8069 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
8070 && DERIVED_FROM_P (base
, derived
));
8073 /* We build the ICS for an implicit object parameter as a pointer
8074 conversion sequence. However, such a sequence should be compared
8075 as if it were a reference conversion sequence. If ICS is the
8076 implicit conversion sequence for an implicit object parameter,
8077 modify it accordingly. */
8080 maybe_handle_implicit_object (conversion
**ics
)
8084 /* [over.match.funcs]
8086 For non-static member functions, the type of the
8087 implicit object parameter is "reference to cv X"
8088 where X is the class of which the function is a
8089 member and cv is the cv-qualification on the member
8090 function declaration. */
8091 conversion
*t
= *ics
;
8092 tree reference_type
;
8094 /* The `this' parameter is a pointer to a class type. Make the
8095 implicit conversion talk about a reference to that same class
8097 reference_type
= TREE_TYPE (t
->type
);
8098 reference_type
= build_reference_type (reference_type
);
8100 if (t
->kind
== ck_qual
)
8101 t
= next_conversion (t
);
8102 if (t
->kind
== ck_ptr
)
8103 t
= next_conversion (t
);
8104 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
8105 t
= direct_reference_binding (reference_type
, t
);
8107 t
->rvaluedness_matches_p
= 0;
8112 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
8113 and return the initial reference binding conversion. Otherwise,
8114 leave *ICS unchanged and return NULL. */
8117 maybe_handle_ref_bind (conversion
**ics
)
8119 if ((*ics
)->kind
== ck_ref_bind
)
8121 conversion
*old_ics
= *ics
;
8122 *ics
= next_conversion (old_ics
);
8123 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
8130 /* Compare two implicit conversion sequences according to the rules set out in
8131 [over.ics.rank]. Return values:
8133 1: ics1 is better than ics2
8134 -1: ics2 is better than ics1
8135 0: ics1 and ics2 are indistinguishable */
8138 compare_ics (conversion
*ics1
, conversion
*ics2
)
8144 tree deref_from_type1
= NULL_TREE
;
8145 tree deref_from_type2
= NULL_TREE
;
8146 tree deref_to_type1
= NULL_TREE
;
8147 tree deref_to_type2
= NULL_TREE
;
8148 conversion_rank rank1
, rank2
;
8150 /* REF_BINDING is nonzero if the result of the conversion sequence
8151 is a reference type. In that case REF_CONV is the reference
8152 binding conversion. */
8153 conversion
*ref_conv1
;
8154 conversion
*ref_conv2
;
8156 /* Handle implicit object parameters. */
8157 maybe_handle_implicit_object (&ics1
);
8158 maybe_handle_implicit_object (&ics2
);
8160 /* Handle reference parameters. */
8161 ref_conv1
= maybe_handle_ref_bind (&ics1
);
8162 ref_conv2
= maybe_handle_ref_bind (&ics2
);
8164 /* List-initialization sequence L1 is a better conversion sequence than
8165 list-initialization sequence L2 if L1 converts to
8166 std::initializer_list<X> for some X and L2 does not. */
8167 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
8169 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
8174 When comparing the basic forms of implicit conversion sequences (as
8175 defined in _over.best.ics_)
8177 --a standard conversion sequence (_over.ics.scs_) is a better
8178 conversion sequence than a user-defined conversion sequence
8179 or an ellipsis conversion sequence, and
8181 --a user-defined conversion sequence (_over.ics.user_) is a
8182 better conversion sequence than an ellipsis conversion sequence
8183 (_over.ics.ellipsis_). */
8184 rank1
= CONVERSION_RANK (ics1
);
8185 rank2
= CONVERSION_RANK (ics2
);
8189 else if (rank1
< rank2
)
8192 if (rank1
== cr_bad
)
8194 /* Both ICS are bad. We try to make a decision based on what would
8195 have happened if they'd been good. This is not an extension,
8196 we'll still give an error when we build up the call; this just
8197 helps us give a more helpful error message. */
8198 rank1
= BAD_CONVERSION_RANK (ics1
);
8199 rank2
= BAD_CONVERSION_RANK (ics2
);
8203 else if (rank1
< rank2
)
8206 /* We couldn't make up our minds; try to figure it out below. */
8209 if (ics1
->ellipsis_p
)
8210 /* Both conversions are ellipsis conversions. */
8213 /* User-defined conversion sequence U1 is a better conversion sequence
8214 than another user-defined conversion sequence U2 if they contain the
8215 same user-defined conversion operator or constructor and if the sec-
8216 ond standard conversion sequence of U1 is better than the second
8217 standard conversion sequence of U2. */
8219 /* Handle list-conversion with the same code even though it isn't always
8220 ranked as a user-defined conversion and it doesn't have a second
8221 standard conversion sequence; it will still have the desired effect.
8222 Specifically, we need to do the reference binding comparison at the
8223 end of this function. */
8225 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
|| ics1
->kind
== ck_aggr
)
8230 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
8231 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
8232 || t1
->kind
== ck_list
)
8234 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
8235 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
8236 || t2
->kind
== ck_list
)
8239 if (t1
->kind
!= t2
->kind
)
8241 else if (t1
->kind
== ck_user
)
8243 if (t1
->cand
->fn
!= t2
->cand
->fn
)
8248 /* For ambiguous or aggregate conversions, use the target type as
8249 a proxy for the conversion function. */
8250 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
8254 /* We can just fall through here, after setting up
8255 FROM_TYPE1 and FROM_TYPE2. */
8256 from_type1
= t1
->type
;
8257 from_type2
= t2
->type
;
8264 /* We're dealing with two standard conversion sequences.
8268 Standard conversion sequence S1 is a better conversion
8269 sequence than standard conversion sequence S2 if
8271 --S1 is a proper subsequence of S2 (comparing the conversion
8272 sequences in the canonical form defined by _over.ics.scs_,
8273 excluding any Lvalue Transformation; the identity
8274 conversion sequence is considered to be a subsequence of
8275 any non-identity conversion sequence */
8278 while (t1
->kind
!= ck_identity
)
8279 t1
= next_conversion (t1
);
8280 from_type1
= t1
->type
;
8283 while (t2
->kind
!= ck_identity
)
8284 t2
= next_conversion (t2
);
8285 from_type2
= t2
->type
;
8288 /* One sequence can only be a subsequence of the other if they start with
8289 the same type. They can start with different types when comparing the
8290 second standard conversion sequence in two user-defined conversion
8292 if (same_type_p (from_type1
, from_type2
))
8294 if (is_subseq (ics1
, ics2
))
8296 if (is_subseq (ics2
, ics1
))
8304 --the rank of S1 is better than the rank of S2 (by the rules
8307 Standard conversion sequences are ordered by their ranks: an Exact
8308 Match is a better conversion than a Promotion, which is a better
8309 conversion than a Conversion.
8311 Two conversion sequences with the same rank are indistinguishable
8312 unless one of the following rules applies:
8314 --A conversion that does not a convert a pointer, pointer to member,
8315 or std::nullptr_t to bool is better than one that does.
8317 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
8318 so that we do not have to check it explicitly. */
8319 if (ics1
->rank
< ics2
->rank
)
8321 else if (ics2
->rank
< ics1
->rank
)
8324 to_type1
= ics1
->type
;
8325 to_type2
= ics2
->type
;
8327 /* A conversion from scalar arithmetic type to complex is worse than a
8328 conversion between scalar arithmetic types. */
8329 if (same_type_p (from_type1
, from_type2
)
8330 && ARITHMETIC_TYPE_P (from_type1
)
8331 && ARITHMETIC_TYPE_P (to_type1
)
8332 && ARITHMETIC_TYPE_P (to_type2
)
8333 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
8334 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
8336 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
8342 if (TYPE_PTR_P (from_type1
)
8343 && TYPE_PTR_P (from_type2
)
8344 && TYPE_PTR_P (to_type1
)
8345 && TYPE_PTR_P (to_type2
))
8347 deref_from_type1
= TREE_TYPE (from_type1
);
8348 deref_from_type2
= TREE_TYPE (from_type2
);
8349 deref_to_type1
= TREE_TYPE (to_type1
);
8350 deref_to_type2
= TREE_TYPE (to_type2
);
8352 /* The rules for pointers to members A::* are just like the rules
8353 for pointers A*, except opposite: if B is derived from A then
8354 A::* converts to B::*, not vice versa. For that reason, we
8355 switch the from_ and to_ variables here. */
8356 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
8357 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
8358 || (TYPE_PTRMEMFUNC_P (from_type1
)
8359 && TYPE_PTRMEMFUNC_P (from_type2
)
8360 && TYPE_PTRMEMFUNC_P (to_type1
)
8361 && TYPE_PTRMEMFUNC_P (to_type2
)))
8363 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
8364 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
8365 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
8366 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
8369 if (deref_from_type1
!= NULL_TREE
8370 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
8371 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
8373 /* This was one of the pointer or pointer-like conversions.
8377 --If class B is derived directly or indirectly from class A,
8378 conversion of B* to A* is better than conversion of B* to
8379 void*, and conversion of A* to void* is better than
8380 conversion of B* to void*. */
8381 if (VOID_TYPE_P (deref_to_type1
)
8382 && VOID_TYPE_P (deref_to_type2
))
8384 if (is_properly_derived_from (deref_from_type1
,
8387 else if (is_properly_derived_from (deref_from_type2
,
8391 else if (VOID_TYPE_P (deref_to_type1
)
8392 || VOID_TYPE_P (deref_to_type2
))
8394 if (same_type_p (deref_from_type1
, deref_from_type2
))
8396 if (VOID_TYPE_P (deref_to_type2
))
8398 if (is_properly_derived_from (deref_from_type1
,
8402 /* We know that DEREF_TO_TYPE1 is `void' here. */
8403 else if (is_properly_derived_from (deref_from_type1
,
8408 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
8409 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
8413 --If class B is derived directly or indirectly from class A
8414 and class C is derived directly or indirectly from B,
8416 --conversion of C* to B* is better than conversion of C* to
8419 --conversion of B* to A* is better than conversion of C* to
8421 if (same_type_p (deref_from_type1
, deref_from_type2
))
8423 if (is_properly_derived_from (deref_to_type1
,
8426 else if (is_properly_derived_from (deref_to_type2
,
8430 else if (same_type_p (deref_to_type1
, deref_to_type2
))
8432 if (is_properly_derived_from (deref_from_type2
,
8435 else if (is_properly_derived_from (deref_from_type1
,
8441 else if (CLASS_TYPE_P (non_reference (from_type1
))
8442 && same_type_p (from_type1
, from_type2
))
8444 tree from
= non_reference (from_type1
);
8448 --binding of an expression of type C to a reference of type
8449 B& is better than binding an expression of type C to a
8450 reference of type A&
8452 --conversion of C to B is better than conversion of C to A, */
8453 if (is_properly_derived_from (from
, to_type1
)
8454 && is_properly_derived_from (from
, to_type2
))
8456 if (is_properly_derived_from (to_type1
, to_type2
))
8458 else if (is_properly_derived_from (to_type2
, to_type1
))
8462 else if (CLASS_TYPE_P (non_reference (to_type1
))
8463 && same_type_p (to_type1
, to_type2
))
8465 tree to
= non_reference (to_type1
);
8469 --binding of an expression of type B to a reference of type
8470 A& is better than binding an expression of type C to a
8471 reference of type A&,
8473 --conversion of B to A is better than conversion of C to A */
8474 if (is_properly_derived_from (from_type1
, to
)
8475 && is_properly_derived_from (from_type2
, to
))
8477 if (is_properly_derived_from (from_type2
, from_type1
))
8479 else if (is_properly_derived_from (from_type1
, from_type2
))
8486 --S1 and S2 differ only in their qualification conversion and yield
8487 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
8488 qualification signature of type T1 is a proper subset of the cv-
8489 qualification signature of type T2 */
8490 if (ics1
->kind
== ck_qual
8491 && ics2
->kind
== ck_qual
8492 && same_type_p (from_type1
, from_type2
))
8494 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
8501 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
8502 to an implicit object parameter, and either S1 binds an lvalue reference
8503 to an lvalue and S2 binds an rvalue reference or S1 binds an rvalue
8504 reference to an rvalue and S2 binds an lvalue reference
8505 (C++0x draft standard, 13.3.3.2)
8507 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
8508 types to which the references refer are the same type except for
8509 top-level cv-qualifiers, and the type to which the reference
8510 initialized by S2 refers is more cv-qualified than the type to
8511 which the reference initialized by S1 refers.
8513 DR 1328 [over.match.best]: the context is an initialization by
8514 conversion function for direct reference binding (13.3.1.6) of a
8515 reference to function type, the return type of F1 is the same kind of
8516 reference (i.e. lvalue or rvalue) as the reference being initialized,
8517 and the return type of F2 is not. */
8519 if (ref_conv1
&& ref_conv2
)
8521 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
8522 && (ref_conv1
->rvaluedness_matches_p
8523 != ref_conv2
->rvaluedness_matches_p
)
8524 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
8525 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
8526 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
8528 return (ref_conv1
->rvaluedness_matches_p
8529 - ref_conv2
->rvaluedness_matches_p
);
8532 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
8533 return comp_cv_qualification (TREE_TYPE (ref_conv2
->type
),
8534 TREE_TYPE (ref_conv1
->type
));
8537 /* Neither conversion sequence is better than the other. */
8541 /* The source type for this standard conversion sequence. */
8544 source_type (conversion
*t
)
8546 for (;; t
= next_conversion (t
))
8548 if (t
->kind
== ck_user
8549 || t
->kind
== ck_ambig
8550 || t
->kind
== ck_identity
)
8556 /* Note a warning about preferring WINNER to LOSER. We do this by storing
8557 a pointer to LOSER and re-running joust to produce the warning if WINNER
8558 is actually used. */
8561 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
8563 candidate_warning
*cw
= (candidate_warning
*)
8564 conversion_obstack_alloc (sizeof (candidate_warning
));
8566 cw
->next
= winner
->warnings
;
8567 winner
->warnings
= cw
;
8570 /* Compare two candidates for overloading as described in
8571 [over.match.best]. Return values:
8573 1: cand1 is better than cand2
8574 -1: cand2 is better than cand1
8575 0: cand1 and cand2 are indistinguishable */
8578 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
8579 tsubst_flags_t complain
)
8582 int off1
= 0, off2
= 0;
8586 /* Candidates that involve bad conversions are always worse than those
8588 if (cand1
->viable
> cand2
->viable
)
8590 if (cand1
->viable
< cand2
->viable
)
8593 /* If we have two pseudo-candidates for conversions to the same type,
8594 or two candidates for the same function, arbitrarily pick one. */
8595 if (cand1
->fn
== cand2
->fn
8596 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
8599 /* Prefer a non-deleted function over an implicitly deleted move
8600 constructor or assignment operator. This differs slightly from the
8601 wording for issue 1402 (which says the move op is ignored by overload
8602 resolution), but this way produces better error messages. */
8603 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
8604 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
8605 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
8607 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
8608 && move_fn_p (cand1
->fn
))
8610 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
8611 && move_fn_p (cand2
->fn
))
8615 /* a viable function F1
8616 is defined to be a better function than another viable function F2 if
8617 for all arguments i, ICSi(F1) is not a worse conversion sequence than
8618 ICSi(F2), and then */
8620 /* for some argument j, ICSj(F1) is a better conversion sequence than
8623 /* For comparing static and non-static member functions, we ignore
8624 the implicit object parameter of the non-static function. The
8625 standard says to pretend that the static function has an object
8626 parm, but that won't work with operator overloading. */
8627 len
= cand1
->num_convs
;
8628 if (len
!= cand2
->num_convs
)
8630 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
8631 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
8633 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
8634 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
8635 /* We're comparing a near-match list constructor and a near-match
8636 non-list constructor. Just treat them as unordered. */
8639 gcc_assert (static_1
!= static_2
);
8650 for (i
= 0; i
< len
; ++i
)
8652 conversion
*t1
= cand1
->convs
[i
+ off1
];
8653 conversion
*t2
= cand2
->convs
[i
+ off2
];
8654 int comp
= compare_ics (t1
, t2
);
8658 if ((complain
& tf_warning
)
8660 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
8661 == cr_std
+ cr_promotion
)
8662 && t1
->kind
== ck_std
8663 && t2
->kind
== ck_std
8664 && TREE_CODE (t1
->type
) == INTEGER_TYPE
8665 && TREE_CODE (t2
->type
) == INTEGER_TYPE
8666 && (TYPE_PRECISION (t1
->type
)
8667 == TYPE_PRECISION (t2
->type
))
8668 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
8669 || (TREE_CODE (next_conversion (t1
)->type
)
8672 tree type
= next_conversion (t1
)->type
;
8674 struct z_candidate
*w
, *l
;
8676 type1
= t1
->type
, type2
= t2
->type
,
8677 w
= cand1
, l
= cand2
;
8679 type1
= t2
->type
, type2
= t1
->type
,
8680 w
= cand2
, l
= cand1
;
8684 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
8685 type
, type1
, type2
);
8686 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
8692 if (winner
&& comp
!= winner
)
8701 /* warn about confusing overload resolution for user-defined conversions,
8702 either between a constructor and a conversion op, or between two
8704 if ((complain
& tf_warning
)
8705 && winner
&& warn_conversion
&& cand1
->second_conv
8706 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
8707 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
8709 struct z_candidate
*w
, *l
;
8710 bool give_warning
= false;
8713 w
= cand1
, l
= cand2
;
8715 w
= cand2
, l
= cand1
;
8717 /* We don't want to complain about `X::operator T1 ()'
8718 beating `X::operator T2 () const', when T2 is a no less
8719 cv-qualified version of T1. */
8720 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
8721 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
8723 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
8724 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
8726 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
8731 if (!comp_ptr_ttypes (t
, f
))
8732 give_warning
= true;
8735 give_warning
= true;
8741 tree source
= source_type (w
->convs
[0]);
8742 if (! DECL_CONSTRUCTOR_P (w
->fn
))
8743 source
= TREE_TYPE (source
);
8744 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
8745 && warning (OPT_Wconversion
, " for conversion from %qT to %qT",
8746 source
, w
->second_conv
->type
))
8748 inform (input_location
, " because conversion sequence for the argument is better");
8758 /* DR 495 moved this tiebreaker above the template ones. */
8760 the context is an initialization by user-defined conversion (see
8761 _dcl.init_ and _over.match.user_) and the standard conversion
8762 sequence from the return type of F1 to the destination type (i.e.,
8763 the type of the entity being initialized) is a better conversion
8764 sequence than the standard conversion sequence from the return type
8765 of F2 to the destination type. */
8767 if (cand1
->second_conv
)
8769 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
8775 F1 is a non-template function and F2 is a template function
8778 if (!cand1
->template_decl
&& cand2
->template_decl
)
8780 else if (cand1
->template_decl
&& !cand2
->template_decl
)
8784 F1 and F2 are template functions and the function template for F1 is
8785 more specialized than the template for F2 according to the partial
8788 if (cand1
->template_decl
&& cand2
->template_decl
)
8790 winner
= more_specialized_fn
8791 (TI_TEMPLATE (cand1
->template_decl
),
8792 TI_TEMPLATE (cand2
->template_decl
),
8793 /* [temp.func.order]: The presence of unused ellipsis and default
8794 arguments has no effect on the partial ordering of function
8795 templates. add_function_candidate() will not have
8796 counted the "this" argument for constructors. */
8797 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
8802 /* Check whether we can discard a builtin candidate, either because we
8803 have two identical ones or matching builtin and non-builtin candidates.
8805 (Pedantically in the latter case the builtin which matched the user
8806 function should not be added to the overload set, but we spot it here.
8809 ... the builtin candidates include ...
8810 - do not have the same parameter type list as any non-template
8811 non-member candidate. */
8813 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
8815 for (i
= 0; i
< len
; ++i
)
8816 if (!same_type_p (cand1
->convs
[i
]->type
,
8817 cand2
->convs
[i
]->type
))
8819 if (i
== cand1
->num_convs
)
8821 if (cand1
->fn
== cand2
->fn
)
8822 /* Two built-in candidates; arbitrarily pick one. */
8824 else if (identifier_p (cand1
->fn
))
8825 /* cand1 is built-in; prefer cand2. */
8828 /* cand2 is built-in; prefer cand1. */
8833 /* For candidates of a multi-versioned function, make the version with
8834 the highest priority win. This version will be checked for dispatching
8835 first. If this version can be inlined into the caller, the front-end
8836 will simply make a direct call to this function. */
8838 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
8839 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
8840 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
8841 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
8843 tree f1
= TREE_TYPE (cand1
->fn
);
8844 tree f2
= TREE_TYPE (cand2
->fn
);
8845 tree p1
= TYPE_ARG_TYPES (f1
);
8846 tree p2
= TYPE_ARG_TYPES (f2
);
8848 /* Check if cand1->fn and cand2->fn are versions of the same function. It
8849 is possible that cand1->fn and cand2->fn are function versions but of
8850 different functions. Check types to see if they are versions of the same
8852 if (compparms (p1
, p2
)
8853 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
8855 /* Always make the version with the higher priority, more
8856 specialized, win. */
8857 gcc_assert (targetm
.compare_version_priority
);
8858 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
8865 /* If the two function declarations represent the same function (this can
8866 happen with declarations in multiple scopes and arg-dependent lookup),
8867 arbitrarily choose one. But first make sure the default args we're
8869 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
8870 && equal_functions (cand1
->fn
, cand2
->fn
))
8872 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
8873 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
8875 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
8877 for (i
= 0; i
< len
; ++i
)
8879 /* Don't crash if the fn is variadic. */
8882 parms1
= TREE_CHAIN (parms1
);
8883 parms2
= TREE_CHAIN (parms2
);
8887 parms1
= TREE_CHAIN (parms1
);
8889 parms2
= TREE_CHAIN (parms2
);
8893 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
8894 TREE_PURPOSE (parms2
)))
8898 if (complain
& tf_error
)
8900 if (permerror (input_location
,
8901 "default argument mismatch in "
8902 "overload resolution"))
8904 inform (input_location
,
8905 " candidate 1: %q+#F", cand1
->fn
);
8906 inform (input_location
,
8907 " candidate 2: %q+#F", cand2
->fn
);
8914 add_warning (cand1
, cand2
);
8917 parms1
= TREE_CHAIN (parms1
);
8918 parms2
= TREE_CHAIN (parms2
);
8926 /* Extension: If the worst conversion for one candidate is worse than the
8927 worst conversion for the other, take the first. */
8928 if (!pedantic
&& (complain
& tf_warning_or_error
))
8930 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
8931 struct z_candidate
*w
= 0, *l
= 0;
8933 for (i
= 0; i
< len
; ++i
)
8935 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
8936 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
8937 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
8938 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
8941 winner
= 1, w
= cand1
, l
= cand2
;
8943 winner
= -1, w
= cand2
, l
= cand1
;
8946 /* Don't choose a deleted function over ambiguity. */
8947 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
8951 pedwarn (input_location
, 0,
8952 "ISO C++ says that these are ambiguous, even "
8953 "though the worst conversion for the first is better than "
8954 "the worst conversion for the second:");
8955 print_z_candidate (input_location
, _("candidate 1:"), w
);
8956 print_z_candidate (input_location
, _("candidate 2:"), l
);
8964 gcc_assert (!winner
);
8968 /* Given a list of candidates for overloading, find the best one, if any.
8969 This algorithm has a worst case of O(2n) (winner is last), and a best
8970 case of O(n/2) (totally ambiguous); much better than a sorting
8973 static struct z_candidate
*
8974 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
8976 struct z_candidate
*champ
= candidates
, *challenger
;
8978 int champ_compared_to_predecessor
= 0;
8980 /* Walk through the list once, comparing each current champ to the next
8981 candidate, knocking out a candidate or two with each comparison. */
8983 for (challenger
= champ
->next
; challenger
; )
8985 fate
= joust (champ
, challenger
, 0, complain
);
8987 challenger
= challenger
->next
;
8992 champ
= challenger
->next
;
8995 champ_compared_to_predecessor
= 0;
9000 champ_compared_to_predecessor
= 1;
9003 challenger
= champ
->next
;
9007 /* Make sure the champ is better than all the candidates it hasn't yet
9008 been compared to. */
9010 for (challenger
= candidates
;
9012 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
9013 challenger
= challenger
->next
)
9015 fate
= joust (champ
, challenger
, 0, complain
);
9023 /* Returns nonzero if things of type FROM can be converted to TO. */
9026 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
9028 tree arg
= NULL_TREE
;
9029 /* implicit_conversion only considers user-defined conversions
9030 if it has an expression for the call argument list. */
9031 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
9032 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
9033 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
9036 /* Returns nonzero if things of type FROM can be converted to TO with a
9037 standard conversion. */
9040 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
9042 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
9045 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
9048 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
9049 tsubst_flags_t complain
)
9055 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9056 p
= conversion_obstack_alloc (0);
9057 /* We want to discard any access checks done for this test,
9058 as we might not be in the appropriate access context and
9059 we'll do the check again when we actually perform the
9061 push_deferring_access_checks (dk_deferred
);
9063 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
9065 ok_p
= (t
&& !t
->bad_p
);
9067 /* Discard the access checks now. */
9068 pop_deferring_access_checks ();
9069 /* Free all the conversions we allocated. */
9070 obstack_free (&conversion_obstack
, p
);
9075 /* Like can_convert_arg, but allows dubious conversions as well. */
9078 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
9079 tsubst_flags_t complain
)
9084 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9085 p
= conversion_obstack_alloc (0);
9086 /* Try to perform the conversion. */
9087 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
9089 /* Free all the conversions we allocated. */
9090 obstack_free (&conversion_obstack
, p
);
9095 /* Convert EXPR to TYPE. Return the converted expression.
9097 Note that we allow bad conversions here because by the time we get to
9098 this point we are committed to doing the conversion. If we end up
9099 doing a bad conversion, convert_like will complain. */
9102 perform_implicit_conversion_flags (tree type
, tree expr
,
9103 tsubst_flags_t complain
, int flags
)
9107 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
9109 if (error_operand_p (expr
))
9110 return error_mark_node
;
9112 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9113 p
= conversion_obstack_alloc (0);
9115 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
9121 if (complain
& tf_error
)
9123 /* If expr has unknown type, then it is an overloaded function.
9124 Call instantiate_type to get good error messages. */
9125 if (TREE_TYPE (expr
) == unknown_type_node
)
9126 instantiate_type (type
, expr
, complain
);
9127 else if (invalid_nonstatic_memfn_p (expr
, complain
))
9128 /* We gave an error. */;
9130 error_at (loc
, "could not convert %qE from %qT to %qT", expr
,
9131 TREE_TYPE (expr
), type
);
9133 expr
= error_mark_node
;
9135 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
9137 /* In a template, we are only concerned about determining the
9138 type of non-dependent expressions, so we do not have to
9139 perform the actual conversion. But for initializers, we
9140 need to be able to perform it at instantiation
9141 (or fold_non_dependent_expr) time. */
9142 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
9143 if (!(flags
& LOOKUP_ONLYCONVERTING
))
9144 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
9147 expr
= convert_like (conv
, expr
, complain
);
9149 /* Free all the conversions we allocated. */
9150 obstack_free (&conversion_obstack
, p
);
9156 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
9158 return perform_implicit_conversion_flags (type
, expr
, complain
,
9162 /* Convert EXPR to TYPE (as a direct-initialization) if that is
9163 permitted. If the conversion is valid, the converted expression is
9164 returned. Otherwise, NULL_TREE is returned, except in the case
9165 that TYPE is a class type; in that case, an error is issued. If
9166 C_CAST_P is true, then this direct-initialization is taking
9167 place as part of a static_cast being attempted as part of a C-style
9171 perform_direct_initialization_if_possible (tree type
,
9174 tsubst_flags_t complain
)
9179 if (type
== error_mark_node
|| error_operand_p (expr
))
9180 return error_mark_node
;
9183 If the destination type is a (possibly cv-qualified) class type:
9185 -- If the initialization is direct-initialization ...,
9186 constructors are considered. ... If no constructor applies, or
9187 the overload resolution is ambiguous, the initialization is
9189 if (CLASS_TYPE_P (type
))
9191 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
9192 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
9193 &args
, type
, LOOKUP_NORMAL
, complain
);
9194 release_tree_vector (args
);
9195 return build_cplus_new (type
, expr
, complain
);
9198 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9199 p
= conversion_obstack_alloc (0);
9201 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
9203 LOOKUP_NORMAL
, complain
);
9204 if (!conv
|| conv
->bad_p
)
9207 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0, 0,
9208 /*issue_conversion_warnings=*/false,
9212 /* Free all the conversions we allocated. */
9213 obstack_free (&conversion_obstack
, p
);
9218 /* When initializing a reference that lasts longer than a full-expression,
9219 this special rule applies:
9223 The temporary to which the reference is bound or the temporary
9224 that is the complete object to which the reference is bound
9225 persists for the lifetime of the reference.
9227 The temporaries created during the evaluation of the expression
9228 initializing the reference, except the temporary to which the
9229 reference is bound, are destroyed at the end of the
9230 full-expression in which they are created.
9232 In that case, we store the converted expression into a new
9233 VAR_DECL in a new scope.
9235 However, we want to be careful not to create temporaries when
9236 they are not required. For example, given:
9239 struct D : public B {};
9243 there is no need to copy the return value from "f"; we can just
9244 extend its lifetime. Similarly, given:
9247 struct T { operator S(); };
9251 we can extend the lifetime of the return value of the conversion
9254 The next several functions are involved in this lifetime extension. */
9256 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
9257 reference is being bound to a temporary. Create and return a new
9258 VAR_DECL with the indicated TYPE; this variable will store the value to
9259 which the reference is bound. */
9262 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
9266 /* Create the variable. */
9267 var
= create_temporary_var (type
);
9269 /* Register the variable. */
9271 && (TREE_STATIC (decl
) || DECL_THREAD_LOCAL_P (decl
)))
9273 /* Namespace-scope or local static; give it a mangled name. */
9274 /* FIXME share comdat with decl? */
9277 TREE_STATIC (var
) = TREE_STATIC (decl
);
9278 DECL_TLS_MODEL (var
) = DECL_TLS_MODEL (decl
);
9279 name
= mangle_ref_init_variable (decl
);
9280 DECL_NAME (var
) = name
;
9281 SET_DECL_ASSEMBLER_NAME (var
, name
);
9282 var
= pushdecl_top_level (var
);
9285 /* Create a new cleanup level if necessary. */
9286 maybe_push_cleanup_level (type
);
9291 /* EXPR is the initializer for a variable DECL of reference or
9292 std::initializer_list type. Create, push and return a new VAR_DECL
9293 for the initializer so that it will live as long as DECL. Any
9294 cleanup for the new variable is returned through CLEANUP, and the
9295 code to initialize the new variable is returned through INITP. */
9298 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
9305 /* Create the temporary variable. */
9306 type
= TREE_TYPE (expr
);
9307 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
9308 layout_decl (var
, 0);
9309 /* If the rvalue is the result of a function call it will be
9310 a TARGET_EXPR. If it is some other construct (such as a
9311 member access expression where the underlying object is
9312 itself the result of a function call), turn it into a
9313 TARGET_EXPR here. It is important that EXPR be a
9314 TARGET_EXPR below since otherwise the INIT_EXPR will
9315 attempt to make a bitwise copy of EXPR to initialize
9317 if (TREE_CODE (expr
) != TARGET_EXPR
)
9318 expr
= get_target_expr (expr
);
9320 if (TREE_CODE (decl
) == FIELD_DECL
9321 && extra_warnings
&& !TREE_NO_WARNING (decl
))
9323 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
9324 "until the constructor exits", decl
);
9325 TREE_NO_WARNING (decl
) = true;
9328 /* Recursively extend temps in this initializer. */
9329 TARGET_EXPR_INITIAL (expr
)
9330 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
9332 /* Any reference temp has a non-trivial initializer. */
9333 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
9335 /* If the initializer is constant, put it in DECL_INITIAL so we get
9336 static initialization and use in constant expressions. */
9337 init
= maybe_constant_init (expr
);
9338 if (TREE_CONSTANT (init
))
9340 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
9342 /* 5.19 says that a constant expression can include an
9343 lvalue-rvalue conversion applied to "a glvalue of literal type
9344 that refers to a non-volatile temporary object initialized
9345 with a constant expression". Rather than try to communicate
9346 that this VAR_DECL is a temporary, just mark it constexpr.
9348 Currently this is only useful for initializer_list temporaries,
9349 since reference vars can't appear in constant expressions. */
9350 DECL_DECLARED_CONSTEXPR_P (var
) = true;
9351 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
9352 TREE_CONSTANT (var
) = true;
9354 DECL_INITIAL (var
) = init
;
9358 /* Create the INIT_EXPR that will initialize the temporary
9360 init
= build2 (INIT_EXPR
, type
, var
, expr
);
9361 if (at_function_scope_p ())
9363 add_decl_expr (var
);
9365 if (TREE_STATIC (var
))
9366 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
9369 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
9371 vec_safe_push (*cleanups
, cleanup
);
9374 /* We must be careful to destroy the temporary only
9375 after its initialization has taken place. If the
9376 initialization throws an exception, then the
9377 destructor should not be run. We cannot simply
9378 transform INIT into something like:
9380 (INIT, ({ CLEANUP_STMT; }))
9382 because emit_local_var always treats the
9383 initializer as a full-expression. Thus, the
9384 destructor would run too early; it would run at the
9385 end of initializing the reference variable, rather
9386 than at the end of the block enclosing the
9389 The solution is to pass back a cleanup expression
9390 which the caller is responsible for attaching to
9391 the statement tree. */
9395 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
9396 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
9398 if (DECL_THREAD_LOCAL_P (var
))
9399 tls_aggregates
= tree_cons (NULL_TREE
, var
,
9402 static_aggregates
= tree_cons (NULL_TREE
, var
,
9406 /* Check whether the dtor is callable. */
9407 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
9414 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
9415 initializing a variable of that TYPE. */
9418 initialize_reference (tree type
, tree expr
,
9419 int flags
, tsubst_flags_t complain
)
9423 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
9425 if (type
== error_mark_node
|| error_operand_p (expr
))
9426 return error_mark_node
;
9428 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9429 p
= conversion_obstack_alloc (0);
9431 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
9433 if (!conv
|| conv
->bad_p
)
9435 if (complain
& tf_error
)
9438 convert_like (conv
, expr
, complain
);
9439 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
9440 && !TYPE_REF_IS_RVALUE (type
)
9441 && !real_lvalue_p (expr
))
9442 error_at (loc
, "invalid initialization of non-const reference of "
9443 "type %qT from an rvalue of type %qT",
9444 type
, TREE_TYPE (expr
));
9446 error_at (loc
, "invalid initialization of reference of type "
9447 "%qT from expression of type %qT", type
,
9450 return error_mark_node
;
9453 if (conv
->kind
== ck_ref_bind
)
9454 /* Perform the conversion. */
9455 expr
= convert_like (conv
, expr
, complain
);
9456 else if (conv
->kind
== ck_ambig
)
9457 /* We gave an error in build_user_type_conversion_1. */
9458 expr
= error_mark_node
;
9462 /* Free all the conversions we allocated. */
9463 obstack_free (&conversion_obstack
, p
);
9468 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
9469 which is bound either to a reference or a std::initializer_list. */
9472 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
9477 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
9479 TREE_OPERAND (sub
, 1)
9480 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
9483 if (TREE_CODE (sub
) != ADDR_EXPR
)
9485 /* Deal with binding to a subobject. */
9486 for (p
= &TREE_OPERAND (sub
, 0); TREE_CODE (*p
) == COMPONENT_REF
; )
9487 p
= &TREE_OPERAND (*p
, 0);
9488 if (TREE_CODE (*p
) == TARGET_EXPR
)
9490 tree subinit
= NULL_TREE
;
9491 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
9493 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
9494 recompute_tree_invariant_for_addr_expr (sub
);
9499 /* INIT is part of the initializer for DECL. If there are any
9500 reference or initializer lists being initialized, extend their
9501 lifetime to match that of DECL. */
9504 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
9506 tree type
= TREE_TYPE (init
);
9507 if (processing_template_decl
)
9509 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9510 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
9511 else if (is_std_init_list (type
))
9513 /* The temporary array underlying a std::initializer_list
9514 is handled like a reference temporary. */
9516 if (TREE_CODE (ctor
) == TARGET_EXPR
)
9517 ctor
= TARGET_EXPR_INITIAL (ctor
);
9518 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
9520 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
9521 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
9522 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
9525 else if (TREE_CODE (init
) == CONSTRUCTOR
)
9529 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (init
);
9530 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
9531 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
9537 /* Returns true iff an initializer for TYPE could contain temporaries that
9538 need to be extended because they are bound to references or
9539 std::initializer_list. */
9542 type_has_extended_temps (tree type
)
9544 type
= strip_array_types (type
);
9545 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9547 if (CLASS_TYPE_P (type
))
9549 if (is_std_init_list (type
))
9551 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
9552 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
9553 if (type_has_extended_temps (TREE_TYPE (f
)))
9559 /* Returns true iff TYPE is some variant of std::initializer_list. */
9562 is_std_init_list (tree type
)
9564 /* Look through typedefs. */
9567 if (cxx_dialect
== cxx98
)
9569 type
= TYPE_MAIN_VARIANT (type
);
9570 return (CLASS_TYPE_P (type
)
9571 && CP_TYPE_CONTEXT (type
) == std_node
9572 && strcmp (TYPE_NAME_STRING (type
), "initializer_list") == 0);
9575 /* Returns true iff DECL is a list constructor: i.e. a constructor which
9576 will accept an argument list of a single std::initializer_list<T>. */
9579 is_list_ctor (tree decl
)
9581 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
9584 if (!args
|| args
== void_list_node
)
9587 arg
= non_reference (TREE_VALUE (args
));
9588 if (!is_std_init_list (arg
))
9591 args
= TREE_CHAIN (args
);
9593 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
9594 /* There are more non-defaulted parms. */
9600 #include "gt-cp-call.h"