1 /* Functions related to invoking methods and overloaded functions.
2 Copyright (C) 1987, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
5 Contributed by Michael Tiemann (tiemann@cygnus.com) and
6 modified by Brendan Kehoe (brendan@cygnus.com).
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 3, or (at your option)
15 GCC is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
25 /* High-level class interface. */
29 #include "coretypes.h"
36 #include "diagnostic-core.h"
40 #include "langhooks.h"
42 /* The various kinds of conversion. */
44 typedef enum conversion_kind
{
60 /* The rank of the conversion. Order of the enumerals matters; better
61 conversions should come earlier in the list. */
63 typedef enum conversion_rank
{
74 /* An implicit conversion sequence, in the sense of [over.best.ics].
75 The first conversion to be performed is at the end of the chain.
76 That conversion is always a cr_identity conversion. */
78 typedef struct conversion conversion
;
80 /* The kind of conversion represented by this step. */
82 /* The rank of this conversion. */
84 BOOL_BITFIELD user_conv_p
: 1;
85 BOOL_BITFIELD ellipsis_p
: 1;
86 BOOL_BITFIELD this_p
: 1;
87 BOOL_BITFIELD bad_p
: 1;
88 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
89 temporary should be created to hold the result of the
91 BOOL_BITFIELD need_temporary_p
: 1;
92 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
93 from a pointer-to-derived to pointer-to-base is being performed. */
94 BOOL_BITFIELD base_p
: 1;
95 /* If KIND is ck_ref_bind, true when either an lvalue reference is
96 being bound to an lvalue expression or an rvalue reference is
97 being bound to an rvalue expression. */
98 BOOL_BITFIELD rvaluedness_matches_p
: 1;
99 BOOL_BITFIELD check_narrowing
: 1;
100 /* The type of the expression resulting from the conversion. */
103 /* The next conversion in the chain. Since the conversions are
104 arranged from outermost to innermost, the NEXT conversion will
105 actually be performed before this conversion. This variant is
106 used only when KIND is neither ck_identity nor ck_ambig. */
108 /* The expression at the beginning of the conversion chain. This
109 variant is used only if KIND is ck_identity or ck_ambig. */
111 /* The array of conversions for an initializer_list. */
114 /* The function candidate corresponding to this conversion
115 sequence. This field is only used if KIND is ck_user. */
116 struct z_candidate
*cand
;
119 #define CONVERSION_RANK(NODE) \
120 ((NODE)->bad_p ? cr_bad \
121 : (NODE)->ellipsis_p ? cr_ellipsis \
122 : (NODE)->user_conv_p ? cr_user \
125 #define BAD_CONVERSION_RANK(NODE) \
126 ((NODE)->ellipsis_p ? cr_ellipsis \
127 : (NODE)->user_conv_p ? cr_user \
130 static struct obstack conversion_obstack
;
131 static bool conversion_obstack_initialized
;
133 static struct z_candidate
* tourney (struct z_candidate
*);
134 static int equal_functions (tree
, tree
);
135 static int joust (struct z_candidate
*, struct z_candidate
*, bool);
136 static int compare_ics (conversion
*, conversion
*);
137 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
138 static tree
build_java_interface_fn_ref (tree
, tree
);
139 #define convert_like(CONV, EXPR, COMPLAIN) \
140 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
141 /*issue_conversion_warnings=*/true, \
142 /*c_cast_p=*/false, (COMPLAIN))
143 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
144 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
145 /*issue_conversion_warnings=*/true, \
146 /*c_cast_p=*/false, (COMPLAIN))
147 static tree
convert_like_real (conversion
*, tree
, tree
, int, int, bool,
148 bool, tsubst_flags_t
);
149 static void op_error (enum tree_code
, enum tree_code
, tree
, tree
,
151 static VEC(tree
,gc
) *resolve_args (VEC(tree
,gc
) *);
152 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int);
153 static void print_z_candidate (const char *, struct z_candidate
*);
154 static void print_z_candidates (struct z_candidate
*);
155 static tree
build_this (tree
);
156 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
157 static bool any_strictly_viable (struct z_candidate
*);
158 static struct z_candidate
*add_template_candidate
159 (struct z_candidate
**, tree
, tree
, tree
, tree
, const VEC(tree
,gc
) *,
160 tree
, tree
, tree
, int, unification_kind_t
);
161 static struct z_candidate
*add_template_candidate_real
162 (struct z_candidate
**, tree
, tree
, tree
, tree
, const VEC(tree
,gc
) *,
163 tree
, tree
, tree
, int, tree
, unification_kind_t
);
164 static struct z_candidate
*add_template_conv_candidate
165 (struct z_candidate
**, tree
, tree
, tree
, const VEC(tree
,gc
) *, tree
,
167 static void add_builtin_candidates
168 (struct z_candidate
**, enum tree_code
, enum tree_code
,
170 static void add_builtin_candidate
171 (struct z_candidate
**, enum tree_code
, enum tree_code
,
172 tree
, tree
, tree
, tree
*, tree
*, int);
173 static bool is_complete (tree
);
174 static void build_builtin_candidate
175 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
177 static struct z_candidate
*add_conv_candidate
178 (struct z_candidate
**, tree
, tree
, tree
, const VEC(tree
,gc
) *, tree
,
180 static struct z_candidate
*add_function_candidate
181 (struct z_candidate
**, tree
, tree
, tree
, const VEC(tree
,gc
) *, tree
,
183 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int);
184 static conversion
*standard_conversion (tree
, tree
, tree
, bool, int);
185 static conversion
*reference_binding (tree
, tree
, tree
, bool, int);
186 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
187 static conversion
*build_list_conv (tree
, tree
, int);
188 static bool is_subseq (conversion
*, conversion
*);
189 static conversion
*maybe_handle_ref_bind (conversion
**);
190 static void maybe_handle_implicit_object (conversion
**);
191 static struct z_candidate
*add_candidate
192 (struct z_candidate
**, tree
, tree
, const VEC(tree
,gc
) *, size_t,
193 conversion
**, tree
, tree
, int);
194 static tree
source_type (conversion
*);
195 static void add_warning (struct z_candidate
*, struct z_candidate
*);
196 static bool reference_compatible_p (tree
, tree
);
197 static conversion
*convert_class_to_reference (tree
, tree
, tree
, int);
198 static conversion
*direct_reference_binding (tree
, conversion
*);
199 static bool promoted_arithmetic_type_p (tree
);
200 static conversion
*conditional_conversion (tree
, tree
);
201 static char *name_as_c_string (tree
, tree
, bool *);
202 static tree
prep_operand (tree
);
203 static void add_candidates (tree
, tree
, const VEC(tree
,gc
) *, tree
, tree
, bool,
204 tree
, tree
, int, struct z_candidate
**);
205 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
206 static bool magic_varargs_p (tree
);
207 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
209 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
210 NAME can take many forms... */
213 check_dtor_name (tree basetype
, tree name
)
215 /* Just accept something we've already complained about. */
216 if (name
== error_mark_node
)
219 if (TREE_CODE (name
) == TYPE_DECL
)
220 name
= TREE_TYPE (name
);
221 else if (TYPE_P (name
))
223 else if (TREE_CODE (name
) == IDENTIFIER_NODE
)
225 if ((MAYBE_CLASS_TYPE_P (basetype
)
226 && name
== constructor_name (basetype
))
227 || (TREE_CODE (basetype
) == ENUMERAL_TYPE
228 && name
== TYPE_IDENTIFIER (basetype
)))
231 name
= get_type_value (name
);
237 template <class T> struct S { ~S(); };
241 NAME will be a class template. */
242 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
246 if (!name
|| name
== error_mark_node
)
248 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
251 /* We want the address of a function or method. We avoid creating a
252 pointer-to-member function. */
255 build_addr_func (tree function
)
257 tree type
= TREE_TYPE (function
);
259 /* We have to do these by hand to avoid real pointer to member
261 if (TREE_CODE (type
) == METHOD_TYPE
)
263 if (TREE_CODE (function
) == OFFSET_REF
)
265 tree object
= build_address (TREE_OPERAND (function
, 0));
266 return get_member_function_from_ptrfunc (&object
,
267 TREE_OPERAND (function
, 1));
269 function
= build_address (function
);
272 function
= decay_conversion (function
);
277 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
278 POINTER_TYPE to those. Note, pointer to member function types
279 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
280 two variants. build_call_a is the primitive taking an array of
281 arguments, while build_call_n is a wrapper that handles varargs. */
284 build_call_n (tree function
, int n
, ...)
287 return build_call_a (function
, 0, NULL
);
290 tree
*argarray
= XALLOCAVEC (tree
, n
);
295 for (i
= 0; i
< n
; i
++)
296 argarray
[i
] = va_arg (ap
, tree
);
298 return build_call_a (function
, n
, argarray
);
303 build_call_a (tree function
, int n
, tree
*argarray
)
305 int is_constructor
= 0;
312 function
= build_addr_func (function
);
314 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
315 fntype
= TREE_TYPE (TREE_TYPE (function
));
316 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
317 || TREE_CODE (fntype
) == METHOD_TYPE
);
318 result_type
= TREE_TYPE (fntype
);
319 /* An rvalue has no cv-qualifiers. */
320 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
321 result_type
= cv_unqualified (result_type
);
323 if (TREE_CODE (function
) == ADDR_EXPR
324 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
326 decl
= TREE_OPERAND (function
, 0);
327 if (!TREE_USED (decl
))
329 /* We invoke build_call directly for several library
330 functions. These may have been declared normally if
331 we're building libgcc, so we can't just check
333 gcc_assert (DECL_ARTIFICIAL (decl
)
334 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
342 /* We check both the decl and the type; a function may be known not to
343 throw without being declared throw(). */
344 nothrow
= ((decl
&& TREE_NOTHROW (decl
))
345 || TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (function
))));
347 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
348 current_function_returns_abnormally
= 1;
350 if (decl
&& TREE_DEPRECATED (decl
))
351 warn_deprecated_use (decl
, NULL_TREE
);
352 require_complete_eh_spec_types (fntype
, decl
);
354 if (decl
&& DECL_CONSTRUCTOR_P (decl
))
357 /* Don't pass empty class objects by value. This is useful
358 for tags in STL, which are used to control overload resolution.
359 We don't need to handle other cases of copying empty classes. */
360 if (! decl
|| ! DECL_BUILT_IN (decl
))
361 for (i
= 0; i
< n
; i
++)
362 if (is_empty_class (TREE_TYPE (argarray
[i
]))
363 && ! TREE_ADDRESSABLE (TREE_TYPE (argarray
[i
])))
365 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (argarray
[i
]));
366 argarray
[i
] = build2 (COMPOUND_EXPR
, TREE_TYPE (t
),
370 function
= build_call_array_loc (input_location
,
371 result_type
, function
, n
, argarray
);
372 TREE_HAS_CONSTRUCTOR (function
) = is_constructor
;
373 TREE_NOTHROW (function
) = nothrow
;
378 /* Build something of the form ptr->method (args)
379 or object.method (args). This can also build
380 calls to constructors, and find friends.
382 Member functions always take their class variable
385 INSTANCE is a class instance.
387 NAME is the name of the method desired, usually an IDENTIFIER_NODE.
389 PARMS help to figure out what that NAME really refers to.
391 BASETYPE_PATH, if non-NULL, contains a chain from the type of INSTANCE
392 down to the real instance type to use for access checking. We need this
393 information to get protected accesses correct.
395 FLAGS is the logical disjunction of zero or more LOOKUP_
396 flags. See cp-tree.h for more info.
398 If this is all OK, calls build_function_call with the resolved
401 This function must also handle being called to perform
402 initialization, promotion/coercion of arguments, and
403 instantiation of default parameters.
405 Note that NAME may refer to an instance variable name. If
406 `operator()()' is defined for the type of that field, then we return
409 /* New overloading code. */
411 typedef struct z_candidate z_candidate
;
413 typedef struct candidate_warning candidate_warning
;
414 struct candidate_warning
{
416 candidate_warning
*next
;
420 /* The FUNCTION_DECL that will be called if this candidate is
421 selected by overload resolution. */
423 /* If not NULL_TREE, the first argument to use when calling this
426 /* The rest of the arguments to use when calling this function. If
427 there are no further arguments this may be NULL or it may be an
429 const VEC(tree
,gc
) *args
;
430 /* The implicit conversion sequences for each of the arguments to
433 /* The number of implicit conversion sequences. */
435 /* If FN is a user-defined conversion, the standard conversion
436 sequence from the type returned by FN to the desired destination
438 conversion
*second_conv
;
440 /* If FN is a member function, the binfo indicating the path used to
441 qualify the name of FN at the call site. This path is used to
442 determine whether or not FN is accessible if it is selected by
443 overload resolution. The DECL_CONTEXT of FN will always be a
444 (possibly improper) base of this binfo. */
446 /* If FN is a non-static member function, the binfo indicating the
447 subobject to which the `this' pointer should be converted if FN
448 is selected by overload resolution. The type pointed to the by
449 the `this' pointer must correspond to the most derived class
450 indicated by the CONVERSION_PATH. */
451 tree conversion_path
;
454 candidate_warning
*warnings
;
458 /* Returns true iff T is a null pointer constant in the sense of
462 null_ptr_cst_p (tree t
)
466 A null pointer constant is an integral constant expression
467 (_expr.const_) rvalue of integer type that evaluates to zero or
468 an rvalue of type std::nullptr_t. */
469 if (NULLPTR_TYPE_P (TREE_TYPE (t
)))
471 if (CP_INTEGRAL_TYPE_P (TREE_TYPE (t
)))
473 if (cxx_dialect
>= cxx0x
)
475 t
= fold_non_dependent_expr (t
);
476 t
= maybe_constant_value (t
);
477 if (TREE_CONSTANT (t
) && integer_zerop (t
))
482 t
= integral_constant_value (t
);
484 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
491 /* Returns nonzero if PARMLIST consists of only default parms and/or
495 sufficient_parms_p (const_tree parmlist
)
497 for (; parmlist
&& parmlist
!= void_list_node
;
498 parmlist
= TREE_CHAIN (parmlist
))
499 if (!TREE_PURPOSE (parmlist
))
504 /* Allocate N bytes of memory from the conversion obstack. The memory
505 is zeroed before being returned. */
508 conversion_obstack_alloc (size_t n
)
511 if (!conversion_obstack_initialized
)
513 gcc_obstack_init (&conversion_obstack
);
514 conversion_obstack_initialized
= true;
516 p
= obstack_alloc (&conversion_obstack
, n
);
521 /* Dynamically allocate a conversion. */
524 alloc_conversion (conversion_kind kind
)
527 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
532 #ifdef ENABLE_CHECKING
534 /* Make sure that all memory on the conversion obstack has been
538 validate_conversion_obstack (void)
540 if (conversion_obstack_initialized
)
541 gcc_assert ((obstack_next_free (&conversion_obstack
)
542 == obstack_base (&conversion_obstack
)));
545 #endif /* ENABLE_CHECKING */
547 /* Dynamically allocate an array of N conversions. */
550 alloc_conversions (size_t n
)
552 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
556 build_conv (conversion_kind code
, tree type
, conversion
*from
)
559 conversion_rank rank
= CONVERSION_RANK (from
);
561 /* Note that the caller is responsible for filling in t->cand for
562 user-defined conversions. */
563 t
= alloc_conversion (code
);
586 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
587 t
->bad_p
= from
->bad_p
;
592 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
593 specialization of std::initializer_list<T>, if such a conversion is
597 build_list_conv (tree type
, tree ctor
, int flags
)
599 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
600 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
601 conversion
**subconvs
= alloc_conversions (len
);
606 /* Within a list-initialization we can have more user-defined
608 flags
&= ~LOOKUP_NO_CONVERSION
;
609 /* But no narrowing conversions. */
610 flags
|= LOOKUP_NO_NARROWING
;
612 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
615 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
623 t
= alloc_conversion (ck_list
);
625 t
->u
.list
= subconvs
;
628 for (i
= 0; i
< len
; ++i
)
630 conversion
*sub
= subconvs
[i
];
631 if (sub
->rank
> t
->rank
)
633 if (sub
->user_conv_p
)
634 t
->user_conv_p
= true;
642 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
643 is a valid aggregate initializer for array type ATYPE. */
646 can_convert_array (tree atype
, tree ctor
, int flags
)
649 tree elttype
= TREE_TYPE (atype
);
650 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
652 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
654 if (TREE_CODE (elttype
) == ARRAY_TYPE
655 && TREE_CODE (val
) == CONSTRUCTOR
)
656 ok
= can_convert_array (elttype
, val
, flags
);
658 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
);
665 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
666 aggregate class, if such a conversion is possible. */
669 build_aggr_conv (tree type
, tree ctor
, int flags
)
671 unsigned HOST_WIDE_INT i
= 0;
673 tree field
= next_initializable_field (TYPE_FIELDS (type
));
674 tree empty_ctor
= NULL_TREE
;
676 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
678 tree ftype
= TREE_TYPE (field
);
682 if (i
< CONSTRUCTOR_NELTS (ctor
))
683 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
686 if (empty_ctor
== NULL_TREE
)
687 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
692 if (TREE_CODE (ftype
) == ARRAY_TYPE
693 && TREE_CODE (val
) == CONSTRUCTOR
)
694 ok
= can_convert_array (ftype
, val
, flags
);
696 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
);
701 if (TREE_CODE (type
) == UNION_TYPE
)
705 if (i
< CONSTRUCTOR_NELTS (ctor
))
708 c
= alloc_conversion (ck_aggr
);
711 c
->user_conv_p
= true;
716 /* Build a representation of the identity conversion from EXPR to
717 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
720 build_identity_conv (tree type
, tree expr
)
724 c
= alloc_conversion (ck_identity
);
731 /* Converting from EXPR to TYPE was ambiguous in the sense that there
732 were multiple user-defined conversions to accomplish the job.
733 Build a conversion that indicates that ambiguity. */
736 build_ambiguous_conv (tree type
, tree expr
)
740 c
= alloc_conversion (ck_ambig
);
748 strip_top_quals (tree t
)
750 if (TREE_CODE (t
) == ARRAY_TYPE
)
752 return cp_build_qualified_type (t
, 0);
755 /* Returns the standard conversion path (see [conv]) from type FROM to type
756 TO, if any. For proper handling of null pointer constants, you must
757 also pass the expression EXPR to convert from. If C_CAST_P is true,
758 this conversion is coming from a C-style cast. */
761 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
764 enum tree_code fcode
, tcode
;
766 bool fromref
= false;
768 to
= non_reference (to
);
769 if (TREE_CODE (from
) == REFERENCE_TYPE
)
772 from
= TREE_TYPE (from
);
774 to
= strip_top_quals (to
);
775 from
= strip_top_quals (from
);
777 if ((TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
778 && expr
&& type_unknown_p (expr
))
780 tsubst_flags_t tflags
= tf_conv
;
781 if (!(flags
& LOOKUP_PROTECT
))
782 tflags
|= tf_no_access_control
;
783 expr
= instantiate_type (to
, expr
, tflags
);
784 if (expr
== error_mark_node
)
786 from
= TREE_TYPE (expr
);
789 fcode
= TREE_CODE (from
);
790 tcode
= TREE_CODE (to
);
792 conv
= build_identity_conv (from
, expr
);
793 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
795 from
= type_decays_to (from
);
796 fcode
= TREE_CODE (from
);
797 conv
= build_conv (ck_lvalue
, from
, conv
);
799 else if (fromref
|| (expr
&& lvalue_p (expr
)))
804 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
807 from
= strip_top_quals (bitfield_type
);
808 fcode
= TREE_CODE (from
);
811 conv
= build_conv (ck_rvalue
, from
, conv
);
814 /* Allow conversion between `__complex__' data types. */
815 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
817 /* The standard conversion sequence to convert FROM to TO is
818 the standard conversion sequence to perform componentwise
820 conversion
*part_conv
= standard_conversion
821 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
);
825 conv
= build_conv (part_conv
->kind
, to
, conv
);
826 conv
->rank
= part_conv
->rank
;
834 if (same_type_p (from
, to
))
838 A null pointer constant can be converted to a pointer type; ... A
839 null pointer constant of integral type can be converted to an
840 rvalue of type std::nullptr_t. */
841 if ((tcode
== POINTER_TYPE
|| TYPE_PTR_TO_MEMBER_P (to
)
842 || NULLPTR_TYPE_P (to
))
843 && expr
&& null_ptr_cst_p (expr
))
844 conv
= build_conv (ck_std
, to
, conv
);
845 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
846 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
848 /* For backwards brain damage compatibility, allow interconversion of
849 pointers and integers with a pedwarn. */
850 conv
= build_conv (ck_std
, to
, conv
);
853 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
855 /* For backwards brain damage compatibility, allow interconversion of
856 enums and integers with a pedwarn. */
857 conv
= build_conv (ck_std
, to
, conv
);
860 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
861 || (TYPE_PTRMEM_P (to
) && TYPE_PTRMEM_P (from
)))
866 if (tcode
== POINTER_TYPE
867 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from
),
870 else if (VOID_TYPE_P (TREE_TYPE (to
))
871 && !TYPE_PTRMEM_P (from
)
872 && TREE_CODE (TREE_TYPE (from
)) != FUNCTION_TYPE
)
874 tree nfrom
= TREE_TYPE (from
);
875 if (c_dialect_objc ())
876 nfrom
= objc_non_volatilized_type (nfrom
);
877 from
= build_pointer_type
878 (cp_build_qualified_type (void_type_node
,
879 cp_type_quals (nfrom
)));
880 conv
= build_conv (ck_ptr
, from
, conv
);
882 else if (TYPE_PTRMEM_P (from
))
884 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
885 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
887 if (DERIVED_FROM_P (fbase
, tbase
)
888 && (same_type_ignoring_top_level_qualifiers_p
889 (TYPE_PTRMEM_POINTED_TO_TYPE (from
),
890 TYPE_PTRMEM_POINTED_TO_TYPE (to
))))
892 from
= build_ptrmem_type (tbase
,
893 TYPE_PTRMEM_POINTED_TO_TYPE (from
));
894 conv
= build_conv (ck_pmem
, from
, conv
);
896 else if (!same_type_p (fbase
, tbase
))
899 else if (CLASS_TYPE_P (TREE_TYPE (from
))
900 && CLASS_TYPE_P (TREE_TYPE (to
))
903 An rvalue of type "pointer to cv D," where D is a
904 class type, can be converted to an rvalue of type
905 "pointer to cv B," where B is a base class (clause
906 _class.derived_) of D. If B is an inaccessible
907 (clause _class.access_) or ambiguous
908 (_class.member.lookup_) base class of D, a program
909 that necessitates this conversion is ill-formed.
910 Therefore, we use DERIVED_FROM_P, and do not check
911 access or uniqueness. */
912 && DERIVED_FROM_P (TREE_TYPE (to
), TREE_TYPE (from
)))
915 cp_build_qualified_type (TREE_TYPE (to
),
916 cp_type_quals (TREE_TYPE (from
)));
917 from
= build_pointer_type (from
);
918 conv
= build_conv (ck_ptr
, from
, conv
);
922 if (tcode
== POINTER_TYPE
)
924 to_pointee
= TREE_TYPE (to
);
925 from_pointee
= TREE_TYPE (from
);
929 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
930 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
933 if (same_type_p (from
, to
))
935 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
936 /* In a C-style cast, we ignore CV-qualification because we
937 are allowed to perform a static_cast followed by a
939 conv
= build_conv (ck_qual
, to
, conv
);
940 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
941 conv
= build_conv (ck_qual
, to
, conv
);
942 else if (expr
&& string_conv_p (to
, expr
, 0))
943 /* converting from string constant to char *. */
944 conv
= build_conv (ck_qual
, to
, conv
);
945 /* Allow conversions among compatible ObjC pointer types (base
946 conversions have been already handled above). */
947 else if (c_dialect_objc ()
948 && objc_compare_types (to
, from
, -4, NULL_TREE
))
949 conv
= build_conv (ck_ptr
, to
, conv
);
950 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
952 conv
= build_conv (ck_ptr
, to
, conv
);
960 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
962 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
963 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
964 tree fbase
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fromfn
)));
965 tree tbase
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (tofn
)));
967 if (!DERIVED_FROM_P (fbase
, tbase
)
968 || !same_type_p (TREE_TYPE (fromfn
), TREE_TYPE (tofn
))
969 || !compparms (TREE_CHAIN (TYPE_ARG_TYPES (fromfn
)),
970 TREE_CHAIN (TYPE_ARG_TYPES (tofn
)))
971 || cp_type_quals (fbase
) != cp_type_quals (tbase
))
974 from
= build_memfn_type (fromfn
, tbase
, cp_type_quals (tbase
));
975 from
= build_ptrmemfunc_type (build_pointer_type (from
));
976 conv
= build_conv (ck_pmem
, from
, conv
);
979 else if (tcode
== BOOLEAN_TYPE
)
983 An rvalue of arithmetic, unscoped enumeration, pointer, or
984 pointer to member type can be converted to an rvalue of type
985 bool. ... An rvalue of type std::nullptr_t can be converted
986 to an rvalue of type bool; */
987 if (ARITHMETIC_TYPE_P (from
)
988 || UNSCOPED_ENUM_P (from
)
989 || fcode
== POINTER_TYPE
990 || TYPE_PTR_TO_MEMBER_P (from
)
991 || NULLPTR_TYPE_P (from
))
993 conv
= build_conv (ck_std
, to
, conv
);
994 if (fcode
== POINTER_TYPE
995 || TYPE_PTRMEM_P (from
)
996 || (TYPE_PTRMEMFUNC_P (from
)
997 && conv
->rank
< cr_pbool
)
998 || NULLPTR_TYPE_P (from
))
999 conv
->rank
= cr_pbool
;
1005 /* We don't check for ENUMERAL_TYPE here because there are no standard
1006 conversions to enum type. */
1007 /* As an extension, allow conversion to complex type. */
1008 else if (ARITHMETIC_TYPE_P (to
))
1010 if (! (INTEGRAL_CODE_P (fcode
) || fcode
== REAL_TYPE
)
1011 || SCOPED_ENUM_P (from
))
1013 conv
= build_conv (ck_std
, to
, conv
);
1015 /* Give this a better rank if it's a promotion. */
1016 if (same_type_p (to
, type_promotes_to (from
))
1017 && conv
->u
.next
->rank
<= cr_promotion
)
1018 conv
->rank
= cr_promotion
;
1020 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1021 && vector_types_convertible_p (from
, to
, false))
1022 return build_conv (ck_std
, to
, conv
);
1023 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1024 && is_properly_derived_from (from
, to
))
1026 if (conv
->kind
== ck_rvalue
)
1027 conv
= conv
->u
.next
;
1028 conv
= build_conv (ck_base
, to
, conv
);
1029 /* The derived-to-base conversion indicates the initialization
1030 of a parameter with base type from an object of a derived
1031 type. A temporary object is created to hold the result of
1032 the conversion unless we're binding directly to a reference. */
1033 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1038 if (flags
& LOOKUP_NO_NARROWING
)
1039 conv
->check_narrowing
= true;
1044 /* Returns nonzero if T1 is reference-related to T2. */
1047 reference_related_p (tree t1
, tree t2
)
1049 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1052 t1
= TYPE_MAIN_VARIANT (t1
);
1053 t2
= TYPE_MAIN_VARIANT (t2
);
1057 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1058 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1060 return (same_type_p (t1
, t2
)
1061 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1062 && DERIVED_FROM_P (t1
, t2
)));
1065 /* Returns nonzero if T1 is reference-compatible with T2. */
1068 reference_compatible_p (tree t1
, tree t2
)
1072 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
1073 reference-related to T2 and cv1 is the same cv-qualification as,
1074 or greater cv-qualification than, cv2. */
1075 return (reference_related_p (t1
, t2
)
1076 && at_least_as_qualified_p (t1
, t2
));
1079 /* Determine whether or not the EXPR (of class type S) can be
1080 converted to T as in [over.match.ref]. */
1083 convert_class_to_reference (tree reference_type
, tree s
, tree expr
, int flags
)
1089 struct z_candidate
*candidates
;
1090 struct z_candidate
*cand
;
1096 conversions
= lookup_conversions (s
);
1102 Assuming that "cv1 T" is the underlying type of the reference
1103 being initialized, and "cv S" is the type of the initializer
1104 expression, with S a class type, the candidate functions are
1105 selected as follows:
1107 --The conversion functions of S and its base classes are
1108 considered. Those that are not hidden within S and yield type
1109 "reference to cv2 T2", where "cv1 T" is reference-compatible
1110 (_dcl.init.ref_) with "cv2 T2", are candidate functions.
1112 The argument list has one argument, which is the initializer
1117 /* Conceptually, we should take the address of EXPR and put it in
1118 the argument list. Unfortunately, however, that can result in
1119 error messages, which we should not issue now because we are just
1120 trying to find a conversion operator. Therefore, we use NULL,
1121 cast to the appropriate type. */
1122 first_arg
= build_int_cst (build_pointer_type (s
), 0);
1124 t
= TREE_TYPE (reference_type
);
1126 /* We're performing a user-defined conversion to a desired type, so set
1127 this for the benefit of add_candidates. */
1128 flags
|= LOOKUP_NO_CONVERSION
;
1130 for (; conversions
; conversions
= TREE_CHAIN (conversions
))
1132 tree fns
= TREE_VALUE (conversions
);
1133 tree binfo
= TREE_PURPOSE (conversions
);
1134 struct z_candidate
*old_candidates
= candidates
;;
1136 add_candidates (fns
, first_arg
, NULL
, reference_type
,
1138 binfo
, TYPE_BINFO (s
),
1139 flags
, &candidates
);
1141 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
1143 /* Now, see if the conversion function really returns
1144 an lvalue of the appropriate type. From the
1145 point of view of unification, simply returning an
1146 rvalue of the right type is good enough. */
1148 tree t2
= TREE_TYPE (TREE_TYPE (f
));
1149 if (TREE_CODE (t2
) != REFERENCE_TYPE
1150 || !reference_compatible_p (t
, TREE_TYPE (t2
)))
1156 conversion
*identity_conv
;
1157 /* Build a standard conversion sequence indicating the
1158 binding from the reference type returned by the
1159 function to the desired REFERENCE_TYPE. */
1161 = build_identity_conv (TREE_TYPE (TREE_TYPE
1162 (TREE_TYPE (cand
->fn
))),
1165 = (direct_reference_binding
1166 (reference_type
, identity_conv
));
1167 cand
->second_conv
->rvaluedness_matches_p
1168 = TYPE_REF_IS_RVALUE (TREE_TYPE (TREE_TYPE (cand
->fn
)))
1169 == TYPE_REF_IS_RVALUE (reference_type
);
1170 cand
->second_conv
->bad_p
|= cand
->convs
[0]->bad_p
;
1172 /* Don't allow binding of lvalues to rvalue references. */
1173 if (TYPE_REF_IS_RVALUE (reference_type
)
1174 && !TYPE_REF_IS_RVALUE (TREE_TYPE (TREE_TYPE (cand
->fn
))))
1175 cand
->second_conv
->bad_p
= true;
1180 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
1181 /* If none of the conversion functions worked out, let our caller
1186 cand
= tourney (candidates
);
1190 /* Now that we know that this is the function we're going to use fix
1191 the dummy first argument. */
1192 gcc_assert (cand
->first_arg
== NULL_TREE
1193 || integer_zerop (cand
->first_arg
));
1194 cand
->first_arg
= build_this (expr
);
1196 /* Build a user-defined conversion sequence representing the
1198 conv
= build_conv (ck_user
,
1199 TREE_TYPE (TREE_TYPE (cand
->fn
)),
1200 build_identity_conv (TREE_TYPE (expr
), expr
));
1203 if (cand
->viable
== -1)
1206 /* Merge it with the standard conversion sequence from the
1207 conversion function's return type to the desired type. */
1208 cand
->second_conv
= merge_conversion_sequences (conv
, cand
->second_conv
);
1210 return cand
->second_conv
;
1213 /* A reference of the indicated TYPE is being bound directly to the
1214 expression represented by the implicit conversion sequence CONV.
1215 Return a conversion sequence for this binding. */
1218 direct_reference_binding (tree type
, conversion
*conv
)
1222 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
1223 gcc_assert (TREE_CODE (conv
->type
) != REFERENCE_TYPE
);
1225 t
= TREE_TYPE (type
);
1229 When a parameter of reference type binds directly
1230 (_dcl.init.ref_) to an argument expression, the implicit
1231 conversion sequence is the identity conversion, unless the
1232 argument expression has a type that is a derived class of the
1233 parameter type, in which case the implicit conversion sequence is
1234 a derived-to-base Conversion.
1236 If the parameter binds directly to the result of applying a
1237 conversion function to the argument expression, the implicit
1238 conversion sequence is a user-defined conversion sequence
1239 (_over.ics.user_), with the second standard conversion sequence
1240 either an identity conversion or, if the conversion function
1241 returns an entity of a type that is a derived class of the
1242 parameter type, a derived-to-base conversion. */
1243 if (!same_type_ignoring_top_level_qualifiers_p (t
, conv
->type
))
1245 /* Represent the derived-to-base conversion. */
1246 conv
= build_conv (ck_base
, t
, conv
);
1247 /* We will actually be binding to the base-class subobject in
1248 the derived class, so we mark this conversion appropriately.
1249 That way, convert_like knows not to generate a temporary. */
1250 conv
->need_temporary_p
= false;
1252 return build_conv (ck_ref_bind
, type
, conv
);
1255 /* Returns the conversion path from type FROM to reference type TO for
1256 purposes of reference binding. For lvalue binding, either pass a
1257 reference type to FROM or an lvalue expression to EXPR. If the
1258 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1259 the conversion returned. If C_CAST_P is true, this
1260 conversion is coming from a C-style cast. */
1263 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
)
1265 conversion
*conv
= NULL
;
1266 tree to
= TREE_TYPE (rto
);
1271 cp_lvalue_kind is_lvalue
= clk_none
;
1273 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1275 expr
= instantiate_type (to
, expr
, tf_none
);
1276 if (expr
== error_mark_node
)
1278 from
= TREE_TYPE (expr
);
1281 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1283 /* Anything with reference type is an lvalue. */
1284 is_lvalue
= clk_ordinary
;
1285 from
= TREE_TYPE (from
);
1288 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1290 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1291 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1293 if (!CLASS_TYPE_P (to
)
1294 && CONSTRUCTOR_NELTS (expr
) == 1)
1296 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1297 if (error_operand_p (expr
))
1299 from
= TREE_TYPE (expr
);
1303 if (is_lvalue
== clk_none
&& expr
)
1304 is_lvalue
= real_lvalue_p (expr
);
1307 if ((is_lvalue
& clk_bitfield
) != 0)
1308 tfrom
= unlowered_expr_type (expr
);
1310 /* Figure out whether or not the types are reference-related and
1311 reference compatible. We have do do this after stripping
1312 references from FROM. */
1313 related_p
= reference_related_p (to
, tfrom
);
1314 /* If this is a C cast, first convert to an appropriately qualified
1315 type, so that we can later do a const_cast to the desired type. */
1316 if (related_p
&& c_cast_p
1317 && !at_least_as_qualified_p (to
, tfrom
))
1318 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1319 compatible_p
= reference_compatible_p (to
, tfrom
);
1321 /* Directly bind reference when target expression's type is compatible with
1322 the reference and expression is an lvalue. In DR391, the wording in
1323 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1324 const and rvalue references to rvalues of compatible class type.
1325 We should also do direct bindings for non-class "rvalues" derived from
1326 rvalue references. */
1329 || (((CP_TYPE_CONST_NON_VOLATILE_P (to
)
1330 && !(flags
& LOOKUP_NO_TEMP_BIND
))
1331 || TYPE_REF_IS_RVALUE (rto
))
1332 && (CLASS_TYPE_P (from
) || (expr
&& lvalue_p (expr
))))))
1336 If the initializer expression
1338 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1339 is reference-compatible with "cv2 T2,"
1341 the reference is bound directly to the initializer expression
1345 If the initializer expression is an rvalue, with T2 a class type,
1346 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1347 is bound to the object represented by the rvalue or to a sub-object
1348 within that object. */
1350 conv
= build_identity_conv (tfrom
, expr
);
1351 conv
= direct_reference_binding (rto
, conv
);
1353 if (flags
& LOOKUP_PREFER_RVALUE
)
1354 /* The top-level caller requested that we pretend that the lvalue
1355 be treated as an rvalue. */
1356 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1358 conv
->rvaluedness_matches_p
1359 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1361 if ((is_lvalue
& clk_bitfield
) != 0
1362 || ((is_lvalue
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1363 /* For the purposes of overload resolution, we ignore the fact
1364 this expression is a bitfield or packed field. (In particular,
1365 [over.ics.ref] says specifically that a function with a
1366 non-const reference parameter is viable even if the
1367 argument is a bitfield.)
1369 However, when we actually call the function we must create
1370 a temporary to which to bind the reference. If the
1371 reference is volatile, or isn't const, then we cannot make
1372 a temporary, so we just issue an error when the conversion
1374 conv
->need_temporary_p
= true;
1376 /* Don't allow binding of lvalues to rvalue references. */
1377 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1378 && !(flags
& LOOKUP_PREFER_RVALUE
))
1383 /* [class.conv.fct] A conversion function is never used to convert a
1384 (possibly cv-qualified) object to the (possibly cv-qualified) same
1385 object type (or a reference to it), to a (possibly cv-qualified) base
1386 class of that type (or a reference to it).... */
1387 else if (CLASS_TYPE_P (from
) && !related_p
1388 && !(flags
& LOOKUP_NO_CONVERSION
))
1392 If the initializer expression
1394 -- has a class type (i.e., T2 is a class type) can be
1395 implicitly converted to an lvalue of type "cv3 T3," where
1396 "cv1 T1" is reference-compatible with "cv3 T3". (this
1397 conversion is selected by enumerating the applicable
1398 conversion functions (_over.match.ref_) and choosing the
1399 best one through overload resolution. (_over.match_).
1401 the reference is bound to the lvalue result of the conversion
1402 in the second case. */
1403 conv
= convert_class_to_reference (rto
, from
, expr
, flags
);
1408 /* From this point on, we conceptually need temporaries, even if we
1409 elide them. Only the cases above are "direct bindings". */
1410 if (flags
& LOOKUP_NO_TEMP_BIND
)
1415 When a parameter of reference type is not bound directly to an
1416 argument expression, the conversion sequence is the one required
1417 to convert the argument expression to the underlying type of the
1418 reference according to _over.best.ics_. Conceptually, this
1419 conversion sequence corresponds to copy-initializing a temporary
1420 of the underlying type with the argument expression. Any
1421 difference in top-level cv-qualification is subsumed by the
1422 initialization itself and does not constitute a conversion. */
1426 Otherwise, the reference shall be to a non-volatile const type.
1428 Under C++0x, [8.5.3/5 dcl.init.ref] it may also be an rvalue reference */
1429 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1434 Otherwise, a temporary of type "cv1 T1" is created and
1435 initialized from the initializer expression using the rules for a
1436 non-reference copy initialization. If T1 is reference-related to
1437 T2, cv1 must be the same cv-qualification as, or greater
1438 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1439 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1442 /* We're generating a temporary now, but don't bind any more in the
1443 conversion (specifically, don't slice the temporary returned by a
1444 conversion operator). */
1445 flags
|= LOOKUP_NO_TEMP_BIND
;
1447 /* Core issue 899: When [copy-]initializing a temporary to be bound
1448 to the first parameter of a copy constructor (12.8) called with
1449 a single argument in the context of direct-initialization,
1450 explicit conversion functions are also considered.
1452 So don't set LOOKUP_ONLYCONVERTING in that case. */
1453 if (!(flags
& LOOKUP_COPY_PARM
))
1454 flags
|= LOOKUP_ONLYCONVERTING
;
1457 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1462 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1463 /* This reference binding, unlike those above, requires the
1464 creation of a temporary. */
1465 conv
->need_temporary_p
= true;
1466 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1471 /* Returns the implicit conversion sequence (see [over.ics]) from type
1472 FROM to type TO. The optional expression EXPR may affect the
1473 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1474 true, this conversion is coming from a C-style cast. */
1477 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1482 if (from
== error_mark_node
|| to
== error_mark_node
1483 || expr
== error_mark_node
)
1486 if (c_dialect_objc ())
1487 from
= objc_non_volatilized_type (from
);
1489 if (TREE_CODE (to
) == REFERENCE_TYPE
)
1490 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
);
1492 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
);
1497 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1499 if (is_std_init_list (to
))
1500 return build_list_conv (to
, expr
, flags
);
1502 /* Allow conversion from an initializer-list with one element to a
1504 if (SCALAR_TYPE_P (to
))
1506 int nelts
= CONSTRUCTOR_NELTS (expr
);
1510 elt
= build_value_init (to
, tf_none
);
1511 else if (nelts
== 1)
1512 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1514 elt
= error_mark_node
;
1516 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1520 conv
->check_narrowing
= true;
1521 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1522 /* Too many levels of braces, i.e. '{{1}}'. */
1529 if (expr
!= NULL_TREE
1530 && (MAYBE_CLASS_TYPE_P (from
)
1531 || MAYBE_CLASS_TYPE_P (to
))
1532 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1534 struct z_candidate
*cand
;
1535 int convflags
= (flags
& (LOOKUP_NO_TEMP_BIND
|LOOKUP_ONLYCONVERTING
1536 |LOOKUP_NO_NARROWING
));
1538 if (CLASS_TYPE_P (to
)
1539 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
))
1540 && BRACE_ENCLOSED_INITIALIZER_P (expr
))
1541 return build_aggr_conv (to
, expr
, flags
);
1543 cand
= build_user_type_conversion_1 (to
, expr
, convflags
);
1545 conv
= cand
->second_conv
;
1547 /* We used to try to bind a reference to a temporary here, but that
1548 is now handled after the recursive call to this function at the end
1549 of reference_binding. */
1556 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1557 functions. ARGS will not be changed until a single candidate is
1560 static struct z_candidate
*
1561 add_candidate (struct z_candidate
**candidates
,
1562 tree fn
, tree first_arg
, const VEC(tree
,gc
) *args
,
1563 size_t num_convs
, conversion
**convs
,
1564 tree access_path
, tree conversion_path
,
1567 struct z_candidate
*cand
= (struct z_candidate
*)
1568 conversion_obstack_alloc (sizeof (struct z_candidate
));
1571 cand
->first_arg
= first_arg
;
1573 cand
->convs
= convs
;
1574 cand
->num_convs
= num_convs
;
1575 cand
->access_path
= access_path
;
1576 cand
->conversion_path
= conversion_path
;
1577 cand
->viable
= viable
;
1578 cand
->next
= *candidates
;
1584 /* Create an overload candidate for the function or method FN called
1585 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1586 FLAGS is passed on to implicit_conversion.
1588 This does not change ARGS.
1590 CTYPE, if non-NULL, is the type we want to pretend this function
1591 comes from for purposes of overload resolution. */
1593 static struct z_candidate
*
1594 add_function_candidate (struct z_candidate
**candidates
,
1595 tree fn
, tree ctype
, tree first_arg
,
1596 const VEC(tree
,gc
) *args
, tree access_path
,
1597 tree conversion_path
, int flags
)
1599 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1603 tree orig_first_arg
= first_arg
;
1607 /* At this point we should not see any functions which haven't been
1608 explicitly declared, except for friend functions which will have
1609 been found using argument dependent lookup. */
1610 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
1612 /* The `this', `in_chrg' and VTT arguments to constructors are not
1613 considered in overload resolution. */
1614 if (DECL_CONSTRUCTOR_P (fn
))
1616 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
1617 skip
= num_artificial_parms_for (fn
);
1618 if (skip
> 0 && first_arg
!= NULL_TREE
)
1621 first_arg
= NULL_TREE
;
1627 len
= VEC_length (tree
, args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
1628 convs
= alloc_conversions (len
);
1630 /* 13.3.2 - Viable functions [over.match.viable]
1631 First, to be a viable function, a candidate function shall have enough
1632 parameters to agree in number with the arguments in the list.
1634 We need to check this first; otherwise, checking the ICSes might cause
1635 us to produce an ill-formed template instantiation. */
1637 parmnode
= parmlist
;
1638 for (i
= 0; i
< len
; ++i
)
1640 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
1642 parmnode
= TREE_CHAIN (parmnode
);
1645 if (i
< len
&& parmnode
)
1648 /* Make sure there are default args for the rest of the parms. */
1649 else if (!sufficient_parms_p (parmnode
))
1652 /* Kludge: When looking for a function from a subobject while generating
1653 an implicit copy/move constructor/operator=, don't consider anything
1654 that takes (a reference to) an unrelated type. See c++/44909. */
1656 && ((flags
& LOOKUP_SPECULATIVE
)
1657 || (current_function_decl
1658 && DECL_DEFAULTED_FN (current_function_decl
))))
1660 if (DECL_CONSTRUCTOR_P (fn
))
1662 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
1663 && DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
)
1669 parmnode
= chain_index (i
-1, parmlist
);
1670 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
1679 /* Second, for F to be a viable function, there shall exist for each
1680 argument an implicit conversion sequence that converts that argument
1681 to the corresponding parameter of F. */
1683 parmnode
= parmlist
;
1685 for (i
= 0; i
< len
; ++i
)
1691 if (parmnode
== void_list_node
)
1694 if (i
== 0 && first_arg
!= NULL_TREE
)
1697 arg
= VEC_index (tree
, args
,
1698 i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0));
1699 argtype
= lvalue_type (arg
);
1701 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1702 && ! DECL_CONSTRUCTOR_P (fn
));
1706 tree parmtype
= TREE_VALUE (parmnode
);
1709 parmnode
= TREE_CHAIN (parmnode
);
1711 /* The type of the implicit object parameter ('this') for
1712 overload resolution is not always the same as for the
1713 function itself; conversion functions are considered to
1714 be members of the class being converted, and functions
1715 introduced by a using-declaration are considered to be
1716 members of the class that uses them.
1718 Since build_over_call ignores the ICS for the `this'
1719 parameter, we can just change the parm type. */
1720 if (ctype
&& is_this
)
1722 parmtype
= cp_build_qualified_type
1723 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
1724 parmtype
= build_pointer_type (parmtype
);
1727 /* Core issue 899: When [copy-]initializing a temporary to be bound
1728 to the first parameter of a copy constructor (12.8) called with
1729 a single argument in the context of direct-initialization,
1730 explicit conversion functions are also considered.
1732 So set LOOKUP_COPY_PARM to let reference_binding know that
1733 it's being called in that context. We generalize the above
1734 to handle move constructors and template constructors as well;
1735 the standardese should soon be updated similarly. */
1736 if (ctype
&& i
== 0 && (len
-skip
== 1)
1737 && !(flags
& LOOKUP_ONLYCONVERTING
)
1738 && DECL_CONSTRUCTOR_P (fn
)
1739 && parmtype
!= error_mark_node
1740 && (same_type_ignoring_top_level_qualifiers_p
1741 (non_reference (parmtype
), ctype
)))
1743 lflags
|= LOOKUP_COPY_PARM
;
1744 /* We allow user-defined conversions within init-lists, but
1745 not for the copy constructor. */
1746 if (flags
& LOOKUP_NO_COPY_CTOR_CONVERSION
)
1747 lflags
|= LOOKUP_NO_CONVERSION
;
1750 lflags
|= LOOKUP_ONLYCONVERTING
;
1752 t
= implicit_conversion (parmtype
, argtype
, arg
,
1753 /*c_cast_p=*/false, lflags
);
1757 t
= build_identity_conv (argtype
, arg
);
1758 t
->ellipsis_p
= true;
1776 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
1777 access_path
, conversion_path
, viable
);
1780 /* Create an overload candidate for the conversion function FN which will
1781 be invoked for expression OBJ, producing a pointer-to-function which
1782 will in turn be called with the argument list FIRST_ARG/ARGLIST,
1783 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
1784 passed on to implicit_conversion.
1786 Actually, we don't really care about FN; we care about the type it
1787 converts to. There may be multiple conversion functions that will
1788 convert to that type, and we rely on build_user_type_conversion_1 to
1789 choose the best one; so when we create our candidate, we record the type
1790 instead of the function. */
1792 static struct z_candidate
*
1793 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
1794 tree first_arg
, const VEC(tree
,gc
) *arglist
,
1795 tree access_path
, tree conversion_path
)
1797 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
1798 int i
, len
, viable
, flags
;
1799 tree parmlist
, parmnode
;
1802 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
1803 parmlist
= TREE_TYPE (parmlist
);
1804 parmlist
= TYPE_ARG_TYPES (parmlist
);
1806 len
= VEC_length (tree
, arglist
) + (first_arg
!= NULL_TREE
? 1 : 0) + 1;
1807 convs
= alloc_conversions (len
);
1808 parmnode
= parmlist
;
1810 flags
= LOOKUP_IMPLICIT
;
1812 /* Don't bother looking up the same type twice. */
1813 if (*candidates
&& (*candidates
)->fn
== totype
)
1816 for (i
= 0; i
< len
; ++i
)
1823 else if (i
== 1 && first_arg
!= NULL_TREE
)
1826 arg
= VEC_index (tree
, arglist
,
1827 i
- (first_arg
!= NULL_TREE
? 1 : 0) - 1);
1828 argtype
= lvalue_type (arg
);
1831 t
= implicit_conversion (totype
, argtype
, arg
, /*c_cast_p=*/false,
1833 else if (parmnode
== void_list_node
)
1836 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
1837 /*c_cast_p=*/false, flags
);
1840 t
= build_identity_conv (argtype
, arg
);
1841 t
->ellipsis_p
= true;
1855 parmnode
= TREE_CHAIN (parmnode
);
1861 if (!sufficient_parms_p (parmnode
))
1864 return add_candidate (candidates
, totype
, first_arg
, arglist
, len
, convs
,
1865 access_path
, conversion_path
, viable
);
1869 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
1870 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
1882 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
1883 convs
= alloc_conversions (num_convs
);
1885 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
1886 conversion ops are allowed. We handle that here by just checking for
1887 boolean_type_node because other operators don't ask for it. COND_EXPR
1888 also does contextual conversion to bool for the first operand, but we
1889 handle that in build_conditional_expr, and type1 here is operand 2. */
1890 if (type1
!= boolean_type_node
)
1891 flags
|= LOOKUP_ONLYCONVERTING
;
1893 for (i
= 0; i
< 2; ++i
)
1898 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
1899 /*c_cast_p=*/false, flags
);
1903 /* We need something for printing the candidate. */
1904 t
= build_identity_conv (types
[i
], NULL_TREE
);
1911 /* For COND_EXPR we rearranged the arguments; undo that now. */
1914 convs
[2] = convs
[1];
1915 convs
[1] = convs
[0];
1916 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
1917 /*c_cast_p=*/false, flags
);
1924 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
1926 /*access_path=*/NULL_TREE
,
1927 /*conversion_path=*/NULL_TREE
,
1932 is_complete (tree t
)
1934 return COMPLETE_TYPE_P (complete_type (t
));
1937 /* Returns nonzero if TYPE is a promoted arithmetic type. */
1940 promoted_arithmetic_type_p (tree type
)
1944 In this section, the term promoted integral type is used to refer
1945 to those integral types which are preserved by integral promotion
1946 (including e.g. int and long but excluding e.g. char).
1947 Similarly, the term promoted arithmetic type refers to promoted
1948 integral types plus floating types. */
1949 return ((CP_INTEGRAL_TYPE_P (type
)
1950 && same_type_p (type_promotes_to (type
), type
))
1951 || TREE_CODE (type
) == REAL_TYPE
);
1954 /* Create any builtin operator overload candidates for the operator in
1955 question given the converted operand types TYPE1 and TYPE2. The other
1956 args are passed through from add_builtin_candidates to
1957 build_builtin_candidate.
1959 TYPE1 and TYPE2 may not be permissible, and we must filter them.
1960 If CODE is requires candidates operands of the same type of the kind
1961 of which TYPE1 and TYPE2 are, we add both candidates
1962 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
1965 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
1966 enum tree_code code2
, tree fnname
, tree type1
,
1967 tree type2
, tree
*args
, tree
*argtypes
, int flags
)
1971 case POSTINCREMENT_EXPR
:
1972 case POSTDECREMENT_EXPR
:
1973 args
[1] = integer_zero_node
;
1974 type2
= integer_type_node
;
1983 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
1984 and VQ is either volatile or empty, there exist candidate operator
1985 functions of the form
1986 VQ T& operator++(VQ T&);
1987 T operator++(VQ T&, int);
1988 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
1989 type other than bool, and VQ is either volatile or empty, there exist
1990 candidate operator functions of the form
1991 VQ T& operator--(VQ T&);
1992 T operator--(VQ T&, int);
1993 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
1994 complete object type, and VQ is either volatile or empty, there exist
1995 candidate operator functions of the form
1996 T*VQ& operator++(T*VQ&);
1997 T*VQ& operator--(T*VQ&);
1998 T* operator++(T*VQ&, int);
1999 T* operator--(T*VQ&, int); */
2001 case POSTDECREMENT_EXPR
:
2002 case PREDECREMENT_EXPR
:
2003 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2005 case POSTINCREMENT_EXPR
:
2006 case PREINCREMENT_EXPR
:
2007 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2009 type1
= build_reference_type (type1
);
2014 /* 7 For every cv-qualified or cv-unqualified complete object type T, there
2015 exist candidate operator functions of the form
2019 8 For every function type T, there exist candidate operator functions of
2021 T& operator*(T*); */
2024 if (TREE_CODE (type1
) == POINTER_TYPE
2025 && is_complete (TREE_TYPE (type1
))
2026 && (TYPE_PTROB_P (type1
)
2027 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2031 /* 9 For every type T, there exist candidate operator functions of the form
2034 10For every promoted arithmetic type T, there exist candidate operator
2035 functions of the form
2039 case UNARY_PLUS_EXPR
: /* unary + */
2040 if (TREE_CODE (type1
) == POINTER_TYPE
)
2043 if (ARITHMETIC_TYPE_P (type1
))
2047 /* 11For every promoted integral type T, there exist candidate operator
2048 functions of the form
2052 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2056 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2057 is the same type as C2 or is a derived class of C2, T is a complete
2058 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2059 there exist candidate operator functions of the form
2060 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2061 where CV12 is the union of CV1 and CV2. */
2064 if (TREE_CODE (type1
) == POINTER_TYPE
2065 && TYPE_PTR_TO_MEMBER_P (type2
))
2067 tree c1
= TREE_TYPE (type1
);
2068 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2070 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2071 && (TYPE_PTRMEMFUNC_P (type2
)
2072 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2077 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2078 didate operator functions of the form
2083 bool operator<(L, R);
2084 bool operator>(L, R);
2085 bool operator<=(L, R);
2086 bool operator>=(L, R);
2087 bool operator==(L, R);
2088 bool operator!=(L, R);
2089 where LR is the result of the usual arithmetic conversions between
2092 14For every pair of types T and I, where T is a cv-qualified or cv-
2093 unqualified complete object type and I is a promoted integral type,
2094 there exist candidate operator functions of the form
2095 T* operator+(T*, I);
2096 T& operator[](T*, I);
2097 T* operator-(T*, I);
2098 T* operator+(I, T*);
2099 T& operator[](I, T*);
2101 15For every T, where T is a pointer to complete object type, there exist
2102 candidate operator functions of the form112)
2103 ptrdiff_t operator-(T, T);
2105 16For every pointer or enumeration type T, there exist candidate operator
2106 functions of the form
2107 bool operator<(T, T);
2108 bool operator>(T, T);
2109 bool operator<=(T, T);
2110 bool operator>=(T, T);
2111 bool operator==(T, T);
2112 bool operator!=(T, T);
2114 17For every pointer to member type T, there exist candidate operator
2115 functions of the form
2116 bool operator==(T, T);
2117 bool operator!=(T, T); */
2120 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2122 if (TYPE_PTROB_P (type1
)
2123 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2125 type2
= ptrdiff_type_node
;
2129 case TRUNC_DIV_EXPR
:
2130 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2136 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2137 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
)))
2139 if (TYPE_PTR_TO_MEMBER_P (type1
) && null_ptr_cst_p (args
[1]))
2144 if (TYPE_PTR_TO_MEMBER_P (type2
) && null_ptr_cst_p (args
[0]))
2156 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2158 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2160 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2161 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2163 if (TYPE_PTR_P (type1
)
2164 && null_ptr_cst_p (args
[1])
2165 && !uses_template_parms (type1
))
2170 if (null_ptr_cst_p (args
[0])
2171 && TYPE_PTR_P (type2
)
2172 && !uses_template_parms (type2
))
2180 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2183 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2185 type1
= ptrdiff_type_node
;
2188 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2190 type2
= ptrdiff_type_node
;
2195 /* 18For every pair of promoted integral types L and R, there exist candi-
2196 date operator functions of the form
2203 where LR is the result of the usual arithmetic conversions between
2206 case TRUNC_MOD_EXPR
:
2212 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2216 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2217 type, VQ is either volatile or empty, and R is a promoted arithmetic
2218 type, there exist candidate operator functions of the form
2219 VQ L& operator=(VQ L&, R);
2220 VQ L& operator*=(VQ L&, R);
2221 VQ L& operator/=(VQ L&, R);
2222 VQ L& operator+=(VQ L&, R);
2223 VQ L& operator-=(VQ L&, R);
2225 20For every pair T, VQ), where T is any type and VQ is either volatile
2226 or empty, there exist candidate operator functions of the form
2227 T*VQ& operator=(T*VQ&, T*);
2229 21For every pair T, VQ), where T is a pointer to member type and VQ is
2230 either volatile or empty, there exist candidate operator functions of
2232 VQ T& operator=(VQ T&, T);
2234 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2235 unqualified complete object type, VQ is either volatile or empty, and
2236 I is a promoted integral type, there exist candidate operator func-
2238 T*VQ& operator+=(T*VQ&, I);
2239 T*VQ& operator-=(T*VQ&, I);
2241 23For every triple L, VQ, R), where L is an integral or enumeration
2242 type, VQ is either volatile or empty, and R is a promoted integral
2243 type, there exist candidate operator functions of the form
2245 VQ L& operator%=(VQ L&, R);
2246 VQ L& operator<<=(VQ L&, R);
2247 VQ L& operator>>=(VQ L&, R);
2248 VQ L& operator&=(VQ L&, R);
2249 VQ L& operator^=(VQ L&, R);
2250 VQ L& operator|=(VQ L&, R); */
2257 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2259 type2
= ptrdiff_type_node
;
2263 case TRUNC_DIV_EXPR
:
2264 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2268 case TRUNC_MOD_EXPR
:
2274 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2279 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2281 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2282 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2283 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
))
2284 || ((TYPE_PTRMEMFUNC_P (type1
)
2285 || TREE_CODE (type1
) == POINTER_TYPE
)
2286 && null_ptr_cst_p (args
[1])))
2296 type1
= build_reference_type (type1
);
2302 For every pair of promoted arithmetic types L and R, there
2303 exist candidate operator functions of the form
2305 LR operator?(bool, L, R);
2307 where LR is the result of the usual arithmetic conversions
2308 between types L and R.
2310 For every type T, where T is a pointer or pointer-to-member
2311 type, there exist candidate operator functions of the form T
2312 operator?(bool, T, T); */
2314 if (promoted_arithmetic_type_p (type1
)
2315 && promoted_arithmetic_type_p (type2
))
2319 /* Otherwise, the types should be pointers. */
2320 if (!(TYPE_PTR_P (type1
) || TYPE_PTR_TO_MEMBER_P (type1
))
2321 || !(TYPE_PTR_P (type2
) || TYPE_PTR_TO_MEMBER_P (type2
)))
2324 /* We don't check that the two types are the same; the logic
2325 below will actually create two candidates; one in which both
2326 parameter types are TYPE1, and one in which both parameter
2334 /* If we're dealing with two pointer types or two enumeral types,
2335 we need candidates for both of them. */
2336 if (type2
&& !same_type_p (type1
, type2
)
2337 && TREE_CODE (type1
) == TREE_CODE (type2
)
2338 && (TREE_CODE (type1
) == REFERENCE_TYPE
2339 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2340 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
))
2341 || TYPE_PTRMEMFUNC_P (type1
)
2342 || MAYBE_CLASS_TYPE_P (type1
)
2343 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2345 build_builtin_candidate
2346 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
);
2347 build_builtin_candidate
2348 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
);
2352 build_builtin_candidate
2353 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
);
2357 type_decays_to (tree type
)
2359 if (TREE_CODE (type
) == ARRAY_TYPE
)
2360 return build_pointer_type (TREE_TYPE (type
));
2361 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2362 return build_pointer_type (type
);
2363 if (!MAYBE_CLASS_TYPE_P (type
))
2364 type
= cv_unqualified (type
);
2368 /* There are three conditions of builtin candidates:
2370 1) bool-taking candidates. These are the same regardless of the input.
2371 2) pointer-pair taking candidates. These are generated for each type
2372 one of the input types converts to.
2373 3) arithmetic candidates. According to the standard, we should generate
2374 all of these, but I'm trying not to...
2376 Here we generate a superset of the possible candidates for this particular
2377 case. That is a subset of the full set the standard defines, plus some
2378 other cases which the standard disallows. add_builtin_candidate will
2379 filter out the invalid set. */
2382 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2383 enum tree_code code2
, tree fnname
, tree
*args
,
2388 tree type
, argtypes
[3], t
;
2389 /* TYPES[i] is the set of possible builtin-operator parameter types
2390 we will consider for the Ith argument. */
2391 VEC(tree
,gc
) *types
[2];
2394 for (i
= 0; i
< 3; ++i
)
2397 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2399 argtypes
[i
] = NULL_TREE
;
2404 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2405 and VQ is either volatile or empty, there exist candidate operator
2406 functions of the form
2407 VQ T& operator++(VQ T&); */
2409 case POSTINCREMENT_EXPR
:
2410 case PREINCREMENT_EXPR
:
2411 case POSTDECREMENT_EXPR
:
2412 case PREDECREMENT_EXPR
:
2417 /* 24There also exist candidate operator functions of the form
2418 bool operator!(bool);
2419 bool operator&&(bool, bool);
2420 bool operator||(bool, bool); */
2422 case TRUTH_NOT_EXPR
:
2423 build_builtin_candidate
2424 (candidates
, fnname
, boolean_type_node
,
2425 NULL_TREE
, args
, argtypes
, flags
);
2428 case TRUTH_ORIF_EXPR
:
2429 case TRUTH_ANDIF_EXPR
:
2430 build_builtin_candidate
2431 (candidates
, fnname
, boolean_type_node
,
2432 boolean_type_node
, args
, argtypes
, flags
);
2454 types
[0] = make_tree_vector ();
2455 types
[1] = make_tree_vector ();
2457 for (i
= 0; i
< 2; ++i
)
2461 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
2465 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
2468 convs
= lookup_conversions (argtypes
[i
]);
2470 if (code
== COND_EXPR
)
2472 if (real_lvalue_p (args
[i
]))
2473 VEC_safe_push (tree
, gc
, types
[i
],
2474 build_reference_type (argtypes
[i
]));
2476 VEC_safe_push (tree
, gc
, types
[i
],
2477 TYPE_MAIN_VARIANT (argtypes
[i
]));
2483 for (; convs
; convs
= TREE_CHAIN (convs
))
2485 type
= TREE_TYPE (convs
);
2488 && (TREE_CODE (type
) != REFERENCE_TYPE
2489 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
2492 if (code
== COND_EXPR
&& TREE_CODE (type
) == REFERENCE_TYPE
)
2493 VEC_safe_push (tree
, gc
, types
[i
], type
);
2495 type
= non_reference (type
);
2496 if (i
!= 0 || ! ref1
)
2498 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
2499 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
2500 VEC_safe_push (tree
, gc
, types
[i
], type
);
2501 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2502 type
= type_promotes_to (type
);
2505 if (! vec_member (type
, types
[i
]))
2506 VEC_safe_push (tree
, gc
, types
[i
], type
);
2511 if (code
== COND_EXPR
&& real_lvalue_p (args
[i
]))
2512 VEC_safe_push (tree
, gc
, types
[i
],
2513 build_reference_type (argtypes
[i
]));
2514 type
= non_reference (argtypes
[i
]);
2515 if (i
!= 0 || ! ref1
)
2517 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
2518 if (enum_p
&& UNSCOPED_ENUM_P (type
))
2519 VEC_safe_push (tree
, gc
, types
[i
], type
);
2520 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2521 type
= type_promotes_to (type
);
2523 VEC_safe_push (tree
, gc
, types
[i
], type
);
2527 /* Run through the possible parameter types of both arguments,
2528 creating candidates with those parameter types. */
2529 FOR_EACH_VEC_ELT_REVERSE (tree
, types
[0], ix
, t
)
2534 if (!VEC_empty (tree
, types
[1]))
2535 FOR_EACH_VEC_ELT_REVERSE (tree
, types
[1], jx
, u
)
2536 add_builtin_candidate
2537 (candidates
, code
, code2
, fnname
, t
,
2538 u
, args
, argtypes
, flags
);
2540 add_builtin_candidate
2541 (candidates
, code
, code2
, fnname
, t
,
2542 NULL_TREE
, args
, argtypes
, flags
);
2545 release_tree_vector (types
[0]);
2546 release_tree_vector (types
[1]);
2550 /* If TMPL can be successfully instantiated as indicated by
2551 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2553 TMPL is the template. EXPLICIT_TARGS are any explicit template
2554 arguments. ARGLIST is the arguments provided at the call-site.
2555 This does not change ARGLIST. The RETURN_TYPE is the desired type
2556 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
2557 as for add_function_candidate. If an OBJ is supplied, FLAGS and
2558 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
2560 static struct z_candidate
*
2561 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
2562 tree ctype
, tree explicit_targs
, tree first_arg
,
2563 const VEC(tree
,gc
) *arglist
, tree return_type
,
2564 tree access_path
, tree conversion_path
,
2565 int flags
, tree obj
, unification_kind_t strict
)
2567 int ntparms
= DECL_NTPARMS (tmpl
);
2568 tree targs
= make_tree_vec (ntparms
);
2569 unsigned int len
= VEC_length (tree
, arglist
);
2570 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
2571 unsigned int skip_without_in_chrg
= 0;
2572 tree first_arg_without_in_chrg
= first_arg
;
2573 tree
*args_without_in_chrg
;
2574 unsigned int nargs_without_in_chrg
;
2575 unsigned int ia
, ix
;
2577 struct z_candidate
*cand
;
2581 /* We don't do deduction on the in-charge parameter, the VTT
2582 parameter or 'this'. */
2583 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
2585 if (first_arg_without_in_chrg
!= NULL_TREE
)
2586 first_arg_without_in_chrg
= NULL_TREE
;
2588 ++skip_without_in_chrg
;
2591 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
2592 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
2593 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
2595 if (first_arg_without_in_chrg
!= NULL_TREE
)
2596 first_arg_without_in_chrg
= NULL_TREE
;
2598 ++skip_without_in_chrg
;
2601 if (len
< skip_without_in_chrg
)
2604 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
2605 + (len
- skip_without_in_chrg
));
2606 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
2608 if (first_arg_without_in_chrg
!= NULL_TREE
)
2610 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
2613 for (ix
= skip_without_in_chrg
;
2614 VEC_iterate (tree
, arglist
, ix
, arg
);
2617 args_without_in_chrg
[ia
] = arg
;
2620 gcc_assert (ia
== nargs_without_in_chrg
);
2622 i
= fn_type_unification (tmpl
, explicit_targs
, targs
,
2623 args_without_in_chrg
,
2624 nargs_without_in_chrg
,
2625 return_type
, strict
, flags
);
2630 fn
= instantiate_template (tmpl
, targs
, tf_none
);
2631 if (fn
== error_mark_node
)
2636 A member function template is never instantiated to perform the
2637 copy of a class object to an object of its class type.
2639 It's a little unclear what this means; the standard explicitly
2640 does allow a template to be used to copy a class. For example,
2645 template <class T> A(const T&);
2648 void g () { A a (f ()); }
2650 the member template will be used to make the copy. The section
2651 quoted above appears in the paragraph that forbids constructors
2652 whose only parameter is (a possibly cv-qualified variant of) the
2653 class type, and a logical interpretation is that the intent was
2654 to forbid the instantiation of member templates which would then
2656 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
2658 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
2659 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
2664 if (obj
!= NULL_TREE
)
2665 /* Aha, this is a conversion function. */
2666 cand
= add_conv_candidate (candidates
, fn
, obj
, first_arg
, arglist
,
2667 access_path
, conversion_path
);
2669 cand
= add_function_candidate (candidates
, fn
, ctype
,
2670 first_arg
, arglist
, access_path
,
2671 conversion_path
, flags
);
2672 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
2673 /* This situation can occur if a member template of a template
2674 class is specialized. Then, instantiate_template might return
2675 an instantiation of the specialization, in which case the
2676 DECL_TI_TEMPLATE field will point at the original
2677 specialization. For example:
2679 template <class T> struct S { template <class U> void f(U);
2680 template <> void f(int) {}; };
2684 Here, TMPL will be template <class U> S<double>::f(U).
2685 And, instantiate template will give us the specialization
2686 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
2687 for this will point at template <class T> template <> S<T>::f(int),
2688 so that we can find the definition. For the purposes of
2689 overload resolution, however, we want the original TMPL. */
2690 cand
->template_decl
= build_template_info (tmpl
, targs
);
2692 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
2693 cand
->explicit_targs
= explicit_targs
;
2697 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
2698 access_path
, conversion_path
, 0);
2702 static struct z_candidate
*
2703 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
2704 tree explicit_targs
, tree first_arg
,
2705 const VEC(tree
,gc
) *arglist
, tree return_type
,
2706 tree access_path
, tree conversion_path
, int flags
,
2707 unification_kind_t strict
)
2710 add_template_candidate_real (candidates
, tmpl
, ctype
,
2711 explicit_targs
, first_arg
, arglist
,
2712 return_type
, access_path
, conversion_path
,
2713 flags
, NULL_TREE
, strict
);
2717 static struct z_candidate
*
2718 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
2719 tree obj
, tree first_arg
,
2720 const VEC(tree
,gc
) *arglist
,
2721 tree return_type
, tree access_path
,
2722 tree conversion_path
)
2725 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
2726 first_arg
, arglist
, return_type
, access_path
,
2727 conversion_path
, 0, obj
, DEDUCE_CONV
);
2730 /* The CANDS are the set of candidates that were considered for
2731 overload resolution. Return the set of viable candidates, or CANDS
2732 if none are viable. If any of the candidates were viable, set
2733 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
2734 considered viable only if it is strictly viable. */
2736 static struct z_candidate
*
2737 splice_viable (struct z_candidate
*cands
,
2741 struct z_candidate
*viable
;
2742 struct z_candidate
**last_viable
;
2743 struct z_candidate
**cand
;
2746 last_viable
= &viable
;
2747 *any_viable_p
= false;
2752 struct z_candidate
*c
= *cand
;
2753 if (strict_p
? c
->viable
== 1 : c
->viable
)
2758 last_viable
= &c
->next
;
2759 *any_viable_p
= true;
2765 return viable
? viable
: cands
;
2769 any_strictly_viable (struct z_candidate
*cands
)
2771 for (; cands
; cands
= cands
->next
)
2772 if (cands
->viable
== 1)
2777 /* OBJ is being used in an expression like "OBJ.f (...)". In other
2778 words, it is about to become the "this" pointer for a member
2779 function call. Take the address of the object. */
2782 build_this (tree obj
)
2784 /* In a template, we are only concerned about the type of the
2785 expression, so we can take a shortcut. */
2786 if (processing_template_decl
)
2787 return build_address (obj
);
2789 return cp_build_addr_expr (obj
, tf_warning_or_error
);
2792 /* Returns true iff functions are equivalent. Equivalent functions are
2793 not '==' only if one is a function-local extern function or if
2794 both are extern "C". */
2797 equal_functions (tree fn1
, tree fn2
)
2799 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
2801 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
2803 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
2804 || DECL_EXTERN_C_FUNCTION_P (fn1
))
2805 return decls_match (fn1
, fn2
);
2809 /* Print information about one overload candidate CANDIDATE. MSGSTR
2810 is the text to print before the candidate itself.
2812 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
2813 to have been run through gettext by the caller. This wart makes
2814 life simpler in print_z_candidates and for the translators. */
2817 print_z_candidate (const char *msgstr
, struct z_candidate
*candidate
)
2819 if (TREE_CODE (candidate
->fn
) == IDENTIFIER_NODE
)
2821 if (candidate
->num_convs
== 3)
2822 inform (input_location
, "%s %D(%T, %T, %T) <built-in>", msgstr
, candidate
->fn
,
2823 candidate
->convs
[0]->type
,
2824 candidate
->convs
[1]->type
,
2825 candidate
->convs
[2]->type
);
2826 else if (candidate
->num_convs
== 2)
2827 inform (input_location
, "%s %D(%T, %T) <built-in>", msgstr
, candidate
->fn
,
2828 candidate
->convs
[0]->type
,
2829 candidate
->convs
[1]->type
);
2831 inform (input_location
, "%s %D(%T) <built-in>", msgstr
, candidate
->fn
,
2832 candidate
->convs
[0]->type
);
2834 else if (TYPE_P (candidate
->fn
))
2835 inform (input_location
, "%s %T <conversion>", msgstr
, candidate
->fn
);
2836 else if (candidate
->viable
== -1)
2837 inform (input_location
, "%s %+#D <near match>", msgstr
, candidate
->fn
);
2838 else if (DECL_DELETED_FN (STRIP_TEMPLATE (candidate
->fn
)))
2839 inform (input_location
, "%s %+#D <deleted>", msgstr
, candidate
->fn
);
2841 inform (input_location
, "%s %+#D", msgstr
, candidate
->fn
);
2845 print_z_candidates (struct z_candidate
*candidates
)
2848 struct z_candidate
*cand1
;
2849 struct z_candidate
**cand2
;
2855 /* Remove non-viable deleted candidates. */
2857 for (cand2
= &cand1
; *cand2
; )
2859 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
2860 && !(*cand2
)->viable
2861 && DECL_DELETED_FN ((*cand2
)->fn
))
2862 *cand2
= (*cand2
)->next
;
2864 cand2
= &(*cand2
)->next
;
2866 /* ...if there are any non-deleted ones. */
2870 /* There may be duplicates in the set of candidates. We put off
2871 checking this condition as long as possible, since we have no way
2872 to eliminate duplicates from a set of functions in less than n^2
2873 time. Now we are about to emit an error message, so it is more
2874 permissible to go slowly. */
2875 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
2877 tree fn
= cand1
->fn
;
2878 /* Skip builtin candidates and conversion functions. */
2881 cand2
= &cand1
->next
;
2884 if (DECL_P ((*cand2
)->fn
)
2885 && equal_functions (fn
, (*cand2
)->fn
))
2886 *cand2
= (*cand2
)->next
;
2888 cand2
= &(*cand2
)->next
;
2892 str
= candidates
->next
? _("candidates are:") : _("candidate is:");
2894 for (; candidates
; candidates
= candidates
->next
)
2896 print_z_candidate (spaces
? spaces
: str
, candidates
);
2897 spaces
= spaces
? spaces
: get_spaces (str
);
2902 /* USER_SEQ is a user-defined conversion sequence, beginning with a
2903 USER_CONV. STD_SEQ is the standard conversion sequence applied to
2904 the result of the conversion function to convert it to the final
2905 desired type. Merge the two sequences into a single sequence,
2906 and return the merged sequence. */
2909 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
2913 gcc_assert (user_seq
->kind
== ck_user
);
2915 /* Find the end of the second conversion sequence. */
2917 while ((*t
)->kind
!= ck_identity
)
2918 t
= &((*t
)->u
.next
);
2920 /* Replace the identity conversion with the user conversion
2924 /* The entire sequence is a user-conversion sequence. */
2925 std_seq
->user_conv_p
= true;
2930 /* Handle overload resolution for initializing an object of class type from
2931 an initializer list. First we look for a suitable constructor that
2932 takes a std::initializer_list; if we don't find one, we then look for a
2933 non-list constructor.
2935 Parameters are as for add_candidates, except that the arguments are in
2936 the form of a CONSTRUCTOR (the initializer list) rather than a VEC, and
2937 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
2940 add_list_candidates (tree fns
, tree first_arg
,
2941 tree init_list
, tree totype
,
2942 tree explicit_targs
, bool template_only
,
2943 tree conversion_path
, tree access_path
,
2945 struct z_candidate
**candidates
)
2949 gcc_assert (*candidates
== NULL
);
2951 /* For list-initialization we consider explicit constructors, but
2952 give an error if one is selected. */
2953 flags
&= ~LOOKUP_ONLYCONVERTING
;
2954 /* And we don't allow narrowing conversions. We also use this flag to
2955 avoid the copy constructor call for copy-list-initialization. */
2956 flags
|= LOOKUP_NO_NARROWING
;
2958 /* Always use the default constructor if the list is empty (DR 990). */
2959 if (CONSTRUCTOR_NELTS (init_list
) == 0
2960 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
2962 /* If the class has a list ctor, try passing the list as a single
2963 argument first, but only consider list ctors. */
2964 else if (TYPE_HAS_LIST_CTOR (totype
))
2966 flags
|= LOOKUP_LIST_ONLY
;
2967 args
= make_tree_vector_single (init_list
);
2968 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
2969 explicit_targs
, template_only
, conversion_path
,
2970 access_path
, flags
, candidates
);
2971 if (any_strictly_viable (*candidates
))
2975 args
= ctor_to_vec (init_list
);
2977 /* We aren't looking for list-ctors anymore. */
2978 flags
&= ~LOOKUP_LIST_ONLY
;
2979 /* We allow more user-defined conversions within an init-list. */
2980 flags
&= ~LOOKUP_NO_CONVERSION
;
2981 /* But not for the copy ctor. */
2982 flags
|= LOOKUP_NO_COPY_CTOR_CONVERSION
;
2984 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
2985 explicit_targs
, template_only
, conversion_path
,
2986 access_path
, flags
, candidates
);
2989 /* Returns the best overload candidate to perform the requested
2990 conversion. This function is used for three the overloading situations
2991 described in [over.match.copy], [over.match.conv], and [over.match.ref].
2992 If TOTYPE is a REFERENCE_TYPE, we're trying to find an lvalue binding as
2993 per [dcl.init.ref], so we ignore temporary bindings. */
2995 static struct z_candidate
*
2996 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
)
2998 struct z_candidate
*candidates
, *cand
;
2999 tree fromtype
= TREE_TYPE (expr
);
3000 tree ctors
= NULL_TREE
;
3001 tree conv_fns
= NULL_TREE
;
3002 conversion
*conv
= NULL
;
3003 tree first_arg
= NULL_TREE
;
3004 VEC(tree
,gc
) *args
= NULL
;
3008 /* We represent conversion within a hierarchy using RVALUE_CONV and
3009 BASE_CONV, as specified by [over.best.ics]; these become plain
3010 constructor calls, as specified in [dcl.init]. */
3011 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3012 || !DERIVED_FROM_P (totype
, fromtype
));
3014 if (MAYBE_CLASS_TYPE_P (totype
))
3015 ctors
= lookup_fnfields (totype
, complete_ctor_identifier
, 0);
3017 if (MAYBE_CLASS_TYPE_P (fromtype
))
3019 tree to_nonref
= non_reference (totype
);
3020 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3021 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3022 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3024 /* [class.conv.fct] A conversion function is never used to
3025 convert a (possibly cv-qualified) object to the (possibly
3026 cv-qualified) same object type (or a reference to it), to a
3027 (possibly cv-qualified) base class of that type (or a
3028 reference to it)... */
3031 conv_fns
= lookup_conversions (fromtype
);
3035 flags
|= LOOKUP_NO_CONVERSION
;
3036 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3037 flags
|= LOOKUP_NO_NARROWING
;
3039 /* It's OK to bind a temporary for converting constructor arguments, but
3040 not in converting the return value of a conversion operator. */
3041 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
);
3042 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3046 int ctorflags
= flags
;
3047 ctors
= BASELINK_FUNCTIONS (ctors
);
3049 first_arg
= build_int_cst (build_pointer_type (totype
), 0);
3051 /* We should never try to call the abstract or base constructor
3053 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors
))
3054 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors
)));
3056 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3058 /* List-initialization. */
3059 add_list_candidates (ctors
, first_arg
, expr
, totype
, NULL_TREE
,
3060 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3061 ctorflags
, &candidates
);
3065 args
= make_tree_vector_single (expr
);
3066 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3067 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3068 ctorflags
, &candidates
);
3071 for (cand
= candidates
; cand
; cand
= cand
->next
)
3073 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3075 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3076 set, then this is copy-initialization. In that case, "The
3077 result of the call is then used to direct-initialize the
3078 object that is the destination of the copy-initialization."
3081 We represent this in the conversion sequence with an
3082 rvalue conversion, which means a constructor call. */
3083 if (TREE_CODE (totype
) != REFERENCE_TYPE
3084 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3086 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3091 first_arg
= build_this (expr
);
3093 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3095 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3096 struct z_candidate
*old_candidates
;
3098 /* If we are called to convert to a reference type, we are trying to
3099 find an lvalue binding, so don't even consider temporaries. If
3100 we don't find an lvalue binding, the caller will try again to
3101 look for a temporary binding. */
3102 if (TREE_CODE (totype
) == REFERENCE_TYPE
)
3103 convflags
|= LOOKUP_NO_TEMP_BIND
;
3105 old_candidates
= candidates
;
3106 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
3108 conversion_path
, TYPE_BINFO (fromtype
),
3109 flags
, &candidates
);
3111 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
3114 = implicit_conversion (totype
,
3115 TREE_TYPE (TREE_TYPE (cand
->fn
)),
3117 /*c_cast_p=*/false, convflags
);
3119 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3120 copy-initialization. In that case, "The result of the
3121 call is then used to direct-initialize the object that is
3122 the destination of the copy-initialization." [dcl.init]
3124 We represent this in the conversion sequence with an
3125 rvalue conversion, which means a constructor call. But
3126 don't add a second rvalue conversion if there's already
3127 one there. Which there really shouldn't be, but it's
3128 harmless since we'd add it here anyway. */
3129 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
3130 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3131 ics
= build_conv (ck_rvalue
, totype
, ics
);
3133 cand
->second_conv
= ics
;
3137 else if (cand
->viable
== 1 && ics
->bad_p
)
3142 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
3146 cand
= tourney (candidates
);
3149 if (flags
& LOOKUP_COMPLAIN
)
3151 error ("conversion from %qT to %qT is ambiguous",
3153 print_z_candidates (candidates
);
3156 cand
= candidates
; /* any one will do */
3157 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
3158 cand
->second_conv
->user_conv_p
= true;
3159 if (!any_strictly_viable (candidates
))
3160 cand
->second_conv
->bad_p
= true;
3161 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3162 ambiguous conversion is no worse than another user-defined
3168 /* Build the user conversion sequence. */
3171 (DECL_CONSTRUCTOR_P (cand
->fn
)
3172 ? totype
: non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)))),
3173 build_identity_conv (TREE_TYPE (expr
), expr
));
3176 /* Remember that this was a list-initialization. */
3177 if (flags
& LOOKUP_NO_NARROWING
)
3178 conv
->check_narrowing
= true;
3180 /* Combine it with the second conversion sequence. */
3181 cand
->second_conv
= merge_conversion_sequences (conv
,
3184 if (cand
->viable
== -1)
3185 cand
->second_conv
->bad_p
= true;
3191 build_user_type_conversion (tree totype
, tree expr
, int flags
)
3193 struct z_candidate
*cand
3194 = build_user_type_conversion_1 (totype
, expr
, flags
);
3198 if (cand
->second_conv
->kind
== ck_ambig
)
3199 return error_mark_node
;
3200 expr
= convert_like (cand
->second_conv
, expr
, tf_warning_or_error
);
3201 return convert_from_reference (expr
);
3206 /* Subroutine of convert_nontype_argument.
3208 EXPR is an argument for a template non-type parameter of integral or
3209 enumeration type. Do any necessary conversions (that are permitted for
3210 non-type arguments) to convert it to the parameter type.
3212 If conversion is successful, returns the converted expression;
3213 otherwise, returns error_mark_node. */
3216 build_integral_nontype_arg_conv (tree type
, tree expr
, tsubst_flags_t complain
)
3222 if (error_operand_p (expr
))
3223 return error_mark_node
;
3225 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
3227 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3228 p
= conversion_obstack_alloc (0);
3230 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
3234 /* for a non-type template-parameter of integral or
3235 enumeration type, integral promotions (4.5) and integral
3236 conversions (4.7) are applied. */
3237 /* It should be sufficient to check the outermost conversion step, since
3238 there are no qualification conversions to integer type. */
3242 /* A conversion function is OK. If it isn't constexpr, we'll
3243 complain later that the argument isn't constant. */
3245 /* The lvalue-to-rvalue conversion is OK. */
3251 t
= conv
->u
.next
->type
;
3252 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
))
3255 if (complain
& tf_error
)
3256 error ("conversion from %qT to %qT not considered for "
3257 "non-type template argument", t
, type
);
3258 /* and fall through. */
3266 expr
= convert_like (conv
, expr
, complain
);
3268 expr
= error_mark_node
;
3270 /* Free all the conversions we allocated. */
3271 obstack_free (&conversion_obstack
, p
);
3276 /* Do any initial processing on the arguments to a function call. */
3278 static VEC(tree
,gc
) *
3279 resolve_args (VEC(tree
,gc
) *args
)
3284 FOR_EACH_VEC_ELT (tree
, args
, ix
, arg
)
3286 if (error_operand_p (arg
))
3288 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
3290 error ("invalid use of void expression");
3293 else if (invalid_nonstatic_memfn_p (arg
, tf_warning_or_error
))
3299 /* Perform overload resolution on FN, which is called with the ARGS.
3301 Return the candidate function selected by overload resolution, or
3302 NULL if the event that overload resolution failed. In the case
3303 that overload resolution fails, *CANDIDATES will be the set of
3304 candidates considered, and ANY_VIABLE_P will be set to true or
3305 false to indicate whether or not any of the candidates were
3308 The ARGS should already have gone through RESOLVE_ARGS before this
3309 function is called. */
3311 static struct z_candidate
*
3312 perform_overload_resolution (tree fn
,
3313 const VEC(tree
,gc
) *args
,
3314 struct z_candidate
**candidates
,
3317 struct z_candidate
*cand
;
3318 tree explicit_targs
= NULL_TREE
;
3319 int template_only
= 0;
3322 *any_viable_p
= true;
3325 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
3326 || TREE_CODE (fn
) == TEMPLATE_DECL
3327 || TREE_CODE (fn
) == OVERLOAD
3328 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
3330 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3332 explicit_targs
= TREE_OPERAND (fn
, 1);
3333 fn
= TREE_OPERAND (fn
, 0);
3337 /* Add the various candidate functions. */
3338 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
3339 explicit_targs
, template_only
,
3340 /*conversion_path=*/NULL_TREE
,
3341 /*access_path=*/NULL_TREE
,
3345 *candidates
= splice_viable (*candidates
, pedantic
, any_viable_p
);
3349 cand
= tourney (*candidates
);
3353 /* Return an expression for a call to FN (a namespace-scope function,
3354 or a static member function) with the ARGS. This may change
3358 build_new_function_call (tree fn
, VEC(tree
,gc
) **args
, bool koenig_p
,
3359 tsubst_flags_t complain
)
3361 struct z_candidate
*candidates
, *cand
;
3366 if (args
!= NULL
&& *args
!= NULL
)
3368 *args
= resolve_args (*args
);
3370 return error_mark_node
;
3373 /* If this function was found without using argument dependent
3374 lookup, then we want to ignore any undeclared friend
3380 fn
= remove_hidden_names (fn
);
3383 if (complain
& tf_error
)
3384 error ("no matching function for call to %<%D(%A)%>",
3385 DECL_NAME (OVL_CURRENT (orig_fn
)),
3386 build_tree_list_vec (*args
));
3387 return error_mark_node
;
3391 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3392 p
= conversion_obstack_alloc (0);
3394 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
);
3398 if (complain
& tf_error
)
3400 if (!any_viable_p
&& candidates
&& ! candidates
->next
3401 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
3402 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
3403 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3404 fn
= TREE_OPERAND (fn
, 0);
3406 error ("no matching function for call to %<%D(%A)%>",
3407 DECL_NAME (OVL_CURRENT (fn
)), build_tree_list_vec (*args
));
3409 error ("call of overloaded %<%D(%A)%> is ambiguous",
3410 DECL_NAME (OVL_CURRENT (fn
)), build_tree_list_vec (*args
));
3412 print_z_candidates (candidates
);
3414 result
= error_mark_node
;
3417 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
3419 /* Free all the conversions we allocated. */
3420 obstack_free (&conversion_obstack
, p
);
3425 /* Build a call to a global operator new. FNNAME is the name of the
3426 operator (either "operator new" or "operator new[]") and ARGS are
3427 the arguments provided. This may change ARGS. *SIZE points to the
3428 total number of bytes required by the allocation, and is updated if
3429 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
3430 be used. If this function determines that no cookie should be
3431 used, after all, *COOKIE_SIZE is set to NULL_TREE. If FN is
3432 non-NULL, it will be set, upon return, to the allocation function
3436 build_operator_new_call (tree fnname
, VEC(tree
,gc
) **args
,
3437 tree
*size
, tree
*cookie_size
,
3441 struct z_candidate
*candidates
;
3442 struct z_candidate
*cand
;
3447 VEC_safe_insert (tree
, gc
, *args
, 0, *size
);
3448 *args
= resolve_args (*args
);
3450 return error_mark_node
;
3456 If this lookup fails to find the name, or if the allocated type
3457 is not a class type, the allocation function's name is looked
3458 up in the global scope.
3460 we disregard block-scope declarations of "operator new". */
3461 fns
= lookup_function_nonclass (fnname
, *args
, /*block_p=*/false);
3463 /* Figure out what function is being called. */
3464 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
);
3466 /* If no suitable function could be found, issue an error message
3471 error ("no matching function for call to %<%D(%A)%>",
3472 DECL_NAME (OVL_CURRENT (fns
)), build_tree_list_vec (*args
));
3474 error ("call of overloaded %<%D(%A)%> is ambiguous",
3475 DECL_NAME (OVL_CURRENT (fns
)), build_tree_list_vec (*args
));
3477 print_z_candidates (candidates
);
3478 return error_mark_node
;
3481 /* If a cookie is required, add some extra space. Whether
3482 or not a cookie is required cannot be determined until
3483 after we know which function was called. */
3486 bool use_cookie
= true;
3487 if (!abi_version_at_least (2))
3489 /* In G++ 3.2, the check was implemented incorrectly; it
3490 looked at the placement expression, rather than the
3491 type of the function. */
3492 if (VEC_length (tree
, *args
) == 2
3493 && same_type_p (TREE_TYPE (VEC_index (tree
, *args
, 1)),
3501 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
3502 /* Skip the size_t parameter. */
3503 arg_types
= TREE_CHAIN (arg_types
);
3504 /* Check the remaining parameters (if any). */
3506 && TREE_CHAIN (arg_types
) == void_list_node
3507 && same_type_p (TREE_VALUE (arg_types
),
3511 /* If we need a cookie, adjust the number of bytes allocated. */
3514 /* Update the total size. */
3515 *size
= size_binop (PLUS_EXPR
, *size
, *cookie_size
);
3516 /* Update the argument list to reflect the adjusted size. */
3517 VEC_replace (tree
, *args
, 0, *size
);
3520 *cookie_size
= NULL_TREE
;
3523 /* Tell our caller which function we decided to call. */
3527 /* Build the CALL_EXPR. */
3528 return build_over_call (cand
, LOOKUP_NORMAL
, tf_warning_or_error
);
3531 /* Build a new call to operator(). This may change ARGS. */
3534 build_op_call (tree obj
, VEC(tree
,gc
) **args
, tsubst_flags_t complain
)
3536 struct z_candidate
*candidates
= 0, *cand
;
3537 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
3538 tree type
= TREE_TYPE (obj
);
3540 tree result
= NULL_TREE
;
3543 if (error_operand_p (obj
))
3544 return error_mark_node
;
3546 obj
= prep_operand (obj
);
3548 if (TYPE_PTRMEMFUNC_P (type
))
3550 if (complain
& tf_error
)
3551 /* It's no good looking for an overloaded operator() on a
3552 pointer-to-member-function. */
3553 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj
);
3554 return error_mark_node
;
3557 if (TYPE_BINFO (type
))
3559 fns
= lookup_fnfields (TYPE_BINFO (type
), ansi_opname (CALL_EXPR
), 1);
3560 if (fns
== error_mark_node
)
3561 return error_mark_node
;
3566 if (args
!= NULL
&& *args
!= NULL
)
3568 *args
= resolve_args (*args
);
3570 return error_mark_node
;
3573 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3574 p
= conversion_obstack_alloc (0);
3578 first_mem_arg
= build_this (obj
);
3580 add_candidates (BASELINK_FUNCTIONS (fns
),
3581 first_mem_arg
, *args
, NULL_TREE
,
3583 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
3584 LOOKUP_NORMAL
, &candidates
);
3587 convs
= lookup_conversions (type
);
3589 for (; convs
; convs
= TREE_CHAIN (convs
))
3591 tree fns
= TREE_VALUE (convs
);
3592 tree totype
= TREE_TYPE (convs
);
3594 if ((TREE_CODE (totype
) == POINTER_TYPE
3595 && TREE_CODE (TREE_TYPE (totype
)) == FUNCTION_TYPE
)
3596 || (TREE_CODE (totype
) == REFERENCE_TYPE
3597 && TREE_CODE (TREE_TYPE (totype
)) == FUNCTION_TYPE
)
3598 || (TREE_CODE (totype
) == REFERENCE_TYPE
3599 && TREE_CODE (TREE_TYPE (totype
)) == POINTER_TYPE
3600 && TREE_CODE (TREE_TYPE (TREE_TYPE (totype
))) == FUNCTION_TYPE
))
3601 for (; fns
; fns
= OVL_NEXT (fns
))
3603 tree fn
= OVL_CURRENT (fns
);
3605 if (DECL_NONCONVERTING_P (fn
))
3608 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
3609 add_template_conv_candidate
3610 (&candidates
, fn
, obj
, NULL_TREE
, *args
, totype
,
3611 /*access_path=*/NULL_TREE
,
3612 /*conversion_path=*/NULL_TREE
);
3614 add_conv_candidate (&candidates
, fn
, obj
, NULL_TREE
,
3615 *args
, /*conversion_path=*/NULL_TREE
,
3616 /*access_path=*/NULL_TREE
);
3620 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
3623 if (complain
& tf_error
)
3625 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
3626 build_tree_list_vec (*args
));
3627 print_z_candidates (candidates
);
3629 result
= error_mark_node
;
3633 cand
= tourney (candidates
);
3636 if (complain
& tf_error
)
3638 error ("call of %<(%T) (%A)%> is ambiguous",
3639 TREE_TYPE (obj
), build_tree_list_vec (*args
));
3640 print_z_candidates (candidates
);
3642 result
= error_mark_node
;
3644 /* Since cand->fn will be a type, not a function, for a conversion
3645 function, we must be careful not to unconditionally look at
3647 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
3648 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
) == CALL_EXPR
)
3649 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
3652 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
, -1,
3654 obj
= convert_from_reference (obj
);
3655 result
= cp_build_function_call_vec (obj
, args
, complain
);
3659 /* Free all the conversions we allocated. */
3660 obstack_free (&conversion_obstack
, p
);
3666 op_error (enum tree_code code
, enum tree_code code2
,
3667 tree arg1
, tree arg2
, tree arg3
, bool match
)
3671 if (code
== MODIFY_EXPR
)
3672 opname
= assignment_operator_name_info
[code2
].name
;
3674 opname
= operator_name_info
[code
].name
;
3680 error ("ambiguous overload for ternary %<operator?:%> "
3681 "in %<%E ? %E : %E%>", arg1
, arg2
, arg3
);
3683 error ("no match for ternary %<operator?:%> "
3684 "in %<%E ? %E : %E%>", arg1
, arg2
, arg3
);
3687 case POSTINCREMENT_EXPR
:
3688 case POSTDECREMENT_EXPR
:
3690 error ("ambiguous overload for %<operator%s%> in %<%E%s%>",
3691 opname
, arg1
, opname
);
3693 error ("no match for %<operator%s%> in %<%E%s%>",
3694 opname
, arg1
, opname
);
3699 error ("ambiguous overload for %<operator[]%> in %<%E[%E]%>",
3702 error ("no match for %<operator[]%> in %<%E[%E]%>",
3709 error ("ambiguous overload for %qs in %<%s %E%>",
3710 opname
, opname
, arg1
);
3712 error ("no match for %qs in %<%s %E%>",
3713 opname
, opname
, arg1
);
3719 error ("ambiguous overload for %<operator%s%> in %<%E %s %E%>",
3720 opname
, arg1
, opname
, arg2
);
3722 error ("no match for %<operator%s%> in %<%E %s %E%>",
3723 opname
, arg1
, opname
, arg2
);
3726 error ("ambiguous overload for %<operator%s%> in %<%s%E%>",
3727 opname
, opname
, arg1
);
3729 error ("no match for %<operator%s%> in %<%s%E%>",
3730 opname
, opname
, arg1
);
3735 /* Return the implicit conversion sequence that could be used to
3736 convert E1 to E2 in [expr.cond]. */
3739 conditional_conversion (tree e1
, tree e2
)
3741 tree t1
= non_reference (TREE_TYPE (e1
));
3742 tree t2
= non_reference (TREE_TYPE (e2
));
3748 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
3749 implicitly converted (clause _conv_) to the type "reference to
3750 T2", subject to the constraint that in the conversion the
3751 reference must bind directly (_dcl.init.ref_) to E1. */
3752 if (real_lvalue_p (e2
))
3754 conv
= implicit_conversion (build_reference_type (t2
),
3758 LOOKUP_NO_TEMP_BIND
|LOOKUP_ONLYCONVERTING
);
3765 If E1 and E2 have class type, and the underlying class types are
3766 the same or one is a base class of the other: E1 can be converted
3767 to match E2 if the class of T2 is the same type as, or a base
3768 class of, the class of T1, and the cv-qualification of T2 is the
3769 same cv-qualification as, or a greater cv-qualification than, the
3770 cv-qualification of T1. If the conversion is applied, E1 is
3771 changed to an rvalue of type T2 that still refers to the original
3772 source class object (or the appropriate subobject thereof). */
3773 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
3774 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
3776 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
3778 conv
= build_identity_conv (t1
, e1
);
3779 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
3780 TYPE_MAIN_VARIANT (t2
)))
3781 conv
= build_conv (ck_base
, t2
, conv
);
3783 conv
= build_conv (ck_rvalue
, t2
, conv
);
3792 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
3793 converted to the type that expression E2 would have if E2 were
3794 converted to an rvalue (or the type it has, if E2 is an rvalue). */
3795 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
3799 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
3800 arguments to the conditional expression. */
3803 build_conditional_expr (tree arg1
, tree arg2
, tree arg3
,
3804 tsubst_flags_t complain
)
3808 tree result
= NULL_TREE
;
3809 tree result_type
= NULL_TREE
;
3810 bool lvalue_p
= true;
3811 struct z_candidate
*candidates
= 0;
3812 struct z_candidate
*cand
;
3815 /* As a G++ extension, the second argument to the conditional can be
3816 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
3817 c'.) If the second operand is omitted, make sure it is
3818 calculated only once. */
3821 if (complain
& tf_error
)
3822 pedwarn (input_location
, OPT_pedantic
,
3823 "ISO C++ forbids omitting the middle term of a ?: expression");
3825 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
3826 if (real_lvalue_p (arg1
))
3827 arg2
= arg1
= stabilize_reference (arg1
);
3829 arg2
= arg1
= save_expr (arg1
);
3834 The first expression is implicitly converted to bool (clause
3836 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
3839 /* If something has already gone wrong, just pass that fact up the
3841 if (error_operand_p (arg1
)
3842 || error_operand_p (arg2
)
3843 || error_operand_p (arg3
))
3844 return error_mark_node
;
3848 If either the second or the third operand has type (possibly
3849 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
3850 array-to-pointer (_conv.array_), and function-to-pointer
3851 (_conv.func_) standard conversions are performed on the second
3852 and third operands. */
3853 arg2_type
= unlowered_expr_type (arg2
);
3854 arg3_type
= unlowered_expr_type (arg3
);
3855 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
3857 /* Do the conversions. We don't these for `void' type arguments
3858 since it can't have any effect and since decay_conversion
3859 does not handle that case gracefully. */
3860 if (!VOID_TYPE_P (arg2_type
))
3861 arg2
= decay_conversion (arg2
);
3862 if (!VOID_TYPE_P (arg3_type
))
3863 arg3
= decay_conversion (arg3
);
3864 arg2_type
= TREE_TYPE (arg2
);
3865 arg3_type
= TREE_TYPE (arg3
);
3869 One of the following shall hold:
3871 --The second or the third operand (but not both) is a
3872 throw-expression (_except.throw_); the result is of the
3873 type of the other and is an rvalue.
3875 --Both the second and the third operands have type void; the
3876 result is of type void and is an rvalue.
3878 We must avoid calling force_rvalue for expressions of type
3879 "void" because it will complain that their value is being
3881 if (TREE_CODE (arg2
) == THROW_EXPR
3882 && TREE_CODE (arg3
) != THROW_EXPR
)
3884 if (!VOID_TYPE_P (arg3_type
))
3885 arg3
= force_rvalue (arg3
);
3886 arg3_type
= TREE_TYPE (arg3
);
3887 result_type
= arg3_type
;
3889 else if (TREE_CODE (arg2
) != THROW_EXPR
3890 && TREE_CODE (arg3
) == THROW_EXPR
)
3892 if (!VOID_TYPE_P (arg2_type
))
3893 arg2
= force_rvalue (arg2
);
3894 arg2_type
= TREE_TYPE (arg2
);
3895 result_type
= arg2_type
;
3897 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
3898 result_type
= void_type_node
;
3901 if (complain
& tf_error
)
3903 if (VOID_TYPE_P (arg2_type
))
3904 error ("second operand to the conditional operator "
3905 "is of type %<void%>, "
3906 "but the third operand is neither a throw-expression "
3907 "nor of type %<void%>");
3909 error ("third operand to the conditional operator "
3910 "is of type %<void%>, "
3911 "but the second operand is neither a throw-expression "
3912 "nor of type %<void%>");
3914 return error_mark_node
;
3918 goto valid_operands
;
3922 Otherwise, if the second and third operand have different types,
3923 and either has (possibly cv-qualified) class type, an attempt is
3924 made to convert each of those operands to the type of the other. */
3925 else if (!same_type_p (arg2_type
, arg3_type
)
3926 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
3931 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3932 p
= conversion_obstack_alloc (0);
3934 conv2
= conditional_conversion (arg2
, arg3
);
3935 conv3
= conditional_conversion (arg3
, arg2
);
3939 If both can be converted, or one can be converted but the
3940 conversion is ambiguous, the program is ill-formed. If
3941 neither can be converted, the operands are left unchanged and
3942 further checking is performed as described below. If exactly
3943 one conversion is possible, that conversion is applied to the
3944 chosen operand and the converted operand is used in place of
3945 the original operand for the remainder of this section. */
3946 if ((conv2
&& !conv2
->bad_p
3947 && conv3
&& !conv3
->bad_p
)
3948 || (conv2
&& conv2
->kind
== ck_ambig
)
3949 || (conv3
&& conv3
->kind
== ck_ambig
))
3951 error ("operands to ?: have different types %qT and %qT",
3952 arg2_type
, arg3_type
);
3953 result
= error_mark_node
;
3955 else if (conv2
&& (!conv2
->bad_p
|| !conv3
))
3957 arg2
= convert_like (conv2
, arg2
, complain
);
3958 arg2
= convert_from_reference (arg2
);
3959 arg2_type
= TREE_TYPE (arg2
);
3960 /* Even if CONV2 is a valid conversion, the result of the
3961 conversion may be invalid. For example, if ARG3 has type
3962 "volatile X", and X does not have a copy constructor
3963 accepting a "volatile X&", then even if ARG2 can be
3964 converted to X, the conversion will fail. */
3965 if (error_operand_p (arg2
))
3966 result
= error_mark_node
;
3968 else if (conv3
&& (!conv3
->bad_p
|| !conv2
))
3970 arg3
= convert_like (conv3
, arg3
, complain
);
3971 arg3
= convert_from_reference (arg3
);
3972 arg3_type
= TREE_TYPE (arg3
);
3973 if (error_operand_p (arg3
))
3974 result
= error_mark_node
;
3977 /* Free all the conversions we allocated. */
3978 obstack_free (&conversion_obstack
, p
);
3983 /* If, after the conversion, both operands have class type,
3984 treat the cv-qualification of both operands as if it were the
3985 union of the cv-qualification of the operands.
3987 The standard is not clear about what to do in this
3988 circumstance. For example, if the first operand has type
3989 "const X" and the second operand has a user-defined
3990 conversion to "volatile X", what is the type of the second
3991 operand after this step? Making it be "const X" (matching
3992 the first operand) seems wrong, as that discards the
3993 qualification without actually performing a copy. Leaving it
3994 as "volatile X" seems wrong as that will result in the
3995 conditional expression failing altogether, even though,
3996 according to this step, the one operand could be converted to
3997 the type of the other. */
3998 if ((conv2
|| conv3
)
3999 && CLASS_TYPE_P (arg2_type
)
4000 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
4001 arg2_type
= arg3_type
=
4002 cp_build_qualified_type (arg2_type
,
4003 cp_type_quals (arg2_type
)
4004 | cp_type_quals (arg3_type
));
4009 If the second and third operands are lvalues and have the same
4010 type, the result is of that type and is an lvalue. */
4011 if (real_lvalue_p (arg2
)
4012 && real_lvalue_p (arg3
)
4013 && same_type_p (arg2_type
, arg3_type
))
4015 result_type
= arg2_type
;
4016 arg2
= mark_lvalue_use (arg2
);
4017 arg3
= mark_lvalue_use (arg3
);
4018 goto valid_operands
;
4023 Otherwise, the result is an rvalue. If the second and third
4024 operand do not have the same type, and either has (possibly
4025 cv-qualified) class type, overload resolution is used to
4026 determine the conversions (if any) to be applied to the operands
4027 (_over.match.oper_, _over.built_). */
4029 if (!same_type_p (arg2_type
, arg3_type
)
4030 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
4036 /* Rearrange the arguments so that add_builtin_candidate only has
4037 to know about two args. In build_builtin_candidate, the
4038 arguments are unscrambled. */
4042 add_builtin_candidates (&candidates
,
4045 ansi_opname (COND_EXPR
),
4051 If the overload resolution fails, the program is
4053 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
4056 if (complain
& tf_error
)
4058 op_error (COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
4059 print_z_candidates (candidates
);
4061 return error_mark_node
;
4063 cand
= tourney (candidates
);
4066 if (complain
& tf_error
)
4068 op_error (COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
4069 print_z_candidates (candidates
);
4071 return error_mark_node
;
4076 Otherwise, the conversions thus determined are applied, and
4077 the converted operands are used in place of the original
4078 operands for the remainder of this section. */
4079 conv
= cand
->convs
[0];
4080 arg1
= convert_like (conv
, arg1
, complain
);
4081 conv
= cand
->convs
[1];
4082 arg2
= convert_like (conv
, arg2
, complain
);
4083 arg2_type
= TREE_TYPE (arg2
);
4084 conv
= cand
->convs
[2];
4085 arg3
= convert_like (conv
, arg3
, complain
);
4086 arg3_type
= TREE_TYPE (arg3
);
4091 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
4092 and function-to-pointer (_conv.func_) standard conversions are
4093 performed on the second and third operands.
4095 We need to force the lvalue-to-rvalue conversion here for class types,
4096 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
4097 that isn't wrapped with a TARGET_EXPR plays havoc with exception
4100 arg2
= force_rvalue (arg2
);
4101 if (!CLASS_TYPE_P (arg2_type
))
4102 arg2_type
= TREE_TYPE (arg2
);
4104 arg3
= force_rvalue (arg3
);
4105 if (!CLASS_TYPE_P (arg3_type
))
4106 arg3_type
= TREE_TYPE (arg3
);
4108 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
4109 return error_mark_node
;
4113 After those conversions, one of the following shall hold:
4115 --The second and third operands have the same type; the result is of
4117 if (same_type_p (arg2_type
, arg3_type
))
4118 result_type
= arg2_type
;
4121 --The second and third operands have arithmetic or enumeration
4122 type; the usual arithmetic conversions are performed to bring
4123 them to a common type, and the result is of that type. */
4124 else if ((ARITHMETIC_TYPE_P (arg2_type
)
4125 || UNSCOPED_ENUM_P (arg2_type
))
4126 && (ARITHMETIC_TYPE_P (arg3_type
)
4127 || UNSCOPED_ENUM_P (arg3_type
)))
4129 /* In this case, there is always a common type. */
4130 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
4132 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
4133 "implicit conversion from %qT to %qT to "
4134 "match other result of conditional",
4137 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
4138 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
4140 if (complain
& tf_warning
)
4142 "enumeral mismatch in conditional expression: %qT vs %qT",
4143 arg2_type
, arg3_type
);
4145 else if (extra_warnings
4146 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
4147 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
4148 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
4149 && !same_type_p (arg2_type
, type_promotes_to (arg3_type
)))))
4151 if (complain
& tf_warning
)
4153 "enumeral and non-enumeral type in conditional expression");
4156 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
4157 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
4161 --The second and third operands have pointer type, or one has
4162 pointer type and the other is a null pointer constant; pointer
4163 conversions (_conv.ptr_) and qualification conversions
4164 (_conv.qual_) are performed to bring them to their composite
4165 pointer type (_expr.rel_). The result is of the composite
4168 --The second and third operands have pointer to member type, or
4169 one has pointer to member type and the other is a null pointer
4170 constant; pointer to member conversions (_conv.mem_) and
4171 qualification conversions (_conv.qual_) are performed to bring
4172 them to a common type, whose cv-qualification shall match the
4173 cv-qualification of either the second or the third operand.
4174 The result is of the common type. */
4175 else if ((null_ptr_cst_p (arg2
)
4176 && (TYPE_PTR_P (arg3_type
) || TYPE_PTR_TO_MEMBER_P (arg3_type
)))
4177 || (null_ptr_cst_p (arg3
)
4178 && (TYPE_PTR_P (arg2_type
) || TYPE_PTR_TO_MEMBER_P (arg2_type
)))
4179 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
4180 || (TYPE_PTRMEM_P (arg2_type
) && TYPE_PTRMEM_P (arg3_type
))
4181 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
4183 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
4184 arg3
, CPO_CONDITIONAL_EXPR
,
4186 if (result_type
== error_mark_node
)
4187 return error_mark_node
;
4188 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
4189 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
4194 if (complain
& tf_error
)
4195 error ("operands to ?: have different types %qT and %qT",
4196 arg2_type
, arg3_type
);
4197 return error_mark_node
;
4201 result
= build3 (COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
4202 if (!cp_unevaluated_operand
)
4203 /* Avoid folding within decltype (c++/42013) and noexcept. */
4204 result
= fold_if_not_in_template (result
);
4206 /* We can't use result_type below, as fold might have returned a
4211 /* Expand both sides into the same slot, hopefully the target of
4212 the ?: expression. We used to check for TARGET_EXPRs here,
4213 but now we sometimes wrap them in NOP_EXPRs so the test would
4215 if (CLASS_TYPE_P (TREE_TYPE (result
)))
4216 result
= get_target_expr (result
);
4217 /* If this expression is an rvalue, but might be mistaken for an
4218 lvalue, we must add a NON_LVALUE_EXPR. */
4219 result
= rvalue (result
);
4225 /* OPERAND is an operand to an expression. Perform necessary steps
4226 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
4230 prep_operand (tree operand
)
4234 if (CLASS_TYPE_P (TREE_TYPE (operand
))
4235 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
4236 /* Make sure the template type is instantiated now. */
4237 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
4243 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
4244 OVERLOAD) to the CANDIDATES, returning an updated list of
4245 CANDIDATES. The ARGS are the arguments provided to the call;
4246 if FIRST_ARG is non-null it is the implicit object argument,
4247 otherwise the first element of ARGS is used if needed. The
4248 EXPLICIT_TARGS are explicit template arguments provided.
4249 TEMPLATE_ONLY is true if only template functions should be
4250 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
4251 add_function_candidate. */
4254 add_candidates (tree fns
, tree first_arg
, const VEC(tree
,gc
) *args
,
4256 tree explicit_targs
, bool template_only
,
4257 tree conversion_path
, tree access_path
,
4259 struct z_candidate
**candidates
)
4262 const VEC(tree
,gc
) *non_static_args
;
4263 bool check_list_ctor
;
4264 bool check_converting
;
4265 unification_kind_t strict
;
4271 /* Precalculate special handling of constructors and conversion ops. */
4272 fn
= OVL_CURRENT (fns
);
4273 if (DECL_CONV_FN_P (fn
))
4275 check_list_ctor
= false;
4276 check_converting
= !!(flags
& LOOKUP_ONLYCONVERTING
);
4277 if (flags
& LOOKUP_NO_CONVERSION
)
4278 /* We're doing return_type(x). */
4279 strict
= DEDUCE_CONV
;
4281 /* We're doing x.operator return_type(). */
4282 strict
= DEDUCE_EXACT
;
4283 /* [over.match.funcs] For conversion functions, the function
4284 is considered to be a member of the class of the implicit
4285 object argument for the purpose of defining the type of
4286 the implicit object parameter. */
4287 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (first_arg
)));
4291 if (DECL_CONSTRUCTOR_P (fn
))
4293 check_list_ctor
= !!(flags
& LOOKUP_LIST_ONLY
);
4294 check_converting
= !!(flags
& LOOKUP_ONLYCONVERTING
);
4298 check_list_ctor
= false;
4299 check_converting
= false;
4301 strict
= DEDUCE_CALL
;
4302 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
4306 non_static_args
= args
;
4308 /* Delay creating the implicit this parameter until it is needed. */
4309 non_static_args
= NULL
;
4311 for (; fns
; fns
= OVL_NEXT (fns
))
4314 const VEC(tree
,gc
) *fn_args
;
4316 fn
= OVL_CURRENT (fns
);
4318 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
4320 if (check_list_ctor
&& !is_list_ctor (fn
))
4323 /* Figure out which set of arguments to use. */
4324 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
4326 /* If this function is a non-static member and we didn't get an
4327 implicit object argument, move it out of args. */
4328 if (first_arg
== NULL_TREE
)
4332 VEC(tree
,gc
) *tempvec
4333 = VEC_alloc (tree
, gc
, VEC_length (tree
, args
) - 1);
4334 for (ix
= 1; VEC_iterate (tree
, args
, ix
, arg
); ++ix
)
4335 VEC_quick_push (tree
, tempvec
, arg
);
4336 non_static_args
= tempvec
;
4337 first_arg
= build_this (VEC_index (tree
, args
, 0));
4340 fn_first_arg
= first_arg
;
4341 fn_args
= non_static_args
;
4345 /* Otherwise, just use the list of arguments provided. */
4346 fn_first_arg
= NULL_TREE
;
4350 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4351 add_template_candidate (candidates
,
4362 else if (!template_only
)
4363 add_function_candidate (candidates
,
4374 /* Even unsigned enum types promote to signed int. We don't want to
4375 issue -Wsign-compare warnings for this case. Here ORIG_ARG is the
4376 original argument and ARG is the argument after any conversions
4377 have been applied. We set TREE_NO_WARNING if we have added a cast
4378 from an unsigned enum type to a signed integer type. */
4381 avoid_sign_compare_warnings (tree orig_arg
, tree arg
)
4383 if (orig_arg
!= NULL_TREE
4386 && TREE_CODE (TREE_TYPE (orig_arg
)) == ENUMERAL_TYPE
4387 && TYPE_UNSIGNED (TREE_TYPE (orig_arg
))
4388 && INTEGRAL_TYPE_P (TREE_TYPE (arg
))
4389 && !TYPE_UNSIGNED (TREE_TYPE (arg
)))
4390 TREE_NO_WARNING (arg
) = 1;
4394 build_new_op (enum tree_code code
, int flags
, tree arg1
, tree arg2
, tree arg3
,
4395 bool *overloaded_p
, tsubst_flags_t complain
)
4397 tree orig_arg1
= arg1
;
4398 tree orig_arg2
= arg2
;
4399 tree orig_arg3
= arg3
;
4400 struct z_candidate
*candidates
= 0, *cand
;
4401 VEC(tree
,gc
) *arglist
;
4404 tree result
= NULL_TREE
;
4405 bool result_valid_p
= false;
4406 enum tree_code code2
= NOP_EXPR
;
4407 enum tree_code code_orig_arg1
= ERROR_MARK
;
4408 enum tree_code code_orig_arg2
= ERROR_MARK
;
4414 if (error_operand_p (arg1
)
4415 || error_operand_p (arg2
)
4416 || error_operand_p (arg3
))
4417 return error_mark_node
;
4419 if (code
== MODIFY_EXPR
)
4421 code2
= TREE_CODE (arg3
);
4423 fnname
= ansi_assopname (code2
);
4426 fnname
= ansi_opname (code
);
4428 arg1
= prep_operand (arg1
);
4434 case VEC_DELETE_EXPR
:
4436 /* Use build_op_new_call and build_op_delete_call instead. */
4440 /* Use build_op_call instead. */
4443 case TRUTH_ORIF_EXPR
:
4444 case TRUTH_ANDIF_EXPR
:
4445 case TRUTH_AND_EXPR
:
4447 /* These are saved for the sake of warn_logical_operator. */
4448 code_orig_arg1
= TREE_CODE (arg1
);
4449 code_orig_arg2
= TREE_CODE (arg2
);
4455 arg2
= prep_operand (arg2
);
4456 arg3
= prep_operand (arg3
);
4458 if (code
== COND_EXPR
)
4459 /* Use build_conditional_expr instead. */
4461 else if (! IS_OVERLOAD_TYPE (TREE_TYPE (arg1
))
4462 && (! arg2
|| ! IS_OVERLOAD_TYPE (TREE_TYPE (arg2
))))
4465 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
4466 arg2
= integer_zero_node
;
4468 arglist
= VEC_alloc (tree
, gc
, 3);
4469 VEC_quick_push (tree
, arglist
, arg1
);
4470 if (arg2
!= NULL_TREE
)
4471 VEC_quick_push (tree
, arglist
, arg2
);
4472 if (arg3
!= NULL_TREE
)
4473 VEC_quick_push (tree
, arglist
, arg3
);
4475 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4476 p
= conversion_obstack_alloc (0);
4478 /* Add namespace-scope operators to the list of functions to
4480 add_candidates (lookup_function_nonclass (fnname
, arglist
, /*block_p=*/true),
4481 NULL_TREE
, arglist
, NULL_TREE
,
4482 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
4483 flags
, &candidates
);
4484 /* Add class-member operators to the candidate set. */
4485 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
4489 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
4490 if (fns
== error_mark_node
)
4492 result
= error_mark_node
;
4493 goto user_defined_result_ready
;
4496 add_candidates (BASELINK_FUNCTIONS (fns
),
4497 NULL_TREE
, arglist
, NULL_TREE
,
4499 BASELINK_BINFO (fns
),
4500 BASELINK_ACCESS_BINFO (fns
),
4501 flags
, &candidates
);
4506 args
[2] = NULL_TREE
;
4508 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
, flags
);
4514 /* For these, the built-in candidates set is empty
4515 [over.match.oper]/3. We don't want non-strict matches
4516 because exact matches are always possible with built-in
4517 operators. The built-in candidate set for COMPONENT_REF
4518 would be empty too, but since there are no such built-in
4519 operators, we accept non-strict matches for them. */
4524 strict_p
= pedantic
;
4528 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
4533 case POSTINCREMENT_EXPR
:
4534 case POSTDECREMENT_EXPR
:
4535 /* Don't try anything fancy if we're not allowed to produce
4537 if (!(complain
& tf_error
))
4538 return error_mark_node
;
4540 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
4541 distinguish between prefix and postfix ++ and
4542 operator++() was used for both, so we allow this with
4544 if (flags
& LOOKUP_COMPLAIN
)
4546 const char *msg
= (flag_permissive
)
4547 ? G_("no %<%D(int)%> declared for postfix %qs,"
4548 " trying prefix operator instead")
4549 : G_("no %<%D(int)%> declared for postfix %qs");
4550 permerror (input_location
, msg
, fnname
,
4551 operator_name_info
[code
].name
);
4554 if (!flag_permissive
)
4555 return error_mark_node
;
4557 if (code
== POSTINCREMENT_EXPR
)
4558 code
= PREINCREMENT_EXPR
;
4560 code
= PREDECREMENT_EXPR
;
4561 result
= build_new_op (code
, flags
, arg1
, NULL_TREE
, NULL_TREE
,
4562 overloaded_p
, complain
);
4565 /* The caller will deal with these. */
4570 result_valid_p
= true;
4574 if ((flags
& LOOKUP_COMPLAIN
) && (complain
& tf_error
))
4576 /* If one of the arguments of the operator represents
4577 an invalid use of member function pointer, try to report
4578 a meaningful error ... */
4579 if (invalid_nonstatic_memfn_p (arg1
, tf_error
)
4580 || invalid_nonstatic_memfn_p (arg2
, tf_error
)
4581 || invalid_nonstatic_memfn_p (arg3
, tf_error
))
4582 /* We displayed the error message. */;
4585 /* ... Otherwise, report the more generic
4586 "no matching operator found" error */
4587 op_error (code
, code2
, arg1
, arg2
, arg3
, FALSE
);
4588 print_z_candidates (candidates
);
4591 result
= error_mark_node
;
4597 cand
= tourney (candidates
);
4600 if ((flags
& LOOKUP_COMPLAIN
) && (complain
& tf_error
))
4602 op_error (code
, code2
, arg1
, arg2
, arg3
, TRUE
);
4603 print_z_candidates (candidates
);
4605 result
= error_mark_node
;
4607 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
4610 *overloaded_p
= true;
4612 if (resolve_args (arglist
) == NULL
)
4613 result
= error_mark_node
;
4615 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4619 /* Give any warnings we noticed during overload resolution. */
4620 if (cand
->warnings
&& (complain
& tf_warning
))
4622 struct candidate_warning
*w
;
4623 for (w
= cand
->warnings
; w
; w
= w
->next
)
4624 joust (cand
, w
->loser
, 1);
4627 /* Check for comparison of different enum types. */
4636 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
4637 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
4638 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
4639 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
4640 && (complain
& tf_warning
))
4642 warning (OPT_Wenum_compare
,
4643 "comparison between %q#T and %q#T",
4644 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4651 /* We need to strip any leading REF_BIND so that bitfields
4652 don't cause errors. This should not remove any important
4653 conversions, because builtins don't apply to class
4654 objects directly. */
4655 conv
= cand
->convs
[0];
4656 if (conv
->kind
== ck_ref_bind
)
4657 conv
= conv
->u
.next
;
4658 arg1
= convert_like (conv
, arg1
, complain
);
4662 /* We need to call warn_logical_operator before
4663 converting arg2 to a boolean_type. */
4664 if (complain
& tf_warning
)
4665 warn_logical_operator (input_location
, code
, boolean_type_node
,
4666 code_orig_arg1
, arg1
,
4667 code_orig_arg2
, arg2
);
4669 conv
= cand
->convs
[1];
4670 if (conv
->kind
== ck_ref_bind
)
4671 conv
= conv
->u
.next
;
4672 arg2
= convert_like (conv
, arg2
, complain
);
4676 conv
= cand
->convs
[2];
4677 if (conv
->kind
== ck_ref_bind
)
4678 conv
= conv
->u
.next
;
4679 arg3
= convert_like (conv
, arg3
, complain
);
4685 user_defined_result_ready
:
4687 /* Free all the conversions we allocated. */
4688 obstack_free (&conversion_obstack
, p
);
4690 if (result
|| result_valid_p
)
4694 avoid_sign_compare_warnings (orig_arg1
, arg1
);
4695 avoid_sign_compare_warnings (orig_arg2
, arg2
);
4696 avoid_sign_compare_warnings (orig_arg3
, arg3
);
4701 return cp_build_modify_expr (arg1
, code2
, arg2
, complain
);
4704 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
4706 case TRUTH_ANDIF_EXPR
:
4707 case TRUTH_ORIF_EXPR
:
4708 case TRUTH_AND_EXPR
:
4710 warn_logical_operator (input_location
, code
, boolean_type_node
,
4711 code_orig_arg1
, arg1
, code_orig_arg2
, arg2
);
4716 case TRUNC_DIV_EXPR
:
4727 case TRUNC_MOD_EXPR
:
4731 return cp_build_binary_op (input_location
, code
, arg1
, arg2
, complain
);
4733 case UNARY_PLUS_EXPR
:
4736 case TRUTH_NOT_EXPR
:
4737 case PREINCREMENT_EXPR
:
4738 case POSTINCREMENT_EXPR
:
4739 case PREDECREMENT_EXPR
:
4740 case POSTDECREMENT_EXPR
:
4743 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
4746 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
4749 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_NULL
,
4753 /* The caller will deal with these. */
4765 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
4766 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
4769 non_placement_deallocation_fn_p (tree t
)
4771 /* A template instance is never a usual deallocation function,
4772 regardless of its signature. */
4773 if (TREE_CODE (t
) == TEMPLATE_DECL
4774 || primary_template_instantiation_p (t
))
4777 /* If a class T has a member deallocation function named operator delete
4778 with exactly one parameter, then that function is a usual
4779 (non-placement) deallocation function. If class T does not declare
4780 such an operator delete but does declare a member deallocation
4781 function named operator delete with exactly two parameters, the second
4782 of which has type std::size_t (18.2), then this function is a usual
4783 deallocation function. */
4784 t
= FUNCTION_ARG_CHAIN (t
);
4785 if (t
== void_list_node
4786 || (t
&& same_type_p (TREE_VALUE (t
), size_type_node
)
4787 && TREE_CHAIN (t
) == void_list_node
))
4792 /* Build a call to operator delete. This has to be handled very specially,
4793 because the restrictions on what signatures match are different from all
4794 other call instances. For a normal delete, only a delete taking (void *)
4795 or (void *, size_t) is accepted. For a placement delete, only an exact
4796 match with the placement new is accepted.
4798 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
4799 ADDR is the pointer to be deleted.
4800 SIZE is the size of the memory block to be deleted.
4801 GLOBAL_P is true if the delete-expression should not consider
4802 class-specific delete operators.
4803 PLACEMENT is the corresponding placement new call, or NULL_TREE.
4805 If this call to "operator delete" is being generated as part to
4806 deallocate memory allocated via a new-expression (as per [expr.new]
4807 which requires that if the initialization throws an exception then
4808 we call a deallocation function), then ALLOC_FN is the allocation
4812 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
4813 bool global_p
, tree placement
,
4816 tree fn
= NULL_TREE
;
4817 tree fns
, fnname
, type
, t
;
4819 if (addr
== error_mark_node
)
4820 return error_mark_node
;
4822 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
4824 fnname
= ansi_opname (code
);
4826 if (CLASS_TYPE_P (type
)
4827 && COMPLETE_TYPE_P (complete_type (type
))
4831 If the result of the lookup is ambiguous or inaccessible, or if
4832 the lookup selects a placement deallocation function, the
4833 program is ill-formed.
4835 Therefore, we ask lookup_fnfields to complain about ambiguity. */
4837 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
4838 if (fns
== error_mark_node
)
4839 return error_mark_node
;
4844 if (fns
== NULL_TREE
)
4845 fns
= lookup_name_nonclass (fnname
);
4847 /* Strip const and volatile from addr. */
4848 addr
= cp_convert (ptr_type_node
, addr
);
4852 /* "A declaration of a placement deallocation function matches the
4853 declaration of a placement allocation function if it has the same
4854 number of parameters and, after parameter transformations (8.3.5),
4855 all parameter types except the first are identical."
4857 So we build up the function type we want and ask instantiate_type
4858 to get it for us. */
4859 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
4860 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
4861 t
= build_function_type (void_type_node
, t
);
4863 fn
= instantiate_type (t
, fns
, tf_none
);
4864 if (fn
== error_mark_node
)
4867 if (BASELINK_P (fn
))
4868 fn
= BASELINK_FUNCTIONS (fn
);
4870 /* "If the lookup finds the two-parameter form of a usual deallocation
4871 function (3.7.4.2) and that function, considered as a placement
4872 deallocation function, would have been selected as a match for the
4873 allocation function, the program is ill-formed." */
4874 if (non_placement_deallocation_fn_p (fn
))
4876 /* But if the class has an operator delete (void *), then that is
4877 the usual deallocation function, so we shouldn't complain
4878 about using the operator delete (void *, size_t). */
4879 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
4880 t
; t
= OVL_NEXT (t
))
4882 tree elt
= OVL_CURRENT (t
);
4883 if (non_placement_deallocation_fn_p (elt
)
4884 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
4887 permerror (0, "non-placement deallocation function %q+D", fn
);
4888 permerror (input_location
, "selected for placement delete");
4893 /* "Any non-placement deallocation function matches a non-placement
4894 allocation function. If the lookup finds a single matching
4895 deallocation function, that function will be called; otherwise, no
4896 deallocation function will be called." */
4897 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
4898 t
; t
= OVL_NEXT (t
))
4900 tree elt
= OVL_CURRENT (t
);
4901 if (non_placement_deallocation_fn_p (elt
))
4904 /* "If a class T has a member deallocation function named
4905 operator delete with exactly one parameter, then that
4906 function is a usual (non-placement) deallocation
4907 function. If class T does not declare such an operator
4908 delete but does declare a member deallocation function named
4909 operator delete with exactly two parameters, the second of
4910 which has type std::size_t (18.2), then this function is a
4911 usual deallocation function."
4913 So (void*) beats (void*, size_t). */
4914 if (FUNCTION_ARG_CHAIN (fn
) == void_list_node
)
4919 /* If we have a matching function, call it. */
4922 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
4924 /* If the FN is a member function, make sure that it is
4926 if (BASELINK_P (fns
))
4927 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
);
4929 /* Core issue 901: It's ok to new a type with deleted delete. */
4930 if (DECL_DELETED_FN (fn
) && alloc_fn
)
4935 /* The placement args might not be suitable for overload
4936 resolution at this point, so build the call directly. */
4937 int nargs
= call_expr_nargs (placement
);
4938 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
4941 for (i
= 1; i
< nargs
; i
++)
4942 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
4944 return build_cxx_call (fn
, nargs
, argarray
);
4949 VEC(tree
,gc
) *args
= VEC_alloc (tree
, gc
, 2);
4950 VEC_quick_push (tree
, args
, addr
);
4951 if (FUNCTION_ARG_CHAIN (fn
) != void_list_node
)
4952 VEC_quick_push (tree
, args
, size
);
4953 ret
= cp_build_function_call_vec (fn
, &args
, tf_warning_or_error
);
4954 VEC_free (tree
, gc
, args
);
4961 If no unambiguous matching deallocation function can be found,
4962 propagating the exception does not cause the object's memory to
4967 warning (0, "no corresponding deallocation function for %qD",
4972 error ("no suitable %<operator %s%> for %qT",
4973 operator_name_info
[(int)code
].name
, type
);
4974 return error_mark_node
;
4977 /* If the current scope isn't allowed to access DECL along
4978 BASETYPE_PATH, give an error. The most derived class in
4979 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
4980 the declaration to use in the error diagnostic. */
4983 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
)
4985 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
4987 if (!accessible_p (basetype_path
, decl
, true))
4989 if (TREE_PRIVATE (decl
))
4990 error ("%q+#D is private", diag_decl
);
4991 else if (TREE_PROTECTED (decl
))
4992 error ("%q+#D is protected", diag_decl
);
4994 error ("%q+#D is inaccessible", diag_decl
);
4995 error ("within this context");
5002 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
5003 bitwise or of LOOKUP_* values. If any errors are warnings are
5004 generated, set *DIAGNOSTIC_FN to "error" or "warning",
5005 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
5009 build_temp (tree expr
, tree type
, int flags
,
5010 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
5015 savew
= warningcount
, savee
= errorcount
;
5016 args
= make_tree_vector_single (expr
);
5017 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
5018 &args
, type
, flags
, complain
);
5019 release_tree_vector (args
);
5020 if (warningcount
> savew
)
5021 *diagnostic_kind
= DK_WARNING
;
5022 else if (errorcount
> savee
)
5023 *diagnostic_kind
= DK_ERROR
;
5025 *diagnostic_kind
= DK_UNSPECIFIED
;
5029 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
5030 EXPR is implicitly converted to type TOTYPE.
5031 FN and ARGNUM are used for diagnostics. */
5034 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
5036 tree t
= non_reference (totype
);
5038 /* Issue warnings about peculiar, but valid, uses of NULL. */
5039 if (expr
== null_node
&& TREE_CODE (t
) != BOOLEAN_TYPE
&& ARITHMETIC_TYPE_P (t
))
5042 warning_at (input_location
, OPT_Wconversion_null
,
5043 "passing NULL to non-pointer argument %P of %qD",
5046 warning_at (input_location
, OPT_Wconversion_null
,
5047 "converting to non-pointer type %qT from NULL", t
);
5050 /* Issue warnings if "false" is converted to a NULL pointer */
5051 else if (expr
== boolean_false_node
&& fn
&& POINTER_TYPE_P (t
))
5052 warning_at (input_location
, OPT_Wconversion_null
,
5053 "converting %<false%> to pointer type for argument %P of %qD",
5057 /* Perform the conversions in CONVS on the expression EXPR. FN and
5058 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
5059 indicates the `this' argument of a method. INNER is nonzero when
5060 being called to continue a conversion chain. It is negative when a
5061 reference binding will be applied, positive otherwise. If
5062 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
5063 conversions will be emitted if appropriate. If C_CAST_P is true,
5064 this conversion is coming from a C-style cast; in that case,
5065 conversions to inaccessible bases are permitted. */
5068 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
5069 int inner
, bool issue_conversion_warnings
,
5070 bool c_cast_p
, tsubst_flags_t complain
)
5072 tree totype
= convs
->type
;
5073 diagnostic_t diag_kind
;
5077 && convs
->kind
!= ck_user
5078 && convs
->kind
!= ck_list
5079 && convs
->kind
!= ck_ambig
5080 && convs
->kind
!= ck_ref_bind
5081 && convs
->kind
!= ck_rvalue
5082 && convs
->kind
!= ck_base
)
5084 conversion
*t
= convs
;
5086 /* Give a helpful error if this is bad because of excess braces. */
5087 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
5088 && SCALAR_TYPE_P (totype
)
5089 && CONSTRUCTOR_NELTS (expr
) > 0
5090 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
5091 permerror (input_location
, "too many braces around initializer for %qT", totype
);
5093 for (; t
; t
= convs
->u
.next
)
5095 if (t
->kind
== ck_user
|| !t
->bad_p
)
5097 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
5098 /*issue_conversion_warnings=*/false,
5103 else if (t
->kind
== ck_ambig
)
5104 return convert_like_real (t
, expr
, fn
, argnum
, 1,
5105 /*issue_conversion_warnings=*/false,
5108 else if (t
->kind
== ck_identity
)
5111 if (complain
& tf_error
)
5113 permerror (input_location
, "invalid conversion from %qT to %qT", TREE_TYPE (expr
), totype
);
5115 permerror (DECL_SOURCE_LOCATION (fn
),
5116 " initializing argument %P of %qD", argnum
, fn
);
5119 return error_mark_node
;
5121 return cp_convert (totype
, expr
);
5124 if (issue_conversion_warnings
&& (complain
& tf_warning
))
5125 conversion_null_warnings (totype
, expr
, fn
, argnum
);
5127 switch (convs
->kind
)
5131 struct z_candidate
*cand
= convs
->cand
;
5132 tree convfn
= cand
->fn
;
5135 expr
= mark_rvalue_use (expr
);
5137 /* When converting from an init list we consider explicit
5138 constructors, but actually trying to call one is an error. */
5139 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
5140 /* Unless we're calling it for value-initialization from an
5141 empty list, since that is handled separately in 8.5.4. */
5142 && cand
->num_convs
> 0)
5144 if (complain
& tf_error
)
5145 error ("converting to %qT from initializer list would use "
5146 "explicit constructor %qD", totype
, convfn
);
5148 return error_mark_node
;
5151 /* Set user_conv_p on the argument conversions, so rvalue/base
5152 handling knows not to allow any more UDCs. */
5153 for (i
= 0; i
< cand
->num_convs
; ++i
)
5154 cand
->convs
[i
]->user_conv_p
= true;
5156 expr
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5158 /* If this is a constructor or a function returning an aggr type,
5159 we need to build up a TARGET_EXPR. */
5160 if (DECL_CONSTRUCTOR_P (convfn
))
5162 expr
= build_cplus_new (totype
, expr
);
5164 /* Remember that this was list-initialization. */
5165 if (convs
->check_narrowing
)
5166 TARGET_EXPR_LIST_INIT_P (expr
) = true;
5172 expr
= mark_rvalue_use (expr
);
5173 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
5175 int nelts
= CONSTRUCTOR_NELTS (expr
);
5177 expr
= build_value_init (totype
, tf_warning_or_error
);
5178 else if (nelts
== 1)
5179 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
5184 if (type_unknown_p (expr
))
5185 expr
= instantiate_type (totype
, expr
, complain
);
5186 /* Convert a constant to its underlying value, unless we are
5187 about to bind it to a reference, in which case we need to
5188 leave it as an lvalue. */
5191 expr
= decl_constant_value (expr
);
5192 if (expr
== null_node
&& INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
5193 /* If __null has been converted to an integer type, we do not
5194 want to warn about uses of EXPR as an integer, rather than
5196 expr
= build_int_cst (totype
, 0);
5200 if (complain
& tf_error
)
5202 /* Call build_user_type_conversion again for the error. */
5203 build_user_type_conversion (totype
, convs
->u
.expr
, LOOKUP_NORMAL
);
5205 error (" initializing argument %P of %q+D", argnum
, fn
);
5207 return error_mark_node
;
5211 /* Conversion to std::initializer_list<T>. */
5212 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
5213 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
5214 unsigned len
= CONSTRUCTOR_NELTS (expr
);
5216 VEC(tree
,gc
) *parms
;
5219 /* Convert all the elements. */
5220 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
5222 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
5223 1, false, false, complain
);
5224 if (sub
== error_mark_node
)
5226 if (!BRACE_ENCLOSED_INITIALIZER_P (val
))
5227 check_narrowing (TREE_TYPE (sub
), val
);
5228 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
5230 /* Build up the array. */
5231 elttype
= cp_build_qualified_type
5232 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
5233 array
= build_array_of_n_type (elttype
, len
);
5234 array
= finish_compound_literal (array
, new_ctor
);
5236 parms
= make_tree_vector ();
5237 VEC_safe_push (tree
, gc
, parms
, decay_conversion (array
));
5238 VEC_safe_push (tree
, gc
, parms
, size_int (len
));
5239 /* Call the private constructor. */
5240 push_deferring_access_checks (dk_no_check
);
5241 new_ctor
= build_special_member_call
5242 (NULL_TREE
, complete_ctor_identifier
, &parms
, totype
, 0, complain
);
5243 release_tree_vector (parms
);
5244 pop_deferring_access_checks ();
5245 return build_cplus_new (totype
, new_ctor
);
5249 return get_target_expr (digest_init (totype
, expr
));
5255 expr
= convert_like_real (convs
->u
.next
, expr
, fn
, argnum
,
5256 convs
->kind
== ck_ref_bind
? -1 : 1,
5257 convs
->kind
== ck_ref_bind
? issue_conversion_warnings
: false,
5260 if (expr
== error_mark_node
)
5261 return error_mark_node
;
5263 switch (convs
->kind
)
5266 expr
= decay_conversion (expr
);
5267 if (! MAYBE_CLASS_TYPE_P (totype
))
5269 /* Else fall through. */
5271 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
5273 /* We are going to bind a reference directly to a base-class
5274 subobject of EXPR. */
5275 /* Build an expression for `*((base*) &expr)'. */
5276 expr
= cp_build_addr_expr (expr
, complain
);
5277 expr
= convert_to_base (expr
, build_pointer_type (totype
),
5278 !c_cast_p
, /*nonnull=*/true, complain
);
5279 expr
= cp_build_indirect_ref (expr
, RO_IMPLICIT_CONVERSION
, complain
);
5283 /* Copy-initialization where the cv-unqualified version of the source
5284 type is the same class as, or a derived class of, the class of the
5285 destination [is treated as direct-initialization]. [dcl.init] */
5286 flags
= LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
;
5287 if (convs
->user_conv_p
)
5288 /* This conversion is being done in the context of a user-defined
5289 conversion (i.e. the second step of copy-initialization), so
5290 don't allow any more. */
5291 flags
|= LOOKUP_NO_CONVERSION
;
5292 if (TREE_CODE (expr
) == TARGET_EXPR
5293 && TARGET_EXPR_LIST_INIT_P (expr
))
5294 /* Copy-list-initialization doesn't actually involve a copy. */
5296 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
5297 if (diag_kind
&& fn
)
5299 if ((complain
& tf_error
))
5300 emit_diagnostic (diag_kind
, DECL_SOURCE_LOCATION (fn
), 0,
5301 " initializing argument %P of %qD", argnum
, fn
);
5302 else if (diag_kind
== DK_ERROR
)
5303 return error_mark_node
;
5305 return build_cplus_new (totype
, expr
);
5309 tree ref_type
= totype
;
5311 if (convs
->bad_p
&& TYPE_REF_IS_RVALUE (ref_type
)
5312 && real_lvalue_p (expr
))
5314 if (complain
& tf_error
)
5316 error ("cannot bind %qT lvalue to %qT",
5317 TREE_TYPE (expr
), totype
);
5319 error (" initializing argument %P of %q+D", argnum
, fn
);
5321 return error_mark_node
;
5324 /* If necessary, create a temporary.
5326 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
5327 that need temporaries, even when their types are reference
5328 compatible with the type of reference being bound, so the
5329 upcoming call to cp_build_addr_expr doesn't fail. */
5330 if (convs
->need_temporary_p
5331 || TREE_CODE (expr
) == CONSTRUCTOR
5332 || TREE_CODE (expr
) == VA_ARG_EXPR
)
5334 /* Otherwise, a temporary of type "cv1 T1" is created and
5335 initialized from the initializer expression using the rules
5336 for a non-reference copy-initialization (8.5). */
5338 tree type
= TREE_TYPE (ref_type
);
5339 cp_lvalue_kind lvalue
= real_lvalue_p (expr
);
5341 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5342 (type
, convs
->u
.next
->type
));
5343 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
5344 && !TYPE_REF_IS_RVALUE (ref_type
))
5346 if (complain
& tf_error
)
5348 /* If the reference is volatile or non-const, we
5349 cannot create a temporary. */
5350 if (lvalue
& clk_bitfield
)
5351 error ("cannot bind bitfield %qE to %qT",
5353 else if (lvalue
& clk_packed
)
5354 error ("cannot bind packed field %qE to %qT",
5357 error ("cannot bind rvalue %qE to %qT", expr
, ref_type
);
5359 return error_mark_node
;
5361 /* If the source is a packed field, and we must use a copy
5362 constructor, then building the target expr will require
5363 binding the field to the reference parameter to the
5364 copy constructor, and we'll end up with an infinite
5365 loop. If we can use a bitwise copy, then we'll be
5367 if ((lvalue
& clk_packed
)
5368 && CLASS_TYPE_P (type
)
5369 && type_has_nontrivial_copy_init (type
))
5371 if (complain
& tf_error
)
5372 error ("cannot bind packed field %qE to %qT",
5374 return error_mark_node
;
5376 if (lvalue
& clk_bitfield
)
5378 expr
= convert_bitfield_to_declared_type (expr
);
5379 expr
= fold_convert (type
, expr
);
5381 expr
= build_target_expr_with_type (expr
, type
);
5384 /* Take the address of the thing to which we will bind the
5386 expr
= cp_build_addr_expr (expr
, complain
);
5387 if (expr
== error_mark_node
)
5388 return error_mark_node
;
5390 /* Convert it to a pointer to the type referred to by the
5391 reference. This will adjust the pointer if a derived to
5392 base conversion is being performed. */
5393 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
5395 /* Convert the pointer to the desired reference type. */
5396 return build_nop (ref_type
, expr
);
5400 return decay_conversion (expr
);
5403 /* Warn about deprecated conversion if appropriate. */
5404 string_conv_p (totype
, expr
, 1);
5409 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
5410 /*nonnull=*/false, complain
);
5411 return build_nop (totype
, expr
);
5414 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
5415 c_cast_p
, complain
);
5421 if (convs
->check_narrowing
)
5422 check_narrowing (totype
, expr
);
5424 if (issue_conversion_warnings
&& (complain
& tf_warning
))
5425 expr
= convert_and_check (totype
, expr
);
5427 expr
= convert (totype
, expr
);
5432 /* ARG is being passed to a varargs function. Perform any conversions
5433 required. Return the converted value. */
5436 convert_arg_to_ellipsis (tree arg
)
5442 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
5443 standard conversions are performed. */
5444 arg
= decay_conversion (arg
);
5445 arg_type
= TREE_TYPE (arg
);
5448 If the argument has integral or enumeration type that is subject
5449 to the integral promotions (_conv.prom_), or a floating point
5450 type that is subject to the floating point promotion
5451 (_conv.fpprom_), the value of the argument is converted to the
5452 promoted type before the call. */
5453 if (TREE_CODE (arg_type
) == REAL_TYPE
5454 && (TYPE_PRECISION (arg_type
)
5455 < TYPE_PRECISION (double_type_node
))
5456 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
5458 if (warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
5459 warning (OPT_Wdouble_promotion
,
5460 "implicit conversion from %qT to %qT when passing "
5461 "argument to function",
5462 arg_type
, double_type_node
);
5463 arg
= convert_to_real (double_type_node
, arg
);
5465 else if (NULLPTR_TYPE_P (arg_type
))
5466 arg
= null_pointer_node
;
5467 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
5468 arg
= perform_integral_promotions (arg
);
5470 arg
= require_complete_type (arg
);
5471 arg_type
= TREE_TYPE (arg
);
5473 if (arg
!= error_mark_node
5474 && (type_has_nontrivial_copy_init (arg_type
)
5475 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
)))
5477 /* [expr.call] 5.2.2/7:
5478 Passing a potentially-evaluated argument of class type (Clause 9)
5479 with a non-trivial copy constructor or a non-trivial destructor
5480 with no corresponding parameter is conditionally-supported, with
5481 implementation-defined semantics.
5483 We used to just warn here and do a bitwise copy, but now
5484 cp_expr_size will abort if we try to do that.
5486 If the call appears in the context of a sizeof expression,
5487 it is not potentially-evaluated. */
5488 if (cp_unevaluated_operand
== 0)
5489 error ("cannot pass objects of non-trivially-copyable "
5490 "type %q#T through %<...%>", arg_type
);
5496 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
5499 build_x_va_arg (tree expr
, tree type
)
5501 if (processing_template_decl
)
5502 return build_min (VA_ARG_EXPR
, type
, expr
);
5504 type
= complete_type_or_else (type
, NULL_TREE
);
5506 if (expr
== error_mark_node
|| !type
)
5507 return error_mark_node
;
5509 expr
= mark_lvalue_use (expr
);
5511 if (type_has_nontrivial_copy_init (type
)
5512 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
5513 || TREE_CODE (type
) == REFERENCE_TYPE
)
5515 /* Remove reference types so we don't ICE later on. */
5516 tree type1
= non_reference (type
);
5517 /* conditionally-supported behavior [expr.call] 5.2.2/7. */
5518 error ("cannot receive objects of non-trivially-copyable type %q#T "
5519 "through %<...%>; ", type
);
5520 expr
= convert (build_pointer_type (type1
), null_node
);
5521 expr
= cp_build_indirect_ref (expr
, RO_NULL
, tf_warning_or_error
);
5525 return build_va_arg (input_location
, expr
, type
);
5528 /* TYPE has been given to va_arg. Apply the default conversions which
5529 would have happened when passed via ellipsis. Return the promoted
5530 type, or the passed type if there is no change. */
5533 cxx_type_promotes_to (tree type
)
5537 /* Perform the array-to-pointer and function-to-pointer
5539 type
= type_decays_to (type
);
5541 promote
= type_promotes_to (type
);
5542 if (same_type_p (type
, promote
))
5548 /* ARG is a default argument expression being passed to a parameter of
5549 the indicated TYPE, which is a parameter to FN. Do any required
5550 conversions. Return the converted value. */
5552 static GTY(()) VEC(tree
,gc
) *default_arg_context
;
5555 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
)
5560 /* If the ARG is an unparsed default argument expression, the
5561 conversion cannot be performed. */
5562 if (TREE_CODE (arg
) == DEFAULT_ARG
)
5564 error ("the default argument for parameter %d of %qD has "
5565 "not yet been parsed",
5567 return error_mark_node
;
5570 /* Detect recursion. */
5571 FOR_EACH_VEC_ELT (tree
, default_arg_context
, i
, t
)
5574 error ("recursive evaluation of default argument for %q#D", fn
);
5575 return error_mark_node
;
5577 VEC_safe_push (tree
, gc
, default_arg_context
, fn
);
5579 if (fn
&& DECL_TEMPLATE_INFO (fn
))
5580 arg
= tsubst_default_argument (fn
, type
, arg
);
5586 The names in the expression are bound, and the semantic
5587 constraints are checked, at the point where the default
5588 expressions appears.
5590 we must not perform access checks here. */
5591 push_deferring_access_checks (dk_no_check
);
5592 arg
= break_out_target_exprs (arg
);
5593 if (TREE_CODE (arg
) == CONSTRUCTOR
)
5595 arg
= digest_init (type
, arg
);
5596 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_NORMAL
,
5597 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
5598 tf_warning_or_error
);
5602 /* We must make a copy of ARG, in case subsequent processing
5603 alters any part of it. For example, during gimplification a
5604 cast of the form (T) &X::f (where "f" is a member function)
5605 will lead to replacing the PTRMEM_CST for &X::f with a
5606 VAR_DECL. We can avoid the copy for constants, since they
5607 are never modified in place. */
5608 if (!CONSTANT_CLASS_P (arg
))
5609 arg
= unshare_expr (arg
);
5610 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_NORMAL
,
5611 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
5612 tf_warning_or_error
);
5613 arg
= convert_for_arg_passing (type
, arg
);
5615 pop_deferring_access_checks();
5617 VEC_pop (tree
, default_arg_context
);
5622 /* Returns the type which will really be used for passing an argument of
5626 type_passed_as (tree type
)
5628 /* Pass classes with copy ctors by invisible reference. */
5629 if (TREE_ADDRESSABLE (type
))
5631 type
= build_reference_type (type
);
5632 /* There are no other pointers to this temporary. */
5633 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
5635 else if (targetm
.calls
.promote_prototypes (type
)
5636 && INTEGRAL_TYPE_P (type
)
5637 && COMPLETE_TYPE_P (type
)
5638 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
),
5639 TYPE_SIZE (integer_type_node
)))
5640 type
= integer_type_node
;
5645 /* Actually perform the appropriate conversion. */
5648 convert_for_arg_passing (tree type
, tree val
)
5652 /* If VAL is a bitfield, then -- since it has already been converted
5653 to TYPE -- it cannot have a precision greater than TYPE.
5655 If it has a smaller precision, we must widen it here. For
5656 example, passing "int f:3;" to a function expecting an "int" will
5657 not result in any conversion before this point.
5659 If the precision is the same we must not risk widening. For
5660 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
5661 often have type "int", even though the C++ type for the field is
5662 "long long". If the value is being passed to a function
5663 expecting an "int", then no conversions will be required. But,
5664 if we call convert_bitfield_to_declared_type, the bitfield will
5665 be converted to "long long". */
5666 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
5668 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
5669 val
= convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type
), val
);
5671 if (val
== error_mark_node
)
5673 /* Pass classes with copy ctors by invisible reference. */
5674 else if (TREE_ADDRESSABLE (type
))
5675 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
5676 else if (targetm
.calls
.promote_prototypes (type
)
5677 && INTEGRAL_TYPE_P (type
)
5678 && COMPLETE_TYPE_P (type
)
5679 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
),
5680 TYPE_SIZE (integer_type_node
)))
5681 val
= perform_integral_promotions (val
);
5682 if (warn_missing_format_attribute
)
5684 tree rhstype
= TREE_TYPE (val
);
5685 const enum tree_code coder
= TREE_CODE (rhstype
);
5686 const enum tree_code codel
= TREE_CODE (type
);
5687 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
5689 && check_missing_format_attribute (type
, rhstype
))
5690 warning (OPT_Wmissing_format_attribute
,
5691 "argument of function call might be a candidate for a format attribute");
5696 /* Returns true iff FN is a function with magic varargs, i.e. ones for
5697 which no conversions at all should be done. This is true for some
5698 builtins which don't act like normal functions. */
5701 magic_varargs_p (tree fn
)
5703 if (DECL_BUILT_IN (fn
))
5704 switch (DECL_FUNCTION_CODE (fn
))
5706 case BUILT_IN_CLASSIFY_TYPE
:
5707 case BUILT_IN_CONSTANT_P
:
5708 case BUILT_IN_NEXT_ARG
:
5709 case BUILT_IN_VA_START
:
5713 return lookup_attribute ("type generic",
5714 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
5720 /* Subroutine of the various build_*_call functions. Overload resolution
5721 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
5722 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
5723 bitmask of various LOOKUP_* flags which apply to the call itself. */
5726 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
5729 const VEC(tree
,gc
) *args
= cand
->args
;
5730 tree first_arg
= cand
->first_arg
;
5731 conversion
**convs
= cand
->convs
;
5733 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5738 unsigned int arg_index
= 0;
5742 bool already_used
= false;
5744 /* In a template, there is no need to perform all of the work that
5745 is normally done. We are only interested in the type of the call
5746 expression, i.e., the return type of the function. Any semantic
5747 errors will be deferred until the template is instantiated. */
5748 if (processing_template_decl
)
5752 const tree
*argarray
;
5755 return_type
= TREE_TYPE (TREE_TYPE (fn
));
5756 nargs
= VEC_length (tree
, args
);
5757 if (first_arg
== NULL_TREE
)
5758 argarray
= VEC_address (tree
, CONST_CAST (VEC(tree
,gc
) *, args
));
5766 alcarray
= XALLOCAVEC (tree
, nargs
);
5767 alcarray
[0] = first_arg
;
5768 FOR_EACH_VEC_ELT (tree
, args
, ix
, arg
)
5769 alcarray
[ix
+ 1] = arg
;
5770 argarray
= alcarray
;
5772 expr
= build_call_array_loc (input_location
,
5773 return_type
, build_addr_func (fn
), nargs
,
5775 if (TREE_THIS_VOLATILE (fn
) && cfun
)
5776 current_function_returns_abnormally
= 1;
5777 if (!VOID_TYPE_P (return_type
))
5778 require_complete_type_sfinae (return_type
, complain
);
5779 return convert_from_reference (expr
);
5782 /* Give any warnings we noticed during overload resolution. */
5783 if (cand
->warnings
&& (complain
& tf_warning
))
5785 struct candidate_warning
*w
;
5786 for (w
= cand
->warnings
; w
; w
= w
->next
)
5787 joust (cand
, w
->loser
, 1);
5790 /* Make =delete work with SFINAE. */
5791 if (DECL_DELETED_FN (fn
) && !(complain
& tf_error
))
5792 return error_mark_node
;
5794 if (DECL_FUNCTION_MEMBER_P (fn
))
5797 /* If FN is a template function, two cases must be considered.
5802 template <class T> void f();
5804 template <class T> struct B {
5808 struct C : A, B<int> {
5810 using B<int>::g; // #2
5813 In case #1 where `A::f' is a member template, DECL_ACCESS is
5814 recorded in the primary template but not in its specialization.
5815 We check access of FN using its primary template.
5817 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
5818 because it is a member of class template B, DECL_ACCESS is
5819 recorded in the specialization `B<int>::g'. We cannot use its
5820 primary template because `B<T>::g' and `B<int>::g' may have
5821 different access. */
5822 if (DECL_TEMPLATE_INFO (fn
)
5823 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
5824 access_fn
= DECL_TI_TEMPLATE (fn
);
5827 if (flags
& LOOKUP_SPECULATIVE
)
5829 if (!speculative_access_check (cand
->access_path
, access_fn
, fn
,
5830 !!(flags
& LOOKUP_COMPLAIN
)))
5831 return error_mark_node
;
5834 perform_or_defer_access_check (cand
->access_path
, access_fn
, fn
);
5837 /* If we're checking for implicit delete, don't bother with argument
5839 if (flags
& LOOKUP_SPECULATIVE
)
5841 if (DECL_DELETED_FN (fn
))
5843 if (flags
& LOOKUP_COMPLAIN
)
5845 return error_mark_node
;
5847 if (cand
->viable
== 1)
5849 else if (!(flags
& LOOKUP_COMPLAIN
))
5850 /* Reject bad conversions now. */
5851 return error_mark_node
;
5852 /* else continue to get conversion error. */
5855 /* Find maximum size of vector to hold converted arguments. */
5856 parmlen
= list_length (parm
);
5857 nargs
= VEC_length (tree
, args
) + (first_arg
!= NULL_TREE
? 1 : 0);
5858 if (parmlen
> nargs
)
5860 argarray
= XALLOCAVEC (tree
, nargs
);
5862 /* The implicit parameters to a constructor are not considered by overload
5863 resolution, and must be of the proper type. */
5864 if (DECL_CONSTRUCTOR_P (fn
))
5866 if (first_arg
!= NULL_TREE
)
5868 argarray
[j
++] = first_arg
;
5869 first_arg
= NULL_TREE
;
5873 argarray
[j
++] = VEC_index (tree
, args
, arg_index
);
5876 parm
= TREE_CHAIN (parm
);
5877 /* We should never try to call the abstract constructor. */
5878 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
5880 if (DECL_HAS_VTT_PARM_P (fn
))
5882 argarray
[j
++] = VEC_index (tree
, args
, arg_index
);
5884 parm
= TREE_CHAIN (parm
);
5887 /* Bypass access control for 'this' parameter. */
5888 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
5890 tree parmtype
= TREE_VALUE (parm
);
5891 tree arg
= (first_arg
!= NULL_TREE
5893 : VEC_index (tree
, args
, arg_index
));
5894 tree argtype
= TREE_TYPE (arg
);
5898 if (convs
[i
]->bad_p
)
5900 if (complain
& tf_error
)
5901 permerror (input_location
, "passing %qT as %<this%> argument of %q#D discards qualifiers",
5902 TREE_TYPE (argtype
), fn
);
5904 return error_mark_node
;
5907 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
5908 X is called for an object that is not of type X, or of a type
5909 derived from X, the behavior is undefined.
5911 So we can assume that anything passed as 'this' is non-null, and
5912 optimize accordingly. */
5913 gcc_assert (TREE_CODE (parmtype
) == POINTER_TYPE
);
5914 /* Convert to the base in which the function was declared. */
5915 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
5916 converted_arg
= build_base_path (PLUS_EXPR
,
5918 cand
->conversion_path
,
5920 /* Check that the base class is accessible. */
5921 if (!accessible_base_p (TREE_TYPE (argtype
),
5922 BINFO_TYPE (cand
->conversion_path
), true))
5923 error ("%qT is not an accessible base of %qT",
5924 BINFO_TYPE (cand
->conversion_path
),
5925 TREE_TYPE (argtype
));
5926 /* If fn was found by a using declaration, the conversion path
5927 will be to the derived class, not the base declaring fn. We
5928 must convert from derived to base. */
5929 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
5930 TREE_TYPE (parmtype
), ba_unique
, NULL
);
5931 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
5934 argarray
[j
++] = converted_arg
;
5935 parm
= TREE_CHAIN (parm
);
5936 if (first_arg
!= NULL_TREE
)
5937 first_arg
= NULL_TREE
;
5944 gcc_assert (first_arg
== NULL_TREE
);
5945 for (; arg_index
< VEC_length (tree
, args
) && parm
;
5946 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
5948 tree type
= TREE_VALUE (parm
);
5949 tree arg
= VEC_index (tree
, args
, arg_index
);
5953 /* Don't make a copy here if build_call is going to. */
5954 if (conv
->kind
== ck_rvalue
5955 && COMPLETE_TYPE_P (complete_type (type
))
5956 && !TREE_ADDRESSABLE (type
))
5957 conv
= conv
->u
.next
;
5959 /* Warn about initializer_list deduction that isn't currently in the
5961 if (cxx_dialect
> cxx98
5962 && flag_deduce_init_list
5963 && cand
->template_decl
5964 && is_std_init_list (non_reference (type
))
5965 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
5967 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
5968 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
5969 tree patparm
= get_pattern_parm (realparm
, tmpl
);
5970 tree pattype
= TREE_TYPE (patparm
);
5971 if (PACK_EXPANSION_P (pattype
))
5972 pattype
= PACK_EXPANSION_PATTERN (pattype
);
5973 pattype
= non_reference (pattype
);
5975 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
5976 && (cand
->explicit_targs
== NULL_TREE
5977 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
5978 <= TEMPLATE_TYPE_IDX (pattype
))))
5980 pedwarn (input_location
, 0, "deducing %qT as %qT",
5981 non_reference (TREE_TYPE (patparm
)),
5982 non_reference (type
));
5983 pedwarn (input_location
, 0, " in call to %q+D", cand
->fn
);
5984 pedwarn (input_location
, 0,
5985 " (you can disable this with -fno-deduce-init-list)");
5989 val
= convert_like_with_context (conv
, arg
, fn
, i
-is_method
, complain
);
5991 val
= convert_for_arg_passing (type
, val
);
5992 if (val
== error_mark_node
)
5993 return error_mark_node
;
5995 argarray
[j
++] = val
;
5998 /* Default arguments */
5999 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
6000 argarray
[j
++] = convert_default_arg (TREE_VALUE (parm
),
6001 TREE_PURPOSE (parm
),
6004 for (; arg_index
< VEC_length (tree
, args
); ++arg_index
)
6006 tree a
= VEC_index (tree
, args
, arg_index
);
6007 if (magic_varargs_p (fn
))
6008 /* Do no conversions for magic varargs. */
6009 a
= mark_type_use (a
);
6011 a
= convert_arg_to_ellipsis (a
);
6015 gcc_assert (j
<= nargs
);
6018 check_function_arguments (TYPE_ATTRIBUTES (TREE_TYPE (fn
)),
6019 nargs
, argarray
, TYPE_ARG_TYPES (TREE_TYPE (fn
)));
6021 /* Avoid actually calling copy constructors and copy assignment operators,
6024 if (! flag_elide_constructors
)
6025 /* Do things the hard way. */;
6026 else if (cand
->num_convs
== 1
6027 && (DECL_COPY_CONSTRUCTOR_P (fn
)
6028 || DECL_MOVE_CONSTRUCTOR_P (fn
)))
6031 tree arg
= argarray
[num_artificial_parms_for (fn
)];
6033 bool trivial
= trivial_fn_p (fn
);
6035 /* Pull out the real argument, disregarding const-correctness. */
6037 while (CONVERT_EXPR_P (targ
)
6038 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
6039 targ
= TREE_OPERAND (targ
, 0);
6040 if (TREE_CODE (targ
) == ADDR_EXPR
)
6042 targ
= TREE_OPERAND (targ
, 0);
6043 if (!same_type_ignoring_top_level_qualifiers_p
6044 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
6053 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
6055 /* [class.copy]: the copy constructor is implicitly defined even if
6056 the implementation elided its use. */
6057 if (!trivial
|| DECL_DELETED_FN (fn
))
6060 already_used
= true;
6063 /* If we're creating a temp and we already have one, don't create a
6064 new one. If we're not creating a temp but we get one, use
6065 INIT_EXPR to collapse the temp into our target. Otherwise, if the
6066 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
6067 temp or an INIT_EXPR otherwise. */
6069 if (integer_zerop (fa
))
6071 if (TREE_CODE (arg
) == TARGET_EXPR
)
6074 return force_target_expr (DECL_CONTEXT (fn
), arg
);
6076 else if (TREE_CODE (arg
) == TARGET_EXPR
|| trivial
)
6078 tree to
= stabilize_reference (cp_build_indirect_ref (fa
, RO_NULL
,
6081 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
6085 else if (DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
6086 && trivial_fn_p (fn
)
6087 && !DECL_DELETED_FN (fn
))
6089 tree to
= stabilize_reference
6090 (cp_build_indirect_ref (argarray
[0], RO_NULL
, complain
));
6091 tree type
= TREE_TYPE (to
);
6092 tree as_base
= CLASSTYPE_AS_BASE (type
);
6093 tree arg
= argarray
[1];
6095 if (is_really_empty_class (type
))
6097 /* Avoid copying empty classes. */
6098 val
= build2 (COMPOUND_EXPR
, void_type_node
, to
, arg
);
6099 TREE_NO_WARNING (val
) = 1;
6100 val
= build2 (COMPOUND_EXPR
, type
, val
, to
);
6101 TREE_NO_WARNING (val
) = 1;
6103 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
6105 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
6106 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
6110 /* We must only copy the non-tail padding parts.
6111 Use __builtin_memcpy for the bitwise copy.
6112 FIXME fix 22488 so we can go back to using MODIFY_EXPR
6113 instead of an explicit call to memcpy. */
6115 tree arg0
, arg1
, arg2
, t
;
6116 tree test
= NULL_TREE
;
6118 arg2
= TYPE_SIZE_UNIT (as_base
);
6120 arg0
= cp_build_addr_expr (to
, complain
);
6122 if (!can_trust_pointer_alignment ())
6124 /* If we can't be sure about pointer alignment, a call
6125 to __builtin_memcpy is expanded as a call to memcpy, which
6126 is invalid with identical args. Otherwise it is
6127 expanded as a block move, which should be safe. */
6128 arg0
= save_expr (arg0
);
6129 arg1
= save_expr (arg1
);
6130 test
= build2 (EQ_EXPR
, boolean_type_node
, arg0
, arg1
);
6132 t
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
6133 t
= build_call_n (t
, 3, arg0
, arg1
, arg2
);
6135 t
= convert (TREE_TYPE (arg0
), t
);
6137 t
= build3 (COND_EXPR
, TREE_TYPE (t
), test
, arg0
, t
);
6138 val
= cp_build_indirect_ref (t
, RO_NULL
, complain
);
6139 TREE_NO_WARNING (val
) = 1;
6144 /* FIXME handle trivial default constructor and destructor, too. */
6149 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0)
6152 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
6155 gcc_assert (binfo
&& binfo
!= error_mark_node
);
6157 /* Warn about deprecated virtual functions now, since we're about
6158 to throw away the decl. */
6159 if (TREE_DEPRECATED (fn
))
6160 warn_deprecated_use (fn
, NULL_TREE
);
6162 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1);
6163 if (TREE_SIDE_EFFECTS (argarray
[0]))
6164 argarray
[0] = save_expr (argarray
[0]);
6165 t
= build_pointer_type (TREE_TYPE (fn
));
6166 if (DECL_CONTEXT (fn
) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn
)))
6167 fn
= build_java_interface_fn_ref (fn
, argarray
[0]);
6169 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
6173 fn
= build_addr_func (fn
);
6175 return build_cxx_call (fn
, nargs
, argarray
);
6178 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
6179 This function performs no overload resolution, conversion, or other
6180 high-level operations. */
6183 build_cxx_call (tree fn
, int nargs
, tree
*argarray
)
6187 fn
= build_call_a (fn
, nargs
, argarray
);
6189 /* If this call might throw an exception, note that fact. */
6190 fndecl
= get_callee_fndecl (fn
);
6191 if ((!fndecl
|| !TREE_NOTHROW (fndecl
))
6192 && at_function_scope_p ()
6194 && cp_function_chain
)
6195 cp_function_chain
->can_throw
= 1;
6197 /* Check that arguments to builtin functions match the expectations. */
6199 && DECL_BUILT_IN (fndecl
)
6200 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
6201 && !check_builtin_function_arguments (fndecl
, nargs
, argarray
))
6202 return error_mark_node
;
6204 /* Some built-in function calls will be evaluated at compile-time in
6206 fn
= fold_if_not_in_template (fn
);
6208 if (VOID_TYPE_P (TREE_TYPE (fn
)))
6211 fn
= require_complete_type (fn
);
6212 if (fn
== error_mark_node
)
6213 return error_mark_node
;
6215 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
6216 fn
= build_cplus_new (TREE_TYPE (fn
), fn
);
6217 return convert_from_reference (fn
);
6220 static GTY(()) tree java_iface_lookup_fn
;
6222 /* Make an expression which yields the address of the Java interface
6223 method FN. This is achieved by generating a call to libjava's
6224 _Jv_LookupInterfaceMethodIdx(). */
6227 build_java_interface_fn_ref (tree fn
, tree instance
)
6229 tree lookup_fn
, method
, idx
;
6230 tree klass_ref
, iface
, iface_ref
;
6233 if (!java_iface_lookup_fn
)
6235 tree ftype
= build_function_type_list (ptr_type_node
,
6236 ptr_type_node
, ptr_type_node
,
6237 java_int_type_node
, NULL_TREE
);
6238 java_iface_lookup_fn
6239 = add_builtin_function ("_Jv_LookupInterfaceMethodIdx", ftype
,
6240 0, NOT_BUILT_IN
, NULL
, NULL_TREE
);
6243 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
6244 This is the first entry in the vtable. */
6245 klass_ref
= build_vtbl_ref (cp_build_indirect_ref (instance
, RO_NULL
,
6246 tf_warning_or_error
),
6249 /* Get the java.lang.Class pointer for the interface being called. */
6250 iface
= DECL_CONTEXT (fn
);
6251 iface_ref
= lookup_field (iface
, get_identifier ("class$"), 0, false);
6252 if (!iface_ref
|| TREE_CODE (iface_ref
) != VAR_DECL
6253 || DECL_CONTEXT (iface_ref
) != iface
)
6255 error ("could not find class$ field in java interface type %qT",
6257 return error_mark_node
;
6259 iface_ref
= build_address (iface_ref
);
6260 iface_ref
= convert (build_pointer_type (iface
), iface_ref
);
6262 /* Determine the itable index of FN. */
6264 for (method
= TYPE_METHODS (iface
); method
; method
= DECL_CHAIN (method
))
6266 if (!DECL_VIRTUAL_P (method
))
6272 idx
= build_int_cst (NULL_TREE
, i
);
6274 lookup_fn
= build1 (ADDR_EXPR
,
6275 build_pointer_type (TREE_TYPE (java_iface_lookup_fn
)),
6276 java_iface_lookup_fn
);
6277 return build_call_nary (ptr_type_node
, lookup_fn
,
6278 3, klass_ref
, iface_ref
, idx
);
6281 /* Returns the value to use for the in-charge parameter when making a
6282 call to a function with the indicated NAME.
6284 FIXME:Can't we find a neater way to do this mapping? */
6287 in_charge_arg_for_name (tree name
)
6289 if (name
== base_ctor_identifier
6290 || name
== base_dtor_identifier
)
6291 return integer_zero_node
;
6292 else if (name
== complete_ctor_identifier
)
6293 return integer_one_node
;
6294 else if (name
== complete_dtor_identifier
)
6295 return integer_two_node
;
6296 else if (name
== deleting_dtor_identifier
)
6297 return integer_three_node
;
6299 /* This function should only be called with one of the names listed
6305 /* Build a call to a constructor, destructor, or an assignment
6306 operator for INSTANCE, an expression with class type. NAME
6307 indicates the special member function to call; *ARGS are the
6308 arguments. ARGS may be NULL. This may change ARGS. BINFO
6309 indicates the base of INSTANCE that is to be passed as the `this'
6310 parameter to the member function called.
6312 FLAGS are the LOOKUP_* flags to use when processing the call.
6314 If NAME indicates a complete object constructor, INSTANCE may be
6315 NULL_TREE. In this case, the caller will call build_cplus_new to
6316 store the newly constructed object into a VAR_DECL. */
6319 build_special_member_call (tree instance
, tree name
, VEC(tree
,gc
) **args
,
6320 tree binfo
, int flags
, tsubst_flags_t complain
)
6323 /* The type of the subobject to be constructed or destroyed. */
6325 VEC(tree
,gc
) *allocated
= NULL
;
6328 gcc_assert (name
== complete_ctor_identifier
6329 || name
== base_ctor_identifier
6330 || name
== complete_dtor_identifier
6331 || name
== base_dtor_identifier
6332 || name
== deleting_dtor_identifier
6333 || name
== ansi_assopname (NOP_EXPR
));
6336 /* Resolve the name. */
6337 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
6338 return error_mark_node
;
6340 binfo
= TYPE_BINFO (binfo
);
6343 gcc_assert (binfo
!= NULL_TREE
);
6345 class_type
= BINFO_TYPE (binfo
);
6347 /* Handle the special case where INSTANCE is NULL_TREE. */
6348 if (name
== complete_ctor_identifier
&& !instance
)
6350 instance
= build_int_cst (build_pointer_type (class_type
), 0);
6351 instance
= build1 (INDIRECT_REF
, class_type
, instance
);
6355 if (name
== complete_dtor_identifier
6356 || name
== base_dtor_identifier
6357 || name
== deleting_dtor_identifier
)
6358 gcc_assert (args
== NULL
|| VEC_empty (tree
, *args
));
6360 /* Convert to the base class, if necessary. */
6361 if (!same_type_ignoring_top_level_qualifiers_p
6362 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
6364 if (name
!= ansi_assopname (NOP_EXPR
))
6365 /* For constructors and destructors, either the base is
6366 non-virtual, or it is virtual but we are doing the
6367 conversion from a constructor or destructor for the
6368 complete object. In either case, we can convert
6370 instance
= convert_to_base_statically (instance
, binfo
);
6372 /* However, for assignment operators, we must convert
6373 dynamically if the base is virtual. */
6374 instance
= build_base_path (PLUS_EXPR
, instance
,
6375 binfo
, /*nonnull=*/1);
6379 gcc_assert (instance
!= NULL_TREE
);
6381 fns
= lookup_fnfields (binfo
, name
, 1);
6383 /* When making a call to a constructor or destructor for a subobject
6384 that uses virtual base classes, pass down a pointer to a VTT for
6386 if ((name
== base_ctor_identifier
6387 || name
== base_dtor_identifier
)
6388 && CLASSTYPE_VBASECLASSES (class_type
))
6393 /* If the current function is a complete object constructor
6394 or destructor, then we fetch the VTT directly.
6395 Otherwise, we look it up using the VTT we were given. */
6396 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
6397 vtt
= decay_conversion (vtt
);
6398 vtt
= build3 (COND_EXPR
, TREE_TYPE (vtt
),
6399 build2 (EQ_EXPR
, boolean_type_node
,
6400 current_in_charge_parm
, integer_zero_node
),
6403 gcc_assert (BINFO_SUBVTT_INDEX (binfo
));
6404 sub_vtt
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (vtt
), vtt
,
6405 BINFO_SUBVTT_INDEX (binfo
));
6409 allocated
= make_tree_vector ();
6413 VEC_safe_insert (tree
, gc
, *args
, 0, sub_vtt
);
6416 ret
= build_new_method_call (instance
, fns
, args
,
6417 TYPE_BINFO (BINFO_TYPE (binfo
)),
6421 if (allocated
!= NULL
)
6422 release_tree_vector (allocated
);
6427 /* Return the NAME, as a C string. The NAME indicates a function that
6428 is a member of TYPE. *FREE_P is set to true if the caller must
6429 free the memory returned.
6431 Rather than go through all of this, we should simply set the names
6432 of constructors and destructors appropriately, and dispense with
6433 ctor_identifier, dtor_identifier, etc. */
6436 name_as_c_string (tree name
, tree type
, bool *free_p
)
6440 /* Assume that we will not allocate memory. */
6442 /* Constructors and destructors are special. */
6443 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
6446 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
))));
6447 /* For a destructor, add the '~'. */
6448 if (name
== complete_dtor_identifier
6449 || name
== base_dtor_identifier
6450 || name
== deleting_dtor_identifier
)
6452 pretty_name
= concat ("~", pretty_name
, NULL
);
6453 /* Remember that we need to free the memory allocated. */
6457 else if (IDENTIFIER_TYPENAME_P (name
))
6459 pretty_name
= concat ("operator ",
6460 type_as_string_translate (TREE_TYPE (name
),
6461 TFF_PLAIN_IDENTIFIER
),
6463 /* Remember that we need to free the memory allocated. */
6467 pretty_name
= CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name
)));
6472 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
6473 be set, upon return, to the function called. ARGS may be NULL.
6474 This may change ARGS. */
6477 build_new_method_call (tree instance
, tree fns
, VEC(tree
,gc
) **args
,
6478 tree conversion_path
, int flags
,
6479 tree
*fn_p
, tsubst_flags_t complain
)
6481 struct z_candidate
*candidates
= 0, *cand
;
6482 tree explicit_targs
= NULL_TREE
;
6483 tree basetype
= NULL_TREE
;
6486 tree first_mem_arg
= NULL_TREE
;
6489 bool skip_first_for_error
;
6490 VEC(tree
,gc
) *user_args
;
6493 int template_only
= 0;
6497 VEC(tree
,gc
) *orig_args
= NULL
;
6500 gcc_assert (instance
!= NULL_TREE
);
6502 /* We don't know what function we're going to call, yet. */
6506 if (error_operand_p (instance
)
6507 || !fns
|| error_operand_p (fns
))
6508 return error_mark_node
;
6510 if (!BASELINK_P (fns
))
6512 if (complain
& tf_error
)
6513 error ("call to non-function %qD", fns
);
6514 return error_mark_node
;
6517 orig_instance
= instance
;
6520 /* Dismantle the baselink to collect all the information we need. */
6521 if (!conversion_path
)
6522 conversion_path
= BASELINK_BINFO (fns
);
6523 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
6524 optype
= BASELINK_OPTYPE (fns
);
6525 fns
= BASELINK_FUNCTIONS (fns
);
6526 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
6528 explicit_targs
= TREE_OPERAND (fns
, 1);
6529 fns
= TREE_OPERAND (fns
, 0);
6532 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
6533 || TREE_CODE (fns
) == TEMPLATE_DECL
6534 || TREE_CODE (fns
) == OVERLOAD
);
6535 fn
= get_first_fn (fns
);
6536 name
= DECL_NAME (fn
);
6538 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
6539 gcc_assert (CLASS_TYPE_P (basetype
));
6541 if (processing_template_decl
)
6543 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
6544 instance
= build_non_dependent_expr (instance
);
6546 make_args_non_dependent (*args
);
6549 user_args
= args
== NULL
? NULL
: *args
;
6550 /* Under DR 147 A::A() is an invalid constructor call,
6551 not a functional cast. */
6552 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
6554 if (! (complain
& tf_error
))
6555 return error_mark_node
;
6557 permerror (input_location
,
6558 "cannot call constructor %<%T::%D%> directly",
6560 permerror (input_location
, " for a function-style cast, remove the "
6561 "redundant %<::%D%>", name
);
6562 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
6567 /* Figure out whether to skip the first argument for the error
6568 message we will display to users if an error occurs. We don't
6569 want to display any compiler-generated arguments. The "this"
6570 pointer hasn't been added yet. However, we must remove the VTT
6571 pointer if this is a call to a base-class constructor or
6573 skip_first_for_error
= false;
6574 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
6576 /* Callers should explicitly indicate whether they want to construct
6577 the complete object or just the part without virtual bases. */
6578 gcc_assert (name
!= ctor_identifier
);
6579 /* Similarly for destructors. */
6580 gcc_assert (name
!= dtor_identifier
);
6581 /* Remove the VTT pointer, if present. */
6582 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
6583 && CLASSTYPE_VBASECLASSES (basetype
))
6584 skip_first_for_error
= true;
6587 /* Process the argument list. */
6588 if (args
!= NULL
&& *args
!= NULL
)
6590 *args
= resolve_args (*args
);
6592 return error_mark_node
;
6595 instance_ptr
= build_this (instance
);
6597 /* It's OK to call destructors and constructors on cv-qualified objects.
6598 Therefore, convert the INSTANCE_PTR to the unqualified type, if
6600 if (DECL_DESTRUCTOR_P (fn
)
6601 || DECL_CONSTRUCTOR_P (fn
))
6603 tree type
= build_pointer_type (basetype
);
6604 if (!same_type_p (type
, TREE_TYPE (instance_ptr
)))
6605 instance_ptr
= build_nop (type
, instance_ptr
);
6607 if (DECL_DESTRUCTOR_P (fn
))
6608 name
= complete_dtor_identifier
;
6610 first_mem_arg
= instance_ptr
;
6612 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6613 p
= conversion_obstack_alloc (0);
6615 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
6616 initializer, not T({ }). */
6617 if (DECL_CONSTRUCTOR_P (fn
) && args
!= NULL
&& !VEC_empty (tree
, *args
)
6618 && BRACE_ENCLOSED_INITIALIZER_P (VEC_index (tree
, *args
, 0))
6619 && CONSTRUCTOR_IS_DIRECT_INIT (VEC_index (tree
, *args
, 0)))
6621 gcc_assert (VEC_length (tree
, *args
) == 1
6622 && !(flags
& LOOKUP_ONLYCONVERTING
));
6624 add_list_candidates (fns
, first_mem_arg
, VEC_index (tree
, *args
, 0),
6625 basetype
, explicit_targs
, template_only
,
6626 conversion_path
, access_binfo
, flags
, &candidates
);
6630 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
6631 explicit_targs
, template_only
, conversion_path
,
6632 access_binfo
, flags
, &candidates
);
6634 any_viable_p
= false;
6635 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
6639 if (complain
& tf_error
)
6641 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
6642 cxx_incomplete_type_error (instance_ptr
, basetype
);
6644 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
6645 basetype
, optype
, build_tree_list_vec (user_args
),
6646 TREE_TYPE (TREE_TYPE (instance_ptr
)));
6653 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
6654 arglist
= build_tree_list_vec (user_args
);
6655 if (skip_first_for_error
)
6656 arglist
= TREE_CHAIN (arglist
);
6657 error ("no matching function for call to %<%T::%s(%A)%#V%>",
6658 basetype
, pretty_name
, arglist
,
6659 TREE_TYPE (TREE_TYPE (instance_ptr
)));
6663 print_z_candidates (candidates
);
6665 call
= error_mark_node
;
6669 cand
= tourney (candidates
);
6676 if (complain
& tf_error
)
6678 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
6679 arglist
= build_tree_list_vec (user_args
);
6680 if (skip_first_for_error
)
6681 arglist
= TREE_CHAIN (arglist
);
6682 error ("call of overloaded %<%s(%A)%> is ambiguous", pretty_name
,
6684 print_z_candidates (candidates
);
6688 call
= error_mark_node
;
6694 if (!(flags
& LOOKUP_NONVIRTUAL
)
6695 && DECL_PURE_VIRTUAL_P (fn
)
6696 && instance
== current_class_ref
6697 && (DECL_CONSTRUCTOR_P (current_function_decl
)
6698 || DECL_DESTRUCTOR_P (current_function_decl
))
6699 && (complain
& tf_warning
))
6700 /* This is not an error, it is runtime undefined
6702 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
) ?
6703 "pure virtual %q#D called from constructor"
6704 : "pure virtual %q#D called from destructor"),
6707 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
6708 && is_dummy_object (instance_ptr
))
6710 if (complain
& tf_error
)
6711 error ("cannot call member function %qD without object",
6713 call
= error_mark_node
;
6717 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
6718 && resolves_to_fixed_type_p (instance
, 0))
6719 flags
|= LOOKUP_NONVIRTUAL
;
6720 /* Now we know what function is being called. */
6723 /* Build the actual CALL_EXPR. */
6724 call
= build_over_call (cand
, flags
, complain
);
6725 /* In an expression of the form `a->f()' where `f' turns
6726 out to be a static member function, `a' is
6727 none-the-less evaluated. */
6728 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
6729 && !is_dummy_object (instance_ptr
)
6730 && TREE_SIDE_EFFECTS (instance_ptr
))
6731 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
),
6732 instance_ptr
, call
);
6733 else if (call
!= error_mark_node
6734 && DECL_DESTRUCTOR_P (cand
->fn
)
6735 && !VOID_TYPE_P (TREE_TYPE (call
)))
6736 /* An explicit call of the form "x->~X()" has type
6737 "void". However, on platforms where destructors
6738 return "this" (i.e., those where
6739 targetm.cxx.cdtor_returns_this is true), such calls
6740 will appear to have a return value of pointer type
6741 to the low-level call machinery. We do not want to
6742 change the low-level machinery, since we want to be
6743 able to optimize "delete f()" on such platforms as
6744 "operator delete(~X(f()))" (rather than generating
6745 "t = f(), ~X(t), operator delete (t)"). */
6746 call
= build_nop (void_type_node
, call
);
6751 if (processing_template_decl
&& call
!= error_mark_node
)
6753 bool cast_to_void
= false;
6755 if (TREE_CODE (call
) == COMPOUND_EXPR
)
6756 call
= TREE_OPERAND (call
, 1);
6757 else if (TREE_CODE (call
) == NOP_EXPR
)
6759 cast_to_void
= true;
6760 call
= TREE_OPERAND (call
, 0);
6762 if (TREE_CODE (call
) == INDIRECT_REF
)
6763 call
= TREE_OPERAND (call
, 0);
6764 call
= (build_min_non_dep_call_vec
6766 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
6767 orig_instance
, orig_fns
, NULL_TREE
),
6769 call
= convert_from_reference (call
);
6771 call
= build_nop (void_type_node
, call
);
6774 /* Free all the conversions we allocated. */
6775 obstack_free (&conversion_obstack
, p
);
6777 if (orig_args
!= NULL
)
6778 release_tree_vector (orig_args
);
6783 /* Returns true iff standard conversion sequence ICS1 is a proper
6784 subsequence of ICS2. */
6787 is_subseq (conversion
*ics1
, conversion
*ics2
)
6789 /* We can assume that a conversion of the same code
6790 between the same types indicates a subsequence since we only get
6791 here if the types we are converting from are the same. */
6793 while (ics1
->kind
== ck_rvalue
6794 || ics1
->kind
== ck_lvalue
)
6795 ics1
= ics1
->u
.next
;
6799 while (ics2
->kind
== ck_rvalue
6800 || ics2
->kind
== ck_lvalue
)
6801 ics2
= ics2
->u
.next
;
6803 if (ics2
->kind
== ck_user
6804 || ics2
->kind
== ck_ambig
6805 || ics2
->kind
== ck_aggr
6806 || ics2
->kind
== ck_list
6807 || ics2
->kind
== ck_identity
)
6808 /* At this point, ICS1 cannot be a proper subsequence of
6809 ICS2. We can get a USER_CONV when we are comparing the
6810 second standard conversion sequence of two user conversion
6814 ics2
= ics2
->u
.next
;
6816 if (ics2
->kind
== ics1
->kind
6817 && same_type_p (ics2
->type
, ics1
->type
)
6818 && same_type_p (ics2
->u
.next
->type
,
6819 ics1
->u
.next
->type
))
6824 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
6825 be any _TYPE nodes. */
6828 is_properly_derived_from (tree derived
, tree base
)
6830 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
6833 /* We only allow proper derivation here. The DERIVED_FROM_P macro
6834 considers every class derived from itself. */
6835 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
6836 && DERIVED_FROM_P (base
, derived
));
6839 /* We build the ICS for an implicit object parameter as a pointer
6840 conversion sequence. However, such a sequence should be compared
6841 as if it were a reference conversion sequence. If ICS is the
6842 implicit conversion sequence for an implicit object parameter,
6843 modify it accordingly. */
6846 maybe_handle_implicit_object (conversion
**ics
)
6850 /* [over.match.funcs]
6852 For non-static member functions, the type of the
6853 implicit object parameter is "reference to cv X"
6854 where X is the class of which the function is a
6855 member and cv is the cv-qualification on the member
6856 function declaration. */
6857 conversion
*t
= *ics
;
6858 tree reference_type
;
6860 /* The `this' parameter is a pointer to a class type. Make the
6861 implicit conversion talk about a reference to that same class
6863 reference_type
= TREE_TYPE (t
->type
);
6864 reference_type
= build_reference_type (reference_type
);
6866 if (t
->kind
== ck_qual
)
6868 if (t
->kind
== ck_ptr
)
6870 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
6871 t
= direct_reference_binding (reference_type
, t
);
6873 t
->rvaluedness_matches_p
= 0;
6878 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
6879 and return the initial reference binding conversion. Otherwise,
6880 leave *ICS unchanged and return NULL. */
6883 maybe_handle_ref_bind (conversion
**ics
)
6885 if ((*ics
)->kind
== ck_ref_bind
)
6887 conversion
*old_ics
= *ics
;
6888 *ics
= old_ics
->u
.next
;
6889 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
6896 /* Compare two implicit conversion sequences according to the rules set out in
6897 [over.ics.rank]. Return values:
6899 1: ics1 is better than ics2
6900 -1: ics2 is better than ics1
6901 0: ics1 and ics2 are indistinguishable */
6904 compare_ics (conversion
*ics1
, conversion
*ics2
)
6910 tree deref_from_type1
= NULL_TREE
;
6911 tree deref_from_type2
= NULL_TREE
;
6912 tree deref_to_type1
= NULL_TREE
;
6913 tree deref_to_type2
= NULL_TREE
;
6914 conversion_rank rank1
, rank2
;
6916 /* REF_BINDING is nonzero if the result of the conversion sequence
6917 is a reference type. In that case REF_CONV is the reference
6918 binding conversion. */
6919 conversion
*ref_conv1
;
6920 conversion
*ref_conv2
;
6922 /* Handle implicit object parameters. */
6923 maybe_handle_implicit_object (&ics1
);
6924 maybe_handle_implicit_object (&ics2
);
6926 /* Handle reference parameters. */
6927 ref_conv1
= maybe_handle_ref_bind (&ics1
);
6928 ref_conv2
= maybe_handle_ref_bind (&ics2
);
6930 /* List-initialization sequence L1 is a better conversion sequence than
6931 list-initialization sequence L2 if L1 converts to
6932 std::initializer_list<X> for some X and L2 does not. */
6933 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
6935 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
6940 When comparing the basic forms of implicit conversion sequences (as
6941 defined in _over.best.ics_)
6943 --a standard conversion sequence (_over.ics.scs_) is a better
6944 conversion sequence than a user-defined conversion sequence
6945 or an ellipsis conversion sequence, and
6947 --a user-defined conversion sequence (_over.ics.user_) is a
6948 better conversion sequence than an ellipsis conversion sequence
6949 (_over.ics.ellipsis_). */
6950 rank1
= CONVERSION_RANK (ics1
);
6951 rank2
= CONVERSION_RANK (ics2
);
6955 else if (rank1
< rank2
)
6958 if (rank1
== cr_bad
)
6960 /* Both ICS are bad. We try to make a decision based on what would
6961 have happened if they'd been good. This is not an extension,
6962 we'll still give an error when we build up the call; this just
6963 helps us give a more helpful error message. */
6964 rank1
= BAD_CONVERSION_RANK (ics1
);
6965 rank2
= BAD_CONVERSION_RANK (ics2
);
6969 else if (rank1
< rank2
)
6972 /* We couldn't make up our minds; try to figure it out below. */
6975 if (ics1
->ellipsis_p
)
6976 /* Both conversions are ellipsis conversions. */
6979 /* User-defined conversion sequence U1 is a better conversion sequence
6980 than another user-defined conversion sequence U2 if they contain the
6981 same user-defined conversion operator or constructor and if the sec-
6982 ond standard conversion sequence of U1 is better than the second
6983 standard conversion sequence of U2. */
6985 /* Handle list-conversion with the same code even though it isn't always
6986 ranked as a user-defined conversion and it doesn't have a second
6987 standard conversion sequence; it will still have the desired effect.
6988 Specifically, we need to do the reference binding comparison at the
6989 end of this function. */
6991 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
)
6996 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= t1
->u
.next
)
6997 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
6998 || t1
->kind
== ck_list
)
7000 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= t2
->u
.next
)
7001 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
7002 || t2
->kind
== ck_list
)
7005 if (t1
->kind
!= t2
->kind
)
7007 else if (t1
->kind
== ck_user
)
7009 if (t1
->cand
->fn
!= t2
->cand
->fn
)
7014 /* For ambiguous or aggregate conversions, use the target type as
7015 a proxy for the conversion function. */
7016 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
7020 /* We can just fall through here, after setting up
7021 FROM_TYPE1 and FROM_TYPE2. */
7022 from_type1
= t1
->type
;
7023 from_type2
= t2
->type
;
7030 /* We're dealing with two standard conversion sequences.
7034 Standard conversion sequence S1 is a better conversion
7035 sequence than standard conversion sequence S2 if
7037 --S1 is a proper subsequence of S2 (comparing the conversion
7038 sequences in the canonical form defined by _over.ics.scs_,
7039 excluding any Lvalue Transformation; the identity
7040 conversion sequence is considered to be a subsequence of
7041 any non-identity conversion sequence */
7044 while (t1
->kind
!= ck_identity
)
7046 from_type1
= t1
->type
;
7049 while (t2
->kind
!= ck_identity
)
7051 from_type2
= t2
->type
;
7054 /* One sequence can only be a subsequence of the other if they start with
7055 the same type. They can start with different types when comparing the
7056 second standard conversion sequence in two user-defined conversion
7058 if (same_type_p (from_type1
, from_type2
))
7060 if (is_subseq (ics1
, ics2
))
7062 if (is_subseq (ics2
, ics1
))
7070 --the rank of S1 is better than the rank of S2 (by the rules
7073 Standard conversion sequences are ordered by their ranks: an Exact
7074 Match is a better conversion than a Promotion, which is a better
7075 conversion than a Conversion.
7077 Two conversion sequences with the same rank are indistinguishable
7078 unless one of the following rules applies:
7080 --A conversion that does not a convert a pointer, pointer to member,
7081 or std::nullptr_t to bool is better than one that does.
7083 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
7084 so that we do not have to check it explicitly. */
7085 if (ics1
->rank
< ics2
->rank
)
7087 else if (ics2
->rank
< ics1
->rank
)
7090 to_type1
= ics1
->type
;
7091 to_type2
= ics2
->type
;
7093 /* A conversion from scalar arithmetic type to complex is worse than a
7094 conversion between scalar arithmetic types. */
7095 if (same_type_p (from_type1
, from_type2
)
7096 && ARITHMETIC_TYPE_P (from_type1
)
7097 && ARITHMETIC_TYPE_P (to_type1
)
7098 && ARITHMETIC_TYPE_P (to_type2
)
7099 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
7100 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
7102 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
7108 if (TYPE_PTR_P (from_type1
)
7109 && TYPE_PTR_P (from_type2
)
7110 && TYPE_PTR_P (to_type1
)
7111 && TYPE_PTR_P (to_type2
))
7113 deref_from_type1
= TREE_TYPE (from_type1
);
7114 deref_from_type2
= TREE_TYPE (from_type2
);
7115 deref_to_type1
= TREE_TYPE (to_type1
);
7116 deref_to_type2
= TREE_TYPE (to_type2
);
7118 /* The rules for pointers to members A::* are just like the rules
7119 for pointers A*, except opposite: if B is derived from A then
7120 A::* converts to B::*, not vice versa. For that reason, we
7121 switch the from_ and to_ variables here. */
7122 else if ((TYPE_PTRMEM_P (from_type1
) && TYPE_PTRMEM_P (from_type2
)
7123 && TYPE_PTRMEM_P (to_type1
) && TYPE_PTRMEM_P (to_type2
))
7124 || (TYPE_PTRMEMFUNC_P (from_type1
)
7125 && TYPE_PTRMEMFUNC_P (from_type2
)
7126 && TYPE_PTRMEMFUNC_P (to_type1
)
7127 && TYPE_PTRMEMFUNC_P (to_type2
)))
7129 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
7130 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
7131 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
7132 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
7135 if (deref_from_type1
!= NULL_TREE
7136 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
7137 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
7139 /* This was one of the pointer or pointer-like conversions.
7143 --If class B is derived directly or indirectly from class A,
7144 conversion of B* to A* is better than conversion of B* to
7145 void*, and conversion of A* to void* is better than
7146 conversion of B* to void*. */
7147 if (TREE_CODE (deref_to_type1
) == VOID_TYPE
7148 && TREE_CODE (deref_to_type2
) == VOID_TYPE
)
7150 if (is_properly_derived_from (deref_from_type1
,
7153 else if (is_properly_derived_from (deref_from_type2
,
7157 else if (TREE_CODE (deref_to_type1
) == VOID_TYPE
7158 || TREE_CODE (deref_to_type2
) == VOID_TYPE
)
7160 if (same_type_p (deref_from_type1
, deref_from_type2
))
7162 if (TREE_CODE (deref_to_type2
) == VOID_TYPE
)
7164 if (is_properly_derived_from (deref_from_type1
,
7168 /* We know that DEREF_TO_TYPE1 is `void' here. */
7169 else if (is_properly_derived_from (deref_from_type1
,
7174 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
7175 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
7179 --If class B is derived directly or indirectly from class A
7180 and class C is derived directly or indirectly from B,
7182 --conversion of C* to B* is better than conversion of C* to
7185 --conversion of B* to A* is better than conversion of C* to
7187 if (same_type_p (deref_from_type1
, deref_from_type2
))
7189 if (is_properly_derived_from (deref_to_type1
,
7192 else if (is_properly_derived_from (deref_to_type2
,
7196 else if (same_type_p (deref_to_type1
, deref_to_type2
))
7198 if (is_properly_derived_from (deref_from_type2
,
7201 else if (is_properly_derived_from (deref_from_type1
,
7207 else if (CLASS_TYPE_P (non_reference (from_type1
))
7208 && same_type_p (from_type1
, from_type2
))
7210 tree from
= non_reference (from_type1
);
7214 --binding of an expression of type C to a reference of type
7215 B& is better than binding an expression of type C to a
7216 reference of type A&
7218 --conversion of C to B is better than conversion of C to A, */
7219 if (is_properly_derived_from (from
, to_type1
)
7220 && is_properly_derived_from (from
, to_type2
))
7222 if (is_properly_derived_from (to_type1
, to_type2
))
7224 else if (is_properly_derived_from (to_type2
, to_type1
))
7228 else if (CLASS_TYPE_P (non_reference (to_type1
))
7229 && same_type_p (to_type1
, to_type2
))
7231 tree to
= non_reference (to_type1
);
7235 --binding of an expression of type B to a reference of type
7236 A& is better than binding an expression of type C to a
7237 reference of type A&,
7239 --conversion of B to A is better than conversion of C to A */
7240 if (is_properly_derived_from (from_type1
, to
)
7241 && is_properly_derived_from (from_type2
, to
))
7243 if (is_properly_derived_from (from_type2
, from_type1
))
7245 else if (is_properly_derived_from (from_type1
, from_type2
))
7252 --S1 and S2 differ only in their qualification conversion and yield
7253 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
7254 qualification signature of type T1 is a proper subset of the cv-
7255 qualification signature of type T2 */
7256 if (ics1
->kind
== ck_qual
7257 && ics2
->kind
== ck_qual
7258 && same_type_p (from_type1
, from_type2
))
7260 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
7267 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
7268 to an implicit object parameter, and either S1 binds an lvalue reference
7269 to an lvalue and S2 binds an rvalue reference or S1 binds an rvalue
7270 reference to an rvalue and S2 binds an lvalue reference
7271 (C++0x draft standard, 13.3.3.2)
7273 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
7274 types to which the references refer are the same type except for
7275 top-level cv-qualifiers, and the type to which the reference
7276 initialized by S2 refers is more cv-qualified than the type to
7277 which the reference initialized by S1 refers */
7279 if (ref_conv1
&& ref_conv2
)
7281 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
7282 && (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
7283 != TYPE_REF_IS_RVALUE (ref_conv2
->type
)))
7285 if (ref_conv1
->rvaluedness_matches_p
)
7287 if (ref_conv2
->rvaluedness_matches_p
)
7291 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
7292 return comp_cv_qualification (TREE_TYPE (ref_conv2
->type
),
7293 TREE_TYPE (ref_conv1
->type
));
7296 /* Neither conversion sequence is better than the other. */
7300 /* The source type for this standard conversion sequence. */
7303 source_type (conversion
*t
)
7305 for (;; t
= t
->u
.next
)
7307 if (t
->kind
== ck_user
7308 || t
->kind
== ck_ambig
7309 || t
->kind
== ck_identity
)
7315 /* Note a warning about preferring WINNER to LOSER. We do this by storing
7316 a pointer to LOSER and re-running joust to produce the warning if WINNER
7317 is actually used. */
7320 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
7322 candidate_warning
*cw
= (candidate_warning
*)
7323 conversion_obstack_alloc (sizeof (candidate_warning
));
7325 cw
->next
= winner
->warnings
;
7326 winner
->warnings
= cw
;
7329 /* Compare two candidates for overloading as described in
7330 [over.match.best]. Return values:
7332 1: cand1 is better than cand2
7333 -1: cand2 is better than cand1
7334 0: cand1 and cand2 are indistinguishable */
7337 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
)
7340 int off1
= 0, off2
= 0;
7344 /* Candidates that involve bad conversions are always worse than those
7346 if (cand1
->viable
> cand2
->viable
)
7348 if (cand1
->viable
< cand2
->viable
)
7351 /* If we have two pseudo-candidates for conversions to the same type,
7352 or two candidates for the same function, arbitrarily pick one. */
7353 if (cand1
->fn
== cand2
->fn
7354 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
7357 /* a viable function F1
7358 is defined to be a better function than another viable function F2 if
7359 for all arguments i, ICSi(F1) is not a worse conversion sequence than
7360 ICSi(F2), and then */
7362 /* for some argument j, ICSj(F1) is a better conversion sequence than
7365 /* For comparing static and non-static member functions, we ignore
7366 the implicit object parameter of the non-static function. The
7367 standard says to pretend that the static function has an object
7368 parm, but that won't work with operator overloading. */
7369 len
= cand1
->num_convs
;
7370 if (len
!= cand2
->num_convs
)
7372 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
7373 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
7375 gcc_assert (static_1
!= static_2
);
7386 for (i
= 0; i
< len
; ++i
)
7388 conversion
*t1
= cand1
->convs
[i
+ off1
];
7389 conversion
*t2
= cand2
->convs
[i
+ off2
];
7390 int comp
= compare_ics (t1
, t2
);
7395 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
7396 == cr_std
+ cr_promotion
)
7397 && t1
->kind
== ck_std
7398 && t2
->kind
== ck_std
7399 && TREE_CODE (t1
->type
) == INTEGER_TYPE
7400 && TREE_CODE (t2
->type
) == INTEGER_TYPE
7401 && (TYPE_PRECISION (t1
->type
)
7402 == TYPE_PRECISION (t2
->type
))
7403 && (TYPE_UNSIGNED (t1
->u
.next
->type
)
7404 || (TREE_CODE (t1
->u
.next
->type
)
7407 tree type
= t1
->u
.next
->type
;
7409 struct z_candidate
*w
, *l
;
7411 type1
= t1
->type
, type2
= t2
->type
,
7412 w
= cand1
, l
= cand2
;
7414 type1
= t2
->type
, type2
= t1
->type
,
7415 w
= cand2
, l
= cand1
;
7419 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
7420 type
, type1
, type2
);
7421 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
7427 if (winner
&& comp
!= winner
)
7436 /* warn about confusing overload resolution for user-defined conversions,
7437 either between a constructor and a conversion op, or between two
7439 if (winner
&& warn_conversion
&& cand1
->second_conv
7440 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
7441 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
7443 struct z_candidate
*w
, *l
;
7444 bool give_warning
= false;
7447 w
= cand1
, l
= cand2
;
7449 w
= cand2
, l
= cand1
;
7451 /* We don't want to complain about `X::operator T1 ()'
7452 beating `X::operator T2 () const', when T2 is a no less
7453 cv-qualified version of T1. */
7454 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
7455 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
7457 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
7458 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
7460 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
7465 if (!comp_ptr_ttypes (t
, f
))
7466 give_warning
= true;
7469 give_warning
= true;
7475 tree source
= source_type (w
->convs
[0]);
7476 if (! DECL_CONSTRUCTOR_P (w
->fn
))
7477 source
= TREE_TYPE (source
);
7478 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
7479 && warning (OPT_Wconversion
, " for conversion from %qT to %qT",
7480 source
, w
->second_conv
->type
))
7482 inform (input_location
, " because conversion sequence for the argument is better");
7493 F1 is a non-template function and F2 is a template function
7496 if (!cand1
->template_decl
&& cand2
->template_decl
)
7498 else if (cand1
->template_decl
&& !cand2
->template_decl
)
7502 F1 and F2 are template functions and the function template for F1 is
7503 more specialized than the template for F2 according to the partial
7506 if (cand1
->template_decl
&& cand2
->template_decl
)
7508 winner
= more_specialized_fn
7509 (TI_TEMPLATE (cand1
->template_decl
),
7510 TI_TEMPLATE (cand2
->template_decl
),
7511 /* [temp.func.order]: The presence of unused ellipsis and default
7512 arguments has no effect on the partial ordering of function
7513 templates. add_function_candidate() will not have
7514 counted the "this" argument for constructors. */
7515 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
7521 the context is an initialization by user-defined conversion (see
7522 _dcl.init_ and _over.match.user_) and the standard conversion
7523 sequence from the return type of F1 to the destination type (i.e.,
7524 the type of the entity being initialized) is a better conversion
7525 sequence than the standard conversion sequence from the return type
7526 of F2 to the destination type. */
7528 if (cand1
->second_conv
)
7530 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
7535 /* Check whether we can discard a builtin candidate, either because we
7536 have two identical ones or matching builtin and non-builtin candidates.
7538 (Pedantically in the latter case the builtin which matched the user
7539 function should not be added to the overload set, but we spot it here.
7542 ... the builtin candidates include ...
7543 - do not have the same parameter type list as any non-template
7544 non-member candidate. */
7546 if (TREE_CODE (cand1
->fn
) == IDENTIFIER_NODE
7547 || TREE_CODE (cand2
->fn
) == IDENTIFIER_NODE
)
7549 for (i
= 0; i
< len
; ++i
)
7550 if (!same_type_p (cand1
->convs
[i
]->type
,
7551 cand2
->convs
[i
]->type
))
7553 if (i
== cand1
->num_convs
)
7555 if (cand1
->fn
== cand2
->fn
)
7556 /* Two built-in candidates; arbitrarily pick one. */
7558 else if (TREE_CODE (cand1
->fn
) == IDENTIFIER_NODE
)
7559 /* cand1 is built-in; prefer cand2. */
7562 /* cand2 is built-in; prefer cand1. */
7567 /* If the two function declarations represent the same function (this can
7568 happen with declarations in multiple scopes and arg-dependent lookup),
7569 arbitrarily choose one. But first make sure the default args we're
7571 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
7572 && equal_functions (cand1
->fn
, cand2
->fn
))
7574 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
7575 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
7577 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
7579 for (i
= 0; i
< len
; ++i
)
7581 /* Don't crash if the fn is variadic. */
7584 parms1
= TREE_CHAIN (parms1
);
7585 parms2
= TREE_CHAIN (parms2
);
7589 parms1
= TREE_CHAIN (parms1
);
7591 parms2
= TREE_CHAIN (parms2
);
7595 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
7596 TREE_PURPOSE (parms2
)))
7600 permerror (input_location
, "default argument mismatch in "
7601 "overload resolution");
7602 inform (input_location
,
7603 " candidate 1: %q+#F", cand1
->fn
);
7604 inform (input_location
,
7605 " candidate 2: %q+#F", cand2
->fn
);
7608 add_warning (cand1
, cand2
);
7611 parms1
= TREE_CHAIN (parms1
);
7612 parms2
= TREE_CHAIN (parms2
);
7620 /* Extension: If the worst conversion for one candidate is worse than the
7621 worst conversion for the other, take the first. */
7624 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
7625 struct z_candidate
*w
= 0, *l
= 0;
7627 for (i
= 0; i
< len
; ++i
)
7629 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
7630 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
7631 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
7632 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
7635 winner
= 1, w
= cand1
, l
= cand2
;
7637 winner
= -1, w
= cand2
, l
= cand1
;
7640 /* Don't choose a deleted function over ambiguity. */
7641 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
7645 pedwarn (input_location
, 0,
7646 "ISO C++ says that these are ambiguous, even "
7647 "though the worst conversion for the first is better than "
7648 "the worst conversion for the second:");
7649 print_z_candidate (_("candidate 1:"), w
);
7650 print_z_candidate (_("candidate 2:"), l
);
7658 gcc_assert (!winner
);
7662 /* Given a list of candidates for overloading, find the best one, if any.
7663 This algorithm has a worst case of O(2n) (winner is last), and a best
7664 case of O(n/2) (totally ambiguous); much better than a sorting
7667 static struct z_candidate
*
7668 tourney (struct z_candidate
*candidates
)
7670 struct z_candidate
*champ
= candidates
, *challenger
;
7672 int champ_compared_to_predecessor
= 0;
7674 /* Walk through the list once, comparing each current champ to the next
7675 candidate, knocking out a candidate or two with each comparison. */
7677 for (challenger
= champ
->next
; challenger
; )
7679 fate
= joust (champ
, challenger
, 0);
7681 challenger
= challenger
->next
;
7686 champ
= challenger
->next
;
7689 champ_compared_to_predecessor
= 0;
7694 champ_compared_to_predecessor
= 1;
7697 challenger
= champ
->next
;
7701 /* Make sure the champ is better than all the candidates it hasn't yet
7702 been compared to. */
7704 for (challenger
= candidates
;
7706 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
7707 challenger
= challenger
->next
)
7709 fate
= joust (champ
, challenger
, 0);
7717 /* Returns nonzero if things of type FROM can be converted to TO. */
7720 can_convert (tree to
, tree from
)
7722 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
);
7725 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
7728 can_convert_arg (tree to
, tree from
, tree arg
, int flags
)
7734 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7735 p
= conversion_obstack_alloc (0);
7737 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
7739 ok_p
= (t
&& !t
->bad_p
);
7741 /* Free all the conversions we allocated. */
7742 obstack_free (&conversion_obstack
, p
);
7747 /* Like can_convert_arg, but allows dubious conversions as well. */
7750 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
)
7755 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7756 p
= conversion_obstack_alloc (0);
7757 /* Try to perform the conversion. */
7758 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
7760 /* Free all the conversions we allocated. */
7761 obstack_free (&conversion_obstack
, p
);
7766 /* Convert EXPR to TYPE. Return the converted expression.
7768 Note that we allow bad conversions here because by the time we get to
7769 this point we are committed to doing the conversion. If we end up
7770 doing a bad conversion, convert_like will complain. */
7773 perform_implicit_conversion_flags (tree type
, tree expr
, tsubst_flags_t complain
, int flags
)
7778 if (error_operand_p (expr
))
7779 return error_mark_node
;
7781 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7782 p
= conversion_obstack_alloc (0);
7784 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
7790 if (complain
& tf_error
)
7792 /* If expr has unknown type, then it is an overloaded function.
7793 Call instantiate_type to get good error messages. */
7794 if (TREE_TYPE (expr
) == unknown_type_node
)
7795 instantiate_type (type
, expr
, complain
);
7796 else if (invalid_nonstatic_memfn_p (expr
, complain
))
7797 /* We gave an error. */;
7799 error ("could not convert %qE to %qT", expr
, type
);
7801 expr
= error_mark_node
;
7803 else if (processing_template_decl
)
7805 /* In a template, we are only concerned about determining the
7806 type of non-dependent expressions, so we do not have to
7807 perform the actual conversion. */
7808 if (TREE_TYPE (expr
) != type
)
7809 expr
= build_nop (type
, expr
);
7812 expr
= convert_like (conv
, expr
, complain
);
7814 /* Free all the conversions we allocated. */
7815 obstack_free (&conversion_obstack
, p
);
7821 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
7823 return perform_implicit_conversion_flags (type
, expr
, complain
, LOOKUP_IMPLICIT
);
7826 /* Convert EXPR to TYPE (as a direct-initialization) if that is
7827 permitted. If the conversion is valid, the converted expression is
7828 returned. Otherwise, NULL_TREE is returned, except in the case
7829 that TYPE is a class type; in that case, an error is issued. If
7830 C_CAST_P is true, then this direction initialization is taking
7831 place as part of a static_cast being attempted as part of a C-style
7835 perform_direct_initialization_if_possible (tree type
,
7838 tsubst_flags_t complain
)
7843 if (type
== error_mark_node
|| error_operand_p (expr
))
7844 return error_mark_node
;
7847 If the destination type is a (possibly cv-qualified) class type:
7849 -- If the initialization is direct-initialization ...,
7850 constructors are considered. ... If no constructor applies, or
7851 the overload resolution is ambiguous, the initialization is
7853 if (CLASS_TYPE_P (type
))
7855 VEC(tree
,gc
) *args
= make_tree_vector_single (expr
);
7856 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
7857 &args
, type
, LOOKUP_NORMAL
, complain
);
7858 release_tree_vector (args
);
7859 return build_cplus_new (type
, expr
);
7862 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7863 p
= conversion_obstack_alloc (0);
7865 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
7868 if (!conv
|| conv
->bad_p
)
7871 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0, 0,
7872 /*issue_conversion_warnings=*/false,
7876 /* Free all the conversions we allocated. */
7877 obstack_free (&conversion_obstack
, p
);
7882 /* DECL is a VAR_DECL whose type is a REFERENCE_TYPE. The reference
7883 is being bound to a temporary. Create and return a new VAR_DECL
7884 with the indicated TYPE; this variable will store the value to
7885 which the reference is bound. */
7888 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
7892 /* Create the variable. */
7893 var
= create_temporary_var (type
);
7895 /* Register the variable. */
7896 if (TREE_STATIC (decl
))
7898 /* Namespace-scope or local static; give it a mangled name. */
7901 TREE_STATIC (var
) = 1;
7902 name
= mangle_ref_init_variable (decl
);
7903 DECL_NAME (var
) = name
;
7904 SET_DECL_ASSEMBLER_NAME (var
, name
);
7905 var
= pushdecl_top_level (var
);
7908 /* Create a new cleanup level if necessary. */
7909 maybe_push_cleanup_level (type
);
7914 /* EXPR is the initializer for a variable DECL of reference or
7915 std::initializer_list type. Create, push and return a new VAR_DECL
7916 for the initializer so that it will live as long as DECL. Any
7917 cleanup for the new variable is returned through CLEANUP, and the
7918 code to initialize the new variable is returned through INITP. */
7921 set_up_extended_ref_temp (tree decl
, tree expr
, tree
*cleanup
, tree
*initp
)
7927 /* Create the temporary variable. */
7928 type
= TREE_TYPE (expr
);
7929 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
7930 layout_decl (var
, 0);
7931 /* If the rvalue is the result of a function call it will be
7932 a TARGET_EXPR. If it is some other construct (such as a
7933 member access expression where the underlying object is
7934 itself the result of a function call), turn it into a
7935 TARGET_EXPR here. It is important that EXPR be a
7936 TARGET_EXPR below since otherwise the INIT_EXPR will
7937 attempt to make a bitwise copy of EXPR to initialize
7939 if (TREE_CODE (expr
) != TARGET_EXPR
)
7940 expr
= get_target_expr (expr
);
7942 /* If the initializer is constant, put it in DECL_INITIAL so we get
7943 static initialization and use in constant expressions. */
7944 init
= maybe_constant_init (expr
);
7945 if (TREE_CONSTANT (init
))
7947 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
7949 /* 5.19 says that a constant expression can include an
7950 lvalue-rvalue conversion applied to "a glvalue of literal type
7951 that refers to a non-volatile temporary object initialized
7952 with a constant expression". Rather than try to communicate
7953 that this VAR_DECL is a temporary, just mark it constexpr.
7955 Currently this is only useful for initializer_list temporaries,
7956 since reference vars can't appear in constant expressions. */
7957 DECL_DECLARED_CONSTEXPR_P (var
) = true;
7958 TREE_CONSTANT (var
) = true;
7960 DECL_INITIAL (var
) = init
;
7964 /* Create the INIT_EXPR that will initialize the temporary
7966 init
= build2 (INIT_EXPR
, type
, var
, expr
);
7967 if (at_function_scope_p ())
7969 add_decl_expr (var
);
7971 if (TREE_STATIC (var
))
7972 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
7974 *cleanup
= cxx_maybe_build_cleanup (var
);
7976 /* We must be careful to destroy the temporary only
7977 after its initialization has taken place. If the
7978 initialization throws an exception, then the
7979 destructor should not be run. We cannot simply
7980 transform INIT into something like:
7982 (INIT, ({ CLEANUP_STMT; }))
7984 because emit_local_var always treats the
7985 initializer as a full-expression. Thus, the
7986 destructor would run too early; it would run at the
7987 end of initializing the reference variable, rather
7988 than at the end of the block enclosing the
7991 The solution is to pass back a cleanup expression
7992 which the caller is responsible for attaching to
7993 the statement tree. */
7997 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
7998 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7999 static_aggregates
= tree_cons (NULL_TREE
, var
,
8007 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
8008 initializing a variable of that TYPE. If DECL is non-NULL, it is
8009 the VAR_DECL being initialized with the EXPR. (In that case, the
8010 type of DECL will be TYPE.) If DECL is non-NULL, then CLEANUP must
8011 also be non-NULL, and with *CLEANUP initialized to NULL. Upon
8012 return, if *CLEANUP is no longer NULL, it will be an expression
8013 that should be pushed as a cleanup after the returned expression
8014 is used to initialize DECL.
8016 Return the converted expression. */
8019 initialize_reference (tree type
, tree expr
, tree decl
, tree
*cleanup
,
8020 tsubst_flags_t complain
)
8025 if (type
== error_mark_node
|| error_operand_p (expr
))
8026 return error_mark_node
;
8028 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8029 p
= conversion_obstack_alloc (0);
8031 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
8033 if (!conv
|| conv
->bad_p
)
8035 if (complain
& tf_error
)
8037 if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
8038 && !TYPE_REF_IS_RVALUE (type
)
8039 && !real_lvalue_p (expr
))
8040 error ("invalid initialization of non-const reference of "
8041 "type %qT from an rvalue of type %qT",
8042 type
, TREE_TYPE (expr
));
8044 error ("invalid initialization of reference of type "
8045 "%qT from expression of type %qT", type
,
8048 return error_mark_node
;
8051 /* If DECL is non-NULL, then this special rule applies:
8055 The temporary to which the reference is bound or the temporary
8056 that is the complete object to which the reference is bound
8057 persists for the lifetime of the reference.
8059 The temporaries created during the evaluation of the expression
8060 initializing the reference, except the temporary to which the
8061 reference is bound, are destroyed at the end of the
8062 full-expression in which they are created.
8064 In that case, we store the converted expression into a new
8065 VAR_DECL in a new scope.
8067 However, we want to be careful not to create temporaries when
8068 they are not required. For example, given:
8071 struct D : public B {};
8075 there is no need to copy the return value from "f"; we can just
8076 extend its lifetime. Similarly, given:
8079 struct T { operator S(); };
8083 we can extend the lifetime of the return value of the conversion
8085 gcc_assert (conv
->kind
== ck_ref_bind
);
8089 tree base_conv_type
;
8091 /* Skip over the REF_BIND. */
8092 conv
= conv
->u
.next
;
8093 /* If the next conversion is a BASE_CONV, skip that too -- but
8094 remember that the conversion was required. */
8095 if (conv
->kind
== ck_base
)
8097 base_conv_type
= conv
->type
;
8098 conv
= conv
->u
.next
;
8101 base_conv_type
= NULL_TREE
;
8102 /* Perform the remainder of the conversion. */
8103 expr
= convert_like_real (conv
, expr
,
8104 /*fn=*/NULL_TREE
, /*argnum=*/0,
8106 /*issue_conversion_warnings=*/true,
8108 tf_warning_or_error
);
8109 if (error_operand_p (expr
))
8110 expr
= error_mark_node
;
8113 if (!lvalue_or_rvalue_with_address_p (expr
))
8116 var
= set_up_extended_ref_temp (decl
, expr
, cleanup
, &init
);
8117 /* Use its address to initialize the reference variable. */
8118 expr
= build_address (var
);
8120 expr
= convert_to_base (expr
,
8121 build_pointer_type (base_conv_type
),
8122 /*check_access=*/true,
8123 /*nonnull=*/true, complain
);
8125 expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr
), init
, expr
);
8128 /* Take the address of EXPR. */
8129 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
8130 /* If a BASE_CONV was required, perform it now. */
8132 expr
= (perform_implicit_conversion
8133 (build_pointer_type (base_conv_type
), expr
,
8134 tf_warning_or_error
));
8135 expr
= build_nop (type
, expr
);
8139 /* Perform the conversion. */
8140 expr
= convert_like (conv
, expr
, tf_warning_or_error
);
8142 /* Free all the conversions we allocated. */
8143 obstack_free (&conversion_obstack
, p
);
8148 /* Returns true iff TYPE is some variant of std::initializer_list. */
8151 is_std_init_list (tree type
)
8153 /* Look through typedefs. */
8156 type
= TYPE_MAIN_VARIANT (type
);
8157 return (CLASS_TYPE_P (type
)
8158 && CP_TYPE_CONTEXT (type
) == std_node
8159 && strcmp (TYPE_NAME_STRING (type
), "initializer_list") == 0);
8162 /* Returns true iff DECL is a list constructor: i.e. a constructor which
8163 will accept an argument list of a single std::initializer_list<T>. */
8166 is_list_ctor (tree decl
)
8168 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
8171 if (!args
|| args
== void_list_node
)
8174 arg
= non_reference (TREE_VALUE (args
));
8175 if (!is_std_init_list (arg
))
8178 args
= TREE_CHAIN (args
);
8180 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
8181 /* There are more non-defaulted parms. */
8187 #include "gt-cp-call.h"