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
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"
38 #include "diagnostic.h"
42 #include "langhooks.h"
44 /* The various kinds of conversion. */
46 typedef enum conversion_kind
{
62 /* The rank of the conversion. Order of the enumerals matters; better
63 conversions should come earlier in the list. */
65 typedef enum conversion_rank
{
76 /* An implicit conversion sequence, in the sense of [over.best.ics].
77 The first conversion to be performed is at the end of the chain.
78 That conversion is always a cr_identity conversion. */
80 typedef struct conversion conversion
;
82 /* The kind of conversion represented by this step. */
84 /* The rank of this conversion. */
86 BOOL_BITFIELD user_conv_p
: 1;
87 BOOL_BITFIELD ellipsis_p
: 1;
88 BOOL_BITFIELD this_p
: 1;
89 BOOL_BITFIELD bad_p
: 1;
90 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
91 temporary should be created to hold the result of the
93 BOOL_BITFIELD need_temporary_p
: 1;
94 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
95 from a pointer-to-derived to pointer-to-base is being performed. */
96 BOOL_BITFIELD base_p
: 1;
97 /* If KIND is ck_ref_bind, true when either an lvalue reference is
98 being bound to an lvalue expression or an rvalue reference is
99 being bound to an rvalue expression. */
100 BOOL_BITFIELD rvaluedness_matches_p
: 1;
101 BOOL_BITFIELD check_narrowing
: 1;
102 /* The type of the expression resulting from the conversion. */
105 /* The next conversion in the chain. Since the conversions are
106 arranged from outermost to innermost, the NEXT conversion will
107 actually be performed before this conversion. This variant is
108 used only when KIND is neither ck_identity nor ck_ambig. */
110 /* The expression at the beginning of the conversion chain. This
111 variant is used only if KIND is ck_identity or ck_ambig. */
113 /* The array of conversions for an initializer_list. */
116 /* The function candidate corresponding to this conversion
117 sequence. This field is only used if KIND is ck_user. */
118 struct z_candidate
*cand
;
121 #define CONVERSION_RANK(NODE) \
122 ((NODE)->bad_p ? cr_bad \
123 : (NODE)->ellipsis_p ? cr_ellipsis \
124 : (NODE)->user_conv_p ? cr_user \
127 static struct obstack conversion_obstack
;
128 static bool conversion_obstack_initialized
;
130 static struct z_candidate
* tourney (struct z_candidate
*);
131 static int equal_functions (tree
, tree
);
132 static int joust (struct z_candidate
*, struct z_candidate
*, bool);
133 static int compare_ics (conversion
*, conversion
*);
134 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
135 static tree
build_java_interface_fn_ref (tree
, tree
);
136 #define convert_like(CONV, EXPR, COMPLAIN) \
137 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
138 /*issue_conversion_warnings=*/true, \
139 /*c_cast_p=*/false, (COMPLAIN))
140 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
141 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
142 /*issue_conversion_warnings=*/true, \
143 /*c_cast_p=*/false, (COMPLAIN))
144 static tree
convert_like_real (conversion
*, tree
, tree
, int, int, bool,
145 bool, tsubst_flags_t
);
146 static void op_error (enum tree_code
, enum tree_code
, tree
, tree
,
148 static VEC(tree
,gc
) *resolve_args (VEC(tree
,gc
) *);
149 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int);
150 static void print_z_candidate (const char *, struct z_candidate
*);
151 static void print_z_candidates (struct z_candidate
*);
152 static tree
build_this (tree
);
153 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
154 static bool any_strictly_viable (struct z_candidate
*);
155 static struct z_candidate
*add_template_candidate
156 (struct z_candidate
**, tree
, tree
, tree
, tree
, const VEC(tree
,gc
) *,
157 tree
, tree
, tree
, int, unification_kind_t
);
158 static struct z_candidate
*add_template_candidate_real
159 (struct z_candidate
**, tree
, tree
, tree
, tree
, const VEC(tree
,gc
) *,
160 tree
, tree
, tree
, int, tree
, unification_kind_t
);
161 static struct z_candidate
*add_template_conv_candidate
162 (struct z_candidate
**, tree
, tree
, tree
, const VEC(tree
,gc
) *, tree
,
164 static void add_builtin_candidates
165 (struct z_candidate
**, enum tree_code
, enum tree_code
,
167 static void add_builtin_candidate
168 (struct z_candidate
**, enum tree_code
, enum tree_code
,
169 tree
, tree
, tree
, tree
*, tree
*, int);
170 static bool is_complete (tree
);
171 static void build_builtin_candidate
172 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
174 static struct z_candidate
*add_conv_candidate
175 (struct z_candidate
**, tree
, tree
, tree
, const VEC(tree
,gc
) *, tree
,
177 static struct z_candidate
*add_function_candidate
178 (struct z_candidate
**, tree
, tree
, tree
, const VEC(tree
,gc
) *, tree
,
180 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int);
181 static conversion
*standard_conversion (tree
, tree
, tree
, bool, int);
182 static conversion
*reference_binding (tree
, tree
, tree
, bool, int);
183 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
184 static conversion
*build_list_conv (tree
, tree
, int);
185 static bool is_subseq (conversion
*, conversion
*);
186 static conversion
*maybe_handle_ref_bind (conversion
**);
187 static void maybe_handle_implicit_object (conversion
**);
188 static struct z_candidate
*add_candidate
189 (struct z_candidate
**, tree
, tree
, const VEC(tree
,gc
) *, size_t,
190 conversion
**, tree
, tree
, int);
191 static tree
source_type (conversion
*);
192 static void add_warning (struct z_candidate
*, struct z_candidate
*);
193 static bool reference_compatible_p (tree
, tree
);
194 static conversion
*convert_class_to_reference (tree
, tree
, tree
, int);
195 static conversion
*direct_reference_binding (tree
, conversion
*);
196 static bool promoted_arithmetic_type_p (tree
);
197 static conversion
*conditional_conversion (tree
, tree
);
198 static char *name_as_c_string (tree
, tree
, bool *);
199 static tree
prep_operand (tree
);
200 static void add_candidates (tree
, const VEC(tree
,gc
) *, tree
, bool, tree
, tree
,
201 int, struct z_candidate
**);
202 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
203 static bool magic_varargs_p (tree
);
204 static tree
build_temp (tree
, tree
, int, diagnostic_t
*);
206 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
207 NAME can take many forms... */
210 check_dtor_name (tree basetype
, tree name
)
212 /* Just accept something we've already complained about. */
213 if (name
== error_mark_node
)
216 if (TREE_CODE (name
) == TYPE_DECL
)
217 name
= TREE_TYPE (name
);
218 else if (TYPE_P (name
))
220 else if (TREE_CODE (name
) == IDENTIFIER_NODE
)
222 if ((MAYBE_CLASS_TYPE_P (basetype
)
223 && name
== constructor_name (basetype
))
224 || (TREE_CODE (basetype
) == ENUMERAL_TYPE
225 && name
== TYPE_IDENTIFIER (basetype
)))
228 name
= get_type_value (name
);
234 template <class T> struct S { ~S(); };
238 NAME will be a class template. */
239 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
243 if (!name
|| name
== error_mark_node
)
245 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
248 /* We want the address of a function or method. We avoid creating a
249 pointer-to-member function. */
252 build_addr_func (tree function
)
254 tree type
= TREE_TYPE (function
);
256 /* We have to do these by hand to avoid real pointer to member
258 if (TREE_CODE (type
) == METHOD_TYPE
)
260 if (TREE_CODE (function
) == OFFSET_REF
)
262 tree object
= build_address (TREE_OPERAND (function
, 0));
263 return get_member_function_from_ptrfunc (&object
,
264 TREE_OPERAND (function
, 1));
266 function
= build_address (function
);
269 function
= decay_conversion (function
);
274 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
275 POINTER_TYPE to those. Note, pointer to member function types
276 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
277 two variants. build_call_a is the primitive taking an array of
278 arguments, while build_call_n is a wrapper that handles varargs. */
281 build_call_n (tree function
, int n
, ...)
284 return build_call_a (function
, 0, NULL
);
287 tree
*argarray
= (tree
*) alloca (n
* sizeof (tree
));
292 for (i
= 0; i
< n
; i
++)
293 argarray
[i
] = va_arg (ap
, tree
);
295 return build_call_a (function
, n
, argarray
);
300 build_call_a (tree function
, int n
, tree
*argarray
)
302 int is_constructor
= 0;
309 function
= build_addr_func (function
);
311 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
312 fntype
= TREE_TYPE (TREE_TYPE (function
));
313 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
314 || TREE_CODE (fntype
) == METHOD_TYPE
);
315 result_type
= TREE_TYPE (fntype
);
316 /* An rvalue has no cv-qualifiers. */
317 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
318 result_type
= cv_unqualified (result_type
);
320 if (TREE_CODE (function
) == ADDR_EXPR
321 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
323 decl
= TREE_OPERAND (function
, 0);
324 if (!TREE_USED (decl
))
326 /* We invoke build_call directly for several library
327 functions. These may have been declared normally if
328 we're building libgcc, so we can't just check
330 gcc_assert (DECL_ARTIFICIAL (decl
)
331 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
339 /* We check both the decl and the type; a function may be known not to
340 throw without being declared throw(). */
341 nothrow
= ((decl
&& TREE_NOTHROW (decl
))
342 || TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (function
))));
344 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
345 current_function_returns_abnormally
= 1;
347 if (decl
&& TREE_DEPRECATED (decl
))
348 warn_deprecated_use (decl
, NULL_TREE
);
349 require_complete_eh_spec_types (fntype
, decl
);
351 if (decl
&& DECL_CONSTRUCTOR_P (decl
))
354 /* Don't pass empty class objects by value. This is useful
355 for tags in STL, which are used to control overload resolution.
356 We don't need to handle other cases of copying empty classes. */
357 if (! decl
|| ! DECL_BUILT_IN (decl
))
358 for (i
= 0; i
< n
; i
++)
359 if (is_empty_class (TREE_TYPE (argarray
[i
]))
360 && ! TREE_ADDRESSABLE (TREE_TYPE (argarray
[i
])))
362 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (argarray
[i
]));
363 argarray
[i
] = build2 (COMPOUND_EXPR
, TREE_TYPE (t
),
367 function
= build_call_array_loc (input_location
,
368 result_type
, function
, n
, argarray
);
369 TREE_HAS_CONSTRUCTOR (function
) = is_constructor
;
370 TREE_NOTHROW (function
) = nothrow
;
375 /* Build something of the form ptr->method (args)
376 or object.method (args). This can also build
377 calls to constructors, and find friends.
379 Member functions always take their class variable
382 INSTANCE is a class instance.
384 NAME is the name of the method desired, usually an IDENTIFIER_NODE.
386 PARMS help to figure out what that NAME really refers to.
388 BASETYPE_PATH, if non-NULL, contains a chain from the type of INSTANCE
389 down to the real instance type to use for access checking. We need this
390 information to get protected accesses correct.
392 FLAGS is the logical disjunction of zero or more LOOKUP_
393 flags. See cp-tree.h for more info.
395 If this is all OK, calls build_function_call with the resolved
398 This function must also handle being called to perform
399 initialization, promotion/coercion of arguments, and
400 instantiation of default parameters.
402 Note that NAME may refer to an instance variable name. If
403 `operator()()' is defined for the type of that field, then we return
406 /* New overloading code. */
408 typedef struct z_candidate z_candidate
;
410 typedef struct candidate_warning candidate_warning
;
411 struct candidate_warning
{
413 candidate_warning
*next
;
417 /* The FUNCTION_DECL that will be called if this candidate is
418 selected by overload resolution. */
420 /* If not NULL_TREE, the first argument to use when calling this
423 /* The rest of the arguments to use when calling this function. If
424 there are no further arguments this may be NULL or it may be an
426 const VEC(tree
,gc
) *args
;
427 /* The implicit conversion sequences for each of the arguments to
430 /* The number of implicit conversion sequences. */
432 /* If FN is a user-defined conversion, the standard conversion
433 sequence from the type returned by FN to the desired destination
435 conversion
*second_conv
;
437 /* If FN is a member function, the binfo indicating the path used to
438 qualify the name of FN at the call site. This path is used to
439 determine whether or not FN is accessible if it is selected by
440 overload resolution. The DECL_CONTEXT of FN will always be a
441 (possibly improper) base of this binfo. */
443 /* If FN is a non-static member function, the binfo indicating the
444 subobject to which the `this' pointer should be converted if FN
445 is selected by overload resolution. The type pointed to the by
446 the `this' pointer must correspond to the most derived class
447 indicated by the CONVERSION_PATH. */
448 tree conversion_path
;
450 candidate_warning
*warnings
;
454 /* Returns true iff T is a null pointer constant in the sense of
458 null_ptr_cst_p (tree t
)
462 A null pointer constant is an integral constant expression
463 (_expr.const_) rvalue of integer type that evaluates to zero. */
464 t
= integral_constant_value (t
);
467 if (CP_INTEGRAL_TYPE_P (TREE_TYPE (t
)) && integer_zerop (t
))
470 if (!TREE_OVERFLOW (t
))
476 /* Returns nonzero if PARMLIST consists of only default parms and/or
480 sufficient_parms_p (const_tree parmlist
)
482 for (; parmlist
&& parmlist
!= void_list_node
;
483 parmlist
= TREE_CHAIN (parmlist
))
484 if (!TREE_PURPOSE (parmlist
))
489 /* Allocate N bytes of memory from the conversion obstack. The memory
490 is zeroed before being returned. */
493 conversion_obstack_alloc (size_t n
)
496 if (!conversion_obstack_initialized
)
498 gcc_obstack_init (&conversion_obstack
);
499 conversion_obstack_initialized
= true;
501 p
= obstack_alloc (&conversion_obstack
, n
);
506 /* Dynamically allocate a conversion. */
509 alloc_conversion (conversion_kind kind
)
512 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
517 #ifdef ENABLE_CHECKING
519 /* Make sure that all memory on the conversion obstack has been
523 validate_conversion_obstack (void)
525 if (conversion_obstack_initialized
)
526 gcc_assert ((obstack_next_free (&conversion_obstack
)
527 == obstack_base (&conversion_obstack
)));
530 #endif /* ENABLE_CHECKING */
532 /* Dynamically allocate an array of N conversions. */
535 alloc_conversions (size_t n
)
537 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
541 build_conv (conversion_kind code
, tree type
, conversion
*from
)
544 conversion_rank rank
= CONVERSION_RANK (from
);
546 /* Note that the caller is responsible for filling in t->cand for
547 user-defined conversions. */
548 t
= alloc_conversion (code
);
571 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
572 t
->bad_p
= from
->bad_p
;
577 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
578 specialization of std::initializer_list<T>, if such a conversion is
582 build_list_conv (tree type
, tree ctor
, int flags
)
584 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
585 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
586 conversion
**subconvs
= alloc_conversions (len
);
591 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
594 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
602 t
= alloc_conversion (ck_list
);
604 t
->u
.list
= subconvs
;
607 for (i
= 0; i
< len
; ++i
)
609 conversion
*sub
= subconvs
[i
];
610 if (sub
->rank
> t
->rank
)
612 if (sub
->user_conv_p
)
613 t
->user_conv_p
= true;
621 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
622 aggregate class, if such a conversion is possible. */
625 build_aggr_conv (tree type
, tree ctor
, int flags
)
627 unsigned HOST_WIDE_INT i
= 0;
629 tree field
= TYPE_FIELDS (type
);
631 for (; field
; field
= TREE_CHAIN (field
), ++i
)
633 if (TREE_CODE (field
) != FIELD_DECL
)
635 if (i
< CONSTRUCTOR_NELTS (ctor
))
637 constructor_elt
*ce
= CONSTRUCTOR_ELT (ctor
, i
);
638 if (!can_convert_arg (TREE_TYPE (field
), TREE_TYPE (ce
->value
),
642 else if (build_value_init (TREE_TYPE (field
)) == error_mark_node
)
646 c
= alloc_conversion (ck_aggr
);
649 c
->user_conv_p
= true;
654 /* Build a representation of the identity conversion from EXPR to
655 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
658 build_identity_conv (tree type
, tree expr
)
662 c
= alloc_conversion (ck_identity
);
669 /* Converting from EXPR to TYPE was ambiguous in the sense that there
670 were multiple user-defined conversions to accomplish the job.
671 Build a conversion that indicates that ambiguity. */
674 build_ambiguous_conv (tree type
, tree expr
)
678 c
= alloc_conversion (ck_ambig
);
686 strip_top_quals (tree t
)
688 if (TREE_CODE (t
) == ARRAY_TYPE
)
690 return cp_build_qualified_type (t
, 0);
693 /* Returns the standard conversion path (see [conv]) from type FROM to type
694 TO, if any. For proper handling of null pointer constants, you must
695 also pass the expression EXPR to convert from. If C_CAST_P is true,
696 this conversion is coming from a C-style cast. */
699 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
702 enum tree_code fcode
, tcode
;
704 bool fromref
= false;
706 to
= non_reference (to
);
707 if (TREE_CODE (from
) == REFERENCE_TYPE
)
710 from
= TREE_TYPE (from
);
712 to
= strip_top_quals (to
);
713 from
= strip_top_quals (from
);
715 if ((TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
716 && expr
&& type_unknown_p (expr
))
718 tsubst_flags_t tflags
= tf_conv
;
719 if (!(flags
& LOOKUP_PROTECT
))
720 tflags
|= tf_no_access_control
;
721 expr
= instantiate_type (to
, expr
, tflags
);
722 if (expr
== error_mark_node
)
724 from
= TREE_TYPE (expr
);
727 fcode
= TREE_CODE (from
);
728 tcode
= TREE_CODE (to
);
730 conv
= build_identity_conv (from
, expr
);
731 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
733 from
= type_decays_to (from
);
734 fcode
= TREE_CODE (from
);
735 conv
= build_conv (ck_lvalue
, from
, conv
);
737 else if (fromref
|| (expr
&& lvalue_p (expr
)))
742 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
745 from
= strip_top_quals (bitfield_type
);
746 fcode
= TREE_CODE (from
);
749 conv
= build_conv (ck_rvalue
, from
, conv
);
752 /* Allow conversion between `__complex__' data types. */
753 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
755 /* The standard conversion sequence to convert FROM to TO is
756 the standard conversion sequence to perform componentwise
758 conversion
*part_conv
= standard_conversion
759 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
);
763 conv
= build_conv (part_conv
->kind
, to
, conv
);
764 conv
->rank
= part_conv
->rank
;
772 if (same_type_p (from
, to
))
775 if ((tcode
== POINTER_TYPE
|| TYPE_PTR_TO_MEMBER_P (to
))
776 && expr
&& null_ptr_cst_p (expr
))
777 conv
= build_conv (ck_std
, to
, conv
);
778 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
779 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
781 /* For backwards brain damage compatibility, allow interconversion of
782 pointers and integers with a pedwarn. */
783 conv
= build_conv (ck_std
, to
, conv
);
786 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
788 /* For backwards brain damage compatibility, allow interconversion of
789 enums and integers with a pedwarn. */
790 conv
= build_conv (ck_std
, to
, conv
);
793 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
794 || (TYPE_PTRMEM_P (to
) && TYPE_PTRMEM_P (from
)))
799 if (tcode
== POINTER_TYPE
800 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from
),
803 else if (VOID_TYPE_P (TREE_TYPE (to
))
804 && !TYPE_PTRMEM_P (from
)
805 && TREE_CODE (TREE_TYPE (from
)) != FUNCTION_TYPE
)
807 from
= build_pointer_type
808 (cp_build_qualified_type (void_type_node
,
809 cp_type_quals (TREE_TYPE (from
))));
810 conv
= build_conv (ck_ptr
, from
, conv
);
812 else if (TYPE_PTRMEM_P (from
))
814 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
815 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
817 if (DERIVED_FROM_P (fbase
, tbase
)
818 && (same_type_ignoring_top_level_qualifiers_p
819 (TYPE_PTRMEM_POINTED_TO_TYPE (from
),
820 TYPE_PTRMEM_POINTED_TO_TYPE (to
))))
822 from
= build_ptrmem_type (tbase
,
823 TYPE_PTRMEM_POINTED_TO_TYPE (from
));
824 conv
= build_conv (ck_pmem
, from
, conv
);
826 else if (!same_type_p (fbase
, tbase
))
829 else if (CLASS_TYPE_P (TREE_TYPE (from
))
830 && CLASS_TYPE_P (TREE_TYPE (to
))
833 An rvalue of type "pointer to cv D," where D is a
834 class type, can be converted to an rvalue of type
835 "pointer to cv B," where B is a base class (clause
836 _class.derived_) of D. If B is an inaccessible
837 (clause _class.access_) or ambiguous
838 (_class.member.lookup_) base class of D, a program
839 that necessitates this conversion is ill-formed.
840 Therefore, we use DERIVED_FROM_P, and do not check
841 access or uniqueness. */
842 && DERIVED_FROM_P (TREE_TYPE (to
), TREE_TYPE (from
)))
845 cp_build_qualified_type (TREE_TYPE (to
),
846 cp_type_quals (TREE_TYPE (from
)));
847 from
= build_pointer_type (from
);
848 conv
= build_conv (ck_ptr
, from
, conv
);
852 if (tcode
== POINTER_TYPE
)
854 to_pointee
= TREE_TYPE (to
);
855 from_pointee
= TREE_TYPE (from
);
859 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
860 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
863 if (same_type_p (from
, to
))
865 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
866 /* In a C-style cast, we ignore CV-qualification because we
867 are allowed to perform a static_cast followed by a
869 conv
= build_conv (ck_qual
, to
, conv
);
870 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
871 conv
= build_conv (ck_qual
, to
, conv
);
872 else if (expr
&& string_conv_p (to
, expr
, 0))
873 /* converting from string constant to char *. */
874 conv
= build_conv (ck_qual
, to
, conv
);
875 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
877 conv
= build_conv (ck_ptr
, to
, conv
);
885 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
887 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
888 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
889 tree fbase
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fromfn
)));
890 tree tbase
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (tofn
)));
892 if (!DERIVED_FROM_P (fbase
, tbase
)
893 || !same_type_p (TREE_TYPE (fromfn
), TREE_TYPE (tofn
))
894 || !compparms (TREE_CHAIN (TYPE_ARG_TYPES (fromfn
)),
895 TREE_CHAIN (TYPE_ARG_TYPES (tofn
)))
896 || cp_type_quals (fbase
) != cp_type_quals (tbase
))
899 from
= build_memfn_type (fromfn
, tbase
, cp_type_quals (tbase
));
900 from
= build_ptrmemfunc_type (build_pointer_type (from
));
901 conv
= build_conv (ck_pmem
, from
, conv
);
904 else if (tcode
== BOOLEAN_TYPE
)
908 An rvalue of arithmetic, unscoped enumeration, pointer, or
909 pointer to member type can be converted to an rvalue of type
911 if (ARITHMETIC_TYPE_P (from
)
912 || UNSCOPED_ENUM_P (from
)
913 || fcode
== POINTER_TYPE
914 || TYPE_PTR_TO_MEMBER_P (from
))
916 conv
= build_conv (ck_std
, to
, conv
);
917 if (fcode
== POINTER_TYPE
918 || TYPE_PTRMEM_P (from
)
919 || (TYPE_PTRMEMFUNC_P (from
)
920 && conv
->rank
< cr_pbool
))
921 conv
->rank
= cr_pbool
;
927 /* We don't check for ENUMERAL_TYPE here because there are no standard
928 conversions to enum type. */
929 /* As an extension, allow conversion to complex type. */
930 else if (ARITHMETIC_TYPE_P (to
))
932 if (! (INTEGRAL_CODE_P (fcode
) || fcode
== REAL_TYPE
)
933 || SCOPED_ENUM_P (from
))
935 conv
= build_conv (ck_std
, to
, conv
);
937 /* Give this a better rank if it's a promotion. */
938 if (same_type_p (to
, type_promotes_to (from
))
939 && conv
->u
.next
->rank
<= cr_promotion
)
940 conv
->rank
= cr_promotion
;
942 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
943 && vector_types_convertible_p (from
, to
, false))
944 return build_conv (ck_std
, to
, conv
);
945 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
946 && is_properly_derived_from (from
, to
))
948 if (conv
->kind
== ck_rvalue
)
950 conv
= build_conv (ck_base
, to
, conv
);
951 /* The derived-to-base conversion indicates the initialization
952 of a parameter with base type from an object of a derived
953 type. A temporary object is created to hold the result of
954 the conversion unless we're binding directly to a reference. */
955 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
960 if (flags
& LOOKUP_NO_NARROWING
)
961 conv
->check_narrowing
= true;
966 /* Returns nonzero if T1 is reference-related to T2. */
969 reference_related_p (tree t1
, tree t2
)
971 t1
= TYPE_MAIN_VARIANT (t1
);
972 t2
= TYPE_MAIN_VARIANT (t2
);
976 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
977 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
979 return (same_type_p (t1
, t2
)
980 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
981 && DERIVED_FROM_P (t1
, t2
)));
984 /* Returns nonzero if T1 is reference-compatible with T2. */
987 reference_compatible_p (tree t1
, tree t2
)
991 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
992 reference-related to T2 and cv1 is the same cv-qualification as,
993 or greater cv-qualification than, cv2. */
994 return (reference_related_p (t1
, t2
)
995 && at_least_as_qualified_p (t1
, t2
));
998 /* Determine whether or not the EXPR (of class type S) can be
999 converted to T as in [over.match.ref]. */
1002 convert_class_to_reference (tree reference_type
, tree s
, tree expr
, int flags
)
1008 struct z_candidate
*candidates
;
1009 struct z_candidate
*cand
;
1012 conversions
= lookup_conversions (s
, /*lookup_template_convs_p=*/true);
1018 Assuming that "cv1 T" is the underlying type of the reference
1019 being initialized, and "cv S" is the type of the initializer
1020 expression, with S a class type, the candidate functions are
1021 selected as follows:
1023 --The conversion functions of S and its base classes are
1024 considered. Those that are not hidden within S and yield type
1025 "reference to cv2 T2", where "cv1 T" is reference-compatible
1026 (_dcl.init.ref_) with "cv2 T2", are candidate functions.
1028 The argument list has one argument, which is the initializer
1033 /* Conceptually, we should take the address of EXPR and put it in
1034 the argument list. Unfortunately, however, that can result in
1035 error messages, which we should not issue now because we are just
1036 trying to find a conversion operator. Therefore, we use NULL,
1037 cast to the appropriate type. */
1038 first_arg
= build_int_cst (build_pointer_type (s
), 0);
1040 t
= TREE_TYPE (reference_type
);
1042 for (; conversions
; conversions
= TREE_CHAIN (conversions
))
1044 tree fns
= TREE_VALUE (conversions
);
1046 for (; fns
; fns
= OVL_NEXT (fns
))
1048 tree f
= OVL_CURRENT (fns
);
1049 tree t2
= TREE_TYPE (TREE_TYPE (f
));
1051 if (DECL_NONCONVERTING_P (f
)
1052 && (flags
& LOOKUP_ONLYCONVERTING
))
1057 /* If this is a template function, try to get an exact
1059 if (TREE_CODE (f
) == TEMPLATE_DECL
)
1061 cand
= add_template_candidate (&candidates
,
1068 TREE_PURPOSE (conversions
),
1074 /* Now, see if the conversion function really returns
1075 an lvalue of the appropriate type. From the
1076 point of view of unification, simply returning an
1077 rvalue of the right type is good enough. */
1079 t2
= TREE_TYPE (TREE_TYPE (f
));
1080 if (TREE_CODE (t2
) != REFERENCE_TYPE
1081 || !reference_compatible_p (t
, TREE_TYPE (t2
)))
1083 candidates
= candidates
->next
;
1088 else if (TREE_CODE (t2
) == REFERENCE_TYPE
1089 && reference_compatible_p (t
, TREE_TYPE (t2
)))
1090 cand
= add_function_candidate (&candidates
, f
, s
, first_arg
,
1091 NULL
, TYPE_BINFO (s
),
1092 TREE_PURPOSE (conversions
),
1097 conversion
*identity_conv
;
1098 /* Build a standard conversion sequence indicating the
1099 binding from the reference type returned by the
1100 function to the desired REFERENCE_TYPE. */
1102 = build_identity_conv (TREE_TYPE (TREE_TYPE
1103 (TREE_TYPE (cand
->fn
))),
1106 = (direct_reference_binding
1107 (reference_type
, identity_conv
));
1108 cand
->second_conv
->rvaluedness_matches_p
1109 = TYPE_REF_IS_RVALUE (TREE_TYPE (TREE_TYPE (cand
->fn
)))
1110 == TYPE_REF_IS_RVALUE (reference_type
);
1111 cand
->second_conv
->bad_p
|= cand
->convs
[0]->bad_p
;
1113 /* Don't allow binding of lvalues to rvalue references. */
1114 if (TYPE_REF_IS_RVALUE (reference_type
)
1115 && !TYPE_REF_IS_RVALUE (TREE_TYPE (TREE_TYPE (cand
->fn
))))
1116 cand
->second_conv
->bad_p
= true;
1121 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
1122 /* If none of the conversion functions worked out, let our caller
1127 cand
= tourney (candidates
);
1131 /* Now that we know that this is the function we're going to use fix
1132 the dummy first argument. */
1133 gcc_assert (cand
->first_arg
== NULL_TREE
1134 || integer_zerop (cand
->first_arg
));
1135 cand
->first_arg
= build_this (expr
);
1137 /* Build a user-defined conversion sequence representing the
1139 conv
= build_conv (ck_user
,
1140 TREE_TYPE (TREE_TYPE (cand
->fn
)),
1141 build_identity_conv (TREE_TYPE (expr
), expr
));
1144 if (cand
->viable
== -1)
1147 /* Merge it with the standard conversion sequence from the
1148 conversion function's return type to the desired type. */
1149 cand
->second_conv
= merge_conversion_sequences (conv
, cand
->second_conv
);
1151 return cand
->second_conv
;
1154 /* A reference of the indicated TYPE is being bound directly to the
1155 expression represented by the implicit conversion sequence CONV.
1156 Return a conversion sequence for this binding. */
1159 direct_reference_binding (tree type
, conversion
*conv
)
1163 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
1164 gcc_assert (TREE_CODE (conv
->type
) != REFERENCE_TYPE
);
1166 t
= TREE_TYPE (type
);
1170 When a parameter of reference type binds directly
1171 (_dcl.init.ref_) to an argument expression, the implicit
1172 conversion sequence is the identity conversion, unless the
1173 argument expression has a type that is a derived class of the
1174 parameter type, in which case the implicit conversion sequence is
1175 a derived-to-base Conversion.
1177 If the parameter binds directly to the result of applying a
1178 conversion function to the argument expression, the implicit
1179 conversion sequence is a user-defined conversion sequence
1180 (_over.ics.user_), with the second standard conversion sequence
1181 either an identity conversion or, if the conversion function
1182 returns an entity of a type that is a derived class of the
1183 parameter type, a derived-to-base conversion. */
1184 if (!same_type_ignoring_top_level_qualifiers_p (t
, conv
->type
))
1186 /* Represent the derived-to-base conversion. */
1187 conv
= build_conv (ck_base
, t
, conv
);
1188 /* We will actually be binding to the base-class subobject in
1189 the derived class, so we mark this conversion appropriately.
1190 That way, convert_like knows not to generate a temporary. */
1191 conv
->need_temporary_p
= false;
1193 return build_conv (ck_ref_bind
, type
, conv
);
1196 /* Returns the conversion path from type FROM to reference type TO for
1197 purposes of reference binding. For lvalue binding, either pass a
1198 reference type to FROM or an lvalue expression to EXPR. If the
1199 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1200 the conversion returned. If C_CAST_P is true, this
1201 conversion is coming from a C-style cast. */
1204 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
)
1206 conversion
*conv
= NULL
;
1207 tree to
= TREE_TYPE (rto
);
1212 cp_lvalue_kind is_lvalue
= clk_none
;
1214 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1216 expr
= instantiate_type (to
, expr
, tf_none
);
1217 if (expr
== error_mark_node
)
1219 from
= TREE_TYPE (expr
);
1222 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1224 /* Anything with reference type is an lvalue. */
1225 is_lvalue
= clk_ordinary
;
1226 from
= TREE_TYPE (from
);
1229 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1231 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1232 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1234 if (!CLASS_TYPE_P (to
)
1235 && CONSTRUCTOR_NELTS (expr
) == 1)
1237 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1238 if (error_operand_p (expr
))
1240 from
= TREE_TYPE (expr
);
1244 if (is_lvalue
== clk_none
&& expr
)
1245 is_lvalue
= real_lvalue_p (expr
);
1248 if ((is_lvalue
& clk_bitfield
) != 0)
1249 tfrom
= unlowered_expr_type (expr
);
1251 /* Figure out whether or not the types are reference-related and
1252 reference compatible. We have do do this after stripping
1253 references from FROM. */
1254 related_p
= reference_related_p (to
, tfrom
);
1255 /* If this is a C cast, first convert to an appropriately qualified
1256 type, so that we can later do a const_cast to the desired type. */
1257 if (related_p
&& c_cast_p
1258 && !at_least_as_qualified_p (to
, tfrom
))
1259 to
= build_qualified_type (to
, cp_type_quals (tfrom
));
1260 compatible_p
= reference_compatible_p (to
, tfrom
);
1262 /* Directly bind reference when target expression's type is compatible with
1263 the reference and expression is an lvalue. In DR391, the wording in
1264 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1265 const and rvalue references to rvalues of compatible class type.
1266 We should also do direct bindings for non-class "rvalues" derived from
1267 rvalue references. */
1270 || (((CP_TYPE_CONST_NON_VOLATILE_P (to
)
1271 && !(flags
& LOOKUP_NO_TEMP_BIND
))
1272 || TYPE_REF_IS_RVALUE (rto
))
1273 && (CLASS_TYPE_P (from
) || (expr
&& lvalue_p (expr
))))))
1277 If the initializer expression
1279 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1280 is reference-compatible with "cv2 T2,"
1282 the reference is bound directly to the initializer expression
1286 If the initializer expression is an rvalue, with T2 a class type,
1287 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1288 is bound to the object represented by the rvalue or to a sub-object
1289 within that object. */
1291 conv
= build_identity_conv (tfrom
, expr
);
1292 conv
= direct_reference_binding (rto
, conv
);
1294 if (flags
& LOOKUP_PREFER_RVALUE
)
1295 /* The top-level caller requested that we pretend that the lvalue
1296 be treated as an rvalue. */
1297 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1299 conv
->rvaluedness_matches_p
1300 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1302 if ((is_lvalue
& clk_bitfield
) != 0
1303 || ((is_lvalue
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1304 /* For the purposes of overload resolution, we ignore the fact
1305 this expression is a bitfield or packed field. (In particular,
1306 [over.ics.ref] says specifically that a function with a
1307 non-const reference parameter is viable even if the
1308 argument is a bitfield.)
1310 However, when we actually call the function we must create
1311 a temporary to which to bind the reference. If the
1312 reference is volatile, or isn't const, then we cannot make
1313 a temporary, so we just issue an error when the conversion
1315 conv
->need_temporary_p
= true;
1317 /* Don't allow binding of lvalues to rvalue references. */
1318 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1319 && !(flags
& LOOKUP_PREFER_RVALUE
))
1324 /* [class.conv.fct] A conversion function is never used to convert a
1325 (possibly cv-qualified) object to the (possibly cv-qualified) same
1326 object type (or a reference to it), to a (possibly cv-qualified) base
1327 class of that type (or a reference to it).... */
1328 else if (CLASS_TYPE_P (from
) && !related_p
1329 && !(flags
& LOOKUP_NO_CONVERSION
))
1333 If the initializer expression
1335 -- has a class type (i.e., T2 is a class type) can be
1336 implicitly converted to an lvalue of type "cv3 T3," where
1337 "cv1 T1" is reference-compatible with "cv3 T3". (this
1338 conversion is selected by enumerating the applicable
1339 conversion functions (_over.match.ref_) and choosing the
1340 best one through overload resolution. (_over.match_).
1342 the reference is bound to the lvalue result of the conversion
1343 in the second case. */
1344 conv
= convert_class_to_reference (rto
, from
, expr
, flags
);
1349 /* From this point on, we conceptually need temporaries, even if we
1350 elide them. Only the cases above are "direct bindings". */
1351 if (flags
& LOOKUP_NO_TEMP_BIND
)
1356 When a parameter of reference type is not bound directly to an
1357 argument expression, the conversion sequence is the one required
1358 to convert the argument expression to the underlying type of the
1359 reference according to _over.best.ics_. Conceptually, this
1360 conversion sequence corresponds to copy-initializing a temporary
1361 of the underlying type with the argument expression. Any
1362 difference in top-level cv-qualification is subsumed by the
1363 initialization itself and does not constitute a conversion. */
1367 Otherwise, the reference shall be to a non-volatile const type.
1369 Under C++0x, [8.5.3/5 dcl.init.ref] it may also be an rvalue reference */
1370 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1375 Otherwise, a temporary of type "cv1 T1" is created and
1376 initialized from the initializer expression using the rules for a
1377 non-reference copy initialization. If T1 is reference-related to
1378 T2, cv1 must be the same cv-qualification as, or greater
1379 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1380 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1383 /* We're generating a temporary now, but don't bind any more in the
1384 conversion (specifically, don't slice the temporary returned by a
1385 conversion operator). */
1386 flags
|= LOOKUP_NO_TEMP_BIND
;
1388 /* Temporaries are copy-initialized, except for this hack to allow
1389 explicit conversion ops to the copy ctor. See also
1390 add_function_candidate. */
1391 if (!(flags
& LOOKUP_COPY_PARM
))
1392 flags
|= LOOKUP_ONLYCONVERTING
;
1395 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1400 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1401 /* This reference binding, unlike those above, requires the
1402 creation of a temporary. */
1403 conv
->need_temporary_p
= true;
1404 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1409 /* Returns the implicit conversion sequence (see [over.ics]) from type
1410 FROM to type TO. The optional expression EXPR may affect the
1411 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1412 true, this conversion is coming from a C-style cast. */
1415 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1420 if (from
== error_mark_node
|| to
== error_mark_node
1421 || expr
== error_mark_node
)
1424 if (TREE_CODE (to
) == REFERENCE_TYPE
)
1425 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
);
1427 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
);
1432 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1434 if (is_std_init_list (to
))
1435 return build_list_conv (to
, expr
, flags
);
1437 /* Allow conversion from an initializer-list with one element to a
1439 if (SCALAR_TYPE_P (to
))
1441 int nelts
= CONSTRUCTOR_NELTS (expr
);
1445 elt
= integer_zero_node
;
1446 else if (nelts
== 1)
1447 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1449 elt
= error_mark_node
;
1451 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1455 conv
->check_narrowing
= true;
1456 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1457 /* Too many levels of braces, i.e. '{{1}}'. */
1464 if (expr
!= NULL_TREE
1465 && (MAYBE_CLASS_TYPE_P (from
)
1466 || MAYBE_CLASS_TYPE_P (to
))
1467 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1469 struct z_candidate
*cand
;
1470 int convflags
= (flags
& (LOOKUP_NO_TEMP_BIND
|LOOKUP_ONLYCONVERTING
));
1472 if (CLASS_TYPE_P (to
)
1473 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
))
1474 && BRACE_ENCLOSED_INITIALIZER_P (expr
))
1475 return build_aggr_conv (to
, expr
, flags
);
1477 cand
= build_user_type_conversion_1 (to
, expr
, convflags
);
1479 conv
= cand
->second_conv
;
1481 /* We used to try to bind a reference to a temporary here, but that
1482 is now handled after the recursive call to this function at the end
1483 of reference_binding. */
1490 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1491 functions. ARGS will not be changed until a single candidate is
1494 static struct z_candidate
*
1495 add_candidate (struct z_candidate
**candidates
,
1496 tree fn
, tree first_arg
, const VEC(tree
,gc
) *args
,
1497 size_t num_convs
, conversion
**convs
,
1498 tree access_path
, tree conversion_path
,
1501 struct z_candidate
*cand
= (struct z_candidate
*)
1502 conversion_obstack_alloc (sizeof (struct z_candidate
));
1505 cand
->first_arg
= first_arg
;
1507 cand
->convs
= convs
;
1508 cand
->num_convs
= num_convs
;
1509 cand
->access_path
= access_path
;
1510 cand
->conversion_path
= conversion_path
;
1511 cand
->viable
= viable
;
1512 cand
->next
= *candidates
;
1518 /* Create an overload candidate for the function or method FN called
1519 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1520 FLAGS is passed on to implicit_conversion.
1522 This does not change ARGS.
1524 CTYPE, if non-NULL, is the type we want to pretend this function
1525 comes from for purposes of overload resolution. */
1527 static struct z_candidate
*
1528 add_function_candidate (struct z_candidate
**candidates
,
1529 tree fn
, tree ctype
, tree first_arg
,
1530 const VEC(tree
,gc
) *args
, tree access_path
,
1531 tree conversion_path
, int flags
)
1533 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1537 tree orig_first_arg
= first_arg
;
1541 /* At this point we should not see any functions which haven't been
1542 explicitly declared, except for friend functions which will have
1543 been found using argument dependent lookup. */
1544 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
1546 /* The `this', `in_chrg' and VTT arguments to constructors are not
1547 considered in overload resolution. */
1548 if (DECL_CONSTRUCTOR_P (fn
))
1550 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
1551 skip
= num_artificial_parms_for (fn
);
1552 if (skip
> 0 && first_arg
!= NULL_TREE
)
1555 first_arg
= NULL_TREE
;
1561 len
= VEC_length (tree
, args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
1562 convs
= alloc_conversions (len
);
1564 /* 13.3.2 - Viable functions [over.match.viable]
1565 First, to be a viable function, a candidate function shall have enough
1566 parameters to agree in number with the arguments in the list.
1568 We need to check this first; otherwise, checking the ICSes might cause
1569 us to produce an ill-formed template instantiation. */
1571 parmnode
= parmlist
;
1572 for (i
= 0; i
< len
; ++i
)
1574 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
1576 parmnode
= TREE_CHAIN (parmnode
);
1579 if (i
< len
&& parmnode
)
1582 /* Make sure there are default args for the rest of the parms. */
1583 else if (!sufficient_parms_p (parmnode
))
1589 /* Second, for F to be a viable function, there shall exist for each
1590 argument an implicit conversion sequence that converts that argument
1591 to the corresponding parameter of F. */
1593 parmnode
= parmlist
;
1595 for (i
= 0; i
< len
; ++i
)
1601 if (parmnode
== void_list_node
)
1604 if (i
== 0 && first_arg
!= NULL_TREE
)
1607 arg
= VEC_index (tree
, args
,
1608 i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0));
1609 argtype
= lvalue_type (arg
);
1611 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1612 && ! DECL_CONSTRUCTOR_P (fn
));
1616 tree parmtype
= TREE_VALUE (parmnode
);
1619 /* The type of the implicit object parameter ('this') for
1620 overload resolution is not always the same as for the
1621 function itself; conversion functions are considered to
1622 be members of the class being converted, and functions
1623 introduced by a using-declaration are considered to be
1624 members of the class that uses them.
1626 Since build_over_call ignores the ICS for the `this'
1627 parameter, we can just change the parm type. */
1628 if (ctype
&& is_this
)
1631 = build_qualified_type (ctype
,
1632 TYPE_QUALS (TREE_TYPE (parmtype
)));
1633 parmtype
= build_pointer_type (parmtype
);
1636 if (ctype
&& i
== 0 && DECL_COPY_CONSTRUCTOR_P (fn
)
1639 /* Hack: Direct-initialize copy parm (i.e. suppress
1640 LOOKUP_ONLYCONVERTING) to make explicit conversion ops
1641 work. See also reference_binding. */
1642 lflags
|= LOOKUP_COPY_PARM
;
1643 if (flags
& LOOKUP_NO_COPY_CTOR_CONVERSION
)
1644 lflags
|= LOOKUP_NO_CONVERSION
;
1647 lflags
|= LOOKUP_ONLYCONVERTING
;
1649 t
= implicit_conversion (parmtype
, argtype
, arg
,
1650 /*c_cast_p=*/false, lflags
);
1654 t
= build_identity_conv (argtype
, arg
);
1655 t
->ellipsis_p
= true;
1672 parmnode
= TREE_CHAIN (parmnode
);
1676 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
1677 access_path
, conversion_path
, viable
);
1680 /* Create an overload candidate for the conversion function FN which will
1681 be invoked for expression OBJ, producing a pointer-to-function which
1682 will in turn be called with the argument list FIRST_ARG/ARGLIST,
1683 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
1684 passed on to implicit_conversion.
1686 Actually, we don't really care about FN; we care about the type it
1687 converts to. There may be multiple conversion functions that will
1688 convert to that type, and we rely on build_user_type_conversion_1 to
1689 choose the best one; so when we create our candidate, we record the type
1690 instead of the function. */
1692 static struct z_candidate
*
1693 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
1694 tree first_arg
, const VEC(tree
,gc
) *arglist
,
1695 tree access_path
, tree conversion_path
)
1697 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
1698 int i
, len
, viable
, flags
;
1699 tree parmlist
, parmnode
;
1702 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
1703 parmlist
= TREE_TYPE (parmlist
);
1704 parmlist
= TYPE_ARG_TYPES (parmlist
);
1706 len
= VEC_length (tree
, arglist
) + (first_arg
!= NULL_TREE
? 1 : 0) + 1;
1707 convs
= alloc_conversions (len
);
1708 parmnode
= parmlist
;
1710 flags
= LOOKUP_IMPLICIT
;
1712 /* Don't bother looking up the same type twice. */
1713 if (*candidates
&& (*candidates
)->fn
== totype
)
1716 for (i
= 0; i
< len
; ++i
)
1723 else if (i
== 1 && first_arg
!= NULL_TREE
)
1726 arg
= VEC_index (tree
, arglist
,
1727 i
- (first_arg
!= NULL_TREE
? 1 : 0) - 1);
1728 argtype
= lvalue_type (arg
);
1731 t
= implicit_conversion (totype
, argtype
, arg
, /*c_cast_p=*/false,
1733 else if (parmnode
== void_list_node
)
1736 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
1737 /*c_cast_p=*/false, flags
);
1740 t
= build_identity_conv (argtype
, arg
);
1741 t
->ellipsis_p
= true;
1755 parmnode
= TREE_CHAIN (parmnode
);
1761 if (!sufficient_parms_p (parmnode
))
1764 return add_candidate (candidates
, totype
, first_arg
, arglist
, len
, convs
,
1765 access_path
, conversion_path
, viable
);
1769 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
1770 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
1782 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
1783 convs
= alloc_conversions (num_convs
);
1785 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
1786 conversion ops are allowed. We handle that here by just checking for
1787 boolean_type_node because other operators don't ask for it. COND_EXPR
1788 also does contextual conversion to bool for the first operand, but we
1789 handle that in build_conditional_expr, and type1 here is operand 2. */
1790 if (type1
!= boolean_type_node
)
1791 flags
|= LOOKUP_ONLYCONVERTING
;
1793 for (i
= 0; i
< 2; ++i
)
1798 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
1799 /*c_cast_p=*/false, flags
);
1803 /* We need something for printing the candidate. */
1804 t
= build_identity_conv (types
[i
], NULL_TREE
);
1811 /* For COND_EXPR we rearranged the arguments; undo that now. */
1814 convs
[2] = convs
[1];
1815 convs
[1] = convs
[0];
1816 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
1817 /*c_cast_p=*/false, flags
);
1824 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
1826 /*access_path=*/NULL_TREE
,
1827 /*conversion_path=*/NULL_TREE
,
1832 is_complete (tree t
)
1834 return COMPLETE_TYPE_P (complete_type (t
));
1837 /* Returns nonzero if TYPE is a promoted arithmetic type. */
1840 promoted_arithmetic_type_p (tree type
)
1844 In this section, the term promoted integral type is used to refer
1845 to those integral types which are preserved by integral promotion
1846 (including e.g. int and long but excluding e.g. char).
1847 Similarly, the term promoted arithmetic type refers to promoted
1848 integral types plus floating types. */
1849 return ((CP_INTEGRAL_TYPE_P (type
)
1850 && same_type_p (type_promotes_to (type
), type
))
1851 || TREE_CODE (type
) == REAL_TYPE
);
1854 /* Create any builtin operator overload candidates for the operator in
1855 question given the converted operand types TYPE1 and TYPE2. The other
1856 args are passed through from add_builtin_candidates to
1857 build_builtin_candidate.
1859 TYPE1 and TYPE2 may not be permissible, and we must filter them.
1860 If CODE is requires candidates operands of the same type of the kind
1861 of which TYPE1 and TYPE2 are, we add both candidates
1862 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
1865 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
1866 enum tree_code code2
, tree fnname
, tree type1
,
1867 tree type2
, tree
*args
, tree
*argtypes
, int flags
)
1871 case POSTINCREMENT_EXPR
:
1872 case POSTDECREMENT_EXPR
:
1873 args
[1] = integer_zero_node
;
1874 type2
= integer_type_node
;
1883 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
1884 and VQ is either volatile or empty, there exist candidate operator
1885 functions of the form
1886 VQ T& operator++(VQ T&);
1887 T operator++(VQ T&, int);
1888 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
1889 type other than bool, and VQ is either volatile or empty, there exist
1890 candidate operator functions of the form
1891 VQ T& operator--(VQ T&);
1892 T operator--(VQ T&, int);
1893 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
1894 complete object type, and VQ is either volatile or empty, there exist
1895 candidate operator functions of the form
1896 T*VQ& operator++(T*VQ&);
1897 T*VQ& operator--(T*VQ&);
1898 T* operator++(T*VQ&, int);
1899 T* operator--(T*VQ&, int); */
1901 case POSTDECREMENT_EXPR
:
1902 case PREDECREMENT_EXPR
:
1903 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
1905 case POSTINCREMENT_EXPR
:
1906 case PREINCREMENT_EXPR
:
1907 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
1909 type1
= build_reference_type (type1
);
1914 /* 7 For every cv-qualified or cv-unqualified complete object type T, there
1915 exist candidate operator functions of the form
1919 8 For every function type T, there exist candidate operator functions of
1921 T& operator*(T*); */
1924 if (TREE_CODE (type1
) == POINTER_TYPE
1925 && (TYPE_PTROB_P (type1
)
1926 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
1930 /* 9 For every type T, there exist candidate operator functions of the form
1933 10For every promoted arithmetic type T, there exist candidate operator
1934 functions of the form
1938 case UNARY_PLUS_EXPR
: /* unary + */
1939 if (TREE_CODE (type1
) == POINTER_TYPE
)
1942 if (ARITHMETIC_TYPE_P (type1
))
1946 /* 11For every promoted integral type T, there exist candidate operator
1947 functions of the form
1951 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
1955 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
1956 is the same type as C2 or is a derived class of C2, T is a complete
1957 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
1958 there exist candidate operator functions of the form
1959 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
1960 where CV12 is the union of CV1 and CV2. */
1963 if (TREE_CODE (type1
) == POINTER_TYPE
1964 && TYPE_PTR_TO_MEMBER_P (type2
))
1966 tree c1
= TREE_TYPE (type1
);
1967 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
1969 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
1970 && (TYPE_PTRMEMFUNC_P (type2
)
1971 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
1976 /* 13For every pair of promoted arithmetic types L and R, there exist can-
1977 didate operator functions of the form
1982 bool operator<(L, R);
1983 bool operator>(L, R);
1984 bool operator<=(L, R);
1985 bool operator>=(L, R);
1986 bool operator==(L, R);
1987 bool operator!=(L, R);
1988 where LR is the result of the usual arithmetic conversions between
1991 14For every pair of types T and I, where T is a cv-qualified or cv-
1992 unqualified complete object type and I is a promoted integral type,
1993 there exist candidate operator functions of the form
1994 T* operator+(T*, I);
1995 T& operator[](T*, I);
1996 T* operator-(T*, I);
1997 T* operator+(I, T*);
1998 T& operator[](I, T*);
2000 15For every T, where T is a pointer to complete object type, there exist
2001 candidate operator functions of the form112)
2002 ptrdiff_t operator-(T, T);
2004 16For every pointer or enumeration type T, there exist candidate operator
2005 functions of the form
2006 bool operator<(T, T);
2007 bool operator>(T, T);
2008 bool operator<=(T, T);
2009 bool operator>=(T, T);
2010 bool operator==(T, T);
2011 bool operator!=(T, T);
2013 17For every pointer to member type T, there exist candidate operator
2014 functions of the form
2015 bool operator==(T, T);
2016 bool operator!=(T, T); */
2019 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2021 if (TYPE_PTROB_P (type1
)
2022 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2024 type2
= ptrdiff_type_node
;
2028 case TRUNC_DIV_EXPR
:
2029 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2035 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2036 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
)))
2038 if (TYPE_PTR_TO_MEMBER_P (type1
) && null_ptr_cst_p (args
[1]))
2043 if (TYPE_PTR_TO_MEMBER_P (type2
) && null_ptr_cst_p (args
[0]))
2055 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2057 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2059 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2060 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2062 if (TYPE_PTR_P (type1
)
2063 && null_ptr_cst_p (args
[1])
2064 && !uses_template_parms (type1
))
2069 if (null_ptr_cst_p (args
[0])
2070 && TYPE_PTR_P (type2
)
2071 && !uses_template_parms (type2
))
2079 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2082 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2084 type1
= ptrdiff_type_node
;
2087 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2089 type2
= ptrdiff_type_node
;
2094 /* 18For every pair of promoted integral types L and R, there exist candi-
2095 date operator functions of the form
2102 where LR is the result of the usual arithmetic conversions between
2105 case TRUNC_MOD_EXPR
:
2111 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2115 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2116 type, VQ is either volatile or empty, and R is a promoted arithmetic
2117 type, there exist candidate operator functions of the form
2118 VQ L& operator=(VQ L&, R);
2119 VQ L& operator*=(VQ L&, R);
2120 VQ L& operator/=(VQ L&, R);
2121 VQ L& operator+=(VQ L&, R);
2122 VQ L& operator-=(VQ L&, R);
2124 20For every pair T, VQ), where T is any type and VQ is either volatile
2125 or empty, there exist candidate operator functions of the form
2126 T*VQ& operator=(T*VQ&, T*);
2128 21For every pair T, VQ), where T is a pointer to member type and VQ is
2129 either volatile or empty, there exist candidate operator functions of
2131 VQ T& operator=(VQ T&, T);
2133 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2134 unqualified complete object type, VQ is either volatile or empty, and
2135 I is a promoted integral type, there exist candidate operator func-
2137 T*VQ& operator+=(T*VQ&, I);
2138 T*VQ& operator-=(T*VQ&, I);
2140 23For every triple L, VQ, R), where L is an integral or enumeration
2141 type, VQ is either volatile or empty, and R is a promoted integral
2142 type, there exist candidate operator functions of the form
2144 VQ L& operator%=(VQ L&, R);
2145 VQ L& operator<<=(VQ L&, R);
2146 VQ L& operator>>=(VQ L&, R);
2147 VQ L& operator&=(VQ L&, R);
2148 VQ L& operator^=(VQ L&, R);
2149 VQ L& operator|=(VQ L&, R); */
2156 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2158 type2
= ptrdiff_type_node
;
2162 case TRUNC_DIV_EXPR
:
2163 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2167 case TRUNC_MOD_EXPR
:
2173 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2178 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2180 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2181 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2182 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
))
2183 || ((TYPE_PTRMEMFUNC_P (type1
)
2184 || TREE_CODE (type1
) == POINTER_TYPE
)
2185 && null_ptr_cst_p (args
[1])))
2195 type1
= build_reference_type (type1
);
2201 For every pair of promoted arithmetic types L and R, there
2202 exist candidate operator functions of the form
2204 LR operator?(bool, L, R);
2206 where LR is the result of the usual arithmetic conversions
2207 between types L and R.
2209 For every type T, where T is a pointer or pointer-to-member
2210 type, there exist candidate operator functions of the form T
2211 operator?(bool, T, T); */
2213 if (promoted_arithmetic_type_p (type1
)
2214 && promoted_arithmetic_type_p (type2
))
2218 /* Otherwise, the types should be pointers. */
2219 if (!(TYPE_PTR_P (type1
) || TYPE_PTR_TO_MEMBER_P (type1
))
2220 || !(TYPE_PTR_P (type2
) || TYPE_PTR_TO_MEMBER_P (type2
)))
2223 /* We don't check that the two types are the same; the logic
2224 below will actually create two candidates; one in which both
2225 parameter types are TYPE1, and one in which both parameter
2233 /* If we're dealing with two pointer types or two enumeral types,
2234 we need candidates for both of them. */
2235 if (type2
&& !same_type_p (type1
, type2
)
2236 && TREE_CODE (type1
) == TREE_CODE (type2
)
2237 && (TREE_CODE (type1
) == REFERENCE_TYPE
2238 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2239 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
))
2240 || TYPE_PTRMEMFUNC_P (type1
)
2241 || MAYBE_CLASS_TYPE_P (type1
)
2242 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2244 build_builtin_candidate
2245 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
);
2246 build_builtin_candidate
2247 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
);
2251 build_builtin_candidate
2252 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
);
2256 type_decays_to (tree type
)
2258 if (TREE_CODE (type
) == ARRAY_TYPE
)
2259 return build_pointer_type (TREE_TYPE (type
));
2260 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2261 return build_pointer_type (type
);
2265 /* There are three conditions of builtin candidates:
2267 1) bool-taking candidates. These are the same regardless of the input.
2268 2) pointer-pair taking candidates. These are generated for each type
2269 one of the input types converts to.
2270 3) arithmetic candidates. According to the standard, we should generate
2271 all of these, but I'm trying not to...
2273 Here we generate a superset of the possible candidates for this particular
2274 case. That is a subset of the full set the standard defines, plus some
2275 other cases which the standard disallows. add_builtin_candidate will
2276 filter out the invalid set. */
2279 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2280 enum tree_code code2
, tree fnname
, tree
*args
,
2285 tree type
, argtypes
[3];
2286 /* TYPES[i] is the set of possible builtin-operator parameter types
2287 we will consider for the Ith argument. These are represented as
2288 a TREE_LIST; the TREE_VALUE of each node is the potential
2292 for (i
= 0; i
< 3; ++i
)
2295 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2297 argtypes
[i
] = NULL_TREE
;
2302 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2303 and VQ is either volatile or empty, there exist candidate operator
2304 functions of the form
2305 VQ T& operator++(VQ T&); */
2307 case POSTINCREMENT_EXPR
:
2308 case PREINCREMENT_EXPR
:
2309 case POSTDECREMENT_EXPR
:
2310 case PREDECREMENT_EXPR
:
2315 /* 24There also exist candidate operator functions of the form
2316 bool operator!(bool);
2317 bool operator&&(bool, bool);
2318 bool operator||(bool, bool); */
2320 case TRUTH_NOT_EXPR
:
2321 build_builtin_candidate
2322 (candidates
, fnname
, boolean_type_node
,
2323 NULL_TREE
, args
, argtypes
, flags
);
2326 case TRUTH_ORIF_EXPR
:
2327 case TRUTH_ANDIF_EXPR
:
2328 build_builtin_candidate
2329 (candidates
, fnname
, boolean_type_node
,
2330 boolean_type_node
, args
, argtypes
, flags
);
2352 types
[0] = types
[1] = NULL_TREE
;
2354 for (i
= 0; i
< 2; ++i
)
2358 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
2362 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
2365 convs
= lookup_conversions (argtypes
[i
],
2366 /*lookup_template_convs_p=*/false);
2368 if (code
== COND_EXPR
)
2370 if (real_lvalue_p (args
[i
]))
2371 types
[i
] = tree_cons
2372 (NULL_TREE
, build_reference_type (argtypes
[i
]), types
[i
]);
2374 types
[i
] = tree_cons
2375 (NULL_TREE
, TYPE_MAIN_VARIANT (argtypes
[i
]), types
[i
]);
2381 for (; convs
; convs
= TREE_CHAIN (convs
))
2383 type
= TREE_TYPE (convs
);
2386 && (TREE_CODE (type
) != REFERENCE_TYPE
2387 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
2390 if (code
== COND_EXPR
&& TREE_CODE (type
) == REFERENCE_TYPE
)
2391 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2393 type
= non_reference (type
);
2394 if (i
!= 0 || ! ref1
)
2396 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
2397 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
2398 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2399 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2400 type
= type_promotes_to (type
);
2403 if (! value_member (type
, types
[i
]))
2404 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2409 if (code
== COND_EXPR
&& real_lvalue_p (args
[i
]))
2410 types
[i
] = tree_cons
2411 (NULL_TREE
, build_reference_type (argtypes
[i
]), types
[i
]);
2412 type
= non_reference (argtypes
[i
]);
2413 if (i
!= 0 || ! ref1
)
2415 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
2416 if (enum_p
&& UNSCOPED_ENUM_P (type
))
2417 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2418 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2419 type
= type_promotes_to (type
);
2421 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2425 /* Run through the possible parameter types of both arguments,
2426 creating candidates with those parameter types. */
2427 for (; types
[0]; types
[0] = TREE_CHAIN (types
[0]))
2430 for (type
= types
[1]; type
; type
= TREE_CHAIN (type
))
2431 add_builtin_candidate
2432 (candidates
, code
, code2
, fnname
, TREE_VALUE (types
[0]),
2433 TREE_VALUE (type
), args
, argtypes
, flags
);
2435 add_builtin_candidate
2436 (candidates
, code
, code2
, fnname
, TREE_VALUE (types
[0]),
2437 NULL_TREE
, args
, argtypes
, flags
);
2442 /* If TMPL can be successfully instantiated as indicated by
2443 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2445 TMPL is the template. EXPLICIT_TARGS are any explicit template
2446 arguments. ARGLIST is the arguments provided at the call-site.
2447 This does not change ARGLIST. The RETURN_TYPE is the desired type
2448 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
2449 as for add_function_candidate. If an OBJ is supplied, FLAGS and
2450 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
2452 static struct z_candidate
*
2453 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
2454 tree ctype
, tree explicit_targs
, tree first_arg
,
2455 const VEC(tree
,gc
) *arglist
, tree return_type
,
2456 tree access_path
, tree conversion_path
,
2457 int flags
, tree obj
, unification_kind_t strict
)
2459 int ntparms
= DECL_NTPARMS (tmpl
);
2460 tree targs
= make_tree_vec (ntparms
);
2461 unsigned int len
= VEC_length (tree
, arglist
);
2462 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
2463 unsigned int skip_without_in_chrg
= 0;
2464 tree first_arg_without_in_chrg
= first_arg
;
2465 tree
*args_without_in_chrg
;
2466 unsigned int nargs_without_in_chrg
;
2467 unsigned int ia
, ix
;
2469 struct z_candidate
*cand
;
2473 /* We don't do deduction on the in-charge parameter, the VTT
2474 parameter or 'this'. */
2475 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
2477 if (first_arg_without_in_chrg
!= NULL_TREE
)
2478 first_arg_without_in_chrg
= NULL_TREE
;
2480 ++skip_without_in_chrg
;
2483 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
2484 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
2485 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
2487 if (first_arg_without_in_chrg
!= NULL_TREE
)
2488 first_arg_without_in_chrg
= NULL_TREE
;
2490 ++skip_without_in_chrg
;
2493 if (len
< skip_without_in_chrg
)
2496 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
2497 + (len
- skip_without_in_chrg
));
2498 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
2500 if (first_arg_without_in_chrg
!= NULL_TREE
)
2502 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
2505 for (ix
= skip_without_in_chrg
;
2506 VEC_iterate (tree
, arglist
, ix
, arg
);
2509 args_without_in_chrg
[ia
] = arg
;
2512 gcc_assert (ia
== nargs_without_in_chrg
);
2514 i
= fn_type_unification (tmpl
, explicit_targs
, targs
,
2515 args_without_in_chrg
,
2516 nargs_without_in_chrg
,
2517 return_type
, strict
, flags
);
2522 fn
= instantiate_template (tmpl
, targs
, tf_none
);
2523 if (fn
== error_mark_node
)
2528 A member function template is never instantiated to perform the
2529 copy of a class object to an object of its class type.
2531 It's a little unclear what this means; the standard explicitly
2532 does allow a template to be used to copy a class. For example,
2537 template <class T> A(const T&);
2540 void g () { A a (f ()); }
2542 the member template will be used to make the copy. The section
2543 quoted above appears in the paragraph that forbids constructors
2544 whose only parameter is (a possibly cv-qualified variant of) the
2545 class type, and a logical interpretation is that the intent was
2546 to forbid the instantiation of member templates which would then
2548 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
2550 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
2551 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
2556 if (obj
!= NULL_TREE
)
2557 /* Aha, this is a conversion function. */
2558 cand
= add_conv_candidate (candidates
, fn
, obj
, first_arg
, arglist
,
2559 access_path
, conversion_path
);
2561 cand
= add_function_candidate (candidates
, fn
, ctype
,
2562 first_arg
, arglist
, access_path
,
2563 conversion_path
, flags
);
2564 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
2565 /* This situation can occur if a member template of a template
2566 class is specialized. Then, instantiate_template might return
2567 an instantiation of the specialization, in which case the
2568 DECL_TI_TEMPLATE field will point at the original
2569 specialization. For example:
2571 template <class T> struct S { template <class U> void f(U);
2572 template <> void f(int) {}; };
2576 Here, TMPL will be template <class U> S<double>::f(U).
2577 And, instantiate template will give us the specialization
2578 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
2579 for this will point at template <class T> template <> S<T>::f(int),
2580 so that we can find the definition. For the purposes of
2581 overload resolution, however, we want the original TMPL. */
2582 cand
->template_decl
= build_template_info (tmpl
, targs
);
2584 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
2590 static struct z_candidate
*
2591 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
2592 tree explicit_targs
, tree first_arg
,
2593 const VEC(tree
,gc
) *arglist
, tree return_type
,
2594 tree access_path
, tree conversion_path
, int flags
,
2595 unification_kind_t strict
)
2598 add_template_candidate_real (candidates
, tmpl
, ctype
,
2599 explicit_targs
, first_arg
, arglist
,
2600 return_type
, access_path
, conversion_path
,
2601 flags
, NULL_TREE
, strict
);
2605 static struct z_candidate
*
2606 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
2607 tree obj
, tree first_arg
,
2608 const VEC(tree
,gc
) *arglist
,
2609 tree return_type
, tree access_path
,
2610 tree conversion_path
)
2613 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
2614 first_arg
, arglist
, return_type
, access_path
,
2615 conversion_path
, 0, obj
, DEDUCE_CONV
);
2618 /* The CANDS are the set of candidates that were considered for
2619 overload resolution. Return the set of viable candidates. If none
2620 of the candidates were viable, set *ANY_VIABLE_P to true. STRICT_P
2621 is true if a candidate should be considered viable only if it is
2624 static struct z_candidate
*
2625 splice_viable (struct z_candidate
*cands
,
2629 struct z_candidate
*viable
;
2630 struct z_candidate
**last_viable
;
2631 struct z_candidate
**cand
;
2634 last_viable
= &viable
;
2635 *any_viable_p
= false;
2640 struct z_candidate
*c
= *cand
;
2641 if (strict_p
? c
->viable
== 1 : c
->viable
)
2646 last_viable
= &c
->next
;
2647 *any_viable_p
= true;
2653 return viable
? viable
: cands
;
2657 any_strictly_viable (struct z_candidate
*cands
)
2659 for (; cands
; cands
= cands
->next
)
2660 if (cands
->viable
== 1)
2665 /* OBJ is being used in an expression like "OBJ.f (...)". In other
2666 words, it is about to become the "this" pointer for a member
2667 function call. Take the address of the object. */
2670 build_this (tree obj
)
2672 /* In a template, we are only concerned about the type of the
2673 expression, so we can take a shortcut. */
2674 if (processing_template_decl
)
2675 return build_address (obj
);
2677 return cp_build_unary_op (ADDR_EXPR
, obj
, 0, tf_warning_or_error
);
2680 /* Returns true iff functions are equivalent. Equivalent functions are
2681 not '==' only if one is a function-local extern function or if
2682 both are extern "C". */
2685 equal_functions (tree fn1
, tree fn2
)
2687 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
2688 || DECL_EXTERN_C_FUNCTION_P (fn1
))
2689 return decls_match (fn1
, fn2
);
2693 /* Print information about one overload candidate CANDIDATE. MSGSTR
2694 is the text to print before the candidate itself.
2696 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
2697 to have been run through gettext by the caller. This wart makes
2698 life simpler in print_z_candidates and for the translators. */
2701 print_z_candidate (const char *msgstr
, struct z_candidate
*candidate
)
2703 if (TREE_CODE (candidate
->fn
) == IDENTIFIER_NODE
)
2705 if (candidate
->num_convs
== 3)
2706 inform (input_location
, "%s %D(%T, %T, %T) <built-in>", msgstr
, candidate
->fn
,
2707 candidate
->convs
[0]->type
,
2708 candidate
->convs
[1]->type
,
2709 candidate
->convs
[2]->type
);
2710 else if (candidate
->num_convs
== 2)
2711 inform (input_location
, "%s %D(%T, %T) <built-in>", msgstr
, candidate
->fn
,
2712 candidate
->convs
[0]->type
,
2713 candidate
->convs
[1]->type
);
2715 inform (input_location
, "%s %D(%T) <built-in>", msgstr
, candidate
->fn
,
2716 candidate
->convs
[0]->type
);
2718 else if (TYPE_P (candidate
->fn
))
2719 inform (input_location
, "%s %T <conversion>", msgstr
, candidate
->fn
);
2720 else if (candidate
->viable
== -1)
2721 inform (input_location
, "%s %+#D <near match>", msgstr
, candidate
->fn
);
2722 else if (DECL_DELETED_FN (candidate
->fn
))
2723 inform (input_location
, "%s %+#D <deleted>", msgstr
, candidate
->fn
);
2725 inform (input_location
, "%s %+#D", msgstr
, candidate
->fn
);
2729 print_z_candidates (struct z_candidate
*candidates
)
2732 struct z_candidate
*cand1
;
2733 struct z_candidate
**cand2
;
2739 /* Remove deleted candidates. */
2741 for (cand2
= &cand1
; *cand2
; )
2743 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
2744 && DECL_DELETED_FN ((*cand2
)->fn
))
2745 *cand2
= (*cand2
)->next
;
2747 cand2
= &(*cand2
)->next
;
2749 /* ...if there are any non-deleted ones. */
2753 /* There may be duplicates in the set of candidates. We put off
2754 checking this condition as long as possible, since we have no way
2755 to eliminate duplicates from a set of functions in less than n^2
2756 time. Now we are about to emit an error message, so it is more
2757 permissible to go slowly. */
2758 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
2760 tree fn
= cand1
->fn
;
2761 /* Skip builtin candidates and conversion functions. */
2762 if (TREE_CODE (fn
) != FUNCTION_DECL
)
2764 cand2
= &cand1
->next
;
2767 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
2768 && equal_functions (fn
, (*cand2
)->fn
))
2769 *cand2
= (*cand2
)->next
;
2771 cand2
= &(*cand2
)->next
;
2775 str
= candidates
->next
? _("candidates are:") : _("candidate is:");
2777 for (; candidates
; candidates
= candidates
->next
)
2779 print_z_candidate (spaces
? spaces
: str
, candidates
);
2780 spaces
= spaces
? spaces
: get_spaces (str
);
2785 /* USER_SEQ is a user-defined conversion sequence, beginning with a
2786 USER_CONV. STD_SEQ is the standard conversion sequence applied to
2787 the result of the conversion function to convert it to the final
2788 desired type. Merge the two sequences into a single sequence,
2789 and return the merged sequence. */
2792 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
2796 gcc_assert (user_seq
->kind
== ck_user
);
2798 /* Find the end of the second conversion sequence. */
2800 while ((*t
)->kind
!= ck_identity
)
2801 t
= &((*t
)->u
.next
);
2803 /* Replace the identity conversion with the user conversion
2807 /* The entire sequence is a user-conversion sequence. */
2808 std_seq
->user_conv_p
= true;
2813 /* Returns the best overload candidate to perform the requested
2814 conversion. This function is used for three the overloading situations
2815 described in [over.match.copy], [over.match.conv], and [over.match.ref].
2816 If TOTYPE is a REFERENCE_TYPE, we're trying to find an lvalue binding as
2817 per [dcl.init.ref], so we ignore temporary bindings. */
2819 static struct z_candidate
*
2820 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
)
2822 struct z_candidate
*candidates
, *cand
;
2823 tree fromtype
= TREE_TYPE (expr
);
2824 tree ctors
= NULL_TREE
;
2825 tree conv_fns
= NULL_TREE
;
2826 conversion
*conv
= NULL
;
2827 tree first_arg
= NULL_TREE
;
2828 VEC(tree
,gc
) *args
= NULL
;
2832 /* We represent conversion within a hierarchy using RVALUE_CONV and
2833 BASE_CONV, as specified by [over.best.ics]; these become plain
2834 constructor calls, as specified in [dcl.init]. */
2835 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
2836 || !DERIVED_FROM_P (totype
, fromtype
));
2838 if (MAYBE_CLASS_TYPE_P (totype
))
2839 ctors
= lookup_fnfields (totype
, complete_ctor_identifier
, 0);
2841 if (MAYBE_CLASS_TYPE_P (fromtype
))
2843 tree to_nonref
= non_reference (totype
);
2844 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
2845 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
2846 && DERIVED_FROM_P (to_nonref
, fromtype
)))
2848 /* [class.conv.fct] A conversion function is never used to
2849 convert a (possibly cv-qualified) object to the (possibly
2850 cv-qualified) same object type (or a reference to it), to a
2851 (possibly cv-qualified) base class of that type (or a
2852 reference to it)... */
2855 conv_fns
= lookup_conversions (fromtype
,
2856 /*lookup_template_convs_p=*/true);
2860 flags
|= LOOKUP_NO_CONVERSION
;
2862 /* It's OK to bind a temporary for converting constructor arguments, but
2863 not in converting the return value of a conversion operator. */
2864 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
);
2865 flags
&= ~LOOKUP_NO_TEMP_BIND
;
2869 ctors
= BASELINK_FUNCTIONS (ctors
);
2871 first_arg
= build_int_cst (build_pointer_type (totype
), 0);
2872 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
2873 && !TYPE_HAS_LIST_CTOR (totype
))
2875 args
= ctor_to_vec (expr
);
2876 /* We still allow more conversions within an init-list. */
2877 flags
= ((flags
& ~LOOKUP_NO_CONVERSION
)
2878 /* But not for the copy ctor. */
2879 |LOOKUP_NO_COPY_CTOR_CONVERSION
2880 |LOOKUP_NO_NARROWING
);
2883 args
= make_tree_vector_single (expr
);
2885 /* We should never try to call the abstract or base constructor
2887 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors
))
2888 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors
)));
2890 for (; ctors
; ctors
= OVL_NEXT (ctors
))
2892 tree ctor
= OVL_CURRENT (ctors
);
2893 if (DECL_NONCONVERTING_P (ctor
)
2894 && !BRACE_ENCLOSED_INITIALIZER_P (expr
))
2897 if (TREE_CODE (ctor
) == TEMPLATE_DECL
)
2898 cand
= add_template_candidate (&candidates
, ctor
, totype
,
2899 NULL_TREE
, first_arg
, args
, NULL_TREE
,
2900 TYPE_BINFO (totype
),
2901 TYPE_BINFO (totype
),
2905 cand
= add_function_candidate (&candidates
, ctor
, totype
,
2906 first_arg
, args
, TYPE_BINFO (totype
),
2907 TYPE_BINFO (totype
),
2912 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
2914 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
2915 set, then this is copy-initialization. In that case, "The
2916 result of the call is then used to direct-initialize the
2917 object that is the destination of the copy-initialization."
2920 We represent this in the conversion sequence with an
2921 rvalue conversion, which means a constructor call. */
2922 if (TREE_CODE (totype
) != REFERENCE_TYPE
2923 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
2925 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
2930 first_arg
= build_this (expr
);
2932 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
2935 tree conversion_path
= TREE_PURPOSE (conv_fns
);
2937 /* If we are called to convert to a reference type, we are trying to
2938 find an lvalue binding, so don't even consider temporaries. If
2939 we don't find an lvalue binding, the caller will try again to
2940 look for a temporary binding. */
2941 if (TREE_CODE (totype
) == REFERENCE_TYPE
)
2942 convflags
|= LOOKUP_NO_TEMP_BIND
;
2944 for (fns
= TREE_VALUE (conv_fns
); fns
; fns
= OVL_NEXT (fns
))
2946 tree fn
= OVL_CURRENT (fns
);
2947 tree first
= first_arg
;
2949 if (DECL_NONCONVERTING_P (fn
)
2950 && (flags
& LOOKUP_ONLYCONVERTING
))
2953 /* Lambdas have a static conversion op. */
2954 if (DECL_STATIC_FUNCTION_P (fn
))
2957 /* [over.match.funcs] For conversion functions, the function
2958 is considered to be a member of the class of the implicit
2959 object argument for the purpose of defining the type of
2960 the implicit object parameter.
2962 So we pass fromtype as CTYPE to add_*_candidate. */
2964 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2965 cand
= add_template_candidate (&candidates
, fn
, fromtype
,
2967 first
, NULL
, totype
,
2968 TYPE_BINFO (fromtype
),
2973 cand
= add_function_candidate (&candidates
, fn
, fromtype
,
2975 TYPE_BINFO (fromtype
),
2982 = implicit_conversion (totype
,
2983 TREE_TYPE (TREE_TYPE (cand
->fn
)),
2985 /*c_cast_p=*/false, convflags
);
2987 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
2988 copy-initialization. In that case, "The result of the
2989 call is then used to direct-initialize the object that is
2990 the destination of the copy-initialization." [dcl.init]
2992 We represent this in the conversion sequence with an
2993 rvalue conversion, which means a constructor call. But
2994 don't add a second rvalue conversion if there's already
2995 one there. Which there really shouldn't be, but it's
2996 harmless since we'd add it here anyway. */
2997 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
2998 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
2999 ics
= build_conv (ck_rvalue
, totype
, ics
);
3001 cand
->second_conv
= ics
;
3005 else if (candidates
->viable
== 1 && ics
->bad_p
)
3011 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
3015 cand
= tourney (candidates
);
3018 if (flags
& LOOKUP_COMPLAIN
)
3020 error ("conversion from %qT to %qT is ambiguous",
3022 print_z_candidates (candidates
);
3025 cand
= candidates
; /* any one will do */
3026 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
3027 cand
->second_conv
->user_conv_p
= true;
3028 if (!any_strictly_viable (candidates
))
3029 cand
->second_conv
->bad_p
= true;
3030 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3031 ambiguous conversion is no worse than another user-defined
3037 /* Build the user conversion sequence. */
3040 (DECL_CONSTRUCTOR_P (cand
->fn
)
3041 ? totype
: non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)))),
3042 build_identity_conv (TREE_TYPE (expr
), expr
));
3045 /* Remember that this was a list-initialization. */
3046 if (flags
& LOOKUP_NO_NARROWING
)
3047 conv
->check_narrowing
= true;
3049 /* Combine it with the second conversion sequence. */
3050 cand
->second_conv
= merge_conversion_sequences (conv
,
3053 if (cand
->viable
== -1)
3054 cand
->second_conv
->bad_p
= true;
3060 build_user_type_conversion (tree totype
, tree expr
, int flags
)
3062 struct z_candidate
*cand
3063 = build_user_type_conversion_1 (totype
, expr
, flags
);
3067 if (cand
->second_conv
->kind
== ck_ambig
)
3068 return error_mark_node
;
3069 expr
= convert_like (cand
->second_conv
, expr
, tf_warning_or_error
);
3070 return convert_from_reference (expr
);
3075 /* Do any initial processing on the arguments to a function call. */
3077 static VEC(tree
,gc
) *
3078 resolve_args (VEC(tree
,gc
) *args
)
3083 for (ix
= 0; VEC_iterate (tree
, args
, ix
, arg
); ++ix
)
3085 if (error_operand_p (arg
))
3087 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
3089 error ("invalid use of void expression");
3092 else if (invalid_nonstatic_memfn_p (arg
, tf_warning_or_error
))
3098 /* Perform overload resolution on FN, which is called with the ARGS.
3100 Return the candidate function selected by overload resolution, or
3101 NULL if the event that overload resolution failed. In the case
3102 that overload resolution fails, *CANDIDATES will be the set of
3103 candidates considered, and ANY_VIABLE_P will be set to true or
3104 false to indicate whether or not any of the candidates were
3107 The ARGS should already have gone through RESOLVE_ARGS before this
3108 function is called. */
3110 static struct z_candidate
*
3111 perform_overload_resolution (tree fn
,
3112 const VEC(tree
,gc
) *args
,
3113 struct z_candidate
**candidates
,
3116 struct z_candidate
*cand
;
3117 tree explicit_targs
= NULL_TREE
;
3118 int template_only
= 0;
3121 *any_viable_p
= true;
3124 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
3125 || TREE_CODE (fn
) == TEMPLATE_DECL
3126 || TREE_CODE (fn
) == OVERLOAD
3127 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
3129 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3131 explicit_targs
= TREE_OPERAND (fn
, 1);
3132 fn
= TREE_OPERAND (fn
, 0);
3136 /* Add the various candidate functions. */
3137 add_candidates (fn
, args
, explicit_targs
, template_only
,
3138 /*conversion_path=*/NULL_TREE
,
3139 /*access_path=*/NULL_TREE
,
3143 *candidates
= splice_viable (*candidates
, pedantic
, any_viable_p
);
3147 cand
= tourney (*candidates
);
3151 /* Return an expression for a call to FN (a namespace-scope function,
3152 or a static member function) with the ARGS. This may change
3156 build_new_function_call (tree fn
, VEC(tree
,gc
) **args
, bool koenig_p
,
3157 tsubst_flags_t complain
)
3159 struct z_candidate
*candidates
, *cand
;
3164 if (args
!= NULL
&& *args
!= NULL
)
3166 *args
= resolve_args (*args
);
3168 return error_mark_node
;
3171 /* If this function was found without using argument dependent
3172 lookup, then we want to ignore any undeclared friend
3178 fn
= remove_hidden_names (fn
);
3181 if (complain
& tf_error
)
3182 error ("no matching function for call to %<%D(%A)%>",
3183 DECL_NAME (OVL_CURRENT (orig_fn
)),
3184 build_tree_list_vec (*args
));
3185 return error_mark_node
;
3189 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3190 p
= conversion_obstack_alloc (0);
3192 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
);
3196 if (complain
& tf_error
)
3198 if (!any_viable_p
&& candidates
&& ! candidates
->next
)
3199 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
3200 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3201 fn
= TREE_OPERAND (fn
, 0);
3203 error ("no matching function for call to %<%D(%A)%>",
3204 DECL_NAME (OVL_CURRENT (fn
)), build_tree_list_vec (*args
));
3206 error ("call of overloaded %<%D(%A)%> is ambiguous",
3207 DECL_NAME (OVL_CURRENT (fn
)), build_tree_list_vec (*args
));
3209 print_z_candidates (candidates
);
3211 result
= error_mark_node
;
3214 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
3216 /* Free all the conversions we allocated. */
3217 obstack_free (&conversion_obstack
, p
);
3222 /* Build a call to a global operator new. FNNAME is the name of the
3223 operator (either "operator new" or "operator new[]") and ARGS are
3224 the arguments provided. This may change ARGS. *SIZE points to the
3225 total number of bytes required by the allocation, and is updated if
3226 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
3227 be used. If this function determines that no cookie should be
3228 used, after all, *COOKIE_SIZE is set to NULL_TREE. If FN is
3229 non-NULL, it will be set, upon return, to the allocation function
3233 build_operator_new_call (tree fnname
, VEC(tree
,gc
) **args
,
3234 tree
*size
, tree
*cookie_size
,
3238 struct z_candidate
*candidates
;
3239 struct z_candidate
*cand
;
3244 VEC_safe_insert (tree
, gc
, *args
, 0, *size
);
3245 *args
= resolve_args (*args
);
3247 return error_mark_node
;
3253 If this lookup fails to find the name, or if the allocated type
3254 is not a class type, the allocation function's name is looked
3255 up in the global scope.
3257 we disregard block-scope declarations of "operator new". */
3258 fns
= lookup_function_nonclass (fnname
, *args
, /*block_p=*/false);
3260 /* Figure out what function is being called. */
3261 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
);
3263 /* If no suitable function could be found, issue an error message
3268 error ("no matching function for call to %<%D(%A)%>",
3269 DECL_NAME (OVL_CURRENT (fns
)), build_tree_list_vec (*args
));
3271 error ("call of overloaded %<%D(%A)%> is ambiguous",
3272 DECL_NAME (OVL_CURRENT (fns
)), build_tree_list_vec (*args
));
3274 print_z_candidates (candidates
);
3275 return error_mark_node
;
3278 /* If a cookie is required, add some extra space. Whether
3279 or not a cookie is required cannot be determined until
3280 after we know which function was called. */
3283 bool use_cookie
= true;
3284 if (!abi_version_at_least (2))
3286 /* In G++ 3.2, the check was implemented incorrectly; it
3287 looked at the placement expression, rather than the
3288 type of the function. */
3289 if (VEC_length (tree
, *args
) == 2
3290 && same_type_p (TREE_TYPE (VEC_index (tree
, *args
, 1)),
3298 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
3299 /* Skip the size_t parameter. */
3300 arg_types
= TREE_CHAIN (arg_types
);
3301 /* Check the remaining parameters (if any). */
3303 && TREE_CHAIN (arg_types
) == void_list_node
3304 && same_type_p (TREE_VALUE (arg_types
),
3308 /* If we need a cookie, adjust the number of bytes allocated. */
3311 /* Update the total size. */
3312 *size
= size_binop (PLUS_EXPR
, *size
, *cookie_size
);
3313 /* Update the argument list to reflect the adjusted size. */
3314 VEC_replace (tree
, *args
, 0, *size
);
3317 *cookie_size
= NULL_TREE
;
3320 /* Tell our caller which function we decided to call. */
3324 /* Build the CALL_EXPR. */
3325 return build_over_call (cand
, LOOKUP_NORMAL
, tf_warning_or_error
);
3328 /* Build a new call to operator(). This may change ARGS. */
3331 build_op_call (tree obj
, VEC(tree
,gc
) **args
, tsubst_flags_t complain
)
3333 struct z_candidate
*candidates
= 0, *cand
;
3334 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
3335 tree type
= TREE_TYPE (obj
);
3337 tree result
= NULL_TREE
;
3340 if (error_operand_p (obj
))
3341 return error_mark_node
;
3343 obj
= prep_operand (obj
);
3345 if (TYPE_PTRMEMFUNC_P (type
))
3347 if (complain
& tf_error
)
3348 /* It's no good looking for an overloaded operator() on a
3349 pointer-to-member-function. */
3350 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj
);
3351 return error_mark_node
;
3354 if (TYPE_BINFO (type
))
3356 fns
= lookup_fnfields (TYPE_BINFO (type
), ansi_opname (CALL_EXPR
), 1);
3357 if (fns
== error_mark_node
)
3358 return error_mark_node
;
3363 if (args
!= NULL
&& *args
!= NULL
)
3365 *args
= resolve_args (*args
);
3367 return error_mark_node
;
3370 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3371 p
= conversion_obstack_alloc (0);
3375 tree base
= BINFO_TYPE (BASELINK_BINFO (fns
));
3376 first_mem_arg
= build_this (obj
);
3378 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
3380 tree fn
= OVL_CURRENT (fns
);
3382 tree lfirst
= first_mem_arg
;
3383 if (DECL_STATIC_FUNCTION_P (fn
))
3386 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
3387 add_template_candidate (&candidates
, fn
, base
, NULL_TREE
,
3388 lfirst
, *args
, NULL_TREE
,
3391 LOOKUP_NORMAL
, DEDUCE_CALL
);
3393 add_function_candidate
3394 (&candidates
, fn
, base
, lfirst
, *args
, TYPE_BINFO (type
),
3395 TYPE_BINFO (type
), LOOKUP_NORMAL
);
3399 /* Rather than mess with handling static conversion ops here, just don't
3400 look at conversions in lambdas. */
3401 if (LAMBDA_TYPE_P (type
))
3404 convs
= lookup_conversions (type
, /*lookup_template_convs_p=*/true);
3406 for (; convs
; convs
= TREE_CHAIN (convs
))
3408 tree fns
= TREE_VALUE (convs
);
3409 tree totype
= TREE_TYPE (convs
);
3411 if ((TREE_CODE (totype
) == POINTER_TYPE
3412 && TREE_CODE (TREE_TYPE (totype
)) == FUNCTION_TYPE
)
3413 || (TREE_CODE (totype
) == REFERENCE_TYPE
3414 && TREE_CODE (TREE_TYPE (totype
)) == FUNCTION_TYPE
)
3415 || (TREE_CODE (totype
) == REFERENCE_TYPE
3416 && TREE_CODE (TREE_TYPE (totype
)) == POINTER_TYPE
3417 && TREE_CODE (TREE_TYPE (TREE_TYPE (totype
))) == FUNCTION_TYPE
))
3418 for (; fns
; fns
= OVL_NEXT (fns
))
3420 tree fn
= OVL_CURRENT (fns
);
3422 if (DECL_NONCONVERTING_P (fn
))
3425 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
3426 add_template_conv_candidate
3427 (&candidates
, fn
, obj
, NULL_TREE
, *args
, totype
,
3428 /*access_path=*/NULL_TREE
,
3429 /*conversion_path=*/NULL_TREE
);
3431 add_conv_candidate (&candidates
, fn
, obj
, NULL_TREE
,
3432 *args
, /*conversion_path=*/NULL_TREE
,
3433 /*access_path=*/NULL_TREE
);
3437 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
3440 if (complain
& tf_error
)
3442 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
3443 build_tree_list_vec (*args
));
3444 print_z_candidates (candidates
);
3446 result
= error_mark_node
;
3450 cand
= tourney (candidates
);
3453 if (complain
& tf_error
)
3455 error ("call of %<(%T) (%A)%> is ambiguous",
3456 TREE_TYPE (obj
), build_tree_list_vec (*args
));
3457 print_z_candidates (candidates
);
3459 result
= error_mark_node
;
3461 /* Since cand->fn will be a type, not a function, for a conversion
3462 function, we must be careful not to unconditionally look at
3464 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
3465 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
) == CALL_EXPR
)
3466 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
3469 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
, -1,
3471 obj
= convert_from_reference (obj
);
3472 result
= cp_build_function_call_vec (obj
, args
, complain
);
3476 /* Free all the conversions we allocated. */
3477 obstack_free (&conversion_obstack
, p
);
3483 op_error (enum tree_code code
, enum tree_code code2
,
3484 tree arg1
, tree arg2
, tree arg3
, bool match
)
3488 if (code
== MODIFY_EXPR
)
3489 opname
= assignment_operator_name_info
[code2
].name
;
3491 opname
= operator_name_info
[code
].name
;
3497 error ("ambiguous overload for ternary %<operator?:%> "
3498 "in %<%E ? %E : %E%>", arg1
, arg2
, arg3
);
3500 error ("no match for ternary %<operator?:%> "
3501 "in %<%E ? %E : %E%>", arg1
, arg2
, arg3
);
3504 case POSTINCREMENT_EXPR
:
3505 case POSTDECREMENT_EXPR
:
3507 error ("ambiguous overload for %<operator%s%> in %<%E%s%>",
3508 opname
, arg1
, opname
);
3510 error ("no match for %<operator%s%> in %<%E%s%>",
3511 opname
, arg1
, opname
);
3516 error ("ambiguous overload for %<operator[]%> in %<%E[%E]%>",
3519 error ("no match for %<operator[]%> in %<%E[%E]%>",
3526 error ("ambiguous overload for %qs in %<%s %E%>",
3527 opname
, opname
, arg1
);
3529 error ("no match for %qs in %<%s %E%>",
3530 opname
, opname
, arg1
);
3536 error ("ambiguous overload for %<operator%s%> in %<%E %s %E%>",
3537 opname
, arg1
, opname
, arg2
);
3539 error ("no match for %<operator%s%> in %<%E %s %E%>",
3540 opname
, arg1
, opname
, arg2
);
3543 error ("ambiguous overload for %<operator%s%> in %<%s%E%>",
3544 opname
, opname
, arg1
);
3546 error ("no match for %<operator%s%> in %<%s%E%>",
3547 opname
, opname
, arg1
);
3552 /* Return the implicit conversion sequence that could be used to
3553 convert E1 to E2 in [expr.cond]. */
3556 conditional_conversion (tree e1
, tree e2
)
3558 tree t1
= non_reference (TREE_TYPE (e1
));
3559 tree t2
= non_reference (TREE_TYPE (e2
));
3565 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
3566 implicitly converted (clause _conv_) to the type "reference to
3567 T2", subject to the constraint that in the conversion the
3568 reference must bind directly (_dcl.init.ref_) to E1. */
3569 if (real_lvalue_p (e2
))
3571 conv
= implicit_conversion (build_reference_type (t2
),
3575 LOOKUP_NO_TEMP_BIND
|LOOKUP_ONLYCONVERTING
);
3582 If E1 and E2 have class type, and the underlying class types are
3583 the same or one is a base class of the other: E1 can be converted
3584 to match E2 if the class of T2 is the same type as, or a base
3585 class of, the class of T1, and the cv-qualification of T2 is the
3586 same cv-qualification as, or a greater cv-qualification than, the
3587 cv-qualification of T1. If the conversion is applied, E1 is
3588 changed to an rvalue of type T2 that still refers to the original
3589 source class object (or the appropriate subobject thereof). */
3590 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
3591 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
3593 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
3595 conv
= build_identity_conv (t1
, e1
);
3596 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
3597 TYPE_MAIN_VARIANT (t2
)))
3598 conv
= build_conv (ck_base
, t2
, conv
);
3600 conv
= build_conv (ck_rvalue
, t2
, conv
);
3609 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
3610 converted to the type that expression E2 would have if E2 were
3611 converted to an rvalue (or the type it has, if E2 is an rvalue). */
3612 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
3616 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
3617 arguments to the conditional expression. */
3620 build_conditional_expr (tree arg1
, tree arg2
, tree arg3
,
3621 tsubst_flags_t complain
)
3625 tree result
= NULL_TREE
;
3627 tree result_type
= NULL_TREE
;
3628 bool lvalue_p
= true;
3629 struct z_candidate
*candidates
= 0;
3630 struct z_candidate
*cand
;
3633 /* As a G++ extension, the second argument to the conditional can be
3634 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
3635 c'.) If the second operand is omitted, make sure it is
3636 calculated only once. */
3639 if (complain
& tf_error
)
3640 pedwarn (input_location
, OPT_pedantic
,
3641 "ISO C++ forbids omitting the middle term of a ?: expression");
3643 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
3644 if (real_lvalue_p (arg1
))
3645 arg2
= arg1
= stabilize_reference (arg1
);
3647 arg2
= arg1
= save_expr (arg1
);
3652 The first expression is implicitly converted to bool (clause
3654 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
3657 /* If something has already gone wrong, just pass that fact up the
3659 if (error_operand_p (arg1
)
3660 || error_operand_p (arg2
)
3661 || error_operand_p (arg3
))
3662 return error_mark_node
;
3666 If either the second or the third operand has type (possibly
3667 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
3668 array-to-pointer (_conv.array_), and function-to-pointer
3669 (_conv.func_) standard conversions are performed on the second
3670 and third operands. */
3671 arg2_type
= unlowered_expr_type (arg2
);
3672 arg3_type
= unlowered_expr_type (arg3
);
3673 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
3675 /* Do the conversions. We don't these for `void' type arguments
3676 since it can't have any effect and since decay_conversion
3677 does not handle that case gracefully. */
3678 if (!VOID_TYPE_P (arg2_type
))
3679 arg2
= decay_conversion (arg2
);
3680 if (!VOID_TYPE_P (arg3_type
))
3681 arg3
= decay_conversion (arg3
);
3682 arg2_type
= TREE_TYPE (arg2
);
3683 arg3_type
= TREE_TYPE (arg3
);
3687 One of the following shall hold:
3689 --The second or the third operand (but not both) is a
3690 throw-expression (_except.throw_); the result is of the
3691 type of the other and is an rvalue.
3693 --Both the second and the third operands have type void; the
3694 result is of type void and is an rvalue.
3696 We must avoid calling force_rvalue for expressions of type
3697 "void" because it will complain that their value is being
3699 if (TREE_CODE (arg2
) == THROW_EXPR
3700 && TREE_CODE (arg3
) != THROW_EXPR
)
3702 if (!VOID_TYPE_P (arg3_type
))
3703 arg3
= force_rvalue (arg3
);
3704 arg3_type
= TREE_TYPE (arg3
);
3705 result_type
= arg3_type
;
3707 else if (TREE_CODE (arg2
) != THROW_EXPR
3708 && TREE_CODE (arg3
) == THROW_EXPR
)
3710 if (!VOID_TYPE_P (arg2_type
))
3711 arg2
= force_rvalue (arg2
);
3712 arg2_type
= TREE_TYPE (arg2
);
3713 result_type
= arg2_type
;
3715 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
3716 result_type
= void_type_node
;
3719 if (complain
& tf_error
)
3721 if (VOID_TYPE_P (arg2_type
))
3722 error ("second operand to the conditional operator "
3723 "is of type %<void%>, "
3724 "but the third operand is neither a throw-expression "
3725 "nor of type %<void%>");
3727 error ("third operand to the conditional operator "
3728 "is of type %<void%>, "
3729 "but the second operand is neither a throw-expression "
3730 "nor of type %<void%>");
3732 return error_mark_node
;
3736 goto valid_operands
;
3740 Otherwise, if the second and third operand have different types,
3741 and either has (possibly cv-qualified) class type, an attempt is
3742 made to convert each of those operands to the type of the other. */
3743 else if (!same_type_p (arg2_type
, arg3_type
)
3744 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
3749 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3750 p
= conversion_obstack_alloc (0);
3752 conv2
= conditional_conversion (arg2
, arg3
);
3753 conv3
= conditional_conversion (arg3
, arg2
);
3757 If both can be converted, or one can be converted but the
3758 conversion is ambiguous, the program is ill-formed. If
3759 neither can be converted, the operands are left unchanged and
3760 further checking is performed as described below. If exactly
3761 one conversion is possible, that conversion is applied to the
3762 chosen operand and the converted operand is used in place of
3763 the original operand for the remainder of this section. */
3764 if ((conv2
&& !conv2
->bad_p
3765 && conv3
&& !conv3
->bad_p
)
3766 || (conv2
&& conv2
->kind
== ck_ambig
)
3767 || (conv3
&& conv3
->kind
== ck_ambig
))
3769 error ("operands to ?: have different types %qT and %qT",
3770 arg2_type
, arg3_type
);
3771 result
= error_mark_node
;
3773 else if (conv2
&& (!conv2
->bad_p
|| !conv3
))
3775 arg2
= convert_like (conv2
, arg2
, complain
);
3776 arg2
= convert_from_reference (arg2
);
3777 arg2_type
= TREE_TYPE (arg2
);
3778 /* Even if CONV2 is a valid conversion, the result of the
3779 conversion may be invalid. For example, if ARG3 has type
3780 "volatile X", and X does not have a copy constructor
3781 accepting a "volatile X&", then even if ARG2 can be
3782 converted to X, the conversion will fail. */
3783 if (error_operand_p (arg2
))
3784 result
= error_mark_node
;
3786 else if (conv3
&& (!conv3
->bad_p
|| !conv2
))
3788 arg3
= convert_like (conv3
, arg3
, complain
);
3789 arg3
= convert_from_reference (arg3
);
3790 arg3_type
= TREE_TYPE (arg3
);
3791 if (error_operand_p (arg3
))
3792 result
= error_mark_node
;
3795 /* Free all the conversions we allocated. */
3796 obstack_free (&conversion_obstack
, p
);
3801 /* If, after the conversion, both operands have class type,
3802 treat the cv-qualification of both operands as if it were the
3803 union of the cv-qualification of the operands.
3805 The standard is not clear about what to do in this
3806 circumstance. For example, if the first operand has type
3807 "const X" and the second operand has a user-defined
3808 conversion to "volatile X", what is the type of the second
3809 operand after this step? Making it be "const X" (matching
3810 the first operand) seems wrong, as that discards the
3811 qualification without actually performing a copy. Leaving it
3812 as "volatile X" seems wrong as that will result in the
3813 conditional expression failing altogether, even though,
3814 according to this step, the one operand could be converted to
3815 the type of the other. */
3816 if ((conv2
|| conv3
)
3817 && CLASS_TYPE_P (arg2_type
)
3818 && TYPE_QUALS (arg2_type
) != TYPE_QUALS (arg3_type
))
3819 arg2_type
= arg3_type
=
3820 cp_build_qualified_type (arg2_type
,
3821 TYPE_QUALS (arg2_type
)
3822 | TYPE_QUALS (arg3_type
));
3827 If the second and third operands are lvalues and have the same
3828 type, the result is of that type and is an lvalue. */
3829 if (real_lvalue_p (arg2
)
3830 && real_lvalue_p (arg3
)
3831 && same_type_p (arg2_type
, arg3_type
))
3833 result_type
= arg2_type
;
3834 goto valid_operands
;
3839 Otherwise, the result is an rvalue. If the second and third
3840 operand do not have the same type, and either has (possibly
3841 cv-qualified) class type, overload resolution is used to
3842 determine the conversions (if any) to be applied to the operands
3843 (_over.match.oper_, _over.built_). */
3845 if (!same_type_p (arg2_type
, arg3_type
)
3846 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
3852 /* Rearrange the arguments so that add_builtin_candidate only has
3853 to know about two args. In build_builtin_candidate, the
3854 arguments are unscrambled. */
3858 add_builtin_candidates (&candidates
,
3861 ansi_opname (COND_EXPR
),
3867 If the overload resolution fails, the program is
3869 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
3872 if (complain
& tf_error
)
3874 op_error (COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
3875 print_z_candidates (candidates
);
3877 return error_mark_node
;
3879 cand
= tourney (candidates
);
3882 if (complain
& tf_error
)
3884 op_error (COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
3885 print_z_candidates (candidates
);
3887 return error_mark_node
;
3892 Otherwise, the conversions thus determined are applied, and
3893 the converted operands are used in place of the original
3894 operands for the remainder of this section. */
3895 conv
= cand
->convs
[0];
3896 arg1
= convert_like (conv
, arg1
, complain
);
3897 conv
= cand
->convs
[1];
3898 arg2
= convert_like (conv
, arg2
, complain
);
3899 arg2_type
= TREE_TYPE (arg2
);
3900 conv
= cand
->convs
[2];
3901 arg3
= convert_like (conv
, arg3
, complain
);
3902 arg3_type
= TREE_TYPE (arg3
);
3907 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
3908 and function-to-pointer (_conv.func_) standard conversions are
3909 performed on the second and third operands.
3911 We need to force the lvalue-to-rvalue conversion here for class types,
3912 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
3913 that isn't wrapped with a TARGET_EXPR plays havoc with exception
3916 arg2
= force_rvalue (arg2
);
3917 if (!CLASS_TYPE_P (arg2_type
))
3918 arg2_type
= TREE_TYPE (arg2
);
3920 arg3
= force_rvalue (arg3
);
3921 if (!CLASS_TYPE_P (arg3_type
))
3922 arg3_type
= TREE_TYPE (arg3
);
3924 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
3925 return error_mark_node
;
3929 After those conversions, one of the following shall hold:
3931 --The second and third operands have the same type; the result is of
3933 if (same_type_p (arg2_type
, arg3_type
))
3934 result_type
= arg2_type
;
3937 --The second and third operands have arithmetic or enumeration
3938 type; the usual arithmetic conversions are performed to bring
3939 them to a common type, and the result is of that type. */
3940 else if ((ARITHMETIC_TYPE_P (arg2_type
)
3941 || UNSCOPED_ENUM_P (arg2_type
))
3942 && (ARITHMETIC_TYPE_P (arg3_type
)
3943 || UNSCOPED_ENUM_P (arg3_type
)))
3945 /* In this case, there is always a common type. */
3946 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
3949 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
3950 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
3952 if (complain
& tf_warning
)
3954 "enumeral mismatch in conditional expression: %qT vs %qT",
3955 arg2_type
, arg3_type
);
3957 else if (extra_warnings
3958 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
3959 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
3960 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
3961 && !same_type_p (arg2_type
, type_promotes_to (arg3_type
)))))
3963 if (complain
& tf_warning
)
3965 "enumeral and non-enumeral type in conditional expression");
3968 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
3969 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
3973 --The second and third operands have pointer type, or one has
3974 pointer type and the other is a null pointer constant; pointer
3975 conversions (_conv.ptr_) and qualification conversions
3976 (_conv.qual_) are performed to bring them to their composite
3977 pointer type (_expr.rel_). The result is of the composite
3980 --The second and third operands have pointer to member type, or
3981 one has pointer to member type and the other is a null pointer
3982 constant; pointer to member conversions (_conv.mem_) and
3983 qualification conversions (_conv.qual_) are performed to bring
3984 them to a common type, whose cv-qualification shall match the
3985 cv-qualification of either the second or the third operand.
3986 The result is of the common type. */
3987 else if ((null_ptr_cst_p (arg2
)
3988 && (TYPE_PTR_P (arg3_type
) || TYPE_PTR_TO_MEMBER_P (arg3_type
)))
3989 || (null_ptr_cst_p (arg3
)
3990 && (TYPE_PTR_P (arg2_type
) || TYPE_PTR_TO_MEMBER_P (arg2_type
)))
3991 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
3992 || (TYPE_PTRMEM_P (arg2_type
) && TYPE_PTRMEM_P (arg3_type
))
3993 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
3995 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
3996 arg3
, CPO_CONDITIONAL_EXPR
,
3998 if (result_type
== error_mark_node
)
3999 return error_mark_node
;
4000 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
4001 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
4006 if (complain
& tf_error
)
4007 error ("operands to ?: have different types %qT and %qT",
4008 arg2_type
, arg3_type
);
4009 return error_mark_node
;
4013 result_save
= build3 (COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
4014 result
= fold_if_not_in_template (result_save
);
4016 if (cp_unevaluated_operand
&& TREE_CODE (result
) == CALL_EXPR
)
4017 /* Avoid folding to a CALL_EXPR within decltype (c++/42013). */
4018 result
= result_save
;
4020 /* We can't use result_type below, as fold might have returned a
4025 /* Expand both sides into the same slot, hopefully the target of
4026 the ?: expression. We used to check for TARGET_EXPRs here,
4027 but now we sometimes wrap them in NOP_EXPRs so the test would
4029 if (CLASS_TYPE_P (TREE_TYPE (result
)))
4030 result
= get_target_expr (result
);
4031 /* If this expression is an rvalue, but might be mistaken for an
4032 lvalue, we must add a NON_LVALUE_EXPR. */
4033 result
= rvalue (result
);
4039 /* OPERAND is an operand to an expression. Perform necessary steps
4040 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
4044 prep_operand (tree operand
)
4048 if (CLASS_TYPE_P (TREE_TYPE (operand
))
4049 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
4050 /* Make sure the template type is instantiated now. */
4051 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
4057 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
4058 OVERLOAD) to the CANDIDATES, returning an updated list of
4059 CANDIDATES. The ARGS are the arguments provided to the call,
4060 without any implicit object parameter. This may change ARGS. The
4061 EXPLICIT_TARGS are explicit template arguments provided.
4062 TEMPLATE_ONLY is true if only template functions should be
4063 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
4064 add_function_candidate. */
4067 add_candidates (tree fns
, const VEC(tree
,gc
) *args
,
4068 tree explicit_targs
, bool template_only
,
4069 tree conversion_path
, tree access_path
,
4071 struct z_candidate
**candidates
)
4074 VEC(tree
,gc
) *non_static_args
;
4077 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
4078 /* Delay creating the implicit this parameter until it is needed. */
4079 non_static_args
= NULL
;
4080 first_arg
= NULL_TREE
;
4086 const VEC(tree
,gc
) *fn_args
;
4088 fn
= OVL_CURRENT (fns
);
4089 /* Figure out which set of arguments to use. */
4090 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
4092 /* If this function is a non-static member, prepend the implicit
4093 object parameter. */
4094 if (non_static_args
== NULL
)
4099 non_static_args
= VEC_alloc (tree
, gc
,
4100 VEC_length (tree
, args
) - 1);
4101 for (ix
= 1; VEC_iterate (tree
, args
, ix
, arg
); ++ix
)
4102 VEC_quick_push (tree
, non_static_args
, arg
);
4104 if (first_arg
== NULL_TREE
)
4105 first_arg
= build_this (VEC_index (tree
, args
, 0));
4106 fn_first_arg
= first_arg
;
4107 fn_args
= non_static_args
;
4111 /* Otherwise, just use the list of arguments provided. */
4112 fn_first_arg
= NULL_TREE
;
4116 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4117 add_template_candidate (candidates
,
4128 else if (!template_only
)
4129 add_function_candidate (candidates
,
4137 fns
= OVL_NEXT (fns
);
4141 /* Even unsigned enum types promote to signed int. We don't want to
4142 issue -Wsign-compare warnings for this case. Here ORIG_ARG is the
4143 original argument and ARG is the argument after any conversions
4144 have been applied. We set TREE_NO_WARNING if we have added a cast
4145 from an unsigned enum type to a signed integer type. */
4148 avoid_sign_compare_warnings (tree orig_arg
, tree arg
)
4150 if (orig_arg
!= NULL_TREE
4153 && TREE_CODE (TREE_TYPE (orig_arg
)) == ENUMERAL_TYPE
4154 && TYPE_UNSIGNED (TREE_TYPE (orig_arg
))
4155 && INTEGRAL_TYPE_P (TREE_TYPE (arg
))
4156 && !TYPE_UNSIGNED (TREE_TYPE (arg
)))
4157 TREE_NO_WARNING (arg
) = 1;
4161 build_new_op (enum tree_code code
, int flags
, tree arg1
, tree arg2
, tree arg3
,
4162 bool *overloaded_p
, tsubst_flags_t complain
)
4164 tree orig_arg1
= arg1
;
4165 tree orig_arg2
= arg2
;
4166 tree orig_arg3
= arg3
;
4167 struct z_candidate
*candidates
= 0, *cand
;
4168 VEC(tree
,gc
) *arglist
;
4171 tree result
= NULL_TREE
;
4172 bool result_valid_p
= false;
4173 enum tree_code code2
= NOP_EXPR
;
4174 enum tree_code code_orig_arg1
= ERROR_MARK
;
4175 enum tree_code code_orig_arg2
= ERROR_MARK
;
4181 if (error_operand_p (arg1
)
4182 || error_operand_p (arg2
)
4183 || error_operand_p (arg3
))
4184 return error_mark_node
;
4186 if (code
== MODIFY_EXPR
)
4188 code2
= TREE_CODE (arg3
);
4190 fnname
= ansi_assopname (code2
);
4193 fnname
= ansi_opname (code
);
4195 arg1
= prep_operand (arg1
);
4201 case VEC_DELETE_EXPR
:
4203 /* Use build_op_new_call and build_op_delete_call instead. */
4207 /* Use build_op_call instead. */
4210 case TRUTH_ORIF_EXPR
:
4211 case TRUTH_ANDIF_EXPR
:
4212 case TRUTH_AND_EXPR
:
4214 /* These are saved for the sake of warn_logical_operator. */
4215 code_orig_arg1
= TREE_CODE (arg1
);
4216 code_orig_arg2
= TREE_CODE (arg2
);
4222 arg2
= prep_operand (arg2
);
4223 arg3
= prep_operand (arg3
);
4225 if (code
== COND_EXPR
)
4226 /* Use build_conditional_expr instead. */
4228 else if (! IS_OVERLOAD_TYPE (TREE_TYPE (arg1
))
4229 && (! arg2
|| ! IS_OVERLOAD_TYPE (TREE_TYPE (arg2
))))
4232 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
4233 arg2
= integer_zero_node
;
4235 arglist
= VEC_alloc (tree
, gc
, 3);
4236 VEC_quick_push (tree
, arglist
, arg1
);
4237 if (arg2
!= NULL_TREE
)
4238 VEC_quick_push (tree
, arglist
, arg2
);
4239 if (arg3
!= NULL_TREE
)
4240 VEC_quick_push (tree
, arglist
, arg3
);
4242 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4243 p
= conversion_obstack_alloc (0);
4245 /* Add namespace-scope operators to the list of functions to
4247 add_candidates (lookup_function_nonclass (fnname
, arglist
, /*block_p=*/true),
4248 arglist
, NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
4249 flags
, &candidates
);
4250 /* Add class-member operators to the candidate set. */
4251 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
4255 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
4256 if (fns
== error_mark_node
)
4258 result
= error_mark_node
;
4259 goto user_defined_result_ready
;
4262 add_candidates (BASELINK_FUNCTIONS (fns
), arglist
,
4264 BASELINK_BINFO (fns
),
4265 TYPE_BINFO (TREE_TYPE (arg1
)),
4266 flags
, &candidates
);
4271 args
[2] = NULL_TREE
;
4273 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
, flags
);
4279 /* For these, the built-in candidates set is empty
4280 [over.match.oper]/3. We don't want non-strict matches
4281 because exact matches are always possible with built-in
4282 operators. The built-in candidate set for COMPONENT_REF
4283 would be empty too, but since there are no such built-in
4284 operators, we accept non-strict matches for them. */
4289 strict_p
= pedantic
;
4293 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
4298 case POSTINCREMENT_EXPR
:
4299 case POSTDECREMENT_EXPR
:
4300 /* Don't try anything fancy if we're not allowed to produce
4302 if (!(complain
& tf_error
))
4303 return error_mark_node
;
4305 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
4306 distinguish between prefix and postfix ++ and
4307 operator++() was used for both, so we allow this with
4309 if (flags
& LOOKUP_COMPLAIN
)
4311 const char *msg
= (flag_permissive
)
4312 ? G_("no %<%D(int)%> declared for postfix %qs,"
4313 " trying prefix operator instead")
4314 : G_("no %<%D(int)%> declared for postfix %qs");
4315 permerror (input_location
, msg
, fnname
,
4316 operator_name_info
[code
].name
);
4319 if (!flag_permissive
)
4320 return error_mark_node
;
4322 if (code
== POSTINCREMENT_EXPR
)
4323 code
= PREINCREMENT_EXPR
;
4325 code
= PREDECREMENT_EXPR
;
4326 result
= build_new_op (code
, flags
, arg1
, NULL_TREE
, NULL_TREE
,
4327 overloaded_p
, complain
);
4330 /* The caller will deal with these. */
4335 result_valid_p
= true;
4339 if ((flags
& LOOKUP_COMPLAIN
) && (complain
& tf_error
))
4341 /* If one of the arguments of the operator represents
4342 an invalid use of member function pointer, try to report
4343 a meaningful error ... */
4344 if (invalid_nonstatic_memfn_p (arg1
, tf_error
)
4345 || invalid_nonstatic_memfn_p (arg2
, tf_error
)
4346 || invalid_nonstatic_memfn_p (arg3
, tf_error
))
4347 /* We displayed the error message. */;
4350 /* ... Otherwise, report the more generic
4351 "no matching operator found" error */
4352 op_error (code
, code2
, arg1
, arg2
, arg3
, FALSE
);
4353 print_z_candidates (candidates
);
4356 result
= error_mark_node
;
4362 cand
= tourney (candidates
);
4365 if ((flags
& LOOKUP_COMPLAIN
) && (complain
& tf_error
))
4367 op_error (code
, code2
, arg1
, arg2
, arg3
, TRUE
);
4368 print_z_candidates (candidates
);
4370 result
= error_mark_node
;
4372 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
4375 *overloaded_p
= true;
4377 if (resolve_args (arglist
) == NULL
)
4378 result
= error_mark_node
;
4380 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4384 /* Give any warnings we noticed during overload resolution. */
4385 if (cand
->warnings
&& (complain
& tf_warning
))
4387 struct candidate_warning
*w
;
4388 for (w
= cand
->warnings
; w
; w
= w
->next
)
4389 joust (cand
, w
->loser
, 1);
4392 /* Check for comparison of different enum types. */
4401 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
4402 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
4403 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
4404 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
4405 && (complain
& tf_warning
))
4407 warning (OPT_Wenum_compare
,
4408 "comparison between %q#T and %q#T",
4409 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4416 /* We need to strip any leading REF_BIND so that bitfields
4417 don't cause errors. This should not remove any important
4418 conversions, because builtins don't apply to class
4419 objects directly. */
4420 conv
= cand
->convs
[0];
4421 if (conv
->kind
== ck_ref_bind
)
4422 conv
= conv
->u
.next
;
4423 arg1
= convert_like (conv
, arg1
, complain
);
4427 /* We need to call warn_logical_operator before
4428 converting arg2 to a boolean_type. */
4429 if (complain
& tf_warning
)
4430 warn_logical_operator (input_location
, code
, boolean_type_node
,
4431 code_orig_arg1
, arg1
,
4432 code_orig_arg2
, arg2
);
4434 conv
= cand
->convs
[1];
4435 if (conv
->kind
== ck_ref_bind
)
4436 conv
= conv
->u
.next
;
4437 arg2
= convert_like (conv
, arg2
, complain
);
4441 conv
= cand
->convs
[2];
4442 if (conv
->kind
== ck_ref_bind
)
4443 conv
= conv
->u
.next
;
4444 arg3
= convert_like (conv
, arg3
, complain
);
4450 user_defined_result_ready
:
4452 /* Free all the conversions we allocated. */
4453 obstack_free (&conversion_obstack
, p
);
4455 if (result
|| result_valid_p
)
4459 avoid_sign_compare_warnings (orig_arg1
, arg1
);
4460 avoid_sign_compare_warnings (orig_arg2
, arg2
);
4461 avoid_sign_compare_warnings (orig_arg3
, arg3
);
4466 return cp_build_modify_expr (arg1
, code2
, arg2
, complain
);
4469 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
4471 case TRUTH_ANDIF_EXPR
:
4472 case TRUTH_ORIF_EXPR
:
4473 case TRUTH_AND_EXPR
:
4475 warn_logical_operator (input_location
, code
, boolean_type_node
,
4476 code_orig_arg1
, arg1
, code_orig_arg2
, arg2
);
4481 case TRUNC_DIV_EXPR
:
4492 case TRUNC_MOD_EXPR
:
4496 return cp_build_binary_op (input_location
, code
, arg1
, arg2
, complain
);
4498 case UNARY_PLUS_EXPR
:
4501 case TRUTH_NOT_EXPR
:
4502 case PREINCREMENT_EXPR
:
4503 case POSTINCREMENT_EXPR
:
4504 case PREDECREMENT_EXPR
:
4505 case POSTDECREMENT_EXPR
:
4508 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
4511 return build_array_ref (input_location
, arg1
, arg2
);
4514 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_NULL
,
4518 /* The caller will deal with these. */
4530 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
4531 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
4534 non_placement_deallocation_fn_p (tree t
)
4536 /* A template instance is never a usual deallocation function,
4537 regardless of its signature. */
4538 if (TREE_CODE (t
) == TEMPLATE_DECL
4539 || primary_template_instantiation_p (t
))
4542 /* If a class T has a member deallocation function named operator delete
4543 with exactly one parameter, then that function is a usual
4544 (non-placement) deallocation function. If class T does not declare
4545 such an operator delete but does declare a member deallocation
4546 function named operator delete with exactly two parameters, the second
4547 of which has type std::size_t (18.2), then this function is a usual
4548 deallocation function. */
4549 t
= FUNCTION_ARG_CHAIN (t
);
4550 if (t
== void_list_node
4551 || (t
&& same_type_p (TREE_VALUE (t
), size_type_node
)
4552 && TREE_CHAIN (t
) == void_list_node
))
4557 /* Build a call to operator delete. This has to be handled very specially,
4558 because the restrictions on what signatures match are different from all
4559 other call instances. For a normal delete, only a delete taking (void *)
4560 or (void *, size_t) is accepted. For a placement delete, only an exact
4561 match with the placement new is accepted.
4563 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
4564 ADDR is the pointer to be deleted.
4565 SIZE is the size of the memory block to be deleted.
4566 GLOBAL_P is true if the delete-expression should not consider
4567 class-specific delete operators.
4568 PLACEMENT is the corresponding placement new call, or NULL_TREE.
4570 If this call to "operator delete" is being generated as part to
4571 deallocate memory allocated via a new-expression (as per [expr.new]
4572 which requires that if the initialization throws an exception then
4573 we call a deallocation function), then ALLOC_FN is the allocation
4577 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
4578 bool global_p
, tree placement
,
4581 tree fn
= NULL_TREE
;
4582 tree fns
, fnname
, type
, t
;
4584 if (addr
== error_mark_node
)
4585 return error_mark_node
;
4587 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
4589 fnname
= ansi_opname (code
);
4591 if (CLASS_TYPE_P (type
)
4592 && COMPLETE_TYPE_P (complete_type (type
))
4596 If the result of the lookup is ambiguous or inaccessible, or if
4597 the lookup selects a placement deallocation function, the
4598 program is ill-formed.
4600 Therefore, we ask lookup_fnfields to complain about ambiguity. */
4602 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
4603 if (fns
== error_mark_node
)
4604 return error_mark_node
;
4609 if (fns
== NULL_TREE
)
4610 fns
= lookup_name_nonclass (fnname
);
4612 /* Strip const and volatile from addr. */
4613 addr
= cp_convert (ptr_type_node
, addr
);
4617 /* "A declaration of a placement deallocation function matches the
4618 declaration of a placement allocation function if it has the same
4619 number of parameters and, after parameter transformations (8.3.5),
4620 all parameter types except the first are identical."
4622 So we build up the function type we want and ask instantiate_type
4623 to get it for us. */
4624 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
4625 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
4626 t
= build_function_type (void_type_node
, t
);
4628 fn
= instantiate_type (t
, fns
, tf_none
);
4629 if (fn
== error_mark_node
)
4632 if (BASELINK_P (fn
))
4633 fn
= BASELINK_FUNCTIONS (fn
);
4635 /* "If the lookup finds the two-parameter form of a usual deallocation
4636 function (3.7.4.2) and that function, considered as a placement
4637 deallocation function, would have been selected as a match for the
4638 allocation function, the program is ill-formed." */
4639 if (non_placement_deallocation_fn_p (fn
))
4641 /* But if the class has an operator delete (void *), then that is
4642 the usual deallocation function, so we shouldn't complain
4643 about using the operator delete (void *, size_t). */
4644 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
4645 t
; t
= OVL_NEXT (t
))
4647 tree elt
= OVL_CURRENT (t
);
4648 if (non_placement_deallocation_fn_p (elt
)
4649 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
4652 permerror (0, "non-placement deallocation function %q+D", fn
);
4653 permerror (input_location
, "selected for placement delete");
4658 /* "Any non-placement deallocation function matches a non-placement
4659 allocation function. If the lookup finds a single matching
4660 deallocation function, that function will be called; otherwise, no
4661 deallocation function will be called." */
4662 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
4663 t
; t
= OVL_NEXT (t
))
4665 tree elt
= OVL_CURRENT (t
);
4666 if (non_placement_deallocation_fn_p (elt
))
4669 /* "If a class T has a member deallocation function named
4670 operator delete with exactly one parameter, then that
4671 function is a usual (non-placement) deallocation
4672 function. If class T does not declare such an operator
4673 delete but does declare a member deallocation function named
4674 operator delete with exactly two parameters, the second of
4675 which has type std::size_t (18.2), then this function is a
4676 usual deallocation function."
4678 So (void*) beats (void*, size_t). */
4679 if (FUNCTION_ARG_CHAIN (fn
) == void_list_node
)
4684 /* If we have a matching function, call it. */
4687 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
4689 /* If the FN is a member function, make sure that it is
4691 if (BASELINK_P (fns
))
4692 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
);
4694 /* Core issue 901: It's ok to new a type with deleted delete. */
4695 if (DECL_DELETED_FN (fn
) && alloc_fn
)
4700 /* The placement args might not be suitable for overload
4701 resolution at this point, so build the call directly. */
4702 int nargs
= call_expr_nargs (placement
);
4703 tree
*argarray
= (tree
*) alloca (nargs
* sizeof (tree
));
4706 for (i
= 1; i
< nargs
; i
++)
4707 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
4709 return build_cxx_call (fn
, nargs
, argarray
);
4714 VEC(tree
,gc
) *args
= VEC_alloc (tree
, gc
, 2);
4715 VEC_quick_push (tree
, args
, addr
);
4716 if (FUNCTION_ARG_CHAIN (fn
) != void_list_node
)
4717 VEC_quick_push (tree
, args
, size
);
4718 ret
= cp_build_function_call_vec (fn
, &args
, tf_warning_or_error
);
4719 VEC_free (tree
, gc
, args
);
4726 If no unambiguous matching deallocation function can be found,
4727 propagating the exception does not cause the object's memory to
4732 warning (0, "no corresponding deallocation function for %qD",
4737 error ("no suitable %<operator %s%> for %qT",
4738 operator_name_info
[(int)code
].name
, type
);
4739 return error_mark_node
;
4742 /* If the current scope isn't allowed to access DECL along
4743 BASETYPE_PATH, give an error. The most derived class in
4744 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
4745 the declaration to use in the error diagnostic. */
4748 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
)
4750 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
4752 if (!accessible_p (basetype_path
, decl
, true))
4754 if (TREE_PRIVATE (decl
))
4755 error ("%q+#D is private", diag_decl
);
4756 else if (TREE_PROTECTED (decl
))
4757 error ("%q+#D is protected", diag_decl
);
4759 error ("%q+#D is inaccessible", diag_decl
);
4760 error ("within this context");
4767 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
4768 bitwise or of LOOKUP_* values. If any errors are warnings are
4769 generated, set *DIAGNOSTIC_FN to "error" or "warning",
4770 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
4774 build_temp (tree expr
, tree type
, int flags
,
4775 diagnostic_t
*diagnostic_kind
)
4780 savew
= warningcount
, savee
= errorcount
;
4781 args
= make_tree_vector_single (expr
);
4782 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
4783 &args
, type
, flags
, tf_warning_or_error
);
4784 release_tree_vector (args
);
4785 if (warningcount
> savew
)
4786 *diagnostic_kind
= DK_WARNING
;
4787 else if (errorcount
> savee
)
4788 *diagnostic_kind
= DK_ERROR
;
4790 *diagnostic_kind
= DK_UNSPECIFIED
;
4794 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
4795 EXPR is implicitly converted to type TOTYPE.
4796 FN and ARGNUM are used for diagnostics. */
4799 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
4801 tree t
= non_reference (totype
);
4803 /* Issue warnings about peculiar, but valid, uses of NULL. */
4804 if (expr
== null_node
&& TREE_CODE (t
) != BOOLEAN_TYPE
&& ARITHMETIC_TYPE_P (t
))
4807 warning (OPT_Wconversion
, "passing NULL to non-pointer argument %P of %qD",
4810 warning (OPT_Wconversion
, "converting to non-pointer type %qT from NULL", t
);
4813 /* Issue warnings if "false" is converted to a NULL pointer */
4814 else if (expr
== boolean_false_node
&& fn
&& POINTER_TYPE_P (t
))
4815 warning (OPT_Wconversion
,
4816 "converting %<false%> to pointer type for argument %P of %qD",
4820 /* Perform the conversions in CONVS on the expression EXPR. FN and
4821 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
4822 indicates the `this' argument of a method. INNER is nonzero when
4823 being called to continue a conversion chain. It is negative when a
4824 reference binding will be applied, positive otherwise. If
4825 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
4826 conversions will be emitted if appropriate. If C_CAST_P is true,
4827 this conversion is coming from a C-style cast; in that case,
4828 conversions to inaccessible bases are permitted. */
4831 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
4832 int inner
, bool issue_conversion_warnings
,
4833 bool c_cast_p
, tsubst_flags_t complain
)
4835 tree totype
= convs
->type
;
4836 diagnostic_t diag_kind
;
4840 && convs
->kind
!= ck_user
4841 && convs
->kind
!= ck_list
4842 && convs
->kind
!= ck_ambig
4843 && convs
->kind
!= ck_ref_bind
4844 && convs
->kind
!= ck_rvalue
4845 && convs
->kind
!= ck_base
)
4847 conversion
*t
= convs
;
4849 /* Give a helpful error if this is bad because of excess braces. */
4850 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
4851 && SCALAR_TYPE_P (totype
)
4852 && CONSTRUCTOR_NELTS (expr
) > 0
4853 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
4854 permerror (input_location
, "too many braces around initializer for %qT", totype
);
4856 for (; t
; t
= convs
->u
.next
)
4858 if (t
->kind
== ck_user
|| !t
->bad_p
)
4860 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
4861 /*issue_conversion_warnings=*/false,
4866 else if (t
->kind
== ck_ambig
)
4867 return convert_like_real (t
, expr
, fn
, argnum
, 1,
4868 /*issue_conversion_warnings=*/false,
4871 else if (t
->kind
== ck_identity
)
4874 if (complain
& tf_error
)
4876 permerror (input_location
, "invalid conversion from %qT to %qT", TREE_TYPE (expr
), totype
);
4878 permerror (input_location
, " initializing argument %P of %qD", argnum
, fn
);
4881 return error_mark_node
;
4883 return cp_convert (totype
, expr
);
4886 if (issue_conversion_warnings
&& (complain
& tf_warning
))
4887 conversion_null_warnings (totype
, expr
, fn
, argnum
);
4889 switch (convs
->kind
)
4893 struct z_candidate
*cand
= convs
->cand
;
4894 tree convfn
= cand
->fn
;
4897 /* When converting from an init list we consider explicit
4898 constructors, but actually trying to call one is an error. */
4899 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
))
4901 if (complain
& tf_error
)
4902 error ("converting to %qT from initializer list would use "
4903 "explicit constructor %qD", totype
, convfn
);
4905 return error_mark_node
;
4908 /* Set user_conv_p on the argument conversions, so rvalue/base
4909 handling knows not to allow any more UDCs. */
4910 for (i
= 0; i
< cand
->num_convs
; ++i
)
4911 cand
->convs
[i
]->user_conv_p
= true;
4913 expr
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4915 /* If this is a constructor or a function returning an aggr type,
4916 we need to build up a TARGET_EXPR. */
4917 if (DECL_CONSTRUCTOR_P (convfn
))
4919 expr
= build_cplus_new (totype
, expr
);
4921 /* Remember that this was list-initialization. */
4922 if (convs
->check_narrowing
)
4923 TARGET_EXPR_LIST_INIT_P (expr
) = true;
4929 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
4931 int nelts
= CONSTRUCTOR_NELTS (expr
);
4933 expr
= integer_zero_node
;
4934 else if (nelts
== 1)
4935 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
4940 if (type_unknown_p (expr
))
4941 expr
= instantiate_type (totype
, expr
, complain
);
4942 /* Convert a constant to its underlying value, unless we are
4943 about to bind it to a reference, in which case we need to
4944 leave it as an lvalue. */
4947 expr
= decl_constant_value (expr
);
4948 if (expr
== null_node
&& INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
4949 /* If __null has been converted to an integer type, we do not
4950 want to warn about uses of EXPR as an integer, rather than
4952 expr
= build_int_cst (totype
, 0);
4956 /* Call build_user_type_conversion again for the error. */
4957 return build_user_type_conversion
4958 (totype
, convs
->u
.expr
, LOOKUP_NORMAL
);
4962 /* Conversion to std::initializer_list<T>. */
4963 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
4964 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
4965 unsigned len
= CONSTRUCTOR_NELTS (expr
);
4967 VEC(tree
,gc
) *parms
;
4970 /* Convert all the elements. */
4971 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
4973 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
4974 1, false, false, complain
);
4975 if (sub
== error_mark_node
)
4977 check_narrowing (TREE_TYPE (sub
), val
);
4978 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
4980 /* Build up the array. */
4981 elttype
= cp_build_qualified_type
4982 (elttype
, TYPE_QUALS (elttype
) | TYPE_QUAL_CONST
);
4983 array
= build_array_of_n_type (elttype
, len
);
4984 array
= finish_compound_literal (array
, new_ctor
);
4986 parms
= make_tree_vector ();
4987 VEC_safe_push (tree
, gc
, parms
, decay_conversion (array
));
4988 VEC_safe_push (tree
, gc
, parms
, size_int (len
));
4989 /* Call the private constructor. */
4990 push_deferring_access_checks (dk_no_check
);
4991 new_ctor
= build_special_member_call
4992 (NULL_TREE
, complete_ctor_identifier
, &parms
, totype
, 0, complain
);
4993 release_tree_vector (parms
);
4994 pop_deferring_access_checks ();
4995 return build_cplus_new (totype
, new_ctor
);
4999 return get_target_expr (digest_init (totype
, expr
));
5005 expr
= convert_like_real (convs
->u
.next
, expr
, fn
, argnum
,
5006 convs
->kind
== ck_ref_bind
? -1 : 1,
5007 convs
->kind
== ck_ref_bind
? issue_conversion_warnings
: false,
5010 if (expr
== error_mark_node
)
5011 return error_mark_node
;
5013 switch (convs
->kind
)
5016 expr
= convert_bitfield_to_declared_type (expr
);
5017 if (! MAYBE_CLASS_TYPE_P (totype
))
5019 /* Else fall through. */
5021 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
5023 /* We are going to bind a reference directly to a base-class
5024 subobject of EXPR. */
5025 /* Build an expression for `*((base*) &expr)'. */
5026 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, complain
);
5027 expr
= convert_to_base (expr
, build_pointer_type (totype
),
5028 !c_cast_p
, /*nonnull=*/true);
5029 expr
= cp_build_indirect_ref (expr
, RO_IMPLICIT_CONVERSION
, complain
);
5033 /* Copy-initialization where the cv-unqualified version of the source
5034 type is the same class as, or a derived class of, the class of the
5035 destination [is treated as direct-initialization]. [dcl.init] */
5036 flags
= LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
;
5037 if (convs
->user_conv_p
)
5038 /* This conversion is being done in the context of a user-defined
5039 conversion (i.e. the second step of copy-initialization), so
5040 don't allow any more. */
5041 flags
|= LOOKUP_NO_CONVERSION
;
5042 expr
= build_temp (expr
, totype
, flags
, &diag_kind
);
5043 if (diag_kind
&& fn
)
5045 if ((complain
& tf_error
))
5046 emit_diagnostic (diag_kind
, input_location
, 0,
5047 " initializing argument %P of %qD", argnum
, fn
);
5048 else if (diag_kind
== DK_ERROR
)
5049 return error_mark_node
;
5051 return build_cplus_new (totype
, expr
);
5055 tree ref_type
= totype
;
5057 if (convs
->bad_p
&& TYPE_REF_IS_RVALUE (ref_type
)
5058 && real_lvalue_p (expr
))
5060 if (complain
& tf_error
)
5062 error ("cannot bind %qT lvalue to %qT",
5063 TREE_TYPE (expr
), totype
);
5065 error (" initializing argument %P of %q+D", argnum
, fn
);
5067 return error_mark_node
;
5070 /* If necessary, create a temporary.
5072 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
5073 that need temporaries, even when their types are reference
5074 compatible with the type of reference being bound, so the
5075 upcoming call to cp_build_unary_op (ADDR_EXPR, expr, ...)
5077 if (convs
->need_temporary_p
5078 || TREE_CODE (expr
) == CONSTRUCTOR
5079 || TREE_CODE (expr
) == VA_ARG_EXPR
)
5081 tree type
= convs
->u
.next
->type
;
5082 cp_lvalue_kind lvalue
= real_lvalue_p (expr
);
5084 if (!CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
))
5085 && !TYPE_REF_IS_RVALUE (ref_type
))
5087 if (complain
& tf_error
)
5089 /* If the reference is volatile or non-const, we
5090 cannot create a temporary. */
5091 if (lvalue
& clk_bitfield
)
5092 error ("cannot bind bitfield %qE to %qT",
5094 else if (lvalue
& clk_packed
)
5095 error ("cannot bind packed field %qE to %qT",
5098 error ("cannot bind rvalue %qE to %qT", expr
, ref_type
);
5100 return error_mark_node
;
5102 /* If the source is a packed field, and we must use a copy
5103 constructor, then building the target expr will require
5104 binding the field to the reference parameter to the
5105 copy constructor, and we'll end up with an infinite
5106 loop. If we can use a bitwise copy, then we'll be
5108 if ((lvalue
& clk_packed
)
5109 && CLASS_TYPE_P (type
)
5110 && !TYPE_HAS_TRIVIAL_INIT_REF (type
))
5112 if (complain
& tf_error
)
5113 error ("cannot bind packed field %qE to %qT",
5115 return error_mark_node
;
5117 if (lvalue
& clk_bitfield
)
5119 expr
= convert_bitfield_to_declared_type (expr
);
5120 expr
= fold_convert (type
, expr
);
5122 expr
= build_target_expr_with_type (expr
, type
);
5125 /* Take the address of the thing to which we will bind the
5127 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 1, complain
);
5128 if (expr
== error_mark_node
)
5129 return error_mark_node
;
5131 /* Convert it to a pointer to the type referred to by the
5132 reference. This will adjust the pointer if a derived to
5133 base conversion is being performed. */
5134 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
5136 /* Convert the pointer to the desired reference type. */
5137 return build_nop (ref_type
, expr
);
5141 return decay_conversion (expr
);
5144 /* Warn about deprecated conversion if appropriate. */
5145 string_conv_p (totype
, expr
, 1);
5150 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
5152 return build_nop (totype
, expr
);
5155 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
5162 if (convs
->check_narrowing
)
5163 check_narrowing (totype
, expr
);
5165 if (issue_conversion_warnings
&& (complain
& tf_warning
))
5166 expr
= convert_and_check (totype
, expr
);
5168 expr
= convert (totype
, expr
);
5173 /* ARG is being passed to a varargs function. Perform any conversions
5174 required. Return the converted value. */
5177 convert_arg_to_ellipsis (tree arg
)
5181 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
5182 standard conversions are performed. */
5183 arg
= decay_conversion (arg
);
5186 If the argument has integral or enumeration type that is subject
5187 to the integral promotions (_conv.prom_), or a floating point
5188 type that is subject to the floating point promotion
5189 (_conv.fpprom_), the value of the argument is converted to the
5190 promoted type before the call. */
5191 if (TREE_CODE (TREE_TYPE (arg
)) == REAL_TYPE
5192 && (TYPE_PRECISION (TREE_TYPE (arg
))
5193 < TYPE_PRECISION (double_type_node
))
5194 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (arg
))))
5195 arg
= convert_to_real (double_type_node
, arg
);
5196 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (arg
)))
5197 arg
= perform_integral_promotions (arg
);
5199 arg
= require_complete_type (arg
);
5201 if (arg
!= error_mark_node
5202 && (type_has_nontrivial_copy_init (TREE_TYPE (arg
))
5203 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (arg
))))
5205 /* [expr.call] 5.2.2/7:
5206 Passing a potentially-evaluated argument of class type (Clause 9)
5207 with a non-trivial copy constructor or a non-trivial destructor
5208 with no corresponding parameter is conditionally-supported, with
5209 implementation-defined semantics.
5211 We used to just warn here and do a bitwise copy, but now
5212 cp_expr_size will abort if we try to do that.
5214 If the call appears in the context of a sizeof expression,
5215 it is not potentially-evaluated. */
5216 if (cp_unevaluated_operand
== 0)
5217 error ("cannot pass objects of non-trivially-copyable "
5218 "type %q#T through %<...%>", TREE_TYPE (arg
));
5224 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
5227 build_x_va_arg (tree expr
, tree type
)
5229 if (processing_template_decl
)
5230 return build_min (VA_ARG_EXPR
, type
, expr
);
5232 type
= complete_type_or_else (type
, NULL_TREE
);
5234 if (expr
== error_mark_node
|| !type
)
5235 return error_mark_node
;
5237 if (type_has_nontrivial_copy_init (type
)
5238 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
5239 || TREE_CODE (type
) == REFERENCE_TYPE
)
5241 /* Remove reference types so we don't ICE later on. */
5242 tree type1
= non_reference (type
);
5243 /* conditionally-supported behavior [expr.call] 5.2.2/7. */
5244 error ("cannot receive objects of non-trivially-copyable type %q#T "
5245 "through %<...%>; ", type
);
5246 expr
= convert (build_pointer_type (type1
), null_node
);
5247 expr
= cp_build_indirect_ref (expr
, RO_NULL
, tf_warning_or_error
);
5251 return build_va_arg (input_location
, expr
, type
);
5254 /* TYPE has been given to va_arg. Apply the default conversions which
5255 would have happened when passed via ellipsis. Return the promoted
5256 type, or the passed type if there is no change. */
5259 cxx_type_promotes_to (tree type
)
5263 /* Perform the array-to-pointer and function-to-pointer
5265 type
= type_decays_to (type
);
5267 promote
= type_promotes_to (type
);
5268 if (same_type_p (type
, promote
))
5274 /* ARG is a default argument expression being passed to a parameter of
5275 the indicated TYPE, which is a parameter to FN. Do any required
5276 conversions. Return the converted value. */
5278 static GTY(()) VEC(tree
,gc
) *default_arg_context
;
5281 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
)
5286 /* If the ARG is an unparsed default argument expression, the
5287 conversion cannot be performed. */
5288 if (TREE_CODE (arg
) == DEFAULT_ARG
)
5290 error ("the default argument for parameter %d of %qD has "
5291 "not yet been parsed",
5293 return error_mark_node
;
5296 /* Detect recursion. */
5297 for (i
= 0; VEC_iterate (tree
, default_arg_context
, i
, t
); ++i
)
5300 error ("recursive evaluation of default argument for %q#D", fn
);
5301 return error_mark_node
;
5303 VEC_safe_push (tree
, gc
, default_arg_context
, fn
);
5305 if (fn
&& DECL_TEMPLATE_INFO (fn
))
5306 arg
= tsubst_default_argument (fn
, type
, arg
);
5312 The names in the expression are bound, and the semantic
5313 constraints are checked, at the point where the default
5314 expressions appears.
5316 we must not perform access checks here. */
5317 push_deferring_access_checks (dk_no_check
);
5318 arg
= break_out_target_exprs (arg
);
5319 if (TREE_CODE (arg
) == CONSTRUCTOR
)
5321 arg
= digest_init (type
, arg
);
5322 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_NORMAL
,
5323 "default argument", fn
, parmnum
,
5324 tf_warning_or_error
);
5328 /* We must make a copy of ARG, in case subsequent processing
5329 alters any part of it. For example, during gimplification a
5330 cast of the form (T) &X::f (where "f" is a member function)
5331 will lead to replacing the PTRMEM_CST for &X::f with a
5332 VAR_DECL. We can avoid the copy for constants, since they
5333 are never modified in place. */
5334 if (!CONSTANT_CLASS_P (arg
))
5335 arg
= unshare_expr (arg
);
5336 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_NORMAL
,
5337 "default argument", fn
, parmnum
,
5338 tf_warning_or_error
);
5339 arg
= convert_for_arg_passing (type
, arg
);
5341 pop_deferring_access_checks();
5343 VEC_pop (tree
, default_arg_context
);
5348 /* Returns the type which will really be used for passing an argument of
5352 type_passed_as (tree type
)
5354 /* Pass classes with copy ctors by invisible reference. */
5355 if (TREE_ADDRESSABLE (type
))
5357 type
= build_reference_type (type
);
5358 /* There are no other pointers to this temporary. */
5359 type
= build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
5361 else if (targetm
.calls
.promote_prototypes (type
)
5362 && INTEGRAL_TYPE_P (type
)
5363 && COMPLETE_TYPE_P (type
)
5364 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
),
5365 TYPE_SIZE (integer_type_node
)))
5366 type
= integer_type_node
;
5371 /* Actually perform the appropriate conversion. */
5374 convert_for_arg_passing (tree type
, tree val
)
5378 /* If VAL is a bitfield, then -- since it has already been converted
5379 to TYPE -- it cannot have a precision greater than TYPE.
5381 If it has a smaller precision, we must widen it here. For
5382 example, passing "int f:3;" to a function expecting an "int" will
5383 not result in any conversion before this point.
5385 If the precision is the same we must not risk widening. For
5386 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
5387 often have type "int", even though the C++ type for the field is
5388 "long long". If the value is being passed to a function
5389 expecting an "int", then no conversions will be required. But,
5390 if we call convert_bitfield_to_declared_type, the bitfield will
5391 be converted to "long long". */
5392 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
5394 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
5395 val
= convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type
), val
);
5397 if (val
== error_mark_node
)
5399 /* Pass classes with copy ctors by invisible reference. */
5400 else if (TREE_ADDRESSABLE (type
))
5401 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
5402 else if (targetm
.calls
.promote_prototypes (type
)
5403 && INTEGRAL_TYPE_P (type
)
5404 && COMPLETE_TYPE_P (type
)
5405 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
),
5406 TYPE_SIZE (integer_type_node
)))
5407 val
= perform_integral_promotions (val
);
5408 if (warn_missing_format_attribute
)
5410 tree rhstype
= TREE_TYPE (val
);
5411 const enum tree_code coder
= TREE_CODE (rhstype
);
5412 const enum tree_code codel
= TREE_CODE (type
);
5413 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
5415 && check_missing_format_attribute (type
, rhstype
))
5416 warning (OPT_Wmissing_format_attribute
,
5417 "argument of function call might be a candidate for a format attribute");
5422 /* Returns true iff FN is a function with magic varargs, i.e. ones for
5423 which no conversions at all should be done. This is true for some
5424 builtins which don't act like normal functions. */
5427 magic_varargs_p (tree fn
)
5429 if (DECL_BUILT_IN (fn
))
5430 switch (DECL_FUNCTION_CODE (fn
))
5432 case BUILT_IN_CLASSIFY_TYPE
:
5433 case BUILT_IN_CONSTANT_P
:
5434 case BUILT_IN_NEXT_ARG
:
5435 case BUILT_IN_VA_START
:
5439 return lookup_attribute ("type generic",
5440 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
5446 /* Subroutine of the various build_*_call functions. Overload resolution
5447 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
5448 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
5449 bitmask of various LOOKUP_* flags which apply to the call itself. */
5452 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
5455 const VEC(tree
,gc
) *args
= cand
->args
;
5456 tree first_arg
= cand
->first_arg
;
5457 conversion
**convs
= cand
->convs
;
5459 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5464 unsigned int arg_index
= 0;
5468 bool already_used
= false;
5470 /* In a template, there is no need to perform all of the work that
5471 is normally done. We are only interested in the type of the call
5472 expression, i.e., the return type of the function. Any semantic
5473 errors will be deferred until the template is instantiated. */
5474 if (processing_template_decl
)
5478 const tree
*argarray
;
5481 return_type
= TREE_TYPE (TREE_TYPE (fn
));
5482 nargs
= VEC_length (tree
, args
);
5483 if (first_arg
== NULL_TREE
)
5484 argarray
= VEC_address (tree
, CONST_CAST (VEC(tree
,gc
) *, args
));
5492 alcarray
= XALLOCAVEC (tree
, nargs
);
5493 alcarray
[0] = first_arg
;
5494 for (ix
= 0; VEC_iterate (tree
, args
, ix
, arg
); ++ix
)
5495 alcarray
[ix
+ 1] = arg
;
5496 argarray
= alcarray
;
5498 expr
= build_call_array_loc (input_location
,
5499 return_type
, build_addr_func (fn
), nargs
,
5501 if (TREE_THIS_VOLATILE (fn
) && cfun
)
5502 current_function_returns_abnormally
= 1;
5503 if (!VOID_TYPE_P (return_type
))
5504 require_complete_type (return_type
);
5505 return convert_from_reference (expr
);
5508 /* Give any warnings we noticed during overload resolution. */
5511 struct candidate_warning
*w
;
5512 for (w
= cand
->warnings
; w
; w
= w
->next
)
5513 joust (cand
, w
->loser
, 1);
5516 /* Make =delete work with SFINAE. */
5517 if (DECL_DELETED_FN (fn
) && !(complain
& tf_error
))
5518 return error_mark_node
;
5520 if (DECL_FUNCTION_MEMBER_P (fn
))
5522 /* If FN is a template function, two cases must be considered.
5527 template <class T> void f();
5529 template <class T> struct B {
5533 struct C : A, B<int> {
5535 using B<int>::g; // #2
5538 In case #1 where `A::f' is a member template, DECL_ACCESS is
5539 recorded in the primary template but not in its specialization.
5540 We check access of FN using its primary template.
5542 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
5543 because it is a member of class template B, DECL_ACCESS is
5544 recorded in the specialization `B<int>::g'. We cannot use its
5545 primary template because `B<T>::g' and `B<int>::g' may have
5546 different access. */
5547 if (DECL_TEMPLATE_INFO (fn
)
5548 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
5549 perform_or_defer_access_check (cand
->access_path
,
5550 DECL_TI_TEMPLATE (fn
), fn
);
5552 perform_or_defer_access_check (cand
->access_path
, fn
, fn
);
5555 /* Find maximum size of vector to hold converted arguments. */
5556 parmlen
= list_length (parm
);
5557 nargs
= VEC_length (tree
, args
) + (first_arg
!= NULL_TREE
? 1 : 0);
5558 if (parmlen
> nargs
)
5560 argarray
= (tree
*) alloca (nargs
* sizeof (tree
));
5562 /* The implicit parameters to a constructor are not considered by overload
5563 resolution, and must be of the proper type. */
5564 if (DECL_CONSTRUCTOR_P (fn
))
5566 if (first_arg
!= NULL_TREE
)
5568 argarray
[j
++] = first_arg
;
5569 first_arg
= NULL_TREE
;
5573 argarray
[j
++] = VEC_index (tree
, args
, arg_index
);
5576 parm
= TREE_CHAIN (parm
);
5577 /* We should never try to call the abstract constructor. */
5578 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
5580 if (DECL_HAS_VTT_PARM_P (fn
))
5582 argarray
[j
++] = VEC_index (tree
, args
, arg_index
);
5584 parm
= TREE_CHAIN (parm
);
5587 /* Bypass access control for 'this' parameter. */
5588 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
5590 tree parmtype
= TREE_VALUE (parm
);
5591 tree arg
= (first_arg
!= NULL_TREE
5593 : VEC_index (tree
, args
, arg_index
));
5594 tree argtype
= TREE_TYPE (arg
);
5598 if (convs
[i
]->bad_p
)
5600 if (complain
& tf_error
)
5601 permerror (input_location
, "passing %qT as %<this%> argument of %q#D discards qualifiers",
5602 TREE_TYPE (argtype
), fn
);
5604 return error_mark_node
;
5607 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
5608 X is called for an object that is not of type X, or of a type
5609 derived from X, the behavior is undefined.
5611 So we can assume that anything passed as 'this' is non-null, and
5612 optimize accordingly. */
5613 gcc_assert (TREE_CODE (parmtype
) == POINTER_TYPE
);
5614 /* Convert to the base in which the function was declared. */
5615 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
5616 converted_arg
= build_base_path (PLUS_EXPR
,
5618 cand
->conversion_path
,
5620 /* Check that the base class is accessible. */
5621 if (!accessible_base_p (TREE_TYPE (argtype
),
5622 BINFO_TYPE (cand
->conversion_path
), true))
5623 error ("%qT is not an accessible base of %qT",
5624 BINFO_TYPE (cand
->conversion_path
),
5625 TREE_TYPE (argtype
));
5626 /* If fn was found by a using declaration, the conversion path
5627 will be to the derived class, not the base declaring fn. We
5628 must convert from derived to base. */
5629 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
5630 TREE_TYPE (parmtype
), ba_unique
, NULL
);
5631 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
5634 argarray
[j
++] = converted_arg
;
5635 parm
= TREE_CHAIN (parm
);
5636 if (first_arg
!= NULL_TREE
)
5637 first_arg
= NULL_TREE
;
5644 gcc_assert (first_arg
== NULL_TREE
);
5645 for (; arg_index
< VEC_length (tree
, args
) && parm
;
5646 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
5648 tree type
= TREE_VALUE (parm
);
5652 /* Don't make a copy here if build_call is going to. */
5653 if (conv
->kind
== ck_rvalue
5654 && COMPLETE_TYPE_P (complete_type (type
))
5655 && !TREE_ADDRESSABLE (type
))
5656 conv
= conv
->u
.next
;
5658 /* Warn about initializer_list deduction that isn't currently in the
5660 if (cxx_dialect
> cxx98
5661 && flag_deduce_init_list
5662 && cand
->template_decl
5663 && is_std_init_list (non_reference (type
)))
5665 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
5666 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
5667 tree patparm
= get_pattern_parm (realparm
, tmpl
);
5668 tree pattype
= TREE_TYPE (patparm
);
5669 if (PACK_EXPANSION_P (pattype
))
5670 pattype
= PACK_EXPANSION_PATTERN (pattype
);
5671 pattype
= non_reference (pattype
);
5673 if (!is_std_init_list (pattype
))
5675 pedwarn (input_location
, 0, "deducing %qT as %qT",
5676 non_reference (TREE_TYPE (patparm
)),
5677 non_reference (type
));
5678 pedwarn (input_location
, 0, " in call to %q+D", cand
->fn
);
5679 pedwarn (input_location
, 0,
5680 " (you can disable this with -fno-deduce-init-list)");
5684 val
= convert_like_with_context
5685 (conv
, VEC_index (tree
, args
, arg_index
), fn
, i
- is_method
,
5688 val
= convert_for_arg_passing (type
, val
);
5689 if (val
== error_mark_node
)
5690 return error_mark_node
;
5692 argarray
[j
++] = val
;
5695 /* Default arguments */
5696 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
5697 argarray
[j
++] = convert_default_arg (TREE_VALUE (parm
),
5698 TREE_PURPOSE (parm
),
5701 for (; arg_index
< VEC_length (tree
, args
); ++arg_index
)
5703 tree a
= VEC_index (tree
, args
, arg_index
);
5704 if (magic_varargs_p (fn
))
5705 /* Do no conversions for magic varargs. */;
5707 a
= convert_arg_to_ellipsis (a
);
5711 gcc_assert (j
<= nargs
);
5714 check_function_arguments (TYPE_ATTRIBUTES (TREE_TYPE (fn
)),
5715 nargs
, argarray
, TYPE_ARG_TYPES (TREE_TYPE (fn
)));
5717 /* Avoid actually calling copy constructors and copy assignment operators,
5720 if (! flag_elide_constructors
)
5721 /* Do things the hard way. */;
5722 else if (cand
->num_convs
== 1
5723 && (DECL_COPY_CONSTRUCTOR_P (fn
)
5724 || DECL_MOVE_CONSTRUCTOR_P (fn
)))
5727 tree arg
= argarray
[num_artificial_parms_for (fn
)];
5730 /* Pull out the real argument, disregarding const-correctness. */
5732 while (CONVERT_EXPR_P (targ
)
5733 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
5734 targ
= TREE_OPERAND (targ
, 0);
5735 if (TREE_CODE (targ
) == ADDR_EXPR
)
5737 targ
= TREE_OPERAND (targ
, 0);
5738 if (!same_type_ignoring_top_level_qualifiers_p
5739 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
5748 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
5750 if (TREE_CODE (arg
) == TARGET_EXPR
5751 && TARGET_EXPR_LIST_INIT_P (arg
))
5753 /* Copy-list-initialization doesn't require the copy constructor
5756 /* [class.copy]: the copy constructor is implicitly defined even if
5757 the implementation elided its use. */
5758 else if (TYPE_HAS_COMPLEX_INIT_REF (DECL_CONTEXT (fn
)))
5761 already_used
= true;
5764 /* If we're creating a temp and we already have one, don't create a
5765 new one. If we're not creating a temp but we get one, use
5766 INIT_EXPR to collapse the temp into our target. Otherwise, if the
5767 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
5768 temp or an INIT_EXPR otherwise. */
5769 fa
= (cand
->first_arg
!= NULL_TREE
5771 : VEC_index (tree
, args
, 0));
5772 if (integer_zerop (fa
))
5774 if (TREE_CODE (arg
) == TARGET_EXPR
)
5776 else if (TYPE_HAS_TRIVIAL_INIT_REF (DECL_CONTEXT (fn
)))
5777 return build_target_expr_with_type (arg
, DECL_CONTEXT (fn
));
5779 else if (TREE_CODE (arg
) == TARGET_EXPR
5780 || (TYPE_HAS_TRIVIAL_INIT_REF (DECL_CONTEXT (fn
))
5781 && !move_fn_p (fn
)))
5783 tree to
= stabilize_reference (cp_build_indirect_ref (fa
, RO_NULL
,
5786 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
5790 else if (DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
5792 && TYPE_HAS_TRIVIAL_ASSIGN_REF (DECL_CONTEXT (fn
)))
5794 tree to
= stabilize_reference
5795 (cp_build_indirect_ref (argarray
[0], RO_NULL
, complain
));
5796 tree type
= TREE_TYPE (to
);
5797 tree as_base
= CLASSTYPE_AS_BASE (type
);
5798 tree arg
= argarray
[1];
5800 if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
5802 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
5803 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
5807 /* We must only copy the non-tail padding parts.
5808 Use __builtin_memcpy for the bitwise copy.
5809 FIXME fix 22488 so we can go back to using MODIFY_EXPR
5810 instead of an explicit call to memcpy. */
5812 tree arg0
, arg1
, arg2
, t
;
5813 tree test
= NULL_TREE
;
5815 arg2
= TYPE_SIZE_UNIT (as_base
);
5817 arg0
= cp_build_unary_op (ADDR_EXPR
, to
, 0, complain
);
5819 if (!can_trust_pointer_alignment ())
5821 /* If we can't be sure about pointer alignment, a call
5822 to __builtin_memcpy is expanded as a call to memcpy, which
5823 is invalid with identical args. Otherwise it is
5824 expanded as a block move, which should be safe. */
5825 arg0
= save_expr (arg0
);
5826 arg1
= save_expr (arg1
);
5827 test
= build2 (EQ_EXPR
, boolean_type_node
, arg0
, arg1
);
5829 t
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
5830 t
= build_call_n (t
, 3, arg0
, arg1
, arg2
);
5832 t
= convert (TREE_TYPE (arg0
), t
);
5834 t
= build3 (COND_EXPR
, TREE_TYPE (t
), test
, arg0
, t
);
5835 val
= cp_build_indirect_ref (t
, RO_NULL
, complain
);
5836 TREE_NO_WARNING (val
) = 1;
5845 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0)
5848 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
5851 gcc_assert (binfo
&& binfo
!= error_mark_node
);
5853 /* Warn about deprecated virtual functions now, since we're about
5854 to throw away the decl. */
5855 if (TREE_DEPRECATED (fn
))
5856 warn_deprecated_use (fn
, NULL_TREE
);
5858 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1);
5859 if (TREE_SIDE_EFFECTS (argarray
[0]))
5860 argarray
[0] = save_expr (argarray
[0]);
5861 t
= build_pointer_type (TREE_TYPE (fn
));
5862 if (DECL_CONTEXT (fn
) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn
)))
5863 fn
= build_java_interface_fn_ref (fn
, argarray
[0]);
5865 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
5869 fn
= build_addr_func (fn
);
5871 return build_cxx_call (fn
, nargs
, argarray
);
5874 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
5875 This function performs no overload resolution, conversion, or other
5876 high-level operations. */
5879 build_cxx_call (tree fn
, int nargs
, tree
*argarray
)
5883 fn
= build_call_a (fn
, nargs
, argarray
);
5885 /* If this call might throw an exception, note that fact. */
5886 fndecl
= get_callee_fndecl (fn
);
5887 if ((!fndecl
|| !TREE_NOTHROW (fndecl
))
5888 && at_function_scope_p ()
5890 cp_function_chain
->can_throw
= 1;
5892 /* Check that arguments to builtin functions match the expectations. */
5894 && DECL_BUILT_IN (fndecl
)
5895 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
5896 && !check_builtin_function_arguments (fndecl
, nargs
, argarray
))
5897 return error_mark_node
;
5899 /* Some built-in function calls will be evaluated at compile-time in
5901 fn
= fold_if_not_in_template (fn
);
5903 if (VOID_TYPE_P (TREE_TYPE (fn
)))
5906 fn
= require_complete_type (fn
);
5907 if (fn
== error_mark_node
)
5908 return error_mark_node
;
5910 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
5911 fn
= build_cplus_new (TREE_TYPE (fn
), fn
);
5912 return convert_from_reference (fn
);
5915 static GTY(()) tree java_iface_lookup_fn
;
5917 /* Make an expression which yields the address of the Java interface
5918 method FN. This is achieved by generating a call to libjava's
5919 _Jv_LookupInterfaceMethodIdx(). */
5922 build_java_interface_fn_ref (tree fn
, tree instance
)
5924 tree lookup_fn
, method
, idx
;
5925 tree klass_ref
, iface
, iface_ref
;
5928 if (!java_iface_lookup_fn
)
5930 tree endlink
= build_void_list_node ();
5931 tree t
= tree_cons (NULL_TREE
, ptr_type_node
,
5932 tree_cons (NULL_TREE
, ptr_type_node
,
5933 tree_cons (NULL_TREE
, java_int_type_node
,
5935 java_iface_lookup_fn
5936 = add_builtin_function ("_Jv_LookupInterfaceMethodIdx",
5937 build_function_type (ptr_type_node
, t
),
5938 0, NOT_BUILT_IN
, NULL
, NULL_TREE
);
5941 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
5942 This is the first entry in the vtable. */
5943 klass_ref
= build_vtbl_ref (cp_build_indirect_ref (instance
, RO_NULL
,
5944 tf_warning_or_error
),
5947 /* Get the java.lang.Class pointer for the interface being called. */
5948 iface
= DECL_CONTEXT (fn
);
5949 iface_ref
= lookup_field (iface
, get_identifier ("class$"), 0, false);
5950 if (!iface_ref
|| TREE_CODE (iface_ref
) != VAR_DECL
5951 || DECL_CONTEXT (iface_ref
) != iface
)
5953 error ("could not find class$ field in java interface type %qT",
5955 return error_mark_node
;
5957 iface_ref
= build_address (iface_ref
);
5958 iface_ref
= convert (build_pointer_type (iface
), iface_ref
);
5960 /* Determine the itable index of FN. */
5962 for (method
= TYPE_METHODS (iface
); method
; method
= TREE_CHAIN (method
))
5964 if (!DECL_VIRTUAL_P (method
))
5970 idx
= build_int_cst (NULL_TREE
, i
);
5972 lookup_fn
= build1 (ADDR_EXPR
,
5973 build_pointer_type (TREE_TYPE (java_iface_lookup_fn
)),
5974 java_iface_lookup_fn
);
5975 return build_call_nary (ptr_type_node
, lookup_fn
,
5976 3, klass_ref
, iface_ref
, idx
);
5979 /* Returns the value to use for the in-charge parameter when making a
5980 call to a function with the indicated NAME.
5982 FIXME:Can't we find a neater way to do this mapping? */
5985 in_charge_arg_for_name (tree name
)
5987 if (name
== base_ctor_identifier
5988 || name
== base_dtor_identifier
)
5989 return integer_zero_node
;
5990 else if (name
== complete_ctor_identifier
)
5991 return integer_one_node
;
5992 else if (name
== complete_dtor_identifier
)
5993 return integer_two_node
;
5994 else if (name
== deleting_dtor_identifier
)
5995 return integer_three_node
;
5997 /* This function should only be called with one of the names listed
6003 /* Build a call to a constructor, destructor, or an assignment
6004 operator for INSTANCE, an expression with class type. NAME
6005 indicates the special member function to call; *ARGS are the
6006 arguments. ARGS may be NULL. This may change ARGS. BINFO
6007 indicates the base of INSTANCE that is to be passed as the `this'
6008 parameter to the member function called.
6010 FLAGS are the LOOKUP_* flags to use when processing the call.
6012 If NAME indicates a complete object constructor, INSTANCE may be
6013 NULL_TREE. In this case, the caller will call build_cplus_new to
6014 store the newly constructed object into a VAR_DECL. */
6017 build_special_member_call (tree instance
, tree name
, VEC(tree
,gc
) **args
,
6018 tree binfo
, int flags
, tsubst_flags_t complain
)
6021 /* The type of the subobject to be constructed or destroyed. */
6023 VEC(tree
,gc
) *allocated
= NULL
;
6026 gcc_assert (name
== complete_ctor_identifier
6027 || name
== base_ctor_identifier
6028 || name
== complete_dtor_identifier
6029 || name
== base_dtor_identifier
6030 || name
== deleting_dtor_identifier
6031 || name
== ansi_assopname (NOP_EXPR
));
6034 /* Resolve the name. */
6035 if (!complete_type_or_else (binfo
, NULL_TREE
))
6036 return error_mark_node
;
6038 binfo
= TYPE_BINFO (binfo
);
6041 gcc_assert (binfo
!= NULL_TREE
);
6043 class_type
= BINFO_TYPE (binfo
);
6045 /* Handle the special case where INSTANCE is NULL_TREE. */
6046 if (name
== complete_ctor_identifier
&& !instance
)
6048 instance
= build_int_cst (build_pointer_type (class_type
), 0);
6049 instance
= build1 (INDIRECT_REF
, class_type
, instance
);
6053 if (name
== complete_dtor_identifier
6054 || name
== base_dtor_identifier
6055 || name
== deleting_dtor_identifier
)
6056 gcc_assert (args
== NULL
|| VEC_empty (tree
, *args
));
6058 /* Convert to the base class, if necessary. */
6059 if (!same_type_ignoring_top_level_qualifiers_p
6060 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
6062 if (name
!= ansi_assopname (NOP_EXPR
))
6063 /* For constructors and destructors, either the base is
6064 non-virtual, or it is virtual but we are doing the
6065 conversion from a constructor or destructor for the
6066 complete object. In either case, we can convert
6068 instance
= convert_to_base_statically (instance
, binfo
);
6070 /* However, for assignment operators, we must convert
6071 dynamically if the base is virtual. */
6072 instance
= build_base_path (PLUS_EXPR
, instance
,
6073 binfo
, /*nonnull=*/1);
6077 gcc_assert (instance
!= NULL_TREE
);
6079 fns
= lookup_fnfields (binfo
, name
, 1);
6081 /* When making a call to a constructor or destructor for a subobject
6082 that uses virtual base classes, pass down a pointer to a VTT for
6084 if ((name
== base_ctor_identifier
6085 || name
== base_dtor_identifier
)
6086 && CLASSTYPE_VBASECLASSES (class_type
))
6091 /* If the current function is a complete object constructor
6092 or destructor, then we fetch the VTT directly.
6093 Otherwise, we look it up using the VTT we were given. */
6094 vtt
= TREE_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
6095 vtt
= decay_conversion (vtt
);
6096 vtt
= build3 (COND_EXPR
, TREE_TYPE (vtt
),
6097 build2 (EQ_EXPR
, boolean_type_node
,
6098 current_in_charge_parm
, integer_zero_node
),
6101 gcc_assert (BINFO_SUBVTT_INDEX (binfo
));
6102 sub_vtt
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (vtt
), vtt
,
6103 BINFO_SUBVTT_INDEX (binfo
));
6107 allocated
= make_tree_vector ();
6111 VEC_safe_insert (tree
, gc
, *args
, 0, sub_vtt
);
6114 ret
= build_new_method_call (instance
, fns
, args
,
6115 TYPE_BINFO (BINFO_TYPE (binfo
)),
6119 if (allocated
!= NULL
)
6120 release_tree_vector (allocated
);
6125 /* Return the NAME, as a C string. The NAME indicates a function that
6126 is a member of TYPE. *FREE_P is set to true if the caller must
6127 free the memory returned.
6129 Rather than go through all of this, we should simply set the names
6130 of constructors and destructors appropriately, and dispense with
6131 ctor_identifier, dtor_identifier, etc. */
6134 name_as_c_string (tree name
, tree type
, bool *free_p
)
6138 /* Assume that we will not allocate memory. */
6140 /* Constructors and destructors are special. */
6141 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
6144 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
))));
6145 /* For a destructor, add the '~'. */
6146 if (name
== complete_dtor_identifier
6147 || name
== base_dtor_identifier
6148 || name
== deleting_dtor_identifier
)
6150 pretty_name
= concat ("~", pretty_name
, NULL
);
6151 /* Remember that we need to free the memory allocated. */
6155 else if (IDENTIFIER_TYPENAME_P (name
))
6157 pretty_name
= concat ("operator ",
6158 type_as_string_translate (TREE_TYPE (name
),
6159 TFF_PLAIN_IDENTIFIER
),
6161 /* Remember that we need to free the memory allocated. */
6165 pretty_name
= CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name
)));
6170 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
6171 be set, upon return, to the function called. ARGS may be NULL.
6172 This may change ARGS. */
6175 build_new_method_call (tree instance
, tree fns
, VEC(tree
,gc
) **args
,
6176 tree conversion_path
, int flags
,
6177 tree
*fn_p
, tsubst_flags_t complain
)
6179 struct z_candidate
*candidates
= 0, *cand
;
6180 tree explicit_targs
= NULL_TREE
;
6181 tree basetype
= NULL_TREE
;
6184 tree first_mem_arg
= NULL_TREE
;
6187 bool skip_first_for_error
;
6188 VEC(tree
,gc
) *user_args
;
6192 int template_only
= 0;
6196 VEC(tree
,gc
) *orig_args
= NULL
;
6199 gcc_assert (instance
!= NULL_TREE
);
6201 /* We don't know what function we're going to call, yet. */
6205 if (error_operand_p (instance
)
6206 || error_operand_p (fns
))
6207 return error_mark_node
;
6209 if (!BASELINK_P (fns
))
6211 if (complain
& tf_error
)
6212 error ("call to non-function %qD", fns
);
6213 return error_mark_node
;
6216 orig_instance
= instance
;
6219 /* Dismantle the baselink to collect all the information we need. */
6220 if (!conversion_path
)
6221 conversion_path
= BASELINK_BINFO (fns
);
6222 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
6223 optype
= BASELINK_OPTYPE (fns
);
6224 fns
= BASELINK_FUNCTIONS (fns
);
6225 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
6227 explicit_targs
= TREE_OPERAND (fns
, 1);
6228 fns
= TREE_OPERAND (fns
, 0);
6231 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
6232 || TREE_CODE (fns
) == TEMPLATE_DECL
6233 || TREE_CODE (fns
) == OVERLOAD
);
6234 fn
= get_first_fn (fns
);
6235 name
= DECL_NAME (fn
);
6237 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
6238 gcc_assert (CLASS_TYPE_P (basetype
));
6240 if (processing_template_decl
)
6242 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
6243 instance
= build_non_dependent_expr (instance
);
6245 make_args_non_dependent (*args
);
6248 user_args
= args
== NULL
? NULL
: *args
;
6249 /* Under DR 147 A::A() is an invalid constructor call,
6250 not a functional cast. */
6251 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
6253 if (! (complain
& tf_error
))
6254 return error_mark_node
;
6256 permerror (input_location
,
6257 "cannot call constructor %<%T::%D%> directly",
6259 inform (input_location
, "for a function-style cast, remove the "
6260 "redundant %<::%D%>", name
);
6261 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
6263 release_tree_vector (user_args
);
6267 /* Figure out whether to skip the first argument for the error
6268 message we will display to users if an error occurs. We don't
6269 want to display any compiler-generated arguments. The "this"
6270 pointer hasn't been added yet. However, we must remove the VTT
6271 pointer if this is a call to a base-class constructor or
6273 skip_first_for_error
= false;
6274 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
6276 /* Callers should explicitly indicate whether they want to construct
6277 the complete object or just the part without virtual bases. */
6278 gcc_assert (name
!= ctor_identifier
);
6279 /* Similarly for destructors. */
6280 gcc_assert (name
!= dtor_identifier
);
6281 /* Remove the VTT pointer, if present. */
6282 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
6283 && CLASSTYPE_VBASECLASSES (basetype
))
6284 skip_first_for_error
= true;
6287 /* Process the argument list. */
6288 if (args
!= NULL
&& *args
!= NULL
)
6290 *args
= resolve_args (*args
);
6292 return error_mark_node
;
6295 instance_ptr
= build_this (instance
);
6297 /* It's OK to call destructors and constructors on cv-qualified objects.
6298 Therefore, convert the INSTANCE_PTR to the unqualified type, if
6300 if (DECL_DESTRUCTOR_P (fn
)
6301 || DECL_CONSTRUCTOR_P (fn
))
6303 tree type
= build_pointer_type (basetype
);
6304 if (!same_type_p (type
, TREE_TYPE (instance_ptr
)))
6305 instance_ptr
= build_nop (type
, instance_ptr
);
6307 if (DECL_DESTRUCTOR_P (fn
))
6308 name
= complete_dtor_identifier
;
6310 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
6311 initializer, not T({ }). If the type doesn't have a list ctor,
6312 break apart the list into separate ctor args. */
6313 if (DECL_CONSTRUCTOR_P (fn
) && args
!= NULL
&& !VEC_empty (tree
, *args
)
6314 && BRACE_ENCLOSED_INITIALIZER_P (VEC_index (tree
, *args
, 0))
6315 && CONSTRUCTOR_IS_DIRECT_INIT (VEC_index (tree
, *args
, 0))
6316 && !TYPE_HAS_LIST_CTOR (basetype
))
6318 gcc_assert (VEC_length (tree
, *args
) == 1);
6319 *args
= ctor_to_vec (VEC_index (tree
, *args
, 0));
6322 class_type
= (conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
);
6323 first_mem_arg
= instance_ptr
;
6325 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6326 p
= conversion_obstack_alloc (0);
6328 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
6330 tree t
= OVL_CURRENT (fn
);
6331 tree this_first_arg
;
6333 /* We can end up here for copy-init of same or base class. */
6334 if ((flags
& LOOKUP_ONLYCONVERTING
)
6335 && DECL_NONCONVERTING_P (t
))
6338 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (t
))
6339 this_first_arg
= first_mem_arg
;
6341 this_first_arg
= NULL_TREE
;
6343 if (TREE_CODE (t
) == TEMPLATE_DECL
)
6344 /* A member template. */
6345 add_template_candidate (&candidates
, t
,
6349 args
== NULL
? NULL
: *args
,
6355 else if (! template_only
)
6356 add_function_candidate (&candidates
, t
,
6359 args
== NULL
? NULL
: *args
,
6365 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
6368 if (complain
& tf_error
)
6370 if (!COMPLETE_TYPE_P (basetype
))
6371 cxx_incomplete_type_error (instance_ptr
, basetype
);
6378 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
6379 arglist
= build_tree_list_vec (user_args
);
6380 if (skip_first_for_error
)
6381 arglist
= TREE_CHAIN (arglist
);
6382 error ("no matching function for call to %<%T::%s(%A)%#V%>",
6383 basetype
, pretty_name
, arglist
,
6384 TREE_TYPE (TREE_TYPE (instance_ptr
)));
6388 print_z_candidates (candidates
);
6390 call
= error_mark_node
;
6394 cand
= tourney (candidates
);
6401 if (complain
& tf_error
)
6403 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
6404 arglist
= build_tree_list_vec (user_args
);
6405 if (skip_first_for_error
)
6406 arglist
= TREE_CHAIN (arglist
);
6407 error ("call of overloaded %<%s(%A)%> is ambiguous", pretty_name
,
6409 print_z_candidates (candidates
);
6413 call
= error_mark_node
;
6419 if (!(flags
& LOOKUP_NONVIRTUAL
)
6420 && DECL_PURE_VIRTUAL_P (fn
)
6421 && instance
== current_class_ref
6422 && (DECL_CONSTRUCTOR_P (current_function_decl
)
6423 || DECL_DESTRUCTOR_P (current_function_decl
))
6424 && (complain
& tf_warning
))
6425 /* This is not an error, it is runtime undefined
6427 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
) ?
6428 "abstract virtual %q#D called from constructor"
6429 : "abstract virtual %q#D called from destructor"),
6432 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
6433 && is_dummy_object (instance_ptr
))
6435 if (complain
& tf_error
)
6436 error ("cannot call member function %qD without object",
6438 call
= error_mark_node
;
6442 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
6443 && resolves_to_fixed_type_p (instance
, 0))
6444 flags
|= LOOKUP_NONVIRTUAL
;
6445 /* Now we know what function is being called. */
6448 /* Build the actual CALL_EXPR. */
6449 call
= build_over_call (cand
, flags
, complain
);
6450 /* In an expression of the form `a->f()' where `f' turns
6451 out to be a static member function, `a' is
6452 none-the-less evaluated. */
6453 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
6454 && !is_dummy_object (instance_ptr
)
6455 && TREE_SIDE_EFFECTS (instance_ptr
))
6456 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
),
6457 instance_ptr
, call
);
6458 else if (call
!= error_mark_node
6459 && DECL_DESTRUCTOR_P (cand
->fn
)
6460 && !VOID_TYPE_P (TREE_TYPE (call
)))
6461 /* An explicit call of the form "x->~X()" has type
6462 "void". However, on platforms where destructors
6463 return "this" (i.e., those where
6464 targetm.cxx.cdtor_returns_this is true), such calls
6465 will appear to have a return value of pointer type
6466 to the low-level call machinery. We do not want to
6467 change the low-level machinery, since we want to be
6468 able to optimize "delete f()" on such platforms as
6469 "operator delete(~X(f()))" (rather than generating
6470 "t = f(), ~X(t), operator delete (t)"). */
6471 call
= build_nop (void_type_node
, call
);
6476 if (processing_template_decl
&& call
!= error_mark_node
)
6478 bool cast_to_void
= false;
6480 if (TREE_CODE (call
) == COMPOUND_EXPR
)
6481 call
= TREE_OPERAND (call
, 1);
6482 else if (TREE_CODE (call
) == NOP_EXPR
)
6484 cast_to_void
= true;
6485 call
= TREE_OPERAND (call
, 0);
6487 if (TREE_CODE (call
) == INDIRECT_REF
)
6488 call
= TREE_OPERAND (call
, 0);
6489 call
= (build_min_non_dep_call_vec
6491 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
6492 orig_instance
, orig_fns
, NULL_TREE
),
6494 call
= convert_from_reference (call
);
6496 call
= build_nop (void_type_node
, call
);
6499 /* Free all the conversions we allocated. */
6500 obstack_free (&conversion_obstack
, p
);
6502 if (orig_args
!= NULL
)
6503 release_tree_vector (orig_args
);
6508 /* Returns true iff standard conversion sequence ICS1 is a proper
6509 subsequence of ICS2. */
6512 is_subseq (conversion
*ics1
, conversion
*ics2
)
6514 /* We can assume that a conversion of the same code
6515 between the same types indicates a subsequence since we only get
6516 here if the types we are converting from are the same. */
6518 while (ics1
->kind
== ck_rvalue
6519 || ics1
->kind
== ck_lvalue
)
6520 ics1
= ics1
->u
.next
;
6524 while (ics2
->kind
== ck_rvalue
6525 || ics2
->kind
== ck_lvalue
)
6526 ics2
= ics2
->u
.next
;
6528 if (ics2
->kind
== ck_user
6529 || ics2
->kind
== ck_ambig
6530 || ics2
->kind
== ck_identity
)
6531 /* At this point, ICS1 cannot be a proper subsequence of
6532 ICS2. We can get a USER_CONV when we are comparing the
6533 second standard conversion sequence of two user conversion
6537 ics2
= ics2
->u
.next
;
6539 if (ics2
->kind
== ics1
->kind
6540 && same_type_p (ics2
->type
, ics1
->type
)
6541 && same_type_p (ics2
->u
.next
->type
,
6542 ics1
->u
.next
->type
))
6547 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
6548 be any _TYPE nodes. */
6551 is_properly_derived_from (tree derived
, tree base
)
6553 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
6556 /* We only allow proper derivation here. The DERIVED_FROM_P macro
6557 considers every class derived from itself. */
6558 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
6559 && DERIVED_FROM_P (base
, derived
));
6562 /* We build the ICS for an implicit object parameter as a pointer
6563 conversion sequence. However, such a sequence should be compared
6564 as if it were a reference conversion sequence. If ICS is the
6565 implicit conversion sequence for an implicit object parameter,
6566 modify it accordingly. */
6569 maybe_handle_implicit_object (conversion
**ics
)
6573 /* [over.match.funcs]
6575 For non-static member functions, the type of the
6576 implicit object parameter is "reference to cv X"
6577 where X is the class of which the function is a
6578 member and cv is the cv-qualification on the member
6579 function declaration. */
6580 conversion
*t
= *ics
;
6581 tree reference_type
;
6583 /* The `this' parameter is a pointer to a class type. Make the
6584 implicit conversion talk about a reference to that same class
6586 reference_type
= TREE_TYPE (t
->type
);
6587 reference_type
= build_reference_type (reference_type
);
6589 if (t
->kind
== ck_qual
)
6591 if (t
->kind
== ck_ptr
)
6593 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
6594 t
= direct_reference_binding (reference_type
, t
);
6596 t
->rvaluedness_matches_p
= 0;
6601 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
6602 and return the initial reference binding conversion. Otherwise,
6603 leave *ICS unchanged and return NULL. */
6606 maybe_handle_ref_bind (conversion
**ics
)
6608 if ((*ics
)->kind
== ck_ref_bind
)
6610 conversion
*old_ics
= *ics
;
6611 *ics
= old_ics
->u
.next
;
6612 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
6619 /* Compare two implicit conversion sequences according to the rules set out in
6620 [over.ics.rank]. Return values:
6622 1: ics1 is better than ics2
6623 -1: ics2 is better than ics1
6624 0: ics1 and ics2 are indistinguishable */
6627 compare_ics (conversion
*ics1
, conversion
*ics2
)
6633 tree deref_from_type1
= NULL_TREE
;
6634 tree deref_from_type2
= NULL_TREE
;
6635 tree deref_to_type1
= NULL_TREE
;
6636 tree deref_to_type2
= NULL_TREE
;
6637 conversion_rank rank1
, rank2
;
6639 /* REF_BINDING is nonzero if the result of the conversion sequence
6640 is a reference type. In that case REF_CONV is the reference
6641 binding conversion. */
6642 conversion
*ref_conv1
;
6643 conversion
*ref_conv2
;
6645 /* Handle implicit object parameters. */
6646 maybe_handle_implicit_object (&ics1
);
6647 maybe_handle_implicit_object (&ics2
);
6649 /* Handle reference parameters. */
6650 ref_conv1
= maybe_handle_ref_bind (&ics1
);
6651 ref_conv2
= maybe_handle_ref_bind (&ics2
);
6653 /* List-initialization sequence L1 is a better conversion sequence than
6654 list-initialization sequence L2 if L1 converts to
6655 std::initializer_list<X> for some X and L2 does not. */
6656 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
6658 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
6663 When comparing the basic forms of implicit conversion sequences (as
6664 defined in _over.best.ics_)
6666 --a standard conversion sequence (_over.ics.scs_) is a better
6667 conversion sequence than a user-defined conversion sequence
6668 or an ellipsis conversion sequence, and
6670 --a user-defined conversion sequence (_over.ics.user_) is a
6671 better conversion sequence than an ellipsis conversion sequence
6672 (_over.ics.ellipsis_). */
6673 rank1
= CONVERSION_RANK (ics1
);
6674 rank2
= CONVERSION_RANK (ics2
);
6678 else if (rank1
< rank2
)
6681 if (rank1
== cr_bad
)
6683 /* XXX Isn't this an extension? */
6684 /* Both ICS are bad. We try to make a decision based on what
6685 would have happened if they'd been good. */
6686 if (ics1
->user_conv_p
> ics2
->user_conv_p
6687 || ics1
->rank
> ics2
->rank
)
6689 else if (ics1
->user_conv_p
< ics2
->user_conv_p
6690 || ics1
->rank
< ics2
->rank
)
6693 /* We couldn't make up our minds; try to figure it out below. */
6696 if (ics1
->ellipsis_p
|| ics1
->kind
== ck_list
)
6697 /* Both conversions are ellipsis conversions or both are building a
6698 std::initializer_list. */
6701 /* User-defined conversion sequence U1 is a better conversion sequence
6702 than another user-defined conversion sequence U2 if they contain the
6703 same user-defined conversion operator or constructor and if the sec-
6704 ond standard conversion sequence of U1 is better than the second
6705 standard conversion sequence of U2. */
6707 if (ics1
->user_conv_p
)
6712 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= t1
->u
.next
)
6713 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
)
6715 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= t2
->u
.next
)
6716 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
)
6719 if (t1
->cand
->fn
!= t2
->cand
->fn
)
6722 /* We can just fall through here, after setting up
6723 FROM_TYPE1 and FROM_TYPE2. */
6724 from_type1
= t1
->type
;
6725 from_type2
= t2
->type
;
6732 /* We're dealing with two standard conversion sequences.
6736 Standard conversion sequence S1 is a better conversion
6737 sequence than standard conversion sequence S2 if
6739 --S1 is a proper subsequence of S2 (comparing the conversion
6740 sequences in the canonical form defined by _over.ics.scs_,
6741 excluding any Lvalue Transformation; the identity
6742 conversion sequence is considered to be a subsequence of
6743 any non-identity conversion sequence */
6746 while (t1
->kind
!= ck_identity
)
6748 from_type1
= t1
->type
;
6751 while (t2
->kind
!= ck_identity
)
6753 from_type2
= t2
->type
;
6756 /* One sequence can only be a subsequence of the other if they start with
6757 the same type. They can start with different types when comparing the
6758 second standard conversion sequence in two user-defined conversion
6760 if (same_type_p (from_type1
, from_type2
))
6762 if (is_subseq (ics1
, ics2
))
6764 if (is_subseq (ics2
, ics1
))
6772 --the rank of S1 is better than the rank of S2 (by the rules
6775 Standard conversion sequences are ordered by their ranks: an Exact
6776 Match is a better conversion than a Promotion, which is a better
6777 conversion than a Conversion.
6779 Two conversion sequences with the same rank are indistinguishable
6780 unless one of the following rules applies:
6782 --A conversion that is not a conversion of a pointer, or pointer
6783 to member, to bool is better than another conversion that is such
6786 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
6787 so that we do not have to check it explicitly. */
6788 if (ics1
->rank
< ics2
->rank
)
6790 else if (ics2
->rank
< ics1
->rank
)
6793 to_type1
= ics1
->type
;
6794 to_type2
= ics2
->type
;
6796 /* A conversion from scalar arithmetic type to complex is worse than a
6797 conversion between scalar arithmetic types. */
6798 if (same_type_p (from_type1
, from_type2
)
6799 && ARITHMETIC_TYPE_P (from_type1
)
6800 && ARITHMETIC_TYPE_P (to_type1
)
6801 && ARITHMETIC_TYPE_P (to_type2
)
6802 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
6803 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
6805 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
6811 if (TYPE_PTR_P (from_type1
)
6812 && TYPE_PTR_P (from_type2
)
6813 && TYPE_PTR_P (to_type1
)
6814 && TYPE_PTR_P (to_type2
))
6816 deref_from_type1
= TREE_TYPE (from_type1
);
6817 deref_from_type2
= TREE_TYPE (from_type2
);
6818 deref_to_type1
= TREE_TYPE (to_type1
);
6819 deref_to_type2
= TREE_TYPE (to_type2
);
6821 /* The rules for pointers to members A::* are just like the rules
6822 for pointers A*, except opposite: if B is derived from A then
6823 A::* converts to B::*, not vice versa. For that reason, we
6824 switch the from_ and to_ variables here. */
6825 else if ((TYPE_PTRMEM_P (from_type1
) && TYPE_PTRMEM_P (from_type2
)
6826 && TYPE_PTRMEM_P (to_type1
) && TYPE_PTRMEM_P (to_type2
))
6827 || (TYPE_PTRMEMFUNC_P (from_type1
)
6828 && TYPE_PTRMEMFUNC_P (from_type2
)
6829 && TYPE_PTRMEMFUNC_P (to_type1
)
6830 && TYPE_PTRMEMFUNC_P (to_type2
)))
6832 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
6833 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
6834 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
6835 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
6838 if (deref_from_type1
!= NULL_TREE
6839 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
6840 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
6842 /* This was one of the pointer or pointer-like conversions.
6846 --If class B is derived directly or indirectly from class A,
6847 conversion of B* to A* is better than conversion of B* to
6848 void*, and conversion of A* to void* is better than
6849 conversion of B* to void*. */
6850 if (TREE_CODE (deref_to_type1
) == VOID_TYPE
6851 && TREE_CODE (deref_to_type2
) == VOID_TYPE
)
6853 if (is_properly_derived_from (deref_from_type1
,
6856 else if (is_properly_derived_from (deref_from_type2
,
6860 else if (TREE_CODE (deref_to_type1
) == VOID_TYPE
6861 || TREE_CODE (deref_to_type2
) == VOID_TYPE
)
6863 if (same_type_p (deref_from_type1
, deref_from_type2
))
6865 if (TREE_CODE (deref_to_type2
) == VOID_TYPE
)
6867 if (is_properly_derived_from (deref_from_type1
,
6871 /* We know that DEREF_TO_TYPE1 is `void' here. */
6872 else if (is_properly_derived_from (deref_from_type1
,
6877 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
6878 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
6882 --If class B is derived directly or indirectly from class A
6883 and class C is derived directly or indirectly from B,
6885 --conversion of C* to B* is better than conversion of C* to
6888 --conversion of B* to A* is better than conversion of C* to
6890 if (same_type_p (deref_from_type1
, deref_from_type2
))
6892 if (is_properly_derived_from (deref_to_type1
,
6895 else if (is_properly_derived_from (deref_to_type2
,
6899 else if (same_type_p (deref_to_type1
, deref_to_type2
))
6901 if (is_properly_derived_from (deref_from_type2
,
6904 else if (is_properly_derived_from (deref_from_type1
,
6910 else if (CLASS_TYPE_P (non_reference (from_type1
))
6911 && same_type_p (from_type1
, from_type2
))
6913 tree from
= non_reference (from_type1
);
6917 --binding of an expression of type C to a reference of type
6918 B& is better than binding an expression of type C to a
6919 reference of type A&
6921 --conversion of C to B is better than conversion of C to A, */
6922 if (is_properly_derived_from (from
, to_type1
)
6923 && is_properly_derived_from (from
, to_type2
))
6925 if (is_properly_derived_from (to_type1
, to_type2
))
6927 else if (is_properly_derived_from (to_type2
, to_type1
))
6931 else if (CLASS_TYPE_P (non_reference (to_type1
))
6932 && same_type_p (to_type1
, to_type2
))
6934 tree to
= non_reference (to_type1
);
6938 --binding of an expression of type B to a reference of type
6939 A& is better than binding an expression of type C to a
6940 reference of type A&,
6942 --conversion of B to A is better than conversion of C to A */
6943 if (is_properly_derived_from (from_type1
, to
)
6944 && is_properly_derived_from (from_type2
, to
))
6946 if (is_properly_derived_from (from_type2
, from_type1
))
6948 else if (is_properly_derived_from (from_type1
, from_type2
))
6955 --S1 and S2 differ only in their qualification conversion and yield
6956 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
6957 qualification signature of type T1 is a proper subset of the cv-
6958 qualification signature of type T2 */
6959 if (ics1
->kind
== ck_qual
6960 && ics2
->kind
== ck_qual
6961 && same_type_p (from_type1
, from_type2
))
6963 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
6970 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
6971 to an implicit object parameter, and either S1 binds an lvalue reference
6972 to an lvalue and S2 binds an rvalue reference or S1 binds an rvalue
6973 reference to an rvalue and S2 binds an lvalue reference
6974 (C++0x draft standard, 13.3.3.2)
6976 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
6977 types to which the references refer are the same type except for
6978 top-level cv-qualifiers, and the type to which the reference
6979 initialized by S2 refers is more cv-qualified than the type to
6980 which the reference initialized by S1 refers */
6982 if (ref_conv1
&& ref_conv2
)
6984 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
6985 && (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
6986 != TYPE_REF_IS_RVALUE (ref_conv2
->type
)))
6988 if (ref_conv1
->rvaluedness_matches_p
)
6990 if (ref_conv2
->rvaluedness_matches_p
)
6994 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
6995 return comp_cv_qualification (TREE_TYPE (ref_conv2
->type
),
6996 TREE_TYPE (ref_conv1
->type
));
6999 /* Neither conversion sequence is better than the other. */
7003 /* The source type for this standard conversion sequence. */
7006 source_type (conversion
*t
)
7008 for (;; t
= t
->u
.next
)
7010 if (t
->kind
== ck_user
7011 || t
->kind
== ck_ambig
7012 || t
->kind
== ck_identity
)
7018 /* Note a warning about preferring WINNER to LOSER. We do this by storing
7019 a pointer to LOSER and re-running joust to produce the warning if WINNER
7020 is actually used. */
7023 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
7025 candidate_warning
*cw
= (candidate_warning
*)
7026 conversion_obstack_alloc (sizeof (candidate_warning
));
7028 cw
->next
= winner
->warnings
;
7029 winner
->warnings
= cw
;
7032 /* Compare two candidates for overloading as described in
7033 [over.match.best]. Return values:
7035 1: cand1 is better than cand2
7036 -1: cand2 is better than cand1
7037 0: cand1 and cand2 are indistinguishable */
7040 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
)
7043 int off1
= 0, off2
= 0;
7047 /* Candidates that involve bad conversions are always worse than those
7049 if (cand1
->viable
> cand2
->viable
)
7051 if (cand1
->viable
< cand2
->viable
)
7054 /* If we have two pseudo-candidates for conversions to the same type,
7055 or two candidates for the same function, arbitrarily pick one. */
7056 if (cand1
->fn
== cand2
->fn
7057 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
7060 /* a viable function F1
7061 is defined to be a better function than another viable function F2 if
7062 for all arguments i, ICSi(F1) is not a worse conversion sequence than
7063 ICSi(F2), and then */
7065 /* for some argument j, ICSj(F1) is a better conversion sequence than
7068 /* For comparing static and non-static member functions, we ignore
7069 the implicit object parameter of the non-static function. The
7070 standard says to pretend that the static function has an object
7071 parm, but that won't work with operator overloading. */
7072 len
= cand1
->num_convs
;
7073 if (len
!= cand2
->num_convs
)
7075 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
7076 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
7078 gcc_assert (static_1
!= static_2
);
7089 for (i
= 0; i
< len
; ++i
)
7091 conversion
*t1
= cand1
->convs
[i
+ off1
];
7092 conversion
*t2
= cand2
->convs
[i
+ off2
];
7093 int comp
= compare_ics (t1
, t2
);
7098 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
7099 == cr_std
+ cr_promotion
)
7100 && t1
->kind
== ck_std
7101 && t2
->kind
== ck_std
7102 && TREE_CODE (t1
->type
) == INTEGER_TYPE
7103 && TREE_CODE (t2
->type
) == INTEGER_TYPE
7104 && (TYPE_PRECISION (t1
->type
)
7105 == TYPE_PRECISION (t2
->type
))
7106 && (TYPE_UNSIGNED (t1
->u
.next
->type
)
7107 || (TREE_CODE (t1
->u
.next
->type
)
7110 tree type
= t1
->u
.next
->type
;
7112 struct z_candidate
*w
, *l
;
7114 type1
= t1
->type
, type2
= t2
->type
,
7115 w
= cand1
, l
= cand2
;
7117 type1
= t2
->type
, type2
= t1
->type
,
7118 w
= cand2
, l
= cand1
;
7122 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
7123 type
, type1
, type2
);
7124 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
7130 if (winner
&& comp
!= winner
)
7139 /* warn about confusing overload resolution for user-defined conversions,
7140 either between a constructor and a conversion op, or between two
7142 if (winner
&& warn_conversion
&& cand1
->second_conv
7143 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
7144 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
7146 struct z_candidate
*w
, *l
;
7147 bool give_warning
= false;
7150 w
= cand1
, l
= cand2
;
7152 w
= cand2
, l
= cand1
;
7154 /* We don't want to complain about `X::operator T1 ()'
7155 beating `X::operator T2 () const', when T2 is a no less
7156 cv-qualified version of T1. */
7157 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
7158 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
7160 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
7161 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
7163 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
7168 if (!comp_ptr_ttypes (t
, f
))
7169 give_warning
= true;
7172 give_warning
= true;
7178 tree source
= source_type (w
->convs
[0]);
7179 if (! DECL_CONSTRUCTOR_P (w
->fn
))
7180 source
= TREE_TYPE (source
);
7181 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
7182 && warning (OPT_Wconversion
, " for conversion from %qT to %qT",
7183 source
, w
->second_conv
->type
))
7185 inform (input_location
, " because conversion sequence for the argument is better");
7196 F1 is a non-template function and F2 is a template function
7199 if (!cand1
->template_decl
&& cand2
->template_decl
)
7201 else if (cand1
->template_decl
&& !cand2
->template_decl
)
7205 F1 and F2 are template functions and the function template for F1 is
7206 more specialized than the template for F2 according to the partial
7209 if (cand1
->template_decl
&& cand2
->template_decl
)
7211 winner
= more_specialized_fn
7212 (TI_TEMPLATE (cand1
->template_decl
),
7213 TI_TEMPLATE (cand2
->template_decl
),
7214 /* [temp.func.order]: The presence of unused ellipsis and default
7215 arguments has no effect on the partial ordering of function
7216 templates. add_function_candidate() will not have
7217 counted the "this" argument for constructors. */
7218 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
7224 the context is an initialization by user-defined conversion (see
7225 _dcl.init_ and _over.match.user_) and the standard conversion
7226 sequence from the return type of F1 to the destination type (i.e.,
7227 the type of the entity being initialized) is a better conversion
7228 sequence than the standard conversion sequence from the return type
7229 of F2 to the destination type. */
7231 if (cand1
->second_conv
)
7233 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
7238 /* Check whether we can discard a builtin candidate, either because we
7239 have two identical ones or matching builtin and non-builtin candidates.
7241 (Pedantically in the latter case the builtin which matched the user
7242 function should not be added to the overload set, but we spot it here.
7245 ... the builtin candidates include ...
7246 - do not have the same parameter type list as any non-template
7247 non-member candidate. */
7249 if (TREE_CODE (cand1
->fn
) == IDENTIFIER_NODE
7250 || TREE_CODE (cand2
->fn
) == IDENTIFIER_NODE
)
7252 for (i
= 0; i
< len
; ++i
)
7253 if (!same_type_p (cand1
->convs
[i
]->type
,
7254 cand2
->convs
[i
]->type
))
7256 if (i
== cand1
->num_convs
)
7258 if (cand1
->fn
== cand2
->fn
)
7259 /* Two built-in candidates; arbitrarily pick one. */
7261 else if (TREE_CODE (cand1
->fn
) == IDENTIFIER_NODE
)
7262 /* cand1 is built-in; prefer cand2. */
7265 /* cand2 is built-in; prefer cand1. */
7270 /* If the two function declarations represent the same function (this can
7271 happen with declarations in multiple scopes and arg-dependent lookup),
7272 arbitrarily choose one. But first make sure the default args we're
7274 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
7275 && equal_functions (cand1
->fn
, cand2
->fn
))
7277 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
7278 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
7280 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
7282 for (i
= 0; i
< len
; ++i
)
7284 /* Don't crash if the fn is variadic. */
7287 parms1
= TREE_CHAIN (parms1
);
7288 parms2
= TREE_CHAIN (parms2
);
7292 parms1
= TREE_CHAIN (parms1
);
7294 parms2
= TREE_CHAIN (parms2
);
7298 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
7299 TREE_PURPOSE (parms2
)))
7303 permerror (input_location
, "default argument mismatch in "
7304 "overload resolution");
7305 inform (input_location
,
7306 " candidate 1: %q+#F", cand1
->fn
);
7307 inform (input_location
,
7308 " candidate 2: %q+#F", cand2
->fn
);
7311 add_warning (cand1
, cand2
);
7314 parms1
= TREE_CHAIN (parms1
);
7315 parms2
= TREE_CHAIN (parms2
);
7323 /* Extension: If the worst conversion for one candidate is worse than the
7324 worst conversion for the other, take the first. */
7327 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
7328 struct z_candidate
*w
= 0, *l
= 0;
7330 for (i
= 0; i
< len
; ++i
)
7332 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
7333 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
7334 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
7335 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
7338 winner
= 1, w
= cand1
, l
= cand2
;
7340 winner
= -1, w
= cand2
, l
= cand1
;
7345 pedwarn (input_location
, 0,
7346 "ISO C++ says that these are ambiguous, even "
7347 "though the worst conversion for the first is better than "
7348 "the worst conversion for the second:");
7349 print_z_candidate (_("candidate 1:"), w
);
7350 print_z_candidate (_("candidate 2:"), l
);
7358 gcc_assert (!winner
);
7362 /* Given a list of candidates for overloading, find the best one, if any.
7363 This algorithm has a worst case of O(2n) (winner is last), and a best
7364 case of O(n/2) (totally ambiguous); much better than a sorting
7367 static struct z_candidate
*
7368 tourney (struct z_candidate
*candidates
)
7370 struct z_candidate
*champ
= candidates
, *challenger
;
7372 int champ_compared_to_predecessor
= 0;
7374 /* Walk through the list once, comparing each current champ to the next
7375 candidate, knocking out a candidate or two with each comparison. */
7377 for (challenger
= champ
->next
; challenger
; )
7379 fate
= joust (champ
, challenger
, 0);
7381 challenger
= challenger
->next
;
7386 champ
= challenger
->next
;
7389 champ_compared_to_predecessor
= 0;
7394 champ_compared_to_predecessor
= 1;
7397 challenger
= champ
->next
;
7401 /* Make sure the champ is better than all the candidates it hasn't yet
7402 been compared to. */
7404 for (challenger
= candidates
;
7406 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
7407 challenger
= challenger
->next
)
7409 fate
= joust (champ
, challenger
, 0);
7417 /* Returns nonzero if things of type FROM can be converted to TO. */
7420 can_convert (tree to
, tree from
)
7422 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
);
7425 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
7428 can_convert_arg (tree to
, tree from
, tree arg
, int flags
)
7434 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7435 p
= conversion_obstack_alloc (0);
7437 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
7439 ok_p
= (t
&& !t
->bad_p
);
7441 /* Free all the conversions we allocated. */
7442 obstack_free (&conversion_obstack
, p
);
7447 /* Like can_convert_arg, but allows dubious conversions as well. */
7450 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
)
7455 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7456 p
= conversion_obstack_alloc (0);
7457 /* Try to perform the conversion. */
7458 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
7460 /* Free all the conversions we allocated. */
7461 obstack_free (&conversion_obstack
, p
);
7466 /* Convert EXPR to TYPE. Return the converted expression.
7468 Note that we allow bad conversions here because by the time we get to
7469 this point we are committed to doing the conversion. If we end up
7470 doing a bad conversion, convert_like will complain. */
7473 perform_implicit_conversion_flags (tree type
, tree expr
, tsubst_flags_t complain
, int flags
)
7478 if (error_operand_p (expr
))
7479 return error_mark_node
;
7481 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7482 p
= conversion_obstack_alloc (0);
7484 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
7490 if (complain
& tf_error
)
7492 /* If expr has unknown type, then it is an overloaded function.
7493 Call instantiate_type to get good error messages. */
7494 if (TREE_TYPE (expr
) == unknown_type_node
)
7495 instantiate_type (type
, expr
, complain
);
7496 else if (invalid_nonstatic_memfn_p (expr
, complain
))
7497 /* We gave an error. */;
7499 error ("could not convert %qE to %qT", expr
, type
);
7501 expr
= error_mark_node
;
7503 else if (processing_template_decl
)
7505 /* In a template, we are only concerned about determining the
7506 type of non-dependent expressions, so we do not have to
7507 perform the actual conversion. */
7508 if (TREE_TYPE (expr
) != type
)
7509 expr
= build_nop (type
, expr
);
7512 expr
= convert_like (conv
, expr
, complain
);
7514 /* Free all the conversions we allocated. */
7515 obstack_free (&conversion_obstack
, p
);
7521 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
7523 return perform_implicit_conversion_flags (type
, expr
, complain
, LOOKUP_IMPLICIT
);
7526 /* Convert EXPR to TYPE (as a direct-initialization) if that is
7527 permitted. If the conversion is valid, the converted expression is
7528 returned. Otherwise, NULL_TREE is returned, except in the case
7529 that TYPE is a class type; in that case, an error is issued. If
7530 C_CAST_P is true, then this direction initialization is taking
7531 place as part of a static_cast being attempted as part of a C-style
7535 perform_direct_initialization_if_possible (tree type
,
7538 tsubst_flags_t complain
)
7543 if (type
== error_mark_node
|| error_operand_p (expr
))
7544 return error_mark_node
;
7547 If the destination type is a (possibly cv-qualified) class type:
7549 -- If the initialization is direct-initialization ...,
7550 constructors are considered. ... If no constructor applies, or
7551 the overload resolution is ambiguous, the initialization is
7553 if (CLASS_TYPE_P (type
))
7555 VEC(tree
,gc
) *args
= make_tree_vector_single (expr
);
7556 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
7557 &args
, type
, LOOKUP_NORMAL
, complain
);
7558 release_tree_vector (args
);
7559 return build_cplus_new (type
, expr
);
7562 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7563 p
= conversion_obstack_alloc (0);
7565 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
7568 if (!conv
|| conv
->bad_p
)
7571 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0, 0,
7572 /*issue_conversion_warnings=*/false,
7574 tf_warning_or_error
);
7576 /* Free all the conversions we allocated. */
7577 obstack_free (&conversion_obstack
, p
);
7582 /* DECL is a VAR_DECL whose type is a REFERENCE_TYPE. The reference
7583 is being bound to a temporary. Create and return a new VAR_DECL
7584 with the indicated TYPE; this variable will store the value to
7585 which the reference is bound. */
7588 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
7592 /* Create the variable. */
7593 var
= create_temporary_var (type
);
7595 /* Register the variable. */
7596 if (TREE_STATIC (decl
))
7598 /* Namespace-scope or local static; give it a mangled name. */
7601 TREE_STATIC (var
) = 1;
7602 name
= mangle_ref_init_variable (decl
);
7603 DECL_NAME (var
) = name
;
7604 SET_DECL_ASSEMBLER_NAME (var
, name
);
7605 var
= pushdecl_top_level (var
);
7608 /* Create a new cleanup level if necessary. */
7609 maybe_push_cleanup_level (type
);
7614 /* EXPR is the initializer for a variable DECL of reference or
7615 std::initializer_list type. Create, push and return a new VAR_DECL
7616 for the initializer so that it will live as long as DECL. Any
7617 cleanup for the new variable is returned through CLEANUP, and the
7618 code to initialize the new variable is returned through INITP. */
7621 set_up_extended_ref_temp (tree decl
, tree expr
, tree
*cleanup
, tree
*initp
)
7627 /* Create the temporary variable. */
7628 type
= TREE_TYPE (expr
);
7629 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
7630 layout_decl (var
, 0);
7631 /* If the rvalue is the result of a function call it will be
7632 a TARGET_EXPR. If it is some other construct (such as a
7633 member access expression where the underlying object is
7634 itself the result of a function call), turn it into a
7635 TARGET_EXPR here. It is important that EXPR be a
7636 TARGET_EXPR below since otherwise the INIT_EXPR will
7637 attempt to make a bitwise copy of EXPR to initialize
7639 if (TREE_CODE (expr
) != TARGET_EXPR
)
7640 expr
= get_target_expr (expr
);
7641 /* Create the INIT_EXPR that will initialize the temporary
7643 init
= build2 (INIT_EXPR
, type
, var
, expr
);
7644 if (at_function_scope_p ())
7646 add_decl_expr (var
);
7648 if (TREE_STATIC (var
))
7649 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
7651 *cleanup
= cxx_maybe_build_cleanup (var
);
7653 /* We must be careful to destroy the temporary only
7654 after its initialization has taken place. If the
7655 initialization throws an exception, then the
7656 destructor should not be run. We cannot simply
7657 transform INIT into something like:
7659 (INIT, ({ CLEANUP_STMT; }))
7661 because emit_local_var always treats the
7662 initializer as a full-expression. Thus, the
7663 destructor would run too early; it would run at the
7664 end of initializing the reference variable, rather
7665 than at the end of the block enclosing the
7668 The solution is to pass back a cleanup expression
7669 which the caller is responsible for attaching to
7670 the statement tree. */
7674 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
7675 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7676 static_aggregates
= tree_cons (NULL_TREE
, var
,
7684 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
7685 initializing a variable of that TYPE. If DECL is non-NULL, it is
7686 the VAR_DECL being initialized with the EXPR. (In that case, the
7687 type of DECL will be TYPE.) If DECL is non-NULL, then CLEANUP must
7688 also be non-NULL, and with *CLEANUP initialized to NULL. Upon
7689 return, if *CLEANUP is no longer NULL, it will be an expression
7690 that should be pushed as a cleanup after the returned expression
7691 is used to initialize DECL.
7693 Return the converted expression. */
7696 initialize_reference (tree type
, tree expr
, tree decl
, tree
*cleanup
,
7697 tsubst_flags_t complain
)
7702 if (type
== error_mark_node
|| error_operand_p (expr
))
7703 return error_mark_node
;
7705 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7706 p
= conversion_obstack_alloc (0);
7708 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
7710 if (!conv
|| conv
->bad_p
)
7712 if (complain
& tf_error
)
7714 if (!(TYPE_QUALS (TREE_TYPE (type
)) & TYPE_QUAL_CONST
)
7715 && !TYPE_REF_IS_RVALUE (type
)
7716 && !real_lvalue_p (expr
))
7717 error ("invalid initialization of non-const reference of "
7718 "type %qT from an rvalue of type %qT",
7719 type
, TREE_TYPE (expr
));
7721 error ("invalid initialization of reference of type "
7722 "%qT from expression of type %qT", type
,
7725 return error_mark_node
;
7728 /* If DECL is non-NULL, then this special rule applies:
7732 The temporary to which the reference is bound or the temporary
7733 that is the complete object to which the reference is bound
7734 persists for the lifetime of the reference.
7736 The temporaries created during the evaluation of the expression
7737 initializing the reference, except the temporary to which the
7738 reference is bound, are destroyed at the end of the
7739 full-expression in which they are created.
7741 In that case, we store the converted expression into a new
7742 VAR_DECL in a new scope.
7744 However, we want to be careful not to create temporaries when
7745 they are not required. For example, given:
7748 struct D : public B {};
7752 there is no need to copy the return value from "f"; we can just
7753 extend its lifetime. Similarly, given:
7756 struct T { operator S(); };
7760 we can extend the lifetime of the return value of the conversion
7762 gcc_assert (conv
->kind
== ck_ref_bind
);
7766 tree base_conv_type
;
7768 /* Skip over the REF_BIND. */
7769 conv
= conv
->u
.next
;
7770 /* If the next conversion is a BASE_CONV, skip that too -- but
7771 remember that the conversion was required. */
7772 if (conv
->kind
== ck_base
)
7774 base_conv_type
= conv
->type
;
7775 conv
= conv
->u
.next
;
7778 base_conv_type
= NULL_TREE
;
7779 /* Perform the remainder of the conversion. */
7780 expr
= convert_like_real (conv
, expr
,
7781 /*fn=*/NULL_TREE
, /*argnum=*/0,
7783 /*issue_conversion_warnings=*/true,
7785 tf_warning_or_error
);
7786 if (error_operand_p (expr
))
7787 expr
= error_mark_node
;
7790 if (!lvalue_or_rvalue_with_address_p (expr
))
7793 var
= set_up_extended_ref_temp (decl
, expr
, cleanup
, &init
);
7794 /* Use its address to initialize the reference variable. */
7795 expr
= build_address (var
);
7797 expr
= convert_to_base (expr
,
7798 build_pointer_type (base_conv_type
),
7799 /*check_access=*/true,
7801 expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr
), init
, expr
);
7804 /* Take the address of EXPR. */
7805 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, tf_warning_or_error
);
7806 /* If a BASE_CONV was required, perform it now. */
7808 expr
= (perform_implicit_conversion
7809 (build_pointer_type (base_conv_type
), expr
,
7810 tf_warning_or_error
));
7811 expr
= build_nop (type
, expr
);
7815 /* Perform the conversion. */
7816 expr
= convert_like (conv
, expr
, tf_warning_or_error
);
7818 /* Free all the conversions we allocated. */
7819 obstack_free (&conversion_obstack
, p
);
7824 /* Returns true iff TYPE is some variant of std::initializer_list. */
7827 is_std_init_list (tree type
)
7829 return (CLASS_TYPE_P (type
)
7830 && CP_TYPE_CONTEXT (type
) == std_node
7831 && strcmp (TYPE_NAME_STRING (type
), "initializer_list") == 0);
7834 /* Returns true iff DECL is a list constructor: i.e. a constructor which
7835 will accept an argument list of a single std::initializer_list<T>. */
7838 is_list_ctor (tree decl
)
7840 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
7843 if (!args
|| args
== void_list_node
)
7846 arg
= non_reference (TREE_VALUE (args
));
7847 if (!is_std_init_list (arg
))
7850 args
= TREE_CHAIN (args
);
7852 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
7853 /* There are more non-defaulted parms. */
7859 #include "gt-cp-call.h"