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
, tree
, const VEC(tree
,gc
) *, tree
, tree
, bool,
201 tree
, tree
, 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 or
464 an rvalue of type std::nullptr_t. */
465 t
= integral_constant_value (t
);
467 || TREE_CODE (TREE_TYPE (t
)) == NULLPTR_TYPE
)
469 if (CP_INTEGRAL_TYPE_P (TREE_TYPE (t
)) && integer_zerop (t
))
472 if (!TREE_OVERFLOW (t
))
478 /* Returns nonzero if PARMLIST consists of only default parms and/or
482 sufficient_parms_p (const_tree parmlist
)
484 for (; parmlist
&& parmlist
!= void_list_node
;
485 parmlist
= TREE_CHAIN (parmlist
))
486 if (!TREE_PURPOSE (parmlist
))
491 /* Allocate N bytes of memory from the conversion obstack. The memory
492 is zeroed before being returned. */
495 conversion_obstack_alloc (size_t n
)
498 if (!conversion_obstack_initialized
)
500 gcc_obstack_init (&conversion_obstack
);
501 conversion_obstack_initialized
= true;
503 p
= obstack_alloc (&conversion_obstack
, n
);
508 /* Dynamically allocate a conversion. */
511 alloc_conversion (conversion_kind kind
)
514 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
519 #ifdef ENABLE_CHECKING
521 /* Make sure that all memory on the conversion obstack has been
525 validate_conversion_obstack (void)
527 if (conversion_obstack_initialized
)
528 gcc_assert ((obstack_next_free (&conversion_obstack
)
529 == obstack_base (&conversion_obstack
)));
532 #endif /* ENABLE_CHECKING */
534 /* Dynamically allocate an array of N conversions. */
537 alloc_conversions (size_t n
)
539 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
543 build_conv (conversion_kind code
, tree type
, conversion
*from
)
546 conversion_rank rank
= CONVERSION_RANK (from
);
548 /* Note that the caller is responsible for filling in t->cand for
549 user-defined conversions. */
550 t
= alloc_conversion (code
);
573 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
574 t
->bad_p
= from
->bad_p
;
579 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
580 specialization of std::initializer_list<T>, if such a conversion is
584 build_list_conv (tree type
, tree ctor
, int flags
)
586 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
587 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
588 conversion
**subconvs
= alloc_conversions (len
);
593 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
596 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
604 t
= alloc_conversion (ck_list
);
606 t
->u
.list
= subconvs
;
609 for (i
= 0; i
< len
; ++i
)
611 conversion
*sub
= subconvs
[i
];
612 if (sub
->rank
> t
->rank
)
614 if (sub
->user_conv_p
)
615 t
->user_conv_p
= true;
623 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
624 aggregate class, if such a conversion is possible. */
627 build_aggr_conv (tree type
, tree ctor
, int flags
)
629 unsigned HOST_WIDE_INT i
= 0;
631 tree field
= next_initializable_field (TYPE_FIELDS (type
));
633 for (; field
; field
= next_initializable_field (TREE_CHAIN (field
)))
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 if (TREE_CODE (type
) == UNION_TYPE
)
645 else if (build_value_init (TREE_TYPE (field
)) == error_mark_node
)
649 if (i
< CONSTRUCTOR_NELTS (ctor
))
652 c
= alloc_conversion (ck_aggr
);
655 c
->user_conv_p
= true;
660 /* Build a representation of the identity conversion from EXPR to
661 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
664 build_identity_conv (tree type
, tree expr
)
668 c
= alloc_conversion (ck_identity
);
675 /* Converting from EXPR to TYPE was ambiguous in the sense that there
676 were multiple user-defined conversions to accomplish the job.
677 Build a conversion that indicates that ambiguity. */
680 build_ambiguous_conv (tree type
, tree expr
)
684 c
= alloc_conversion (ck_ambig
);
692 strip_top_quals (tree t
)
694 if (TREE_CODE (t
) == ARRAY_TYPE
)
696 return cp_build_qualified_type (t
, 0);
699 /* Returns the standard conversion path (see [conv]) from type FROM to type
700 TO, if any. For proper handling of null pointer constants, you must
701 also pass the expression EXPR to convert from. If C_CAST_P is true,
702 this conversion is coming from a C-style cast. */
705 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
708 enum tree_code fcode
, tcode
;
710 bool fromref
= false;
712 to
= non_reference (to
);
713 if (TREE_CODE (from
) == REFERENCE_TYPE
)
716 from
= TREE_TYPE (from
);
718 to
= strip_top_quals (to
);
719 from
= strip_top_quals (from
);
721 if ((TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
722 && expr
&& type_unknown_p (expr
))
724 tsubst_flags_t tflags
= tf_conv
;
725 if (!(flags
& LOOKUP_PROTECT
))
726 tflags
|= tf_no_access_control
;
727 expr
= instantiate_type (to
, expr
, tflags
);
728 if (expr
== error_mark_node
)
730 from
= TREE_TYPE (expr
);
733 fcode
= TREE_CODE (from
);
734 tcode
= TREE_CODE (to
);
736 conv
= build_identity_conv (from
, expr
);
737 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
739 from
= type_decays_to (from
);
740 fcode
= TREE_CODE (from
);
741 conv
= build_conv (ck_lvalue
, from
, conv
);
743 else if (fromref
|| (expr
&& lvalue_p (expr
)))
748 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
751 from
= strip_top_quals (bitfield_type
);
752 fcode
= TREE_CODE (from
);
755 conv
= build_conv (ck_rvalue
, from
, conv
);
758 /* Allow conversion between `__complex__' data types. */
759 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
761 /* The standard conversion sequence to convert FROM to TO is
762 the standard conversion sequence to perform componentwise
764 conversion
*part_conv
= standard_conversion
765 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
);
769 conv
= build_conv (part_conv
->kind
, to
, conv
);
770 conv
->rank
= part_conv
->rank
;
778 if (same_type_p (from
, to
))
782 A null pointer constant can be converted to a pointer type; ... A
783 null pointer constant of integral type can be converted to an
784 rvalue of type std::nullptr_t. */
785 if ((tcode
== POINTER_TYPE
|| TYPE_PTR_TO_MEMBER_P (to
)
786 || tcode
== NULLPTR_TYPE
)
787 && expr
&& null_ptr_cst_p (expr
))
788 conv
= build_conv (ck_std
, to
, conv
);
789 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
790 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
792 /* For backwards brain damage compatibility, allow interconversion of
793 pointers and integers with a pedwarn. */
794 conv
= build_conv (ck_std
, to
, conv
);
797 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
799 /* For backwards brain damage compatibility, allow interconversion of
800 enums and integers with a pedwarn. */
801 conv
= build_conv (ck_std
, to
, conv
);
804 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
805 || (TYPE_PTRMEM_P (to
) && TYPE_PTRMEM_P (from
)))
810 if (tcode
== POINTER_TYPE
811 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from
),
814 else if (VOID_TYPE_P (TREE_TYPE (to
))
815 && !TYPE_PTRMEM_P (from
)
816 && TREE_CODE (TREE_TYPE (from
)) != FUNCTION_TYPE
)
818 from
= build_pointer_type
819 (cp_build_qualified_type (void_type_node
,
820 cp_type_quals (TREE_TYPE (from
))));
821 conv
= build_conv (ck_ptr
, from
, conv
);
823 else if (TYPE_PTRMEM_P (from
))
825 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
826 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
828 if (DERIVED_FROM_P (fbase
, tbase
)
829 && (same_type_ignoring_top_level_qualifiers_p
830 (TYPE_PTRMEM_POINTED_TO_TYPE (from
),
831 TYPE_PTRMEM_POINTED_TO_TYPE (to
))))
833 from
= build_ptrmem_type (tbase
,
834 TYPE_PTRMEM_POINTED_TO_TYPE (from
));
835 conv
= build_conv (ck_pmem
, from
, conv
);
837 else if (!same_type_p (fbase
, tbase
))
840 else if (CLASS_TYPE_P (TREE_TYPE (from
))
841 && CLASS_TYPE_P (TREE_TYPE (to
))
844 An rvalue of type "pointer to cv D," where D is a
845 class type, can be converted to an rvalue of type
846 "pointer to cv B," where B is a base class (clause
847 _class.derived_) of D. If B is an inaccessible
848 (clause _class.access_) or ambiguous
849 (_class.member.lookup_) base class of D, a program
850 that necessitates this conversion is ill-formed.
851 Therefore, we use DERIVED_FROM_P, and do not check
852 access or uniqueness. */
853 && DERIVED_FROM_P (TREE_TYPE (to
), TREE_TYPE (from
)))
856 cp_build_qualified_type (TREE_TYPE (to
),
857 cp_type_quals (TREE_TYPE (from
)));
858 from
= build_pointer_type (from
);
859 conv
= build_conv (ck_ptr
, from
, conv
);
863 if (tcode
== POINTER_TYPE
)
865 to_pointee
= TREE_TYPE (to
);
866 from_pointee
= TREE_TYPE (from
);
870 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
871 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
874 if (same_type_p (from
, to
))
876 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
877 /* In a C-style cast, we ignore CV-qualification because we
878 are allowed to perform a static_cast followed by a
880 conv
= build_conv (ck_qual
, to
, conv
);
881 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
882 conv
= build_conv (ck_qual
, to
, conv
);
883 else if (expr
&& string_conv_p (to
, expr
, 0))
884 /* converting from string constant to char *. */
885 conv
= build_conv (ck_qual
, to
, conv
);
886 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
888 conv
= build_conv (ck_ptr
, to
, conv
);
896 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
898 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
899 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
900 tree fbase
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fromfn
)));
901 tree tbase
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (tofn
)));
903 if (!DERIVED_FROM_P (fbase
, tbase
)
904 || !same_type_p (TREE_TYPE (fromfn
), TREE_TYPE (tofn
))
905 || !compparms (TREE_CHAIN (TYPE_ARG_TYPES (fromfn
)),
906 TREE_CHAIN (TYPE_ARG_TYPES (tofn
)))
907 || cp_type_quals (fbase
) != cp_type_quals (tbase
))
910 from
= build_memfn_type (fromfn
, tbase
, cp_type_quals (tbase
));
911 from
= build_ptrmemfunc_type (build_pointer_type (from
));
912 conv
= build_conv (ck_pmem
, from
, conv
);
915 else if (tcode
== BOOLEAN_TYPE
)
919 An rvalue of arithmetic, unscoped enumeration, pointer, or
920 pointer to member type can be converted to an rvalue of type
921 bool. ... An rvalue of type std::nullptr_t can be converted
922 to an rvalue of type bool; */
923 if (ARITHMETIC_TYPE_P (from
)
924 || UNSCOPED_ENUM_P (from
)
925 || fcode
== POINTER_TYPE
926 || TYPE_PTR_TO_MEMBER_P (from
)
927 || fcode
== NULLPTR_TYPE
)
929 conv
= build_conv (ck_std
, to
, conv
);
930 if (fcode
== POINTER_TYPE
931 || TYPE_PTRMEM_P (from
)
932 || (TYPE_PTRMEMFUNC_P (from
)
933 && conv
->rank
< cr_pbool
)
934 || fcode
== NULLPTR_TYPE
)
935 conv
->rank
= cr_pbool
;
941 /* We don't check for ENUMERAL_TYPE here because there are no standard
942 conversions to enum type. */
943 /* As an extension, allow conversion to complex type. */
944 else if (ARITHMETIC_TYPE_P (to
))
946 if (! (INTEGRAL_CODE_P (fcode
) || fcode
== REAL_TYPE
)
947 || SCOPED_ENUM_P (from
))
949 conv
= build_conv (ck_std
, to
, conv
);
951 /* Give this a better rank if it's a promotion. */
952 if (same_type_p (to
, type_promotes_to (from
))
953 && conv
->u
.next
->rank
<= cr_promotion
)
954 conv
->rank
= cr_promotion
;
956 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
957 && vector_types_convertible_p (from
, to
, false))
958 return build_conv (ck_std
, to
, conv
);
959 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
960 && is_properly_derived_from (from
, to
))
962 if (conv
->kind
== ck_rvalue
)
964 conv
= build_conv (ck_base
, to
, conv
);
965 /* The derived-to-base conversion indicates the initialization
966 of a parameter with base type from an object of a derived
967 type. A temporary object is created to hold the result of
968 the conversion unless we're binding directly to a reference. */
969 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
974 if (flags
& LOOKUP_NO_NARROWING
)
975 conv
->check_narrowing
= true;
980 /* Returns nonzero if T1 is reference-related to T2. */
983 reference_related_p (tree t1
, tree t2
)
985 t1
= TYPE_MAIN_VARIANT (t1
);
986 t2
= TYPE_MAIN_VARIANT (t2
);
990 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
991 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
993 return (same_type_p (t1
, t2
)
994 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
995 && DERIVED_FROM_P (t1
, t2
)));
998 /* Returns nonzero if T1 is reference-compatible with T2. */
1001 reference_compatible_p (tree t1
, tree t2
)
1005 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
1006 reference-related to T2 and cv1 is the same cv-qualification as,
1007 or greater cv-qualification than, cv2. */
1008 return (reference_related_p (t1
, t2
)
1009 && at_least_as_qualified_p (t1
, t2
));
1012 /* Determine whether or not the EXPR (of class type S) can be
1013 converted to T as in [over.match.ref]. */
1016 convert_class_to_reference (tree reference_type
, tree s
, tree expr
, int flags
)
1022 struct z_candidate
*candidates
;
1023 struct z_candidate
*cand
;
1026 conversions
= lookup_conversions (s
, /*lookup_template_convs_p=*/true);
1032 Assuming that "cv1 T" is the underlying type of the reference
1033 being initialized, and "cv S" is the type of the initializer
1034 expression, with S a class type, the candidate functions are
1035 selected as follows:
1037 --The conversion functions of S and its base classes are
1038 considered. Those that are not hidden within S and yield type
1039 "reference to cv2 T2", where "cv1 T" is reference-compatible
1040 (_dcl.init.ref_) with "cv2 T2", are candidate functions.
1042 The argument list has one argument, which is the initializer
1047 /* Conceptually, we should take the address of EXPR and put it in
1048 the argument list. Unfortunately, however, that can result in
1049 error messages, which we should not issue now because we are just
1050 trying to find a conversion operator. Therefore, we use NULL,
1051 cast to the appropriate type. */
1052 first_arg
= build_int_cst (build_pointer_type (s
), 0);
1054 t
= TREE_TYPE (reference_type
);
1056 /* We're performing a user-defined conversion to a desired type, so set
1057 this for the benefit of add_candidates. */
1058 flags
|= LOOKUP_NO_CONVERSION
;
1060 for (; conversions
; conversions
= TREE_CHAIN (conversions
))
1062 tree fns
= TREE_VALUE (conversions
);
1063 tree binfo
= TREE_PURPOSE (conversions
);
1064 struct z_candidate
*old_candidates
= candidates
;;
1066 add_candidates (fns
, first_arg
, NULL
, reference_type
,
1068 binfo
, TYPE_BINFO (s
),
1069 flags
, &candidates
);
1071 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
1073 /* Now, see if the conversion function really returns
1074 an lvalue of the appropriate type. From the
1075 point of view of unification, simply returning an
1076 rvalue of the right type is good enough. */
1078 tree t2
= TREE_TYPE (TREE_TYPE (f
));
1079 if (TREE_CODE (t2
) != REFERENCE_TYPE
1080 || !reference_compatible_p (t
, TREE_TYPE (t2
)))
1086 conversion
*identity_conv
;
1087 /* Build a standard conversion sequence indicating the
1088 binding from the reference type returned by the
1089 function to the desired REFERENCE_TYPE. */
1091 = build_identity_conv (TREE_TYPE (TREE_TYPE
1092 (TREE_TYPE (cand
->fn
))),
1095 = (direct_reference_binding
1096 (reference_type
, identity_conv
));
1097 cand
->second_conv
->rvaluedness_matches_p
1098 = TYPE_REF_IS_RVALUE (TREE_TYPE (TREE_TYPE (cand
->fn
)))
1099 == TYPE_REF_IS_RVALUE (reference_type
);
1100 cand
->second_conv
->bad_p
|= cand
->convs
[0]->bad_p
;
1102 /* Don't allow binding of lvalues to rvalue references. */
1103 if (TYPE_REF_IS_RVALUE (reference_type
)
1104 && !TYPE_REF_IS_RVALUE (TREE_TYPE (TREE_TYPE (cand
->fn
))))
1105 cand
->second_conv
->bad_p
= true;
1110 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
1111 /* If none of the conversion functions worked out, let our caller
1116 cand
= tourney (candidates
);
1120 /* Now that we know that this is the function we're going to use fix
1121 the dummy first argument. */
1122 gcc_assert (cand
->first_arg
== NULL_TREE
1123 || integer_zerop (cand
->first_arg
));
1124 cand
->first_arg
= build_this (expr
);
1126 /* Build a user-defined conversion sequence representing the
1128 conv
= build_conv (ck_user
,
1129 TREE_TYPE (TREE_TYPE (cand
->fn
)),
1130 build_identity_conv (TREE_TYPE (expr
), expr
));
1133 if (cand
->viable
== -1)
1136 /* Merge it with the standard conversion sequence from the
1137 conversion function's return type to the desired type. */
1138 cand
->second_conv
= merge_conversion_sequences (conv
, cand
->second_conv
);
1140 return cand
->second_conv
;
1143 /* A reference of the indicated TYPE is being bound directly to the
1144 expression represented by the implicit conversion sequence CONV.
1145 Return a conversion sequence for this binding. */
1148 direct_reference_binding (tree type
, conversion
*conv
)
1152 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
1153 gcc_assert (TREE_CODE (conv
->type
) != REFERENCE_TYPE
);
1155 t
= TREE_TYPE (type
);
1159 When a parameter of reference type binds directly
1160 (_dcl.init.ref_) to an argument expression, the implicit
1161 conversion sequence is the identity conversion, unless the
1162 argument expression has a type that is a derived class of the
1163 parameter type, in which case the implicit conversion sequence is
1164 a derived-to-base Conversion.
1166 If the parameter binds directly to the result of applying a
1167 conversion function to the argument expression, the implicit
1168 conversion sequence is a user-defined conversion sequence
1169 (_over.ics.user_), with the second standard conversion sequence
1170 either an identity conversion or, if the conversion function
1171 returns an entity of a type that is a derived class of the
1172 parameter type, a derived-to-base conversion. */
1173 if (!same_type_ignoring_top_level_qualifiers_p (t
, conv
->type
))
1175 /* Represent the derived-to-base conversion. */
1176 conv
= build_conv (ck_base
, t
, conv
);
1177 /* We will actually be binding to the base-class subobject in
1178 the derived class, so we mark this conversion appropriately.
1179 That way, convert_like knows not to generate a temporary. */
1180 conv
->need_temporary_p
= false;
1182 return build_conv (ck_ref_bind
, type
, conv
);
1185 /* Returns the conversion path from type FROM to reference type TO for
1186 purposes of reference binding. For lvalue binding, either pass a
1187 reference type to FROM or an lvalue expression to EXPR. If the
1188 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1189 the conversion returned. If C_CAST_P is true, this
1190 conversion is coming from a C-style cast. */
1193 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
)
1195 conversion
*conv
= NULL
;
1196 tree to
= TREE_TYPE (rto
);
1201 cp_lvalue_kind is_lvalue
= clk_none
;
1203 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1205 expr
= instantiate_type (to
, expr
, tf_none
);
1206 if (expr
== error_mark_node
)
1208 from
= TREE_TYPE (expr
);
1211 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1213 /* Anything with reference type is an lvalue. */
1214 is_lvalue
= clk_ordinary
;
1215 from
= TREE_TYPE (from
);
1218 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1220 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1221 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1223 if (!CLASS_TYPE_P (to
)
1224 && CONSTRUCTOR_NELTS (expr
) == 1)
1226 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1227 if (error_operand_p (expr
))
1229 from
= TREE_TYPE (expr
);
1233 if (is_lvalue
== clk_none
&& expr
)
1234 is_lvalue
= real_lvalue_p (expr
);
1237 if ((is_lvalue
& clk_bitfield
) != 0)
1238 tfrom
= unlowered_expr_type (expr
);
1240 /* Figure out whether or not the types are reference-related and
1241 reference compatible. We have do do this after stripping
1242 references from FROM. */
1243 related_p
= reference_related_p (to
, tfrom
);
1244 /* If this is a C cast, first convert to an appropriately qualified
1245 type, so that we can later do a const_cast to the desired type. */
1246 if (related_p
&& c_cast_p
1247 && !at_least_as_qualified_p (to
, tfrom
))
1248 to
= build_qualified_type (to
, cp_type_quals (tfrom
));
1249 compatible_p
= reference_compatible_p (to
, tfrom
);
1251 /* Directly bind reference when target expression's type is compatible with
1252 the reference and expression is an lvalue. In DR391, the wording in
1253 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1254 const and rvalue references to rvalues of compatible class type.
1255 We should also do direct bindings for non-class "rvalues" derived from
1256 rvalue references. */
1259 || (((CP_TYPE_CONST_NON_VOLATILE_P (to
)
1260 && !(flags
& LOOKUP_NO_TEMP_BIND
))
1261 || TYPE_REF_IS_RVALUE (rto
))
1262 && (CLASS_TYPE_P (from
) || (expr
&& lvalue_p (expr
))))))
1266 If the initializer expression
1268 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1269 is reference-compatible with "cv2 T2,"
1271 the reference is bound directly to the initializer expression
1275 If the initializer expression is an rvalue, with T2 a class type,
1276 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1277 is bound to the object represented by the rvalue or to a sub-object
1278 within that object. */
1280 conv
= build_identity_conv (tfrom
, expr
);
1281 conv
= direct_reference_binding (rto
, conv
);
1283 if (flags
& LOOKUP_PREFER_RVALUE
)
1284 /* The top-level caller requested that we pretend that the lvalue
1285 be treated as an rvalue. */
1286 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1288 conv
->rvaluedness_matches_p
1289 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1291 if ((is_lvalue
& clk_bitfield
) != 0
1292 || ((is_lvalue
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1293 /* For the purposes of overload resolution, we ignore the fact
1294 this expression is a bitfield or packed field. (In particular,
1295 [over.ics.ref] says specifically that a function with a
1296 non-const reference parameter is viable even if the
1297 argument is a bitfield.)
1299 However, when we actually call the function we must create
1300 a temporary to which to bind the reference. If the
1301 reference is volatile, or isn't const, then we cannot make
1302 a temporary, so we just issue an error when the conversion
1304 conv
->need_temporary_p
= true;
1306 /* Don't allow binding of lvalues to rvalue references. */
1307 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1308 && !(flags
& LOOKUP_PREFER_RVALUE
))
1313 /* [class.conv.fct] A conversion function is never used to convert a
1314 (possibly cv-qualified) object to the (possibly cv-qualified) same
1315 object type (or a reference to it), to a (possibly cv-qualified) base
1316 class of that type (or a reference to it).... */
1317 else if (CLASS_TYPE_P (from
) && !related_p
1318 && !(flags
& LOOKUP_NO_CONVERSION
))
1322 If the initializer expression
1324 -- has a class type (i.e., T2 is a class type) can be
1325 implicitly converted to an lvalue of type "cv3 T3," where
1326 "cv1 T1" is reference-compatible with "cv3 T3". (this
1327 conversion is selected by enumerating the applicable
1328 conversion functions (_over.match.ref_) and choosing the
1329 best one through overload resolution. (_over.match_).
1331 the reference is bound to the lvalue result of the conversion
1332 in the second case. */
1333 conv
= convert_class_to_reference (rto
, from
, expr
, flags
);
1338 /* From this point on, we conceptually need temporaries, even if we
1339 elide them. Only the cases above are "direct bindings". */
1340 if (flags
& LOOKUP_NO_TEMP_BIND
)
1345 When a parameter of reference type is not bound directly to an
1346 argument expression, the conversion sequence is the one required
1347 to convert the argument expression to the underlying type of the
1348 reference according to _over.best.ics_. Conceptually, this
1349 conversion sequence corresponds to copy-initializing a temporary
1350 of the underlying type with the argument expression. Any
1351 difference in top-level cv-qualification is subsumed by the
1352 initialization itself and does not constitute a conversion. */
1356 Otherwise, the reference shall be to a non-volatile const type.
1358 Under C++0x, [8.5.3/5 dcl.init.ref] it may also be an rvalue reference */
1359 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1364 Otherwise, a temporary of type "cv1 T1" is created and
1365 initialized from the initializer expression using the rules for a
1366 non-reference copy initialization. If T1 is reference-related to
1367 T2, cv1 must be the same cv-qualification as, or greater
1368 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1369 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1372 /* We're generating a temporary now, but don't bind any more in the
1373 conversion (specifically, don't slice the temporary returned by a
1374 conversion operator). */
1375 flags
|= LOOKUP_NO_TEMP_BIND
;
1377 /* Temporaries are copy-initialized, except for this hack to allow
1378 explicit conversion ops to the copy ctor. See also
1379 add_function_candidate. */
1380 if (!(flags
& LOOKUP_COPY_PARM
))
1381 flags
|= LOOKUP_ONLYCONVERTING
;
1384 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1389 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1390 /* This reference binding, unlike those above, requires the
1391 creation of a temporary. */
1392 conv
->need_temporary_p
= true;
1393 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1398 /* Returns the implicit conversion sequence (see [over.ics]) from type
1399 FROM to type TO. The optional expression EXPR may affect the
1400 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1401 true, this conversion is coming from a C-style cast. */
1404 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1409 if (from
== error_mark_node
|| to
== error_mark_node
1410 || expr
== error_mark_node
)
1413 if (TREE_CODE (to
) == REFERENCE_TYPE
)
1414 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
);
1416 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
);
1421 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1423 if (is_std_init_list (to
))
1424 return build_list_conv (to
, expr
, flags
);
1426 /* Allow conversion from an initializer-list with one element to a
1428 if (SCALAR_TYPE_P (to
))
1430 int nelts
= CONSTRUCTOR_NELTS (expr
);
1434 elt
= integer_zero_node
;
1435 else if (nelts
== 1)
1436 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1438 elt
= error_mark_node
;
1440 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1444 conv
->check_narrowing
= true;
1445 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1446 /* Too many levels of braces, i.e. '{{1}}'. */
1453 if (expr
!= NULL_TREE
1454 && (MAYBE_CLASS_TYPE_P (from
)
1455 || MAYBE_CLASS_TYPE_P (to
))
1456 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1458 struct z_candidate
*cand
;
1459 int convflags
= (flags
& (LOOKUP_NO_TEMP_BIND
|LOOKUP_ONLYCONVERTING
));
1461 if (CLASS_TYPE_P (to
)
1462 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
))
1463 && BRACE_ENCLOSED_INITIALIZER_P (expr
))
1464 return build_aggr_conv (to
, expr
, flags
);
1466 cand
= build_user_type_conversion_1 (to
, expr
, convflags
);
1468 conv
= cand
->second_conv
;
1470 /* We used to try to bind a reference to a temporary here, but that
1471 is now handled after the recursive call to this function at the end
1472 of reference_binding. */
1479 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1480 functions. ARGS will not be changed until a single candidate is
1483 static struct z_candidate
*
1484 add_candidate (struct z_candidate
**candidates
,
1485 tree fn
, tree first_arg
, const VEC(tree
,gc
) *args
,
1486 size_t num_convs
, conversion
**convs
,
1487 tree access_path
, tree conversion_path
,
1490 struct z_candidate
*cand
= (struct z_candidate
*)
1491 conversion_obstack_alloc (sizeof (struct z_candidate
));
1494 cand
->first_arg
= first_arg
;
1496 cand
->convs
= convs
;
1497 cand
->num_convs
= num_convs
;
1498 cand
->access_path
= access_path
;
1499 cand
->conversion_path
= conversion_path
;
1500 cand
->viable
= viable
;
1501 cand
->next
= *candidates
;
1507 /* Create an overload candidate for the function or method FN called
1508 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1509 FLAGS is passed on to implicit_conversion.
1511 This does not change ARGS.
1513 CTYPE, if non-NULL, is the type we want to pretend this function
1514 comes from for purposes of overload resolution. */
1516 static struct z_candidate
*
1517 add_function_candidate (struct z_candidate
**candidates
,
1518 tree fn
, tree ctype
, tree first_arg
,
1519 const VEC(tree
,gc
) *args
, tree access_path
,
1520 tree conversion_path
, int flags
)
1522 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1526 tree orig_first_arg
= first_arg
;
1530 /* At this point we should not see any functions which haven't been
1531 explicitly declared, except for friend functions which will have
1532 been found using argument dependent lookup. */
1533 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
1535 /* The `this', `in_chrg' and VTT arguments to constructors are not
1536 considered in overload resolution. */
1537 if (DECL_CONSTRUCTOR_P (fn
))
1539 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
1540 skip
= num_artificial_parms_for (fn
);
1541 if (skip
> 0 && first_arg
!= NULL_TREE
)
1544 first_arg
= NULL_TREE
;
1550 len
= VEC_length (tree
, args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
1551 convs
= alloc_conversions (len
);
1553 /* 13.3.2 - Viable functions [over.match.viable]
1554 First, to be a viable function, a candidate function shall have enough
1555 parameters to agree in number with the arguments in the list.
1557 We need to check this first; otherwise, checking the ICSes might cause
1558 us to produce an ill-formed template instantiation. */
1560 parmnode
= parmlist
;
1561 for (i
= 0; i
< len
; ++i
)
1563 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
1565 parmnode
= TREE_CHAIN (parmnode
);
1568 if (i
< len
&& parmnode
)
1571 /* Make sure there are default args for the rest of the parms. */
1572 else if (!sufficient_parms_p (parmnode
))
1578 /* Second, for F to be a viable function, there shall exist for each
1579 argument an implicit conversion sequence that converts that argument
1580 to the corresponding parameter of F. */
1582 parmnode
= parmlist
;
1584 for (i
= 0; i
< len
; ++i
)
1590 if (parmnode
== void_list_node
)
1593 if (i
== 0 && first_arg
!= NULL_TREE
)
1596 arg
= VEC_index (tree
, args
,
1597 i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0));
1598 argtype
= lvalue_type (arg
);
1600 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1601 && ! DECL_CONSTRUCTOR_P (fn
));
1605 tree parmtype
= TREE_VALUE (parmnode
);
1608 /* The type of the implicit object parameter ('this') for
1609 overload resolution is not always the same as for the
1610 function itself; conversion functions are considered to
1611 be members of the class being converted, and functions
1612 introduced by a using-declaration are considered to be
1613 members of the class that uses them.
1615 Since build_over_call ignores the ICS for the `this'
1616 parameter, we can just change the parm type. */
1617 if (ctype
&& is_this
)
1620 = build_qualified_type (ctype
,
1621 TYPE_QUALS (TREE_TYPE (parmtype
)));
1622 parmtype
= build_pointer_type (parmtype
);
1625 if (ctype
&& i
== 0 && DECL_COPY_CONSTRUCTOR_P (fn
)
1628 /* Hack: Direct-initialize copy parm (i.e. suppress
1629 LOOKUP_ONLYCONVERTING) to make explicit conversion ops
1630 work. See also reference_binding. */
1631 lflags
|= LOOKUP_COPY_PARM
;
1632 if (flags
& LOOKUP_NO_COPY_CTOR_CONVERSION
)
1633 lflags
|= LOOKUP_NO_CONVERSION
;
1636 lflags
|= LOOKUP_ONLYCONVERTING
;
1638 t
= implicit_conversion (parmtype
, argtype
, arg
,
1639 /*c_cast_p=*/false, lflags
);
1643 t
= build_identity_conv (argtype
, arg
);
1644 t
->ellipsis_p
= true;
1661 parmnode
= TREE_CHAIN (parmnode
);
1665 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
1666 access_path
, conversion_path
, viable
);
1669 /* Create an overload candidate for the conversion function FN which will
1670 be invoked for expression OBJ, producing a pointer-to-function which
1671 will in turn be called with the argument list FIRST_ARG/ARGLIST,
1672 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
1673 passed on to implicit_conversion.
1675 Actually, we don't really care about FN; we care about the type it
1676 converts to. There may be multiple conversion functions that will
1677 convert to that type, and we rely on build_user_type_conversion_1 to
1678 choose the best one; so when we create our candidate, we record the type
1679 instead of the function. */
1681 static struct z_candidate
*
1682 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
1683 tree first_arg
, const VEC(tree
,gc
) *arglist
,
1684 tree access_path
, tree conversion_path
)
1686 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
1687 int i
, len
, viable
, flags
;
1688 tree parmlist
, parmnode
;
1691 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
1692 parmlist
= TREE_TYPE (parmlist
);
1693 parmlist
= TYPE_ARG_TYPES (parmlist
);
1695 len
= VEC_length (tree
, arglist
) + (first_arg
!= NULL_TREE
? 1 : 0) + 1;
1696 convs
= alloc_conversions (len
);
1697 parmnode
= parmlist
;
1699 flags
= LOOKUP_IMPLICIT
;
1701 /* Don't bother looking up the same type twice. */
1702 if (*candidates
&& (*candidates
)->fn
== totype
)
1705 for (i
= 0; i
< len
; ++i
)
1712 else if (i
== 1 && first_arg
!= NULL_TREE
)
1715 arg
= VEC_index (tree
, arglist
,
1716 i
- (first_arg
!= NULL_TREE
? 1 : 0) - 1);
1717 argtype
= lvalue_type (arg
);
1720 t
= implicit_conversion (totype
, argtype
, arg
, /*c_cast_p=*/false,
1722 else if (parmnode
== void_list_node
)
1725 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
1726 /*c_cast_p=*/false, flags
);
1729 t
= build_identity_conv (argtype
, arg
);
1730 t
->ellipsis_p
= true;
1744 parmnode
= TREE_CHAIN (parmnode
);
1750 if (!sufficient_parms_p (parmnode
))
1753 return add_candidate (candidates
, totype
, first_arg
, arglist
, len
, convs
,
1754 access_path
, conversion_path
, viable
);
1758 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
1759 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
1771 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
1772 convs
= alloc_conversions (num_convs
);
1774 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
1775 conversion ops are allowed. We handle that here by just checking for
1776 boolean_type_node because other operators don't ask for it. COND_EXPR
1777 also does contextual conversion to bool for the first operand, but we
1778 handle that in build_conditional_expr, and type1 here is operand 2. */
1779 if (type1
!= boolean_type_node
)
1780 flags
|= LOOKUP_ONLYCONVERTING
;
1782 for (i
= 0; i
< 2; ++i
)
1787 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
1788 /*c_cast_p=*/false, flags
);
1792 /* We need something for printing the candidate. */
1793 t
= build_identity_conv (types
[i
], NULL_TREE
);
1800 /* For COND_EXPR we rearranged the arguments; undo that now. */
1803 convs
[2] = convs
[1];
1804 convs
[1] = convs
[0];
1805 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
1806 /*c_cast_p=*/false, flags
);
1813 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
1815 /*access_path=*/NULL_TREE
,
1816 /*conversion_path=*/NULL_TREE
,
1821 is_complete (tree t
)
1823 return COMPLETE_TYPE_P (complete_type (t
));
1826 /* Returns nonzero if TYPE is a promoted arithmetic type. */
1829 promoted_arithmetic_type_p (tree type
)
1833 In this section, the term promoted integral type is used to refer
1834 to those integral types which are preserved by integral promotion
1835 (including e.g. int and long but excluding e.g. char).
1836 Similarly, the term promoted arithmetic type refers to promoted
1837 integral types plus floating types. */
1838 return ((CP_INTEGRAL_TYPE_P (type
)
1839 && same_type_p (type_promotes_to (type
), type
))
1840 || TREE_CODE (type
) == REAL_TYPE
);
1843 /* Create any builtin operator overload candidates for the operator in
1844 question given the converted operand types TYPE1 and TYPE2. The other
1845 args are passed through from add_builtin_candidates to
1846 build_builtin_candidate.
1848 TYPE1 and TYPE2 may not be permissible, and we must filter them.
1849 If CODE is requires candidates operands of the same type of the kind
1850 of which TYPE1 and TYPE2 are, we add both candidates
1851 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
1854 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
1855 enum tree_code code2
, tree fnname
, tree type1
,
1856 tree type2
, tree
*args
, tree
*argtypes
, int flags
)
1860 case POSTINCREMENT_EXPR
:
1861 case POSTDECREMENT_EXPR
:
1862 args
[1] = integer_zero_node
;
1863 type2
= integer_type_node
;
1872 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
1873 and VQ is either volatile or empty, there exist candidate operator
1874 functions of the form
1875 VQ T& operator++(VQ T&);
1876 T operator++(VQ T&, int);
1877 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
1878 type other than bool, and VQ is either volatile or empty, there exist
1879 candidate operator functions of the form
1880 VQ T& operator--(VQ T&);
1881 T operator--(VQ T&, int);
1882 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
1883 complete object type, and VQ is either volatile or empty, there exist
1884 candidate operator functions of the form
1885 T*VQ& operator++(T*VQ&);
1886 T*VQ& operator--(T*VQ&);
1887 T* operator++(T*VQ&, int);
1888 T* operator--(T*VQ&, int); */
1890 case POSTDECREMENT_EXPR
:
1891 case PREDECREMENT_EXPR
:
1892 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
1894 case POSTINCREMENT_EXPR
:
1895 case PREINCREMENT_EXPR
:
1896 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
1898 type1
= build_reference_type (type1
);
1903 /* 7 For every cv-qualified or cv-unqualified complete object type T, there
1904 exist candidate operator functions of the form
1908 8 For every function type T, there exist candidate operator functions of
1910 T& operator*(T*); */
1913 if (TREE_CODE (type1
) == POINTER_TYPE
1914 && (TYPE_PTROB_P (type1
)
1915 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
1919 /* 9 For every type T, there exist candidate operator functions of the form
1922 10For every promoted arithmetic type T, there exist candidate operator
1923 functions of the form
1927 case UNARY_PLUS_EXPR
: /* unary + */
1928 if (TREE_CODE (type1
) == POINTER_TYPE
)
1931 if (ARITHMETIC_TYPE_P (type1
))
1935 /* 11For every promoted integral type T, there exist candidate operator
1936 functions of the form
1940 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
1944 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
1945 is the same type as C2 or is a derived class of C2, T is a complete
1946 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
1947 there exist candidate operator functions of the form
1948 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
1949 where CV12 is the union of CV1 and CV2. */
1952 if (TREE_CODE (type1
) == POINTER_TYPE
1953 && TYPE_PTR_TO_MEMBER_P (type2
))
1955 tree c1
= TREE_TYPE (type1
);
1956 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
1958 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
1959 && (TYPE_PTRMEMFUNC_P (type2
)
1960 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
1965 /* 13For every pair of promoted arithmetic types L and R, there exist can-
1966 didate operator functions of the form
1971 bool operator<(L, R);
1972 bool operator>(L, R);
1973 bool operator<=(L, R);
1974 bool operator>=(L, R);
1975 bool operator==(L, R);
1976 bool operator!=(L, R);
1977 where LR is the result of the usual arithmetic conversions between
1980 14For every pair of types T and I, where T is a cv-qualified or cv-
1981 unqualified complete object type and I is a promoted integral type,
1982 there exist candidate operator functions of the form
1983 T* operator+(T*, I);
1984 T& operator[](T*, I);
1985 T* operator-(T*, I);
1986 T* operator+(I, T*);
1987 T& operator[](I, T*);
1989 15For every T, where T is a pointer to complete object type, there exist
1990 candidate operator functions of the form112)
1991 ptrdiff_t operator-(T, T);
1993 16For every pointer or enumeration type T, there exist candidate operator
1994 functions of the form
1995 bool operator<(T, T);
1996 bool operator>(T, T);
1997 bool operator<=(T, T);
1998 bool operator>=(T, T);
1999 bool operator==(T, T);
2000 bool operator!=(T, T);
2002 17For every pointer to member type T, there exist candidate operator
2003 functions of the form
2004 bool operator==(T, T);
2005 bool operator!=(T, T); */
2008 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2010 if (TYPE_PTROB_P (type1
)
2011 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2013 type2
= ptrdiff_type_node
;
2017 case TRUNC_DIV_EXPR
:
2018 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2024 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2025 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
)))
2027 if (TYPE_PTR_TO_MEMBER_P (type1
) && null_ptr_cst_p (args
[1]))
2032 if (TYPE_PTR_TO_MEMBER_P (type2
) && null_ptr_cst_p (args
[0]))
2044 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2046 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2048 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2049 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2051 if (TYPE_PTR_P (type1
)
2052 && null_ptr_cst_p (args
[1])
2053 && !uses_template_parms (type1
))
2058 if (null_ptr_cst_p (args
[0])
2059 && TYPE_PTR_P (type2
)
2060 && !uses_template_parms (type2
))
2068 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2071 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2073 type1
= ptrdiff_type_node
;
2076 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2078 type2
= ptrdiff_type_node
;
2083 /* 18For every pair of promoted integral types L and R, there exist candi-
2084 date operator functions of the form
2091 where LR is the result of the usual arithmetic conversions between
2094 case TRUNC_MOD_EXPR
:
2100 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2104 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2105 type, VQ is either volatile or empty, and R is a promoted arithmetic
2106 type, there exist candidate operator functions of the form
2107 VQ L& operator=(VQ L&, R);
2108 VQ L& operator*=(VQ L&, R);
2109 VQ L& operator/=(VQ L&, R);
2110 VQ L& operator+=(VQ L&, R);
2111 VQ L& operator-=(VQ L&, R);
2113 20For every pair T, VQ), where T is any type and VQ is either volatile
2114 or empty, there exist candidate operator functions of the form
2115 T*VQ& operator=(T*VQ&, T*);
2117 21For every pair T, VQ), where T is a pointer to member type and VQ is
2118 either volatile or empty, there exist candidate operator functions of
2120 VQ T& operator=(VQ T&, T);
2122 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2123 unqualified complete object type, VQ is either volatile or empty, and
2124 I is a promoted integral type, there exist candidate operator func-
2126 T*VQ& operator+=(T*VQ&, I);
2127 T*VQ& operator-=(T*VQ&, I);
2129 23For every triple L, VQ, R), where L is an integral or enumeration
2130 type, VQ is either volatile or empty, and R is a promoted integral
2131 type, there exist candidate operator functions of the form
2133 VQ L& operator%=(VQ L&, R);
2134 VQ L& operator<<=(VQ L&, R);
2135 VQ L& operator>>=(VQ L&, R);
2136 VQ L& operator&=(VQ L&, R);
2137 VQ L& operator^=(VQ L&, R);
2138 VQ L& operator|=(VQ L&, R); */
2145 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2147 type2
= ptrdiff_type_node
;
2151 case TRUNC_DIV_EXPR
:
2152 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2156 case TRUNC_MOD_EXPR
:
2162 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2167 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2169 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2170 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2171 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
))
2172 || ((TYPE_PTRMEMFUNC_P (type1
)
2173 || TREE_CODE (type1
) == POINTER_TYPE
)
2174 && null_ptr_cst_p (args
[1])))
2184 type1
= build_reference_type (type1
);
2190 For every pair of promoted arithmetic types L and R, there
2191 exist candidate operator functions of the form
2193 LR operator?(bool, L, R);
2195 where LR is the result of the usual arithmetic conversions
2196 between types L and R.
2198 For every type T, where T is a pointer or pointer-to-member
2199 type, there exist candidate operator functions of the form T
2200 operator?(bool, T, T); */
2202 if (promoted_arithmetic_type_p (type1
)
2203 && promoted_arithmetic_type_p (type2
))
2207 /* Otherwise, the types should be pointers. */
2208 if (!(TYPE_PTR_P (type1
) || TYPE_PTR_TO_MEMBER_P (type1
))
2209 || !(TYPE_PTR_P (type2
) || TYPE_PTR_TO_MEMBER_P (type2
)))
2212 /* We don't check that the two types are the same; the logic
2213 below will actually create two candidates; one in which both
2214 parameter types are TYPE1, and one in which both parameter
2222 /* If we're dealing with two pointer types or two enumeral types,
2223 we need candidates for both of them. */
2224 if (type2
&& !same_type_p (type1
, type2
)
2225 && TREE_CODE (type1
) == TREE_CODE (type2
)
2226 && (TREE_CODE (type1
) == REFERENCE_TYPE
2227 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2228 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
))
2229 || TYPE_PTRMEMFUNC_P (type1
)
2230 || MAYBE_CLASS_TYPE_P (type1
)
2231 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2233 build_builtin_candidate
2234 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
);
2235 build_builtin_candidate
2236 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
);
2240 build_builtin_candidate
2241 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
);
2245 type_decays_to (tree type
)
2247 if (TREE_CODE (type
) == ARRAY_TYPE
)
2248 return build_pointer_type (TREE_TYPE (type
));
2249 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2250 return build_pointer_type (type
);
2251 if (!MAYBE_CLASS_TYPE_P (type
))
2252 type
= cv_unqualified (type
);
2256 /* There are three conditions of builtin candidates:
2258 1) bool-taking candidates. These are the same regardless of the input.
2259 2) pointer-pair taking candidates. These are generated for each type
2260 one of the input types converts to.
2261 3) arithmetic candidates. According to the standard, we should generate
2262 all of these, but I'm trying not to...
2264 Here we generate a superset of the possible candidates for this particular
2265 case. That is a subset of the full set the standard defines, plus some
2266 other cases which the standard disallows. add_builtin_candidate will
2267 filter out the invalid set. */
2270 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2271 enum tree_code code2
, tree fnname
, tree
*args
,
2276 tree type
, argtypes
[3];
2277 /* TYPES[i] is the set of possible builtin-operator parameter types
2278 we will consider for the Ith argument. These are represented as
2279 a TREE_LIST; the TREE_VALUE of each node is the potential
2283 for (i
= 0; i
< 3; ++i
)
2286 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2288 argtypes
[i
] = NULL_TREE
;
2293 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2294 and VQ is either volatile or empty, there exist candidate operator
2295 functions of the form
2296 VQ T& operator++(VQ T&); */
2298 case POSTINCREMENT_EXPR
:
2299 case PREINCREMENT_EXPR
:
2300 case POSTDECREMENT_EXPR
:
2301 case PREDECREMENT_EXPR
:
2306 /* 24There also exist candidate operator functions of the form
2307 bool operator!(bool);
2308 bool operator&&(bool, bool);
2309 bool operator||(bool, bool); */
2311 case TRUTH_NOT_EXPR
:
2312 build_builtin_candidate
2313 (candidates
, fnname
, boolean_type_node
,
2314 NULL_TREE
, args
, argtypes
, flags
);
2317 case TRUTH_ORIF_EXPR
:
2318 case TRUTH_ANDIF_EXPR
:
2319 build_builtin_candidate
2320 (candidates
, fnname
, boolean_type_node
,
2321 boolean_type_node
, args
, argtypes
, flags
);
2343 types
[0] = types
[1] = NULL_TREE
;
2345 for (i
= 0; i
< 2; ++i
)
2349 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
2353 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
2356 convs
= lookup_conversions (argtypes
[i
],
2357 /*lookup_template_convs_p=*/false);
2359 if (code
== COND_EXPR
)
2361 if (real_lvalue_p (args
[i
]))
2362 types
[i
] = tree_cons
2363 (NULL_TREE
, build_reference_type (argtypes
[i
]), types
[i
]);
2365 types
[i
] = tree_cons
2366 (NULL_TREE
, TYPE_MAIN_VARIANT (argtypes
[i
]), types
[i
]);
2372 for (; convs
; convs
= TREE_CHAIN (convs
))
2374 type
= TREE_TYPE (convs
);
2377 && (TREE_CODE (type
) != REFERENCE_TYPE
2378 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
2381 if (code
== COND_EXPR
&& TREE_CODE (type
) == REFERENCE_TYPE
)
2382 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2384 type
= non_reference (type
);
2385 if (i
!= 0 || ! ref1
)
2387 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
2388 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
2389 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2390 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2391 type
= type_promotes_to (type
);
2394 if (! value_member (type
, types
[i
]))
2395 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2400 if (code
== COND_EXPR
&& real_lvalue_p (args
[i
]))
2401 types
[i
] = tree_cons
2402 (NULL_TREE
, build_reference_type (argtypes
[i
]), types
[i
]);
2403 type
= non_reference (argtypes
[i
]);
2404 if (i
!= 0 || ! ref1
)
2406 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
2407 if (enum_p
&& UNSCOPED_ENUM_P (type
))
2408 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2409 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2410 type
= type_promotes_to (type
);
2412 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2416 /* Run through the possible parameter types of both arguments,
2417 creating candidates with those parameter types. */
2418 for (; types
[0]; types
[0] = TREE_CHAIN (types
[0]))
2421 for (type
= types
[1]; type
; type
= TREE_CHAIN (type
))
2422 add_builtin_candidate
2423 (candidates
, code
, code2
, fnname
, TREE_VALUE (types
[0]),
2424 TREE_VALUE (type
), args
, argtypes
, flags
);
2426 add_builtin_candidate
2427 (candidates
, code
, code2
, fnname
, TREE_VALUE (types
[0]),
2428 NULL_TREE
, args
, argtypes
, flags
);
2433 /* If TMPL can be successfully instantiated as indicated by
2434 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2436 TMPL is the template. EXPLICIT_TARGS are any explicit template
2437 arguments. ARGLIST is the arguments provided at the call-site.
2438 This does not change ARGLIST. The RETURN_TYPE is the desired type
2439 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
2440 as for add_function_candidate. If an OBJ is supplied, FLAGS and
2441 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
2443 static struct z_candidate
*
2444 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
2445 tree ctype
, tree explicit_targs
, tree first_arg
,
2446 const VEC(tree
,gc
) *arglist
, tree return_type
,
2447 tree access_path
, tree conversion_path
,
2448 int flags
, tree obj
, unification_kind_t strict
)
2450 int ntparms
= DECL_NTPARMS (tmpl
);
2451 tree targs
= make_tree_vec (ntparms
);
2452 unsigned int len
= VEC_length (tree
, arglist
);
2453 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
2454 unsigned int skip_without_in_chrg
= 0;
2455 tree first_arg_without_in_chrg
= first_arg
;
2456 tree
*args_without_in_chrg
;
2457 unsigned int nargs_without_in_chrg
;
2458 unsigned int ia
, ix
;
2460 struct z_candidate
*cand
;
2464 /* We don't do deduction on the in-charge parameter, the VTT
2465 parameter or 'this'. */
2466 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
2468 if (first_arg_without_in_chrg
!= NULL_TREE
)
2469 first_arg_without_in_chrg
= NULL_TREE
;
2471 ++skip_without_in_chrg
;
2474 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
2475 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
2476 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
2478 if (first_arg_without_in_chrg
!= NULL_TREE
)
2479 first_arg_without_in_chrg
= NULL_TREE
;
2481 ++skip_without_in_chrg
;
2484 if (len
< skip_without_in_chrg
)
2487 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
2488 + (len
- skip_without_in_chrg
));
2489 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
2491 if (first_arg_without_in_chrg
!= NULL_TREE
)
2493 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
2496 for (ix
= skip_without_in_chrg
;
2497 VEC_iterate (tree
, arglist
, ix
, arg
);
2500 args_without_in_chrg
[ia
] = arg
;
2503 gcc_assert (ia
== nargs_without_in_chrg
);
2505 i
= fn_type_unification (tmpl
, explicit_targs
, targs
,
2506 args_without_in_chrg
,
2507 nargs_without_in_chrg
,
2508 return_type
, strict
, flags
);
2513 fn
= instantiate_template (tmpl
, targs
, tf_none
);
2514 if (fn
== error_mark_node
)
2519 A member function template is never instantiated to perform the
2520 copy of a class object to an object of its class type.
2522 It's a little unclear what this means; the standard explicitly
2523 does allow a template to be used to copy a class. For example,
2528 template <class T> A(const T&);
2531 void g () { A a (f ()); }
2533 the member template will be used to make the copy. The section
2534 quoted above appears in the paragraph that forbids constructors
2535 whose only parameter is (a possibly cv-qualified variant of) the
2536 class type, and a logical interpretation is that the intent was
2537 to forbid the instantiation of member templates which would then
2539 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
2541 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
2542 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
2547 if (obj
!= NULL_TREE
)
2548 /* Aha, this is a conversion function. */
2549 cand
= add_conv_candidate (candidates
, fn
, obj
, first_arg
, arglist
,
2550 access_path
, conversion_path
);
2552 cand
= add_function_candidate (candidates
, fn
, ctype
,
2553 first_arg
, arglist
, access_path
,
2554 conversion_path
, flags
);
2555 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
2556 /* This situation can occur if a member template of a template
2557 class is specialized. Then, instantiate_template might return
2558 an instantiation of the specialization, in which case the
2559 DECL_TI_TEMPLATE field will point at the original
2560 specialization. For example:
2562 template <class T> struct S { template <class U> void f(U);
2563 template <> void f(int) {}; };
2567 Here, TMPL will be template <class U> S<double>::f(U).
2568 And, instantiate template will give us the specialization
2569 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
2570 for this will point at template <class T> template <> S<T>::f(int),
2571 so that we can find the definition. For the purposes of
2572 overload resolution, however, we want the original TMPL. */
2573 cand
->template_decl
= build_template_info (tmpl
, targs
);
2575 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
2581 static struct z_candidate
*
2582 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
2583 tree explicit_targs
, tree first_arg
,
2584 const VEC(tree
,gc
) *arglist
, tree return_type
,
2585 tree access_path
, tree conversion_path
, int flags
,
2586 unification_kind_t strict
)
2589 add_template_candidate_real (candidates
, tmpl
, ctype
,
2590 explicit_targs
, first_arg
, arglist
,
2591 return_type
, access_path
, conversion_path
,
2592 flags
, NULL_TREE
, strict
);
2596 static struct z_candidate
*
2597 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
2598 tree obj
, tree first_arg
,
2599 const VEC(tree
,gc
) *arglist
,
2600 tree return_type
, tree access_path
,
2601 tree conversion_path
)
2604 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
2605 first_arg
, arglist
, return_type
, access_path
,
2606 conversion_path
, 0, obj
, DEDUCE_CONV
);
2609 /* The CANDS are the set of candidates that were considered for
2610 overload resolution. Return the set of viable candidates. If none
2611 of the candidates were viable, set *ANY_VIABLE_P to true. STRICT_P
2612 is true if a candidate should be considered viable only if it is
2615 static struct z_candidate
*
2616 splice_viable (struct z_candidate
*cands
,
2620 struct z_candidate
*viable
;
2621 struct z_candidate
**last_viable
;
2622 struct z_candidate
**cand
;
2625 last_viable
= &viable
;
2626 *any_viable_p
= false;
2631 struct z_candidate
*c
= *cand
;
2632 if (strict_p
? c
->viable
== 1 : c
->viable
)
2637 last_viable
= &c
->next
;
2638 *any_viable_p
= true;
2644 return viable
? viable
: cands
;
2648 any_strictly_viable (struct z_candidate
*cands
)
2650 for (; cands
; cands
= cands
->next
)
2651 if (cands
->viable
== 1)
2656 /* OBJ is being used in an expression like "OBJ.f (...)". In other
2657 words, it is about to become the "this" pointer for a member
2658 function call. Take the address of the object. */
2661 build_this (tree obj
)
2663 /* In a template, we are only concerned about the type of the
2664 expression, so we can take a shortcut. */
2665 if (processing_template_decl
)
2666 return build_address (obj
);
2668 return cp_build_unary_op (ADDR_EXPR
, obj
, 0, tf_warning_or_error
);
2671 /* Returns true iff functions are equivalent. Equivalent functions are
2672 not '==' only if one is a function-local extern function or if
2673 both are extern "C". */
2676 equal_functions (tree fn1
, tree fn2
)
2678 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
2679 || DECL_EXTERN_C_FUNCTION_P (fn1
))
2680 return decls_match (fn1
, fn2
);
2684 /* Print information about one overload candidate CANDIDATE. MSGSTR
2685 is the text to print before the candidate itself.
2687 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
2688 to have been run through gettext by the caller. This wart makes
2689 life simpler in print_z_candidates and for the translators. */
2692 print_z_candidate (const char *msgstr
, struct z_candidate
*candidate
)
2694 if (TREE_CODE (candidate
->fn
) == IDENTIFIER_NODE
)
2696 if (candidate
->num_convs
== 3)
2697 inform (input_location
, "%s %D(%T, %T, %T) <built-in>", msgstr
, candidate
->fn
,
2698 candidate
->convs
[0]->type
,
2699 candidate
->convs
[1]->type
,
2700 candidate
->convs
[2]->type
);
2701 else if (candidate
->num_convs
== 2)
2702 inform (input_location
, "%s %D(%T, %T) <built-in>", msgstr
, candidate
->fn
,
2703 candidate
->convs
[0]->type
,
2704 candidate
->convs
[1]->type
);
2706 inform (input_location
, "%s %D(%T) <built-in>", msgstr
, candidate
->fn
,
2707 candidate
->convs
[0]->type
);
2709 else if (TYPE_P (candidate
->fn
))
2710 inform (input_location
, "%s %T <conversion>", msgstr
, candidate
->fn
);
2711 else if (candidate
->viable
== -1)
2712 inform (input_location
, "%s %+#D <near match>", msgstr
, candidate
->fn
);
2713 else if (DECL_DELETED_FN (candidate
->fn
))
2714 inform (input_location
, "%s %+#D <deleted>", msgstr
, candidate
->fn
);
2716 inform (input_location
, "%s %+#D", msgstr
, candidate
->fn
);
2720 print_z_candidates (struct z_candidate
*candidates
)
2723 struct z_candidate
*cand1
;
2724 struct z_candidate
**cand2
;
2730 /* Remove deleted candidates. */
2732 for (cand2
= &cand1
; *cand2
; )
2734 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
2735 && DECL_DELETED_FN ((*cand2
)->fn
))
2736 *cand2
= (*cand2
)->next
;
2738 cand2
= &(*cand2
)->next
;
2740 /* ...if there are any non-deleted ones. */
2744 /* There may be duplicates in the set of candidates. We put off
2745 checking this condition as long as possible, since we have no way
2746 to eliminate duplicates from a set of functions in less than n^2
2747 time. Now we are about to emit an error message, so it is more
2748 permissible to go slowly. */
2749 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
2751 tree fn
= cand1
->fn
;
2752 /* Skip builtin candidates and conversion functions. */
2753 if (TREE_CODE (fn
) != FUNCTION_DECL
)
2755 cand2
= &cand1
->next
;
2758 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
2759 && equal_functions (fn
, (*cand2
)->fn
))
2760 *cand2
= (*cand2
)->next
;
2762 cand2
= &(*cand2
)->next
;
2766 str
= candidates
->next
? _("candidates are:") : _("candidate is:");
2768 for (; candidates
; candidates
= candidates
->next
)
2770 print_z_candidate (spaces
? spaces
: str
, candidates
);
2771 spaces
= spaces
? spaces
: get_spaces (str
);
2776 /* USER_SEQ is a user-defined conversion sequence, beginning with a
2777 USER_CONV. STD_SEQ is the standard conversion sequence applied to
2778 the result of the conversion function to convert it to the final
2779 desired type. Merge the two sequences into a single sequence,
2780 and return the merged sequence. */
2783 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
2787 gcc_assert (user_seq
->kind
== ck_user
);
2789 /* Find the end of the second conversion sequence. */
2791 while ((*t
)->kind
!= ck_identity
)
2792 t
= &((*t
)->u
.next
);
2794 /* Replace the identity conversion with the user conversion
2798 /* The entire sequence is a user-conversion sequence. */
2799 std_seq
->user_conv_p
= true;
2804 /* Returns the best overload candidate to perform the requested
2805 conversion. This function is used for three the overloading situations
2806 described in [over.match.copy], [over.match.conv], and [over.match.ref].
2807 If TOTYPE is a REFERENCE_TYPE, we're trying to find an lvalue binding as
2808 per [dcl.init.ref], so we ignore temporary bindings. */
2810 static struct z_candidate
*
2811 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
)
2813 struct z_candidate
*candidates
, *cand
;
2814 tree fromtype
= TREE_TYPE (expr
);
2815 tree ctors
= NULL_TREE
;
2816 tree conv_fns
= NULL_TREE
;
2817 conversion
*conv
= NULL
;
2818 tree first_arg
= NULL_TREE
;
2819 VEC(tree
,gc
) *args
= NULL
;
2823 /* We represent conversion within a hierarchy using RVALUE_CONV and
2824 BASE_CONV, as specified by [over.best.ics]; these become plain
2825 constructor calls, as specified in [dcl.init]. */
2826 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
2827 || !DERIVED_FROM_P (totype
, fromtype
));
2829 if (MAYBE_CLASS_TYPE_P (totype
))
2830 ctors
= lookup_fnfields (totype
, complete_ctor_identifier
, 0);
2832 if (MAYBE_CLASS_TYPE_P (fromtype
))
2834 tree to_nonref
= non_reference (totype
);
2835 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
2836 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
2837 && DERIVED_FROM_P (to_nonref
, fromtype
)))
2839 /* [class.conv.fct] A conversion function is never used to
2840 convert a (possibly cv-qualified) object to the (possibly
2841 cv-qualified) same object type (or a reference to it), to a
2842 (possibly cv-qualified) base class of that type (or a
2843 reference to it)... */
2846 conv_fns
= lookup_conversions (fromtype
,
2847 /*lookup_template_convs_p=*/true);
2851 flags
|= LOOKUP_NO_CONVERSION
;
2852 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
2853 flags
|= LOOKUP_NO_NARROWING
;
2855 /* It's OK to bind a temporary for converting constructor arguments, but
2856 not in converting the return value of a conversion operator. */
2857 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
);
2858 flags
&= ~LOOKUP_NO_TEMP_BIND
;
2862 int ctorflags
= flags
;
2863 bool try_single_arg
= true;
2864 ctors
= BASELINK_FUNCTIONS (ctors
);
2866 first_arg
= build_int_cst (build_pointer_type (totype
), 0);
2867 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
2869 /* For list-initialization we consider explicit constructors, but
2870 give an error if one is selected. */
2871 ctorflags
&= ~LOOKUP_ONLYCONVERTING
;
2872 /* If the class has a list ctor, try passing the list as a single
2873 argument first, but only consider list ctors. */
2874 if (TYPE_HAS_LIST_CTOR (totype
))
2875 ctorflags
|= LOOKUP_LIST_ONLY
;
2877 try_single_arg
= false;
2880 /* We should never try to call the abstract or base constructor
2882 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors
))
2883 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors
)));
2885 /* If EXPR is not an initializer-list, or if totype has a list
2886 constructor, try EXPR as a single argument. */
2889 args
= make_tree_vector_single (expr
);
2890 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
2891 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
2892 ctorflags
, &candidates
);
2895 /* If we didn't find a suitable list constructor for an initializer-list,
2896 try breaking it apart. */
2897 if (!candidates
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
2899 args
= ctor_to_vec (expr
);
2900 /* We aren't looking for list-ctors anymore. */
2901 ctorflags
&= ~LOOKUP_LIST_ONLY
;
2902 /* We still allow more conversions within an init-list. */
2903 ctorflags
&= ~LOOKUP_NO_CONVERSION
;
2904 /* But not for the copy ctor. */
2905 ctorflags
|= LOOKUP_NO_COPY_CTOR_CONVERSION
;
2906 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
2907 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
2908 ctorflags
, &candidates
);
2911 for (cand
= candidates
; cand
; cand
= cand
->next
)
2913 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
2915 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
2916 set, then this is copy-initialization. In that case, "The
2917 result of the call is then used to direct-initialize the
2918 object that is the destination of the copy-initialization."
2921 We represent this in the conversion sequence with an
2922 rvalue conversion, which means a constructor call. */
2923 if (TREE_CODE (totype
) != REFERENCE_TYPE
2924 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
2926 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
2931 first_arg
= build_this (expr
);
2933 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
2935 tree conversion_path
= TREE_PURPOSE (conv_fns
);
2936 struct z_candidate
*old_candidates
;
2938 /* If we are called to convert to a reference type, we are trying to
2939 find an lvalue binding, so don't even consider temporaries. If
2940 we don't find an lvalue binding, the caller will try again to
2941 look for a temporary binding. */
2942 if (TREE_CODE (totype
) == REFERENCE_TYPE
)
2943 convflags
|= LOOKUP_NO_TEMP_BIND
;
2945 old_candidates
= candidates
;
2946 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
2948 conversion_path
, TYPE_BINFO (fromtype
),
2949 flags
, &candidates
);
2951 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
2954 = implicit_conversion (totype
,
2955 TREE_TYPE (TREE_TYPE (cand
->fn
)),
2957 /*c_cast_p=*/false, convflags
);
2959 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
2960 copy-initialization. In that case, "The result of the
2961 call is then used to direct-initialize the object that is
2962 the destination of the copy-initialization." [dcl.init]
2964 We represent this in the conversion sequence with an
2965 rvalue conversion, which means a constructor call. But
2966 don't add a second rvalue conversion if there's already
2967 one there. Which there really shouldn't be, but it's
2968 harmless since we'd add it here anyway. */
2969 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
2970 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
2971 ics
= build_conv (ck_rvalue
, totype
, ics
);
2973 cand
->second_conv
= ics
;
2977 else if (cand
->viable
== 1 && ics
->bad_p
)
2982 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
2986 cand
= tourney (candidates
);
2989 if (flags
& LOOKUP_COMPLAIN
)
2991 error ("conversion from %qT to %qT is ambiguous",
2993 print_z_candidates (candidates
);
2996 cand
= candidates
; /* any one will do */
2997 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
2998 cand
->second_conv
->user_conv_p
= true;
2999 if (!any_strictly_viable (candidates
))
3000 cand
->second_conv
->bad_p
= true;
3001 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3002 ambiguous conversion is no worse than another user-defined
3008 /* Build the user conversion sequence. */
3011 (DECL_CONSTRUCTOR_P (cand
->fn
)
3012 ? totype
: non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)))),
3013 build_identity_conv (TREE_TYPE (expr
), expr
));
3016 /* Remember that this was a list-initialization. */
3017 if (flags
& LOOKUP_NO_NARROWING
)
3018 conv
->check_narrowing
= true;
3020 /* Combine it with the second conversion sequence. */
3021 cand
->second_conv
= merge_conversion_sequences (conv
,
3024 if (cand
->viable
== -1)
3025 cand
->second_conv
->bad_p
= true;
3031 build_user_type_conversion (tree totype
, tree expr
, int flags
)
3033 struct z_candidate
*cand
3034 = build_user_type_conversion_1 (totype
, expr
, flags
);
3038 if (cand
->second_conv
->kind
== ck_ambig
)
3039 return error_mark_node
;
3040 expr
= convert_like (cand
->second_conv
, expr
, tf_warning_or_error
);
3041 return convert_from_reference (expr
);
3046 /* Do any initial processing on the arguments to a function call. */
3048 static VEC(tree
,gc
) *
3049 resolve_args (VEC(tree
,gc
) *args
)
3054 for (ix
= 0; VEC_iterate (tree
, args
, ix
, arg
); ++ix
)
3056 if (error_operand_p (arg
))
3058 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
3060 error ("invalid use of void expression");
3063 else if (invalid_nonstatic_memfn_p (arg
, tf_warning_or_error
))
3069 /* Perform overload resolution on FN, which is called with the ARGS.
3071 Return the candidate function selected by overload resolution, or
3072 NULL if the event that overload resolution failed. In the case
3073 that overload resolution fails, *CANDIDATES will be the set of
3074 candidates considered, and ANY_VIABLE_P will be set to true or
3075 false to indicate whether or not any of the candidates were
3078 The ARGS should already have gone through RESOLVE_ARGS before this
3079 function is called. */
3081 static struct z_candidate
*
3082 perform_overload_resolution (tree fn
,
3083 const VEC(tree
,gc
) *args
,
3084 struct z_candidate
**candidates
,
3087 struct z_candidate
*cand
;
3088 tree explicit_targs
= NULL_TREE
;
3089 int template_only
= 0;
3092 *any_viable_p
= true;
3095 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
3096 || TREE_CODE (fn
) == TEMPLATE_DECL
3097 || TREE_CODE (fn
) == OVERLOAD
3098 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
3100 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3102 explicit_targs
= TREE_OPERAND (fn
, 1);
3103 fn
= TREE_OPERAND (fn
, 0);
3107 /* Add the various candidate functions. */
3108 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
3109 explicit_targs
, template_only
,
3110 /*conversion_path=*/NULL_TREE
,
3111 /*access_path=*/NULL_TREE
,
3115 *candidates
= splice_viable (*candidates
, pedantic
, any_viable_p
);
3119 cand
= tourney (*candidates
);
3123 /* Return an expression for a call to FN (a namespace-scope function,
3124 or a static member function) with the ARGS. This may change
3128 build_new_function_call (tree fn
, VEC(tree
,gc
) **args
, bool koenig_p
,
3129 tsubst_flags_t complain
)
3131 struct z_candidate
*candidates
, *cand
;
3136 if (args
!= NULL
&& *args
!= NULL
)
3138 *args
= resolve_args (*args
);
3140 return error_mark_node
;
3143 /* If this function was found without using argument dependent
3144 lookup, then we want to ignore any undeclared friend
3150 fn
= remove_hidden_names (fn
);
3153 if (complain
& tf_error
)
3154 error ("no matching function for call to %<%D(%A)%>",
3155 DECL_NAME (OVL_CURRENT (orig_fn
)),
3156 build_tree_list_vec (*args
));
3157 return error_mark_node
;
3161 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3162 p
= conversion_obstack_alloc (0);
3164 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
);
3168 if (complain
& tf_error
)
3170 if (!any_viable_p
&& candidates
&& ! candidates
->next
)
3171 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
3172 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3173 fn
= TREE_OPERAND (fn
, 0);
3175 error ("no matching function for call to %<%D(%A)%>",
3176 DECL_NAME (OVL_CURRENT (fn
)), build_tree_list_vec (*args
));
3178 error ("call of overloaded %<%D(%A)%> is ambiguous",
3179 DECL_NAME (OVL_CURRENT (fn
)), build_tree_list_vec (*args
));
3181 print_z_candidates (candidates
);
3183 result
= error_mark_node
;
3186 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
3188 /* Free all the conversions we allocated. */
3189 obstack_free (&conversion_obstack
, p
);
3194 /* Build a call to a global operator new. FNNAME is the name of the
3195 operator (either "operator new" or "operator new[]") and ARGS are
3196 the arguments provided. This may change ARGS. *SIZE points to the
3197 total number of bytes required by the allocation, and is updated if
3198 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
3199 be used. If this function determines that no cookie should be
3200 used, after all, *COOKIE_SIZE is set to NULL_TREE. If FN is
3201 non-NULL, it will be set, upon return, to the allocation function
3205 build_operator_new_call (tree fnname
, VEC(tree
,gc
) **args
,
3206 tree
*size
, tree
*cookie_size
,
3210 struct z_candidate
*candidates
;
3211 struct z_candidate
*cand
;
3216 VEC_safe_insert (tree
, gc
, *args
, 0, *size
);
3217 *args
= resolve_args (*args
);
3219 return error_mark_node
;
3225 If this lookup fails to find the name, or if the allocated type
3226 is not a class type, the allocation function's name is looked
3227 up in the global scope.
3229 we disregard block-scope declarations of "operator new". */
3230 fns
= lookup_function_nonclass (fnname
, *args
, /*block_p=*/false);
3232 /* Figure out what function is being called. */
3233 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
);
3235 /* If no suitable function could be found, issue an error message
3240 error ("no matching function for call to %<%D(%A)%>",
3241 DECL_NAME (OVL_CURRENT (fns
)), build_tree_list_vec (*args
));
3243 error ("call of overloaded %<%D(%A)%> is ambiguous",
3244 DECL_NAME (OVL_CURRENT (fns
)), build_tree_list_vec (*args
));
3246 print_z_candidates (candidates
);
3247 return error_mark_node
;
3250 /* If a cookie is required, add some extra space. Whether
3251 or not a cookie is required cannot be determined until
3252 after we know which function was called. */
3255 bool use_cookie
= true;
3256 if (!abi_version_at_least (2))
3258 /* In G++ 3.2, the check was implemented incorrectly; it
3259 looked at the placement expression, rather than the
3260 type of the function. */
3261 if (VEC_length (tree
, *args
) == 2
3262 && same_type_p (TREE_TYPE (VEC_index (tree
, *args
, 1)),
3270 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
3271 /* Skip the size_t parameter. */
3272 arg_types
= TREE_CHAIN (arg_types
);
3273 /* Check the remaining parameters (if any). */
3275 && TREE_CHAIN (arg_types
) == void_list_node
3276 && same_type_p (TREE_VALUE (arg_types
),
3280 /* If we need a cookie, adjust the number of bytes allocated. */
3283 /* Update the total size. */
3284 *size
= size_binop (PLUS_EXPR
, *size
, *cookie_size
);
3285 /* Update the argument list to reflect the adjusted size. */
3286 VEC_replace (tree
, *args
, 0, *size
);
3289 *cookie_size
= NULL_TREE
;
3292 /* Tell our caller which function we decided to call. */
3296 /* Build the CALL_EXPR. */
3297 return build_over_call (cand
, LOOKUP_NORMAL
, tf_warning_or_error
);
3300 /* Build a new call to operator(). This may change ARGS. */
3303 build_op_call (tree obj
, VEC(tree
,gc
) **args
, tsubst_flags_t complain
)
3305 struct z_candidate
*candidates
= 0, *cand
;
3306 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
3307 tree type
= TREE_TYPE (obj
);
3309 tree result
= NULL_TREE
;
3312 if (error_operand_p (obj
))
3313 return error_mark_node
;
3315 obj
= prep_operand (obj
);
3317 if (TYPE_PTRMEMFUNC_P (type
))
3319 if (complain
& tf_error
)
3320 /* It's no good looking for an overloaded operator() on a
3321 pointer-to-member-function. */
3322 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj
);
3323 return error_mark_node
;
3326 if (TYPE_BINFO (type
))
3328 fns
= lookup_fnfields (TYPE_BINFO (type
), ansi_opname (CALL_EXPR
), 1);
3329 if (fns
== error_mark_node
)
3330 return error_mark_node
;
3335 if (args
!= NULL
&& *args
!= NULL
)
3337 *args
= resolve_args (*args
);
3339 return error_mark_node
;
3342 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3343 p
= conversion_obstack_alloc (0);
3347 first_mem_arg
= build_this (obj
);
3349 add_candidates (BASELINK_FUNCTIONS (fns
),
3350 first_mem_arg
, *args
, NULL_TREE
,
3352 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
3353 LOOKUP_NORMAL
, &candidates
);
3356 convs
= lookup_conversions (type
, /*lookup_template_convs_p=*/true);
3358 for (; convs
; convs
= TREE_CHAIN (convs
))
3360 tree fns
= TREE_VALUE (convs
);
3361 tree totype
= TREE_TYPE (convs
);
3363 if ((TREE_CODE (totype
) == POINTER_TYPE
3364 && TREE_CODE (TREE_TYPE (totype
)) == FUNCTION_TYPE
)
3365 || (TREE_CODE (totype
) == REFERENCE_TYPE
3366 && TREE_CODE (TREE_TYPE (totype
)) == FUNCTION_TYPE
)
3367 || (TREE_CODE (totype
) == REFERENCE_TYPE
3368 && TREE_CODE (TREE_TYPE (totype
)) == POINTER_TYPE
3369 && TREE_CODE (TREE_TYPE (TREE_TYPE (totype
))) == FUNCTION_TYPE
))
3370 for (; fns
; fns
= OVL_NEXT (fns
))
3372 tree fn
= OVL_CURRENT (fns
);
3374 if (DECL_NONCONVERTING_P (fn
))
3377 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
3378 add_template_conv_candidate
3379 (&candidates
, fn
, obj
, NULL_TREE
, *args
, totype
,
3380 /*access_path=*/NULL_TREE
,
3381 /*conversion_path=*/NULL_TREE
);
3383 add_conv_candidate (&candidates
, fn
, obj
, NULL_TREE
,
3384 *args
, /*conversion_path=*/NULL_TREE
,
3385 /*access_path=*/NULL_TREE
);
3389 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
3392 if (complain
& tf_error
)
3394 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
3395 build_tree_list_vec (*args
));
3396 print_z_candidates (candidates
);
3398 result
= error_mark_node
;
3402 cand
= tourney (candidates
);
3405 if (complain
& tf_error
)
3407 error ("call of %<(%T) (%A)%> is ambiguous",
3408 TREE_TYPE (obj
), build_tree_list_vec (*args
));
3409 print_z_candidates (candidates
);
3411 result
= error_mark_node
;
3413 /* Since cand->fn will be a type, not a function, for a conversion
3414 function, we must be careful not to unconditionally look at
3416 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
3417 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
) == CALL_EXPR
)
3418 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
3421 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
, -1,
3423 obj
= convert_from_reference (obj
);
3424 result
= cp_build_function_call_vec (obj
, args
, complain
);
3428 /* Free all the conversions we allocated. */
3429 obstack_free (&conversion_obstack
, p
);
3435 op_error (enum tree_code code
, enum tree_code code2
,
3436 tree arg1
, tree arg2
, tree arg3
, bool match
)
3440 if (code
== MODIFY_EXPR
)
3441 opname
= assignment_operator_name_info
[code2
].name
;
3443 opname
= operator_name_info
[code
].name
;
3449 error ("ambiguous overload for ternary %<operator?:%> "
3450 "in %<%E ? %E : %E%>", arg1
, arg2
, arg3
);
3452 error ("no match for ternary %<operator?:%> "
3453 "in %<%E ? %E : %E%>", arg1
, arg2
, arg3
);
3456 case POSTINCREMENT_EXPR
:
3457 case POSTDECREMENT_EXPR
:
3459 error ("ambiguous overload for %<operator%s%> in %<%E%s%>",
3460 opname
, arg1
, opname
);
3462 error ("no match for %<operator%s%> in %<%E%s%>",
3463 opname
, arg1
, opname
);
3468 error ("ambiguous overload for %<operator[]%> in %<%E[%E]%>",
3471 error ("no match for %<operator[]%> in %<%E[%E]%>",
3478 error ("ambiguous overload for %qs in %<%s %E%>",
3479 opname
, opname
, arg1
);
3481 error ("no match for %qs in %<%s %E%>",
3482 opname
, opname
, arg1
);
3488 error ("ambiguous overload for %<operator%s%> in %<%E %s %E%>",
3489 opname
, arg1
, opname
, arg2
);
3491 error ("no match for %<operator%s%> in %<%E %s %E%>",
3492 opname
, arg1
, opname
, arg2
);
3495 error ("ambiguous overload for %<operator%s%> in %<%s%E%>",
3496 opname
, opname
, arg1
);
3498 error ("no match for %<operator%s%> in %<%s%E%>",
3499 opname
, opname
, arg1
);
3504 /* Return the implicit conversion sequence that could be used to
3505 convert E1 to E2 in [expr.cond]. */
3508 conditional_conversion (tree e1
, tree e2
)
3510 tree t1
= non_reference (TREE_TYPE (e1
));
3511 tree t2
= non_reference (TREE_TYPE (e2
));
3517 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
3518 implicitly converted (clause _conv_) to the type "reference to
3519 T2", subject to the constraint that in the conversion the
3520 reference must bind directly (_dcl.init.ref_) to E1. */
3521 if (real_lvalue_p (e2
))
3523 conv
= implicit_conversion (build_reference_type (t2
),
3527 LOOKUP_NO_TEMP_BIND
|LOOKUP_ONLYCONVERTING
);
3534 If E1 and E2 have class type, and the underlying class types are
3535 the same or one is a base class of the other: E1 can be converted
3536 to match E2 if the class of T2 is the same type as, or a base
3537 class of, the class of T1, and the cv-qualification of T2 is the
3538 same cv-qualification as, or a greater cv-qualification than, the
3539 cv-qualification of T1. If the conversion is applied, E1 is
3540 changed to an rvalue of type T2 that still refers to the original
3541 source class object (or the appropriate subobject thereof). */
3542 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
3543 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
3545 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
3547 conv
= build_identity_conv (t1
, e1
);
3548 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
3549 TYPE_MAIN_VARIANT (t2
)))
3550 conv
= build_conv (ck_base
, t2
, conv
);
3552 conv
= build_conv (ck_rvalue
, t2
, conv
);
3561 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
3562 converted to the type that expression E2 would have if E2 were
3563 converted to an rvalue (or the type it has, if E2 is an rvalue). */
3564 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
3568 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
3569 arguments to the conditional expression. */
3572 build_conditional_expr (tree arg1
, tree arg2
, tree arg3
,
3573 tsubst_flags_t complain
)
3577 tree result
= NULL_TREE
;
3579 tree result_type
= NULL_TREE
;
3580 bool lvalue_p
= true;
3581 struct z_candidate
*candidates
= 0;
3582 struct z_candidate
*cand
;
3585 /* As a G++ extension, the second argument to the conditional can be
3586 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
3587 c'.) If the second operand is omitted, make sure it is
3588 calculated only once. */
3591 if (complain
& tf_error
)
3592 pedwarn (input_location
, OPT_pedantic
,
3593 "ISO C++ forbids omitting the middle term of a ?: expression");
3595 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
3596 if (real_lvalue_p (arg1
))
3597 arg2
= arg1
= stabilize_reference (arg1
);
3599 arg2
= arg1
= save_expr (arg1
);
3604 The first expression is implicitly converted to bool (clause
3606 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
3609 /* If something has already gone wrong, just pass that fact up the
3611 if (error_operand_p (arg1
)
3612 || error_operand_p (arg2
)
3613 || error_operand_p (arg3
))
3614 return error_mark_node
;
3618 If either the second or the third operand has type (possibly
3619 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
3620 array-to-pointer (_conv.array_), and function-to-pointer
3621 (_conv.func_) standard conversions are performed on the second
3622 and third operands. */
3623 arg2_type
= unlowered_expr_type (arg2
);
3624 arg3_type
= unlowered_expr_type (arg3
);
3625 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
3627 /* Do the conversions. We don't these for `void' type arguments
3628 since it can't have any effect and since decay_conversion
3629 does not handle that case gracefully. */
3630 if (!VOID_TYPE_P (arg2_type
))
3631 arg2
= decay_conversion (arg2
);
3632 if (!VOID_TYPE_P (arg3_type
))
3633 arg3
= decay_conversion (arg3
);
3634 arg2_type
= TREE_TYPE (arg2
);
3635 arg3_type
= TREE_TYPE (arg3
);
3639 One of the following shall hold:
3641 --The second or the third operand (but not both) is a
3642 throw-expression (_except.throw_); the result is of the
3643 type of the other and is an rvalue.
3645 --Both the second and the third operands have type void; the
3646 result is of type void and is an rvalue.
3648 We must avoid calling force_rvalue for expressions of type
3649 "void" because it will complain that their value is being
3651 if (TREE_CODE (arg2
) == THROW_EXPR
3652 && TREE_CODE (arg3
) != THROW_EXPR
)
3654 if (!VOID_TYPE_P (arg3_type
))
3655 arg3
= force_rvalue (arg3
);
3656 arg3_type
= TREE_TYPE (arg3
);
3657 result_type
= arg3_type
;
3659 else if (TREE_CODE (arg2
) != THROW_EXPR
3660 && TREE_CODE (arg3
) == THROW_EXPR
)
3662 if (!VOID_TYPE_P (arg2_type
))
3663 arg2
= force_rvalue (arg2
);
3664 arg2_type
= TREE_TYPE (arg2
);
3665 result_type
= arg2_type
;
3667 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
3668 result_type
= void_type_node
;
3671 if (complain
& tf_error
)
3673 if (VOID_TYPE_P (arg2_type
))
3674 error ("second operand to the conditional operator "
3675 "is of type %<void%>, "
3676 "but the third operand is neither a throw-expression "
3677 "nor of type %<void%>");
3679 error ("third operand to the conditional operator "
3680 "is of type %<void%>, "
3681 "but the second operand is neither a throw-expression "
3682 "nor of type %<void%>");
3684 return error_mark_node
;
3688 goto valid_operands
;
3692 Otherwise, if the second and third operand have different types,
3693 and either has (possibly cv-qualified) class type, an attempt is
3694 made to convert each of those operands to the type of the other. */
3695 else if (!same_type_p (arg2_type
, arg3_type
)
3696 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
3701 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3702 p
= conversion_obstack_alloc (0);
3704 conv2
= conditional_conversion (arg2
, arg3
);
3705 conv3
= conditional_conversion (arg3
, arg2
);
3709 If both can be converted, or one can be converted but the
3710 conversion is ambiguous, the program is ill-formed. If
3711 neither can be converted, the operands are left unchanged and
3712 further checking is performed as described below. If exactly
3713 one conversion is possible, that conversion is applied to the
3714 chosen operand and the converted operand is used in place of
3715 the original operand for the remainder of this section. */
3716 if ((conv2
&& !conv2
->bad_p
3717 && conv3
&& !conv3
->bad_p
)
3718 || (conv2
&& conv2
->kind
== ck_ambig
)
3719 || (conv3
&& conv3
->kind
== ck_ambig
))
3721 error ("operands to ?: have different types %qT and %qT",
3722 arg2_type
, arg3_type
);
3723 result
= error_mark_node
;
3725 else if (conv2
&& (!conv2
->bad_p
|| !conv3
))
3727 arg2
= convert_like (conv2
, arg2
, complain
);
3728 arg2
= convert_from_reference (arg2
);
3729 arg2_type
= TREE_TYPE (arg2
);
3730 /* Even if CONV2 is a valid conversion, the result of the
3731 conversion may be invalid. For example, if ARG3 has type
3732 "volatile X", and X does not have a copy constructor
3733 accepting a "volatile X&", then even if ARG2 can be
3734 converted to X, the conversion will fail. */
3735 if (error_operand_p (arg2
))
3736 result
= error_mark_node
;
3738 else if (conv3
&& (!conv3
->bad_p
|| !conv2
))
3740 arg3
= convert_like (conv3
, arg3
, complain
);
3741 arg3
= convert_from_reference (arg3
);
3742 arg3_type
= TREE_TYPE (arg3
);
3743 if (error_operand_p (arg3
))
3744 result
= error_mark_node
;
3747 /* Free all the conversions we allocated. */
3748 obstack_free (&conversion_obstack
, p
);
3753 /* If, after the conversion, both operands have class type,
3754 treat the cv-qualification of both operands as if it were the
3755 union of the cv-qualification of the operands.
3757 The standard is not clear about what to do in this
3758 circumstance. For example, if the first operand has type
3759 "const X" and the second operand has a user-defined
3760 conversion to "volatile X", what is the type of the second
3761 operand after this step? Making it be "const X" (matching
3762 the first operand) seems wrong, as that discards the
3763 qualification without actually performing a copy. Leaving it
3764 as "volatile X" seems wrong as that will result in the
3765 conditional expression failing altogether, even though,
3766 according to this step, the one operand could be converted to
3767 the type of the other. */
3768 if ((conv2
|| conv3
)
3769 && CLASS_TYPE_P (arg2_type
)
3770 && TYPE_QUALS (arg2_type
) != TYPE_QUALS (arg3_type
))
3771 arg2_type
= arg3_type
=
3772 cp_build_qualified_type (arg2_type
,
3773 TYPE_QUALS (arg2_type
)
3774 | TYPE_QUALS (arg3_type
));
3779 If the second and third operands are lvalues and have the same
3780 type, the result is of that type and is an lvalue. */
3781 if (real_lvalue_p (arg2
)
3782 && real_lvalue_p (arg3
)
3783 && same_type_p (arg2_type
, arg3_type
))
3785 result_type
= arg2_type
;
3786 goto valid_operands
;
3791 Otherwise, the result is an rvalue. If the second and third
3792 operand do not have the same type, and either has (possibly
3793 cv-qualified) class type, overload resolution is used to
3794 determine the conversions (if any) to be applied to the operands
3795 (_over.match.oper_, _over.built_). */
3797 if (!same_type_p (arg2_type
, arg3_type
)
3798 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
3804 /* Rearrange the arguments so that add_builtin_candidate only has
3805 to know about two args. In build_builtin_candidate, the
3806 arguments are unscrambled. */
3810 add_builtin_candidates (&candidates
,
3813 ansi_opname (COND_EXPR
),
3819 If the overload resolution fails, the program is
3821 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
3824 if (complain
& tf_error
)
3826 op_error (COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
3827 print_z_candidates (candidates
);
3829 return error_mark_node
;
3831 cand
= tourney (candidates
);
3834 if (complain
& tf_error
)
3836 op_error (COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
3837 print_z_candidates (candidates
);
3839 return error_mark_node
;
3844 Otherwise, the conversions thus determined are applied, and
3845 the converted operands are used in place of the original
3846 operands for the remainder of this section. */
3847 conv
= cand
->convs
[0];
3848 arg1
= convert_like (conv
, arg1
, complain
);
3849 conv
= cand
->convs
[1];
3850 arg2
= convert_like (conv
, arg2
, complain
);
3851 arg2_type
= TREE_TYPE (arg2
);
3852 conv
= cand
->convs
[2];
3853 arg3
= convert_like (conv
, arg3
, complain
);
3854 arg3_type
= TREE_TYPE (arg3
);
3859 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
3860 and function-to-pointer (_conv.func_) standard conversions are
3861 performed on the second and third operands.
3863 We need to force the lvalue-to-rvalue conversion here for class types,
3864 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
3865 that isn't wrapped with a TARGET_EXPR plays havoc with exception
3868 arg2
= force_rvalue (arg2
);
3869 if (!CLASS_TYPE_P (arg2_type
))
3870 arg2_type
= TREE_TYPE (arg2
);
3872 arg3
= force_rvalue (arg3
);
3873 if (!CLASS_TYPE_P (arg3_type
))
3874 arg3_type
= TREE_TYPE (arg3
);
3876 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
3877 return error_mark_node
;
3881 After those conversions, one of the following shall hold:
3883 --The second and third operands have the same type; the result is of
3885 if (same_type_p (arg2_type
, arg3_type
))
3886 result_type
= arg2_type
;
3889 --The second and third operands have arithmetic or enumeration
3890 type; the usual arithmetic conversions are performed to bring
3891 them to a common type, and the result is of that type. */
3892 else if ((ARITHMETIC_TYPE_P (arg2_type
)
3893 || UNSCOPED_ENUM_P (arg2_type
))
3894 && (ARITHMETIC_TYPE_P (arg3_type
)
3895 || UNSCOPED_ENUM_P (arg3_type
)))
3897 /* In this case, there is always a common type. */
3898 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
3901 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
3902 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
3904 if (complain
& tf_warning
)
3906 "enumeral mismatch in conditional expression: %qT vs %qT",
3907 arg2_type
, arg3_type
);
3909 else if (extra_warnings
3910 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
3911 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
3912 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
3913 && !same_type_p (arg2_type
, type_promotes_to (arg3_type
)))))
3915 if (complain
& tf_warning
)
3917 "enumeral and non-enumeral type in conditional expression");
3920 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
3921 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
3925 --The second and third operands have pointer type, or one has
3926 pointer type and the other is a null pointer constant; pointer
3927 conversions (_conv.ptr_) and qualification conversions
3928 (_conv.qual_) are performed to bring them to their composite
3929 pointer type (_expr.rel_). The result is of the composite
3932 --The second and third operands have pointer to member type, or
3933 one has pointer to member type and the other is a null pointer
3934 constant; pointer to member conversions (_conv.mem_) and
3935 qualification conversions (_conv.qual_) are performed to bring
3936 them to a common type, whose cv-qualification shall match the
3937 cv-qualification of either the second or the third operand.
3938 The result is of the common type. */
3939 else if ((null_ptr_cst_p (arg2
)
3940 && (TYPE_PTR_P (arg3_type
) || TYPE_PTR_TO_MEMBER_P (arg3_type
)))
3941 || (null_ptr_cst_p (arg3
)
3942 && (TYPE_PTR_P (arg2_type
) || TYPE_PTR_TO_MEMBER_P (arg2_type
)))
3943 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
3944 || (TYPE_PTRMEM_P (arg2_type
) && TYPE_PTRMEM_P (arg3_type
))
3945 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
3947 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
3948 arg3
, CPO_CONDITIONAL_EXPR
,
3950 if (result_type
== error_mark_node
)
3951 return error_mark_node
;
3952 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
3953 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
3958 if (complain
& tf_error
)
3959 error ("operands to ?: have different types %qT and %qT",
3960 arg2_type
, arg3_type
);
3961 return error_mark_node
;
3965 result_save
= build3 (COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
3966 result
= fold_if_not_in_template (result_save
);
3968 if (cp_unevaluated_operand
&& TREE_CODE (result
) == CALL_EXPR
)
3969 /* Avoid folding to a CALL_EXPR within decltype (c++/42013). */
3970 result
= result_save
;
3972 /* We can't use result_type below, as fold might have returned a
3977 /* Expand both sides into the same slot, hopefully the target of
3978 the ?: expression. We used to check for TARGET_EXPRs here,
3979 but now we sometimes wrap them in NOP_EXPRs so the test would
3981 if (CLASS_TYPE_P (TREE_TYPE (result
)))
3982 result
= get_target_expr (result
);
3983 /* If this expression is an rvalue, but might be mistaken for an
3984 lvalue, we must add a NON_LVALUE_EXPR. */
3985 result
= rvalue (result
);
3991 /* OPERAND is an operand to an expression. Perform necessary steps
3992 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
3996 prep_operand (tree operand
)
4000 if (CLASS_TYPE_P (TREE_TYPE (operand
))
4001 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
4002 /* Make sure the template type is instantiated now. */
4003 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
4009 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
4010 OVERLOAD) to the CANDIDATES, returning an updated list of
4011 CANDIDATES. The ARGS are the arguments provided to the call;
4012 if FIRST_ARG is non-null it is the implicit object argument,
4013 otherwise the first element of ARGS is used if needed. The
4014 EXPLICIT_TARGS are explicit template arguments provided.
4015 TEMPLATE_ONLY is true if only template functions should be
4016 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
4017 add_function_candidate. */
4020 add_candidates (tree fns
, tree first_arg
, const VEC(tree
,gc
) *args
,
4022 tree explicit_targs
, bool template_only
,
4023 tree conversion_path
, tree access_path
,
4025 struct z_candidate
**candidates
)
4028 const VEC(tree
,gc
) *non_static_args
;
4029 bool check_list_ctor
;
4030 bool check_converting
;
4031 unification_kind_t strict
;
4037 /* Precalculate special handling of constructors and conversion ops. */
4038 fn
= OVL_CURRENT (fns
);
4039 if (DECL_CONV_FN_P (fn
))
4041 check_list_ctor
= false;
4042 check_converting
= !!(flags
& LOOKUP_ONLYCONVERTING
);
4043 if (flags
& LOOKUP_NO_CONVERSION
)
4044 /* We're doing return_type(x). */
4045 strict
= DEDUCE_CONV
;
4047 /* We're doing x.operator return_type(). */
4048 strict
= DEDUCE_EXACT
;
4049 /* [over.match.funcs] For conversion functions, the function
4050 is considered to be a member of the class of the implicit
4051 object argument for the purpose of defining the type of
4052 the implicit object parameter. */
4053 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (first_arg
)));
4057 if (DECL_CONSTRUCTOR_P (fn
))
4059 check_list_ctor
= !!(flags
& LOOKUP_LIST_ONLY
);
4060 check_converting
= !!(flags
& LOOKUP_ONLYCONVERTING
);
4064 check_list_ctor
= false;
4065 check_converting
= false;
4067 strict
= DEDUCE_CALL
;
4068 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
4072 non_static_args
= args
;
4074 /* Delay creating the implicit this parameter until it is needed. */
4075 non_static_args
= NULL
;
4077 for (; fns
; fns
= OVL_NEXT (fns
))
4080 const VEC(tree
,gc
) *fn_args
;
4082 fn
= OVL_CURRENT (fns
);
4084 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
4086 if (check_list_ctor
&& !is_list_ctor (fn
))
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 and we didn't get an
4093 implicit object argument, move it out of args. */
4094 if (first_arg
== NULL_TREE
)
4098 VEC(tree
,gc
) *tempvec
4099 = VEC_alloc (tree
, gc
, VEC_length (tree
, args
) - 1);
4100 for (ix
= 1; VEC_iterate (tree
, args
, ix
, arg
); ++ix
)
4101 VEC_quick_push (tree
, tempvec
, arg
);
4102 non_static_args
= tempvec
;
4103 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
,
4140 /* Even unsigned enum types promote to signed int. We don't want to
4141 issue -Wsign-compare warnings for this case. Here ORIG_ARG is the
4142 original argument and ARG is the argument after any conversions
4143 have been applied. We set TREE_NO_WARNING if we have added a cast
4144 from an unsigned enum type to a signed integer type. */
4147 avoid_sign_compare_warnings (tree orig_arg
, tree arg
)
4149 if (orig_arg
!= NULL_TREE
4152 && TREE_CODE (TREE_TYPE (orig_arg
)) == ENUMERAL_TYPE
4153 && TYPE_UNSIGNED (TREE_TYPE (orig_arg
))
4154 && INTEGRAL_TYPE_P (TREE_TYPE (arg
))
4155 && !TYPE_UNSIGNED (TREE_TYPE (arg
)))
4156 TREE_NO_WARNING (arg
) = 1;
4160 build_new_op (enum tree_code code
, int flags
, tree arg1
, tree arg2
, tree arg3
,
4161 bool *overloaded_p
, tsubst_flags_t complain
)
4163 tree orig_arg1
= arg1
;
4164 tree orig_arg2
= arg2
;
4165 tree orig_arg3
= arg3
;
4166 struct z_candidate
*candidates
= 0, *cand
;
4167 VEC(tree
,gc
) *arglist
;
4170 tree result
= NULL_TREE
;
4171 bool result_valid_p
= false;
4172 enum tree_code code2
= NOP_EXPR
;
4173 enum tree_code code_orig_arg1
= ERROR_MARK
;
4174 enum tree_code code_orig_arg2
= ERROR_MARK
;
4180 if (error_operand_p (arg1
)
4181 || error_operand_p (arg2
)
4182 || error_operand_p (arg3
))
4183 return error_mark_node
;
4185 if (code
== MODIFY_EXPR
)
4187 code2
= TREE_CODE (arg3
);
4189 fnname
= ansi_assopname (code2
);
4192 fnname
= ansi_opname (code
);
4194 arg1
= prep_operand (arg1
);
4200 case VEC_DELETE_EXPR
:
4202 /* Use build_op_new_call and build_op_delete_call instead. */
4206 /* Use build_op_call instead. */
4209 case TRUTH_ORIF_EXPR
:
4210 case TRUTH_ANDIF_EXPR
:
4211 case TRUTH_AND_EXPR
:
4213 /* These are saved for the sake of warn_logical_operator. */
4214 code_orig_arg1
= TREE_CODE (arg1
);
4215 code_orig_arg2
= TREE_CODE (arg2
);
4221 arg2
= prep_operand (arg2
);
4222 arg3
= prep_operand (arg3
);
4224 if (code
== COND_EXPR
)
4225 /* Use build_conditional_expr instead. */
4227 else if (! IS_OVERLOAD_TYPE (TREE_TYPE (arg1
))
4228 && (! arg2
|| ! IS_OVERLOAD_TYPE (TREE_TYPE (arg2
))))
4231 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
4232 arg2
= integer_zero_node
;
4234 arglist
= VEC_alloc (tree
, gc
, 3);
4235 VEC_quick_push (tree
, arglist
, arg1
);
4236 if (arg2
!= NULL_TREE
)
4237 VEC_quick_push (tree
, arglist
, arg2
);
4238 if (arg3
!= NULL_TREE
)
4239 VEC_quick_push (tree
, arglist
, arg3
);
4241 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4242 p
= conversion_obstack_alloc (0);
4244 /* Add namespace-scope operators to the list of functions to
4246 add_candidates (lookup_function_nonclass (fnname
, arglist
, /*block_p=*/true),
4247 NULL_TREE
, arglist
, NULL_TREE
,
4248 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
),
4263 NULL_TREE
, arglist
, NULL_TREE
,
4265 BASELINK_BINFO (fns
),
4266 BASELINK_ACCESS_BINFO (fns
),
4267 flags
, &candidates
);
4272 args
[2] = NULL_TREE
;
4274 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
, flags
);
4280 /* For these, the built-in candidates set is empty
4281 [over.match.oper]/3. We don't want non-strict matches
4282 because exact matches are always possible with built-in
4283 operators. The built-in candidate set for COMPONENT_REF
4284 would be empty too, but since there are no such built-in
4285 operators, we accept non-strict matches for them. */
4290 strict_p
= pedantic
;
4294 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
4299 case POSTINCREMENT_EXPR
:
4300 case POSTDECREMENT_EXPR
:
4301 /* Don't try anything fancy if we're not allowed to produce
4303 if (!(complain
& tf_error
))
4304 return error_mark_node
;
4306 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
4307 distinguish between prefix and postfix ++ and
4308 operator++() was used for both, so we allow this with
4310 if (flags
& LOOKUP_COMPLAIN
)
4312 const char *msg
= (flag_permissive
)
4313 ? G_("no %<%D(int)%> declared for postfix %qs,"
4314 " trying prefix operator instead")
4315 : G_("no %<%D(int)%> declared for postfix %qs");
4316 permerror (input_location
, msg
, fnname
,
4317 operator_name_info
[code
].name
);
4320 if (!flag_permissive
)
4321 return error_mark_node
;
4323 if (code
== POSTINCREMENT_EXPR
)
4324 code
= PREINCREMENT_EXPR
;
4326 code
= PREDECREMENT_EXPR
;
4327 result
= build_new_op (code
, flags
, arg1
, NULL_TREE
, NULL_TREE
,
4328 overloaded_p
, complain
);
4331 /* The caller will deal with these. */
4336 result_valid_p
= true;
4340 if ((flags
& LOOKUP_COMPLAIN
) && (complain
& tf_error
))
4342 /* If one of the arguments of the operator represents
4343 an invalid use of member function pointer, try to report
4344 a meaningful error ... */
4345 if (invalid_nonstatic_memfn_p (arg1
, tf_error
)
4346 || invalid_nonstatic_memfn_p (arg2
, tf_error
)
4347 || invalid_nonstatic_memfn_p (arg3
, tf_error
))
4348 /* We displayed the error message. */;
4351 /* ... Otherwise, report the more generic
4352 "no matching operator found" error */
4353 op_error (code
, code2
, arg1
, arg2
, arg3
, FALSE
);
4354 print_z_candidates (candidates
);
4357 result
= error_mark_node
;
4363 cand
= tourney (candidates
);
4366 if ((flags
& LOOKUP_COMPLAIN
) && (complain
& tf_error
))
4368 op_error (code
, code2
, arg1
, arg2
, arg3
, TRUE
);
4369 print_z_candidates (candidates
);
4371 result
= error_mark_node
;
4373 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
4376 *overloaded_p
= true;
4378 if (resolve_args (arglist
) == NULL
)
4379 result
= error_mark_node
;
4381 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4385 /* Give any warnings we noticed during overload resolution. */
4386 if (cand
->warnings
&& (complain
& tf_warning
))
4388 struct candidate_warning
*w
;
4389 for (w
= cand
->warnings
; w
; w
= w
->next
)
4390 joust (cand
, w
->loser
, 1);
4393 /* Check for comparison of different enum types. */
4402 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
4403 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
4404 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
4405 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
4406 && (complain
& tf_warning
))
4408 warning (OPT_Wenum_compare
,
4409 "comparison between %q#T and %q#T",
4410 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4417 /* We need to strip any leading REF_BIND so that bitfields
4418 don't cause errors. This should not remove any important
4419 conversions, because builtins don't apply to class
4420 objects directly. */
4421 conv
= cand
->convs
[0];
4422 if (conv
->kind
== ck_ref_bind
)
4423 conv
= conv
->u
.next
;
4424 arg1
= convert_like (conv
, arg1
, complain
);
4428 /* We need to call warn_logical_operator before
4429 converting arg2 to a boolean_type. */
4430 if (complain
& tf_warning
)
4431 warn_logical_operator (input_location
, code
, boolean_type_node
,
4432 code_orig_arg1
, arg1
,
4433 code_orig_arg2
, arg2
);
4435 conv
= cand
->convs
[1];
4436 if (conv
->kind
== ck_ref_bind
)
4437 conv
= conv
->u
.next
;
4438 arg2
= convert_like (conv
, arg2
, complain
);
4442 conv
= cand
->convs
[2];
4443 if (conv
->kind
== ck_ref_bind
)
4444 conv
= conv
->u
.next
;
4445 arg3
= convert_like (conv
, arg3
, complain
);
4451 user_defined_result_ready
:
4453 /* Free all the conversions we allocated. */
4454 obstack_free (&conversion_obstack
, p
);
4456 if (result
|| result_valid_p
)
4460 avoid_sign_compare_warnings (orig_arg1
, arg1
);
4461 avoid_sign_compare_warnings (orig_arg2
, arg2
);
4462 avoid_sign_compare_warnings (orig_arg3
, arg3
);
4467 return cp_build_modify_expr (arg1
, code2
, arg2
, complain
);
4470 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
4472 case TRUTH_ANDIF_EXPR
:
4473 case TRUTH_ORIF_EXPR
:
4474 case TRUTH_AND_EXPR
:
4476 warn_logical_operator (input_location
, code
, boolean_type_node
,
4477 code_orig_arg1
, arg1
, code_orig_arg2
, arg2
);
4482 case TRUNC_DIV_EXPR
:
4493 case TRUNC_MOD_EXPR
:
4497 return cp_build_binary_op (input_location
, code
, arg1
, arg2
, complain
);
4499 case UNARY_PLUS_EXPR
:
4502 case TRUTH_NOT_EXPR
:
4503 case PREINCREMENT_EXPR
:
4504 case POSTINCREMENT_EXPR
:
4505 case PREDECREMENT_EXPR
:
4506 case POSTDECREMENT_EXPR
:
4509 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
4512 return build_array_ref (input_location
, arg1
, arg2
);
4515 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_NULL
,
4519 /* The caller will deal with these. */
4531 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
4532 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
4535 non_placement_deallocation_fn_p (tree t
)
4537 /* A template instance is never a usual deallocation function,
4538 regardless of its signature. */
4539 if (TREE_CODE (t
) == TEMPLATE_DECL
4540 || primary_template_instantiation_p (t
))
4543 /* If a class T has a member deallocation function named operator delete
4544 with exactly one parameter, then that function is a usual
4545 (non-placement) deallocation function. If class T does not declare
4546 such an operator delete but does declare a member deallocation
4547 function named operator delete with exactly two parameters, the second
4548 of which has type std::size_t (18.2), then this function is a usual
4549 deallocation function. */
4550 t
= FUNCTION_ARG_CHAIN (t
);
4551 if (t
== void_list_node
4552 || (t
&& same_type_p (TREE_VALUE (t
), size_type_node
)
4553 && TREE_CHAIN (t
) == void_list_node
))
4558 /* Build a call to operator delete. This has to be handled very specially,
4559 because the restrictions on what signatures match are different from all
4560 other call instances. For a normal delete, only a delete taking (void *)
4561 or (void *, size_t) is accepted. For a placement delete, only an exact
4562 match with the placement new is accepted.
4564 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
4565 ADDR is the pointer to be deleted.
4566 SIZE is the size of the memory block to be deleted.
4567 GLOBAL_P is true if the delete-expression should not consider
4568 class-specific delete operators.
4569 PLACEMENT is the corresponding placement new call, or NULL_TREE.
4571 If this call to "operator delete" is being generated as part to
4572 deallocate memory allocated via a new-expression (as per [expr.new]
4573 which requires that if the initialization throws an exception then
4574 we call a deallocation function), then ALLOC_FN is the allocation
4578 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
4579 bool global_p
, tree placement
,
4582 tree fn
= NULL_TREE
;
4583 tree fns
, fnname
, type
, t
;
4585 if (addr
== error_mark_node
)
4586 return error_mark_node
;
4588 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
4590 fnname
= ansi_opname (code
);
4592 if (CLASS_TYPE_P (type
)
4593 && COMPLETE_TYPE_P (complete_type (type
))
4597 If the result of the lookup is ambiguous or inaccessible, or if
4598 the lookup selects a placement deallocation function, the
4599 program is ill-formed.
4601 Therefore, we ask lookup_fnfields to complain about ambiguity. */
4603 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
4604 if (fns
== error_mark_node
)
4605 return error_mark_node
;
4610 if (fns
== NULL_TREE
)
4611 fns
= lookup_name_nonclass (fnname
);
4613 /* Strip const and volatile from addr. */
4614 addr
= cp_convert (ptr_type_node
, addr
);
4618 /* "A declaration of a placement deallocation function matches the
4619 declaration of a placement allocation function if it has the same
4620 number of parameters and, after parameter transformations (8.3.5),
4621 all parameter types except the first are identical."
4623 So we build up the function type we want and ask instantiate_type
4624 to get it for us. */
4625 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
4626 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
4627 t
= build_function_type (void_type_node
, t
);
4629 fn
= instantiate_type (t
, fns
, tf_none
);
4630 if (fn
== error_mark_node
)
4633 if (BASELINK_P (fn
))
4634 fn
= BASELINK_FUNCTIONS (fn
);
4636 /* "If the lookup finds the two-parameter form of a usual deallocation
4637 function (3.7.4.2) and that function, considered as a placement
4638 deallocation function, would have been selected as a match for the
4639 allocation function, the program is ill-formed." */
4640 if (non_placement_deallocation_fn_p (fn
))
4642 /* But if the class has an operator delete (void *), then that is
4643 the usual deallocation function, so we shouldn't complain
4644 about using the operator delete (void *, size_t). */
4645 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
4646 t
; t
= OVL_NEXT (t
))
4648 tree elt
= OVL_CURRENT (t
);
4649 if (non_placement_deallocation_fn_p (elt
)
4650 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
4653 permerror (0, "non-placement deallocation function %q+D", fn
);
4654 permerror (input_location
, "selected for placement delete");
4659 /* "Any non-placement deallocation function matches a non-placement
4660 allocation function. If the lookup finds a single matching
4661 deallocation function, that function will be called; otherwise, no
4662 deallocation function will be called." */
4663 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
4664 t
; t
= OVL_NEXT (t
))
4666 tree elt
= OVL_CURRENT (t
);
4667 if (non_placement_deallocation_fn_p (elt
))
4670 /* "If a class T has a member deallocation function named
4671 operator delete with exactly one parameter, then that
4672 function is a usual (non-placement) deallocation
4673 function. If class T does not declare such an operator
4674 delete but does declare a member deallocation function named
4675 operator delete with exactly two parameters, the second of
4676 which has type std::size_t (18.2), then this function is a
4677 usual deallocation function."
4679 So (void*) beats (void*, size_t). */
4680 if (FUNCTION_ARG_CHAIN (fn
) == void_list_node
)
4685 /* If we have a matching function, call it. */
4688 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
4690 /* If the FN is a member function, make sure that it is
4692 if (BASELINK_P (fns
))
4693 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
);
4695 /* Core issue 901: It's ok to new a type with deleted delete. */
4696 if (DECL_DELETED_FN (fn
) && alloc_fn
)
4701 /* The placement args might not be suitable for overload
4702 resolution at this point, so build the call directly. */
4703 int nargs
= call_expr_nargs (placement
);
4704 tree
*argarray
= (tree
*) alloca (nargs
* sizeof (tree
));
4707 for (i
= 1; i
< nargs
; i
++)
4708 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
4710 return build_cxx_call (fn
, nargs
, argarray
);
4715 VEC(tree
,gc
) *args
= VEC_alloc (tree
, gc
, 2);
4716 VEC_quick_push (tree
, args
, addr
);
4717 if (FUNCTION_ARG_CHAIN (fn
) != void_list_node
)
4718 VEC_quick_push (tree
, args
, size
);
4719 ret
= cp_build_function_call_vec (fn
, &args
, tf_warning_or_error
);
4720 VEC_free (tree
, gc
, args
);
4727 If no unambiguous matching deallocation function can be found,
4728 propagating the exception does not cause the object's memory to
4733 warning (0, "no corresponding deallocation function for %qD",
4738 error ("no suitable %<operator %s%> for %qT",
4739 operator_name_info
[(int)code
].name
, type
);
4740 return error_mark_node
;
4743 /* If the current scope isn't allowed to access DECL along
4744 BASETYPE_PATH, give an error. The most derived class in
4745 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
4746 the declaration to use in the error diagnostic. */
4749 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
)
4751 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
4753 if (!accessible_p (basetype_path
, decl
, true))
4755 if (TREE_PRIVATE (decl
))
4756 error ("%q+#D is private", diag_decl
);
4757 else if (TREE_PROTECTED (decl
))
4758 error ("%q+#D is protected", diag_decl
);
4760 error ("%q+#D is inaccessible", diag_decl
);
4761 error ("within this context");
4768 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
4769 bitwise or of LOOKUP_* values. If any errors are warnings are
4770 generated, set *DIAGNOSTIC_FN to "error" or "warning",
4771 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
4775 build_temp (tree expr
, tree type
, int flags
,
4776 diagnostic_t
*diagnostic_kind
)
4781 savew
= warningcount
, savee
= errorcount
;
4782 args
= make_tree_vector_single (expr
);
4783 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
4784 &args
, type
, flags
, tf_warning_or_error
);
4785 release_tree_vector (args
);
4786 if (warningcount
> savew
)
4787 *diagnostic_kind
= DK_WARNING
;
4788 else if (errorcount
> savee
)
4789 *diagnostic_kind
= DK_ERROR
;
4791 *diagnostic_kind
= DK_UNSPECIFIED
;
4795 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
4796 EXPR is implicitly converted to type TOTYPE.
4797 FN and ARGNUM are used for diagnostics. */
4800 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
4802 tree t
= non_reference (totype
);
4804 /* Issue warnings about peculiar, but valid, uses of NULL. */
4805 if (expr
== null_node
&& TREE_CODE (t
) != BOOLEAN_TYPE
&& ARITHMETIC_TYPE_P (t
))
4808 warning_at (input_location
, OPT_Wconversion_null
,
4809 "passing NULL to non-pointer argument %P of %qD",
4812 warning_at (input_location
, OPT_Wconversion_null
,
4813 "converting to non-pointer type %qT from NULL", t
);
4816 /* Issue warnings if "false" is converted to a NULL pointer */
4817 else if (expr
== boolean_false_node
&& fn
&& POINTER_TYPE_P (t
))
4818 warning_at (input_location
, OPT_Wconversion_null
,
4819 "converting %<false%> to pointer type for argument %P of %qD",
4823 /* Perform the conversions in CONVS on the expression EXPR. FN and
4824 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
4825 indicates the `this' argument of a method. INNER is nonzero when
4826 being called to continue a conversion chain. It is negative when a
4827 reference binding will be applied, positive otherwise. If
4828 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
4829 conversions will be emitted if appropriate. If C_CAST_P is true,
4830 this conversion is coming from a C-style cast; in that case,
4831 conversions to inaccessible bases are permitted. */
4834 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
4835 int inner
, bool issue_conversion_warnings
,
4836 bool c_cast_p
, tsubst_flags_t complain
)
4838 tree totype
= convs
->type
;
4839 diagnostic_t diag_kind
;
4843 && convs
->kind
!= ck_user
4844 && convs
->kind
!= ck_list
4845 && convs
->kind
!= ck_ambig
4846 && convs
->kind
!= ck_ref_bind
4847 && convs
->kind
!= ck_rvalue
4848 && convs
->kind
!= ck_base
)
4850 conversion
*t
= convs
;
4852 /* Give a helpful error if this is bad because of excess braces. */
4853 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
4854 && SCALAR_TYPE_P (totype
)
4855 && CONSTRUCTOR_NELTS (expr
) > 0
4856 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
4857 permerror (input_location
, "too many braces around initializer for %qT", totype
);
4859 for (; t
; t
= convs
->u
.next
)
4861 if (t
->kind
== ck_user
|| !t
->bad_p
)
4863 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
4864 /*issue_conversion_warnings=*/false,
4869 else if (t
->kind
== ck_ambig
)
4870 return convert_like_real (t
, expr
, fn
, argnum
, 1,
4871 /*issue_conversion_warnings=*/false,
4874 else if (t
->kind
== ck_identity
)
4877 if (complain
& tf_error
)
4879 permerror (input_location
, "invalid conversion from %qT to %qT", TREE_TYPE (expr
), totype
);
4881 permerror (input_location
, " initializing argument %P of %qD", argnum
, fn
);
4884 return error_mark_node
;
4886 return cp_convert (totype
, expr
);
4889 if (issue_conversion_warnings
&& (complain
& tf_warning
))
4890 conversion_null_warnings (totype
, expr
, fn
, argnum
);
4892 switch (convs
->kind
)
4896 struct z_candidate
*cand
= convs
->cand
;
4897 tree convfn
= cand
->fn
;
4900 expr
= mark_rvalue_use (expr
);
4902 /* When converting from an init list we consider explicit
4903 constructors, but actually trying to call one is an error. */
4904 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
))
4906 if (complain
& tf_error
)
4907 error ("converting to %qT from initializer list would use "
4908 "explicit constructor %qD", totype
, convfn
);
4910 return error_mark_node
;
4913 /* Set user_conv_p on the argument conversions, so rvalue/base
4914 handling knows not to allow any more UDCs. */
4915 for (i
= 0; i
< cand
->num_convs
; ++i
)
4916 cand
->convs
[i
]->user_conv_p
= true;
4918 expr
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4920 /* If this is a constructor or a function returning an aggr type,
4921 we need to build up a TARGET_EXPR. */
4922 if (DECL_CONSTRUCTOR_P (convfn
))
4924 expr
= build_cplus_new (totype
, expr
);
4926 /* Remember that this was list-initialization. */
4927 if (convs
->check_narrowing
)
4928 TARGET_EXPR_LIST_INIT_P (expr
) = true;
4934 expr
= mark_rvalue_use (expr
);
4935 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
4937 int nelts
= CONSTRUCTOR_NELTS (expr
);
4939 expr
= integer_zero_node
;
4940 else if (nelts
== 1)
4941 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
4946 if (type_unknown_p (expr
))
4947 expr
= instantiate_type (totype
, expr
, complain
);
4948 /* Convert a constant to its underlying value, unless we are
4949 about to bind it to a reference, in which case we need to
4950 leave it as an lvalue. */
4953 expr
= decl_constant_value (expr
);
4954 if (expr
== null_node
&& INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
4955 /* If __null has been converted to an integer type, we do not
4956 want to warn about uses of EXPR as an integer, rather than
4958 expr
= build_int_cst (totype
, 0);
4962 if (!(complain
& tf_error
))
4963 return error_mark_node
;
4964 /* Call build_user_type_conversion again for the error. */
4965 return build_user_type_conversion
4966 (totype
, convs
->u
.expr
, LOOKUP_NORMAL
);
4970 /* Conversion to std::initializer_list<T>. */
4971 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
4972 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
4973 unsigned len
= CONSTRUCTOR_NELTS (expr
);
4975 VEC(tree
,gc
) *parms
;
4978 /* Convert all the elements. */
4979 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
4981 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
4982 1, false, false, complain
);
4983 if (sub
== error_mark_node
)
4985 check_narrowing (TREE_TYPE (sub
), val
);
4986 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
4988 /* Build up the array. */
4989 elttype
= cp_build_qualified_type
4990 (elttype
, TYPE_QUALS (elttype
) | TYPE_QUAL_CONST
);
4991 array
= build_array_of_n_type (elttype
, len
);
4992 array
= finish_compound_literal (array
, new_ctor
);
4994 parms
= make_tree_vector ();
4995 VEC_safe_push (tree
, gc
, parms
, decay_conversion (array
));
4996 VEC_safe_push (tree
, gc
, parms
, size_int (len
));
4997 /* Call the private constructor. */
4998 push_deferring_access_checks (dk_no_check
);
4999 new_ctor
= build_special_member_call
5000 (NULL_TREE
, complete_ctor_identifier
, &parms
, totype
, 0, complain
);
5001 release_tree_vector (parms
);
5002 pop_deferring_access_checks ();
5003 return build_cplus_new (totype
, new_ctor
);
5007 return get_target_expr (digest_init (totype
, expr
));
5013 expr
= convert_like_real (convs
->u
.next
, expr
, fn
, argnum
,
5014 convs
->kind
== ck_ref_bind
? -1 : 1,
5015 convs
->kind
== ck_ref_bind
? issue_conversion_warnings
: false,
5018 if (expr
== error_mark_node
)
5019 return error_mark_node
;
5021 switch (convs
->kind
)
5024 expr
= decay_conversion (expr
);
5025 if (! MAYBE_CLASS_TYPE_P (totype
))
5027 /* Else fall through. */
5029 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
5031 /* We are going to bind a reference directly to a base-class
5032 subobject of EXPR. */
5033 /* Build an expression for `*((base*) &expr)'. */
5034 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, complain
);
5035 expr
= convert_to_base (expr
, build_pointer_type (totype
),
5036 !c_cast_p
, /*nonnull=*/true, complain
);
5037 expr
= cp_build_indirect_ref (expr
, RO_IMPLICIT_CONVERSION
, complain
);
5041 /* Copy-initialization where the cv-unqualified version of the source
5042 type is the same class as, or a derived class of, the class of the
5043 destination [is treated as direct-initialization]. [dcl.init] */
5044 flags
= LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
;
5045 if (convs
->user_conv_p
)
5046 /* This conversion is being done in the context of a user-defined
5047 conversion (i.e. the second step of copy-initialization), so
5048 don't allow any more. */
5049 flags
|= LOOKUP_NO_CONVERSION
;
5050 expr
= build_temp (expr
, totype
, flags
, &diag_kind
);
5051 if (diag_kind
&& fn
)
5053 if ((complain
& tf_error
))
5054 emit_diagnostic (diag_kind
, input_location
, 0,
5055 " initializing argument %P of %qD", argnum
, fn
);
5056 else if (diag_kind
== DK_ERROR
)
5057 return error_mark_node
;
5059 return build_cplus_new (totype
, expr
);
5063 tree ref_type
= totype
;
5065 if (convs
->bad_p
&& TYPE_REF_IS_RVALUE (ref_type
)
5066 && real_lvalue_p (expr
))
5068 if (complain
& tf_error
)
5070 error ("cannot bind %qT lvalue to %qT",
5071 TREE_TYPE (expr
), totype
);
5073 error (" initializing argument %P of %q+D", argnum
, fn
);
5075 return error_mark_node
;
5078 /* If necessary, create a temporary.
5080 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
5081 that need temporaries, even when their types are reference
5082 compatible with the type of reference being bound, so the
5083 upcoming call to cp_build_unary_op (ADDR_EXPR, expr, ...)
5085 if (convs
->need_temporary_p
5086 || TREE_CODE (expr
) == CONSTRUCTOR
5087 || TREE_CODE (expr
) == VA_ARG_EXPR
)
5089 tree type
= convs
->u
.next
->type
;
5090 cp_lvalue_kind lvalue
= real_lvalue_p (expr
);
5092 if (!CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
))
5093 && !TYPE_REF_IS_RVALUE (ref_type
))
5095 if (complain
& tf_error
)
5097 /* If the reference is volatile or non-const, we
5098 cannot create a temporary. */
5099 if (lvalue
& clk_bitfield
)
5100 error ("cannot bind bitfield %qE to %qT",
5102 else if (lvalue
& clk_packed
)
5103 error ("cannot bind packed field %qE to %qT",
5106 error ("cannot bind rvalue %qE to %qT", expr
, ref_type
);
5108 return error_mark_node
;
5110 /* If the source is a packed field, and we must use a copy
5111 constructor, then building the target expr will require
5112 binding the field to the reference parameter to the
5113 copy constructor, and we'll end up with an infinite
5114 loop. If we can use a bitwise copy, then we'll be
5116 if ((lvalue
& clk_packed
)
5117 && CLASS_TYPE_P (type
)
5118 && !TYPE_HAS_TRIVIAL_INIT_REF (type
))
5120 if (complain
& tf_error
)
5121 error ("cannot bind packed field %qE to %qT",
5123 return error_mark_node
;
5125 if (lvalue
& clk_bitfield
)
5127 expr
= convert_bitfield_to_declared_type (expr
);
5128 expr
= fold_convert (type
, expr
);
5130 expr
= build_target_expr_with_type (expr
, type
);
5133 /* Take the address of the thing to which we will bind the
5135 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 1, complain
);
5136 if (expr
== error_mark_node
)
5137 return error_mark_node
;
5139 /* Convert it to a pointer to the type referred to by the
5140 reference. This will adjust the pointer if a derived to
5141 base conversion is being performed. */
5142 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
5144 /* Convert the pointer to the desired reference type. */
5145 return build_nop (ref_type
, expr
);
5149 return decay_conversion (expr
);
5152 /* Warn about deprecated conversion if appropriate. */
5153 string_conv_p (totype
, expr
, 1);
5158 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
5159 /*nonnull=*/false, complain
);
5160 return build_nop (totype
, expr
);
5163 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
5170 if (convs
->check_narrowing
)
5171 check_narrowing (totype
, expr
);
5173 if (issue_conversion_warnings
&& (complain
& tf_warning
))
5174 expr
= convert_and_check (totype
, expr
);
5176 expr
= convert (totype
, expr
);
5181 /* ARG is being passed to a varargs function. Perform any conversions
5182 required. Return the converted value. */
5185 convert_arg_to_ellipsis (tree arg
)
5189 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
5190 standard conversions are performed. */
5191 arg
= decay_conversion (arg
);
5194 If the argument has integral or enumeration type that is subject
5195 to the integral promotions (_conv.prom_), or a floating point
5196 type that is subject to the floating point promotion
5197 (_conv.fpprom_), the value of the argument is converted to the
5198 promoted type before the call. */
5199 if (TREE_CODE (TREE_TYPE (arg
)) == REAL_TYPE
5200 && (TYPE_PRECISION (TREE_TYPE (arg
))
5201 < TYPE_PRECISION (double_type_node
))
5202 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (arg
))))
5203 arg
= convert_to_real (double_type_node
, arg
);
5204 else if (TREE_CODE (TREE_TYPE (arg
)) == NULLPTR_TYPE
)
5205 arg
= null_pointer_node
;
5206 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (arg
)))
5207 arg
= perform_integral_promotions (arg
);
5209 arg
= require_complete_type (arg
);
5211 if (arg
!= error_mark_node
5212 && (type_has_nontrivial_copy_init (TREE_TYPE (arg
))
5213 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (arg
))))
5215 /* [expr.call] 5.2.2/7:
5216 Passing a potentially-evaluated argument of class type (Clause 9)
5217 with a non-trivial copy constructor or a non-trivial destructor
5218 with no corresponding parameter is conditionally-supported, with
5219 implementation-defined semantics.
5221 We used to just warn here and do a bitwise copy, but now
5222 cp_expr_size will abort if we try to do that.
5224 If the call appears in the context of a sizeof expression,
5225 it is not potentially-evaluated. */
5226 if (cp_unevaluated_operand
== 0)
5227 error ("cannot pass objects of non-trivially-copyable "
5228 "type %q#T through %<...%>", TREE_TYPE (arg
));
5234 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
5237 build_x_va_arg (tree expr
, tree type
)
5239 if (processing_template_decl
)
5240 return build_min (VA_ARG_EXPR
, type
, expr
);
5242 type
= complete_type_or_else (type
, NULL_TREE
);
5244 if (expr
== error_mark_node
|| !type
)
5245 return error_mark_node
;
5247 expr
= mark_lvalue_use (expr
);
5249 if (type_has_nontrivial_copy_init (type
)
5250 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
5251 || TREE_CODE (type
) == REFERENCE_TYPE
)
5253 /* Remove reference types so we don't ICE later on. */
5254 tree type1
= non_reference (type
);
5255 /* conditionally-supported behavior [expr.call] 5.2.2/7. */
5256 error ("cannot receive objects of non-trivially-copyable type %q#T "
5257 "through %<...%>; ", type
);
5258 expr
= convert (build_pointer_type (type1
), null_node
);
5259 expr
= cp_build_indirect_ref (expr
, RO_NULL
, tf_warning_or_error
);
5263 return build_va_arg (input_location
, expr
, type
);
5266 /* TYPE has been given to va_arg. Apply the default conversions which
5267 would have happened when passed via ellipsis. Return the promoted
5268 type, or the passed type if there is no change. */
5271 cxx_type_promotes_to (tree type
)
5275 /* Perform the array-to-pointer and function-to-pointer
5277 type
= type_decays_to (type
);
5279 promote
= type_promotes_to (type
);
5280 if (same_type_p (type
, promote
))
5286 /* ARG is a default argument expression being passed to a parameter of
5287 the indicated TYPE, which is a parameter to FN. Do any required
5288 conversions. Return the converted value. */
5290 static GTY(()) VEC(tree
,gc
) *default_arg_context
;
5293 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
)
5298 /* If the ARG is an unparsed default argument expression, the
5299 conversion cannot be performed. */
5300 if (TREE_CODE (arg
) == DEFAULT_ARG
)
5302 error ("the default argument for parameter %d of %qD has "
5303 "not yet been parsed",
5305 return error_mark_node
;
5308 /* Detect recursion. */
5309 for (i
= 0; VEC_iterate (tree
, default_arg_context
, i
, t
); ++i
)
5312 error ("recursive evaluation of default argument for %q#D", fn
);
5313 return error_mark_node
;
5315 VEC_safe_push (tree
, gc
, default_arg_context
, fn
);
5317 if (fn
&& DECL_TEMPLATE_INFO (fn
))
5318 arg
= tsubst_default_argument (fn
, type
, arg
);
5324 The names in the expression are bound, and the semantic
5325 constraints are checked, at the point where the default
5326 expressions appears.
5328 we must not perform access checks here. */
5329 push_deferring_access_checks (dk_no_check
);
5330 arg
= break_out_target_exprs (arg
);
5331 if (TREE_CODE (arg
) == CONSTRUCTOR
)
5333 arg
= digest_init (type
, arg
);
5334 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_NORMAL
,
5335 "default argument", fn
, parmnum
,
5336 tf_warning_or_error
);
5340 /* We must make a copy of ARG, in case subsequent processing
5341 alters any part of it. For example, during gimplification a
5342 cast of the form (T) &X::f (where "f" is a member function)
5343 will lead to replacing the PTRMEM_CST for &X::f with a
5344 VAR_DECL. We can avoid the copy for constants, since they
5345 are never modified in place. */
5346 if (!CONSTANT_CLASS_P (arg
))
5347 arg
= unshare_expr (arg
);
5348 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_NORMAL
,
5349 "default argument", fn
, parmnum
,
5350 tf_warning_or_error
);
5351 arg
= convert_for_arg_passing (type
, arg
);
5353 pop_deferring_access_checks();
5355 VEC_pop (tree
, default_arg_context
);
5360 /* Returns the type which will really be used for passing an argument of
5364 type_passed_as (tree type
)
5366 /* Pass classes with copy ctors by invisible reference. */
5367 if (TREE_ADDRESSABLE (type
))
5369 type
= build_reference_type (type
);
5370 /* There are no other pointers to this temporary. */
5371 type
= build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
5373 else if (targetm
.calls
.promote_prototypes (type
)
5374 && INTEGRAL_TYPE_P (type
)
5375 && COMPLETE_TYPE_P (type
)
5376 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
),
5377 TYPE_SIZE (integer_type_node
)))
5378 type
= integer_type_node
;
5383 /* Actually perform the appropriate conversion. */
5386 convert_for_arg_passing (tree type
, tree val
)
5390 /* If VAL is a bitfield, then -- since it has already been converted
5391 to TYPE -- it cannot have a precision greater than TYPE.
5393 If it has a smaller precision, we must widen it here. For
5394 example, passing "int f:3;" to a function expecting an "int" will
5395 not result in any conversion before this point.
5397 If the precision is the same we must not risk widening. For
5398 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
5399 often have type "int", even though the C++ type for the field is
5400 "long long". If the value is being passed to a function
5401 expecting an "int", then no conversions will be required. But,
5402 if we call convert_bitfield_to_declared_type, the bitfield will
5403 be converted to "long long". */
5404 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
5406 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
5407 val
= convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type
), val
);
5409 if (val
== error_mark_node
)
5411 /* Pass classes with copy ctors by invisible reference. */
5412 else if (TREE_ADDRESSABLE (type
))
5413 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
5414 else if (targetm
.calls
.promote_prototypes (type
)
5415 && INTEGRAL_TYPE_P (type
)
5416 && COMPLETE_TYPE_P (type
)
5417 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
),
5418 TYPE_SIZE (integer_type_node
)))
5419 val
= perform_integral_promotions (val
);
5420 if (warn_missing_format_attribute
)
5422 tree rhstype
= TREE_TYPE (val
);
5423 const enum tree_code coder
= TREE_CODE (rhstype
);
5424 const enum tree_code codel
= TREE_CODE (type
);
5425 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
5427 && check_missing_format_attribute (type
, rhstype
))
5428 warning (OPT_Wmissing_format_attribute
,
5429 "argument of function call might be a candidate for a format attribute");
5434 /* Returns true iff FN is a function with magic varargs, i.e. ones for
5435 which no conversions at all should be done. This is true for some
5436 builtins which don't act like normal functions. */
5439 magic_varargs_p (tree fn
)
5441 if (DECL_BUILT_IN (fn
))
5442 switch (DECL_FUNCTION_CODE (fn
))
5444 case BUILT_IN_CLASSIFY_TYPE
:
5445 case BUILT_IN_CONSTANT_P
:
5446 case BUILT_IN_NEXT_ARG
:
5447 case BUILT_IN_VA_START
:
5451 return lookup_attribute ("type generic",
5452 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
5458 /* Subroutine of the various build_*_call functions. Overload resolution
5459 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
5460 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
5461 bitmask of various LOOKUP_* flags which apply to the call itself. */
5464 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
5467 const VEC(tree
,gc
) *args
= cand
->args
;
5468 tree first_arg
= cand
->first_arg
;
5469 conversion
**convs
= cand
->convs
;
5471 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5476 unsigned int arg_index
= 0;
5480 bool already_used
= false;
5482 /* In a template, there is no need to perform all of the work that
5483 is normally done. We are only interested in the type of the call
5484 expression, i.e., the return type of the function. Any semantic
5485 errors will be deferred until the template is instantiated. */
5486 if (processing_template_decl
)
5490 const tree
*argarray
;
5493 return_type
= TREE_TYPE (TREE_TYPE (fn
));
5494 nargs
= VEC_length (tree
, args
);
5495 if (first_arg
== NULL_TREE
)
5496 argarray
= VEC_address (tree
, CONST_CAST (VEC(tree
,gc
) *, args
));
5504 alcarray
= XALLOCAVEC (tree
, nargs
);
5505 alcarray
[0] = first_arg
;
5506 for (ix
= 0; VEC_iterate (tree
, args
, ix
, arg
); ++ix
)
5507 alcarray
[ix
+ 1] = arg
;
5508 argarray
= alcarray
;
5510 expr
= build_call_array_loc (input_location
,
5511 return_type
, build_addr_func (fn
), nargs
,
5513 if (TREE_THIS_VOLATILE (fn
) && cfun
)
5514 current_function_returns_abnormally
= 1;
5515 if (!VOID_TYPE_P (return_type
))
5516 require_complete_type (return_type
);
5517 return convert_from_reference (expr
);
5520 /* Give any warnings we noticed during overload resolution. */
5523 struct candidate_warning
*w
;
5524 for (w
= cand
->warnings
; w
; w
= w
->next
)
5525 joust (cand
, w
->loser
, 1);
5528 /* Make =delete work with SFINAE. */
5529 if (DECL_DELETED_FN (fn
) && !(complain
& tf_error
))
5530 return error_mark_node
;
5532 if (DECL_FUNCTION_MEMBER_P (fn
))
5534 /* If FN is a template function, two cases must be considered.
5539 template <class T> void f();
5541 template <class T> struct B {
5545 struct C : A, B<int> {
5547 using B<int>::g; // #2
5550 In case #1 where `A::f' is a member template, DECL_ACCESS is
5551 recorded in the primary template but not in its specialization.
5552 We check access of FN using its primary template.
5554 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
5555 because it is a member of class template B, DECL_ACCESS is
5556 recorded in the specialization `B<int>::g'. We cannot use its
5557 primary template because `B<T>::g' and `B<int>::g' may have
5558 different access. */
5559 if (DECL_TEMPLATE_INFO (fn
)
5560 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
5561 perform_or_defer_access_check (cand
->access_path
,
5562 DECL_TI_TEMPLATE (fn
), fn
);
5564 perform_or_defer_access_check (cand
->access_path
, fn
, fn
);
5567 /* Find maximum size of vector to hold converted arguments. */
5568 parmlen
= list_length (parm
);
5569 nargs
= VEC_length (tree
, args
) + (first_arg
!= NULL_TREE
? 1 : 0);
5570 if (parmlen
> nargs
)
5572 argarray
= (tree
*) alloca (nargs
* sizeof (tree
));
5574 /* The implicit parameters to a constructor are not considered by overload
5575 resolution, and must be of the proper type. */
5576 if (DECL_CONSTRUCTOR_P (fn
))
5578 if (first_arg
!= NULL_TREE
)
5580 argarray
[j
++] = first_arg
;
5581 first_arg
= NULL_TREE
;
5585 argarray
[j
++] = VEC_index (tree
, args
, arg_index
);
5588 parm
= TREE_CHAIN (parm
);
5589 /* We should never try to call the abstract constructor. */
5590 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
5592 if (DECL_HAS_VTT_PARM_P (fn
))
5594 argarray
[j
++] = VEC_index (tree
, args
, arg_index
);
5596 parm
= TREE_CHAIN (parm
);
5599 /* Bypass access control for 'this' parameter. */
5600 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
5602 tree parmtype
= TREE_VALUE (parm
);
5603 tree arg
= (first_arg
!= NULL_TREE
5605 : VEC_index (tree
, args
, arg_index
));
5606 tree argtype
= TREE_TYPE (arg
);
5610 if (convs
[i
]->bad_p
)
5612 if (complain
& tf_error
)
5613 permerror (input_location
, "passing %qT as %<this%> argument of %q#D discards qualifiers",
5614 TREE_TYPE (argtype
), fn
);
5616 return error_mark_node
;
5619 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
5620 X is called for an object that is not of type X, or of a type
5621 derived from X, the behavior is undefined.
5623 So we can assume that anything passed as 'this' is non-null, and
5624 optimize accordingly. */
5625 gcc_assert (TREE_CODE (parmtype
) == POINTER_TYPE
);
5626 /* Convert to the base in which the function was declared. */
5627 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
5628 converted_arg
= build_base_path (PLUS_EXPR
,
5630 cand
->conversion_path
,
5632 /* Check that the base class is accessible. */
5633 if (!accessible_base_p (TREE_TYPE (argtype
),
5634 BINFO_TYPE (cand
->conversion_path
), true))
5635 error ("%qT is not an accessible base of %qT",
5636 BINFO_TYPE (cand
->conversion_path
),
5637 TREE_TYPE (argtype
));
5638 /* If fn was found by a using declaration, the conversion path
5639 will be to the derived class, not the base declaring fn. We
5640 must convert from derived to base. */
5641 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
5642 TREE_TYPE (parmtype
), ba_unique
, NULL
);
5643 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
5646 argarray
[j
++] = converted_arg
;
5647 parm
= TREE_CHAIN (parm
);
5648 if (first_arg
!= NULL_TREE
)
5649 first_arg
= NULL_TREE
;
5656 gcc_assert (first_arg
== NULL_TREE
);
5657 for (; arg_index
< VEC_length (tree
, args
) && parm
;
5658 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
5660 tree type
= TREE_VALUE (parm
);
5664 /* Don't make a copy here if build_call is going to. */
5665 if (conv
->kind
== ck_rvalue
5666 && COMPLETE_TYPE_P (complete_type (type
))
5667 && !TREE_ADDRESSABLE (type
))
5668 conv
= conv
->u
.next
;
5670 /* Warn about initializer_list deduction that isn't currently in the
5672 if (cxx_dialect
> cxx98
5673 && flag_deduce_init_list
5674 && cand
->template_decl
5675 && is_std_init_list (non_reference (type
)))
5677 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
5678 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
5679 tree patparm
= get_pattern_parm (realparm
, tmpl
);
5680 tree pattype
= TREE_TYPE (patparm
);
5681 if (PACK_EXPANSION_P (pattype
))
5682 pattype
= PACK_EXPANSION_PATTERN (pattype
);
5683 pattype
= non_reference (pattype
);
5685 if (!is_std_init_list (pattype
))
5687 pedwarn (input_location
, 0, "deducing %qT as %qT",
5688 non_reference (TREE_TYPE (patparm
)),
5689 non_reference (type
));
5690 pedwarn (input_location
, 0, " in call to %q+D", cand
->fn
);
5691 pedwarn (input_location
, 0,
5692 " (you can disable this with -fno-deduce-init-list)");
5696 val
= convert_like_with_context
5697 (conv
, VEC_index (tree
, args
, arg_index
), fn
, i
- is_method
,
5700 val
= convert_for_arg_passing (type
, val
);
5701 if (val
== error_mark_node
)
5702 return error_mark_node
;
5704 argarray
[j
++] = val
;
5707 /* Default arguments */
5708 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
5709 argarray
[j
++] = convert_default_arg (TREE_VALUE (parm
),
5710 TREE_PURPOSE (parm
),
5713 for (; arg_index
< VEC_length (tree
, args
); ++arg_index
)
5715 tree a
= VEC_index (tree
, args
, arg_index
);
5716 if (magic_varargs_p (fn
))
5717 /* Do no conversions for magic varargs. */
5718 a
= mark_type_use (a
);
5720 a
= convert_arg_to_ellipsis (a
);
5724 gcc_assert (j
<= nargs
);
5727 check_function_arguments (TYPE_ATTRIBUTES (TREE_TYPE (fn
)),
5728 nargs
, argarray
, TYPE_ARG_TYPES (TREE_TYPE (fn
)));
5730 /* Avoid actually calling copy constructors and copy assignment operators,
5733 if (! flag_elide_constructors
)
5734 /* Do things the hard way. */;
5735 else if (cand
->num_convs
== 1
5736 && (DECL_COPY_CONSTRUCTOR_P (fn
)
5737 || DECL_MOVE_CONSTRUCTOR_P (fn
)))
5740 tree arg
= argarray
[num_artificial_parms_for (fn
)];
5743 /* Pull out the real argument, disregarding const-correctness. */
5745 while (CONVERT_EXPR_P (targ
)
5746 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
5747 targ
= TREE_OPERAND (targ
, 0);
5748 if (TREE_CODE (targ
) == ADDR_EXPR
)
5750 targ
= TREE_OPERAND (targ
, 0);
5751 if (!same_type_ignoring_top_level_qualifiers_p
5752 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
5761 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
5763 if (TREE_CODE (arg
) == TARGET_EXPR
5764 && TARGET_EXPR_LIST_INIT_P (arg
))
5766 /* Copy-list-initialization doesn't require the copy constructor
5769 /* [class.copy]: the copy constructor is implicitly defined even if
5770 the implementation elided its use. */
5771 else if (TYPE_HAS_COMPLEX_INIT_REF (DECL_CONTEXT (fn
)))
5774 already_used
= true;
5777 /* If we're creating a temp and we already have one, don't create a
5778 new one. If we're not creating a temp but we get one, use
5779 INIT_EXPR to collapse the temp into our target. Otherwise, if the
5780 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
5781 temp or an INIT_EXPR otherwise. */
5782 fa
= (cand
->first_arg
!= NULL_TREE
5784 : VEC_index (tree
, args
, 0));
5785 if (integer_zerop (fa
))
5787 if (TREE_CODE (arg
) == TARGET_EXPR
)
5789 else if (TYPE_HAS_TRIVIAL_INIT_REF (DECL_CONTEXT (fn
)))
5790 return build_target_expr_with_type (arg
, DECL_CONTEXT (fn
));
5792 else if (TREE_CODE (arg
) == TARGET_EXPR
5793 || (TYPE_HAS_TRIVIAL_INIT_REF (DECL_CONTEXT (fn
))
5794 && !move_fn_p (fn
)))
5796 tree to
= stabilize_reference (cp_build_indirect_ref (fa
, RO_NULL
,
5799 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
5803 else if (DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
5805 && TYPE_HAS_TRIVIAL_ASSIGN_REF (DECL_CONTEXT (fn
)))
5807 tree to
= stabilize_reference
5808 (cp_build_indirect_ref (argarray
[0], RO_NULL
, complain
));
5809 tree type
= TREE_TYPE (to
);
5810 tree as_base
= CLASSTYPE_AS_BASE (type
);
5811 tree arg
= argarray
[1];
5813 if (is_really_empty_class (type
))
5815 /* Avoid copying empty classes. */
5816 val
= build2 (COMPOUND_EXPR
, void_type_node
, to
, arg
);
5817 TREE_NO_WARNING (val
) = 1;
5818 val
= build2 (COMPOUND_EXPR
, type
, val
, to
);
5819 TREE_NO_WARNING (val
) = 1;
5821 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
5823 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
5824 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
5828 /* We must only copy the non-tail padding parts.
5829 Use __builtin_memcpy for the bitwise copy.
5830 FIXME fix 22488 so we can go back to using MODIFY_EXPR
5831 instead of an explicit call to memcpy. */
5833 tree arg0
, arg1
, arg2
, t
;
5834 tree test
= NULL_TREE
;
5836 arg2
= TYPE_SIZE_UNIT (as_base
);
5838 arg0
= cp_build_unary_op (ADDR_EXPR
, to
, 0, complain
);
5840 if (!can_trust_pointer_alignment ())
5842 /* If we can't be sure about pointer alignment, a call
5843 to __builtin_memcpy is expanded as a call to memcpy, which
5844 is invalid with identical args. Otherwise it is
5845 expanded as a block move, which should be safe. */
5846 arg0
= save_expr (arg0
);
5847 arg1
= save_expr (arg1
);
5848 test
= build2 (EQ_EXPR
, boolean_type_node
, arg0
, arg1
);
5850 t
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
5851 t
= build_call_n (t
, 3, arg0
, arg1
, arg2
);
5853 t
= convert (TREE_TYPE (arg0
), t
);
5855 t
= build3 (COND_EXPR
, TREE_TYPE (t
), test
, arg0
, t
);
5856 val
= cp_build_indirect_ref (t
, RO_NULL
, complain
);
5857 TREE_NO_WARNING (val
) = 1;
5866 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0)
5869 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
5872 gcc_assert (binfo
&& binfo
!= error_mark_node
);
5874 /* Warn about deprecated virtual functions now, since we're about
5875 to throw away the decl. */
5876 if (TREE_DEPRECATED (fn
))
5877 warn_deprecated_use (fn
, NULL_TREE
);
5879 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1);
5880 if (TREE_SIDE_EFFECTS (argarray
[0]))
5881 argarray
[0] = save_expr (argarray
[0]);
5882 t
= build_pointer_type (TREE_TYPE (fn
));
5883 if (DECL_CONTEXT (fn
) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn
)))
5884 fn
= build_java_interface_fn_ref (fn
, argarray
[0]);
5886 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
5890 fn
= build_addr_func (fn
);
5892 return build_cxx_call (fn
, nargs
, argarray
);
5895 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
5896 This function performs no overload resolution, conversion, or other
5897 high-level operations. */
5900 build_cxx_call (tree fn
, int nargs
, tree
*argarray
)
5904 fn
= build_call_a (fn
, nargs
, argarray
);
5906 /* If this call might throw an exception, note that fact. */
5907 fndecl
= get_callee_fndecl (fn
);
5908 if ((!fndecl
|| !TREE_NOTHROW (fndecl
))
5909 && at_function_scope_p ()
5911 cp_function_chain
->can_throw
= 1;
5913 /* Check that arguments to builtin functions match the expectations. */
5915 && DECL_BUILT_IN (fndecl
)
5916 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
5917 && !check_builtin_function_arguments (fndecl
, nargs
, argarray
))
5918 return error_mark_node
;
5920 /* Some built-in function calls will be evaluated at compile-time in
5922 fn
= fold_if_not_in_template (fn
);
5924 if (VOID_TYPE_P (TREE_TYPE (fn
)))
5927 fn
= require_complete_type (fn
);
5928 if (fn
== error_mark_node
)
5929 return error_mark_node
;
5931 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
5932 fn
= build_cplus_new (TREE_TYPE (fn
), fn
);
5933 return convert_from_reference (fn
);
5936 static GTY(()) tree java_iface_lookup_fn
;
5938 /* Make an expression which yields the address of the Java interface
5939 method FN. This is achieved by generating a call to libjava's
5940 _Jv_LookupInterfaceMethodIdx(). */
5943 build_java_interface_fn_ref (tree fn
, tree instance
)
5945 tree lookup_fn
, method
, idx
;
5946 tree klass_ref
, iface
, iface_ref
;
5949 if (!java_iface_lookup_fn
)
5951 tree endlink
= build_void_list_node ();
5952 tree t
= tree_cons (NULL_TREE
, ptr_type_node
,
5953 tree_cons (NULL_TREE
, ptr_type_node
,
5954 tree_cons (NULL_TREE
, java_int_type_node
,
5956 java_iface_lookup_fn
5957 = add_builtin_function ("_Jv_LookupInterfaceMethodIdx",
5958 build_function_type (ptr_type_node
, t
),
5959 0, NOT_BUILT_IN
, NULL
, NULL_TREE
);
5962 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
5963 This is the first entry in the vtable. */
5964 klass_ref
= build_vtbl_ref (cp_build_indirect_ref (instance
, RO_NULL
,
5965 tf_warning_or_error
),
5968 /* Get the java.lang.Class pointer for the interface being called. */
5969 iface
= DECL_CONTEXT (fn
);
5970 iface_ref
= lookup_field (iface
, get_identifier ("class$"), 0, false);
5971 if (!iface_ref
|| TREE_CODE (iface_ref
) != VAR_DECL
5972 || DECL_CONTEXT (iface_ref
) != iface
)
5974 error ("could not find class$ field in java interface type %qT",
5976 return error_mark_node
;
5978 iface_ref
= build_address (iface_ref
);
5979 iface_ref
= convert (build_pointer_type (iface
), iface_ref
);
5981 /* Determine the itable index of FN. */
5983 for (method
= TYPE_METHODS (iface
); method
; method
= TREE_CHAIN (method
))
5985 if (!DECL_VIRTUAL_P (method
))
5991 idx
= build_int_cst (NULL_TREE
, i
);
5993 lookup_fn
= build1 (ADDR_EXPR
,
5994 build_pointer_type (TREE_TYPE (java_iface_lookup_fn
)),
5995 java_iface_lookup_fn
);
5996 return build_call_nary (ptr_type_node
, lookup_fn
,
5997 3, klass_ref
, iface_ref
, idx
);
6000 /* Returns the value to use for the in-charge parameter when making a
6001 call to a function with the indicated NAME.
6003 FIXME:Can't we find a neater way to do this mapping? */
6006 in_charge_arg_for_name (tree name
)
6008 if (name
== base_ctor_identifier
6009 || name
== base_dtor_identifier
)
6010 return integer_zero_node
;
6011 else if (name
== complete_ctor_identifier
)
6012 return integer_one_node
;
6013 else if (name
== complete_dtor_identifier
)
6014 return integer_two_node
;
6015 else if (name
== deleting_dtor_identifier
)
6016 return integer_three_node
;
6018 /* This function should only be called with one of the names listed
6024 /* Build a call to a constructor, destructor, or an assignment
6025 operator for INSTANCE, an expression with class type. NAME
6026 indicates the special member function to call; *ARGS are the
6027 arguments. ARGS may be NULL. This may change ARGS. BINFO
6028 indicates the base of INSTANCE that is to be passed as the `this'
6029 parameter to the member function called.
6031 FLAGS are the LOOKUP_* flags to use when processing the call.
6033 If NAME indicates a complete object constructor, INSTANCE may be
6034 NULL_TREE. In this case, the caller will call build_cplus_new to
6035 store the newly constructed object into a VAR_DECL. */
6038 build_special_member_call (tree instance
, tree name
, VEC(tree
,gc
) **args
,
6039 tree binfo
, int flags
, tsubst_flags_t complain
)
6042 /* The type of the subobject to be constructed or destroyed. */
6044 VEC(tree
,gc
) *allocated
= NULL
;
6047 gcc_assert (name
== complete_ctor_identifier
6048 || name
== base_ctor_identifier
6049 || name
== complete_dtor_identifier
6050 || name
== base_dtor_identifier
6051 || name
== deleting_dtor_identifier
6052 || name
== ansi_assopname (NOP_EXPR
));
6055 /* Resolve the name. */
6056 if (!complete_type_or_else (binfo
, NULL_TREE
))
6057 return error_mark_node
;
6059 binfo
= TYPE_BINFO (binfo
);
6062 gcc_assert (binfo
!= NULL_TREE
);
6064 class_type
= BINFO_TYPE (binfo
);
6066 /* Handle the special case where INSTANCE is NULL_TREE. */
6067 if (name
== complete_ctor_identifier
&& !instance
)
6069 instance
= build_int_cst (build_pointer_type (class_type
), 0);
6070 instance
= build1 (INDIRECT_REF
, class_type
, instance
);
6074 if (name
== complete_dtor_identifier
6075 || name
== base_dtor_identifier
6076 || name
== deleting_dtor_identifier
)
6077 gcc_assert (args
== NULL
|| VEC_empty (tree
, *args
));
6079 /* Convert to the base class, if necessary. */
6080 if (!same_type_ignoring_top_level_qualifiers_p
6081 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
6083 if (name
!= ansi_assopname (NOP_EXPR
))
6084 /* For constructors and destructors, either the base is
6085 non-virtual, or it is virtual but we are doing the
6086 conversion from a constructor or destructor for the
6087 complete object. In either case, we can convert
6089 instance
= convert_to_base_statically (instance
, binfo
);
6091 /* However, for assignment operators, we must convert
6092 dynamically if the base is virtual. */
6093 instance
= build_base_path (PLUS_EXPR
, instance
,
6094 binfo
, /*nonnull=*/1);
6098 gcc_assert (instance
!= NULL_TREE
);
6100 fns
= lookup_fnfields (binfo
, name
, 1);
6102 /* When making a call to a constructor or destructor for a subobject
6103 that uses virtual base classes, pass down a pointer to a VTT for
6105 if ((name
== base_ctor_identifier
6106 || name
== base_dtor_identifier
)
6107 && CLASSTYPE_VBASECLASSES (class_type
))
6112 /* If the current function is a complete object constructor
6113 or destructor, then we fetch the VTT directly.
6114 Otherwise, we look it up using the VTT we were given. */
6115 vtt
= TREE_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
6116 vtt
= decay_conversion (vtt
);
6117 vtt
= build3 (COND_EXPR
, TREE_TYPE (vtt
),
6118 build2 (EQ_EXPR
, boolean_type_node
,
6119 current_in_charge_parm
, integer_zero_node
),
6122 gcc_assert (BINFO_SUBVTT_INDEX (binfo
));
6123 sub_vtt
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (vtt
), vtt
,
6124 BINFO_SUBVTT_INDEX (binfo
));
6128 allocated
= make_tree_vector ();
6132 VEC_safe_insert (tree
, gc
, *args
, 0, sub_vtt
);
6135 ret
= build_new_method_call (instance
, fns
, args
,
6136 TYPE_BINFO (BINFO_TYPE (binfo
)),
6140 if (allocated
!= NULL
)
6141 release_tree_vector (allocated
);
6146 /* Return the NAME, as a C string. The NAME indicates a function that
6147 is a member of TYPE. *FREE_P is set to true if the caller must
6148 free the memory returned.
6150 Rather than go through all of this, we should simply set the names
6151 of constructors and destructors appropriately, and dispense with
6152 ctor_identifier, dtor_identifier, etc. */
6155 name_as_c_string (tree name
, tree type
, bool *free_p
)
6159 /* Assume that we will not allocate memory. */
6161 /* Constructors and destructors are special. */
6162 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
6165 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
))));
6166 /* For a destructor, add the '~'. */
6167 if (name
== complete_dtor_identifier
6168 || name
== base_dtor_identifier
6169 || name
== deleting_dtor_identifier
)
6171 pretty_name
= concat ("~", pretty_name
, NULL
);
6172 /* Remember that we need to free the memory allocated. */
6176 else if (IDENTIFIER_TYPENAME_P (name
))
6178 pretty_name
= concat ("operator ",
6179 type_as_string_translate (TREE_TYPE (name
),
6180 TFF_PLAIN_IDENTIFIER
),
6182 /* Remember that we need to free the memory allocated. */
6186 pretty_name
= CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name
)));
6191 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
6192 be set, upon return, to the function called. ARGS may be NULL.
6193 This may change ARGS. */
6196 build_new_method_call (tree instance
, tree fns
, VEC(tree
,gc
) **args
,
6197 tree conversion_path
, int flags
,
6198 tree
*fn_p
, tsubst_flags_t complain
)
6200 struct z_candidate
*candidates
= 0, *cand
;
6201 tree explicit_targs
= NULL_TREE
;
6202 tree basetype
= NULL_TREE
;
6205 tree first_mem_arg
= NULL_TREE
;
6208 bool skip_first_for_error
;
6209 VEC(tree
,gc
) *user_args
;
6212 int template_only
= 0;
6216 VEC(tree
,gc
) *orig_args
= NULL
;
6218 tree list
= NULL_TREE
;
6221 gcc_assert (instance
!= NULL_TREE
);
6223 /* We don't know what function we're going to call, yet. */
6227 if (error_operand_p (instance
)
6228 || !fns
|| error_operand_p (fns
))
6229 return error_mark_node
;
6231 if (!BASELINK_P (fns
))
6233 if (complain
& tf_error
)
6234 error ("call to non-function %qD", fns
);
6235 return error_mark_node
;
6238 orig_instance
= instance
;
6241 /* Dismantle the baselink to collect all the information we need. */
6242 if (!conversion_path
)
6243 conversion_path
= BASELINK_BINFO (fns
);
6244 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
6245 optype
= BASELINK_OPTYPE (fns
);
6246 fns
= BASELINK_FUNCTIONS (fns
);
6247 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
6249 explicit_targs
= TREE_OPERAND (fns
, 1);
6250 fns
= TREE_OPERAND (fns
, 0);
6253 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
6254 || TREE_CODE (fns
) == TEMPLATE_DECL
6255 || TREE_CODE (fns
) == OVERLOAD
);
6256 fn
= get_first_fn (fns
);
6257 name
= DECL_NAME (fn
);
6259 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
6260 gcc_assert (CLASS_TYPE_P (basetype
));
6262 if (processing_template_decl
)
6264 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
6265 instance
= build_non_dependent_expr (instance
);
6267 make_args_non_dependent (*args
);
6270 user_args
= args
== NULL
? NULL
: *args
;
6271 /* Under DR 147 A::A() is an invalid constructor call,
6272 not a functional cast. */
6273 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
6275 if (! (complain
& tf_error
))
6276 return error_mark_node
;
6278 permerror (input_location
,
6279 "cannot call constructor %<%T::%D%> directly",
6281 permerror (input_location
, " for a function-style cast, remove the "
6282 "redundant %<::%D%>", name
);
6283 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
6288 /* Figure out whether to skip the first argument for the error
6289 message we will display to users if an error occurs. We don't
6290 want to display any compiler-generated arguments. The "this"
6291 pointer hasn't been added yet. However, we must remove the VTT
6292 pointer if this is a call to a base-class constructor or
6294 skip_first_for_error
= false;
6295 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
6297 /* Callers should explicitly indicate whether they want to construct
6298 the complete object or just the part without virtual bases. */
6299 gcc_assert (name
!= ctor_identifier
);
6300 /* Similarly for destructors. */
6301 gcc_assert (name
!= dtor_identifier
);
6302 /* Remove the VTT pointer, if present. */
6303 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
6304 && CLASSTYPE_VBASECLASSES (basetype
))
6305 skip_first_for_error
= true;
6308 /* Process the argument list. */
6309 if (args
!= NULL
&& *args
!= NULL
)
6311 *args
= resolve_args (*args
);
6313 return error_mark_node
;
6316 instance_ptr
= build_this (instance
);
6318 /* It's OK to call destructors and constructors on cv-qualified objects.
6319 Therefore, convert the INSTANCE_PTR to the unqualified type, if
6321 if (DECL_DESTRUCTOR_P (fn
)
6322 || DECL_CONSTRUCTOR_P (fn
))
6324 tree type
= build_pointer_type (basetype
);
6325 if (!same_type_p (type
, TREE_TYPE (instance_ptr
)))
6326 instance_ptr
= build_nop (type
, instance_ptr
);
6328 if (DECL_DESTRUCTOR_P (fn
))
6329 name
= complete_dtor_identifier
;
6331 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
6332 initializer, not T({ }). If the type doesn't have a list ctor (or no
6333 viable list ctor), break apart the list into separate ctor args. */
6335 if (DECL_CONSTRUCTOR_P (fn
) && args
!= NULL
&& !VEC_empty (tree
, *args
)
6336 && BRACE_ENCLOSED_INITIALIZER_P (VEC_index (tree
, *args
, 0))
6337 && CONSTRUCTOR_IS_DIRECT_INIT (VEC_index (tree
, *args
, 0)))
6339 gcc_assert (VEC_length (tree
, *args
) == 1);
6340 list
= VEC_index (tree
, *args
, 0);
6342 if (TYPE_HAS_LIST_CTOR (basetype
))
6343 flags
|= LOOKUP_LIST_ONLY
;
6348 first_mem_arg
= instance_ptr
;
6350 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6351 p
= conversion_obstack_alloc (0);
6353 any_viable_p
= false;
6356 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
6357 explicit_targs
, template_only
, conversion_path
,
6358 access_binfo
, flags
, &candidates
);
6359 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
6362 if (!any_viable_p
&& list
)
6364 VEC(tree
,gc
) *list_args
= ctor_to_vec (list
);
6365 flags
&= ~LOOKUP_LIST_ONLY
;
6366 add_candidates (fns
, first_mem_arg
, list_args
, optype
,
6367 explicit_targs
, template_only
, conversion_path
,
6368 access_binfo
, flags
, &candidates
);
6369 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
6374 if (complain
& tf_error
)
6376 if (!COMPLETE_TYPE_P (basetype
))
6377 cxx_incomplete_type_error (instance_ptr
, basetype
);
6379 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
6380 basetype
, optype
, build_tree_list_vec (user_args
),
6381 TREE_TYPE (TREE_TYPE (instance_ptr
)));
6388 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
6389 arglist
= build_tree_list_vec (user_args
);
6390 if (skip_first_for_error
)
6391 arglist
= TREE_CHAIN (arglist
);
6392 error ("no matching function for call to %<%T::%s(%A)%#V%>",
6393 basetype
, pretty_name
, arglist
,
6394 TREE_TYPE (TREE_TYPE (instance_ptr
)));
6398 print_z_candidates (candidates
);
6400 call
= error_mark_node
;
6404 cand
= tourney (candidates
);
6411 if (complain
& tf_error
)
6413 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
6414 arglist
= build_tree_list_vec (user_args
);
6415 if (skip_first_for_error
)
6416 arglist
= TREE_CHAIN (arglist
);
6417 error ("call of overloaded %<%s(%A)%> is ambiguous", pretty_name
,
6419 print_z_candidates (candidates
);
6423 call
= error_mark_node
;
6429 if (!(flags
& LOOKUP_NONVIRTUAL
)
6430 && DECL_PURE_VIRTUAL_P (fn
)
6431 && instance
== current_class_ref
6432 && (DECL_CONSTRUCTOR_P (current_function_decl
)
6433 || DECL_DESTRUCTOR_P (current_function_decl
))
6434 && (complain
& tf_warning
))
6435 /* This is not an error, it is runtime undefined
6437 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
) ?
6438 "abstract virtual %q#D called from constructor"
6439 : "abstract virtual %q#D called from destructor"),
6442 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
6443 && is_dummy_object (instance_ptr
))
6445 if (complain
& tf_error
)
6446 error ("cannot call member function %qD without object",
6448 call
= error_mark_node
;
6452 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
6453 && resolves_to_fixed_type_p (instance
, 0))
6454 flags
|= LOOKUP_NONVIRTUAL
;
6455 /* Now we know what function is being called. */
6458 /* Build the actual CALL_EXPR. */
6459 call
= build_over_call (cand
, flags
, complain
);
6460 /* In an expression of the form `a->f()' where `f' turns
6461 out to be a static member function, `a' is
6462 none-the-less evaluated. */
6463 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
6464 && !is_dummy_object (instance_ptr
)
6465 && TREE_SIDE_EFFECTS (instance_ptr
))
6466 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
),
6467 instance_ptr
, call
);
6468 else if (call
!= error_mark_node
6469 && DECL_DESTRUCTOR_P (cand
->fn
)
6470 && !VOID_TYPE_P (TREE_TYPE (call
)))
6471 /* An explicit call of the form "x->~X()" has type
6472 "void". However, on platforms where destructors
6473 return "this" (i.e., those where
6474 targetm.cxx.cdtor_returns_this is true), such calls
6475 will appear to have a return value of pointer type
6476 to the low-level call machinery. We do not want to
6477 change the low-level machinery, since we want to be
6478 able to optimize "delete f()" on such platforms as
6479 "operator delete(~X(f()))" (rather than generating
6480 "t = f(), ~X(t), operator delete (t)"). */
6481 call
= build_nop (void_type_node
, call
);
6486 if (processing_template_decl
&& call
!= error_mark_node
)
6488 bool cast_to_void
= false;
6490 if (TREE_CODE (call
) == COMPOUND_EXPR
)
6491 call
= TREE_OPERAND (call
, 1);
6492 else if (TREE_CODE (call
) == NOP_EXPR
)
6494 cast_to_void
= true;
6495 call
= TREE_OPERAND (call
, 0);
6497 if (TREE_CODE (call
) == INDIRECT_REF
)
6498 call
= TREE_OPERAND (call
, 0);
6499 call
= (build_min_non_dep_call_vec
6501 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
6502 orig_instance
, orig_fns
, NULL_TREE
),
6504 call
= convert_from_reference (call
);
6506 call
= build_nop (void_type_node
, call
);
6509 /* Free all the conversions we allocated. */
6510 obstack_free (&conversion_obstack
, p
);
6512 if (orig_args
!= NULL
)
6513 release_tree_vector (orig_args
);
6518 /* Returns true iff standard conversion sequence ICS1 is a proper
6519 subsequence of ICS2. */
6522 is_subseq (conversion
*ics1
, conversion
*ics2
)
6524 /* We can assume that a conversion of the same code
6525 between the same types indicates a subsequence since we only get
6526 here if the types we are converting from are the same. */
6528 while (ics1
->kind
== ck_rvalue
6529 || ics1
->kind
== ck_lvalue
)
6530 ics1
= ics1
->u
.next
;
6534 while (ics2
->kind
== ck_rvalue
6535 || ics2
->kind
== ck_lvalue
)
6536 ics2
= ics2
->u
.next
;
6538 if (ics2
->kind
== ck_user
6539 || ics2
->kind
== ck_ambig
6540 || ics2
->kind
== ck_identity
)
6541 /* At this point, ICS1 cannot be a proper subsequence of
6542 ICS2. We can get a USER_CONV when we are comparing the
6543 second standard conversion sequence of two user conversion
6547 ics2
= ics2
->u
.next
;
6549 if (ics2
->kind
== ics1
->kind
6550 && same_type_p (ics2
->type
, ics1
->type
)
6551 && same_type_p (ics2
->u
.next
->type
,
6552 ics1
->u
.next
->type
))
6557 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
6558 be any _TYPE nodes. */
6561 is_properly_derived_from (tree derived
, tree base
)
6563 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
6566 /* We only allow proper derivation here. The DERIVED_FROM_P macro
6567 considers every class derived from itself. */
6568 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
6569 && DERIVED_FROM_P (base
, derived
));
6572 /* We build the ICS for an implicit object parameter as a pointer
6573 conversion sequence. However, such a sequence should be compared
6574 as if it were a reference conversion sequence. If ICS is the
6575 implicit conversion sequence for an implicit object parameter,
6576 modify it accordingly. */
6579 maybe_handle_implicit_object (conversion
**ics
)
6583 /* [over.match.funcs]
6585 For non-static member functions, the type of the
6586 implicit object parameter is "reference to cv X"
6587 where X is the class of which the function is a
6588 member and cv is the cv-qualification on the member
6589 function declaration. */
6590 conversion
*t
= *ics
;
6591 tree reference_type
;
6593 /* The `this' parameter is a pointer to a class type. Make the
6594 implicit conversion talk about a reference to that same class
6596 reference_type
= TREE_TYPE (t
->type
);
6597 reference_type
= build_reference_type (reference_type
);
6599 if (t
->kind
== ck_qual
)
6601 if (t
->kind
== ck_ptr
)
6603 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
6604 t
= direct_reference_binding (reference_type
, t
);
6606 t
->rvaluedness_matches_p
= 0;
6611 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
6612 and return the initial reference binding conversion. Otherwise,
6613 leave *ICS unchanged and return NULL. */
6616 maybe_handle_ref_bind (conversion
**ics
)
6618 if ((*ics
)->kind
== ck_ref_bind
)
6620 conversion
*old_ics
= *ics
;
6621 *ics
= old_ics
->u
.next
;
6622 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
6629 /* Compare two implicit conversion sequences according to the rules set out in
6630 [over.ics.rank]. Return values:
6632 1: ics1 is better than ics2
6633 -1: ics2 is better than ics1
6634 0: ics1 and ics2 are indistinguishable */
6637 compare_ics (conversion
*ics1
, conversion
*ics2
)
6643 tree deref_from_type1
= NULL_TREE
;
6644 tree deref_from_type2
= NULL_TREE
;
6645 tree deref_to_type1
= NULL_TREE
;
6646 tree deref_to_type2
= NULL_TREE
;
6647 conversion_rank rank1
, rank2
;
6649 /* REF_BINDING is nonzero if the result of the conversion sequence
6650 is a reference type. In that case REF_CONV is the reference
6651 binding conversion. */
6652 conversion
*ref_conv1
;
6653 conversion
*ref_conv2
;
6655 /* Handle implicit object parameters. */
6656 maybe_handle_implicit_object (&ics1
);
6657 maybe_handle_implicit_object (&ics2
);
6659 /* Handle reference parameters. */
6660 ref_conv1
= maybe_handle_ref_bind (&ics1
);
6661 ref_conv2
= maybe_handle_ref_bind (&ics2
);
6663 /* List-initialization sequence L1 is a better conversion sequence than
6664 list-initialization sequence L2 if L1 converts to
6665 std::initializer_list<X> for some X and L2 does not. */
6666 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
6668 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
6673 When comparing the basic forms of implicit conversion sequences (as
6674 defined in _over.best.ics_)
6676 --a standard conversion sequence (_over.ics.scs_) is a better
6677 conversion sequence than a user-defined conversion sequence
6678 or an ellipsis conversion sequence, and
6680 --a user-defined conversion sequence (_over.ics.user_) is a
6681 better conversion sequence than an ellipsis conversion sequence
6682 (_over.ics.ellipsis_). */
6683 rank1
= CONVERSION_RANK (ics1
);
6684 rank2
= CONVERSION_RANK (ics2
);
6688 else if (rank1
< rank2
)
6691 if (rank1
== cr_bad
)
6693 /* XXX Isn't this an extension? */
6694 /* Both ICS are bad. We try to make a decision based on what
6695 would have happened if they'd been good. */
6696 if (ics1
->user_conv_p
> ics2
->user_conv_p
6697 || ics1
->rank
> ics2
->rank
)
6699 else if (ics1
->user_conv_p
< ics2
->user_conv_p
6700 || ics1
->rank
< ics2
->rank
)
6703 /* We couldn't make up our minds; try to figure it out below. */
6706 if (ics1
->ellipsis_p
|| ics1
->kind
== ck_list
)
6707 /* Both conversions are ellipsis conversions or both are building a
6708 std::initializer_list. */
6711 /* User-defined conversion sequence U1 is a better conversion sequence
6712 than another user-defined conversion sequence U2 if they contain the
6713 same user-defined conversion operator or constructor and if the sec-
6714 ond standard conversion sequence of U1 is better than the second
6715 standard conversion sequence of U2. */
6717 if (ics1
->user_conv_p
)
6722 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= t1
->u
.next
)
6723 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
)
6725 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= t2
->u
.next
)
6726 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
)
6729 if (t1
->cand
->fn
!= t2
->cand
->fn
)
6732 /* We can just fall through here, after setting up
6733 FROM_TYPE1 and FROM_TYPE2. */
6734 from_type1
= t1
->type
;
6735 from_type2
= t2
->type
;
6742 /* We're dealing with two standard conversion sequences.
6746 Standard conversion sequence S1 is a better conversion
6747 sequence than standard conversion sequence S2 if
6749 --S1 is a proper subsequence of S2 (comparing the conversion
6750 sequences in the canonical form defined by _over.ics.scs_,
6751 excluding any Lvalue Transformation; the identity
6752 conversion sequence is considered to be a subsequence of
6753 any non-identity conversion sequence */
6756 while (t1
->kind
!= ck_identity
)
6758 from_type1
= t1
->type
;
6761 while (t2
->kind
!= ck_identity
)
6763 from_type2
= t2
->type
;
6766 /* One sequence can only be a subsequence of the other if they start with
6767 the same type. They can start with different types when comparing the
6768 second standard conversion sequence in two user-defined conversion
6770 if (same_type_p (from_type1
, from_type2
))
6772 if (is_subseq (ics1
, ics2
))
6774 if (is_subseq (ics2
, ics1
))
6782 --the rank of S1 is better than the rank of S2 (by the rules
6785 Standard conversion sequences are ordered by their ranks: an Exact
6786 Match is a better conversion than a Promotion, which is a better
6787 conversion than a Conversion.
6789 Two conversion sequences with the same rank are indistinguishable
6790 unless one of the following rules applies:
6792 --A conversion that does not a convert a pointer, pointer to member,
6793 or std::nullptr_t to bool is better than one that does.
6795 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
6796 so that we do not have to check it explicitly. */
6797 if (ics1
->rank
< ics2
->rank
)
6799 else if (ics2
->rank
< ics1
->rank
)
6802 to_type1
= ics1
->type
;
6803 to_type2
= ics2
->type
;
6805 /* A conversion from scalar arithmetic type to complex is worse than a
6806 conversion between scalar arithmetic types. */
6807 if (same_type_p (from_type1
, from_type2
)
6808 && ARITHMETIC_TYPE_P (from_type1
)
6809 && ARITHMETIC_TYPE_P (to_type1
)
6810 && ARITHMETIC_TYPE_P (to_type2
)
6811 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
6812 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
6814 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
6820 if (TYPE_PTR_P (from_type1
)
6821 && TYPE_PTR_P (from_type2
)
6822 && TYPE_PTR_P (to_type1
)
6823 && TYPE_PTR_P (to_type2
))
6825 deref_from_type1
= TREE_TYPE (from_type1
);
6826 deref_from_type2
= TREE_TYPE (from_type2
);
6827 deref_to_type1
= TREE_TYPE (to_type1
);
6828 deref_to_type2
= TREE_TYPE (to_type2
);
6830 /* The rules for pointers to members A::* are just like the rules
6831 for pointers A*, except opposite: if B is derived from A then
6832 A::* converts to B::*, not vice versa. For that reason, we
6833 switch the from_ and to_ variables here. */
6834 else if ((TYPE_PTRMEM_P (from_type1
) && TYPE_PTRMEM_P (from_type2
)
6835 && TYPE_PTRMEM_P (to_type1
) && TYPE_PTRMEM_P (to_type2
))
6836 || (TYPE_PTRMEMFUNC_P (from_type1
)
6837 && TYPE_PTRMEMFUNC_P (from_type2
)
6838 && TYPE_PTRMEMFUNC_P (to_type1
)
6839 && TYPE_PTRMEMFUNC_P (to_type2
)))
6841 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
6842 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
6843 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
6844 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
6847 if (deref_from_type1
!= NULL_TREE
6848 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
6849 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
6851 /* This was one of the pointer or pointer-like conversions.
6855 --If class B is derived directly or indirectly from class A,
6856 conversion of B* to A* is better than conversion of B* to
6857 void*, and conversion of A* to void* is better than
6858 conversion of B* to void*. */
6859 if (TREE_CODE (deref_to_type1
) == VOID_TYPE
6860 && TREE_CODE (deref_to_type2
) == VOID_TYPE
)
6862 if (is_properly_derived_from (deref_from_type1
,
6865 else if (is_properly_derived_from (deref_from_type2
,
6869 else if (TREE_CODE (deref_to_type1
) == VOID_TYPE
6870 || TREE_CODE (deref_to_type2
) == VOID_TYPE
)
6872 if (same_type_p (deref_from_type1
, deref_from_type2
))
6874 if (TREE_CODE (deref_to_type2
) == VOID_TYPE
)
6876 if (is_properly_derived_from (deref_from_type1
,
6880 /* We know that DEREF_TO_TYPE1 is `void' here. */
6881 else if (is_properly_derived_from (deref_from_type1
,
6886 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
6887 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
6891 --If class B is derived directly or indirectly from class A
6892 and class C is derived directly or indirectly from B,
6894 --conversion of C* to B* is better than conversion of C* to
6897 --conversion of B* to A* is better than conversion of C* to
6899 if (same_type_p (deref_from_type1
, deref_from_type2
))
6901 if (is_properly_derived_from (deref_to_type1
,
6904 else if (is_properly_derived_from (deref_to_type2
,
6908 else if (same_type_p (deref_to_type1
, deref_to_type2
))
6910 if (is_properly_derived_from (deref_from_type2
,
6913 else if (is_properly_derived_from (deref_from_type1
,
6919 else if (CLASS_TYPE_P (non_reference (from_type1
))
6920 && same_type_p (from_type1
, from_type2
))
6922 tree from
= non_reference (from_type1
);
6926 --binding of an expression of type C to a reference of type
6927 B& is better than binding an expression of type C to a
6928 reference of type A&
6930 --conversion of C to B is better than conversion of C to A, */
6931 if (is_properly_derived_from (from
, to_type1
)
6932 && is_properly_derived_from (from
, to_type2
))
6934 if (is_properly_derived_from (to_type1
, to_type2
))
6936 else if (is_properly_derived_from (to_type2
, to_type1
))
6940 else if (CLASS_TYPE_P (non_reference (to_type1
))
6941 && same_type_p (to_type1
, to_type2
))
6943 tree to
= non_reference (to_type1
);
6947 --binding of an expression of type B to a reference of type
6948 A& is better than binding an expression of type C to a
6949 reference of type A&,
6951 --conversion of B to A is better than conversion of C to A */
6952 if (is_properly_derived_from (from_type1
, to
)
6953 && is_properly_derived_from (from_type2
, to
))
6955 if (is_properly_derived_from (from_type2
, from_type1
))
6957 else if (is_properly_derived_from (from_type1
, from_type2
))
6964 --S1 and S2 differ only in their qualification conversion and yield
6965 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
6966 qualification signature of type T1 is a proper subset of the cv-
6967 qualification signature of type T2 */
6968 if (ics1
->kind
== ck_qual
6969 && ics2
->kind
== ck_qual
6970 && same_type_p (from_type1
, from_type2
))
6972 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
6979 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
6980 to an implicit object parameter, and either S1 binds an lvalue reference
6981 to an lvalue and S2 binds an rvalue reference or S1 binds an rvalue
6982 reference to an rvalue and S2 binds an lvalue reference
6983 (C++0x draft standard, 13.3.3.2)
6985 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
6986 types to which the references refer are the same type except for
6987 top-level cv-qualifiers, and the type to which the reference
6988 initialized by S2 refers is more cv-qualified than the type to
6989 which the reference initialized by S1 refers */
6991 if (ref_conv1
&& ref_conv2
)
6993 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
6994 && (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
6995 != TYPE_REF_IS_RVALUE (ref_conv2
->type
)))
6997 if (ref_conv1
->rvaluedness_matches_p
)
6999 if (ref_conv2
->rvaluedness_matches_p
)
7003 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
7004 return comp_cv_qualification (TREE_TYPE (ref_conv2
->type
),
7005 TREE_TYPE (ref_conv1
->type
));
7008 /* Neither conversion sequence is better than the other. */
7012 /* The source type for this standard conversion sequence. */
7015 source_type (conversion
*t
)
7017 for (;; t
= t
->u
.next
)
7019 if (t
->kind
== ck_user
7020 || t
->kind
== ck_ambig
7021 || t
->kind
== ck_identity
)
7027 /* Note a warning about preferring WINNER to LOSER. We do this by storing
7028 a pointer to LOSER and re-running joust to produce the warning if WINNER
7029 is actually used. */
7032 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
7034 candidate_warning
*cw
= (candidate_warning
*)
7035 conversion_obstack_alloc (sizeof (candidate_warning
));
7037 cw
->next
= winner
->warnings
;
7038 winner
->warnings
= cw
;
7041 /* Compare two candidates for overloading as described in
7042 [over.match.best]. Return values:
7044 1: cand1 is better than cand2
7045 -1: cand2 is better than cand1
7046 0: cand1 and cand2 are indistinguishable */
7049 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
)
7052 int off1
= 0, off2
= 0;
7056 /* Candidates that involve bad conversions are always worse than those
7058 if (cand1
->viable
> cand2
->viable
)
7060 if (cand1
->viable
< cand2
->viable
)
7063 /* If we have two pseudo-candidates for conversions to the same type,
7064 or two candidates for the same function, arbitrarily pick one. */
7065 if (cand1
->fn
== cand2
->fn
7066 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
7069 /* a viable function F1
7070 is defined to be a better function than another viable function F2 if
7071 for all arguments i, ICSi(F1) is not a worse conversion sequence than
7072 ICSi(F2), and then */
7074 /* for some argument j, ICSj(F1) is a better conversion sequence than
7077 /* For comparing static and non-static member functions, we ignore
7078 the implicit object parameter of the non-static function. The
7079 standard says to pretend that the static function has an object
7080 parm, but that won't work with operator overloading. */
7081 len
= cand1
->num_convs
;
7082 if (len
!= cand2
->num_convs
)
7084 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
7085 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
7087 gcc_assert (static_1
!= static_2
);
7098 for (i
= 0; i
< len
; ++i
)
7100 conversion
*t1
= cand1
->convs
[i
+ off1
];
7101 conversion
*t2
= cand2
->convs
[i
+ off2
];
7102 int comp
= compare_ics (t1
, t2
);
7107 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
7108 == cr_std
+ cr_promotion
)
7109 && t1
->kind
== ck_std
7110 && t2
->kind
== ck_std
7111 && TREE_CODE (t1
->type
) == INTEGER_TYPE
7112 && TREE_CODE (t2
->type
) == INTEGER_TYPE
7113 && (TYPE_PRECISION (t1
->type
)
7114 == TYPE_PRECISION (t2
->type
))
7115 && (TYPE_UNSIGNED (t1
->u
.next
->type
)
7116 || (TREE_CODE (t1
->u
.next
->type
)
7119 tree type
= t1
->u
.next
->type
;
7121 struct z_candidate
*w
, *l
;
7123 type1
= t1
->type
, type2
= t2
->type
,
7124 w
= cand1
, l
= cand2
;
7126 type1
= t2
->type
, type2
= t1
->type
,
7127 w
= cand2
, l
= cand1
;
7131 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
7132 type
, type1
, type2
);
7133 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
7139 if (winner
&& comp
!= winner
)
7148 /* warn about confusing overload resolution for user-defined conversions,
7149 either between a constructor and a conversion op, or between two
7151 if (winner
&& warn_conversion
&& cand1
->second_conv
7152 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
7153 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
7155 struct z_candidate
*w
, *l
;
7156 bool give_warning
= false;
7159 w
= cand1
, l
= cand2
;
7161 w
= cand2
, l
= cand1
;
7163 /* We don't want to complain about `X::operator T1 ()'
7164 beating `X::operator T2 () const', when T2 is a no less
7165 cv-qualified version of T1. */
7166 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
7167 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
7169 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
7170 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
7172 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
7177 if (!comp_ptr_ttypes (t
, f
))
7178 give_warning
= true;
7181 give_warning
= true;
7187 tree source
= source_type (w
->convs
[0]);
7188 if (! DECL_CONSTRUCTOR_P (w
->fn
))
7189 source
= TREE_TYPE (source
);
7190 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
7191 && warning (OPT_Wconversion
, " for conversion from %qT to %qT",
7192 source
, w
->second_conv
->type
))
7194 inform (input_location
, " because conversion sequence for the argument is better");
7205 F1 is a non-template function and F2 is a template function
7208 if (!cand1
->template_decl
&& cand2
->template_decl
)
7210 else if (cand1
->template_decl
&& !cand2
->template_decl
)
7214 F1 and F2 are template functions and the function template for F1 is
7215 more specialized than the template for F2 according to the partial
7218 if (cand1
->template_decl
&& cand2
->template_decl
)
7220 winner
= more_specialized_fn
7221 (TI_TEMPLATE (cand1
->template_decl
),
7222 TI_TEMPLATE (cand2
->template_decl
),
7223 /* [temp.func.order]: The presence of unused ellipsis and default
7224 arguments has no effect on the partial ordering of function
7225 templates. add_function_candidate() will not have
7226 counted the "this" argument for constructors. */
7227 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
7233 the context is an initialization by user-defined conversion (see
7234 _dcl.init_ and _over.match.user_) and the standard conversion
7235 sequence from the return type of F1 to the destination type (i.e.,
7236 the type of the entity being initialized) is a better conversion
7237 sequence than the standard conversion sequence from the return type
7238 of F2 to the destination type. */
7240 if (cand1
->second_conv
)
7242 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
7247 /* Check whether we can discard a builtin candidate, either because we
7248 have two identical ones or matching builtin and non-builtin candidates.
7250 (Pedantically in the latter case the builtin which matched the user
7251 function should not be added to the overload set, but we spot it here.
7254 ... the builtin candidates include ...
7255 - do not have the same parameter type list as any non-template
7256 non-member candidate. */
7258 if (TREE_CODE (cand1
->fn
) == IDENTIFIER_NODE
7259 || TREE_CODE (cand2
->fn
) == IDENTIFIER_NODE
)
7261 for (i
= 0; i
< len
; ++i
)
7262 if (!same_type_p (cand1
->convs
[i
]->type
,
7263 cand2
->convs
[i
]->type
))
7265 if (i
== cand1
->num_convs
)
7267 if (cand1
->fn
== cand2
->fn
)
7268 /* Two built-in candidates; arbitrarily pick one. */
7270 else if (TREE_CODE (cand1
->fn
) == IDENTIFIER_NODE
)
7271 /* cand1 is built-in; prefer cand2. */
7274 /* cand2 is built-in; prefer cand1. */
7279 /* If the two function declarations represent the same function (this can
7280 happen with declarations in multiple scopes and arg-dependent lookup),
7281 arbitrarily choose one. But first make sure the default args we're
7283 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
7284 && equal_functions (cand1
->fn
, cand2
->fn
))
7286 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
7287 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
7289 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
7291 for (i
= 0; i
< len
; ++i
)
7293 /* Don't crash if the fn is variadic. */
7296 parms1
= TREE_CHAIN (parms1
);
7297 parms2
= TREE_CHAIN (parms2
);
7301 parms1
= TREE_CHAIN (parms1
);
7303 parms2
= TREE_CHAIN (parms2
);
7307 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
7308 TREE_PURPOSE (parms2
)))
7312 permerror (input_location
, "default argument mismatch in "
7313 "overload resolution");
7314 inform (input_location
,
7315 " candidate 1: %q+#F", cand1
->fn
);
7316 inform (input_location
,
7317 " candidate 2: %q+#F", cand2
->fn
);
7320 add_warning (cand1
, cand2
);
7323 parms1
= TREE_CHAIN (parms1
);
7324 parms2
= TREE_CHAIN (parms2
);
7332 /* Extension: If the worst conversion for one candidate is worse than the
7333 worst conversion for the other, take the first. */
7336 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
7337 struct z_candidate
*w
= 0, *l
= 0;
7339 for (i
= 0; i
< len
; ++i
)
7341 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
7342 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
7343 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
7344 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
7347 winner
= 1, w
= cand1
, l
= cand2
;
7349 winner
= -1, w
= cand2
, l
= cand1
;
7354 pedwarn (input_location
, 0,
7355 "ISO C++ says that these are ambiguous, even "
7356 "though the worst conversion for the first is better than "
7357 "the worst conversion for the second:");
7358 print_z_candidate (_("candidate 1:"), w
);
7359 print_z_candidate (_("candidate 2:"), l
);
7367 gcc_assert (!winner
);
7371 /* Given a list of candidates for overloading, find the best one, if any.
7372 This algorithm has a worst case of O(2n) (winner is last), and a best
7373 case of O(n/2) (totally ambiguous); much better than a sorting
7376 static struct z_candidate
*
7377 tourney (struct z_candidate
*candidates
)
7379 struct z_candidate
*champ
= candidates
, *challenger
;
7381 int champ_compared_to_predecessor
= 0;
7383 /* Walk through the list once, comparing each current champ to the next
7384 candidate, knocking out a candidate or two with each comparison. */
7386 for (challenger
= champ
->next
; challenger
; )
7388 fate
= joust (champ
, challenger
, 0);
7390 challenger
= challenger
->next
;
7395 champ
= challenger
->next
;
7398 champ_compared_to_predecessor
= 0;
7403 champ_compared_to_predecessor
= 1;
7406 challenger
= champ
->next
;
7410 /* Make sure the champ is better than all the candidates it hasn't yet
7411 been compared to. */
7413 for (challenger
= candidates
;
7415 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
7416 challenger
= challenger
->next
)
7418 fate
= joust (champ
, challenger
, 0);
7426 /* Returns nonzero if things of type FROM can be converted to TO. */
7429 can_convert (tree to
, tree from
)
7431 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
);
7434 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
7437 can_convert_arg (tree to
, tree from
, tree arg
, int flags
)
7443 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7444 p
= conversion_obstack_alloc (0);
7446 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
7448 ok_p
= (t
&& !t
->bad_p
);
7450 /* Free all the conversions we allocated. */
7451 obstack_free (&conversion_obstack
, p
);
7456 /* Like can_convert_arg, but allows dubious conversions as well. */
7459 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
)
7464 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7465 p
= conversion_obstack_alloc (0);
7466 /* Try to perform the conversion. */
7467 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
7469 /* Free all the conversions we allocated. */
7470 obstack_free (&conversion_obstack
, p
);
7475 /* Convert EXPR to TYPE. Return the converted expression.
7477 Note that we allow bad conversions here because by the time we get to
7478 this point we are committed to doing the conversion. If we end up
7479 doing a bad conversion, convert_like will complain. */
7482 perform_implicit_conversion_flags (tree type
, tree expr
, tsubst_flags_t complain
, int flags
)
7487 if (error_operand_p (expr
))
7488 return error_mark_node
;
7490 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7491 p
= conversion_obstack_alloc (0);
7493 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
7499 if (complain
& tf_error
)
7501 /* If expr has unknown type, then it is an overloaded function.
7502 Call instantiate_type to get good error messages. */
7503 if (TREE_TYPE (expr
) == unknown_type_node
)
7504 instantiate_type (type
, expr
, complain
);
7505 else if (invalid_nonstatic_memfn_p (expr
, complain
))
7506 /* We gave an error. */;
7508 error ("could not convert %qE to %qT", expr
, type
);
7510 expr
= error_mark_node
;
7512 else if (processing_template_decl
)
7514 /* In a template, we are only concerned about determining the
7515 type of non-dependent expressions, so we do not have to
7516 perform the actual conversion. */
7517 if (TREE_TYPE (expr
) != type
)
7518 expr
= build_nop (type
, expr
);
7521 expr
= convert_like (conv
, expr
, complain
);
7523 /* Free all the conversions we allocated. */
7524 obstack_free (&conversion_obstack
, p
);
7530 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
7532 return perform_implicit_conversion_flags (type
, expr
, complain
, LOOKUP_IMPLICIT
);
7535 /* Convert EXPR to TYPE (as a direct-initialization) if that is
7536 permitted. If the conversion is valid, the converted expression is
7537 returned. Otherwise, NULL_TREE is returned, except in the case
7538 that TYPE is a class type; in that case, an error is issued. If
7539 C_CAST_P is true, then this direction initialization is taking
7540 place as part of a static_cast being attempted as part of a C-style
7544 perform_direct_initialization_if_possible (tree type
,
7547 tsubst_flags_t complain
)
7552 if (type
== error_mark_node
|| error_operand_p (expr
))
7553 return error_mark_node
;
7556 If the destination type is a (possibly cv-qualified) class type:
7558 -- If the initialization is direct-initialization ...,
7559 constructors are considered. ... If no constructor applies, or
7560 the overload resolution is ambiguous, the initialization is
7562 if (CLASS_TYPE_P (type
))
7564 VEC(tree
,gc
) *args
= make_tree_vector_single (expr
);
7565 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
7566 &args
, type
, LOOKUP_NORMAL
, complain
);
7567 release_tree_vector (args
);
7568 return build_cplus_new (type
, expr
);
7571 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7572 p
= conversion_obstack_alloc (0);
7574 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
7577 if (!conv
|| conv
->bad_p
)
7580 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0, 0,
7581 /*issue_conversion_warnings=*/false,
7585 /* Free all the conversions we allocated. */
7586 obstack_free (&conversion_obstack
, p
);
7591 /* DECL is a VAR_DECL whose type is a REFERENCE_TYPE. The reference
7592 is being bound to a temporary. Create and return a new VAR_DECL
7593 with the indicated TYPE; this variable will store the value to
7594 which the reference is bound. */
7597 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
7601 /* Create the variable. */
7602 var
= create_temporary_var (type
);
7604 /* Register the variable. */
7605 if (TREE_STATIC (decl
))
7607 /* Namespace-scope or local static; give it a mangled name. */
7610 TREE_STATIC (var
) = 1;
7611 name
= mangle_ref_init_variable (decl
);
7612 DECL_NAME (var
) = name
;
7613 SET_DECL_ASSEMBLER_NAME (var
, name
);
7614 var
= pushdecl_top_level (var
);
7617 /* Create a new cleanup level if necessary. */
7618 maybe_push_cleanup_level (type
);
7623 /* EXPR is the initializer for a variable DECL of reference or
7624 std::initializer_list type. Create, push and return a new VAR_DECL
7625 for the initializer so that it will live as long as DECL. Any
7626 cleanup for the new variable is returned through CLEANUP, and the
7627 code to initialize the new variable is returned through INITP. */
7630 set_up_extended_ref_temp (tree decl
, tree expr
, tree
*cleanup
, tree
*initp
)
7636 /* Create the temporary variable. */
7637 type
= TREE_TYPE (expr
);
7638 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
7639 layout_decl (var
, 0);
7640 /* If the rvalue is the result of a function call it will be
7641 a TARGET_EXPR. If it is some other construct (such as a
7642 member access expression where the underlying object is
7643 itself the result of a function call), turn it into a
7644 TARGET_EXPR here. It is important that EXPR be a
7645 TARGET_EXPR below since otherwise the INIT_EXPR will
7646 attempt to make a bitwise copy of EXPR to initialize
7648 if (TREE_CODE (expr
) != TARGET_EXPR
)
7649 expr
= get_target_expr (expr
);
7650 /* Create the INIT_EXPR that will initialize the temporary
7652 init
= build2 (INIT_EXPR
, type
, var
, expr
);
7653 if (at_function_scope_p ())
7655 add_decl_expr (var
);
7657 if (TREE_STATIC (var
))
7658 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
7660 *cleanup
= cxx_maybe_build_cleanup (var
);
7662 /* We must be careful to destroy the temporary only
7663 after its initialization has taken place. If the
7664 initialization throws an exception, then the
7665 destructor should not be run. We cannot simply
7666 transform INIT into something like:
7668 (INIT, ({ CLEANUP_STMT; }))
7670 because emit_local_var always treats the
7671 initializer as a full-expression. Thus, the
7672 destructor would run too early; it would run at the
7673 end of initializing the reference variable, rather
7674 than at the end of the block enclosing the
7677 The solution is to pass back a cleanup expression
7678 which the caller is responsible for attaching to
7679 the statement tree. */
7683 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
7684 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7685 static_aggregates
= tree_cons (NULL_TREE
, var
,
7693 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
7694 initializing a variable of that TYPE. If DECL is non-NULL, it is
7695 the VAR_DECL being initialized with the EXPR. (In that case, the
7696 type of DECL will be TYPE.) If DECL is non-NULL, then CLEANUP must
7697 also be non-NULL, and with *CLEANUP initialized to NULL. Upon
7698 return, if *CLEANUP is no longer NULL, it will be an expression
7699 that should be pushed as a cleanup after the returned expression
7700 is used to initialize DECL.
7702 Return the converted expression. */
7705 initialize_reference (tree type
, tree expr
, tree decl
, tree
*cleanup
,
7706 tsubst_flags_t complain
)
7711 if (type
== error_mark_node
|| error_operand_p (expr
))
7712 return error_mark_node
;
7714 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7715 p
= conversion_obstack_alloc (0);
7717 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
7719 if (!conv
|| conv
->bad_p
)
7721 if (complain
& tf_error
)
7723 if (!(TYPE_QUALS (TREE_TYPE (type
)) & TYPE_QUAL_CONST
)
7724 && !TYPE_REF_IS_RVALUE (type
)
7725 && !real_lvalue_p (expr
))
7726 error ("invalid initialization of non-const reference of "
7727 "type %qT from an rvalue of type %qT",
7728 type
, TREE_TYPE (expr
));
7730 error ("invalid initialization of reference of type "
7731 "%qT from expression of type %qT", type
,
7734 return error_mark_node
;
7737 /* If DECL is non-NULL, then this special rule applies:
7741 The temporary to which the reference is bound or the temporary
7742 that is the complete object to which the reference is bound
7743 persists for the lifetime of the reference.
7745 The temporaries created during the evaluation of the expression
7746 initializing the reference, except the temporary to which the
7747 reference is bound, are destroyed at the end of the
7748 full-expression in which they are created.
7750 In that case, we store the converted expression into a new
7751 VAR_DECL in a new scope.
7753 However, we want to be careful not to create temporaries when
7754 they are not required. For example, given:
7757 struct D : public B {};
7761 there is no need to copy the return value from "f"; we can just
7762 extend its lifetime. Similarly, given:
7765 struct T { operator S(); };
7769 we can extend the lifetime of the return value of the conversion
7771 gcc_assert (conv
->kind
== ck_ref_bind
);
7775 tree base_conv_type
;
7777 /* Skip over the REF_BIND. */
7778 conv
= conv
->u
.next
;
7779 /* If the next conversion is a BASE_CONV, skip that too -- but
7780 remember that the conversion was required. */
7781 if (conv
->kind
== ck_base
)
7783 base_conv_type
= conv
->type
;
7784 conv
= conv
->u
.next
;
7787 base_conv_type
= NULL_TREE
;
7788 /* Perform the remainder of the conversion. */
7789 expr
= convert_like_real (conv
, expr
,
7790 /*fn=*/NULL_TREE
, /*argnum=*/0,
7792 /*issue_conversion_warnings=*/true,
7794 tf_warning_or_error
);
7795 if (error_operand_p (expr
))
7796 expr
= error_mark_node
;
7799 if (!lvalue_or_rvalue_with_address_p (expr
))
7802 var
= set_up_extended_ref_temp (decl
, expr
, cleanup
, &init
);
7803 /* Use its address to initialize the reference variable. */
7804 expr
= build_address (var
);
7806 expr
= convert_to_base (expr
,
7807 build_pointer_type (base_conv_type
),
7808 /*check_access=*/true,
7809 /*nonnull=*/true, complain
);
7810 expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr
), init
, expr
);
7813 /* Take the address of EXPR. */
7814 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, tf_warning_or_error
);
7815 /* If a BASE_CONV was required, perform it now. */
7817 expr
= (perform_implicit_conversion
7818 (build_pointer_type (base_conv_type
), expr
,
7819 tf_warning_or_error
));
7820 expr
= build_nop (type
, expr
);
7824 /* Perform the conversion. */
7825 expr
= convert_like (conv
, expr
, tf_warning_or_error
);
7827 /* Free all the conversions we allocated. */
7828 obstack_free (&conversion_obstack
, p
);
7833 /* Returns true iff TYPE is some variant of std::initializer_list. */
7836 is_std_init_list (tree type
)
7838 return (CLASS_TYPE_P (type
)
7839 && CP_TYPE_CONTEXT (type
) == std_node
7840 && strcmp (TYPE_NAME_STRING (type
), "initializer_list") == 0);
7843 /* Returns true iff DECL is a list constructor: i.e. a constructor which
7844 will accept an argument list of a single std::initializer_list<T>. */
7847 is_list_ctor (tree decl
)
7849 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
7852 if (!args
|| args
== void_list_node
)
7855 arg
= non_reference (TREE_VALUE (args
));
7856 if (!is_std_init_list (arg
))
7859 args
= TREE_CHAIN (args
);
7861 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
7862 /* There are more non-defaulted parms. */
7868 #include "gt-cp-call.h"