1 /* Functions related to invoking methods and overloaded functions.
2 Copyright (C) 1987, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009,
5 Free Software Foundation, Inc.
6 Contributed by Michael Tiemann (tiemann@cygnus.com) and
7 modified by Brendan Kehoe (brendan@cygnus.com).
9 This file is part of GCC.
11 GCC is free software; you can redistribute it and/or modify
12 it under the terms of the GNU General Public License as published by
13 the Free Software Foundation; either version 3, or (at your option)
16 GCC is distributed in the hope that it will be useful,
17 but WITHOUT ANY WARRANTY; without even the implied warranty of
18 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 GNU General Public License for more details.
21 You should have received a copy of the GNU General Public License
22 along with GCC; see the file COPYING3. If not see
23 <http://www.gnu.org/licenses/>. */
26 /* High-level class interface. */
30 #include "coretypes.h"
36 #include "diagnostic-core.h"
40 #include "langhooks.h"
41 #include "c-family/c-objc.h"
44 /* The various kinds of conversion. */
46 typedef enum conversion_kind
{
62 /* The rank of the conversion. Order of the enumerals matters; better
63 conversions should come earlier in the list. */
65 typedef enum conversion_rank
{
76 /* An implicit conversion sequence, in the sense of [over.best.ics].
77 The first conversion to be performed is at the end of the chain.
78 That conversion is always a cr_identity conversion. */
80 typedef struct conversion conversion
;
82 /* The kind of conversion represented by this step. */
84 /* The rank of this conversion. */
86 BOOL_BITFIELD user_conv_p
: 1;
87 BOOL_BITFIELD ellipsis_p
: 1;
88 BOOL_BITFIELD this_p
: 1;
89 /* True if this conversion would be permitted with a bending of
90 language standards, e.g. disregarding pointer qualifiers or
91 converting integers to pointers. */
92 BOOL_BITFIELD bad_p
: 1;
93 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
94 temporary should be created to hold the result of the
96 BOOL_BITFIELD need_temporary_p
: 1;
97 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
98 from a pointer-to-derived to pointer-to-base is being performed. */
99 BOOL_BITFIELD base_p
: 1;
100 /* If KIND is ck_ref_bind, true when either an lvalue reference is
101 being bound to an lvalue expression or an rvalue reference is
102 being bound to an rvalue expression. If KIND is ck_rvalue,
103 true when we should treat an lvalue as an rvalue (12.8p33). If
104 KIND is ck_base, always false. */
105 BOOL_BITFIELD rvaluedness_matches_p
: 1;
106 BOOL_BITFIELD check_narrowing
: 1;
107 /* The type of the expression resulting from the conversion. */
110 /* The next conversion in the chain. Since the conversions are
111 arranged from outermost to innermost, the NEXT conversion will
112 actually be performed before this conversion. This variant is
113 used only when KIND is neither ck_identity, ck_ambig nor
114 ck_list. Please use the next_conversion function instead
115 of using this field directly. */
117 /* The expression at the beginning of the conversion chain. This
118 variant is used only if KIND is ck_identity or ck_ambig. */
120 /* The array of conversions for an initializer_list, so this
121 variant is used only when KIN D is ck_list. */
124 /* The function candidate corresponding to this conversion
125 sequence. This field is only used if KIND is ck_user. */
126 struct z_candidate
*cand
;
129 #define CONVERSION_RANK(NODE) \
130 ((NODE)->bad_p ? cr_bad \
131 : (NODE)->ellipsis_p ? cr_ellipsis \
132 : (NODE)->user_conv_p ? cr_user \
135 #define BAD_CONVERSION_RANK(NODE) \
136 ((NODE)->ellipsis_p ? cr_ellipsis \
137 : (NODE)->user_conv_p ? cr_user \
140 static struct obstack conversion_obstack
;
141 static bool conversion_obstack_initialized
;
142 struct rejection_reason
;
144 static struct z_candidate
* tourney (struct z_candidate
*, tsubst_flags_t
);
145 static int equal_functions (tree
, tree
);
146 static int joust (struct z_candidate
*, struct z_candidate
*, bool,
148 static int compare_ics (conversion
*, conversion
*);
149 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
150 static tree
build_java_interface_fn_ref (tree
, tree
);
151 #define convert_like(CONV, EXPR, COMPLAIN) \
152 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
153 /*issue_conversion_warnings=*/true, \
154 /*c_cast_p=*/false, (COMPLAIN))
155 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
156 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
157 /*issue_conversion_warnings=*/true, \
158 /*c_cast_p=*/false, (COMPLAIN))
159 static tree
convert_like_real (conversion
*, tree
, tree
, int, int, bool,
160 bool, tsubst_flags_t
);
161 static void op_error (location_t
, enum tree_code
, enum tree_code
, tree
,
163 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int,
165 static void print_z_candidate (location_t
, const char *, struct z_candidate
*);
166 static void print_z_candidates (location_t
, struct z_candidate
*);
167 static tree
build_this (tree
);
168 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
169 static bool any_strictly_viable (struct z_candidate
*);
170 static struct z_candidate
*add_template_candidate
171 (struct z_candidate
**, tree
, tree
, tree
, tree
, const VEC(tree
,gc
) *,
172 tree
, tree
, tree
, int, unification_kind_t
, tsubst_flags_t
);
173 static struct z_candidate
*add_template_candidate_real
174 (struct z_candidate
**, tree
, tree
, tree
, tree
, const VEC(tree
,gc
) *,
175 tree
, tree
, tree
, int, tree
, unification_kind_t
, tsubst_flags_t
);
176 static struct z_candidate
*add_template_conv_candidate
177 (struct z_candidate
**, tree
, tree
, tree
, const VEC(tree
,gc
) *, tree
,
178 tree
, tree
, tsubst_flags_t
);
179 static void add_builtin_candidates
180 (struct z_candidate
**, enum tree_code
, enum tree_code
,
181 tree
, tree
*, int, tsubst_flags_t
);
182 static void add_builtin_candidate
183 (struct z_candidate
**, enum tree_code
, enum tree_code
,
184 tree
, tree
, tree
, tree
*, tree
*, int, tsubst_flags_t
);
185 static bool is_complete (tree
);
186 static void build_builtin_candidate
187 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
188 int, tsubst_flags_t
);
189 static struct z_candidate
*add_conv_candidate
190 (struct z_candidate
**, tree
, tree
, tree
, const VEC(tree
,gc
) *, tree
,
191 tree
, tsubst_flags_t
);
192 static struct z_candidate
*add_function_candidate
193 (struct z_candidate
**, tree
, tree
, tree
, const VEC(tree
,gc
) *, tree
,
194 tree
, int, tsubst_flags_t
);
195 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int,
197 static conversion
*standard_conversion (tree
, tree
, tree
, bool, int);
198 static conversion
*reference_binding (tree
, tree
, tree
, bool, int,
200 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
201 static conversion
*build_list_conv (tree
, tree
, int, tsubst_flags_t
);
202 static conversion
*next_conversion (conversion
*);
203 static bool is_subseq (conversion
*, conversion
*);
204 static conversion
*maybe_handle_ref_bind (conversion
**);
205 static void maybe_handle_implicit_object (conversion
**);
206 static struct z_candidate
*add_candidate
207 (struct z_candidate
**, tree
, tree
, const VEC(tree
,gc
) *, size_t,
208 conversion
**, tree
, tree
, int, struct rejection_reason
*);
209 static tree
source_type (conversion
*);
210 static void add_warning (struct z_candidate
*, struct z_candidate
*);
211 static bool reference_compatible_p (tree
, tree
);
212 static conversion
*direct_reference_binding (tree
, conversion
*);
213 static bool promoted_arithmetic_type_p (tree
);
214 static conversion
*conditional_conversion (tree
, tree
, tsubst_flags_t
);
215 static char *name_as_c_string (tree
, tree
, bool *);
216 static tree
prep_operand (tree
);
217 static void add_candidates (tree
, tree
, const VEC(tree
,gc
) *, tree
, tree
, bool,
218 tree
, tree
, int, struct z_candidate
**,
220 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
221 static bool magic_varargs_p (tree
);
222 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
224 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
225 NAME can take many forms... */
228 check_dtor_name (tree basetype
, tree name
)
230 /* Just accept something we've already complained about. */
231 if (name
== error_mark_node
)
234 if (TREE_CODE (name
) == TYPE_DECL
)
235 name
= TREE_TYPE (name
);
236 else if (TYPE_P (name
))
238 else if (TREE_CODE (name
) == IDENTIFIER_NODE
)
240 if ((MAYBE_CLASS_TYPE_P (basetype
)
241 && name
== constructor_name (basetype
))
242 || (TREE_CODE (basetype
) == ENUMERAL_TYPE
243 && name
== TYPE_IDENTIFIER (basetype
)))
246 name
= get_type_value (name
);
252 template <class T> struct S { ~S(); };
256 NAME will be a class template. */
257 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
261 if (!name
|| name
== error_mark_node
)
263 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
266 /* We want the address of a function or method. We avoid creating a
267 pointer-to-member function. */
270 build_addr_func (tree function
, tsubst_flags_t complain
)
272 tree type
= TREE_TYPE (function
);
274 /* We have to do these by hand to avoid real pointer to member
276 if (TREE_CODE (type
) == METHOD_TYPE
)
278 if (TREE_CODE (function
) == OFFSET_REF
)
280 tree object
= build_address (TREE_OPERAND (function
, 0));
281 return get_member_function_from_ptrfunc (&object
,
282 TREE_OPERAND (function
, 1),
285 function
= build_address (function
);
288 function
= decay_conversion (function
, complain
);
293 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
294 POINTER_TYPE to those. Note, pointer to member function types
295 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
296 two variants. build_call_a is the primitive taking an array of
297 arguments, while build_call_n is a wrapper that handles varargs. */
300 build_call_n (tree function
, int n
, ...)
303 return build_call_a (function
, 0, NULL
);
306 tree
*argarray
= XALLOCAVEC (tree
, n
);
311 for (i
= 0; i
< n
; i
++)
312 argarray
[i
] = va_arg (ap
, tree
);
314 return build_call_a (function
, n
, argarray
);
318 /* Update various flags in cfun and the call itself based on what is being
319 called. Split out of build_call_a so that bot_manip can use it too. */
322 set_flags_from_callee (tree call
)
325 tree decl
= get_callee_fndecl (call
);
327 /* We check both the decl and the type; a function may be known not to
328 throw without being declared throw(). */
329 nothrow
= ((decl
&& TREE_NOTHROW (decl
))
330 || TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call
)))));
332 if (!nothrow
&& at_function_scope_p () && cfun
&& cp_function_chain
)
333 cp_function_chain
->can_throw
= 1;
335 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
336 current_function_returns_abnormally
= 1;
338 TREE_NOTHROW (call
) = nothrow
;
342 build_call_a (tree function
, int n
, tree
*argarray
)
349 function
= build_addr_func (function
, tf_warning_or_error
);
351 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
352 fntype
= TREE_TYPE (TREE_TYPE (function
));
353 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
354 || TREE_CODE (fntype
) == METHOD_TYPE
);
355 result_type
= TREE_TYPE (fntype
);
356 /* An rvalue has no cv-qualifiers. */
357 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
358 result_type
= cv_unqualified (result_type
);
360 function
= build_call_array_loc (input_location
,
361 result_type
, function
, n
, argarray
);
362 set_flags_from_callee (function
);
364 decl
= get_callee_fndecl (function
);
366 if (decl
&& !TREE_USED (decl
))
368 /* We invoke build_call directly for several library
369 functions. These may have been declared normally if
370 we're building libgcc, so we can't just check
372 gcc_assert (DECL_ARTIFICIAL (decl
)
373 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
378 if (decl
&& TREE_DEPRECATED (decl
))
379 warn_deprecated_use (decl
, NULL_TREE
);
380 require_complete_eh_spec_types (fntype
, decl
);
382 TREE_HAS_CONSTRUCTOR (function
) = (decl
&& DECL_CONSTRUCTOR_P (decl
));
384 /* Don't pass empty class objects by value. This is useful
385 for tags in STL, which are used to control overload resolution.
386 We don't need to handle other cases of copying empty classes. */
387 if (! decl
|| ! DECL_BUILT_IN (decl
))
388 for (i
= 0; i
< n
; i
++)
390 tree arg
= CALL_EXPR_ARG (function
, i
);
391 if (is_empty_class (TREE_TYPE (arg
))
392 && ! TREE_ADDRESSABLE (TREE_TYPE (arg
)))
394 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (arg
));
395 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (t
), arg
, t
);
396 CALL_EXPR_ARG (function
, i
) = arg
;
403 /* Build something of the form ptr->method (args)
404 or object.method (args). This can also build
405 calls to constructors, and find friends.
407 Member functions always take their class variable
410 INSTANCE is a class instance.
412 NAME is the name of the method desired, usually an IDENTIFIER_NODE.
414 PARMS help to figure out what that NAME really refers to.
416 BASETYPE_PATH, if non-NULL, contains a chain from the type of INSTANCE
417 down to the real instance type to use for access checking. We need this
418 information to get protected accesses correct.
420 FLAGS is the logical disjunction of zero or more LOOKUP_
421 flags. See cp-tree.h for more info.
423 If this is all OK, calls build_function_call with the resolved
426 This function must also handle being called to perform
427 initialization, promotion/coercion of arguments, and
428 instantiation of default parameters.
430 Note that NAME may refer to an instance variable name. If
431 `operator()()' is defined for the type of that field, then we return
434 /* New overloading code. */
436 typedef struct z_candidate z_candidate
;
438 typedef struct candidate_warning candidate_warning
;
439 struct candidate_warning
{
441 candidate_warning
*next
;
444 /* Information for providing diagnostics about why overloading failed. */
446 enum rejection_reason_code
{
449 rr_explicit_conversion
,
450 rr_template_conversion
,
452 rr_bad_arg_conversion
,
453 rr_template_unification
,
454 rr_template_instantiation
,
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
,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
;
525 struct rejection_reason
*reason
;
526 /* If FN is a member function, the binfo indicating the path used to
527 qualify the name of FN at the call site. This path is used to
528 determine whether or not FN is accessible if it is selected by
529 overload resolution. The DECL_CONTEXT of FN will always be a
530 (possibly improper) base of this binfo. */
532 /* If FN is a non-static member function, the binfo indicating the
533 subobject to which the `this' pointer should be converted if FN
534 is selected by overload resolution. The type pointed to by
535 the `this' pointer must correspond to the most derived class
536 indicated by the CONVERSION_PATH. */
537 tree conversion_path
;
540 candidate_warning
*warnings
;
544 /* Returns true iff T is a null pointer constant in the sense of
548 null_ptr_cst_p (tree t
)
552 A null pointer constant is an integral constant expression
553 (_expr.const_) rvalue of integer type that evaluates to zero or
554 an rvalue of type std::nullptr_t. */
555 if (NULLPTR_TYPE_P (TREE_TYPE (t
)))
557 if (CP_INTEGRAL_TYPE_P (TREE_TYPE (t
)))
559 /* Core issue 903 says only literal 0 is a null pointer constant. */
560 if (cxx_dialect
< cxx0x
)
561 t
= integral_constant_value (t
);
563 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
569 /* Returns true iff T is a null member pointer value (4.11). */
572 null_member_pointer_value_p (tree t
)
574 tree type
= TREE_TYPE (t
);
577 else if (TYPE_PTRMEMFUNC_P (type
))
578 return (TREE_CODE (t
) == CONSTRUCTOR
579 && integer_zerop (CONSTRUCTOR_ELT (t
, 0)->value
));
580 else if (TYPE_PTRDATAMEM_P (type
))
581 return integer_all_onesp (t
);
586 /* Returns nonzero if PARMLIST consists of only default parms,
587 ellipsis, and/or undeduced parameter packs. */
590 sufficient_parms_p (const_tree parmlist
)
592 for (; parmlist
&& parmlist
!= void_list_node
;
593 parmlist
= TREE_CHAIN (parmlist
))
594 if (!TREE_PURPOSE (parmlist
)
595 && !PACK_EXPANSION_P (TREE_VALUE (parmlist
)))
600 /* Allocate N bytes of memory from the conversion obstack. The memory
601 is zeroed before being returned. */
604 conversion_obstack_alloc (size_t n
)
607 if (!conversion_obstack_initialized
)
609 gcc_obstack_init (&conversion_obstack
);
610 conversion_obstack_initialized
= true;
612 p
= obstack_alloc (&conversion_obstack
, n
);
617 /* Allocate rejection reasons. */
619 static struct rejection_reason
*
620 alloc_rejection (enum rejection_reason_code code
)
622 struct rejection_reason
*p
;
623 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
628 static struct rejection_reason
*
629 arity_rejection (tree first_arg
, int expected
, int actual
)
631 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
632 int adjust
= first_arg
!= NULL_TREE
;
633 r
->u
.arity
.expected
= expected
- adjust
;
634 r
->u
.arity
.actual
= actual
- adjust
;
638 static struct rejection_reason
*
639 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
641 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
642 int adjust
= first_arg
!= NULL_TREE
;
643 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
644 r
->u
.conversion
.from_type
= from
;
645 r
->u
.conversion
.to_type
= to
;
649 static struct rejection_reason
*
650 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
652 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
653 int adjust
= first_arg
!= NULL_TREE
;
654 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
655 r
->u
.bad_conversion
.from_type
= from
;
656 r
->u
.bad_conversion
.to_type
= to
;
660 static struct rejection_reason
*
661 explicit_conversion_rejection (tree from
, tree to
)
663 struct rejection_reason
*r
= alloc_rejection (rr_explicit_conversion
);
664 r
->u
.conversion
.n_arg
= 0;
665 r
->u
.conversion
.from_type
= from
;
666 r
->u
.conversion
.to_type
= to
;
670 static struct rejection_reason
*
671 template_conversion_rejection (tree from
, tree to
)
673 struct rejection_reason
*r
= alloc_rejection (rr_template_conversion
);
674 r
->u
.conversion
.n_arg
= 0;
675 r
->u
.conversion
.from_type
= from
;
676 r
->u
.conversion
.to_type
= to
;
680 static struct rejection_reason
*
681 template_unification_rejection (tree tmpl
, tree explicit_targs
, tree targs
,
682 const tree
*args
, unsigned int nargs
,
683 tree return_type
, unification_kind_t strict
,
686 size_t args_n_bytes
= sizeof (*args
) * nargs
;
687 tree
*args1
= (tree
*) conversion_obstack_alloc (args_n_bytes
);
688 struct rejection_reason
*r
= alloc_rejection (rr_template_unification
);
689 r
->u
.template_unification
.tmpl
= tmpl
;
690 r
->u
.template_unification
.explicit_targs
= explicit_targs
;
691 r
->u
.template_unification
.targs
= targs
;
692 /* Copy args to our own storage. */
693 memcpy (args1
, args
, args_n_bytes
);
694 r
->u
.template_unification
.args
= args1
;
695 r
->u
.template_unification
.nargs
= nargs
;
696 r
->u
.template_unification
.return_type
= return_type
;
697 r
->u
.template_unification
.strict
= strict
;
698 r
->u
.template_unification
.flags
= flags
;
702 static struct rejection_reason
*
703 template_unification_error_rejection (void)
705 return alloc_rejection (rr_template_unification
);
708 static struct rejection_reason
*
709 template_instantiation_rejection (tree tmpl
, tree targs
)
711 struct rejection_reason
*r
= alloc_rejection (rr_template_instantiation
);
712 r
->u
.template_instantiation
.tmpl
= tmpl
;
713 r
->u
.template_instantiation
.targs
= targs
;
717 static struct rejection_reason
*
718 invalid_copy_with_fn_template_rejection (void)
720 struct rejection_reason
*r
= alloc_rejection (rr_invalid_copy
);
724 /* Dynamically allocate a conversion. */
727 alloc_conversion (conversion_kind kind
)
730 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
735 #ifdef ENABLE_CHECKING
737 /* Make sure that all memory on the conversion obstack has been
741 validate_conversion_obstack (void)
743 if (conversion_obstack_initialized
)
744 gcc_assert ((obstack_next_free (&conversion_obstack
)
745 == obstack_base (&conversion_obstack
)));
748 #endif /* ENABLE_CHECKING */
750 /* Dynamically allocate an array of N conversions. */
753 alloc_conversions (size_t n
)
755 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
759 build_conv (conversion_kind code
, tree type
, conversion
*from
)
762 conversion_rank rank
= CONVERSION_RANK (from
);
764 /* Note that the caller is responsible for filling in t->cand for
765 user-defined conversions. */
766 t
= alloc_conversion (code
);
789 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
790 t
->bad_p
= from
->bad_p
;
795 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
796 specialization of std::initializer_list<T>, if such a conversion is
800 build_list_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
802 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
803 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
804 conversion
**subconvs
= alloc_conversions (len
);
809 /* Within a list-initialization we can have more user-defined
811 flags
&= ~LOOKUP_NO_CONVERSION
;
812 /* But no narrowing conversions. */
813 flags
|= LOOKUP_NO_NARROWING
;
815 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
818 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
819 false, flags
, complain
);
826 t
= alloc_conversion (ck_list
);
828 t
->u
.list
= subconvs
;
831 for (i
= 0; i
< len
; ++i
)
833 conversion
*sub
= subconvs
[i
];
834 if (sub
->rank
> t
->rank
)
836 if (sub
->user_conv_p
)
837 t
->user_conv_p
= true;
845 /* Return the next conversion of the conversion chain (if applicable),
846 or NULL otherwise. Please use this function instead of directly
847 accessing fields of struct conversion. */
850 next_conversion (conversion
*conv
)
853 || conv
->kind
== ck_identity
854 || conv
->kind
== ck_ambig
855 || conv
->kind
== ck_list
)
860 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
861 is a valid aggregate initializer for array type ATYPE. */
864 can_convert_array (tree atype
, tree ctor
, int flags
, tsubst_flags_t complain
)
867 tree elttype
= TREE_TYPE (atype
);
868 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
870 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
872 if (TREE_CODE (elttype
) == ARRAY_TYPE
873 && TREE_CODE (val
) == CONSTRUCTOR
)
874 ok
= can_convert_array (elttype
, val
, flags
, complain
);
876 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
,
884 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
885 aggregate class, if such a conversion is possible. */
888 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
890 unsigned HOST_WIDE_INT i
= 0;
892 tree field
= next_initializable_field (TYPE_FIELDS (type
));
893 tree empty_ctor
= NULL_TREE
;
895 ctor
= reshape_init (type
, ctor
, tf_none
);
896 if (ctor
== error_mark_node
)
899 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
901 tree ftype
= TREE_TYPE (field
);
905 if (i
< CONSTRUCTOR_NELTS (ctor
))
906 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
909 if (empty_ctor
== NULL_TREE
)
910 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
915 if (TREE_CODE (ftype
) == ARRAY_TYPE
916 && TREE_CODE (val
) == CONSTRUCTOR
)
917 ok
= can_convert_array (ftype
, val
, flags
, complain
);
919 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
925 if (TREE_CODE (type
) == UNION_TYPE
)
929 if (i
< CONSTRUCTOR_NELTS (ctor
))
932 c
= alloc_conversion (ck_aggr
);
935 c
->user_conv_p
= 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 if (TYPE_DOMAIN (type
))
957 unsigned HOST_WIDE_INT alen
= tree_low_cst (array_type_nelts_top (type
), 1);
962 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
965 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
966 false, flags
, complain
);
970 if (sub
->rank
> rank
)
972 if (sub
->user_conv_p
)
978 c
= alloc_conversion (ck_aggr
);
981 c
->user_conv_p
= user
;
987 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
988 complex type, if such a conversion is possible. */
991 build_complex_conv (tree type
, tree ctor
, int flags
,
992 tsubst_flags_t complain
)
995 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
996 tree elttype
= TREE_TYPE (type
);
1001 enum conversion_rank rank
= cr_exact
;
1006 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1009 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1010 false, flags
, complain
);
1014 if (sub
->rank
> rank
)
1016 if (sub
->user_conv_p
)
1022 c
= alloc_conversion (ck_aggr
);
1025 c
->user_conv_p
= user
;
1031 /* Build a representation of the identity conversion from EXPR to
1032 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1035 build_identity_conv (tree type
, tree expr
)
1039 c
= alloc_conversion (ck_identity
);
1046 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1047 were multiple user-defined conversions to accomplish the job.
1048 Build a conversion that indicates that ambiguity. */
1051 build_ambiguous_conv (tree type
, tree expr
)
1055 c
= alloc_conversion (ck_ambig
);
1063 strip_top_quals (tree t
)
1065 if (TREE_CODE (t
) == ARRAY_TYPE
)
1067 return cp_build_qualified_type (t
, 0);
1070 /* Returns the standard conversion path (see [conv]) from type FROM to type
1071 TO, if any. For proper handling of null pointer constants, you must
1072 also pass the expression EXPR to convert from. If C_CAST_P is true,
1073 this conversion is coming from a C-style cast. */
1076 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1079 enum tree_code fcode
, tcode
;
1081 bool fromref
= false;
1084 to
= non_reference (to
);
1085 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1088 from
= TREE_TYPE (from
);
1091 to
= strip_top_quals (to
);
1092 from
= strip_top_quals (from
);
1094 if ((TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1095 && expr
&& type_unknown_p (expr
))
1097 tsubst_flags_t tflags
= tf_conv
;
1098 if (!(flags
& LOOKUP_PROTECT
))
1099 tflags
|= tf_no_access_control
;
1100 expr
= instantiate_type (to
, expr
, tflags
);
1101 if (expr
== error_mark_node
)
1103 from
= TREE_TYPE (expr
);
1106 fcode
= TREE_CODE (from
);
1107 tcode
= TREE_CODE (to
);
1109 conv
= build_identity_conv (from
, expr
);
1110 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1112 from
= type_decays_to (from
);
1113 fcode
= TREE_CODE (from
);
1114 conv
= build_conv (ck_lvalue
, from
, conv
);
1116 else if (fromref
|| (expr
&& lvalue_p (expr
)))
1121 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1124 from
= strip_top_quals (bitfield_type
);
1125 fcode
= TREE_CODE (from
);
1128 conv
= build_conv (ck_rvalue
, from
, conv
);
1129 if (flags
& LOOKUP_PREFER_RVALUE
)
1130 conv
->rvaluedness_matches_p
= true;
1133 /* Allow conversion between `__complex__' data types. */
1134 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1136 /* The standard conversion sequence to convert FROM to TO is
1137 the standard conversion sequence to perform componentwise
1139 conversion
*part_conv
= standard_conversion
1140 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
);
1144 conv
= build_conv (part_conv
->kind
, to
, conv
);
1145 conv
->rank
= part_conv
->rank
;
1153 if (same_type_p (from
, to
))
1155 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1156 conv
->type
= qualified_to
;
1161 A null pointer constant can be converted to a pointer type; ... A
1162 null pointer constant of integral type can be converted to an
1163 rvalue of type std::nullptr_t. */
1164 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1165 || NULLPTR_TYPE_P (to
))
1166 && expr
&& null_ptr_cst_p (expr
))
1167 conv
= build_conv (ck_std
, to
, conv
);
1168 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1169 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1171 /* For backwards brain damage compatibility, allow interconversion of
1172 pointers and integers with a pedwarn. */
1173 conv
= build_conv (ck_std
, to
, conv
);
1176 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1178 /* For backwards brain damage compatibility, allow interconversion of
1179 enums and integers with a pedwarn. */
1180 conv
= build_conv (ck_std
, to
, conv
);
1183 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1184 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1189 if (tcode
== POINTER_TYPE
1190 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from
),
1193 else if (VOID_TYPE_P (TREE_TYPE (to
))
1194 && !TYPE_PTRDATAMEM_P (from
)
1195 && TREE_CODE (TREE_TYPE (from
)) != FUNCTION_TYPE
)
1197 tree nfrom
= TREE_TYPE (from
);
1198 from
= build_pointer_type
1199 (cp_build_qualified_type (void_type_node
,
1200 cp_type_quals (nfrom
)));
1201 conv
= build_conv (ck_ptr
, from
, conv
);
1203 else if (TYPE_PTRDATAMEM_P (from
))
1205 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1206 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1208 if (DERIVED_FROM_P (fbase
, tbase
)
1209 && (same_type_ignoring_top_level_qualifiers_p
1210 (TYPE_PTRMEM_POINTED_TO_TYPE (from
),
1211 TYPE_PTRMEM_POINTED_TO_TYPE (to
))))
1213 from
= build_ptrmem_type (tbase
,
1214 TYPE_PTRMEM_POINTED_TO_TYPE (from
));
1215 conv
= build_conv (ck_pmem
, from
, conv
);
1217 else if (!same_type_p (fbase
, tbase
))
1220 else if (CLASS_TYPE_P (TREE_TYPE (from
))
1221 && CLASS_TYPE_P (TREE_TYPE (to
))
1224 An rvalue of type "pointer to cv D," where D is a
1225 class type, can be converted to an rvalue of type
1226 "pointer to cv B," where B is a base class (clause
1227 _class.derived_) of D. If B is an inaccessible
1228 (clause _class.access_) or ambiguous
1229 (_class.member.lookup_) base class of D, a program
1230 that necessitates this conversion is ill-formed.
1231 Therefore, we use DERIVED_FROM_P, and do not check
1232 access or uniqueness. */
1233 && DERIVED_FROM_P (TREE_TYPE (to
), TREE_TYPE (from
)))
1236 cp_build_qualified_type (TREE_TYPE (to
),
1237 cp_type_quals (TREE_TYPE (from
)));
1238 from
= build_pointer_type (from
);
1239 conv
= build_conv (ck_ptr
, from
, conv
);
1240 conv
->base_p
= true;
1243 if (tcode
== POINTER_TYPE
)
1245 to_pointee
= TREE_TYPE (to
);
1246 from_pointee
= TREE_TYPE (from
);
1250 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1251 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1254 if (same_type_p (from
, to
))
1256 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
1257 /* In a C-style cast, we ignore CV-qualification because we
1258 are allowed to perform a static_cast followed by a
1260 conv
= build_conv (ck_qual
, to
, conv
);
1261 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1262 conv
= build_conv (ck_qual
, to
, conv
);
1263 else if (expr
&& string_conv_p (to
, expr
, 0))
1264 /* converting from string constant to char *. */
1265 conv
= build_conv (ck_qual
, to
, conv
);
1266 /* Allow conversions among compatible ObjC pointer types (base
1267 conversions have been already handled above). */
1268 else if (c_dialect_objc ()
1269 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1270 conv
= build_conv (ck_ptr
, to
, conv
);
1271 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1273 conv
= build_conv (ck_ptr
, to
, conv
);
1281 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1283 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1284 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1285 tree fbase
= class_of_this_parm (fromfn
);
1286 tree tbase
= class_of_this_parm (tofn
);
1288 if (!DERIVED_FROM_P (fbase
, tbase
)
1289 || !same_type_p (static_fn_type (fromfn
),
1290 static_fn_type (tofn
)))
1293 from
= build_memfn_type (fromfn
, tbase
, cp_type_quals (tbase
));
1294 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1295 conv
= build_conv (ck_pmem
, from
, conv
);
1296 conv
->base_p
= true;
1298 else if (tcode
== BOOLEAN_TYPE
)
1302 An rvalue of arithmetic, unscoped enumeration, pointer, or
1303 pointer to member type can be converted to an rvalue of type
1304 bool. ... An rvalue of type std::nullptr_t can be converted
1305 to an rvalue of type bool; */
1306 if (ARITHMETIC_TYPE_P (from
)
1307 || UNSCOPED_ENUM_P (from
)
1308 || fcode
== POINTER_TYPE
1309 || TYPE_PTRMEM_P (from
)
1310 || NULLPTR_TYPE_P (from
))
1312 conv
= build_conv (ck_std
, to
, conv
);
1313 if (fcode
== POINTER_TYPE
1314 || TYPE_PTRDATAMEM_P (from
)
1315 || (TYPE_PTRMEMFUNC_P (from
)
1316 && conv
->rank
< cr_pbool
)
1317 || NULLPTR_TYPE_P (from
))
1318 conv
->rank
= cr_pbool
;
1324 /* We don't check for ENUMERAL_TYPE here because there are no standard
1325 conversions to enum type. */
1326 /* As an extension, allow conversion to complex type. */
1327 else if (ARITHMETIC_TYPE_P (to
))
1329 if (! (INTEGRAL_CODE_P (fcode
) || fcode
== REAL_TYPE
)
1330 || SCOPED_ENUM_P (from
))
1332 conv
= build_conv (ck_std
, to
, conv
);
1334 /* Give this a better rank if it's a promotion. */
1335 if (same_type_p (to
, type_promotes_to (from
))
1336 && next_conversion (conv
)->rank
<= cr_promotion
)
1337 conv
->rank
= cr_promotion
;
1339 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1340 && vector_types_convertible_p (from
, to
, false))
1341 return build_conv (ck_std
, to
, conv
);
1342 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1343 && is_properly_derived_from (from
, to
))
1345 if (conv
->kind
== ck_rvalue
)
1346 conv
= next_conversion (conv
);
1347 conv
= build_conv (ck_base
, to
, conv
);
1348 /* The derived-to-base conversion indicates the initialization
1349 of a parameter with base type from an object of a derived
1350 type. A temporary object is created to hold the result of
1351 the conversion unless we're binding directly to a reference. */
1352 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1357 if (flags
& LOOKUP_NO_NARROWING
)
1358 conv
->check_narrowing
= true;
1363 /* Returns nonzero if T1 is reference-related to T2. */
1366 reference_related_p (tree t1
, tree t2
)
1368 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1371 t1
= TYPE_MAIN_VARIANT (t1
);
1372 t2
= TYPE_MAIN_VARIANT (t2
);
1376 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1377 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1379 return (same_type_p (t1
, t2
)
1380 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1381 && DERIVED_FROM_P (t1
, t2
)));
1384 /* Returns nonzero if T1 is reference-compatible with T2. */
1387 reference_compatible_p (tree t1
, tree t2
)
1391 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
1392 reference-related to T2 and cv1 is the same cv-qualification as,
1393 or greater cv-qualification than, cv2. */
1394 return (reference_related_p (t1
, t2
)
1395 && at_least_as_qualified_p (t1
, t2
));
1398 /* A reference of the indicated TYPE is being bound directly to the
1399 expression represented by the implicit conversion sequence CONV.
1400 Return a conversion sequence for this binding. */
1403 direct_reference_binding (tree type
, conversion
*conv
)
1407 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
1408 gcc_assert (TREE_CODE (conv
->type
) != REFERENCE_TYPE
);
1410 t
= TREE_TYPE (type
);
1414 When a parameter of reference type binds directly
1415 (_dcl.init.ref_) to an argument expression, the implicit
1416 conversion sequence is the identity conversion, unless the
1417 argument expression has a type that is a derived class of the
1418 parameter type, in which case the implicit conversion sequence is
1419 a derived-to-base Conversion.
1421 If the parameter binds directly to the result of applying a
1422 conversion function to the argument expression, the implicit
1423 conversion sequence is a user-defined conversion sequence
1424 (_over.ics.user_), with the second standard conversion sequence
1425 either an identity conversion or, if the conversion function
1426 returns an entity of a type that is a derived class of the
1427 parameter type, a derived-to-base conversion. */
1428 if (!same_type_ignoring_top_level_qualifiers_p (t
, conv
->type
))
1430 /* Represent the derived-to-base conversion. */
1431 conv
= build_conv (ck_base
, t
, conv
);
1432 /* We will actually be binding to the base-class subobject in
1433 the derived class, so we mark this conversion appropriately.
1434 That way, convert_like knows not to generate a temporary. */
1435 conv
->need_temporary_p
= false;
1437 return build_conv (ck_ref_bind
, type
, conv
);
1440 /* Returns the conversion path from type FROM to reference type TO for
1441 purposes of reference binding. For lvalue binding, either pass a
1442 reference type to FROM or an lvalue expression to EXPR. If the
1443 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1444 the conversion returned. If C_CAST_P is true, this
1445 conversion is coming from a C-style cast. */
1448 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1449 tsubst_flags_t complain
)
1451 conversion
*conv
= NULL
;
1452 tree to
= TREE_TYPE (rto
);
1457 cp_lvalue_kind gl_kind
;
1460 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1462 expr
= instantiate_type (to
, expr
, tf_none
);
1463 if (expr
== error_mark_node
)
1465 from
= TREE_TYPE (expr
);
1468 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1470 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1471 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1473 if (!CLASS_TYPE_P (to
)
1474 && CONSTRUCTOR_NELTS (expr
) == 1)
1476 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1477 if (error_operand_p (expr
))
1479 from
= TREE_TYPE (expr
);
1483 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1485 from
= TREE_TYPE (from
);
1486 if (!TYPE_REF_IS_RVALUE (rfrom
)
1487 || TREE_CODE (from
) == FUNCTION_TYPE
)
1488 gl_kind
= clk_ordinary
;
1490 gl_kind
= clk_rvalueref
;
1494 gl_kind
= lvalue_kind (expr
);
1495 if (gl_kind
& clk_class
)
1496 /* A class prvalue is not a glvalue. */
1501 is_lvalue
= gl_kind
&& !(gl_kind
& clk_rvalueref
);
1504 if ((gl_kind
& clk_bitfield
) != 0)
1505 tfrom
= unlowered_expr_type (expr
);
1507 /* Figure out whether or not the types are reference-related and
1508 reference compatible. We have do do this after stripping
1509 references from FROM. */
1510 related_p
= reference_related_p (to
, tfrom
);
1511 /* If this is a C cast, first convert to an appropriately qualified
1512 type, so that we can later do a const_cast to the desired type. */
1513 if (related_p
&& c_cast_p
1514 && !at_least_as_qualified_p (to
, tfrom
))
1515 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1516 compatible_p
= reference_compatible_p (to
, tfrom
);
1518 /* Directly bind reference when target expression's type is compatible with
1519 the reference and expression is an lvalue. In DR391, the wording in
1520 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1521 const and rvalue references to rvalues of compatible class type.
1522 We should also do direct bindings for non-class xvalues. */
1525 || (((CP_TYPE_CONST_NON_VOLATILE_P (to
)
1526 && !(flags
& LOOKUP_NO_RVAL_BIND
))
1527 || TYPE_REF_IS_RVALUE (rto
))
1529 || (!(flags
& LOOKUP_NO_TEMP_BIND
)
1530 && (CLASS_TYPE_P (from
)
1531 || TREE_CODE (from
) == ARRAY_TYPE
))))))
1535 If the initializer expression
1537 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1538 is reference-compatible with "cv2 T2,"
1540 the reference is bound directly to the initializer expression
1544 If the initializer expression is an rvalue, with T2 a class type,
1545 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1546 is bound to the object represented by the rvalue or to a sub-object
1547 within that object. */
1549 conv
= build_identity_conv (tfrom
, expr
);
1550 conv
= direct_reference_binding (rto
, conv
);
1552 if (flags
& LOOKUP_PREFER_RVALUE
)
1553 /* The top-level caller requested that we pretend that the lvalue
1554 be treated as an rvalue. */
1555 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1556 else if (TREE_CODE (rfrom
) == REFERENCE_TYPE
)
1557 /* Handle rvalue reference to function properly. */
1558 conv
->rvaluedness_matches_p
1559 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1561 conv
->rvaluedness_matches_p
1562 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1564 if ((gl_kind
& clk_bitfield
) != 0
1565 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1566 /* For the purposes of overload resolution, we ignore the fact
1567 this expression is a bitfield or packed field. (In particular,
1568 [over.ics.ref] says specifically that a function with a
1569 non-const reference parameter is viable even if the
1570 argument is a bitfield.)
1572 However, when we actually call the function we must create
1573 a temporary to which to bind the reference. If the
1574 reference is volatile, or isn't const, then we cannot make
1575 a temporary, so we just issue an error when the conversion
1577 conv
->need_temporary_p
= true;
1579 /* Don't allow binding of lvalues (other than function lvalues) to
1580 rvalue references. */
1581 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1582 && TREE_CODE (to
) != FUNCTION_TYPE
1583 && !(flags
& LOOKUP_PREFER_RVALUE
))
1588 /* [class.conv.fct] A conversion function is never used to convert a
1589 (possibly cv-qualified) object to the (possibly cv-qualified) same
1590 object type (or a reference to it), to a (possibly cv-qualified) base
1591 class of that type (or a reference to it).... */
1592 else if (CLASS_TYPE_P (from
) && !related_p
1593 && !(flags
& LOOKUP_NO_CONVERSION
))
1597 If the initializer expression
1599 -- has a class type (i.e., T2 is a class type) can be
1600 implicitly converted to an lvalue of type "cv3 T3," where
1601 "cv1 T1" is reference-compatible with "cv3 T3". (this
1602 conversion is selected by enumerating the applicable
1603 conversion functions (_over.match.ref_) and choosing the
1604 best one through overload resolution. (_over.match_).
1606 the reference is bound to the lvalue result of the conversion
1607 in the second case. */
1608 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1611 return cand
->second_conv
;
1614 /* From this point on, we conceptually need temporaries, even if we
1615 elide them. Only the cases above are "direct bindings". */
1616 if (flags
& LOOKUP_NO_TEMP_BIND
)
1621 When a parameter of reference type is not bound directly to an
1622 argument expression, the conversion sequence is the one required
1623 to convert the argument expression to the underlying type of the
1624 reference according to _over.best.ics_. Conceptually, this
1625 conversion sequence corresponds to copy-initializing a temporary
1626 of the underlying type with the argument expression. Any
1627 difference in top-level cv-qualification is subsumed by the
1628 initialization itself and does not constitute a conversion. */
1632 Otherwise, the reference shall be to a non-volatile const type.
1634 Under C++0x, [8.5.3/5 dcl.init.ref] it may also be an rvalue reference */
1635 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1640 Otherwise, a temporary of type "cv1 T1" is created and
1641 initialized from the initializer expression using the rules for a
1642 non-reference copy initialization. If T1 is reference-related to
1643 T2, cv1 must be the same cv-qualification as, or greater
1644 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1645 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1648 /* We're generating a temporary now, but don't bind any more in the
1649 conversion (specifically, don't slice the temporary returned by a
1650 conversion operator). */
1651 flags
|= LOOKUP_NO_TEMP_BIND
;
1653 /* Core issue 899: When [copy-]initializing a temporary to be bound
1654 to the first parameter of a copy constructor (12.8) called with
1655 a single argument in the context of direct-initialization,
1656 explicit conversion functions are also considered.
1658 So don't set LOOKUP_ONLYCONVERTING in that case. */
1659 if (!(flags
& LOOKUP_COPY_PARM
))
1660 flags
|= LOOKUP_ONLYCONVERTING
;
1663 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1668 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1669 /* This reference binding, unlike those above, requires the
1670 creation of a temporary. */
1671 conv
->need_temporary_p
= true;
1672 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1677 /* Returns the implicit conversion sequence (see [over.ics]) from type
1678 FROM to type TO. The optional expression EXPR may affect the
1679 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1680 true, this conversion is coming from a C-style cast. */
1683 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1684 int flags
, tsubst_flags_t complain
)
1688 if (from
== error_mark_node
|| to
== error_mark_node
1689 || expr
== error_mark_node
)
1692 /* Other flags only apply to the primary function in overload
1693 resolution, or after we've chosen one. */
1694 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1695 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1696 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
);
1698 /* FIXME: actually we don't want warnings either, but we can't just
1699 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1700 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1701 We really ought not to issue that warning until we've committed
1702 to that conversion. */
1703 complain
&= ~tf_error
;
1705 if (TREE_CODE (to
) == REFERENCE_TYPE
)
1706 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1708 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
);
1713 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1715 if (is_std_init_list (to
))
1716 return build_list_conv (to
, expr
, flags
, complain
);
1718 /* As an extension, allow list-initialization of _Complex. */
1719 if (TREE_CODE (to
) == COMPLEX_TYPE
)
1721 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1726 /* Allow conversion from an initializer-list with one element to a
1728 if (SCALAR_TYPE_P (to
))
1730 int nelts
= CONSTRUCTOR_NELTS (expr
);
1734 elt
= build_value_init (to
, tf_none
);
1735 else if (nelts
== 1)
1736 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1738 elt
= error_mark_node
;
1740 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1741 c_cast_p
, flags
, complain
);
1744 conv
->check_narrowing
= true;
1745 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1746 /* Too many levels of braces, i.e. '{{1}}'. */
1751 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1752 return build_array_conv (to
, expr
, flags
, complain
);
1755 if (expr
!= NULL_TREE
1756 && (MAYBE_CLASS_TYPE_P (from
)
1757 || MAYBE_CLASS_TYPE_P (to
))
1758 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1760 struct z_candidate
*cand
;
1762 if (CLASS_TYPE_P (to
)
1763 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
1764 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
1765 return build_aggr_conv (to
, expr
, flags
, complain
);
1767 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
1769 conv
= cand
->second_conv
;
1771 /* We used to try to bind a reference to a temporary here, but that
1772 is now handled after the recursive call to this function at the end
1773 of reference_binding. */
1780 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1781 functions. ARGS will not be changed until a single candidate is
1784 static struct z_candidate
*
1785 add_candidate (struct z_candidate
**candidates
,
1786 tree fn
, tree first_arg
, const VEC(tree
,gc
) *args
,
1787 size_t num_convs
, conversion
**convs
,
1788 tree access_path
, tree conversion_path
,
1789 int viable
, struct rejection_reason
*reason
)
1791 struct z_candidate
*cand
= (struct z_candidate
*)
1792 conversion_obstack_alloc (sizeof (struct z_candidate
));
1795 cand
->first_arg
= first_arg
;
1797 cand
->convs
= convs
;
1798 cand
->num_convs
= num_convs
;
1799 cand
->access_path
= access_path
;
1800 cand
->conversion_path
= conversion_path
;
1801 cand
->viable
= viable
;
1802 cand
->reason
= reason
;
1803 cand
->next
= *candidates
;
1809 /* Return the number of remaining arguments in the parameter list
1810 beginning with ARG. */
1813 remaining_arguments (tree arg
)
1817 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
1818 arg
= TREE_CHAIN (arg
))
1824 /* Create an overload candidate for the function or method FN called
1825 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1826 FLAGS is passed on to implicit_conversion.
1828 This does not change ARGS.
1830 CTYPE, if non-NULL, is the type we want to pretend this function
1831 comes from for purposes of overload resolution. */
1833 static struct z_candidate
*
1834 add_function_candidate (struct z_candidate
**candidates
,
1835 tree fn
, tree ctype
, tree first_arg
,
1836 const VEC(tree
,gc
) *args
, tree access_path
,
1837 tree conversion_path
, int flags
,
1838 tsubst_flags_t complain
)
1840 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1844 tree orig_first_arg
= first_arg
;
1847 struct rejection_reason
*reason
= NULL
;
1849 /* At this point we should not see any functions which haven't been
1850 explicitly declared, except for friend functions which will have
1851 been found using argument dependent lookup. */
1852 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
1854 /* The `this', `in_chrg' and VTT arguments to constructors are not
1855 considered in overload resolution. */
1856 if (DECL_CONSTRUCTOR_P (fn
))
1858 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
1859 skip
= num_artificial_parms_for (fn
);
1860 if (skip
> 0 && first_arg
!= NULL_TREE
)
1863 first_arg
= NULL_TREE
;
1869 len
= VEC_length (tree
, args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
1870 convs
= alloc_conversions (len
);
1872 /* 13.3.2 - Viable functions [over.match.viable]
1873 First, to be a viable function, a candidate function shall have enough
1874 parameters to agree in number with the arguments in the list.
1876 We need to check this first; otherwise, checking the ICSes might cause
1877 us to produce an ill-formed template instantiation. */
1879 parmnode
= parmlist
;
1880 for (i
= 0; i
< len
; ++i
)
1882 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
1884 parmnode
= TREE_CHAIN (parmnode
);
1887 if ((i
< len
&& parmnode
)
1888 || !sufficient_parms_p (parmnode
))
1890 int remaining
= remaining_arguments (parmnode
);
1892 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
1894 /* When looking for a function from a subobject from an implicit
1895 copy/move constructor/operator=, don't consider anything that takes (a
1896 reference to) an unrelated type. See c++/44909 and core 1092. */
1897 else if (parmlist
&& (flags
& LOOKUP_DEFAULTED
))
1899 if (DECL_CONSTRUCTOR_P (fn
))
1901 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
1902 && DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
)
1908 parmnode
= chain_index (i
-1, parmlist
);
1909 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
1914 /* This only applies at the top level. */
1915 flags
&= ~LOOKUP_DEFAULTED
;
1921 /* Second, for F to be a viable function, there shall exist for each
1922 argument an implicit conversion sequence that converts that argument
1923 to the corresponding parameter of F. */
1925 parmnode
= parmlist
;
1927 for (i
= 0; i
< len
; ++i
)
1929 tree arg
, argtype
, to_type
;
1933 if (parmnode
== void_list_node
)
1936 if (i
== 0 && first_arg
!= NULL_TREE
)
1939 arg
= VEC_index (tree
, args
,
1940 i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0));
1941 argtype
= lvalue_type (arg
);
1943 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1944 && ! DECL_CONSTRUCTOR_P (fn
));
1948 tree parmtype
= TREE_VALUE (parmnode
);
1951 parmnode
= TREE_CHAIN (parmnode
);
1953 /* The type of the implicit object parameter ('this') for
1954 overload resolution is not always the same as for the
1955 function itself; conversion functions are considered to
1956 be members of the class being converted, and functions
1957 introduced by a using-declaration are considered to be
1958 members of the class that uses them.
1960 Since build_over_call ignores the ICS for the `this'
1961 parameter, we can just change the parm type. */
1962 if (ctype
&& is_this
)
1964 parmtype
= cp_build_qualified_type
1965 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
1966 parmtype
= build_pointer_type (parmtype
);
1969 /* Core issue 899: When [copy-]initializing a temporary to be bound
1970 to the first parameter of a copy constructor (12.8) called with
1971 a single argument in the context of direct-initialization,
1972 explicit conversion functions are also considered.
1974 So set LOOKUP_COPY_PARM to let reference_binding know that
1975 it's being called in that context. We generalize the above
1976 to handle move constructors and template constructors as well;
1977 the standardese should soon be updated similarly. */
1978 if (ctype
&& i
== 0 && (len
-skip
== 1)
1979 && DECL_CONSTRUCTOR_P (fn
)
1980 && parmtype
!= error_mark_node
1981 && (same_type_ignoring_top_level_qualifiers_p
1982 (non_reference (parmtype
), ctype
)))
1984 if (!(flags
& LOOKUP_ONLYCONVERTING
))
1985 lflags
|= LOOKUP_COPY_PARM
;
1986 /* We allow user-defined conversions within init-lists, but
1987 don't list-initialize the copy parm, as that would mean
1988 using two levels of braces for the same type. */
1989 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
1990 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
1991 lflags
|= LOOKUP_NO_CONVERSION
;
1994 lflags
|= LOOKUP_ONLYCONVERTING
;
1996 t
= implicit_conversion (parmtype
, argtype
, arg
,
1997 /*c_cast_p=*/false, lflags
, complain
);
2002 t
= build_identity_conv (argtype
, arg
);
2003 t
->ellipsis_p
= true;
2014 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
);
2021 reason
= bad_arg_conversion_rejection (first_arg
, i
, argtype
, to_type
);
2026 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2027 access_path
, conversion_path
, viable
, reason
);
2030 /* Create an overload candidate for the conversion function FN which will
2031 be invoked for expression OBJ, producing a pointer-to-function which
2032 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2033 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2034 passed on to implicit_conversion.
2036 Actually, we don't really care about FN; we care about the type it
2037 converts to. There may be multiple conversion functions that will
2038 convert to that type, and we rely on build_user_type_conversion_1 to
2039 choose the best one; so when we create our candidate, we record the type
2040 instead of the function. */
2042 static struct z_candidate
*
2043 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2044 tree first_arg
, const VEC(tree
,gc
) *arglist
,
2045 tree access_path
, tree conversion_path
,
2046 tsubst_flags_t complain
)
2048 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2049 int i
, len
, viable
, flags
;
2050 tree parmlist
, parmnode
;
2052 struct rejection_reason
*reason
;
2054 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2055 parmlist
= TREE_TYPE (parmlist
);
2056 parmlist
= TYPE_ARG_TYPES (parmlist
);
2058 len
= VEC_length (tree
, arglist
) + (first_arg
!= NULL_TREE
? 1 : 0) + 1;
2059 convs
= alloc_conversions (len
);
2060 parmnode
= parmlist
;
2062 flags
= LOOKUP_IMPLICIT
;
2065 /* Don't bother looking up the same type twice. */
2066 if (*candidates
&& (*candidates
)->fn
== totype
)
2069 for (i
= 0; i
< len
; ++i
)
2071 tree arg
, argtype
, convert_type
= NULL_TREE
;
2076 else if (i
== 1 && first_arg
!= NULL_TREE
)
2079 arg
= VEC_index (tree
, arglist
,
2080 i
- (first_arg
!= NULL_TREE
? 1 : 0) - 1);
2081 argtype
= lvalue_type (arg
);
2085 t
= implicit_conversion (totype
, argtype
, arg
, /*c_cast_p=*/false,
2087 convert_type
= totype
;
2089 else if (parmnode
== void_list_node
)
2093 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2094 /*c_cast_p=*/false, flags
, complain
);
2095 convert_type
= TREE_VALUE (parmnode
);
2099 t
= build_identity_conv (argtype
, arg
);
2100 t
->ellipsis_p
= true;
2101 convert_type
= argtype
;
2111 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, argtype
, convert_type
);
2118 parmnode
= TREE_CHAIN (parmnode
);
2122 || ! sufficient_parms_p (parmnode
))
2124 int remaining
= remaining_arguments (parmnode
);
2126 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2129 return add_candidate (candidates
, totype
, first_arg
, arglist
, len
, convs
,
2130 access_path
, conversion_path
, viable
, reason
);
2134 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2135 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2136 int flags
, tsubst_flags_t complain
)
2143 struct rejection_reason
*reason
= NULL
;
2148 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2149 convs
= alloc_conversions (num_convs
);
2151 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2152 conversion ops are allowed. We handle that here by just checking for
2153 boolean_type_node because other operators don't ask for it. COND_EXPR
2154 also does contextual conversion to bool for the first operand, but we
2155 handle that in build_conditional_expr, and type1 here is operand 2. */
2156 if (type1
!= boolean_type_node
)
2157 flags
|= LOOKUP_ONLYCONVERTING
;
2159 for (i
= 0; i
< 2; ++i
)
2164 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2165 /*c_cast_p=*/false, flags
, complain
);
2169 /* We need something for printing the candidate. */
2170 t
= build_identity_conv (types
[i
], NULL_TREE
);
2171 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2177 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2183 /* For COND_EXPR we rearranged the arguments; undo that now. */
2186 convs
[2] = convs
[1];
2187 convs
[1] = convs
[0];
2188 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2189 /*c_cast_p=*/false, flags
,
2196 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2201 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2203 /*access_path=*/NULL_TREE
,
2204 /*conversion_path=*/NULL_TREE
,
2209 is_complete (tree t
)
2211 return COMPLETE_TYPE_P (complete_type (t
));
2214 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2217 promoted_arithmetic_type_p (tree type
)
2221 In this section, the term promoted integral type is used to refer
2222 to those integral types which are preserved by integral promotion
2223 (including e.g. int and long but excluding e.g. char).
2224 Similarly, the term promoted arithmetic type refers to promoted
2225 integral types plus floating types. */
2226 return ((CP_INTEGRAL_TYPE_P (type
)
2227 && same_type_p (type_promotes_to (type
), type
))
2228 || TREE_CODE (type
) == REAL_TYPE
);
2231 /* Create any builtin operator overload candidates for the operator in
2232 question given the converted operand types TYPE1 and TYPE2. The other
2233 args are passed through from add_builtin_candidates to
2234 build_builtin_candidate.
2236 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2237 If CODE is requires candidates operands of the same type of the kind
2238 of which TYPE1 and TYPE2 are, we add both candidates
2239 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2242 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2243 enum tree_code code2
, tree fnname
, tree type1
,
2244 tree type2
, tree
*args
, tree
*argtypes
, int flags
,
2245 tsubst_flags_t complain
)
2249 case POSTINCREMENT_EXPR
:
2250 case POSTDECREMENT_EXPR
:
2251 args
[1] = integer_zero_node
;
2252 type2
= integer_type_node
;
2261 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2262 and VQ is either volatile or empty, there exist candidate operator
2263 functions of the form
2264 VQ T& operator++(VQ T&);
2265 T operator++(VQ T&, int);
2266 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2267 type other than bool, and VQ is either volatile or empty, there exist
2268 candidate operator functions of the form
2269 VQ T& operator--(VQ T&);
2270 T operator--(VQ T&, int);
2271 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2272 complete object type, and VQ is either volatile or empty, there exist
2273 candidate operator functions of the form
2274 T*VQ& operator++(T*VQ&);
2275 T*VQ& operator--(T*VQ&);
2276 T* operator++(T*VQ&, int);
2277 T* operator--(T*VQ&, int); */
2279 case POSTDECREMENT_EXPR
:
2280 case PREDECREMENT_EXPR
:
2281 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2283 case POSTINCREMENT_EXPR
:
2284 case PREINCREMENT_EXPR
:
2285 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2287 type1
= build_reference_type (type1
);
2292 /* 7 For every cv-qualified or cv-unqualified object type T, there
2293 exist candidate operator functions of the form
2297 8 For every function type T, there exist candidate operator functions of
2299 T& operator*(T*); */
2302 if (TREE_CODE (type1
) == POINTER_TYPE
2303 && !uses_template_parms (TREE_TYPE (type1
))
2304 && (TYPE_PTROB_P (type1
)
2305 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2309 /* 9 For every type T, there exist candidate operator functions of the form
2312 10For every promoted arithmetic type T, there exist candidate operator
2313 functions of the form
2317 case UNARY_PLUS_EXPR
: /* unary + */
2318 if (TREE_CODE (type1
) == POINTER_TYPE
)
2321 if (ARITHMETIC_TYPE_P (type1
))
2325 /* 11For every promoted integral type T, there exist candidate operator
2326 functions of the form
2330 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2334 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2335 is the same type as C2 or is a derived class of C2, T is a complete
2336 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2337 there exist candidate operator functions of the form
2338 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2339 where CV12 is the union of CV1 and CV2. */
2342 if (TREE_CODE (type1
) == POINTER_TYPE
2343 && TYPE_PTRMEM_P (type2
))
2345 tree c1
= TREE_TYPE (type1
);
2346 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2348 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2349 && (TYPE_PTRMEMFUNC_P (type2
)
2350 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2355 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2356 didate operator functions of the form
2361 bool operator<(L, R);
2362 bool operator>(L, R);
2363 bool operator<=(L, R);
2364 bool operator>=(L, R);
2365 bool operator==(L, R);
2366 bool operator!=(L, R);
2367 where LR is the result of the usual arithmetic conversions between
2370 14For every pair of types T and I, where T is a cv-qualified or cv-
2371 unqualified complete object type and I is a promoted integral type,
2372 there exist candidate operator functions of the form
2373 T* operator+(T*, I);
2374 T& operator[](T*, I);
2375 T* operator-(T*, I);
2376 T* operator+(I, T*);
2377 T& operator[](I, T*);
2379 15For every T, where T is a pointer to complete object type, there exist
2380 candidate operator functions of the form112)
2381 ptrdiff_t operator-(T, T);
2383 16For every pointer or enumeration type T, there exist candidate operator
2384 functions of the form
2385 bool operator<(T, T);
2386 bool operator>(T, T);
2387 bool operator<=(T, T);
2388 bool operator>=(T, T);
2389 bool operator==(T, T);
2390 bool operator!=(T, T);
2392 17For every pointer to member type T, there exist candidate operator
2393 functions of the form
2394 bool operator==(T, T);
2395 bool operator!=(T, T); */
2398 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2400 if (TYPE_PTROB_P (type1
)
2401 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2403 type2
= ptrdiff_type_node
;
2407 case TRUNC_DIV_EXPR
:
2408 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2414 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2415 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2417 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2422 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2434 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2436 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2438 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2439 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2441 if (TYPE_PTR_P (type1
)
2442 && null_ptr_cst_p (args
[1])
2443 && !uses_template_parms (type1
))
2448 if (null_ptr_cst_p (args
[0])
2449 && TYPE_PTR_P (type2
)
2450 && !uses_template_parms (type2
))
2458 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2461 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2463 type1
= ptrdiff_type_node
;
2466 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2468 type2
= ptrdiff_type_node
;
2473 /* 18For every pair of promoted integral types L and R, there exist candi-
2474 date operator functions of the form
2481 where LR is the result of the usual arithmetic conversions between
2484 case TRUNC_MOD_EXPR
:
2490 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2494 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2495 type, VQ is either volatile or empty, and R is a promoted arithmetic
2496 type, there exist candidate operator functions of the form
2497 VQ L& operator=(VQ L&, R);
2498 VQ L& operator*=(VQ L&, R);
2499 VQ L& operator/=(VQ L&, R);
2500 VQ L& operator+=(VQ L&, R);
2501 VQ L& operator-=(VQ L&, R);
2503 20For every pair T, VQ), where T is any type and VQ is either volatile
2504 or empty, there exist candidate operator functions of the form
2505 T*VQ& operator=(T*VQ&, T*);
2507 21For every pair T, VQ), where T is a pointer to member type and VQ is
2508 either volatile or empty, there exist candidate operator functions of
2510 VQ T& operator=(VQ T&, T);
2512 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2513 unqualified complete object type, VQ is either volatile or empty, and
2514 I is a promoted integral type, there exist candidate operator func-
2516 T*VQ& operator+=(T*VQ&, I);
2517 T*VQ& operator-=(T*VQ&, I);
2519 23For every triple L, VQ, R), where L is an integral or enumeration
2520 type, VQ is either volatile or empty, and R is a promoted integral
2521 type, there exist candidate operator functions of the form
2523 VQ L& operator%=(VQ L&, R);
2524 VQ L& operator<<=(VQ L&, R);
2525 VQ L& operator>>=(VQ L&, R);
2526 VQ L& operator&=(VQ L&, R);
2527 VQ L& operator^=(VQ L&, R);
2528 VQ L& operator|=(VQ L&, R); */
2535 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2537 type2
= ptrdiff_type_node
;
2541 case TRUNC_DIV_EXPR
:
2542 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2546 case TRUNC_MOD_EXPR
:
2552 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2557 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2559 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2560 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2561 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2562 || ((TYPE_PTRMEMFUNC_P (type1
)
2563 || TREE_CODE (type1
) == POINTER_TYPE
)
2564 && null_ptr_cst_p (args
[1])))
2574 type1
= build_reference_type (type1
);
2580 For every pair of promoted arithmetic types L and R, there
2581 exist candidate operator functions of the form
2583 LR operator?(bool, L, R);
2585 where LR is the result of the usual arithmetic conversions
2586 between types L and R.
2588 For every type T, where T is a pointer or pointer-to-member
2589 type, there exist candidate operator functions of the form T
2590 operator?(bool, T, T); */
2592 if (promoted_arithmetic_type_p (type1
)
2593 && promoted_arithmetic_type_p (type2
))
2597 /* Otherwise, the types should be pointers. */
2598 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2601 /* We don't check that the two types are the same; the logic
2602 below will actually create two candidates; one in which both
2603 parameter types are TYPE1, and one in which both parameter
2609 if (ARITHMETIC_TYPE_P (type1
))
2617 /* If we're dealing with two pointer types or two enumeral types,
2618 we need candidates for both of them. */
2619 if (type2
&& !same_type_p (type1
, type2
)
2620 && TREE_CODE (type1
) == TREE_CODE (type2
)
2621 && (TREE_CODE (type1
) == REFERENCE_TYPE
2622 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2623 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2624 || TYPE_PTRMEMFUNC_P (type1
)
2625 || MAYBE_CLASS_TYPE_P (type1
)
2626 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2628 if (TYPE_PTR_OR_PTRMEM_P (type1
))
2630 tree cptype
= composite_pointer_type (type1
, type2
,
2635 if (cptype
!= error_mark_node
)
2637 build_builtin_candidate
2638 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
2644 build_builtin_candidate
2645 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
2646 build_builtin_candidate
2647 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
2651 build_builtin_candidate
2652 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
2656 type_decays_to (tree type
)
2658 if (TREE_CODE (type
) == ARRAY_TYPE
)
2659 return build_pointer_type (TREE_TYPE (type
));
2660 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2661 return build_pointer_type (type
);
2665 /* There are three conditions of builtin candidates:
2667 1) bool-taking candidates. These are the same regardless of the input.
2668 2) pointer-pair taking candidates. These are generated for each type
2669 one of the input types converts to.
2670 3) arithmetic candidates. According to the standard, we should generate
2671 all of these, but I'm trying not to...
2673 Here we generate a superset of the possible candidates for this particular
2674 case. That is a subset of the full set the standard defines, plus some
2675 other cases which the standard disallows. add_builtin_candidate will
2676 filter out the invalid set. */
2679 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2680 enum tree_code code2
, tree fnname
, tree
*args
,
2681 int flags
, tsubst_flags_t complain
)
2685 tree type
, argtypes
[3], t
;
2686 /* TYPES[i] is the set of possible builtin-operator parameter types
2687 we will consider for the Ith argument. */
2688 VEC(tree
,gc
) *types
[2];
2691 for (i
= 0; i
< 3; ++i
)
2694 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2696 argtypes
[i
] = NULL_TREE
;
2701 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2702 and VQ is either volatile or empty, there exist candidate operator
2703 functions of the form
2704 VQ T& operator++(VQ T&); */
2706 case POSTINCREMENT_EXPR
:
2707 case PREINCREMENT_EXPR
:
2708 case POSTDECREMENT_EXPR
:
2709 case PREDECREMENT_EXPR
:
2714 /* 24There also exist candidate operator functions of the form
2715 bool operator!(bool);
2716 bool operator&&(bool, bool);
2717 bool operator||(bool, bool); */
2719 case TRUTH_NOT_EXPR
:
2720 build_builtin_candidate
2721 (candidates
, fnname
, boolean_type_node
,
2722 NULL_TREE
, args
, argtypes
, flags
, complain
);
2725 case TRUTH_ORIF_EXPR
:
2726 case TRUTH_ANDIF_EXPR
:
2727 build_builtin_candidate
2728 (candidates
, fnname
, boolean_type_node
,
2729 boolean_type_node
, args
, argtypes
, flags
, complain
);
2751 types
[0] = make_tree_vector ();
2752 types
[1] = make_tree_vector ();
2754 for (i
= 0; i
< 2; ++i
)
2758 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
2762 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
2765 convs
= lookup_conversions (argtypes
[i
]);
2767 if (code
== COND_EXPR
)
2769 if (real_lvalue_p (args
[i
]))
2770 VEC_safe_push (tree
, gc
, types
[i
],
2771 build_reference_type (argtypes
[i
]));
2773 VEC_safe_push (tree
, gc
, types
[i
],
2774 TYPE_MAIN_VARIANT (argtypes
[i
]));
2780 for (; convs
; convs
= TREE_CHAIN (convs
))
2782 type
= TREE_TYPE (convs
);
2785 && (TREE_CODE (type
) != REFERENCE_TYPE
2786 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
2789 if (code
== COND_EXPR
&& TREE_CODE (type
) == REFERENCE_TYPE
)
2790 VEC_safe_push (tree
, gc
, types
[i
], type
);
2792 type
= non_reference (type
);
2793 if (i
!= 0 || ! ref1
)
2795 type
= cv_unqualified (type_decays_to (type
));
2796 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
2797 VEC_safe_push (tree
, gc
, types
[i
], type
);
2798 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2799 type
= type_promotes_to (type
);
2802 if (! vec_member (type
, types
[i
]))
2803 VEC_safe_push (tree
, gc
, types
[i
], type
);
2808 if (code
== COND_EXPR
&& real_lvalue_p (args
[i
]))
2809 VEC_safe_push (tree
, gc
, types
[i
],
2810 build_reference_type (argtypes
[i
]));
2811 type
= non_reference (argtypes
[i
]);
2812 if (i
!= 0 || ! ref1
)
2814 type
= cv_unqualified (type_decays_to (type
));
2815 if (enum_p
&& UNSCOPED_ENUM_P (type
))
2816 VEC_safe_push (tree
, gc
, types
[i
], type
);
2817 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2818 type
= type_promotes_to (type
);
2820 VEC_safe_push (tree
, gc
, types
[i
], type
);
2824 /* Run through the possible parameter types of both arguments,
2825 creating candidates with those parameter types. */
2826 FOR_EACH_VEC_ELT_REVERSE (tree
, types
[0], ix
, t
)
2831 if (!VEC_empty (tree
, types
[1]))
2832 FOR_EACH_VEC_ELT_REVERSE (tree
, types
[1], jx
, u
)
2833 add_builtin_candidate
2834 (candidates
, code
, code2
, fnname
, t
,
2835 u
, args
, argtypes
, flags
, complain
);
2837 add_builtin_candidate
2838 (candidates
, code
, code2
, fnname
, t
,
2839 NULL_TREE
, args
, argtypes
, flags
, complain
);
2842 release_tree_vector (types
[0]);
2843 release_tree_vector (types
[1]);
2847 /* If TMPL can be successfully instantiated as indicated by
2848 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2850 TMPL is the template. EXPLICIT_TARGS are any explicit template
2851 arguments. ARGLIST is the arguments provided at the call-site.
2852 This does not change ARGLIST. The RETURN_TYPE is the desired type
2853 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
2854 as for add_function_candidate. If an OBJ is supplied, FLAGS and
2855 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
2857 static struct z_candidate
*
2858 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
2859 tree ctype
, tree explicit_targs
, tree first_arg
,
2860 const VEC(tree
,gc
) *arglist
, tree return_type
,
2861 tree access_path
, tree conversion_path
,
2862 int flags
, tree obj
, unification_kind_t strict
,
2863 tsubst_flags_t complain
)
2865 int ntparms
= DECL_NTPARMS (tmpl
);
2866 tree targs
= make_tree_vec (ntparms
);
2867 unsigned int len
= VEC_length (tree
, arglist
);
2868 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
2869 unsigned int skip_without_in_chrg
= 0;
2870 tree first_arg_without_in_chrg
= first_arg
;
2871 tree
*args_without_in_chrg
;
2872 unsigned int nargs_without_in_chrg
;
2873 unsigned int ia
, ix
;
2875 struct z_candidate
*cand
;
2878 struct rejection_reason
*reason
= NULL
;
2881 /* We don't do deduction on the in-charge parameter, the VTT
2882 parameter or 'this'. */
2883 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
2885 if (first_arg_without_in_chrg
!= NULL_TREE
)
2886 first_arg_without_in_chrg
= NULL_TREE
;
2888 ++skip_without_in_chrg
;
2891 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
2892 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
2893 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
2895 if (first_arg_without_in_chrg
!= NULL_TREE
)
2896 first_arg_without_in_chrg
= NULL_TREE
;
2898 ++skip_without_in_chrg
;
2901 if (len
< skip_without_in_chrg
)
2904 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
2905 + (len
- skip_without_in_chrg
));
2906 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
2908 if (first_arg_without_in_chrg
!= NULL_TREE
)
2910 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
2913 for (ix
= skip_without_in_chrg
;
2914 VEC_iterate (tree
, arglist
, ix
, arg
);
2917 args_without_in_chrg
[ia
] = arg
;
2920 gcc_assert (ia
== nargs_without_in_chrg
);
2922 errs
= errorcount
+sorrycount
;
2923 i
= fn_type_unification (tmpl
, explicit_targs
, targs
,
2924 args_without_in_chrg
,
2925 nargs_without_in_chrg
,
2926 return_type
, strict
, flags
, false);
2930 /* Don't repeat unification later if it already resulted in errors. */
2931 if (errorcount
+sorrycount
== errs
)
2932 reason
= template_unification_rejection (tmpl
, explicit_targs
,
2933 targs
, args_without_in_chrg
,
2934 nargs_without_in_chrg
,
2935 return_type
, strict
, flags
);
2937 reason
= template_unification_error_rejection ();
2941 fn
= instantiate_template (tmpl
, targs
, tf_none
);
2942 if (fn
== error_mark_node
)
2944 reason
= template_instantiation_rejection (tmpl
, targs
);
2950 A member function template is never instantiated to perform the
2951 copy of a class object to an object of its class type.
2953 It's a little unclear what this means; the standard explicitly
2954 does allow a template to be used to copy a class. For example,
2959 template <class T> A(const T&);
2962 void g () { A a (f ()); }
2964 the member template will be used to make the copy. The section
2965 quoted above appears in the paragraph that forbids constructors
2966 whose only parameter is (a possibly cv-qualified variant of) the
2967 class type, and a logical interpretation is that the intent was
2968 to forbid the instantiation of member templates which would then
2970 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
2972 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
2973 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
2976 reason
= invalid_copy_with_fn_template_rejection ();
2981 if (obj
!= NULL_TREE
)
2982 /* Aha, this is a conversion function. */
2983 cand
= add_conv_candidate (candidates
, fn
, obj
, first_arg
, arglist
,
2984 access_path
, conversion_path
, complain
);
2986 cand
= add_function_candidate (candidates
, fn
, ctype
,
2987 first_arg
, arglist
, access_path
,
2988 conversion_path
, flags
, complain
);
2989 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
2990 /* This situation can occur if a member template of a template
2991 class is specialized. Then, instantiate_template might return
2992 an instantiation of the specialization, in which case the
2993 DECL_TI_TEMPLATE field will point at the original
2994 specialization. For example:
2996 template <class T> struct S { template <class U> void f(U);
2997 template <> void f(int) {}; };
3001 Here, TMPL will be template <class U> S<double>::f(U).
3002 And, instantiate template will give us the specialization
3003 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3004 for this will point at template <class T> template <> S<T>::f(int),
3005 so that we can find the definition. For the purposes of
3006 overload resolution, however, we want the original TMPL. */
3007 cand
->template_decl
= build_template_info (tmpl
, targs
);
3009 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3010 cand
->explicit_targs
= explicit_targs
;
3014 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3015 access_path
, conversion_path
, 0, reason
);
3019 static struct z_candidate
*
3020 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3021 tree explicit_targs
, tree first_arg
,
3022 const VEC(tree
,gc
) *arglist
, tree return_type
,
3023 tree access_path
, tree conversion_path
, int flags
,
3024 unification_kind_t strict
, tsubst_flags_t complain
)
3027 add_template_candidate_real (candidates
, tmpl
, ctype
,
3028 explicit_targs
, first_arg
, arglist
,
3029 return_type
, access_path
, conversion_path
,
3030 flags
, NULL_TREE
, strict
, complain
);
3034 static struct z_candidate
*
3035 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3036 tree obj
, tree first_arg
,
3037 const VEC(tree
,gc
) *arglist
,
3038 tree return_type
, tree access_path
,
3039 tree conversion_path
, tsubst_flags_t complain
)
3042 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3043 first_arg
, arglist
, return_type
, access_path
,
3044 conversion_path
, 0, obj
, DEDUCE_CONV
,
3048 /* The CANDS are the set of candidates that were considered for
3049 overload resolution. Return the set of viable candidates, or CANDS
3050 if none are viable. If any of the candidates were viable, set
3051 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3052 considered viable only if it is strictly viable. */
3054 static struct z_candidate
*
3055 splice_viable (struct z_candidate
*cands
,
3059 struct z_candidate
*viable
;
3060 struct z_candidate
**last_viable
;
3061 struct z_candidate
**cand
;
3063 /* Be strict inside templates, since build_over_call won't actually
3064 do the conversions to get pedwarns. */
3065 if (processing_template_decl
)
3069 last_viable
= &viable
;
3070 *any_viable_p
= false;
3075 struct z_candidate
*c
= *cand
;
3076 if (strict_p
? c
->viable
== 1 : c
->viable
)
3081 last_viable
= &c
->next
;
3082 *any_viable_p
= true;
3088 return viable
? viable
: cands
;
3092 any_strictly_viable (struct z_candidate
*cands
)
3094 for (; cands
; cands
= cands
->next
)
3095 if (cands
->viable
== 1)
3100 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3101 words, it is about to become the "this" pointer for a member
3102 function call. Take the address of the object. */
3105 build_this (tree obj
)
3107 /* In a template, we are only concerned about the type of the
3108 expression, so we can take a shortcut. */
3109 if (processing_template_decl
)
3110 return build_address (obj
);
3112 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3115 /* Returns true iff functions are equivalent. Equivalent functions are
3116 not '==' only if one is a function-local extern function or if
3117 both are extern "C". */
3120 equal_functions (tree fn1
, tree fn2
)
3122 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3124 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3126 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3127 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3128 return decls_match (fn1
, fn2
);
3132 /* Print information about a candidate being rejected due to INFO. */
3135 print_conversion_rejection (location_t loc
, struct conversion_info
*info
)
3137 if (info
->n_arg
== -1)
3138 /* Conversion of implicit `this' argument failed. */
3139 inform (loc
, " no known conversion for implicit "
3140 "%<this%> parameter from %qT to %qT",
3141 info
->from_type
, info
->to_type
);
3143 inform (loc
, " no known conversion for argument %d from %qT to %qT",
3144 info
->n_arg
+1, info
->from_type
, info
->to_type
);
3147 /* Print information about a candidate with WANT parameters and we found
3151 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3153 inform_n (loc
, want
,
3154 " candidate expects %d argument, %d provided",
3155 " candidate expects %d arguments, %d provided",
3159 /* Print information about one overload candidate CANDIDATE. MSGSTR
3160 is the text to print before the candidate itself.
3162 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3163 to have been run through gettext by the caller. This wart makes
3164 life simpler in print_z_candidates and for the translators. */
3167 print_z_candidate (location_t loc
, const char *msgstr
,
3168 struct z_candidate
*candidate
)
3170 const char *msg
= (msgstr
== NULL
3172 : ACONCAT ((msgstr
, " ", NULL
)));
3173 location_t cloc
= location_of (candidate
->fn
);
3175 if (TREE_CODE (candidate
->fn
) == IDENTIFIER_NODE
)
3178 if (candidate
->num_convs
== 3)
3179 inform (cloc
, "%s%D(%T, %T, %T) <built-in>", msg
, candidate
->fn
,
3180 candidate
->convs
[0]->type
,
3181 candidate
->convs
[1]->type
,
3182 candidate
->convs
[2]->type
);
3183 else if (candidate
->num_convs
== 2)
3184 inform (cloc
, "%s%D(%T, %T) <built-in>", msg
, candidate
->fn
,
3185 candidate
->convs
[0]->type
,
3186 candidate
->convs
[1]->type
);
3188 inform (cloc
, "%s%D(%T) <built-in>", msg
, candidate
->fn
,
3189 candidate
->convs
[0]->type
);
3191 else if (TYPE_P (candidate
->fn
))
3192 inform (cloc
, "%s%T <conversion>", msg
, candidate
->fn
);
3193 else if (candidate
->viable
== -1)
3194 inform (cloc
, "%s%#D <near match>", msg
, candidate
->fn
);
3195 else if (DECL_DELETED_FN (STRIP_TEMPLATE (candidate
->fn
)))
3196 inform (cloc
, "%s%#D <deleted>", msg
, candidate
->fn
);
3198 inform (cloc
, "%s%#D", msg
, candidate
->fn
);
3199 /* Give the user some information about why this candidate failed. */
3200 if (candidate
->reason
!= NULL
)
3202 struct rejection_reason
*r
= candidate
->reason
;
3207 print_arity_information (cloc
, r
->u
.arity
.actual
,
3208 r
->u
.arity
.expected
);
3210 case rr_arg_conversion
:
3211 print_conversion_rejection (cloc
, &r
->u
.conversion
);
3213 case rr_bad_arg_conversion
:
3214 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
);
3216 case rr_explicit_conversion
:
3217 inform (cloc
, " return type %qT of explicit conversion function "
3218 "cannot be converted to %qT with a qualification "
3219 "conversion", r
->u
.conversion
.from_type
,
3220 r
->u
.conversion
.to_type
);
3222 case rr_template_conversion
:
3223 inform (cloc
, " conversion from return type %qT of template "
3224 "conversion function specialization to %qT is not an "
3225 "exact match", r
->u
.conversion
.from_type
,
3226 r
->u
.conversion
.to_type
);
3228 case rr_template_unification
:
3229 /* We use template_unification_error_rejection if unification caused
3230 actual non-SFINAE errors, in which case we don't need to repeat
3232 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3234 inform (cloc
, " substitution of deduced template arguments "
3235 "resulted in errors seen above");
3238 /* Re-run template unification with diagnostics. */
3239 inform (cloc
, " template argument deduction/substitution failed:");
3240 fn_type_unification (r
->u
.template_unification
.tmpl
,
3241 r
->u
.template_unification
.explicit_targs
,
3242 r
->u
.template_unification
.targs
,
3243 r
->u
.template_unification
.args
,
3244 r
->u
.template_unification
.nargs
,
3245 r
->u
.template_unification
.return_type
,
3246 r
->u
.template_unification
.strict
,
3247 r
->u
.template_unification
.flags
,
3250 case rr_template_instantiation
:
3251 /* Re-run template instantiation with diagnostics. */
3252 instantiate_template (r
->u
.template_instantiation
.tmpl
,
3253 r
->u
.template_instantiation
.targs
,
3254 tf_warning_or_error
);
3256 case rr_invalid_copy
:
3258 " a constructor taking a single argument of its own "
3259 "class type is invalid");
3263 /* This candidate didn't have any issues or we failed to
3264 handle a particular code. Either way... */
3271 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3273 struct z_candidate
*cand1
;
3274 struct z_candidate
**cand2
;
3280 /* Remove non-viable deleted candidates. */
3282 for (cand2
= &cand1
; *cand2
; )
3284 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3285 && !(*cand2
)->viable
3286 && DECL_DELETED_FN ((*cand2
)->fn
))
3287 *cand2
= (*cand2
)->next
;
3289 cand2
= &(*cand2
)->next
;
3291 /* ...if there are any non-deleted ones. */
3295 /* There may be duplicates in the set of candidates. We put off
3296 checking this condition as long as possible, since we have no way
3297 to eliminate duplicates from a set of functions in less than n^2
3298 time. Now we are about to emit an error message, so it is more
3299 permissible to go slowly. */
3300 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3302 tree fn
= cand1
->fn
;
3303 /* Skip builtin candidates and conversion functions. */
3306 cand2
= &cand1
->next
;
3309 if (DECL_P ((*cand2
)->fn
)
3310 && equal_functions (fn
, (*cand2
)->fn
))
3311 *cand2
= (*cand2
)->next
;
3313 cand2
= &(*cand2
)->next
;
3317 for (n_candidates
= 0, cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3320 inform_n (loc
, n_candidates
, "candidate is:", "candidates are:");
3321 for (; candidates
; candidates
= candidates
->next
)
3322 print_z_candidate (loc
, NULL
, candidates
);
3325 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3326 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3327 the result of the conversion function to convert it to the final
3328 desired type. Merge the two sequences into a single sequence,
3329 and return the merged sequence. */
3332 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3335 bool bad
= user_seq
->bad_p
;
3337 gcc_assert (user_seq
->kind
== ck_user
);
3339 /* Find the end of the second conversion sequence. */
3340 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3342 /* The entire sequence is a user-conversion sequence. */
3343 (*t
)->user_conv_p
= true;
3348 /* Replace the identity conversion with the user conversion
3355 /* Handle overload resolution for initializing an object of class type from
3356 an initializer list. First we look for a suitable constructor that
3357 takes a std::initializer_list; if we don't find one, we then look for a
3358 non-list constructor.
3360 Parameters are as for add_candidates, except that the arguments are in
3361 the form of a CONSTRUCTOR (the initializer list) rather than a VEC, and
3362 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3365 add_list_candidates (tree fns
, tree first_arg
,
3366 tree init_list
, tree totype
,
3367 tree explicit_targs
, bool template_only
,
3368 tree conversion_path
, tree access_path
,
3370 struct z_candidate
**candidates
,
3371 tsubst_flags_t complain
)
3375 gcc_assert (*candidates
== NULL
);
3377 /* We're looking for a ctor for list-initialization. */
3378 flags
|= LOOKUP_LIST_INIT_CTOR
;
3379 /* And we don't allow narrowing conversions. We also use this flag to
3380 avoid the copy constructor call for copy-list-initialization. */
3381 flags
|= LOOKUP_NO_NARROWING
;
3383 /* Always use the default constructor if the list is empty (DR 990). */
3384 if (CONSTRUCTOR_NELTS (init_list
) == 0
3385 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3387 /* If the class has a list ctor, try passing the list as a single
3388 argument first, but only consider list ctors. */
3389 else if (TYPE_HAS_LIST_CTOR (totype
))
3391 flags
|= LOOKUP_LIST_ONLY
;
3392 args
= make_tree_vector_single (init_list
);
3393 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3394 explicit_targs
, template_only
, conversion_path
,
3395 access_path
, flags
, candidates
, complain
);
3396 if (any_strictly_viable (*candidates
))
3400 args
= ctor_to_vec (init_list
);
3402 /* We aren't looking for list-ctors anymore. */
3403 flags
&= ~LOOKUP_LIST_ONLY
;
3404 /* We allow more user-defined conversions within an init-list. */
3405 flags
&= ~LOOKUP_NO_CONVERSION
;
3407 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3408 explicit_targs
, template_only
, conversion_path
,
3409 access_path
, flags
, candidates
, complain
);
3412 /* Returns the best overload candidate to perform the requested
3413 conversion. This function is used for three the overloading situations
3414 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3415 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3416 per [dcl.init.ref], so we ignore temporary bindings. */
3418 static struct z_candidate
*
3419 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3420 tsubst_flags_t complain
)
3422 struct z_candidate
*candidates
, *cand
;
3424 tree ctors
= NULL_TREE
;
3425 tree conv_fns
= NULL_TREE
;
3426 conversion
*conv
= NULL
;
3427 tree first_arg
= NULL_TREE
;
3428 VEC(tree
,gc
) *args
= NULL
;
3435 fromtype
= TREE_TYPE (expr
);
3437 /* We represent conversion within a hierarchy using RVALUE_CONV and
3438 BASE_CONV, as specified by [over.best.ics]; these become plain
3439 constructor calls, as specified in [dcl.init]. */
3440 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3441 || !DERIVED_FROM_P (totype
, fromtype
));
3443 if (MAYBE_CLASS_TYPE_P (totype
))
3444 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3445 creating a garbage BASELINK; constructors can't be inherited. */
3446 ctors
= lookup_fnfields_slot (totype
, complete_ctor_identifier
);
3448 if (MAYBE_CLASS_TYPE_P (fromtype
))
3450 tree to_nonref
= non_reference (totype
);
3451 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3452 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3453 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3455 /* [class.conv.fct] A conversion function is never used to
3456 convert a (possibly cv-qualified) object to the (possibly
3457 cv-qualified) same object type (or a reference to it), to a
3458 (possibly cv-qualified) base class of that type (or a
3459 reference to it)... */
3462 conv_fns
= lookup_conversions (fromtype
);
3466 flags
|= LOOKUP_NO_CONVERSION
;
3467 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3468 flags
|= LOOKUP_NO_NARROWING
;
3470 /* It's OK to bind a temporary for converting constructor arguments, but
3471 not in converting the return value of a conversion operator. */
3472 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
);
3473 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3477 int ctorflags
= flags
;
3479 first_arg
= build_int_cst (build_pointer_type (totype
), 0);
3481 /* We should never try to call the abstract or base constructor
3483 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors
))
3484 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors
)));
3486 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3488 /* List-initialization. */
3489 add_list_candidates (ctors
, first_arg
, expr
, totype
, NULL_TREE
,
3490 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3491 ctorflags
, &candidates
, complain
);
3495 args
= make_tree_vector_single (expr
);
3496 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3497 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3498 ctorflags
, &candidates
, complain
);
3501 for (cand
= candidates
; cand
; cand
= cand
->next
)
3503 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3505 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3506 set, then this is copy-initialization. In that case, "The
3507 result of the call is then used to direct-initialize the
3508 object that is the destination of the copy-initialization."
3511 We represent this in the conversion sequence with an
3512 rvalue conversion, which means a constructor call. */
3513 if (TREE_CODE (totype
) != REFERENCE_TYPE
3514 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3516 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3521 first_arg
= build_this (expr
);
3523 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3525 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3526 struct z_candidate
*old_candidates
;
3528 /* If we are called to convert to a reference type, we are trying to
3529 find a direct binding, so don't even consider temporaries. If
3530 we don't find a direct binding, the caller will try again to
3531 look for a temporary binding. */
3532 if (TREE_CODE (totype
) == REFERENCE_TYPE
)
3533 convflags
|= LOOKUP_NO_TEMP_BIND
;
3535 old_candidates
= candidates
;
3536 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
3538 conversion_path
, TYPE_BINFO (fromtype
),
3539 flags
, &candidates
, complain
);
3541 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
3543 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
3545 = implicit_conversion (totype
,
3548 /*c_cast_p=*/false, convflags
,
3551 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3552 copy-initialization. In that case, "The result of the
3553 call is then used to direct-initialize the object that is
3554 the destination of the copy-initialization." [dcl.init]
3556 We represent this in the conversion sequence with an
3557 rvalue conversion, which means a constructor call. But
3558 don't add a second rvalue conversion if there's already
3559 one there. Which there really shouldn't be, but it's
3560 harmless since we'd add it here anyway. */
3561 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
3562 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3563 ics
= build_conv (ck_rvalue
, totype
, ics
);
3565 cand
->second_conv
= ics
;
3570 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -1,
3573 else if (DECL_NONCONVERTING_P (cand
->fn
)
3574 && ics
->rank
> cr_exact
)
3576 /* 13.3.1.5: For direct-initialization, those explicit
3577 conversion functions that are not hidden within S and
3578 yield type T or a type that can be converted to type T
3579 with a qualification conversion (4.4) are also candidate
3581 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3582 I've raised this issue with the committee. --jason 9/2011 */
3584 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
3586 else if (cand
->viable
== 1 && ics
->bad_p
)
3590 = bad_arg_conversion_rejection (NULL_TREE
, -1,
3593 else if (primary_template_instantiation_p (cand
->fn
)
3594 && ics
->rank
> cr_exact
)
3596 /* 13.3.3.1.2: If the user-defined conversion is specified by
3597 a specialization of a conversion function template, the
3598 second standard conversion sequence shall have exact match
3601 cand
->reason
= template_conversion_rejection (rettype
, totype
);
3606 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
3610 release_tree_vector (args
);
3614 cand
= tourney (candidates
, complain
);
3617 if (complain
& tf_error
)
3619 error ("conversion from %qT to %qT is ambiguous",
3621 print_z_candidates (location_of (expr
), candidates
);
3624 cand
= candidates
; /* any one will do */
3625 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
3626 cand
->second_conv
->user_conv_p
= true;
3627 if (!any_strictly_viable (candidates
))
3628 cand
->second_conv
->bad_p
= true;
3629 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3630 ambiguous conversion is no worse than another user-defined
3636 /* Build the user conversion sequence. */
3639 (DECL_CONSTRUCTOR_P (cand
->fn
)
3640 ? totype
: non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)))),
3641 build_identity_conv (TREE_TYPE (expr
), expr
));
3643 if (cand
->viable
== -1)
3646 /* Remember that this was a list-initialization. */
3647 if (flags
& LOOKUP_NO_NARROWING
)
3648 conv
->check_narrowing
= true;
3650 /* Combine it with the second conversion sequence. */
3651 cand
->second_conv
= merge_conversion_sequences (conv
,
3657 /* Wrapper for above. */
3660 build_user_type_conversion (tree totype
, tree expr
, int flags
,
3661 tsubst_flags_t complain
)
3663 struct z_candidate
*cand
;
3666 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
3667 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
3671 if (cand
->second_conv
->kind
== ck_ambig
)
3672 ret
= error_mark_node
;
3675 expr
= convert_like (cand
->second_conv
, expr
, complain
);
3676 ret
= convert_from_reference (expr
);
3682 timevar_cond_stop (TV_OVERLOAD
, subtime
);
3686 /* Subroutine of convert_nontype_argument.
3688 EXPR is an argument for a template non-type parameter of integral or
3689 enumeration type. Do any necessary conversions (that are permitted for
3690 non-type arguments) to convert it to the parameter type.
3692 If conversion is successful, returns the converted expression;
3693 otherwise, returns error_mark_node. */
3696 build_integral_nontype_arg_conv (tree type
, tree expr
, tsubst_flags_t complain
)
3701 location_t loc
= EXPR_LOC_OR_HERE (expr
);
3703 if (error_operand_p (expr
))
3704 return error_mark_node
;
3706 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
3708 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3709 p
= conversion_obstack_alloc (0);
3711 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
3713 LOOKUP_IMPLICIT
, complain
);
3715 /* for a non-type template-parameter of integral or
3716 enumeration type, integral promotions (4.5) and integral
3717 conversions (4.7) are applied. */
3718 /* It should be sufficient to check the outermost conversion step, since
3719 there are no qualification conversions to integer type. */
3723 /* A conversion function is OK. If it isn't constexpr, we'll
3724 complain later that the argument isn't constant. */
3726 /* The lvalue-to-rvalue conversion is OK. */
3732 t
= next_conversion (conv
)->type
;
3733 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
))
3736 if (complain
& tf_error
)
3737 error_at (loc
, "conversion from %qT to %qT not considered for "
3738 "non-type template argument", t
, type
);
3739 /* and fall through. */
3747 expr
= convert_like (conv
, expr
, complain
);
3749 expr
= error_mark_node
;
3751 /* Free all the conversions we allocated. */
3752 obstack_free (&conversion_obstack
, p
);
3757 /* Do any initial processing on the arguments to a function call. */
3759 static VEC(tree
,gc
) *
3760 resolve_args (VEC(tree
,gc
) *args
, tsubst_flags_t complain
)
3765 FOR_EACH_VEC_ELT (tree
, args
, ix
, arg
)
3767 if (error_operand_p (arg
))
3769 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
3771 if (complain
& tf_error
)
3772 error ("invalid use of void expression");
3775 else if (invalid_nonstatic_memfn_p (arg
, complain
))
3781 /* Perform overload resolution on FN, which is called with the ARGS.
3783 Return the candidate function selected by overload resolution, or
3784 NULL if the event that overload resolution failed. In the case
3785 that overload resolution fails, *CANDIDATES will be the set of
3786 candidates considered, and ANY_VIABLE_P will be set to true or
3787 false to indicate whether or not any of the candidates were
3790 The ARGS should already have gone through RESOLVE_ARGS before this
3791 function is called. */
3793 static struct z_candidate
*
3794 perform_overload_resolution (tree fn
,
3795 const VEC(tree
,gc
) *args
,
3796 struct z_candidate
**candidates
,
3797 bool *any_viable_p
, tsubst_flags_t complain
)
3799 struct z_candidate
*cand
;
3800 tree explicit_targs
;
3803 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
3805 explicit_targs
= NULL_TREE
;
3809 *any_viable_p
= true;
3812 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
3813 || TREE_CODE (fn
) == TEMPLATE_DECL
3814 || TREE_CODE (fn
) == OVERLOAD
3815 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
3817 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3819 explicit_targs
= TREE_OPERAND (fn
, 1);
3820 fn
= TREE_OPERAND (fn
, 0);
3824 /* Add the various candidate functions. */
3825 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
3826 explicit_targs
, template_only
,
3827 /*conversion_path=*/NULL_TREE
,
3828 /*access_path=*/NULL_TREE
,
3830 candidates
, complain
);
3832 *candidates
= splice_viable (*candidates
, pedantic
, any_viable_p
);
3834 cand
= tourney (*candidates
, complain
);
3838 timevar_cond_stop (TV_OVERLOAD
, subtime
);
3842 /* Print an error message about being unable to build a call to FN with
3843 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
3844 be located; CANDIDATES is a possibly empty list of such
3848 print_error_for_call_failure (tree fn
, VEC(tree
,gc
) *args
, bool any_viable_p
,
3849 struct z_candidate
*candidates
)
3851 tree name
= DECL_NAME (OVL_CURRENT (fn
));
3852 location_t loc
= location_of (name
);
3855 error_at (loc
, "no matching function for call to %<%D(%A)%>",
3856 name
, build_tree_list_vec (args
));
3858 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
3859 name
, build_tree_list_vec (args
));
3861 print_z_candidates (loc
, candidates
);
3864 /* Return an expression for a call to FN (a namespace-scope function,
3865 or a static member function) with the ARGS. This may change
3869 build_new_function_call (tree fn
, VEC(tree
,gc
) **args
, bool koenig_p
,
3870 tsubst_flags_t complain
)
3872 struct z_candidate
*candidates
, *cand
;
3877 if (args
!= NULL
&& *args
!= NULL
)
3879 *args
= resolve_args (*args
, complain
);
3881 return error_mark_node
;
3885 tm_malloc_replacement (fn
);
3887 /* If this function was found without using argument dependent
3888 lookup, then we want to ignore any undeclared friend
3894 fn
= remove_hidden_names (fn
);
3897 if (complain
& tf_error
)
3898 print_error_for_call_failure (orig_fn
, *args
, false, NULL
);
3899 return error_mark_node
;
3903 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3904 p
= conversion_obstack_alloc (0);
3906 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
3911 if (complain
& tf_error
)
3913 if (!any_viable_p
&& candidates
&& ! candidates
->next
3914 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
3915 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
3916 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3917 fn
= TREE_OPERAND (fn
, 0);
3918 print_error_for_call_failure (fn
, *args
, any_viable_p
, candidates
);
3920 result
= error_mark_node
;
3924 int flags
= LOOKUP_NORMAL
;
3925 /* If fn is template_id_expr, the call has explicit template arguments
3926 (e.g. func<int>(5)), communicate this info to build_over_call
3927 through flags so that later we can use it to decide whether to warn
3928 about peculiar null pointer conversion. */
3929 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3930 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
3931 result
= build_over_call (cand
, flags
, complain
);
3934 /* Free all the conversions we allocated. */
3935 obstack_free (&conversion_obstack
, p
);
3940 /* Build a call to a global operator new. FNNAME is the name of the
3941 operator (either "operator new" or "operator new[]") and ARGS are
3942 the arguments provided. This may change ARGS. *SIZE points to the
3943 total number of bytes required by the allocation, and is updated if
3944 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
3945 be used. If this function determines that no cookie should be
3946 used, after all, *COOKIE_SIZE is set to NULL_TREE. If FN is
3947 non-NULL, it will be set, upon return, to the allocation function
3951 build_operator_new_call (tree fnname
, VEC(tree
,gc
) **args
,
3952 tree
*size
, tree
*cookie_size
,
3953 tree
*fn
, tsubst_flags_t complain
)
3956 struct z_candidate
*candidates
;
3957 struct z_candidate
*cand
;
3962 VEC_safe_insert (tree
, gc
, *args
, 0, *size
);
3963 *args
= resolve_args (*args
, complain
);
3965 return error_mark_node
;
3971 If this lookup fails to find the name, or if the allocated type
3972 is not a class type, the allocation function's name is looked
3973 up in the global scope.
3975 we disregard block-scope declarations of "operator new". */
3976 fns
= lookup_function_nonclass (fnname
, *args
, /*block_p=*/false);
3978 /* Figure out what function is being called. */
3979 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
3982 /* If no suitable function could be found, issue an error message
3986 if (complain
& tf_error
)
3987 print_error_for_call_failure (fns
, *args
, any_viable_p
, candidates
);
3988 return error_mark_node
;
3991 /* If a cookie is required, add some extra space. Whether
3992 or not a cookie is required cannot be determined until
3993 after we know which function was called. */
3996 bool use_cookie
= true;
3997 if (!abi_version_at_least (2))
3999 /* In G++ 3.2, the check was implemented incorrectly; it
4000 looked at the placement expression, rather than the
4001 type of the function. */
4002 if (VEC_length (tree
, *args
) == 2
4003 && same_type_p (TREE_TYPE (VEC_index (tree
, *args
, 1)),
4011 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4012 /* Skip the size_t parameter. */
4013 arg_types
= TREE_CHAIN (arg_types
);
4014 /* Check the remaining parameters (if any). */
4016 && TREE_CHAIN (arg_types
) == void_list_node
4017 && same_type_p (TREE_VALUE (arg_types
),
4021 /* If we need a cookie, adjust the number of bytes allocated. */
4024 /* Update the total size. */
4025 *size
= size_binop (PLUS_EXPR
, *size
, *cookie_size
);
4026 /* Update the argument list to reflect the adjusted size. */
4027 VEC_replace (tree
, *args
, 0, *size
);
4030 *cookie_size
= NULL_TREE
;
4033 /* Tell our caller which function we decided to call. */
4037 /* Build the CALL_EXPR. */
4038 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4041 /* Build a new call to operator(). This may change ARGS. */
4044 build_op_call_1 (tree obj
, VEC(tree
,gc
) **args
, tsubst_flags_t complain
)
4046 struct z_candidate
*candidates
= 0, *cand
;
4047 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4048 tree type
= TREE_TYPE (obj
);
4050 tree result
= NULL_TREE
;
4053 if (error_operand_p (obj
))
4054 return error_mark_node
;
4056 obj
= prep_operand (obj
);
4058 if (TYPE_PTRMEMFUNC_P (type
))
4060 if (complain
& tf_error
)
4061 /* It's no good looking for an overloaded operator() on a
4062 pointer-to-member-function. */
4063 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj
);
4064 return error_mark_node
;
4067 if (TYPE_BINFO (type
))
4069 fns
= lookup_fnfields (TYPE_BINFO (type
), ansi_opname (CALL_EXPR
), 1);
4070 if (fns
== error_mark_node
)
4071 return error_mark_node
;
4076 if (args
!= NULL
&& *args
!= NULL
)
4078 *args
= resolve_args (*args
, complain
);
4080 return error_mark_node
;
4083 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4084 p
= conversion_obstack_alloc (0);
4088 first_mem_arg
= build_this (obj
);
4090 add_candidates (BASELINK_FUNCTIONS (fns
),
4091 first_mem_arg
, *args
, NULL_TREE
,
4093 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4094 LOOKUP_NORMAL
, &candidates
, complain
);
4097 convs
= lookup_conversions (type
);
4099 for (; convs
; convs
= TREE_CHAIN (convs
))
4101 tree fns
= TREE_VALUE (convs
);
4102 tree totype
= TREE_TYPE (convs
);
4104 if ((TREE_CODE (totype
) == POINTER_TYPE
4105 && TREE_CODE (TREE_TYPE (totype
)) == FUNCTION_TYPE
)
4106 || (TREE_CODE (totype
) == REFERENCE_TYPE
4107 && TREE_CODE (TREE_TYPE (totype
)) == FUNCTION_TYPE
)
4108 || (TREE_CODE (totype
) == REFERENCE_TYPE
4109 && TREE_CODE (TREE_TYPE (totype
)) == POINTER_TYPE
4110 && TREE_CODE (TREE_TYPE (TREE_TYPE (totype
))) == FUNCTION_TYPE
))
4111 for (; fns
; fns
= OVL_NEXT (fns
))
4113 tree fn
= OVL_CURRENT (fns
);
4115 if (DECL_NONCONVERTING_P (fn
))
4118 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4119 add_template_conv_candidate
4120 (&candidates
, fn
, obj
, NULL_TREE
, *args
, totype
,
4121 /*access_path=*/NULL_TREE
,
4122 /*conversion_path=*/NULL_TREE
, complain
);
4124 add_conv_candidate (&candidates
, fn
, obj
, NULL_TREE
,
4125 *args
, /*conversion_path=*/NULL_TREE
,
4126 /*access_path=*/NULL_TREE
, complain
);
4130 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
4133 if (complain
& tf_error
)
4135 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4136 build_tree_list_vec (*args
));
4137 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4139 result
= error_mark_node
;
4143 cand
= tourney (candidates
, complain
);
4146 if (complain
& tf_error
)
4148 error ("call of %<(%T) (%A)%> is ambiguous",
4149 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4150 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4152 result
= error_mark_node
;
4154 /* Since cand->fn will be a type, not a function, for a conversion
4155 function, we must be careful not to unconditionally look at
4157 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4158 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
) == CALL_EXPR
)
4159 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4162 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
, -1,
4164 obj
= convert_from_reference (obj
);
4165 result
= cp_build_function_call_vec (obj
, args
, complain
);
4169 /* Free all the conversions we allocated. */
4170 obstack_free (&conversion_obstack
, p
);
4175 /* Wrapper for above. */
4178 build_op_call (tree obj
, VEC(tree
,gc
) **args
, tsubst_flags_t complain
)
4181 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4182 ret
= build_op_call_1 (obj
, args
, complain
);
4183 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4187 /* Called by op_error to prepare format strings suitable for the error
4188 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4189 and a suffix (controlled by NTYPES). */
4192 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4196 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4197 : G_("no match for "), errmsg
, NULL
);
4200 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4201 else if (ntypes
== 2)
4202 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4204 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4210 op_error (location_t loc
, enum tree_code code
, enum tree_code code2
,
4211 tree arg1
, tree arg2
, tree arg3
, bool match
)
4215 if (code
== MODIFY_EXPR
)
4216 opname
= assignment_operator_name_info
[code2
].name
;
4218 opname
= operator_name_info
[code
].name
;
4223 if (flag_diagnostics_show_caret
)
4224 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4226 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4228 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4229 "in %<%E ? %E : %E%>"), 3, match
),
4231 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4234 case POSTINCREMENT_EXPR
:
4235 case POSTDECREMENT_EXPR
:
4236 if (flag_diagnostics_show_caret
)
4237 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4238 opname
, TREE_TYPE (arg1
));
4240 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4242 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4246 if (flag_diagnostics_show_caret
)
4247 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4248 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4250 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4252 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4257 if (flag_diagnostics_show_caret
)
4258 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4259 opname
, TREE_TYPE (arg1
));
4261 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4262 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4267 if (flag_diagnostics_show_caret
)
4268 error_at (loc
, op_error_string (G_("%<operator%s%>"), 2, match
),
4269 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4271 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4273 opname
, arg1
, opname
, arg2
,
4274 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4276 if (flag_diagnostics_show_caret
)
4277 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4278 opname
, TREE_TYPE (arg1
));
4280 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4282 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4287 /* Return the implicit conversion sequence that could be used to
4288 convert E1 to E2 in [expr.cond]. */
4291 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4293 tree t1
= non_reference (TREE_TYPE (e1
));
4294 tree t2
= non_reference (TREE_TYPE (e2
));
4300 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4301 implicitly converted (clause _conv_) to the type "lvalue reference to
4302 T2", subject to the constraint that in the conversion the
4303 reference must bind directly (_dcl.init.ref_) to an lvalue. */
4304 if (real_lvalue_p (e2
))
4306 conv
= implicit_conversion (build_reference_type (t2
),
4310 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4311 |LOOKUP_ONLYCONVERTING
,
4319 If E1 and E2 have class type, and the underlying class types are
4320 the same or one is a base class of the other: E1 can be converted
4321 to match E2 if the class of T2 is the same type as, or a base
4322 class of, the class of T1, and the cv-qualification of T2 is the
4323 same cv-qualification as, or a greater cv-qualification than, the
4324 cv-qualification of T1. If the conversion is applied, E1 is
4325 changed to an rvalue of type T2 that still refers to the original
4326 source class object (or the appropriate subobject thereof). */
4327 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4328 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4330 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4332 conv
= build_identity_conv (t1
, e1
);
4333 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4334 TYPE_MAIN_VARIANT (t2
)))
4335 conv
= build_conv (ck_base
, t2
, conv
);
4337 conv
= build_conv (ck_rvalue
, t2
, conv
);
4346 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4347 converted to the type that expression E2 would have if E2 were
4348 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4349 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4350 LOOKUP_IMPLICIT
, complain
);
4353 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4354 arguments to the conditional expression. */
4357 build_conditional_expr_1 (tree arg1
, tree arg2
, tree arg3
,
4358 tsubst_flags_t complain
)
4362 tree result
= NULL_TREE
;
4363 tree result_type
= NULL_TREE
;
4364 bool lvalue_p
= true;
4365 struct z_candidate
*candidates
= 0;
4366 struct z_candidate
*cand
;
4368 tree orig_arg2
, orig_arg3
;
4370 /* As a G++ extension, the second argument to the conditional can be
4371 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4372 c'.) If the second operand is omitted, make sure it is
4373 calculated only once. */
4376 if (complain
& tf_error
)
4377 pedwarn (input_location
, OPT_Wpedantic
,
4378 "ISO C++ forbids omitting the middle term of a ?: expression");
4380 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4381 if (real_lvalue_p (arg1
))
4382 arg2
= arg1
= stabilize_reference (arg1
);
4384 arg2
= arg1
= save_expr (arg1
);
4389 The first expression is implicitly converted to bool (clause
4391 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
4394 /* If something has already gone wrong, just pass that fact up the
4396 if (error_operand_p (arg1
)
4397 || error_operand_p (arg2
)
4398 || error_operand_p (arg3
))
4399 return error_mark_node
;
4403 If either the second or the third operand has type (possibly
4404 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4405 array-to-pointer (_conv.array_), and function-to-pointer
4406 (_conv.func_) standard conversions are performed on the second
4407 and third operands. */
4410 arg2_type
= unlowered_expr_type (arg2
);
4411 arg3_type
= unlowered_expr_type (arg3
);
4412 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
4414 /* Do the conversions. We don't these for `void' type arguments
4415 since it can't have any effect and since decay_conversion
4416 does not handle that case gracefully. */
4417 if (!VOID_TYPE_P (arg2_type
))
4418 arg2
= decay_conversion (arg2
, complain
);
4419 if (!VOID_TYPE_P (arg3_type
))
4420 arg3
= decay_conversion (arg3
, complain
);
4421 arg2_type
= TREE_TYPE (arg2
);
4422 arg3_type
= TREE_TYPE (arg3
);
4426 One of the following shall hold:
4428 --The second or the third operand (but not both) is a
4429 throw-expression (_except.throw_); the result is of the
4430 type of the other and is an rvalue.
4432 --Both the second and the third operands have type void; the
4433 result is of type void and is an rvalue.
4435 We must avoid calling force_rvalue for expressions of type
4436 "void" because it will complain that their value is being
4438 if (TREE_CODE (arg2
) == THROW_EXPR
4439 && TREE_CODE (arg3
) != THROW_EXPR
)
4441 if (!VOID_TYPE_P (arg3_type
))
4443 arg3
= force_rvalue (arg3
, complain
);
4444 if (arg3
== error_mark_node
)
4445 return error_mark_node
;
4447 arg3_type
= TREE_TYPE (arg3
);
4448 result_type
= arg3_type
;
4450 else if (TREE_CODE (arg2
) != THROW_EXPR
4451 && TREE_CODE (arg3
) == THROW_EXPR
)
4453 if (!VOID_TYPE_P (arg2_type
))
4455 arg2
= force_rvalue (arg2
, complain
);
4456 if (arg2
== error_mark_node
)
4457 return error_mark_node
;
4459 arg2_type
= TREE_TYPE (arg2
);
4460 result_type
= arg2_type
;
4462 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
4463 result_type
= void_type_node
;
4466 if (complain
& tf_error
)
4468 if (VOID_TYPE_P (arg2_type
))
4469 error ("second operand to the conditional operator "
4470 "is of type %<void%>, "
4471 "but the third operand is neither a throw-expression "
4472 "nor of type %<void%>");
4474 error ("third operand to the conditional operator "
4475 "is of type %<void%>, "
4476 "but the second operand is neither a throw-expression "
4477 "nor of type %<void%>");
4479 return error_mark_node
;
4483 goto valid_operands
;
4487 Otherwise, if the second and third operand have different types,
4488 and either has (possibly cv-qualified) class type, an attempt is
4489 made to convert each of those operands to the type of the other. */
4490 else if (!same_type_p (arg2_type
, arg3_type
)
4491 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
4496 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4497 p
= conversion_obstack_alloc (0);
4499 conv2
= conditional_conversion (arg2
, arg3
, complain
);
4500 conv3
= conditional_conversion (arg3
, arg2
, complain
);
4504 If both can be converted, or one can be converted but the
4505 conversion is ambiguous, the program is ill-formed. If
4506 neither can be converted, the operands are left unchanged and
4507 further checking is performed as described below. If exactly
4508 one conversion is possible, that conversion is applied to the
4509 chosen operand and the converted operand is used in place of
4510 the original operand for the remainder of this section. */
4511 if ((conv2
&& !conv2
->bad_p
4512 && conv3
&& !conv3
->bad_p
)
4513 || (conv2
&& conv2
->kind
== ck_ambig
)
4514 || (conv3
&& conv3
->kind
== ck_ambig
))
4516 error ("operands to ?: have different types %qT and %qT",
4517 arg2_type
, arg3_type
);
4518 result
= error_mark_node
;
4520 else if (conv2
&& (!conv2
->bad_p
|| !conv3
))
4522 arg2
= convert_like (conv2
, arg2
, complain
);
4523 arg2
= convert_from_reference (arg2
);
4524 arg2_type
= TREE_TYPE (arg2
);
4525 /* Even if CONV2 is a valid conversion, the result of the
4526 conversion may be invalid. For example, if ARG3 has type
4527 "volatile X", and X does not have a copy constructor
4528 accepting a "volatile X&", then even if ARG2 can be
4529 converted to X, the conversion will fail. */
4530 if (error_operand_p (arg2
))
4531 result
= error_mark_node
;
4533 else if (conv3
&& (!conv3
->bad_p
|| !conv2
))
4535 arg3
= convert_like (conv3
, arg3
, complain
);
4536 arg3
= convert_from_reference (arg3
);
4537 arg3_type
= TREE_TYPE (arg3
);
4538 if (error_operand_p (arg3
))
4539 result
= error_mark_node
;
4542 /* Free all the conversions we allocated. */
4543 obstack_free (&conversion_obstack
, p
);
4548 /* If, after the conversion, both operands have class type,
4549 treat the cv-qualification of both operands as if it were the
4550 union of the cv-qualification of the operands.
4552 The standard is not clear about what to do in this
4553 circumstance. For example, if the first operand has type
4554 "const X" and the second operand has a user-defined
4555 conversion to "volatile X", what is the type of the second
4556 operand after this step? Making it be "const X" (matching
4557 the first operand) seems wrong, as that discards the
4558 qualification without actually performing a copy. Leaving it
4559 as "volatile X" seems wrong as that will result in the
4560 conditional expression failing altogether, even though,
4561 according to this step, the one operand could be converted to
4562 the type of the other. */
4563 if ((conv2
|| conv3
)
4564 && CLASS_TYPE_P (arg2_type
)
4565 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
4566 arg2_type
= arg3_type
=
4567 cp_build_qualified_type (arg2_type
,
4568 cp_type_quals (arg2_type
)
4569 | cp_type_quals (arg3_type
));
4574 If the second and third operands are lvalues and have the same
4575 type, the result is of that type and is an lvalue. */
4576 if (real_lvalue_p (arg2
)
4577 && real_lvalue_p (arg3
)
4578 && same_type_p (arg2_type
, arg3_type
))
4580 result_type
= arg2_type
;
4581 arg2
= mark_lvalue_use (arg2
);
4582 arg3
= mark_lvalue_use (arg3
);
4583 goto valid_operands
;
4588 Otherwise, the result is an rvalue. If the second and third
4589 operand do not have the same type, and either has (possibly
4590 cv-qualified) class type, overload resolution is used to
4591 determine the conversions (if any) to be applied to the operands
4592 (_over.match.oper_, _over.built_). */
4594 if (!same_type_p (arg2_type
, arg3_type
)
4595 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
4601 /* Rearrange the arguments so that add_builtin_candidate only has
4602 to know about two args. In build_builtin_candidate, the
4603 arguments are unscrambled. */
4607 add_builtin_candidates (&candidates
,
4610 ansi_opname (COND_EXPR
),
4612 LOOKUP_NORMAL
, complain
);
4616 If the overload resolution fails, the program is
4618 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
4621 if (complain
& tf_error
)
4623 op_error (input_location
, COND_EXPR
, NOP_EXPR
,
4624 arg1
, arg2
, arg3
, FALSE
);
4625 print_z_candidates (location_of (arg1
), candidates
);
4627 return error_mark_node
;
4629 cand
= tourney (candidates
, complain
);
4632 if (complain
& tf_error
)
4634 op_error (input_location
, COND_EXPR
, NOP_EXPR
,
4635 arg1
, arg2
, arg3
, FALSE
);
4636 print_z_candidates (location_of (arg1
), candidates
);
4638 return error_mark_node
;
4643 Otherwise, the conversions thus determined are applied, and
4644 the converted operands are used in place of the original
4645 operands for the remainder of this section. */
4646 conv
= cand
->convs
[0];
4647 arg1
= convert_like (conv
, arg1
, complain
);
4648 conv
= cand
->convs
[1];
4649 arg2
= convert_like (conv
, arg2
, complain
);
4650 arg2_type
= TREE_TYPE (arg2
);
4651 conv
= cand
->convs
[2];
4652 arg3
= convert_like (conv
, arg3
, complain
);
4653 arg3_type
= TREE_TYPE (arg3
);
4658 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
4659 and function-to-pointer (_conv.func_) standard conversions are
4660 performed on the second and third operands.
4662 We need to force the lvalue-to-rvalue conversion here for class types,
4663 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
4664 that isn't wrapped with a TARGET_EXPR plays havoc with exception
4667 arg2
= force_rvalue (arg2
, complain
);
4668 if (!CLASS_TYPE_P (arg2_type
))
4669 arg2_type
= TREE_TYPE (arg2
);
4671 arg3
= force_rvalue (arg3
, complain
);
4672 if (!CLASS_TYPE_P (arg3_type
))
4673 arg3_type
= TREE_TYPE (arg3
);
4675 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
4676 return error_mark_node
;
4680 After those conversions, one of the following shall hold:
4682 --The second and third operands have the same type; the result is of
4684 if (same_type_p (arg2_type
, arg3_type
))
4685 result_type
= arg2_type
;
4688 --The second and third operands have arithmetic or enumeration
4689 type; the usual arithmetic conversions are performed to bring
4690 them to a common type, and the result is of that type. */
4691 else if ((ARITHMETIC_TYPE_P (arg2_type
)
4692 || UNSCOPED_ENUM_P (arg2_type
))
4693 && (ARITHMETIC_TYPE_P (arg3_type
)
4694 || UNSCOPED_ENUM_P (arg3_type
)))
4696 /* In this case, there is always a common type. */
4697 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
4699 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
4700 "implicit conversion from %qT to %qT to "
4701 "match other result of conditional",
4704 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
4705 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
4707 if (TREE_CODE (orig_arg2
) == CONST_DECL
4708 && TREE_CODE (orig_arg3
) == CONST_DECL
4709 && DECL_CONTEXT (orig_arg2
) == DECL_CONTEXT (orig_arg3
))
4710 /* Two enumerators from the same enumeration can have different
4711 types when the enumeration is still being defined. */;
4712 else if (complain
& tf_warning
)
4713 warning (OPT_Wenum_compare
,
4714 "enumeral mismatch in conditional expression: %qT vs %qT",
4715 arg2_type
, arg3_type
);
4717 else if (extra_warnings
4718 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
4719 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
4720 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
4721 && !same_type_p (arg2_type
, type_promotes_to (arg3_type
)))))
4723 if (complain
& tf_warning
)
4725 "enumeral and non-enumeral type in conditional expression");
4728 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
4729 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
4733 --The second and third operands have pointer type, or one has
4734 pointer type and the other is a null pointer constant; pointer
4735 conversions (_conv.ptr_) and qualification conversions
4736 (_conv.qual_) are performed to bring them to their composite
4737 pointer type (_expr.rel_). The result is of the composite
4740 --The second and third operands have pointer to member type, or
4741 one has pointer to member type and the other is a null pointer
4742 constant; pointer to member conversions (_conv.mem_) and
4743 qualification conversions (_conv.qual_) are performed to bring
4744 them to a common type, whose cv-qualification shall match the
4745 cv-qualification of either the second or the third operand.
4746 The result is of the common type. */
4747 else if ((null_ptr_cst_p (arg2
)
4748 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
4749 || (null_ptr_cst_p (arg3
)
4750 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
4751 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
4752 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
4753 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
4755 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
4756 arg3
, CPO_CONDITIONAL_EXPR
,
4758 if (result_type
== error_mark_node
)
4759 return error_mark_node
;
4760 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
4761 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
4766 if (complain
& tf_error
)
4767 error ("operands to ?: have different types %qT and %qT",
4768 arg2_type
, arg3_type
);
4769 return error_mark_node
;
4773 result
= build3 (COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
4774 if (!cp_unevaluated_operand
)
4775 /* Avoid folding within decltype (c++/42013) and noexcept. */
4776 result
= fold_if_not_in_template (result
);
4778 /* We can't use result_type below, as fold might have returned a
4783 /* Expand both sides into the same slot, hopefully the target of
4784 the ?: expression. We used to check for TARGET_EXPRs here,
4785 but now we sometimes wrap them in NOP_EXPRs so the test would
4787 if (CLASS_TYPE_P (TREE_TYPE (result
)))
4788 result
= get_target_expr (result
);
4789 /* If this expression is an rvalue, but might be mistaken for an
4790 lvalue, we must add a NON_LVALUE_EXPR. */
4791 result
= rvalue (result
);
4797 /* Wrapper for above. */
4800 build_conditional_expr (tree arg1
, tree arg2
, tree arg3
,
4801 tsubst_flags_t complain
)
4804 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4805 ret
= build_conditional_expr_1 (arg1
, arg2
, arg3
, complain
);
4806 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4810 /* OPERAND is an operand to an expression. Perform necessary steps
4811 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
4815 prep_operand (tree operand
)
4819 if (CLASS_TYPE_P (TREE_TYPE (operand
))
4820 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
4821 /* Make sure the template type is instantiated now. */
4822 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
4828 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
4829 OVERLOAD) to the CANDIDATES, returning an updated list of
4830 CANDIDATES. The ARGS are the arguments provided to the call;
4831 if FIRST_ARG is non-null it is the implicit object argument,
4832 otherwise the first element of ARGS is used if needed. The
4833 EXPLICIT_TARGS are explicit template arguments provided.
4834 TEMPLATE_ONLY is true if only template functions should be
4835 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
4836 add_function_candidate. */
4839 add_candidates (tree fns
, tree first_arg
, const VEC(tree
,gc
) *args
,
4841 tree explicit_targs
, bool template_only
,
4842 tree conversion_path
, tree access_path
,
4844 struct z_candidate
**candidates
,
4845 tsubst_flags_t complain
)
4848 const VEC(tree
,gc
) *non_static_args
;
4849 bool check_list_ctor
;
4850 bool check_converting
;
4851 unification_kind_t strict
;
4857 /* Precalculate special handling of constructors and conversion ops. */
4858 fn
= OVL_CURRENT (fns
);
4859 if (DECL_CONV_FN_P (fn
))
4861 check_list_ctor
= false;
4862 check_converting
= !!(flags
& LOOKUP_ONLYCONVERTING
);
4863 if (flags
& LOOKUP_NO_CONVERSION
)
4864 /* We're doing return_type(x). */
4865 strict
= DEDUCE_CONV
;
4867 /* We're doing x.operator return_type(). */
4868 strict
= DEDUCE_EXACT
;
4869 /* [over.match.funcs] For conversion functions, the function
4870 is considered to be a member of the class of the implicit
4871 object argument for the purpose of defining the type of
4872 the implicit object parameter. */
4873 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (first_arg
)));
4877 if (DECL_CONSTRUCTOR_P (fn
))
4879 check_list_ctor
= !!(flags
& LOOKUP_LIST_ONLY
);
4880 /* For list-initialization we consider explicit constructors
4881 and complain if one is chosen. */
4883 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
4884 == LOOKUP_ONLYCONVERTING
);
4888 check_list_ctor
= false;
4889 check_converting
= false;
4891 strict
= DEDUCE_CALL
;
4892 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
4896 non_static_args
= args
;
4898 /* Delay creating the implicit this parameter until it is needed. */
4899 non_static_args
= NULL
;
4901 for (; fns
; fns
= OVL_NEXT (fns
))
4904 const VEC(tree
,gc
) *fn_args
;
4906 fn
= OVL_CURRENT (fns
);
4908 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
4910 if (check_list_ctor
&& !is_list_ctor (fn
))
4913 /* Figure out which set of arguments to use. */
4914 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
4916 /* If this function is a non-static member and we didn't get an
4917 implicit object argument, move it out of args. */
4918 if (first_arg
== NULL_TREE
)
4922 VEC(tree
,gc
) *tempvec
4923 = VEC_alloc (tree
, gc
, VEC_length (tree
, args
) - 1);
4924 for (ix
= 1; VEC_iterate (tree
, args
, ix
, arg
); ++ix
)
4925 VEC_quick_push (tree
, tempvec
, arg
);
4926 non_static_args
= tempvec
;
4927 first_arg
= build_this (VEC_index (tree
, args
, 0));
4930 fn_first_arg
= first_arg
;
4931 fn_args
= non_static_args
;
4935 /* Otherwise, just use the list of arguments provided. */
4936 fn_first_arg
= NULL_TREE
;
4940 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4941 add_template_candidate (candidates
,
4953 else if (!template_only
)
4954 add_function_candidate (candidates
,
4967 build_new_op_1 (location_t loc
, enum tree_code code
, int flags
, tree arg1
,
4968 tree arg2
, tree arg3
, tree
*overload
, tsubst_flags_t complain
)
4970 struct z_candidate
*candidates
= 0, *cand
;
4971 VEC(tree
,gc
) *arglist
;
4974 tree result
= NULL_TREE
;
4975 bool result_valid_p
= false;
4976 enum tree_code code2
= NOP_EXPR
;
4977 enum tree_code code_orig_arg1
= ERROR_MARK
;
4978 enum tree_code code_orig_arg2
= ERROR_MARK
;
4984 if (error_operand_p (arg1
)
4985 || error_operand_p (arg2
)
4986 || error_operand_p (arg3
))
4987 return error_mark_node
;
4989 if (code
== MODIFY_EXPR
)
4991 code2
= TREE_CODE (arg3
);
4993 fnname
= ansi_assopname (code2
);
4996 fnname
= ansi_opname (code
);
4998 arg1
= prep_operand (arg1
);
5004 case VEC_DELETE_EXPR
:
5006 /* Use build_op_new_call and build_op_delete_call instead. */
5010 /* Use build_op_call instead. */
5013 case TRUTH_ORIF_EXPR
:
5014 case TRUTH_ANDIF_EXPR
:
5015 case TRUTH_AND_EXPR
:
5017 /* These are saved for the sake of warn_logical_operator. */
5018 code_orig_arg1
= TREE_CODE (arg1
);
5019 code_orig_arg2
= TREE_CODE (arg2
);
5025 arg2
= prep_operand (arg2
);
5026 arg3
= prep_operand (arg3
);
5028 if (code
== COND_EXPR
)
5029 /* Use build_conditional_expr instead. */
5031 else if (! IS_OVERLOAD_TYPE (TREE_TYPE (arg1
))
5032 && (! arg2
|| ! IS_OVERLOAD_TYPE (TREE_TYPE (arg2
))))
5035 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5036 arg2
= integer_zero_node
;
5038 arglist
= VEC_alloc (tree
, gc
, 3);
5039 VEC_quick_push (tree
, arglist
, arg1
);
5040 if (arg2
!= NULL_TREE
)
5041 VEC_quick_push (tree
, arglist
, arg2
);
5042 if (arg3
!= NULL_TREE
)
5043 VEC_quick_push (tree
, arglist
, arg3
);
5045 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5046 p
= conversion_obstack_alloc (0);
5048 /* Add namespace-scope operators to the list of functions to
5050 add_candidates (lookup_function_nonclass (fnname
, arglist
, /*block_p=*/true),
5051 NULL_TREE
, arglist
, NULL_TREE
,
5052 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5053 flags
, &candidates
, complain
);
5054 /* Add class-member operators to the candidate set. */
5055 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5059 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5060 if (fns
== error_mark_node
)
5062 result
= error_mark_node
;
5063 goto user_defined_result_ready
;
5066 add_candidates (BASELINK_FUNCTIONS (fns
),
5067 NULL_TREE
, arglist
, NULL_TREE
,
5069 BASELINK_BINFO (fns
),
5070 BASELINK_ACCESS_BINFO (fns
),
5071 flags
, &candidates
, complain
);
5076 args
[2] = NULL_TREE
;
5078 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5085 /* For these, the built-in candidates set is empty
5086 [over.match.oper]/3. We don't want non-strict matches
5087 because exact matches are always possible with built-in
5088 operators. The built-in candidate set for COMPONENT_REF
5089 would be empty too, but since there are no such built-in
5090 operators, we accept non-strict matches for them. */
5095 strict_p
= pedantic
;
5099 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5104 case POSTINCREMENT_EXPR
:
5105 case POSTDECREMENT_EXPR
:
5106 /* Don't try anything fancy if we're not allowed to produce
5108 if (!(complain
& tf_error
))
5109 return error_mark_node
;
5111 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5112 distinguish between prefix and postfix ++ and
5113 operator++() was used for both, so we allow this with
5117 const char *msg
= (flag_permissive
)
5118 ? G_("no %<%D(int)%> declared for postfix %qs,"
5119 " trying prefix operator instead")
5120 : G_("no %<%D(int)%> declared for postfix %qs");
5121 permerror (loc
, msg
, fnname
, operator_name_info
[code
].name
);
5124 if (!flag_permissive
)
5125 return error_mark_node
;
5127 if (code
== POSTINCREMENT_EXPR
)
5128 code
= PREINCREMENT_EXPR
;
5130 code
= PREDECREMENT_EXPR
;
5131 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5132 NULL_TREE
, overload
, complain
);
5135 /* The caller will deal with these. */
5140 result_valid_p
= true;
5144 if (complain
& tf_error
)
5146 /* If one of the arguments of the operator represents
5147 an invalid use of member function pointer, try to report
5148 a meaningful error ... */
5149 if (invalid_nonstatic_memfn_p (arg1
, tf_error
)
5150 || invalid_nonstatic_memfn_p (arg2
, tf_error
)
5151 || invalid_nonstatic_memfn_p (arg3
, tf_error
))
5152 /* We displayed the error message. */;
5155 /* ... Otherwise, report the more generic
5156 "no matching operator found" error */
5157 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
5158 print_z_candidates (loc
, candidates
);
5161 result
= error_mark_node
;
5167 cand
= tourney (candidates
, complain
);
5170 if (complain
& tf_error
)
5172 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
5173 print_z_candidates (loc
, candidates
);
5175 result
= error_mark_node
;
5177 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
5180 *overload
= cand
->fn
;
5182 if (resolve_args (arglist
, complain
) == NULL
)
5183 result
= error_mark_node
;
5185 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5189 /* Give any warnings we noticed during overload resolution. */
5190 if (cand
->warnings
&& (complain
& tf_warning
))
5192 struct candidate_warning
*w
;
5193 for (w
= cand
->warnings
; w
; w
= w
->next
)
5194 joust (cand
, w
->loser
, 1, complain
);
5197 /* Check for comparison of different enum types. */
5206 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
5207 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
5208 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
5209 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
5210 && (complain
& tf_warning
))
5212 warning (OPT_Wenum_compare
,
5213 "comparison between %q#T and %q#T",
5214 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
5221 /* We need to strip any leading REF_BIND so that bitfields
5222 don't cause errors. This should not remove any important
5223 conversions, because builtins don't apply to class
5224 objects directly. */
5225 conv
= cand
->convs
[0];
5226 if (conv
->kind
== ck_ref_bind
)
5227 conv
= next_conversion (conv
);
5228 arg1
= convert_like (conv
, arg1
, complain
);
5232 conv
= cand
->convs
[1];
5233 if (conv
->kind
== ck_ref_bind
)
5234 conv
= next_conversion (conv
);
5236 arg2
= decay_conversion (arg2
, complain
);
5238 /* We need to call warn_logical_operator before
5239 converting arg2 to a boolean_type, but after
5240 decaying an enumerator to its value. */
5241 if (complain
& tf_warning
)
5242 warn_logical_operator (loc
, code
, boolean_type_node
,
5243 code_orig_arg1
, arg1
,
5244 code_orig_arg2
, arg2
);
5246 arg2
= convert_like (conv
, arg2
, complain
);
5250 conv
= cand
->convs
[2];
5251 if (conv
->kind
== ck_ref_bind
)
5252 conv
= next_conversion (conv
);
5253 arg3
= convert_like (conv
, arg3
, complain
);
5259 user_defined_result_ready
:
5261 /* Free all the conversions we allocated. */
5262 obstack_free (&conversion_obstack
, p
);
5264 if (result
|| result_valid_p
)
5271 return cp_build_modify_expr (arg1
, code2
, arg2
, complain
);
5274 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
5276 case TRUTH_ANDIF_EXPR
:
5277 case TRUTH_ORIF_EXPR
:
5278 case TRUTH_AND_EXPR
:
5280 warn_logical_operator (loc
, code
, boolean_type_node
,
5281 code_orig_arg1
, arg1
, code_orig_arg2
, arg2
);
5286 case TRUNC_DIV_EXPR
:
5297 case TRUNC_MOD_EXPR
:
5301 return cp_build_binary_op (input_location
, code
, arg1
, arg2
, complain
);
5303 case UNARY_PLUS_EXPR
:
5306 case TRUTH_NOT_EXPR
:
5307 case PREINCREMENT_EXPR
:
5308 case POSTINCREMENT_EXPR
:
5309 case PREDECREMENT_EXPR
:
5310 case POSTDECREMENT_EXPR
:
5314 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
5317 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
5320 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_NULL
,
5324 /* The caller will deal with these. */
5336 /* Wrapper for above. */
5339 build_new_op (location_t loc
, enum tree_code code
, int flags
,
5340 tree arg1
, tree arg2
, tree arg3
,
5341 tree
*overload
, tsubst_flags_t complain
)
5344 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5345 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
5346 overload
, complain
);
5347 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5351 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
5352 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
5355 non_placement_deallocation_fn_p (tree t
)
5357 /* A template instance is never a usual deallocation function,
5358 regardless of its signature. */
5359 if (TREE_CODE (t
) == TEMPLATE_DECL
5360 || primary_template_instantiation_p (t
))
5363 /* If a class T has a member deallocation function named operator delete
5364 with exactly one parameter, then that function is a usual
5365 (non-placement) deallocation function. If class T does not declare
5366 such an operator delete but does declare a member deallocation
5367 function named operator delete with exactly two parameters, the second
5368 of which has type std::size_t (18.2), then this function is a usual
5369 deallocation function. */
5370 t
= FUNCTION_ARG_CHAIN (t
);
5371 if (t
== void_list_node
5372 || (t
&& same_type_p (TREE_VALUE (t
), size_type_node
)
5373 && TREE_CHAIN (t
) == void_list_node
))
5378 /* Build a call to operator delete. This has to be handled very specially,
5379 because the restrictions on what signatures match are different from all
5380 other call instances. For a normal delete, only a delete taking (void *)
5381 or (void *, size_t) is accepted. For a placement delete, only an exact
5382 match with the placement new is accepted.
5384 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
5385 ADDR is the pointer to be deleted.
5386 SIZE is the size of the memory block to be deleted.
5387 GLOBAL_P is true if the delete-expression should not consider
5388 class-specific delete operators.
5389 PLACEMENT is the corresponding placement new call, or NULL_TREE.
5391 If this call to "operator delete" is being generated as part to
5392 deallocate memory allocated via a new-expression (as per [expr.new]
5393 which requires that if the initialization throws an exception then
5394 we call a deallocation function), then ALLOC_FN is the allocation
5398 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
5399 bool global_p
, tree placement
,
5400 tree alloc_fn
, tsubst_flags_t complain
)
5402 tree fn
= NULL_TREE
;
5403 tree fns
, fnname
, type
, t
;
5405 if (addr
== error_mark_node
)
5406 return error_mark_node
;
5408 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
5410 fnname
= ansi_opname (code
);
5412 if (CLASS_TYPE_P (type
)
5413 && COMPLETE_TYPE_P (complete_type (type
))
5417 If the result of the lookup is ambiguous or inaccessible, or if
5418 the lookup selects a placement deallocation function, the
5419 program is ill-formed.
5421 Therefore, we ask lookup_fnfields to complain about ambiguity. */
5423 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
5424 if (fns
== error_mark_node
)
5425 return error_mark_node
;
5430 if (fns
== NULL_TREE
)
5431 fns
= lookup_name_nonclass (fnname
);
5433 /* Strip const and volatile from addr. */
5434 addr
= cp_convert (ptr_type_node
, addr
, complain
);
5438 /* "A declaration of a placement deallocation function matches the
5439 declaration of a placement allocation function if it has the same
5440 number of parameters and, after parameter transformations (8.3.5),
5441 all parameter types except the first are identical."
5443 So we build up the function type we want and ask instantiate_type
5444 to get it for us. */
5445 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
5446 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
5447 t
= build_function_type (void_type_node
, t
);
5449 fn
= instantiate_type (t
, fns
, tf_none
);
5450 if (fn
== error_mark_node
)
5453 if (BASELINK_P (fn
))
5454 fn
= BASELINK_FUNCTIONS (fn
);
5456 /* "If the lookup finds the two-parameter form of a usual deallocation
5457 function (3.7.4.2) and that function, considered as a placement
5458 deallocation function, would have been selected as a match for the
5459 allocation function, the program is ill-formed." */
5460 if (non_placement_deallocation_fn_p (fn
))
5462 /* But if the class has an operator delete (void *), then that is
5463 the usual deallocation function, so we shouldn't complain
5464 about using the operator delete (void *, size_t). */
5465 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
5466 t
; t
= OVL_NEXT (t
))
5468 tree elt
= OVL_CURRENT (t
);
5469 if (non_placement_deallocation_fn_p (elt
)
5470 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
5473 if (complain
& tf_error
)
5475 permerror (0, "non-placement deallocation function %q+D", fn
);
5476 permerror (input_location
, "selected for placement delete");
5479 return error_mark_node
;
5484 /* "Any non-placement deallocation function matches a non-placement
5485 allocation function. If the lookup finds a single matching
5486 deallocation function, that function will be called; otherwise, no
5487 deallocation function will be called." */
5488 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
5489 t
; t
= OVL_NEXT (t
))
5491 tree elt
= OVL_CURRENT (t
);
5492 if (non_placement_deallocation_fn_p (elt
))
5495 /* "If a class T has a member deallocation function named
5496 operator delete with exactly one parameter, then that
5497 function is a usual (non-placement) deallocation
5498 function. If class T does not declare such an operator
5499 delete but does declare a member deallocation function named
5500 operator delete with exactly two parameters, the second of
5501 which has type std::size_t (18.2), then this function is a
5502 usual deallocation function."
5504 So (void*) beats (void*, size_t). */
5505 if (FUNCTION_ARG_CHAIN (fn
) == void_list_node
)
5510 /* If we have a matching function, call it. */
5513 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
5515 /* If the FN is a member function, make sure that it is
5517 if (BASELINK_P (fns
))
5518 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
5521 /* Core issue 901: It's ok to new a type with deleted delete. */
5522 if (DECL_DELETED_FN (fn
) && alloc_fn
)
5527 /* The placement args might not be suitable for overload
5528 resolution at this point, so build the call directly. */
5529 int nargs
= call_expr_nargs (placement
);
5530 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
5533 for (i
= 1; i
< nargs
; i
++)
5534 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
5536 return build_cxx_call (fn
, nargs
, argarray
);
5541 VEC(tree
,gc
) *args
= VEC_alloc (tree
, gc
, 2);
5542 VEC_quick_push (tree
, args
, addr
);
5543 if (FUNCTION_ARG_CHAIN (fn
) != void_list_node
)
5544 VEC_quick_push (tree
, args
, size
);
5545 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
5546 VEC_free (tree
, gc
, args
);
5553 If no unambiguous matching deallocation function can be found,
5554 propagating the exception does not cause the object's memory to
5558 if ((complain
& tf_warning
)
5560 warning (0, "no corresponding deallocation function for %qD",
5565 if (complain
& tf_error
)
5566 error ("no suitable %<operator %s%> for %qT",
5567 operator_name_info
[(int)code
].name
, type
);
5568 return error_mark_node
;
5571 /* If the current scope isn't allowed to access DECL along
5572 BASETYPE_PATH, give an error. The most derived class in
5573 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
5574 the declaration to use in the error diagnostic. */
5577 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
5578 tsubst_flags_t complain
)
5580 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
5582 if (!accessible_p (basetype_path
, decl
, true))
5584 if (complain
& tf_error
)
5586 if (TREE_PRIVATE (decl
))
5587 error ("%q+#D is private", diag_decl
);
5588 else if (TREE_PROTECTED (decl
))
5589 error ("%q+#D is protected", diag_decl
);
5591 error ("%q+#D is inaccessible", diag_decl
);
5592 error ("within this context");
5600 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
5601 bitwise or of LOOKUP_* values. If any errors are warnings are
5602 generated, set *DIAGNOSTIC_FN to "error" or "warning",
5603 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
5607 build_temp (tree expr
, tree type
, int flags
,
5608 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
5613 savew
= warningcount
, savee
= errorcount
;
5614 args
= make_tree_vector_single (expr
);
5615 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
5616 &args
, type
, flags
, complain
);
5617 release_tree_vector (args
);
5618 if (warningcount
> savew
)
5619 *diagnostic_kind
= DK_WARNING
;
5620 else if (errorcount
> savee
)
5621 *diagnostic_kind
= DK_ERROR
;
5623 *diagnostic_kind
= DK_UNSPECIFIED
;
5627 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
5628 EXPR is implicitly converted to type TOTYPE.
5629 FN and ARGNUM are used for diagnostics. */
5632 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
5634 /* Issue warnings about peculiar, but valid, uses of NULL. */
5635 if (expr
== null_node
&& TREE_CODE (totype
) != BOOLEAN_TYPE
5636 && ARITHMETIC_TYPE_P (totype
))
5638 source_location loc
=
5639 expansion_point_location_if_in_system_header (input_location
);
5642 warning_at (loc
, OPT_Wconversion_null
,
5643 "passing NULL to non-pointer argument %P of %qD",
5646 warning_at (loc
, OPT_Wconversion_null
,
5647 "converting to non-pointer type %qT from NULL", totype
);
5650 /* Issue warnings if "false" is converted to a NULL pointer */
5651 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
5652 && TYPE_PTR_P (totype
))
5655 warning_at (input_location
, OPT_Wconversion_null
,
5656 "converting %<false%> to pointer type for argument %P "
5657 "of %qD", argnum
, fn
);
5659 warning_at (input_location
, OPT_Wconversion_null
,
5660 "converting %<false%> to pointer type %qT", totype
);
5664 /* Perform the conversions in CONVS on the expression EXPR. FN and
5665 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
5666 indicates the `this' argument of a method. INNER is nonzero when
5667 being called to continue a conversion chain. It is negative when a
5668 reference binding will be applied, positive otherwise. If
5669 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
5670 conversions will be emitted if appropriate. If C_CAST_P is true,
5671 this conversion is coming from a C-style cast; in that case,
5672 conversions to inaccessible bases are permitted. */
5675 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
5676 int inner
, bool issue_conversion_warnings
,
5677 bool c_cast_p
, tsubst_flags_t complain
)
5679 tree totype
= convs
->type
;
5680 diagnostic_t diag_kind
;
5682 location_t loc
= EXPR_LOC_OR_HERE (expr
);
5684 if (convs
->bad_p
&& !(complain
& tf_error
))
5685 return error_mark_node
;
5688 && convs
->kind
!= ck_user
5689 && convs
->kind
!= ck_list
5690 && convs
->kind
!= ck_ambig
5691 && (convs
->kind
!= ck_ref_bind
5692 || convs
->user_conv_p
)
5693 && convs
->kind
!= ck_rvalue
5694 && convs
->kind
!= ck_base
)
5696 conversion
*t
= convs
;
5698 /* Give a helpful error if this is bad because of excess braces. */
5699 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
5700 && SCALAR_TYPE_P (totype
)
5701 && CONSTRUCTOR_NELTS (expr
) > 0
5702 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
5703 permerror (loc
, "too many braces around initializer for %qT", totype
);
5705 for (; t
; t
= next_conversion (t
))
5707 if (t
->kind
== ck_user
&& t
->cand
->reason
)
5709 permerror (loc
, "invalid user-defined conversion "
5710 "from %qT to %qT", TREE_TYPE (expr
), totype
);
5711 print_z_candidate (loc
, "candidate is:", t
->cand
);
5712 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
5713 /*issue_conversion_warnings=*/false,
5716 if (convs
->kind
== ck_ref_bind
)
5717 return convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
5718 LOOKUP_NORMAL
, NULL_TREE
,
5721 return cp_convert (totype
, expr
, complain
);
5723 else if (t
->kind
== ck_user
|| !t
->bad_p
)
5725 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
5726 /*issue_conversion_warnings=*/false,
5731 else if (t
->kind
== ck_ambig
)
5732 return convert_like_real (t
, expr
, fn
, argnum
, 1,
5733 /*issue_conversion_warnings=*/false,
5736 else if (t
->kind
== ck_identity
)
5740 permerror (loc
, "invalid conversion from %qT to %qT",
5741 TREE_TYPE (expr
), totype
);
5743 permerror (DECL_SOURCE_LOCATION (fn
),
5744 " initializing argument %P of %qD", argnum
, fn
);
5746 return cp_convert (totype
, expr
, complain
);
5749 if (issue_conversion_warnings
&& (complain
& tf_warning
))
5750 conversion_null_warnings (totype
, expr
, fn
, argnum
);
5752 switch (convs
->kind
)
5756 struct z_candidate
*cand
= convs
->cand
;
5757 tree convfn
= cand
->fn
;
5760 /* If we're initializing from {}, it's value-initialization. */
5761 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
5762 && CONSTRUCTOR_NELTS (expr
) == 0
5763 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
5765 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
5766 expr
= build_value_init (totype
, complain
);
5767 expr
= get_target_expr_sfinae (expr
, complain
);
5768 if (expr
!= error_mark_node
)
5770 TARGET_EXPR_LIST_INIT_P (expr
) = true;
5771 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
5776 expr
= mark_rvalue_use (expr
);
5778 /* When converting from an init list we consider explicit
5779 constructors, but actually trying to call one is an error. */
5780 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
5781 /* Unless this is for direct-list-initialization. */
5782 && !(BRACE_ENCLOSED_INITIALIZER_P (expr
)
5783 && CONSTRUCTOR_IS_DIRECT_INIT (expr
))
5784 /* Unless we're calling it for value-initialization from an
5785 empty list, since that is handled separately in 8.5.4. */
5786 && cand
->num_convs
> 0)
5788 error ("converting to %qT from initializer list would use "
5789 "explicit constructor %qD", totype
, convfn
);
5792 /* Set user_conv_p on the argument conversions, so rvalue/base
5793 handling knows not to allow any more UDCs. */
5794 for (i
= 0; i
< cand
->num_convs
; ++i
)
5795 cand
->convs
[i
]->user_conv_p
= true;
5797 expr
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5799 /* If this is a constructor or a function returning an aggr type,
5800 we need to build up a TARGET_EXPR. */
5801 if (DECL_CONSTRUCTOR_P (convfn
))
5803 expr
= build_cplus_new (totype
, expr
, complain
);
5805 /* Remember that this was list-initialization. */
5806 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
5807 TARGET_EXPR_LIST_INIT_P (expr
) = true;
5813 expr
= mark_rvalue_use (expr
);
5814 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
5816 int nelts
= CONSTRUCTOR_NELTS (expr
);
5818 expr
= build_value_init (totype
, complain
);
5819 else if (nelts
== 1)
5820 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
5825 if (type_unknown_p (expr
))
5826 expr
= instantiate_type (totype
, expr
, complain
);
5827 /* Convert a constant to its underlying value, unless we are
5828 about to bind it to a reference, in which case we need to
5829 leave it as an lvalue. */
5832 expr
= decl_constant_value_safe (expr
);
5833 if (expr
== null_node
&& INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
5834 /* If __null has been converted to an integer type, we do not
5835 want to warn about uses of EXPR as an integer, rather than
5837 expr
= build_int_cst (totype
, 0);
5841 /* We leave bad_p off ck_ambig because overload resolution considers
5842 it valid, it just fails when we try to perform it. So we need to
5843 check complain here, too. */
5844 if (complain
& tf_error
)
5846 /* Call build_user_type_conversion again for the error. */
5847 build_user_type_conversion (totype
, convs
->u
.expr
, LOOKUP_NORMAL
,
5850 error (" initializing argument %P of %q+D", argnum
, fn
);
5852 return error_mark_node
;
5856 /* Conversion to std::initializer_list<T>. */
5857 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
5858 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
5859 unsigned len
= CONSTRUCTOR_NELTS (expr
);
5860 tree array
, val
, field
;
5861 VEC(constructor_elt
,gc
) *vec
= NULL
;
5864 /* Convert all the elements. */
5865 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
5867 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
5868 1, false, false, complain
);
5869 if (sub
== error_mark_node
)
5871 if (!BRACE_ENCLOSED_INITIALIZER_P (val
))
5872 check_narrowing (TREE_TYPE (sub
), val
);
5873 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
5874 if (!TREE_CONSTANT (sub
))
5875 TREE_CONSTANT (new_ctor
) = false;
5877 /* Build up the array. */
5878 elttype
= cp_build_qualified_type
5879 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
5880 array
= build_array_of_n_type (elttype
, len
);
5881 array
= finish_compound_literal (array
, new_ctor
, complain
);
5882 /* Take the address explicitly rather than via decay_conversion
5883 to avoid the error about taking the address of a temporary. */
5884 array
= cp_build_addr_expr (array
, complain
);
5885 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
5887 /* Build up the initializer_list object. */
5888 totype
= complete_type (totype
);
5889 field
= next_initializable_field (TYPE_FIELDS (totype
));
5890 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
5891 field
= next_initializable_field (DECL_CHAIN (field
));
5892 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
5893 new_ctor
= build_constructor (totype
, vec
);
5894 return get_target_expr (new_ctor
);
5898 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
5900 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
5901 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
5902 real
= perform_implicit_conversion (TREE_TYPE (totype
),
5904 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
5906 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
5907 return fold_if_not_in_template (expr
);
5909 expr
= reshape_init (totype
, expr
, complain
);
5910 return get_target_expr (digest_init (totype
, expr
, complain
));
5916 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
5917 convs
->kind
== ck_ref_bind
? -1 : 1,
5918 convs
->kind
== ck_ref_bind
? issue_conversion_warnings
: false,
5921 if (expr
== error_mark_node
)
5922 return error_mark_node
;
5924 switch (convs
->kind
)
5927 expr
= decay_conversion (expr
, complain
);
5928 if (expr
== error_mark_node
)
5929 return error_mark_node
;
5931 if (! MAYBE_CLASS_TYPE_P (totype
))
5933 /* Else fall through. */
5935 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
5937 /* We are going to bind a reference directly to a base-class
5938 subobject of EXPR. */
5939 /* Build an expression for `*((base*) &expr)'. */
5940 expr
= cp_build_addr_expr (expr
, complain
);
5941 expr
= convert_to_base (expr
, build_pointer_type (totype
),
5942 !c_cast_p
, /*nonnull=*/true, complain
);
5943 expr
= cp_build_indirect_ref (expr
, RO_IMPLICIT_CONVERSION
, complain
);
5947 /* Copy-initialization where the cv-unqualified version of the source
5948 type is the same class as, or a derived class of, the class of the
5949 destination [is treated as direct-initialization]. [dcl.init] */
5950 flags
= LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
;
5951 if (convs
->user_conv_p
)
5952 /* This conversion is being done in the context of a user-defined
5953 conversion (i.e. the second step of copy-initialization), so
5954 don't allow any more. */
5955 flags
|= LOOKUP_NO_CONVERSION
;
5956 if (convs
->rvaluedness_matches_p
)
5957 flags
|= LOOKUP_PREFER_RVALUE
;
5958 if (TREE_CODE (expr
) == TARGET_EXPR
5959 && TARGET_EXPR_LIST_INIT_P (expr
))
5960 /* Copy-list-initialization doesn't actually involve a copy. */
5962 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
5963 if (diag_kind
&& fn
&& complain
)
5964 emit_diagnostic (diag_kind
, DECL_SOURCE_LOCATION (fn
), 0,
5965 " initializing argument %P of %qD", argnum
, fn
);
5966 return build_cplus_new (totype
, expr
, complain
);
5970 tree ref_type
= totype
;
5972 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
5974 gcc_assert (TYPE_REF_IS_RVALUE (ref_type
)
5975 && real_lvalue_p (expr
));
5977 error_at (loc
, "cannot bind %qT lvalue to %qT",
5978 TREE_TYPE (expr
), totype
);
5980 error (" initializing argument %P of %q+D", argnum
, fn
);
5981 return error_mark_node
;
5984 /* If necessary, create a temporary.
5986 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
5987 that need temporaries, even when their types are reference
5988 compatible with the type of reference being bound, so the
5989 upcoming call to cp_build_addr_expr doesn't fail. */
5990 if (convs
->need_temporary_p
5991 || TREE_CODE (expr
) == CONSTRUCTOR
5992 || TREE_CODE (expr
) == VA_ARG_EXPR
)
5994 /* Otherwise, a temporary of type "cv1 T1" is created and
5995 initialized from the initializer expression using the rules
5996 for a non-reference copy-initialization (8.5). */
5998 tree type
= TREE_TYPE (ref_type
);
5999 cp_lvalue_kind lvalue
= real_lvalue_p (expr
);
6001 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6002 (type
, next_conversion (convs
)->type
));
6003 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
6004 && !TYPE_REF_IS_RVALUE (ref_type
))
6006 /* If the reference is volatile or non-const, we
6007 cannot create a temporary. */
6008 if (lvalue
& clk_bitfield
)
6009 error_at (loc
, "cannot bind bitfield %qE to %qT",
6011 else if (lvalue
& clk_packed
)
6012 error_at (loc
, "cannot bind packed field %qE to %qT",
6015 error_at (loc
, "cannot bind rvalue %qE to %qT",
6017 return error_mark_node
;
6019 /* If the source is a packed field, and we must use a copy
6020 constructor, then building the target expr will require
6021 binding the field to the reference parameter to the
6022 copy constructor, and we'll end up with an infinite
6023 loop. If we can use a bitwise copy, then we'll be
6025 if ((lvalue
& clk_packed
)
6026 && CLASS_TYPE_P (type
)
6027 && type_has_nontrivial_copy_init (type
))
6029 error_at (loc
, "cannot bind packed field %qE to %qT",
6031 return error_mark_node
;
6033 if (lvalue
& clk_bitfield
)
6035 expr
= convert_bitfield_to_declared_type (expr
);
6036 expr
= fold_convert (type
, expr
);
6038 expr
= build_target_expr_with_type (expr
, type
, complain
);
6041 /* Take the address of the thing to which we will bind the
6043 expr
= cp_build_addr_expr (expr
, complain
);
6044 if (expr
== error_mark_node
)
6045 return error_mark_node
;
6047 /* Convert it to a pointer to the type referred to by the
6048 reference. This will adjust the pointer if a derived to
6049 base conversion is being performed. */
6050 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
6052 /* Convert the pointer to the desired reference type. */
6053 return build_nop (ref_type
, expr
);
6057 return decay_conversion (expr
, complain
);
6060 /* Warn about deprecated conversion if appropriate. */
6061 string_conv_p (totype
, expr
, 1);
6066 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
6067 /*nonnull=*/false, complain
);
6068 return build_nop (totype
, expr
);
6071 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
6072 c_cast_p
, complain
);
6078 if (convs
->check_narrowing
)
6079 check_narrowing (totype
, expr
);
6081 if (issue_conversion_warnings
&& (complain
& tf_warning
))
6082 expr
= convert_and_check (totype
, expr
);
6084 expr
= convert (totype
, expr
);
6089 /* ARG is being passed to a varargs function. Perform any conversions
6090 required. Return the converted value. */
6093 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
6096 location_t loc
= EXPR_LOC_OR_HERE (arg
);
6100 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6101 standard conversions are performed. */
6102 arg
= decay_conversion (arg
, complain
);
6103 arg_type
= TREE_TYPE (arg
);
6106 If the argument has integral or enumeration type that is subject
6107 to the integral promotions (_conv.prom_), or a floating point
6108 type that is subject to the floating point promotion
6109 (_conv.fpprom_), the value of the argument is converted to the
6110 promoted type before the call. */
6111 if (TREE_CODE (arg_type
) == REAL_TYPE
6112 && (TYPE_PRECISION (arg_type
)
6113 < TYPE_PRECISION (double_type_node
))
6114 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
6116 if ((complain
& tf_warning
)
6117 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
6118 warning_at (loc
, OPT_Wdouble_promotion
,
6119 "implicit conversion from %qT to %qT when passing "
6120 "argument to function",
6121 arg_type
, double_type_node
);
6122 arg
= convert_to_real (double_type_node
, arg
);
6124 else if (NULLPTR_TYPE_P (arg_type
))
6125 arg
= null_pointer_node
;
6126 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
6128 if (SCOPED_ENUM_P (arg_type
) && !abi_version_at_least (6))
6130 if (complain
& tf_warning
)
6131 warning_at (loc
, OPT_Wabi
, "scoped enum %qT will not promote to an "
6132 "integral type in a future version of GCC", arg_type
);
6133 arg
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
, complain
);
6135 arg
= cp_perform_integral_promotions (arg
, complain
);
6138 arg
= require_complete_type (arg
);
6139 arg_type
= TREE_TYPE (arg
);
6141 if (arg
!= error_mark_node
6142 /* In a template (or ill-formed code), we can have an incomplete type
6143 even after require_complete_type, in which case we don't know
6144 whether it has trivial copy or not. */
6145 && COMPLETE_TYPE_P (arg_type
))
6147 /* Build up a real lvalue-to-rvalue conversion in case the
6148 copy constructor is trivial but not callable. */
6149 if (!cp_unevaluated_operand
&& CLASS_TYPE_P (arg_type
))
6150 force_rvalue (arg
, complain
);
6152 /* [expr.call] 5.2.2/7:
6153 Passing a potentially-evaluated argument of class type (Clause 9)
6154 with a non-trivial copy constructor or a non-trivial destructor
6155 with no corresponding parameter is conditionally-supported, with
6156 implementation-defined semantics.
6158 We used to just warn here and do a bitwise copy, but now
6159 cp_expr_size will abort if we try to do that.
6161 If the call appears in the context of a sizeof expression,
6162 it is not potentially-evaluated. */
6163 if (cp_unevaluated_operand
== 0
6164 && (type_has_nontrivial_copy_init (arg_type
)
6165 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
)))
6167 if (complain
& tf_error
)
6168 error_at (loc
, "cannot pass objects of non-trivially-copyable "
6169 "type %q#T through %<...%>", arg_type
);
6171 return error_mark_node
;
6178 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
6181 build_x_va_arg (source_location loc
, tree expr
, tree type
)
6183 if (processing_template_decl
)
6184 return build_min (VA_ARG_EXPR
, type
, expr
);
6186 type
= complete_type_or_else (type
, NULL_TREE
);
6188 if (expr
== error_mark_node
|| !type
)
6189 return error_mark_node
;
6191 expr
= mark_lvalue_use (expr
);
6193 if (type_has_nontrivial_copy_init (type
)
6194 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
6195 || TREE_CODE (type
) == REFERENCE_TYPE
)
6197 /* Remove reference types so we don't ICE later on. */
6198 tree type1
= non_reference (type
);
6199 /* conditionally-supported behavior [expr.call] 5.2.2/7. */
6200 error ("cannot receive objects of non-trivially-copyable type %q#T "
6201 "through %<...%>; ", type
);
6202 expr
= convert (build_pointer_type (type1
), null_node
);
6203 expr
= cp_build_indirect_ref (expr
, RO_NULL
, tf_warning_or_error
);
6207 return build_va_arg (loc
, expr
, type
);
6210 /* TYPE has been given to va_arg. Apply the default conversions which
6211 would have happened when passed via ellipsis. Return the promoted
6212 type, or the passed type if there is no change. */
6215 cxx_type_promotes_to (tree type
)
6219 /* Perform the array-to-pointer and function-to-pointer
6221 type
= type_decays_to (type
);
6223 promote
= type_promotes_to (type
);
6224 if (same_type_p (type
, promote
))
6230 /* ARG is a default argument expression being passed to a parameter of
6231 the indicated TYPE, which is a parameter to FN. PARMNUM is the
6232 zero-based argument number. Do any required conversions. Return
6233 the converted value. */
6235 static GTY(()) VEC(tree
,gc
) *default_arg_context
;
6237 push_defarg_context (tree fn
)
6238 { VEC_safe_push (tree
, gc
, default_arg_context
, fn
); }
6240 pop_defarg_context (void)
6241 { VEC_pop (tree
, default_arg_context
); }
6244 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
6245 tsubst_flags_t complain
)
6250 /* See through clones. */
6251 fn
= DECL_ORIGIN (fn
);
6253 /* Detect recursion. */
6254 FOR_EACH_VEC_ELT (tree
, default_arg_context
, i
, t
)
6257 if (complain
& tf_error
)
6258 error ("recursive evaluation of default argument for %q#D", fn
);
6259 return error_mark_node
;
6262 /* If the ARG is an unparsed default argument expression, the
6263 conversion cannot be performed. */
6264 if (TREE_CODE (arg
) == DEFAULT_ARG
)
6266 if (complain
& tf_error
)
6267 error ("call to %qD uses the default argument for parameter %P, which "
6268 "is not yet defined", fn
, parmnum
);
6269 return error_mark_node
;
6272 push_defarg_context (fn
);
6274 if (fn
&& DECL_TEMPLATE_INFO (fn
))
6275 arg
= tsubst_default_argument (fn
, type
, arg
);
6281 The names in the expression are bound, and the semantic
6282 constraints are checked, at the point where the default
6283 expressions appears.
6285 we must not perform access checks here. */
6286 push_deferring_access_checks (dk_no_check
);
6287 /* We must make a copy of ARG, in case subsequent processing
6288 alters any part of it. */
6289 arg
= break_out_target_exprs (arg
);
6290 if (TREE_CODE (arg
) == CONSTRUCTOR
)
6292 arg
= digest_init (type
, arg
, complain
);
6293 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
6294 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
6299 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
6300 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
6302 arg
= convert_for_arg_passing (type
, arg
, complain
);
6304 pop_deferring_access_checks();
6306 pop_defarg_context ();
6311 /* Returns the type which will really be used for passing an argument of
6315 type_passed_as (tree type
)
6317 /* Pass classes with copy ctors by invisible reference. */
6318 if (TREE_ADDRESSABLE (type
))
6320 type
= build_reference_type (type
);
6321 /* There are no other pointers to this temporary. */
6322 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
6324 else if (targetm
.calls
.promote_prototypes (type
)
6325 && INTEGRAL_TYPE_P (type
)
6326 && COMPLETE_TYPE_P (type
)
6327 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
),
6328 TYPE_SIZE (integer_type_node
)))
6329 type
= integer_type_node
;
6334 /* Actually perform the appropriate conversion. */
6337 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
6341 /* If VAL is a bitfield, then -- since it has already been converted
6342 to TYPE -- it cannot have a precision greater than TYPE.
6344 If it has a smaller precision, we must widen it here. For
6345 example, passing "int f:3;" to a function expecting an "int" will
6346 not result in any conversion before this point.
6348 If the precision is the same we must not risk widening. For
6349 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
6350 often have type "int", even though the C++ type for the field is
6351 "long long". If the value is being passed to a function
6352 expecting an "int", then no conversions will be required. But,
6353 if we call convert_bitfield_to_declared_type, the bitfield will
6354 be converted to "long long". */
6355 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
6357 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
6358 val
= convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type
), val
);
6360 if (val
== error_mark_node
)
6362 /* Pass classes with copy ctors by invisible reference. */
6363 else if (TREE_ADDRESSABLE (type
))
6364 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
6365 else if (targetm
.calls
.promote_prototypes (type
)
6366 && INTEGRAL_TYPE_P (type
)
6367 && COMPLETE_TYPE_P (type
)
6368 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
),
6369 TYPE_SIZE (integer_type_node
)))
6370 val
= cp_perform_integral_promotions (val
, complain
);
6371 if ((complain
& tf_warning
)
6372 && warn_suggest_attribute_format
)
6374 tree rhstype
= TREE_TYPE (val
);
6375 const enum tree_code coder
= TREE_CODE (rhstype
);
6376 const enum tree_code codel
= TREE_CODE (type
);
6377 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
6379 && check_missing_format_attribute (type
, rhstype
))
6380 warning (OPT_Wsuggest_attribute_format
,
6381 "argument of function call might be a candidate for a format attribute");
6386 /* Returns true iff FN is a function with magic varargs, i.e. ones for
6387 which no conversions at all should be done. This is true for some
6388 builtins which don't act like normal functions. */
6391 magic_varargs_p (tree fn
)
6393 if (DECL_BUILT_IN (fn
))
6394 switch (DECL_FUNCTION_CODE (fn
))
6396 case BUILT_IN_CLASSIFY_TYPE
:
6397 case BUILT_IN_CONSTANT_P
:
6398 case BUILT_IN_NEXT_ARG
:
6399 case BUILT_IN_VA_START
:
6403 return lookup_attribute ("type generic",
6404 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
6410 /* Subroutine of the various build_*_call functions. Overload resolution
6411 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
6412 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
6413 bitmask of various LOOKUP_* flags which apply to the call itself. */
6416 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
6419 const VEC(tree
,gc
) *args
= cand
->args
;
6420 tree first_arg
= cand
->first_arg
;
6421 conversion
**convs
= cand
->convs
;
6423 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
6428 unsigned int arg_index
= 0;
6432 bool already_used
= false;
6434 /* In a template, there is no need to perform all of the work that
6435 is normally done. We are only interested in the type of the call
6436 expression, i.e., the return type of the function. Any semantic
6437 errors will be deferred until the template is instantiated. */
6438 if (processing_template_decl
)
6442 const tree
*argarray
;
6445 return_type
= TREE_TYPE (TREE_TYPE (fn
));
6446 nargs
= VEC_length (tree
, args
);
6447 if (first_arg
== NULL_TREE
)
6448 argarray
= VEC_address (tree
, CONST_CAST (VEC(tree
,gc
) *, args
));
6456 alcarray
= XALLOCAVEC (tree
, nargs
);
6457 alcarray
[0] = first_arg
;
6458 FOR_EACH_VEC_ELT (tree
, args
, ix
, arg
)
6459 alcarray
[ix
+ 1] = arg
;
6460 argarray
= alcarray
;
6463 addr
= build_addr_func (fn
, complain
);
6464 if (addr
== error_mark_node
)
6465 return error_mark_node
;
6466 expr
= build_call_array_loc (input_location
, return_type
,
6467 addr
, nargs
, argarray
);
6468 if (TREE_THIS_VOLATILE (fn
) && cfun
)
6469 current_function_returns_abnormally
= 1;
6470 return convert_from_reference (expr
);
6473 /* Give any warnings we noticed during overload resolution. */
6474 if (cand
->warnings
&& (complain
& tf_warning
))
6476 struct candidate_warning
*w
;
6477 for (w
= cand
->warnings
; w
; w
= w
->next
)
6478 joust (cand
, w
->loser
, 1, complain
);
6481 /* Make =delete work with SFINAE. */
6482 if (DECL_DELETED_FN (fn
) && !(complain
& tf_error
))
6483 return error_mark_node
;
6485 if (DECL_FUNCTION_MEMBER_P (fn
))
6488 /* If FN is a template function, two cases must be considered.
6493 template <class T> void f();
6495 template <class T> struct B {
6499 struct C : A, B<int> {
6501 using B<int>::g; // #2
6504 In case #1 where `A::f' is a member template, DECL_ACCESS is
6505 recorded in the primary template but not in its specialization.
6506 We check access of FN using its primary template.
6508 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
6509 because it is a member of class template B, DECL_ACCESS is
6510 recorded in the specialization `B<int>::g'. We cannot use its
6511 primary template because `B<T>::g' and `B<int>::g' may have
6512 different access. */
6513 if (DECL_TEMPLATE_INFO (fn
)
6514 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
6515 access_fn
= DECL_TI_TEMPLATE (fn
);
6518 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
6520 return error_mark_node
;
6523 /* If we're checking for implicit delete, don't bother with argument
6525 if (flags
& LOOKUP_SPECULATIVE
)
6527 if (DECL_DELETED_FN (fn
))
6529 if (complain
& tf_error
)
6531 return error_mark_node
;
6533 if (cand
->viable
== 1)
6535 else if (!(complain
& tf_error
))
6536 /* Reject bad conversions now. */
6537 return error_mark_node
;
6538 /* else continue to get conversion error. */
6541 /* Find maximum size of vector to hold converted arguments. */
6542 parmlen
= list_length (parm
);
6543 nargs
= VEC_length (tree
, args
) + (first_arg
!= NULL_TREE
? 1 : 0);
6544 if (parmlen
> nargs
)
6546 argarray
= XALLOCAVEC (tree
, nargs
);
6548 /* The implicit parameters to a constructor are not considered by overload
6549 resolution, and must be of the proper type. */
6550 if (DECL_CONSTRUCTOR_P (fn
))
6552 if (first_arg
!= NULL_TREE
)
6554 argarray
[j
++] = first_arg
;
6555 first_arg
= NULL_TREE
;
6559 argarray
[j
++] = VEC_index (tree
, args
, arg_index
);
6562 parm
= TREE_CHAIN (parm
);
6563 /* We should never try to call the abstract constructor. */
6564 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
6566 if (DECL_HAS_VTT_PARM_P (fn
))
6568 argarray
[j
++] = VEC_index (tree
, args
, arg_index
);
6570 parm
= TREE_CHAIN (parm
);
6573 /* Bypass access control for 'this' parameter. */
6574 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
6576 tree parmtype
= TREE_VALUE (parm
);
6577 tree arg
= (first_arg
!= NULL_TREE
6579 : VEC_index (tree
, args
, arg_index
));
6580 tree argtype
= TREE_TYPE (arg
);
6584 if (convs
[i
]->bad_p
)
6586 if (complain
& tf_error
)
6587 permerror (input_location
, "passing %qT as %<this%> argument of %q#D discards qualifiers",
6588 TREE_TYPE (argtype
), fn
);
6590 return error_mark_node
;
6593 /* See if the function member or the whole class type is declared
6594 final and the call can be devirtualized. */
6595 if (DECL_FINAL_P (fn
)
6596 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
6597 flags
|= LOOKUP_NONVIRTUAL
;
6599 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
6600 X is called for an object that is not of type X, or of a type
6601 derived from X, the behavior is undefined.
6603 So we can assume that anything passed as 'this' is non-null, and
6604 optimize accordingly. */
6605 gcc_assert (TREE_CODE (parmtype
) == POINTER_TYPE
);
6606 /* Convert to the base in which the function was declared. */
6607 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
6608 converted_arg
= build_base_path (PLUS_EXPR
,
6610 cand
->conversion_path
,
6612 /* Check that the base class is accessible. */
6613 if (!accessible_base_p (TREE_TYPE (argtype
),
6614 BINFO_TYPE (cand
->conversion_path
), true))
6615 error ("%qT is not an accessible base of %qT",
6616 BINFO_TYPE (cand
->conversion_path
),
6617 TREE_TYPE (argtype
));
6618 /* If fn was found by a using declaration, the conversion path
6619 will be to the derived class, not the base declaring fn. We
6620 must convert from derived to base. */
6621 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
6622 TREE_TYPE (parmtype
), ba_unique
, NULL
);
6623 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
6624 base_binfo
, 1, complain
);
6626 argarray
[j
++] = converted_arg
;
6627 parm
= TREE_CHAIN (parm
);
6628 if (first_arg
!= NULL_TREE
)
6629 first_arg
= NULL_TREE
;
6636 gcc_assert (first_arg
== NULL_TREE
);
6637 for (; arg_index
< VEC_length (tree
, args
) && parm
;
6638 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
6640 tree type
= TREE_VALUE (parm
);
6641 tree arg
= VEC_index (tree
, args
, arg_index
);
6642 bool conversion_warning
= true;
6646 /* If the argument is NULL and used to (implicitly) instantiate a
6647 template function (and bind one of the template arguments to
6648 the type of 'long int'), we don't want to warn about passing NULL
6649 to non-pointer argument.
6650 For example, if we have this template function:
6652 template<typename T> void func(T x) {}
6654 we want to warn (when -Wconversion is enabled) in this case:
6660 but not in this case:
6666 if (arg
== null_node
6667 && DECL_TEMPLATE_INFO (fn
)
6668 && cand
->template_decl
6669 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
6670 conversion_warning
= false;
6672 /* Warn about initializer_list deduction that isn't currently in the
6674 if (cxx_dialect
> cxx98
6675 && flag_deduce_init_list
6676 && cand
->template_decl
6677 && is_std_init_list (non_reference (type
))
6678 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
6680 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
6681 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
6682 tree patparm
= get_pattern_parm (realparm
, tmpl
);
6683 tree pattype
= TREE_TYPE (patparm
);
6684 if (PACK_EXPANSION_P (pattype
))
6685 pattype
= PACK_EXPANSION_PATTERN (pattype
);
6686 pattype
= non_reference (pattype
);
6688 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
6689 && (cand
->explicit_targs
== NULL_TREE
6690 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
6691 <= TEMPLATE_TYPE_IDX (pattype
))))
6693 pedwarn (input_location
, 0, "deducing %qT as %qT",
6694 non_reference (TREE_TYPE (patparm
)),
6695 non_reference (type
));
6696 pedwarn (input_location
, 0, " in call to %q+D", cand
->fn
);
6697 pedwarn (input_location
, 0,
6698 " (you can disable this with -fno-deduce-init-list)");
6702 val
= convert_like_with_context (conv
, arg
, fn
, i
-is_method
,
6705 : complain
& (~tf_warning
));
6707 val
= convert_for_arg_passing (type
, val
, complain
);
6708 if (val
== error_mark_node
)
6709 return error_mark_node
;
6711 argarray
[j
++] = val
;
6714 /* Default arguments */
6715 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
6717 if (TREE_VALUE (parm
) == error_mark_node
)
6718 return error_mark_node
;
6719 argarray
[j
++] = convert_default_arg (TREE_VALUE (parm
),
6720 TREE_PURPOSE (parm
),
6726 for (; arg_index
< VEC_length (tree
, args
); ++arg_index
)
6728 tree a
= VEC_index (tree
, args
, arg_index
);
6729 if (magic_varargs_p (fn
))
6730 /* Do no conversions for magic varargs. */
6731 a
= mark_type_use (a
);
6733 a
= convert_arg_to_ellipsis (a
, complain
);
6737 gcc_assert (j
<= nargs
);
6740 check_function_arguments (TREE_TYPE (fn
), nargs
, argarray
);
6742 /* Avoid actually calling copy constructors and copy assignment operators,
6745 if (! flag_elide_constructors
)
6746 /* Do things the hard way. */;
6747 else if (cand
->num_convs
== 1
6748 && (DECL_COPY_CONSTRUCTOR_P (fn
)
6749 || DECL_MOVE_CONSTRUCTOR_P (fn
)))
6752 tree arg
= argarray
[num_artificial_parms_for (fn
)];
6754 bool trivial
= trivial_fn_p (fn
);
6756 /* Pull out the real argument, disregarding const-correctness. */
6758 while (CONVERT_EXPR_P (targ
)
6759 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
6760 targ
= TREE_OPERAND (targ
, 0);
6761 if (TREE_CODE (targ
) == ADDR_EXPR
)
6763 targ
= TREE_OPERAND (targ
, 0);
6764 if (!same_type_ignoring_top_level_qualifiers_p
6765 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
6774 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
6776 /* [class.copy]: the copy constructor is implicitly defined even if
6777 the implementation elided its use. */
6778 if (!trivial
|| DECL_DELETED_FN (fn
))
6781 already_used
= true;
6784 /* If we're creating a temp and we already have one, don't create a
6785 new one. If we're not creating a temp but we get one, use
6786 INIT_EXPR to collapse the temp into our target. Otherwise, if the
6787 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
6788 temp or an INIT_EXPR otherwise. */
6790 if (integer_zerop (fa
))
6792 if (TREE_CODE (arg
) == TARGET_EXPR
)
6795 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
6797 else if (TREE_CODE (arg
) == TARGET_EXPR
|| trivial
)
6799 tree to
= stabilize_reference (cp_build_indirect_ref (fa
, RO_NULL
,
6802 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
6806 else if (DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
6807 && trivial_fn_p (fn
)
6808 && !DECL_DELETED_FN (fn
))
6810 tree to
= stabilize_reference
6811 (cp_build_indirect_ref (argarray
[0], RO_NULL
, complain
));
6812 tree type
= TREE_TYPE (to
);
6813 tree as_base
= CLASSTYPE_AS_BASE (type
);
6814 tree arg
= argarray
[1];
6816 if (is_really_empty_class (type
))
6818 /* Avoid copying empty classes. */
6819 val
= build2 (COMPOUND_EXPR
, void_type_node
, to
, arg
);
6820 TREE_NO_WARNING (val
) = 1;
6821 val
= build2 (COMPOUND_EXPR
, type
, val
, to
);
6822 TREE_NO_WARNING (val
) = 1;
6824 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
6826 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
6827 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
6831 /* We must only copy the non-tail padding parts. */
6833 tree array_type
, alias_set
;
6835 arg2
= TYPE_SIZE_UNIT (as_base
);
6836 arg0
= cp_build_addr_expr (to
, complain
);
6838 array_type
= build_array_type (char_type_node
,
6840 (size_binop (MINUS_EXPR
,
6841 arg2
, size_int (1))));
6842 alias_set
= build_int_cst (build_pointer_type (type
), 0);
6843 t
= build2 (MODIFY_EXPR
, void_type_node
,
6844 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
6845 build2 (MEM_REF
, array_type
, arg
, alias_set
));
6846 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
6847 TREE_NO_WARNING (val
) = 1;
6852 else if (DECL_DESTRUCTOR_P (fn
)
6853 && trivial_fn_p (fn
)
6854 && !DECL_DELETED_FN (fn
))
6855 return fold_convert (void_type_node
, argarray
[0]);
6856 /* FIXME handle trivial default constructor, too. */
6861 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0)
6864 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
6867 gcc_assert (binfo
&& binfo
!= error_mark_node
);
6869 /* Warn about deprecated virtual functions now, since we're about
6870 to throw away the decl. */
6871 if (TREE_DEPRECATED (fn
))
6872 warn_deprecated_use (fn
, NULL_TREE
);
6874 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
6876 if (TREE_SIDE_EFFECTS (argarray
[0]))
6877 argarray
[0] = save_expr (argarray
[0]);
6878 t
= build_pointer_type (TREE_TYPE (fn
));
6879 if (DECL_CONTEXT (fn
) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn
)))
6880 fn
= build_java_interface_fn_ref (fn
, argarray
[0]);
6882 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
6887 fn
= build_addr_func (fn
, complain
);
6888 if (fn
== error_mark_node
)
6889 return error_mark_node
;
6892 return build_cxx_call (fn
, nargs
, argarray
);
6895 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
6896 This function performs no overload resolution, conversion, or other
6897 high-level operations. */
6900 build_cxx_call (tree fn
, int nargs
, tree
*argarray
)
6904 /* Remember roughly where this call is. */
6905 location_t loc
= EXPR_LOC_OR_HERE (fn
);
6906 fn
= build_call_a (fn
, nargs
, argarray
);
6907 SET_EXPR_LOCATION (fn
, loc
);
6909 fndecl
= get_callee_fndecl (fn
);
6911 /* Check that arguments to builtin functions match the expectations. */
6913 && DECL_BUILT_IN (fndecl
)
6914 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
6915 && !check_builtin_function_arguments (fndecl
, nargs
, argarray
))
6916 return error_mark_node
;
6918 /* Some built-in function calls will be evaluated at compile-time in
6920 fn
= fold_if_not_in_template (fn
);
6922 if (VOID_TYPE_P (TREE_TYPE (fn
)))
6925 fn
= require_complete_type (fn
);
6926 if (fn
== error_mark_node
)
6927 return error_mark_node
;
6929 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
6930 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, tf_warning_or_error
);
6931 return convert_from_reference (fn
);
6934 static GTY(()) tree java_iface_lookup_fn
;
6936 /* Make an expression which yields the address of the Java interface
6937 method FN. This is achieved by generating a call to libjava's
6938 _Jv_LookupInterfaceMethodIdx(). */
6941 build_java_interface_fn_ref (tree fn
, tree instance
)
6943 tree lookup_fn
, method
, idx
;
6944 tree klass_ref
, iface
, iface_ref
;
6947 if (!java_iface_lookup_fn
)
6949 tree ftype
= build_function_type_list (ptr_type_node
,
6950 ptr_type_node
, ptr_type_node
,
6951 java_int_type_node
, NULL_TREE
);
6952 java_iface_lookup_fn
6953 = add_builtin_function ("_Jv_LookupInterfaceMethodIdx", ftype
,
6954 0, NOT_BUILT_IN
, NULL
, NULL_TREE
);
6957 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
6958 This is the first entry in the vtable. */
6959 klass_ref
= build_vtbl_ref (cp_build_indirect_ref (instance
, RO_NULL
,
6960 tf_warning_or_error
),
6963 /* Get the java.lang.Class pointer for the interface being called. */
6964 iface
= DECL_CONTEXT (fn
);
6965 iface_ref
= lookup_field (iface
, get_identifier ("class$"), 0, false);
6966 if (!iface_ref
|| TREE_CODE (iface_ref
) != VAR_DECL
6967 || DECL_CONTEXT (iface_ref
) != iface
)
6969 error ("could not find class$ field in java interface type %qT",
6971 return error_mark_node
;
6973 iface_ref
= build_address (iface_ref
);
6974 iface_ref
= convert (build_pointer_type (iface
), iface_ref
);
6976 /* Determine the itable index of FN. */
6978 for (method
= TYPE_METHODS (iface
); method
; method
= DECL_CHAIN (method
))
6980 if (!DECL_VIRTUAL_P (method
))
6986 idx
= build_int_cst (NULL_TREE
, i
);
6988 lookup_fn
= build1 (ADDR_EXPR
,
6989 build_pointer_type (TREE_TYPE (java_iface_lookup_fn
)),
6990 java_iface_lookup_fn
);
6991 return build_call_nary (ptr_type_node
, lookup_fn
,
6992 3, klass_ref
, iface_ref
, idx
);
6995 /* Returns the value to use for the in-charge parameter when making a
6996 call to a function with the indicated NAME.
6998 FIXME:Can't we find a neater way to do this mapping? */
7001 in_charge_arg_for_name (tree name
)
7003 if (name
== base_ctor_identifier
7004 || name
== base_dtor_identifier
)
7005 return integer_zero_node
;
7006 else if (name
== complete_ctor_identifier
)
7007 return integer_one_node
;
7008 else if (name
== complete_dtor_identifier
)
7009 return integer_two_node
;
7010 else if (name
== deleting_dtor_identifier
)
7011 return integer_three_node
;
7013 /* This function should only be called with one of the names listed
7019 /* Build a call to a constructor, destructor, or an assignment
7020 operator for INSTANCE, an expression with class type. NAME
7021 indicates the special member function to call; *ARGS are the
7022 arguments. ARGS may be NULL. This may change ARGS. BINFO
7023 indicates the base of INSTANCE that is to be passed as the `this'
7024 parameter to the member function called.
7026 FLAGS are the LOOKUP_* flags to use when processing the call.
7028 If NAME indicates a complete object constructor, INSTANCE may be
7029 NULL_TREE. In this case, the caller will call build_cplus_new to
7030 store the newly constructed object into a VAR_DECL. */
7033 build_special_member_call (tree instance
, tree name
, VEC(tree
,gc
) **args
,
7034 tree binfo
, int flags
, tsubst_flags_t complain
)
7037 /* The type of the subobject to be constructed or destroyed. */
7039 VEC(tree
,gc
) *allocated
= NULL
;
7042 gcc_assert (name
== complete_ctor_identifier
7043 || name
== base_ctor_identifier
7044 || name
== complete_dtor_identifier
7045 || name
== base_dtor_identifier
7046 || name
== deleting_dtor_identifier
7047 || name
== ansi_assopname (NOP_EXPR
));
7050 /* Resolve the name. */
7051 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
7052 return error_mark_node
;
7054 binfo
= TYPE_BINFO (binfo
);
7057 gcc_assert (binfo
!= NULL_TREE
);
7059 class_type
= BINFO_TYPE (binfo
);
7061 /* Handle the special case where INSTANCE is NULL_TREE. */
7062 if (name
== complete_ctor_identifier
&& !instance
)
7064 instance
= build_int_cst (build_pointer_type (class_type
), 0);
7065 instance
= build1 (INDIRECT_REF
, class_type
, instance
);
7069 if (name
== complete_dtor_identifier
7070 || name
== base_dtor_identifier
7071 || name
== deleting_dtor_identifier
)
7072 gcc_assert (args
== NULL
|| VEC_empty (tree
, *args
));
7074 /* Convert to the base class, if necessary. */
7075 if (!same_type_ignoring_top_level_qualifiers_p
7076 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
7078 if (name
!= ansi_assopname (NOP_EXPR
))
7079 /* For constructors and destructors, either the base is
7080 non-virtual, or it is virtual but we are doing the
7081 conversion from a constructor or destructor for the
7082 complete object. In either case, we can convert
7084 instance
= convert_to_base_statically (instance
, binfo
);
7086 /* However, for assignment operators, we must convert
7087 dynamically if the base is virtual. */
7088 instance
= build_base_path (PLUS_EXPR
, instance
,
7089 binfo
, /*nonnull=*/1, complain
);
7093 gcc_assert (instance
!= NULL_TREE
);
7095 fns
= lookup_fnfields (binfo
, name
, 1);
7097 /* When making a call to a constructor or destructor for a subobject
7098 that uses virtual base classes, pass down a pointer to a VTT for
7100 if ((name
== base_ctor_identifier
7101 || name
== base_dtor_identifier
)
7102 && CLASSTYPE_VBASECLASSES (class_type
))
7107 /* If the current function is a complete object constructor
7108 or destructor, then we fetch the VTT directly.
7109 Otherwise, we look it up using the VTT we were given. */
7110 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
7111 vtt
= decay_conversion (vtt
, complain
);
7112 if (vtt
== error_mark_node
)
7113 return error_mark_node
;
7114 vtt
= build3 (COND_EXPR
, TREE_TYPE (vtt
),
7115 build2 (EQ_EXPR
, boolean_type_node
,
7116 current_in_charge_parm
, integer_zero_node
),
7119 if (BINFO_SUBVTT_INDEX (binfo
))
7120 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
7126 allocated
= make_tree_vector ();
7130 VEC_safe_insert (tree
, gc
, *args
, 0, sub_vtt
);
7133 ret
= build_new_method_call (instance
, fns
, args
,
7134 TYPE_BINFO (BINFO_TYPE (binfo
)),
7138 if (allocated
!= NULL
)
7139 release_tree_vector (allocated
);
7144 /* Return the NAME, as a C string. The NAME indicates a function that
7145 is a member of TYPE. *FREE_P is set to true if the caller must
7146 free the memory returned.
7148 Rather than go through all of this, we should simply set the names
7149 of constructors and destructors appropriately, and dispense with
7150 ctor_identifier, dtor_identifier, etc. */
7153 name_as_c_string (tree name
, tree type
, bool *free_p
)
7157 /* Assume that we will not allocate memory. */
7159 /* Constructors and destructors are special. */
7160 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
7163 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
))));
7164 /* For a destructor, add the '~'. */
7165 if (name
== complete_dtor_identifier
7166 || name
== base_dtor_identifier
7167 || name
== deleting_dtor_identifier
)
7169 pretty_name
= concat ("~", pretty_name
, NULL
);
7170 /* Remember that we need to free the memory allocated. */
7174 else if (IDENTIFIER_TYPENAME_P (name
))
7176 pretty_name
= concat ("operator ",
7177 type_as_string_translate (TREE_TYPE (name
),
7178 TFF_PLAIN_IDENTIFIER
),
7180 /* Remember that we need to free the memory allocated. */
7184 pretty_name
= CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name
)));
7189 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
7190 be set, upon return, to the function called. ARGS may be NULL.
7191 This may change ARGS. */
7194 build_new_method_call_1 (tree instance
, tree fns
, VEC(tree
,gc
) **args
,
7195 tree conversion_path
, int flags
,
7196 tree
*fn_p
, tsubst_flags_t complain
)
7198 struct z_candidate
*candidates
= 0, *cand
;
7199 tree explicit_targs
= NULL_TREE
;
7200 tree basetype
= NULL_TREE
;
7203 tree first_mem_arg
= NULL_TREE
;
7206 bool skip_first_for_error
;
7207 VEC(tree
,gc
) *user_args
;
7210 int template_only
= 0;
7214 VEC(tree
,gc
) *orig_args
= NULL
;
7217 gcc_assert (instance
!= NULL_TREE
);
7219 /* We don't know what function we're going to call, yet. */
7223 if (error_operand_p (instance
)
7224 || !fns
|| error_operand_p (fns
))
7225 return error_mark_node
;
7227 if (!BASELINK_P (fns
))
7229 if (complain
& tf_error
)
7230 error ("call to non-function %qD", fns
);
7231 return error_mark_node
;
7234 orig_instance
= instance
;
7237 /* Dismantle the baselink to collect all the information we need. */
7238 if (!conversion_path
)
7239 conversion_path
= BASELINK_BINFO (fns
);
7240 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
7241 optype
= BASELINK_OPTYPE (fns
);
7242 fns
= BASELINK_FUNCTIONS (fns
);
7243 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
7245 explicit_targs
= TREE_OPERAND (fns
, 1);
7246 fns
= TREE_OPERAND (fns
, 0);
7249 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
7250 || TREE_CODE (fns
) == TEMPLATE_DECL
7251 || TREE_CODE (fns
) == OVERLOAD
);
7252 fn
= get_first_fn (fns
);
7253 name
= DECL_NAME (fn
);
7255 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
7256 gcc_assert (CLASS_TYPE_P (basetype
));
7258 if (processing_template_decl
)
7260 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
7261 instance
= build_non_dependent_expr (instance
);
7263 make_args_non_dependent (*args
);
7266 user_args
= args
== NULL
? NULL
: *args
;
7267 /* Under DR 147 A::A() is an invalid constructor call,
7268 not a functional cast. */
7269 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
7271 if (! (complain
& tf_error
))
7272 return error_mark_node
;
7274 permerror (input_location
,
7275 "cannot call constructor %<%T::%D%> directly",
7277 permerror (input_location
, " for a function-style cast, remove the "
7278 "redundant %<::%D%>", name
);
7279 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
7284 /* Figure out whether to skip the first argument for the error
7285 message we will display to users if an error occurs. We don't
7286 want to display any compiler-generated arguments. The "this"
7287 pointer hasn't been added yet. However, we must remove the VTT
7288 pointer if this is a call to a base-class constructor or
7290 skip_first_for_error
= false;
7291 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
7293 /* Callers should explicitly indicate whether they want to construct
7294 the complete object or just the part without virtual bases. */
7295 gcc_assert (name
!= ctor_identifier
);
7296 /* Similarly for destructors. */
7297 gcc_assert (name
!= dtor_identifier
);
7298 /* Remove the VTT pointer, if present. */
7299 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
7300 && CLASSTYPE_VBASECLASSES (basetype
))
7301 skip_first_for_error
= true;
7304 /* Process the argument list. */
7305 if (args
!= NULL
&& *args
!= NULL
)
7307 *args
= resolve_args (*args
, complain
);
7309 return error_mark_node
;
7312 instance_ptr
= build_this (instance
);
7314 /* It's OK to call destructors and constructors on cv-qualified objects.
7315 Therefore, convert the INSTANCE_PTR to the unqualified type, if
7317 if (DECL_DESTRUCTOR_P (fn
)
7318 || DECL_CONSTRUCTOR_P (fn
))
7320 tree type
= build_pointer_type (basetype
);
7321 if (!same_type_p (type
, TREE_TYPE (instance_ptr
)))
7322 instance_ptr
= build_nop (type
, instance_ptr
);
7324 if (DECL_DESTRUCTOR_P (fn
))
7325 name
= complete_dtor_identifier
;
7327 first_mem_arg
= instance_ptr
;
7329 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7330 p
= conversion_obstack_alloc (0);
7332 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
7333 initializer, not T({ }). */
7334 if (DECL_CONSTRUCTOR_P (fn
) && args
!= NULL
&& !VEC_empty (tree
, *args
)
7335 && BRACE_ENCLOSED_INITIALIZER_P (VEC_index (tree
, *args
, 0))
7336 && CONSTRUCTOR_IS_DIRECT_INIT (VEC_index (tree
, *args
, 0)))
7338 tree init_list
= VEC_index (tree
, *args
, 0);
7339 tree init
= NULL_TREE
;
7341 gcc_assert (VEC_length (tree
, *args
) == 1
7342 && !(flags
& LOOKUP_ONLYCONVERTING
));
7344 /* If the initializer list has no elements and T is a class type with
7345 a default constructor, the object is value-initialized. Handle
7346 this here so we don't need to handle it wherever we use
7347 build_special_member_call. */
7348 if (CONSTRUCTOR_NELTS (init_list
) == 0
7349 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
7350 && !processing_template_decl
)
7351 init
= build_value_init (basetype
, complain
);
7353 /* If BASETYPE is an aggregate, we need to do aggregate
7355 else if (CP_AGGREGATE_TYPE_P (basetype
))
7356 init
= digest_init (basetype
, init_list
, complain
);
7361 if (integer_zerop (instance_ptr
))
7362 return get_target_expr_sfinae (init
, complain
);
7363 ob
= build_fold_indirect_ref (instance_ptr
);
7364 init
= build2 (INIT_EXPR
, TREE_TYPE (ob
), ob
, init
);
7365 TREE_SIDE_EFFECTS (init
) = true;
7369 /* Otherwise go ahead with overload resolution. */
7370 add_list_candidates (fns
, first_mem_arg
, init_list
,
7371 basetype
, explicit_targs
, template_only
,
7372 conversion_path
, access_binfo
, flags
,
7373 &candidates
, complain
);
7377 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
7378 explicit_targs
, template_only
, conversion_path
,
7379 access_binfo
, flags
, &candidates
, complain
);
7381 any_viable_p
= false;
7382 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
7386 if (complain
& tf_error
)
7388 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
7389 cxx_incomplete_type_error (instance_ptr
, basetype
);
7391 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
7392 basetype
, optype
, build_tree_list_vec (user_args
),
7393 TREE_TYPE (TREE_TYPE (instance_ptr
)));
7400 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
7401 arglist
= build_tree_list_vec (user_args
);
7402 if (skip_first_for_error
)
7403 arglist
= TREE_CHAIN (arglist
);
7404 error ("no matching function for call to %<%T::%s(%A)%#V%>",
7405 basetype
, pretty_name
, arglist
,
7406 TREE_TYPE (TREE_TYPE (instance_ptr
)));
7410 print_z_candidates (location_of (name
), candidates
);
7412 call
= error_mark_node
;
7416 cand
= tourney (candidates
, complain
);
7423 if (complain
& tf_error
)
7425 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
7426 arglist
= build_tree_list_vec (user_args
);
7427 if (skip_first_for_error
)
7428 arglist
= TREE_CHAIN (arglist
);
7429 error ("call of overloaded %<%s(%A)%> is ambiguous", pretty_name
,
7431 print_z_candidates (location_of (name
), candidates
);
7435 call
= error_mark_node
;
7441 if (!(flags
& LOOKUP_NONVIRTUAL
)
7442 && DECL_PURE_VIRTUAL_P (fn
)
7443 && instance
== current_class_ref
7444 && (DECL_CONSTRUCTOR_P (current_function_decl
)
7445 || DECL_DESTRUCTOR_P (current_function_decl
))
7446 && (complain
& tf_warning
))
7447 /* This is not an error, it is runtime undefined
7449 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
) ?
7450 "pure virtual %q#D called from constructor"
7451 : "pure virtual %q#D called from destructor"),
7454 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
7455 && is_dummy_object (instance_ptr
))
7457 if (complain
& tf_error
)
7458 error ("cannot call member function %qD without object",
7460 call
= error_mark_node
;
7464 /* Optimize away vtable lookup if we know that this function
7465 can't be overridden. */
7466 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
7467 && resolves_to_fixed_type_p (instance
, 0))
7468 flags
|= LOOKUP_NONVIRTUAL
;
7470 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
7471 /* Now we know what function is being called. */
7474 /* Build the actual CALL_EXPR. */
7475 call
= build_over_call (cand
, flags
, complain
);
7476 /* In an expression of the form `a->f()' where `f' turns
7477 out to be a static member function, `a' is
7478 none-the-less evaluated. */
7479 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
7480 && !is_dummy_object (instance_ptr
)
7481 && TREE_SIDE_EFFECTS (instance_ptr
))
7482 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
),
7483 instance_ptr
, call
);
7484 else if (call
!= error_mark_node
7485 && DECL_DESTRUCTOR_P (cand
->fn
)
7486 && !VOID_TYPE_P (TREE_TYPE (call
)))
7487 /* An explicit call of the form "x->~X()" has type
7488 "void". However, on platforms where destructors
7489 return "this" (i.e., those where
7490 targetm.cxx.cdtor_returns_this is true), such calls
7491 will appear to have a return value of pointer type
7492 to the low-level call machinery. We do not want to
7493 change the low-level machinery, since we want to be
7494 able to optimize "delete f()" on such platforms as
7495 "operator delete(~X(f()))" (rather than generating
7496 "t = f(), ~X(t), operator delete (t)"). */
7497 call
= build_nop (void_type_node
, call
);
7502 if (processing_template_decl
&& call
!= error_mark_node
)
7504 bool cast_to_void
= false;
7506 if (TREE_CODE (call
) == COMPOUND_EXPR
)
7507 call
= TREE_OPERAND (call
, 1);
7508 else if (TREE_CODE (call
) == NOP_EXPR
)
7510 cast_to_void
= true;
7511 call
= TREE_OPERAND (call
, 0);
7513 if (TREE_CODE (call
) == INDIRECT_REF
)
7514 call
= TREE_OPERAND (call
, 0);
7515 call
= (build_min_non_dep_call_vec
7517 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
7518 orig_instance
, orig_fns
, NULL_TREE
),
7520 call
= convert_from_reference (call
);
7522 call
= build_nop (void_type_node
, call
);
7525 /* Free all the conversions we allocated. */
7526 obstack_free (&conversion_obstack
, p
);
7528 if (orig_args
!= NULL
)
7529 release_tree_vector (orig_args
);
7534 /* Wrapper for above. */
7537 build_new_method_call (tree instance
, tree fns
, VEC(tree
,gc
) **args
,
7538 tree conversion_path
, int flags
,
7539 tree
*fn_p
, tsubst_flags_t complain
)
7542 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
7543 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
7545 timevar_cond_stop (TV_OVERLOAD
, subtime
);
7549 /* Returns true iff standard conversion sequence ICS1 is a proper
7550 subsequence of ICS2. */
7553 is_subseq (conversion
*ics1
, conversion
*ics2
)
7555 /* We can assume that a conversion of the same code
7556 between the same types indicates a subsequence since we only get
7557 here if the types we are converting from are the same. */
7559 while (ics1
->kind
== ck_rvalue
7560 || ics1
->kind
== ck_lvalue
)
7561 ics1
= next_conversion (ics1
);
7565 while (ics2
->kind
== ck_rvalue
7566 || ics2
->kind
== ck_lvalue
)
7567 ics2
= next_conversion (ics2
);
7569 if (ics2
->kind
== ck_user
7570 || ics2
->kind
== ck_ambig
7571 || ics2
->kind
== ck_aggr
7572 || ics2
->kind
== ck_list
7573 || ics2
->kind
== ck_identity
)
7574 /* At this point, ICS1 cannot be a proper subsequence of
7575 ICS2. We can get a USER_CONV when we are comparing the
7576 second standard conversion sequence of two user conversion
7580 ics2
= next_conversion (ics2
);
7582 if (ics2
->kind
== ics1
->kind
7583 && same_type_p (ics2
->type
, ics1
->type
)
7584 && same_type_p (next_conversion (ics2
)->type
,
7585 next_conversion (ics1
)->type
))
7590 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
7591 be any _TYPE nodes. */
7594 is_properly_derived_from (tree derived
, tree base
)
7596 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
7599 /* We only allow proper derivation here. The DERIVED_FROM_P macro
7600 considers every class derived from itself. */
7601 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
7602 && DERIVED_FROM_P (base
, derived
));
7605 /* We build the ICS for an implicit object parameter as a pointer
7606 conversion sequence. However, such a sequence should be compared
7607 as if it were a reference conversion sequence. If ICS is the
7608 implicit conversion sequence for an implicit object parameter,
7609 modify it accordingly. */
7612 maybe_handle_implicit_object (conversion
**ics
)
7616 /* [over.match.funcs]
7618 For non-static member functions, the type of the
7619 implicit object parameter is "reference to cv X"
7620 where X is the class of which the function is a
7621 member and cv is the cv-qualification on the member
7622 function declaration. */
7623 conversion
*t
= *ics
;
7624 tree reference_type
;
7626 /* The `this' parameter is a pointer to a class type. Make the
7627 implicit conversion talk about a reference to that same class
7629 reference_type
= TREE_TYPE (t
->type
);
7630 reference_type
= build_reference_type (reference_type
);
7632 if (t
->kind
== ck_qual
)
7633 t
= next_conversion (t
);
7634 if (t
->kind
== ck_ptr
)
7635 t
= next_conversion (t
);
7636 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
7637 t
= direct_reference_binding (reference_type
, t
);
7639 t
->rvaluedness_matches_p
= 0;
7644 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
7645 and return the initial reference binding conversion. Otherwise,
7646 leave *ICS unchanged and return NULL. */
7649 maybe_handle_ref_bind (conversion
**ics
)
7651 if ((*ics
)->kind
== ck_ref_bind
)
7653 conversion
*old_ics
= *ics
;
7654 *ics
= next_conversion (old_ics
);
7655 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
7662 /* Compare two implicit conversion sequences according to the rules set out in
7663 [over.ics.rank]. Return values:
7665 1: ics1 is better than ics2
7666 -1: ics2 is better than ics1
7667 0: ics1 and ics2 are indistinguishable */
7670 compare_ics (conversion
*ics1
, conversion
*ics2
)
7676 tree deref_from_type1
= NULL_TREE
;
7677 tree deref_from_type2
= NULL_TREE
;
7678 tree deref_to_type1
= NULL_TREE
;
7679 tree deref_to_type2
= NULL_TREE
;
7680 conversion_rank rank1
, rank2
;
7682 /* REF_BINDING is nonzero if the result of the conversion sequence
7683 is a reference type. In that case REF_CONV is the reference
7684 binding conversion. */
7685 conversion
*ref_conv1
;
7686 conversion
*ref_conv2
;
7688 /* Handle implicit object parameters. */
7689 maybe_handle_implicit_object (&ics1
);
7690 maybe_handle_implicit_object (&ics2
);
7692 /* Handle reference parameters. */
7693 ref_conv1
= maybe_handle_ref_bind (&ics1
);
7694 ref_conv2
= maybe_handle_ref_bind (&ics2
);
7696 /* List-initialization sequence L1 is a better conversion sequence than
7697 list-initialization sequence L2 if L1 converts to
7698 std::initializer_list<X> for some X and L2 does not. */
7699 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
7701 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
7706 When comparing the basic forms of implicit conversion sequences (as
7707 defined in _over.best.ics_)
7709 --a standard conversion sequence (_over.ics.scs_) is a better
7710 conversion sequence than a user-defined conversion sequence
7711 or an ellipsis conversion sequence, and
7713 --a user-defined conversion sequence (_over.ics.user_) is a
7714 better conversion sequence than an ellipsis conversion sequence
7715 (_over.ics.ellipsis_). */
7716 rank1
= CONVERSION_RANK (ics1
);
7717 rank2
= CONVERSION_RANK (ics2
);
7721 else if (rank1
< rank2
)
7724 if (rank1
== cr_bad
)
7726 /* Both ICS are bad. We try to make a decision based on what would
7727 have happened if they'd been good. This is not an extension,
7728 we'll still give an error when we build up the call; this just
7729 helps us give a more helpful error message. */
7730 rank1
= BAD_CONVERSION_RANK (ics1
);
7731 rank2
= BAD_CONVERSION_RANK (ics2
);
7735 else if (rank1
< rank2
)
7738 /* We couldn't make up our minds; try to figure it out below. */
7741 if (ics1
->ellipsis_p
)
7742 /* Both conversions are ellipsis conversions. */
7745 /* User-defined conversion sequence U1 is a better conversion sequence
7746 than another user-defined conversion sequence U2 if they contain the
7747 same user-defined conversion operator or constructor and if the sec-
7748 ond standard conversion sequence of U1 is better than the second
7749 standard conversion sequence of U2. */
7751 /* Handle list-conversion with the same code even though it isn't always
7752 ranked as a user-defined conversion and it doesn't have a second
7753 standard conversion sequence; it will still have the desired effect.
7754 Specifically, we need to do the reference binding comparison at the
7755 end of this function. */
7757 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
|| ics1
->kind
== ck_aggr
)
7762 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
7763 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
7764 || t1
->kind
== ck_list
)
7766 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
7767 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
7768 || t2
->kind
== ck_list
)
7771 if (t1
->kind
!= t2
->kind
)
7773 else if (t1
->kind
== ck_user
)
7775 if (t1
->cand
->fn
!= t2
->cand
->fn
)
7780 /* For ambiguous or aggregate conversions, use the target type as
7781 a proxy for the conversion function. */
7782 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
7786 /* We can just fall through here, after setting up
7787 FROM_TYPE1 and FROM_TYPE2. */
7788 from_type1
= t1
->type
;
7789 from_type2
= t2
->type
;
7796 /* We're dealing with two standard conversion sequences.
7800 Standard conversion sequence S1 is a better conversion
7801 sequence than standard conversion sequence S2 if
7803 --S1 is a proper subsequence of S2 (comparing the conversion
7804 sequences in the canonical form defined by _over.ics.scs_,
7805 excluding any Lvalue Transformation; the identity
7806 conversion sequence is considered to be a subsequence of
7807 any non-identity conversion sequence */
7810 while (t1
->kind
!= ck_identity
)
7811 t1
= next_conversion (t1
);
7812 from_type1
= t1
->type
;
7815 while (t2
->kind
!= ck_identity
)
7816 t2
= next_conversion (t2
);
7817 from_type2
= t2
->type
;
7820 /* One sequence can only be a subsequence of the other if they start with
7821 the same type. They can start with different types when comparing the
7822 second standard conversion sequence in two user-defined conversion
7824 if (same_type_p (from_type1
, from_type2
))
7826 if (is_subseq (ics1
, ics2
))
7828 if (is_subseq (ics2
, ics1
))
7836 --the rank of S1 is better than the rank of S2 (by the rules
7839 Standard conversion sequences are ordered by their ranks: an Exact
7840 Match is a better conversion than a Promotion, which is a better
7841 conversion than a Conversion.
7843 Two conversion sequences with the same rank are indistinguishable
7844 unless one of the following rules applies:
7846 --A conversion that does not a convert a pointer, pointer to member,
7847 or std::nullptr_t to bool is better than one that does.
7849 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
7850 so that we do not have to check it explicitly. */
7851 if (ics1
->rank
< ics2
->rank
)
7853 else if (ics2
->rank
< ics1
->rank
)
7856 to_type1
= ics1
->type
;
7857 to_type2
= ics2
->type
;
7859 /* A conversion from scalar arithmetic type to complex is worse than a
7860 conversion between scalar arithmetic types. */
7861 if (same_type_p (from_type1
, from_type2
)
7862 && ARITHMETIC_TYPE_P (from_type1
)
7863 && ARITHMETIC_TYPE_P (to_type1
)
7864 && ARITHMETIC_TYPE_P (to_type2
)
7865 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
7866 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
7868 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
7874 if (TYPE_PTR_P (from_type1
)
7875 && TYPE_PTR_P (from_type2
)
7876 && TYPE_PTR_P (to_type1
)
7877 && TYPE_PTR_P (to_type2
))
7879 deref_from_type1
= TREE_TYPE (from_type1
);
7880 deref_from_type2
= TREE_TYPE (from_type2
);
7881 deref_to_type1
= TREE_TYPE (to_type1
);
7882 deref_to_type2
= TREE_TYPE (to_type2
);
7884 /* The rules for pointers to members A::* are just like the rules
7885 for pointers A*, except opposite: if B is derived from A then
7886 A::* converts to B::*, not vice versa. For that reason, we
7887 switch the from_ and to_ variables here. */
7888 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
7889 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
7890 || (TYPE_PTRMEMFUNC_P (from_type1
)
7891 && TYPE_PTRMEMFUNC_P (from_type2
)
7892 && TYPE_PTRMEMFUNC_P (to_type1
)
7893 && TYPE_PTRMEMFUNC_P (to_type2
)))
7895 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
7896 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
7897 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
7898 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
7901 if (deref_from_type1
!= NULL_TREE
7902 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
7903 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
7905 /* This was one of the pointer or pointer-like conversions.
7909 --If class B is derived directly or indirectly from class A,
7910 conversion of B* to A* is better than conversion of B* to
7911 void*, and conversion of A* to void* is better than
7912 conversion of B* to void*. */
7913 if (TREE_CODE (deref_to_type1
) == VOID_TYPE
7914 && TREE_CODE (deref_to_type2
) == VOID_TYPE
)
7916 if (is_properly_derived_from (deref_from_type1
,
7919 else if (is_properly_derived_from (deref_from_type2
,
7923 else if (TREE_CODE (deref_to_type1
) == VOID_TYPE
7924 || TREE_CODE (deref_to_type2
) == VOID_TYPE
)
7926 if (same_type_p (deref_from_type1
, deref_from_type2
))
7928 if (TREE_CODE (deref_to_type2
) == VOID_TYPE
)
7930 if (is_properly_derived_from (deref_from_type1
,
7934 /* We know that DEREF_TO_TYPE1 is `void' here. */
7935 else if (is_properly_derived_from (deref_from_type1
,
7940 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
7941 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
7945 --If class B is derived directly or indirectly from class A
7946 and class C is derived directly or indirectly from B,
7948 --conversion of C* to B* is better than conversion of C* to
7951 --conversion of B* to A* is better than conversion of C* to
7953 if (same_type_p (deref_from_type1
, deref_from_type2
))
7955 if (is_properly_derived_from (deref_to_type1
,
7958 else if (is_properly_derived_from (deref_to_type2
,
7962 else if (same_type_p (deref_to_type1
, deref_to_type2
))
7964 if (is_properly_derived_from (deref_from_type2
,
7967 else if (is_properly_derived_from (deref_from_type1
,
7973 else if (CLASS_TYPE_P (non_reference (from_type1
))
7974 && same_type_p (from_type1
, from_type2
))
7976 tree from
= non_reference (from_type1
);
7980 --binding of an expression of type C to a reference of type
7981 B& is better than binding an expression of type C to a
7982 reference of type A&
7984 --conversion of C to B is better than conversion of C to A, */
7985 if (is_properly_derived_from (from
, to_type1
)
7986 && is_properly_derived_from (from
, to_type2
))
7988 if (is_properly_derived_from (to_type1
, to_type2
))
7990 else if (is_properly_derived_from (to_type2
, to_type1
))
7994 else if (CLASS_TYPE_P (non_reference (to_type1
))
7995 && same_type_p (to_type1
, to_type2
))
7997 tree to
= non_reference (to_type1
);
8001 --binding of an expression of type B to a reference of type
8002 A& is better than binding an expression of type C to a
8003 reference of type A&,
8005 --conversion of B to A is better than conversion of C to A */
8006 if (is_properly_derived_from (from_type1
, to
)
8007 && is_properly_derived_from (from_type2
, to
))
8009 if (is_properly_derived_from (from_type2
, from_type1
))
8011 else if (is_properly_derived_from (from_type1
, from_type2
))
8018 --S1 and S2 differ only in their qualification conversion and yield
8019 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
8020 qualification signature of type T1 is a proper subset of the cv-
8021 qualification signature of type T2 */
8022 if (ics1
->kind
== ck_qual
8023 && ics2
->kind
== ck_qual
8024 && same_type_p (from_type1
, from_type2
))
8026 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
8033 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
8034 to an implicit object parameter, and either S1 binds an lvalue reference
8035 to an lvalue and S2 binds an rvalue reference or S1 binds an rvalue
8036 reference to an rvalue and S2 binds an lvalue reference
8037 (C++0x draft standard, 13.3.3.2)
8039 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
8040 types to which the references refer are the same type except for
8041 top-level cv-qualifiers, and the type to which the reference
8042 initialized by S2 refers is more cv-qualified than the type to
8043 which the reference initialized by S1 refers.
8045 DR 1328 [over.match.best]: the context is an initialization by
8046 conversion function for direct reference binding (13.3.1.6) of a
8047 reference to function type, the return type of F1 is the same kind of
8048 reference (i.e. lvalue or rvalue) as the reference being initialized,
8049 and the return type of F2 is not. */
8051 if (ref_conv1
&& ref_conv2
)
8053 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
8054 && (ref_conv1
->rvaluedness_matches_p
8055 != ref_conv2
->rvaluedness_matches_p
)
8056 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
8057 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
8058 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
8060 return (ref_conv1
->rvaluedness_matches_p
8061 - ref_conv2
->rvaluedness_matches_p
);
8064 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
8065 return comp_cv_qualification (TREE_TYPE (ref_conv2
->type
),
8066 TREE_TYPE (ref_conv1
->type
));
8069 /* Neither conversion sequence is better than the other. */
8073 /* The source type for this standard conversion sequence. */
8076 source_type (conversion
*t
)
8078 for (;; t
= next_conversion (t
))
8080 if (t
->kind
== ck_user
8081 || t
->kind
== ck_ambig
8082 || t
->kind
== ck_identity
)
8088 /* Note a warning about preferring WINNER to LOSER. We do this by storing
8089 a pointer to LOSER and re-running joust to produce the warning if WINNER
8090 is actually used. */
8093 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
8095 candidate_warning
*cw
= (candidate_warning
*)
8096 conversion_obstack_alloc (sizeof (candidate_warning
));
8098 cw
->next
= winner
->warnings
;
8099 winner
->warnings
= cw
;
8102 /* Compare two candidates for overloading as described in
8103 [over.match.best]. Return values:
8105 1: cand1 is better than cand2
8106 -1: cand2 is better than cand1
8107 0: cand1 and cand2 are indistinguishable */
8110 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
8111 tsubst_flags_t complain
)
8114 int off1
= 0, off2
= 0;
8118 /* Candidates that involve bad conversions are always worse than those
8120 if (cand1
->viable
> cand2
->viable
)
8122 if (cand1
->viable
< cand2
->viable
)
8125 /* If we have two pseudo-candidates for conversions to the same type,
8126 or two candidates for the same function, arbitrarily pick one. */
8127 if (cand1
->fn
== cand2
->fn
8128 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
8131 /* a viable function F1
8132 is defined to be a better function than another viable function F2 if
8133 for all arguments i, ICSi(F1) is not a worse conversion sequence than
8134 ICSi(F2), and then */
8136 /* for some argument j, ICSj(F1) is a better conversion sequence than
8139 /* For comparing static and non-static member functions, we ignore
8140 the implicit object parameter of the non-static function. The
8141 standard says to pretend that the static function has an object
8142 parm, but that won't work with operator overloading. */
8143 len
= cand1
->num_convs
;
8144 if (len
!= cand2
->num_convs
)
8146 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
8147 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
8149 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
8150 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
8151 /* We're comparing a near-match list constructor and a near-match
8152 non-list constructor. Just treat them as unordered. */
8155 gcc_assert (static_1
!= static_2
);
8166 for (i
= 0; i
< len
; ++i
)
8168 conversion
*t1
= cand1
->convs
[i
+ off1
];
8169 conversion
*t2
= cand2
->convs
[i
+ off2
];
8170 int comp
= compare_ics (t1
, t2
);
8174 if ((complain
& tf_warning
)
8176 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
8177 == cr_std
+ cr_promotion
)
8178 && t1
->kind
== ck_std
8179 && t2
->kind
== ck_std
8180 && TREE_CODE (t1
->type
) == INTEGER_TYPE
8181 && TREE_CODE (t2
->type
) == INTEGER_TYPE
8182 && (TYPE_PRECISION (t1
->type
)
8183 == TYPE_PRECISION (t2
->type
))
8184 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
8185 || (TREE_CODE (next_conversion (t1
)->type
)
8188 tree type
= next_conversion (t1
)->type
;
8190 struct z_candidate
*w
, *l
;
8192 type1
= t1
->type
, type2
= t2
->type
,
8193 w
= cand1
, l
= cand2
;
8195 type1
= t2
->type
, type2
= t1
->type
,
8196 w
= cand2
, l
= cand1
;
8200 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
8201 type
, type1
, type2
);
8202 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
8208 if (winner
&& comp
!= winner
)
8217 /* warn about confusing overload resolution for user-defined conversions,
8218 either between a constructor and a conversion op, or between two
8220 if ((complain
& tf_warning
)
8221 && winner
&& warn_conversion
&& cand1
->second_conv
8222 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
8223 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
8225 struct z_candidate
*w
, *l
;
8226 bool give_warning
= false;
8229 w
= cand1
, l
= cand2
;
8231 w
= cand2
, l
= cand1
;
8233 /* We don't want to complain about `X::operator T1 ()'
8234 beating `X::operator T2 () const', when T2 is a no less
8235 cv-qualified version of T1. */
8236 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
8237 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
8239 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
8240 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
8242 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
8247 if (!comp_ptr_ttypes (t
, f
))
8248 give_warning
= true;
8251 give_warning
= true;
8257 tree source
= source_type (w
->convs
[0]);
8258 if (! DECL_CONSTRUCTOR_P (w
->fn
))
8259 source
= TREE_TYPE (source
);
8260 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
8261 && warning (OPT_Wconversion
, " for conversion from %qT to %qT",
8262 source
, w
->second_conv
->type
))
8264 inform (input_location
, " because conversion sequence for the argument is better");
8274 /* DR 495 moved this tiebreaker above the template ones. */
8276 the context is an initialization by user-defined conversion (see
8277 _dcl.init_ and _over.match.user_) and the standard conversion
8278 sequence from the return type of F1 to the destination type (i.e.,
8279 the type of the entity being initialized) is a better conversion
8280 sequence than the standard conversion sequence from the return type
8281 of F2 to the destination type. */
8283 if (cand1
->second_conv
)
8285 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
8291 F1 is a non-template function and F2 is a template function
8294 if (!cand1
->template_decl
&& cand2
->template_decl
)
8296 else if (cand1
->template_decl
&& !cand2
->template_decl
)
8300 F1 and F2 are template functions and the function template for F1 is
8301 more specialized than the template for F2 according to the partial
8304 if (cand1
->template_decl
&& cand2
->template_decl
)
8306 winner
= more_specialized_fn
8307 (TI_TEMPLATE (cand1
->template_decl
),
8308 TI_TEMPLATE (cand2
->template_decl
),
8309 /* [temp.func.order]: The presence of unused ellipsis and default
8310 arguments has no effect on the partial ordering of function
8311 templates. add_function_candidate() will not have
8312 counted the "this" argument for constructors. */
8313 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
8318 /* Check whether we can discard a builtin candidate, either because we
8319 have two identical ones or matching builtin and non-builtin candidates.
8321 (Pedantically in the latter case the builtin which matched the user
8322 function should not be added to the overload set, but we spot it here.
8325 ... the builtin candidates include ...
8326 - do not have the same parameter type list as any non-template
8327 non-member candidate. */
8329 if (TREE_CODE (cand1
->fn
) == IDENTIFIER_NODE
8330 || TREE_CODE (cand2
->fn
) == IDENTIFIER_NODE
)
8332 for (i
= 0; i
< len
; ++i
)
8333 if (!same_type_p (cand1
->convs
[i
]->type
,
8334 cand2
->convs
[i
]->type
))
8336 if (i
== cand1
->num_convs
)
8338 if (cand1
->fn
== cand2
->fn
)
8339 /* Two built-in candidates; arbitrarily pick one. */
8341 else if (TREE_CODE (cand1
->fn
) == IDENTIFIER_NODE
)
8342 /* cand1 is built-in; prefer cand2. */
8345 /* cand2 is built-in; prefer cand1. */
8350 /* If the two function declarations represent the same function (this can
8351 happen with declarations in multiple scopes and arg-dependent lookup),
8352 arbitrarily choose one. But first make sure the default args we're
8354 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
8355 && equal_functions (cand1
->fn
, cand2
->fn
))
8357 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
8358 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
8360 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
8362 for (i
= 0; i
< len
; ++i
)
8364 /* Don't crash if the fn is variadic. */
8367 parms1
= TREE_CHAIN (parms1
);
8368 parms2
= TREE_CHAIN (parms2
);
8372 parms1
= TREE_CHAIN (parms1
);
8374 parms2
= TREE_CHAIN (parms2
);
8378 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
8379 TREE_PURPOSE (parms2
)))
8383 if (complain
& tf_error
)
8385 permerror (input_location
,
8386 "default argument mismatch in "
8387 "overload resolution");
8388 inform (input_location
,
8389 " candidate 1: %q+#F", cand1
->fn
);
8390 inform (input_location
,
8391 " candidate 2: %q+#F", cand2
->fn
);
8397 add_warning (cand1
, cand2
);
8400 parms1
= TREE_CHAIN (parms1
);
8401 parms2
= TREE_CHAIN (parms2
);
8409 /* Extension: If the worst conversion for one candidate is worse than the
8410 worst conversion for the other, take the first. */
8411 if (!pedantic
&& (complain
& tf_warning_or_error
))
8413 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
8414 struct z_candidate
*w
= 0, *l
= 0;
8416 for (i
= 0; i
< len
; ++i
)
8418 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
8419 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
8420 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
8421 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
8424 winner
= 1, w
= cand1
, l
= cand2
;
8426 winner
= -1, w
= cand2
, l
= cand1
;
8429 /* Don't choose a deleted function over ambiguity. */
8430 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
8434 pedwarn (input_location
, 0,
8435 "ISO C++ says that these are ambiguous, even "
8436 "though the worst conversion for the first is better than "
8437 "the worst conversion for the second:");
8438 print_z_candidate (input_location
, _("candidate 1:"), w
);
8439 print_z_candidate (input_location
, _("candidate 2:"), l
);
8447 gcc_assert (!winner
);
8451 /* Given a list of candidates for overloading, find the best one, if any.
8452 This algorithm has a worst case of O(2n) (winner is last), and a best
8453 case of O(n/2) (totally ambiguous); much better than a sorting
8456 static struct z_candidate
*
8457 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
8459 struct z_candidate
*champ
= candidates
, *challenger
;
8461 int champ_compared_to_predecessor
= 0;
8463 /* Walk through the list once, comparing each current champ to the next
8464 candidate, knocking out a candidate or two with each comparison. */
8466 for (challenger
= champ
->next
; challenger
; )
8468 fate
= joust (champ
, challenger
, 0, complain
);
8470 challenger
= challenger
->next
;
8475 champ
= challenger
->next
;
8478 champ_compared_to_predecessor
= 0;
8483 champ_compared_to_predecessor
= 1;
8486 challenger
= champ
->next
;
8490 /* Make sure the champ is better than all the candidates it hasn't yet
8491 been compared to. */
8493 for (challenger
= candidates
;
8495 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
8496 challenger
= challenger
->next
)
8498 fate
= joust (champ
, challenger
, 0, complain
);
8506 /* Returns nonzero if things of type FROM can be converted to TO. */
8509 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
8511 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
8514 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
8517 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
8518 tsubst_flags_t complain
)
8524 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8525 p
= conversion_obstack_alloc (0);
8527 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
8529 ok_p
= (t
&& !t
->bad_p
);
8531 /* Free all the conversions we allocated. */
8532 obstack_free (&conversion_obstack
, p
);
8537 /* Like can_convert_arg, but allows dubious conversions as well. */
8540 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
8541 tsubst_flags_t complain
)
8546 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8547 p
= conversion_obstack_alloc (0);
8548 /* Try to perform the conversion. */
8549 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
8551 /* Free all the conversions we allocated. */
8552 obstack_free (&conversion_obstack
, p
);
8557 /* Convert EXPR to TYPE. Return the converted expression.
8559 Note that we allow bad conversions here because by the time we get to
8560 this point we are committed to doing the conversion. If we end up
8561 doing a bad conversion, convert_like will complain. */
8564 perform_implicit_conversion_flags (tree type
, tree expr
,
8565 tsubst_flags_t complain
, int flags
)
8569 location_t loc
= EXPR_LOC_OR_HERE (expr
);
8571 if (error_operand_p (expr
))
8572 return error_mark_node
;
8574 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8575 p
= conversion_obstack_alloc (0);
8577 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
8583 if (complain
& tf_error
)
8585 /* If expr has unknown type, then it is an overloaded function.
8586 Call instantiate_type to get good error messages. */
8587 if (TREE_TYPE (expr
) == unknown_type_node
)
8588 instantiate_type (type
, expr
, complain
);
8589 else if (invalid_nonstatic_memfn_p (expr
, complain
))
8590 /* We gave an error. */;
8592 error_at (loc
, "could not convert %qE from %qT to %qT", expr
,
8593 TREE_TYPE (expr
), type
);
8595 expr
= error_mark_node
;
8597 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
8599 /* In a template, we are only concerned about determining the
8600 type of non-dependent expressions, so we do not have to
8601 perform the actual conversion. But for initializers, we
8602 need to be able to perform it at instantiation
8603 (or fold_non_dependent_expr) time. */
8604 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
8605 if (!(flags
& LOOKUP_ONLYCONVERTING
))
8606 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
8609 expr
= convert_like (conv
, expr
, complain
);
8611 /* Free all the conversions we allocated. */
8612 obstack_free (&conversion_obstack
, p
);
8618 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
8620 return perform_implicit_conversion_flags (type
, expr
, complain
,
8624 /* Convert EXPR to TYPE (as a direct-initialization) if that is
8625 permitted. If the conversion is valid, the converted expression is
8626 returned. Otherwise, NULL_TREE is returned, except in the case
8627 that TYPE is a class type; in that case, an error is issued. If
8628 C_CAST_P is true, then this direct-initialization is taking
8629 place as part of a static_cast being attempted as part of a C-style
8633 perform_direct_initialization_if_possible (tree type
,
8636 tsubst_flags_t complain
)
8641 if (type
== error_mark_node
|| error_operand_p (expr
))
8642 return error_mark_node
;
8645 If the destination type is a (possibly cv-qualified) class type:
8647 -- If the initialization is direct-initialization ...,
8648 constructors are considered. ... If no constructor applies, or
8649 the overload resolution is ambiguous, the initialization is
8651 if (CLASS_TYPE_P (type
))
8653 VEC(tree
,gc
) *args
= make_tree_vector_single (expr
);
8654 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
8655 &args
, type
, LOOKUP_NORMAL
, complain
);
8656 release_tree_vector (args
);
8657 return build_cplus_new (type
, expr
, complain
);
8660 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8661 p
= conversion_obstack_alloc (0);
8663 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
8665 LOOKUP_NORMAL
, complain
);
8666 if (!conv
|| conv
->bad_p
)
8669 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0, 0,
8670 /*issue_conversion_warnings=*/false,
8674 /* Free all the conversions we allocated. */
8675 obstack_free (&conversion_obstack
, p
);
8680 /* When initializing a reference that lasts longer than a full-expression,
8681 this special rule applies:
8685 The temporary to which the reference is bound or the temporary
8686 that is the complete object to which the reference is bound
8687 persists for the lifetime of the reference.
8689 The temporaries created during the evaluation of the expression
8690 initializing the reference, except the temporary to which the
8691 reference is bound, are destroyed at the end of the
8692 full-expression in which they are created.
8694 In that case, we store the converted expression into a new
8695 VAR_DECL in a new scope.
8697 However, we want to be careful not to create temporaries when
8698 they are not required. For example, given:
8701 struct D : public B {};
8705 there is no need to copy the return value from "f"; we can just
8706 extend its lifetime. Similarly, given:
8709 struct T { operator S(); };
8713 we can extend the lifetime of the return value of the conversion
8716 The next several functions are involved in this lifetime extension. */
8718 /* DECL is a VAR_DECL whose type is a REFERENCE_TYPE. The reference
8719 is being bound to a temporary. Create and return a new VAR_DECL
8720 with the indicated TYPE; this variable will store the value to
8721 which the reference is bound. */
8724 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
8728 /* Create the variable. */
8729 var
= create_temporary_var (type
);
8731 /* Register the variable. */
8732 if (TREE_STATIC (decl
))
8734 /* Namespace-scope or local static; give it a mangled name. */
8735 /* FIXME share comdat with decl? */
8738 TREE_STATIC (var
) = 1;
8739 name
= mangle_ref_init_variable (decl
);
8740 DECL_NAME (var
) = name
;
8741 SET_DECL_ASSEMBLER_NAME (var
, name
);
8742 var
= pushdecl_top_level (var
);
8745 /* Create a new cleanup level if necessary. */
8746 maybe_push_cleanup_level (type
);
8751 /* EXPR is the initializer for a variable DECL of reference or
8752 std::initializer_list type. Create, push and return a new VAR_DECL
8753 for the initializer so that it will live as long as DECL. Any
8754 cleanup for the new variable is returned through CLEANUP, and the
8755 code to initialize the new variable is returned through INITP. */
8758 set_up_extended_ref_temp (tree decl
, tree expr
, VEC(tree
,gc
) **cleanups
,
8765 /* Create the temporary variable. */
8766 type
= TREE_TYPE (expr
);
8767 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
8768 layout_decl (var
, 0);
8769 /* If the rvalue is the result of a function call it will be
8770 a TARGET_EXPR. If it is some other construct (such as a
8771 member access expression where the underlying object is
8772 itself the result of a function call), turn it into a
8773 TARGET_EXPR here. It is important that EXPR be a
8774 TARGET_EXPR below since otherwise the INIT_EXPR will
8775 attempt to make a bitwise copy of EXPR to initialize
8777 if (TREE_CODE (expr
) != TARGET_EXPR
)
8778 expr
= get_target_expr (expr
);
8780 if (TREE_CODE (decl
) == FIELD_DECL
8781 && extra_warnings
&& !TREE_NO_WARNING (decl
))
8783 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
8784 "until the constructor exits", decl
);
8785 TREE_NO_WARNING (decl
) = true;
8788 /* Recursively extend temps in this initializer. */
8789 TARGET_EXPR_INITIAL (expr
)
8790 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
8792 /* If the initializer is constant, put it in DECL_INITIAL so we get
8793 static initialization and use in constant expressions. */
8794 init
= maybe_constant_init (expr
);
8795 if (TREE_CONSTANT (init
))
8797 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
8799 /* 5.19 says that a constant expression can include an
8800 lvalue-rvalue conversion applied to "a glvalue of literal type
8801 that refers to a non-volatile temporary object initialized
8802 with a constant expression". Rather than try to communicate
8803 that this VAR_DECL is a temporary, just mark it constexpr.
8805 Currently this is only useful for initializer_list temporaries,
8806 since reference vars can't appear in constant expressions. */
8807 DECL_DECLARED_CONSTEXPR_P (var
) = true;
8808 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
8809 TREE_CONSTANT (var
) = true;
8811 DECL_INITIAL (var
) = init
;
8815 /* Create the INIT_EXPR that will initialize the temporary
8817 init
= build2 (INIT_EXPR
, type
, var
, expr
);
8818 if (at_function_scope_p ())
8820 add_decl_expr (var
);
8822 if (TREE_STATIC (var
))
8823 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
8826 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
8828 VEC_safe_push (tree
, gc
, *cleanups
, cleanup
);
8831 /* We must be careful to destroy the temporary only
8832 after its initialization has taken place. If the
8833 initialization throws an exception, then the
8834 destructor should not be run. We cannot simply
8835 transform INIT into something like:
8837 (INIT, ({ CLEANUP_STMT; }))
8839 because emit_local_var always treats the
8840 initializer as a full-expression. Thus, the
8841 destructor would run too early; it would run at the
8842 end of initializing the reference variable, rather
8843 than at the end of the block enclosing the
8846 The solution is to pass back a cleanup expression
8847 which the caller is responsible for attaching to
8848 the statement tree. */
8852 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
8853 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8854 static_aggregates
= tree_cons (NULL_TREE
, var
,
8862 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
8863 initializing a variable of that TYPE. */
8866 initialize_reference (tree type
, tree expr
,
8867 int flags
, tsubst_flags_t complain
)
8871 location_t loc
= EXPR_LOC_OR_HERE (expr
);
8873 if (type
== error_mark_node
|| error_operand_p (expr
))
8874 return error_mark_node
;
8876 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8877 p
= conversion_obstack_alloc (0);
8879 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
8881 if (!conv
|| conv
->bad_p
)
8883 if (complain
& tf_error
)
8886 convert_like (conv
, expr
, complain
);
8887 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
8888 && !TYPE_REF_IS_RVALUE (type
)
8889 && !real_lvalue_p (expr
))
8890 error_at (loc
, "invalid initialization of non-const reference of "
8891 "type %qT from an rvalue of type %qT",
8892 type
, TREE_TYPE (expr
));
8894 error_at (loc
, "invalid initialization of reference of type "
8895 "%qT from expression of type %qT", type
,
8898 return error_mark_node
;
8901 gcc_assert (conv
->kind
== ck_ref_bind
);
8903 /* Perform the conversion. */
8904 expr
= convert_like (conv
, expr
, complain
);
8906 /* Free all the conversions we allocated. */
8907 obstack_free (&conversion_obstack
, p
);
8912 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
8913 which is bound either to a reference or a std::initializer_list. */
8916 extend_ref_init_temps_1 (tree decl
, tree init
, VEC(tree
,gc
) **cleanups
)
8921 if (TREE_CODE (sub
) != ADDR_EXPR
)
8923 /* Deal with binding to a subobject. */
8924 for (p
= &TREE_OPERAND (sub
, 0); TREE_CODE (*p
) == COMPONENT_REF
; )
8925 p
= &TREE_OPERAND (*p
, 0);
8926 if (TREE_CODE (*p
) == TARGET_EXPR
)
8928 tree subinit
= NULL_TREE
;
8929 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
8931 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
8936 /* INIT is part of the initializer for DECL. If there are any
8937 reference or initializer lists being initialized, extend their
8938 lifetime to match that of DECL. */
8941 extend_ref_init_temps (tree decl
, tree init
, VEC(tree
,gc
) **cleanups
)
8943 tree type
= TREE_TYPE (init
);
8944 if (processing_template_decl
)
8946 if (TREE_CODE (type
) == REFERENCE_TYPE
)
8947 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
8948 else if (is_std_init_list (type
))
8950 /* The temporary array underlying a std::initializer_list
8951 is handled like a reference temporary. */
8953 if (TREE_CODE (ctor
) == TARGET_EXPR
)
8954 ctor
= TARGET_EXPR_INITIAL (ctor
);
8955 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
8957 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
8958 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
8959 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
8962 else if (TREE_CODE (init
) == CONSTRUCTOR
)
8966 VEC(constructor_elt
,gc
) *elts
= CONSTRUCTOR_ELTS (init
);
8967 FOR_EACH_VEC_ELT (constructor_elt
, elts
, i
, p
)
8968 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
8974 /* Returns true iff TYPE is some variant of std::initializer_list. */
8977 is_std_init_list (tree type
)
8979 /* Look through typedefs. */
8982 type
= TYPE_MAIN_VARIANT (type
);
8983 return (CLASS_TYPE_P (type
)
8984 && CP_TYPE_CONTEXT (type
) == std_node
8985 && strcmp (TYPE_NAME_STRING (type
), "initializer_list") == 0);
8988 /* Returns true iff DECL is a list constructor: i.e. a constructor which
8989 will accept an argument list of a single std::initializer_list<T>. */
8992 is_list_ctor (tree decl
)
8994 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
8997 if (!args
|| args
== void_list_node
)
9000 arg
= non_reference (TREE_VALUE (args
));
9001 if (!is_std_init_list (arg
))
9004 args
= TREE_CHAIN (args
);
9006 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
9007 /* There are more non-defaulted parms. */
9013 #include "gt-cp-call.h"