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, 2010
4 Free Software Foundation, Inc.
5 Contributed by Michael Tiemann (tiemann@cygnus.com) and
6 modified by Brendan Kehoe (brendan@cygnus.com).
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 3, or (at your option)
15 GCC is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
25 /* High-level class interface. */
29 #include "coretypes.h"
36 #include "diagnostic-core.h"
40 #include "langhooks.h"
41 #include "c-family/c-objc.h"
43 /* The various kinds of conversion. */
45 typedef enum conversion_kind
{
61 /* The rank of the conversion. Order of the enumerals matters; better
62 conversions should come earlier in the list. */
64 typedef enum conversion_rank
{
75 /* An implicit conversion sequence, in the sense of [over.best.ics].
76 The first conversion to be performed is at the end of the chain.
77 That conversion is always a cr_identity conversion. */
79 typedef struct conversion conversion
;
81 /* The kind of conversion represented by this step. */
83 /* The rank of this conversion. */
85 BOOL_BITFIELD user_conv_p
: 1;
86 BOOL_BITFIELD ellipsis_p
: 1;
87 BOOL_BITFIELD this_p
: 1;
88 /* True if this conversion would be permitted with a bending of
89 language standards, e.g. disregarding pointer qualifiers or
90 converting integers to pointers. */
91 BOOL_BITFIELD bad_p
: 1;
92 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
93 temporary should be created to hold the result of the
95 BOOL_BITFIELD need_temporary_p
: 1;
96 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
97 from a pointer-to-derived to pointer-to-base is being performed. */
98 BOOL_BITFIELD base_p
: 1;
99 /* If KIND is ck_ref_bind, true when either an lvalue reference is
100 being bound to an lvalue expression or an rvalue reference is
101 being bound to an rvalue expression. If KIND is ck_rvalue,
102 true when we should treat an lvalue as an rvalue (12.8p33). If
103 KIND is ck_base, always false. */
104 BOOL_BITFIELD rvaluedness_matches_p
: 1;
105 BOOL_BITFIELD check_narrowing
: 1;
106 /* The type of the expression resulting from the conversion. */
109 /* The next conversion in the chain. Since the conversions are
110 arranged from outermost to innermost, the NEXT conversion will
111 actually be performed before this conversion. This variant is
112 used only when KIND is neither ck_identity nor ck_ambig. */
114 /* The expression at the beginning of the conversion chain. This
115 variant is used only if KIND is ck_identity or ck_ambig. */
117 /* The array of conversions for an initializer_list. */
120 /* The function candidate corresponding to this conversion
121 sequence. This field is only used if KIND is ck_user. */
122 struct z_candidate
*cand
;
125 #define CONVERSION_RANK(NODE) \
126 ((NODE)->bad_p ? cr_bad \
127 : (NODE)->ellipsis_p ? cr_ellipsis \
128 : (NODE)->user_conv_p ? cr_user \
131 #define BAD_CONVERSION_RANK(NODE) \
132 ((NODE)->ellipsis_p ? cr_ellipsis \
133 : (NODE)->user_conv_p ? cr_user \
136 static struct obstack conversion_obstack
;
137 static bool conversion_obstack_initialized
;
138 struct rejection_reason
;
140 static struct z_candidate
* tourney (struct z_candidate
*);
141 static int equal_functions (tree
, tree
);
142 static int joust (struct z_candidate
*, struct z_candidate
*, bool);
143 static int compare_ics (conversion
*, conversion
*);
144 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
145 static tree
build_java_interface_fn_ref (tree
, tree
);
146 #define convert_like(CONV, EXPR, COMPLAIN) \
147 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
148 /*issue_conversion_warnings=*/true, \
149 /*c_cast_p=*/false, (COMPLAIN))
150 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
151 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
152 /*issue_conversion_warnings=*/true, \
153 /*c_cast_p=*/false, (COMPLAIN))
154 static tree
convert_like_real (conversion
*, tree
, tree
, int, int, bool,
155 bool, tsubst_flags_t
);
156 static void op_error (enum tree_code
, enum tree_code
, tree
, tree
,
158 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int);
159 static void print_z_candidate (const char *, struct z_candidate
*);
160 static void print_z_candidates (location_t
, struct z_candidate
*);
161 static tree
build_this (tree
);
162 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
163 static bool any_strictly_viable (struct z_candidate
*);
164 static struct z_candidate
*add_template_candidate
165 (struct z_candidate
**, tree
, tree
, tree
, tree
, const VEC(tree
,gc
) *,
166 tree
, tree
, tree
, int, unification_kind_t
);
167 static struct z_candidate
*add_template_candidate_real
168 (struct z_candidate
**, tree
, tree
, tree
, tree
, const VEC(tree
,gc
) *,
169 tree
, tree
, tree
, int, tree
, unification_kind_t
);
170 static struct z_candidate
*add_template_conv_candidate
171 (struct z_candidate
**, tree
, tree
, tree
, const VEC(tree
,gc
) *, tree
,
173 static void add_builtin_candidates
174 (struct z_candidate
**, enum tree_code
, enum tree_code
,
176 static void add_builtin_candidate
177 (struct z_candidate
**, enum tree_code
, enum tree_code
,
178 tree
, tree
, tree
, tree
*, tree
*, int);
179 static bool is_complete (tree
);
180 static void build_builtin_candidate
181 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
183 static struct z_candidate
*add_conv_candidate
184 (struct z_candidate
**, tree
, tree
, tree
, const VEC(tree
,gc
) *, tree
,
186 static struct z_candidate
*add_function_candidate
187 (struct z_candidate
**, tree
, tree
, tree
, const VEC(tree
,gc
) *, tree
,
189 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int);
190 static conversion
*standard_conversion (tree
, tree
, tree
, bool, int);
191 static conversion
*reference_binding (tree
, tree
, tree
, bool, int);
192 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
193 static conversion
*build_list_conv (tree
, tree
, int);
194 static bool is_subseq (conversion
*, conversion
*);
195 static conversion
*maybe_handle_ref_bind (conversion
**);
196 static void maybe_handle_implicit_object (conversion
**);
197 static struct z_candidate
*add_candidate
198 (struct z_candidate
**, tree
, tree
, const VEC(tree
,gc
) *, size_t,
199 conversion
**, tree
, tree
, int, struct rejection_reason
*);
200 static tree
source_type (conversion
*);
201 static void add_warning (struct z_candidate
*, struct z_candidate
*);
202 static bool reference_compatible_p (tree
, tree
);
203 static conversion
*convert_class_to_reference (tree
, tree
, tree
, int);
204 static conversion
*direct_reference_binding (tree
, conversion
*);
205 static bool promoted_arithmetic_type_p (tree
);
206 static conversion
*conditional_conversion (tree
, tree
);
207 static char *name_as_c_string (tree
, tree
, bool *);
208 static tree
prep_operand (tree
);
209 static void add_candidates (tree
, tree
, const VEC(tree
,gc
) *, tree
, tree
, bool,
210 tree
, tree
, int, struct z_candidate
**);
211 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
212 static bool magic_varargs_p (tree
);
213 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
215 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
216 NAME can take many forms... */
219 check_dtor_name (tree basetype
, tree name
)
221 /* Just accept something we've already complained about. */
222 if (name
== error_mark_node
)
225 if (TREE_CODE (name
) == TYPE_DECL
)
226 name
= TREE_TYPE (name
);
227 else if (TYPE_P (name
))
229 else if (TREE_CODE (name
) == IDENTIFIER_NODE
)
231 if ((MAYBE_CLASS_TYPE_P (basetype
)
232 && name
== constructor_name (basetype
))
233 || (TREE_CODE (basetype
) == ENUMERAL_TYPE
234 && name
== TYPE_IDENTIFIER (basetype
)))
237 name
= get_type_value (name
);
243 template <class T> struct S { ~S(); };
247 NAME will be a class template. */
248 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
252 if (!name
|| name
== error_mark_node
)
254 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
257 /* We want the address of a function or method. We avoid creating a
258 pointer-to-member function. */
261 build_addr_func (tree function
)
263 tree type
= TREE_TYPE (function
);
265 /* We have to do these by hand to avoid real pointer to member
267 if (TREE_CODE (type
) == METHOD_TYPE
)
269 if (TREE_CODE (function
) == OFFSET_REF
)
271 tree object
= build_address (TREE_OPERAND (function
, 0));
272 return get_member_function_from_ptrfunc (&object
,
273 TREE_OPERAND (function
, 1));
275 function
= build_address (function
);
278 function
= decay_conversion (function
);
283 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
284 POINTER_TYPE to those. Note, pointer to member function types
285 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
286 two variants. build_call_a is the primitive taking an array of
287 arguments, while build_call_n is a wrapper that handles varargs. */
290 build_call_n (tree function
, int n
, ...)
293 return build_call_a (function
, 0, NULL
);
296 tree
*argarray
= XALLOCAVEC (tree
, n
);
301 for (i
= 0; i
< n
; i
++)
302 argarray
[i
] = va_arg (ap
, tree
);
304 return build_call_a (function
, n
, argarray
);
309 build_call_a (tree function
, int n
, tree
*argarray
)
311 int is_constructor
= 0;
318 function
= build_addr_func (function
);
320 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
321 fntype
= TREE_TYPE (TREE_TYPE (function
));
322 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
323 || TREE_CODE (fntype
) == METHOD_TYPE
);
324 result_type
= TREE_TYPE (fntype
);
325 /* An rvalue has no cv-qualifiers. */
326 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
327 result_type
= cv_unqualified (result_type
);
329 if (TREE_CODE (function
) == ADDR_EXPR
330 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
332 decl
= TREE_OPERAND (function
, 0);
333 if (!TREE_USED (decl
))
335 /* We invoke build_call directly for several library
336 functions. These may have been declared normally if
337 we're building libgcc, so we can't just check
339 gcc_assert (DECL_ARTIFICIAL (decl
)
340 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
348 /* We check both the decl and the type; a function may be known not to
349 throw without being declared throw(). */
350 nothrow
= ((decl
&& TREE_NOTHROW (decl
))
351 || TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (function
))));
353 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
354 current_function_returns_abnormally
= 1;
356 if (decl
&& TREE_DEPRECATED (decl
))
357 warn_deprecated_use (decl
, NULL_TREE
);
358 require_complete_eh_spec_types (fntype
, decl
);
360 if (decl
&& DECL_CONSTRUCTOR_P (decl
))
363 /* Don't pass empty class objects by value. This is useful
364 for tags in STL, which are used to control overload resolution.
365 We don't need to handle other cases of copying empty classes. */
366 if (! decl
|| ! DECL_BUILT_IN (decl
))
367 for (i
= 0; i
< n
; i
++)
368 if (is_empty_class (TREE_TYPE (argarray
[i
]))
369 && ! TREE_ADDRESSABLE (TREE_TYPE (argarray
[i
])))
371 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (argarray
[i
]));
372 argarray
[i
] = build2 (COMPOUND_EXPR
, TREE_TYPE (t
),
376 function
= build_call_array_loc (input_location
,
377 result_type
, function
, n
, argarray
);
378 TREE_HAS_CONSTRUCTOR (function
) = is_constructor
;
379 TREE_NOTHROW (function
) = nothrow
;
384 /* Build something of the form ptr->method (args)
385 or object.method (args). This can also build
386 calls to constructors, and find friends.
388 Member functions always take their class variable
391 INSTANCE is a class instance.
393 NAME is the name of the method desired, usually an IDENTIFIER_NODE.
395 PARMS help to figure out what that NAME really refers to.
397 BASETYPE_PATH, if non-NULL, contains a chain from the type of INSTANCE
398 down to the real instance type to use for access checking. We need this
399 information to get protected accesses correct.
401 FLAGS is the logical disjunction of zero or more LOOKUP_
402 flags. See cp-tree.h for more info.
404 If this is all OK, calls build_function_call with the resolved
407 This function must also handle being called to perform
408 initialization, promotion/coercion of arguments, and
409 instantiation of default parameters.
411 Note that NAME may refer to an instance variable name. If
412 `operator()()' is defined for the type of that field, then we return
415 /* New overloading code. */
417 typedef struct z_candidate z_candidate
;
419 typedef struct candidate_warning candidate_warning
;
420 struct candidate_warning
{
422 candidate_warning
*next
;
425 /* Information for providing diagnostics about why overloading failed. */
427 enum rejection_reason_code
{
431 rr_bad_arg_conversion
434 struct conversion_info
{
435 /* The index of the argument, 0-based. */
437 /* The type of the actual argument. */
439 /* The type of the formal argument. */
443 struct rejection_reason
{
444 enum rejection_reason_code code
;
446 /* Information about an arity mismatch. */
448 /* The expected number of arguments. */
450 /* The actual number of arguments in the call. */
452 /* Whether the call was a varargs call. */
455 /* Information about an argument conversion mismatch. */
456 struct conversion_info conversion
;
457 /* Same, but for bad argument conversions. */
458 struct conversion_info bad_conversion
;
463 /* The FUNCTION_DECL that will be called if this candidate is
464 selected by overload resolution. */
466 /* If not NULL_TREE, the first argument to use when calling this
469 /* The rest of the arguments to use when calling this function. If
470 there are no further arguments this may be NULL or it may be an
472 const VEC(tree
,gc
) *args
;
473 /* The implicit conversion sequences for each of the arguments to
476 /* The number of implicit conversion sequences. */
478 /* If FN is a user-defined conversion, the standard conversion
479 sequence from the type returned by FN to the desired destination
481 conversion
*second_conv
;
483 struct rejection_reason
*reason
;
484 /* If FN is a member function, the binfo indicating the path used to
485 qualify the name of FN at the call site. This path is used to
486 determine whether or not FN is accessible if it is selected by
487 overload resolution. The DECL_CONTEXT of FN will always be a
488 (possibly improper) base of this binfo. */
490 /* If FN is a non-static member function, the binfo indicating the
491 subobject to which the `this' pointer should be converted if FN
492 is selected by overload resolution. The type pointed to the by
493 the `this' pointer must correspond to the most derived class
494 indicated by the CONVERSION_PATH. */
495 tree conversion_path
;
498 candidate_warning
*warnings
;
502 /* Returns true iff T is a null pointer constant in the sense of
506 null_ptr_cst_p (tree t
)
510 A null pointer constant is an integral constant expression
511 (_expr.const_) rvalue of integer type that evaluates to zero or
512 an rvalue of type std::nullptr_t. */
513 if (NULLPTR_TYPE_P (TREE_TYPE (t
)))
515 if (CP_INTEGRAL_TYPE_P (TREE_TYPE (t
)))
517 if (cxx_dialect
>= cxx0x
)
519 t
= fold_non_dependent_expr (t
);
520 t
= maybe_constant_value (t
);
521 if (TREE_CONSTANT (t
) && integer_zerop (t
))
526 t
= integral_constant_value (t
);
528 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
535 /* Returns nonzero if PARMLIST consists of only default parms and/or
539 sufficient_parms_p (const_tree parmlist
)
541 for (; parmlist
&& parmlist
!= void_list_node
;
542 parmlist
= TREE_CHAIN (parmlist
))
543 if (!TREE_PURPOSE (parmlist
))
548 /* Allocate N bytes of memory from the conversion obstack. The memory
549 is zeroed before being returned. */
552 conversion_obstack_alloc (size_t n
)
555 if (!conversion_obstack_initialized
)
557 gcc_obstack_init (&conversion_obstack
);
558 conversion_obstack_initialized
= true;
560 p
= obstack_alloc (&conversion_obstack
, n
);
565 /* Allocate rejection reasons. */
567 static struct rejection_reason
*
568 alloc_rejection (enum rejection_reason_code code
)
570 struct rejection_reason
*p
;
571 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
576 static struct rejection_reason
*
577 arity_rejection (tree first_arg
, int expected
, int actual
)
579 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
580 int adjust
= first_arg
!= NULL_TREE
;
581 r
->u
.arity
.expected
= expected
- adjust
;
582 r
->u
.arity
.actual
= actual
- adjust
;
586 static struct rejection_reason
*
587 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
589 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
590 int adjust
= first_arg
!= NULL_TREE
;
591 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
592 r
->u
.conversion
.from_type
= from
;
593 r
->u
.conversion
.to_type
= to
;
597 static struct rejection_reason
*
598 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
600 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
601 int adjust
= first_arg
!= NULL_TREE
;
602 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
603 r
->u
.bad_conversion
.from_type
= from
;
604 r
->u
.bad_conversion
.to_type
= to
;
608 /* Dynamically allocate a conversion. */
611 alloc_conversion (conversion_kind kind
)
614 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
619 #ifdef ENABLE_CHECKING
621 /* Make sure that all memory on the conversion obstack has been
625 validate_conversion_obstack (void)
627 if (conversion_obstack_initialized
)
628 gcc_assert ((obstack_next_free (&conversion_obstack
)
629 == obstack_base (&conversion_obstack
)));
632 #endif /* ENABLE_CHECKING */
634 /* Dynamically allocate an array of N conversions. */
637 alloc_conversions (size_t n
)
639 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
643 build_conv (conversion_kind code
, tree type
, conversion
*from
)
646 conversion_rank rank
= CONVERSION_RANK (from
);
648 /* Note that the caller is responsible for filling in t->cand for
649 user-defined conversions. */
650 t
= alloc_conversion (code
);
673 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
674 t
->bad_p
= from
->bad_p
;
679 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
680 specialization of std::initializer_list<T>, if such a conversion is
684 build_list_conv (tree type
, tree ctor
, int flags
)
686 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
687 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
688 conversion
**subconvs
= alloc_conversions (len
);
693 /* Within a list-initialization we can have more user-defined
695 flags
&= ~LOOKUP_NO_CONVERSION
;
696 /* But no narrowing conversions. */
697 flags
|= LOOKUP_NO_NARROWING
;
699 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
702 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
710 t
= alloc_conversion (ck_list
);
712 t
->u
.list
= subconvs
;
715 for (i
= 0; i
< len
; ++i
)
717 conversion
*sub
= subconvs
[i
];
718 if (sub
->rank
> t
->rank
)
720 if (sub
->user_conv_p
)
721 t
->user_conv_p
= true;
729 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
730 is a valid aggregate initializer for array type ATYPE. */
733 can_convert_array (tree atype
, tree ctor
, int flags
)
736 tree elttype
= TREE_TYPE (atype
);
737 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
739 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
741 if (TREE_CODE (elttype
) == ARRAY_TYPE
742 && TREE_CODE (val
) == CONSTRUCTOR
)
743 ok
= can_convert_array (elttype
, val
, flags
);
745 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
);
752 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
753 aggregate class, if such a conversion is possible. */
756 build_aggr_conv (tree type
, tree ctor
, int flags
)
758 unsigned HOST_WIDE_INT i
= 0;
760 tree field
= next_initializable_field (TYPE_FIELDS (type
));
761 tree empty_ctor
= NULL_TREE
;
763 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
765 tree ftype
= TREE_TYPE (field
);
769 if (i
< CONSTRUCTOR_NELTS (ctor
))
770 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
773 if (empty_ctor
== NULL_TREE
)
774 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
779 if (TREE_CODE (ftype
) == ARRAY_TYPE
780 && TREE_CODE (val
) == CONSTRUCTOR
)
781 ok
= can_convert_array (ftype
, val
, flags
);
783 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
);
788 if (TREE_CODE (type
) == UNION_TYPE
)
792 if (i
< CONSTRUCTOR_NELTS (ctor
))
795 c
= alloc_conversion (ck_aggr
);
798 c
->user_conv_p
= true;
803 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
804 array type, if such a conversion is possible. */
807 build_array_conv (tree type
, tree ctor
, int flags
)
810 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
811 tree elttype
= TREE_TYPE (type
);
816 enum conversion_rank rank
= cr_exact
;
818 if (TYPE_DOMAIN (type
))
820 unsigned HOST_WIDE_INT alen
= tree_low_cst (array_type_nelts_top (type
), 1);
825 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
828 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
833 if (sub
->rank
> rank
)
835 if (sub
->user_conv_p
)
841 c
= alloc_conversion (ck_aggr
);
844 c
->user_conv_p
= user
;
850 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
851 complex type, if such a conversion is possible. */
854 build_complex_conv (tree type
, tree ctor
, int flags
)
857 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
858 tree elttype
= TREE_TYPE (type
);
863 enum conversion_rank rank
= cr_exact
;
868 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
871 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
876 if (sub
->rank
> rank
)
878 if (sub
->user_conv_p
)
884 c
= alloc_conversion (ck_aggr
);
887 c
->user_conv_p
= user
;
893 /* Build a representation of the identity conversion from EXPR to
894 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
897 build_identity_conv (tree type
, tree expr
)
901 c
= alloc_conversion (ck_identity
);
908 /* Converting from EXPR to TYPE was ambiguous in the sense that there
909 were multiple user-defined conversions to accomplish the job.
910 Build a conversion that indicates that ambiguity. */
913 build_ambiguous_conv (tree type
, tree expr
)
917 c
= alloc_conversion (ck_ambig
);
925 strip_top_quals (tree t
)
927 if (TREE_CODE (t
) == ARRAY_TYPE
)
929 return cp_build_qualified_type (t
, 0);
932 /* Returns the standard conversion path (see [conv]) from type FROM to type
933 TO, if any. For proper handling of null pointer constants, you must
934 also pass the expression EXPR to convert from. If C_CAST_P is true,
935 this conversion is coming from a C-style cast. */
938 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
941 enum tree_code fcode
, tcode
;
943 bool fromref
= false;
946 to
= non_reference (to
);
947 if (TREE_CODE (from
) == REFERENCE_TYPE
)
950 from
= TREE_TYPE (from
);
953 to
= strip_top_quals (to
);
954 from
= strip_top_quals (from
);
956 if ((TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
957 && expr
&& type_unknown_p (expr
))
959 tsubst_flags_t tflags
= tf_conv
;
960 if (!(flags
& LOOKUP_PROTECT
))
961 tflags
|= tf_no_access_control
;
962 expr
= instantiate_type (to
, expr
, tflags
);
963 if (expr
== error_mark_node
)
965 from
= TREE_TYPE (expr
);
968 fcode
= TREE_CODE (from
);
969 tcode
= TREE_CODE (to
);
971 conv
= build_identity_conv (from
, expr
);
972 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
974 from
= type_decays_to (from
);
975 fcode
= TREE_CODE (from
);
976 conv
= build_conv (ck_lvalue
, from
, conv
);
978 else if (fromref
|| (expr
&& lvalue_p (expr
)))
983 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
986 from
= strip_top_quals (bitfield_type
);
987 fcode
= TREE_CODE (from
);
990 conv
= build_conv (ck_rvalue
, from
, conv
);
991 if (flags
& LOOKUP_PREFER_RVALUE
)
992 conv
->rvaluedness_matches_p
= true;
995 /* Allow conversion between `__complex__' data types. */
996 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
998 /* The standard conversion sequence to convert FROM to TO is
999 the standard conversion sequence to perform componentwise
1001 conversion
*part_conv
= standard_conversion
1002 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
);
1006 conv
= build_conv (part_conv
->kind
, to
, conv
);
1007 conv
->rank
= part_conv
->rank
;
1015 if (same_type_p (from
, to
))
1017 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1018 conv
->type
= qualified_to
;
1023 A null pointer constant can be converted to a pointer type; ... A
1024 null pointer constant of integral type can be converted to an
1025 rvalue of type std::nullptr_t. */
1026 if ((tcode
== POINTER_TYPE
|| TYPE_PTR_TO_MEMBER_P (to
)
1027 || NULLPTR_TYPE_P (to
))
1028 && expr
&& null_ptr_cst_p (expr
))
1029 conv
= build_conv (ck_std
, to
, conv
);
1030 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1031 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1033 /* For backwards brain damage compatibility, allow interconversion of
1034 pointers and integers with a pedwarn. */
1035 conv
= build_conv (ck_std
, to
, conv
);
1038 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1040 /* For backwards brain damage compatibility, allow interconversion of
1041 enums and integers with a pedwarn. */
1042 conv
= build_conv (ck_std
, to
, conv
);
1045 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1046 || (TYPE_PTRMEM_P (to
) && TYPE_PTRMEM_P (from
)))
1051 if (tcode
== POINTER_TYPE
1052 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from
),
1055 else if (VOID_TYPE_P (TREE_TYPE (to
))
1056 && !TYPE_PTRMEM_P (from
)
1057 && TREE_CODE (TREE_TYPE (from
)) != FUNCTION_TYPE
)
1059 tree nfrom
= TREE_TYPE (from
);
1060 from
= build_pointer_type
1061 (cp_build_qualified_type (void_type_node
,
1062 cp_type_quals (nfrom
)));
1063 conv
= build_conv (ck_ptr
, from
, conv
);
1065 else if (TYPE_PTRMEM_P (from
))
1067 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1068 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1070 if (DERIVED_FROM_P (fbase
, tbase
)
1071 && (same_type_ignoring_top_level_qualifiers_p
1072 (TYPE_PTRMEM_POINTED_TO_TYPE (from
),
1073 TYPE_PTRMEM_POINTED_TO_TYPE (to
))))
1075 from
= build_ptrmem_type (tbase
,
1076 TYPE_PTRMEM_POINTED_TO_TYPE (from
));
1077 conv
= build_conv (ck_pmem
, from
, conv
);
1079 else if (!same_type_p (fbase
, tbase
))
1082 else if (CLASS_TYPE_P (TREE_TYPE (from
))
1083 && CLASS_TYPE_P (TREE_TYPE (to
))
1086 An rvalue of type "pointer to cv D," where D is a
1087 class type, can be converted to an rvalue of type
1088 "pointer to cv B," where B is a base class (clause
1089 _class.derived_) of D. If B is an inaccessible
1090 (clause _class.access_) or ambiguous
1091 (_class.member.lookup_) base class of D, a program
1092 that necessitates this conversion is ill-formed.
1093 Therefore, we use DERIVED_FROM_P, and do not check
1094 access or uniqueness. */
1095 && DERIVED_FROM_P (TREE_TYPE (to
), TREE_TYPE (from
)))
1098 cp_build_qualified_type (TREE_TYPE (to
),
1099 cp_type_quals (TREE_TYPE (from
)));
1100 from
= build_pointer_type (from
);
1101 conv
= build_conv (ck_ptr
, from
, conv
);
1102 conv
->base_p
= true;
1105 if (tcode
== POINTER_TYPE
)
1107 to_pointee
= TREE_TYPE (to
);
1108 from_pointee
= TREE_TYPE (from
);
1112 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1113 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1116 if (same_type_p (from
, to
))
1118 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
1119 /* In a C-style cast, we ignore CV-qualification because we
1120 are allowed to perform a static_cast followed by a
1122 conv
= build_conv (ck_qual
, to
, conv
);
1123 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1124 conv
= build_conv (ck_qual
, to
, conv
);
1125 else if (expr
&& string_conv_p (to
, expr
, 0))
1126 /* converting from string constant to char *. */
1127 conv
= build_conv (ck_qual
, to
, conv
);
1128 /* Allow conversions among compatible ObjC pointer types (base
1129 conversions have been already handled above). */
1130 else if (c_dialect_objc ()
1131 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1132 conv
= build_conv (ck_ptr
, to
, conv
);
1133 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1135 conv
= build_conv (ck_ptr
, to
, conv
);
1143 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1145 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1146 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1147 tree fbase
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fromfn
)));
1148 tree tbase
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (tofn
)));
1150 if (!DERIVED_FROM_P (fbase
, tbase
)
1151 || !same_type_p (TREE_TYPE (fromfn
), TREE_TYPE (tofn
))
1152 || !compparms (TREE_CHAIN (TYPE_ARG_TYPES (fromfn
)),
1153 TREE_CHAIN (TYPE_ARG_TYPES (tofn
)))
1154 || cp_type_quals (fbase
) != cp_type_quals (tbase
))
1157 from
= build_memfn_type (fromfn
, tbase
, cp_type_quals (tbase
));
1158 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1159 conv
= build_conv (ck_pmem
, from
, conv
);
1160 conv
->base_p
= true;
1162 else if (tcode
== BOOLEAN_TYPE
)
1166 An rvalue of arithmetic, unscoped enumeration, pointer, or
1167 pointer to member type can be converted to an rvalue of type
1168 bool. ... An rvalue of type std::nullptr_t can be converted
1169 to an rvalue of type bool; */
1170 if (ARITHMETIC_TYPE_P (from
)
1171 || UNSCOPED_ENUM_P (from
)
1172 || fcode
== POINTER_TYPE
1173 || TYPE_PTR_TO_MEMBER_P (from
)
1174 || NULLPTR_TYPE_P (from
))
1176 conv
= build_conv (ck_std
, to
, conv
);
1177 if (fcode
== POINTER_TYPE
1178 || TYPE_PTRMEM_P (from
)
1179 || (TYPE_PTRMEMFUNC_P (from
)
1180 && conv
->rank
< cr_pbool
)
1181 || NULLPTR_TYPE_P (from
))
1182 conv
->rank
= cr_pbool
;
1188 /* We don't check for ENUMERAL_TYPE here because there are no standard
1189 conversions to enum type. */
1190 /* As an extension, allow conversion to complex type. */
1191 else if (ARITHMETIC_TYPE_P (to
))
1193 if (! (INTEGRAL_CODE_P (fcode
) || fcode
== REAL_TYPE
)
1194 || SCOPED_ENUM_P (from
))
1196 conv
= build_conv (ck_std
, to
, conv
);
1198 /* Give this a better rank if it's a promotion. */
1199 if (same_type_p (to
, type_promotes_to (from
))
1200 && conv
->u
.next
->rank
<= cr_promotion
)
1201 conv
->rank
= cr_promotion
;
1203 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1204 && vector_types_convertible_p (from
, to
, false))
1205 return build_conv (ck_std
, to
, conv
);
1206 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1207 && is_properly_derived_from (from
, to
))
1209 if (conv
->kind
== ck_rvalue
)
1210 conv
= conv
->u
.next
;
1211 conv
= build_conv (ck_base
, to
, conv
);
1212 /* The derived-to-base conversion indicates the initialization
1213 of a parameter with base type from an object of a derived
1214 type. A temporary object is created to hold the result of
1215 the conversion unless we're binding directly to a reference. */
1216 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1221 if (flags
& LOOKUP_NO_NARROWING
)
1222 conv
->check_narrowing
= true;
1227 /* Returns nonzero if T1 is reference-related to T2. */
1230 reference_related_p (tree t1
, tree t2
)
1232 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1235 t1
= TYPE_MAIN_VARIANT (t1
);
1236 t2
= TYPE_MAIN_VARIANT (t2
);
1240 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1241 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1243 return (same_type_p (t1
, t2
)
1244 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1245 && DERIVED_FROM_P (t1
, t2
)));
1248 /* Returns nonzero if T1 is reference-compatible with T2. */
1251 reference_compatible_p (tree t1
, tree t2
)
1255 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
1256 reference-related to T2 and cv1 is the same cv-qualification as,
1257 or greater cv-qualification than, cv2. */
1258 return (reference_related_p (t1
, t2
)
1259 && at_least_as_qualified_p (t1
, t2
));
1262 /* Determine whether or not the EXPR (of class type S) can be
1263 converted to T as in [over.match.ref]. */
1266 convert_class_to_reference (tree reference_type
, tree s
, tree expr
, int flags
)
1272 struct z_candidate
*candidates
;
1273 struct z_candidate
*cand
;
1279 conversions
= lookup_conversions (s
);
1285 Assuming that "cv1 T" is the underlying type of the reference
1286 being initialized, and "cv S" is the type of the initializer
1287 expression, with S a class type, the candidate functions are
1288 selected as follows:
1290 --The conversion functions of S and its base classes are
1291 considered. Those that are not hidden within S and yield type
1292 "reference to cv2 T2", where "cv1 T" is reference-compatible
1293 (_dcl.init.ref_) with "cv2 T2", are candidate functions.
1295 The argument list has one argument, which is the initializer
1300 /* Conceptually, we should take the address of EXPR and put it in
1301 the argument list. Unfortunately, however, that can result in
1302 error messages, which we should not issue now because we are just
1303 trying to find a conversion operator. Therefore, we use NULL,
1304 cast to the appropriate type. */
1305 first_arg
= build_int_cst (build_pointer_type (s
), 0);
1307 t
= TREE_TYPE (reference_type
);
1309 /* We're performing a user-defined conversion to a desired type, so set
1310 this for the benefit of add_candidates. */
1311 flags
|= LOOKUP_NO_CONVERSION
;
1313 for (; conversions
; conversions
= TREE_CHAIN (conversions
))
1315 tree fns
= TREE_VALUE (conversions
);
1316 tree binfo
= TREE_PURPOSE (conversions
);
1317 struct z_candidate
*old_candidates
= candidates
;;
1319 add_candidates (fns
, first_arg
, NULL
, reference_type
,
1321 binfo
, TYPE_BINFO (s
),
1322 flags
, &candidates
);
1324 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
1326 /* Now, see if the conversion function really returns
1327 an lvalue of the appropriate type. From the
1328 point of view of unification, simply returning an
1329 rvalue of the right type is good enough. */
1331 tree t2
= TREE_TYPE (TREE_TYPE (f
));
1332 if (cand
->viable
== 0)
1333 /* Don't bother looking more closely. */;
1334 else if (TREE_CODE (t2
) != REFERENCE_TYPE
1335 || !reference_compatible_p (t
, TREE_TYPE (t2
)))
1337 /* No need to set cand->reason here; this is most likely
1338 an ambiguous match. If it's not, either this candidate
1339 will win, or we will have identified a reason for it
1345 conversion
*identity_conv
;
1346 /* Build a standard conversion sequence indicating the
1347 binding from the reference type returned by the
1348 function to the desired REFERENCE_TYPE. */
1350 = build_identity_conv (TREE_TYPE (TREE_TYPE
1351 (TREE_TYPE (cand
->fn
))),
1354 = (direct_reference_binding
1355 (reference_type
, identity_conv
));
1356 cand
->second_conv
->rvaluedness_matches_p
1357 = TYPE_REF_IS_RVALUE (TREE_TYPE (TREE_TYPE (cand
->fn
)))
1358 == TYPE_REF_IS_RVALUE (reference_type
);
1359 cand
->second_conv
->bad_p
|= cand
->convs
[0]->bad_p
;
1361 /* Don't allow binding of lvalues to rvalue references. */
1362 if (TYPE_REF_IS_RVALUE (reference_type
)
1363 && !TYPE_REF_IS_RVALUE (TREE_TYPE (TREE_TYPE (cand
->fn
))))
1364 cand
->second_conv
->bad_p
= true;
1369 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
1370 /* If none of the conversion functions worked out, let our caller
1375 cand
= tourney (candidates
);
1379 /* Now that we know that this is the function we're going to use fix
1380 the dummy first argument. */
1381 gcc_assert (cand
->first_arg
== NULL_TREE
1382 || integer_zerop (cand
->first_arg
));
1383 cand
->first_arg
= build_this (expr
);
1385 /* Build a user-defined conversion sequence representing the
1387 conv
= build_conv (ck_user
,
1388 TREE_TYPE (TREE_TYPE (cand
->fn
)),
1389 build_identity_conv (TREE_TYPE (expr
), expr
));
1392 if (cand
->viable
== -1)
1395 /* Merge it with the standard conversion sequence from the
1396 conversion function's return type to the desired type. */
1397 cand
->second_conv
= merge_conversion_sequences (conv
, cand
->second_conv
);
1399 return cand
->second_conv
;
1402 /* A reference of the indicated TYPE is being bound directly to the
1403 expression represented by the implicit conversion sequence CONV.
1404 Return a conversion sequence for this binding. */
1407 direct_reference_binding (tree type
, conversion
*conv
)
1411 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
1412 gcc_assert (TREE_CODE (conv
->type
) != REFERENCE_TYPE
);
1414 t
= TREE_TYPE (type
);
1418 When a parameter of reference type binds directly
1419 (_dcl.init.ref_) to an argument expression, the implicit
1420 conversion sequence is the identity conversion, unless the
1421 argument expression has a type that is a derived class of the
1422 parameter type, in which case the implicit conversion sequence is
1423 a derived-to-base Conversion.
1425 If the parameter binds directly to the result of applying a
1426 conversion function to the argument expression, the implicit
1427 conversion sequence is a user-defined conversion sequence
1428 (_over.ics.user_), with the second standard conversion sequence
1429 either an identity conversion or, if the conversion function
1430 returns an entity of a type that is a derived class of the
1431 parameter type, a derived-to-base conversion. */
1432 if (!same_type_ignoring_top_level_qualifiers_p (t
, conv
->type
))
1434 /* Represent the derived-to-base conversion. */
1435 conv
= build_conv (ck_base
, t
, conv
);
1436 /* We will actually be binding to the base-class subobject in
1437 the derived class, so we mark this conversion appropriately.
1438 That way, convert_like knows not to generate a temporary. */
1439 conv
->need_temporary_p
= false;
1441 return build_conv (ck_ref_bind
, type
, conv
);
1444 /* Returns the conversion path from type FROM to reference type TO for
1445 purposes of reference binding. For lvalue binding, either pass a
1446 reference type to FROM or an lvalue expression to EXPR. If the
1447 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1448 the conversion returned. If C_CAST_P is true, this
1449 conversion is coming from a C-style cast. */
1452 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
)
1454 conversion
*conv
= NULL
;
1455 tree to
= TREE_TYPE (rto
);
1460 cp_lvalue_kind is_lvalue
= clk_none
;
1462 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1464 expr
= instantiate_type (to
, expr
, tf_none
);
1465 if (expr
== error_mark_node
)
1467 from
= TREE_TYPE (expr
);
1470 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1472 /* Anything with reference type is an lvalue. */
1473 is_lvalue
= clk_ordinary
;
1474 from
= TREE_TYPE (from
);
1477 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1479 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1480 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1482 if (!CLASS_TYPE_P (to
)
1483 && CONSTRUCTOR_NELTS (expr
) == 1)
1485 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1486 if (error_operand_p (expr
))
1488 from
= TREE_TYPE (expr
);
1492 if (is_lvalue
== clk_none
&& expr
)
1493 is_lvalue
= real_lvalue_p (expr
);
1496 if ((is_lvalue
& clk_bitfield
) != 0)
1497 tfrom
= unlowered_expr_type (expr
);
1499 /* Figure out whether or not the types are reference-related and
1500 reference compatible. We have do do this after stripping
1501 references from FROM. */
1502 related_p
= reference_related_p (to
, tfrom
);
1503 /* If this is a C cast, first convert to an appropriately qualified
1504 type, so that we can later do a const_cast to the desired type. */
1505 if (related_p
&& c_cast_p
1506 && !at_least_as_qualified_p (to
, tfrom
))
1507 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1508 compatible_p
= reference_compatible_p (to
, tfrom
);
1510 /* Directly bind reference when target expression's type is compatible with
1511 the reference and expression is an lvalue. In DR391, the wording in
1512 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1513 const and rvalue references to rvalues of compatible class type.
1514 We should also do direct bindings for non-class "rvalues" derived from
1515 rvalue references. */
1518 || (((CP_TYPE_CONST_NON_VOLATILE_P (to
)
1519 && !(flags
& LOOKUP_NO_TEMP_BIND
))
1520 || TYPE_REF_IS_RVALUE (rto
))
1521 && (CLASS_TYPE_P (from
)
1522 || TREE_CODE (from
) == ARRAY_TYPE
1523 || (expr
&& lvalue_p (expr
))))))
1527 If the initializer expression
1529 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1530 is reference-compatible with "cv2 T2,"
1532 the reference is bound directly to the initializer expression
1536 If the initializer expression is an rvalue, with T2 a class type,
1537 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1538 is bound to the object represented by the rvalue or to a sub-object
1539 within that object. */
1541 conv
= build_identity_conv (tfrom
, expr
);
1542 conv
= direct_reference_binding (rto
, conv
);
1544 if (flags
& LOOKUP_PREFER_RVALUE
)
1545 /* The top-level caller requested that we pretend that the lvalue
1546 be treated as an rvalue. */
1547 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1549 conv
->rvaluedness_matches_p
1550 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1552 if ((is_lvalue
& clk_bitfield
) != 0
1553 || ((is_lvalue
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1554 /* For the purposes of overload resolution, we ignore the fact
1555 this expression is a bitfield or packed field. (In particular,
1556 [over.ics.ref] says specifically that a function with a
1557 non-const reference parameter is viable even if the
1558 argument is a bitfield.)
1560 However, when we actually call the function we must create
1561 a temporary to which to bind the reference. If the
1562 reference is volatile, or isn't const, then we cannot make
1563 a temporary, so we just issue an error when the conversion
1565 conv
->need_temporary_p
= true;
1567 /* Don't allow binding of lvalues (other than function lvalues) to
1568 rvalue references. */
1569 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1570 && TREE_CODE (to
) != FUNCTION_TYPE
1571 && !(flags
& LOOKUP_PREFER_RVALUE
))
1576 /* [class.conv.fct] A conversion function is never used to convert a
1577 (possibly cv-qualified) object to the (possibly cv-qualified) same
1578 object type (or a reference to it), to a (possibly cv-qualified) base
1579 class of that type (or a reference to it).... */
1580 else if (CLASS_TYPE_P (from
) && !related_p
1581 && !(flags
& LOOKUP_NO_CONVERSION
))
1585 If the initializer expression
1587 -- has a class type (i.e., T2 is a class type) can be
1588 implicitly converted to an lvalue of type "cv3 T3," where
1589 "cv1 T1" is reference-compatible with "cv3 T3". (this
1590 conversion is selected by enumerating the applicable
1591 conversion functions (_over.match.ref_) and choosing the
1592 best one through overload resolution. (_over.match_).
1594 the reference is bound to the lvalue result of the conversion
1595 in the second case. */
1596 conv
= convert_class_to_reference (rto
, from
, expr
, flags
);
1601 /* From this point on, we conceptually need temporaries, even if we
1602 elide them. Only the cases above are "direct bindings". */
1603 if (flags
& LOOKUP_NO_TEMP_BIND
)
1608 When a parameter of reference type is not bound directly to an
1609 argument expression, the conversion sequence is the one required
1610 to convert the argument expression to the underlying type of the
1611 reference according to _over.best.ics_. Conceptually, this
1612 conversion sequence corresponds to copy-initializing a temporary
1613 of the underlying type with the argument expression. Any
1614 difference in top-level cv-qualification is subsumed by the
1615 initialization itself and does not constitute a conversion. */
1619 Otherwise, the reference shall be to a non-volatile const type.
1621 Under C++0x, [8.5.3/5 dcl.init.ref] it may also be an rvalue reference */
1622 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1627 Otherwise, a temporary of type "cv1 T1" is created and
1628 initialized from the initializer expression using the rules for a
1629 non-reference copy initialization. If T1 is reference-related to
1630 T2, cv1 must be the same cv-qualification as, or greater
1631 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1632 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1635 /* We're generating a temporary now, but don't bind any more in the
1636 conversion (specifically, don't slice the temporary returned by a
1637 conversion operator). */
1638 flags
|= LOOKUP_NO_TEMP_BIND
;
1640 /* Core issue 899: When [copy-]initializing a temporary to be bound
1641 to the first parameter of a copy constructor (12.8) called with
1642 a single argument in the context of direct-initialization,
1643 explicit conversion functions are also considered.
1645 So don't set LOOKUP_ONLYCONVERTING in that case. */
1646 if (!(flags
& LOOKUP_COPY_PARM
))
1647 flags
|= LOOKUP_ONLYCONVERTING
;
1650 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1655 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1656 /* This reference binding, unlike those above, requires the
1657 creation of a temporary. */
1658 conv
->need_temporary_p
= true;
1659 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1664 /* Returns the implicit conversion sequence (see [over.ics]) from type
1665 FROM to type TO. The optional expression EXPR may affect the
1666 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1667 true, this conversion is coming from a C-style cast. */
1670 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1675 if (from
== error_mark_node
|| to
== error_mark_node
1676 || expr
== error_mark_node
)
1679 if (TREE_CODE (to
) == REFERENCE_TYPE
)
1680 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
);
1682 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
);
1687 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1689 if (is_std_init_list (to
))
1690 return build_list_conv (to
, expr
, flags
);
1692 /* As an extension, allow list-initialization of _Complex. */
1693 if (TREE_CODE (to
) == COMPLEX_TYPE
)
1695 conv
= build_complex_conv (to
, expr
, flags
);
1700 /* Allow conversion from an initializer-list with one element to a
1702 if (SCALAR_TYPE_P (to
))
1704 int nelts
= CONSTRUCTOR_NELTS (expr
);
1708 elt
= build_value_init (to
, tf_none
);
1709 else if (nelts
== 1)
1710 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1712 elt
= error_mark_node
;
1714 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1718 conv
->check_narrowing
= true;
1719 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1720 /* Too many levels of braces, i.e. '{{1}}'. */
1725 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1726 return build_array_conv (to
, expr
, flags
);
1729 if (expr
!= NULL_TREE
1730 && (MAYBE_CLASS_TYPE_P (from
)
1731 || MAYBE_CLASS_TYPE_P (to
))
1732 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1734 struct z_candidate
*cand
;
1735 int convflags
= (flags
& (LOOKUP_NO_TEMP_BIND
|LOOKUP_ONLYCONVERTING
1736 |LOOKUP_NO_NARROWING
));
1738 if (CLASS_TYPE_P (to
)
1739 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
))
1740 && BRACE_ENCLOSED_INITIALIZER_P (expr
))
1741 return build_aggr_conv (to
, expr
, flags
);
1743 cand
= build_user_type_conversion_1 (to
, expr
, convflags
);
1745 conv
= cand
->second_conv
;
1747 /* We used to try to bind a reference to a temporary here, but that
1748 is now handled after the recursive call to this function at the end
1749 of reference_binding. */
1756 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1757 functions. ARGS will not be changed until a single candidate is
1760 static struct z_candidate
*
1761 add_candidate (struct z_candidate
**candidates
,
1762 tree fn
, tree first_arg
, const VEC(tree
,gc
) *args
,
1763 size_t num_convs
, conversion
**convs
,
1764 tree access_path
, tree conversion_path
,
1765 int viable
, struct rejection_reason
*reason
)
1767 struct z_candidate
*cand
= (struct z_candidate
*)
1768 conversion_obstack_alloc (sizeof (struct z_candidate
));
1771 cand
->first_arg
= first_arg
;
1773 cand
->convs
= convs
;
1774 cand
->num_convs
= num_convs
;
1775 cand
->access_path
= access_path
;
1776 cand
->conversion_path
= conversion_path
;
1777 cand
->viable
= viable
;
1778 cand
->reason
= reason
;
1779 cand
->next
= *candidates
;
1785 /* Return the number of remaining arguments in the parameter list
1786 beginning with ARG. */
1789 remaining_arguments (tree arg
)
1793 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
1794 arg
= TREE_CHAIN (arg
))
1800 /* Create an overload candidate for the function or method FN called
1801 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1802 FLAGS is passed on to implicit_conversion.
1804 This does not change ARGS.
1806 CTYPE, if non-NULL, is the type we want to pretend this function
1807 comes from for purposes of overload resolution. */
1809 static struct z_candidate
*
1810 add_function_candidate (struct z_candidate
**candidates
,
1811 tree fn
, tree ctype
, tree first_arg
,
1812 const VEC(tree
,gc
) *args
, tree access_path
,
1813 tree conversion_path
, int flags
)
1815 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1819 tree orig_first_arg
= first_arg
;
1822 struct rejection_reason
*reason
= NULL
;
1824 /* At this point we should not see any functions which haven't been
1825 explicitly declared, except for friend functions which will have
1826 been found using argument dependent lookup. */
1827 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
1829 /* The `this', `in_chrg' and VTT arguments to constructors are not
1830 considered in overload resolution. */
1831 if (DECL_CONSTRUCTOR_P (fn
))
1833 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
1834 skip
= num_artificial_parms_for (fn
);
1835 if (skip
> 0 && first_arg
!= NULL_TREE
)
1838 first_arg
= NULL_TREE
;
1844 len
= VEC_length (tree
, args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
1845 convs
= alloc_conversions (len
);
1847 /* 13.3.2 - Viable functions [over.match.viable]
1848 First, to be a viable function, a candidate function shall have enough
1849 parameters to agree in number with the arguments in the list.
1851 We need to check this first; otherwise, checking the ICSes might cause
1852 us to produce an ill-formed template instantiation. */
1854 parmnode
= parmlist
;
1855 for (i
= 0; i
< len
; ++i
)
1857 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
1859 parmnode
= TREE_CHAIN (parmnode
);
1862 if ((i
< len
&& parmnode
)
1863 || !sufficient_parms_p (parmnode
))
1865 int remaining
= remaining_arguments (parmnode
);
1867 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
1869 /* When looking for a function from a subobject from an implicit
1870 copy/move constructor/operator=, don't consider anything that takes (a
1871 reference to) an unrelated type. See c++/44909 and core 1092. */
1872 else if (parmlist
&& (flags
& LOOKUP_DEFAULTED
))
1874 if (DECL_CONSTRUCTOR_P (fn
))
1876 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
1877 && DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
)
1883 parmnode
= chain_index (i
-1, parmlist
);
1884 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
1889 /* This only applies at the top level. */
1890 flags
&= ~LOOKUP_DEFAULTED
;
1896 /* Second, for F to be a viable function, there shall exist for each
1897 argument an implicit conversion sequence that converts that argument
1898 to the corresponding parameter of F. */
1900 parmnode
= parmlist
;
1902 for (i
= 0; i
< len
; ++i
)
1904 tree arg
, argtype
, to_type
;
1908 if (parmnode
== void_list_node
)
1911 if (i
== 0 && first_arg
!= NULL_TREE
)
1914 arg
= VEC_index (tree
, args
,
1915 i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0));
1916 argtype
= lvalue_type (arg
);
1918 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1919 && ! DECL_CONSTRUCTOR_P (fn
));
1923 tree parmtype
= TREE_VALUE (parmnode
);
1926 parmnode
= TREE_CHAIN (parmnode
);
1928 /* The type of the implicit object parameter ('this') for
1929 overload resolution is not always the same as for the
1930 function itself; conversion functions are considered to
1931 be members of the class being converted, and functions
1932 introduced by a using-declaration are considered to be
1933 members of the class that uses them.
1935 Since build_over_call ignores the ICS for the `this'
1936 parameter, we can just change the parm type. */
1937 if (ctype
&& is_this
)
1939 parmtype
= cp_build_qualified_type
1940 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
1941 parmtype
= build_pointer_type (parmtype
);
1944 /* Core issue 899: When [copy-]initializing a temporary to be bound
1945 to the first parameter of a copy constructor (12.8) called with
1946 a single argument in the context of direct-initialization,
1947 explicit conversion functions are also considered.
1949 So set LOOKUP_COPY_PARM to let reference_binding know that
1950 it's being called in that context. We generalize the above
1951 to handle move constructors and template constructors as well;
1952 the standardese should soon be updated similarly. */
1953 if (ctype
&& i
== 0 && (len
-skip
== 1)
1954 && !(flags
& LOOKUP_ONLYCONVERTING
)
1955 && DECL_CONSTRUCTOR_P (fn
)
1956 && parmtype
!= error_mark_node
1957 && (same_type_ignoring_top_level_qualifiers_p
1958 (non_reference (parmtype
), ctype
)))
1960 lflags
|= LOOKUP_COPY_PARM
;
1961 /* We allow user-defined conversions within init-lists, but
1962 not for the copy constructor. */
1963 if (flags
& LOOKUP_NO_COPY_CTOR_CONVERSION
)
1964 lflags
|= LOOKUP_NO_CONVERSION
;
1967 lflags
|= LOOKUP_ONLYCONVERTING
;
1969 t
= implicit_conversion (parmtype
, argtype
, arg
,
1970 /*c_cast_p=*/false, lflags
);
1975 t
= build_identity_conv (argtype
, arg
);
1976 t
->ellipsis_p
= true;
1987 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
);
1994 reason
= bad_arg_conversion_rejection (first_arg
, i
, argtype
, to_type
);
1999 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2000 access_path
, conversion_path
, viable
, reason
);
2003 /* Create an overload candidate for the conversion function FN which will
2004 be invoked for expression OBJ, producing a pointer-to-function which
2005 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2006 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2007 passed on to implicit_conversion.
2009 Actually, we don't really care about FN; we care about the type it
2010 converts to. There may be multiple conversion functions that will
2011 convert to that type, and we rely on build_user_type_conversion_1 to
2012 choose the best one; so when we create our candidate, we record the type
2013 instead of the function. */
2015 static struct z_candidate
*
2016 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2017 tree first_arg
, const VEC(tree
,gc
) *arglist
,
2018 tree access_path
, tree conversion_path
)
2020 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2021 int i
, len
, viable
, flags
;
2022 tree parmlist
, parmnode
;
2024 struct rejection_reason
*reason
;
2026 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2027 parmlist
= TREE_TYPE (parmlist
);
2028 parmlist
= TYPE_ARG_TYPES (parmlist
);
2030 len
= VEC_length (tree
, arglist
) + (first_arg
!= NULL_TREE
? 1 : 0) + 1;
2031 convs
= alloc_conversions (len
);
2032 parmnode
= parmlist
;
2034 flags
= LOOKUP_IMPLICIT
;
2037 /* Don't bother looking up the same type twice. */
2038 if (*candidates
&& (*candidates
)->fn
== totype
)
2041 for (i
= 0; i
< len
; ++i
)
2043 tree arg
, argtype
, convert_type
= NULL_TREE
;
2048 else if (i
== 1 && first_arg
!= NULL_TREE
)
2051 arg
= VEC_index (tree
, arglist
,
2052 i
- (first_arg
!= NULL_TREE
? 1 : 0) - 1);
2053 argtype
= lvalue_type (arg
);
2057 t
= implicit_conversion (totype
, argtype
, arg
, /*c_cast_p=*/false,
2059 convert_type
= totype
;
2061 else if (parmnode
== void_list_node
)
2065 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2066 /*c_cast_p=*/false, flags
);
2067 convert_type
= TREE_VALUE (parmnode
);
2071 t
= build_identity_conv (argtype
, arg
);
2072 t
->ellipsis_p
= true;
2073 convert_type
= argtype
;
2083 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, argtype
, convert_type
);
2090 parmnode
= TREE_CHAIN (parmnode
);
2094 || ! sufficient_parms_p (parmnode
))
2096 int remaining
= remaining_arguments (parmnode
);
2098 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2101 return add_candidate (candidates
, totype
, first_arg
, arglist
, len
, convs
,
2102 access_path
, conversion_path
, viable
, reason
);
2106 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2107 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2115 struct rejection_reason
*reason
= NULL
;
2120 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2121 convs
= alloc_conversions (num_convs
);
2123 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2124 conversion ops are allowed. We handle that here by just checking for
2125 boolean_type_node because other operators don't ask for it. COND_EXPR
2126 also does contextual conversion to bool for the first operand, but we
2127 handle that in build_conditional_expr, and type1 here is operand 2. */
2128 if (type1
!= boolean_type_node
)
2129 flags
|= LOOKUP_ONLYCONVERTING
;
2131 for (i
= 0; i
< 2; ++i
)
2136 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2137 /*c_cast_p=*/false, flags
);
2141 /* We need something for printing the candidate. */
2142 t
= build_identity_conv (types
[i
], NULL_TREE
);
2143 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
], types
[i
]);
2148 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
], types
[i
]);
2153 /* For COND_EXPR we rearranged the arguments; undo that now. */
2156 convs
[2] = convs
[1];
2157 convs
[1] = convs
[0];
2158 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2159 /*c_cast_p=*/false, flags
);
2165 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2170 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2172 /*access_path=*/NULL_TREE
,
2173 /*conversion_path=*/NULL_TREE
,
2178 is_complete (tree t
)
2180 return COMPLETE_TYPE_P (complete_type (t
));
2183 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2186 promoted_arithmetic_type_p (tree type
)
2190 In this section, the term promoted integral type is used to refer
2191 to those integral types which are preserved by integral promotion
2192 (including e.g. int and long but excluding e.g. char).
2193 Similarly, the term promoted arithmetic type refers to promoted
2194 integral types plus floating types. */
2195 return ((CP_INTEGRAL_TYPE_P (type
)
2196 && same_type_p (type_promotes_to (type
), type
))
2197 || TREE_CODE (type
) == REAL_TYPE
);
2200 /* Create any builtin operator overload candidates for the operator in
2201 question given the converted operand types TYPE1 and TYPE2. The other
2202 args are passed through from add_builtin_candidates to
2203 build_builtin_candidate.
2205 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2206 If CODE is requires candidates operands of the same type of the kind
2207 of which TYPE1 and TYPE2 are, we add both candidates
2208 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2211 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2212 enum tree_code code2
, tree fnname
, tree type1
,
2213 tree type2
, tree
*args
, tree
*argtypes
, int flags
)
2217 case POSTINCREMENT_EXPR
:
2218 case POSTDECREMENT_EXPR
:
2219 args
[1] = integer_zero_node
;
2220 type2
= integer_type_node
;
2229 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2230 and VQ is either volatile or empty, there exist candidate operator
2231 functions of the form
2232 VQ T& operator++(VQ T&);
2233 T operator++(VQ T&, int);
2234 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2235 type other than bool, and VQ is either volatile or empty, there exist
2236 candidate operator functions of the form
2237 VQ T& operator--(VQ T&);
2238 T operator--(VQ T&, int);
2239 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2240 complete object type, and VQ is either volatile or empty, there exist
2241 candidate operator functions of the form
2242 T*VQ& operator++(T*VQ&);
2243 T*VQ& operator--(T*VQ&);
2244 T* operator++(T*VQ&, int);
2245 T* operator--(T*VQ&, int); */
2247 case POSTDECREMENT_EXPR
:
2248 case PREDECREMENT_EXPR
:
2249 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2251 case POSTINCREMENT_EXPR
:
2252 case PREINCREMENT_EXPR
:
2253 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2255 type1
= build_reference_type (type1
);
2260 /* 7 For every cv-qualified or cv-unqualified object type T, there
2261 exist candidate operator functions of the form
2265 8 For every function type T, there exist candidate operator functions of
2267 T& operator*(T*); */
2270 if (TREE_CODE (type1
) == POINTER_TYPE
2271 && !uses_template_parms (TREE_TYPE (type1
))
2272 && (TYPE_PTROB_P (type1
)
2273 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2277 /* 9 For every type T, there exist candidate operator functions of the form
2280 10For every promoted arithmetic type T, there exist candidate operator
2281 functions of the form
2285 case UNARY_PLUS_EXPR
: /* unary + */
2286 if (TREE_CODE (type1
) == POINTER_TYPE
)
2289 if (ARITHMETIC_TYPE_P (type1
))
2293 /* 11For every promoted integral type T, there exist candidate operator
2294 functions of the form
2298 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2302 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2303 is the same type as C2 or is a derived class of C2, T is a complete
2304 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2305 there exist candidate operator functions of the form
2306 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2307 where CV12 is the union of CV1 and CV2. */
2310 if (TREE_CODE (type1
) == POINTER_TYPE
2311 && TYPE_PTR_TO_MEMBER_P (type2
))
2313 tree c1
= TREE_TYPE (type1
);
2314 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2316 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2317 && (TYPE_PTRMEMFUNC_P (type2
)
2318 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2323 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2324 didate operator functions of the form
2329 bool operator<(L, R);
2330 bool operator>(L, R);
2331 bool operator<=(L, R);
2332 bool operator>=(L, R);
2333 bool operator==(L, R);
2334 bool operator!=(L, R);
2335 where LR is the result of the usual arithmetic conversions between
2338 14For every pair of types T and I, where T is a cv-qualified or cv-
2339 unqualified complete object type and I is a promoted integral type,
2340 there exist candidate operator functions of the form
2341 T* operator+(T*, I);
2342 T& operator[](T*, I);
2343 T* operator-(T*, I);
2344 T* operator+(I, T*);
2345 T& operator[](I, T*);
2347 15For every T, where T is a pointer to complete object type, there exist
2348 candidate operator functions of the form112)
2349 ptrdiff_t operator-(T, T);
2351 16For every pointer or enumeration type T, there exist candidate operator
2352 functions of the form
2353 bool operator<(T, T);
2354 bool operator>(T, T);
2355 bool operator<=(T, T);
2356 bool operator>=(T, T);
2357 bool operator==(T, T);
2358 bool operator!=(T, T);
2360 17For every pointer to member type T, there exist candidate operator
2361 functions of the form
2362 bool operator==(T, T);
2363 bool operator!=(T, T); */
2366 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2368 if (TYPE_PTROB_P (type1
)
2369 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2371 type2
= ptrdiff_type_node
;
2375 case TRUNC_DIV_EXPR
:
2376 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2382 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2383 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
)))
2385 if (TYPE_PTR_TO_MEMBER_P (type1
) && null_ptr_cst_p (args
[1]))
2390 if (TYPE_PTR_TO_MEMBER_P (type2
) && null_ptr_cst_p (args
[0]))
2402 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2404 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2406 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2407 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2409 if (TYPE_PTR_P (type1
)
2410 && null_ptr_cst_p (args
[1])
2411 && !uses_template_parms (type1
))
2416 if (null_ptr_cst_p (args
[0])
2417 && TYPE_PTR_P (type2
)
2418 && !uses_template_parms (type2
))
2426 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2429 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2431 type1
= ptrdiff_type_node
;
2434 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2436 type2
= ptrdiff_type_node
;
2441 /* 18For every pair of promoted integral types L and R, there exist candi-
2442 date operator functions of the form
2449 where LR is the result of the usual arithmetic conversions between
2452 case TRUNC_MOD_EXPR
:
2458 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2462 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2463 type, VQ is either volatile or empty, and R is a promoted arithmetic
2464 type, there exist candidate operator functions of the form
2465 VQ L& operator=(VQ L&, R);
2466 VQ L& operator*=(VQ L&, R);
2467 VQ L& operator/=(VQ L&, R);
2468 VQ L& operator+=(VQ L&, R);
2469 VQ L& operator-=(VQ L&, R);
2471 20For every pair T, VQ), where T is any type and VQ is either volatile
2472 or empty, there exist candidate operator functions of the form
2473 T*VQ& operator=(T*VQ&, T*);
2475 21For every pair T, VQ), where T is a pointer to member type and VQ is
2476 either volatile or empty, there exist candidate operator functions of
2478 VQ T& operator=(VQ T&, T);
2480 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2481 unqualified complete object type, VQ is either volatile or empty, and
2482 I is a promoted integral type, there exist candidate operator func-
2484 T*VQ& operator+=(T*VQ&, I);
2485 T*VQ& operator-=(T*VQ&, I);
2487 23For every triple L, VQ, R), where L is an integral or enumeration
2488 type, VQ is either volatile or empty, and R is a promoted integral
2489 type, there exist candidate operator functions of the form
2491 VQ L& operator%=(VQ L&, R);
2492 VQ L& operator<<=(VQ L&, R);
2493 VQ L& operator>>=(VQ L&, R);
2494 VQ L& operator&=(VQ L&, R);
2495 VQ L& operator^=(VQ L&, R);
2496 VQ L& operator|=(VQ L&, R); */
2503 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2505 type2
= ptrdiff_type_node
;
2509 case TRUNC_DIV_EXPR
:
2510 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2514 case TRUNC_MOD_EXPR
:
2520 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2525 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2527 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2528 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2529 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
))
2530 || ((TYPE_PTRMEMFUNC_P (type1
)
2531 || TREE_CODE (type1
) == POINTER_TYPE
)
2532 && null_ptr_cst_p (args
[1])))
2542 type1
= build_reference_type (type1
);
2548 For every pair of promoted arithmetic types L and R, there
2549 exist candidate operator functions of the form
2551 LR operator?(bool, L, R);
2553 where LR is the result of the usual arithmetic conversions
2554 between types L and R.
2556 For every type T, where T is a pointer or pointer-to-member
2557 type, there exist candidate operator functions of the form T
2558 operator?(bool, T, T); */
2560 if (promoted_arithmetic_type_p (type1
)
2561 && promoted_arithmetic_type_p (type2
))
2565 /* Otherwise, the types should be pointers. */
2566 if (!(TYPE_PTR_P (type1
) || TYPE_PTR_TO_MEMBER_P (type1
))
2567 || !(TYPE_PTR_P (type2
) || TYPE_PTR_TO_MEMBER_P (type2
)))
2570 /* We don't check that the two types are the same; the logic
2571 below will actually create two candidates; one in which both
2572 parameter types are TYPE1, and one in which both parameter
2580 /* If we're dealing with two pointer types or two enumeral types,
2581 we need candidates for both of them. */
2582 if (type2
&& !same_type_p (type1
, type2
)
2583 && TREE_CODE (type1
) == TREE_CODE (type2
)
2584 && (TREE_CODE (type1
) == REFERENCE_TYPE
2585 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2586 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
))
2587 || TYPE_PTRMEMFUNC_P (type1
)
2588 || MAYBE_CLASS_TYPE_P (type1
)
2589 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2591 build_builtin_candidate
2592 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
);
2593 build_builtin_candidate
2594 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
);
2598 build_builtin_candidate
2599 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
);
2603 type_decays_to (tree type
)
2605 if (TREE_CODE (type
) == ARRAY_TYPE
)
2606 return build_pointer_type (TREE_TYPE (type
));
2607 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2608 return build_pointer_type (type
);
2609 if (!MAYBE_CLASS_TYPE_P (type
))
2610 type
= cv_unqualified (type
);
2614 /* There are three conditions of builtin candidates:
2616 1) bool-taking candidates. These are the same regardless of the input.
2617 2) pointer-pair taking candidates. These are generated for each type
2618 one of the input types converts to.
2619 3) arithmetic candidates. According to the standard, we should generate
2620 all of these, but I'm trying not to...
2622 Here we generate a superset of the possible candidates for this particular
2623 case. That is a subset of the full set the standard defines, plus some
2624 other cases which the standard disallows. add_builtin_candidate will
2625 filter out the invalid set. */
2628 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2629 enum tree_code code2
, tree fnname
, tree
*args
,
2634 tree type
, argtypes
[3], t
;
2635 /* TYPES[i] is the set of possible builtin-operator parameter types
2636 we will consider for the Ith argument. */
2637 VEC(tree
,gc
) *types
[2];
2640 for (i
= 0; i
< 3; ++i
)
2643 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2645 argtypes
[i
] = NULL_TREE
;
2650 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2651 and VQ is either volatile or empty, there exist candidate operator
2652 functions of the form
2653 VQ T& operator++(VQ T&); */
2655 case POSTINCREMENT_EXPR
:
2656 case PREINCREMENT_EXPR
:
2657 case POSTDECREMENT_EXPR
:
2658 case PREDECREMENT_EXPR
:
2663 /* 24There also exist candidate operator functions of the form
2664 bool operator!(bool);
2665 bool operator&&(bool, bool);
2666 bool operator||(bool, bool); */
2668 case TRUTH_NOT_EXPR
:
2669 build_builtin_candidate
2670 (candidates
, fnname
, boolean_type_node
,
2671 NULL_TREE
, args
, argtypes
, flags
);
2674 case TRUTH_ORIF_EXPR
:
2675 case TRUTH_ANDIF_EXPR
:
2676 build_builtin_candidate
2677 (candidates
, fnname
, boolean_type_node
,
2678 boolean_type_node
, args
, argtypes
, flags
);
2700 types
[0] = make_tree_vector ();
2701 types
[1] = make_tree_vector ();
2703 for (i
= 0; i
< 2; ++i
)
2707 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
2711 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
2714 convs
= lookup_conversions (argtypes
[i
]);
2716 if (code
== COND_EXPR
)
2718 if (real_lvalue_p (args
[i
]))
2719 VEC_safe_push (tree
, gc
, types
[i
],
2720 build_reference_type (argtypes
[i
]));
2722 VEC_safe_push (tree
, gc
, types
[i
],
2723 TYPE_MAIN_VARIANT (argtypes
[i
]));
2729 for (; convs
; convs
= TREE_CHAIN (convs
))
2731 type
= TREE_TYPE (convs
);
2734 && (TREE_CODE (type
) != REFERENCE_TYPE
2735 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
2738 if (code
== COND_EXPR
&& TREE_CODE (type
) == REFERENCE_TYPE
)
2739 VEC_safe_push (tree
, gc
, types
[i
], type
);
2741 type
= non_reference (type
);
2742 if (i
!= 0 || ! ref1
)
2744 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
2745 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
2746 VEC_safe_push (tree
, gc
, types
[i
], type
);
2747 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2748 type
= type_promotes_to (type
);
2751 if (! vec_member (type
, types
[i
]))
2752 VEC_safe_push (tree
, gc
, types
[i
], type
);
2757 if (code
== COND_EXPR
&& real_lvalue_p (args
[i
]))
2758 VEC_safe_push (tree
, gc
, types
[i
],
2759 build_reference_type (argtypes
[i
]));
2760 type
= non_reference (argtypes
[i
]);
2761 if (i
!= 0 || ! ref1
)
2763 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
2764 if (enum_p
&& UNSCOPED_ENUM_P (type
))
2765 VEC_safe_push (tree
, gc
, types
[i
], type
);
2766 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2767 type
= type_promotes_to (type
);
2769 VEC_safe_push (tree
, gc
, types
[i
], type
);
2773 /* Run through the possible parameter types of both arguments,
2774 creating candidates with those parameter types. */
2775 FOR_EACH_VEC_ELT_REVERSE (tree
, types
[0], ix
, t
)
2780 if (!VEC_empty (tree
, types
[1]))
2781 FOR_EACH_VEC_ELT_REVERSE (tree
, types
[1], jx
, u
)
2782 add_builtin_candidate
2783 (candidates
, code
, code2
, fnname
, t
,
2784 u
, args
, argtypes
, flags
);
2786 add_builtin_candidate
2787 (candidates
, code
, code2
, fnname
, t
,
2788 NULL_TREE
, args
, argtypes
, flags
);
2791 release_tree_vector (types
[0]);
2792 release_tree_vector (types
[1]);
2796 /* If TMPL can be successfully instantiated as indicated by
2797 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2799 TMPL is the template. EXPLICIT_TARGS are any explicit template
2800 arguments. ARGLIST is the arguments provided at the call-site.
2801 This does not change ARGLIST. The RETURN_TYPE is the desired type
2802 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
2803 as for add_function_candidate. If an OBJ is supplied, FLAGS and
2804 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
2806 static struct z_candidate
*
2807 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
2808 tree ctype
, tree explicit_targs
, tree first_arg
,
2809 const VEC(tree
,gc
) *arglist
, tree return_type
,
2810 tree access_path
, tree conversion_path
,
2811 int flags
, tree obj
, unification_kind_t strict
)
2813 int ntparms
= DECL_NTPARMS (tmpl
);
2814 tree targs
= make_tree_vec (ntparms
);
2815 unsigned int len
= VEC_length (tree
, arglist
);
2816 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
2817 unsigned int skip_without_in_chrg
= 0;
2818 tree first_arg_without_in_chrg
= first_arg
;
2819 tree
*args_without_in_chrg
;
2820 unsigned int nargs_without_in_chrg
;
2821 unsigned int ia
, ix
;
2823 struct z_candidate
*cand
;
2826 struct rejection_reason
*reason
= NULL
;
2828 /* We don't do deduction on the in-charge parameter, the VTT
2829 parameter or 'this'. */
2830 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
2832 if (first_arg_without_in_chrg
!= NULL_TREE
)
2833 first_arg_without_in_chrg
= NULL_TREE
;
2835 ++skip_without_in_chrg
;
2838 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
2839 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
2840 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
2842 if (first_arg_without_in_chrg
!= NULL_TREE
)
2843 first_arg_without_in_chrg
= NULL_TREE
;
2845 ++skip_without_in_chrg
;
2848 if (len
< skip_without_in_chrg
)
2851 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
2852 + (len
- skip_without_in_chrg
));
2853 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
2855 if (first_arg_without_in_chrg
!= NULL_TREE
)
2857 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
2860 for (ix
= skip_without_in_chrg
;
2861 VEC_iterate (tree
, arglist
, ix
, arg
);
2864 args_without_in_chrg
[ia
] = arg
;
2867 gcc_assert (ia
== nargs_without_in_chrg
);
2869 i
= fn_type_unification (tmpl
, explicit_targs
, targs
,
2870 args_without_in_chrg
,
2871 nargs_without_in_chrg
,
2872 return_type
, strict
, flags
);
2877 fn
= instantiate_template (tmpl
, targs
, tf_none
);
2878 if (fn
== error_mark_node
)
2883 A member function template is never instantiated to perform the
2884 copy of a class object to an object of its class type.
2886 It's a little unclear what this means; the standard explicitly
2887 does allow a template to be used to copy a class. For example,
2892 template <class T> A(const T&);
2895 void g () { A a (f ()); }
2897 the member template will be used to make the copy. The section
2898 quoted above appears in the paragraph that forbids constructors
2899 whose only parameter is (a possibly cv-qualified variant of) the
2900 class type, and a logical interpretation is that the intent was
2901 to forbid the instantiation of member templates which would then
2903 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
2905 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
2906 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
2911 if (obj
!= NULL_TREE
)
2912 /* Aha, this is a conversion function. */
2913 cand
= add_conv_candidate (candidates
, fn
, obj
, first_arg
, arglist
,
2914 access_path
, conversion_path
);
2916 cand
= add_function_candidate (candidates
, fn
, ctype
,
2917 first_arg
, arglist
, access_path
,
2918 conversion_path
, flags
);
2919 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
2920 /* This situation can occur if a member template of a template
2921 class is specialized. Then, instantiate_template might return
2922 an instantiation of the specialization, in which case the
2923 DECL_TI_TEMPLATE field will point at the original
2924 specialization. For example:
2926 template <class T> struct S { template <class U> void f(U);
2927 template <> void f(int) {}; };
2931 Here, TMPL will be template <class U> S<double>::f(U).
2932 And, instantiate template will give us the specialization
2933 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
2934 for this will point at template <class T> template <> S<T>::f(int),
2935 so that we can find the definition. For the purposes of
2936 overload resolution, however, we want the original TMPL. */
2937 cand
->template_decl
= build_template_info (tmpl
, targs
);
2939 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
2940 cand
->explicit_targs
= explicit_targs
;
2944 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
2945 access_path
, conversion_path
, 0, reason
);
2949 static struct z_candidate
*
2950 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
2951 tree explicit_targs
, tree first_arg
,
2952 const VEC(tree
,gc
) *arglist
, tree return_type
,
2953 tree access_path
, tree conversion_path
, int flags
,
2954 unification_kind_t strict
)
2957 add_template_candidate_real (candidates
, tmpl
, ctype
,
2958 explicit_targs
, first_arg
, arglist
,
2959 return_type
, access_path
, conversion_path
,
2960 flags
, NULL_TREE
, strict
);
2964 static struct z_candidate
*
2965 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
2966 tree obj
, tree first_arg
,
2967 const VEC(tree
,gc
) *arglist
,
2968 tree return_type
, tree access_path
,
2969 tree conversion_path
)
2972 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
2973 first_arg
, arglist
, return_type
, access_path
,
2974 conversion_path
, 0, obj
, DEDUCE_CONV
);
2977 /* The CANDS are the set of candidates that were considered for
2978 overload resolution. Return the set of viable candidates, or CANDS
2979 if none are viable. If any of the candidates were viable, set
2980 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
2981 considered viable only if it is strictly viable. */
2983 static struct z_candidate
*
2984 splice_viable (struct z_candidate
*cands
,
2988 struct z_candidate
*viable
;
2989 struct z_candidate
**last_viable
;
2990 struct z_candidate
**cand
;
2993 last_viable
= &viable
;
2994 *any_viable_p
= false;
2999 struct z_candidate
*c
= *cand
;
3000 if (strict_p
? c
->viable
== 1 : c
->viable
)
3005 last_viable
= &c
->next
;
3006 *any_viable_p
= true;
3012 return viable
? viable
: cands
;
3016 any_strictly_viable (struct z_candidate
*cands
)
3018 for (; cands
; cands
= cands
->next
)
3019 if (cands
->viable
== 1)
3024 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3025 words, it is about to become the "this" pointer for a member
3026 function call. Take the address of the object. */
3029 build_this (tree obj
)
3031 /* In a template, we are only concerned about the type of the
3032 expression, so we can take a shortcut. */
3033 if (processing_template_decl
)
3034 return build_address (obj
);
3036 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3039 /* Returns true iff functions are equivalent. Equivalent functions are
3040 not '==' only if one is a function-local extern function or if
3041 both are extern "C". */
3044 equal_functions (tree fn1
, tree fn2
)
3046 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3048 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3050 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3051 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3052 return decls_match (fn1
, fn2
);
3056 /* Print information about a candidate being rejected due to INFO. */
3059 print_conversion_rejection (location_t loc
, struct conversion_info
*info
)
3061 if (info
->n_arg
== -1)
3062 /* Conversion of implicit `this' argument failed. */
3063 inform (loc
, " no known conversion for implicit "
3064 "%<this%> parameter from %qT to %qT",
3065 info
->from_type
, info
->to_type
);
3067 inform (loc
, " no known conversion for argument %d from %qT to %qT",
3068 info
->n_arg
+1, info
->from_type
, info
->to_type
);
3071 /* Print information about one overload candidate CANDIDATE. MSGSTR
3072 is the text to print before the candidate itself.
3074 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3075 to have been run through gettext by the caller. This wart makes
3076 life simpler in print_z_candidates and for the translators. */
3079 print_z_candidate (const char *msgstr
, struct z_candidate
*candidate
)
3081 const char *msg
= (msgstr
== NULL
3083 : ACONCAT ((msgstr
, " ", NULL
)));
3084 location_t loc
= location_of (candidate
->fn
);
3086 if (TREE_CODE (candidate
->fn
) == IDENTIFIER_NODE
)
3088 if (candidate
->num_convs
== 3)
3089 inform (input_location
, "%s%D(%T, %T, %T) <built-in>", msg
, candidate
->fn
,
3090 candidate
->convs
[0]->type
,
3091 candidate
->convs
[1]->type
,
3092 candidate
->convs
[2]->type
);
3093 else if (candidate
->num_convs
== 2)
3094 inform (input_location
, "%s%D(%T, %T) <built-in>", msg
, candidate
->fn
,
3095 candidate
->convs
[0]->type
,
3096 candidate
->convs
[1]->type
);
3098 inform (input_location
, "%s%D(%T) <built-in>", msg
, candidate
->fn
,
3099 candidate
->convs
[0]->type
);
3101 else if (TYPE_P (candidate
->fn
))
3102 inform (input_location
, "%s%T <conversion>", msg
, candidate
->fn
);
3103 else if (candidate
->viable
== -1)
3104 inform (loc
, "%s%#D <near match>", msg
, candidate
->fn
);
3105 else if (DECL_DELETED_FN (STRIP_TEMPLATE (candidate
->fn
)))
3106 inform (loc
, "%s%#D <deleted>", msg
, candidate
->fn
);
3108 inform (loc
, "%s%#D", msg
, candidate
->fn
);
3109 /* Give the user some information about why this candidate failed. */
3110 if (candidate
->reason
!= NULL
)
3112 struct rejection_reason
*r
= candidate
->reason
;
3117 inform_n (loc
, r
->u
.arity
.expected
,
3118 " candidate expects %d argument, %d provided",
3119 " candidate expects %d arguments, %d provided",
3120 r
->u
.arity
.expected
, r
->u
.arity
.actual
);
3122 case rr_arg_conversion
:
3123 print_conversion_rejection (loc
, &r
->u
.conversion
);
3125 case rr_bad_arg_conversion
:
3126 print_conversion_rejection (loc
, &r
->u
.bad_conversion
);
3130 /* This candidate didn't have any issues or we failed to
3131 handle a particular code. Either way... */
3138 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3140 struct z_candidate
*cand1
;
3141 struct z_candidate
**cand2
;
3147 /* Remove non-viable deleted candidates. */
3149 for (cand2
= &cand1
; *cand2
; )
3151 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3152 && !(*cand2
)->viable
3153 && DECL_DELETED_FN ((*cand2
)->fn
))
3154 *cand2
= (*cand2
)->next
;
3156 cand2
= &(*cand2
)->next
;
3158 /* ...if there are any non-deleted ones. */
3162 /* There may be duplicates in the set of candidates. We put off
3163 checking this condition as long as possible, since we have no way
3164 to eliminate duplicates from a set of functions in less than n^2
3165 time. Now we are about to emit an error message, so it is more
3166 permissible to go slowly. */
3167 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3169 tree fn
= cand1
->fn
;
3170 /* Skip builtin candidates and conversion functions. */
3173 cand2
= &cand1
->next
;
3176 if (DECL_P ((*cand2
)->fn
)
3177 && equal_functions (fn
, (*cand2
)->fn
))
3178 *cand2
= (*cand2
)->next
;
3180 cand2
= &(*cand2
)->next
;
3184 for (n_candidates
= 0, cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3187 inform_n (loc
, n_candidates
, "candidate is:", "candidates are:");
3188 for (; candidates
; candidates
= candidates
->next
)
3189 print_z_candidate (NULL
, candidates
);
3192 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3193 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3194 the result of the conversion function to convert it to the final
3195 desired type. Merge the two sequences into a single sequence,
3196 and return the merged sequence. */
3199 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3203 gcc_assert (user_seq
->kind
== ck_user
);
3205 /* Find the end of the second conversion sequence. */
3207 while ((*t
)->kind
!= ck_identity
)
3208 t
= &((*t
)->u
.next
);
3210 /* Replace the identity conversion with the user conversion
3214 /* The entire sequence is a user-conversion sequence. */
3215 std_seq
->user_conv_p
= true;
3220 /* Handle overload resolution for initializing an object of class type from
3221 an initializer list. First we look for a suitable constructor that
3222 takes a std::initializer_list; if we don't find one, we then look for a
3223 non-list constructor.
3225 Parameters are as for add_candidates, except that the arguments are in
3226 the form of a CONSTRUCTOR (the initializer list) rather than a VEC, and
3227 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3230 add_list_candidates (tree fns
, tree first_arg
,
3231 tree init_list
, tree totype
,
3232 tree explicit_targs
, bool template_only
,
3233 tree conversion_path
, tree access_path
,
3235 struct z_candidate
**candidates
)
3239 gcc_assert (*candidates
== NULL
);
3241 /* For list-initialization we consider explicit constructors, but
3242 give an error if one is selected. */
3243 flags
&= ~LOOKUP_ONLYCONVERTING
;
3244 /* And we don't allow narrowing conversions. We also use this flag to
3245 avoid the copy constructor call for copy-list-initialization. */
3246 flags
|= LOOKUP_NO_NARROWING
;
3248 /* Always use the default constructor if the list is empty (DR 990). */
3249 if (CONSTRUCTOR_NELTS (init_list
) == 0
3250 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3252 /* If the class has a list ctor, try passing the list as a single
3253 argument first, but only consider list ctors. */
3254 else if (TYPE_HAS_LIST_CTOR (totype
))
3256 flags
|= LOOKUP_LIST_ONLY
;
3257 args
= make_tree_vector_single (init_list
);
3258 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3259 explicit_targs
, template_only
, conversion_path
,
3260 access_path
, flags
, candidates
);
3261 if (any_strictly_viable (*candidates
))
3265 args
= ctor_to_vec (init_list
);
3267 /* We aren't looking for list-ctors anymore. */
3268 flags
&= ~LOOKUP_LIST_ONLY
;
3269 /* We allow more user-defined conversions within an init-list. */
3270 flags
&= ~LOOKUP_NO_CONVERSION
;
3271 /* But not for the copy ctor. */
3272 flags
|= LOOKUP_NO_COPY_CTOR_CONVERSION
;
3274 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3275 explicit_targs
, template_only
, conversion_path
,
3276 access_path
, flags
, candidates
);
3279 /* Returns the best overload candidate to perform the requested
3280 conversion. This function is used for three the overloading situations
3281 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3282 If TOTYPE is a REFERENCE_TYPE, we're trying to find an lvalue binding as
3283 per [dcl.init.ref], so we ignore temporary bindings. */
3285 static struct z_candidate
*
3286 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
)
3288 struct z_candidate
*candidates
, *cand
;
3289 tree fromtype
= TREE_TYPE (expr
);
3290 tree ctors
= NULL_TREE
;
3291 tree conv_fns
= NULL_TREE
;
3292 conversion
*conv
= NULL
;
3293 tree first_arg
= NULL_TREE
;
3294 VEC(tree
,gc
) *args
= NULL
;
3298 /* We represent conversion within a hierarchy using RVALUE_CONV and
3299 BASE_CONV, as specified by [over.best.ics]; these become plain
3300 constructor calls, as specified in [dcl.init]. */
3301 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3302 || !DERIVED_FROM_P (totype
, fromtype
));
3304 if (MAYBE_CLASS_TYPE_P (totype
))
3305 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3306 creating a garbage BASELINK; constructors can't be inherited. */
3307 ctors
= lookup_fnfields_slot (totype
, complete_ctor_identifier
);
3309 if (MAYBE_CLASS_TYPE_P (fromtype
))
3311 tree to_nonref
= non_reference (totype
);
3312 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3313 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3314 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3316 /* [class.conv.fct] A conversion function is never used to
3317 convert a (possibly cv-qualified) object to the (possibly
3318 cv-qualified) same object type (or a reference to it), to a
3319 (possibly cv-qualified) base class of that type (or a
3320 reference to it)... */
3323 conv_fns
= lookup_conversions (fromtype
);
3327 flags
|= LOOKUP_NO_CONVERSION
;
3328 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3329 flags
|= LOOKUP_NO_NARROWING
;
3331 /* It's OK to bind a temporary for converting constructor arguments, but
3332 not in converting the return value of a conversion operator. */
3333 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
);
3334 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3338 int ctorflags
= flags
;
3340 first_arg
= build_int_cst (build_pointer_type (totype
), 0);
3342 /* We should never try to call the abstract or base constructor
3344 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors
))
3345 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors
)));
3347 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3349 /* List-initialization. */
3350 add_list_candidates (ctors
, first_arg
, expr
, totype
, NULL_TREE
,
3351 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3352 ctorflags
, &candidates
);
3356 args
= make_tree_vector_single (expr
);
3357 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3358 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3359 ctorflags
, &candidates
);
3362 for (cand
= candidates
; cand
; cand
= cand
->next
)
3364 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3366 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3367 set, then this is copy-initialization. In that case, "The
3368 result of the call is then used to direct-initialize the
3369 object that is the destination of the copy-initialization."
3372 We represent this in the conversion sequence with an
3373 rvalue conversion, which means a constructor call. */
3374 if (TREE_CODE (totype
) != REFERENCE_TYPE
3375 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3377 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3382 first_arg
= build_this (expr
);
3384 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3386 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3387 struct z_candidate
*old_candidates
;
3389 /* If we are called to convert to a reference type, we are trying to
3390 find an lvalue binding, so don't even consider temporaries. If
3391 we don't find an lvalue binding, the caller will try again to
3392 look for a temporary binding. */
3393 if (TREE_CODE (totype
) == REFERENCE_TYPE
)
3394 convflags
|= LOOKUP_NO_TEMP_BIND
;
3396 old_candidates
= candidates
;
3397 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
3399 conversion_path
, TYPE_BINFO (fromtype
),
3400 flags
, &candidates
);
3402 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
3405 = implicit_conversion (totype
,
3406 TREE_TYPE (TREE_TYPE (cand
->fn
)),
3408 /*c_cast_p=*/false, convflags
);
3410 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3411 copy-initialization. In that case, "The result of the
3412 call is then used to direct-initialize the object that is
3413 the destination of the copy-initialization." [dcl.init]
3415 We represent this in the conversion sequence with an
3416 rvalue conversion, which means a constructor call. But
3417 don't add a second rvalue conversion if there's already
3418 one there. Which there really shouldn't be, but it's
3419 harmless since we'd add it here anyway. */
3420 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
3421 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3422 ics
= build_conv (ck_rvalue
, totype
, ics
);
3424 cand
->second_conv
= ics
;
3428 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
3430 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -1,
3433 else if (cand
->viable
== 1 && ics
->bad_p
)
3435 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
3438 = bad_arg_conversion_rejection (NULL_TREE
, -1,
3444 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
3448 release_tree_vector (args
);
3452 cand
= tourney (candidates
);
3455 if (flags
& LOOKUP_COMPLAIN
)
3457 error ("conversion from %qT to %qT is ambiguous",
3459 print_z_candidates (location_of (expr
), candidates
);
3462 cand
= candidates
; /* any one will do */
3463 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
3464 cand
->second_conv
->user_conv_p
= true;
3465 if (!any_strictly_viable (candidates
))
3466 cand
->second_conv
->bad_p
= true;
3467 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3468 ambiguous conversion is no worse than another user-defined
3474 /* Build the user conversion sequence. */
3477 (DECL_CONSTRUCTOR_P (cand
->fn
)
3478 ? totype
: non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)))),
3479 build_identity_conv (TREE_TYPE (expr
), expr
));
3482 /* Remember that this was a list-initialization. */
3483 if (flags
& LOOKUP_NO_NARROWING
)
3484 conv
->check_narrowing
= true;
3486 /* Combine it with the second conversion sequence. */
3487 cand
->second_conv
= merge_conversion_sequences (conv
,
3490 if (cand
->viable
== -1)
3491 cand
->second_conv
->bad_p
= true;
3497 build_user_type_conversion (tree totype
, tree expr
, int flags
)
3499 struct z_candidate
*cand
3500 = build_user_type_conversion_1 (totype
, expr
, flags
);
3504 if (cand
->second_conv
->kind
== ck_ambig
)
3505 return error_mark_node
;
3506 expr
= convert_like (cand
->second_conv
, expr
, tf_warning_or_error
);
3507 return convert_from_reference (expr
);
3512 /* Subroutine of convert_nontype_argument.
3514 EXPR is an argument for a template non-type parameter of integral or
3515 enumeration type. Do any necessary conversions (that are permitted for
3516 non-type arguments) to convert it to the parameter type.
3518 If conversion is successful, returns the converted expression;
3519 otherwise, returns error_mark_node. */
3522 build_integral_nontype_arg_conv (tree type
, tree expr
, tsubst_flags_t complain
)
3528 if (error_operand_p (expr
))
3529 return error_mark_node
;
3531 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
3533 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3534 p
= conversion_obstack_alloc (0);
3536 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
3540 /* for a non-type template-parameter of integral or
3541 enumeration type, integral promotions (4.5) and integral
3542 conversions (4.7) are applied. */
3543 /* It should be sufficient to check the outermost conversion step, since
3544 there are no qualification conversions to integer type. */
3548 /* A conversion function is OK. If it isn't constexpr, we'll
3549 complain later that the argument isn't constant. */
3551 /* The lvalue-to-rvalue conversion is OK. */
3557 t
= conv
->u
.next
->type
;
3558 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
))
3561 if (complain
& tf_error
)
3562 error ("conversion from %qT to %qT not considered for "
3563 "non-type template argument", t
, type
);
3564 /* and fall through. */
3572 expr
= convert_like (conv
, expr
, complain
);
3574 expr
= error_mark_node
;
3576 /* Free all the conversions we allocated. */
3577 obstack_free (&conversion_obstack
, p
);
3582 /* Do any initial processing on the arguments to a function call. */
3584 static VEC(tree
,gc
) *
3585 resolve_args (VEC(tree
,gc
) *args
, tsubst_flags_t complain
)
3590 FOR_EACH_VEC_ELT (tree
, args
, ix
, arg
)
3592 if (error_operand_p (arg
))
3594 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
3596 if (complain
& tf_error
)
3597 error ("invalid use of void expression");
3600 else if (invalid_nonstatic_memfn_p (arg
, tf_warning_or_error
))
3606 /* Perform overload resolution on FN, which is called with the ARGS.
3608 Return the candidate function selected by overload resolution, or
3609 NULL if the event that overload resolution failed. In the case
3610 that overload resolution fails, *CANDIDATES will be the set of
3611 candidates considered, and ANY_VIABLE_P will be set to true or
3612 false to indicate whether or not any of the candidates were
3615 The ARGS should already have gone through RESOLVE_ARGS before this
3616 function is called. */
3618 static struct z_candidate
*
3619 perform_overload_resolution (tree fn
,
3620 const VEC(tree
,gc
) *args
,
3621 struct z_candidate
**candidates
,
3624 struct z_candidate
*cand
;
3625 tree explicit_targs
= NULL_TREE
;
3626 int template_only
= 0;
3629 *any_viable_p
= true;
3632 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
3633 || TREE_CODE (fn
) == TEMPLATE_DECL
3634 || TREE_CODE (fn
) == OVERLOAD
3635 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
3637 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3639 explicit_targs
= TREE_OPERAND (fn
, 1);
3640 fn
= TREE_OPERAND (fn
, 0);
3644 /* Add the various candidate functions. */
3645 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
3646 explicit_targs
, template_only
,
3647 /*conversion_path=*/NULL_TREE
,
3648 /*access_path=*/NULL_TREE
,
3652 *candidates
= splice_viable (*candidates
, pedantic
, any_viable_p
);
3656 cand
= tourney (*candidates
);
3660 /* Print an error message about being unable to build a call to FN with
3661 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
3662 be located; CANDIDATES is a possibly empty list of such
3666 print_error_for_call_failure (tree fn
, VEC(tree
,gc
) *args
, bool any_viable_p
,
3667 struct z_candidate
*candidates
)
3669 tree name
= DECL_NAME (OVL_CURRENT (fn
));
3670 location_t loc
= location_of (name
);
3673 error_at (loc
, "no matching function for call to %<%D(%A)%>",
3674 name
, build_tree_list_vec (args
));
3676 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
3677 name
, build_tree_list_vec (args
));
3679 print_z_candidates (loc
, candidates
);
3682 /* Return an expression for a call to FN (a namespace-scope function,
3683 or a static member function) with the ARGS. This may change
3687 build_new_function_call (tree fn
, VEC(tree
,gc
) **args
, bool koenig_p
,
3688 tsubst_flags_t complain
)
3690 struct z_candidate
*candidates
, *cand
;
3695 if (args
!= NULL
&& *args
!= NULL
)
3697 *args
= resolve_args (*args
, complain
);
3699 return error_mark_node
;
3702 /* If this function was found without using argument dependent
3703 lookup, then we want to ignore any undeclared friend
3709 fn
= remove_hidden_names (fn
);
3712 if (complain
& tf_error
)
3713 print_error_for_call_failure (orig_fn
, *args
, false, NULL
);
3714 return error_mark_node
;
3718 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3719 p
= conversion_obstack_alloc (0);
3721 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
);
3725 if (complain
& tf_error
)
3727 if (!any_viable_p
&& candidates
&& ! candidates
->next
3728 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
3729 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
3730 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3731 fn
= TREE_OPERAND (fn
, 0);
3732 print_error_for_call_failure (fn
, *args
, any_viable_p
, candidates
);
3734 result
= error_mark_node
;
3737 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
3739 /* Free all the conversions we allocated. */
3740 obstack_free (&conversion_obstack
, p
);
3745 /* Build a call to a global operator new. FNNAME is the name of the
3746 operator (either "operator new" or "operator new[]") and ARGS are
3747 the arguments provided. This may change ARGS. *SIZE points to the
3748 total number of bytes required by the allocation, and is updated if
3749 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
3750 be used. If this function determines that no cookie should be
3751 used, after all, *COOKIE_SIZE is set to NULL_TREE. If FN is
3752 non-NULL, it will be set, upon return, to the allocation function
3756 build_operator_new_call (tree fnname
, VEC(tree
,gc
) **args
,
3757 tree
*size
, tree
*cookie_size
,
3761 struct z_candidate
*candidates
;
3762 struct z_candidate
*cand
;
3767 VEC_safe_insert (tree
, gc
, *args
, 0, *size
);
3768 *args
= resolve_args (*args
, tf_warning_or_error
);
3770 return error_mark_node
;
3776 If this lookup fails to find the name, or if the allocated type
3777 is not a class type, the allocation function's name is looked
3778 up in the global scope.
3780 we disregard block-scope declarations of "operator new". */
3781 fns
= lookup_function_nonclass (fnname
, *args
, /*block_p=*/false);
3783 /* Figure out what function is being called. */
3784 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
);
3786 /* If no suitable function could be found, issue an error message
3790 print_error_for_call_failure (fns
, *args
, any_viable_p
, candidates
);
3791 return error_mark_node
;
3794 /* If a cookie is required, add some extra space. Whether
3795 or not a cookie is required cannot be determined until
3796 after we know which function was called. */
3799 bool use_cookie
= true;
3800 if (!abi_version_at_least (2))
3802 /* In G++ 3.2, the check was implemented incorrectly; it
3803 looked at the placement expression, rather than the
3804 type of the function. */
3805 if (VEC_length (tree
, *args
) == 2
3806 && same_type_p (TREE_TYPE (VEC_index (tree
, *args
, 1)),
3814 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
3815 /* Skip the size_t parameter. */
3816 arg_types
= TREE_CHAIN (arg_types
);
3817 /* Check the remaining parameters (if any). */
3819 && TREE_CHAIN (arg_types
) == void_list_node
3820 && same_type_p (TREE_VALUE (arg_types
),
3824 /* If we need a cookie, adjust the number of bytes allocated. */
3827 /* Update the total size. */
3828 *size
= size_binop (PLUS_EXPR
, *size
, *cookie_size
);
3829 /* Update the argument list to reflect the adjusted size. */
3830 VEC_replace (tree
, *args
, 0, *size
);
3833 *cookie_size
= NULL_TREE
;
3836 /* Tell our caller which function we decided to call. */
3840 /* Build the CALL_EXPR. */
3841 return build_over_call (cand
, LOOKUP_NORMAL
, tf_warning_or_error
);
3844 /* Build a new call to operator(). This may change ARGS. */
3847 build_op_call (tree obj
, VEC(tree
,gc
) **args
, tsubst_flags_t complain
)
3849 struct z_candidate
*candidates
= 0, *cand
;
3850 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
3851 tree type
= TREE_TYPE (obj
);
3853 tree result
= NULL_TREE
;
3856 if (error_operand_p (obj
))
3857 return error_mark_node
;
3859 obj
= prep_operand (obj
);
3861 if (TYPE_PTRMEMFUNC_P (type
))
3863 if (complain
& tf_error
)
3864 /* It's no good looking for an overloaded operator() on a
3865 pointer-to-member-function. */
3866 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj
);
3867 return error_mark_node
;
3870 if (TYPE_BINFO (type
))
3872 fns
= lookup_fnfields (TYPE_BINFO (type
), ansi_opname (CALL_EXPR
), 1);
3873 if (fns
== error_mark_node
)
3874 return error_mark_node
;
3879 if (args
!= NULL
&& *args
!= NULL
)
3881 *args
= resolve_args (*args
, complain
);
3883 return error_mark_node
;
3886 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3887 p
= conversion_obstack_alloc (0);
3891 first_mem_arg
= build_this (obj
);
3893 add_candidates (BASELINK_FUNCTIONS (fns
),
3894 first_mem_arg
, *args
, NULL_TREE
,
3896 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
3897 LOOKUP_NORMAL
, &candidates
);
3900 convs
= lookup_conversions (type
);
3902 for (; convs
; convs
= TREE_CHAIN (convs
))
3904 tree fns
= TREE_VALUE (convs
);
3905 tree totype
= TREE_TYPE (convs
);
3907 if ((TREE_CODE (totype
) == POINTER_TYPE
3908 && TREE_CODE (TREE_TYPE (totype
)) == FUNCTION_TYPE
)
3909 || (TREE_CODE (totype
) == REFERENCE_TYPE
3910 && TREE_CODE (TREE_TYPE (totype
)) == FUNCTION_TYPE
)
3911 || (TREE_CODE (totype
) == REFERENCE_TYPE
3912 && TREE_CODE (TREE_TYPE (totype
)) == POINTER_TYPE
3913 && TREE_CODE (TREE_TYPE (TREE_TYPE (totype
))) == FUNCTION_TYPE
))
3914 for (; fns
; fns
= OVL_NEXT (fns
))
3916 tree fn
= OVL_CURRENT (fns
);
3918 if (DECL_NONCONVERTING_P (fn
))
3921 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
3922 add_template_conv_candidate
3923 (&candidates
, fn
, obj
, NULL_TREE
, *args
, totype
,
3924 /*access_path=*/NULL_TREE
,
3925 /*conversion_path=*/NULL_TREE
);
3927 add_conv_candidate (&candidates
, fn
, obj
, NULL_TREE
,
3928 *args
, /*conversion_path=*/NULL_TREE
,
3929 /*access_path=*/NULL_TREE
);
3933 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
3936 if (complain
& tf_error
)
3938 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
3939 build_tree_list_vec (*args
));
3940 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
3942 result
= error_mark_node
;
3946 cand
= tourney (candidates
);
3949 if (complain
& tf_error
)
3951 error ("call of %<(%T) (%A)%> is ambiguous",
3952 TREE_TYPE (obj
), build_tree_list_vec (*args
));
3953 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
3955 result
= error_mark_node
;
3957 /* Since cand->fn will be a type, not a function, for a conversion
3958 function, we must be careful not to unconditionally look at
3960 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
3961 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
) == CALL_EXPR
)
3962 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
3965 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
, -1,
3967 obj
= convert_from_reference (obj
);
3968 result
= cp_build_function_call_vec (obj
, args
, complain
);
3972 /* Free all the conversions we allocated. */
3973 obstack_free (&conversion_obstack
, p
);
3979 op_error (enum tree_code code
, enum tree_code code2
,
3980 tree arg1
, tree arg2
, tree arg3
, bool match
)
3984 if (code
== MODIFY_EXPR
)
3985 opname
= assignment_operator_name_info
[code2
].name
;
3987 opname
= operator_name_info
[code
].name
;
3993 error ("ambiguous overload for ternary %<operator?:%> "
3994 "in %<%E ? %E : %E%>", arg1
, arg2
, arg3
);
3996 error ("no match for ternary %<operator?:%> "
3997 "in %<%E ? %E : %E%>", arg1
, arg2
, arg3
);
4000 case POSTINCREMENT_EXPR
:
4001 case POSTDECREMENT_EXPR
:
4003 error ("ambiguous overload for %<operator%s%> in %<%E%s%>",
4004 opname
, arg1
, opname
);
4006 error ("no match for %<operator%s%> in %<%E%s%>",
4007 opname
, arg1
, opname
);
4012 error ("ambiguous overload for %<operator[]%> in %<%E[%E]%>",
4015 error ("no match for %<operator[]%> in %<%E[%E]%>",
4022 error ("ambiguous overload for %qs in %<%s %E%>",
4023 opname
, opname
, arg1
);
4025 error ("no match for %qs in %<%s %E%>",
4026 opname
, opname
, arg1
);
4032 error ("ambiguous overload for %<operator%s%> in %<%E %s %E%>",
4033 opname
, arg1
, opname
, arg2
);
4035 error ("no match for %<operator%s%> in %<%E %s %E%>",
4036 opname
, arg1
, opname
, arg2
);
4039 error ("ambiguous overload for %<operator%s%> in %<%s%E%>",
4040 opname
, opname
, arg1
);
4042 error ("no match for %<operator%s%> in %<%s%E%>",
4043 opname
, opname
, arg1
);
4048 /* Return the implicit conversion sequence that could be used to
4049 convert E1 to E2 in [expr.cond]. */
4052 conditional_conversion (tree e1
, tree e2
)
4054 tree t1
= non_reference (TREE_TYPE (e1
));
4055 tree t2
= non_reference (TREE_TYPE (e2
));
4061 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4062 implicitly converted (clause _conv_) to the type "reference to
4063 T2", subject to the constraint that in the conversion the
4064 reference must bind directly (_dcl.init.ref_) to E1. */
4065 if (real_lvalue_p (e2
))
4067 conv
= implicit_conversion (build_reference_type (t2
),
4071 LOOKUP_NO_TEMP_BIND
|LOOKUP_ONLYCONVERTING
);
4078 If E1 and E2 have class type, and the underlying class types are
4079 the same or one is a base class of the other: E1 can be converted
4080 to match E2 if the class of T2 is the same type as, or a base
4081 class of, the class of T1, and the cv-qualification of T2 is the
4082 same cv-qualification as, or a greater cv-qualification than, the
4083 cv-qualification of T1. If the conversion is applied, E1 is
4084 changed to an rvalue of type T2 that still refers to the original
4085 source class object (or the appropriate subobject thereof). */
4086 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4087 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4089 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4091 conv
= build_identity_conv (t1
, e1
);
4092 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4093 TYPE_MAIN_VARIANT (t2
)))
4094 conv
= build_conv (ck_base
, t2
, conv
);
4096 conv
= build_conv (ck_rvalue
, t2
, conv
);
4105 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4106 converted to the type that expression E2 would have if E2 were
4107 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4108 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4112 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4113 arguments to the conditional expression. */
4116 build_conditional_expr (tree arg1
, tree arg2
, tree arg3
,
4117 tsubst_flags_t complain
)
4121 tree result
= NULL_TREE
;
4122 tree result_type
= NULL_TREE
;
4123 bool lvalue_p
= true;
4124 struct z_candidate
*candidates
= 0;
4125 struct z_candidate
*cand
;
4128 /* As a G++ extension, the second argument to the conditional can be
4129 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4130 c'.) If the second operand is omitted, make sure it is
4131 calculated only once. */
4134 if (complain
& tf_error
)
4135 pedwarn (input_location
, OPT_pedantic
,
4136 "ISO C++ forbids omitting the middle term of a ?: expression");
4138 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4139 if (real_lvalue_p (arg1
))
4140 arg2
= arg1
= stabilize_reference (arg1
);
4142 arg2
= arg1
= save_expr (arg1
);
4147 The first expression is implicitly converted to bool (clause
4149 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
4152 /* If something has already gone wrong, just pass that fact up the
4154 if (error_operand_p (arg1
)
4155 || error_operand_p (arg2
)
4156 || error_operand_p (arg3
))
4157 return error_mark_node
;
4161 If either the second or the third operand has type (possibly
4162 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4163 array-to-pointer (_conv.array_), and function-to-pointer
4164 (_conv.func_) standard conversions are performed on the second
4165 and third operands. */
4166 arg2_type
= unlowered_expr_type (arg2
);
4167 arg3_type
= unlowered_expr_type (arg3
);
4168 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
4170 /* Do the conversions. We don't these for `void' type arguments
4171 since it can't have any effect and since decay_conversion
4172 does not handle that case gracefully. */
4173 if (!VOID_TYPE_P (arg2_type
))
4174 arg2
= decay_conversion (arg2
);
4175 if (!VOID_TYPE_P (arg3_type
))
4176 arg3
= decay_conversion (arg3
);
4177 arg2_type
= TREE_TYPE (arg2
);
4178 arg3_type
= TREE_TYPE (arg3
);
4182 One of the following shall hold:
4184 --The second or the third operand (but not both) is a
4185 throw-expression (_except.throw_); the result is of the
4186 type of the other and is an rvalue.
4188 --Both the second and the third operands have type void; the
4189 result is of type void and is an rvalue.
4191 We must avoid calling force_rvalue for expressions of type
4192 "void" because it will complain that their value is being
4194 if (TREE_CODE (arg2
) == THROW_EXPR
4195 && TREE_CODE (arg3
) != THROW_EXPR
)
4197 if (!VOID_TYPE_P (arg3_type
))
4199 arg3
= force_rvalue (arg3
, complain
);
4200 if (arg3
== error_mark_node
)
4201 return error_mark_node
;
4203 arg3_type
= TREE_TYPE (arg3
);
4204 result_type
= arg3_type
;
4206 else if (TREE_CODE (arg2
) != THROW_EXPR
4207 && TREE_CODE (arg3
) == THROW_EXPR
)
4209 if (!VOID_TYPE_P (arg2_type
))
4211 arg2
= force_rvalue (arg2
, complain
);
4212 if (arg2
== error_mark_node
)
4213 return error_mark_node
;
4215 arg2_type
= TREE_TYPE (arg2
);
4216 result_type
= arg2_type
;
4218 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
4219 result_type
= void_type_node
;
4222 if (complain
& tf_error
)
4224 if (VOID_TYPE_P (arg2_type
))
4225 error ("second operand to the conditional operator "
4226 "is of type %<void%>, "
4227 "but the third operand is neither a throw-expression "
4228 "nor of type %<void%>");
4230 error ("third operand to the conditional operator "
4231 "is of type %<void%>, "
4232 "but the second operand is neither a throw-expression "
4233 "nor of type %<void%>");
4235 return error_mark_node
;
4239 goto valid_operands
;
4243 Otherwise, if the second and third operand have different types,
4244 and either has (possibly cv-qualified) class type, an attempt is
4245 made to convert each of those operands to the type of the other. */
4246 else if (!same_type_p (arg2_type
, arg3_type
)
4247 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
4252 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4253 p
= conversion_obstack_alloc (0);
4255 conv2
= conditional_conversion (arg2
, arg3
);
4256 conv3
= conditional_conversion (arg3
, arg2
);
4260 If both can be converted, or one can be converted but the
4261 conversion is ambiguous, the program is ill-formed. If
4262 neither can be converted, the operands are left unchanged and
4263 further checking is performed as described below. If exactly
4264 one conversion is possible, that conversion is applied to the
4265 chosen operand and the converted operand is used in place of
4266 the original operand for the remainder of this section. */
4267 if ((conv2
&& !conv2
->bad_p
4268 && conv3
&& !conv3
->bad_p
)
4269 || (conv2
&& conv2
->kind
== ck_ambig
)
4270 || (conv3
&& conv3
->kind
== ck_ambig
))
4272 error ("operands to ?: have different types %qT and %qT",
4273 arg2_type
, arg3_type
);
4274 result
= error_mark_node
;
4276 else if (conv2
&& (!conv2
->bad_p
|| !conv3
))
4278 arg2
= convert_like (conv2
, arg2
, complain
);
4279 arg2
= convert_from_reference (arg2
);
4280 arg2_type
= TREE_TYPE (arg2
);
4281 /* Even if CONV2 is a valid conversion, the result of the
4282 conversion may be invalid. For example, if ARG3 has type
4283 "volatile X", and X does not have a copy constructor
4284 accepting a "volatile X&", then even if ARG2 can be
4285 converted to X, the conversion will fail. */
4286 if (error_operand_p (arg2
))
4287 result
= error_mark_node
;
4289 else if (conv3
&& (!conv3
->bad_p
|| !conv2
))
4291 arg3
= convert_like (conv3
, arg3
, complain
);
4292 arg3
= convert_from_reference (arg3
);
4293 arg3_type
= TREE_TYPE (arg3
);
4294 if (error_operand_p (arg3
))
4295 result
= error_mark_node
;
4298 /* Free all the conversions we allocated. */
4299 obstack_free (&conversion_obstack
, p
);
4304 /* If, after the conversion, both operands have class type,
4305 treat the cv-qualification of both operands as if it were the
4306 union of the cv-qualification of the operands.
4308 The standard is not clear about what to do in this
4309 circumstance. For example, if the first operand has type
4310 "const X" and the second operand has a user-defined
4311 conversion to "volatile X", what is the type of the second
4312 operand after this step? Making it be "const X" (matching
4313 the first operand) seems wrong, as that discards the
4314 qualification without actually performing a copy. Leaving it
4315 as "volatile X" seems wrong as that will result in the
4316 conditional expression failing altogether, even though,
4317 according to this step, the one operand could be converted to
4318 the type of the other. */
4319 if ((conv2
|| conv3
)
4320 && CLASS_TYPE_P (arg2_type
)
4321 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
4322 arg2_type
= arg3_type
=
4323 cp_build_qualified_type (arg2_type
,
4324 cp_type_quals (arg2_type
)
4325 | cp_type_quals (arg3_type
));
4330 If the second and third operands are lvalues and have the same
4331 type, the result is of that type and is an lvalue. */
4332 if (real_lvalue_p (arg2
)
4333 && real_lvalue_p (arg3
)
4334 && same_type_p (arg2_type
, arg3_type
))
4336 result_type
= arg2_type
;
4337 arg2
= mark_lvalue_use (arg2
);
4338 arg3
= mark_lvalue_use (arg3
);
4339 goto valid_operands
;
4344 Otherwise, the result is an rvalue. If the second and third
4345 operand do not have the same type, and either has (possibly
4346 cv-qualified) class type, overload resolution is used to
4347 determine the conversions (if any) to be applied to the operands
4348 (_over.match.oper_, _over.built_). */
4350 if (!same_type_p (arg2_type
, arg3_type
)
4351 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
4357 /* Rearrange the arguments so that add_builtin_candidate only has
4358 to know about two args. In build_builtin_candidate, the
4359 arguments are unscrambled. */
4363 add_builtin_candidates (&candidates
,
4366 ansi_opname (COND_EXPR
),
4372 If the overload resolution fails, the program is
4374 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
4377 if (complain
& tf_error
)
4379 op_error (COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
4380 print_z_candidates (location_of (arg1
), candidates
);
4382 return error_mark_node
;
4384 cand
= tourney (candidates
);
4387 if (complain
& tf_error
)
4389 op_error (COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
4390 print_z_candidates (location_of (arg1
), candidates
);
4392 return error_mark_node
;
4397 Otherwise, the conversions thus determined are applied, and
4398 the converted operands are used in place of the original
4399 operands for the remainder of this section. */
4400 conv
= cand
->convs
[0];
4401 arg1
= convert_like (conv
, arg1
, complain
);
4402 conv
= cand
->convs
[1];
4403 arg2
= convert_like (conv
, arg2
, complain
);
4404 arg2_type
= TREE_TYPE (arg2
);
4405 conv
= cand
->convs
[2];
4406 arg3
= convert_like (conv
, arg3
, complain
);
4407 arg3_type
= TREE_TYPE (arg3
);
4412 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
4413 and function-to-pointer (_conv.func_) standard conversions are
4414 performed on the second and third operands.
4416 We need to force the lvalue-to-rvalue conversion here for class types,
4417 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
4418 that isn't wrapped with a TARGET_EXPR plays havoc with exception
4421 arg2
= force_rvalue (arg2
, complain
);
4422 if (!CLASS_TYPE_P (arg2_type
))
4423 arg2_type
= TREE_TYPE (arg2
);
4425 arg3
= force_rvalue (arg3
, complain
);
4426 if (!CLASS_TYPE_P (arg3_type
))
4427 arg3_type
= TREE_TYPE (arg3
);
4429 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
4430 return error_mark_node
;
4434 After those conversions, one of the following shall hold:
4436 --The second and third operands have the same type; the result is of
4438 if (same_type_p (arg2_type
, arg3_type
))
4439 result_type
= arg2_type
;
4442 --The second and third operands have arithmetic or enumeration
4443 type; the usual arithmetic conversions are performed to bring
4444 them to a common type, and the result is of that type. */
4445 else if ((ARITHMETIC_TYPE_P (arg2_type
)
4446 || UNSCOPED_ENUM_P (arg2_type
))
4447 && (ARITHMETIC_TYPE_P (arg3_type
)
4448 || UNSCOPED_ENUM_P (arg3_type
)))
4450 /* In this case, there is always a common type. */
4451 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
4453 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
4454 "implicit conversion from %qT to %qT to "
4455 "match other result of conditional",
4458 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
4459 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
4461 if (complain
& tf_warning
)
4463 "enumeral mismatch in conditional expression: %qT vs %qT",
4464 arg2_type
, arg3_type
);
4466 else if (extra_warnings
4467 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
4468 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
4469 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
4470 && !same_type_p (arg2_type
, type_promotes_to (arg3_type
)))))
4472 if (complain
& tf_warning
)
4474 "enumeral and non-enumeral type in conditional expression");
4477 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
4478 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
4482 --The second and third operands have pointer type, or one has
4483 pointer type and the other is a null pointer constant; pointer
4484 conversions (_conv.ptr_) and qualification conversions
4485 (_conv.qual_) are performed to bring them to their composite
4486 pointer type (_expr.rel_). The result is of the composite
4489 --The second and third operands have pointer to member type, or
4490 one has pointer to member type and the other is a null pointer
4491 constant; pointer to member conversions (_conv.mem_) and
4492 qualification conversions (_conv.qual_) are performed to bring
4493 them to a common type, whose cv-qualification shall match the
4494 cv-qualification of either the second or the third operand.
4495 The result is of the common type. */
4496 else if ((null_ptr_cst_p (arg2
)
4497 && (TYPE_PTR_P (arg3_type
) || TYPE_PTR_TO_MEMBER_P (arg3_type
)))
4498 || (null_ptr_cst_p (arg3
)
4499 && (TYPE_PTR_P (arg2_type
) || TYPE_PTR_TO_MEMBER_P (arg2_type
)))
4500 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
4501 || (TYPE_PTRMEM_P (arg2_type
) && TYPE_PTRMEM_P (arg3_type
))
4502 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
4504 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
4505 arg3
, CPO_CONDITIONAL_EXPR
,
4507 if (result_type
== error_mark_node
)
4508 return error_mark_node
;
4509 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
4510 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
4515 if (complain
& tf_error
)
4516 error ("operands to ?: have different types %qT and %qT",
4517 arg2_type
, arg3_type
);
4518 return error_mark_node
;
4522 result
= build3 (COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
4523 if (!cp_unevaluated_operand
)
4524 /* Avoid folding within decltype (c++/42013) and noexcept. */
4525 result
= fold_if_not_in_template (result
);
4527 /* We can't use result_type below, as fold might have returned a
4532 /* Expand both sides into the same slot, hopefully the target of
4533 the ?: expression. We used to check for TARGET_EXPRs here,
4534 but now we sometimes wrap them in NOP_EXPRs so the test would
4536 if (CLASS_TYPE_P (TREE_TYPE (result
)))
4537 result
= get_target_expr (result
);
4538 /* If this expression is an rvalue, but might be mistaken for an
4539 lvalue, we must add a NON_LVALUE_EXPR. */
4540 result
= rvalue (result
);
4546 /* OPERAND is an operand to an expression. Perform necessary steps
4547 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
4551 prep_operand (tree operand
)
4555 if (CLASS_TYPE_P (TREE_TYPE (operand
))
4556 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
4557 /* Make sure the template type is instantiated now. */
4558 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
4564 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
4565 OVERLOAD) to the CANDIDATES, returning an updated list of
4566 CANDIDATES. The ARGS are the arguments provided to the call;
4567 if FIRST_ARG is non-null it is the implicit object argument,
4568 otherwise the first element of ARGS is used if needed. The
4569 EXPLICIT_TARGS are explicit template arguments provided.
4570 TEMPLATE_ONLY is true if only template functions should be
4571 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
4572 add_function_candidate. */
4575 add_candidates (tree fns
, tree first_arg
, const VEC(tree
,gc
) *args
,
4577 tree explicit_targs
, bool template_only
,
4578 tree conversion_path
, tree access_path
,
4580 struct z_candidate
**candidates
)
4583 const VEC(tree
,gc
) *non_static_args
;
4584 bool check_list_ctor
;
4585 bool check_converting
;
4586 unification_kind_t strict
;
4592 /* Precalculate special handling of constructors and conversion ops. */
4593 fn
= OVL_CURRENT (fns
);
4594 if (DECL_CONV_FN_P (fn
))
4596 check_list_ctor
= false;
4597 check_converting
= !!(flags
& LOOKUP_ONLYCONVERTING
);
4598 if (flags
& LOOKUP_NO_CONVERSION
)
4599 /* We're doing return_type(x). */
4600 strict
= DEDUCE_CONV
;
4602 /* We're doing x.operator return_type(). */
4603 strict
= DEDUCE_EXACT
;
4604 /* [over.match.funcs] For conversion functions, the function
4605 is considered to be a member of the class of the implicit
4606 object argument for the purpose of defining the type of
4607 the implicit object parameter. */
4608 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (first_arg
)));
4612 if (DECL_CONSTRUCTOR_P (fn
))
4614 check_list_ctor
= !!(flags
& LOOKUP_LIST_ONLY
);
4615 check_converting
= !!(flags
& LOOKUP_ONLYCONVERTING
);
4619 check_list_ctor
= false;
4620 check_converting
= false;
4622 strict
= DEDUCE_CALL
;
4623 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
4627 non_static_args
= args
;
4629 /* Delay creating the implicit this parameter until it is needed. */
4630 non_static_args
= NULL
;
4632 for (; fns
; fns
= OVL_NEXT (fns
))
4635 const VEC(tree
,gc
) *fn_args
;
4637 fn
= OVL_CURRENT (fns
);
4639 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
4641 if (check_list_ctor
&& !is_list_ctor (fn
))
4644 /* Figure out which set of arguments to use. */
4645 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
4647 /* If this function is a non-static member and we didn't get an
4648 implicit object argument, move it out of args. */
4649 if (first_arg
== NULL_TREE
)
4653 VEC(tree
,gc
) *tempvec
4654 = VEC_alloc (tree
, gc
, VEC_length (tree
, args
) - 1);
4655 for (ix
= 1; VEC_iterate (tree
, args
, ix
, arg
); ++ix
)
4656 VEC_quick_push (tree
, tempvec
, arg
);
4657 non_static_args
= tempvec
;
4658 first_arg
= build_this (VEC_index (tree
, args
, 0));
4661 fn_first_arg
= first_arg
;
4662 fn_args
= non_static_args
;
4666 /* Otherwise, just use the list of arguments provided. */
4667 fn_first_arg
= NULL_TREE
;
4671 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4672 add_template_candidate (candidates
,
4683 else if (!template_only
)
4684 add_function_candidate (candidates
,
4695 /* Even unsigned enum types promote to signed int. We don't want to
4696 issue -Wsign-compare warnings for this case. Here ORIG_ARG is the
4697 original argument and ARG is the argument after any conversions
4698 have been applied. We set TREE_NO_WARNING if we have added a cast
4699 from an unsigned enum type to a signed integer type. */
4702 avoid_sign_compare_warnings (tree orig_arg
, tree arg
)
4704 if (orig_arg
!= NULL_TREE
4707 && TREE_CODE (TREE_TYPE (orig_arg
)) == ENUMERAL_TYPE
4708 && TYPE_UNSIGNED (TREE_TYPE (orig_arg
))
4709 && INTEGRAL_TYPE_P (TREE_TYPE (arg
))
4710 && !TYPE_UNSIGNED (TREE_TYPE (arg
)))
4711 TREE_NO_WARNING (arg
) = 1;
4715 build_new_op (enum tree_code code
, int flags
, tree arg1
, tree arg2
, tree arg3
,
4716 bool *overloaded_p
, tsubst_flags_t complain
)
4718 tree orig_arg1
= arg1
;
4719 tree orig_arg2
= arg2
;
4720 tree orig_arg3
= arg3
;
4721 struct z_candidate
*candidates
= 0, *cand
;
4722 VEC(tree
,gc
) *arglist
;
4725 tree result
= NULL_TREE
;
4726 bool result_valid_p
= false;
4727 enum tree_code code2
= NOP_EXPR
;
4728 enum tree_code code_orig_arg1
= ERROR_MARK
;
4729 enum tree_code code_orig_arg2
= ERROR_MARK
;
4735 if (error_operand_p (arg1
)
4736 || error_operand_p (arg2
)
4737 || error_operand_p (arg3
))
4738 return error_mark_node
;
4740 if (code
== MODIFY_EXPR
)
4742 code2
= TREE_CODE (arg3
);
4744 fnname
= ansi_assopname (code2
);
4747 fnname
= ansi_opname (code
);
4749 arg1
= prep_operand (arg1
);
4755 case VEC_DELETE_EXPR
:
4757 /* Use build_op_new_call and build_op_delete_call instead. */
4761 /* Use build_op_call instead. */
4764 case TRUTH_ORIF_EXPR
:
4765 case TRUTH_ANDIF_EXPR
:
4766 case TRUTH_AND_EXPR
:
4768 /* These are saved for the sake of warn_logical_operator. */
4769 code_orig_arg1
= TREE_CODE (arg1
);
4770 code_orig_arg2
= TREE_CODE (arg2
);
4776 arg2
= prep_operand (arg2
);
4777 arg3
= prep_operand (arg3
);
4779 if (code
== COND_EXPR
)
4780 /* Use build_conditional_expr instead. */
4782 else if (! IS_OVERLOAD_TYPE (TREE_TYPE (arg1
))
4783 && (! arg2
|| ! IS_OVERLOAD_TYPE (TREE_TYPE (arg2
))))
4786 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
4787 arg2
= integer_zero_node
;
4789 arglist
= VEC_alloc (tree
, gc
, 3);
4790 VEC_quick_push (tree
, arglist
, arg1
);
4791 if (arg2
!= NULL_TREE
)
4792 VEC_quick_push (tree
, arglist
, arg2
);
4793 if (arg3
!= NULL_TREE
)
4794 VEC_quick_push (tree
, arglist
, arg3
);
4796 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4797 p
= conversion_obstack_alloc (0);
4799 /* Add namespace-scope operators to the list of functions to
4801 add_candidates (lookup_function_nonclass (fnname
, arglist
, /*block_p=*/true),
4802 NULL_TREE
, arglist
, NULL_TREE
,
4803 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
4804 flags
, &candidates
);
4805 /* Add class-member operators to the candidate set. */
4806 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
4810 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
4811 if (fns
== error_mark_node
)
4813 result
= error_mark_node
;
4814 goto user_defined_result_ready
;
4817 add_candidates (BASELINK_FUNCTIONS (fns
),
4818 NULL_TREE
, arglist
, NULL_TREE
,
4820 BASELINK_BINFO (fns
),
4821 BASELINK_ACCESS_BINFO (fns
),
4822 flags
, &candidates
);
4827 args
[2] = NULL_TREE
;
4829 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
, flags
);
4835 /* For these, the built-in candidates set is empty
4836 [over.match.oper]/3. We don't want non-strict matches
4837 because exact matches are always possible with built-in
4838 operators. The built-in candidate set for COMPONENT_REF
4839 would be empty too, but since there are no such built-in
4840 operators, we accept non-strict matches for them. */
4845 strict_p
= pedantic
;
4849 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
4854 case POSTINCREMENT_EXPR
:
4855 case POSTDECREMENT_EXPR
:
4856 /* Don't try anything fancy if we're not allowed to produce
4858 if (!(complain
& tf_error
))
4859 return error_mark_node
;
4861 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
4862 distinguish between prefix and postfix ++ and
4863 operator++() was used for both, so we allow this with
4865 if (flags
& LOOKUP_COMPLAIN
)
4867 const char *msg
= (flag_permissive
)
4868 ? G_("no %<%D(int)%> declared for postfix %qs,"
4869 " trying prefix operator instead")
4870 : G_("no %<%D(int)%> declared for postfix %qs");
4871 permerror (input_location
, msg
, fnname
,
4872 operator_name_info
[code
].name
);
4875 if (!flag_permissive
)
4876 return error_mark_node
;
4878 if (code
== POSTINCREMENT_EXPR
)
4879 code
= PREINCREMENT_EXPR
;
4881 code
= PREDECREMENT_EXPR
;
4882 result
= build_new_op (code
, flags
, arg1
, NULL_TREE
, NULL_TREE
,
4883 overloaded_p
, complain
);
4886 /* The caller will deal with these. */
4891 result_valid_p
= true;
4895 if ((flags
& LOOKUP_COMPLAIN
) && (complain
& tf_error
))
4897 /* If one of the arguments of the operator represents
4898 an invalid use of member function pointer, try to report
4899 a meaningful error ... */
4900 if (invalid_nonstatic_memfn_p (arg1
, tf_error
)
4901 || invalid_nonstatic_memfn_p (arg2
, tf_error
)
4902 || invalid_nonstatic_memfn_p (arg3
, tf_error
))
4903 /* We displayed the error message. */;
4906 /* ... Otherwise, report the more generic
4907 "no matching operator found" error */
4908 op_error (code
, code2
, arg1
, arg2
, arg3
, FALSE
);
4909 print_z_candidates (input_location
, candidates
);
4912 result
= error_mark_node
;
4918 cand
= tourney (candidates
);
4921 if ((flags
& LOOKUP_COMPLAIN
) && (complain
& tf_error
))
4923 op_error (code
, code2
, arg1
, arg2
, arg3
, TRUE
);
4924 print_z_candidates (input_location
, candidates
);
4926 result
= error_mark_node
;
4928 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
4931 *overloaded_p
= true;
4933 if (resolve_args (arglist
, complain
) == NULL
)
4934 result
= error_mark_node
;
4936 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4940 /* Give any warnings we noticed during overload resolution. */
4941 if (cand
->warnings
&& (complain
& tf_warning
))
4943 struct candidate_warning
*w
;
4944 for (w
= cand
->warnings
; w
; w
= w
->next
)
4945 joust (cand
, w
->loser
, 1);
4948 /* Check for comparison of different enum types. */
4957 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
4958 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
4959 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
4960 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
4961 && (complain
& tf_warning
))
4963 warning (OPT_Wenum_compare
,
4964 "comparison between %q#T and %q#T",
4965 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4972 /* We need to strip any leading REF_BIND so that bitfields
4973 don't cause errors. This should not remove any important
4974 conversions, because builtins don't apply to class
4975 objects directly. */
4976 conv
= cand
->convs
[0];
4977 if (conv
->kind
== ck_ref_bind
)
4978 conv
= conv
->u
.next
;
4979 arg1
= convert_like (conv
, arg1
, complain
);
4983 /* We need to call warn_logical_operator before
4984 converting arg2 to a boolean_type. */
4985 if (complain
& tf_warning
)
4986 warn_logical_operator (input_location
, code
, boolean_type_node
,
4987 code_orig_arg1
, arg1
,
4988 code_orig_arg2
, arg2
);
4990 conv
= cand
->convs
[1];
4991 if (conv
->kind
== ck_ref_bind
)
4992 conv
= conv
->u
.next
;
4993 arg2
= convert_like (conv
, arg2
, complain
);
4997 conv
= cand
->convs
[2];
4998 if (conv
->kind
== ck_ref_bind
)
4999 conv
= conv
->u
.next
;
5000 arg3
= convert_like (conv
, arg3
, complain
);
5006 user_defined_result_ready
:
5008 /* Free all the conversions we allocated. */
5009 obstack_free (&conversion_obstack
, p
);
5011 if (result
|| result_valid_p
)
5015 avoid_sign_compare_warnings (orig_arg1
, arg1
);
5016 avoid_sign_compare_warnings (orig_arg2
, arg2
);
5017 avoid_sign_compare_warnings (orig_arg3
, arg3
);
5022 return cp_build_modify_expr (arg1
, code2
, arg2
, complain
);
5025 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
5027 case TRUTH_ANDIF_EXPR
:
5028 case TRUTH_ORIF_EXPR
:
5029 case TRUTH_AND_EXPR
:
5031 warn_logical_operator (input_location
, code
, boolean_type_node
,
5032 code_orig_arg1
, arg1
, code_orig_arg2
, arg2
);
5037 case TRUNC_DIV_EXPR
:
5048 case TRUNC_MOD_EXPR
:
5052 return cp_build_binary_op (input_location
, code
, arg1
, arg2
, complain
);
5054 case UNARY_PLUS_EXPR
:
5057 case TRUTH_NOT_EXPR
:
5058 case PREINCREMENT_EXPR
:
5059 case POSTINCREMENT_EXPR
:
5060 case PREDECREMENT_EXPR
:
5061 case POSTDECREMENT_EXPR
:
5064 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
5067 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
5070 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_NULL
,
5074 /* The caller will deal with these. */
5086 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
5087 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
5090 non_placement_deallocation_fn_p (tree t
)
5092 /* A template instance is never a usual deallocation function,
5093 regardless of its signature. */
5094 if (TREE_CODE (t
) == TEMPLATE_DECL
5095 || primary_template_instantiation_p (t
))
5098 /* If a class T has a member deallocation function named operator delete
5099 with exactly one parameter, then that function is a usual
5100 (non-placement) deallocation function. If class T does not declare
5101 such an operator delete but does declare a member deallocation
5102 function named operator delete with exactly two parameters, the second
5103 of which has type std::size_t (18.2), then this function is a usual
5104 deallocation function. */
5105 t
= FUNCTION_ARG_CHAIN (t
);
5106 if (t
== void_list_node
5107 || (t
&& same_type_p (TREE_VALUE (t
), size_type_node
)
5108 && TREE_CHAIN (t
) == void_list_node
))
5113 /* Build a call to operator delete. This has to be handled very specially,
5114 because the restrictions on what signatures match are different from all
5115 other call instances. For a normal delete, only a delete taking (void *)
5116 or (void *, size_t) is accepted. For a placement delete, only an exact
5117 match with the placement new is accepted.
5119 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
5120 ADDR is the pointer to be deleted.
5121 SIZE is the size of the memory block to be deleted.
5122 GLOBAL_P is true if the delete-expression should not consider
5123 class-specific delete operators.
5124 PLACEMENT is the corresponding placement new call, or NULL_TREE.
5126 If this call to "operator delete" is being generated as part to
5127 deallocate memory allocated via a new-expression (as per [expr.new]
5128 which requires that if the initialization throws an exception then
5129 we call a deallocation function), then ALLOC_FN is the allocation
5133 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
5134 bool global_p
, tree placement
,
5137 tree fn
= NULL_TREE
;
5138 tree fns
, fnname
, type
, t
;
5140 if (addr
== error_mark_node
)
5141 return error_mark_node
;
5143 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
5145 fnname
= ansi_opname (code
);
5147 if (CLASS_TYPE_P (type
)
5148 && COMPLETE_TYPE_P (complete_type (type
))
5152 If the result of the lookup is ambiguous or inaccessible, or if
5153 the lookup selects a placement deallocation function, the
5154 program is ill-formed.
5156 Therefore, we ask lookup_fnfields to complain about ambiguity. */
5158 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
5159 if (fns
== error_mark_node
)
5160 return error_mark_node
;
5165 if (fns
== NULL_TREE
)
5166 fns
= lookup_name_nonclass (fnname
);
5168 /* Strip const and volatile from addr. */
5169 addr
= cp_convert (ptr_type_node
, addr
);
5173 /* "A declaration of a placement deallocation function matches the
5174 declaration of a placement allocation function if it has the same
5175 number of parameters and, after parameter transformations (8.3.5),
5176 all parameter types except the first are identical."
5178 So we build up the function type we want and ask instantiate_type
5179 to get it for us. */
5180 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
5181 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
5182 t
= build_function_type (void_type_node
, t
);
5184 fn
= instantiate_type (t
, fns
, tf_none
);
5185 if (fn
== error_mark_node
)
5188 if (BASELINK_P (fn
))
5189 fn
= BASELINK_FUNCTIONS (fn
);
5191 /* "If the lookup finds the two-parameter form of a usual deallocation
5192 function (3.7.4.2) and that function, considered as a placement
5193 deallocation function, would have been selected as a match for the
5194 allocation function, the program is ill-formed." */
5195 if (non_placement_deallocation_fn_p (fn
))
5197 /* But if the class has an operator delete (void *), then that is
5198 the usual deallocation function, so we shouldn't complain
5199 about using the operator delete (void *, size_t). */
5200 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
5201 t
; t
= OVL_NEXT (t
))
5203 tree elt
= OVL_CURRENT (t
);
5204 if (non_placement_deallocation_fn_p (elt
)
5205 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
5208 permerror (0, "non-placement deallocation function %q+D", fn
);
5209 permerror (input_location
, "selected for placement delete");
5214 /* "Any non-placement deallocation function matches a non-placement
5215 allocation function. If the lookup finds a single matching
5216 deallocation function, that function will be called; otherwise, no
5217 deallocation function will be called." */
5218 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
5219 t
; t
= OVL_NEXT (t
))
5221 tree elt
= OVL_CURRENT (t
);
5222 if (non_placement_deallocation_fn_p (elt
))
5225 /* "If a class T has a member deallocation function named
5226 operator delete with exactly one parameter, then that
5227 function is a usual (non-placement) deallocation
5228 function. If class T does not declare such an operator
5229 delete but does declare a member deallocation function named
5230 operator delete with exactly two parameters, the second of
5231 which has type std::size_t (18.2), then this function is a
5232 usual deallocation function."
5234 So (void*) beats (void*, size_t). */
5235 if (FUNCTION_ARG_CHAIN (fn
) == void_list_node
)
5240 /* If we have a matching function, call it. */
5243 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
5245 /* If the FN is a member function, make sure that it is
5247 if (BASELINK_P (fns
))
5248 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
);
5250 /* Core issue 901: It's ok to new a type with deleted delete. */
5251 if (DECL_DELETED_FN (fn
) && alloc_fn
)
5256 /* The placement args might not be suitable for overload
5257 resolution at this point, so build the call directly. */
5258 int nargs
= call_expr_nargs (placement
);
5259 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
5262 for (i
= 1; i
< nargs
; i
++)
5263 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
5265 return build_cxx_call (fn
, nargs
, argarray
);
5270 VEC(tree
,gc
) *args
= VEC_alloc (tree
, gc
, 2);
5271 VEC_quick_push (tree
, args
, addr
);
5272 if (FUNCTION_ARG_CHAIN (fn
) != void_list_node
)
5273 VEC_quick_push (tree
, args
, size
);
5274 ret
= cp_build_function_call_vec (fn
, &args
, tf_warning_or_error
);
5275 VEC_free (tree
, gc
, args
);
5282 If no unambiguous matching deallocation function can be found,
5283 propagating the exception does not cause the object's memory to
5288 warning (0, "no corresponding deallocation function for %qD",
5293 error ("no suitable %<operator %s%> for %qT",
5294 operator_name_info
[(int)code
].name
, type
);
5295 return error_mark_node
;
5298 /* If the current scope isn't allowed to access DECL along
5299 BASETYPE_PATH, give an error. The most derived class in
5300 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
5301 the declaration to use in the error diagnostic. */
5304 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
)
5306 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
5308 if (!accessible_p (basetype_path
, decl
, true))
5310 if (TREE_PRIVATE (decl
))
5311 error ("%q+#D is private", diag_decl
);
5312 else if (TREE_PROTECTED (decl
))
5313 error ("%q+#D is protected", diag_decl
);
5315 error ("%q+#D is inaccessible", diag_decl
);
5316 error ("within this context");
5323 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
5324 bitwise or of LOOKUP_* values. If any errors are warnings are
5325 generated, set *DIAGNOSTIC_FN to "error" or "warning",
5326 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
5330 build_temp (tree expr
, tree type
, int flags
,
5331 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
5336 savew
= warningcount
, savee
= errorcount
;
5337 args
= make_tree_vector_single (expr
);
5338 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
5339 &args
, type
, flags
, complain
);
5340 release_tree_vector (args
);
5341 if (warningcount
> savew
)
5342 *diagnostic_kind
= DK_WARNING
;
5343 else if (errorcount
> savee
)
5344 *diagnostic_kind
= DK_ERROR
;
5346 *diagnostic_kind
= DK_UNSPECIFIED
;
5350 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
5351 EXPR is implicitly converted to type TOTYPE.
5352 FN and ARGNUM are used for diagnostics. */
5355 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
5357 tree t
= non_reference (totype
);
5359 /* Issue warnings about peculiar, but valid, uses of NULL. */
5360 if (expr
== null_node
&& TREE_CODE (t
) != BOOLEAN_TYPE
&& ARITHMETIC_TYPE_P (t
))
5363 warning_at (input_location
, OPT_Wconversion_null
,
5364 "passing NULL to non-pointer argument %P of %qD",
5367 warning_at (input_location
, OPT_Wconversion_null
,
5368 "converting to non-pointer type %qT from NULL", t
);
5371 /* Issue warnings if "false" is converted to a NULL pointer */
5372 else if (expr
== boolean_false_node
&& fn
&& POINTER_TYPE_P (t
))
5373 warning_at (input_location
, OPT_Wconversion_null
,
5374 "converting %<false%> to pointer type for argument %P of %qD",
5378 /* Perform the conversions in CONVS on the expression EXPR. FN and
5379 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
5380 indicates the `this' argument of a method. INNER is nonzero when
5381 being called to continue a conversion chain. It is negative when a
5382 reference binding will be applied, positive otherwise. If
5383 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
5384 conversions will be emitted if appropriate. If C_CAST_P is true,
5385 this conversion is coming from a C-style cast; in that case,
5386 conversions to inaccessible bases are permitted. */
5389 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
5390 int inner
, bool issue_conversion_warnings
,
5391 bool c_cast_p
, tsubst_flags_t complain
)
5393 tree totype
= convs
->type
;
5394 diagnostic_t diag_kind
;
5398 && convs
->kind
!= ck_user
5399 && convs
->kind
!= ck_list
5400 && convs
->kind
!= ck_ambig
5401 && convs
->kind
!= ck_ref_bind
5402 && convs
->kind
!= ck_rvalue
5403 && convs
->kind
!= ck_base
)
5405 conversion
*t
= convs
;
5407 /* Give a helpful error if this is bad because of excess braces. */
5408 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
5409 && SCALAR_TYPE_P (totype
)
5410 && CONSTRUCTOR_NELTS (expr
) > 0
5411 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
5412 permerror (input_location
, "too many braces around initializer for %qT", totype
);
5414 for (; t
; t
= convs
->u
.next
)
5416 if (t
->kind
== ck_user
|| !t
->bad_p
)
5418 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
5419 /*issue_conversion_warnings=*/false,
5424 else if (t
->kind
== ck_ambig
)
5425 return convert_like_real (t
, expr
, fn
, argnum
, 1,
5426 /*issue_conversion_warnings=*/false,
5429 else if (t
->kind
== ck_identity
)
5432 if (complain
& tf_error
)
5434 permerror (input_location
, "invalid conversion from %qT to %qT", TREE_TYPE (expr
), totype
);
5436 permerror (DECL_SOURCE_LOCATION (fn
),
5437 " initializing argument %P of %qD", argnum
, fn
);
5440 return error_mark_node
;
5442 return cp_convert (totype
, expr
);
5445 if (issue_conversion_warnings
&& (complain
& tf_warning
))
5446 conversion_null_warnings (totype
, expr
, fn
, argnum
);
5448 switch (convs
->kind
)
5452 struct z_candidate
*cand
= convs
->cand
;
5453 tree convfn
= cand
->fn
;
5456 expr
= mark_rvalue_use (expr
);
5458 /* When converting from an init list we consider explicit
5459 constructors, but actually trying to call one is an error. */
5460 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
5461 /* Unless we're calling it for value-initialization from an
5462 empty list, since that is handled separately in 8.5.4. */
5463 && cand
->num_convs
> 0)
5465 if (complain
& tf_error
)
5466 error ("converting to %qT from initializer list would use "
5467 "explicit constructor %qD", totype
, convfn
);
5469 return error_mark_node
;
5472 /* Set user_conv_p on the argument conversions, so rvalue/base
5473 handling knows not to allow any more UDCs. */
5474 for (i
= 0; i
< cand
->num_convs
; ++i
)
5475 cand
->convs
[i
]->user_conv_p
= true;
5477 expr
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5479 /* If this is a constructor or a function returning an aggr type,
5480 we need to build up a TARGET_EXPR. */
5481 if (DECL_CONSTRUCTOR_P (convfn
))
5483 expr
= build_cplus_new (totype
, expr
, complain
);
5485 /* Remember that this was list-initialization. */
5486 if (convs
->check_narrowing
)
5487 TARGET_EXPR_LIST_INIT_P (expr
) = true;
5493 expr
= mark_rvalue_use (expr
);
5494 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
5496 int nelts
= CONSTRUCTOR_NELTS (expr
);
5498 expr
= build_value_init (totype
, tf_warning_or_error
);
5499 else if (nelts
== 1)
5500 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
5505 if (type_unknown_p (expr
))
5506 expr
= instantiate_type (totype
, expr
, complain
);
5507 /* Convert a constant to its underlying value, unless we are
5508 about to bind it to a reference, in which case we need to
5509 leave it as an lvalue. */
5512 expr
= decl_constant_value (expr
);
5513 if (expr
== null_node
&& INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
5514 /* If __null has been converted to an integer type, we do not
5515 want to warn about uses of EXPR as an integer, rather than
5517 expr
= build_int_cst (totype
, 0);
5521 if (complain
& tf_error
)
5523 /* Call build_user_type_conversion again for the error. */
5524 build_user_type_conversion (totype
, convs
->u
.expr
, LOOKUP_NORMAL
);
5526 error (" initializing argument %P of %q+D", argnum
, fn
);
5528 return error_mark_node
;
5532 /* Conversion to std::initializer_list<T>. */
5533 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
5534 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
5535 unsigned len
= CONSTRUCTOR_NELTS (expr
);
5536 tree array
, val
, field
;
5537 VEC(constructor_elt
,gc
) *vec
= NULL
;
5540 /* Convert all the elements. */
5541 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
5543 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
5544 1, false, false, complain
);
5545 if (sub
== error_mark_node
)
5547 if (!BRACE_ENCLOSED_INITIALIZER_P (val
))
5548 check_narrowing (TREE_TYPE (sub
), val
);
5549 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
5550 if (!TREE_CONSTANT (sub
))
5551 TREE_CONSTANT (new_ctor
) = false;
5553 /* Build up the array. */
5554 elttype
= cp_build_qualified_type
5555 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
5556 array
= build_array_of_n_type (elttype
, len
);
5557 array
= finish_compound_literal (array
, new_ctor
, complain
);
5559 /* Build up the initializer_list object. */
5560 totype
= complete_type (totype
);
5561 field
= next_initializable_field (TYPE_FIELDS (totype
));
5562 CONSTRUCTOR_APPEND_ELT (vec
, field
, decay_conversion (array
));
5563 field
= next_initializable_field (DECL_CHAIN (field
));
5564 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
5565 new_ctor
= build_constructor (totype
, vec
);
5566 return get_target_expr (new_ctor
);
5570 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
5572 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
5573 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
5574 real
= perform_implicit_conversion (TREE_TYPE (totype
),
5576 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
5578 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
5579 return fold_if_not_in_template (expr
);
5581 return get_target_expr (digest_init (totype
, expr
));
5587 expr
= convert_like_real (convs
->u
.next
, expr
, fn
, argnum
,
5588 convs
->kind
== ck_ref_bind
? -1 : 1,
5589 convs
->kind
== ck_ref_bind
? issue_conversion_warnings
: false,
5592 if (expr
== error_mark_node
)
5593 return error_mark_node
;
5595 switch (convs
->kind
)
5598 expr
= decay_conversion (expr
);
5599 if (! MAYBE_CLASS_TYPE_P (totype
))
5601 /* Else fall through. */
5603 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
5605 /* We are going to bind a reference directly to a base-class
5606 subobject of EXPR. */
5607 /* Build an expression for `*((base*) &expr)'. */
5608 expr
= cp_build_addr_expr (expr
, complain
);
5609 expr
= convert_to_base (expr
, build_pointer_type (totype
),
5610 !c_cast_p
, /*nonnull=*/true, complain
);
5611 expr
= cp_build_indirect_ref (expr
, RO_IMPLICIT_CONVERSION
, complain
);
5615 /* Copy-initialization where the cv-unqualified version of the source
5616 type is the same class as, or a derived class of, the class of the
5617 destination [is treated as direct-initialization]. [dcl.init] */
5618 flags
= LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
;
5619 if (convs
->user_conv_p
)
5620 /* This conversion is being done in the context of a user-defined
5621 conversion (i.e. the second step of copy-initialization), so
5622 don't allow any more. */
5623 flags
|= LOOKUP_NO_CONVERSION
;
5624 if (convs
->rvaluedness_matches_p
)
5625 flags
|= LOOKUP_PREFER_RVALUE
;
5626 if (TREE_CODE (expr
) == TARGET_EXPR
5627 && TARGET_EXPR_LIST_INIT_P (expr
))
5628 /* Copy-list-initialization doesn't actually involve a copy. */
5630 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
5631 if (diag_kind
&& fn
)
5633 if ((complain
& tf_error
))
5634 emit_diagnostic (diag_kind
, DECL_SOURCE_LOCATION (fn
), 0,
5635 " initializing argument %P of %qD", argnum
, fn
);
5636 else if (diag_kind
== DK_ERROR
)
5637 return error_mark_node
;
5639 return build_cplus_new (totype
, expr
, complain
);
5643 tree ref_type
= totype
;
5645 if (convs
->bad_p
&& TYPE_REF_IS_RVALUE (ref_type
)
5646 && real_lvalue_p (expr
))
5648 if (complain
& tf_error
)
5650 error ("cannot bind %qT lvalue to %qT",
5651 TREE_TYPE (expr
), totype
);
5653 error (" initializing argument %P of %q+D", argnum
, fn
);
5655 return error_mark_node
;
5658 /* If necessary, create a temporary.
5660 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
5661 that need temporaries, even when their types are reference
5662 compatible with the type of reference being bound, so the
5663 upcoming call to cp_build_addr_expr doesn't fail. */
5664 if (convs
->need_temporary_p
5665 || TREE_CODE (expr
) == CONSTRUCTOR
5666 || TREE_CODE (expr
) == VA_ARG_EXPR
)
5668 /* Otherwise, a temporary of type "cv1 T1" is created and
5669 initialized from the initializer expression using the rules
5670 for a non-reference copy-initialization (8.5). */
5672 tree type
= TREE_TYPE (ref_type
);
5673 cp_lvalue_kind lvalue
= real_lvalue_p (expr
);
5675 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5676 (type
, convs
->u
.next
->type
));
5677 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
5678 && !TYPE_REF_IS_RVALUE (ref_type
))
5680 if (complain
& tf_error
)
5682 /* If the reference is volatile or non-const, we
5683 cannot create a temporary. */
5684 if (lvalue
& clk_bitfield
)
5685 error ("cannot bind bitfield %qE to %qT",
5687 else if (lvalue
& clk_packed
)
5688 error ("cannot bind packed field %qE to %qT",
5691 error ("cannot bind rvalue %qE to %qT", expr
, ref_type
);
5693 return error_mark_node
;
5695 /* If the source is a packed field, and we must use a copy
5696 constructor, then building the target expr will require
5697 binding the field to the reference parameter to the
5698 copy constructor, and we'll end up with an infinite
5699 loop. If we can use a bitwise copy, then we'll be
5701 if ((lvalue
& clk_packed
)
5702 && CLASS_TYPE_P (type
)
5703 && type_has_nontrivial_copy_init (type
))
5705 if (complain
& tf_error
)
5706 error ("cannot bind packed field %qE to %qT",
5708 return error_mark_node
;
5710 if (lvalue
& clk_bitfield
)
5712 expr
= convert_bitfield_to_declared_type (expr
);
5713 expr
= fold_convert (type
, expr
);
5715 expr
= build_target_expr_with_type (expr
, type
, complain
);
5718 /* Take the address of the thing to which we will bind the
5720 expr
= cp_build_addr_expr (expr
, complain
);
5721 if (expr
== error_mark_node
)
5722 return error_mark_node
;
5724 /* Convert it to a pointer to the type referred to by the
5725 reference. This will adjust the pointer if a derived to
5726 base conversion is being performed. */
5727 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
5729 /* Convert the pointer to the desired reference type. */
5730 return build_nop (ref_type
, expr
);
5734 return decay_conversion (expr
);
5737 /* Warn about deprecated conversion if appropriate. */
5738 string_conv_p (totype
, expr
, 1);
5743 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
5744 /*nonnull=*/false, complain
);
5745 return build_nop (totype
, expr
);
5748 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
5749 c_cast_p
, complain
);
5755 if (convs
->check_narrowing
)
5756 check_narrowing (totype
, expr
);
5758 if (issue_conversion_warnings
&& (complain
& tf_warning
))
5759 expr
= convert_and_check (totype
, expr
);
5761 expr
= convert (totype
, expr
);
5766 /* ARG is being passed to a varargs function. Perform any conversions
5767 required. Return the converted value. */
5770 convert_arg_to_ellipsis (tree arg
)
5776 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
5777 standard conversions are performed. */
5778 arg
= decay_conversion (arg
);
5779 arg_type
= TREE_TYPE (arg
);
5782 If the argument has integral or enumeration type that is subject
5783 to the integral promotions (_conv.prom_), or a floating point
5784 type that is subject to the floating point promotion
5785 (_conv.fpprom_), the value of the argument is converted to the
5786 promoted type before the call. */
5787 if (TREE_CODE (arg_type
) == REAL_TYPE
5788 && (TYPE_PRECISION (arg_type
)
5789 < TYPE_PRECISION (double_type_node
))
5790 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
5792 if (warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
5793 warning (OPT_Wdouble_promotion
,
5794 "implicit conversion from %qT to %qT when passing "
5795 "argument to function",
5796 arg_type
, double_type_node
);
5797 arg
= convert_to_real (double_type_node
, arg
);
5799 else if (NULLPTR_TYPE_P (arg_type
))
5800 arg
= null_pointer_node
;
5801 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
5802 arg
= perform_integral_promotions (arg
);
5804 arg
= require_complete_type (arg
);
5805 arg_type
= TREE_TYPE (arg
);
5807 if (arg
!= error_mark_node
5808 /* In a template (or ill-formed code), we can have an incomplete type
5809 even after require_complete_type, in which case we don't know
5810 whether it has trivial copy or not. */
5811 && COMPLETE_TYPE_P (arg_type
)
5812 && (type_has_nontrivial_copy_init (arg_type
)
5813 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
)))
5815 /* [expr.call] 5.2.2/7:
5816 Passing a potentially-evaluated argument of class type (Clause 9)
5817 with a non-trivial copy constructor or a non-trivial destructor
5818 with no corresponding parameter is conditionally-supported, with
5819 implementation-defined semantics.
5821 We used to just warn here and do a bitwise copy, but now
5822 cp_expr_size will abort if we try to do that.
5824 If the call appears in the context of a sizeof expression,
5825 it is not potentially-evaluated. */
5826 if (cp_unevaluated_operand
== 0)
5827 error ("cannot pass objects of non-trivially-copyable "
5828 "type %q#T through %<...%>", arg_type
);
5834 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
5837 build_x_va_arg (tree expr
, tree type
)
5839 if (processing_template_decl
)
5840 return build_min (VA_ARG_EXPR
, type
, expr
);
5842 type
= complete_type_or_else (type
, NULL_TREE
);
5844 if (expr
== error_mark_node
|| !type
)
5845 return error_mark_node
;
5847 expr
= mark_lvalue_use (expr
);
5849 if (type_has_nontrivial_copy_init (type
)
5850 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
5851 || TREE_CODE (type
) == REFERENCE_TYPE
)
5853 /* Remove reference types so we don't ICE later on. */
5854 tree type1
= non_reference (type
);
5855 /* conditionally-supported behavior [expr.call] 5.2.2/7. */
5856 error ("cannot receive objects of non-trivially-copyable type %q#T "
5857 "through %<...%>; ", type
);
5858 expr
= convert (build_pointer_type (type1
), null_node
);
5859 expr
= cp_build_indirect_ref (expr
, RO_NULL
, tf_warning_or_error
);
5863 return build_va_arg (input_location
, expr
, type
);
5866 /* TYPE has been given to va_arg. Apply the default conversions which
5867 would have happened when passed via ellipsis. Return the promoted
5868 type, or the passed type if there is no change. */
5871 cxx_type_promotes_to (tree type
)
5875 /* Perform the array-to-pointer and function-to-pointer
5877 type
= type_decays_to (type
);
5879 promote
= type_promotes_to (type
);
5880 if (same_type_p (type
, promote
))
5886 /* ARG is a default argument expression being passed to a parameter of
5887 the indicated TYPE, which is a parameter to FN. PARMNUM is the
5888 zero-based argument number. Do any required conversions. Return
5889 the converted value. */
5891 static GTY(()) VEC(tree
,gc
) *default_arg_context
;
5893 push_defarg_context (tree fn
)
5894 { VEC_safe_push (tree
, gc
, default_arg_context
, fn
); }
5896 pop_defarg_context (void)
5897 { VEC_pop (tree
, default_arg_context
); }
5900 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
)
5905 /* See through clones. */
5906 fn
= DECL_ORIGIN (fn
);
5908 /* Detect recursion. */
5909 FOR_EACH_VEC_ELT (tree
, default_arg_context
, i
, t
)
5912 error ("recursive evaluation of default argument for %q#D", fn
);
5913 return error_mark_node
;
5916 /* If the ARG is an unparsed default argument expression, the
5917 conversion cannot be performed. */
5918 if (TREE_CODE (arg
) == DEFAULT_ARG
)
5920 error ("call to %qD uses the default argument for parameter %P, which "
5921 "is not yet defined", fn
, parmnum
);
5922 return error_mark_node
;
5925 push_defarg_context (fn
);
5927 if (fn
&& DECL_TEMPLATE_INFO (fn
))
5928 arg
= tsubst_default_argument (fn
, type
, arg
);
5934 The names in the expression are bound, and the semantic
5935 constraints are checked, at the point where the default
5936 expressions appears.
5938 we must not perform access checks here. */
5939 push_deferring_access_checks (dk_no_check
);
5940 arg
= break_out_target_exprs (arg
);
5941 if (TREE_CODE (arg
) == CONSTRUCTOR
)
5943 arg
= digest_init (type
, arg
);
5944 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
5945 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
5946 tf_warning_or_error
);
5950 /* We must make a copy of ARG, in case subsequent processing
5951 alters any part of it. For example, during gimplification a
5952 cast of the form (T) &X::f (where "f" is a member function)
5953 will lead to replacing the PTRMEM_CST for &X::f with a
5954 VAR_DECL. We can avoid the copy for constants, since they
5955 are never modified in place. */
5956 if (!CONSTANT_CLASS_P (arg
))
5957 arg
= unshare_expr (arg
);
5958 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
5959 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
5960 tf_warning_or_error
);
5961 arg
= convert_for_arg_passing (type
, arg
);
5963 pop_deferring_access_checks();
5965 pop_defarg_context ();
5970 /* Returns the type which will really be used for passing an argument of
5974 type_passed_as (tree type
)
5976 /* Pass classes with copy ctors by invisible reference. */
5977 if (TREE_ADDRESSABLE (type
))
5979 type
= build_reference_type (type
);
5980 /* There are no other pointers to this temporary. */
5981 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
5983 else if (targetm
.calls
.promote_prototypes (type
)
5984 && INTEGRAL_TYPE_P (type
)
5985 && COMPLETE_TYPE_P (type
)
5986 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
),
5987 TYPE_SIZE (integer_type_node
)))
5988 type
= integer_type_node
;
5993 /* Actually perform the appropriate conversion. */
5996 convert_for_arg_passing (tree type
, tree val
)
6000 /* If VAL is a bitfield, then -- since it has already been converted
6001 to TYPE -- it cannot have a precision greater than TYPE.
6003 If it has a smaller precision, we must widen it here. For
6004 example, passing "int f:3;" to a function expecting an "int" will
6005 not result in any conversion before this point.
6007 If the precision is the same we must not risk widening. For
6008 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
6009 often have type "int", even though the C++ type for the field is
6010 "long long". If the value is being passed to a function
6011 expecting an "int", then no conversions will be required. But,
6012 if we call convert_bitfield_to_declared_type, the bitfield will
6013 be converted to "long long". */
6014 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
6016 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
6017 val
= convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type
), val
);
6019 if (val
== error_mark_node
)
6021 /* Pass classes with copy ctors by invisible reference. */
6022 else if (TREE_ADDRESSABLE (type
))
6023 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
6024 else if (targetm
.calls
.promote_prototypes (type
)
6025 && INTEGRAL_TYPE_P (type
)
6026 && COMPLETE_TYPE_P (type
)
6027 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
),
6028 TYPE_SIZE (integer_type_node
)))
6029 val
= perform_integral_promotions (val
);
6030 if (warn_missing_format_attribute
)
6032 tree rhstype
= TREE_TYPE (val
);
6033 const enum tree_code coder
= TREE_CODE (rhstype
);
6034 const enum tree_code codel
= TREE_CODE (type
);
6035 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
6037 && check_missing_format_attribute (type
, rhstype
))
6038 warning (OPT_Wmissing_format_attribute
,
6039 "argument of function call might be a candidate for a format attribute");
6044 /* Returns true iff FN is a function with magic varargs, i.e. ones for
6045 which no conversions at all should be done. This is true for some
6046 builtins which don't act like normal functions. */
6049 magic_varargs_p (tree fn
)
6051 if (DECL_BUILT_IN (fn
))
6052 switch (DECL_FUNCTION_CODE (fn
))
6054 case BUILT_IN_CLASSIFY_TYPE
:
6055 case BUILT_IN_CONSTANT_P
:
6056 case BUILT_IN_NEXT_ARG
:
6057 case BUILT_IN_VA_START
:
6061 return lookup_attribute ("type generic",
6062 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
6068 /* Subroutine of the various build_*_call functions. Overload resolution
6069 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
6070 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
6071 bitmask of various LOOKUP_* flags which apply to the call itself. */
6074 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
6077 const VEC(tree
,gc
) *args
= cand
->args
;
6078 tree first_arg
= cand
->first_arg
;
6079 conversion
**convs
= cand
->convs
;
6081 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
6086 unsigned int arg_index
= 0;
6090 bool already_used
= false;
6092 /* In a template, there is no need to perform all of the work that
6093 is normally done. We are only interested in the type of the call
6094 expression, i.e., the return type of the function. Any semantic
6095 errors will be deferred until the template is instantiated. */
6096 if (processing_template_decl
)
6100 const tree
*argarray
;
6103 return_type
= TREE_TYPE (TREE_TYPE (fn
));
6104 nargs
= VEC_length (tree
, args
);
6105 if (first_arg
== NULL_TREE
)
6106 argarray
= VEC_address (tree
, CONST_CAST (VEC(tree
,gc
) *, args
));
6114 alcarray
= XALLOCAVEC (tree
, nargs
);
6115 alcarray
[0] = first_arg
;
6116 FOR_EACH_VEC_ELT (tree
, args
, ix
, arg
)
6117 alcarray
[ix
+ 1] = arg
;
6118 argarray
= alcarray
;
6120 expr
= build_call_array_loc (input_location
,
6121 return_type
, build_addr_func (fn
), nargs
,
6123 if (TREE_THIS_VOLATILE (fn
) && cfun
)
6124 current_function_returns_abnormally
= 1;
6125 return convert_from_reference (expr
);
6128 /* Give any warnings we noticed during overload resolution. */
6129 if (cand
->warnings
&& (complain
& tf_warning
))
6131 struct candidate_warning
*w
;
6132 for (w
= cand
->warnings
; w
; w
= w
->next
)
6133 joust (cand
, w
->loser
, 1);
6136 /* Make =delete work with SFINAE. */
6137 if (DECL_DELETED_FN (fn
) && !(complain
& tf_error
))
6138 return error_mark_node
;
6140 if (DECL_FUNCTION_MEMBER_P (fn
))
6143 /* If FN is a template function, two cases must be considered.
6148 template <class T> void f();
6150 template <class T> struct B {
6154 struct C : A, B<int> {
6156 using B<int>::g; // #2
6159 In case #1 where `A::f' is a member template, DECL_ACCESS is
6160 recorded in the primary template but not in its specialization.
6161 We check access of FN using its primary template.
6163 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
6164 because it is a member of class template B, DECL_ACCESS is
6165 recorded in the specialization `B<int>::g'. We cannot use its
6166 primary template because `B<T>::g' and `B<int>::g' may have
6167 different access. */
6168 if (DECL_TEMPLATE_INFO (fn
)
6169 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
6170 access_fn
= DECL_TI_TEMPLATE (fn
);
6173 if (flags
& LOOKUP_SPECULATIVE
)
6175 if (!speculative_access_check (cand
->access_path
, access_fn
, fn
,
6176 !!(flags
& LOOKUP_COMPLAIN
)))
6177 return error_mark_node
;
6180 perform_or_defer_access_check (cand
->access_path
, access_fn
, fn
);
6183 /* If we're checking for implicit delete, don't bother with argument
6185 if (flags
& LOOKUP_SPECULATIVE
)
6187 if (DECL_DELETED_FN (fn
))
6189 if (flags
& LOOKUP_COMPLAIN
)
6191 return error_mark_node
;
6193 if (cand
->viable
== 1)
6195 else if (!(flags
& LOOKUP_COMPLAIN
))
6196 /* Reject bad conversions now. */
6197 return error_mark_node
;
6198 /* else continue to get conversion error. */
6201 /* Find maximum size of vector to hold converted arguments. */
6202 parmlen
= list_length (parm
);
6203 nargs
= VEC_length (tree
, args
) + (first_arg
!= NULL_TREE
? 1 : 0);
6204 if (parmlen
> nargs
)
6206 argarray
= XALLOCAVEC (tree
, nargs
);
6208 /* The implicit parameters to a constructor are not considered by overload
6209 resolution, and must be of the proper type. */
6210 if (DECL_CONSTRUCTOR_P (fn
))
6212 if (first_arg
!= NULL_TREE
)
6214 argarray
[j
++] = first_arg
;
6215 first_arg
= NULL_TREE
;
6219 argarray
[j
++] = VEC_index (tree
, args
, arg_index
);
6222 parm
= TREE_CHAIN (parm
);
6223 /* We should never try to call the abstract constructor. */
6224 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
6226 if (DECL_HAS_VTT_PARM_P (fn
))
6228 argarray
[j
++] = VEC_index (tree
, args
, arg_index
);
6230 parm
= TREE_CHAIN (parm
);
6233 /* Bypass access control for 'this' parameter. */
6234 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
6236 tree parmtype
= TREE_VALUE (parm
);
6237 tree arg
= (first_arg
!= NULL_TREE
6239 : VEC_index (tree
, args
, arg_index
));
6240 tree argtype
= TREE_TYPE (arg
);
6244 if (convs
[i
]->bad_p
)
6246 if (complain
& tf_error
)
6247 permerror (input_location
, "passing %qT as %<this%> argument of %q#D discards qualifiers",
6248 TREE_TYPE (argtype
), fn
);
6250 return error_mark_node
;
6253 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
6254 X is called for an object that is not of type X, or of a type
6255 derived from X, the behavior is undefined.
6257 So we can assume that anything passed as 'this' is non-null, and
6258 optimize accordingly. */
6259 gcc_assert (TREE_CODE (parmtype
) == POINTER_TYPE
);
6260 /* Convert to the base in which the function was declared. */
6261 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
6262 converted_arg
= build_base_path (PLUS_EXPR
,
6264 cand
->conversion_path
,
6266 /* Check that the base class is accessible. */
6267 if (!accessible_base_p (TREE_TYPE (argtype
),
6268 BINFO_TYPE (cand
->conversion_path
), true))
6269 error ("%qT is not an accessible base of %qT",
6270 BINFO_TYPE (cand
->conversion_path
),
6271 TREE_TYPE (argtype
));
6272 /* If fn was found by a using declaration, the conversion path
6273 will be to the derived class, not the base declaring fn. We
6274 must convert from derived to base. */
6275 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
6276 TREE_TYPE (parmtype
), ba_unique
, NULL
);
6277 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
6280 argarray
[j
++] = converted_arg
;
6281 parm
= TREE_CHAIN (parm
);
6282 if (first_arg
!= NULL_TREE
)
6283 first_arg
= NULL_TREE
;
6290 gcc_assert (first_arg
== NULL_TREE
);
6291 for (; arg_index
< VEC_length (tree
, args
) && parm
;
6292 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
6294 tree type
= TREE_VALUE (parm
);
6295 tree arg
= VEC_index (tree
, args
, arg_index
);
6299 /* Warn about initializer_list deduction that isn't currently in the
6301 if (cxx_dialect
> cxx98
6302 && flag_deduce_init_list
6303 && cand
->template_decl
6304 && is_std_init_list (non_reference (type
))
6305 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
6307 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
6308 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
6309 tree patparm
= get_pattern_parm (realparm
, tmpl
);
6310 tree pattype
= TREE_TYPE (patparm
);
6311 if (PACK_EXPANSION_P (pattype
))
6312 pattype
= PACK_EXPANSION_PATTERN (pattype
);
6313 pattype
= non_reference (pattype
);
6315 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
6316 && (cand
->explicit_targs
== NULL_TREE
6317 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
6318 <= TEMPLATE_TYPE_IDX (pattype
))))
6320 pedwarn (input_location
, 0, "deducing %qT as %qT",
6321 non_reference (TREE_TYPE (patparm
)),
6322 non_reference (type
));
6323 pedwarn (input_location
, 0, " in call to %q+D", cand
->fn
);
6324 pedwarn (input_location
, 0,
6325 " (you can disable this with -fno-deduce-init-list)");
6329 val
= convert_like_with_context (conv
, arg
, fn
, i
-is_method
, complain
);
6331 val
= convert_for_arg_passing (type
, val
);
6332 if (val
== error_mark_node
)
6333 return error_mark_node
;
6335 argarray
[j
++] = val
;
6338 /* Default arguments */
6339 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
6340 argarray
[j
++] = convert_default_arg (TREE_VALUE (parm
),
6341 TREE_PURPOSE (parm
),
6344 for (; arg_index
< VEC_length (tree
, args
); ++arg_index
)
6346 tree a
= VEC_index (tree
, args
, arg_index
);
6347 if (magic_varargs_p (fn
))
6348 /* Do no conversions for magic varargs. */
6349 a
= mark_type_use (a
);
6351 a
= convert_arg_to_ellipsis (a
);
6355 gcc_assert (j
<= nargs
);
6358 check_function_arguments (TYPE_ATTRIBUTES (TREE_TYPE (fn
)),
6359 nargs
, argarray
, TYPE_ARG_TYPES (TREE_TYPE (fn
)));
6361 /* Avoid actually calling copy constructors and copy assignment operators,
6364 if (! flag_elide_constructors
)
6365 /* Do things the hard way. */;
6366 else if (cand
->num_convs
== 1
6367 && (DECL_COPY_CONSTRUCTOR_P (fn
)
6368 || DECL_MOVE_CONSTRUCTOR_P (fn
)))
6371 tree arg
= argarray
[num_artificial_parms_for (fn
)];
6373 bool trivial
= trivial_fn_p (fn
);
6375 /* Pull out the real argument, disregarding const-correctness. */
6377 while (CONVERT_EXPR_P (targ
)
6378 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
6379 targ
= TREE_OPERAND (targ
, 0);
6380 if (TREE_CODE (targ
) == ADDR_EXPR
)
6382 targ
= TREE_OPERAND (targ
, 0);
6383 if (!same_type_ignoring_top_level_qualifiers_p
6384 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
6393 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
6395 /* [class.copy]: the copy constructor is implicitly defined even if
6396 the implementation elided its use. */
6397 if (!trivial
|| DECL_DELETED_FN (fn
))
6400 already_used
= true;
6403 /* If we're creating a temp and we already have one, don't create a
6404 new one. If we're not creating a temp but we get one, use
6405 INIT_EXPR to collapse the temp into our target. Otherwise, if the
6406 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
6407 temp or an INIT_EXPR otherwise. */
6409 if (integer_zerop (fa
))
6411 if (TREE_CODE (arg
) == TARGET_EXPR
)
6414 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
6416 else if (TREE_CODE (arg
) == TARGET_EXPR
|| trivial
)
6418 tree to
= stabilize_reference (cp_build_indirect_ref (fa
, RO_NULL
,
6421 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
6425 else if (DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
6426 && trivial_fn_p (fn
)
6427 && !DECL_DELETED_FN (fn
))
6429 tree to
= stabilize_reference
6430 (cp_build_indirect_ref (argarray
[0], RO_NULL
, complain
));
6431 tree type
= TREE_TYPE (to
);
6432 tree as_base
= CLASSTYPE_AS_BASE (type
);
6433 tree arg
= argarray
[1];
6435 if (is_really_empty_class (type
))
6437 /* Avoid copying empty classes. */
6438 val
= build2 (COMPOUND_EXPR
, void_type_node
, to
, arg
);
6439 TREE_NO_WARNING (val
) = 1;
6440 val
= build2 (COMPOUND_EXPR
, type
, val
, to
);
6441 TREE_NO_WARNING (val
) = 1;
6443 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
6445 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
6446 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
6450 /* We must only copy the non-tail padding parts.
6451 Use __builtin_memcpy for the bitwise copy.
6452 FIXME fix 22488 so we can go back to using MODIFY_EXPR
6453 instead of an explicit call to memcpy. */
6455 tree arg0
, arg1
, arg2
, t
;
6456 tree test
= NULL_TREE
;
6458 arg2
= TYPE_SIZE_UNIT (as_base
);
6460 arg0
= cp_build_addr_expr (to
, complain
);
6462 if (!can_trust_pointer_alignment ())
6464 /* If we can't be sure about pointer alignment, a call
6465 to __builtin_memcpy is expanded as a call to memcpy, which
6466 is invalid with identical args. Otherwise it is
6467 expanded as a block move, which should be safe. */
6468 arg0
= save_expr (arg0
);
6469 arg1
= save_expr (arg1
);
6470 test
= build2 (EQ_EXPR
, boolean_type_node
, arg0
, arg1
);
6472 t
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
6473 t
= build_call_n (t
, 3, arg0
, arg1
, arg2
);
6475 t
= convert (TREE_TYPE (arg0
), t
);
6477 t
= build3 (COND_EXPR
, TREE_TYPE (t
), test
, arg0
, t
);
6478 val
= cp_build_indirect_ref (t
, RO_NULL
, complain
);
6479 TREE_NO_WARNING (val
) = 1;
6484 else if (DECL_DESTRUCTOR_P (fn
)
6485 && trivial_fn_p (fn
)
6486 && !DECL_DELETED_FN (fn
))
6487 return fold_convert (void_type_node
, argarray
[0]);
6488 /* FIXME handle trivial default constructor, too. */
6493 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0)
6496 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
6499 gcc_assert (binfo
&& binfo
!= error_mark_node
);
6501 /* Warn about deprecated virtual functions now, since we're about
6502 to throw away the decl. */
6503 if (TREE_DEPRECATED (fn
))
6504 warn_deprecated_use (fn
, NULL_TREE
);
6506 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1);
6507 if (TREE_SIDE_EFFECTS (argarray
[0]))
6508 argarray
[0] = save_expr (argarray
[0]);
6509 t
= build_pointer_type (TREE_TYPE (fn
));
6510 if (DECL_CONTEXT (fn
) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn
)))
6511 fn
= build_java_interface_fn_ref (fn
, argarray
[0]);
6513 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
6517 fn
= build_addr_func (fn
);
6519 return build_cxx_call (fn
, nargs
, argarray
);
6522 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
6523 This function performs no overload resolution, conversion, or other
6524 high-level operations. */
6527 build_cxx_call (tree fn
, int nargs
, tree
*argarray
)
6531 fn
= build_call_a (fn
, nargs
, argarray
);
6533 /* If this call might throw an exception, note that fact. */
6534 fndecl
= get_callee_fndecl (fn
);
6535 if ((!fndecl
|| !TREE_NOTHROW (fndecl
))
6536 && at_function_scope_p ()
6538 && cp_function_chain
)
6539 cp_function_chain
->can_throw
= 1;
6541 /* Check that arguments to builtin functions match the expectations. */
6543 && DECL_BUILT_IN (fndecl
)
6544 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
6545 && !check_builtin_function_arguments (fndecl
, nargs
, argarray
))
6546 return error_mark_node
;
6548 /* Some built-in function calls will be evaluated at compile-time in
6550 fn
= fold_if_not_in_template (fn
);
6552 if (VOID_TYPE_P (TREE_TYPE (fn
)))
6555 fn
= require_complete_type (fn
);
6556 if (fn
== error_mark_node
)
6557 return error_mark_node
;
6559 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
6560 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, tf_warning_or_error
);
6561 return convert_from_reference (fn
);
6564 static GTY(()) tree java_iface_lookup_fn
;
6566 /* Make an expression which yields the address of the Java interface
6567 method FN. This is achieved by generating a call to libjava's
6568 _Jv_LookupInterfaceMethodIdx(). */
6571 build_java_interface_fn_ref (tree fn
, tree instance
)
6573 tree lookup_fn
, method
, idx
;
6574 tree klass_ref
, iface
, iface_ref
;
6577 if (!java_iface_lookup_fn
)
6579 tree ftype
= build_function_type_list (ptr_type_node
,
6580 ptr_type_node
, ptr_type_node
,
6581 java_int_type_node
, NULL_TREE
);
6582 java_iface_lookup_fn
6583 = add_builtin_function ("_Jv_LookupInterfaceMethodIdx", ftype
,
6584 0, NOT_BUILT_IN
, NULL
, NULL_TREE
);
6587 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
6588 This is the first entry in the vtable. */
6589 klass_ref
= build_vtbl_ref (cp_build_indirect_ref (instance
, RO_NULL
,
6590 tf_warning_or_error
),
6593 /* Get the java.lang.Class pointer for the interface being called. */
6594 iface
= DECL_CONTEXT (fn
);
6595 iface_ref
= lookup_field (iface
, get_identifier ("class$"), 0, false);
6596 if (!iface_ref
|| TREE_CODE (iface_ref
) != VAR_DECL
6597 || DECL_CONTEXT (iface_ref
) != iface
)
6599 error ("could not find class$ field in java interface type %qT",
6601 return error_mark_node
;
6603 iface_ref
= build_address (iface_ref
);
6604 iface_ref
= convert (build_pointer_type (iface
), iface_ref
);
6606 /* Determine the itable index of FN. */
6608 for (method
= TYPE_METHODS (iface
); method
; method
= DECL_CHAIN (method
))
6610 if (!DECL_VIRTUAL_P (method
))
6616 idx
= build_int_cst (NULL_TREE
, i
);
6618 lookup_fn
= build1 (ADDR_EXPR
,
6619 build_pointer_type (TREE_TYPE (java_iface_lookup_fn
)),
6620 java_iface_lookup_fn
);
6621 return build_call_nary (ptr_type_node
, lookup_fn
,
6622 3, klass_ref
, iface_ref
, idx
);
6625 /* Returns the value to use for the in-charge parameter when making a
6626 call to a function with the indicated NAME.
6628 FIXME:Can't we find a neater way to do this mapping? */
6631 in_charge_arg_for_name (tree name
)
6633 if (name
== base_ctor_identifier
6634 || name
== base_dtor_identifier
)
6635 return integer_zero_node
;
6636 else if (name
== complete_ctor_identifier
)
6637 return integer_one_node
;
6638 else if (name
== complete_dtor_identifier
)
6639 return integer_two_node
;
6640 else if (name
== deleting_dtor_identifier
)
6641 return integer_three_node
;
6643 /* This function should only be called with one of the names listed
6649 /* Build a call to a constructor, destructor, or an assignment
6650 operator for INSTANCE, an expression with class type. NAME
6651 indicates the special member function to call; *ARGS are the
6652 arguments. ARGS may be NULL. This may change ARGS. BINFO
6653 indicates the base of INSTANCE that is to be passed as the `this'
6654 parameter to the member function called.
6656 FLAGS are the LOOKUP_* flags to use when processing the call.
6658 If NAME indicates a complete object constructor, INSTANCE may be
6659 NULL_TREE. In this case, the caller will call build_cplus_new to
6660 store the newly constructed object into a VAR_DECL. */
6663 build_special_member_call (tree instance
, tree name
, VEC(tree
,gc
) **args
,
6664 tree binfo
, int flags
, tsubst_flags_t complain
)
6667 /* The type of the subobject to be constructed or destroyed. */
6669 VEC(tree
,gc
) *allocated
= NULL
;
6672 gcc_assert (name
== complete_ctor_identifier
6673 || name
== base_ctor_identifier
6674 || name
== complete_dtor_identifier
6675 || name
== base_dtor_identifier
6676 || name
== deleting_dtor_identifier
6677 || name
== ansi_assopname (NOP_EXPR
));
6680 /* Resolve the name. */
6681 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
6682 return error_mark_node
;
6684 binfo
= TYPE_BINFO (binfo
);
6687 gcc_assert (binfo
!= NULL_TREE
);
6689 class_type
= BINFO_TYPE (binfo
);
6691 /* Handle the special case where INSTANCE is NULL_TREE. */
6692 if (name
== complete_ctor_identifier
&& !instance
)
6694 instance
= build_int_cst (build_pointer_type (class_type
), 0);
6695 instance
= build1 (INDIRECT_REF
, class_type
, instance
);
6699 if (name
== complete_dtor_identifier
6700 || name
== base_dtor_identifier
6701 || name
== deleting_dtor_identifier
)
6702 gcc_assert (args
== NULL
|| VEC_empty (tree
, *args
));
6704 /* Convert to the base class, if necessary. */
6705 if (!same_type_ignoring_top_level_qualifiers_p
6706 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
6708 if (name
!= ansi_assopname (NOP_EXPR
))
6709 /* For constructors and destructors, either the base is
6710 non-virtual, or it is virtual but we are doing the
6711 conversion from a constructor or destructor for the
6712 complete object. In either case, we can convert
6714 instance
= convert_to_base_statically (instance
, binfo
);
6716 /* However, for assignment operators, we must convert
6717 dynamically if the base is virtual. */
6718 instance
= build_base_path (PLUS_EXPR
, instance
,
6719 binfo
, /*nonnull=*/1);
6723 gcc_assert (instance
!= NULL_TREE
);
6725 fns
= lookup_fnfields (binfo
, name
, 1);
6727 /* When making a call to a constructor or destructor for a subobject
6728 that uses virtual base classes, pass down a pointer to a VTT for
6730 if ((name
== base_ctor_identifier
6731 || name
== base_dtor_identifier
)
6732 && CLASSTYPE_VBASECLASSES (class_type
))
6737 /* If the current function is a complete object constructor
6738 or destructor, then we fetch the VTT directly.
6739 Otherwise, we look it up using the VTT we were given. */
6740 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
6741 vtt
= decay_conversion (vtt
);
6742 vtt
= build3 (COND_EXPR
, TREE_TYPE (vtt
),
6743 build2 (EQ_EXPR
, boolean_type_node
,
6744 current_in_charge_parm
, integer_zero_node
),
6747 gcc_assert (BINFO_SUBVTT_INDEX (binfo
));
6748 sub_vtt
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (vtt
), vtt
,
6749 BINFO_SUBVTT_INDEX (binfo
));
6753 allocated
= make_tree_vector ();
6757 VEC_safe_insert (tree
, gc
, *args
, 0, sub_vtt
);
6760 ret
= build_new_method_call (instance
, fns
, args
,
6761 TYPE_BINFO (BINFO_TYPE (binfo
)),
6765 if (allocated
!= NULL
)
6766 release_tree_vector (allocated
);
6771 /* Return the NAME, as a C string. The NAME indicates a function that
6772 is a member of TYPE. *FREE_P is set to true if the caller must
6773 free the memory returned.
6775 Rather than go through all of this, we should simply set the names
6776 of constructors and destructors appropriately, and dispense with
6777 ctor_identifier, dtor_identifier, etc. */
6780 name_as_c_string (tree name
, tree type
, bool *free_p
)
6784 /* Assume that we will not allocate memory. */
6786 /* Constructors and destructors are special. */
6787 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
6790 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
))));
6791 /* For a destructor, add the '~'. */
6792 if (name
== complete_dtor_identifier
6793 || name
== base_dtor_identifier
6794 || name
== deleting_dtor_identifier
)
6796 pretty_name
= concat ("~", pretty_name
, NULL
);
6797 /* Remember that we need to free the memory allocated. */
6801 else if (IDENTIFIER_TYPENAME_P (name
))
6803 pretty_name
= concat ("operator ",
6804 type_as_string_translate (TREE_TYPE (name
),
6805 TFF_PLAIN_IDENTIFIER
),
6807 /* Remember that we need to free the memory allocated. */
6811 pretty_name
= CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name
)));
6816 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
6817 be set, upon return, to the function called. ARGS may be NULL.
6818 This may change ARGS. */
6821 build_new_method_call (tree instance
, tree fns
, VEC(tree
,gc
) **args
,
6822 tree conversion_path
, int flags
,
6823 tree
*fn_p
, tsubst_flags_t complain
)
6825 struct z_candidate
*candidates
= 0, *cand
;
6826 tree explicit_targs
= NULL_TREE
;
6827 tree basetype
= NULL_TREE
;
6830 tree first_mem_arg
= NULL_TREE
;
6833 bool skip_first_for_error
;
6834 VEC(tree
,gc
) *user_args
;
6837 int template_only
= 0;
6841 VEC(tree
,gc
) *orig_args
= NULL
;
6844 gcc_assert (instance
!= NULL_TREE
);
6846 /* We don't know what function we're going to call, yet. */
6850 if (error_operand_p (instance
)
6851 || !fns
|| error_operand_p (fns
))
6852 return error_mark_node
;
6854 if (!BASELINK_P (fns
))
6856 if (complain
& tf_error
)
6857 error ("call to non-function %qD", fns
);
6858 return error_mark_node
;
6861 orig_instance
= instance
;
6864 /* Dismantle the baselink to collect all the information we need. */
6865 if (!conversion_path
)
6866 conversion_path
= BASELINK_BINFO (fns
);
6867 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
6868 optype
= BASELINK_OPTYPE (fns
);
6869 fns
= BASELINK_FUNCTIONS (fns
);
6870 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
6872 explicit_targs
= TREE_OPERAND (fns
, 1);
6873 fns
= TREE_OPERAND (fns
, 0);
6876 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
6877 || TREE_CODE (fns
) == TEMPLATE_DECL
6878 || TREE_CODE (fns
) == OVERLOAD
);
6879 fn
= get_first_fn (fns
);
6880 name
= DECL_NAME (fn
);
6882 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
6883 gcc_assert (CLASS_TYPE_P (basetype
));
6885 if (processing_template_decl
)
6887 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
6888 instance
= build_non_dependent_expr (instance
);
6890 make_args_non_dependent (*args
);
6893 user_args
= args
== NULL
? NULL
: *args
;
6894 /* Under DR 147 A::A() is an invalid constructor call,
6895 not a functional cast. */
6896 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
6898 if (! (complain
& tf_error
))
6899 return error_mark_node
;
6901 permerror (input_location
,
6902 "cannot call constructor %<%T::%D%> directly",
6904 permerror (input_location
, " for a function-style cast, remove the "
6905 "redundant %<::%D%>", name
);
6906 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
6911 /* Figure out whether to skip the first argument for the error
6912 message we will display to users if an error occurs. We don't
6913 want to display any compiler-generated arguments. The "this"
6914 pointer hasn't been added yet. However, we must remove the VTT
6915 pointer if this is a call to a base-class constructor or
6917 skip_first_for_error
= false;
6918 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
6920 /* Callers should explicitly indicate whether they want to construct
6921 the complete object or just the part without virtual bases. */
6922 gcc_assert (name
!= ctor_identifier
);
6923 /* Similarly for destructors. */
6924 gcc_assert (name
!= dtor_identifier
);
6925 /* Remove the VTT pointer, if present. */
6926 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
6927 && CLASSTYPE_VBASECLASSES (basetype
))
6928 skip_first_for_error
= true;
6931 /* Process the argument list. */
6932 if (args
!= NULL
&& *args
!= NULL
)
6934 *args
= resolve_args (*args
, complain
);
6936 return error_mark_node
;
6939 instance_ptr
= build_this (instance
);
6941 /* It's OK to call destructors and constructors on cv-qualified objects.
6942 Therefore, convert the INSTANCE_PTR to the unqualified type, if
6944 if (DECL_DESTRUCTOR_P (fn
)
6945 || DECL_CONSTRUCTOR_P (fn
))
6947 tree type
= build_pointer_type (basetype
);
6948 if (!same_type_p (type
, TREE_TYPE (instance_ptr
)))
6949 instance_ptr
= build_nop (type
, instance_ptr
);
6951 if (DECL_DESTRUCTOR_P (fn
))
6952 name
= complete_dtor_identifier
;
6954 first_mem_arg
= instance_ptr
;
6956 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6957 p
= conversion_obstack_alloc (0);
6959 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
6960 initializer, not T({ }). */
6961 if (DECL_CONSTRUCTOR_P (fn
) && args
!= NULL
&& !VEC_empty (tree
, *args
)
6962 && BRACE_ENCLOSED_INITIALIZER_P (VEC_index (tree
, *args
, 0))
6963 && CONSTRUCTOR_IS_DIRECT_INIT (VEC_index (tree
, *args
, 0)))
6965 gcc_assert (VEC_length (tree
, *args
) == 1
6966 && !(flags
& LOOKUP_ONLYCONVERTING
));
6968 add_list_candidates (fns
, first_mem_arg
, VEC_index (tree
, *args
, 0),
6969 basetype
, explicit_targs
, template_only
,
6970 conversion_path
, access_binfo
, flags
, &candidates
);
6974 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
6975 explicit_targs
, template_only
, conversion_path
,
6976 access_binfo
, flags
, &candidates
);
6978 any_viable_p
= false;
6979 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
6983 if (complain
& tf_error
)
6985 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
6986 cxx_incomplete_type_error (instance_ptr
, basetype
);
6988 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
6989 basetype
, optype
, build_tree_list_vec (user_args
),
6990 TREE_TYPE (TREE_TYPE (instance_ptr
)));
6997 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
6998 arglist
= build_tree_list_vec (user_args
);
6999 if (skip_first_for_error
)
7000 arglist
= TREE_CHAIN (arglist
);
7001 error ("no matching function for call to %<%T::%s(%A)%#V%>",
7002 basetype
, pretty_name
, arglist
,
7003 TREE_TYPE (TREE_TYPE (instance_ptr
)));
7007 print_z_candidates (location_of (name
), candidates
);
7009 call
= error_mark_node
;
7013 cand
= tourney (candidates
);
7020 if (complain
& tf_error
)
7022 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
7023 arglist
= build_tree_list_vec (user_args
);
7024 if (skip_first_for_error
)
7025 arglist
= TREE_CHAIN (arglist
);
7026 error ("call of overloaded %<%s(%A)%> is ambiguous", pretty_name
,
7028 print_z_candidates (location_of (name
), candidates
);
7032 call
= error_mark_node
;
7038 if (!(flags
& LOOKUP_NONVIRTUAL
)
7039 && DECL_PURE_VIRTUAL_P (fn
)
7040 && instance
== current_class_ref
7041 && (DECL_CONSTRUCTOR_P (current_function_decl
)
7042 || DECL_DESTRUCTOR_P (current_function_decl
))
7043 && (complain
& tf_warning
))
7044 /* This is not an error, it is runtime undefined
7046 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
) ?
7047 "pure virtual %q#D called from constructor"
7048 : "pure virtual %q#D called from destructor"),
7051 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
7052 && is_dummy_object (instance_ptr
))
7054 if (complain
& tf_error
)
7055 error ("cannot call member function %qD without object",
7057 call
= error_mark_node
;
7061 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
7062 && resolves_to_fixed_type_p (instance
, 0))
7063 flags
|= LOOKUP_NONVIRTUAL
;
7064 /* Now we know what function is being called. */
7067 /* Build the actual CALL_EXPR. */
7068 call
= build_over_call (cand
, flags
, complain
);
7069 /* In an expression of the form `a->f()' where `f' turns
7070 out to be a static member function, `a' is
7071 none-the-less evaluated. */
7072 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
7073 && !is_dummy_object (instance_ptr
)
7074 && TREE_SIDE_EFFECTS (instance_ptr
))
7075 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
),
7076 instance_ptr
, call
);
7077 else if (call
!= error_mark_node
7078 && DECL_DESTRUCTOR_P (cand
->fn
)
7079 && !VOID_TYPE_P (TREE_TYPE (call
)))
7080 /* An explicit call of the form "x->~X()" has type
7081 "void". However, on platforms where destructors
7082 return "this" (i.e., those where
7083 targetm.cxx.cdtor_returns_this is true), such calls
7084 will appear to have a return value of pointer type
7085 to the low-level call machinery. We do not want to
7086 change the low-level machinery, since we want to be
7087 able to optimize "delete f()" on such platforms as
7088 "operator delete(~X(f()))" (rather than generating
7089 "t = f(), ~X(t), operator delete (t)"). */
7090 call
= build_nop (void_type_node
, call
);
7095 if (processing_template_decl
&& call
!= error_mark_node
)
7097 bool cast_to_void
= false;
7099 if (TREE_CODE (call
) == COMPOUND_EXPR
)
7100 call
= TREE_OPERAND (call
, 1);
7101 else if (TREE_CODE (call
) == NOP_EXPR
)
7103 cast_to_void
= true;
7104 call
= TREE_OPERAND (call
, 0);
7106 if (TREE_CODE (call
) == INDIRECT_REF
)
7107 call
= TREE_OPERAND (call
, 0);
7108 call
= (build_min_non_dep_call_vec
7110 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
7111 orig_instance
, orig_fns
, NULL_TREE
),
7113 call
= convert_from_reference (call
);
7115 call
= build_nop (void_type_node
, call
);
7118 /* Free all the conversions we allocated. */
7119 obstack_free (&conversion_obstack
, p
);
7121 if (orig_args
!= NULL
)
7122 release_tree_vector (orig_args
);
7127 /* Returns true iff standard conversion sequence ICS1 is a proper
7128 subsequence of ICS2. */
7131 is_subseq (conversion
*ics1
, conversion
*ics2
)
7133 /* We can assume that a conversion of the same code
7134 between the same types indicates a subsequence since we only get
7135 here if the types we are converting from are the same. */
7137 while (ics1
->kind
== ck_rvalue
7138 || ics1
->kind
== ck_lvalue
)
7139 ics1
= ics1
->u
.next
;
7143 while (ics2
->kind
== ck_rvalue
7144 || ics2
->kind
== ck_lvalue
)
7145 ics2
= ics2
->u
.next
;
7147 if (ics2
->kind
== ck_user
7148 || ics2
->kind
== ck_ambig
7149 || ics2
->kind
== ck_aggr
7150 || ics2
->kind
== ck_list
7151 || ics2
->kind
== ck_identity
)
7152 /* At this point, ICS1 cannot be a proper subsequence of
7153 ICS2. We can get a USER_CONV when we are comparing the
7154 second standard conversion sequence of two user conversion
7158 ics2
= ics2
->u
.next
;
7160 if (ics2
->kind
== ics1
->kind
7161 && same_type_p (ics2
->type
, ics1
->type
)
7162 && same_type_p (ics2
->u
.next
->type
,
7163 ics1
->u
.next
->type
))
7168 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
7169 be any _TYPE nodes. */
7172 is_properly_derived_from (tree derived
, tree base
)
7174 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
7177 /* We only allow proper derivation here. The DERIVED_FROM_P macro
7178 considers every class derived from itself. */
7179 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
7180 && DERIVED_FROM_P (base
, derived
));
7183 /* We build the ICS for an implicit object parameter as a pointer
7184 conversion sequence. However, such a sequence should be compared
7185 as if it were a reference conversion sequence. If ICS is the
7186 implicit conversion sequence for an implicit object parameter,
7187 modify it accordingly. */
7190 maybe_handle_implicit_object (conversion
**ics
)
7194 /* [over.match.funcs]
7196 For non-static member functions, the type of the
7197 implicit object parameter is "reference to cv X"
7198 where X is the class of which the function is a
7199 member and cv is the cv-qualification on the member
7200 function declaration. */
7201 conversion
*t
= *ics
;
7202 tree reference_type
;
7204 /* The `this' parameter is a pointer to a class type. Make the
7205 implicit conversion talk about a reference to that same class
7207 reference_type
= TREE_TYPE (t
->type
);
7208 reference_type
= build_reference_type (reference_type
);
7210 if (t
->kind
== ck_qual
)
7212 if (t
->kind
== ck_ptr
)
7214 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
7215 t
= direct_reference_binding (reference_type
, t
);
7217 t
->rvaluedness_matches_p
= 0;
7222 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
7223 and return the initial reference binding conversion. Otherwise,
7224 leave *ICS unchanged and return NULL. */
7227 maybe_handle_ref_bind (conversion
**ics
)
7229 if ((*ics
)->kind
== ck_ref_bind
)
7231 conversion
*old_ics
= *ics
;
7232 *ics
= old_ics
->u
.next
;
7233 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
7240 /* Compare two implicit conversion sequences according to the rules set out in
7241 [over.ics.rank]. Return values:
7243 1: ics1 is better than ics2
7244 -1: ics2 is better than ics1
7245 0: ics1 and ics2 are indistinguishable */
7248 compare_ics (conversion
*ics1
, conversion
*ics2
)
7254 tree deref_from_type1
= NULL_TREE
;
7255 tree deref_from_type2
= NULL_TREE
;
7256 tree deref_to_type1
= NULL_TREE
;
7257 tree deref_to_type2
= NULL_TREE
;
7258 conversion_rank rank1
, rank2
;
7260 /* REF_BINDING is nonzero if the result of the conversion sequence
7261 is a reference type. In that case REF_CONV is the reference
7262 binding conversion. */
7263 conversion
*ref_conv1
;
7264 conversion
*ref_conv2
;
7266 /* Handle implicit object parameters. */
7267 maybe_handle_implicit_object (&ics1
);
7268 maybe_handle_implicit_object (&ics2
);
7270 /* Handle reference parameters. */
7271 ref_conv1
= maybe_handle_ref_bind (&ics1
);
7272 ref_conv2
= maybe_handle_ref_bind (&ics2
);
7274 /* List-initialization sequence L1 is a better conversion sequence than
7275 list-initialization sequence L2 if L1 converts to
7276 std::initializer_list<X> for some X and L2 does not. */
7277 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
7279 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
7284 When comparing the basic forms of implicit conversion sequences (as
7285 defined in _over.best.ics_)
7287 --a standard conversion sequence (_over.ics.scs_) is a better
7288 conversion sequence than a user-defined conversion sequence
7289 or an ellipsis conversion sequence, and
7291 --a user-defined conversion sequence (_over.ics.user_) is a
7292 better conversion sequence than an ellipsis conversion sequence
7293 (_over.ics.ellipsis_). */
7294 rank1
= CONVERSION_RANK (ics1
);
7295 rank2
= CONVERSION_RANK (ics2
);
7299 else if (rank1
< rank2
)
7302 if (rank1
== cr_bad
)
7304 /* Both ICS are bad. We try to make a decision based on what would
7305 have happened if they'd been good. This is not an extension,
7306 we'll still give an error when we build up the call; this just
7307 helps us give a more helpful error message. */
7308 rank1
= BAD_CONVERSION_RANK (ics1
);
7309 rank2
= BAD_CONVERSION_RANK (ics2
);
7313 else if (rank1
< rank2
)
7316 /* We couldn't make up our minds; try to figure it out below. */
7319 if (ics1
->ellipsis_p
)
7320 /* Both conversions are ellipsis conversions. */
7323 /* User-defined conversion sequence U1 is a better conversion sequence
7324 than another user-defined conversion sequence U2 if they contain the
7325 same user-defined conversion operator or constructor and if the sec-
7326 ond standard conversion sequence of U1 is better than the second
7327 standard conversion sequence of U2. */
7329 /* Handle list-conversion with the same code even though it isn't always
7330 ranked as a user-defined conversion and it doesn't have a second
7331 standard conversion sequence; it will still have the desired effect.
7332 Specifically, we need to do the reference binding comparison at the
7333 end of this function. */
7335 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
)
7340 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= t1
->u
.next
)
7341 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
7342 || t1
->kind
== ck_list
)
7344 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= t2
->u
.next
)
7345 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
7346 || t2
->kind
== ck_list
)
7349 if (t1
->kind
!= t2
->kind
)
7351 else if (t1
->kind
== ck_user
)
7353 if (t1
->cand
->fn
!= t2
->cand
->fn
)
7358 /* For ambiguous or aggregate conversions, use the target type as
7359 a proxy for the conversion function. */
7360 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
7364 /* We can just fall through here, after setting up
7365 FROM_TYPE1 and FROM_TYPE2. */
7366 from_type1
= t1
->type
;
7367 from_type2
= t2
->type
;
7374 /* We're dealing with two standard conversion sequences.
7378 Standard conversion sequence S1 is a better conversion
7379 sequence than standard conversion sequence S2 if
7381 --S1 is a proper subsequence of S2 (comparing the conversion
7382 sequences in the canonical form defined by _over.ics.scs_,
7383 excluding any Lvalue Transformation; the identity
7384 conversion sequence is considered to be a subsequence of
7385 any non-identity conversion sequence */
7388 while (t1
->kind
!= ck_identity
)
7390 from_type1
= t1
->type
;
7393 while (t2
->kind
!= ck_identity
)
7395 from_type2
= t2
->type
;
7398 /* One sequence can only be a subsequence of the other if they start with
7399 the same type. They can start with different types when comparing the
7400 second standard conversion sequence in two user-defined conversion
7402 if (same_type_p (from_type1
, from_type2
))
7404 if (is_subseq (ics1
, ics2
))
7406 if (is_subseq (ics2
, ics1
))
7414 --the rank of S1 is better than the rank of S2 (by the rules
7417 Standard conversion sequences are ordered by their ranks: an Exact
7418 Match is a better conversion than a Promotion, which is a better
7419 conversion than a Conversion.
7421 Two conversion sequences with the same rank are indistinguishable
7422 unless one of the following rules applies:
7424 --A conversion that does not a convert a pointer, pointer to member,
7425 or std::nullptr_t to bool is better than one that does.
7427 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
7428 so that we do not have to check it explicitly. */
7429 if (ics1
->rank
< ics2
->rank
)
7431 else if (ics2
->rank
< ics1
->rank
)
7434 to_type1
= ics1
->type
;
7435 to_type2
= ics2
->type
;
7437 /* A conversion from scalar arithmetic type to complex is worse than a
7438 conversion between scalar arithmetic types. */
7439 if (same_type_p (from_type1
, from_type2
)
7440 && ARITHMETIC_TYPE_P (from_type1
)
7441 && ARITHMETIC_TYPE_P (to_type1
)
7442 && ARITHMETIC_TYPE_P (to_type2
)
7443 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
7444 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
7446 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
7452 if (TYPE_PTR_P (from_type1
)
7453 && TYPE_PTR_P (from_type2
)
7454 && TYPE_PTR_P (to_type1
)
7455 && TYPE_PTR_P (to_type2
))
7457 deref_from_type1
= TREE_TYPE (from_type1
);
7458 deref_from_type2
= TREE_TYPE (from_type2
);
7459 deref_to_type1
= TREE_TYPE (to_type1
);
7460 deref_to_type2
= TREE_TYPE (to_type2
);
7462 /* The rules for pointers to members A::* are just like the rules
7463 for pointers A*, except opposite: if B is derived from A then
7464 A::* converts to B::*, not vice versa. For that reason, we
7465 switch the from_ and to_ variables here. */
7466 else if ((TYPE_PTRMEM_P (from_type1
) && TYPE_PTRMEM_P (from_type2
)
7467 && TYPE_PTRMEM_P (to_type1
) && TYPE_PTRMEM_P (to_type2
))
7468 || (TYPE_PTRMEMFUNC_P (from_type1
)
7469 && TYPE_PTRMEMFUNC_P (from_type2
)
7470 && TYPE_PTRMEMFUNC_P (to_type1
)
7471 && TYPE_PTRMEMFUNC_P (to_type2
)))
7473 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
7474 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
7475 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
7476 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
7479 if (deref_from_type1
!= NULL_TREE
7480 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
7481 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
7483 /* This was one of the pointer or pointer-like conversions.
7487 --If class B is derived directly or indirectly from class A,
7488 conversion of B* to A* is better than conversion of B* to
7489 void*, and conversion of A* to void* is better than
7490 conversion of B* to void*. */
7491 if (TREE_CODE (deref_to_type1
) == VOID_TYPE
7492 && TREE_CODE (deref_to_type2
) == VOID_TYPE
)
7494 if (is_properly_derived_from (deref_from_type1
,
7497 else if (is_properly_derived_from (deref_from_type2
,
7501 else if (TREE_CODE (deref_to_type1
) == VOID_TYPE
7502 || TREE_CODE (deref_to_type2
) == VOID_TYPE
)
7504 if (same_type_p (deref_from_type1
, deref_from_type2
))
7506 if (TREE_CODE (deref_to_type2
) == VOID_TYPE
)
7508 if (is_properly_derived_from (deref_from_type1
,
7512 /* We know that DEREF_TO_TYPE1 is `void' here. */
7513 else if (is_properly_derived_from (deref_from_type1
,
7518 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
7519 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
7523 --If class B is derived directly or indirectly from class A
7524 and class C is derived directly or indirectly from B,
7526 --conversion of C* to B* is better than conversion of C* to
7529 --conversion of B* to A* is better than conversion of C* to
7531 if (same_type_p (deref_from_type1
, deref_from_type2
))
7533 if (is_properly_derived_from (deref_to_type1
,
7536 else if (is_properly_derived_from (deref_to_type2
,
7540 else if (same_type_p (deref_to_type1
, deref_to_type2
))
7542 if (is_properly_derived_from (deref_from_type2
,
7545 else if (is_properly_derived_from (deref_from_type1
,
7551 else if (CLASS_TYPE_P (non_reference (from_type1
))
7552 && same_type_p (from_type1
, from_type2
))
7554 tree from
= non_reference (from_type1
);
7558 --binding of an expression of type C to a reference of type
7559 B& is better than binding an expression of type C to a
7560 reference of type A&
7562 --conversion of C to B is better than conversion of C to A, */
7563 if (is_properly_derived_from (from
, to_type1
)
7564 && is_properly_derived_from (from
, to_type2
))
7566 if (is_properly_derived_from (to_type1
, to_type2
))
7568 else if (is_properly_derived_from (to_type2
, to_type1
))
7572 else if (CLASS_TYPE_P (non_reference (to_type1
))
7573 && same_type_p (to_type1
, to_type2
))
7575 tree to
= non_reference (to_type1
);
7579 --binding of an expression of type B to a reference of type
7580 A& is better than binding an expression of type C to a
7581 reference of type A&,
7583 --conversion of B to A is better than conversion of C to A */
7584 if (is_properly_derived_from (from_type1
, to
)
7585 && is_properly_derived_from (from_type2
, to
))
7587 if (is_properly_derived_from (from_type2
, from_type1
))
7589 else if (is_properly_derived_from (from_type1
, from_type2
))
7596 --S1 and S2 differ only in their qualification conversion and yield
7597 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
7598 qualification signature of type T1 is a proper subset of the cv-
7599 qualification signature of type T2 */
7600 if (ics1
->kind
== ck_qual
7601 && ics2
->kind
== ck_qual
7602 && same_type_p (from_type1
, from_type2
))
7604 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
7611 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
7612 to an implicit object parameter, and either S1 binds an lvalue reference
7613 to an lvalue and S2 binds an rvalue reference or S1 binds an rvalue
7614 reference to an rvalue and S2 binds an lvalue reference
7615 (C++0x draft standard, 13.3.3.2)
7617 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
7618 types to which the references refer are the same type except for
7619 top-level cv-qualifiers, and the type to which the reference
7620 initialized by S2 refers is more cv-qualified than the type to
7621 which the reference initialized by S1 refers */
7623 if (ref_conv1
&& ref_conv2
)
7625 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
7626 && (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
7627 != TYPE_REF_IS_RVALUE (ref_conv2
->type
)))
7629 if (ref_conv1
->rvaluedness_matches_p
)
7631 if (ref_conv2
->rvaluedness_matches_p
)
7635 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
7636 return comp_cv_qualification (TREE_TYPE (ref_conv2
->type
),
7637 TREE_TYPE (ref_conv1
->type
));
7640 /* Neither conversion sequence is better than the other. */
7644 /* The source type for this standard conversion sequence. */
7647 source_type (conversion
*t
)
7649 for (;; t
= t
->u
.next
)
7651 if (t
->kind
== ck_user
7652 || t
->kind
== ck_ambig
7653 || t
->kind
== ck_identity
)
7659 /* Note a warning about preferring WINNER to LOSER. We do this by storing
7660 a pointer to LOSER and re-running joust to produce the warning if WINNER
7661 is actually used. */
7664 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
7666 candidate_warning
*cw
= (candidate_warning
*)
7667 conversion_obstack_alloc (sizeof (candidate_warning
));
7669 cw
->next
= winner
->warnings
;
7670 winner
->warnings
= cw
;
7673 /* Compare two candidates for overloading as described in
7674 [over.match.best]. Return values:
7676 1: cand1 is better than cand2
7677 -1: cand2 is better than cand1
7678 0: cand1 and cand2 are indistinguishable */
7681 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
)
7684 int off1
= 0, off2
= 0;
7688 /* Candidates that involve bad conversions are always worse than those
7690 if (cand1
->viable
> cand2
->viable
)
7692 if (cand1
->viable
< cand2
->viable
)
7695 /* If we have two pseudo-candidates for conversions to the same type,
7696 or two candidates for the same function, arbitrarily pick one. */
7697 if (cand1
->fn
== cand2
->fn
7698 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
7701 /* a viable function F1
7702 is defined to be a better function than another viable function F2 if
7703 for all arguments i, ICSi(F1) is not a worse conversion sequence than
7704 ICSi(F2), and then */
7706 /* for some argument j, ICSj(F1) is a better conversion sequence than
7709 /* For comparing static and non-static member functions, we ignore
7710 the implicit object parameter of the non-static function. The
7711 standard says to pretend that the static function has an object
7712 parm, but that won't work with operator overloading. */
7713 len
= cand1
->num_convs
;
7714 if (len
!= cand2
->num_convs
)
7716 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
7717 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
7719 gcc_assert (static_1
!= static_2
);
7730 for (i
= 0; i
< len
; ++i
)
7732 conversion
*t1
= cand1
->convs
[i
+ off1
];
7733 conversion
*t2
= cand2
->convs
[i
+ off2
];
7734 int comp
= compare_ics (t1
, t2
);
7739 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
7740 == cr_std
+ cr_promotion
)
7741 && t1
->kind
== ck_std
7742 && t2
->kind
== ck_std
7743 && TREE_CODE (t1
->type
) == INTEGER_TYPE
7744 && TREE_CODE (t2
->type
) == INTEGER_TYPE
7745 && (TYPE_PRECISION (t1
->type
)
7746 == TYPE_PRECISION (t2
->type
))
7747 && (TYPE_UNSIGNED (t1
->u
.next
->type
)
7748 || (TREE_CODE (t1
->u
.next
->type
)
7751 tree type
= t1
->u
.next
->type
;
7753 struct z_candidate
*w
, *l
;
7755 type1
= t1
->type
, type2
= t2
->type
,
7756 w
= cand1
, l
= cand2
;
7758 type1
= t2
->type
, type2
= t1
->type
,
7759 w
= cand2
, l
= cand1
;
7763 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
7764 type
, type1
, type2
);
7765 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
7771 if (winner
&& comp
!= winner
)
7780 /* warn about confusing overload resolution for user-defined conversions,
7781 either between a constructor and a conversion op, or between two
7783 if (winner
&& warn_conversion
&& cand1
->second_conv
7784 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
7785 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
7787 struct z_candidate
*w
, *l
;
7788 bool give_warning
= false;
7791 w
= cand1
, l
= cand2
;
7793 w
= cand2
, l
= cand1
;
7795 /* We don't want to complain about `X::operator T1 ()'
7796 beating `X::operator T2 () const', when T2 is a no less
7797 cv-qualified version of T1. */
7798 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
7799 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
7801 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
7802 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
7804 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
7809 if (!comp_ptr_ttypes (t
, f
))
7810 give_warning
= true;
7813 give_warning
= true;
7819 tree source
= source_type (w
->convs
[0]);
7820 if (! DECL_CONSTRUCTOR_P (w
->fn
))
7821 source
= TREE_TYPE (source
);
7822 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
7823 && warning (OPT_Wconversion
, " for conversion from %qT to %qT",
7824 source
, w
->second_conv
->type
))
7826 inform (input_location
, " because conversion sequence for the argument is better");
7837 F1 is a non-template function and F2 is a template function
7840 if (!cand1
->template_decl
&& cand2
->template_decl
)
7842 else if (cand1
->template_decl
&& !cand2
->template_decl
)
7846 F1 and F2 are template functions and the function template for F1 is
7847 more specialized than the template for F2 according to the partial
7850 if (cand1
->template_decl
&& cand2
->template_decl
)
7852 winner
= more_specialized_fn
7853 (TI_TEMPLATE (cand1
->template_decl
),
7854 TI_TEMPLATE (cand2
->template_decl
),
7855 /* [temp.func.order]: The presence of unused ellipsis and default
7856 arguments has no effect on the partial ordering of function
7857 templates. add_function_candidate() will not have
7858 counted the "this" argument for constructors. */
7859 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
7865 the context is an initialization by user-defined conversion (see
7866 _dcl.init_ and _over.match.user_) and the standard conversion
7867 sequence from the return type of F1 to the destination type (i.e.,
7868 the type of the entity being initialized) is a better conversion
7869 sequence than the standard conversion sequence from the return type
7870 of F2 to the destination type. */
7872 if (cand1
->second_conv
)
7874 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
7879 /* Check whether we can discard a builtin candidate, either because we
7880 have two identical ones or matching builtin and non-builtin candidates.
7882 (Pedantically in the latter case the builtin which matched the user
7883 function should not be added to the overload set, but we spot it here.
7886 ... the builtin candidates include ...
7887 - do not have the same parameter type list as any non-template
7888 non-member candidate. */
7890 if (TREE_CODE (cand1
->fn
) == IDENTIFIER_NODE
7891 || TREE_CODE (cand2
->fn
) == IDENTIFIER_NODE
)
7893 for (i
= 0; i
< len
; ++i
)
7894 if (!same_type_p (cand1
->convs
[i
]->type
,
7895 cand2
->convs
[i
]->type
))
7897 if (i
== cand1
->num_convs
)
7899 if (cand1
->fn
== cand2
->fn
)
7900 /* Two built-in candidates; arbitrarily pick one. */
7902 else if (TREE_CODE (cand1
->fn
) == IDENTIFIER_NODE
)
7903 /* cand1 is built-in; prefer cand2. */
7906 /* cand2 is built-in; prefer cand1. */
7911 /* If the two function declarations represent the same function (this can
7912 happen with declarations in multiple scopes and arg-dependent lookup),
7913 arbitrarily choose one. But first make sure the default args we're
7915 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
7916 && equal_functions (cand1
->fn
, cand2
->fn
))
7918 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
7919 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
7921 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
7923 for (i
= 0; i
< len
; ++i
)
7925 /* Don't crash if the fn is variadic. */
7928 parms1
= TREE_CHAIN (parms1
);
7929 parms2
= TREE_CHAIN (parms2
);
7933 parms1
= TREE_CHAIN (parms1
);
7935 parms2
= TREE_CHAIN (parms2
);
7939 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
7940 TREE_PURPOSE (parms2
)))
7944 permerror (input_location
, "default argument mismatch in "
7945 "overload resolution");
7946 inform (input_location
,
7947 " candidate 1: %q+#F", cand1
->fn
);
7948 inform (input_location
,
7949 " candidate 2: %q+#F", cand2
->fn
);
7952 add_warning (cand1
, cand2
);
7955 parms1
= TREE_CHAIN (parms1
);
7956 parms2
= TREE_CHAIN (parms2
);
7964 /* Extension: If the worst conversion for one candidate is worse than the
7965 worst conversion for the other, take the first. */
7968 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
7969 struct z_candidate
*w
= 0, *l
= 0;
7971 for (i
= 0; i
< len
; ++i
)
7973 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
7974 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
7975 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
7976 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
7979 winner
= 1, w
= cand1
, l
= cand2
;
7981 winner
= -1, w
= cand2
, l
= cand1
;
7984 /* Don't choose a deleted function over ambiguity. */
7985 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
7989 pedwarn (input_location
, 0,
7990 "ISO C++ says that these are ambiguous, even "
7991 "though the worst conversion for the first is better than "
7992 "the worst conversion for the second:");
7993 print_z_candidate (_("candidate 1:"), w
);
7994 print_z_candidate (_("candidate 2:"), l
);
8002 gcc_assert (!winner
);
8006 /* Given a list of candidates for overloading, find the best one, if any.
8007 This algorithm has a worst case of O(2n) (winner is last), and a best
8008 case of O(n/2) (totally ambiguous); much better than a sorting
8011 static struct z_candidate
*
8012 tourney (struct z_candidate
*candidates
)
8014 struct z_candidate
*champ
= candidates
, *challenger
;
8016 int champ_compared_to_predecessor
= 0;
8018 /* Walk through the list once, comparing each current champ to the next
8019 candidate, knocking out a candidate or two with each comparison. */
8021 for (challenger
= champ
->next
; challenger
; )
8023 fate
= joust (champ
, challenger
, 0);
8025 challenger
= challenger
->next
;
8030 champ
= challenger
->next
;
8033 champ_compared_to_predecessor
= 0;
8038 champ_compared_to_predecessor
= 1;
8041 challenger
= champ
->next
;
8045 /* Make sure the champ is better than all the candidates it hasn't yet
8046 been compared to. */
8048 for (challenger
= candidates
;
8050 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
8051 challenger
= challenger
->next
)
8053 fate
= joust (champ
, challenger
, 0);
8061 /* Returns nonzero if things of type FROM can be converted to TO. */
8064 can_convert (tree to
, tree from
)
8066 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
);
8069 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
8072 can_convert_arg (tree to
, tree from
, tree arg
, int flags
)
8078 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8079 p
= conversion_obstack_alloc (0);
8081 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
8083 ok_p
= (t
&& !t
->bad_p
);
8085 /* Free all the conversions we allocated. */
8086 obstack_free (&conversion_obstack
, p
);
8091 /* Like can_convert_arg, but allows dubious conversions as well. */
8094 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
)
8099 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8100 p
= conversion_obstack_alloc (0);
8101 /* Try to perform the conversion. */
8102 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
8104 /* Free all the conversions we allocated. */
8105 obstack_free (&conversion_obstack
, p
);
8110 /* Convert EXPR to TYPE. Return the converted expression.
8112 Note that we allow bad conversions here because by the time we get to
8113 this point we are committed to doing the conversion. If we end up
8114 doing a bad conversion, convert_like will complain. */
8117 perform_implicit_conversion_flags (tree type
, tree expr
, tsubst_flags_t complain
, int flags
)
8122 if (error_operand_p (expr
))
8123 return error_mark_node
;
8125 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8126 p
= conversion_obstack_alloc (0);
8128 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
8134 if (complain
& tf_error
)
8136 /* If expr has unknown type, then it is an overloaded function.
8137 Call instantiate_type to get good error messages. */
8138 if (TREE_TYPE (expr
) == unknown_type_node
)
8139 instantiate_type (type
, expr
, complain
);
8140 else if (invalid_nonstatic_memfn_p (expr
, complain
))
8141 /* We gave an error. */;
8143 error ("could not convert %qE to %qT", expr
, type
);
8145 expr
= error_mark_node
;
8147 else if (processing_template_decl
)
8149 /* In a template, we are only concerned about determining the
8150 type of non-dependent expressions, so we do not have to
8151 perform the actual conversion. */
8152 if (TREE_TYPE (expr
) != type
)
8153 expr
= build_nop (type
, expr
);
8156 expr
= convert_like (conv
, expr
, complain
);
8158 /* Free all the conversions we allocated. */
8159 obstack_free (&conversion_obstack
, p
);
8165 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
8167 return perform_implicit_conversion_flags (type
, expr
, complain
, LOOKUP_IMPLICIT
);
8170 /* Convert EXPR to TYPE (as a direct-initialization) if that is
8171 permitted. If the conversion is valid, the converted expression is
8172 returned. Otherwise, NULL_TREE is returned, except in the case
8173 that TYPE is a class type; in that case, an error is issued. If
8174 C_CAST_P is true, then this direction initialization is taking
8175 place as part of a static_cast being attempted as part of a C-style
8179 perform_direct_initialization_if_possible (tree type
,
8182 tsubst_flags_t complain
)
8187 if (type
== error_mark_node
|| error_operand_p (expr
))
8188 return error_mark_node
;
8191 If the destination type is a (possibly cv-qualified) class type:
8193 -- If the initialization is direct-initialization ...,
8194 constructors are considered. ... If no constructor applies, or
8195 the overload resolution is ambiguous, the initialization is
8197 if (CLASS_TYPE_P (type
))
8199 VEC(tree
,gc
) *args
= make_tree_vector_single (expr
);
8200 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
8201 &args
, type
, LOOKUP_NORMAL
, complain
);
8202 release_tree_vector (args
);
8203 return build_cplus_new (type
, expr
, complain
);
8206 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8207 p
= conversion_obstack_alloc (0);
8209 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
8212 if (!conv
|| conv
->bad_p
)
8215 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0, 0,
8216 /*issue_conversion_warnings=*/false,
8220 /* Free all the conversions we allocated. */
8221 obstack_free (&conversion_obstack
, p
);
8226 /* DECL is a VAR_DECL whose type is a REFERENCE_TYPE. The reference
8227 is being bound to a temporary. Create and return a new VAR_DECL
8228 with the indicated TYPE; this variable will store the value to
8229 which the reference is bound. */
8232 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
8236 /* Create the variable. */
8237 var
= create_temporary_var (type
);
8239 /* Register the variable. */
8240 if (TREE_STATIC (decl
))
8242 /* Namespace-scope or local static; give it a mangled name. */
8245 TREE_STATIC (var
) = 1;
8246 name
= mangle_ref_init_variable (decl
);
8247 DECL_NAME (var
) = name
;
8248 SET_DECL_ASSEMBLER_NAME (var
, name
);
8249 var
= pushdecl_top_level (var
);
8252 /* Create a new cleanup level if necessary. */
8253 maybe_push_cleanup_level (type
);
8258 /* EXPR is the initializer for a variable DECL of reference or
8259 std::initializer_list type. Create, push and return a new VAR_DECL
8260 for the initializer so that it will live as long as DECL. Any
8261 cleanup for the new variable is returned through CLEANUP, and the
8262 code to initialize the new variable is returned through INITP. */
8265 set_up_extended_ref_temp (tree decl
, tree expr
, tree
*cleanup
, tree
*initp
)
8271 /* Create the temporary variable. */
8272 type
= TREE_TYPE (expr
);
8273 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
8274 layout_decl (var
, 0);
8275 /* If the rvalue is the result of a function call it will be
8276 a TARGET_EXPR. If it is some other construct (such as a
8277 member access expression where the underlying object is
8278 itself the result of a function call), turn it into a
8279 TARGET_EXPR here. It is important that EXPR be a
8280 TARGET_EXPR below since otherwise the INIT_EXPR will
8281 attempt to make a bitwise copy of EXPR to initialize
8283 if (TREE_CODE (expr
) != TARGET_EXPR
)
8284 expr
= get_target_expr (expr
);
8286 /* If the initializer is constant, put it in DECL_INITIAL so we get
8287 static initialization and use in constant expressions. */
8288 init
= maybe_constant_init (expr
);
8289 if (TREE_CONSTANT (init
))
8291 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
8293 /* 5.19 says that a constant expression can include an
8294 lvalue-rvalue conversion applied to "a glvalue of literal type
8295 that refers to a non-volatile temporary object initialized
8296 with a constant expression". Rather than try to communicate
8297 that this VAR_DECL is a temporary, just mark it constexpr.
8299 Currently this is only useful for initializer_list temporaries,
8300 since reference vars can't appear in constant expressions. */
8301 DECL_DECLARED_CONSTEXPR_P (var
) = true;
8302 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
8303 TREE_CONSTANT (var
) = true;
8305 DECL_INITIAL (var
) = init
;
8309 /* Create the INIT_EXPR that will initialize the temporary
8311 init
= build2 (INIT_EXPR
, type
, var
, expr
);
8312 if (at_function_scope_p ())
8314 add_decl_expr (var
);
8316 if (TREE_STATIC (var
))
8317 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
8319 *cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
8321 /* We must be careful to destroy the temporary only
8322 after its initialization has taken place. If the
8323 initialization throws an exception, then the
8324 destructor should not be run. We cannot simply
8325 transform INIT into something like:
8327 (INIT, ({ CLEANUP_STMT; }))
8329 because emit_local_var always treats the
8330 initializer as a full-expression. Thus, the
8331 destructor would run too early; it would run at the
8332 end of initializing the reference variable, rather
8333 than at the end of the block enclosing the
8336 The solution is to pass back a cleanup expression
8337 which the caller is responsible for attaching to
8338 the statement tree. */
8342 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
8343 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8344 static_aggregates
= tree_cons (NULL_TREE
, var
,
8352 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
8353 initializing a variable of that TYPE. If DECL is non-NULL, it is
8354 the VAR_DECL being initialized with the EXPR. (In that case, the
8355 type of DECL will be TYPE.) If DECL is non-NULL, then CLEANUP must
8356 also be non-NULL, and with *CLEANUP initialized to NULL. Upon
8357 return, if *CLEANUP is no longer NULL, it will be an expression
8358 that should be pushed as a cleanup after the returned expression
8359 is used to initialize DECL.
8361 Return the converted expression. */
8364 initialize_reference (tree type
, tree expr
, tree decl
, tree
*cleanup
,
8365 tsubst_flags_t complain
)
8370 if (type
== error_mark_node
|| error_operand_p (expr
))
8371 return error_mark_node
;
8373 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8374 p
= conversion_obstack_alloc (0);
8376 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
8378 if (!conv
|| conv
->bad_p
)
8380 if (complain
& tf_error
)
8382 if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
8383 && !TYPE_REF_IS_RVALUE (type
)
8384 && !real_lvalue_p (expr
))
8385 error ("invalid initialization of non-const reference of "
8386 "type %qT from an rvalue of type %qT",
8387 type
, TREE_TYPE (expr
));
8389 error ("invalid initialization of reference of type "
8390 "%qT from expression of type %qT", type
,
8393 return error_mark_node
;
8396 /* If DECL is non-NULL, then this special rule applies:
8400 The temporary to which the reference is bound or the temporary
8401 that is the complete object to which the reference is bound
8402 persists for the lifetime of the reference.
8404 The temporaries created during the evaluation of the expression
8405 initializing the reference, except the temporary to which the
8406 reference is bound, are destroyed at the end of the
8407 full-expression in which they are created.
8409 In that case, we store the converted expression into a new
8410 VAR_DECL in a new scope.
8412 However, we want to be careful not to create temporaries when
8413 they are not required. For example, given:
8416 struct D : public B {};
8420 there is no need to copy the return value from "f"; we can just
8421 extend its lifetime. Similarly, given:
8424 struct T { operator S(); };
8428 we can extend the lifetime of the return value of the conversion
8430 gcc_assert (conv
->kind
== ck_ref_bind
);
8434 tree base_conv_type
;
8436 /* Skip over the REF_BIND. */
8437 conv
= conv
->u
.next
;
8438 /* If the next conversion is a BASE_CONV, skip that too -- but
8439 remember that the conversion was required. */
8440 if (conv
->kind
== ck_base
)
8442 base_conv_type
= conv
->type
;
8443 conv
= conv
->u
.next
;
8446 base_conv_type
= NULL_TREE
;
8447 /* Perform the remainder of the conversion. */
8448 expr
= convert_like_real (conv
, expr
,
8449 /*fn=*/NULL_TREE
, /*argnum=*/0,
8451 /*issue_conversion_warnings=*/true,
8453 tf_warning_or_error
);
8454 if (error_operand_p (expr
))
8455 expr
= error_mark_node
;
8458 if (!lvalue_or_rvalue_with_address_p (expr
))
8461 var
= set_up_extended_ref_temp (decl
, expr
, cleanup
, &init
);
8462 /* Use its address to initialize the reference variable. */
8463 expr
= build_address (var
);
8465 expr
= convert_to_base (expr
,
8466 build_pointer_type (base_conv_type
),
8467 /*check_access=*/true,
8468 /*nonnull=*/true, complain
);
8470 expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr
), init
, expr
);
8473 /* Take the address of EXPR. */
8474 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
8475 /* If a BASE_CONV was required, perform it now. */
8477 expr
= (perform_implicit_conversion
8478 (build_pointer_type (base_conv_type
), expr
,
8479 tf_warning_or_error
));
8480 expr
= build_nop (type
, expr
);
8484 /* Perform the conversion. */
8485 expr
= convert_like (conv
, expr
, tf_warning_or_error
);
8487 /* Free all the conversions we allocated. */
8488 obstack_free (&conversion_obstack
, p
);
8493 /* Returns true iff TYPE is some variant of std::initializer_list. */
8496 is_std_init_list (tree type
)
8498 /* Look through typedefs. */
8501 type
= TYPE_MAIN_VARIANT (type
);
8502 return (CLASS_TYPE_P (type
)
8503 && CP_TYPE_CONTEXT (type
) == std_node
8504 && strcmp (TYPE_NAME_STRING (type
), "initializer_list") == 0);
8507 /* Returns true iff DECL is a list constructor: i.e. a constructor which
8508 will accept an argument list of a single std::initializer_list<T>. */
8511 is_list_ctor (tree decl
)
8513 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
8516 if (!args
|| args
== void_list_node
)
8519 arg
= non_reference (TREE_VALUE (args
));
8520 if (!is_std_init_list (arg
))
8523 args
= TREE_CHAIN (args
);
8525 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
8526 /* There are more non-defaulted parms. */
8532 #include "gt-cp-call.h"