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 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com) and
5 modified by Brendan Kehoe (brendan@cygnus.com).
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING. If not, write to
21 the Free Software Foundation, 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA. */
25 /* High-level class interface. */
29 #include "coretypes.h"
38 #include "diagnostic.h"
41 extern int inhibit_warnings
;
43 static tree
build_field_call (tree
, tree
, tree
);
44 static struct z_candidate
* tourney (struct z_candidate
*);
45 static int equal_functions (tree
, tree
);
46 static int joust (struct z_candidate
*, struct z_candidate
*, bool);
47 static int compare_ics (tree
, tree
);
48 static tree
build_over_call (struct z_candidate
*, int);
49 static tree
build_java_interface_fn_ref (tree
, tree
);
50 #define convert_like(CONV, EXPR) \
51 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0)
52 #define convert_like_with_context(CONV, EXPR, FN, ARGNO) \
53 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0)
54 static tree
convert_like_real (tree
, tree
, tree
, int, int);
55 static void op_error (enum tree_code
, enum tree_code
, tree
, tree
,
57 static tree
build_object_call (tree
, tree
);
58 static tree
resolve_args (tree
);
59 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int);
60 static void print_z_candidate (const char *, struct z_candidate
*);
61 static void print_z_candidates (struct z_candidate
*);
62 static tree
build_this (tree
);
63 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
64 static bool any_strictly_viable (struct z_candidate
*);
65 static struct z_candidate
*add_template_candidate
66 (struct z_candidate
**, tree
, tree
, tree
, tree
, tree
,
67 tree
, tree
, int, unification_kind_t
);
68 static struct z_candidate
*add_template_candidate_real
69 (struct z_candidate
**, tree
, tree
, tree
, tree
, tree
,
70 tree
, tree
, int, tree
, unification_kind_t
);
71 static struct z_candidate
*add_template_conv_candidate
72 (struct z_candidate
**, tree
, tree
, tree
, tree
, tree
, tree
);
73 static void add_builtin_candidates
74 (struct z_candidate
**, enum tree_code
, enum tree_code
,
76 static void add_builtin_candidate
77 (struct z_candidate
**, enum tree_code
, enum tree_code
,
78 tree
, tree
, tree
, tree
*, tree
*, int);
79 static bool is_complete (tree
);
80 static void build_builtin_candidate
81 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
83 static struct z_candidate
*add_conv_candidate
84 (struct z_candidate
**, tree
, tree
, tree
, tree
, tree
);
85 static struct z_candidate
*add_function_candidate
86 (struct z_candidate
**, tree
, tree
, tree
, tree
, tree
, int);
87 static tree
implicit_conversion (tree
, tree
, tree
, int);
88 static tree
standard_conversion (tree
, tree
, tree
);
89 static tree
reference_binding (tree
, tree
, tree
, int);
90 static tree
non_reference (tree
);
91 static tree
build_conv (enum tree_code
, tree
, tree
);
92 static bool is_subseq (tree
, tree
);
93 static tree
maybe_handle_ref_bind (tree
*);
94 static void maybe_handle_implicit_object (tree
*);
95 static struct z_candidate
*add_candidate
96 (struct z_candidate
**, tree
, tree
, tree
, tree
, tree
, int);
97 static tree
source_type (tree
);
98 static void add_warning (struct z_candidate
*, struct z_candidate
*);
99 static bool reference_related_p (tree
, tree
);
100 static bool reference_compatible_p (tree
, tree
);
101 static tree
convert_class_to_reference (tree
, tree
, tree
);
102 static tree
direct_reference_binding (tree
, tree
);
103 static bool promoted_arithmetic_type_p (tree
);
104 static tree
conditional_conversion (tree
, tree
);
105 static char *name_as_c_string (tree
, tree
, bool *);
106 static tree
call_builtin_trap (void);
107 static tree
prep_operand (tree
);
108 static void add_candidates (tree
, tree
, tree
, bool, tree
, tree
,
109 int, struct z_candidate
**);
110 static tree
merge_conversion_sequences (tree
, tree
);
113 build_vfield_ref (tree datum
, tree type
)
115 if (datum
== error_mark_node
)
116 return error_mark_node
;
118 if (TREE_CODE (TREE_TYPE (datum
)) == REFERENCE_TYPE
)
119 datum
= convert_from_reference (datum
);
121 if (TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type
)
122 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum
), type
))
123 datum
= convert_to_base (datum
, type
, /*check_access=*/false);
125 return build (COMPONENT_REF
, TREE_TYPE (TYPE_VFIELD (type
)),
126 datum
, TYPE_VFIELD (type
));
129 /* Build a call to a member of an object. I.e., one that overloads
130 operator ()(), or is a pointer-to-function or pointer-to-method. */
133 build_field_call (tree instance_ptr
, tree decl
, tree parms
)
137 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
140 if (TREE_CODE (decl
) == FIELD_DECL
|| TREE_CODE (decl
) == VAR_DECL
)
142 /* If it's a field, try overloading operator (),
143 or calling if the field is a pointer-to-function. */
144 instance
= build_indirect_ref (instance_ptr
, NULL
);
145 instance
= build_class_member_access_expr (instance
, decl
,
146 /*access_path=*/NULL_TREE
,
147 /*preserve_reference=*/false);
149 if (instance
== error_mark_node
)
150 return error_mark_node
;
152 if (IS_AGGR_TYPE (TREE_TYPE (instance
)))
153 return build_new_op (CALL_EXPR
, LOOKUP_NORMAL
,
154 instance
, parms
, NULL_TREE
);
155 else if (TREE_CODE (TREE_TYPE (instance
)) == FUNCTION_TYPE
156 || (TREE_CODE (TREE_TYPE (instance
)) == POINTER_TYPE
157 && (TREE_CODE (TREE_TYPE (TREE_TYPE (instance
)))
159 return build_function_call (instance
, parms
);
165 /* Returns nonzero iff the destructor name specified in NAME
166 (a BIT_NOT_EXPR) matches BASETYPE. The operand of NAME can take many
170 check_dtor_name (tree basetype
, tree name
)
172 name
= TREE_OPERAND (name
, 0);
174 /* Just accept something we've already complained about. */
175 if (name
== error_mark_node
)
178 if (TREE_CODE (name
) == TYPE_DECL
)
179 name
= TREE_TYPE (name
);
180 else if (TYPE_P (name
))
182 else if (TREE_CODE (name
) == IDENTIFIER_NODE
)
184 if ((IS_AGGR_TYPE (basetype
) && name
== constructor_name (basetype
))
185 || (TREE_CODE (basetype
) == ENUMERAL_TYPE
186 && name
== TYPE_IDENTIFIER (basetype
)))
189 name
= get_type_value (name
);
193 template <class T> struct S { ~S(); };
197 NAME will be a class template. */
198 else if (DECL_CLASS_TEMPLATE_P (name
))
203 if (name
&& TYPE_MAIN_VARIANT (basetype
) == TYPE_MAIN_VARIANT (name
))
208 /* Build a method call of the form `EXP->SCOPES::NAME (PARMS)'.
209 This is how virtual function calls are avoided. */
212 build_scoped_method_call (tree exp
, tree basetype
, tree name
, tree parms
)
214 /* Because this syntactic form does not allow
215 a pointer to a base class to be `stolen',
216 we need not protect the derived->base conversion
219 @@ But we do have to check access privileges later. */
221 tree type
= TREE_TYPE (exp
);
223 if (type
== error_mark_node
224 || basetype
== error_mark_node
)
225 return error_mark_node
;
227 if (processing_template_decl
)
229 name
= build_min_nt (SCOPE_REF
, basetype
, name
);
230 return build_min_nt (METHOD_CALL_EXPR
, name
, exp
, parms
, NULL_TREE
);
233 if (TREE_CODE (type
) == REFERENCE_TYPE
)
234 type
= TREE_TYPE (type
);
236 if (TREE_CODE (basetype
) == TREE_VEC
)
239 basetype
= BINFO_TYPE (binfo
);
244 /* Check the destructor call syntax. */
245 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
247 /* We can get here if someone writes their destructor call like
248 `obj.NS::~T()'; this isn't really a scoped method call, so hand
250 if (TREE_CODE (basetype
) == NAMESPACE_DECL
)
251 return build_method_call (exp
, name
, parms
, NULL_TREE
, LOOKUP_NORMAL
);
253 if (! check_dtor_name (basetype
, name
))
254 error ("qualified type `%T' does not match destructor name `~%T'",
255 basetype
, TREE_OPERAND (name
, 0));
257 /* Destructors can be "called" for simple types; see 5.2.4 and 12.4 Note
258 that explicit ~int is caught in the parser; this deals with typedefs
259 and template parms. */
260 if (! IS_AGGR_TYPE (basetype
))
262 if (TYPE_MAIN_VARIANT (type
) != TYPE_MAIN_VARIANT (basetype
))
263 error ("type of `%E' does not match destructor type `%T' (type was `%T')",
264 exp
, basetype
, type
);
266 return cp_convert (void_type_node
, exp
);
270 if (TREE_CODE (basetype
) == NAMESPACE_DECL
)
272 error ("`%D' is a namespace", basetype
);
273 return error_mark_node
;
275 if (! is_aggr_type (basetype
, 1))
276 return error_mark_node
;
278 if (! IS_AGGR_TYPE (type
))
280 error ("base object `%E' of scoped method call is of non-aggregate type `%T'",
282 return error_mark_node
;
285 decl
= build_scoped_ref (exp
, basetype
, &binfo
);
289 /* Call to a destructor. */
290 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
292 if (! TYPE_HAS_DESTRUCTOR (TREE_TYPE (decl
)))
293 return cp_convert (void_type_node
, exp
);
295 return build_delete (TREE_TYPE (decl
), decl
,
296 sfk_complete_destructor
,
297 LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
,
301 /* Call to a method. */
302 return build_method_call (decl
, name
, parms
, binfo
,
303 LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
);
305 return error_mark_node
;
308 /* We want the address of a function or method. We avoid creating a
309 pointer-to-member function. */
312 build_addr_func (tree function
)
314 tree type
= TREE_TYPE (function
);
316 /* We have to do these by hand to avoid real pointer to member
318 if (TREE_CODE (type
) == METHOD_TYPE
)
322 type
= build_pointer_type (type
);
324 if (!cxx_mark_addressable (function
))
325 return error_mark_node
;
327 addr
= build1 (ADDR_EXPR
, type
, function
);
329 /* Address of a static or external variable or function counts
331 if (staticp (function
))
332 TREE_CONSTANT (addr
) = 1;
337 function
= default_conversion (function
);
342 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
343 POINTER_TYPE to those. Note, pointer to member function types
344 (TYPE_PTRMEMFUNC_P) must be handled by our callers. */
347 build_call (tree function
, tree parms
)
349 int is_constructor
= 0;
356 function
= build_addr_func (function
);
358 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
360 sorry ("unable to call pointer to member function here");
361 return error_mark_node
;
364 fntype
= TREE_TYPE (TREE_TYPE (function
));
365 result_type
= TREE_TYPE (fntype
);
367 if (TREE_CODE (function
) == ADDR_EXPR
368 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
369 decl
= TREE_OPERAND (function
, 0);
373 /* We check both the decl and the type; a function may be known not to
374 throw without being declared throw(). */
375 nothrow
= ((decl
&& TREE_NOTHROW (decl
))
376 || TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (function
))));
378 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
)
379 current_function_returns_abnormally
= 1;
381 if (decl
&& TREE_DEPRECATED (decl
))
382 warn_deprecated_use (decl
);
383 require_complete_eh_spec_types (fntype
, decl
);
385 if (decl
&& DECL_CONSTRUCTOR_P (decl
))
388 if (decl
&& ! TREE_USED (decl
))
390 /* We invoke build_call directly for several library functions.
391 These may have been declared normally if we're building libgcc,
392 so we can't just check DECL_ARTIFICIAL. */
393 if (DECL_ARTIFICIAL (decl
)
394 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)), "__", 2))
400 /* Don't pass empty class objects by value. This is useful
401 for tags in STL, which are used to control overload resolution.
402 We don't need to handle other cases of copying empty classes. */
403 if (! decl
|| ! DECL_BUILT_IN (decl
))
404 for (tmp
= parms
; tmp
; tmp
= TREE_CHAIN (tmp
))
405 if (is_empty_class (TREE_TYPE (TREE_VALUE (tmp
)))
406 && ! TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (tmp
))))
408 tree t
= build (EMPTY_CLASS_EXPR
, TREE_TYPE (TREE_VALUE (tmp
)));
409 TREE_VALUE (tmp
) = build (COMPOUND_EXPR
, TREE_TYPE (t
),
410 TREE_VALUE (tmp
), t
);
413 function
= build_nt (CALL_EXPR
, function
, parms
, NULL_TREE
);
414 TREE_HAS_CONSTRUCTOR (function
) = is_constructor
;
415 TREE_TYPE (function
) = result_type
;
416 TREE_SIDE_EFFECTS (function
) = 1;
417 TREE_NOTHROW (function
) = nothrow
;
422 /* Build something of the form ptr->method (args)
423 or object.method (args). This can also build
424 calls to constructors, and find friends.
426 Member functions always take their class variable
429 INSTANCE is a class instance.
431 NAME is the name of the method desired, usually an IDENTIFIER_NODE.
433 PARMS help to figure out what that NAME really refers to.
435 BASETYPE_PATH, if non-NULL, contains a chain from the type of INSTANCE
436 down to the real instance type to use for access checking. We need this
437 information to get protected accesses correct. This parameter is used
438 by build_member_call.
440 FLAGS is the logical disjunction of zero or more LOOKUP_
441 flags. See cp-tree.h for more info.
443 If this is all OK, calls build_function_call with the resolved
446 This function must also handle being called to perform
447 initialization, promotion/coercion of arguments, and
448 instantiation of default parameters.
450 Note that NAME may refer to an instance variable name. If
451 `operator()()' is defined for the type of that field, then we return
454 #ifdef GATHER_STATISTICS
455 extern int n_build_method_call
;
459 build_method_call (tree instance
, tree name
, tree parms
,
460 tree basetype_path
, int flags
)
464 tree template_args
= NULL_TREE
;
465 bool has_template_args
= false;
467 #ifdef GATHER_STATISTICS
468 n_build_method_call
++;
471 if (instance
== error_mark_node
472 || name
== error_mark_node
473 || parms
== error_mark_node
474 || (instance
&& TREE_TYPE (instance
) == error_mark_node
))
475 return error_mark_node
;
477 if (processing_template_decl
)
478 return build_min_nt (METHOD_CALL_EXPR
, name
, instance
, parms
, NULL_TREE
);
480 if (TREE_CODE (instance
) == OFFSET_REF
)
481 instance
= resolve_offset_ref (instance
);
482 if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
483 instance
= convert_from_reference (instance
);
484 object_type
= TREE_TYPE (instance
);
486 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
491 error ("destructors take no parameters");
493 if (! check_dtor_name (object_type
, name
))
495 ("destructor name `~%T' does not match type `%T' of expression",
496 TREE_OPERAND (name
, 0), object_type
);
498 if (! TYPE_HAS_DESTRUCTOR (complete_type (object_type
)))
499 return cp_convert (void_type_node
, instance
);
500 instance
= default_conversion (instance
);
501 instance_ptr
= build_unary_op (ADDR_EXPR
, instance
, 0);
502 return build_delete (build_pointer_type (object_type
),
503 instance_ptr
, sfk_complete_destructor
,
504 LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
, 0);
507 if (!CLASS_TYPE_P (object_type
))
509 if ((flags
& LOOKUP_COMPLAIN
)
510 && TREE_TYPE (instance
) != error_mark_node
)
511 error ("request for member `%D' in `%E', which is of non-aggregate type `%T'",
512 name
, instance
, object_type
);
513 return error_mark_node
;
516 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
518 template_args
= TREE_OPERAND (name
, 1);
519 has_template_args
= true;
520 name
= TREE_OPERAND (name
, 0);
522 if (TREE_CODE (name
) == OVERLOAD
)
523 name
= DECL_NAME (get_first_fn (name
));
524 else if (DECL_P (name
))
525 name
= DECL_NAME (name
);
526 if (has_template_args
)
527 fn
= lookup_fnfields (object_type
, name
, /*protect=*/2);
529 fn
= lookup_member (object_type
, name
, /*protect=*/2, /*want_type=*/false);
531 if (fn
&& TREE_CODE (fn
) == TREE_LIST
&& !BASELINK_P (fn
))
533 error ("request for member `%D' is ambiguous", name
);
534 print_candidates (fn
);
535 return error_mark_node
;
538 /* If the name could not be found, issue an error. */
541 unqualified_name_lookup_error (name
);
542 return error_mark_node
;
545 if (BASELINK_P (fn
) && has_template_args
)
546 BASELINK_FUNCTIONS (fn
)
547 = build_nt (TEMPLATE_ID_EXPR
,
548 BASELINK_FUNCTIONS (fn
),
550 if (BASELINK_P (fn
) && basetype_path
)
551 BASELINK_ACCESS_BINFO (fn
) = basetype_path
;
553 return build_new_method_call (instance
, fn
, parms
,
554 /*conversion_path=*/NULL_TREE
, flags
);
557 /* New overloading code. */
559 struct z_candidate
GTY(()) {
560 /* The FUNCTION_DECL that will be called if this candidate is
561 selected by overload resolution. */
563 /* The arguments to use when calling this function. */
565 /* The implicit conversion sequences for each of the arguments to
568 /* If FN is a user-defined conversion, the standard conversion
569 sequence from the type returned by FN to the desired destination
573 /* If FN is a member function, the binfo indicating the path used to
574 qualify the name of FN at the call site. This path is used to
575 determine whether or not FN is accessible if it is selected by
576 overload resolution. The DECL_CONTEXT of FN will always be a
577 (possibly improper) base of this binfo. */
579 /* If FN is a non-static member function, the binfo indicating the
580 subobject to which the `this' pointer should be converted if FN
581 is selected by overload resolution. The type pointed to the by
582 the `this' pointer must correspond to the most derived class
583 indicated by the CONVERSION_PATH. */
584 tree conversion_path
;
587 struct z_candidate
*next
;
590 #define IDENTITY_RANK 0
596 #define ELLIPSIS_RANK 6
599 #define ICS_RANK(NODE) \
600 (ICS_BAD_FLAG (NODE) ? BAD_RANK \
601 : ICS_ELLIPSIS_FLAG (NODE) ? ELLIPSIS_RANK \
602 : ICS_USER_FLAG (NODE) ? USER_RANK \
603 : ICS_STD_RANK (NODE))
605 #define ICS_STD_RANK(NODE) TREE_COMPLEXITY (NODE)
607 #define ICS_USER_FLAG(NODE) TREE_LANG_FLAG_0 (NODE)
608 #define ICS_ELLIPSIS_FLAG(NODE) TREE_LANG_FLAG_1 (NODE)
609 #define ICS_THIS_FLAG(NODE) TREE_LANG_FLAG_2 (NODE)
610 #define ICS_BAD_FLAG(NODE) TREE_LANG_FLAG_3 (NODE)
612 /* In a REF_BIND or a BASE_CONV, this indicates that a temporary
613 should be created to hold the result of the conversion. */
614 #define NEED_TEMPORARY_P(NODE) TREE_LANG_FLAG_4 (NODE)
616 #define USER_CONV_CAND(NODE) WRAPPER_ZC (TREE_OPERAND (NODE, 1))
617 #define USER_CONV_FN(NODE) (USER_CONV_CAND (NODE)->fn)
620 null_ptr_cst_p (tree t
)
624 A null pointer constant is an integral constant expression
625 (_expr.const_) rvalue of integer type that evaluates to zero. */
627 || (CP_INTEGRAL_TYPE_P (TREE_TYPE (t
)) && integer_zerop (t
)))
633 /* Returns nonzero if PARMLIST consists of only default parms and/or
637 sufficient_parms_p (tree parmlist
)
639 for (; parmlist
&& parmlist
!= void_list_node
;
640 parmlist
= TREE_CHAIN (parmlist
))
641 if (!TREE_PURPOSE (parmlist
))
647 build_conv (enum tree_code code
, tree type
, tree from
)
650 int rank
= ICS_STD_RANK (from
);
652 /* We can't use buildl1 here because CODE could be USER_CONV, which
653 takes two arguments. In that case, the caller is responsible for
654 filling in the second argument. */
655 t
= make_node (code
);
656 TREE_TYPE (t
) = type
;
657 TREE_OPERAND (t
, 0) = from
;
670 if (rank
< EXACT_RANK
)
676 ICS_STD_RANK (t
) = rank
;
677 ICS_USER_FLAG (t
) = (code
== USER_CONV
|| ICS_USER_FLAG (from
));
678 ICS_BAD_FLAG (t
) = ICS_BAD_FLAG (from
);
682 /* If T is a REFERENCE_TYPE return the type to which T refers.
683 Otherwise, return T itself. */
686 non_reference (tree t
)
688 if (TREE_CODE (t
) == REFERENCE_TYPE
)
694 strip_top_quals (tree t
)
696 if (TREE_CODE (t
) == ARRAY_TYPE
)
698 return TYPE_MAIN_VARIANT (t
);
701 /* Returns the standard conversion path (see [conv]) from type FROM to type
702 TO, if any. For proper handling of null pointer constants, you must
703 also pass the expression EXPR to convert from. */
706 standard_conversion (tree to
, tree from
, tree expr
)
708 enum tree_code fcode
, tcode
;
710 bool fromref
= false;
712 if (TREE_CODE (to
) == REFERENCE_TYPE
)
714 if (TREE_CODE (from
) == REFERENCE_TYPE
)
717 from
= TREE_TYPE (from
);
719 to
= strip_top_quals (to
);
720 from
= strip_top_quals (from
);
722 if ((TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
723 && expr
&& type_unknown_p (expr
))
725 expr
= instantiate_type (to
, expr
, tf_none
);
726 if (expr
== error_mark_node
)
728 from
= TREE_TYPE (expr
);
731 fcode
= TREE_CODE (from
);
732 tcode
= TREE_CODE (to
);
734 conv
= build1 (IDENTITY_CONV
, from
, expr
);
736 if (fcode
== FUNCTION_TYPE
)
738 from
= build_pointer_type (from
);
739 fcode
= TREE_CODE (from
);
740 conv
= build_conv (LVALUE_CONV
, from
, conv
);
742 else if (fcode
== ARRAY_TYPE
)
744 from
= build_pointer_type (TREE_TYPE (from
));
745 fcode
= TREE_CODE (from
);
746 conv
= build_conv (LVALUE_CONV
, from
, conv
);
748 else if (fromref
|| (expr
&& lvalue_p (expr
)))
749 conv
= build_conv (RVALUE_CONV
, from
, conv
);
751 /* Allow conversion between `__complex__' data types */
752 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
754 /* The standard conversion sequence to convert FROM to TO is
755 the standard conversion sequence to perform componentwise
757 tree part_conv
= standard_conversion
758 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
);
762 conv
= build_conv (TREE_CODE (part_conv
), to
, conv
);
763 ICS_STD_RANK (conv
) = ICS_STD_RANK (part_conv
);
771 if (same_type_p (from
, to
))
774 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEMFUNC_P (to
))
775 && expr
&& null_ptr_cst_p (expr
))
777 conv
= build_conv (STD_CONV
, to
, conv
);
779 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
780 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
782 /* For backwards brain damage compatibility, allow interconversion of
783 pointers and integers with a pedwarn. */
784 conv
= build_conv (STD_CONV
, to
, conv
);
785 ICS_BAD_FLAG (conv
) = 1;
787 else if (tcode
== ENUMERAL_TYPE
&& fcode
== INTEGER_TYPE
788 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
790 /* For backwards brain damage compatibility, allow interconversion of
791 enums and integers with a pedwarn. */
792 conv
= build_conv (STD_CONV
, to
, conv
);
793 ICS_BAD_FLAG (conv
) = 1;
795 else if (tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
797 enum tree_code ufcode
= TREE_CODE (TREE_TYPE (from
));
798 enum tree_code utcode
= TREE_CODE (TREE_TYPE (to
));
800 if (same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from
),
803 else if (utcode
== VOID_TYPE
&& ufcode
!= OFFSET_TYPE
804 && ufcode
!= FUNCTION_TYPE
)
806 from
= build_pointer_type
807 (cp_build_qualified_type (void_type_node
,
808 cp_type_quals (TREE_TYPE (from
))));
809 conv
= build_conv (PTR_CONV
, from
, conv
);
811 else if (ufcode
== OFFSET_TYPE
&& utcode
== OFFSET_TYPE
)
813 tree fbase
= TYPE_OFFSET_BASETYPE (TREE_TYPE (from
));
814 tree tbase
= TYPE_OFFSET_BASETYPE (TREE_TYPE (to
));
816 if (DERIVED_FROM_P (fbase
, tbase
)
817 && (same_type_ignoring_top_level_qualifiers_p
818 (TREE_TYPE (TREE_TYPE (from
)),
819 TREE_TYPE (TREE_TYPE (to
)))))
821 from
= build_ptrmem_type (tbase
, TREE_TYPE (TREE_TYPE (from
)));
822 conv
= build_conv (PMEM_CONV
, from
, conv
);
825 else if (IS_AGGR_TYPE (TREE_TYPE (from
))
826 && IS_AGGR_TYPE (TREE_TYPE (to
)))
828 if (DERIVED_FROM_P (TREE_TYPE (to
), TREE_TYPE (from
)))
831 cp_build_qualified_type (TREE_TYPE (to
),
832 cp_type_quals (TREE_TYPE (from
)));
833 from
= build_pointer_type (from
);
834 conv
= build_conv (PTR_CONV
, from
, conv
);
838 if (same_type_p (from
, to
))
840 else if (comp_ptr_ttypes (TREE_TYPE (to
), TREE_TYPE (from
)))
841 conv
= build_conv (QUAL_CONV
, to
, conv
);
842 else if (expr
&& string_conv_p (to
, expr
, 0))
843 /* converting from string constant to char *. */
844 conv
= build_conv (QUAL_CONV
, to
, conv
);
845 else if (ptr_reasonably_similar (TREE_TYPE (to
), TREE_TYPE (from
)))
847 conv
= build_conv (PTR_CONV
, to
, conv
);
848 ICS_BAD_FLAG (conv
) = 1;
855 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
857 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
858 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
859 tree fbase
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fromfn
)));
860 tree tbase
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (tofn
)));
862 if (!DERIVED_FROM_P (fbase
, tbase
)
863 || !same_type_p (TREE_TYPE (fromfn
), TREE_TYPE (tofn
))
864 || !compparms (TREE_CHAIN (TYPE_ARG_TYPES (fromfn
)),
865 TREE_CHAIN (TYPE_ARG_TYPES (tofn
)))
866 || cp_type_quals (fbase
) != cp_type_quals (tbase
))
869 from
= cp_build_qualified_type (tbase
, cp_type_quals (fbase
));
870 from
= build_cplus_method_type (from
, TREE_TYPE (fromfn
),
871 TREE_CHAIN (TYPE_ARG_TYPES (fromfn
)));
872 from
= build_ptrmemfunc_type (build_pointer_type (from
));
873 conv
= build_conv (PMEM_CONV
, from
, conv
);
875 else if (tcode
== BOOLEAN_TYPE
)
877 if (! (INTEGRAL_CODE_P (fcode
) || fcode
== REAL_TYPE
878 || fcode
== POINTER_TYPE
|| TYPE_PTRMEMFUNC_P (from
)))
881 conv
= build_conv (STD_CONV
, to
, conv
);
882 if (fcode
== POINTER_TYPE
883 || (TYPE_PTRMEMFUNC_P (from
) && ICS_STD_RANK (conv
) < PBOOL_RANK
))
884 ICS_STD_RANK (conv
) = PBOOL_RANK
;
886 /* We don't check for ENUMERAL_TYPE here because there are no standard
887 conversions to enum type. */
888 else if (tcode
== INTEGER_TYPE
|| tcode
== BOOLEAN_TYPE
889 || tcode
== REAL_TYPE
)
891 if (! (INTEGRAL_CODE_P (fcode
) || fcode
== REAL_TYPE
))
893 conv
= build_conv (STD_CONV
, to
, conv
);
895 /* Give this a better rank if it's a promotion. */
896 if (to
== type_promotes_to (from
)
897 && ICS_STD_RANK (TREE_OPERAND (conv
, 0)) <= PROMO_RANK
)
898 ICS_STD_RANK (conv
) = PROMO_RANK
;
900 else if (IS_AGGR_TYPE (to
) && IS_AGGR_TYPE (from
)
901 && is_properly_derived_from (from
, to
))
903 if (TREE_CODE (conv
) == RVALUE_CONV
)
904 conv
= TREE_OPERAND (conv
, 0);
905 conv
= build_conv (BASE_CONV
, to
, conv
);
906 /* The derived-to-base conversion indicates the initialization
907 of a parameter with base type from an object of a derived
908 type. A temporary object is created to hold the result of
910 NEED_TEMPORARY_P (conv
) = 1;
918 /* Returns nonzero if T1 is reference-related to T2. */
921 reference_related_p (tree t1
, tree t2
)
923 t1
= TYPE_MAIN_VARIANT (t1
);
924 t2
= TYPE_MAIN_VARIANT (t2
);
928 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
929 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
931 return (same_type_p (t1
, t2
)
932 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
933 && DERIVED_FROM_P (t1
, t2
)));
936 /* Returns nonzero if T1 is reference-compatible with T2. */
939 reference_compatible_p (tree t1
, tree t2
)
943 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
944 reference-related to T2 and cv1 is the same cv-qualification as,
945 or greater cv-qualification than, cv2. */
946 return (reference_related_p (t1
, t2
)
947 && at_least_as_qualified_p (t1
, t2
));
950 /* Determine whether or not the EXPR (of class type S) can be
951 converted to T as in [over.match.ref]. */
954 convert_class_to_reference (tree t
, tree s
, tree expr
)
960 struct z_candidate
*candidates
;
961 struct z_candidate
*cand
;
964 conversions
= lookup_conversions (s
);
970 Assuming that "cv1 T" is the underlying type of the reference
971 being initialized, and "cv S" is the type of the initializer
972 expression, with S a class type, the candidate functions are
975 --The conversion functions of S and its base classes are
976 considered. Those that are not hidden within S and yield type
977 "reference to cv2 T2", where "cv1 T" is reference-compatible
978 (_dcl.init.ref_) with "cv2 T2", are candidate functions.
980 The argument list has one argument, which is the initializer
985 /* Conceptually, we should take the address of EXPR and put it in
986 the argument list. Unfortunately, however, that can result in
987 error messages, which we should not issue now because we are just
988 trying to find a conversion operator. Therefore, we use NULL,
989 cast to the appropriate type. */
990 arglist
= build_int_2 (0, 0);
991 TREE_TYPE (arglist
) = build_pointer_type (s
);
992 arglist
= build_tree_list (NULL_TREE
, arglist
);
994 reference_type
= build_reference_type (t
);
998 tree fns
= TREE_VALUE (conversions
);
1000 for (; fns
; fns
= OVL_NEXT (fns
))
1002 tree f
= OVL_CURRENT (fns
);
1003 tree t2
= TREE_TYPE (TREE_TYPE (f
));
1007 /* If this is a template function, try to get an exact
1009 if (TREE_CODE (f
) == TEMPLATE_DECL
)
1011 cand
= add_template_candidate (&candidates
,
1017 TREE_PURPOSE (conversions
),
1023 /* Now, see if the conversion function really returns
1024 an lvalue of the appropriate type. From the
1025 point of view of unification, simply returning an
1026 rvalue of the right type is good enough. */
1028 t2
= TREE_TYPE (TREE_TYPE (f
));
1029 if (TREE_CODE (t2
) != REFERENCE_TYPE
1030 || !reference_compatible_p (t
, TREE_TYPE (t2
)))
1032 candidates
= candidates
->next
;
1037 else if (TREE_CODE (t2
) == REFERENCE_TYPE
1038 && reference_compatible_p (t
, TREE_TYPE (t2
)))
1039 cand
= add_function_candidate (&candidates
, f
, s
, arglist
,
1041 TREE_PURPOSE (conversions
),
1045 /* Build a standard conversion sequence indicating the
1046 binding from the reference type returned by the
1047 function to the desired REFERENCE_TYPE. */
1049 = (direct_reference_binding
1051 build1 (IDENTITY_CONV
,
1052 TREE_TYPE (TREE_TYPE (TREE_TYPE (cand
->fn
))),
1055 conversions
= TREE_CHAIN (conversions
);
1058 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
1059 /* If none of the conversion functions worked out, let our caller
1064 cand
= tourney (candidates
);
1068 /* Now that we know that this is the function we're going to use fix
1069 the dummy first argument. */
1070 cand
->args
= tree_cons (NULL_TREE
,
1072 TREE_CHAIN (cand
->args
));
1074 /* Build a user-defined conversion sequence representing the
1076 conv
= build_conv (USER_CONV
,
1077 TREE_TYPE (TREE_TYPE (cand
->fn
)),
1078 build1 (IDENTITY_CONV
, TREE_TYPE (expr
), expr
));
1079 TREE_OPERAND (conv
, 1) = build_zc_wrapper (cand
);
1081 /* Merge it with the standard conversion sequence from the
1082 conversion function's return type to the desired type. */
1083 cand
->second_conv
= merge_conversion_sequences (conv
, cand
->second_conv
);
1085 if (cand
->viable
== -1)
1086 ICS_BAD_FLAG (conv
) = 1;
1088 return cand
->second_conv
;
1091 /* A reference of the indicated TYPE is being bound directly to the
1092 expression represented by the implicit conversion sequence CONV.
1093 Return a conversion sequence for this binding. */
1096 direct_reference_binding (tree type
, tree conv
)
1100 my_friendly_assert (TREE_CODE (type
) == REFERENCE_TYPE
, 20030306);
1101 my_friendly_assert (TREE_CODE (TREE_TYPE (conv
)) != REFERENCE_TYPE
,
1104 t
= TREE_TYPE (type
);
1108 When a parameter of reference type binds directly
1109 (_dcl.init.ref_) to an argument expression, the implicit
1110 conversion sequence is the identity conversion, unless the
1111 argument expression has a type that is a derived class of the
1112 parameter type, in which case the implicit conversion sequence is
1113 a derived-to-base Conversion.
1115 If the parameter binds directly to the result of applying a
1116 conversion function to the argument expression, the implicit
1117 conversion sequence is a user-defined conversion sequence
1118 (_over.ics.user_), with the second standard conversion sequence
1119 either an identity conversion or, if the conversion function
1120 returns an entity of a type that is a derived class of the
1121 parameter type, a derived-to-base conversion. */
1122 if (!same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (conv
)))
1124 /* Represent the derived-to-base conversion. */
1125 conv
= build_conv (BASE_CONV
, t
, conv
);
1126 /* We will actually be binding to the base-class subobject in
1127 the derived class, so we mark this conversion appropriately.
1128 That way, convert_like knows not to generate a temporary. */
1129 NEED_TEMPORARY_P (conv
) = 0;
1131 return build_conv (REF_BIND
, type
, conv
);
1134 /* Returns the conversion path from type FROM to reference type TO for
1135 purposes of reference binding. For lvalue binding, either pass a
1136 reference type to FROM or an lvalue expression to EXPR. If the
1137 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1138 the conversion returned. */
1141 reference_binding (tree rto
, tree rfrom
, tree expr
, int flags
)
1143 tree conv
= NULL_TREE
;
1144 tree to
= TREE_TYPE (rto
);
1148 cp_lvalue_kind lvalue_p
= clk_none
;
1150 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1152 expr
= instantiate_type (to
, expr
, tf_none
);
1153 if (expr
== error_mark_node
)
1155 from
= TREE_TYPE (expr
);
1158 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1160 /* Anything with reference type is an lvalue. */
1161 lvalue_p
= clk_ordinary
;
1162 from
= TREE_TYPE (from
);
1165 lvalue_p
= real_lvalue_p (expr
);
1167 /* Figure out whether or not the types are reference-related and
1168 reference compatible. We have do do this after stripping
1169 references from FROM. */
1170 related_p
= reference_related_p (to
, from
);
1171 compatible_p
= reference_compatible_p (to
, from
);
1173 if (lvalue_p
&& compatible_p
)
1177 If the initializer expression
1179 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1180 is reference-compatible with "cv2 T2,"
1182 the reference is bound directly to the initializer exprssion
1184 conv
= build1 (IDENTITY_CONV
, from
, expr
);
1185 conv
= direct_reference_binding (rto
, conv
);
1186 if ((lvalue_p
& clk_bitfield
) != 0
1187 && CP_TYPE_CONST_NON_VOLATILE_P (to
))
1188 /* For the purposes of overload resolution, we ignore the fact
1189 this expression is a bitfield. (In particular,
1190 [over.ics.ref] says specifically that a function with a
1191 non-const reference parameter is viable even if the
1192 argument is a bitfield.)
1194 However, when we actually call the function we must create
1195 a temporary to which to bind the reference. If the
1196 reference is volatile, or isn't const, then we cannot make
1197 a temporary, so we just issue an error when the conversion
1199 NEED_TEMPORARY_P (conv
) = 1;
1202 else if (CLASS_TYPE_P (from
) && !(flags
& LOOKUP_NO_CONVERSION
))
1206 If the initializer exprsesion
1208 -- has a class type (i.e., T2 is a class type) can be
1209 implicitly converted to an lvalue of type "cv3 T3," where
1210 "cv1 T1" is reference-compatible with "cv3 T3". (this
1211 conversion is selected by enumerating the applicable
1212 conversion functions (_over.match.ref_) and choosing the
1213 best one through overload resolution. (_over.match_).
1215 the reference is bound to the lvalue result of the conversion
1216 in the second case. */
1217 conv
= convert_class_to_reference (to
, from
, expr
);
1222 /* From this point on, we conceptually need temporaries, even if we
1223 elide them. Only the cases above are "direct bindings". */
1224 if (flags
& LOOKUP_NO_TEMP_BIND
)
1229 When a parameter of reference type is not bound directly to an
1230 argument expression, the conversion sequence is the one required
1231 to convert the argument expression to the underlying type of the
1232 reference according to _over.best.ics_. Conceptually, this
1233 conversion sequence corresponds to copy-initializing a temporary
1234 of the underlying type with the argument expression. Any
1235 difference in top-level cv-qualification is subsumed by the
1236 initialization itself and does not constitute a conversion. */
1240 Otherwise, the reference shall be to a non-volatile const type. */
1241 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
))
1246 If the initializer expression is an rvalue, with T2 a class type,
1247 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1248 is bound in one of the following ways:
1250 -- The reference is bound to the object represented by the rvalue
1251 or to a sub-object within that object.
1255 We use the first alternative. The implicit conversion sequence
1256 is supposed to be same as we would obtain by generating a
1257 temporary. Fortunately, if the types are reference compatible,
1258 then this is either an identity conversion or the derived-to-base
1259 conversion, just as for direct binding. */
1260 if (CLASS_TYPE_P (from
) && compatible_p
)
1262 conv
= build1 (IDENTITY_CONV
, from
, expr
);
1263 return direct_reference_binding (rto
, conv
);
1268 Otherwise, a temporary of type "cv1 T1" is created and
1269 initialized from the initializer expression using the rules for a
1270 non-reference copy initialization. If T1 is reference-related to
1271 T2, cv1 must be the same cv-qualification as, or greater
1272 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1273 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1276 conv
= implicit_conversion (to
, from
, expr
, flags
);
1280 conv
= build_conv (REF_BIND
, rto
, conv
);
1281 /* This reference binding, unlike those above, requires the
1282 creation of a temporary. */
1283 NEED_TEMPORARY_P (conv
) = 1;
1288 /* Returns the implicit conversion sequence (see [over.ics]) from type FROM
1289 to type TO. The optional expression EXPR may affect the conversion.
1290 FLAGS are the usual overloading flags. Only LOOKUP_NO_CONVERSION is
1294 implicit_conversion (tree to
, tree from
, tree expr
, int flags
)
1298 /* Resolve expressions like `A::p' that we thought might become
1299 pointers-to-members. */
1300 if (expr
&& TREE_CODE (expr
) == OFFSET_REF
)
1302 expr
= resolve_offset_ref (expr
);
1303 from
= TREE_TYPE (expr
);
1306 if (from
== error_mark_node
|| to
== error_mark_node
1307 || expr
== error_mark_node
)
1310 if (TREE_CODE (to
) == REFERENCE_TYPE
)
1311 conv
= reference_binding (to
, from
, expr
, flags
);
1313 conv
= standard_conversion (to
, from
, expr
);
1318 if (expr
!= NULL_TREE
1319 && (IS_AGGR_TYPE (from
)
1320 || IS_AGGR_TYPE (to
))
1321 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1323 struct z_candidate
*cand
;
1325 cand
= build_user_type_conversion_1
1326 (to
, expr
, LOOKUP_ONLYCONVERTING
);
1328 conv
= cand
->second_conv
;
1330 /* We used to try to bind a reference to a temporary here, but that
1331 is now handled by the recursive call to this function at the end
1332 of reference_binding. */
1339 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1342 static struct z_candidate
*
1343 add_candidate (struct z_candidate
**candidates
,
1344 tree fn
, tree args
, tree convs
, tree access_path
,
1345 tree conversion_path
, int viable
)
1347 struct z_candidate
*cand
1348 = (struct z_candidate
*) ggc_alloc_cleared (sizeof (struct z_candidate
));
1352 cand
->convs
= convs
;
1353 cand
->access_path
= access_path
;
1354 cand
->conversion_path
= conversion_path
;
1355 cand
->viable
= viable
;
1356 cand
->next
= *candidates
;
1362 /* Create an overload candidate for the function or method FN called with
1363 the argument list ARGLIST and add it to CANDIDATES. FLAGS is passed on
1364 to implicit_conversion.
1366 CTYPE, if non-NULL, is the type we want to pretend this function
1367 comes from for purposes of overload resolution. */
1369 static struct z_candidate
*
1370 add_function_candidate (struct z_candidate
**candidates
,
1371 tree fn
, tree ctype
, tree arglist
,
1372 tree access_path
, tree conversion_path
,
1375 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1378 tree parmnode
, argnode
;
1382 /* Built-in functions that haven't been declared don't really
1384 if (DECL_ANTICIPATED (fn
))
1387 /* The `this', `in_chrg' and VTT arguments to constructors are not
1388 considered in overload resolution. */
1389 if (DECL_CONSTRUCTOR_P (fn
))
1391 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
1392 orig_arglist
= arglist
;
1393 arglist
= skip_artificial_parms_for (fn
, arglist
);
1396 orig_arglist
= arglist
;
1398 len
= list_length (arglist
);
1399 convs
= make_tree_vec (len
);
1401 /* 13.3.2 - Viable functions [over.match.viable]
1402 First, to be a viable function, a candidate function shall have enough
1403 parameters to agree in number with the arguments in the list.
1405 We need to check this first; otherwise, checking the ICSes might cause
1406 us to produce an ill-formed template instantiation. */
1408 parmnode
= parmlist
;
1409 for (i
= 0; i
< len
; ++i
)
1411 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
1413 parmnode
= TREE_CHAIN (parmnode
);
1416 if (i
< len
&& parmnode
)
1419 /* Make sure there are default args for the rest of the parms. */
1420 else if (!sufficient_parms_p (parmnode
))
1426 /* Second, for F to be a viable function, there shall exist for each
1427 argument an implicit conversion sequence that converts that argument
1428 to the corresponding parameter of F. */
1430 parmnode
= parmlist
;
1433 for (i
= 0; i
< len
; ++i
)
1435 tree arg
= TREE_VALUE (argnode
);
1436 tree argtype
= lvalue_type (arg
);
1440 if (parmnode
== void_list_node
)
1443 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1444 && ! DECL_CONSTRUCTOR_P (fn
));
1448 tree parmtype
= TREE_VALUE (parmnode
);
1450 /* The type of the implicit object parameter ('this') for
1451 overload resolution is not always the same as for the
1452 function itself; conversion functions are considered to
1453 be members of the class being converted, and functions
1454 introduced by a using-declaration are considered to be
1455 members of the class that uses them.
1457 Since build_over_call ignores the ICS for the `this'
1458 parameter, we can just change the parm type. */
1459 if (ctype
&& is_this
)
1462 = build_qualified_type (ctype
,
1463 TYPE_QUALS (TREE_TYPE (parmtype
)));
1464 parmtype
= build_pointer_type (parmtype
);
1467 t
= implicit_conversion (parmtype
, argtype
, arg
, flags
);
1471 t
= build1 (IDENTITY_CONV
, argtype
, arg
);
1472 ICS_ELLIPSIS_FLAG (t
) = 1;
1476 ICS_THIS_FLAG (t
) = 1;
1478 TREE_VEC_ELT (convs
, i
) = t
;
1485 if (ICS_BAD_FLAG (t
))
1489 parmnode
= TREE_CHAIN (parmnode
);
1490 argnode
= TREE_CHAIN (argnode
);
1494 return add_candidate (candidates
, fn
, orig_arglist
, convs
, access_path
,
1495 conversion_path
, viable
);
1498 /* Create an overload candidate for the conversion function FN which will
1499 be invoked for expression OBJ, producing a pointer-to-function which
1500 will in turn be called with the argument list ARGLIST, and add it to
1501 CANDIDATES. FLAGS is passed on to implicit_conversion.
1503 Actually, we don't really care about FN; we care about the type it
1504 converts to. There may be multiple conversion functions that will
1505 convert to that type, and we rely on build_user_type_conversion_1 to
1506 choose the best one; so when we create our candidate, we record the type
1507 instead of the function. */
1509 static struct z_candidate
*
1510 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
1511 tree arglist
, tree access_path
, tree conversion_path
)
1513 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
1514 int i
, len
, viable
, flags
;
1515 tree parmlist
, convs
, parmnode
, argnode
;
1517 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
1518 parmlist
= TREE_TYPE (parmlist
);
1519 parmlist
= TYPE_ARG_TYPES (parmlist
);
1521 len
= list_length (arglist
) + 1;
1522 convs
= make_tree_vec (len
);
1523 parmnode
= parmlist
;
1526 flags
= LOOKUP_NORMAL
;
1528 /* Don't bother looking up the same type twice. */
1529 if (*candidates
&& (*candidates
)->fn
== totype
)
1532 for (i
= 0; i
< len
; ++i
)
1534 tree arg
= i
== 0 ? obj
: TREE_VALUE (argnode
);
1535 tree argtype
= lvalue_type (arg
);
1539 t
= implicit_conversion (totype
, argtype
, arg
, flags
);
1540 else if (parmnode
== void_list_node
)
1543 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
, flags
);
1546 t
= build1 (IDENTITY_CONV
, argtype
, arg
);
1547 ICS_ELLIPSIS_FLAG (t
) = 1;
1550 TREE_VEC_ELT (convs
, i
) = t
;
1554 if (ICS_BAD_FLAG (t
))
1561 parmnode
= TREE_CHAIN (parmnode
);
1562 argnode
= TREE_CHAIN (argnode
);
1568 if (!sufficient_parms_p (parmnode
))
1571 return add_candidate (candidates
, totype
, arglist
, convs
, access_path
,
1572 conversion_path
, viable
);
1576 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
1577 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
1587 convs
= make_tree_vec (args
[2] ? 3 : (args
[1] ? 2 : 1));
1589 for (i
= 0; i
< 2; ++i
)
1594 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
], flags
);
1598 /* We need something for printing the candidate. */
1599 t
= build1 (IDENTITY_CONV
, types
[i
], NULL_TREE
);
1601 else if (ICS_BAD_FLAG (t
))
1603 TREE_VEC_ELT (convs
, i
) = t
;
1606 /* For COND_EXPR we rearranged the arguments; undo that now. */
1609 TREE_VEC_ELT (convs
, 2) = TREE_VEC_ELT (convs
, 1);
1610 TREE_VEC_ELT (convs
, 1) = TREE_VEC_ELT (convs
, 0);
1611 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2], flags
);
1613 TREE_VEC_ELT (convs
, 0) = t
;
1618 add_candidate (candidates
, fnname
, /*args=*/NULL_TREE
, convs
,
1619 /*access_path=*/NULL_TREE
,
1620 /*conversion_path=*/NULL_TREE
,
1625 is_complete (tree t
)
1627 return COMPLETE_TYPE_P (complete_type (t
));
1630 /* Returns nonzero if TYPE is a promoted arithmetic type. */
1633 promoted_arithmetic_type_p (tree type
)
1637 In this section, the term promoted integral type is used to refer
1638 to those integral types which are preserved by integral promotion
1639 (including e.g. int and long but excluding e.g. char).
1640 Similarly, the term promoted arithmetic type refers to promoted
1641 integral types plus floating types. */
1642 return ((INTEGRAL_TYPE_P (type
)
1643 && same_type_p (type_promotes_to (type
), type
))
1644 || TREE_CODE (type
) == REAL_TYPE
);
1647 /* Create any builtin operator overload candidates for the operator in
1648 question given the converted operand types TYPE1 and TYPE2. The other
1649 args are passed through from add_builtin_candidates to
1650 build_builtin_candidate.
1652 TYPE1 and TYPE2 may not be permissible, and we must filter them.
1653 If CODE is requires candidates operands of the same type of the kind
1654 of which TYPE1 and TYPE2 are, we add both candidates
1655 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
1658 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
1659 enum tree_code code2
, tree fnname
, tree type1
,
1660 tree type2
, tree
*args
, tree
*argtypes
, int flags
)
1664 case POSTINCREMENT_EXPR
:
1665 case POSTDECREMENT_EXPR
:
1666 args
[1] = integer_zero_node
;
1667 type2
= integer_type_node
;
1676 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
1677 and VQ is either volatile or empty, there exist candidate operator
1678 functions of the form
1679 VQ T& operator++(VQ T&);
1680 T operator++(VQ T&, int);
1681 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
1682 type other than bool, and VQ is either volatile or empty, there exist
1683 candidate operator functions of the form
1684 VQ T& operator--(VQ T&);
1685 T operator--(VQ T&, int);
1686 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
1687 complete object type, and VQ is either volatile or empty, there exist
1688 candidate operator functions of the form
1689 T*VQ& operator++(T*VQ&);
1690 T*VQ& operator--(T*VQ&);
1691 T* operator++(T*VQ&, int);
1692 T* operator--(T*VQ&, int); */
1694 case POSTDECREMENT_EXPR
:
1695 case PREDECREMENT_EXPR
:
1696 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
1698 case POSTINCREMENT_EXPR
:
1699 case PREINCREMENT_EXPR
:
1700 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
1702 type1
= build_reference_type (type1
);
1707 /* 7 For every cv-qualified or cv-unqualified complete object type T, there
1708 exist candidate operator functions of the form
1712 8 For every function type T, there exist candidate operator functions of
1714 T& operator*(T*); */
1717 if (TREE_CODE (type1
) == POINTER_TYPE
1718 && (TYPE_PTROB_P (type1
)
1719 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
1723 /* 9 For every type T, there exist candidate operator functions of the form
1726 10For every promoted arithmetic type T, there exist candidate operator
1727 functions of the form
1731 case CONVERT_EXPR
: /* unary + */
1732 if (TREE_CODE (type1
) == POINTER_TYPE
1733 && TREE_CODE (TREE_TYPE (type1
)) != OFFSET_TYPE
)
1736 if (ARITHMETIC_TYPE_P (type1
))
1740 /* 11For every promoted integral type T, there exist candidate operator
1741 functions of the form
1745 if (INTEGRAL_TYPE_P (type1
))
1749 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
1750 is the same type as C2 or is a derived class of C2, T is a complete
1751 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
1752 there exist candidate operator functions of the form
1753 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
1754 where CV12 is the union of CV1 and CV2. */
1757 if (TREE_CODE (type1
) == POINTER_TYPE
1758 && (TYPE_PTRMEMFUNC_P (type2
) || TYPE_PTRMEM_P (type2
)))
1760 tree c1
= TREE_TYPE (type1
);
1761 tree c2
= (TYPE_PTRMEMFUNC_P (type2
)
1762 ? TYPE_METHOD_BASETYPE (TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (type2
)))
1763 : TYPE_OFFSET_BASETYPE (TREE_TYPE (type2
)));
1765 if (IS_AGGR_TYPE (c1
) && DERIVED_FROM_P (c2
, c1
)
1766 && (TYPE_PTRMEMFUNC_P (type2
)
1767 || is_complete (TREE_TYPE (TREE_TYPE (type2
)))))
1772 /* 13For every pair of promoted arithmetic types L and R, there exist can-
1773 didate operator functions of the form
1778 bool operator<(L, R);
1779 bool operator>(L, R);
1780 bool operator<=(L, R);
1781 bool operator>=(L, R);
1782 bool operator==(L, R);
1783 bool operator!=(L, R);
1784 where LR is the result of the usual arithmetic conversions between
1787 14For every pair of types T and I, where T is a cv-qualified or cv-
1788 unqualified complete object type and I is a promoted integral type,
1789 there exist candidate operator functions of the form
1790 T* operator+(T*, I);
1791 T& operator[](T*, I);
1792 T* operator-(T*, I);
1793 T* operator+(I, T*);
1794 T& operator[](I, T*);
1796 15For every T, where T is a pointer to complete object type, there exist
1797 candidate operator functions of the form112)
1798 ptrdiff_t operator-(T, T);
1800 16For every pointer or enumeration type T, there exist candidate operator
1801 functions of the form
1802 bool operator<(T, T);
1803 bool operator>(T, T);
1804 bool operator<=(T, T);
1805 bool operator>=(T, T);
1806 bool operator==(T, T);
1807 bool operator!=(T, T);
1809 17For every pointer to member type T, there exist candidate operator
1810 functions of the form
1811 bool operator==(T, T);
1812 bool operator!=(T, T); */
1815 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
1817 if (TYPE_PTROB_P (type1
) && INTEGRAL_TYPE_P (type2
))
1819 type2
= ptrdiff_type_node
;
1823 case TRUNC_DIV_EXPR
:
1824 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
1830 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
1831 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
)))
1833 if ((TYPE_PTRMEMFUNC_P (type1
) || TYPE_PTRMEM_P (type1
))
1834 && null_ptr_cst_p (args
[1]))
1839 if ((TYPE_PTRMEMFUNC_P (type2
) || TYPE_PTRMEM_P (type2
))
1840 && null_ptr_cst_p (args
[0]))
1852 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
1854 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
1856 if (TREE_CODE (type1
) == ENUMERAL_TYPE
&& TREE_CODE (type2
) == ENUMERAL_TYPE
)
1858 if (TYPE_PTR_P (type1
) && null_ptr_cst_p (args
[1]))
1863 if (null_ptr_cst_p (args
[0]) && TYPE_PTR_P (type2
))
1871 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
1874 if (INTEGRAL_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
1876 type1
= ptrdiff_type_node
;
1879 if (TYPE_PTROB_P (type1
) && INTEGRAL_TYPE_P (type2
))
1881 type2
= ptrdiff_type_node
;
1886 /* 18For every pair of promoted integral types L and R, there exist candi-
1887 date operator functions of the form
1894 where LR is the result of the usual arithmetic conversions between
1897 case TRUNC_MOD_EXPR
:
1903 if (INTEGRAL_TYPE_P (type1
) && INTEGRAL_TYPE_P (type2
))
1907 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
1908 type, VQ is either volatile or empty, and R is a promoted arithmetic
1909 type, there exist candidate operator functions of the form
1910 VQ L& operator=(VQ L&, R);
1911 VQ L& operator*=(VQ L&, R);
1912 VQ L& operator/=(VQ L&, R);
1913 VQ L& operator+=(VQ L&, R);
1914 VQ L& operator-=(VQ L&, R);
1916 20For every pair T, VQ), where T is any type and VQ is either volatile
1917 or empty, there exist candidate operator functions of the form
1918 T*VQ& operator=(T*VQ&, T*);
1920 21For every pair T, VQ), where T is a pointer to member type and VQ is
1921 either volatile or empty, there exist candidate operator functions of
1923 VQ T& operator=(VQ T&, T);
1925 22For every triple T, VQ, I), where T is a cv-qualified or cv-
1926 unqualified complete object type, VQ is either volatile or empty, and
1927 I is a promoted integral type, there exist candidate operator func-
1929 T*VQ& operator+=(T*VQ&, I);
1930 T*VQ& operator-=(T*VQ&, I);
1932 23For every triple L, VQ, R), where L is an integral or enumeration
1933 type, VQ is either volatile or empty, and R is a promoted integral
1934 type, there exist candidate operator functions of the form
1936 VQ L& operator%=(VQ L&, R);
1937 VQ L& operator<<=(VQ L&, R);
1938 VQ L& operator>>=(VQ L&, R);
1939 VQ L& operator&=(VQ L&, R);
1940 VQ L& operator^=(VQ L&, R);
1941 VQ L& operator|=(VQ L&, R); */
1948 if (TYPE_PTROB_P (type1
) && INTEGRAL_TYPE_P (type2
))
1950 type2
= ptrdiff_type_node
;
1954 case TRUNC_DIV_EXPR
:
1955 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
1959 case TRUNC_MOD_EXPR
:
1965 if (INTEGRAL_TYPE_P (type1
) && INTEGRAL_TYPE_P (type2
))
1970 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
1972 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
1973 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
1974 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
))
1975 || ((TYPE_PTRMEMFUNC_P (type1
)
1976 || TREE_CODE (type1
) == POINTER_TYPE
)
1977 && null_ptr_cst_p (args
[1])))
1987 type1
= build_reference_type (type1
);
1993 For every pair of promoted arithmetic types L and R, there
1994 exist candidate operator functions of the form
1996 LR operator?(bool, L, R);
1998 where LR is the result of the usual arithmetic conversions
1999 between types L and R.
2001 For every type T, where T is a pointer or pointer-to-member
2002 type, there exist candidate operator functions of the form T
2003 operator?(bool, T, T); */
2005 if (promoted_arithmetic_type_p (type1
)
2006 && promoted_arithmetic_type_p (type2
))
2010 /* Otherwise, the types should be pointers. */
2011 if (!(TREE_CODE (type1
) == POINTER_TYPE
2012 || TYPE_PTRMEM_P (type1
)
2013 || TYPE_PTRMEMFUNC_P (type1
))
2014 || !(TREE_CODE (type2
) == POINTER_TYPE
2015 || TYPE_PTRMEM_P (type2
)
2016 || TYPE_PTRMEMFUNC_P (type2
)))
2019 /* We don't check that the two types are the same; the logic
2020 below will actually create two candidates; one in which both
2021 parameter types are TYPE1, and one in which both parameter
2029 /* If we're dealing with two pointer types or two enumeral types,
2030 we need candidates for both of them. */
2031 if (type2
&& !same_type_p (type1
, type2
)
2032 && TREE_CODE (type1
) == TREE_CODE (type2
)
2033 && (TREE_CODE (type1
) == REFERENCE_TYPE
2034 || (TREE_CODE (type1
) == POINTER_TYPE
2035 && TYPE_PTRMEM_P (type1
) == TYPE_PTRMEM_P (type2
))
2036 || TYPE_PTRMEMFUNC_P (type1
)
2037 || IS_AGGR_TYPE (type1
)
2038 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2040 build_builtin_candidate
2041 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
);
2042 build_builtin_candidate
2043 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
);
2047 build_builtin_candidate
2048 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
);
2052 type_decays_to (tree type
)
2054 if (TREE_CODE (type
) == ARRAY_TYPE
)
2055 return build_pointer_type (TREE_TYPE (type
));
2056 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2057 return build_pointer_type (type
);
2061 /* There are three conditions of builtin candidates:
2063 1) bool-taking candidates. These are the same regardless of the input.
2064 2) pointer-pair taking candidates. These are generated for each type
2065 one of the input types converts to.
2066 3) arithmetic candidates. According to the standard, we should generate
2067 all of these, but I'm trying not to...
2069 Here we generate a superset of the possible candidates for this particular
2070 case. That is a subset of the full set the standard defines, plus some
2071 other cases which the standard disallows. add_builtin_candidate will
2072 filter out the invalid set. */
2075 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2076 enum tree_code code2
, tree fnname
, tree
*args
,
2081 tree type
, argtypes
[3];
2082 /* TYPES[i] is the set of possible builtin-operator parameter types
2083 we will consider for the Ith argument. These are represented as
2084 a TREE_LIST; the TREE_VALUE of each node is the potential
2088 for (i
= 0; i
< 3; ++i
)
2091 argtypes
[i
] = lvalue_type (args
[i
]);
2093 argtypes
[i
] = NULL_TREE
;
2098 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2099 and VQ is either volatile or empty, there exist candidate operator
2100 functions of the form
2101 VQ T& operator++(VQ T&); */
2103 case POSTINCREMENT_EXPR
:
2104 case PREINCREMENT_EXPR
:
2105 case POSTDECREMENT_EXPR
:
2106 case PREDECREMENT_EXPR
:
2111 /* 24There also exist candidate operator functions of the form
2112 bool operator!(bool);
2113 bool operator&&(bool, bool);
2114 bool operator||(bool, bool); */
2116 case TRUTH_NOT_EXPR
:
2117 build_builtin_candidate
2118 (candidates
, fnname
, boolean_type_node
,
2119 NULL_TREE
, args
, argtypes
, flags
);
2122 case TRUTH_ORIF_EXPR
:
2123 case TRUTH_ANDIF_EXPR
:
2124 build_builtin_candidate
2125 (candidates
, fnname
, boolean_type_node
,
2126 boolean_type_node
, args
, argtypes
, flags
);
2148 types
[0] = types
[1] = NULL_TREE
;
2150 for (i
= 0; i
< 2; ++i
)
2154 else if (IS_AGGR_TYPE (argtypes
[i
]))
2158 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
2161 convs
= lookup_conversions (argtypes
[i
]);
2163 if (code
== COND_EXPR
)
2165 if (real_lvalue_p (args
[i
]))
2166 types
[i
] = tree_cons
2167 (NULL_TREE
, build_reference_type (argtypes
[i
]), types
[i
]);
2169 types
[i
] = tree_cons
2170 (NULL_TREE
, TYPE_MAIN_VARIANT (argtypes
[i
]), types
[i
]);
2176 for (; convs
; convs
= TREE_CHAIN (convs
))
2178 type
= TREE_TYPE (TREE_TYPE (OVL_CURRENT (TREE_VALUE (convs
))));
2181 && (TREE_CODE (type
) != REFERENCE_TYPE
2182 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
2185 if (code
== COND_EXPR
&& TREE_CODE (type
) == REFERENCE_TYPE
)
2186 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2188 type
= non_reference (type
);
2189 if (i
!= 0 || ! ref1
)
2191 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
2192 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
2193 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2194 if (INTEGRAL_TYPE_P (type
))
2195 type
= type_promotes_to (type
);
2198 if (! value_member (type
, types
[i
]))
2199 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2204 if (code
== COND_EXPR
&& real_lvalue_p (args
[i
]))
2205 types
[i
] = tree_cons
2206 (NULL_TREE
, build_reference_type (argtypes
[i
]), types
[i
]);
2207 type
= non_reference (argtypes
[i
]);
2208 if (i
!= 0 || ! ref1
)
2210 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
2211 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
2212 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2213 if (INTEGRAL_TYPE_P (type
))
2214 type
= type_promotes_to (type
);
2216 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2220 /* Run through the possible parameter types of both arguments,
2221 creating candidates with those parameter types. */
2222 for (; types
[0]; types
[0] = TREE_CHAIN (types
[0]))
2225 for (type
= types
[1]; type
; type
= TREE_CHAIN (type
))
2226 add_builtin_candidate
2227 (candidates
, code
, code2
, fnname
, TREE_VALUE (types
[0]),
2228 TREE_VALUE (type
), args
, argtypes
, flags
);
2230 add_builtin_candidate
2231 (candidates
, code
, code2
, fnname
, TREE_VALUE (types
[0]),
2232 NULL_TREE
, args
, argtypes
, flags
);
2239 /* If TMPL can be successfully instantiated as indicated by
2240 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2242 TMPL is the template. EXPLICIT_TARGS are any explicit template
2243 arguments. ARGLIST is the arguments provided at the call-site.
2244 The RETURN_TYPE is the desired type for conversion operators. If
2245 OBJ is NULL_TREE, FLAGS and CTYPE are as for add_function_candidate.
2246 If an OBJ is supplied, FLAGS and CTYPE are ignored, and OBJ is as for
2247 add_conv_candidate. */
2249 static struct z_candidate
*
2250 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
2251 tree ctype
, tree explicit_targs
, tree arglist
,
2252 tree return_type
, tree access_path
,
2253 tree conversion_path
, int flags
, tree obj
,
2254 unification_kind_t strict
)
2256 int ntparms
= DECL_NTPARMS (tmpl
);
2257 tree targs
= make_tree_vec (ntparms
);
2258 tree args_without_in_chrg
= arglist
;
2259 struct z_candidate
*cand
;
2263 /* We don't do deduction on the in-charge parameter, the VTT
2264 parameter or 'this'. */
2265 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
2266 args_without_in_chrg
= TREE_CHAIN (args_without_in_chrg
);
2268 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
2269 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
2270 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (tmpl
)))
2271 args_without_in_chrg
= TREE_CHAIN (args_without_in_chrg
);
2273 i
= fn_type_unification (tmpl
, explicit_targs
, targs
,
2274 args_without_in_chrg
,
2275 return_type
, strict
, -1);
2280 fn
= instantiate_template (tmpl
, targs
, tf_none
);
2281 if (fn
== error_mark_node
)
2286 A member function template is never instantiated to perform the
2287 copy of a class object to an object of its class type.
2289 It's a little unclear what this means; the standard explicitly
2290 does allow a template to be used to copy a class. For example,
2295 template <class T> A(const T&);
2298 void g () { A a (f ()); }
2300 the member template will be used to make the copy. The section
2301 quoted above appears in the paragraph that forbids constructors
2302 whose only parameter is (a possibly cv-qualified variant of) the
2303 class type, and a logical interpretation is that the intent was
2304 to forbid the instantiation of member templates which would then
2306 if (DECL_CONSTRUCTOR_P (fn
) && list_length (arglist
) == 2)
2308 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
2309 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
2314 if (obj
!= NULL_TREE
)
2315 /* Aha, this is a conversion function. */
2316 cand
= add_conv_candidate (candidates
, fn
, obj
, access_path
,
2317 conversion_path
, arglist
);
2319 cand
= add_function_candidate (candidates
, fn
, ctype
,
2320 arglist
, access_path
,
2321 conversion_path
, flags
);
2322 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
2323 /* This situation can occur if a member template of a template
2324 class is specialized. Then, instantiate_template might return
2325 an instantiation of the specialization, in which case the
2326 DECL_TI_TEMPLATE field will point at the original
2327 specialization. For example:
2329 template <class T> struct S { template <class U> void f(U);
2330 template <> void f(int) {}; };
2334 Here, TMPL will be template <class U> S<double>::f(U).
2335 And, instantiate template will give us the specialization
2336 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
2337 for this will point at template <class T> template <> S<T>::f(int),
2338 so that we can find the definition. For the purposes of
2339 overload resolution, however, we want the original TMPL. */
2340 cand
->template = tree_cons (tmpl
, targs
, NULL_TREE
);
2342 cand
->template = DECL_TEMPLATE_INFO (fn
);
2348 static struct z_candidate
*
2349 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
2350 tree explicit_targs
, tree arglist
, tree return_type
,
2351 tree access_path
, tree conversion_path
, int flags
,
2352 unification_kind_t strict
)
2355 add_template_candidate_real (candidates
, tmpl
, ctype
,
2356 explicit_targs
, arglist
, return_type
,
2357 access_path
, conversion_path
,
2358 flags
, NULL_TREE
, strict
);
2362 static struct z_candidate
*
2363 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
2364 tree obj
, tree arglist
, tree return_type
,
2365 tree access_path
, tree conversion_path
)
2368 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
2369 arglist
, return_type
, access_path
,
2370 conversion_path
, 0, obj
, DEDUCE_CONV
);
2373 /* The CANDS are the set of candidates that were considered for
2374 overload resolution. Return the set of viable candidates. If none
2375 of the candidates were viable, set *ANY_VIABLE_P to true. STRICT_P
2376 is true if a candidate should be considered viable only if it is
2379 static struct z_candidate
*
2380 splice_viable (struct z_candidate
*cands
,
2384 struct z_candidate
*viable
;
2385 struct z_candidate
**last_viable
;
2386 struct z_candidate
**cand
;
2389 last_viable
= &viable
;
2390 *any_viable_p
= false;
2395 struct z_candidate
*c
= *cand
;
2396 if (strict_p
? c
->viable
== 1 : c
->viable
)
2401 last_viable
= &c
->next
;
2402 *any_viable_p
= true;
2408 return viable
? viable
: cands
;
2412 any_strictly_viable (struct z_candidate
*cands
)
2414 for (; cands
; cands
= cands
->next
)
2415 if (cands
->viable
== 1)
2421 build_this (tree obj
)
2423 /* Fix this to work on non-lvalues. */
2424 return build_unary_op (ADDR_EXPR
, obj
, 0);
2427 /* Returns true iff functions are equivalent. Equivalent functions are
2428 not '==' only if one is a function-local extern function or if
2429 both are extern "C". */
2432 equal_functions (tree fn1
, tree fn2
)
2434 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
2435 || DECL_EXTERN_C_FUNCTION_P (fn1
))
2436 return decls_match (fn1
, fn2
);
2440 /* Print information about one overload candidate CANDIDATE. MSGSTR
2441 is the text to print before the candidate itself.
2443 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
2444 to have been run through gettext by the caller. This wart makes
2445 life simpler in print_z_candidates and for the translators. */
2448 print_z_candidate (const char *msgstr
, struct z_candidate
*candidate
)
2450 if (TREE_CODE (candidate
->fn
) == IDENTIFIER_NODE
)
2452 if (TREE_VEC_LENGTH (candidate
->convs
) == 3)
2453 inform ("%s %D(%T, %T, %T) <built-in>", msgstr
, candidate
->fn
,
2454 TREE_TYPE (TREE_VEC_ELT (candidate
->convs
, 0)),
2455 TREE_TYPE (TREE_VEC_ELT (candidate
->convs
, 1)),
2456 TREE_TYPE (TREE_VEC_ELT (candidate
->convs
, 2)));
2457 else if (TREE_VEC_LENGTH (candidate
->convs
) == 2)
2458 inform ("%s %D(%T, %T) <built-in>", msgstr
, candidate
->fn
,
2459 TREE_TYPE (TREE_VEC_ELT (candidate
->convs
, 0)),
2460 TREE_TYPE (TREE_VEC_ELT (candidate
->convs
, 1)));
2462 inform ("%s %D(%T) <built-in>", msgstr
, candidate
->fn
,
2463 TREE_TYPE (TREE_VEC_ELT (candidate
->convs
, 0)));
2465 else if (TYPE_P (candidate
->fn
))
2466 inform ("%s %T <conversion>", msgstr
, candidate
->fn
);
2467 else if (candidate
->viable
== -1)
2468 inform ("%H%s %+#D <near match>",
2469 &DECL_SOURCE_LOCATION (candidate
->fn
), msgstr
, candidate
->fn
);
2471 inform ("%H%s %+#D",
2472 &DECL_SOURCE_LOCATION (candidate
->fn
), msgstr
, candidate
->fn
);
2476 print_z_candidates (struct z_candidate
*candidates
)
2479 struct z_candidate
*cand1
;
2480 struct z_candidate
**cand2
;
2482 /* There may be duplicates in the set of candidates. We put off
2483 checking this condition as long as possible, since we have no way
2484 to eliminate duplicates from a set of functions in less than n^2
2485 time. Now we are about to emit an error message, so it is more
2486 permissible to go slowly. */
2487 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
2489 tree fn
= cand1
->fn
;
2490 /* Skip builtin candidates and conversion functions. */
2491 if (TREE_CODE (fn
) != FUNCTION_DECL
)
2493 cand2
= &cand1
->next
;
2496 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
2497 && equal_functions (fn
, (*cand2
)->fn
))
2498 *cand2
= (*cand2
)->next
;
2500 cand2
= &(*cand2
)->next
;
2507 str
= _("candidates are:");
2508 print_z_candidate (str
, candidates
);
2509 if (candidates
->next
)
2511 /* Indent successive candidates by the width of the translation
2512 of the above string. */
2513 size_t len
= gcc_gettext_width (str
) + 1;
2514 char *spaces
= alloca (len
);
2515 memset (spaces
, ' ', len
-1);
2516 spaces
[len
- 1] = '\0';
2518 candidates
= candidates
->next
;
2521 print_z_candidate (spaces
, candidates
);
2522 candidates
= candidates
->next
;
2528 /* USER_SEQ is a user-defined conversion sequence, beginning with a
2529 USER_CONV. STD_SEQ is the standard conversion sequence applied to
2530 the result of the conversion function to convert it to the final
2531 desired type. Merge the the two sequences into a single sequence,
2532 and return the merged sequence. */
2535 merge_conversion_sequences (tree user_seq
, tree std_seq
)
2539 my_friendly_assert (TREE_CODE (user_seq
) == USER_CONV
,
2542 /* Find the end of the second conversion sequence. */
2544 while (TREE_CODE (*t
) != IDENTITY_CONV
)
2545 t
= &TREE_OPERAND (*t
, 0);
2547 /* Replace the identity conversion with the user conversion
2551 /* The entire sequence is a user-conversion sequence. */
2552 ICS_USER_FLAG (std_seq
) = 1;
2557 /* Returns the best overload candidate to perform the requested
2558 conversion. This function is used for three the overloading situations
2559 described in [over.match.copy], [over.match.conv], and [over.match.ref].
2560 If TOTYPE is a REFERENCE_TYPE, we're trying to find an lvalue binding as
2561 per [dcl.init.ref], so we ignore temporary bindings. */
2563 static struct z_candidate
*
2564 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
)
2566 struct z_candidate
*candidates
, *cand
;
2567 tree fromtype
= TREE_TYPE (expr
);
2568 tree ctors
= NULL_TREE
, convs
= NULL_TREE
;
2569 tree args
= NULL_TREE
;
2572 /* We represent conversion within a hierarchy using RVALUE_CONV and
2573 BASE_CONV, as specified by [over.best.ics]; these become plain
2574 constructor calls, as specified in [dcl.init]. */
2575 my_friendly_assert (!IS_AGGR_TYPE (fromtype
) || !IS_AGGR_TYPE (totype
)
2576 || !DERIVED_FROM_P (totype
, fromtype
), 20011226);
2578 if (IS_AGGR_TYPE (totype
))
2579 ctors
= lookup_fnfields (TYPE_BINFO (totype
),
2580 complete_ctor_identifier
,
2583 if (IS_AGGR_TYPE (fromtype
))
2584 convs
= lookup_conversions (fromtype
);
2587 flags
|= LOOKUP_NO_CONVERSION
;
2593 ctors
= BASELINK_FUNCTIONS (ctors
);
2595 t
= build_int_2 (0, 0);
2596 TREE_TYPE (t
) = build_pointer_type (totype
);
2597 args
= build_tree_list (NULL_TREE
, expr
);
2598 /* We should never try to call the abstract or base constructor
2600 my_friendly_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors
))
2601 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors
)),
2603 args
= tree_cons (NULL_TREE
, t
, args
);
2605 for (; ctors
; ctors
= OVL_NEXT (ctors
))
2607 tree ctor
= OVL_CURRENT (ctors
);
2608 if (DECL_NONCONVERTING_P (ctor
))
2611 if (TREE_CODE (ctor
) == TEMPLATE_DECL
)
2612 cand
= add_template_candidate (&candidates
, ctor
, totype
,
2613 NULL_TREE
, args
, NULL_TREE
,
2614 TYPE_BINFO (totype
),
2615 TYPE_BINFO (totype
),
2619 cand
= add_function_candidate (&candidates
, ctor
, totype
,
2620 args
, TYPE_BINFO (totype
),
2621 TYPE_BINFO (totype
),
2625 cand
->second_conv
= build1 (IDENTITY_CONV
, totype
, NULL_TREE
);
2629 args
= build_tree_list (NULL_TREE
, build_this (expr
));
2631 for (; convs
; convs
= TREE_CHAIN (convs
))
2634 tree conversion_path
= TREE_PURPOSE (convs
);
2635 int convflags
= LOOKUP_NO_CONVERSION
;
2637 /* If we are called to convert to a reference type, we are trying to
2638 find an lvalue binding, so don't even consider temporaries. If
2639 we don't find an lvalue binding, the caller will try again to
2640 look for a temporary binding. */
2641 if (TREE_CODE (totype
) == REFERENCE_TYPE
)
2642 convflags
|= LOOKUP_NO_TEMP_BIND
;
2644 for (fns
= TREE_VALUE (convs
); fns
; fns
= OVL_NEXT (fns
))
2646 tree fn
= OVL_CURRENT (fns
);
2648 /* [over.match.funcs] For conversion functions, the function
2649 is considered to be a member of the class of the implicit
2650 object argument for the purpose of defining the type of
2651 the implicit object parameter.
2653 So we pass fromtype as CTYPE to add_*_candidate. */
2655 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2656 cand
= add_template_candidate (&candidates
, fn
, fromtype
,
2659 TYPE_BINFO (fromtype
),
2664 cand
= add_function_candidate (&candidates
, fn
, fromtype
,
2666 TYPE_BINFO (fromtype
),
2672 tree ics
= implicit_conversion (totype
,
2673 TREE_TYPE (TREE_TYPE (cand
->fn
)),
2676 cand
->second_conv
= ics
;
2678 if (ics
== NULL_TREE
)
2680 else if (candidates
->viable
== 1 && ICS_BAD_FLAG (ics
))
2686 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
2690 cand
= tourney (candidates
);
2693 if (flags
& LOOKUP_COMPLAIN
)
2695 error ("conversion from `%T' to `%T' is ambiguous",
2697 print_z_candidates (candidates
);
2700 cand
= candidates
; /* any one will do */
2701 cand
->second_conv
= build1 (AMBIG_CONV
, totype
, expr
);
2702 ICS_USER_FLAG (cand
->second_conv
) = 1;
2703 if (!any_strictly_viable (candidates
))
2704 ICS_BAD_FLAG (cand
->second_conv
) = 1;
2705 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
2706 ambiguous conversion is no worse than another user-defined
2712 /* Build the user conversion sequence. */
2715 (DECL_CONSTRUCTOR_P (cand
->fn
)
2716 ? totype
: non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)))),
2717 build1 (IDENTITY_CONV
, TREE_TYPE (expr
), expr
));
2718 TREE_OPERAND (convs
, 1) = build_zc_wrapper (cand
);
2720 /* Combine it with the second conversion sequence. */
2721 cand
->second_conv
= merge_conversion_sequences (convs
,
2724 if (cand
->viable
== -1)
2725 ICS_BAD_FLAG (cand
->second_conv
) = 1;
2731 build_user_type_conversion (tree totype
, tree expr
, int flags
)
2733 struct z_candidate
*cand
2734 = build_user_type_conversion_1 (totype
, expr
, flags
);
2738 if (TREE_CODE (cand
->second_conv
) == AMBIG_CONV
)
2739 return error_mark_node
;
2740 return convert_from_reference (convert_like (cand
->second_conv
, expr
));
2745 /* Find the possibly overloaded set of functions corresponding to a
2746 call of the form SCOPE::NAME (...). NAME might be a
2747 TEMPLATE_ID_EXPR, OVERLOAD, _DECL, IDENTIFIER_NODE or LOOKUP_EXPR. */
2750 resolve_scoped_fn_name (tree scope
, tree name
)
2753 tree template_args
= NULL_TREE
;
2754 bool is_template_id
= TREE_CODE (name
) == TEMPLATE_ID_EXPR
;
2758 template_args
= TREE_OPERAND (name
, 1);
2759 name
= TREE_OPERAND (name
, 0);
2761 if (TREE_CODE (name
) == OVERLOAD
)
2762 name
= DECL_NAME (get_first_fn (name
));
2763 else if (TREE_CODE (name
) == LOOKUP_EXPR
)
2764 name
= TREE_OPERAND (name
, 0);
2766 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2767 fn
= lookup_namespace_name (scope
, name
);
2770 if (!TYPE_BEING_DEFINED (scope
)
2771 && !COMPLETE_TYPE_P (complete_type (scope
)))
2773 error ("incomplete type '%T' cannot be used to name a scope",
2775 return error_mark_node
;
2778 if (BASELINK_P (name
))
2781 fn
= lookup_member (scope
, name
, /*protect=*/1, /*want_type=*/false);
2782 if (fn
&& current_class_type
)
2783 fn
= (adjust_result_of_qualified_name_lookup
2784 (fn
, scope
, current_class_type
));
2786 /* It might be the name of a function pointer member. */
2787 if (fn
&& TREE_CODE (fn
) == FIELD_DECL
)
2788 fn
= resolve_offset_ref (build_offset_ref (scope
, fn
));
2793 error ("'%D' has no member named '%E'", scope
, name
);
2794 return error_mark_node
;
2800 if (BASELINK_P (fn
))
2801 fns
= BASELINK_FUNCTIONS (fns
);
2802 fns
= build_nt (TEMPLATE_ID_EXPR
, fns
, template_args
);
2803 if (BASELINK_P (fn
))
2804 BASELINK_FUNCTIONS (fn
) = fns
;
2812 /* Do any initial processing on the arguments to a function call. */
2815 resolve_args (tree args
)
2818 for (t
= args
; t
; t
= TREE_CHAIN (t
))
2820 tree arg
= TREE_VALUE (t
);
2822 if (arg
== error_mark_node
)
2823 return error_mark_node
;
2824 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
2826 error ("invalid use of void expression");
2827 return error_mark_node
;
2829 else if (TREE_CODE (arg
) == OFFSET_REF
)
2830 arg
= resolve_offset_ref (arg
);
2831 arg
= convert_from_reference (arg
);
2832 TREE_VALUE (t
) = arg
;
2837 /* Perform overload resolution on FN, which is called with the ARGS.
2839 Return the candidate function selected by overload resolution, or
2840 NULL if the event that overload resolution failed. In the case
2841 that overload resolution fails, *CANDIDATES will be the set of
2842 candidates considered, and ANY_VIABLE_P will be set to true or
2843 false to indicate whether or not any of the candidates were
2846 The ARGS should already have gone through RESOLVE_ARGS before this
2847 function is called. */
2849 static struct z_candidate
*
2850 perform_overload_resolution (tree fn
,
2852 struct z_candidate
**candidates
,
2855 struct z_candidate
*cand
;
2856 tree explicit_targs
= NULL_TREE
;
2857 int template_only
= 0;
2860 *any_viable_p
= true;
2862 /* Check FN and ARGS. */
2863 my_friendly_assert (TREE_CODE (fn
) == FUNCTION_DECL
2864 || TREE_CODE (fn
) == TEMPLATE_DECL
2865 || TREE_CODE (fn
) == OVERLOAD
2866 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
,
2868 my_friendly_assert (!args
|| TREE_CODE (args
) == TREE_LIST
,
2871 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2873 explicit_targs
= TREE_OPERAND (fn
, 1);
2874 fn
= TREE_OPERAND (fn
, 0);
2878 /* Add the various candidate functions. */
2879 add_candidates (fn
, args
, explicit_targs
, template_only
,
2880 /*conversion_path=*/NULL_TREE
,
2881 /*access_path=*/NULL_TREE
,
2885 *candidates
= splice_viable (*candidates
, pedantic
, any_viable_p
);
2889 cand
= tourney (*candidates
);
2893 /* Return an expression for a call to FN (a namespace-scope function,
2894 or a static member function) with the ARGS. */
2897 build_new_function_call (tree fn
, tree args
)
2899 struct z_candidate
*candidates
, *cand
;
2902 args
= resolve_args (args
);
2903 if (args
== error_mark_node
)
2904 return error_mark_node
;
2906 cand
= perform_overload_resolution (fn
, args
, &candidates
, &any_viable_p
);
2910 if (!any_viable_p
&& candidates
&& ! candidates
->next
)
2911 return build_function_call (candidates
->fn
, args
);
2912 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2913 fn
= TREE_OPERAND (fn
, 0);
2915 error ("no matching function for call to `%D(%A)'",
2916 DECL_NAME (OVL_CURRENT (fn
)), args
);
2918 error ("call of overloaded `%D(%A)' is ambiguous",
2919 DECL_NAME (OVL_CURRENT (fn
)), args
);
2921 print_z_candidates (candidates
);
2922 return error_mark_node
;
2925 return build_over_call (cand
, LOOKUP_NORMAL
);
2928 /* Build a call to a global operator new. FNNAME is the name of the
2929 operator (either "operator new" or "operator new[]") and ARGS are
2930 the arguments provided. *SIZE points to the total number of bytes
2931 required by the allocation, and is updated if that is changed here.
2932 *COOKIE_SIZE is non-NULL if a cookie should be used. If this
2933 function determins that no cookie should be used, after all,
2934 *COOKIE_SIZE is set to NULL_TREE. */
2937 build_operator_new_call (tree fnname
, tree args
, tree
*size
, tree
*cookie_size
)
2940 struct z_candidate
*candidates
;
2941 struct z_candidate
*cand
;
2944 args
= tree_cons (NULL_TREE
, *size
, args
);
2945 args
= resolve_args (args
);
2946 if (args
== error_mark_node
)
2949 fns
= lookup_function_nonclass (fnname
, args
);
2951 /* Figure out what function is being called. */
2952 cand
= perform_overload_resolution (fns
, args
, &candidates
, &any_viable_p
);
2954 /* If no suitable function could be found, issue an error message
2959 error ("no matching function for call to `%D(%A)'",
2960 DECL_NAME (OVL_CURRENT (fns
)), args
);
2962 error ("call of overloaded `%D(%A)' is ambiguous",
2963 DECL_NAME (OVL_CURRENT (fns
)), args
);
2965 print_z_candidates (candidates
);
2966 return error_mark_node
;
2969 /* If a cookie is required, add some extra space. Whether
2970 or not a cookie is required cannot be determined until
2971 after we know which function was called. */
2974 bool use_cookie
= true;
2975 if (!abi_version_at_least (2))
2977 tree placement
= TREE_CHAIN (args
);
2978 /* In G++ 3.2, the check was implemented incorrectly; it
2979 looked at the placement expression, rather than the
2980 type of the function. */
2981 if (placement
&& !TREE_CHAIN (placement
)
2982 && same_type_p (TREE_TYPE (TREE_VALUE (placement
)),
2990 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
2991 /* Skip the size_t parameter. */
2992 arg_types
= TREE_CHAIN (arg_types
);
2993 /* Check the remaining parameters (if any). */
2995 && TREE_CHAIN (arg_types
) == void_list_node
2996 && same_type_p (TREE_VALUE (arg_types
),
3000 /* If we need a cookie, adjust the number of bytes allocated. */
3003 /* Update the total size. */
3004 *size
= size_binop (PLUS_EXPR
, *size
, *cookie_size
);
3005 /* Update the argument list to reflect the adjusted size. */
3006 TREE_VALUE (args
) = *size
;
3009 *cookie_size
= NULL_TREE
;
3012 /* Build the CALL_EXPR. */
3013 return build_over_call (cand
, LOOKUP_NORMAL
);
3017 build_object_call (tree obj
, tree args
)
3019 struct z_candidate
*candidates
= 0, *cand
;
3020 tree fns
, convs
, mem_args
= NULL_TREE
;
3021 tree type
= TREE_TYPE (obj
);
3024 if (TYPE_PTRMEMFUNC_P (type
))
3026 /* It's no good looking for an overloaded operator() on a
3027 pointer-to-member-function. */
3028 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj
);
3029 return error_mark_node
;
3032 fns
= lookup_fnfields (TYPE_BINFO (type
), ansi_opname (CALL_EXPR
), 1);
3033 if (fns
== error_mark_node
)
3034 return error_mark_node
;
3036 args
= resolve_args (args
);
3038 if (args
== error_mark_node
)
3039 return error_mark_node
;
3043 tree base
= BINFO_TYPE (BASELINK_BINFO (fns
));
3044 mem_args
= tree_cons (NULL_TREE
, build_this (obj
), args
);
3046 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
3048 tree fn
= OVL_CURRENT (fns
);
3049 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
3050 add_template_candidate (&candidates
, fn
, base
, NULL_TREE
,
3051 mem_args
, NULL_TREE
,
3054 LOOKUP_NORMAL
, DEDUCE_CALL
);
3056 add_function_candidate
3057 (&candidates
, fn
, base
, mem_args
, TYPE_BINFO (type
),
3058 TYPE_BINFO (type
), LOOKUP_NORMAL
);
3062 convs
= lookup_conversions (type
);
3064 for (; convs
; convs
= TREE_CHAIN (convs
))
3066 tree fns
= TREE_VALUE (convs
);
3067 tree totype
= TREE_TYPE (TREE_TYPE (OVL_CURRENT (fns
)));
3069 if ((TREE_CODE (totype
) == POINTER_TYPE
3070 && TREE_CODE (TREE_TYPE (totype
)) == FUNCTION_TYPE
)
3071 || (TREE_CODE (totype
) == REFERENCE_TYPE
3072 && TREE_CODE (TREE_TYPE (totype
)) == FUNCTION_TYPE
)
3073 || (TREE_CODE (totype
) == REFERENCE_TYPE
3074 && TREE_CODE (TREE_TYPE (totype
)) == POINTER_TYPE
3075 && TREE_CODE (TREE_TYPE (TREE_TYPE (totype
))) == FUNCTION_TYPE
))
3076 for (; fns
; fns
= OVL_NEXT (fns
))
3078 tree fn
= OVL_CURRENT (fns
);
3079 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
3080 add_template_conv_candidate
3081 (&candidates
, fn
, obj
, args
, totype
,
3082 /*access_path=*/NULL_TREE
,
3083 /*conversion_path=*/NULL_TREE
);
3085 add_conv_candidate (&candidates
, fn
, obj
, args
,
3086 /*conversion_path=*/NULL_TREE
,
3087 /*access_path=*/NULL_TREE
);
3091 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
3094 error ("no match for call to `(%T) (%A)'", TREE_TYPE (obj
), args
);
3095 print_z_candidates (candidates
);
3096 return error_mark_node
;
3099 cand
= tourney (candidates
);
3102 error ("call of `(%T) (%A)' is ambiguous", TREE_TYPE (obj
), args
);
3103 print_z_candidates (candidates
);
3104 return error_mark_node
;
3107 /* Since cand->fn will be a type, not a function, for a conversion
3108 function, we must be careful not to unconditionally look at
3110 if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
3111 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
) == CALL_EXPR
)
3112 return build_over_call (cand
, LOOKUP_NORMAL
);
3114 obj
= convert_like_with_context
3115 (TREE_VEC_ELT (cand
->convs
, 0), obj
, cand
->fn
, -1);
3118 return build_function_call (obj
, args
);
3122 op_error (enum tree_code code
, enum tree_code code2
,
3123 tree arg1
, tree arg2
, tree arg3
, const char *problem
)
3127 if (code
== MODIFY_EXPR
)
3128 opname
= assignment_operator_name_info
[code2
].name
;
3130 opname
= operator_name_info
[code
].name
;
3135 error ("%s for `%T ? %T : %T' operator", problem
,
3136 error_type (arg1
), error_type (arg2
), error_type (arg3
));
3138 case POSTINCREMENT_EXPR
:
3139 case POSTDECREMENT_EXPR
:
3140 error ("%s for `%T %s' operator", problem
, error_type (arg1
), opname
);
3143 error ("%s for `%T [%T]' operator", problem
,
3144 error_type (arg1
), error_type (arg2
));
3148 error ("%s for `%T %s %T' operator", problem
,
3149 error_type (arg1
), opname
, error_type (arg2
));
3151 error ("%s for `%s %T' operator", problem
, opname
, error_type (arg1
));
3155 /* Return the implicit conversion sequence that could be used to
3156 convert E1 to E2 in [expr.cond]. */
3159 conditional_conversion (tree e1
, tree e2
)
3161 tree t1
= non_reference (TREE_TYPE (e1
));
3162 tree t2
= non_reference (TREE_TYPE (e2
));
3167 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
3168 implicitly converted (clause _conv_) to the type "reference to
3169 T2", subject to the constraint that in the conversion the
3170 reference must bind directly (_dcl.init.ref_) to E1. */
3171 if (real_lvalue_p (e2
))
3173 conv
= implicit_conversion (build_reference_type (t2
),
3176 LOOKUP_NO_TEMP_BIND
);
3183 If E1 and E2 have class type, and the underlying class types are
3184 the same or one is a base class of the other: E1 can be converted
3185 to match E2 if the class of T2 is the same type as, or a base
3186 class of, the class of T1, and the cv-qualification of T2 is the
3187 same cv-qualification as, or a greater cv-qualification than, the
3188 cv-qualification of T1. If the conversion is applied, E1 is
3189 changed to an rvalue of type T2 that still refers to the original
3190 source class object (or the appropriate subobject thereof).
3192 FIXME we can't express an rvalue that refers to the original object;
3193 we have to create a new one. */
3194 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
3195 && same_or_base_type_p (TYPE_MAIN_VARIANT (t2
),
3196 TYPE_MAIN_VARIANT (t1
)))
3198 if (at_least_as_qualified_p (t2
, t1
))
3200 conv
= build1 (IDENTITY_CONV
, t1
, e1
);
3201 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
3202 TYPE_MAIN_VARIANT (t2
)))
3204 conv
= build_conv (BASE_CONV
, t2
, conv
);
3205 NEED_TEMPORARY_P (conv
) = 1;
3208 conv
= build_conv (RVALUE_CONV
, t2
, conv
);
3217 E1 can be converted to match E2 if E1 can be implicitly converted
3218 to the type that expression E2 would have if E2 were converted to
3219 an rvalue (or the type it has, if E2 is an rvalue). */
3220 return implicit_conversion (t2
, t1
, e1
, LOOKUP_NORMAL
);
3223 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
3224 arguments to the conditional expression. */
3227 build_conditional_expr (tree arg1
, tree arg2
, tree arg3
)
3232 tree result_type
= NULL_TREE
;
3233 bool lvalue_p
= true;
3234 struct z_candidate
*candidates
= 0;
3235 struct z_candidate
*cand
;
3237 /* As a G++ extension, the second argument to the conditional can be
3238 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
3239 c'.) If the second operand is omitted, make sure it is
3240 calculated only once. */
3244 pedwarn ("ISO C++ forbids omitting the middle term of a ?: expression");
3246 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
3247 if (real_lvalue_p (arg1
))
3248 arg2
= arg1
= stabilize_reference (arg1
);
3250 arg2
= arg1
= save_expr (arg1
);
3255 The first expr ession is implicitly converted to bool (clause
3257 arg1
= cp_convert (boolean_type_node
, arg1
);
3259 /* If something has already gone wrong, just pass that fact up the
3261 if (arg1
== error_mark_node
3262 || arg2
== error_mark_node
3263 || arg3
== error_mark_node
3264 || TREE_TYPE (arg1
) == error_mark_node
3265 || TREE_TYPE (arg2
) == error_mark_node
3266 || TREE_TYPE (arg3
) == error_mark_node
)
3267 return error_mark_node
;
3271 If either the second or the third operand has type (possibly
3272 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
3273 array-to-pointer (_conv.array_), and function-to-pointer
3274 (_conv.func_) standard conversions are performed on the second
3275 and third operands. */
3276 arg2_type
= TREE_TYPE (arg2
);
3277 arg3_type
= TREE_TYPE (arg3
);
3278 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
3280 /* Do the conversions. We don't these for `void' type arguments
3281 since it can't have any effect and since decay_conversion
3282 does not handle that case gracefully. */
3283 if (!VOID_TYPE_P (arg2_type
))
3284 arg2
= decay_conversion (arg2
);
3285 if (!VOID_TYPE_P (arg3_type
))
3286 arg3
= decay_conversion (arg3
);
3287 arg2_type
= TREE_TYPE (arg2
);
3288 arg3_type
= TREE_TYPE (arg3
);
3292 One of the following shall hold:
3294 --The second or the third operand (but not both) is a
3295 throw-expression (_except.throw_); the result is of the
3296 type of the other and is an rvalue.
3298 --Both the second and the third operands have type void; the
3299 result is of type void and is an rvalue. */
3300 if ((TREE_CODE (arg2
) == THROW_EXPR
)
3301 ^ (TREE_CODE (arg3
) == THROW_EXPR
))
3302 result_type
= ((TREE_CODE (arg2
) == THROW_EXPR
)
3303 ? arg3_type
: arg2_type
);
3304 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
3305 result_type
= void_type_node
;
3308 error ("`%E' has type `void' and is not a throw-expression",
3309 VOID_TYPE_P (arg2_type
) ? arg2
: arg3
);
3310 return error_mark_node
;
3314 goto valid_operands
;
3318 Otherwise, if the second and third operand have different types,
3319 and either has (possibly cv-qualified) class type, an attempt is
3320 made to convert each of those operands to the type of the other. */
3321 else if (!same_type_p (arg2_type
, arg3_type
)
3322 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
3324 tree conv2
= conditional_conversion (arg2
, arg3
);
3325 tree conv3
= conditional_conversion (arg3
, arg2
);
3329 If both can be converted, or one can be converted but the
3330 conversion is ambiguous, the program is ill-formed. If
3331 neither can be converted, the operands are left unchanged and
3332 further checking is performed as described below. If exactly
3333 one conversion is possible, that conversion is applied to the
3334 chosen operand and the converted operand is used in place of
3335 the original operand for the remainder of this section. */
3336 if ((conv2
&& !ICS_BAD_FLAG (conv2
)
3337 && conv3
&& !ICS_BAD_FLAG (conv3
))
3338 || (conv2
&& TREE_CODE (conv2
) == AMBIG_CONV
)
3339 || (conv3
&& TREE_CODE (conv3
) == AMBIG_CONV
))
3341 error ("operands to ?: have different types");
3342 return error_mark_node
;
3344 else if (conv2
&& !ICS_BAD_FLAG (conv2
))
3346 arg2
= convert_like (conv2
, arg2
);
3347 arg2
= convert_from_reference (arg2
);
3348 if (!same_type_p (TREE_TYPE (arg2
), arg3_type
))
3350 arg2_type
= TREE_TYPE (arg2
);
3352 else if (conv3
&& !ICS_BAD_FLAG (conv3
))
3354 arg3
= convert_like (conv3
, arg3
);
3355 arg3
= convert_from_reference (arg3
);
3356 if (!same_type_p (TREE_TYPE (arg3
), arg2_type
))
3358 arg3_type
= TREE_TYPE (arg3
);
3364 If the second and third operands are lvalues and have the same
3365 type, the result is of that type and is an lvalue. */
3366 if (real_lvalue_p (arg2
) && real_lvalue_p (arg3
) &&
3367 same_type_p (arg2_type
, arg3_type
))
3369 result_type
= arg2_type
;
3370 goto valid_operands
;
3375 Otherwise, the result is an rvalue. If the second and third
3376 operand do not have the same type, and either has (possibly
3377 cv-qualified) class type, overload resolution is used to
3378 determine the conversions (if any) to be applied to the operands
3379 (_over.match.oper_, _over.built_). */
3381 if (!same_type_p (arg2_type
, arg3_type
)
3382 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
3388 /* Rearrange the arguments so that add_builtin_candidate only has
3389 to know about two args. In build_builtin_candidates, the
3390 arguments are unscrambled. */
3394 add_builtin_candidates (&candidates
,
3397 ansi_opname (COND_EXPR
),
3403 If the overload resolution fails, the program is
3405 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
3408 op_error (COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, "no match");
3409 print_z_candidates (candidates
);
3410 return error_mark_node
;
3412 cand
= tourney (candidates
);
3415 op_error (COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, "no match");
3416 print_z_candidates (candidates
);
3417 return error_mark_node
;
3422 Otherwise, the conversions thus determined are applied, and
3423 the converted operands are used in place of the original
3424 operands for the remainder of this section. */
3425 conv
= TREE_VEC_ELT (cand
->convs
, 0);
3426 arg1
= convert_like (conv
, arg1
);
3427 conv
= TREE_VEC_ELT (cand
->convs
, 1);
3428 arg2
= convert_like (conv
, arg2
);
3429 conv
= TREE_VEC_ELT (cand
->convs
, 2);
3430 arg3
= convert_like (conv
, arg3
);
3435 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
3436 and function-to-pointer (_conv.func_) standard conversions are
3437 performed on the second and third operands.
3439 We need to force the lvalue-to-rvalue conversion here for class types,
3440 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
3441 that isn't wrapped with a TARGET_EXPR plays havoc with exception
3444 We use ocp_convert rather than build_user_type_conversion because the
3445 latter returns NULL_TREE on failure, while the former gives an error. */
3447 arg2
= force_rvalue (arg2
);
3448 arg2_type
= TREE_TYPE (arg2
);
3450 arg3
= force_rvalue (arg3
);
3451 arg3_type
= TREE_TYPE (arg3
);
3453 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
3454 return error_mark_node
;
3458 After those conversions, one of the following shall hold:
3460 --The second and third operands have the same type; the result is of
3462 if (same_type_p (arg2_type
, arg3_type
))
3463 result_type
= arg2_type
;
3466 --The second and third operands have arithmetic or enumeration
3467 type; the usual arithmetic conversions are performed to bring
3468 them to a common type, and the result is of that type. */
3469 else if ((ARITHMETIC_TYPE_P (arg2_type
)
3470 || TREE_CODE (arg2_type
) == ENUMERAL_TYPE
)
3471 && (ARITHMETIC_TYPE_P (arg3_type
)
3472 || TREE_CODE (arg3_type
) == ENUMERAL_TYPE
))
3474 /* In this case, there is always a common type. */
3475 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
3478 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
3479 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
3480 warning ("enumeral mismatch in conditional expression: `%T' vs `%T'",
3481 arg2_type
, arg3_type
);
3482 else if (extra_warnings
3483 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
3484 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
3485 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
3486 && !same_type_p (arg2_type
, type_promotes_to (arg3_type
)))))
3487 warning ("enumeral and non-enumeral type in conditional expression");
3489 arg2
= perform_implicit_conversion (result_type
, arg2
);
3490 arg3
= perform_implicit_conversion (result_type
, arg3
);
3494 --The second and third operands have pointer type, or one has
3495 pointer type and the other is a null pointer constant; pointer
3496 conversions (_conv.ptr_) and qualification conversions
3497 (_conv.qual_) are performed to bring them to their composite
3498 pointer type (_expr.rel_). The result is of the composite
3501 --The second and third operands have pointer to member type, or
3502 one has pointer to member type and the other is a null pointer
3503 constant; pointer to member conversions (_conv.mem_) and
3504 qualification conversions (_conv.qual_) are performed to bring
3505 them to a common type, whose cv-qualification shall match the
3506 cv-qualification of either the second or the third operand.
3507 The result is of the common type. */
3508 else if ((null_ptr_cst_p (arg2
)
3509 && (TYPE_PTR_P (arg3_type
) || TYPE_PTRMEM_P (arg3_type
)
3510 || TYPE_PTRMEMFUNC_P (arg3_type
)))
3511 || (null_ptr_cst_p (arg3
)
3512 && (TYPE_PTR_P (arg2_type
) || TYPE_PTRMEM_P (arg2_type
)
3513 || TYPE_PTRMEMFUNC_P (arg2_type
)))
3514 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
3515 || (TYPE_PTRMEM_P (arg2_type
) && TYPE_PTRMEM_P (arg3_type
))
3516 || (TYPE_PTRMEMFUNC_P (arg2_type
)
3517 && TYPE_PTRMEMFUNC_P (arg3_type
)))
3519 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
3520 arg3
, "conditional expression");
3521 arg2
= perform_implicit_conversion (result_type
, arg2
);
3522 arg3
= perform_implicit_conversion (result_type
, arg3
);
3527 error ("operands to ?: have different types");
3528 return error_mark_node
;
3532 result
= fold (build (COND_EXPR
, result_type
, arg1
, arg2
, arg3
));
3533 /* Expand both sides into the same slot, hopefully the target of the
3534 ?: expression. We used to check for TARGET_EXPRs here, but now we
3535 sometimes wrap them in NOP_EXPRs so the test would fail. */
3536 if (!lvalue_p
&& IS_AGGR_TYPE (result_type
))
3537 result
= build_target_expr_with_type (result
, result_type
);
3539 /* If this expression is an rvalue, but might be mistaken for an
3540 lvalue, we must add a NON_LVALUE_EXPR. */
3541 if (!lvalue_p
&& real_lvalue_p (result
))
3542 result
= build1 (NON_LVALUE_EXPR
, result_type
, result
);
3547 /* OPERAND is an operand to an expression. Perform necessary steps
3548 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
3552 prep_operand (tree operand
)
3556 if (TREE_CODE (operand
) == OFFSET_REF
)
3557 operand
= resolve_offset_ref (operand
);
3558 operand
= convert_from_reference (operand
);
3559 if (CLASS_TYPE_P (TREE_TYPE (operand
))
3560 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
3561 /* Make sure the template type is instantiated now. */
3562 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
3568 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
3569 OVERLOAD) to the CANDIDATES, returning an updated list of
3570 CANDIDATES. The ARGS are the arguments provided to the call,
3571 without any implicit object parameter. The EXPLICIT_TARGS are
3572 explicit template arguments provided. TEMPLATE_ONLY is true if
3573 only template fucntions should be considered. CONVERSION_PATH,
3574 ACCESS_PATH, and FLAGS are as for add_function_candidate. */
3577 add_candidates (tree fns
, tree args
,
3578 tree explicit_targs
, bool template_only
,
3579 tree conversion_path
, tree access_path
,
3581 struct z_candidate
**candidates
)
3584 tree non_static_args
;
3586 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
3587 /* Delay creating the implicit this parameter until it is needed. */
3588 non_static_args
= NULL_TREE
;
3595 fn
= OVL_CURRENT (fns
);
3596 /* Figure out which set of arguments to use. */
3597 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
3599 /* If this function is a non-static member, prepend the implicit
3600 object parameter. */
3601 if (!non_static_args
)
3602 non_static_args
= tree_cons (NULL_TREE
,
3603 build_this (TREE_VALUE (args
)),
3605 fn_args
= non_static_args
;
3608 /* Otherwise, just use the list of arguments provided. */
3611 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
3612 add_template_candidate (candidates
,
3622 else if (!template_only
)
3623 add_function_candidate (candidates
,
3630 fns
= OVL_NEXT (fns
);
3635 build_new_op (enum tree_code code
, int flags
, tree arg1
, tree arg2
, tree arg3
)
3637 struct z_candidate
*candidates
= 0, *cand
;
3638 tree arglist
, fnname
;
3640 enum tree_code code2
= NOP_EXPR
;
3645 if (error_operand_p (arg1
)
3646 || error_operand_p (arg2
)
3647 || error_operand_p (arg3
))
3648 return error_mark_node
;
3650 if (code
== MODIFY_EXPR
)
3652 code2
= TREE_CODE (arg3
);
3654 fnname
= ansi_assopname (code2
);
3657 fnname
= ansi_opname (code
);
3659 arg1
= prep_operand (arg1
);
3665 case VEC_DELETE_EXPR
:
3667 /* Use build_op_new_call and build_op_delete_call instead. */
3671 return build_object_call (arg1
, arg2
);
3677 arg2
= prep_operand (arg2
);
3678 arg3
= prep_operand (arg3
);
3680 if (code
== COND_EXPR
)
3682 if (arg2
== NULL_TREE
3683 || TREE_CODE (TREE_TYPE (arg2
)) == VOID_TYPE
3684 || TREE_CODE (TREE_TYPE (arg3
)) == VOID_TYPE
3685 || (! IS_OVERLOAD_TYPE (TREE_TYPE (arg2
))
3686 && ! IS_OVERLOAD_TYPE (TREE_TYPE (arg3
))))
3689 else if (! IS_OVERLOAD_TYPE (TREE_TYPE (arg1
))
3690 && (! arg2
|| ! IS_OVERLOAD_TYPE (TREE_TYPE (arg2
))))
3693 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
3694 arg2
= integer_zero_node
;
3696 arglist
= NULL_TREE
;
3698 arglist
= tree_cons (NULL_TREE
, arg3
, arglist
);
3700 arglist
= tree_cons (NULL_TREE
, arg2
, arglist
);
3701 arglist
= tree_cons (NULL_TREE
, arg1
, arglist
);
3703 /* Add namespace-scope operators to the list of functions to
3705 add_candidates (lookup_function_nonclass (fnname
, arglist
),
3706 arglist
, NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
3707 flags
, &candidates
);
3708 /* Add class-member operators to the candidate set. */
3709 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
3713 fns
= lookup_fnfields (TYPE_BINFO (TREE_TYPE (arg1
)), fnname
, 1);
3714 if (fns
== error_mark_node
)
3717 add_candidates (BASELINK_FUNCTIONS (fns
), arglist
,
3719 BASELINK_BINFO (fns
),
3720 TYPE_BINFO (TREE_TYPE (arg1
)),
3721 flags
, &candidates
);
3724 /* Rearrange the arguments for ?: so that add_builtin_candidate only has
3725 to know about two args; a builtin candidate will always have a first
3726 parameter of type bool. We'll handle that in
3727 build_builtin_candidate. */
3728 if (code
== COND_EXPR
)
3738 args
[2] = NULL_TREE
;
3741 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
, flags
);
3747 /* For these, the built-in candidates set is empty
3748 [over.match.oper]/3. We don't want non-strict matches
3749 because exact matches are always possible with built-in
3750 operators. The built-in candidate set for COMPONENT_REF
3751 would be empty too, but since there are no such built-in
3752 operators, we accept non-strict matches for them. */
3757 strict_p
= pedantic
;
3761 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
3766 case POSTINCREMENT_EXPR
:
3767 case POSTDECREMENT_EXPR
:
3768 /* Look for an `operator++ (int)'. If they didn't have
3769 one, then we fall back to the old way of doing things. */
3770 if (flags
& LOOKUP_COMPLAIN
)
3771 pedwarn ("no `%D(int)' declared for postfix `%s', trying prefix operator instead",
3773 operator_name_info
[code
].name
);
3774 if (code
== POSTINCREMENT_EXPR
)
3775 code
= PREINCREMENT_EXPR
;
3777 code
= PREDECREMENT_EXPR
;
3778 return build_new_op (code
, flags
, arg1
, NULL_TREE
, NULL_TREE
);
3780 /* The caller will deal with these. */
3789 if (flags
& LOOKUP_COMPLAIN
)
3791 op_error (code
, code2
, arg1
, arg2
, arg3
, "no match");
3792 print_z_candidates (candidates
);
3794 return error_mark_node
;
3797 cand
= tourney (candidates
);
3800 if (flags
& LOOKUP_COMPLAIN
)
3802 op_error (code
, code2
, arg1
, arg2
, arg3
, "ambiguous overload");
3803 print_z_candidates (candidates
);
3805 return error_mark_node
;
3808 if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
3811 && fnname
== ansi_assopname (NOP_EXPR
)
3812 && DECL_ARTIFICIAL (cand
->fn
)
3814 && ! candidates
->next
->next
)
3816 warning ("using synthesized `%#D' for copy assignment",
3818 cp_warning_at (" where cfront would use `%#D'",
3820 ? candidates
->next
->fn
3824 return build_over_call (cand
, LOOKUP_NORMAL
);
3827 /* Check for comparison of different enum types. */
3836 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
3837 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
3838 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
3839 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
))))
3841 warning ("comparison between `%#T' and `%#T'",
3842 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
3849 /* We need to strip any leading REF_BIND so that bitfields don't cause
3850 errors. This should not remove any important conversions, because
3851 builtins don't apply to class objects directly. */
3852 conv
= TREE_VEC_ELT (cand
->convs
, 0);
3853 if (TREE_CODE (conv
) == REF_BIND
)
3854 conv
= TREE_OPERAND (conv
, 0);
3855 arg1
= convert_like (conv
, arg1
);
3858 conv
= TREE_VEC_ELT (cand
->convs
, 1);
3859 if (TREE_CODE (conv
) == REF_BIND
)
3860 conv
= TREE_OPERAND (conv
, 0);
3861 arg2
= convert_like (conv
, arg2
);
3865 conv
= TREE_VEC_ELT (cand
->convs
, 2);
3866 if (TREE_CODE (conv
) == REF_BIND
)
3867 conv
= TREE_OPERAND (conv
, 0);
3868 arg3
= convert_like (conv
, arg3
);
3875 return build_modify_expr (arg1
, code2
, arg2
);
3878 return build_indirect_ref (arg1
, "unary *");
3883 case TRUNC_DIV_EXPR
:
3894 case TRUNC_MOD_EXPR
:
3898 case TRUTH_ANDIF_EXPR
:
3899 case TRUTH_ORIF_EXPR
:
3900 return cp_build_binary_op (code
, arg1
, arg2
);
3905 case TRUTH_NOT_EXPR
:
3906 case PREINCREMENT_EXPR
:
3907 case POSTINCREMENT_EXPR
:
3908 case PREDECREMENT_EXPR
:
3909 case POSTDECREMENT_EXPR
:
3912 return build_unary_op (code
, arg1
, candidates
!= 0);
3915 return build_array_ref (arg1
, arg2
);
3918 return build_conditional_expr (arg1
, arg2
, arg3
);
3921 return build_m_component_ref
3922 (build_indirect_ref (arg1
, NULL
), arg2
);
3924 /* The caller will deal with these. */
3936 /* Build a call to operator delete. This has to be handled very specially,
3937 because the restrictions on what signatures match are different from all
3938 other call instances. For a normal delete, only a delete taking (void *)
3939 or (void *, size_t) is accepted. For a placement delete, only an exact
3940 match with the placement new is accepted.
3942 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
3943 ADDR is the pointer to be deleted.
3944 SIZE is the size of the memory block to be deleted.
3945 FLAGS are the usual overloading flags.
3946 PLACEMENT is the corresponding placement new call, or NULL_TREE. */
3949 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
3950 int flags
, tree placement
)
3952 tree fn
= NULL_TREE
;
3953 tree fns
, fnname
, fntype
, argtypes
, args
, type
;
3956 if (addr
== error_mark_node
)
3957 return error_mark_node
;
3959 type
= TREE_TYPE (TREE_TYPE (addr
));
3960 while (TREE_CODE (type
) == ARRAY_TYPE
)
3961 type
= TREE_TYPE (type
);
3963 fnname
= ansi_opname (code
);
3965 if (IS_AGGR_TYPE (type
) && ! (flags
& LOOKUP_GLOBAL
))
3968 If the result of the lookup is ambiguous or inaccessible, or if
3969 the lookup selects a placement deallocation function, the
3970 program is ill-formed.
3972 Therefore, we ask lookup_fnfields to complain ambout ambiguity. */
3974 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
3975 if (fns
== error_mark_node
)
3976 return error_mark_node
;
3981 if (fns
== NULL_TREE
)
3982 fns
= lookup_name_nonclass (fnname
);
3989 /* Find the allocation function that is being called. */
3990 call_expr
= placement
;
3991 /* Sometimes we have a COMPOUND_EXPR, rather than a simple
3993 while (TREE_CODE (call_expr
) == COMPOUND_EXPR
)
3994 call_expr
= TREE_OPERAND (call_expr
, 1);
3995 /* Extract the function. */
3996 alloc_fn
= get_callee_fndecl (call_expr
);
3997 my_friendly_assert (alloc_fn
!= NULL_TREE
, 20020327);
3998 /* Then the second parm type. */
3999 argtypes
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (alloc_fn
)));
4000 /* Also the second argument. */
4001 args
= TREE_CHAIN (TREE_OPERAND (call_expr
, 1));
4005 /* First try it without the size argument. */
4006 argtypes
= void_list_node
;
4010 /* Strip const and volatile from addr. */
4011 addr
= cp_convert (ptr_type_node
, addr
);
4013 /* We make two tries at finding a matching `operator delete'. On
4014 the first pass, we look for an one-operator (or placement)
4015 operator delete. If we're not doing placement delete, then on
4016 the second pass we look for a two-argument delete. */
4017 for (pass
= 0; pass
< (placement
? 1 : 2); ++pass
)
4020 argtypes
= tree_cons (NULL_TREE
, ptr_type_node
, argtypes
);
4022 /* Normal delete; now try to find a match including the size
4024 argtypes
= tree_cons (NULL_TREE
, ptr_type_node
,
4025 tree_cons (NULL_TREE
, sizetype
,
4027 fntype
= build_function_type (void_type_node
, argtypes
);
4029 /* Go through the `operator delete' functions looking for one
4030 with a matching type. */
4031 for (fn
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
4037 /* Exception specifications on the `delete' operator do not
4039 t
= build_exception_variant (TREE_TYPE (OVL_CURRENT (fn
)),
4041 /* We also don't compare attributes. We're really just
4042 trying to check the types of the first two parameters. */
4043 if (comptypes (t
, fntype
, COMPARE_NO_ATTRIBUTES
))
4047 /* If we found a match, we're done. */
4052 /* If we have a matching function, call it. */
4055 /* Make sure we have the actual function, and not an
4057 fn
= OVL_CURRENT (fn
);
4059 /* If the FN is a member function, make sure that it is
4061 if (DECL_CLASS_SCOPE_P (fn
))
4062 enforce_access (type
, fn
);
4065 args
= tree_cons (NULL_TREE
, addr
, args
);
4067 args
= tree_cons (NULL_TREE
, addr
,
4068 build_tree_list (NULL_TREE
, size
));
4070 return build_function_call (fn
, args
);
4073 /* If we are doing placement delete we do nothing if we don't find a
4074 matching op delete. */
4078 error ("no suitable `operator delete' for `%T'", type
);
4079 return error_mark_node
;
4082 /* If the current scope isn't allowed to access DECL along
4083 BASETYPE_PATH, give an error. The most derived class in
4084 BASETYPE_PATH is the one used to qualify DECL. */
4087 enforce_access (tree basetype_path
, tree decl
)
4089 if (!accessible_p (basetype_path
, decl
))
4091 if (TREE_PRIVATE (decl
))
4092 cp_error_at ("`%+#D' is private", decl
);
4093 else if (TREE_PROTECTED (decl
))
4094 cp_error_at ("`%+#D' is protected", decl
);
4096 cp_error_at ("`%+#D' is inaccessible", decl
);
4097 error ("within this context");
4104 /* Perform the conversions in CONVS on the expression EXPR.
4105 FN and ARGNUM are used for diagnostics. ARGNUM is zero based, -1
4106 indicates the `this' argument of a method. INNER is nonzero when
4107 being called to continue a conversion chain. It is negative when a
4108 reference binding will be applied, positive otherwise. */
4111 convert_like_real (tree convs
, tree expr
, tree fn
, int argnum
, int inner
)
4115 tree totype
= TREE_TYPE (convs
);
4117 if (ICS_BAD_FLAG (convs
)
4118 && TREE_CODE (convs
) != USER_CONV
4119 && TREE_CODE (convs
) != AMBIG_CONV
4120 && TREE_CODE (convs
) != REF_BIND
)
4123 for (; t
; t
= TREE_OPERAND (t
, 0))
4125 if (TREE_CODE (t
) == USER_CONV
|| !ICS_BAD_FLAG (t
))
4127 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1);
4130 else if (TREE_CODE (t
) == AMBIG_CONV
)
4131 return convert_like_real (t
, expr
, fn
, argnum
, 1);
4132 else if (TREE_CODE (t
) == IDENTITY_CONV
)
4135 pedwarn ("invalid conversion from `%T' to `%T'", TREE_TYPE (expr
), totype
);
4137 pedwarn (" initializing argument %P of `%D'", argnum
, fn
);
4138 return cp_convert (totype
, expr
);
4142 expr
= dubious_conversion_warnings
4143 (totype
, expr
, "argument", fn
, argnum
);
4144 switch (TREE_CODE (convs
))
4148 struct z_candidate
*cand
= USER_CONV_CAND (convs
);
4149 tree convfn
= cand
->fn
;
4152 if (DECL_CONSTRUCTOR_P (convfn
))
4154 tree t
= build_int_2 (0, 0);
4155 TREE_TYPE (t
) = build_pointer_type (DECL_CONTEXT (convfn
));
4157 args
= build_tree_list (NULL_TREE
, expr
);
4158 if (DECL_HAS_IN_CHARGE_PARM_P (convfn
)
4159 || DECL_HAS_VTT_PARM_P (convfn
))
4160 /* We should never try to call the abstract or base constructor
4163 args
= tree_cons (NULL_TREE
, t
, args
);
4166 args
= build_this (expr
);
4167 expr
= build_over_call (cand
, LOOKUP_NORMAL
);
4169 /* If this is a constructor or a function returning an aggr type,
4170 we need to build up a TARGET_EXPR. */
4171 if (DECL_CONSTRUCTOR_P (convfn
))
4172 expr
= build_cplus_new (totype
, expr
);
4174 /* The result of the call is then used to direct-initialize the object
4175 that is the destination of the copy-initialization. [dcl.init]
4177 Note that this step is not reflected in the conversion sequence;
4178 it affects the semantics when we actually perform the
4179 conversion, but is not considered during overload resolution.
4181 If the target is a class, that means call a ctor. */
4182 if (IS_AGGR_TYPE (totype
)
4183 && (inner
>= 0 || !lvalue_p (expr
)))
4185 savew
= warningcount
, savee
= errorcount
;
4186 expr
= build_special_member_call
4187 (NULL_TREE
, complete_ctor_identifier
,
4188 build_tree_list (NULL_TREE
, expr
), TYPE_BINFO (totype
),
4189 /* Core issue 84, now a DR, says that we don't allow UDCs
4190 for these args (which deliberately breaks copy-init of an
4191 auto_ptr<Base> from an auto_ptr<Derived>). */
4192 LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
);
4194 /* Tell the user where this failing constructor call came from. */
4197 if (warningcount
> savew
)
4199 (" initializing argument %P of `%D' from result of `%D'",
4200 argnum
, fn
, convfn
);
4201 else if (errorcount
> savee
)
4203 (" initializing argument %P of `%D' from result of `%D'",
4204 argnum
, fn
, convfn
);
4208 if (warningcount
> savew
)
4209 warning (" initializing temporary from result of `%D'",
4211 else if (errorcount
> savee
)
4212 error (" initializing temporary from result of `%D'",
4215 expr
= build_cplus_new (totype
, expr
);
4220 if (type_unknown_p (expr
))
4221 expr
= instantiate_type (totype
, expr
, tf_error
| tf_warning
);
4222 /* Convert a non-array constant variable to its underlying value, unless we
4223 are about to bind it to a reference, in which case we need to
4224 leave it as an lvalue. */
4226 && TREE_CODE (TREE_TYPE (expr
)) != ARRAY_TYPE
)
4227 expr
= decl_constant_value (expr
);
4230 /* Call build_user_type_conversion again for the error. */
4231 return build_user_type_conversion
4232 (totype
, TREE_OPERAND (convs
, 0), LOOKUP_NORMAL
);
4238 expr
= convert_like_real (TREE_OPERAND (convs
, 0), expr
, fn
, argnum
,
4239 TREE_CODE (convs
) == REF_BIND
? -1 : 1);
4240 if (expr
== error_mark_node
)
4241 return error_mark_node
;
4243 switch (TREE_CODE (convs
))
4246 if (! IS_AGGR_TYPE (totype
))
4248 /* else fall through */
4250 if (TREE_CODE (convs
) == BASE_CONV
&& !NEED_TEMPORARY_P (convs
))
4252 /* We are going to bind a reference directly to a base-class
4253 subobject of EXPR. */
4254 tree base_ptr
= build_pointer_type (totype
);
4256 /* Build an expression for `*((base*) &expr)'. */
4257 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
4258 expr
= perform_implicit_conversion (base_ptr
, expr
);
4259 expr
= build_indirect_ref (expr
, "implicit conversion");
4263 /* Copy-initialization where the cv-unqualified version of the source
4264 type is the same class as, or a derived class of, the class of the
4265 destination [is treated as direct-initialization]. [dcl.init] */
4266 savew
= warningcount
, savee
= errorcount
;
4267 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
4268 build_tree_list (NULL_TREE
, expr
),
4269 TYPE_BINFO (totype
),
4270 LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
);
4273 if (warningcount
> savew
)
4274 warning (" initializing argument %P of `%D'", argnum
, fn
);
4275 else if (errorcount
> savee
)
4276 error (" initializing argument %P of `%D'", argnum
, fn
);
4278 return build_cplus_new (totype
, expr
);
4282 tree ref_type
= totype
;
4284 /* If necessary, create a temporary. */
4285 if (NEED_TEMPORARY_P (convs
) || !non_cast_lvalue_p (expr
))
4287 tree type
= TREE_TYPE (TREE_OPERAND (convs
, 0));
4288 expr
= build_target_expr_with_type (expr
, type
);
4291 /* Take the address of the thing to which we will bind the
4293 expr
= build_unary_op (ADDR_EXPR
, expr
, 1);
4294 if (expr
== error_mark_node
)
4295 return error_mark_node
;
4297 /* Convert it to a pointer to the type referred to by the
4298 reference. This will adjust the pointer if a derived to
4299 base conversion is being performed. */
4300 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
4302 /* Convert the pointer to the desired reference type. */
4303 return build_nop (ref_type
, expr
);
4307 return decay_conversion (expr
);
4310 /* Warn about deprecated conversion if appropriate. */
4311 string_conv_p (totype
, expr
, 1);
4317 return ocp_convert (totype
, expr
, CONV_IMPLICIT
,
4318 LOOKUP_NORMAL
|LOOKUP_NO_CONVERSION
);
4321 /* Build a call to __builtin_trap which can be used in an expression. */
4324 call_builtin_trap (void)
4326 tree fn
= get_identifier ("__builtin_trap");
4327 if (IDENTIFIER_GLOBAL_VALUE (fn
))
4328 fn
= IDENTIFIER_GLOBAL_VALUE (fn
);
4332 fn
= build_call (fn
, NULL_TREE
);
4333 fn
= build (COMPOUND_EXPR
, integer_type_node
, fn
, integer_zero_node
);
4337 /* ARG is being passed to a varargs function. Perform any conversions
4338 required. Array/function to pointer decay must have already happened.
4339 Return the converted value. */
4342 convert_arg_to_ellipsis (tree arg
)
4344 if (TREE_CODE (TREE_TYPE (arg
)) == REAL_TYPE
4345 && (TYPE_PRECISION (TREE_TYPE (arg
))
4346 < TYPE_PRECISION (double_type_node
)))
4347 /* Convert `float' to `double'. */
4348 arg
= cp_convert (double_type_node
, arg
);
4350 /* Convert `short' and `char' to full-size `int'. */
4351 arg
= default_conversion (arg
);
4353 arg
= require_complete_type (arg
);
4355 if (arg
!= error_mark_node
&& ! pod_type_p (TREE_TYPE (arg
)))
4357 /* Undefined behavior [expr.call] 5.2.2/7. We used to just warn
4358 here and do a bitwise copy, but now cp_expr_size will abort if we
4360 warning ("cannot pass objects of non-POD type `%#T' through `...'; \
4361 call will abort at runtime",
4363 arg
= call_builtin_trap ();
4369 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
4372 build_x_va_arg (tree expr
, tree type
)
4374 if (processing_template_decl
)
4375 return build_min (VA_ARG_EXPR
, type
, expr
);
4377 type
= complete_type_or_else (type
, NULL_TREE
);
4379 if (expr
== error_mark_node
|| !type
)
4380 return error_mark_node
;
4382 if (! pod_type_p (type
))
4384 /* Undefined behavior [expr.call] 5.2.2/7. */
4385 warning ("cannot receive objects of non-POD type `%#T' through `...'",
4389 return build_va_arg (expr
, type
);
4392 /* TYPE has been given to va_arg. Apply the default conversions which
4393 would have happened when passed via ellipsis. Return the promoted
4394 type, or the passed type if there is no change. */
4397 cxx_type_promotes_to (tree type
)
4401 if (TREE_CODE (type
) == ARRAY_TYPE
)
4402 return build_pointer_type (TREE_TYPE (type
));
4404 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4405 return build_pointer_type (type
);
4407 promote
= type_promotes_to (type
);
4408 if (same_type_p (type
, promote
))
4414 /* ARG is a default argument expression being passed to a parameter of
4415 the indicated TYPE, which is a parameter to FN. Do any required
4416 conversions. Return the converted value. */
4419 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
)
4421 /* If the ARG is an unparsed default argument expression, the
4422 conversion cannot be performed. */
4423 if (TREE_CODE (arg
) == DEFAULT_ARG
)
4425 error ("the default argument for parameter %d of `%D' has "
4426 "not yet been parsed",
4428 return error_mark_node
;
4431 if (fn
&& DECL_TEMPLATE_INFO (fn
))
4432 arg
= tsubst_default_argument (fn
, type
, arg
);
4434 arg
= break_out_target_exprs (arg
);
4436 if (TREE_CODE (arg
) == CONSTRUCTOR
)
4438 arg
= digest_init (type
, arg
, 0);
4439 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_NORMAL
,
4440 "default argument", fn
, parmnum
);
4444 /* This could get clobbered by the following call. */
4445 if (TREE_HAS_CONSTRUCTOR (arg
))
4446 arg
= copy_node (arg
);
4448 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_NORMAL
,
4449 "default argument", fn
, parmnum
);
4450 arg
= convert_for_arg_passing (type
, arg
);
4456 /* Returns the type which will really be used for passing an argument of
4460 type_passed_as (tree type
)
4462 /* Pass classes with copy ctors by invisible reference. */
4463 if (TREE_ADDRESSABLE (type
))
4464 type
= build_reference_type (type
);
4465 else if (PROMOTE_PROTOTYPES
4466 && INTEGRAL_TYPE_P (type
)
4467 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
4468 type
= integer_type_node
;
4473 /* Actually perform the appropriate conversion. */
4476 convert_for_arg_passing (tree type
, tree val
)
4478 if (val
== error_mark_node
)
4480 /* Pass classes with copy ctors by invisible reference. */
4481 else if (TREE_ADDRESSABLE (type
))
4482 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
4483 else if (PROMOTE_PROTOTYPES
4484 && INTEGRAL_TYPE_P (type
)
4485 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
4486 val
= default_conversion (val
);
4490 /* Subroutine of the various build_*_call functions. Overload resolution
4491 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
4492 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
4493 bitmask of various LOOKUP_* flags which apply to the call itself. */
4496 build_over_call (struct z_candidate
*cand
, int flags
)
4499 tree args
= cand
->args
;
4500 tree convs
= cand
->convs
;
4501 tree converted_args
= NULL_TREE
;
4502 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
4503 tree conv
, arg
, val
;
4507 /* Give any warnings we noticed during overload resolution. */
4509 for (val
= cand
->warnings
; val
; val
= TREE_CHAIN (val
))
4510 joust (cand
, WRAPPER_ZC (TREE_VALUE (val
)), 1);
4512 if (DECL_FUNCTION_MEMBER_P (fn
))
4513 enforce_access (cand
->access_path
, fn
);
4515 if (args
&& TREE_CODE (args
) != TREE_LIST
)
4516 args
= build_tree_list (NULL_TREE
, args
);
4519 /* The implicit parameters to a constructor are not considered by overload
4520 resolution, and must be of the proper type. */
4521 if (DECL_CONSTRUCTOR_P (fn
))
4523 converted_args
= tree_cons (NULL_TREE
, TREE_VALUE (arg
), converted_args
);
4524 arg
= TREE_CHAIN (arg
);
4525 parm
= TREE_CHAIN (parm
);
4526 if (DECL_HAS_IN_CHARGE_PARM_P (fn
))
4527 /* We should never try to call the abstract constructor. */
4529 if (DECL_HAS_VTT_PARM_P (fn
))
4531 converted_args
= tree_cons
4532 (NULL_TREE
, TREE_VALUE (arg
), converted_args
);
4533 arg
= TREE_CHAIN (arg
);
4534 parm
= TREE_CHAIN (parm
);
4537 /* Bypass access control for 'this' parameter. */
4538 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
4540 tree parmtype
= TREE_VALUE (parm
);
4541 tree argtype
= TREE_TYPE (TREE_VALUE (arg
));
4545 if (ICS_BAD_FLAG (TREE_VEC_ELT (convs
, i
)))
4546 pedwarn ("passing `%T' as `this' argument of `%#D' discards qualifiers",
4547 TREE_TYPE (argtype
), fn
);
4549 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
4550 X is called for an object that is not of type X, or of a type
4551 derived from X, the behavior is undefined.
4553 So we can assume that anything passed as 'this' is non-null, and
4554 optimize accordingly. */
4555 my_friendly_assert (TREE_CODE (parmtype
) == POINTER_TYPE
, 19990811);
4556 /* Convert to the base in which the function was declared. */
4557 my_friendly_assert (cand
->conversion_path
!= NULL_TREE
, 20020730);
4558 converted_arg
= build_base_path (PLUS_EXPR
,
4560 cand
->conversion_path
,
4562 /* If fn was found by a using declaration, the conversion path
4563 will be to the derived class, not the base declaring fn. We
4564 must convert from derived to base. */
4565 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
4566 TREE_TYPE (parmtype
), ba_ignore
, NULL
);
4568 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
4571 converted_args
= tree_cons (NULL_TREE
, converted_arg
, converted_args
);
4572 parm
= TREE_CHAIN (parm
);
4573 arg
= TREE_CHAIN (arg
);
4579 parm
= TREE_CHAIN (parm
), arg
= TREE_CHAIN (arg
), ++i
)
4581 tree type
= TREE_VALUE (parm
);
4583 conv
= TREE_VEC_ELT (convs
, i
);
4584 val
= convert_like_with_context
4585 (conv
, TREE_VALUE (arg
), fn
, i
- is_method
);
4587 val
= convert_for_arg_passing (type
, val
);
4588 converted_args
= tree_cons (NULL_TREE
, val
, converted_args
);
4591 /* Default arguments */
4592 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
4594 = tree_cons (NULL_TREE
,
4595 convert_default_arg (TREE_VALUE (parm
),
4596 TREE_PURPOSE (parm
),
4601 for (; arg
; arg
= TREE_CHAIN (arg
))
4603 = tree_cons (NULL_TREE
,
4604 convert_arg_to_ellipsis (TREE_VALUE (arg
)),
4607 converted_args
= nreverse (converted_args
);
4610 check_function_format (NULL
, TYPE_ATTRIBUTES (TREE_TYPE (fn
)),
4613 /* Avoid actually calling copy constructors and copy assignment operators,
4616 if (! flag_elide_constructors
)
4617 /* Do things the hard way. */;
4618 else if (TREE_VEC_LENGTH (convs
) == 1
4619 && DECL_COPY_CONSTRUCTOR_P (fn
))
4622 arg
= skip_artificial_parms_for (fn
, converted_args
);
4623 arg
= TREE_VALUE (arg
);
4625 /* Pull out the real argument, disregarding const-correctness. */
4627 while (TREE_CODE (targ
) == NOP_EXPR
4628 || TREE_CODE (targ
) == NON_LVALUE_EXPR
4629 || TREE_CODE (targ
) == CONVERT_EXPR
)
4630 targ
= TREE_OPERAND (targ
, 0);
4631 if (TREE_CODE (targ
) == ADDR_EXPR
)
4633 targ
= TREE_OPERAND (targ
, 0);
4634 if (!same_type_ignoring_top_level_qualifiers_p
4635 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
4644 arg
= build_indirect_ref (arg
, 0);
4646 /* [class.copy]: the copy constructor is implicitly defined even if
4647 the implementation elided its use. */
4648 if (TYPE_HAS_COMPLEX_INIT_REF (DECL_CONTEXT (fn
)))
4651 /* If we're creating a temp and we already have one, don't create a
4652 new one. If we're not creating a temp but we get one, use
4653 INIT_EXPR to collapse the temp into our target. Otherwise, if the
4654 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
4655 temp or an INIT_EXPR otherwise. */
4656 if (integer_zerop (TREE_VALUE (args
)))
4658 if (TREE_CODE (arg
) == TARGET_EXPR
)
4660 else if (TYPE_HAS_TRIVIAL_INIT_REF (DECL_CONTEXT (fn
)))
4661 return build_target_expr_with_type (arg
, DECL_CONTEXT (fn
));
4663 else if (TREE_CODE (arg
) == TARGET_EXPR
4664 || TYPE_HAS_TRIVIAL_INIT_REF (DECL_CONTEXT (fn
)))
4667 tree to
= stabilize_reference
4668 (build_indirect_ref (TREE_VALUE (args
), 0));
4670 val
= build (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
4671 address
= build_unary_op (ADDR_EXPR
, val
, 0);
4672 /* Avoid a warning about this expression, if the address is
4674 TREE_USED (address
) = 1;
4678 else if (DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
4680 && TYPE_HAS_TRIVIAL_ASSIGN_REF (DECL_CONTEXT (fn
)))
4682 tree to
= stabilize_reference
4683 (build_indirect_ref (TREE_VALUE (converted_args
), 0));
4685 arg
= build_indirect_ref (TREE_VALUE (TREE_CHAIN (converted_args
)), 0);
4686 val
= build (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
4692 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0)
4694 tree t
, *p
= &TREE_VALUE (converted_args
);
4695 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (*p
)),
4698 my_friendly_assert (binfo
&& binfo
!= error_mark_node
, 20010730);
4700 *p
= build_base_path (PLUS_EXPR
, *p
, binfo
, 1);
4701 if (TREE_SIDE_EFFECTS (*p
))
4702 *p
= save_expr (*p
);
4703 t
= build_pointer_type (TREE_TYPE (fn
));
4704 if (DECL_CONTEXT (fn
) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn
)))
4705 fn
= build_java_interface_fn_ref (fn
, *p
);
4707 fn
= build_vfn_ref (build_indirect_ref (*p
, 0), DECL_VINDEX (fn
));
4710 else if (DECL_INLINE (fn
))
4711 fn
= inline_conversion (fn
);
4713 fn
= build_addr_func (fn
);
4715 return build_cxx_call (fn
, args
, converted_args
);
4718 /* Build and return a call to FN, using the the CONVERTED_ARGS. ARGS
4719 gives the original form of the arguments. This function performs
4720 no overload resolution, conversion, or other high-level
4724 build_cxx_call(tree fn
, tree args
, tree converted_args
)
4728 /* Recognize certain built-in functions so we can make tree-codes
4729 other than CALL_EXPR. We do this when it enables fold-const.c
4730 to do something useful. */
4731 if (TREE_CODE (fn
) == ADDR_EXPR
4732 && TREE_CODE (TREE_OPERAND (fn
, 0)) == FUNCTION_DECL
4733 && DECL_BUILT_IN (TREE_OPERAND (fn
, 0)))
4736 exp
= expand_tree_builtin (TREE_OPERAND (fn
, 0), args
, converted_args
);
4741 fn
= build_call (fn
, converted_args
);
4743 /* If this call might throw an exception, note that fact. */
4744 fndecl
= get_callee_fndecl (fn
);
4745 if ((!fndecl
|| !TREE_NOTHROW (fndecl
))
4746 && at_function_scope_p ()
4748 cp_function_chain
->can_throw
= 1;
4750 /* Some built-in function calls will be evaluated at compile-time in
4754 if (VOID_TYPE_P (TREE_TYPE (fn
)))
4757 fn
= require_complete_type (fn
);
4758 if (fn
== error_mark_node
)
4759 return error_mark_node
;
4761 if (IS_AGGR_TYPE (TREE_TYPE (fn
)))
4762 fn
= build_cplus_new (TREE_TYPE (fn
), fn
);
4763 return convert_from_reference (fn
);
4766 static GTY(()) tree java_iface_lookup_fn
;
4768 /* Make an expression which yields the address of the Java interface
4769 method FN. This is achieved by generating a call to libjava's
4770 _Jv_LookupInterfaceMethodIdx(). */
4773 build_java_interface_fn_ref (tree fn
, tree instance
)
4775 tree lookup_args
, lookup_fn
, method
, idx
;
4776 tree klass_ref
, iface
, iface_ref
;
4779 if (!java_iface_lookup_fn
)
4781 tree endlink
= build_void_list_node ();
4782 tree t
= tree_cons (NULL_TREE
, ptr_type_node
,
4783 tree_cons (NULL_TREE
, ptr_type_node
,
4784 tree_cons (NULL_TREE
, java_int_type_node
,
4786 java_iface_lookup_fn
4787 = builtin_function ("_Jv_LookupInterfaceMethodIdx",
4788 build_function_type (ptr_type_node
, t
),
4789 0, NOT_BUILT_IN
, NULL
, NULL_TREE
);
4792 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
4793 This is the first entry in the vtable. */
4794 klass_ref
= build_vtbl_ref (build_indirect_ref (instance
, 0),
4797 /* Get the java.lang.Class pointer for the interface being called. */
4798 iface
= DECL_CONTEXT (fn
);
4799 iface_ref
= lookup_field (iface
, get_identifier ("class$"), 0, false);
4800 if (!iface_ref
|| TREE_CODE (iface_ref
) != VAR_DECL
4801 || DECL_CONTEXT (iface_ref
) != iface
)
4803 error ("could not find class$ field in java interface type `%T'",
4805 return error_mark_node
;
4807 iface_ref
= build1 (ADDR_EXPR
, build_pointer_type (iface
), iface_ref
);
4809 /* Determine the itable index of FN. */
4811 for (method
= TYPE_METHODS (iface
); method
; method
= TREE_CHAIN (method
))
4813 if (!DECL_VIRTUAL_P (method
))
4819 idx
= build_int_2 (i
, 0);
4821 lookup_args
= tree_cons (NULL_TREE
, klass_ref
,
4822 tree_cons (NULL_TREE
, iface_ref
,
4823 build_tree_list (NULL_TREE
, idx
)));
4824 lookup_fn
= build1 (ADDR_EXPR
,
4825 build_pointer_type (TREE_TYPE (java_iface_lookup_fn
)),
4826 java_iface_lookup_fn
);
4827 return build (CALL_EXPR
, ptr_type_node
, lookup_fn
, lookup_args
, NULL_TREE
);
4830 /* Returns the value to use for the in-charge parameter when making a
4831 call to a function with the indicated NAME. */
4834 in_charge_arg_for_name (tree name
)
4836 if (name
== base_ctor_identifier
4837 || name
== base_dtor_identifier
)
4838 return integer_zero_node
;
4839 else if (name
== complete_ctor_identifier
)
4840 return integer_one_node
;
4841 else if (name
== complete_dtor_identifier
)
4842 return integer_two_node
;
4843 else if (name
== deleting_dtor_identifier
)
4844 return integer_three_node
;
4846 /* This function should only be called with one of the names listed
4852 /* Build a call to a constructor, destructor, or an assignment
4853 operator for INSTANCE, an expression with class type. NAME
4854 indicates the special member function to call; ARGS are the
4855 arguments. BINFO indicates the base of INSTANCE that is to be
4856 passed as the `this' parameter to the member function called.
4858 FLAGS are the LOOKUP_* flags to use when processing the call.
4860 If NAME indicates a complete object constructor, INSTANCE may be
4861 NULL_TREE. In this case, the caller will call build_cplus_new to
4862 store the newly constructed object into a VAR_DECL. */
4865 build_special_member_call (tree instance
, tree name
, tree args
,
4866 tree binfo
, int flags
)
4869 /* The type of the subobject to be constructed or destroyed. */
4872 my_friendly_assert (name
== complete_ctor_identifier
4873 || name
== base_ctor_identifier
4874 || name
== complete_dtor_identifier
4875 || name
== base_dtor_identifier
4876 || name
== deleting_dtor_identifier
4877 || name
== ansi_assopname (NOP_EXPR
),
4879 my_friendly_assert (binfo
!= NULL_TREE
, 20020712);
4881 class_type
= BINFO_TYPE (binfo
);
4883 /* Handle the special case where INSTANCE is NULL_TREE. */
4884 if (name
== complete_ctor_identifier
&& !instance
)
4886 instance
= build_int_2 (0, 0);
4887 TREE_TYPE (instance
) = build_pointer_type (class_type
);
4888 instance
= build1 (INDIRECT_REF
, class_type
, instance
);
4890 else if (name
== complete_dtor_identifier
4891 || name
== base_dtor_identifier
4892 || name
== deleting_dtor_identifier
)
4893 my_friendly_assert (args
== NULL_TREE
, 20020712);
4895 my_friendly_assert (instance
!= NULL_TREE
, 20020712);
4897 /* Resolve the name. */
4898 if (!complete_type_or_else (BINFO_TYPE (binfo
), NULL_TREE
))
4899 return error_mark_node
;
4901 fns
= lookup_fnfields (binfo
, name
, 1);
4903 /* When making a call to a constructor or destructor for a subobject
4904 that uses virtual base classes, pass down a pointer to a VTT for
4906 if ((name
== base_ctor_identifier
4907 || name
== base_dtor_identifier
)
4908 && TYPE_USES_VIRTUAL_BASECLASSES (class_type
))
4913 /* If the current function is a complete object constructor
4914 or destructor, then we fetch the VTT directly.
4915 Otherwise, we look it up using the VTT we were given. */
4916 vtt
= TREE_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
4917 vtt
= decay_conversion (vtt
);
4918 vtt
= build (COND_EXPR
, TREE_TYPE (vtt
),
4919 build (EQ_EXPR
, boolean_type_node
,
4920 current_in_charge_parm
, integer_zero_node
),
4923 my_friendly_assert (BINFO_SUBVTT_INDEX (binfo
), 20010110);
4924 sub_vtt
= build (PLUS_EXPR
, TREE_TYPE (vtt
), vtt
,
4925 BINFO_SUBVTT_INDEX (binfo
));
4927 args
= tree_cons (NULL_TREE
, sub_vtt
, args
);
4930 return build_new_method_call (instance
, fns
, args
, binfo
, flags
);
4933 /* Return the NAME, as a C string. The NAME indicates a function that
4934 is a member of TYPE. *FREE_P is set to true if the caller must
4935 free the memory returned.
4937 Rather than go through all of this, we should simply set the names
4938 of constructors and destructors appropriately, and dispense with
4939 ctor_identifier, dtor_identifier, etc. */
4942 name_as_c_string (tree name
, tree type
, bool *free_p
)
4946 /* Assume that we will not allocate memory. */
4948 /* Constructors and destructors are special. */
4949 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
4952 = (char *) IDENTIFIER_POINTER (constructor_name (type
));
4953 /* For a destructor, add the '~'. */
4954 if (name
== complete_dtor_identifier
4955 || name
== base_dtor_identifier
4956 || name
== deleting_dtor_identifier
)
4958 pretty_name
= concat ("~", pretty_name
, NULL
);
4959 /* Remember that we need to free the memory allocated. */
4964 pretty_name
= (char *) IDENTIFIER_POINTER (name
);
4969 /* Build a call to "INSTANCE.FN (ARGS)". */
4972 build_new_method_call (tree instance
, tree fns
, tree args
,
4973 tree conversion_path
, int flags
)
4975 struct z_candidate
*candidates
= 0, *cand
;
4976 tree explicit_targs
= NULL_TREE
;
4977 tree basetype
= NULL_TREE
;
4980 tree mem_args
= NULL_TREE
, instance_ptr
;
4986 int template_only
= 0;
4989 my_friendly_assert (instance
!= NULL_TREE
, 20020729);
4991 if (error_operand_p (instance
)
4992 || error_operand_p (fns
)
4993 || args
== error_mark_node
)
4994 return error_mark_node
;
4996 /* Process the argument list. */
4998 args
= resolve_args (args
);
4999 if (args
== error_mark_node
)
5000 return error_mark_node
;
5002 if (TREE_CODE (instance
) == OFFSET_REF
)
5003 instance
= resolve_offset_ref (instance
);
5004 if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
5005 instance
= convert_from_reference (instance
);
5006 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
5007 instance_ptr
= build_this (instance
);
5009 if (!BASELINK_P (fns
))
5011 call
= build_field_call (instance_ptr
, fns
, args
);
5014 error ("call to non-function `%D'", fns
);
5015 return error_mark_node
;
5018 if (!conversion_path
)
5019 conversion_path
= BASELINK_BINFO (fns
);
5020 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
5021 optype
= BASELINK_OPTYPE (fns
);
5022 fns
= BASELINK_FUNCTIONS (fns
);
5024 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
5026 explicit_targs
= TREE_OPERAND (fns
, 1);
5027 fns
= TREE_OPERAND (fns
, 0);
5031 my_friendly_assert (TREE_CODE (fns
) == FUNCTION_DECL
5032 || TREE_CODE (fns
) == TEMPLATE_DECL
5033 || TREE_CODE (fns
) == OVERLOAD
,
5036 /* XXX this should be handled before we get here. */
5037 if (! IS_AGGR_TYPE (basetype
))
5039 if ((flags
& LOOKUP_COMPLAIN
) && basetype
!= error_mark_node
)
5040 error ("request for member `%D' in `%E', which is of non-aggregate type `%T'",
5041 fns
, instance
, basetype
);
5043 return error_mark_node
;
5046 fn
= get_first_fn (fns
);
5047 name
= DECL_NAME (fn
);
5049 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
5051 /* Callers should explicitly indicate whether they want to construct
5052 the complete object or just the part without virtual bases. */
5053 my_friendly_assert (name
!= ctor_identifier
, 20000408);
5054 /* Similarly for destructors. */
5055 my_friendly_assert (name
!= dtor_identifier
, 20000408);
5058 /* It's OK to call destructors on cv-qualified objects. Therefore,
5059 convert the INSTANCE_PTR to the unqualified type, if necessary. */
5060 if (DECL_DESTRUCTOR_P (fn
))
5062 tree type
= build_pointer_type (basetype
);
5063 if (!same_type_p (type
, TREE_TYPE (instance_ptr
)))
5064 instance_ptr
= build_nop (type
, instance_ptr
);
5067 class_type
= (conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
);
5068 mem_args
= tree_cons (NULL_TREE
, instance_ptr
, args
);
5070 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
5072 tree t
= OVL_CURRENT (fn
);
5075 /* We can end up here for copy-init of same or base class. */
5076 if ((flags
& LOOKUP_ONLYCONVERTING
)
5077 && DECL_NONCONVERTING_P (t
))
5080 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (t
))
5081 this_arglist
= mem_args
;
5083 this_arglist
= args
;
5085 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5086 /* A member template. */
5087 add_template_candidate (&candidates
, t
,
5090 this_arglist
, optype
,
5095 else if (! template_only
)
5096 add_function_candidate (&candidates
, t
,
5104 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
5107 /* XXX will LOOKUP_SPECULATIVELY be needed when this is done? */
5108 if (flags
& LOOKUP_SPECULATIVELY
)
5110 if (!COMPLETE_TYPE_P (basetype
))
5111 cxx_incomplete_type_error (instance_ptr
, basetype
);
5117 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
5118 error ("no matching function for call to `%T::%s(%A)%#V'",
5119 basetype
, pretty_name
, user_args
,
5120 TREE_TYPE (TREE_TYPE (instance_ptr
)));
5124 print_z_candidates (candidates
);
5125 return error_mark_node
;
5128 cand
= tourney (candidates
);
5134 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
5135 error ("call of overloaded `%s(%A)' is ambiguous", pretty_name
,
5137 print_z_candidates (candidates
);
5140 return error_mark_node
;
5143 if (DECL_PURE_VIRTUAL_P (cand
->fn
)
5144 && instance
== current_class_ref
5145 && (DECL_CONSTRUCTOR_P (current_function_decl
)
5146 || DECL_DESTRUCTOR_P (current_function_decl
))
5147 && ! (flags
& LOOKUP_NONVIRTUAL
)
5148 && value_member (cand
->fn
, CLASSTYPE_PURE_VIRTUALS (basetype
)))
5149 error ((DECL_CONSTRUCTOR_P (current_function_decl
) ?
5150 "abstract virtual `%#D' called from constructor"
5151 : "abstract virtual `%#D' called from destructor"),
5153 if (TREE_CODE (TREE_TYPE (cand
->fn
)) == METHOD_TYPE
5154 && is_dummy_object (instance_ptr
))
5156 error ("cannot call member function `%D' without object", cand
->fn
);
5157 return error_mark_node
;
5160 if (DECL_VINDEX (cand
->fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
5161 && resolves_to_fixed_type_p (instance
, 0))
5162 flags
|= LOOKUP_NONVIRTUAL
;
5164 if (TREE_CODE (TREE_TYPE (cand
->fn
)) == METHOD_TYPE
)
5165 call
= build_over_call (cand
, flags
);
5168 call
= build_over_call (cand
, flags
);
5169 /* In an expression of the form `a->f()' where `f' turns out to
5170 be a static member function, `a' is none-the-less evaluated. */
5171 if (!is_dummy_object (instance_ptr
) && TREE_SIDE_EFFECTS (instance
))
5172 call
= build (COMPOUND_EXPR
, TREE_TYPE (call
), instance
, call
);
5178 /* Returns true iff standard conversion sequence ICS1 is a proper
5179 subsequence of ICS2. */
5182 is_subseq (tree ics1
, tree ics2
)
5184 /* We can assume that a conversion of the same code
5185 between the same types indicates a subsequence since we only get
5186 here if the types we are converting from are the same. */
5188 while (TREE_CODE (ics1
) == RVALUE_CONV
5189 || TREE_CODE (ics1
) == LVALUE_CONV
)
5190 ics1
= TREE_OPERAND (ics1
, 0);
5194 while (TREE_CODE (ics2
) == RVALUE_CONV
5195 || TREE_CODE (ics2
) == LVALUE_CONV
)
5196 ics2
= TREE_OPERAND (ics2
, 0);
5198 if (TREE_CODE (ics2
) == USER_CONV
5199 || TREE_CODE (ics2
) == AMBIG_CONV
5200 || TREE_CODE (ics2
) == IDENTITY_CONV
)
5201 /* At this point, ICS1 cannot be a proper subsequence of
5202 ICS2. We can get a USER_CONV when we are comparing the
5203 second standard conversion sequence of two user conversion
5207 ics2
= TREE_OPERAND (ics2
, 0);
5209 if (TREE_CODE (ics2
) == TREE_CODE (ics1
)
5210 && same_type_p (TREE_TYPE (ics2
), TREE_TYPE (ics1
))
5211 && same_type_p (TREE_TYPE (TREE_OPERAND (ics2
, 0)),
5212 TREE_TYPE (TREE_OPERAND (ics1
, 0))))
5217 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
5218 be any _TYPE nodes. */
5221 is_properly_derived_from (tree derived
, tree base
)
5223 if (!IS_AGGR_TYPE_CODE (TREE_CODE (derived
))
5224 || !IS_AGGR_TYPE_CODE (TREE_CODE (base
)))
5227 /* We only allow proper derivation here. The DERIVED_FROM_P macro
5228 considers every class derived from itself. */
5229 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
5230 && DERIVED_FROM_P (base
, derived
));
5233 /* We build the ICS for an implicit object parameter as a pointer
5234 conversion sequence. However, such a sequence should be compared
5235 as if it were a reference conversion sequence. If ICS is the
5236 implicit conversion sequence for an implicit object parameter,
5237 modify it accordingly. */
5240 maybe_handle_implicit_object (tree
*ics
)
5242 if (ICS_THIS_FLAG (*ics
))
5244 /* [over.match.funcs]
5246 For non-static member functions, the type of the
5247 implicit object parameter is "reference to cv X"
5248 where X is the class of which the function is a
5249 member and cv is the cv-qualification on the member
5250 function declaration. */
5252 tree reference_type
;
5254 /* The `this' parameter is a pointer to a class type. Make the
5255 implict conversion talk about a reference to that same class
5257 reference_type
= TREE_TYPE (TREE_TYPE (*ics
));
5258 reference_type
= build_reference_type (reference_type
);
5260 if (TREE_CODE (t
) == QUAL_CONV
)
5261 t
= TREE_OPERAND (t
, 0);
5262 if (TREE_CODE (t
) == PTR_CONV
)
5263 t
= TREE_OPERAND (t
, 0);
5264 t
= build1 (IDENTITY_CONV
, TREE_TYPE (TREE_TYPE (t
)), NULL_TREE
);
5265 t
= direct_reference_binding (reference_type
, t
);
5270 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
5271 and return the type to which the reference refers. Otherwise,
5272 leave *ICS unchanged and return NULL_TREE. */
5275 maybe_handle_ref_bind (tree
*ics
)
5277 if (TREE_CODE (*ics
) == REF_BIND
)
5279 tree old_ics
= *ics
;
5280 tree type
= TREE_TYPE (TREE_TYPE (old_ics
));
5281 *ics
= TREE_OPERAND (old_ics
, 0);
5282 ICS_USER_FLAG (*ics
) = ICS_USER_FLAG (old_ics
);
5283 ICS_BAD_FLAG (*ics
) = ICS_BAD_FLAG (old_ics
);
5290 /* Compare two implicit conversion sequences according to the rules set out in
5291 [over.ics.rank]. Return values:
5293 1: ics1 is better than ics2
5294 -1: ics2 is better than ics1
5295 0: ics1 and ics2 are indistinguishable */
5298 compare_ics (tree ics1
, tree ics2
)
5304 tree deref_from_type1
= NULL_TREE
;
5305 tree deref_from_type2
= NULL_TREE
;
5306 tree deref_to_type1
= NULL_TREE
;
5307 tree deref_to_type2
= NULL_TREE
;
5310 /* REF_BINDING is nonzero if the result of the conversion sequence
5311 is a reference type. In that case TARGET_TYPE is the
5312 type referred to by the reference. */
5316 /* Handle implicit object parameters. */
5317 maybe_handle_implicit_object (&ics1
);
5318 maybe_handle_implicit_object (&ics2
);
5320 /* Handle reference parameters. */
5321 target_type1
= maybe_handle_ref_bind (&ics1
);
5322 target_type2
= maybe_handle_ref_bind (&ics2
);
5326 When comparing the basic forms of implicit conversion sequences (as
5327 defined in _over.best.ics_)
5329 --a standard conversion sequence (_over.ics.scs_) is a better
5330 conversion sequence than a user-defined conversion sequence
5331 or an ellipsis conversion sequence, and
5333 --a user-defined conversion sequence (_over.ics.user_) is a
5334 better conversion sequence than an ellipsis conversion sequence
5335 (_over.ics.ellipsis_). */
5336 rank1
= ICS_RANK (ics1
);
5337 rank2
= ICS_RANK (ics2
);
5341 else if (rank1
< rank2
)
5344 if (rank1
== BAD_RANK
)
5346 /* XXX Isn't this an extension? */
5347 /* Both ICS are bad. We try to make a decision based on what
5348 would have happenned if they'd been good. */
5349 if (ICS_USER_FLAG (ics1
) > ICS_USER_FLAG (ics2
)
5350 || ICS_STD_RANK (ics1
) > ICS_STD_RANK (ics2
))
5352 else if (ICS_USER_FLAG (ics1
) < ICS_USER_FLAG (ics2
)
5353 || ICS_STD_RANK (ics1
) < ICS_STD_RANK (ics2
))
5356 /* We couldn't make up our minds; try to figure it out below. */
5359 if (ICS_ELLIPSIS_FLAG (ics1
))
5360 /* Both conversions are ellipsis conversions. */
5363 /* User-defined conversion sequence U1 is a better conversion sequence
5364 than another user-defined conversion sequence U2 if they contain the
5365 same user-defined conversion operator or constructor and if the sec-
5366 ond standard conversion sequence of U1 is better than the second
5367 standard conversion sequence of U2. */
5369 if (ICS_USER_FLAG (ics1
))
5373 for (t1
= ics1
; TREE_CODE (t1
) != USER_CONV
; t1
= TREE_OPERAND (t1
, 0))
5374 if (TREE_CODE (t1
) == AMBIG_CONV
)
5376 for (t2
= ics2
; TREE_CODE (t2
) != USER_CONV
; t2
= TREE_OPERAND (t2
, 0))
5377 if (TREE_CODE (t2
) == AMBIG_CONV
)
5380 if (USER_CONV_FN (t1
) != USER_CONV_FN (t2
))
5383 /* We can just fall through here, after setting up
5384 FROM_TYPE1 and FROM_TYPE2. */
5385 from_type1
= TREE_TYPE (t1
);
5386 from_type2
= TREE_TYPE (t2
);
5390 /* We're dealing with two standard conversion sequences.
5394 Standard conversion sequence S1 is a better conversion
5395 sequence than standard conversion sequence S2 if
5397 --S1 is a proper subsequence of S2 (comparing the conversion
5398 sequences in the canonical form defined by _over.ics.scs_,
5399 excluding any Lvalue Transformation; the identity
5400 conversion sequence is considered to be a subsequence of
5401 any non-identity conversion sequence */
5404 while (TREE_CODE (from_type1
) != IDENTITY_CONV
)
5405 from_type1
= TREE_OPERAND (from_type1
, 0);
5406 from_type1
= TREE_TYPE (from_type1
);
5409 while (TREE_CODE (from_type2
) != IDENTITY_CONV
)
5410 from_type2
= TREE_OPERAND (from_type2
, 0);
5411 from_type2
= TREE_TYPE (from_type2
);
5414 if (same_type_p (from_type1
, from_type2
))
5416 if (is_subseq (ics1
, ics2
))
5418 if (is_subseq (ics2
, ics1
))
5421 /* Otherwise, one sequence cannot be a subsequence of the other; they
5422 don't start with the same type. This can happen when comparing the
5423 second standard conversion sequence in two user-defined conversion
5430 --the rank of S1 is better than the rank of S2 (by the rules
5433 Standard conversion sequences are ordered by their ranks: an Exact
5434 Match is a better conversion than a Promotion, which is a better
5435 conversion than a Conversion.
5437 Two conversion sequences with the same rank are indistinguishable
5438 unless one of the following rules applies:
5440 --A conversion that is not a conversion of a pointer, or pointer
5441 to member, to bool is better than another conversion that is such
5444 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
5445 so that we do not have to check it explicitly. */
5446 if (ICS_STD_RANK (ics1
) < ICS_STD_RANK (ics2
))
5448 else if (ICS_STD_RANK (ics2
) < ICS_STD_RANK (ics1
))
5451 to_type1
= TREE_TYPE (ics1
);
5452 to_type2
= TREE_TYPE (ics2
);
5454 if (TYPE_PTR_P (from_type1
)
5455 && TYPE_PTR_P (from_type2
)
5456 && TYPE_PTR_P (to_type1
)
5457 && TYPE_PTR_P (to_type2
))
5459 deref_from_type1
= TREE_TYPE (from_type1
);
5460 deref_from_type2
= TREE_TYPE (from_type2
);
5461 deref_to_type1
= TREE_TYPE (to_type1
);
5462 deref_to_type2
= TREE_TYPE (to_type2
);
5464 /* The rules for pointers to members A::* are just like the rules
5465 for pointers A*, except opposite: if B is derived from A then
5466 A::* converts to B::*, not vice versa. For that reason, we
5467 switch the from_ and to_ variables here. */
5468 else if (TYPE_PTRMEM_P (from_type1
)
5469 && TYPE_PTRMEM_P (from_type2
)
5470 && TYPE_PTRMEM_P (to_type1
)
5471 && TYPE_PTRMEM_P (to_type2
))
5473 deref_to_type1
= TYPE_OFFSET_BASETYPE (TREE_TYPE (from_type1
));
5474 deref_to_type2
= TYPE_OFFSET_BASETYPE (TREE_TYPE (from_type2
));
5475 deref_from_type1
= TYPE_OFFSET_BASETYPE (TREE_TYPE (to_type1
));
5476 deref_from_type2
= TYPE_OFFSET_BASETYPE (TREE_TYPE (to_type2
));
5478 else if (TYPE_PTRMEMFUNC_P (from_type1
)
5479 && TYPE_PTRMEMFUNC_P (from_type2
)
5480 && TYPE_PTRMEMFUNC_P (to_type1
)
5481 && TYPE_PTRMEMFUNC_P (to_type2
))
5483 deref_to_type1
= TYPE_PTRMEMFUNC_OBJECT_TYPE (from_type1
);
5484 deref_to_type2
= TYPE_PTRMEMFUNC_OBJECT_TYPE (from_type2
);
5485 deref_from_type1
= TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type1
);
5486 deref_from_type2
= TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type2
);
5489 if (deref_from_type1
!= NULL_TREE
5490 && IS_AGGR_TYPE_CODE (TREE_CODE (deref_from_type1
))
5491 && IS_AGGR_TYPE_CODE (TREE_CODE (deref_from_type2
)))
5493 /* This was one of the pointer or pointer-like conversions.
5497 --If class B is derived directly or indirectly from class A,
5498 conversion of B* to A* is better than conversion of B* to
5499 void*, and conversion of A* to void* is better than
5500 conversion of B* to void*. */
5501 if (TREE_CODE (deref_to_type1
) == VOID_TYPE
5502 && TREE_CODE (deref_to_type2
) == VOID_TYPE
)
5504 if (is_properly_derived_from (deref_from_type1
,
5507 else if (is_properly_derived_from (deref_from_type2
,
5511 else if (TREE_CODE (deref_to_type1
) == VOID_TYPE
5512 || TREE_CODE (deref_to_type2
) == VOID_TYPE
)
5514 if (same_type_p (deref_from_type1
, deref_from_type2
))
5516 if (TREE_CODE (deref_to_type2
) == VOID_TYPE
)
5518 if (is_properly_derived_from (deref_from_type1
,
5522 /* We know that DEREF_TO_TYPE1 is `void' here. */
5523 else if (is_properly_derived_from (deref_from_type1
,
5528 else if (IS_AGGR_TYPE_CODE (TREE_CODE (deref_to_type1
))
5529 && IS_AGGR_TYPE_CODE (TREE_CODE (deref_to_type2
)))
5533 --If class B is derived directly or indirectly from class A
5534 and class C is derived directly or indirectly from B,
5536 --conversion of C* to B* is better than conversion of C* to
5539 --conversion of B* to A* is better than conversion of C* to
5541 if (same_type_p (deref_from_type1
, deref_from_type2
))
5543 if (is_properly_derived_from (deref_to_type1
,
5546 else if (is_properly_derived_from (deref_to_type2
,
5550 else if (same_type_p (deref_to_type1
, deref_to_type2
))
5552 if (is_properly_derived_from (deref_from_type2
,
5555 else if (is_properly_derived_from (deref_from_type1
,
5561 else if (CLASS_TYPE_P (non_reference (from_type1
))
5562 && same_type_p (from_type1
, from_type2
))
5564 tree from
= non_reference (from_type1
);
5568 --binding of an expression of type C to a reference of type
5569 B& is better than binding an expression of type C to a
5570 reference of type A&
5572 --conversion of C to B is better than conversion of C to A, */
5573 if (is_properly_derived_from (from
, to_type1
)
5574 && is_properly_derived_from (from
, to_type2
))
5576 if (is_properly_derived_from (to_type1
, to_type2
))
5578 else if (is_properly_derived_from (to_type2
, to_type1
))
5582 else if (CLASS_TYPE_P (non_reference (to_type1
))
5583 && same_type_p (to_type1
, to_type2
))
5585 tree to
= non_reference (to_type1
);
5589 --binding of an expression of type B to a reference of type
5590 A& is better than binding an expression of type C to a
5591 reference of type A&,
5593 --onversion of B to A is better than conversion of C to A */
5594 if (is_properly_derived_from (from_type1
, to
)
5595 && is_properly_derived_from (from_type2
, to
))
5597 if (is_properly_derived_from (from_type2
, from_type1
))
5599 else if (is_properly_derived_from (from_type1
, from_type2
))
5606 --S1 and S2 differ only in their qualification conversion and yield
5607 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
5608 qualification signature of type T1 is a proper subset of the cv-
5609 qualification signature of type T2 */
5610 if (TREE_CODE (ics1
) == QUAL_CONV
5611 && TREE_CODE (ics2
) == QUAL_CONV
5612 && same_type_p (from_type1
, from_type2
))
5613 return comp_cv_qual_signature (to_type1
, to_type2
);
5617 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
5618 types to which the references refer are the same type except for
5619 top-level cv-qualifiers, and the type to which the reference
5620 initialized by S2 refers is more cv-qualified than the type to
5621 which the reference initialized by S1 refers */
5623 if (target_type1
&& target_type2
5624 && same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
5625 return comp_cv_qualification (target_type2
, target_type1
);
5627 /* Neither conversion sequence is better than the other. */
5631 /* The source type for this standard conversion sequence. */
5634 source_type (tree t
)
5636 for (;; t
= TREE_OPERAND (t
, 0))
5638 if (TREE_CODE (t
) == USER_CONV
5639 || TREE_CODE (t
) == AMBIG_CONV
5640 || TREE_CODE (t
) == IDENTITY_CONV
)
5641 return TREE_TYPE (t
);
5646 /* Note a warning about preferring WINNER to LOSER. We do this by storing
5647 a pointer to LOSER and re-running joust to produce the warning if WINNER
5648 is actually used. */
5651 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
5653 winner
->warnings
= tree_cons (NULL_TREE
,
5654 build_zc_wrapper (loser
),
5658 /* Compare two candidates for overloading as described in
5659 [over.match.best]. Return values:
5661 1: cand1 is better than cand2
5662 -1: cand2 is better than cand1
5663 0: cand1 and cand2 are indistinguishable */
5666 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
)
5669 int i
, off1
= 0, off2
= 0, len
;
5671 /* Candidates that involve bad conversions are always worse than those
5673 if (cand1
->viable
> cand2
->viable
)
5675 if (cand1
->viable
< cand2
->viable
)
5678 /* If we have two pseudo-candidates for conversions to the same type,
5679 or two candidates for the same function, arbitrarily pick one. */
5680 if (cand1
->fn
== cand2
->fn
5681 && (TYPE_P (cand1
->fn
) || DECL_P (cand1
->fn
)))
5684 /* a viable function F1
5685 is defined to be a better function than another viable function F2 if
5686 for all arguments i, ICSi(F1) is not a worse conversion sequence than
5687 ICSi(F2), and then */
5689 /* for some argument j, ICSj(F1) is a better conversion sequence than
5692 /* For comparing static and non-static member functions, we ignore
5693 the implicit object parameter of the non-static function. The
5694 standard says to pretend that the static function has an object
5695 parm, but that won't work with operator overloading. */
5696 len
= TREE_VEC_LENGTH (cand1
->convs
);
5697 if (len
!= TREE_VEC_LENGTH (cand2
->convs
))
5699 if (DECL_STATIC_FUNCTION_P (cand1
->fn
)
5700 && ! DECL_STATIC_FUNCTION_P (cand2
->fn
))
5702 else if (! DECL_STATIC_FUNCTION_P (cand1
->fn
)
5703 && DECL_STATIC_FUNCTION_P (cand2
->fn
))
5712 for (i
= 0; i
< len
; ++i
)
5714 tree t1
= TREE_VEC_ELT (cand1
->convs
, i
+off1
);
5715 tree t2
= TREE_VEC_ELT (cand2
->convs
, i
+off2
);
5716 int comp
= compare_ics (t1
, t2
);
5721 && ICS_RANK (t1
) + ICS_RANK (t2
) == STD_RANK
+ PROMO_RANK
5722 && TREE_CODE (t1
) == STD_CONV
5723 && TREE_CODE (t2
) == STD_CONV
5724 && TREE_CODE (TREE_TYPE (t1
)) == INTEGER_TYPE
5725 && TREE_CODE (TREE_TYPE (t2
)) == INTEGER_TYPE
5726 && (TYPE_PRECISION (TREE_TYPE (t1
))
5727 == TYPE_PRECISION (TREE_TYPE (t2
)))
5728 && (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (t1
, 0)))
5729 || (TREE_CODE (TREE_TYPE (TREE_OPERAND (t1
, 0)))
5732 tree type
= TREE_TYPE (TREE_OPERAND (t1
, 0));
5734 struct z_candidate
*w
, *l
;
5736 type1
= TREE_TYPE (t1
), type2
= TREE_TYPE (t2
),
5737 w
= cand1
, l
= cand2
;
5739 type1
= TREE_TYPE (t2
), type2
= TREE_TYPE (t1
),
5740 w
= cand2
, l
= cand1
;
5744 warning ("passing `%T' chooses `%T' over `%T'",
5745 type
, type1
, type2
);
5746 warning (" in call to `%D'", w
->fn
);
5752 if (winner
&& comp
!= winner
)
5761 /* warn about confusing overload resolution for user-defined conversions,
5762 either between a constructor and a conversion op, or between two
5764 if (winner
&& cand1
->second_conv
5765 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
5766 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
5768 struct z_candidate
*w
, *l
;
5769 bool give_warning
= false;
5772 w
= cand1
, l
= cand2
;
5774 w
= cand2
, l
= cand1
;
5776 /* We don't want to complain about `X::operator T1 ()'
5777 beating `X::operator T2 () const', when T2 is a no less
5778 cv-qualified version of T1. */
5779 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
5780 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
5782 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
5783 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
5785 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
5790 if (!comp_ptr_ttypes (t
, f
))
5791 give_warning
= true;
5794 give_warning
= true;
5800 tree source
= source_type (TREE_VEC_ELT (w
->convs
, 0));
5801 if (! DECL_CONSTRUCTOR_P (w
->fn
))
5802 source
= TREE_TYPE (source
);
5803 warning ("choosing `%D' over `%D'", w
->fn
, l
->fn
);
5804 warning (" for conversion from `%T' to `%T'",
5805 source
, TREE_TYPE (w
->second_conv
));
5806 warning (" because conversion sequence for the argument is better");
5816 F1 is a non-template function and F2 is a template function
5819 if (! cand1
->template && cand2
->template)
5821 else if (cand1
->template && ! cand2
->template)
5825 F1 and F2 are template functions and the function template for F1 is
5826 more specialized than the template for F2 according to the partial
5829 if (cand1
->template && cand2
->template)
5831 winner
= more_specialized
5832 (TI_TEMPLATE (cand1
->template), TI_TEMPLATE (cand2
->template),
5834 /* Tell the deduction code how many real function arguments
5835 we saw, not counting the implicit 'this' argument. But,
5836 add_function_candidate() suppresses the "this" argument
5839 [temp.func.order]: The presence of unused ellipsis and default
5840 arguments has no effect on the partial ordering of function
5842 TREE_VEC_LENGTH (cand1
->convs
)
5843 - (DECL_NONSTATIC_MEMBER_FUNCTION_P (cand1
->fn
)
5844 - DECL_CONSTRUCTOR_P (cand1
->fn
)));
5850 the context is an initialization by user-defined conversion (see
5851 _dcl.init_ and _over.match.user_) and the standard conversion
5852 sequence from the return type of F1 to the destination type (i.e.,
5853 the type of the entity being initialized) is a better conversion
5854 sequence than the standard conversion sequence from the return type
5855 of F2 to the destination type. */
5857 if (cand1
->second_conv
)
5859 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
5864 /* Check whether we can discard a builtin candidate, either because we
5865 have two identical ones or matching builtin and non-builtin candidates.
5867 (Pedantically in the latter case the builtin which matched the user
5868 function should not be added to the overload set, but we spot it here.
5871 ... the builtin candidates include ...
5872 - do not have the same parameter type list as any non-template
5873 non-member candidate. */
5875 if (TREE_CODE (cand1
->fn
) == IDENTIFIER_NODE
5876 || TREE_CODE (cand2
->fn
) == IDENTIFIER_NODE
)
5878 for (i
= 0; i
< len
; ++i
)
5879 if (!same_type_p (TREE_TYPE (TREE_VEC_ELT (cand1
->convs
, i
)),
5880 TREE_TYPE (TREE_VEC_ELT (cand2
->convs
, i
))))
5882 if (i
== TREE_VEC_LENGTH (cand1
->convs
))
5884 if (cand1
->fn
== cand2
->fn
)
5885 /* Two built-in candidates; arbitrarily pick one. */
5887 else if (TREE_CODE (cand1
->fn
) == IDENTIFIER_NODE
)
5888 /* cand1 is built-in; prefer cand2. */
5891 /* cand2 is built-in; prefer cand1. */
5896 /* If the two functions are the same (this can happen with declarations
5897 in multiple scopes and arg-dependent lookup), arbitrarily choose one. */
5898 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
5899 && equal_functions (cand1
->fn
, cand2
->fn
))
5904 /* Extension: If the worst conversion for one candidate is worse than the
5905 worst conversion for the other, take the first. */
5908 int rank1
= IDENTITY_RANK
, rank2
= IDENTITY_RANK
;
5909 struct z_candidate
*w
= 0, *l
= 0;
5911 for (i
= 0; i
< len
; ++i
)
5913 if (ICS_RANK (TREE_VEC_ELT (cand1
->convs
, i
+off1
)) > rank1
)
5914 rank1
= ICS_RANK (TREE_VEC_ELT (cand1
->convs
, i
+off1
));
5915 if (ICS_RANK (TREE_VEC_ELT (cand2
->convs
, i
+off2
)) > rank2
)
5916 rank2
= ICS_RANK (TREE_VEC_ELT (cand2
->convs
, i
+off2
));
5919 winner
= 1, w
= cand1
, l
= cand2
;
5921 winner
= -1, w
= cand2
, l
= cand1
;
5927 ISO C++ says that these are ambiguous, even \
5928 though the worst conversion for the first is better than \
5929 the worst conversion for the second:");
5930 print_z_candidate (_("candidate 1:"), w
);
5931 print_z_candidate (_("candidate 2:"), l
);
5939 my_friendly_assert (!winner
, 20010121);
5943 /* Given a list of candidates for overloading, find the best one, if any.
5944 This algorithm has a worst case of O(2n) (winner is last), and a best
5945 case of O(n/2) (totally ambiguous); much better than a sorting
5948 static struct z_candidate
*
5949 tourney (struct z_candidate
*candidates
)
5951 struct z_candidate
*champ
= candidates
, *challenger
;
5953 int champ_compared_to_predecessor
= 0;
5955 /* Walk through the list once, comparing each current champ to the next
5956 candidate, knocking out a candidate or two with each comparison. */
5958 for (challenger
= champ
->next
; challenger
; )
5960 fate
= joust (champ
, challenger
, 0);
5962 challenger
= challenger
->next
;
5967 champ
= challenger
->next
;
5970 champ_compared_to_predecessor
= 0;
5975 champ_compared_to_predecessor
= 1;
5978 challenger
= champ
->next
;
5982 /* Make sure the champ is better than all the candidates it hasn't yet
5983 been compared to. */
5985 for (challenger
= candidates
;
5987 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
5988 challenger
= challenger
->next
)
5990 fate
= joust (champ
, challenger
, 0);
5998 /* Returns nonzero if things of type FROM can be converted to TO. */
6001 can_convert (tree to
, tree from
)
6003 return can_convert_arg (to
, from
, NULL_TREE
);
6006 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
6009 can_convert_arg (tree to
, tree from
, tree arg
)
6011 tree t
= implicit_conversion (to
, from
, arg
, LOOKUP_NORMAL
);
6012 return (t
&& ! ICS_BAD_FLAG (t
));
6015 /* Like can_convert_arg, but allows dubious conversions as well. */
6018 can_convert_arg_bad (tree to
, tree from
, tree arg
)
6020 return implicit_conversion (to
, from
, arg
, LOOKUP_NORMAL
) != 0;
6023 /* Convert EXPR to TYPE. Return the converted expression.
6025 Note that we allow bad conversions here because by the time we get to
6026 this point we are committed to doing the conversion. If we end up
6027 doing a bad conversion, convert_like will complain. */
6030 perform_implicit_conversion (tree type
, tree expr
)
6034 if (error_operand_p (expr
))
6035 return error_mark_node
;
6036 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
6040 error ("could not convert `%E' to `%T'", expr
, type
);
6041 return error_mark_node
;
6044 return convert_like (conv
, expr
);
6047 /* DECL is a VAR_DECL whose type is a REFERENCE_TYPE. The reference
6048 is being bound to a temporary. Create and return a new VAR_DECL
6049 with the indicated TYPE; this variable will store the value to
6050 which the reference is bound. */
6053 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
6057 /* Create the variable. */
6058 var
= build_decl (VAR_DECL
, NULL_TREE
, type
);
6059 DECL_ARTIFICIAL (var
) = 1;
6060 TREE_USED (var
) = 1;
6062 /* Register the variable. */
6063 if (TREE_STATIC (decl
))
6065 /* Namespace-scope or local static; give it a mangled name. */
6068 TREE_STATIC (var
) = 1;
6069 name
= mangle_ref_init_variable (decl
);
6070 DECL_NAME (var
) = name
;
6071 SET_DECL_ASSEMBLER_NAME (var
, name
);
6072 var
= pushdecl_top_level (var
);
6076 /* Create a new cleanup level if necessary. */
6077 maybe_push_cleanup_level (type
);
6078 /* Don't push unnamed temps. Do set DECL_CONTEXT, though. */
6079 DECL_CONTEXT (var
) = current_function_decl
;
6085 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
6086 initializing a variable of that TYPE. If DECL is non-NULL, it is
6087 the VAR_DECL being initialized with the EXPR. (In that case, the
6088 type of DECL will be TYPE.)
6090 Return the converted expression. */
6093 initialize_reference (tree type
, tree expr
, tree decl
)
6097 if (type
== error_mark_node
|| error_operand_p (expr
))
6098 return error_mark_node
;
6100 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, LOOKUP_NORMAL
);
6101 if (!conv
|| ICS_BAD_FLAG (conv
))
6103 error ("could not convert `%E' to `%T'", expr
, type
);
6104 return error_mark_node
;
6107 /* If DECL is non-NULL, then this special rule applies:
6111 The temporary to which the reference is bound or the temporary
6112 that is the complete object to which the reference is bound
6113 persists for the lifetime of the reference.
6115 The temporaries created during the evaluation of the expression
6116 initializing the reference, except the temporary to which the
6117 reference is bound, are destroyed at the end of the
6118 full-expression in which they are created.
6120 In that case, we store the converted expression into a new
6121 VAR_DECL in a new scope.
6123 However, we want to be careful not to create temporaries when
6124 they are not required. For example, given:
6127 struct D : public B {};
6131 there is no need to copy the return value from "f"; we can just
6132 extend its lifetime. Similarly, given:
6135 struct T { operator S(); };
6139 we can extend the lifetime of the returnn value of the conversion
6141 my_friendly_assert (TREE_CODE (conv
) == REF_BIND
, 20030302);
6145 tree base_conv_type
;
6147 /* Skip over the REF_BIND. */
6148 conv
= TREE_OPERAND (conv
, 0);
6149 /* If the next conversion is a BASE_CONV, skip that too -- but
6150 remember that the conversion was required. */
6151 if (TREE_CODE (conv
) == BASE_CONV
&& !NEED_TEMPORARY_P (conv
))
6153 base_conv_type
= TREE_TYPE (conv
);
6154 conv
= TREE_OPERAND (conv
, 0);
6157 base_conv_type
= NULL_TREE
;
6158 /* Perform the remainder of the conversion. */
6159 expr
= convert_like (conv
, expr
);
6160 if (!real_non_cast_lvalue_p (expr
))
6162 /* Create the temporary variable. */
6163 var
= make_temporary_var_for_ref_to_temp (decl
, TREE_TYPE (expr
));
6164 DECL_INITIAL (var
) = expr
;
6165 cp_finish_decl (var
, expr
, NULL_TREE
,
6166 LOOKUP_ONLYCONVERTING
|DIRECT_BIND
);
6167 /* Use its address to initialize the reference variable. */
6168 expr
= build_address (var
);
6171 /* Take the address of EXPR. */
6172 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
6173 /* If a BASE_CONV was required, perform it now. */
6175 expr
= (perform_implicit_conversion
6176 (build_pointer_type (base_conv_type
), expr
));
6177 return build_nop (type
, expr
);
6180 /* Perform the conversion. */
6181 return convert_like (conv
, expr
);
6184 #include "gt-cp-call.h"