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"
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 /*issue_conversion_warnings=*/true)
53 #define convert_like_with_context(CONV, EXPR, FN, ARGNO) \
54 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
55 /*issue_conversion_warnings=*/true)
56 static tree convert_like_real (tree, tree, tree, int, int, bool);
57 static void op_error (enum tree_code, enum tree_code, tree, tree,
59 static tree build_object_call (tree, tree);
60 static tree resolve_args (tree);
61 static struct z_candidate *build_user_type_conversion_1 (tree, tree, int);
62 static void print_z_candidate (const char *, struct z_candidate *);
63 static void print_z_candidates (struct z_candidate *);
64 static tree build_this (tree);
65 static struct z_candidate *splice_viable (struct z_candidate *, bool, bool *);
66 static bool any_strictly_viable (struct z_candidate *);
67 static struct z_candidate *add_template_candidate
68 (struct z_candidate **, tree, tree, tree, tree, tree,
69 tree, tree, int, unification_kind_t);
70 static struct z_candidate *add_template_candidate_real
71 (struct z_candidate **, tree, tree, tree, tree, tree,
72 tree, tree, int, tree, unification_kind_t);
73 static struct z_candidate *add_template_conv_candidate
74 (struct z_candidate **, tree, tree, tree, tree, tree, tree);
75 static void add_builtin_candidates
76 (struct z_candidate **, enum tree_code, enum tree_code,
78 static void add_builtin_candidate
79 (struct z_candidate **, enum tree_code, enum tree_code,
80 tree, tree, tree, tree *, tree *, int);
81 static bool is_complete (tree);
82 static void build_builtin_candidate
83 (struct z_candidate **, tree, tree, tree, tree *, tree *,
85 static struct z_candidate *add_conv_candidate
86 (struct z_candidate **, tree, tree, tree, tree, tree);
87 static struct z_candidate *add_function_candidate
88 (struct z_candidate **, tree, tree, tree, tree, tree, int);
89 static tree implicit_conversion (tree, tree, tree, int);
90 static tree standard_conversion (tree, tree, tree);
91 static tree reference_binding (tree, tree, tree, int);
92 static tree build_conv (enum tree_code, tree, tree);
93 static bool is_subseq (tree, tree);
94 static tree maybe_handle_ref_bind (tree *);
95 static void maybe_handle_implicit_object (tree *);
96 static struct z_candidate *add_candidate
97 (struct z_candidate **, tree, tree, tree, tree, tree, int);
98 static tree source_type (tree);
99 static void add_warning (struct z_candidate *, struct z_candidate *);
100 static bool reference_related_p (tree, tree);
101 static bool reference_compatible_p (tree, tree);
102 static tree convert_class_to_reference (tree, tree, tree);
103 static tree direct_reference_binding (tree, tree);
104 static bool promoted_arithmetic_type_p (tree);
105 static tree conditional_conversion (tree, tree);
106 static char *name_as_c_string (tree, tree, bool *);
107 static tree call_builtin_trap (void);
108 static tree prep_operand (tree);
109 static void add_candidates (tree, tree, tree, bool, tree, tree,
110 int, struct z_candidate **);
111 static tree merge_conversion_sequences (tree, tree);
114 build_vfield_ref (tree datum, tree type)
116 if (datum == error_mark_node)
117 return error_mark_node;
119 if (TREE_CODE (TREE_TYPE (datum)) == REFERENCE_TYPE)
120 datum = convert_from_reference (datum);
122 if (TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type)
123 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum), type))
124 datum = convert_to_base (datum, type, /*check_access=*/false);
126 return build (COMPONENT_REF, TREE_TYPE (TYPE_VFIELD (type)),
127 datum, TYPE_VFIELD (type));
130 /* Build a call to a member of an object. I.e., one that overloads
131 operator ()(), or is a pointer-to-function or pointer-to-method. */
134 build_field_call (tree instance_ptr, tree decl, tree parms)
138 if (decl == error_mark_node || decl == NULL_TREE)
141 if (TREE_CODE (decl) == FIELD_DECL || TREE_CODE (decl) == VAR_DECL)
143 /* If it's a field, try overloading operator (),
144 or calling if the field is a pointer-to-function. */
145 instance = build_indirect_ref (instance_ptr, NULL);
146 instance = build_class_member_access_expr (instance, decl,
147 /*access_path=*/NULL_TREE,
148 /*preserve_reference=*/false);
150 if (instance == error_mark_node)
151 return error_mark_node;
153 if (IS_AGGR_TYPE (TREE_TYPE (instance)))
154 return build_new_op (CALL_EXPR, LOOKUP_NORMAL,
155 instance, parms, NULL_TREE);
156 else if (TREE_CODE (TREE_TYPE (instance)) == FUNCTION_TYPE
157 || (TREE_CODE (TREE_TYPE (instance)) == POINTER_TYPE
158 && (TREE_CODE (TREE_TYPE (TREE_TYPE (instance)))
160 return build_function_call (instance, parms);
166 /* Returns nonzero iff the destructor name specified in NAME
167 (a BIT_NOT_EXPR) matches BASETYPE. The operand of NAME can take many
171 check_dtor_name (tree basetype, tree name)
173 name = TREE_OPERAND (name, 0);
175 /* Just accept something we've already complained about. */
176 if (name == error_mark_node)
179 if (TREE_CODE (name) == TYPE_DECL)
180 name = TREE_TYPE (name);
181 else if (TYPE_P (name))
183 else if (TREE_CODE (name) == IDENTIFIER_NODE)
185 if ((IS_AGGR_TYPE (basetype) && name == constructor_name (basetype))
186 || (TREE_CODE (basetype) == ENUMERAL_TYPE
187 && name == TYPE_IDENTIFIER (basetype)))
190 name = get_type_value (name);
194 template <class T> struct S { ~S(); };
198 NAME will be a class template. */
199 else if (DECL_CLASS_TEMPLATE_P (name))
204 if (name && TYPE_MAIN_VARIANT (basetype) == TYPE_MAIN_VARIANT (name))
209 /* We want the address of a function or method. We avoid creating a
210 pointer-to-member function. */
213 build_addr_func (tree function)
215 tree type = TREE_TYPE (function);
217 /* We have to do these by hand to avoid real pointer to member
219 if (TREE_CODE (type) == METHOD_TYPE)
221 if (TREE_CODE (function) == OFFSET_REF)
223 tree object = build_address (TREE_OPERAND (function, 0));
224 return get_member_function_from_ptrfunc (&object,
225 TREE_OPERAND (function, 1));
227 function = build_address (function);
230 function = decay_conversion (function);
235 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
236 POINTER_TYPE to those. Note, pointer to member function types
237 (TYPE_PTRMEMFUNC_P) must be handled by our callers. */
240 build_call (tree function, tree parms)
242 int is_constructor = 0;
249 function = build_addr_func (function);
251 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function)))
253 sorry ("unable to call pointer to member function here");
254 return error_mark_node;
257 fntype = TREE_TYPE (TREE_TYPE (function));
258 result_type = TREE_TYPE (fntype);
260 if (TREE_CODE (function) == ADDR_EXPR
261 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
262 decl = TREE_OPERAND (function, 0);
266 /* We check both the decl and the type; a function may be known not to
267 throw without being declared throw(). */
268 nothrow = ((decl && TREE_NOTHROW (decl))
269 || TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (function))));
271 if (decl && TREE_THIS_VOLATILE (decl) && cfun)
272 current_function_returns_abnormally = 1;
274 if (decl && TREE_DEPRECATED (decl))
275 warn_deprecated_use (decl);
276 require_complete_eh_spec_types (fntype, decl);
278 if (decl && DECL_CONSTRUCTOR_P (decl))
281 if (decl && ! TREE_USED (decl))
283 /* We invoke build_call directly for several library functions.
284 These may have been declared normally if we're building libgcc,
285 so we can't just check DECL_ARTIFICIAL. */
286 if (DECL_ARTIFICIAL (decl)
287 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl)), "__", 2))
293 /* Don't pass empty class objects by value. This is useful
294 for tags in STL, which are used to control overload resolution.
295 We don't need to handle other cases of copying empty classes. */
296 if (! decl || ! DECL_BUILT_IN (decl))
297 for (tmp = parms; tmp; tmp = TREE_CHAIN (tmp))
298 if (is_empty_class (TREE_TYPE (TREE_VALUE (tmp)))
299 && ! TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (tmp))))
301 tree t = build (EMPTY_CLASS_EXPR, TREE_TYPE (TREE_VALUE (tmp)));
302 TREE_VALUE (tmp) = build (COMPOUND_EXPR, TREE_TYPE (t),
303 TREE_VALUE (tmp), t);
306 function = build (CALL_EXPR, result_type, function, parms);
307 TREE_HAS_CONSTRUCTOR (function) = is_constructor;
308 TREE_NOTHROW (function) = nothrow;
313 /* Build something of the form ptr->method (args)
314 or object.method (args). This can also build
315 calls to constructors, and find friends.
317 Member functions always take their class variable
320 INSTANCE is a class instance.
322 NAME is the name of the method desired, usually an IDENTIFIER_NODE.
324 PARMS help to figure out what that NAME really refers to.
326 BASETYPE_PATH, if non-NULL, contains a chain from the type of INSTANCE
327 down to the real instance type to use for access checking. We need this
328 information to get protected accesses correct.
330 FLAGS is the logical disjunction of zero or more LOOKUP_
331 flags. See cp-tree.h for more info.
333 If this is all OK, calls build_function_call with the resolved
336 This function must also handle being called to perform
337 initialization, promotion/coercion of arguments, and
338 instantiation of default parameters.
340 Note that NAME may refer to an instance variable name. If
341 `operator()()' is defined for the type of that field, then we return
344 #ifdef GATHER_STATISTICS
345 extern int n_build_method_call;
349 build_method_call (tree instance, tree name, tree parms,
350 tree basetype_path, int flags)
354 tree template_args = NULL_TREE;
355 bool has_template_args = false;
357 #ifdef GATHER_STATISTICS
358 n_build_method_call++;
361 if (error_operand_p (instance)
362 || name == error_mark_node
363 || parms == error_mark_node)
364 return error_mark_node;
366 my_friendly_assert (!processing_template_decl, 20030707);
368 if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE)
369 instance = convert_from_reference (instance);
370 object_type = TREE_TYPE (instance);
372 if (TREE_CODE (name) == BIT_NOT_EXPR)
377 error ("destructors take no parameters");
379 if (! check_dtor_name (object_type, name))
381 ("destructor name `~%T' does not match type `%T' of expression",
382 TREE_OPERAND (name, 0), object_type);
384 if (! TYPE_HAS_DESTRUCTOR (complete_type (object_type)))
385 return convert_to_void (instance, /*implicit=*/NULL);
386 instance = default_conversion (instance);
387 instance_ptr = build_unary_op (ADDR_EXPR, instance, 0);
388 return build_delete (build_pointer_type (object_type),
389 instance_ptr, sfk_complete_destructor,
390 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 0);
393 if (!CLASS_TYPE_P (object_type))
395 if ((flags & LOOKUP_COMPLAIN)
396 && TREE_TYPE (instance) != error_mark_node)
397 error ("request for member `%D' in `%E', which is of non-aggregate type `%T'",
398 name, instance, object_type);
399 return error_mark_node;
402 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
404 template_args = TREE_OPERAND (name, 1);
405 has_template_args = true;
406 name = TREE_OPERAND (name, 0);
408 if (TREE_CODE (name) == OVERLOAD)
409 name = DECL_NAME (get_first_fn (name));
410 else if (DECL_P (name))
411 name = DECL_NAME (name);
412 if (has_template_args)
413 fn = lookup_fnfields (object_type, name, /*protect=*/2);
415 fn = lookup_member (object_type, name, /*protect=*/2, /*want_type=*/false);
417 if (fn && TREE_CODE (fn) == TREE_LIST)
419 error ("request for member `%D' is ambiguous", name);
420 print_candidates (fn);
421 return error_mark_node;
424 /* If the name could not be found, issue an error. */
426 return unqualified_name_lookup_error (name);
428 if (BASELINK_P (fn) && has_template_args)
429 BASELINK_FUNCTIONS (fn)
430 = build_nt (TEMPLATE_ID_EXPR,
431 BASELINK_FUNCTIONS (fn),
433 if (BASELINK_P (fn) && basetype_path)
434 BASELINK_ACCESS_BINFO (fn) = basetype_path;
436 return build_new_method_call (instance, fn, parms,
437 /*conversion_path=*/NULL_TREE, flags);
440 /* New overloading code. */
442 struct z_candidate GTY(()) {
443 /* The FUNCTION_DECL that will be called if this candidate is
444 selected by overload resolution. */
446 /* The arguments to use when calling this function. */
448 /* The implicit conversion sequences for each of the arguments to
451 /* If FN is a user-defined conversion, the standard conversion
452 sequence from the type returned by FN to the desired destination
456 /* If FN is a member function, the binfo indicating the path used to
457 qualify the name of FN at the call site. This path is used to
458 determine whether or not FN is accessible if it is selected by
459 overload resolution. The DECL_CONTEXT of FN will always be a
460 (possibly improper) base of this binfo. */
462 /* If FN is a non-static member function, the binfo indicating the
463 subobject to which the `this' pointer should be converted if FN
464 is selected by overload resolution. The type pointed to the by
465 the `this' pointer must correspond to the most derived class
466 indicated by the CONVERSION_PATH. */
467 tree conversion_path;
470 struct z_candidate *next;
473 #define IDENTITY_RANK 0
479 #define ELLIPSIS_RANK 6
482 #define ICS_RANK(NODE) \
483 (ICS_BAD_FLAG (NODE) ? BAD_RANK \
484 : ICS_ELLIPSIS_FLAG (NODE) ? ELLIPSIS_RANK \
485 : ICS_USER_FLAG (NODE) ? USER_RANK \
486 : ICS_STD_RANK (NODE))
488 #define ICS_STD_RANK(NODE) TREE_COMPLEXITY (NODE)
490 #define ICS_USER_FLAG(NODE) TREE_LANG_FLAG_0 (NODE)
491 #define ICS_ELLIPSIS_FLAG(NODE) TREE_LANG_FLAG_1 (NODE)
492 #define ICS_THIS_FLAG(NODE) TREE_LANG_FLAG_2 (NODE)
493 #define ICS_BAD_FLAG(NODE) TREE_LANG_FLAG_3 (NODE)
495 /* In a REF_BIND or a BASE_CONV, this indicates that a temporary
496 should be created to hold the result of the conversion. */
497 #define NEED_TEMPORARY_P(NODE) TREE_LANG_FLAG_4 (NODE)
499 #define USER_CONV_CAND(NODE) WRAPPER_ZC (TREE_OPERAND (NODE, 1))
500 #define USER_CONV_FN(NODE) (USER_CONV_CAND (NODE)->fn)
503 null_ptr_cst_p (tree t)
507 A null pointer constant is an integral constant expression
508 (_expr.const_) rvalue of integer type that evaluates to zero. */
510 || (CP_INTEGRAL_TYPE_P (TREE_TYPE (t)) && integer_zerop (t)))
516 /* Returns nonzero if PARMLIST consists of only default parms and/or
520 sufficient_parms_p (tree parmlist)
522 for (; parmlist && parmlist != void_list_node;
523 parmlist = TREE_CHAIN (parmlist))
524 if (!TREE_PURPOSE (parmlist))
530 build_conv (enum tree_code code, tree type, tree from)
533 int rank = ICS_STD_RANK (from);
535 /* We can't use buildl1 here because CODE could be USER_CONV, which
536 takes two arguments. In that case, the caller is responsible for
537 filling in the second argument. */
538 t = make_node (code);
539 TREE_TYPE (t) = type;
540 TREE_OPERAND (t, 0) = from;
553 if (rank < EXACT_RANK)
559 ICS_STD_RANK (t) = rank;
560 ICS_USER_FLAG (t) = (code == USER_CONV || ICS_USER_FLAG (from));
561 ICS_BAD_FLAG (t) = ICS_BAD_FLAG (from);
566 strip_top_quals (tree t)
568 if (TREE_CODE (t) == ARRAY_TYPE)
570 return cp_build_qualified_type (t, 0);
573 /* Returns the standard conversion path (see [conv]) from type FROM to type
574 TO, if any. For proper handling of null pointer constants, you must
575 also pass the expression EXPR to convert from. */
578 standard_conversion (tree to, tree from, tree expr)
580 enum tree_code fcode, tcode;
582 bool fromref = false;
584 to = non_reference (to);
585 if (TREE_CODE (from) == REFERENCE_TYPE)
588 from = TREE_TYPE (from);
590 to = strip_top_quals (to);
591 from = strip_top_quals (from);
593 if ((TYPE_PTRFN_P (to) || TYPE_PTRMEMFUNC_P (to))
594 && expr && type_unknown_p (expr))
596 expr = instantiate_type (to, expr, tf_none);
597 if (expr == error_mark_node)
599 from = TREE_TYPE (expr);
602 fcode = TREE_CODE (from);
603 tcode = TREE_CODE (to);
605 conv = build1 (IDENTITY_CONV, from, expr);
607 if (fcode == FUNCTION_TYPE)
609 from = build_pointer_type (from);
610 fcode = TREE_CODE (from);
611 conv = build_conv (LVALUE_CONV, from, conv);
613 else if (fcode == ARRAY_TYPE)
615 from = build_pointer_type (TREE_TYPE (from));
616 fcode = TREE_CODE (from);
617 conv = build_conv (LVALUE_CONV, from, conv);
619 else if (fromref || (expr && lvalue_p (expr)))
620 conv = build_conv (RVALUE_CONV, from, conv);
622 /* Allow conversion between `__complex__' data types */
623 if (tcode == COMPLEX_TYPE && fcode == COMPLEX_TYPE)
625 /* The standard conversion sequence to convert FROM to TO is
626 the standard conversion sequence to perform componentwise
628 tree part_conv = standard_conversion
629 (TREE_TYPE (to), TREE_TYPE (from), NULL_TREE);
633 conv = build_conv (TREE_CODE (part_conv), to, conv);
634 ICS_STD_RANK (conv) = ICS_STD_RANK (part_conv);
642 if (same_type_p (from, to))
645 if ((tcode == POINTER_TYPE || TYPE_PTR_TO_MEMBER_P (to))
646 && expr && null_ptr_cst_p (expr))
647 conv = build_conv (STD_CONV, to, conv);
648 else if (tcode == POINTER_TYPE && fcode == POINTER_TYPE
649 && TREE_CODE (TREE_TYPE (to)) == VECTOR_TYPE
650 && TREE_CODE (TREE_TYPE (from)) == VECTOR_TYPE
651 && ((*targetm.vector_opaque_p) (TREE_TYPE (to))
652 || (*targetm.vector_opaque_p) (TREE_TYPE (from))))
653 conv = build_conv (STD_CONV, to, conv);
654 else if ((tcode == INTEGER_TYPE && fcode == POINTER_TYPE)
655 || (tcode == POINTER_TYPE && fcode == INTEGER_TYPE))
657 /* For backwards brain damage compatibility, allow interconversion of
658 pointers and integers with a pedwarn. */
659 conv = build_conv (STD_CONV, to, conv);
660 ICS_BAD_FLAG (conv) = 1;
662 else if (tcode == ENUMERAL_TYPE && fcode == INTEGER_TYPE)
664 /* For backwards brain damage compatibility, allow interconversion of
665 enums and integers with a pedwarn. */
666 conv = build_conv (STD_CONV, to, conv);
667 ICS_BAD_FLAG (conv) = 1;
669 else if ((tcode == POINTER_TYPE && fcode == POINTER_TYPE)
670 || (TYPE_PTRMEM_P (to) && TYPE_PTRMEM_P (from)))
675 if (tcode == POINTER_TYPE
676 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from),
679 else if (VOID_TYPE_P (TREE_TYPE (to))
680 && !TYPE_PTRMEM_P (from)
681 && TREE_CODE (TREE_TYPE (from)) != FUNCTION_TYPE)
683 from = build_pointer_type
684 (cp_build_qualified_type (void_type_node,
685 cp_type_quals (TREE_TYPE (from))));
686 conv = build_conv (PTR_CONV, from, conv);
688 else if (TYPE_PTRMEM_P (from))
690 tree fbase = TYPE_PTRMEM_CLASS_TYPE (from);
691 tree tbase = TYPE_PTRMEM_CLASS_TYPE (to);
693 if (DERIVED_FROM_P (fbase, tbase)
694 && (same_type_ignoring_top_level_qualifiers_p
695 (TYPE_PTRMEM_POINTED_TO_TYPE (from),
696 TYPE_PTRMEM_POINTED_TO_TYPE (to))))
698 from = build_ptrmem_type (tbase,
699 TYPE_PTRMEM_POINTED_TO_TYPE (from));
700 conv = build_conv (PMEM_CONV, from, conv);
703 else if (IS_AGGR_TYPE (TREE_TYPE (from))
704 && IS_AGGR_TYPE (TREE_TYPE (to)))
706 if (DERIVED_FROM_P (TREE_TYPE (to), TREE_TYPE (from)))
709 cp_build_qualified_type (TREE_TYPE (to),
710 cp_type_quals (TREE_TYPE (from)));
711 from = build_pointer_type (from);
712 conv = build_conv (PTR_CONV, from, conv);
716 if (tcode == POINTER_TYPE)
718 to_pointee = TREE_TYPE (to);
719 from_pointee = TREE_TYPE (from);
723 to_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (to);
724 from_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (from);
727 if (same_type_p (from, to))
729 else if (comp_ptr_ttypes (to_pointee, from_pointee))
730 conv = build_conv (QUAL_CONV, to, conv);
731 else if (expr && string_conv_p (to, expr, 0))
732 /* converting from string constant to char *. */
733 conv = build_conv (QUAL_CONV, to, conv);
734 else if (ptr_reasonably_similar (to_pointee, from_pointee))
736 conv = build_conv (PTR_CONV, to, conv);
737 ICS_BAD_FLAG (conv) = 1;
744 else if (TYPE_PTRMEMFUNC_P (to) && TYPE_PTRMEMFUNC_P (from))
746 tree fromfn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from));
747 tree tofn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to));
748 tree fbase = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fromfn)));
749 tree tbase = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (tofn)));
751 if (!DERIVED_FROM_P (fbase, tbase)
752 || !same_type_p (TREE_TYPE (fromfn), TREE_TYPE (tofn))
753 || !compparms (TREE_CHAIN (TYPE_ARG_TYPES (fromfn)),
754 TREE_CHAIN (TYPE_ARG_TYPES (tofn)))
755 || cp_type_quals (fbase) != cp_type_quals (tbase))
758 from = cp_build_qualified_type (tbase, cp_type_quals (fbase));
759 from = build_method_type_directly (from,
761 TREE_CHAIN (TYPE_ARG_TYPES (fromfn)));
762 from = build_ptrmemfunc_type (build_pointer_type (from));
763 conv = build_conv (PMEM_CONV, from, conv);
765 else if (tcode == BOOLEAN_TYPE)
769 An rvalue of arithmetic, enumeration, pointer, or pointer to
770 member type can be converted to an rvalue of type bool. */
771 if (ARITHMETIC_TYPE_P (from)
772 || fcode == ENUMERAL_TYPE
773 || fcode == POINTER_TYPE
774 || TYPE_PTR_TO_MEMBER_P (from))
776 conv = build_conv (STD_CONV, to, conv);
777 if (fcode == POINTER_TYPE
778 || TYPE_PTRMEM_P (from)
779 || (TYPE_PTRMEMFUNC_P (from)
780 && ICS_STD_RANK (conv) < PBOOL_RANK))
781 ICS_STD_RANK (conv) = PBOOL_RANK;
787 /* We don't check for ENUMERAL_TYPE here because there are no standard
788 conversions to enum type. */
789 else if (tcode == INTEGER_TYPE || tcode == BOOLEAN_TYPE
790 || tcode == REAL_TYPE)
792 if (! (INTEGRAL_CODE_P (fcode) || fcode == REAL_TYPE))
794 conv = build_conv (STD_CONV, to, conv);
796 /* Give this a better rank if it's a promotion. */
797 if (same_type_p (to, type_promotes_to (from))
798 && ICS_STD_RANK (TREE_OPERAND (conv, 0)) <= PROMO_RANK)
799 ICS_STD_RANK (conv) = PROMO_RANK;
801 else if (fcode == VECTOR_TYPE && tcode == VECTOR_TYPE
802 && ((*targetm.vector_opaque_p) (from)
803 || (*targetm.vector_opaque_p) (to)))
804 return build_conv (STD_CONV, to, conv);
805 else if (IS_AGGR_TYPE (to) && IS_AGGR_TYPE (from)
806 && is_properly_derived_from (from, to))
808 if (TREE_CODE (conv) == RVALUE_CONV)
809 conv = TREE_OPERAND (conv, 0);
810 conv = build_conv (BASE_CONV, to, conv);
811 /* The derived-to-base conversion indicates the initialization
812 of a parameter with base type from an object of a derived
813 type. A temporary object is created to hold the result of
815 NEED_TEMPORARY_P (conv) = 1;
823 /* Returns nonzero if T1 is reference-related to T2. */
826 reference_related_p (tree t1, tree t2)
828 t1 = TYPE_MAIN_VARIANT (t1);
829 t2 = TYPE_MAIN_VARIANT (t2);
833 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
834 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
836 return (same_type_p (t1, t2)
837 || (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
838 && DERIVED_FROM_P (t1, t2)));
841 /* Returns nonzero if T1 is reference-compatible with T2. */
844 reference_compatible_p (tree t1, tree t2)
848 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
849 reference-related to T2 and cv1 is the same cv-qualification as,
850 or greater cv-qualification than, cv2. */
851 return (reference_related_p (t1, t2)
852 && at_least_as_qualified_p (t1, t2));
855 /* Determine whether or not the EXPR (of class type S) can be
856 converted to T as in [over.match.ref]. */
859 convert_class_to_reference (tree t, tree s, tree expr)
865 struct z_candidate *candidates;
866 struct z_candidate *cand;
869 conversions = lookup_conversions (s);
875 Assuming that "cv1 T" is the underlying type of the reference
876 being initialized, and "cv S" is the type of the initializer
877 expression, with S a class type, the candidate functions are
880 --The conversion functions of S and its base classes are
881 considered. Those that are not hidden within S and yield type
882 "reference to cv2 T2", where "cv1 T" is reference-compatible
883 (_dcl.init.ref_) with "cv2 T2", are candidate functions.
885 The argument list has one argument, which is the initializer
890 /* Conceptually, we should take the address of EXPR and put it in
891 the argument list. Unfortunately, however, that can result in
892 error messages, which we should not issue now because we are just
893 trying to find a conversion operator. Therefore, we use NULL,
894 cast to the appropriate type. */
895 arglist = build_int_2 (0, 0);
896 TREE_TYPE (arglist) = build_pointer_type (s);
897 arglist = build_tree_list (NULL_TREE, arglist);
899 reference_type = build_reference_type (t);
903 tree fns = TREE_VALUE (conversions);
905 for (; fns; fns = OVL_NEXT (fns))
907 tree f = OVL_CURRENT (fns);
908 tree t2 = TREE_TYPE (TREE_TYPE (f));
912 /* If this is a template function, try to get an exact
914 if (TREE_CODE (f) == TEMPLATE_DECL)
916 cand = add_template_candidate (&candidates,
922 TREE_PURPOSE (conversions),
928 /* Now, see if the conversion function really returns
929 an lvalue of the appropriate type. From the
930 point of view of unification, simply returning an
931 rvalue of the right type is good enough. */
933 t2 = TREE_TYPE (TREE_TYPE (f));
934 if (TREE_CODE (t2) != REFERENCE_TYPE
935 || !reference_compatible_p (t, TREE_TYPE (t2)))
937 candidates = candidates->next;
942 else if (TREE_CODE (t2) == REFERENCE_TYPE
943 && reference_compatible_p (t, TREE_TYPE (t2)))
944 cand = add_function_candidate (&candidates, f, s, arglist,
946 TREE_PURPOSE (conversions),
950 /* Build a standard conversion sequence indicating the
951 binding from the reference type returned by the
952 function to the desired REFERENCE_TYPE. */
954 = (direct_reference_binding
956 build1 (IDENTITY_CONV,
957 TREE_TYPE (TREE_TYPE (TREE_TYPE (cand->fn))),
960 conversions = TREE_CHAIN (conversions);
963 candidates = splice_viable (candidates, pedantic, &any_viable_p);
964 /* If none of the conversion functions worked out, let our caller
969 cand = tourney (candidates);
973 /* Now that we know that this is the function we're going to use fix
974 the dummy first argument. */
975 cand->args = tree_cons (NULL_TREE,
977 TREE_CHAIN (cand->args));
979 /* Build a user-defined conversion sequence representing the
981 conv = build_conv (USER_CONV,
982 TREE_TYPE (TREE_TYPE (cand->fn)),
983 build1 (IDENTITY_CONV, TREE_TYPE (expr), expr));
984 TREE_OPERAND (conv, 1) = build_zc_wrapper (cand);
986 /* Merge it with the standard conversion sequence from the
987 conversion function's return type to the desired type. */
988 cand->second_conv = merge_conversion_sequences (conv, cand->second_conv);
990 if (cand->viable == -1)
991 ICS_BAD_FLAG (conv) = 1;
993 return cand->second_conv;
996 /* A reference of the indicated TYPE is being bound directly to the
997 expression represented by the implicit conversion sequence CONV.
998 Return a conversion sequence for this binding. */
1001 direct_reference_binding (tree type, tree conv)
1005 my_friendly_assert (TREE_CODE (type) == REFERENCE_TYPE, 20030306);
1006 my_friendly_assert (TREE_CODE (TREE_TYPE (conv)) != REFERENCE_TYPE,
1009 t = TREE_TYPE (type);
1013 When a parameter of reference type binds directly
1014 (_dcl.init.ref_) to an argument expression, the implicit
1015 conversion sequence is the identity conversion, unless the
1016 argument expression has a type that is a derived class of the
1017 parameter type, in which case the implicit conversion sequence is
1018 a derived-to-base Conversion.
1020 If the parameter binds directly to the result of applying a
1021 conversion function to the argument expression, the implicit
1022 conversion sequence is a user-defined conversion sequence
1023 (_over.ics.user_), with the second standard conversion sequence
1024 either an identity conversion or, if the conversion function
1025 returns an entity of a type that is a derived class of the
1026 parameter type, a derived-to-base conversion. */
1027 if (!same_type_ignoring_top_level_qualifiers_p (t, TREE_TYPE (conv)))
1029 /* Represent the derived-to-base conversion. */
1030 conv = build_conv (BASE_CONV, t, conv);
1031 /* We will actually be binding to the base-class subobject in
1032 the derived class, so we mark this conversion appropriately.
1033 That way, convert_like knows not to generate a temporary. */
1034 NEED_TEMPORARY_P (conv) = 0;
1036 return build_conv (REF_BIND, type, conv);
1039 /* Returns the conversion path from type FROM to reference type TO for
1040 purposes of reference binding. For lvalue binding, either pass a
1041 reference type to FROM or an lvalue expression to EXPR. If the
1042 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1043 the conversion returned. */
1046 reference_binding (tree rto, tree rfrom, tree expr, int flags)
1048 tree conv = NULL_TREE;
1049 tree to = TREE_TYPE (rto);
1053 cp_lvalue_kind lvalue_p = clk_none;
1055 if (TREE_CODE (to) == FUNCTION_TYPE && expr && type_unknown_p (expr))
1057 expr = instantiate_type (to, expr, tf_none);
1058 if (expr == error_mark_node)
1060 from = TREE_TYPE (expr);
1063 if (TREE_CODE (from) == REFERENCE_TYPE)
1065 /* Anything with reference type is an lvalue. */
1066 lvalue_p = clk_ordinary;
1067 from = TREE_TYPE (from);
1070 lvalue_p = real_lvalue_p (expr);
1072 /* Figure out whether or not the types are reference-related and
1073 reference compatible. We have do do this after stripping
1074 references from FROM. */
1075 related_p = reference_related_p (to, from);
1076 compatible_p = reference_compatible_p (to, from);
1078 if (lvalue_p && compatible_p)
1082 If the initializer expression
1084 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1085 is reference-compatible with "cv2 T2,"
1087 the reference is bound directly to the initializer expression
1089 conv = build1 (IDENTITY_CONV, from, expr);
1090 conv = direct_reference_binding (rto, conv);
1091 if ((lvalue_p & clk_bitfield) != 0
1092 || ((lvalue_p & clk_packed) != 0 && !TYPE_PACKED (to)))
1093 /* For the purposes of overload resolution, we ignore the fact
1094 this expression is a bitfield or packed field. (In particular,
1095 [over.ics.ref] says specifically that a function with a
1096 non-const reference parameter is viable even if the
1097 argument is a bitfield.)
1099 However, when we actually call the function we must create
1100 a temporary to which to bind the reference. If the
1101 reference is volatile, or isn't const, then we cannot make
1102 a temporary, so we just issue an error when the conversion
1104 NEED_TEMPORARY_P (conv) = 1;
1108 else if (CLASS_TYPE_P (from) && !(flags & LOOKUP_NO_CONVERSION))
1112 If the initializer expression
1114 -- has a class type (i.e., T2 is a class type) can be
1115 implicitly converted to an lvalue of type "cv3 T3," where
1116 "cv1 T1" is reference-compatible with "cv3 T3". (this
1117 conversion is selected by enumerating the applicable
1118 conversion functions (_over.match.ref_) and choosing the
1119 best one through overload resolution. (_over.match_).
1121 the reference is bound to the lvalue result of the conversion
1122 in the second case. */
1123 conv = convert_class_to_reference (to, from, expr);
1128 /* From this point on, we conceptually need temporaries, even if we
1129 elide them. Only the cases above are "direct bindings". */
1130 if (flags & LOOKUP_NO_TEMP_BIND)
1135 When a parameter of reference type is not bound directly to an
1136 argument expression, the conversion sequence is the one required
1137 to convert the argument expression to the underlying type of the
1138 reference according to _over.best.ics_. Conceptually, this
1139 conversion sequence corresponds to copy-initializing a temporary
1140 of the underlying type with the argument expression. Any
1141 difference in top-level cv-qualification is subsumed by the
1142 initialization itself and does not constitute a conversion. */
1146 Otherwise, the reference shall be to a non-volatile const type. */
1147 if (!CP_TYPE_CONST_NON_VOLATILE_P (to))
1152 If the initializer expression is an rvalue, with T2 a class type,
1153 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1154 is bound in one of the following ways:
1156 -- The reference is bound to the object represented by the rvalue
1157 or to a sub-object within that object.
1161 We use the first alternative. The implicit conversion sequence
1162 is supposed to be same as we would obtain by generating a
1163 temporary. Fortunately, if the types are reference compatible,
1164 then this is either an identity conversion or the derived-to-base
1165 conversion, just as for direct binding. */
1166 if (CLASS_TYPE_P (from) && compatible_p)
1168 conv = build1 (IDENTITY_CONV, from, expr);
1169 return direct_reference_binding (rto, conv);
1174 Otherwise, a temporary of type "cv1 T1" is created and
1175 initialized from the initializer expression using the rules for a
1176 non-reference copy initialization. If T1 is reference-related to
1177 T2, cv1 must be the same cv-qualification as, or greater
1178 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1179 if (related_p && !at_least_as_qualified_p (to, from))
1182 conv = implicit_conversion (to, from, expr, flags);
1186 conv = build_conv (REF_BIND, rto, conv);
1187 /* This reference binding, unlike those above, requires the
1188 creation of a temporary. */
1189 NEED_TEMPORARY_P (conv) = 1;
1194 /* Returns the implicit conversion sequence (see [over.ics]) from type FROM
1195 to type TO. The optional expression EXPR may affect the conversion.
1196 FLAGS are the usual overloading flags. Only LOOKUP_NO_CONVERSION is
1200 implicit_conversion (tree to, tree from, tree expr, int flags)
1204 if (from == error_mark_node || to == error_mark_node
1205 || expr == error_mark_node)
1208 if (TREE_CODE (to) == REFERENCE_TYPE)
1209 conv = reference_binding (to, from, expr, flags);
1211 conv = standard_conversion (to, from, expr);
1216 if (expr != NULL_TREE
1217 && (IS_AGGR_TYPE (from)
1218 || IS_AGGR_TYPE (to))
1219 && (flags & LOOKUP_NO_CONVERSION) == 0)
1221 struct z_candidate *cand;
1223 cand = build_user_type_conversion_1
1224 (to, expr, LOOKUP_ONLYCONVERTING);
1226 conv = cand->second_conv;
1228 /* We used to try to bind a reference to a temporary here, but that
1229 is now handled by the recursive call to this function at the end
1230 of reference_binding. */
1237 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1240 static struct z_candidate *
1241 add_candidate (struct z_candidate **candidates,
1242 tree fn, tree args, tree convs, tree access_path,
1243 tree conversion_path, int viable)
1245 struct z_candidate *cand = ggc_alloc_cleared (sizeof (struct z_candidate));
1249 cand->convs = convs;
1250 cand->access_path = access_path;
1251 cand->conversion_path = conversion_path;
1252 cand->viable = viable;
1253 cand->next = *candidates;
1259 /* Create an overload candidate for the function or method FN called with
1260 the argument list ARGLIST and add it to CANDIDATES. FLAGS is passed on
1261 to implicit_conversion.
1263 CTYPE, if non-NULL, is the type we want to pretend this function
1264 comes from for purposes of overload resolution. */
1266 static struct z_candidate *
1267 add_function_candidate (struct z_candidate **candidates,
1268 tree fn, tree ctype, tree arglist,
1269 tree access_path, tree conversion_path,
1272 tree parmlist = TYPE_ARG_TYPES (TREE_TYPE (fn));
1275 tree parmnode, argnode;
1279 /* Built-in functions that haven't been declared don't really
1281 if (DECL_ANTICIPATED (fn))
1284 /* The `this', `in_chrg' and VTT arguments to constructors are not
1285 considered in overload resolution. */
1286 if (DECL_CONSTRUCTOR_P (fn))
1288 parmlist = skip_artificial_parms_for (fn, parmlist);
1289 orig_arglist = arglist;
1290 arglist = skip_artificial_parms_for (fn, arglist);
1293 orig_arglist = arglist;
1295 len = list_length (arglist);
1296 convs = make_tree_vec (len);
1298 /* 13.3.2 - Viable functions [over.match.viable]
1299 First, to be a viable function, a candidate function shall have enough
1300 parameters to agree in number with the arguments in the list.
1302 We need to check this first; otherwise, checking the ICSes might cause
1303 us to produce an ill-formed template instantiation. */
1305 parmnode = parmlist;
1306 for (i = 0; i < len; ++i)
1308 if (parmnode == NULL_TREE || parmnode == void_list_node)
1310 parmnode = TREE_CHAIN (parmnode);
1313 if (i < len && parmnode)
1316 /* Make sure there are default args for the rest of the parms. */
1317 else if (!sufficient_parms_p (parmnode))
1323 /* Second, for F to be a viable function, there shall exist for each
1324 argument an implicit conversion sequence that converts that argument
1325 to the corresponding parameter of F. */
1327 parmnode = parmlist;
1330 for (i = 0; i < len; ++i)
1332 tree arg = TREE_VALUE (argnode);
1333 tree argtype = lvalue_type (arg);
1337 if (parmnode == void_list_node)
1340 is_this = (i == 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
1341 && ! DECL_CONSTRUCTOR_P (fn));
1345 tree parmtype = TREE_VALUE (parmnode);
1347 /* The type of the implicit object parameter ('this') for
1348 overload resolution is not always the same as for the
1349 function itself; conversion functions are considered to
1350 be members of the class being converted, and functions
1351 introduced by a using-declaration are considered to be
1352 members of the class that uses them.
1354 Since build_over_call ignores the ICS for the `this'
1355 parameter, we can just change the parm type. */
1356 if (ctype && is_this)
1359 = build_qualified_type (ctype,
1360 TYPE_QUALS (TREE_TYPE (parmtype)));
1361 parmtype = build_pointer_type (parmtype);
1364 t = implicit_conversion (parmtype, argtype, arg, flags);
1368 t = build1 (IDENTITY_CONV, argtype, arg);
1369 ICS_ELLIPSIS_FLAG (t) = 1;
1373 ICS_THIS_FLAG (t) = 1;
1375 TREE_VEC_ELT (convs, i) = t;
1382 if (ICS_BAD_FLAG (t))
1386 parmnode = TREE_CHAIN (parmnode);
1387 argnode = TREE_CHAIN (argnode);
1391 return add_candidate (candidates, fn, orig_arglist, convs, access_path,
1392 conversion_path, viable);
1395 /* Create an overload candidate for the conversion function FN which will
1396 be invoked for expression OBJ, producing a pointer-to-function which
1397 will in turn be called with the argument list ARGLIST, and add it to
1398 CANDIDATES. FLAGS is passed on to implicit_conversion.
1400 Actually, we don't really care about FN; we care about the type it
1401 converts to. There may be multiple conversion functions that will
1402 convert to that type, and we rely on build_user_type_conversion_1 to
1403 choose the best one; so when we create our candidate, we record the type
1404 instead of the function. */
1406 static struct z_candidate *
1407 add_conv_candidate (struct z_candidate **candidates, tree fn, tree obj,
1408 tree arglist, tree access_path, tree conversion_path)
1410 tree totype = TREE_TYPE (TREE_TYPE (fn));
1411 int i, len, viable, flags;
1412 tree parmlist, convs, parmnode, argnode;
1414 for (parmlist = totype; TREE_CODE (parmlist) != FUNCTION_TYPE; )
1415 parmlist = TREE_TYPE (parmlist);
1416 parmlist = TYPE_ARG_TYPES (parmlist);
1418 len = list_length (arglist) + 1;
1419 convs = make_tree_vec (len);
1420 parmnode = parmlist;
1423 flags = LOOKUP_NORMAL;
1425 /* Don't bother looking up the same type twice. */
1426 if (*candidates && (*candidates)->fn == totype)
1429 for (i = 0; i < len; ++i)
1431 tree arg = i == 0 ? obj : TREE_VALUE (argnode);
1432 tree argtype = lvalue_type (arg);
1436 t = implicit_conversion (totype, argtype, arg, flags);
1437 else if (parmnode == void_list_node)
1440 t = implicit_conversion (TREE_VALUE (parmnode), argtype, arg, flags);
1443 t = build1 (IDENTITY_CONV, argtype, arg);
1444 ICS_ELLIPSIS_FLAG (t) = 1;
1447 TREE_VEC_ELT (convs, i) = t;
1451 if (ICS_BAD_FLAG (t))
1458 parmnode = TREE_CHAIN (parmnode);
1459 argnode = TREE_CHAIN (argnode);
1465 if (!sufficient_parms_p (parmnode))
1468 return add_candidate (candidates, totype, arglist, convs, access_path,
1469 conversion_path, viable);
1473 build_builtin_candidate (struct z_candidate **candidates, tree fnname,
1474 tree type1, tree type2, tree *args, tree *argtypes,
1484 convs = make_tree_vec (args[2] ? 3 : (args[1] ? 2 : 1));
1486 for (i = 0; i < 2; ++i)
1491 t = implicit_conversion (types[i], argtypes[i], args[i], flags);
1495 /* We need something for printing the candidate. */
1496 t = build1 (IDENTITY_CONV, types[i], NULL_TREE);
1498 else if (ICS_BAD_FLAG (t))
1500 TREE_VEC_ELT (convs, i) = t;
1503 /* For COND_EXPR we rearranged the arguments; undo that now. */
1506 TREE_VEC_ELT (convs, 2) = TREE_VEC_ELT (convs, 1);
1507 TREE_VEC_ELT (convs, 1) = TREE_VEC_ELT (convs, 0);
1508 t = implicit_conversion (boolean_type_node, argtypes[2], args[2], flags);
1510 TREE_VEC_ELT (convs, 0) = t;
1515 add_candidate (candidates, fnname, /*args=*/NULL_TREE, convs,
1516 /*access_path=*/NULL_TREE,
1517 /*conversion_path=*/NULL_TREE,
1522 is_complete (tree t)
1524 return COMPLETE_TYPE_P (complete_type (t));
1527 /* Returns nonzero if TYPE is a promoted arithmetic type. */
1530 promoted_arithmetic_type_p (tree type)
1534 In this section, the term promoted integral type is used to refer
1535 to those integral types which are preserved by integral promotion
1536 (including e.g. int and long but excluding e.g. char).
1537 Similarly, the term promoted arithmetic type refers to promoted
1538 integral types plus floating types. */
1539 return ((INTEGRAL_TYPE_P (type)
1540 && same_type_p (type_promotes_to (type), type))
1541 || TREE_CODE (type) == REAL_TYPE);
1544 /* Create any builtin operator overload candidates for the operator in
1545 question given the converted operand types TYPE1 and TYPE2. The other
1546 args are passed through from add_builtin_candidates to
1547 build_builtin_candidate.
1549 TYPE1 and TYPE2 may not be permissible, and we must filter them.
1550 If CODE is requires candidates operands of the same type of the kind
1551 of which TYPE1 and TYPE2 are, we add both candidates
1552 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
1555 add_builtin_candidate (struct z_candidate **candidates, enum tree_code code,
1556 enum tree_code code2, tree fnname, tree type1,
1557 tree type2, tree *args, tree *argtypes, int flags)
1561 case POSTINCREMENT_EXPR:
1562 case POSTDECREMENT_EXPR:
1563 args[1] = integer_zero_node;
1564 type2 = integer_type_node;
1573 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
1574 and VQ is either volatile or empty, there exist candidate operator
1575 functions of the form
1576 VQ T& operator++(VQ T&);
1577 T operator++(VQ T&, int);
1578 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
1579 type other than bool, and VQ is either volatile or empty, there exist
1580 candidate operator functions of the form
1581 VQ T& operator--(VQ T&);
1582 T operator--(VQ T&, int);
1583 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
1584 complete object type, and VQ is either volatile or empty, there exist
1585 candidate operator functions of the form
1586 T*VQ& operator++(T*VQ&);
1587 T*VQ& operator--(T*VQ&);
1588 T* operator++(T*VQ&, int);
1589 T* operator--(T*VQ&, int); */
1591 case POSTDECREMENT_EXPR:
1592 case PREDECREMENT_EXPR:
1593 if (TREE_CODE (type1) == BOOLEAN_TYPE)
1595 case POSTINCREMENT_EXPR:
1596 case PREINCREMENT_EXPR:
1597 if (ARITHMETIC_TYPE_P (type1) || TYPE_PTROB_P (type1))
1599 type1 = build_reference_type (type1);
1604 /* 7 For every cv-qualified or cv-unqualified complete object type T, there
1605 exist candidate operator functions of the form
1609 8 For every function type T, there exist candidate operator functions of
1611 T& operator*(T*); */
1614 if (TREE_CODE (type1) == POINTER_TYPE
1615 && (TYPE_PTROB_P (type1)
1616 || TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE))
1620 /* 9 For every type T, there exist candidate operator functions of the form
1623 10For every promoted arithmetic type T, there exist candidate operator
1624 functions of the form
1628 case CONVERT_EXPR: /* unary + */
1629 if (TREE_CODE (type1) == POINTER_TYPE)
1632 if (ARITHMETIC_TYPE_P (type1))
1636 /* 11For every promoted integral type T, there exist candidate operator
1637 functions of the form
1641 if (INTEGRAL_TYPE_P (type1))
1645 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
1646 is the same type as C2 or is a derived class of C2, T is a complete
1647 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
1648 there exist candidate operator functions of the form
1649 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
1650 where CV12 is the union of CV1 and CV2. */
1653 if (TREE_CODE (type1) == POINTER_TYPE
1654 && TYPE_PTR_TO_MEMBER_P (type2))
1656 tree c1 = TREE_TYPE (type1);
1657 tree c2 = TYPE_PTRMEM_CLASS_TYPE (type2);
1659 if (IS_AGGR_TYPE (c1) && DERIVED_FROM_P (c2, c1)
1660 && (TYPE_PTRMEMFUNC_P (type2)
1661 || is_complete (TREE_TYPE (TREE_TYPE (type2)))))
1666 /* 13For every pair of promoted arithmetic types L and R, there exist can-
1667 didate operator functions of the form
1672 bool operator<(L, R);
1673 bool operator>(L, R);
1674 bool operator<=(L, R);
1675 bool operator>=(L, R);
1676 bool operator==(L, R);
1677 bool operator!=(L, R);
1678 where LR is the result of the usual arithmetic conversions between
1681 14For every pair of types T and I, where T is a cv-qualified or cv-
1682 unqualified complete object type and I is a promoted integral type,
1683 there exist candidate operator functions of the form
1684 T* operator+(T*, I);
1685 T& operator[](T*, I);
1686 T* operator-(T*, I);
1687 T* operator+(I, T*);
1688 T& operator[](I, T*);
1690 15For every T, where T is a pointer to complete object type, there exist
1691 candidate operator functions of the form112)
1692 ptrdiff_t operator-(T, T);
1694 16For every pointer or enumeration type T, there exist candidate operator
1695 functions of the form
1696 bool operator<(T, T);
1697 bool operator>(T, T);
1698 bool operator<=(T, T);
1699 bool operator>=(T, T);
1700 bool operator==(T, T);
1701 bool operator!=(T, T);
1703 17For every pointer to member type T, there exist candidate operator
1704 functions of the form
1705 bool operator==(T, T);
1706 bool operator!=(T, T); */
1709 if (TYPE_PTROB_P (type1) && TYPE_PTROB_P (type2))
1711 if (TYPE_PTROB_P (type1) && INTEGRAL_TYPE_P (type2))
1713 type2 = ptrdiff_type_node;
1717 case TRUNC_DIV_EXPR:
1718 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
1724 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
1725 || (TYPE_PTRMEM_P (type1) && TYPE_PTRMEM_P (type2)))
1727 if (TYPE_PTR_TO_MEMBER_P (type1) && null_ptr_cst_p (args[1]))
1732 if (TYPE_PTR_TO_MEMBER_P (type2) && null_ptr_cst_p (args[0]))
1744 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
1746 if (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
1748 if (TREE_CODE (type1) == ENUMERAL_TYPE && TREE_CODE (type2) == ENUMERAL_TYPE)
1750 if (TYPE_PTR_P (type1) && null_ptr_cst_p (args[1]))
1755 if (null_ptr_cst_p (args[0]) && TYPE_PTR_P (type2))
1763 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
1766 if (INTEGRAL_TYPE_P (type1) && TYPE_PTROB_P (type2))
1768 type1 = ptrdiff_type_node;
1771 if (TYPE_PTROB_P (type1) && INTEGRAL_TYPE_P (type2))
1773 type2 = ptrdiff_type_node;
1778 /* 18For every pair of promoted integral types L and R, there exist candi-
1779 date operator functions of the form
1786 where LR is the result of the usual arithmetic conversions between
1789 case TRUNC_MOD_EXPR:
1795 if (INTEGRAL_TYPE_P (type1) && INTEGRAL_TYPE_P (type2))
1799 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
1800 type, VQ is either volatile or empty, and R is a promoted arithmetic
1801 type, there exist candidate operator functions of the form
1802 VQ L& operator=(VQ L&, R);
1803 VQ L& operator*=(VQ L&, R);
1804 VQ L& operator/=(VQ L&, R);
1805 VQ L& operator+=(VQ L&, R);
1806 VQ L& operator-=(VQ L&, R);
1808 20For every pair T, VQ), where T is any type and VQ is either volatile
1809 or empty, there exist candidate operator functions of the form
1810 T*VQ& operator=(T*VQ&, T*);
1812 21For every pair T, VQ), where T is a pointer to member type and VQ is
1813 either volatile or empty, there exist candidate operator functions of
1815 VQ T& operator=(VQ T&, T);
1817 22For every triple T, VQ, I), where T is a cv-qualified or cv-
1818 unqualified complete object type, VQ is either volatile or empty, and
1819 I is a promoted integral type, there exist candidate operator func-
1821 T*VQ& operator+=(T*VQ&, I);
1822 T*VQ& operator-=(T*VQ&, I);
1824 23For every triple L, VQ, R), where L is an integral or enumeration
1825 type, VQ is either volatile or empty, and R is a promoted integral
1826 type, there exist candidate operator functions of the form
1828 VQ L& operator%=(VQ L&, R);
1829 VQ L& operator<<=(VQ L&, R);
1830 VQ L& operator>>=(VQ L&, R);
1831 VQ L& operator&=(VQ L&, R);
1832 VQ L& operator^=(VQ L&, R);
1833 VQ L& operator|=(VQ L&, R); */
1840 if (TYPE_PTROB_P (type1) && INTEGRAL_TYPE_P (type2))
1842 type2 = ptrdiff_type_node;
1846 case TRUNC_DIV_EXPR:
1847 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
1851 case TRUNC_MOD_EXPR:
1857 if (INTEGRAL_TYPE_P (type1) && INTEGRAL_TYPE_P (type2))
1862 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
1864 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
1865 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
1866 || (TYPE_PTRMEM_P (type1) && TYPE_PTRMEM_P (type2))
1867 || ((TYPE_PTRMEMFUNC_P (type1)
1868 || TREE_CODE (type1) == POINTER_TYPE)
1869 && null_ptr_cst_p (args[1])))
1879 type1 = build_reference_type (type1);
1885 For every pair of promoted arithmetic types L and R, there
1886 exist candidate operator functions of the form
1888 LR operator?(bool, L, R);
1890 where LR is the result of the usual arithmetic conversions
1891 between types L and R.
1893 For every type T, where T is a pointer or pointer-to-member
1894 type, there exist candidate operator functions of the form T
1895 operator?(bool, T, T); */
1897 if (promoted_arithmetic_type_p (type1)
1898 && promoted_arithmetic_type_p (type2))
1902 /* Otherwise, the types should be pointers. */
1903 if (!(TYPE_PTR_P (type1) || TYPE_PTR_TO_MEMBER_P (type1))
1904 || !(TYPE_PTR_P (type2) || TYPE_PTR_TO_MEMBER_P (type2)))
1907 /* We don't check that the two types are the same; the logic
1908 below will actually create two candidates; one in which both
1909 parameter types are TYPE1, and one in which both parameter
1917 /* If we're dealing with two pointer types or two enumeral types,
1918 we need candidates for both of them. */
1919 if (type2 && !same_type_p (type1, type2)
1920 && TREE_CODE (type1) == TREE_CODE (type2)
1921 && (TREE_CODE (type1) == REFERENCE_TYPE
1922 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
1923 || (TYPE_PTRMEM_P (type1) && TYPE_PTRMEM_P (type2))
1924 || TYPE_PTRMEMFUNC_P (type1)
1925 || IS_AGGR_TYPE (type1)
1926 || TREE_CODE (type1) == ENUMERAL_TYPE))
1928 build_builtin_candidate
1929 (candidates, fnname, type1, type1, args, argtypes, flags);
1930 build_builtin_candidate
1931 (candidates, fnname, type2, type2, args, argtypes, flags);
1935 build_builtin_candidate
1936 (candidates, fnname, type1, type2, args, argtypes, flags);
1940 type_decays_to (tree type)
1942 if (TREE_CODE (type) == ARRAY_TYPE)
1943 return build_pointer_type (TREE_TYPE (type));
1944 if (TREE_CODE (type) == FUNCTION_TYPE)
1945 return build_pointer_type (type);
1949 /* There are three conditions of builtin candidates:
1951 1) bool-taking candidates. These are the same regardless of the input.
1952 2) pointer-pair taking candidates. These are generated for each type
1953 one of the input types converts to.
1954 3) arithmetic candidates. According to the standard, we should generate
1955 all of these, but I'm trying not to...
1957 Here we generate a superset of the possible candidates for this particular
1958 case. That is a subset of the full set the standard defines, plus some
1959 other cases which the standard disallows. add_builtin_candidate will
1960 filter out the invalid set. */
1963 add_builtin_candidates (struct z_candidate **candidates, enum tree_code code,
1964 enum tree_code code2, tree fnname, tree *args,
1969 tree type, argtypes[3];
1970 /* TYPES[i] is the set of possible builtin-operator parameter types
1971 we will consider for the Ith argument. These are represented as
1972 a TREE_LIST; the TREE_VALUE of each node is the potential
1976 for (i = 0; i < 3; ++i)
1979 argtypes[i] = lvalue_type (args[i]);
1981 argtypes[i] = NULL_TREE;
1986 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
1987 and VQ is either volatile or empty, there exist candidate operator
1988 functions of the form
1989 VQ T& operator++(VQ T&); */
1991 case POSTINCREMENT_EXPR:
1992 case PREINCREMENT_EXPR:
1993 case POSTDECREMENT_EXPR:
1994 case PREDECREMENT_EXPR:
1999 /* 24There also exist candidate operator functions of the form
2000 bool operator!(bool);
2001 bool operator&&(bool, bool);
2002 bool operator||(bool, bool); */
2004 case TRUTH_NOT_EXPR:
2005 build_builtin_candidate
2006 (candidates, fnname, boolean_type_node,
2007 NULL_TREE, args, argtypes, flags);
2010 case TRUTH_ORIF_EXPR:
2011 case TRUTH_ANDIF_EXPR:
2012 build_builtin_candidate
2013 (candidates, fnname, boolean_type_node,
2014 boolean_type_node, args, argtypes, flags);
2036 types[0] = types[1] = NULL_TREE;
2038 for (i = 0; i < 2; ++i)
2042 else if (IS_AGGR_TYPE (argtypes[i]))
2046 if (i == 0 && code == MODIFY_EXPR && code2 == NOP_EXPR)
2049 convs = lookup_conversions (argtypes[i]);
2051 if (code == COND_EXPR)
2053 if (real_lvalue_p (args[i]))
2054 types[i] = tree_cons
2055 (NULL_TREE, build_reference_type (argtypes[i]), types[i]);
2057 types[i] = tree_cons
2058 (NULL_TREE, TYPE_MAIN_VARIANT (argtypes[i]), types[i]);
2064 for (; convs; convs = TREE_CHAIN (convs))
2066 type = TREE_TYPE (TREE_TYPE (OVL_CURRENT (TREE_VALUE (convs))));
2069 && (TREE_CODE (type) != REFERENCE_TYPE
2070 || CP_TYPE_CONST_P (TREE_TYPE (type))))
2073 if (code == COND_EXPR && TREE_CODE (type) == REFERENCE_TYPE)
2074 types[i] = tree_cons (NULL_TREE, type, types[i]);
2076 type = non_reference (type);
2077 if (i != 0 || ! ref1)
2079 type = TYPE_MAIN_VARIANT (type_decays_to (type));
2080 if (enum_p && TREE_CODE (type) == ENUMERAL_TYPE)
2081 types[i] = tree_cons (NULL_TREE, type, types[i]);
2082 if (INTEGRAL_TYPE_P (type))
2083 type = type_promotes_to (type);
2086 if (! value_member (type, types[i]))
2087 types[i] = tree_cons (NULL_TREE, type, types[i]);
2092 if (code == COND_EXPR && real_lvalue_p (args[i]))
2093 types[i] = tree_cons
2094 (NULL_TREE, build_reference_type (argtypes[i]), types[i]);
2095 type = non_reference (argtypes[i]);
2096 if (i != 0 || ! ref1)
2098 type = TYPE_MAIN_VARIANT (type_decays_to (type));
2099 if (enum_p && TREE_CODE (type) == ENUMERAL_TYPE)
2100 types[i] = tree_cons (NULL_TREE, type, types[i]);
2101 if (INTEGRAL_TYPE_P (type))
2102 type = type_promotes_to (type);
2104 types[i] = tree_cons (NULL_TREE, type, types[i]);
2108 /* Run through the possible parameter types of both arguments,
2109 creating candidates with those parameter types. */
2110 for (; types[0]; types[0] = TREE_CHAIN (types[0]))
2113 for (type = types[1]; type; type = TREE_CHAIN (type))
2114 add_builtin_candidate
2115 (candidates, code, code2, fnname, TREE_VALUE (types[0]),
2116 TREE_VALUE (type), args, argtypes, flags);
2118 add_builtin_candidate
2119 (candidates, code, code2, fnname, TREE_VALUE (types[0]),
2120 NULL_TREE, args, argtypes, flags);
2127 /* If TMPL can be successfully instantiated as indicated by
2128 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2130 TMPL is the template. EXPLICIT_TARGS are any explicit template
2131 arguments. ARGLIST is the arguments provided at the call-site.
2132 The RETURN_TYPE is the desired type for conversion operators. If
2133 OBJ is NULL_TREE, FLAGS and CTYPE are as for add_function_candidate.
2134 If an OBJ is supplied, FLAGS and CTYPE are ignored, and OBJ is as for
2135 add_conv_candidate. */
2137 static struct z_candidate*
2138 add_template_candidate_real (struct z_candidate **candidates, tree tmpl,
2139 tree ctype, tree explicit_targs, tree arglist,
2140 tree return_type, tree access_path,
2141 tree conversion_path, int flags, tree obj,
2142 unification_kind_t strict)
2144 int ntparms = DECL_NTPARMS (tmpl);
2145 tree targs = make_tree_vec (ntparms);
2146 tree args_without_in_chrg = arglist;
2147 struct z_candidate *cand;
2151 /* We don't do deduction on the in-charge parameter, the VTT
2152 parameter or 'this'. */
2153 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl))
2154 args_without_in_chrg = TREE_CHAIN (args_without_in_chrg);
2156 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl)
2157 || DECL_BASE_CONSTRUCTOR_P (tmpl))
2158 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (tmpl)))
2159 args_without_in_chrg = TREE_CHAIN (args_without_in_chrg);
2161 i = fn_type_unification (tmpl, explicit_targs, targs,
2162 args_without_in_chrg,
2163 return_type, strict, -1);
2168 fn = instantiate_template (tmpl, targs, tf_none);
2169 if (fn == error_mark_node)
2174 A member function template is never instantiated to perform the
2175 copy of a class object to an object of its class type.
2177 It's a little unclear what this means; the standard explicitly
2178 does allow a template to be used to copy a class. For example,
2183 template <class T> A(const T&);
2186 void g () { A a (f ()); }
2188 the member template will be used to make the copy. The section
2189 quoted above appears in the paragraph that forbids constructors
2190 whose only parameter is (a possibly cv-qualified variant of) the
2191 class type, and a logical interpretation is that the intent was
2192 to forbid the instantiation of member templates which would then
2194 if (DECL_CONSTRUCTOR_P (fn) && list_length (arglist) == 2)
2196 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (fn);
2197 if (arg_types && same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types)),
2202 if (obj != NULL_TREE)
2203 /* Aha, this is a conversion function. */
2204 cand = add_conv_candidate (candidates, fn, obj, access_path,
2205 conversion_path, arglist);
2207 cand = add_function_candidate (candidates, fn, ctype,
2208 arglist, access_path,
2209 conversion_path, flags);
2210 if (DECL_TI_TEMPLATE (fn) != tmpl)
2211 /* This situation can occur if a member template of a template
2212 class is specialized. Then, instantiate_template might return
2213 an instantiation of the specialization, in which case the
2214 DECL_TI_TEMPLATE field will point at the original
2215 specialization. For example:
2217 template <class T> struct S { template <class U> void f(U);
2218 template <> void f(int) {}; };
2222 Here, TMPL will be template <class U> S<double>::f(U).
2223 And, instantiate template will give us the specialization
2224 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
2225 for this will point at template <class T> template <> S<T>::f(int),
2226 so that we can find the definition. For the purposes of
2227 overload resolution, however, we want the original TMPL. */
2228 cand->template = tree_cons (tmpl, targs, NULL_TREE);
2230 cand->template = DECL_TEMPLATE_INFO (fn);
2236 static struct z_candidate *
2237 add_template_candidate (struct z_candidate **candidates, tree tmpl, tree ctype,
2238 tree explicit_targs, tree arglist, tree return_type,
2239 tree access_path, tree conversion_path, int flags,
2240 unification_kind_t strict)
2243 add_template_candidate_real (candidates, tmpl, ctype,
2244 explicit_targs, arglist, return_type,
2245 access_path, conversion_path,
2246 flags, NULL_TREE, strict);
2250 static struct z_candidate *
2251 add_template_conv_candidate (struct z_candidate **candidates, tree tmpl,
2252 tree obj, tree arglist, tree return_type,
2253 tree access_path, tree conversion_path)
2256 add_template_candidate_real (candidates, tmpl, NULL_TREE, NULL_TREE,
2257 arglist, return_type, access_path,
2258 conversion_path, 0, obj, DEDUCE_CONV);
2261 /* The CANDS are the set of candidates that were considered for
2262 overload resolution. Return the set of viable candidates. If none
2263 of the candidates were viable, set *ANY_VIABLE_P to true. STRICT_P
2264 is true if a candidate should be considered viable only if it is
2267 static struct z_candidate*
2268 splice_viable (struct z_candidate *cands,
2272 struct z_candidate *viable;
2273 struct z_candidate **last_viable;
2274 struct z_candidate **cand;
2277 last_viable = &viable;
2278 *any_viable_p = false;
2283 struct z_candidate *c = *cand;
2284 if (strict_p ? c->viable == 1 : c->viable)
2289 last_viable = &c->next;
2290 *any_viable_p = true;
2296 return viable ? viable : cands;
2300 any_strictly_viable (struct z_candidate *cands)
2302 for (; cands; cands = cands->next)
2303 if (cands->viable == 1)
2309 build_this (tree obj)
2311 /* Fix this to work on non-lvalues. */
2312 return build_unary_op (ADDR_EXPR, obj, 0);
2315 /* Returns true iff functions are equivalent. Equivalent functions are
2316 not '==' only if one is a function-local extern function or if
2317 both are extern "C". */
2320 equal_functions (tree fn1, tree fn2)
2322 if (DECL_LOCAL_FUNCTION_P (fn1) || DECL_LOCAL_FUNCTION_P (fn2)
2323 || DECL_EXTERN_C_FUNCTION_P (fn1))
2324 return decls_match (fn1, fn2);
2328 /* Print information about one overload candidate CANDIDATE. MSGSTR
2329 is the text to print before the candidate itself.
2331 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
2332 to have been run through gettext by the caller. This wart makes
2333 life simpler in print_z_candidates and for the translators. */
2336 print_z_candidate (const char *msgstr, struct z_candidate *candidate)
2338 if (TREE_CODE (candidate->fn) == IDENTIFIER_NODE)
2340 if (TREE_VEC_LENGTH (candidate->convs) == 3)
2341 inform ("%s %D(%T, %T, %T) <built-in>", msgstr, candidate->fn,
2342 TREE_TYPE (TREE_VEC_ELT (candidate->convs, 0)),
2343 TREE_TYPE (TREE_VEC_ELT (candidate->convs, 1)),
2344 TREE_TYPE (TREE_VEC_ELT (candidate->convs, 2)));
2345 else if (TREE_VEC_LENGTH (candidate->convs) == 2)
2346 inform ("%s %D(%T, %T) <built-in>", msgstr, candidate->fn,
2347 TREE_TYPE (TREE_VEC_ELT (candidate->convs, 0)),
2348 TREE_TYPE (TREE_VEC_ELT (candidate->convs, 1)));
2350 inform ("%s %D(%T) <built-in>", msgstr, candidate->fn,
2351 TREE_TYPE (TREE_VEC_ELT (candidate->convs, 0)));
2353 else if (TYPE_P (candidate->fn))
2354 inform ("%s %T <conversion>", msgstr, candidate->fn);
2355 else if (candidate->viable == -1)
2356 inform ("%H%s %+#D <near match>",
2357 &DECL_SOURCE_LOCATION (candidate->fn), msgstr, candidate->fn);
2359 inform ("%H%s %+#D",
2360 &DECL_SOURCE_LOCATION (candidate->fn), msgstr, candidate->fn);
2364 print_z_candidates (struct z_candidate *candidates)
2367 struct z_candidate *cand1;
2368 struct z_candidate **cand2;
2370 /* There may be duplicates in the set of candidates. We put off
2371 checking this condition as long as possible, since we have no way
2372 to eliminate duplicates from a set of functions in less than n^2
2373 time. Now we are about to emit an error message, so it is more
2374 permissible to go slowly. */
2375 for (cand1 = candidates; cand1; cand1 = cand1->next)
2377 tree fn = cand1->fn;
2378 /* Skip builtin candidates and conversion functions. */
2379 if (TREE_CODE (fn) != FUNCTION_DECL)
2381 cand2 = &cand1->next;
2384 if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL
2385 && equal_functions (fn, (*cand2)->fn))
2386 *cand2 = (*cand2)->next;
2388 cand2 = &(*cand2)->next;
2395 str = _("candidates are:");
2396 print_z_candidate (str, candidates);
2397 if (candidates->next)
2399 /* Indent successive candidates by the width of the translation
2400 of the above string. */
2401 size_t len = gcc_gettext_width (str) + 1;
2402 char *spaces = alloca (len);
2403 memset (spaces, ' ', len-1);
2404 spaces[len - 1] = '\0';
2406 candidates = candidates->next;
2409 print_z_candidate (spaces, candidates);
2410 candidates = candidates->next;
2416 /* USER_SEQ is a user-defined conversion sequence, beginning with a
2417 USER_CONV. STD_SEQ is the standard conversion sequence applied to
2418 the result of the conversion function to convert it to the final
2419 desired type. Merge the the two sequences into a single sequence,
2420 and return the merged sequence. */
2423 merge_conversion_sequences (tree user_seq, tree std_seq)
2427 my_friendly_assert (TREE_CODE (user_seq) == USER_CONV,
2430 /* Find the end of the second conversion sequence. */
2432 while (TREE_CODE (*t) != IDENTITY_CONV)
2433 t = &TREE_OPERAND (*t, 0);
2435 /* Replace the identity conversion with the user conversion
2439 /* The entire sequence is a user-conversion sequence. */
2440 ICS_USER_FLAG (std_seq) = 1;
2445 /* Returns the best overload candidate to perform the requested
2446 conversion. This function is used for three the overloading situations
2447 described in [over.match.copy], [over.match.conv], and [over.match.ref].
2448 If TOTYPE is a REFERENCE_TYPE, we're trying to find an lvalue binding as
2449 per [dcl.init.ref], so we ignore temporary bindings. */
2451 static struct z_candidate *
2452 build_user_type_conversion_1 (tree totype, tree expr, int flags)
2454 struct z_candidate *candidates, *cand;
2455 tree fromtype = TREE_TYPE (expr);
2456 tree ctors = NULL_TREE, convs = NULL_TREE;
2457 tree args = NULL_TREE;
2460 /* We represent conversion within a hierarchy using RVALUE_CONV and
2461 BASE_CONV, as specified by [over.best.ics]; these become plain
2462 constructor calls, as specified in [dcl.init]. */
2463 my_friendly_assert (!IS_AGGR_TYPE (fromtype) || !IS_AGGR_TYPE (totype)
2464 || !DERIVED_FROM_P (totype, fromtype), 20011226);
2466 if (IS_AGGR_TYPE (totype))
2467 ctors = lookup_fnfields (TYPE_BINFO (totype),
2468 complete_ctor_identifier,
2471 if (IS_AGGR_TYPE (fromtype))
2472 convs = lookup_conversions (fromtype);
2475 flags |= LOOKUP_NO_CONVERSION;
2481 ctors = BASELINK_FUNCTIONS (ctors);
2483 t = build_int_2 (0, 0);
2484 TREE_TYPE (t) = build_pointer_type (totype);
2485 args = build_tree_list (NULL_TREE, expr);
2486 /* We should never try to call the abstract or base constructor
2488 my_friendly_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors))
2489 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors)),
2491 args = tree_cons (NULL_TREE, t, args);
2493 for (; ctors; ctors = OVL_NEXT (ctors))
2495 tree ctor = OVL_CURRENT (ctors);
2496 if (DECL_NONCONVERTING_P (ctor))
2499 if (TREE_CODE (ctor) == TEMPLATE_DECL)
2500 cand = add_template_candidate (&candidates, ctor, totype,
2501 NULL_TREE, args, NULL_TREE,
2502 TYPE_BINFO (totype),
2503 TYPE_BINFO (totype),
2507 cand = add_function_candidate (&candidates, ctor, totype,
2508 args, TYPE_BINFO (totype),
2509 TYPE_BINFO (totype),
2513 cand->second_conv = build1 (IDENTITY_CONV, totype, NULL_TREE);
2517 args = build_tree_list (NULL_TREE, build_this (expr));
2519 for (; convs; convs = TREE_CHAIN (convs))
2522 tree conversion_path = TREE_PURPOSE (convs);
2523 int convflags = LOOKUP_NO_CONVERSION;
2525 /* If we are called to convert to a reference type, we are trying to
2526 find an lvalue binding, so don't even consider temporaries. If
2527 we don't find an lvalue binding, the caller will try again to
2528 look for a temporary binding. */
2529 if (TREE_CODE (totype) == REFERENCE_TYPE)
2530 convflags |= LOOKUP_NO_TEMP_BIND;
2532 for (fns = TREE_VALUE (convs); fns; fns = OVL_NEXT (fns))
2534 tree fn = OVL_CURRENT (fns);
2536 /* [over.match.funcs] For conversion functions, the function
2537 is considered to be a member of the class of the implicit
2538 object argument for the purpose of defining the type of
2539 the implicit object parameter.
2541 So we pass fromtype as CTYPE to add_*_candidate. */
2543 if (TREE_CODE (fn) == TEMPLATE_DECL)
2544 cand = add_template_candidate (&candidates, fn, fromtype,
2547 TYPE_BINFO (fromtype),
2552 cand = add_function_candidate (&candidates, fn, fromtype,
2554 TYPE_BINFO (fromtype),
2560 tree ics = implicit_conversion (totype,
2561 TREE_TYPE (TREE_TYPE (cand->fn)),
2564 cand->second_conv = ics;
2566 if (ics == NULL_TREE)
2568 else if (candidates->viable == 1 && ICS_BAD_FLAG (ics))
2574 candidates = splice_viable (candidates, pedantic, &any_viable_p);
2578 cand = tourney (candidates);
2581 if (flags & LOOKUP_COMPLAIN)
2583 error ("conversion from `%T' to `%T' is ambiguous",
2585 print_z_candidates (candidates);
2588 cand = candidates; /* any one will do */
2589 cand->second_conv = build1 (AMBIG_CONV, totype, expr);
2590 ICS_USER_FLAG (cand->second_conv) = 1;
2591 if (!any_strictly_viable (candidates))
2592 ICS_BAD_FLAG (cand->second_conv) = 1;
2593 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
2594 ambiguous conversion is no worse than another user-defined
2600 /* Build the user conversion sequence. */
2603 (DECL_CONSTRUCTOR_P (cand->fn)
2604 ? totype : non_reference (TREE_TYPE (TREE_TYPE (cand->fn)))),
2605 build1 (IDENTITY_CONV, TREE_TYPE (expr), expr));
2606 TREE_OPERAND (convs, 1) = build_zc_wrapper (cand);
2608 /* Combine it with the second conversion sequence. */
2609 cand->second_conv = merge_conversion_sequences (convs,
2612 if (cand->viable == -1)
2613 ICS_BAD_FLAG (cand->second_conv) = 1;
2619 build_user_type_conversion (tree totype, tree expr, int flags)
2621 struct z_candidate *cand
2622 = build_user_type_conversion_1 (totype, expr, flags);
2626 if (TREE_CODE (cand->second_conv) == AMBIG_CONV)
2627 return error_mark_node;
2628 return convert_from_reference (convert_like (cand->second_conv, expr));
2633 /* Do any initial processing on the arguments to a function call. */
2636 resolve_args (tree args)
2639 for (t = args; t; t = TREE_CHAIN (t))
2641 tree arg = TREE_VALUE (t);
2643 if (arg == error_mark_node)
2644 return error_mark_node;
2645 else if (VOID_TYPE_P (TREE_TYPE (arg)))
2647 error ("invalid use of void expression");
2648 return error_mark_node;
2650 arg = convert_from_reference (arg);
2651 TREE_VALUE (t) = arg;
2656 /* Perform overload resolution on FN, which is called with the ARGS.
2658 Return the candidate function selected by overload resolution, or
2659 NULL if the event that overload resolution failed. In the case
2660 that overload resolution fails, *CANDIDATES will be the set of
2661 candidates considered, and ANY_VIABLE_P will be set to true or
2662 false to indicate whether or not any of the candidates were
2665 The ARGS should already have gone through RESOLVE_ARGS before this
2666 function is called. */
2668 static struct z_candidate *
2669 perform_overload_resolution (tree fn,
2671 struct z_candidate **candidates,
2674 struct z_candidate *cand;
2675 tree explicit_targs = NULL_TREE;
2676 int template_only = 0;
2679 *any_viable_p = true;
2681 /* Check FN and ARGS. */
2682 my_friendly_assert (TREE_CODE (fn) == FUNCTION_DECL
2683 || TREE_CODE (fn) == TEMPLATE_DECL
2684 || TREE_CODE (fn) == OVERLOAD
2685 || TREE_CODE (fn) == TEMPLATE_ID_EXPR,
2687 my_friendly_assert (!args || TREE_CODE (args) == TREE_LIST,
2690 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2692 explicit_targs = TREE_OPERAND (fn, 1);
2693 fn = TREE_OPERAND (fn, 0);
2697 /* Add the various candidate functions. */
2698 add_candidates (fn, args, explicit_targs, template_only,
2699 /*conversion_path=*/NULL_TREE,
2700 /*access_path=*/NULL_TREE,
2704 *candidates = splice_viable (*candidates, pedantic, any_viable_p);
2708 cand = tourney (*candidates);
2712 /* Return an expression for a call to FN (a namespace-scope function,
2713 or a static member function) with the ARGS. */
2716 build_new_function_call (tree fn, tree args)
2718 struct z_candidate *candidates, *cand;
2721 args = resolve_args (args);
2722 if (args == error_mark_node)
2723 return error_mark_node;
2725 cand = perform_overload_resolution (fn, args, &candidates, &any_viable_p);
2729 if (!any_viable_p && candidates && ! candidates->next)
2730 return build_function_call (candidates->fn, args);
2731 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2732 fn = TREE_OPERAND (fn, 0);
2734 error ("no matching function for call to `%D(%A)'",
2735 DECL_NAME (OVL_CURRENT (fn)), args);
2737 error ("call of overloaded `%D(%A)' is ambiguous",
2738 DECL_NAME (OVL_CURRENT (fn)), args);
2740 print_z_candidates (candidates);
2741 return error_mark_node;
2744 return build_over_call (cand, LOOKUP_NORMAL);
2747 /* Build a call to a global operator new. FNNAME is the name of the
2748 operator (either "operator new" or "operator new[]") and ARGS are
2749 the arguments provided. *SIZE points to the total number of bytes
2750 required by the allocation, and is updated if that is changed here.
2751 *COOKIE_SIZE is non-NULL if a cookie should be used. If this
2752 function determines that no cookie should be used, after all,
2753 *COOKIE_SIZE is set to NULL_TREE. */
2756 build_operator_new_call (tree fnname, tree args, tree *size, tree *cookie_size)
2759 struct z_candidate *candidates;
2760 struct z_candidate *cand;
2763 args = tree_cons (NULL_TREE, *size, args);
2764 args = resolve_args (args);
2765 if (args == error_mark_node)
2768 fns = lookup_function_nonclass (fnname, args);
2770 /* Figure out what function is being called. */
2771 cand = perform_overload_resolution (fns, args, &candidates, &any_viable_p);
2773 /* If no suitable function could be found, issue an error message
2778 error ("no matching function for call to `%D(%A)'",
2779 DECL_NAME (OVL_CURRENT (fns)), args);
2781 error ("call of overloaded `%D(%A)' is ambiguous",
2782 DECL_NAME (OVL_CURRENT (fns)), args);
2784 print_z_candidates (candidates);
2785 return error_mark_node;
2788 /* If a cookie is required, add some extra space. Whether
2789 or not a cookie is required cannot be determined until
2790 after we know which function was called. */
2793 bool use_cookie = true;
2794 if (!abi_version_at_least (2))
2796 tree placement = TREE_CHAIN (args);
2797 /* In G++ 3.2, the check was implemented incorrectly; it
2798 looked at the placement expression, rather than the
2799 type of the function. */
2800 if (placement && !TREE_CHAIN (placement)
2801 && same_type_p (TREE_TYPE (TREE_VALUE (placement)),
2809 arg_types = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
2810 /* Skip the size_t parameter. */
2811 arg_types = TREE_CHAIN (arg_types);
2812 /* Check the remaining parameters (if any). */
2814 && TREE_CHAIN (arg_types) == void_list_node
2815 && same_type_p (TREE_VALUE (arg_types),
2819 /* If we need a cookie, adjust the number of bytes allocated. */
2822 /* Update the total size. */
2823 *size = size_binop (PLUS_EXPR, *size, *cookie_size);
2824 /* Update the argument list to reflect the adjusted size. */
2825 TREE_VALUE (args) = *size;
2828 *cookie_size = NULL_TREE;
2831 /* Build the CALL_EXPR. */
2832 return build_over_call (cand, LOOKUP_NORMAL);
2836 build_object_call (tree obj, tree args)
2838 struct z_candidate *candidates = 0, *cand;
2839 tree fns, convs, mem_args = NULL_TREE;
2840 tree type = TREE_TYPE (obj);
2843 if (TYPE_PTRMEMFUNC_P (type))
2845 /* It's no good looking for an overloaded operator() on a
2846 pointer-to-member-function. */
2847 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj);
2848 return error_mark_node;
2851 fns = lookup_fnfields (TYPE_BINFO (type), ansi_opname (CALL_EXPR), 1);
2852 if (fns == error_mark_node)
2853 return error_mark_node;
2855 args = resolve_args (args);
2857 if (args == error_mark_node)
2858 return error_mark_node;
2862 tree base = BINFO_TYPE (BASELINK_BINFO (fns));
2863 mem_args = tree_cons (NULL_TREE, build_this (obj), args);
2865 for (fns = BASELINK_FUNCTIONS (fns); fns; fns = OVL_NEXT (fns))
2867 tree fn = OVL_CURRENT (fns);
2868 if (TREE_CODE (fn) == TEMPLATE_DECL)
2869 add_template_candidate (&candidates, fn, base, NULL_TREE,
2870 mem_args, NULL_TREE,
2873 LOOKUP_NORMAL, DEDUCE_CALL);
2875 add_function_candidate
2876 (&candidates, fn, base, mem_args, TYPE_BINFO (type),
2877 TYPE_BINFO (type), LOOKUP_NORMAL);
2881 convs = lookup_conversions (type);
2883 for (; convs; convs = TREE_CHAIN (convs))
2885 tree fns = TREE_VALUE (convs);
2886 tree totype = TREE_TYPE (TREE_TYPE (OVL_CURRENT (fns)));
2888 if ((TREE_CODE (totype) == POINTER_TYPE
2889 && TREE_CODE (TREE_TYPE (totype)) == FUNCTION_TYPE)
2890 || (TREE_CODE (totype) == REFERENCE_TYPE
2891 && TREE_CODE (TREE_TYPE (totype)) == FUNCTION_TYPE)
2892 || (TREE_CODE (totype) == REFERENCE_TYPE
2893 && TREE_CODE (TREE_TYPE (totype)) == POINTER_TYPE
2894 && TREE_CODE (TREE_TYPE (TREE_TYPE (totype))) == FUNCTION_TYPE))
2895 for (; fns; fns = OVL_NEXT (fns))
2897 tree fn = OVL_CURRENT (fns);
2898 if (TREE_CODE (fn) == TEMPLATE_DECL)
2899 add_template_conv_candidate
2900 (&candidates, fn, obj, args, totype,
2901 /*access_path=*/NULL_TREE,
2902 /*conversion_path=*/NULL_TREE);
2904 add_conv_candidate (&candidates, fn, obj, args,
2905 /*conversion_path=*/NULL_TREE,
2906 /*access_path=*/NULL_TREE);
2910 candidates = splice_viable (candidates, pedantic, &any_viable_p);
2913 error ("no match for call to `(%T) (%A)'", TREE_TYPE (obj), args);
2914 print_z_candidates (candidates);
2915 return error_mark_node;
2918 cand = tourney (candidates);
2921 error ("call of `(%T) (%A)' is ambiguous", TREE_TYPE (obj), args);
2922 print_z_candidates (candidates);
2923 return error_mark_node;
2926 /* Since cand->fn will be a type, not a function, for a conversion
2927 function, we must be careful not to unconditionally look at
2929 if (TREE_CODE (cand->fn) == FUNCTION_DECL
2930 && DECL_OVERLOADED_OPERATOR_P (cand->fn) == CALL_EXPR)
2931 return build_over_call (cand, LOOKUP_NORMAL);
2933 obj = convert_like_with_context
2934 (TREE_VEC_ELT (cand->convs, 0), obj, cand->fn, -1);
2937 return build_function_call (obj, args);
2941 op_error (enum tree_code code, enum tree_code code2,
2942 tree arg1, tree arg2, tree arg3, const char *problem)
2946 if (code == MODIFY_EXPR)
2947 opname = assignment_operator_name_info[code2].name;
2949 opname = operator_name_info[code].name;
2954 error ("%s for ternary 'operator?:' in '%E ? %E : %E'",
2955 problem, arg1, arg2, arg3);
2958 case POSTINCREMENT_EXPR:
2959 case POSTDECREMENT_EXPR:
2960 error ("%s for 'operator%s' in '%E%s'", problem, opname, arg1, opname);
2964 error ("%s for 'operator[]' in '%E[%E]'", problem, arg1, arg2);
2969 error ("%s for '%s' in '%s %E'", problem, opname, opname, arg1);
2974 error ("%s for 'operator%s' in '%E %s %E'",
2975 problem, opname, arg1, opname, arg2);
2977 error ("%s for 'operator%s' in '%s%E'",
2978 problem, opname, opname, arg1);
2983 /* Return the implicit conversion sequence that could be used to
2984 convert E1 to E2 in [expr.cond]. */
2987 conditional_conversion (tree e1, tree e2)
2989 tree t1 = non_reference (TREE_TYPE (e1));
2990 tree t2 = non_reference (TREE_TYPE (e2));
2996 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
2997 implicitly converted (clause _conv_) to the type "reference to
2998 T2", subject to the constraint that in the conversion the
2999 reference must bind directly (_dcl.init.ref_) to E1. */
3000 if (real_lvalue_p (e2))
3002 conv = implicit_conversion (build_reference_type (t2),
3005 LOOKUP_NO_TEMP_BIND);
3012 If E1 and E2 have class type, and the underlying class types are
3013 the same or one is a base class of the other: E1 can be converted
3014 to match E2 if the class of T2 is the same type as, or a base
3015 class of, the class of T1, and the cv-qualification of T2 is the
3016 same cv-qualification as, or a greater cv-qualification than, the
3017 cv-qualification of T1. If the conversion is applied, E1 is
3018 changed to an rvalue of type T2 that still refers to the original
3019 source class object (or the appropriate subobject thereof).
3021 FIXME we can't express an rvalue that refers to the original object;
3022 we have to create a new one. */
3023 if (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
3024 && ((good_base = DERIVED_FROM_P (t2, t1)) || DERIVED_FROM_P (t1, t2)))
3026 if (good_base && at_least_as_qualified_p (t2, t1))
3028 conv = build1 (IDENTITY_CONV, t1, e1);
3029 if (!same_type_p (TYPE_MAIN_VARIANT (t1),
3030 TYPE_MAIN_VARIANT (t2)))
3032 conv = build_conv (BASE_CONV, t2, conv);
3033 NEED_TEMPORARY_P (conv) = 1;
3036 conv = build_conv (RVALUE_CONV, t2, conv);
3045 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
3046 converted to the type that expression E2 would have if E2 were
3047 converted to an rvalue (or the type it has, if E2 is an rvalue). */
3048 return implicit_conversion (t2, t1, e1, LOOKUP_NORMAL);
3051 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
3052 arguments to the conditional expression. */
3055 build_conditional_expr (tree arg1, tree arg2, tree arg3)
3060 tree result_type = NULL_TREE;
3061 bool lvalue_p = true;
3062 struct z_candidate *candidates = 0;
3063 struct z_candidate *cand;
3065 /* As a G++ extension, the second argument to the conditional can be
3066 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
3067 c'.) If the second operand is omitted, make sure it is
3068 calculated only once. */
3072 pedwarn ("ISO C++ forbids omitting the middle term of a ?: expression");
3074 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
3075 if (real_lvalue_p (arg1))
3076 arg2 = arg1 = stabilize_reference (arg1);
3078 arg2 = arg1 = save_expr (arg1);
3083 The first expr ession is implicitly converted to bool (clause
3085 arg1 = perform_implicit_conversion (boolean_type_node, arg1);
3087 /* If something has already gone wrong, just pass that fact up the
3089 if (error_operand_p (arg1)
3090 || error_operand_p (arg2)
3091 || error_operand_p (arg3))
3092 return error_mark_node;
3096 If either the second or the third operand has type (possibly
3097 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
3098 array-to-pointer (_conv.array_), and function-to-pointer
3099 (_conv.func_) standard conversions are performed on the second
3100 and third operands. */
3101 arg2_type = TREE_TYPE (arg2);
3102 arg3_type = TREE_TYPE (arg3);
3103 if (VOID_TYPE_P (arg2_type) || VOID_TYPE_P (arg3_type))
3105 /* Do the conversions. We don't these for `void' type arguments
3106 since it can't have any effect and since decay_conversion
3107 does not handle that case gracefully. */
3108 if (!VOID_TYPE_P (arg2_type))
3109 arg2 = decay_conversion (arg2);
3110 if (!VOID_TYPE_P (arg3_type))
3111 arg3 = decay_conversion (arg3);
3112 arg2_type = TREE_TYPE (arg2);
3113 arg3_type = TREE_TYPE (arg3);
3117 One of the following shall hold:
3119 --The second or the third operand (but not both) is a
3120 throw-expression (_except.throw_); the result is of the
3121 type of the other and is an rvalue.
3123 --Both the second and the third operands have type void; the
3124 result is of type void and is an rvalue. */
3125 if ((TREE_CODE (arg2) == THROW_EXPR)
3126 ^ (TREE_CODE (arg3) == THROW_EXPR))
3127 result_type = ((TREE_CODE (arg2) == THROW_EXPR)
3128 ? arg3_type : arg2_type);
3129 else if (VOID_TYPE_P (arg2_type) && VOID_TYPE_P (arg3_type))
3130 result_type = void_type_node;
3133 error ("`%E' has type `void' and is not a throw-expression",
3134 VOID_TYPE_P (arg2_type) ? arg2 : arg3);
3135 return error_mark_node;
3139 goto valid_operands;
3143 Otherwise, if the second and third operand have different types,
3144 and either has (possibly cv-qualified) class type, an attempt is
3145 made to convert each of those operands to the type of the other. */
3146 else if (!same_type_p (arg2_type, arg3_type)
3147 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
3149 tree conv2 = conditional_conversion (arg2, arg3);
3150 tree conv3 = conditional_conversion (arg3, arg2);
3154 If both can be converted, or one can be converted but the
3155 conversion is ambiguous, the program is ill-formed. If
3156 neither can be converted, the operands are left unchanged and
3157 further checking is performed as described below. If exactly
3158 one conversion is possible, that conversion is applied to the
3159 chosen operand and the converted operand is used in place of
3160 the original operand for the remainder of this section. */
3161 if ((conv2 && !ICS_BAD_FLAG (conv2)
3162 && conv3 && !ICS_BAD_FLAG (conv3))
3163 || (conv2 && TREE_CODE (conv2) == AMBIG_CONV)
3164 || (conv3 && TREE_CODE (conv3) == AMBIG_CONV))
3166 error ("operands to ?: have different types");
3167 return error_mark_node;
3169 else if (conv2 && !ICS_BAD_FLAG (conv2))
3171 arg2 = convert_like (conv2, arg2);
3172 arg2 = convert_from_reference (arg2);
3173 if (!same_type_p (TREE_TYPE (arg2), arg3_type)
3174 && CLASS_TYPE_P (arg3_type))
3175 /* The types need to match if we're converting to a class type.
3176 If not, we don't care about cv-qual mismatches, since
3177 non-class rvalues are not cv-qualified. */
3179 arg2_type = TREE_TYPE (arg2);
3181 else if (conv3 && !ICS_BAD_FLAG (conv3))
3183 arg3 = convert_like (conv3, arg3);
3184 arg3 = convert_from_reference (arg3);
3185 if (!same_type_p (TREE_TYPE (arg3), arg2_type)
3186 && CLASS_TYPE_P (arg2_type))
3188 arg3_type = TREE_TYPE (arg3);
3194 If the second and third operands are lvalues and have the same
3195 type, the result is of that type and is an lvalue. */
3196 if (real_lvalue_p (arg2) && real_lvalue_p (arg3) &&
3197 same_type_p (arg2_type, arg3_type))
3199 result_type = arg2_type;
3200 goto valid_operands;
3205 Otherwise, the result is an rvalue. If the second and third
3206 operand do not have the same type, and either has (possibly
3207 cv-qualified) class type, overload resolution is used to
3208 determine the conversions (if any) to be applied to the operands
3209 (_over.match.oper_, _over.built_). */
3211 if (!same_type_p (arg2_type, arg3_type)
3212 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
3218 /* Rearrange the arguments so that add_builtin_candidate only has
3219 to know about two args. In build_builtin_candidates, the
3220 arguments are unscrambled. */
3224 add_builtin_candidates (&candidates,
3227 ansi_opname (COND_EXPR),
3233 If the overload resolution fails, the program is
3235 candidates = splice_viable (candidates, pedantic, &any_viable_p);
3238 op_error (COND_EXPR, NOP_EXPR, arg1, arg2, arg3, "no match");
3239 print_z_candidates (candidates);
3240 return error_mark_node;
3242 cand = tourney (candidates);
3245 op_error (COND_EXPR, NOP_EXPR, arg1, arg2, arg3, "no match");
3246 print_z_candidates (candidates);
3247 return error_mark_node;
3252 Otherwise, the conversions thus determined are applied, and
3253 the converted operands are used in place of the original
3254 operands for the remainder of this section. */
3255 conv = TREE_VEC_ELT (cand->convs, 0);
3256 arg1 = convert_like (conv, arg1);
3257 conv = TREE_VEC_ELT (cand->convs, 1);
3258 arg2 = convert_like (conv, arg2);
3259 conv = TREE_VEC_ELT (cand->convs, 2);
3260 arg3 = convert_like (conv, arg3);
3265 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
3266 and function-to-pointer (_conv.func_) standard conversions are
3267 performed on the second and third operands.
3269 We need to force the lvalue-to-rvalue conversion here for class types,
3270 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
3271 that isn't wrapped with a TARGET_EXPR plays havoc with exception
3274 We use ocp_convert rather than build_user_type_conversion because the
3275 latter returns NULL_TREE on failure, while the former gives an error. */
3277 arg2 = force_rvalue (arg2);
3278 arg2_type = TREE_TYPE (arg2);
3280 arg3 = force_rvalue (arg3);
3281 arg3_type = TREE_TYPE (arg3);
3283 if (arg2 == error_mark_node || arg3 == error_mark_node)
3284 return error_mark_node;
3288 After those conversions, one of the following shall hold:
3290 --The second and third operands have the same type; the result is of
3292 if (same_type_p (arg2_type, arg3_type))
3293 result_type = arg2_type;
3296 --The second and third operands have arithmetic or enumeration
3297 type; the usual arithmetic conversions are performed to bring
3298 them to a common type, and the result is of that type. */
3299 else if ((ARITHMETIC_TYPE_P (arg2_type)
3300 || TREE_CODE (arg2_type) == ENUMERAL_TYPE)
3301 && (ARITHMETIC_TYPE_P (arg3_type)
3302 || TREE_CODE (arg3_type) == ENUMERAL_TYPE))
3304 /* In this case, there is always a common type. */
3305 result_type = type_after_usual_arithmetic_conversions (arg2_type,
3308 if (TREE_CODE (arg2_type) == ENUMERAL_TYPE
3309 && TREE_CODE (arg3_type) == ENUMERAL_TYPE)
3310 warning ("enumeral mismatch in conditional expression: `%T' vs `%T'",
3311 arg2_type, arg3_type);
3312 else if (extra_warnings
3313 && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE
3314 && !same_type_p (arg3_type, type_promotes_to (arg2_type)))
3315 || (TREE_CODE (arg3_type) == ENUMERAL_TYPE
3316 && !same_type_p (arg2_type, type_promotes_to (arg3_type)))))
3317 warning ("enumeral and non-enumeral type in conditional expression");
3319 arg2 = perform_implicit_conversion (result_type, arg2);
3320 arg3 = perform_implicit_conversion (result_type, arg3);
3324 --The second and third operands have pointer type, or one has
3325 pointer type and the other is a null pointer constant; pointer
3326 conversions (_conv.ptr_) and qualification conversions
3327 (_conv.qual_) are performed to bring them to their composite
3328 pointer type (_expr.rel_). The result is of the composite
3331 --The second and third operands have pointer to member type, or
3332 one has pointer to member type and the other is a null pointer
3333 constant; pointer to member conversions (_conv.mem_) and
3334 qualification conversions (_conv.qual_) are performed to bring
3335 them to a common type, whose cv-qualification shall match the
3336 cv-qualification of either the second or the third operand.
3337 The result is of the common type. */
3338 else if ((null_ptr_cst_p (arg2)
3339 && (TYPE_PTR_P (arg3_type) || TYPE_PTR_TO_MEMBER_P (arg3_type)))
3340 || (null_ptr_cst_p (arg3)
3341 && (TYPE_PTR_P (arg2_type) || TYPE_PTR_TO_MEMBER_P (arg2_type)))
3342 || (TYPE_PTR_P (arg2_type) && TYPE_PTR_P (arg3_type))
3343 || (TYPE_PTRMEM_P (arg2_type) && TYPE_PTRMEM_P (arg3_type))
3344 || (TYPE_PTRMEMFUNC_P (arg2_type) && TYPE_PTRMEMFUNC_P (arg3_type)))
3346 result_type = composite_pointer_type (arg2_type, arg3_type, arg2,
3347 arg3, "conditional expression");
3348 if (result_type == error_mark_node)
3349 return error_mark_node;
3350 arg2 = perform_implicit_conversion (result_type, arg2);
3351 arg3 = perform_implicit_conversion (result_type, arg3);
3356 error ("operands to ?: have different types");
3357 return error_mark_node;
3361 result = fold (build (COND_EXPR, result_type, arg1, arg2, arg3));
3362 /* We can't use result_type below, as fold might have returned a
3365 /* Expand both sides into the same slot, hopefully the target of the
3366 ?: expression. We used to check for TARGET_EXPRs here, but now we
3367 sometimes wrap them in NOP_EXPRs so the test would fail. */
3368 if (!lvalue_p && IS_AGGR_TYPE (TREE_TYPE (result)))
3369 result = get_target_expr (result);
3371 /* If this expression is an rvalue, but might be mistaken for an
3372 lvalue, we must add a NON_LVALUE_EXPR. */
3373 if (!lvalue_p && real_lvalue_p (result))
3374 result = build1 (NON_LVALUE_EXPR, TREE_TYPE (result), result);
3379 /* OPERAND is an operand to an expression. Perform necessary steps
3380 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
3384 prep_operand (tree operand)
3388 operand = convert_from_reference (operand);
3389 if (CLASS_TYPE_P (TREE_TYPE (operand))
3390 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand)))
3391 /* Make sure the template type is instantiated now. */
3392 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand)));
3398 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
3399 OVERLOAD) to the CANDIDATES, returning an updated list of
3400 CANDIDATES. The ARGS are the arguments provided to the call,
3401 without any implicit object parameter. The EXPLICIT_TARGS are
3402 explicit template arguments provided. TEMPLATE_ONLY is true if
3403 only template fucntions should be considered. CONVERSION_PATH,
3404 ACCESS_PATH, and FLAGS are as for add_function_candidate. */
3407 add_candidates (tree fns, tree args,
3408 tree explicit_targs, bool template_only,
3409 tree conversion_path, tree access_path,
3411 struct z_candidate **candidates)
3414 tree non_static_args;
3416 ctype = conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE;
3417 /* Delay creating the implicit this parameter until it is needed. */
3418 non_static_args = NULL_TREE;
3425 fn = OVL_CURRENT (fns);
3426 /* Figure out which set of arguments to use. */
3427 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
3429 /* If this function is a non-static member, prepend the implicit
3430 object parameter. */
3431 if (!non_static_args)
3432 non_static_args = tree_cons (NULL_TREE,
3433 build_this (TREE_VALUE (args)),
3435 fn_args = non_static_args;
3438 /* Otherwise, just use the list of arguments provided. */
3441 if (TREE_CODE (fn) == TEMPLATE_DECL)
3442 add_template_candidate (candidates,
3452 else if (!template_only)
3453 add_function_candidate (candidates,
3460 fns = OVL_NEXT (fns);
3465 build_new_op (enum tree_code code, int flags, tree arg1, tree arg2, tree arg3)
3467 struct z_candidate *candidates = 0, *cand;
3468 tree arglist, fnname;
3470 enum tree_code code2 = NOP_EXPR;
3475 if (error_operand_p (arg1)
3476 || error_operand_p (arg2)
3477 || error_operand_p (arg3))
3478 return error_mark_node;
3480 if (code == MODIFY_EXPR)
3482 code2 = TREE_CODE (arg3);
3484 fnname = ansi_assopname (code2);
3487 fnname = ansi_opname (code);
3489 arg1 = prep_operand (arg1);
3495 case VEC_DELETE_EXPR:
3497 /* Use build_op_new_call and build_op_delete_call instead. */
3501 return build_object_call (arg1, arg2);
3507 arg2 = prep_operand (arg2);
3508 arg3 = prep_operand (arg3);
3510 if (code == COND_EXPR)
3512 if (arg2 == NULL_TREE
3513 || TREE_CODE (TREE_TYPE (arg2)) == VOID_TYPE
3514 || TREE_CODE (TREE_TYPE (arg3)) == VOID_TYPE
3515 || (! IS_OVERLOAD_TYPE (TREE_TYPE (arg2))
3516 && ! IS_OVERLOAD_TYPE (TREE_TYPE (arg3))))
3519 else if (! IS_OVERLOAD_TYPE (TREE_TYPE (arg1))
3520 && (! arg2 || ! IS_OVERLOAD_TYPE (TREE_TYPE (arg2))))
3523 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
3524 arg2 = integer_zero_node;
3526 arglist = NULL_TREE;
3528 arglist = tree_cons (NULL_TREE, arg3, arglist);
3530 arglist = tree_cons (NULL_TREE, arg2, arglist);
3531 arglist = tree_cons (NULL_TREE, arg1, arglist);
3533 /* Add namespace-scope operators to the list of functions to
3535 add_candidates (lookup_function_nonclass (fnname, arglist),
3536 arglist, NULL_TREE, false, NULL_TREE, NULL_TREE,
3537 flags, &candidates);
3538 /* Add class-member operators to the candidate set. */
3539 if (CLASS_TYPE_P (TREE_TYPE (arg1)))
3543 fns = lookup_fnfields (TYPE_BINFO (TREE_TYPE (arg1)), fnname, 1);
3544 if (fns == error_mark_node)
3547 add_candidates (BASELINK_FUNCTIONS (fns), arglist,
3549 BASELINK_BINFO (fns),
3550 TYPE_BINFO (TREE_TYPE (arg1)),
3551 flags, &candidates);
3554 /* Rearrange the arguments for ?: so that add_builtin_candidate only has
3555 to know about two args; a builtin candidate will always have a first
3556 parameter of type bool. We'll handle that in
3557 build_builtin_candidate. */
3558 if (code == COND_EXPR)
3568 args[2] = NULL_TREE;
3571 add_builtin_candidates (&candidates, code, code2, fnname, args, flags);
3577 /* For these, the built-in candidates set is empty
3578 [over.match.oper]/3. We don't want non-strict matches
3579 because exact matches are always possible with built-in
3580 operators. The built-in candidate set for COMPONENT_REF
3581 would be empty too, but since there are no such built-in
3582 operators, we accept non-strict matches for them. */
3587 strict_p = pedantic;
3591 candidates = splice_viable (candidates, strict_p, &any_viable_p);
3596 case POSTINCREMENT_EXPR:
3597 case POSTDECREMENT_EXPR:
3598 /* Look for an `operator++ (int)'. If they didn't have
3599 one, then we fall back to the old way of doing things. */
3600 if (flags & LOOKUP_COMPLAIN)
3601 pedwarn ("no `%D(int)' declared for postfix `%s', trying prefix operator instead",
3603 operator_name_info[code].name);
3604 if (code == POSTINCREMENT_EXPR)
3605 code = PREINCREMENT_EXPR;
3607 code = PREDECREMENT_EXPR;
3608 return build_new_op (code, flags, arg1, NULL_TREE, NULL_TREE);
3610 /* The caller will deal with these. */
3619 if (flags & LOOKUP_COMPLAIN)
3621 op_error (code, code2, arg1, arg2, arg3, "no match");
3622 print_z_candidates (candidates);
3624 return error_mark_node;
3627 cand = tourney (candidates);
3630 if (flags & LOOKUP_COMPLAIN)
3632 op_error (code, code2, arg1, arg2, arg3, "ambiguous overload");
3633 print_z_candidates (candidates);
3635 return error_mark_node;
3638 if (TREE_CODE (cand->fn) == FUNCTION_DECL)
3641 && fnname == ansi_assopname (NOP_EXPR)
3642 && DECL_ARTIFICIAL (cand->fn)
3644 && ! candidates->next->next)
3646 warning ("using synthesized `%#D' for copy assignment",
3648 cp_warning_at (" where cfront would use `%#D'",
3650 ? candidates->next->fn
3654 return build_over_call (cand, LOOKUP_NORMAL);
3657 /* Check for comparison of different enum types. */
3666 if (TREE_CODE (TREE_TYPE (arg1)) == ENUMERAL_TYPE
3667 && TREE_CODE (TREE_TYPE (arg2)) == ENUMERAL_TYPE
3668 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1))
3669 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2))))
3671 warning ("comparison between `%#T' and `%#T'",
3672 TREE_TYPE (arg1), TREE_TYPE (arg2));
3679 /* We need to strip any leading REF_BIND so that bitfields don't cause
3680 errors. This should not remove any important conversions, because
3681 builtins don't apply to class objects directly. */
3682 conv = TREE_VEC_ELT (cand->convs, 0);
3683 if (TREE_CODE (conv) == REF_BIND)
3684 conv = TREE_OPERAND (conv, 0);
3685 arg1 = convert_like (conv, arg1);
3688 conv = TREE_VEC_ELT (cand->convs, 1);
3689 if (TREE_CODE (conv) == REF_BIND)
3690 conv = TREE_OPERAND (conv, 0);
3691 arg2 = convert_like (conv, arg2);
3695 conv = TREE_VEC_ELT (cand->convs, 2);
3696 if (TREE_CODE (conv) == REF_BIND)
3697 conv = TREE_OPERAND (conv, 0);
3698 arg3 = convert_like (conv, arg3);
3705 return build_modify_expr (arg1, code2, arg2);
3708 return build_indirect_ref (arg1, "unary *");
3713 case TRUNC_DIV_EXPR:
3724 case TRUNC_MOD_EXPR:
3728 case TRUTH_ANDIF_EXPR:
3729 case TRUTH_ORIF_EXPR:
3730 return cp_build_binary_op (code, arg1, arg2);
3735 case TRUTH_NOT_EXPR:
3736 case PREINCREMENT_EXPR:
3737 case POSTINCREMENT_EXPR:
3738 case PREDECREMENT_EXPR:
3739 case POSTDECREMENT_EXPR:
3742 return build_unary_op (code, arg1, candidates != 0);
3745 return build_array_ref (arg1, arg2);
3748 return build_conditional_expr (arg1, arg2, arg3);
3751 return build_m_component_ref
3752 (build_indirect_ref (arg1, NULL), arg2);
3754 /* The caller will deal with these. */
3766 /* Build a call to operator delete. This has to be handled very specially,
3767 because the restrictions on what signatures match are different from all
3768 other call instances. For a normal delete, only a delete taking (void *)
3769 or (void *, size_t) is accepted. For a placement delete, only an exact
3770 match with the placement new is accepted.
3772 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
3773 ADDR is the pointer to be deleted.
3774 SIZE is the size of the memory block to be deleted.
3775 FLAGS are the usual overloading flags.
3776 PLACEMENT is the corresponding placement new call, or NULL_TREE. */
3779 build_op_delete_call (enum tree_code code, tree addr, tree size,
3780 int flags, tree placement)
3782 tree fn = NULL_TREE;
3783 tree fns, fnname, argtypes, args, type;
3786 if (addr == error_mark_node)
3787 return error_mark_node;
3789 type = strip_array_types (TREE_TYPE (TREE_TYPE (addr)));
3791 fnname = ansi_opname (code);
3793 if (IS_AGGR_TYPE (type) && ! (flags & LOOKUP_GLOBAL))
3796 If the result of the lookup is ambiguous or inaccessible, or if
3797 the lookup selects a placement deallocation function, the
3798 program is ill-formed.
3800 Therefore, we ask lookup_fnfields to complain ambout ambiguity. */
3802 fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1);
3803 if (fns == error_mark_node)
3804 return error_mark_node;
3809 if (fns == NULL_TREE)
3810 fns = lookup_name_nonclass (fnname);
3817 /* Find the allocation function that is being called. */
3818 call_expr = placement;
3819 /* Sometimes we have a COMPOUND_EXPR, rather than a simple
3821 while (TREE_CODE (call_expr) == COMPOUND_EXPR)
3822 call_expr = TREE_OPERAND (call_expr, 1);
3823 /* Extract the function. */
3824 alloc_fn = get_callee_fndecl (call_expr);
3825 my_friendly_assert (alloc_fn != NULL_TREE, 20020327);
3826 /* Then the second parm type. */
3827 argtypes = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (alloc_fn)));
3828 /* Also the second argument. */
3829 args = TREE_CHAIN (TREE_OPERAND (call_expr, 1));
3833 /* First try it without the size argument. */
3834 argtypes = void_list_node;
3838 /* Strip const and volatile from addr. */
3839 addr = cp_convert (ptr_type_node, addr);
3841 /* We make two tries at finding a matching `operator delete'. On
3842 the first pass, we look for a one-operator (or placement)
3843 operator delete. If we're not doing placement delete, then on
3844 the second pass we look for a two-argument delete. */
3845 for (pass = 0; pass < (placement ? 1 : 2); ++pass)
3847 /* Go through the `operator delete' functions looking for one
3848 with a matching type. */
3849 for (fn = BASELINK_P (fns) ? BASELINK_FUNCTIONS (fns) : fns;
3855 /* The first argument must be "void *". */
3856 t = TYPE_ARG_TYPES (TREE_TYPE (OVL_CURRENT (fn)));
3857 if (!same_type_p (TREE_VALUE (t), ptr_type_node))
3860 /* On the first pass, check the rest of the arguments. */
3863 while (argtypes && t)
3865 if (!same_type_p (TREE_VALUE (argtypes),
3868 argtypes = TREE_CHAIN (argtypes);
3871 if (!argtypes && !t)
3874 /* On the second pass, the second argument must be
3877 && same_type_p (TREE_VALUE (t), sizetype)
3878 && TREE_CHAIN (t) == void_list_node)
3882 /* If we found a match, we're done. */
3887 /* If we have a matching function, call it. */
3890 /* Make sure we have the actual function, and not an
3892 fn = OVL_CURRENT (fn);
3894 /* If the FN is a member function, make sure that it is
3896 if (DECL_CLASS_SCOPE_P (fn))
3897 perform_or_defer_access_check (TYPE_BINFO (type), fn);
3900 args = tree_cons (NULL_TREE, addr, args);
3902 args = tree_cons (NULL_TREE, addr,
3903 build_tree_list (NULL_TREE, size));
3905 return build_function_call (fn, args);
3908 /* If we are doing placement delete we do nothing if we don't find a
3909 matching op delete. */
3913 error ("no suitable `operator %s' for `%T'",
3914 operator_name_info[(int)code].name, type);
3915 return error_mark_node;
3918 /* If the current scope isn't allowed to access DECL along
3919 BASETYPE_PATH, give an error. The most derived class in
3920 BASETYPE_PATH is the one used to qualify DECL. */
3923 enforce_access (tree basetype_path, tree decl)
3925 my_friendly_assert (TREE_CODE (basetype_path) == TREE_VEC, 20030624);
3927 if (!accessible_p (basetype_path, decl))
3929 if (TREE_PRIVATE (decl))
3930 cp_error_at ("`%+#D' is private", decl);
3931 else if (TREE_PROTECTED (decl))
3932 cp_error_at ("`%+#D' is protected", decl);
3934 cp_error_at ("`%+#D' is inaccessible", decl);
3935 error ("within this context");
3942 /* Perform the conversions in CONVS on the expression EXPR. FN and
3943 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
3944 indicates the `this' argument of a method. INNER is nonzero when
3945 being called to continue a conversion chain. It is negative when a
3946 reference binding will be applied, positive otherwise. If
3947 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
3948 conversions will be emitted if appropriate. */
3951 convert_like_real (tree convs, tree expr, tree fn, int argnum, int inner,
3952 bool issue_conversion_warnings)
3956 tree totype = TREE_TYPE (convs);
3958 if (ICS_BAD_FLAG (convs)
3959 && TREE_CODE (convs) != USER_CONV
3960 && TREE_CODE (convs) != AMBIG_CONV
3961 && TREE_CODE (convs) != REF_BIND)
3964 for (; t; t = TREE_OPERAND (t, 0))
3966 if (TREE_CODE (t) == USER_CONV || !ICS_BAD_FLAG (t))
3968 expr = convert_like_real (t, expr, fn, argnum, 1,
3969 /*issue_conversion_warnings=*/false);
3972 else if (TREE_CODE (t) == AMBIG_CONV)
3973 return convert_like_real (t, expr, fn, argnum, 1,
3974 /*issue_conversion_warnings=*/false);
3975 else if (TREE_CODE (t) == IDENTITY_CONV)
3978 pedwarn ("invalid conversion from `%T' to `%T'", TREE_TYPE (expr), totype);
3980 pedwarn (" initializing argument %P of `%D'", argnum, fn);
3981 return cp_convert (totype, expr);
3984 if (issue_conversion_warnings)
3985 expr = dubious_conversion_warnings
3986 (totype, expr, "argument", fn, argnum);
3987 switch (TREE_CODE (convs))
3991 struct z_candidate *cand = USER_CONV_CAND (convs);
3992 tree convfn = cand->fn;
3995 if (DECL_CONSTRUCTOR_P (convfn))
3997 tree t = build_int_2 (0, 0);
3998 TREE_TYPE (t) = build_pointer_type (DECL_CONTEXT (convfn));
4000 args = build_tree_list (NULL_TREE, expr);
4001 if (DECL_HAS_IN_CHARGE_PARM_P (convfn)
4002 || DECL_HAS_VTT_PARM_P (convfn))
4003 /* We should never try to call the abstract or base constructor
4006 args = tree_cons (NULL_TREE, t, args);
4009 args = build_this (expr);
4010 expr = build_over_call (cand, LOOKUP_NORMAL);
4012 /* If this is a constructor or a function returning an aggr type,
4013 we need to build up a TARGET_EXPR. */
4014 if (DECL_CONSTRUCTOR_P (convfn))
4015 expr = build_cplus_new (totype, expr);
4017 /* The result of the call is then used to direct-initialize the object
4018 that is the destination of the copy-initialization. [dcl.init]
4020 Note that this step is not reflected in the conversion sequence;
4021 it affects the semantics when we actually perform the
4022 conversion, but is not considered during overload resolution.
4024 If the target is a class, that means call a ctor. */
4025 if (IS_AGGR_TYPE (totype)
4026 && (inner >= 0 || !lvalue_p (expr)))
4028 savew = warningcount, savee = errorcount;
4029 expr = build_special_member_call
4030 (NULL_TREE, complete_ctor_identifier,
4031 build_tree_list (NULL_TREE, expr), TYPE_BINFO (totype),
4032 /* Core issue 84, now a DR, says that we don't allow UDCs
4033 for these args (which deliberately breaks copy-init of an
4034 auto_ptr<Base> from an auto_ptr<Derived>). */
4035 LOOKUP_NORMAL|LOOKUP_ONLYCONVERTING|LOOKUP_NO_CONVERSION);
4037 /* Tell the user where this failing constructor call came from. */
4040 if (warningcount > savew)
4042 (" initializing argument %P of `%D' from result of `%D'",
4043 argnum, fn, convfn);
4044 else if (errorcount > savee)
4046 (" initializing argument %P of `%D' from result of `%D'",
4047 argnum, fn, convfn);
4051 if (warningcount > savew)
4052 warning (" initializing temporary from result of `%D'",
4054 else if (errorcount > savee)
4055 error (" initializing temporary from result of `%D'",
4058 expr = build_cplus_new (totype, expr);
4063 if (type_unknown_p (expr))
4064 expr = instantiate_type (totype, expr, tf_error | tf_warning);
4065 /* Convert a non-array constant variable to its underlying value, unless we
4066 are about to bind it to a reference, in which case we need to
4067 leave it as an lvalue. */
4069 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
4070 expr = decl_constant_value (expr);
4073 /* Call build_user_type_conversion again for the error. */
4074 return build_user_type_conversion
4075 (totype, TREE_OPERAND (convs, 0), LOOKUP_NORMAL);
4081 expr = convert_like_real (TREE_OPERAND (convs, 0), expr, fn, argnum,
4082 TREE_CODE (convs) == REF_BIND ? -1 : 1,
4083 /*issue_conversion_warnings=*/false);
4084 if (expr == error_mark_node)
4085 return error_mark_node;
4087 switch (TREE_CODE (convs))
4090 if (! IS_AGGR_TYPE (totype))
4092 /* else fall through */
4094 if (TREE_CODE (convs) == BASE_CONV && !NEED_TEMPORARY_P (convs))
4096 /* We are going to bind a reference directly to a base-class
4097 subobject of EXPR. */
4098 tree base_ptr = build_pointer_type (totype);
4100 /* Build an expression for `*((base*) &expr)'. */
4101 expr = build_unary_op (ADDR_EXPR, expr, 0);
4102 expr = perform_implicit_conversion (base_ptr, expr);
4103 expr = build_indirect_ref (expr, "implicit conversion");
4107 /* Copy-initialization where the cv-unqualified version of the source
4108 type is the same class as, or a derived class of, the class of the
4109 destination [is treated as direct-initialization]. [dcl.init] */
4110 savew = warningcount, savee = errorcount;
4111 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
4112 build_tree_list (NULL_TREE, expr),
4113 TYPE_BINFO (totype),
4114 LOOKUP_NORMAL|LOOKUP_ONLYCONVERTING);
4117 if (warningcount > savew)
4118 warning (" initializing argument %P of `%D'", argnum, fn);
4119 else if (errorcount > savee)
4120 error (" initializing argument %P of `%D'", argnum, fn);
4122 return build_cplus_new (totype, expr);
4126 tree ref_type = totype;
4128 /* If necessary, create a temporary. */
4129 if (NEED_TEMPORARY_P (convs) || !non_cast_lvalue_p (expr))
4131 tree type = TREE_TYPE (TREE_OPERAND (convs, 0));
4133 if (!CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type)))
4135 /* If the reference is volatile or non-const, we
4136 cannot create a temporary. */
4137 cp_lvalue_kind lvalue = real_lvalue_p (expr);
4139 if (lvalue & clk_bitfield)
4140 error ("cannot bind bitfield `%E' to `%T'",
4142 else if (lvalue & clk_packed)
4143 error ("cannot bind packed field `%E' to `%T'",
4146 error ("cannot bind rvalue `%E' to `%T'", expr, ref_type);
4147 return error_mark_node;
4149 expr = build_target_expr_with_type (expr, type);
4152 /* Take the address of the thing to which we will bind the
4154 expr = build_unary_op (ADDR_EXPR, expr, 1);
4155 if (expr == error_mark_node)
4156 return error_mark_node;
4158 /* Convert it to a pointer to the type referred to by the
4159 reference. This will adjust the pointer if a derived to
4160 base conversion is being performed. */
4161 expr = cp_convert (build_pointer_type (TREE_TYPE (ref_type)),
4163 /* Convert the pointer to the desired reference type. */
4164 return build_nop (ref_type, expr);
4168 return decay_conversion (expr);
4171 /* Warn about deprecated conversion if appropriate. */
4172 string_conv_p (totype, expr, 1);
4178 return ocp_convert (totype, expr, CONV_IMPLICIT,
4179 LOOKUP_NORMAL|LOOKUP_NO_CONVERSION);
4182 /* Build a call to __builtin_trap which can be used in an expression. */
4185 call_builtin_trap (void)
4187 tree fn = get_identifier ("__builtin_trap");
4188 if (IDENTIFIER_GLOBAL_VALUE (fn))
4189 fn = IDENTIFIER_GLOBAL_VALUE (fn);
4193 fn = build_call (fn, NULL_TREE);
4194 fn = build (COMPOUND_EXPR, integer_type_node, fn, integer_zero_node);
4198 /* ARG is being passed to a varargs function. Perform any conversions
4199 required. Return the converted value. */
4202 convert_arg_to_ellipsis (tree arg)
4206 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
4207 standard conversions are performed. */
4208 arg = decay_conversion (arg);
4211 If the argument has integral or enumeration type that is subject
4212 to the integral promotions (_conv.prom_), or a floating point
4213 type that is subject to the floating point promotion
4214 (_conv.fpprom_), the value of the argument is converted to the
4215 promoted type before the call. */
4216 if (TREE_CODE (TREE_TYPE (arg)) == REAL_TYPE
4217 && (TYPE_PRECISION (TREE_TYPE (arg))
4218 < TYPE_PRECISION (double_type_node)))
4219 arg = convert_to_real (double_type_node, arg);
4220 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (arg)))
4221 arg = perform_integral_promotions (arg);
4223 arg = require_complete_type (arg);
4225 if (arg != error_mark_node && ! pod_type_p (TREE_TYPE (arg)))
4227 /* Undefined behavior [expr.call] 5.2.2/7. We used to just warn
4228 here and do a bitwise copy, but now cp_expr_size will abort if we
4230 warning ("cannot pass objects of non-POD type `%#T' through `...'; \
4231 call will abort at runtime",
4233 arg = call_builtin_trap ();
4239 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
4242 build_x_va_arg (tree expr, tree type)
4244 if (processing_template_decl)
4245 return build_min (VA_ARG_EXPR, type, expr);
4247 type = complete_type_or_else (type, NULL_TREE);
4249 if (expr == error_mark_node || !type)
4250 return error_mark_node;
4252 if (! pod_type_p (type))
4254 /* Undefined behavior [expr.call] 5.2.2/7. */
4255 warning ("cannot receive objects of non-POD type `%#T' through `...'",
4259 return build_va_arg (expr, type);
4262 /* TYPE has been given to va_arg. Apply the default conversions which
4263 would have happened when passed via ellipsis. Return the promoted
4264 type, or the passed type if there is no change. */
4267 cxx_type_promotes_to (tree type)
4271 if (TREE_CODE (type) == ARRAY_TYPE)
4272 return build_pointer_type (TREE_TYPE (type));
4274 if (TREE_CODE (type) == FUNCTION_TYPE)
4275 return build_pointer_type (type);
4277 promote = type_promotes_to (type);
4278 if (same_type_p (type, promote))
4284 /* ARG is a default argument expression being passed to a parameter of
4285 the indicated TYPE, which is a parameter to FN. Do any required
4286 conversions. Return the converted value. */
4289 convert_default_arg (tree type, tree arg, tree fn, int parmnum)
4291 /* If the ARG is an unparsed default argument expression, the
4292 conversion cannot be performed. */
4293 if (TREE_CODE (arg) == DEFAULT_ARG)
4295 error ("the default argument for parameter %d of `%D' has "
4296 "not yet been parsed",
4298 return error_mark_node;
4301 if (fn && DECL_TEMPLATE_INFO (fn))
4302 arg = tsubst_default_argument (fn, type, arg);
4304 arg = break_out_target_exprs (arg);
4306 if (TREE_CODE (arg) == CONSTRUCTOR)
4308 arg = digest_init (type, arg, 0);
4309 arg = convert_for_initialization (0, type, arg, LOOKUP_NORMAL,
4310 "default argument", fn, parmnum);
4314 /* This could get clobbered by the following call. */
4315 if (TREE_HAS_CONSTRUCTOR (arg))
4316 arg = copy_node (arg);
4318 arg = convert_for_initialization (0, type, arg, LOOKUP_NORMAL,
4319 "default argument", fn, parmnum);
4320 arg = convert_for_arg_passing (type, arg);
4326 /* Returns the type which will really be used for passing an argument of
4330 type_passed_as (tree type)
4332 /* Pass classes with copy ctors by invisible reference. */
4333 if (TREE_ADDRESSABLE (type))
4334 type = build_reference_type (type);
4335 else if (PROMOTE_PROTOTYPES
4336 && INTEGRAL_TYPE_P (type)
4337 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type),
4338 TYPE_SIZE (integer_type_node)))
4339 type = integer_type_node;
4344 /* Actually perform the appropriate conversion. */
4347 convert_for_arg_passing (tree type, tree val)
4349 if (val == error_mark_node)
4351 /* Pass classes with copy ctors by invisible reference. */
4352 else if (TREE_ADDRESSABLE (type))
4353 val = build1 (ADDR_EXPR, build_reference_type (type), val);
4354 else if (PROMOTE_PROTOTYPES
4355 && INTEGRAL_TYPE_P (type)
4356 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type),
4357 TYPE_SIZE (integer_type_node)))
4358 val = perform_integral_promotions (val);
4362 /* Subroutine of the various build_*_call functions. Overload resolution
4363 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
4364 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
4365 bitmask of various LOOKUP_* flags which apply to the call itself. */
4368 build_over_call (struct z_candidate *cand, int flags)
4371 tree args = cand->args;
4372 tree convs = cand->convs;
4373 tree converted_args = NULL_TREE;
4374 tree parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
4375 tree conv, arg, val;
4379 /* Give any warnings we noticed during overload resolution. */
4381 for (val = cand->warnings; val; val = TREE_CHAIN (val))
4382 joust (cand, WRAPPER_ZC (TREE_VALUE (val)), 1);
4384 if (DECL_FUNCTION_MEMBER_P (fn))
4385 perform_or_defer_access_check (cand->access_path, fn);
4387 if (args && TREE_CODE (args) != TREE_LIST)
4388 args = build_tree_list (NULL_TREE, args);
4391 /* The implicit parameters to a constructor are not considered by overload
4392 resolution, and must be of the proper type. */
4393 if (DECL_CONSTRUCTOR_P (fn))
4395 converted_args = tree_cons (NULL_TREE, TREE_VALUE (arg), converted_args);
4396 arg = TREE_CHAIN (arg);
4397 parm = TREE_CHAIN (parm);
4398 if (DECL_HAS_IN_CHARGE_PARM_P (fn))
4399 /* We should never try to call the abstract constructor. */
4401 if (DECL_HAS_VTT_PARM_P (fn))
4403 converted_args = tree_cons
4404 (NULL_TREE, TREE_VALUE (arg), converted_args);
4405 arg = TREE_CHAIN (arg);
4406 parm = TREE_CHAIN (parm);
4409 /* Bypass access control for 'this' parameter. */
4410 else if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
4412 tree parmtype = TREE_VALUE (parm);
4413 tree argtype = TREE_TYPE (TREE_VALUE (arg));
4417 if (ICS_BAD_FLAG (TREE_VEC_ELT (convs, i)))
4418 pedwarn ("passing `%T' as `this' argument of `%#D' discards qualifiers",
4419 TREE_TYPE (argtype), fn);
4421 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
4422 X is called for an object that is not of type X, or of a type
4423 derived from X, the behavior is undefined.
4425 So we can assume that anything passed as 'this' is non-null, and
4426 optimize accordingly. */
4427 my_friendly_assert (TREE_CODE (parmtype) == POINTER_TYPE, 19990811);
4428 /* Convert to the base in which the function was declared. */
4429 my_friendly_assert (cand->conversion_path != NULL_TREE, 20020730);
4430 converted_arg = build_base_path (PLUS_EXPR,
4432 cand->conversion_path,
4434 /* Check that the base class is accessible. */
4435 if (!accessible_base_p (TREE_TYPE (argtype),
4436 BINFO_TYPE (cand->conversion_path)))
4437 error ("`%T' is not an accessible base of `%T'",
4438 BINFO_TYPE (cand->conversion_path),
4439 TREE_TYPE (argtype));
4440 /* If fn was found by a using declaration, the conversion path
4441 will be to the derived class, not the base declaring fn. We
4442 must convert from derived to base. */
4443 base_binfo = lookup_base (TREE_TYPE (TREE_TYPE (converted_arg)),
4444 TREE_TYPE (parmtype), ba_ignore, NULL);
4445 converted_arg = build_base_path (PLUS_EXPR, converted_arg,
4448 converted_args = tree_cons (NULL_TREE, converted_arg, converted_args);
4449 parm = TREE_CHAIN (parm);
4450 arg = TREE_CHAIN (arg);
4456 parm = TREE_CHAIN (parm), arg = TREE_CHAIN (arg), ++i)
4458 tree type = TREE_VALUE (parm);
4460 conv = TREE_VEC_ELT (convs, i);
4461 val = convert_like_with_context
4462 (conv, TREE_VALUE (arg), fn, i - is_method);
4464 val = convert_for_arg_passing (type, val);
4465 converted_args = tree_cons (NULL_TREE, val, converted_args);
4468 /* Default arguments */
4469 for (; parm && parm != void_list_node; parm = TREE_CHAIN (parm), i++)
4471 = tree_cons (NULL_TREE,
4472 convert_default_arg (TREE_VALUE (parm),
4473 TREE_PURPOSE (parm),
4478 for (; arg; arg = TREE_CHAIN (arg))
4480 = tree_cons (NULL_TREE,
4481 convert_arg_to_ellipsis (TREE_VALUE (arg)),
4484 converted_args = nreverse (converted_args);
4487 check_function_format (NULL, TYPE_ATTRIBUTES (TREE_TYPE (fn)),
4490 /* Avoid actually calling copy constructors and copy assignment operators,
4493 if (! flag_elide_constructors)
4494 /* Do things the hard way. */;
4495 else if (TREE_VEC_LENGTH (convs) == 1
4496 && DECL_COPY_CONSTRUCTOR_P (fn))
4499 arg = skip_artificial_parms_for (fn, converted_args);
4500 arg = TREE_VALUE (arg);
4502 /* Pull out the real argument, disregarding const-correctness. */
4504 while (TREE_CODE (targ) == NOP_EXPR
4505 || TREE_CODE (targ) == NON_LVALUE_EXPR
4506 || TREE_CODE (targ) == CONVERT_EXPR)
4507 targ = TREE_OPERAND (targ, 0);
4508 if (TREE_CODE (targ) == ADDR_EXPR)
4510 targ = TREE_OPERAND (targ, 0);
4511 if (!same_type_ignoring_top_level_qualifiers_p
4512 (TREE_TYPE (TREE_TYPE (arg)), TREE_TYPE (targ)))
4521 arg = build_indirect_ref (arg, 0);
4523 /* [class.copy]: the copy constructor is implicitly defined even if
4524 the implementation elided its use. */
4525 if (TYPE_HAS_COMPLEX_INIT_REF (DECL_CONTEXT (fn)))
4528 /* If we're creating a temp and we already have one, don't create a
4529 new one. If we're not creating a temp but we get one, use
4530 INIT_EXPR to collapse the temp into our target. Otherwise, if the
4531 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
4532 temp or an INIT_EXPR otherwise. */
4533 if (integer_zerop (TREE_VALUE (args)))
4535 if (TREE_CODE (arg) == TARGET_EXPR)
4537 else if (TYPE_HAS_TRIVIAL_INIT_REF (DECL_CONTEXT (fn)))
4538 return build_target_expr_with_type (arg, DECL_CONTEXT (fn));
4540 else if (TREE_CODE (arg) == TARGET_EXPR
4541 || TYPE_HAS_TRIVIAL_INIT_REF (DECL_CONTEXT (fn)))
4544 tree to = stabilize_reference
4545 (build_indirect_ref (TREE_VALUE (args), 0));
4547 val = build (INIT_EXPR, DECL_CONTEXT (fn), to, arg);
4548 address = build_unary_op (ADDR_EXPR, val, 0);
4549 /* Avoid a warning about this expression, if the address is
4551 TREE_USED (address) = 1;
4555 else if (DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR
4557 && TYPE_HAS_TRIVIAL_ASSIGN_REF (DECL_CONTEXT (fn)))
4559 tree to = stabilize_reference
4560 (build_indirect_ref (TREE_VALUE (converted_args), 0));
4562 arg = build_indirect_ref (TREE_VALUE (TREE_CHAIN (converted_args)), 0);
4563 val = build (MODIFY_EXPR, TREE_TYPE (to), to, arg);
4569 if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0)
4571 tree t, *p = &TREE_VALUE (converted_args);
4572 tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (*p)),
4575 my_friendly_assert (binfo && binfo != error_mark_node, 20010730);
4577 *p = build_base_path (PLUS_EXPR, *p, binfo, 1);
4578 if (TREE_SIDE_EFFECTS (*p))
4579 *p = save_expr (*p);
4580 t = build_pointer_type (TREE_TYPE (fn));
4581 if (DECL_CONTEXT (fn) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn)))
4582 fn = build_java_interface_fn_ref (fn, *p);
4584 fn = build_vfn_ref (build_indirect_ref (*p, 0), DECL_VINDEX (fn));
4587 else if (DECL_INLINE (fn))
4588 fn = inline_conversion (fn);
4590 fn = build_addr_func (fn);
4592 return build_cxx_call (fn, args, converted_args);
4595 /* Build and return a call to FN, using the the CONVERTED_ARGS. ARGS
4596 gives the original form of the arguments. This function performs
4597 no overload resolution, conversion, or other high-level
4601 build_cxx_call(tree fn, tree args, tree converted_args)
4605 /* Recognize certain built-in functions so we can make tree-codes
4606 other than CALL_EXPR. We do this when it enables fold-const.c
4607 to do something useful. */
4608 if (TREE_CODE (fn) == ADDR_EXPR
4609 && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL
4610 && DECL_BUILT_IN (TREE_OPERAND (fn, 0)))
4613 exp = expand_tree_builtin (TREE_OPERAND (fn, 0), args, converted_args);
4618 fn = build_call (fn, converted_args);
4620 /* If this call might throw an exception, note that fact. */
4621 fndecl = get_callee_fndecl (fn);
4622 if ((!fndecl || !TREE_NOTHROW (fndecl))
4623 && at_function_scope_p ()
4625 cp_function_chain->can_throw = 1;
4627 /* Some built-in function calls will be evaluated at compile-time in
4631 if (VOID_TYPE_P (TREE_TYPE (fn)))
4634 fn = require_complete_type (fn);
4635 if (fn == error_mark_node)
4636 return error_mark_node;
4638 if (IS_AGGR_TYPE (TREE_TYPE (fn)))
4639 fn = build_cplus_new (TREE_TYPE (fn), fn);
4640 return convert_from_reference (fn);
4643 static GTY(()) tree java_iface_lookup_fn;
4645 /* Make an expression which yields the address of the Java interface
4646 method FN. This is achieved by generating a call to libjava's
4647 _Jv_LookupInterfaceMethodIdx(). */
4650 build_java_interface_fn_ref (tree fn, tree instance)
4652 tree lookup_args, lookup_fn, method, idx;
4653 tree klass_ref, iface, iface_ref;
4656 if (!java_iface_lookup_fn)
4658 tree endlink = build_void_list_node ();
4659 tree t = tree_cons (NULL_TREE, ptr_type_node,
4660 tree_cons (NULL_TREE, ptr_type_node,
4661 tree_cons (NULL_TREE, java_int_type_node,
4663 java_iface_lookup_fn
4664 = builtin_function ("_Jv_LookupInterfaceMethodIdx",
4665 build_function_type (ptr_type_node, t),
4666 0, NOT_BUILT_IN, NULL, NULL_TREE);
4669 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
4670 This is the first entry in the vtable. */
4671 klass_ref = build_vtbl_ref (build_indirect_ref (instance, 0),
4674 /* Get the java.lang.Class pointer for the interface being called. */
4675 iface = DECL_CONTEXT (fn);
4676 iface_ref = lookup_field (iface, get_identifier ("class$"), 0, false);
4677 if (!iface_ref || TREE_CODE (iface_ref) != VAR_DECL
4678 || DECL_CONTEXT (iface_ref) != iface)
4680 error ("could not find class$ field in java interface type `%T'",
4682 return error_mark_node;
4684 iface_ref = build1 (ADDR_EXPR, build_pointer_type (iface), iface_ref);
4686 /* Determine the itable index of FN. */
4688 for (method = TYPE_METHODS (iface); method; method = TREE_CHAIN (method))
4690 if (!DECL_VIRTUAL_P (method))
4696 idx = build_int_2 (i, 0);
4698 lookup_args = tree_cons (NULL_TREE, klass_ref,
4699 tree_cons (NULL_TREE, iface_ref,
4700 build_tree_list (NULL_TREE, idx)));
4701 lookup_fn = build1 (ADDR_EXPR,
4702 build_pointer_type (TREE_TYPE (java_iface_lookup_fn)),
4703 java_iface_lookup_fn);
4704 return build (CALL_EXPR, ptr_type_node, lookup_fn, lookup_args, NULL_TREE);
4707 /* Returns the value to use for the in-charge parameter when making a
4708 call to a function with the indicated NAME. */
4711 in_charge_arg_for_name (tree name)
4713 if (name == base_ctor_identifier
4714 || name == base_dtor_identifier)
4715 return integer_zero_node;
4716 else if (name == complete_ctor_identifier)
4717 return integer_one_node;
4718 else if (name == complete_dtor_identifier)
4719 return integer_two_node;
4720 else if (name == deleting_dtor_identifier)
4721 return integer_three_node;
4723 /* This function should only be called with one of the names listed
4729 /* Build a call to a constructor, destructor, or an assignment
4730 operator for INSTANCE, an expression with class type. NAME
4731 indicates the special member function to call; ARGS are the
4732 arguments. BINFO indicates the base of INSTANCE that is to be
4733 passed as the `this' parameter to the member function called.
4735 FLAGS are the LOOKUP_* flags to use when processing the call.
4737 If NAME indicates a complete object constructor, INSTANCE may be
4738 NULL_TREE. In this case, the caller will call build_cplus_new to
4739 store the newly constructed object into a VAR_DECL. */
4742 build_special_member_call (tree instance, tree name, tree args,
4743 tree binfo, int flags)
4746 /* The type of the subobject to be constructed or destroyed. */
4749 my_friendly_assert (name == complete_ctor_identifier
4750 || name == base_ctor_identifier
4751 || name == complete_dtor_identifier
4752 || name == base_dtor_identifier
4753 || name == deleting_dtor_identifier
4754 || name == ansi_assopname (NOP_EXPR),
4756 my_friendly_assert (binfo != NULL_TREE, 20020712);
4758 class_type = BINFO_TYPE (binfo);
4760 /* Handle the special case where INSTANCE is NULL_TREE. */
4761 if (name == complete_ctor_identifier && !instance)
4763 instance = build_int_2 (0, 0);
4764 TREE_TYPE (instance) = build_pointer_type (class_type);
4765 instance = build1 (INDIRECT_REF, class_type, instance);
4769 if (name == complete_dtor_identifier
4770 || name == base_dtor_identifier
4771 || name == deleting_dtor_identifier)
4772 my_friendly_assert (args == NULL_TREE, 20020712);
4774 /* We must perform the conversion here so that we do not
4775 subsequently check to see whether BINFO is an accessible
4776 base. (It is OK for a constructor to call a constructor in
4777 an inaccessible base as long as the constructor being called
4779 if (!same_type_ignoring_top_level_qualifiers_p
4780 (TREE_TYPE (instance), BINFO_TYPE (binfo)))
4781 instance = convert_to_base_statically (instance, binfo);
4784 my_friendly_assert (instance != NULL_TREE, 20020712);
4786 /* Resolve the name. */
4787 if (!complete_type_or_else (BINFO_TYPE (binfo), NULL_TREE))
4788 return error_mark_node;
4790 fns = lookup_fnfields (binfo, name, 1);
4792 /* When making a call to a constructor or destructor for a subobject
4793 that uses virtual base classes, pass down a pointer to a VTT for
4795 if ((name == base_ctor_identifier
4796 || name == base_dtor_identifier)
4797 && TYPE_USES_VIRTUAL_BASECLASSES (class_type))
4802 /* If the current function is a complete object constructor
4803 or destructor, then we fetch the VTT directly.
4804 Otherwise, we look it up using the VTT we were given. */
4805 vtt = TREE_CHAIN (CLASSTYPE_VTABLES (current_class_type));
4806 vtt = decay_conversion (vtt);
4807 vtt = build (COND_EXPR, TREE_TYPE (vtt),
4808 build (EQ_EXPR, boolean_type_node,
4809 current_in_charge_parm, integer_zero_node),
4812 my_friendly_assert (BINFO_SUBVTT_INDEX (binfo), 20010110);
4813 sub_vtt = build (PLUS_EXPR, TREE_TYPE (vtt), vtt,
4814 BINFO_SUBVTT_INDEX (binfo));
4816 args = tree_cons (NULL_TREE, sub_vtt, args);
4819 return build_new_method_call (instance, fns, args,
4820 TYPE_BINFO (BINFO_TYPE (binfo)),
4824 /* Return the NAME, as a C string. The NAME indicates a function that
4825 is a member of TYPE. *FREE_P is set to true if the caller must
4826 free the memory returned.
4828 Rather than go through all of this, we should simply set the names
4829 of constructors and destructors appropriately, and dispense with
4830 ctor_identifier, dtor_identifier, etc. */
4833 name_as_c_string (tree name, tree type, bool *free_p)
4837 /* Assume that we will not allocate memory. */
4839 /* Constructors and destructors are special. */
4840 if (IDENTIFIER_CTOR_OR_DTOR_P (name))
4843 = (char *) IDENTIFIER_POINTER (constructor_name (type));
4844 /* For a destructor, add the '~'. */
4845 if (name == complete_dtor_identifier
4846 || name == base_dtor_identifier
4847 || name == deleting_dtor_identifier)
4849 pretty_name = concat ("~", pretty_name, NULL);
4850 /* Remember that we need to free the memory allocated. */
4855 pretty_name = (char *) IDENTIFIER_POINTER (name);
4860 /* Build a call to "INSTANCE.FN (ARGS)". */
4863 build_new_method_call (tree instance, tree fns, tree args,
4864 tree conversion_path, int flags)
4866 struct z_candidate *candidates = 0, *cand;
4867 tree explicit_targs = NULL_TREE;
4868 tree basetype = NULL_TREE;
4871 tree mem_args = NULL_TREE, instance_ptr;
4877 int template_only = 0;
4883 my_friendly_assert (instance != NULL_TREE, 20020729);
4885 if (error_operand_p (instance)
4886 || error_operand_p (fns)
4887 || args == error_mark_node)
4888 return error_mark_node;
4890 orig_instance = instance;
4894 if (processing_template_decl)
4896 instance = build_non_dependent_expr (instance);
4897 if (!BASELINK_P (fns)
4898 && TREE_CODE (fns) != PSEUDO_DTOR_EXPR
4899 && TREE_TYPE (fns) != unknown_type_node)
4900 fns = build_non_dependent_expr (fns);
4901 args = build_non_dependent_args (orig_args);
4904 /* Process the argument list. */
4906 args = resolve_args (args);
4907 if (args == error_mark_node)
4908 return error_mark_node;
4910 if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE)
4911 instance = convert_from_reference (instance);
4912 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (instance));
4913 instance_ptr = build_this (instance);
4915 if (!BASELINK_P (fns))
4917 call = build_field_call (instance_ptr, fns, args);
4920 error ("call to non-function `%D'", fns);
4921 return error_mark_node;
4924 if (!conversion_path)
4925 conversion_path = BASELINK_BINFO (fns);
4926 access_binfo = BASELINK_ACCESS_BINFO (fns);
4927 optype = BASELINK_OPTYPE (fns);
4928 fns = BASELINK_FUNCTIONS (fns);
4930 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
4932 explicit_targs = TREE_OPERAND (fns, 1);
4933 fns = TREE_OPERAND (fns, 0);
4937 my_friendly_assert (TREE_CODE (fns) == FUNCTION_DECL
4938 || TREE_CODE (fns) == TEMPLATE_DECL
4939 || TREE_CODE (fns) == OVERLOAD,
4942 /* XXX this should be handled before we get here. */
4943 if (! IS_AGGR_TYPE (basetype))
4945 if ((flags & LOOKUP_COMPLAIN) && basetype != error_mark_node)
4946 error ("request for member `%D' in `%E', which is of non-aggregate type `%T'",
4947 fns, instance, basetype);
4949 return error_mark_node;
4952 fn = get_first_fn (fns);
4953 name = DECL_NAME (fn);
4955 if (IDENTIFIER_CTOR_OR_DTOR_P (name))
4957 /* Callers should explicitly indicate whether they want to construct
4958 the complete object or just the part without virtual bases. */
4959 my_friendly_assert (name != ctor_identifier, 20000408);
4960 /* Similarly for destructors. */
4961 my_friendly_assert (name != dtor_identifier, 20000408);
4964 /* It's OK to call destructors on cv-qualified objects. Therefore,
4965 convert the INSTANCE_PTR to the unqualified type, if necessary. */
4966 if (DECL_DESTRUCTOR_P (fn))
4968 tree type = build_pointer_type (basetype);
4969 if (!same_type_p (type, TREE_TYPE (instance_ptr)))
4970 instance_ptr = build_nop (type, instance_ptr);
4973 class_type = (conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE);
4974 mem_args = tree_cons (NULL_TREE, instance_ptr, args);
4976 for (fn = fns; fn; fn = OVL_NEXT (fn))
4978 tree t = OVL_CURRENT (fn);
4981 /* We can end up here for copy-init of same or base class. */
4982 if ((flags & LOOKUP_ONLYCONVERTING)
4983 && DECL_NONCONVERTING_P (t))
4986 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (t))
4987 this_arglist = mem_args;
4989 this_arglist = args;
4991 if (TREE_CODE (t) == TEMPLATE_DECL)
4992 /* A member template. */
4993 add_template_candidate (&candidates, t,
4996 this_arglist, optype,
5001 else if (! template_only)
5002 add_function_candidate (&candidates, t,
5010 candidates = splice_viable (candidates, pedantic, &any_viable_p);
5013 /* XXX will LOOKUP_SPECULATIVELY be needed when this is done? */
5014 if (flags & LOOKUP_SPECULATIVELY)
5016 if (!COMPLETE_TYPE_P (basetype))
5017 cxx_incomplete_type_error (instance_ptr, basetype);
5023 pretty_name = name_as_c_string (name, basetype, &free_p);
5024 error ("no matching function for call to `%T::%s(%A)%#V'",
5025 basetype, pretty_name, user_args,
5026 TREE_TYPE (TREE_TYPE (instance_ptr)));
5030 print_z_candidates (candidates);
5031 return error_mark_node;
5034 cand = tourney (candidates);
5040 pretty_name = name_as_c_string (name, basetype, &free_p);
5041 error ("call of overloaded `%s(%A)' is ambiguous", pretty_name,
5043 print_z_candidates (candidates);
5046 return error_mark_node;
5049 if (DECL_PURE_VIRTUAL_P (cand->fn)
5050 && instance == current_class_ref
5051 && (DECL_CONSTRUCTOR_P (current_function_decl)
5052 || DECL_DESTRUCTOR_P (current_function_decl))
5053 && ! (flags & LOOKUP_NONVIRTUAL)
5054 && value_member (cand->fn, CLASSTYPE_PURE_VIRTUALS (basetype)))
5055 error ((DECL_CONSTRUCTOR_P (current_function_decl) ?
5056 "abstract virtual `%#D' called from constructor"
5057 : "abstract virtual `%#D' called from destructor"),
5059 if (TREE_CODE (TREE_TYPE (cand->fn)) == METHOD_TYPE
5060 && is_dummy_object (instance_ptr))
5062 error ("cannot call member function `%D' without object", cand->fn);
5063 return error_mark_node;
5066 if (DECL_VINDEX (cand->fn) && ! (flags & LOOKUP_NONVIRTUAL)
5067 && resolves_to_fixed_type_p (instance, 0))
5068 flags |= LOOKUP_NONVIRTUAL;
5070 if (TREE_CODE (TREE_TYPE (cand->fn)) == METHOD_TYPE)
5071 call = build_over_call (cand, flags);
5074 call = build_over_call (cand, flags);
5075 /* In an expression of the form `a->f()' where `f' turns out to
5076 be a static member function, `a' is none-the-less evaluated. */
5077 if (!is_dummy_object (instance_ptr) && TREE_SIDE_EFFECTS (instance))
5078 call = build (COMPOUND_EXPR, TREE_TYPE (call), instance, call);
5082 if (processing_template_decl && call != error_mark_node)
5083 return build_min (CALL_EXPR, TREE_TYPE (call),
5084 build_min_nt (COMPONENT_REF, orig_instance, orig_fns),
5089 /* Returns true iff standard conversion sequence ICS1 is a proper
5090 subsequence of ICS2. */
5093 is_subseq (tree ics1, tree ics2)
5095 /* We can assume that a conversion of the same code
5096 between the same types indicates a subsequence since we only get
5097 here if the types we are converting from are the same. */
5099 while (TREE_CODE (ics1) == RVALUE_CONV
5100 || TREE_CODE (ics1) == LVALUE_CONV)
5101 ics1 = TREE_OPERAND (ics1, 0);
5105 while (TREE_CODE (ics2) == RVALUE_CONV
5106 || TREE_CODE (ics2) == LVALUE_CONV)
5107 ics2 = TREE_OPERAND (ics2, 0);
5109 if (TREE_CODE (ics2) == USER_CONV
5110 || TREE_CODE (ics2) == AMBIG_CONV
5111 || TREE_CODE (ics2) == IDENTITY_CONV)
5112 /* At this point, ICS1 cannot be a proper subsequence of
5113 ICS2. We can get a USER_CONV when we are comparing the
5114 second standard conversion sequence of two user conversion
5118 ics2 = TREE_OPERAND (ics2, 0);
5120 if (TREE_CODE (ics2) == TREE_CODE (ics1)
5121 && same_type_p (TREE_TYPE (ics2), TREE_TYPE (ics1))
5122 && same_type_p (TREE_TYPE (TREE_OPERAND (ics2, 0)),
5123 TREE_TYPE (TREE_OPERAND (ics1, 0))))
5128 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
5129 be any _TYPE nodes. */
5132 is_properly_derived_from (tree derived, tree base)
5134 if (!IS_AGGR_TYPE_CODE (TREE_CODE (derived))
5135 || !IS_AGGR_TYPE_CODE (TREE_CODE (base)))
5138 /* We only allow proper derivation here. The DERIVED_FROM_P macro
5139 considers every class derived from itself. */
5140 return (!same_type_ignoring_top_level_qualifiers_p (derived, base)
5141 && DERIVED_FROM_P (base, derived));
5144 /* We build the ICS for an implicit object parameter as a pointer
5145 conversion sequence. However, such a sequence should be compared
5146 as if it were a reference conversion sequence. If ICS is the
5147 implicit conversion sequence for an implicit object parameter,
5148 modify it accordingly. */
5151 maybe_handle_implicit_object (tree *ics)
5153 if (ICS_THIS_FLAG (*ics))
5155 /* [over.match.funcs]
5157 For non-static member functions, the type of the
5158 implicit object parameter is "reference to cv X"
5159 where X is the class of which the function is a
5160 member and cv is the cv-qualification on the member
5161 function declaration. */
5163 tree reference_type;
5165 /* The `this' parameter is a pointer to a class type. Make the
5166 implicit conversion talk about a reference to that same class
5168 reference_type = TREE_TYPE (TREE_TYPE (*ics));
5169 reference_type = build_reference_type (reference_type);
5171 if (TREE_CODE (t) == QUAL_CONV)
5172 t = TREE_OPERAND (t, 0);
5173 if (TREE_CODE (t) == PTR_CONV)
5174 t = TREE_OPERAND (t, 0);
5175 t = build1 (IDENTITY_CONV, TREE_TYPE (TREE_TYPE (t)), NULL_TREE);
5176 t = direct_reference_binding (reference_type, t);
5181 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
5182 and return the type to which the reference refers. Otherwise,
5183 leave *ICS unchanged and return NULL_TREE. */
5186 maybe_handle_ref_bind (tree *ics)
5188 if (TREE_CODE (*ics) == REF_BIND)
5190 tree old_ics = *ics;
5191 tree type = TREE_TYPE (TREE_TYPE (old_ics));
5192 *ics = TREE_OPERAND (old_ics, 0);
5193 ICS_USER_FLAG (*ics) = ICS_USER_FLAG (old_ics);
5194 ICS_BAD_FLAG (*ics) = ICS_BAD_FLAG (old_ics);
5201 /* Compare two implicit conversion sequences according to the rules set out in
5202 [over.ics.rank]. Return values:
5204 1: ics1 is better than ics2
5205 -1: ics2 is better than ics1
5206 0: ics1 and ics2 are indistinguishable */
5209 compare_ics (tree ics1, tree ics2)
5215 tree deref_from_type1 = NULL_TREE;
5216 tree deref_from_type2 = NULL_TREE;
5217 tree deref_to_type1 = NULL_TREE;
5218 tree deref_to_type2 = NULL_TREE;
5221 /* REF_BINDING is nonzero if the result of the conversion sequence
5222 is a reference type. In that case TARGET_TYPE is the
5223 type referred to by the reference. */
5227 /* Handle implicit object parameters. */
5228 maybe_handle_implicit_object (&ics1);
5229 maybe_handle_implicit_object (&ics2);
5231 /* Handle reference parameters. */
5232 target_type1 = maybe_handle_ref_bind (&ics1);
5233 target_type2 = maybe_handle_ref_bind (&ics2);
5237 When comparing the basic forms of implicit conversion sequences (as
5238 defined in _over.best.ics_)
5240 --a standard conversion sequence (_over.ics.scs_) is a better
5241 conversion sequence than a user-defined conversion sequence
5242 or an ellipsis conversion sequence, and
5244 --a user-defined conversion sequence (_over.ics.user_) is a
5245 better conversion sequence than an ellipsis conversion sequence
5246 (_over.ics.ellipsis_). */
5247 rank1 = ICS_RANK (ics1);
5248 rank2 = ICS_RANK (ics2);
5252 else if (rank1 < rank2)
5255 if (rank1 == BAD_RANK)
5257 /* XXX Isn't this an extension? */
5258 /* Both ICS are bad. We try to make a decision based on what
5259 would have happenned if they'd been good. */
5260 if (ICS_USER_FLAG (ics1) > ICS_USER_FLAG (ics2)
5261 || ICS_STD_RANK (ics1) > ICS_STD_RANK (ics2))
5263 else if (ICS_USER_FLAG (ics1) < ICS_USER_FLAG (ics2)
5264 || ICS_STD_RANK (ics1) < ICS_STD_RANK (ics2))
5267 /* We couldn't make up our minds; try to figure it out below. */
5270 if (ICS_ELLIPSIS_FLAG (ics1))
5271 /* Both conversions are ellipsis conversions. */
5274 /* User-defined conversion sequence U1 is a better conversion sequence
5275 than another user-defined conversion sequence U2 if they contain the
5276 same user-defined conversion operator or constructor and if the sec-
5277 ond standard conversion sequence of U1 is better than the second
5278 standard conversion sequence of U2. */
5280 if (ICS_USER_FLAG (ics1))
5284 for (t1 = ics1; TREE_CODE (t1) != USER_CONV; t1 = TREE_OPERAND (t1, 0))
5285 if (TREE_CODE (t1) == AMBIG_CONV)
5287 for (t2 = ics2; TREE_CODE (t2) != USER_CONV; t2 = TREE_OPERAND (t2, 0))
5288 if (TREE_CODE (t2) == AMBIG_CONV)
5291 if (USER_CONV_FN (t1) != USER_CONV_FN (t2))
5294 /* We can just fall through here, after setting up
5295 FROM_TYPE1 and FROM_TYPE2. */
5296 from_type1 = TREE_TYPE (t1);
5297 from_type2 = TREE_TYPE (t2);
5301 /* We're dealing with two standard conversion sequences.
5305 Standard conversion sequence S1 is a better conversion
5306 sequence than standard conversion sequence S2 if
5308 --S1 is a proper subsequence of S2 (comparing the conversion
5309 sequences in the canonical form defined by _over.ics.scs_,
5310 excluding any Lvalue Transformation; the identity
5311 conversion sequence is considered to be a subsequence of
5312 any non-identity conversion sequence */
5315 while (TREE_CODE (from_type1) != IDENTITY_CONV)
5316 from_type1 = TREE_OPERAND (from_type1, 0);
5317 from_type1 = TREE_TYPE (from_type1);
5320 while (TREE_CODE (from_type2) != IDENTITY_CONV)
5321 from_type2 = TREE_OPERAND (from_type2, 0);
5322 from_type2 = TREE_TYPE (from_type2);
5325 if (same_type_p (from_type1, from_type2))
5327 if (is_subseq (ics1, ics2))
5329 if (is_subseq (ics2, ics1))
5332 /* Otherwise, one sequence cannot be a subsequence of the other; they
5333 don't start with the same type. This can happen when comparing the
5334 second standard conversion sequence in two user-defined conversion
5341 --the rank of S1 is better than the rank of S2 (by the rules
5344 Standard conversion sequences are ordered by their ranks: an Exact
5345 Match is a better conversion than a Promotion, which is a better
5346 conversion than a Conversion.
5348 Two conversion sequences with the same rank are indistinguishable
5349 unless one of the following rules applies:
5351 --A conversion that is not a conversion of a pointer, or pointer
5352 to member, to bool is better than another conversion that is such
5355 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
5356 so that we do not have to check it explicitly. */
5357 if (ICS_STD_RANK (ics1) < ICS_STD_RANK (ics2))
5359 else if (ICS_STD_RANK (ics2) < ICS_STD_RANK (ics1))
5362 to_type1 = TREE_TYPE (ics1);
5363 to_type2 = TREE_TYPE (ics2);
5365 if (TYPE_PTR_P (from_type1)
5366 && TYPE_PTR_P (from_type2)
5367 && TYPE_PTR_P (to_type1)
5368 && TYPE_PTR_P (to_type2))
5370 deref_from_type1 = TREE_TYPE (from_type1);
5371 deref_from_type2 = TREE_TYPE (from_type2);
5372 deref_to_type1 = TREE_TYPE (to_type1);
5373 deref_to_type2 = TREE_TYPE (to_type2);
5375 /* The rules for pointers to members A::* are just like the rules
5376 for pointers A*, except opposite: if B is derived from A then
5377 A::* converts to B::*, not vice versa. For that reason, we
5378 switch the from_ and to_ variables here. */
5379 else if ((TYPE_PTRMEM_P (from_type1) && TYPE_PTRMEM_P (from_type2)
5380 && TYPE_PTRMEM_P (to_type1) && TYPE_PTRMEM_P (to_type2))
5381 || (TYPE_PTRMEMFUNC_P (from_type1)
5382 && TYPE_PTRMEMFUNC_P (from_type2)
5383 && TYPE_PTRMEMFUNC_P (to_type1)
5384 && TYPE_PTRMEMFUNC_P (to_type2)))
5386 deref_to_type1 = TYPE_PTRMEM_CLASS_TYPE (from_type1);
5387 deref_to_type2 = TYPE_PTRMEM_CLASS_TYPE (from_type2);
5388 deref_from_type1 = TYPE_PTRMEM_CLASS_TYPE (to_type1);
5389 deref_from_type2 = TYPE_PTRMEM_CLASS_TYPE (to_type2);
5392 if (deref_from_type1 != NULL_TREE
5393 && IS_AGGR_TYPE_CODE (TREE_CODE (deref_from_type1))
5394 && IS_AGGR_TYPE_CODE (TREE_CODE (deref_from_type2)))
5396 /* This was one of the pointer or pointer-like conversions.
5400 --If class B is derived directly or indirectly from class A,
5401 conversion of B* to A* is better than conversion of B* to
5402 void*, and conversion of A* to void* is better than
5403 conversion of B* to void*. */
5404 if (TREE_CODE (deref_to_type1) == VOID_TYPE
5405 && TREE_CODE (deref_to_type2) == VOID_TYPE)
5407 if (is_properly_derived_from (deref_from_type1,
5410 else if (is_properly_derived_from (deref_from_type2,
5414 else if (TREE_CODE (deref_to_type1) == VOID_TYPE
5415 || TREE_CODE (deref_to_type2) == VOID_TYPE)
5417 if (same_type_p (deref_from_type1, deref_from_type2))
5419 if (TREE_CODE (deref_to_type2) == VOID_TYPE)
5421 if (is_properly_derived_from (deref_from_type1,
5425 /* We know that DEREF_TO_TYPE1 is `void' here. */
5426 else if (is_properly_derived_from (deref_from_type1,
5431 else if (IS_AGGR_TYPE_CODE (TREE_CODE (deref_to_type1))
5432 && IS_AGGR_TYPE_CODE (TREE_CODE (deref_to_type2)))
5436 --If class B is derived directly or indirectly from class A
5437 and class C is derived directly or indirectly from B,
5439 --conversion of C* to B* is better than conversion of C* to
5442 --conversion of B* to A* is better than conversion of C* to
5444 if (same_type_p (deref_from_type1, deref_from_type2))
5446 if (is_properly_derived_from (deref_to_type1,
5449 else if (is_properly_derived_from (deref_to_type2,
5453 else if (same_type_p (deref_to_type1, deref_to_type2))
5455 if (is_properly_derived_from (deref_from_type2,
5458 else if (is_properly_derived_from (deref_from_type1,
5464 else if (CLASS_TYPE_P (non_reference (from_type1))
5465 && same_type_p (from_type1, from_type2))
5467 tree from = non_reference (from_type1);
5471 --binding of an expression of type C to a reference of type
5472 B& is better than binding an expression of type C to a
5473 reference of type A&
5475 --conversion of C to B is better than conversion of C to A, */
5476 if (is_properly_derived_from (from, to_type1)
5477 && is_properly_derived_from (from, to_type2))
5479 if (is_properly_derived_from (to_type1, to_type2))
5481 else if (is_properly_derived_from (to_type2, to_type1))
5485 else if (CLASS_TYPE_P (non_reference (to_type1))
5486 && same_type_p (to_type1, to_type2))
5488 tree to = non_reference (to_type1);
5492 --binding of an expression of type B to a reference of type
5493 A& is better than binding an expression of type C to a
5494 reference of type A&,
5496 --onversion of B to A is better than conversion of C to A */
5497 if (is_properly_derived_from (from_type1, to)
5498 && is_properly_derived_from (from_type2, to))
5500 if (is_properly_derived_from (from_type2, from_type1))
5502 else if (is_properly_derived_from (from_type1, from_type2))
5509 --S1 and S2 differ only in their qualification conversion and yield
5510 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
5511 qualification signature of type T1 is a proper subset of the cv-
5512 qualification signature of type T2 */
5513 if (TREE_CODE (ics1) == QUAL_CONV
5514 && TREE_CODE (ics2) == QUAL_CONV
5515 && same_type_p (from_type1, from_type2))
5516 return comp_cv_qual_signature (to_type1, to_type2);
5520 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
5521 types to which the references refer are the same type except for
5522 top-level cv-qualifiers, and the type to which the reference
5523 initialized by S2 refers is more cv-qualified than the type to
5524 which the reference initialized by S1 refers */
5526 if (target_type1 && target_type2
5527 && same_type_ignoring_top_level_qualifiers_p (to_type1, to_type2))
5528 return comp_cv_qualification (target_type2, target_type1);
5530 /* Neither conversion sequence is better than the other. */
5534 /* The source type for this standard conversion sequence. */
5537 source_type (tree t)
5539 for (;; t = TREE_OPERAND (t, 0))
5541 if (TREE_CODE (t) == USER_CONV
5542 || TREE_CODE (t) == AMBIG_CONV
5543 || TREE_CODE (t) == IDENTITY_CONV)
5544 return TREE_TYPE (t);
5549 /* Note a warning about preferring WINNER to LOSER. We do this by storing
5550 a pointer to LOSER and re-running joust to produce the warning if WINNER
5551 is actually used. */
5554 add_warning (struct z_candidate *winner, struct z_candidate *loser)
5556 winner->warnings = tree_cons (NULL_TREE,
5557 build_zc_wrapper (loser),
5561 /* Compare two candidates for overloading as described in
5562 [over.match.best]. Return values:
5564 1: cand1 is better than cand2
5565 -1: cand2 is better than cand1
5566 0: cand1 and cand2 are indistinguishable */
5569 joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn)
5572 int i, off1 = 0, off2 = 0, len;
5574 /* Candidates that involve bad conversions are always worse than those
5576 if (cand1->viable > cand2->viable)
5578 if (cand1->viable < cand2->viable)
5581 /* If we have two pseudo-candidates for conversions to the same type,
5582 or two candidates for the same function, arbitrarily pick one. */
5583 if (cand1->fn == cand2->fn
5584 && (TYPE_P (cand1->fn) || DECL_P (cand1->fn)))
5587 /* a viable function F1
5588 is defined to be a better function than another viable function F2 if
5589 for all arguments i, ICSi(F1) is not a worse conversion sequence than
5590 ICSi(F2), and then */
5592 /* for some argument j, ICSj(F1) is a better conversion sequence than
5595 /* For comparing static and non-static member functions, we ignore
5596 the implicit object parameter of the non-static function. The
5597 standard says to pretend that the static function has an object
5598 parm, but that won't work with operator overloading. */
5599 len = TREE_VEC_LENGTH (cand1->convs);
5600 if (len != TREE_VEC_LENGTH (cand2->convs))
5602 if (DECL_STATIC_FUNCTION_P (cand1->fn)
5603 && ! DECL_STATIC_FUNCTION_P (cand2->fn))
5605 else if (! DECL_STATIC_FUNCTION_P (cand1->fn)
5606 && DECL_STATIC_FUNCTION_P (cand2->fn))
5615 for (i = 0; i < len; ++i)
5617 tree t1 = TREE_VEC_ELT (cand1->convs, i+off1);
5618 tree t2 = TREE_VEC_ELT (cand2->convs, i+off2);
5619 int comp = compare_ics (t1, t2);
5624 && ICS_RANK (t1) + ICS_RANK (t2) == STD_RANK + PROMO_RANK
5625 && TREE_CODE (t1) == STD_CONV
5626 && TREE_CODE (t2) == STD_CONV
5627 && TREE_CODE (TREE_TYPE (t1)) == INTEGER_TYPE
5628 && TREE_CODE (TREE_TYPE (t2)) == INTEGER_TYPE
5629 && (TYPE_PRECISION (TREE_TYPE (t1))
5630 == TYPE_PRECISION (TREE_TYPE (t2)))
5631 && (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (t1, 0)))
5632 || (TREE_CODE (TREE_TYPE (TREE_OPERAND (t1, 0)))
5635 tree type = TREE_TYPE (TREE_OPERAND (t1, 0));
5637 struct z_candidate *w, *l;
5639 type1 = TREE_TYPE (t1), type2 = TREE_TYPE (t2),
5640 w = cand1, l = cand2;
5642 type1 = TREE_TYPE (t2), type2 = TREE_TYPE (t1),
5643 w = cand2, l = cand1;
5647 warning ("passing `%T' chooses `%T' over `%T'",
5648 type, type1, type2);
5649 warning (" in call to `%D'", w->fn);
5655 if (winner && comp != winner)
5664 /* warn about confusing overload resolution for user-defined conversions,
5665 either between a constructor and a conversion op, or between two
5667 if (winner && warn_conversion && cand1->second_conv
5668 && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn))
5669 && winner != compare_ics (cand1->second_conv, cand2->second_conv))
5671 struct z_candidate *w, *l;
5672 bool give_warning = false;
5675 w = cand1, l = cand2;
5677 w = cand2, l = cand1;
5679 /* We don't want to complain about `X::operator T1 ()'
5680 beating `X::operator T2 () const', when T2 is a no less
5681 cv-qualified version of T1. */
5682 if (DECL_CONTEXT (w->fn) == DECL_CONTEXT (l->fn)
5683 && !DECL_CONSTRUCTOR_P (w->fn) && !DECL_CONSTRUCTOR_P (l->fn))
5685 tree t = TREE_TYPE (TREE_TYPE (l->fn));
5686 tree f = TREE_TYPE (TREE_TYPE (w->fn));
5688 if (TREE_CODE (t) == TREE_CODE (f) && POINTER_TYPE_P (t))
5693 if (!comp_ptr_ttypes (t, f))
5694 give_warning = true;
5697 give_warning = true;
5703 tree source = source_type (TREE_VEC_ELT (w->convs, 0));
5704 if (! DECL_CONSTRUCTOR_P (w->fn))
5705 source = TREE_TYPE (source);
5706 warning ("choosing `%D' over `%D'", w->fn, l->fn);
5707 warning (" for conversion from `%T' to `%T'",
5708 source, TREE_TYPE (w->second_conv));
5709 warning (" because conversion sequence for the argument is better");
5719 F1 is a non-template function and F2 is a template function
5722 if (! cand1->template && cand2->template)
5724 else if (cand1->template && ! cand2->template)
5728 F1 and F2 are template functions and the function template for F1 is
5729 more specialized than the template for F2 according to the partial
5732 if (cand1->template && cand2->template)
5734 winner = more_specialized
5735 (TI_TEMPLATE (cand1->template), TI_TEMPLATE (cand2->template),
5737 /* Tell the deduction code how many real function arguments
5738 we saw, not counting the implicit 'this' argument. But,
5739 add_function_candidate() suppresses the "this" argument
5742 [temp.func.order]: The presence of unused ellipsis and default
5743 arguments has no effect on the partial ordering of function
5745 TREE_VEC_LENGTH (cand1->convs)
5746 - (DECL_NONSTATIC_MEMBER_FUNCTION_P (cand1->fn)
5747 - DECL_CONSTRUCTOR_P (cand1->fn)));
5753 the context is an initialization by user-defined conversion (see
5754 _dcl.init_ and _over.match.user_) and the standard conversion
5755 sequence from the return type of F1 to the destination type (i.e.,
5756 the type of the entity being initialized) is a better conversion
5757 sequence than the standard conversion sequence from the return type
5758 of F2 to the destination type. */
5760 if (cand1->second_conv)
5762 winner = compare_ics (cand1->second_conv, cand2->second_conv);
5767 /* Check whether we can discard a builtin candidate, either because we
5768 have two identical ones or matching builtin and non-builtin candidates.
5770 (Pedantically in the latter case the builtin which matched the user
5771 function should not be added to the overload set, but we spot it here.
5774 ... the builtin candidates include ...
5775 - do not have the same parameter type list as any non-template
5776 non-member candidate. */
5778 if (TREE_CODE (cand1->fn) == IDENTIFIER_NODE
5779 || TREE_CODE (cand2->fn) == IDENTIFIER_NODE)
5781 for (i = 0; i < len; ++i)
5782 if (!same_type_p (TREE_TYPE (TREE_VEC_ELT (cand1->convs, i)),
5783 TREE_TYPE (TREE_VEC_ELT (cand2->convs, i))))
5785 if (i == TREE_VEC_LENGTH (cand1->convs))
5787 if (cand1->fn == cand2->fn)
5788 /* Two built-in candidates; arbitrarily pick one. */
5790 else if (TREE_CODE (cand1->fn) == IDENTIFIER_NODE)
5791 /* cand1 is built-in; prefer cand2. */
5794 /* cand2 is built-in; prefer cand1. */
5799 /* If the two functions are the same (this can happen with declarations
5800 in multiple scopes and arg-dependent lookup), arbitrarily choose one. */
5801 if (DECL_P (cand1->fn) && DECL_P (cand2->fn)
5802 && equal_functions (cand1->fn, cand2->fn))
5807 /* Extension: If the worst conversion for one candidate is worse than the
5808 worst conversion for the other, take the first. */
5811 int rank1 = IDENTITY_RANK, rank2 = IDENTITY_RANK;
5812 struct z_candidate *w = 0, *l = 0;
5814 for (i = 0; i < len; ++i)
5816 if (ICS_RANK (TREE_VEC_ELT (cand1->convs, i+off1)) > rank1)
5817 rank1 = ICS_RANK (TREE_VEC_ELT (cand1->convs, i+off1));
5818 if (ICS_RANK (TREE_VEC_ELT (cand2->convs, i+off2)) > rank2)
5819 rank2 = ICS_RANK (TREE_VEC_ELT (cand2->convs, i+off2));
5822 winner = 1, w = cand1, l = cand2;
5824 winner = -1, w = cand2, l = cand1;
5830 ISO C++ says that these are ambiguous, even \
5831 though the worst conversion for the first is better than \
5832 the worst conversion for the second:");
5833 print_z_candidate (_("candidate 1:"), w);
5834 print_z_candidate (_("candidate 2:"), l);
5842 my_friendly_assert (!winner, 20010121);
5846 /* Given a list of candidates for overloading, find the best one, if any.
5847 This algorithm has a worst case of O(2n) (winner is last), and a best
5848 case of O(n/2) (totally ambiguous); much better than a sorting
5851 static struct z_candidate *
5852 tourney (struct z_candidate *candidates)
5854 struct z_candidate *champ = candidates, *challenger;
5856 int champ_compared_to_predecessor = 0;
5858 /* Walk through the list once, comparing each current champ to the next
5859 candidate, knocking out a candidate or two with each comparison. */
5861 for (challenger = champ->next; challenger; )
5863 fate = joust (champ, challenger, 0);
5865 challenger = challenger->next;
5870 champ = challenger->next;
5873 champ_compared_to_predecessor = 0;
5878 champ_compared_to_predecessor = 1;
5881 challenger = champ->next;
5885 /* Make sure the champ is better than all the candidates it hasn't yet
5886 been compared to. */
5888 for (challenger = candidates;
5890 && !(champ_compared_to_predecessor && challenger->next == champ);
5891 challenger = challenger->next)
5893 fate = joust (champ, challenger, 0);
5901 /* Returns nonzero if things of type FROM can be converted to TO. */
5904 can_convert (tree to, tree from)
5906 return can_convert_arg (to, from, NULL_TREE);
5909 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
5912 can_convert_arg (tree to, tree from, tree arg)
5914 tree t = implicit_conversion (to, from, arg, LOOKUP_NORMAL);
5915 return (t && ! ICS_BAD_FLAG (t));
5918 /* Like can_convert_arg, but allows dubious conversions as well. */
5921 can_convert_arg_bad (tree to, tree from, tree arg)
5923 return implicit_conversion (to, from, arg, LOOKUP_NORMAL) != 0;
5926 /* Convert EXPR to TYPE. Return the converted expression.
5928 Note that we allow bad conversions here because by the time we get to
5929 this point we are committed to doing the conversion. If we end up
5930 doing a bad conversion, convert_like will complain. */
5933 perform_implicit_conversion (tree type, tree expr)
5937 if (error_operand_p (expr))
5938 return error_mark_node;
5939 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
5943 error ("could not convert `%E' to `%T'", expr, type);
5944 return error_mark_node;
5947 return convert_like (conv, expr);
5950 /* Convert EXPR to TYPE (as a direct-initialization) if that is
5951 permitted. If the conversion is valid, the converted expression is
5952 returned. Otherwise, NULL_TREE is returned. */
5955 perform_direct_initialization_if_possible (tree type, tree expr)
5959 if (type == error_mark_node || error_operand_p (expr))
5960 return error_mark_node;
5961 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
5963 if (!conv || ICS_BAD_FLAG (conv))
5965 return convert_like_real (conv, expr, NULL_TREE, 0, 0,
5966 /*issue_conversion_warnings=*/false);
5969 /* DECL is a VAR_DECL whose type is a REFERENCE_TYPE. The reference
5970 is being bound to a temporary. Create and return a new VAR_DECL
5971 with the indicated TYPE; this variable will store the value to
5972 which the reference is bound. */
5975 make_temporary_var_for_ref_to_temp (tree decl, tree type)
5979 /* Create the variable. */
5980 var = build_decl (VAR_DECL, NULL_TREE, type);
5981 DECL_ARTIFICIAL (var) = 1;
5982 TREE_USED (var) = 1;
5984 /* Register the variable. */
5985 if (TREE_STATIC (decl))
5987 /* Namespace-scope or local static; give it a mangled name. */
5990 TREE_STATIC (var) = 1;
5991 name = mangle_ref_init_variable (decl);
5992 DECL_NAME (var) = name;
5993 SET_DECL_ASSEMBLER_NAME (var, name);
5994 var = pushdecl_top_level (var);
5998 /* Create a new cleanup level if necessary. */
5999 maybe_push_cleanup_level (type);
6000 /* Don't push unnamed temps. Do set DECL_CONTEXT, though. */
6001 DECL_CONTEXT (var) = current_function_decl;
6007 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
6008 initializing a variable of that TYPE. If DECL is non-NULL, it is
6009 the VAR_DECL being initialized with the EXPR. (In that case, the
6010 type of DECL will be TYPE.)
6012 Return the converted expression. */
6015 initialize_reference (tree type, tree expr, tree decl)
6019 if (type == error_mark_node || error_operand_p (expr))
6020 return error_mark_node;
6022 conv = reference_binding (type, TREE_TYPE (expr), expr, LOOKUP_NORMAL);
6023 if (!conv || ICS_BAD_FLAG (conv))
6025 if (!(TYPE_QUALS (TREE_TYPE (type)) & TYPE_QUAL_CONST)
6026 && !real_lvalue_p (expr))
6027 error ("invalid initialization of non-const reference of "
6028 "type '%T' from a temporary of type '%T'",
6029 type, TREE_TYPE (expr));
6031 error ("could not convert `%E' to `%T'", expr, type);
6032 return error_mark_node;
6035 /* If DECL is non-NULL, then this special rule applies:
6039 The temporary to which the reference is bound or the temporary
6040 that is the complete object to which the reference is bound
6041 persists for the lifetime of the reference.
6043 The temporaries created during the evaluation of the expression
6044 initializing the reference, except the temporary to which the
6045 reference is bound, are destroyed at the end of the
6046 full-expression in which they are created.
6048 In that case, we store the converted expression into a new
6049 VAR_DECL in a new scope.
6051 However, we want to be careful not to create temporaries when
6052 they are not required. For example, given:
6055 struct D : public B {};
6059 there is no need to copy the return value from "f"; we can just
6060 extend its lifetime. Similarly, given:
6063 struct T { operator S(); };
6067 we can extend the lifetime of the return value of the conversion
6069 my_friendly_assert (TREE_CODE (conv) == REF_BIND, 20030302);
6073 tree base_conv_type;
6075 /* Skip over the REF_BIND. */
6076 conv = TREE_OPERAND (conv, 0);
6077 /* If the next conversion is a BASE_CONV, skip that too -- but
6078 remember that the conversion was required. */
6079 if (TREE_CODE (conv) == BASE_CONV && !NEED_TEMPORARY_P (conv))
6081 base_conv_type = TREE_TYPE (conv);
6082 conv = TREE_OPERAND (conv, 0);
6085 base_conv_type = NULL_TREE;
6086 /* Perform the remainder of the conversion. */
6087 expr = convert_like (conv, expr);
6088 if (!real_non_cast_lvalue_p (expr))
6093 /* Create the temporary variable. */
6094 type = TREE_TYPE (expr);
6095 var = make_temporary_var_for_ref_to_temp (decl, type);
6096 layout_decl (var, 0);
6097 if (at_function_scope_p ())
6101 add_decl_stmt (var);
6102 cleanup = cxx_maybe_build_cleanup (var);
6104 finish_decl_cleanup (var, cleanup);
6108 rest_of_decl_compilation (var, NULL, /*toplev=*/1, at_eof);
6109 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
6110 static_aggregates = tree_cons (NULL_TREE, var,
6113 init = build (INIT_EXPR, type, var, expr);
6114 /* Use its address to initialize the reference variable. */
6115 expr = build_address (var);
6116 expr = build (COMPOUND_EXPR, TREE_TYPE (expr), init, expr);
6119 /* Take the address of EXPR. */
6120 expr = build_unary_op (ADDR_EXPR, expr, 0);
6121 /* If a BASE_CONV was required, perform it now. */
6123 expr = (perform_implicit_conversion
6124 (build_pointer_type (base_conv_type), expr));
6125 return build_nop (type, expr);
6128 /* Perform the conversion. */
6129 return convert_like (conv, expr);
6132 #include "gt-cp-call.h"