1 /* Functions related to invoking methods and overloaded functions.
2 Copyright (C) 1987, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
5 Contributed by Michael Tiemann (tiemann@cygnus.com) and
6 modified by Brendan Kehoe (brendan@cygnus.com).
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 3, or (at your option)
15 GCC is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
25 /* High-level class interface. */
29 #include "coretypes.h"
38 #include "diagnostic.h"
42 #include "langhooks.h"
44 /* The various kinds of conversion. */
46 typedef enum conversion_kind {
62 /* The rank of the conversion. Order of the enumerals matters; better
63 conversions should come earlier in the list. */
65 typedef enum conversion_rank {
76 /* An implicit conversion sequence, in the sense of [over.best.ics].
77 The first conversion to be performed is at the end of the chain.
78 That conversion is always a cr_identity conversion. */
80 typedef struct conversion conversion;
82 /* The kind of conversion represented by this step. */
84 /* The rank of this conversion. */
86 BOOL_BITFIELD user_conv_p : 1;
87 BOOL_BITFIELD ellipsis_p : 1;
88 BOOL_BITFIELD this_p : 1;
89 BOOL_BITFIELD bad_p : 1;
90 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
91 temporary should be created to hold the result of the
93 BOOL_BITFIELD need_temporary_p : 1;
94 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
95 from a pointer-to-derived to pointer-to-base is being performed. */
96 BOOL_BITFIELD base_p : 1;
97 /* If KIND is ck_ref_bind, true when either an lvalue reference is
98 being bound to an lvalue expression or an rvalue reference is
99 being bound to an rvalue expression. */
100 BOOL_BITFIELD rvaluedness_matches_p: 1;
101 BOOL_BITFIELD check_narrowing: 1;
102 /* The type of the expression resulting from the conversion. */
105 /* The next conversion in the chain. Since the conversions are
106 arranged from outermost to innermost, the NEXT conversion will
107 actually be performed before this conversion. This variant is
108 used only when KIND is neither ck_identity nor ck_ambig. */
110 /* The expression at the beginning of the conversion chain. This
111 variant is used only if KIND is ck_identity or ck_ambig. */
113 /* The array of conversions for an initializer_list. */
116 /* The function candidate corresponding to this conversion
117 sequence. This field is only used if KIND is ck_user. */
118 struct z_candidate *cand;
121 #define CONVERSION_RANK(NODE) \
122 ((NODE)->bad_p ? cr_bad \
123 : (NODE)->ellipsis_p ? cr_ellipsis \
124 : (NODE)->user_conv_p ? cr_user \
127 static struct obstack conversion_obstack;
128 static bool conversion_obstack_initialized;
130 static struct z_candidate * tourney (struct z_candidate *);
131 static int equal_functions (tree, tree);
132 static int joust (struct z_candidate *, struct z_candidate *, bool);
133 static int compare_ics (conversion *, conversion *);
134 static tree build_over_call (struct z_candidate *, int, tsubst_flags_t);
135 static tree build_java_interface_fn_ref (tree, tree);
136 #define convert_like(CONV, EXPR, COMPLAIN) \
137 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
138 /*issue_conversion_warnings=*/true, \
139 /*c_cast_p=*/false, (COMPLAIN))
140 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
141 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
142 /*issue_conversion_warnings=*/true, \
143 /*c_cast_p=*/false, (COMPLAIN))
144 static tree convert_like_real (conversion *, tree, tree, int, int, bool,
145 bool, tsubst_flags_t);
146 static void op_error (enum tree_code, enum tree_code, tree, tree,
148 static VEC(tree,gc) *resolve_args (VEC(tree,gc) *);
149 static struct z_candidate *build_user_type_conversion_1 (tree, tree, int);
150 static void print_z_candidate (const char *, struct z_candidate *);
151 static void print_z_candidates (struct z_candidate *);
152 static tree build_this (tree);
153 static struct z_candidate *splice_viable (struct z_candidate *, bool, bool *);
154 static bool any_strictly_viable (struct z_candidate *);
155 static struct z_candidate *add_template_candidate
156 (struct z_candidate **, tree, tree, tree, tree, const VEC(tree,gc) *,
157 tree, tree, tree, int, unification_kind_t);
158 static struct z_candidate *add_template_candidate_real
159 (struct z_candidate **, tree, tree, tree, tree, const VEC(tree,gc) *,
160 tree, tree, tree, int, tree, unification_kind_t);
161 static struct z_candidate *add_template_conv_candidate
162 (struct z_candidate **, tree, tree, tree, const VEC(tree,gc) *, tree,
164 static void add_builtin_candidates
165 (struct z_candidate **, enum tree_code, enum tree_code,
167 static void add_builtin_candidate
168 (struct z_candidate **, enum tree_code, enum tree_code,
169 tree, tree, tree, tree *, tree *, int);
170 static bool is_complete (tree);
171 static void build_builtin_candidate
172 (struct z_candidate **, tree, tree, tree, tree *, tree *,
174 static struct z_candidate *add_conv_candidate
175 (struct z_candidate **, tree, tree, tree, const VEC(tree,gc) *, tree,
177 static struct z_candidate *add_function_candidate
178 (struct z_candidate **, tree, tree, tree, const VEC(tree,gc) *, tree,
180 static conversion *implicit_conversion (tree, tree, tree, bool, int);
181 static conversion *standard_conversion (tree, tree, tree, bool, int);
182 static conversion *reference_binding (tree, tree, tree, bool, int);
183 static conversion *build_conv (conversion_kind, tree, conversion *);
184 static conversion *build_list_conv (tree, tree, int);
185 static bool is_subseq (conversion *, conversion *);
186 static conversion *maybe_handle_ref_bind (conversion **);
187 static void maybe_handle_implicit_object (conversion **);
188 static struct z_candidate *add_candidate
189 (struct z_candidate **, tree, tree, const VEC(tree,gc) *, size_t,
190 conversion **, tree, tree, int);
191 static tree source_type (conversion *);
192 static void add_warning (struct z_candidate *, struct z_candidate *);
193 static bool reference_compatible_p (tree, tree);
194 static conversion *convert_class_to_reference (tree, tree, tree, int);
195 static conversion *direct_reference_binding (tree, conversion *);
196 static bool promoted_arithmetic_type_p (tree);
197 static conversion *conditional_conversion (tree, tree);
198 static char *name_as_c_string (tree, tree, bool *);
199 static tree prep_operand (tree);
200 static void add_candidates (tree, const VEC(tree,gc) *, tree, bool, tree, tree,
201 int, struct z_candidate **);
202 static conversion *merge_conversion_sequences (conversion *, conversion *);
203 static bool magic_varargs_p (tree);
204 static tree build_temp (tree, tree, int, diagnostic_t *);
206 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
207 NAME can take many forms... */
210 check_dtor_name (tree basetype, tree name)
212 /* Just accept something we've already complained about. */
213 if (name == error_mark_node)
216 if (TREE_CODE (name) == TYPE_DECL)
217 name = TREE_TYPE (name);
218 else if (TYPE_P (name))
220 else if (TREE_CODE (name) == IDENTIFIER_NODE)
222 if ((MAYBE_CLASS_TYPE_P (basetype)
223 && name == constructor_name (basetype))
224 || (TREE_CODE (basetype) == ENUMERAL_TYPE
225 && name == TYPE_IDENTIFIER (basetype)))
228 name = get_type_value (name);
234 template <class T> struct S { ~S(); };
238 NAME will be a class template. */
239 gcc_assert (DECL_CLASS_TEMPLATE_P (name));
243 if (!name || name == error_mark_node)
245 return same_type_p (TYPE_MAIN_VARIANT (basetype), TYPE_MAIN_VARIANT (name));
248 /* We want the address of a function or method. We avoid creating a
249 pointer-to-member function. */
252 build_addr_func (tree function)
254 tree type = TREE_TYPE (function);
256 /* We have to do these by hand to avoid real pointer to member
258 if (TREE_CODE (type) == METHOD_TYPE)
260 if (TREE_CODE (function) == OFFSET_REF)
262 tree object = build_address (TREE_OPERAND (function, 0));
263 return get_member_function_from_ptrfunc (&object,
264 TREE_OPERAND (function, 1));
266 function = build_address (function);
269 function = decay_conversion (function);
274 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
275 POINTER_TYPE to those. Note, pointer to member function types
276 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
277 two variants. build_call_a is the primitive taking an array of
278 arguments, while build_call_n is a wrapper that handles varargs. */
281 build_call_n (tree function, int n, ...)
284 return build_call_a (function, 0, NULL);
287 tree *argarray = (tree *) alloca (n * sizeof (tree));
292 for (i = 0; i < n; i++)
293 argarray[i] = va_arg (ap, tree);
295 return build_call_a (function, n, argarray);
300 build_call_a (tree function, int n, tree *argarray)
302 int is_constructor = 0;
309 function = build_addr_func (function);
311 gcc_assert (TYPE_PTR_P (TREE_TYPE (function)));
312 fntype = TREE_TYPE (TREE_TYPE (function));
313 gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE
314 || TREE_CODE (fntype) == METHOD_TYPE);
315 result_type = TREE_TYPE (fntype);
316 /* An rvalue has no cv-qualifiers. */
317 if (SCALAR_TYPE_P (result_type) || VOID_TYPE_P (result_type))
318 result_type = cv_unqualified (result_type);
320 if (TREE_CODE (function) == ADDR_EXPR
321 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
323 decl = TREE_OPERAND (function, 0);
324 if (!TREE_USED (decl))
326 /* We invoke build_call directly for several library
327 functions. These may have been declared normally if
328 we're building libgcc, so we can't just check
330 gcc_assert (DECL_ARTIFICIAL (decl)
331 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl)),
339 /* We check both the decl and the type; a function may be known not to
340 throw without being declared throw(). */
341 nothrow = ((decl && TREE_NOTHROW (decl))
342 || TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (function))));
344 if (decl && TREE_THIS_VOLATILE (decl) && cfun && cp_function_chain)
345 current_function_returns_abnormally = 1;
347 if (decl && TREE_DEPRECATED (decl))
348 warn_deprecated_use (decl, NULL_TREE);
349 require_complete_eh_spec_types (fntype, decl);
351 if (decl && DECL_CONSTRUCTOR_P (decl))
354 /* Don't pass empty class objects by value. This is useful
355 for tags in STL, which are used to control overload resolution.
356 We don't need to handle other cases of copying empty classes. */
357 if (! decl || ! DECL_BUILT_IN (decl))
358 for (i = 0; i < n; i++)
359 if (is_empty_class (TREE_TYPE (argarray[i]))
360 && ! TREE_ADDRESSABLE (TREE_TYPE (argarray[i])))
362 tree t = build0 (EMPTY_CLASS_EXPR, TREE_TYPE (argarray[i]));
363 argarray[i] = build2 (COMPOUND_EXPR, TREE_TYPE (t),
367 function = build_call_array_loc (input_location,
368 result_type, function, n, argarray);
369 TREE_HAS_CONSTRUCTOR (function) = is_constructor;
370 TREE_NOTHROW (function) = nothrow;
375 /* Build something of the form ptr->method (args)
376 or object.method (args). This can also build
377 calls to constructors, and find friends.
379 Member functions always take their class variable
382 INSTANCE is a class instance.
384 NAME is the name of the method desired, usually an IDENTIFIER_NODE.
386 PARMS help to figure out what that NAME really refers to.
388 BASETYPE_PATH, if non-NULL, contains a chain from the type of INSTANCE
389 down to the real instance type to use for access checking. We need this
390 information to get protected accesses correct.
392 FLAGS is the logical disjunction of zero or more LOOKUP_
393 flags. See cp-tree.h for more info.
395 If this is all OK, calls build_function_call with the resolved
398 This function must also handle being called to perform
399 initialization, promotion/coercion of arguments, and
400 instantiation of default parameters.
402 Note that NAME may refer to an instance variable name. If
403 `operator()()' is defined for the type of that field, then we return
406 /* New overloading code. */
408 typedef struct z_candidate z_candidate;
410 typedef struct candidate_warning candidate_warning;
411 struct candidate_warning {
413 candidate_warning *next;
417 /* The FUNCTION_DECL that will be called if this candidate is
418 selected by overload resolution. */
420 /* If not NULL_TREE, the first argument to use when calling this
423 /* The rest of the arguments to use when calling this function. If
424 there are no further arguments this may be NULL or it may be an
426 const VEC(tree,gc) *args;
427 /* The implicit conversion sequences for each of the arguments to
430 /* The number of implicit conversion sequences. */
432 /* If FN is a user-defined conversion, the standard conversion
433 sequence from the type returned by FN to the desired destination
435 conversion *second_conv;
437 /* If FN is a member function, the binfo indicating the path used to
438 qualify the name of FN at the call site. This path is used to
439 determine whether or not FN is accessible if it is selected by
440 overload resolution. The DECL_CONTEXT of FN will always be a
441 (possibly improper) base of this binfo. */
443 /* If FN is a non-static member function, the binfo indicating the
444 subobject to which the `this' pointer should be converted if FN
445 is selected by overload resolution. The type pointed to the by
446 the `this' pointer must correspond to the most derived class
447 indicated by the CONVERSION_PATH. */
448 tree conversion_path;
450 candidate_warning *warnings;
454 /* Returns true iff T is a null pointer constant in the sense of
458 null_ptr_cst_p (tree t)
462 A null pointer constant is an integral constant expression
463 (_expr.const_) rvalue of integer type that evaluates to zero. */
464 t = integral_constant_value (t);
467 if (CP_INTEGRAL_TYPE_P (TREE_TYPE (t)) && integer_zerop (t))
470 if (!TREE_OVERFLOW (t))
476 /* Returns nonzero if PARMLIST consists of only default parms and/or
480 sufficient_parms_p (const_tree parmlist)
482 for (; parmlist && parmlist != void_list_node;
483 parmlist = TREE_CHAIN (parmlist))
484 if (!TREE_PURPOSE (parmlist))
489 /* Allocate N bytes of memory from the conversion obstack. The memory
490 is zeroed before being returned. */
493 conversion_obstack_alloc (size_t n)
496 if (!conversion_obstack_initialized)
498 gcc_obstack_init (&conversion_obstack);
499 conversion_obstack_initialized = true;
501 p = obstack_alloc (&conversion_obstack, n);
506 /* Dynamically allocate a conversion. */
509 alloc_conversion (conversion_kind kind)
512 c = (conversion *) conversion_obstack_alloc (sizeof (conversion));
517 #ifdef ENABLE_CHECKING
519 /* Make sure that all memory on the conversion obstack has been
523 validate_conversion_obstack (void)
525 if (conversion_obstack_initialized)
526 gcc_assert ((obstack_next_free (&conversion_obstack)
527 == obstack_base (&conversion_obstack)));
530 #endif /* ENABLE_CHECKING */
532 /* Dynamically allocate an array of N conversions. */
535 alloc_conversions (size_t n)
537 return (conversion **) conversion_obstack_alloc (n * sizeof (conversion *));
541 build_conv (conversion_kind code, tree type, conversion *from)
544 conversion_rank rank = CONVERSION_RANK (from);
546 /* Note that the caller is responsible for filling in t->cand for
547 user-defined conversions. */
548 t = alloc_conversion (code);
571 t->user_conv_p = (code == ck_user || from->user_conv_p);
572 t->bad_p = from->bad_p;
577 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
578 specialization of std::initializer_list<T>, if such a conversion is
582 build_list_conv (tree type, tree ctor, int flags)
584 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type), 0);
585 unsigned len = CONSTRUCTOR_NELTS (ctor);
586 conversion **subconvs = alloc_conversions (len);
591 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
594 = implicit_conversion (elttype, TREE_TYPE (val), val,
602 t = alloc_conversion (ck_list);
604 t->u.list = subconvs;
607 for (i = 0; i < len; ++i)
609 conversion *sub = subconvs[i];
610 if (sub->rank > t->rank)
612 if (sub->user_conv_p)
613 t->user_conv_p = true;
621 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
622 aggregate class, if such a conversion is possible. */
625 build_aggr_conv (tree type, tree ctor, int flags)
627 unsigned HOST_WIDE_INT i = 0;
629 tree field = TYPE_FIELDS (type);
631 for (; field; field = TREE_CHAIN (field), ++i)
633 if (TREE_CODE (field) != FIELD_DECL)
635 if (i < CONSTRUCTOR_NELTS (ctor))
637 constructor_elt *ce = CONSTRUCTOR_ELT (ctor, i);
638 if (!can_convert_arg (TREE_TYPE (field), TREE_TYPE (ce->value),
642 else if (build_value_init (TREE_TYPE (field)) == error_mark_node)
646 c = alloc_conversion (ck_aggr);
649 c->user_conv_p = true;
654 /* Build a representation of the identity conversion from EXPR to
655 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
658 build_identity_conv (tree type, tree expr)
662 c = alloc_conversion (ck_identity);
669 /* Converting from EXPR to TYPE was ambiguous in the sense that there
670 were multiple user-defined conversions to accomplish the job.
671 Build a conversion that indicates that ambiguity. */
674 build_ambiguous_conv (tree type, tree expr)
678 c = alloc_conversion (ck_ambig);
686 strip_top_quals (tree t)
688 if (TREE_CODE (t) == ARRAY_TYPE)
690 return cp_build_qualified_type (t, 0);
693 /* Returns the standard conversion path (see [conv]) from type FROM to type
694 TO, if any. For proper handling of null pointer constants, you must
695 also pass the expression EXPR to convert from. If C_CAST_P is true,
696 this conversion is coming from a C-style cast. */
699 standard_conversion (tree to, tree from, tree expr, bool c_cast_p,
702 enum tree_code fcode, tcode;
704 bool fromref = false;
706 to = non_reference (to);
707 if (TREE_CODE (from) == REFERENCE_TYPE)
710 from = TREE_TYPE (from);
712 to = strip_top_quals (to);
713 from = strip_top_quals (from);
715 if ((TYPE_PTRFN_P (to) || TYPE_PTRMEMFUNC_P (to))
716 && expr && type_unknown_p (expr))
718 tsubst_flags_t tflags = tf_conv;
719 if (!(flags & LOOKUP_PROTECT))
720 tflags |= tf_no_access_control;
721 expr = instantiate_type (to, expr, tflags);
722 if (expr == error_mark_node)
724 from = TREE_TYPE (expr);
727 fcode = TREE_CODE (from);
728 tcode = TREE_CODE (to);
730 conv = build_identity_conv (from, expr);
731 if (fcode == FUNCTION_TYPE || fcode == ARRAY_TYPE)
733 from = type_decays_to (from);
734 fcode = TREE_CODE (from);
735 conv = build_conv (ck_lvalue, from, conv);
737 else if (fromref || (expr && lvalue_p (expr)))
742 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
745 from = strip_top_quals (bitfield_type);
746 fcode = TREE_CODE (from);
749 conv = build_conv (ck_rvalue, from, conv);
752 /* Allow conversion between `__complex__' data types. */
753 if (tcode == COMPLEX_TYPE && fcode == COMPLEX_TYPE)
755 /* The standard conversion sequence to convert FROM to TO is
756 the standard conversion sequence to perform componentwise
758 conversion *part_conv = standard_conversion
759 (TREE_TYPE (to), TREE_TYPE (from), NULL_TREE, c_cast_p, flags);
763 conv = build_conv (part_conv->kind, to, conv);
764 conv->rank = part_conv->rank;
772 if (same_type_p (from, to))
775 if ((tcode == POINTER_TYPE || TYPE_PTR_TO_MEMBER_P (to))
776 && expr && null_ptr_cst_p (expr))
777 conv = build_conv (ck_std, to, conv);
778 else if ((tcode == INTEGER_TYPE && fcode == POINTER_TYPE)
779 || (tcode == POINTER_TYPE && fcode == INTEGER_TYPE))
781 /* For backwards brain damage compatibility, allow interconversion of
782 pointers and integers with a pedwarn. */
783 conv = build_conv (ck_std, to, conv);
786 else if (UNSCOPED_ENUM_P (to) && fcode == INTEGER_TYPE)
788 /* For backwards brain damage compatibility, allow interconversion of
789 enums and integers with a pedwarn. */
790 conv = build_conv (ck_std, to, conv);
793 else if ((tcode == POINTER_TYPE && fcode == POINTER_TYPE)
794 || (TYPE_PTRMEM_P (to) && TYPE_PTRMEM_P (from)))
799 if (tcode == POINTER_TYPE
800 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from),
803 else if (VOID_TYPE_P (TREE_TYPE (to))
804 && !TYPE_PTRMEM_P (from)
805 && TREE_CODE (TREE_TYPE (from)) != FUNCTION_TYPE)
807 from = build_pointer_type
808 (cp_build_qualified_type (void_type_node,
809 cp_type_quals (TREE_TYPE (from))));
810 conv = build_conv (ck_ptr, from, conv);
812 else if (TYPE_PTRMEM_P (from))
814 tree fbase = TYPE_PTRMEM_CLASS_TYPE (from);
815 tree tbase = TYPE_PTRMEM_CLASS_TYPE (to);
817 if (DERIVED_FROM_P (fbase, tbase)
818 && (same_type_ignoring_top_level_qualifiers_p
819 (TYPE_PTRMEM_POINTED_TO_TYPE (from),
820 TYPE_PTRMEM_POINTED_TO_TYPE (to))))
822 from = build_ptrmem_type (tbase,
823 TYPE_PTRMEM_POINTED_TO_TYPE (from));
824 conv = build_conv (ck_pmem, from, conv);
826 else if (!same_type_p (fbase, tbase))
829 else if (CLASS_TYPE_P (TREE_TYPE (from))
830 && CLASS_TYPE_P (TREE_TYPE (to))
833 An rvalue of type "pointer to cv D," where D is a
834 class type, can be converted to an rvalue of type
835 "pointer to cv B," where B is a base class (clause
836 _class.derived_) of D. If B is an inaccessible
837 (clause _class.access_) or ambiguous
838 (_class.member.lookup_) base class of D, a program
839 that necessitates this conversion is ill-formed.
840 Therefore, we use DERIVED_FROM_P, and do not check
841 access or uniqueness. */
842 && DERIVED_FROM_P (TREE_TYPE (to), TREE_TYPE (from)))
845 cp_build_qualified_type (TREE_TYPE (to),
846 cp_type_quals (TREE_TYPE (from)));
847 from = build_pointer_type (from);
848 conv = build_conv (ck_ptr, from, conv);
852 if (tcode == POINTER_TYPE)
854 to_pointee = TREE_TYPE (to);
855 from_pointee = TREE_TYPE (from);
859 to_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (to);
860 from_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (from);
863 if (same_type_p (from, to))
865 else if (c_cast_p && comp_ptr_ttypes_const (to, from))
866 /* In a C-style cast, we ignore CV-qualification because we
867 are allowed to perform a static_cast followed by a
869 conv = build_conv (ck_qual, to, conv);
870 else if (!c_cast_p && comp_ptr_ttypes (to_pointee, from_pointee))
871 conv = build_conv (ck_qual, to, conv);
872 else if (expr && string_conv_p (to, expr, 0))
873 /* converting from string constant to char *. */
874 conv = build_conv (ck_qual, to, conv);
875 else if (ptr_reasonably_similar (to_pointee, from_pointee))
877 conv = build_conv (ck_ptr, to, conv);
885 else if (TYPE_PTRMEMFUNC_P (to) && TYPE_PTRMEMFUNC_P (from))
887 tree fromfn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from));
888 tree tofn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to));
889 tree fbase = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fromfn)));
890 tree tbase = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (tofn)));
892 if (!DERIVED_FROM_P (fbase, tbase)
893 || !same_type_p (TREE_TYPE (fromfn), TREE_TYPE (tofn))
894 || !compparms (TREE_CHAIN (TYPE_ARG_TYPES (fromfn)),
895 TREE_CHAIN (TYPE_ARG_TYPES (tofn)))
896 || cp_type_quals (fbase) != cp_type_quals (tbase))
899 from = build_memfn_type (fromfn, tbase, cp_type_quals (tbase));
900 from = build_ptrmemfunc_type (build_pointer_type (from));
901 conv = build_conv (ck_pmem, from, conv);
904 else if (tcode == BOOLEAN_TYPE)
908 An rvalue of arithmetic, unscoped enumeration, pointer, or
909 pointer to member type can be converted to an rvalue of type
911 if (ARITHMETIC_TYPE_P (from)
912 || UNSCOPED_ENUM_P (from)
913 || fcode == POINTER_TYPE
914 || TYPE_PTR_TO_MEMBER_P (from))
916 conv = build_conv (ck_std, to, conv);
917 if (fcode == POINTER_TYPE
918 || TYPE_PTRMEM_P (from)
919 || (TYPE_PTRMEMFUNC_P (from)
920 && conv->rank < cr_pbool))
921 conv->rank = cr_pbool;
927 /* We don't check for ENUMERAL_TYPE here because there are no standard
928 conversions to enum type. */
929 /* As an extension, allow conversion to complex type. */
930 else if (ARITHMETIC_TYPE_P (to))
932 if (! (INTEGRAL_CODE_P (fcode) || fcode == REAL_TYPE)
933 || SCOPED_ENUM_P (from))
935 conv = build_conv (ck_std, to, conv);
937 /* Give this a better rank if it's a promotion. */
938 if (same_type_p (to, type_promotes_to (from))
939 && conv->u.next->rank <= cr_promotion)
940 conv->rank = cr_promotion;
942 else if (fcode == VECTOR_TYPE && tcode == VECTOR_TYPE
943 && vector_types_convertible_p (from, to, false))
944 return build_conv (ck_std, to, conv);
945 else if (MAYBE_CLASS_TYPE_P (to) && MAYBE_CLASS_TYPE_P (from)
946 && is_properly_derived_from (from, to))
948 if (conv->kind == ck_rvalue)
950 conv = build_conv (ck_base, to, conv);
951 /* The derived-to-base conversion indicates the initialization
952 of a parameter with base type from an object of a derived
953 type. A temporary object is created to hold the result of
954 the conversion unless we're binding directly to a reference. */
955 conv->need_temporary_p = !(flags & LOOKUP_NO_TEMP_BIND);
960 if (flags & LOOKUP_NO_NARROWING)
961 conv->check_narrowing = true;
966 /* Returns nonzero if T1 is reference-related to T2. */
969 reference_related_p (tree t1, tree t2)
971 t1 = TYPE_MAIN_VARIANT (t1);
972 t2 = TYPE_MAIN_VARIANT (t2);
976 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
977 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
979 return (same_type_p (t1, t2)
980 || (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
981 && DERIVED_FROM_P (t1, t2)));
984 /* Returns nonzero if T1 is reference-compatible with T2. */
987 reference_compatible_p (tree t1, tree t2)
991 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
992 reference-related to T2 and cv1 is the same cv-qualification as,
993 or greater cv-qualification than, cv2. */
994 return (reference_related_p (t1, t2)
995 && at_least_as_qualified_p (t1, t2));
998 /* Determine whether or not the EXPR (of class type S) can be
999 converted to T as in [over.match.ref]. */
1002 convert_class_to_reference (tree reference_type, tree s, tree expr, int flags)
1008 struct z_candidate *candidates;
1009 struct z_candidate *cand;
1012 conversions = lookup_conversions (s, /*lookup_template_convs_p=*/true);
1018 Assuming that "cv1 T" is the underlying type of the reference
1019 being initialized, and "cv S" is the type of the initializer
1020 expression, with S a class type, the candidate functions are
1021 selected as follows:
1023 --The conversion functions of S and its base classes are
1024 considered. Those that are not hidden within S and yield type
1025 "reference to cv2 T2", where "cv1 T" is reference-compatible
1026 (_dcl.init.ref_) with "cv2 T2", are candidate functions.
1028 The argument list has one argument, which is the initializer
1033 /* Conceptually, we should take the address of EXPR and put it in
1034 the argument list. Unfortunately, however, that can result in
1035 error messages, which we should not issue now because we are just
1036 trying to find a conversion operator. Therefore, we use NULL,
1037 cast to the appropriate type. */
1038 first_arg = build_int_cst (build_pointer_type (s), 0);
1040 t = TREE_TYPE (reference_type);
1042 for (; conversions; conversions = TREE_CHAIN (conversions))
1044 tree fns = TREE_VALUE (conversions);
1046 for (; fns; fns = OVL_NEXT (fns))
1048 tree f = OVL_CURRENT (fns);
1049 tree t2 = TREE_TYPE (TREE_TYPE (f));
1051 if (DECL_NONCONVERTING_P (f)
1052 && (flags & LOOKUP_ONLYCONVERTING))
1057 /* If this is a template function, try to get an exact
1059 if (TREE_CODE (f) == TEMPLATE_DECL)
1061 cand = add_template_candidate (&candidates,
1068 TREE_PURPOSE (conversions),
1074 /* Now, see if the conversion function really returns
1075 an lvalue of the appropriate type. From the
1076 point of view of unification, simply returning an
1077 rvalue of the right type is good enough. */
1079 t2 = TREE_TYPE (TREE_TYPE (f));
1080 if (TREE_CODE (t2) != REFERENCE_TYPE
1081 || !reference_compatible_p (t, TREE_TYPE (t2)))
1083 candidates = candidates->next;
1088 else if (TREE_CODE (t2) == REFERENCE_TYPE
1089 && reference_compatible_p (t, TREE_TYPE (t2)))
1090 cand = add_function_candidate (&candidates, f, s, first_arg,
1091 NULL, TYPE_BINFO (s),
1092 TREE_PURPOSE (conversions),
1097 conversion *identity_conv;
1098 /* Build a standard conversion sequence indicating the
1099 binding from the reference type returned by the
1100 function to the desired REFERENCE_TYPE. */
1102 = build_identity_conv (TREE_TYPE (TREE_TYPE
1103 (TREE_TYPE (cand->fn))),
1106 = (direct_reference_binding
1107 (reference_type, identity_conv));
1108 cand->second_conv->rvaluedness_matches_p
1109 = TYPE_REF_IS_RVALUE (TREE_TYPE (TREE_TYPE (cand->fn)))
1110 == TYPE_REF_IS_RVALUE (reference_type);
1111 cand->second_conv->bad_p |= cand->convs[0]->bad_p;
1113 /* Don't allow binding of lvalues to rvalue references. */
1114 if (TYPE_REF_IS_RVALUE (reference_type)
1115 && !TYPE_REF_IS_RVALUE (TREE_TYPE (TREE_TYPE (cand->fn))))
1116 cand->second_conv->bad_p = true;
1121 candidates = splice_viable (candidates, pedantic, &any_viable_p);
1122 /* If none of the conversion functions worked out, let our caller
1127 cand = tourney (candidates);
1131 /* Now that we know that this is the function we're going to use fix
1132 the dummy first argument. */
1133 gcc_assert (cand->first_arg == NULL_TREE
1134 || integer_zerop (cand->first_arg));
1135 cand->first_arg = build_this (expr);
1137 /* Build a user-defined conversion sequence representing the
1139 conv = build_conv (ck_user,
1140 TREE_TYPE (TREE_TYPE (cand->fn)),
1141 build_identity_conv (TREE_TYPE (expr), expr));
1144 if (cand->viable == -1)
1147 /* Merge it with the standard conversion sequence from the
1148 conversion function's return type to the desired type. */
1149 cand->second_conv = merge_conversion_sequences (conv, cand->second_conv);
1151 return cand->second_conv;
1154 /* A reference of the indicated TYPE is being bound directly to the
1155 expression represented by the implicit conversion sequence CONV.
1156 Return a conversion sequence for this binding. */
1159 direct_reference_binding (tree type, conversion *conv)
1163 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
1164 gcc_assert (TREE_CODE (conv->type) != REFERENCE_TYPE);
1166 t = TREE_TYPE (type);
1170 When a parameter of reference type binds directly
1171 (_dcl.init.ref_) to an argument expression, the implicit
1172 conversion sequence is the identity conversion, unless the
1173 argument expression has a type that is a derived class of the
1174 parameter type, in which case the implicit conversion sequence is
1175 a derived-to-base Conversion.
1177 If the parameter binds directly to the result of applying a
1178 conversion function to the argument expression, the implicit
1179 conversion sequence is a user-defined conversion sequence
1180 (_over.ics.user_), with the second standard conversion sequence
1181 either an identity conversion or, if the conversion function
1182 returns an entity of a type that is a derived class of the
1183 parameter type, a derived-to-base conversion. */
1184 if (!same_type_ignoring_top_level_qualifiers_p (t, conv->type))
1186 /* Represent the derived-to-base conversion. */
1187 conv = build_conv (ck_base, t, conv);
1188 /* We will actually be binding to the base-class subobject in
1189 the derived class, so we mark this conversion appropriately.
1190 That way, convert_like knows not to generate a temporary. */
1191 conv->need_temporary_p = false;
1193 return build_conv (ck_ref_bind, type, conv);
1196 /* Returns the conversion path from type FROM to reference type TO for
1197 purposes of reference binding. For lvalue binding, either pass a
1198 reference type to FROM or an lvalue expression to EXPR. If the
1199 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1200 the conversion returned. If C_CAST_P is true, this
1201 conversion is coming from a C-style cast. */
1204 reference_binding (tree rto, tree rfrom, tree expr, bool c_cast_p, int flags)
1206 conversion *conv = NULL;
1207 tree to = TREE_TYPE (rto);
1212 cp_lvalue_kind is_lvalue = clk_none;
1214 if (TREE_CODE (to) == FUNCTION_TYPE && expr && type_unknown_p (expr))
1216 expr = instantiate_type (to, expr, tf_none);
1217 if (expr == error_mark_node)
1219 from = TREE_TYPE (expr);
1222 if (TREE_CODE (from) == REFERENCE_TYPE)
1224 /* Anything with reference type is an lvalue. */
1225 is_lvalue = clk_ordinary;
1226 from = TREE_TYPE (from);
1229 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1231 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
1232 conv = implicit_conversion (to, from, expr, c_cast_p,
1234 if (!CLASS_TYPE_P (to)
1235 && CONSTRUCTOR_NELTS (expr) == 1)
1237 expr = CONSTRUCTOR_ELT (expr, 0)->value;
1238 if (error_operand_p (expr))
1240 from = TREE_TYPE (expr);
1244 if (is_lvalue == clk_none && expr)
1245 is_lvalue = real_lvalue_p (expr);
1248 if ((is_lvalue & clk_bitfield) != 0)
1249 tfrom = unlowered_expr_type (expr);
1251 /* Figure out whether or not the types are reference-related and
1252 reference compatible. We have do do this after stripping
1253 references from FROM. */
1254 related_p = reference_related_p (to, tfrom);
1255 /* If this is a C cast, first convert to an appropriately qualified
1256 type, so that we can later do a const_cast to the desired type. */
1257 if (related_p && c_cast_p
1258 && !at_least_as_qualified_p (to, tfrom))
1259 to = build_qualified_type (to, cp_type_quals (tfrom));
1260 compatible_p = reference_compatible_p (to, tfrom);
1262 /* Directly bind reference when target expression's type is compatible with
1263 the reference and expression is an lvalue. In DR391, the wording in
1264 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1265 const and rvalue references to rvalues of compatible class type.
1266 We should also do direct bindings for non-class "rvalues" derived from
1267 rvalue references. */
1270 || (((CP_TYPE_CONST_NON_VOLATILE_P (to)
1271 && !(flags & LOOKUP_NO_TEMP_BIND))
1272 || TYPE_REF_IS_RVALUE (rto))
1273 && (CLASS_TYPE_P (from) || (expr && lvalue_p (expr))))))
1277 If the initializer expression
1279 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1280 is reference-compatible with "cv2 T2,"
1282 the reference is bound directly to the initializer expression
1286 If the initializer expression is an rvalue, with T2 a class type,
1287 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1288 is bound to the object represented by the rvalue or to a sub-object
1289 within that object. */
1291 conv = build_identity_conv (tfrom, expr);
1292 conv = direct_reference_binding (rto, conv);
1294 if (flags & LOOKUP_PREFER_RVALUE)
1295 /* The top-level caller requested that we pretend that the lvalue
1296 be treated as an rvalue. */
1297 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
1299 conv->rvaluedness_matches_p
1300 = (TYPE_REF_IS_RVALUE (rto) == !is_lvalue);
1302 if ((is_lvalue & clk_bitfield) != 0
1303 || ((is_lvalue & clk_packed) != 0 && !TYPE_PACKED (to)))
1304 /* For the purposes of overload resolution, we ignore the fact
1305 this expression is a bitfield or packed field. (In particular,
1306 [over.ics.ref] says specifically that a function with a
1307 non-const reference parameter is viable even if the
1308 argument is a bitfield.)
1310 However, when we actually call the function we must create
1311 a temporary to which to bind the reference. If the
1312 reference is volatile, or isn't const, then we cannot make
1313 a temporary, so we just issue an error when the conversion
1315 conv->need_temporary_p = true;
1317 /* Don't allow binding of lvalues to rvalue references. */
1318 if (is_lvalue && TYPE_REF_IS_RVALUE (rto)
1319 && !(flags & LOOKUP_PREFER_RVALUE))
1324 /* [class.conv.fct] A conversion function is never used to convert a
1325 (possibly cv-qualified) object to the (possibly cv-qualified) same
1326 object type (or a reference to it), to a (possibly cv-qualified) base
1327 class of that type (or a reference to it).... */
1328 else if (CLASS_TYPE_P (from) && !related_p
1329 && !(flags & LOOKUP_NO_CONVERSION))
1333 If the initializer expression
1335 -- has a class type (i.e., T2 is a class type) can be
1336 implicitly converted to an lvalue of type "cv3 T3," where
1337 "cv1 T1" is reference-compatible with "cv3 T3". (this
1338 conversion is selected by enumerating the applicable
1339 conversion functions (_over.match.ref_) and choosing the
1340 best one through overload resolution. (_over.match_).
1342 the reference is bound to the lvalue result of the conversion
1343 in the second case. */
1344 conv = convert_class_to_reference (rto, from, expr, flags);
1349 /* From this point on, we conceptually need temporaries, even if we
1350 elide them. Only the cases above are "direct bindings". */
1351 if (flags & LOOKUP_NO_TEMP_BIND)
1356 When a parameter of reference type is not bound directly to an
1357 argument expression, the conversion sequence is the one required
1358 to convert the argument expression to the underlying type of the
1359 reference according to _over.best.ics_. Conceptually, this
1360 conversion sequence corresponds to copy-initializing a temporary
1361 of the underlying type with the argument expression. Any
1362 difference in top-level cv-qualification is subsumed by the
1363 initialization itself and does not constitute a conversion. */
1367 Otherwise, the reference shall be to a non-volatile const type.
1369 Under C++0x, [8.5.3/5 dcl.init.ref] it may also be an rvalue reference */
1370 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto))
1375 Otherwise, a temporary of type "cv1 T1" is created and
1376 initialized from the initializer expression using the rules for a
1377 non-reference copy initialization. If T1 is reference-related to
1378 T2, cv1 must be the same cv-qualification as, or greater
1379 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1380 if (related_p && !at_least_as_qualified_p (to, from))
1383 /* We're generating a temporary now, but don't bind any more in the
1384 conversion (specifically, don't slice the temporary returned by a
1385 conversion operator). */
1386 flags |= LOOKUP_NO_TEMP_BIND;
1388 /* Temporaries are copy-initialized, except for this hack to allow
1389 explicit conversion ops to the copy ctor. See also
1390 add_function_candidate. */
1391 if (!(flags & LOOKUP_COPY_PARM))
1392 flags |= LOOKUP_ONLYCONVERTING;
1395 conv = implicit_conversion (to, from, expr, c_cast_p,
1400 conv = build_conv (ck_ref_bind, rto, conv);
1401 /* This reference binding, unlike those above, requires the
1402 creation of a temporary. */
1403 conv->need_temporary_p = true;
1404 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
1409 /* Returns the implicit conversion sequence (see [over.ics]) from type
1410 FROM to type TO. The optional expression EXPR may affect the
1411 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1412 true, this conversion is coming from a C-style cast. */
1415 implicit_conversion (tree to, tree from, tree expr, bool c_cast_p,
1420 if (from == error_mark_node || to == error_mark_node
1421 || expr == error_mark_node)
1424 if (TREE_CODE (to) == REFERENCE_TYPE)
1425 conv = reference_binding (to, from, expr, c_cast_p, flags);
1427 conv = standard_conversion (to, from, expr, c_cast_p, flags);
1432 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1434 if (is_std_init_list (to))
1435 return build_list_conv (to, expr, flags);
1437 /* Allow conversion from an initializer-list with one element to a
1439 if (SCALAR_TYPE_P (to))
1441 int nelts = CONSTRUCTOR_NELTS (expr);
1445 elt = integer_zero_node;
1446 else if (nelts == 1)
1447 elt = CONSTRUCTOR_ELT (expr, 0)->value;
1449 elt = error_mark_node;
1451 conv = implicit_conversion (to, TREE_TYPE (elt), elt,
1455 conv->check_narrowing = true;
1456 if (BRACE_ENCLOSED_INITIALIZER_P (elt))
1457 /* Too many levels of braces, i.e. '{{1}}'. */
1464 if (expr != NULL_TREE
1465 && (MAYBE_CLASS_TYPE_P (from)
1466 || MAYBE_CLASS_TYPE_P (to))
1467 && (flags & LOOKUP_NO_CONVERSION) == 0)
1469 struct z_candidate *cand;
1470 int convflags = (flags & (LOOKUP_NO_TEMP_BIND|LOOKUP_ONLYCONVERTING));
1472 if (CLASS_TYPE_P (to)
1473 && !CLASSTYPE_NON_AGGREGATE (complete_type (to))
1474 && BRACE_ENCLOSED_INITIALIZER_P (expr))
1475 return build_aggr_conv (to, expr, flags);
1477 cand = build_user_type_conversion_1 (to, expr, convflags);
1479 conv = cand->second_conv;
1481 /* We used to try to bind a reference to a temporary here, but that
1482 is now handled after the recursive call to this function at the end
1483 of reference_binding. */
1490 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1491 functions. ARGS will not be changed until a single candidate is
1494 static struct z_candidate *
1495 add_candidate (struct z_candidate **candidates,
1496 tree fn, tree first_arg, const VEC(tree,gc) *args,
1497 size_t num_convs, conversion **convs,
1498 tree access_path, tree conversion_path,
1501 struct z_candidate *cand = (struct z_candidate *)
1502 conversion_obstack_alloc (sizeof (struct z_candidate));
1505 cand->first_arg = first_arg;
1507 cand->convs = convs;
1508 cand->num_convs = num_convs;
1509 cand->access_path = access_path;
1510 cand->conversion_path = conversion_path;
1511 cand->viable = viable;
1512 cand->next = *candidates;
1518 /* Create an overload candidate for the function or method FN called
1519 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1520 FLAGS is passed on to implicit_conversion.
1522 This does not change ARGS.
1524 CTYPE, if non-NULL, is the type we want to pretend this function
1525 comes from for purposes of overload resolution. */
1527 static struct z_candidate *
1528 add_function_candidate (struct z_candidate **candidates,
1529 tree fn, tree ctype, tree first_arg,
1530 const VEC(tree,gc) *args, tree access_path,
1531 tree conversion_path, int flags)
1533 tree parmlist = TYPE_ARG_TYPES (TREE_TYPE (fn));
1537 tree orig_first_arg = first_arg;
1541 /* At this point we should not see any functions which haven't been
1542 explicitly declared, except for friend functions which will have
1543 been found using argument dependent lookup. */
1544 gcc_assert (!DECL_ANTICIPATED (fn) || DECL_HIDDEN_FRIEND_P (fn));
1546 /* The `this', `in_chrg' and VTT arguments to constructors are not
1547 considered in overload resolution. */
1548 if (DECL_CONSTRUCTOR_P (fn))
1550 parmlist = skip_artificial_parms_for (fn, parmlist);
1551 skip = num_artificial_parms_for (fn);
1552 if (skip > 0 && first_arg != NULL_TREE)
1555 first_arg = NULL_TREE;
1561 len = VEC_length (tree, args) - skip + (first_arg != NULL_TREE ? 1 : 0);
1562 convs = alloc_conversions (len);
1564 /* 13.3.2 - Viable functions [over.match.viable]
1565 First, to be a viable function, a candidate function shall have enough
1566 parameters to agree in number with the arguments in the list.
1568 We need to check this first; otherwise, checking the ICSes might cause
1569 us to produce an ill-formed template instantiation. */
1571 parmnode = parmlist;
1572 for (i = 0; i < len; ++i)
1574 if (parmnode == NULL_TREE || parmnode == void_list_node)
1576 parmnode = TREE_CHAIN (parmnode);
1579 if (i < len && parmnode)
1582 /* Make sure there are default args for the rest of the parms. */
1583 else if (!sufficient_parms_p (parmnode))
1589 /* Second, for F to be a viable function, there shall exist for each
1590 argument an implicit conversion sequence that converts that argument
1591 to the corresponding parameter of F. */
1593 parmnode = parmlist;
1595 for (i = 0; i < len; ++i)
1601 if (parmnode == void_list_node)
1604 if (i == 0 && first_arg != NULL_TREE)
1607 arg = VEC_index (tree, args,
1608 i + skip - (first_arg != NULL_TREE ? 1 : 0));
1609 argtype = lvalue_type (arg);
1611 is_this = (i == 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
1612 && ! DECL_CONSTRUCTOR_P (fn));
1616 tree parmtype = TREE_VALUE (parmnode);
1619 /* The type of the implicit object parameter ('this') for
1620 overload resolution is not always the same as for the
1621 function itself; conversion functions are considered to
1622 be members of the class being converted, and functions
1623 introduced by a using-declaration are considered to be
1624 members of the class that uses them.
1626 Since build_over_call ignores the ICS for the `this'
1627 parameter, we can just change the parm type. */
1628 if (ctype && is_this)
1631 = build_qualified_type (ctype,
1632 TYPE_QUALS (TREE_TYPE (parmtype)));
1633 parmtype = build_pointer_type (parmtype);
1636 if (ctype && i == 0 && DECL_COPY_CONSTRUCTOR_P (fn)
1639 /* Hack: Direct-initialize copy parm (i.e. suppress
1640 LOOKUP_ONLYCONVERTING) to make explicit conversion ops
1641 work. See also reference_binding. */
1642 lflags |= LOOKUP_COPY_PARM;
1643 if (flags & LOOKUP_NO_COPY_CTOR_CONVERSION)
1644 lflags |= LOOKUP_NO_CONVERSION;
1647 lflags |= LOOKUP_ONLYCONVERTING;
1649 t = implicit_conversion (parmtype, argtype, arg,
1650 /*c_cast_p=*/false, lflags);
1654 t = build_identity_conv (argtype, arg);
1655 t->ellipsis_p = true;
1672 parmnode = TREE_CHAIN (parmnode);
1676 return add_candidate (candidates, fn, orig_first_arg, args, len, convs,
1677 access_path, conversion_path, viable);
1680 /* Create an overload candidate for the conversion function FN which will
1681 be invoked for expression OBJ, producing a pointer-to-function which
1682 will in turn be called with the argument list FIRST_ARG/ARGLIST,
1683 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
1684 passed on to implicit_conversion.
1686 Actually, we don't really care about FN; we care about the type it
1687 converts to. There may be multiple conversion functions that will
1688 convert to that type, and we rely on build_user_type_conversion_1 to
1689 choose the best one; so when we create our candidate, we record the type
1690 instead of the function. */
1692 static struct z_candidate *
1693 add_conv_candidate (struct z_candidate **candidates, tree fn, tree obj,
1694 tree first_arg, const VEC(tree,gc) *arglist,
1695 tree access_path, tree conversion_path)
1697 tree totype = TREE_TYPE (TREE_TYPE (fn));
1698 int i, len, viable, flags;
1699 tree parmlist, parmnode;
1702 for (parmlist = totype; TREE_CODE (parmlist) != FUNCTION_TYPE; )
1703 parmlist = TREE_TYPE (parmlist);
1704 parmlist = TYPE_ARG_TYPES (parmlist);
1706 len = VEC_length (tree, arglist) + (first_arg != NULL_TREE ? 1 : 0) + 1;
1707 convs = alloc_conversions (len);
1708 parmnode = parmlist;
1710 flags = LOOKUP_IMPLICIT;
1712 /* Don't bother looking up the same type twice. */
1713 if (*candidates && (*candidates)->fn == totype)
1716 for (i = 0; i < len; ++i)
1723 else if (i == 1 && first_arg != NULL_TREE)
1726 arg = VEC_index (tree, arglist,
1727 i - (first_arg != NULL_TREE ? 1 : 0) - 1);
1728 argtype = lvalue_type (arg);
1731 t = implicit_conversion (totype, argtype, arg, /*c_cast_p=*/false,
1733 else if (parmnode == void_list_node)
1736 t = implicit_conversion (TREE_VALUE (parmnode), argtype, arg,
1737 /*c_cast_p=*/false, flags);
1740 t = build_identity_conv (argtype, arg);
1741 t->ellipsis_p = true;
1755 parmnode = TREE_CHAIN (parmnode);
1761 if (!sufficient_parms_p (parmnode))
1764 return add_candidate (candidates, totype, first_arg, arglist, len, convs,
1765 access_path, conversion_path, viable);
1769 build_builtin_candidate (struct z_candidate **candidates, tree fnname,
1770 tree type1, tree type2, tree *args, tree *argtypes,
1782 num_convs = args[2] ? 3 : (args[1] ? 2 : 1);
1783 convs = alloc_conversions (num_convs);
1785 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
1786 conversion ops are allowed. We handle that here by just checking for
1787 boolean_type_node because other operators don't ask for it. COND_EXPR
1788 also does contextual conversion to bool for the first operand, but we
1789 handle that in build_conditional_expr, and type1 here is operand 2. */
1790 if (type1 != boolean_type_node)
1791 flags |= LOOKUP_ONLYCONVERTING;
1793 for (i = 0; i < 2; ++i)
1798 t = implicit_conversion (types[i], argtypes[i], args[i],
1799 /*c_cast_p=*/false, flags);
1803 /* We need something for printing the candidate. */
1804 t = build_identity_conv (types[i], NULL_TREE);
1811 /* For COND_EXPR we rearranged the arguments; undo that now. */
1814 convs[2] = convs[1];
1815 convs[1] = convs[0];
1816 t = implicit_conversion (boolean_type_node, argtypes[2], args[2],
1817 /*c_cast_p=*/false, flags);
1824 add_candidate (candidates, fnname, /*first_arg=*/NULL_TREE, /*args=*/NULL,
1826 /*access_path=*/NULL_TREE,
1827 /*conversion_path=*/NULL_TREE,
1832 is_complete (tree t)
1834 return COMPLETE_TYPE_P (complete_type (t));
1837 /* Returns nonzero if TYPE is a promoted arithmetic type. */
1840 promoted_arithmetic_type_p (tree type)
1844 In this section, the term promoted integral type is used to refer
1845 to those integral types which are preserved by integral promotion
1846 (including e.g. int and long but excluding e.g. char).
1847 Similarly, the term promoted arithmetic type refers to promoted
1848 integral types plus floating types. */
1849 return ((CP_INTEGRAL_TYPE_P (type)
1850 && same_type_p (type_promotes_to (type), type))
1851 || TREE_CODE (type) == REAL_TYPE);
1854 /* Create any builtin operator overload candidates for the operator in
1855 question given the converted operand types TYPE1 and TYPE2. The other
1856 args are passed through from add_builtin_candidates to
1857 build_builtin_candidate.
1859 TYPE1 and TYPE2 may not be permissible, and we must filter them.
1860 If CODE is requires candidates operands of the same type of the kind
1861 of which TYPE1 and TYPE2 are, we add both candidates
1862 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
1865 add_builtin_candidate (struct z_candidate **candidates, enum tree_code code,
1866 enum tree_code code2, tree fnname, tree type1,
1867 tree type2, tree *args, tree *argtypes, int flags)
1871 case POSTINCREMENT_EXPR:
1872 case POSTDECREMENT_EXPR:
1873 args[1] = integer_zero_node;
1874 type2 = integer_type_node;
1883 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
1884 and VQ is either volatile or empty, there exist candidate operator
1885 functions of the form
1886 VQ T& operator++(VQ T&);
1887 T operator++(VQ T&, int);
1888 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
1889 type other than bool, and VQ is either volatile or empty, there exist
1890 candidate operator functions of the form
1891 VQ T& operator--(VQ T&);
1892 T operator--(VQ T&, int);
1893 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
1894 complete object type, and VQ is either volatile or empty, there exist
1895 candidate operator functions of the form
1896 T*VQ& operator++(T*VQ&);
1897 T*VQ& operator--(T*VQ&);
1898 T* operator++(T*VQ&, int);
1899 T* operator--(T*VQ&, int); */
1901 case POSTDECREMENT_EXPR:
1902 case PREDECREMENT_EXPR:
1903 if (TREE_CODE (type1) == BOOLEAN_TYPE)
1905 case POSTINCREMENT_EXPR:
1906 case PREINCREMENT_EXPR:
1907 if (ARITHMETIC_TYPE_P (type1) || TYPE_PTROB_P (type1))
1909 type1 = build_reference_type (type1);
1914 /* 7 For every cv-qualified or cv-unqualified complete object type T, there
1915 exist candidate operator functions of the form
1919 8 For every function type T, there exist candidate operator functions of
1921 T& operator*(T*); */
1924 if (TREE_CODE (type1) == POINTER_TYPE
1925 && (TYPE_PTROB_P (type1)
1926 || TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE))
1930 /* 9 For every type T, there exist candidate operator functions of the form
1933 10For every promoted arithmetic type T, there exist candidate operator
1934 functions of the form
1938 case UNARY_PLUS_EXPR: /* unary + */
1939 if (TREE_CODE (type1) == POINTER_TYPE)
1942 if (ARITHMETIC_TYPE_P (type1))
1946 /* 11For every promoted integral type T, there exist candidate operator
1947 functions of the form
1951 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1))
1955 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
1956 is the same type as C2 or is a derived class of C2, T is a complete
1957 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
1958 there exist candidate operator functions of the form
1959 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
1960 where CV12 is the union of CV1 and CV2. */
1963 if (TREE_CODE (type1) == POINTER_TYPE
1964 && TYPE_PTR_TO_MEMBER_P (type2))
1966 tree c1 = TREE_TYPE (type1);
1967 tree c2 = TYPE_PTRMEM_CLASS_TYPE (type2);
1969 if (MAYBE_CLASS_TYPE_P (c1) && DERIVED_FROM_P (c2, c1)
1970 && (TYPE_PTRMEMFUNC_P (type2)
1971 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2))))
1976 /* 13For every pair of promoted arithmetic types L and R, there exist can-
1977 didate operator functions of the form
1982 bool operator<(L, R);
1983 bool operator>(L, R);
1984 bool operator<=(L, R);
1985 bool operator>=(L, R);
1986 bool operator==(L, R);
1987 bool operator!=(L, R);
1988 where LR is the result of the usual arithmetic conversions between
1991 14For every pair of types T and I, where T is a cv-qualified or cv-
1992 unqualified complete object type and I is a promoted integral type,
1993 there exist candidate operator functions of the form
1994 T* operator+(T*, I);
1995 T& operator[](T*, I);
1996 T* operator-(T*, I);
1997 T* operator+(I, T*);
1998 T& operator[](I, T*);
2000 15For every T, where T is a pointer to complete object type, there exist
2001 candidate operator functions of the form112)
2002 ptrdiff_t operator-(T, T);
2004 16For every pointer or enumeration type T, there exist candidate operator
2005 functions of the form
2006 bool operator<(T, T);
2007 bool operator>(T, T);
2008 bool operator<=(T, T);
2009 bool operator>=(T, T);
2010 bool operator==(T, T);
2011 bool operator!=(T, T);
2013 17For every pointer to member type T, there exist candidate operator
2014 functions of the form
2015 bool operator==(T, T);
2016 bool operator!=(T, T); */
2019 if (TYPE_PTROB_P (type1) && TYPE_PTROB_P (type2))
2021 if (TYPE_PTROB_P (type1)
2022 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2024 type2 = ptrdiff_type_node;
2028 case TRUNC_DIV_EXPR:
2029 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2035 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2036 || (TYPE_PTRMEM_P (type1) && TYPE_PTRMEM_P (type2)))
2038 if (TYPE_PTR_TO_MEMBER_P (type1) && null_ptr_cst_p (args[1]))
2043 if (TYPE_PTR_TO_MEMBER_P (type2) && null_ptr_cst_p (args[0]))
2055 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2057 if (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2059 if (TREE_CODE (type1) == ENUMERAL_TYPE
2060 && TREE_CODE (type2) == ENUMERAL_TYPE)
2062 if (TYPE_PTR_P (type1)
2063 && null_ptr_cst_p (args[1])
2064 && !uses_template_parms (type1))
2069 if (null_ptr_cst_p (args[0])
2070 && TYPE_PTR_P (type2)
2071 && !uses_template_parms (type2))
2079 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2082 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && TYPE_PTROB_P (type2))
2084 type1 = ptrdiff_type_node;
2087 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2089 type2 = ptrdiff_type_node;
2094 /* 18For every pair of promoted integral types L and R, there exist candi-
2095 date operator functions of the form
2102 where LR is the result of the usual arithmetic conversions between
2105 case TRUNC_MOD_EXPR:
2111 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2115 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2116 type, VQ is either volatile or empty, and R is a promoted arithmetic
2117 type, there exist candidate operator functions of the form
2118 VQ L& operator=(VQ L&, R);
2119 VQ L& operator*=(VQ L&, R);
2120 VQ L& operator/=(VQ L&, R);
2121 VQ L& operator+=(VQ L&, R);
2122 VQ L& operator-=(VQ L&, R);
2124 20For every pair T, VQ), where T is any type and VQ is either volatile
2125 or empty, there exist candidate operator functions of the form
2126 T*VQ& operator=(T*VQ&, T*);
2128 21For every pair T, VQ), where T is a pointer to member type and VQ is
2129 either volatile or empty, there exist candidate operator functions of
2131 VQ T& operator=(VQ T&, T);
2133 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2134 unqualified complete object type, VQ is either volatile or empty, and
2135 I is a promoted integral type, there exist candidate operator func-
2137 T*VQ& operator+=(T*VQ&, I);
2138 T*VQ& operator-=(T*VQ&, I);
2140 23For every triple L, VQ, R), where L is an integral or enumeration
2141 type, VQ is either volatile or empty, and R is a promoted integral
2142 type, there exist candidate operator functions of the form
2144 VQ L& operator%=(VQ L&, R);
2145 VQ L& operator<<=(VQ L&, R);
2146 VQ L& operator>>=(VQ L&, R);
2147 VQ L& operator&=(VQ L&, R);
2148 VQ L& operator^=(VQ L&, R);
2149 VQ L& operator|=(VQ L&, R); */
2156 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2158 type2 = ptrdiff_type_node;
2162 case TRUNC_DIV_EXPR:
2163 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2167 case TRUNC_MOD_EXPR:
2173 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2178 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2180 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2181 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2182 || (TYPE_PTRMEM_P (type1) && TYPE_PTRMEM_P (type2))
2183 || ((TYPE_PTRMEMFUNC_P (type1)
2184 || TREE_CODE (type1) == POINTER_TYPE)
2185 && null_ptr_cst_p (args[1])))
2195 type1 = build_reference_type (type1);
2201 For every pair of promoted arithmetic types L and R, there
2202 exist candidate operator functions of the form
2204 LR operator?(bool, L, R);
2206 where LR is the result of the usual arithmetic conversions
2207 between types L and R.
2209 For every type T, where T is a pointer or pointer-to-member
2210 type, there exist candidate operator functions of the form T
2211 operator?(bool, T, T); */
2213 if (promoted_arithmetic_type_p (type1)
2214 && promoted_arithmetic_type_p (type2))
2218 /* Otherwise, the types should be pointers. */
2219 if (!(TYPE_PTR_P (type1) || TYPE_PTR_TO_MEMBER_P (type1))
2220 || !(TYPE_PTR_P (type2) || TYPE_PTR_TO_MEMBER_P (type2)))
2223 /* We don't check that the two types are the same; the logic
2224 below will actually create two candidates; one in which both
2225 parameter types are TYPE1, and one in which both parameter
2233 /* If we're dealing with two pointer types or two enumeral types,
2234 we need candidates for both of them. */
2235 if (type2 && !same_type_p (type1, type2)
2236 && TREE_CODE (type1) == TREE_CODE (type2)
2237 && (TREE_CODE (type1) == REFERENCE_TYPE
2238 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2239 || (TYPE_PTRMEM_P (type1) && TYPE_PTRMEM_P (type2))
2240 || TYPE_PTRMEMFUNC_P (type1)
2241 || MAYBE_CLASS_TYPE_P (type1)
2242 || TREE_CODE (type1) == ENUMERAL_TYPE))
2244 build_builtin_candidate
2245 (candidates, fnname, type1, type1, args, argtypes, flags);
2246 build_builtin_candidate
2247 (candidates, fnname, type2, type2, args, argtypes, flags);
2251 build_builtin_candidate
2252 (candidates, fnname, type1, type2, args, argtypes, flags);
2256 type_decays_to (tree type)
2258 if (TREE_CODE (type) == ARRAY_TYPE)
2259 return build_pointer_type (TREE_TYPE (type));
2260 if (TREE_CODE (type) == FUNCTION_TYPE)
2261 return build_pointer_type (type);
2265 /* There are three conditions of builtin candidates:
2267 1) bool-taking candidates. These are the same regardless of the input.
2268 2) pointer-pair taking candidates. These are generated for each type
2269 one of the input types converts to.
2270 3) arithmetic candidates. According to the standard, we should generate
2271 all of these, but I'm trying not to...
2273 Here we generate a superset of the possible candidates for this particular
2274 case. That is a subset of the full set the standard defines, plus some
2275 other cases which the standard disallows. add_builtin_candidate will
2276 filter out the invalid set. */
2279 add_builtin_candidates (struct z_candidate **candidates, enum tree_code code,
2280 enum tree_code code2, tree fnname, tree *args,
2285 tree type, argtypes[3];
2286 /* TYPES[i] is the set of possible builtin-operator parameter types
2287 we will consider for the Ith argument. These are represented as
2288 a TREE_LIST; the TREE_VALUE of each node is the potential
2292 for (i = 0; i < 3; ++i)
2295 argtypes[i] = unlowered_expr_type (args[i]);
2297 argtypes[i] = NULL_TREE;
2302 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2303 and VQ is either volatile or empty, there exist candidate operator
2304 functions of the form
2305 VQ T& operator++(VQ T&); */
2307 case POSTINCREMENT_EXPR:
2308 case PREINCREMENT_EXPR:
2309 case POSTDECREMENT_EXPR:
2310 case PREDECREMENT_EXPR:
2315 /* 24There also exist candidate operator functions of the form
2316 bool operator!(bool);
2317 bool operator&&(bool, bool);
2318 bool operator||(bool, bool); */
2320 case TRUTH_NOT_EXPR:
2321 build_builtin_candidate
2322 (candidates, fnname, boolean_type_node,
2323 NULL_TREE, args, argtypes, flags);
2326 case TRUTH_ORIF_EXPR:
2327 case TRUTH_ANDIF_EXPR:
2328 build_builtin_candidate
2329 (candidates, fnname, boolean_type_node,
2330 boolean_type_node, args, argtypes, flags);
2352 types[0] = types[1] = NULL_TREE;
2354 for (i = 0; i < 2; ++i)
2358 else if (MAYBE_CLASS_TYPE_P (argtypes[i]))
2362 if (i == 0 && code == MODIFY_EXPR && code2 == NOP_EXPR)
2365 convs = lookup_conversions (argtypes[i],
2366 /*lookup_template_convs_p=*/false);
2368 if (code == COND_EXPR)
2370 if (real_lvalue_p (args[i]))
2371 types[i] = tree_cons
2372 (NULL_TREE, build_reference_type (argtypes[i]), types[i]);
2374 types[i] = tree_cons
2375 (NULL_TREE, TYPE_MAIN_VARIANT (argtypes[i]), types[i]);
2381 for (; convs; convs = TREE_CHAIN (convs))
2383 type = TREE_TYPE (convs);
2386 && (TREE_CODE (type) != REFERENCE_TYPE
2387 || CP_TYPE_CONST_P (TREE_TYPE (type))))
2390 if (code == COND_EXPR && TREE_CODE (type) == REFERENCE_TYPE)
2391 types[i] = tree_cons (NULL_TREE, type, types[i]);
2393 type = non_reference (type);
2394 if (i != 0 || ! ref1)
2396 type = TYPE_MAIN_VARIANT (type_decays_to (type));
2397 if (enum_p && TREE_CODE (type) == ENUMERAL_TYPE)
2398 types[i] = tree_cons (NULL_TREE, type, types[i]);
2399 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
2400 type = type_promotes_to (type);
2403 if (! value_member (type, types[i]))
2404 types[i] = tree_cons (NULL_TREE, type, types[i]);
2409 if (code == COND_EXPR && real_lvalue_p (args[i]))
2410 types[i] = tree_cons
2411 (NULL_TREE, build_reference_type (argtypes[i]), types[i]);
2412 type = non_reference (argtypes[i]);
2413 if (i != 0 || ! ref1)
2415 type = TYPE_MAIN_VARIANT (type_decays_to (type));
2416 if (enum_p && UNSCOPED_ENUM_P (type))
2417 types[i] = tree_cons (NULL_TREE, type, types[i]);
2418 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
2419 type = type_promotes_to (type);
2421 types[i] = tree_cons (NULL_TREE, type, types[i]);
2425 /* Run through the possible parameter types of both arguments,
2426 creating candidates with those parameter types. */
2427 for (; types[0]; types[0] = TREE_CHAIN (types[0]))
2430 for (type = types[1]; type; type = TREE_CHAIN (type))
2431 add_builtin_candidate
2432 (candidates, code, code2, fnname, TREE_VALUE (types[0]),
2433 TREE_VALUE (type), args, argtypes, flags);
2435 add_builtin_candidate
2436 (candidates, code, code2, fnname, TREE_VALUE (types[0]),
2437 NULL_TREE, args, argtypes, flags);
2442 /* If TMPL can be successfully instantiated as indicated by
2443 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2445 TMPL is the template. EXPLICIT_TARGS are any explicit template
2446 arguments. ARGLIST is the arguments provided at the call-site.
2447 This does not change ARGLIST. The RETURN_TYPE is the desired type
2448 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
2449 as for add_function_candidate. If an OBJ is supplied, FLAGS and
2450 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
2452 static struct z_candidate*
2453 add_template_candidate_real (struct z_candidate **candidates, tree tmpl,
2454 tree ctype, tree explicit_targs, tree first_arg,
2455 const VEC(tree,gc) *arglist, tree return_type,
2456 tree access_path, tree conversion_path,
2457 int flags, tree obj, unification_kind_t strict)
2459 int ntparms = DECL_NTPARMS (tmpl);
2460 tree targs = make_tree_vec (ntparms);
2461 unsigned int len = VEC_length (tree, arglist);
2462 unsigned int nargs = (first_arg == NULL_TREE ? 0 : 1) + len;
2463 unsigned int skip_without_in_chrg = 0;
2464 tree first_arg_without_in_chrg = first_arg;
2465 tree *args_without_in_chrg;
2466 unsigned int nargs_without_in_chrg;
2467 unsigned int ia, ix;
2469 struct z_candidate *cand;
2473 /* We don't do deduction on the in-charge parameter, the VTT
2474 parameter or 'this'. */
2475 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl))
2477 if (first_arg_without_in_chrg != NULL_TREE)
2478 first_arg_without_in_chrg = NULL_TREE;
2480 ++skip_without_in_chrg;
2483 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl)
2484 || DECL_BASE_CONSTRUCTOR_P (tmpl))
2485 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl)))
2487 if (first_arg_without_in_chrg != NULL_TREE)
2488 first_arg_without_in_chrg = NULL_TREE;
2490 ++skip_without_in_chrg;
2493 if (len < skip_without_in_chrg)
2496 nargs_without_in_chrg = ((first_arg_without_in_chrg != NULL_TREE ? 1 : 0)
2497 + (len - skip_without_in_chrg));
2498 args_without_in_chrg = XALLOCAVEC (tree, nargs_without_in_chrg);
2500 if (first_arg_without_in_chrg != NULL_TREE)
2502 args_without_in_chrg[ia] = first_arg_without_in_chrg;
2505 for (ix = skip_without_in_chrg;
2506 VEC_iterate (tree, arglist, ix, arg);
2509 args_without_in_chrg[ia] = arg;
2512 gcc_assert (ia == nargs_without_in_chrg);
2514 i = fn_type_unification (tmpl, explicit_targs, targs,
2515 args_without_in_chrg,
2516 nargs_without_in_chrg,
2517 return_type, strict, flags);
2522 fn = instantiate_template (tmpl, targs, tf_none);
2523 if (fn == error_mark_node)
2528 A member function template is never instantiated to perform the
2529 copy of a class object to an object of its class type.
2531 It's a little unclear what this means; the standard explicitly
2532 does allow a template to be used to copy a class. For example,
2537 template <class T> A(const T&);
2540 void g () { A a (f ()); }
2542 the member template will be used to make the copy. The section
2543 quoted above appears in the paragraph that forbids constructors
2544 whose only parameter is (a possibly cv-qualified variant of) the
2545 class type, and a logical interpretation is that the intent was
2546 to forbid the instantiation of member templates which would then
2548 if (DECL_CONSTRUCTOR_P (fn) && nargs == 2)
2550 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (fn);
2551 if (arg_types && same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types)),
2556 if (obj != NULL_TREE)
2557 /* Aha, this is a conversion function. */
2558 cand = add_conv_candidate (candidates, fn, obj, first_arg, arglist,
2559 access_path, conversion_path);
2561 cand = add_function_candidate (candidates, fn, ctype,
2562 first_arg, arglist, access_path,
2563 conversion_path, flags);
2564 if (DECL_TI_TEMPLATE (fn) != tmpl)
2565 /* This situation can occur if a member template of a template
2566 class is specialized. Then, instantiate_template might return
2567 an instantiation of the specialization, in which case the
2568 DECL_TI_TEMPLATE field will point at the original
2569 specialization. For example:
2571 template <class T> struct S { template <class U> void f(U);
2572 template <> void f(int) {}; };
2576 Here, TMPL will be template <class U> S<double>::f(U).
2577 And, instantiate template will give us the specialization
2578 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
2579 for this will point at template <class T> template <> S<T>::f(int),
2580 so that we can find the definition. For the purposes of
2581 overload resolution, however, we want the original TMPL. */
2582 cand->template_decl = build_template_info (tmpl, targs);
2584 cand->template_decl = DECL_TEMPLATE_INFO (fn);
2590 static struct z_candidate *
2591 add_template_candidate (struct z_candidate **candidates, tree tmpl, tree ctype,
2592 tree explicit_targs, tree first_arg,
2593 const VEC(tree,gc) *arglist, tree return_type,
2594 tree access_path, tree conversion_path, int flags,
2595 unification_kind_t strict)
2598 add_template_candidate_real (candidates, tmpl, ctype,
2599 explicit_targs, first_arg, arglist,
2600 return_type, access_path, conversion_path,
2601 flags, NULL_TREE, strict);
2605 static struct z_candidate *
2606 add_template_conv_candidate (struct z_candidate **candidates, tree tmpl,
2607 tree obj, tree first_arg,
2608 const VEC(tree,gc) *arglist,
2609 tree return_type, tree access_path,
2610 tree conversion_path)
2613 add_template_candidate_real (candidates, tmpl, NULL_TREE, NULL_TREE,
2614 first_arg, arglist, return_type, access_path,
2615 conversion_path, 0, obj, DEDUCE_CONV);
2618 /* The CANDS are the set of candidates that were considered for
2619 overload resolution. Return the set of viable candidates. If none
2620 of the candidates were viable, set *ANY_VIABLE_P to true. STRICT_P
2621 is true if a candidate should be considered viable only if it is
2624 static struct z_candidate*
2625 splice_viable (struct z_candidate *cands,
2629 struct z_candidate *viable;
2630 struct z_candidate **last_viable;
2631 struct z_candidate **cand;
2634 last_viable = &viable;
2635 *any_viable_p = false;
2640 struct z_candidate *c = *cand;
2641 if (strict_p ? c->viable == 1 : c->viable)
2646 last_viable = &c->next;
2647 *any_viable_p = true;
2653 return viable ? viable : cands;
2657 any_strictly_viable (struct z_candidate *cands)
2659 for (; cands; cands = cands->next)
2660 if (cands->viable == 1)
2665 /* OBJ is being used in an expression like "OBJ.f (...)". In other
2666 words, it is about to become the "this" pointer for a member
2667 function call. Take the address of the object. */
2670 build_this (tree obj)
2672 /* In a template, we are only concerned about the type of the
2673 expression, so we can take a shortcut. */
2674 if (processing_template_decl)
2675 return build_address (obj);
2677 return cp_build_unary_op (ADDR_EXPR, obj, 0, tf_warning_or_error);
2680 /* Returns true iff functions are equivalent. Equivalent functions are
2681 not '==' only if one is a function-local extern function or if
2682 both are extern "C". */
2685 equal_functions (tree fn1, tree fn2)
2687 if (DECL_LOCAL_FUNCTION_P (fn1) || DECL_LOCAL_FUNCTION_P (fn2)
2688 || DECL_EXTERN_C_FUNCTION_P (fn1))
2689 return decls_match (fn1, fn2);
2693 /* Print information about one overload candidate CANDIDATE. MSGSTR
2694 is the text to print before the candidate itself.
2696 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
2697 to have been run through gettext by the caller. This wart makes
2698 life simpler in print_z_candidates and for the translators. */
2701 print_z_candidate (const char *msgstr, struct z_candidate *candidate)
2703 if (TREE_CODE (candidate->fn) == IDENTIFIER_NODE)
2705 if (candidate->num_convs == 3)
2706 inform (input_location, "%s %D(%T, %T, %T) <built-in>", msgstr, candidate->fn,
2707 candidate->convs[0]->type,
2708 candidate->convs[1]->type,
2709 candidate->convs[2]->type);
2710 else if (candidate->num_convs == 2)
2711 inform (input_location, "%s %D(%T, %T) <built-in>", msgstr, candidate->fn,
2712 candidate->convs[0]->type,
2713 candidate->convs[1]->type);
2715 inform (input_location, "%s %D(%T) <built-in>", msgstr, candidate->fn,
2716 candidate->convs[0]->type);
2718 else if (TYPE_P (candidate->fn))
2719 inform (input_location, "%s %T <conversion>", msgstr, candidate->fn);
2720 else if (candidate->viable == -1)
2721 inform (input_location, "%s %+#D <near match>", msgstr, candidate->fn);
2722 else if (DECL_DELETED_FN (candidate->fn))
2723 inform (input_location, "%s %+#D <deleted>", msgstr, candidate->fn);
2725 inform (input_location, "%s %+#D", msgstr, candidate->fn);
2729 print_z_candidates (struct z_candidate *candidates)
2732 struct z_candidate *cand1;
2733 struct z_candidate **cand2;
2739 /* Remove deleted candidates. */
2741 for (cand2 = &cand1; *cand2; )
2743 if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL
2744 && DECL_DELETED_FN ((*cand2)->fn))
2745 *cand2 = (*cand2)->next;
2747 cand2 = &(*cand2)->next;
2749 /* ...if there are any non-deleted ones. */
2753 /* There may be duplicates in the set of candidates. We put off
2754 checking this condition as long as possible, since we have no way
2755 to eliminate duplicates from a set of functions in less than n^2
2756 time. Now we are about to emit an error message, so it is more
2757 permissible to go slowly. */
2758 for (cand1 = candidates; cand1; cand1 = cand1->next)
2760 tree fn = cand1->fn;
2761 /* Skip builtin candidates and conversion functions. */
2762 if (TREE_CODE (fn) != FUNCTION_DECL)
2764 cand2 = &cand1->next;
2767 if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL
2768 && equal_functions (fn, (*cand2)->fn))
2769 *cand2 = (*cand2)->next;
2771 cand2 = &(*cand2)->next;
2775 str = candidates->next ? _("candidates are:") : _("candidate is:");
2777 for (; candidates; candidates = candidates->next)
2779 print_z_candidate (spaces ? spaces : str, candidates);
2780 spaces = spaces ? spaces : get_spaces (str);
2785 /* USER_SEQ is a user-defined conversion sequence, beginning with a
2786 USER_CONV. STD_SEQ is the standard conversion sequence applied to
2787 the result of the conversion function to convert it to the final
2788 desired type. Merge the two sequences into a single sequence,
2789 and return the merged sequence. */
2792 merge_conversion_sequences (conversion *user_seq, conversion *std_seq)
2796 gcc_assert (user_seq->kind == ck_user);
2798 /* Find the end of the second conversion sequence. */
2800 while ((*t)->kind != ck_identity)
2801 t = &((*t)->u.next);
2803 /* Replace the identity conversion with the user conversion
2807 /* The entire sequence is a user-conversion sequence. */
2808 std_seq->user_conv_p = true;
2813 /* Returns the best overload candidate to perform the requested
2814 conversion. This function is used for three the overloading situations
2815 described in [over.match.copy], [over.match.conv], and [over.match.ref].
2816 If TOTYPE is a REFERENCE_TYPE, we're trying to find an lvalue binding as
2817 per [dcl.init.ref], so we ignore temporary bindings. */
2819 static struct z_candidate *
2820 build_user_type_conversion_1 (tree totype, tree expr, int flags)
2822 struct z_candidate *candidates, *cand;
2823 tree fromtype = TREE_TYPE (expr);
2824 tree ctors = NULL_TREE;
2825 tree conv_fns = NULL_TREE;
2826 conversion *conv = NULL;
2827 tree first_arg = NULL_TREE;
2828 VEC(tree,gc) *args = NULL;
2832 /* We represent conversion within a hierarchy using RVALUE_CONV and
2833 BASE_CONV, as specified by [over.best.ics]; these become plain
2834 constructor calls, as specified in [dcl.init]. */
2835 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype) || !MAYBE_CLASS_TYPE_P (totype)
2836 || !DERIVED_FROM_P (totype, fromtype));
2838 if (MAYBE_CLASS_TYPE_P (totype))
2839 ctors = lookup_fnfields (totype, complete_ctor_identifier, 0);
2841 if (MAYBE_CLASS_TYPE_P (fromtype))
2843 tree to_nonref = non_reference (totype);
2844 if (same_type_ignoring_top_level_qualifiers_p (to_nonref, fromtype) ||
2845 (CLASS_TYPE_P (to_nonref) && CLASS_TYPE_P (fromtype)
2846 && DERIVED_FROM_P (to_nonref, fromtype)))
2848 /* [class.conv.fct] A conversion function is never used to
2849 convert a (possibly cv-qualified) object to the (possibly
2850 cv-qualified) same object type (or a reference to it), to a
2851 (possibly cv-qualified) base class of that type (or a
2852 reference to it)... */
2855 conv_fns = lookup_conversions (fromtype,
2856 /*lookup_template_convs_p=*/true);
2860 flags |= LOOKUP_NO_CONVERSION;
2862 /* It's OK to bind a temporary for converting constructor arguments, but
2863 not in converting the return value of a conversion operator. */
2864 convflags = ((flags & LOOKUP_NO_TEMP_BIND) | LOOKUP_NO_CONVERSION);
2865 flags &= ~LOOKUP_NO_TEMP_BIND;
2869 ctors = BASELINK_FUNCTIONS (ctors);
2871 first_arg = build_int_cst (build_pointer_type (totype), 0);
2872 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
2873 && !TYPE_HAS_LIST_CTOR (totype))
2875 args = ctor_to_vec (expr);
2876 /* We still allow more conversions within an init-list. */
2877 flags = ((flags & ~LOOKUP_NO_CONVERSION)
2878 /* But not for the copy ctor. */
2879 |LOOKUP_NO_COPY_CTOR_CONVERSION
2880 |LOOKUP_NO_NARROWING);
2883 args = make_tree_vector_single (expr);
2885 /* We should never try to call the abstract or base constructor
2887 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors))
2888 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors)));
2890 for (; ctors; ctors = OVL_NEXT (ctors))
2892 tree ctor = OVL_CURRENT (ctors);
2893 if (DECL_NONCONVERTING_P (ctor)
2894 && !BRACE_ENCLOSED_INITIALIZER_P (expr))
2897 if (TREE_CODE (ctor) == TEMPLATE_DECL)
2898 cand = add_template_candidate (&candidates, ctor, totype,
2899 NULL_TREE, first_arg, args, NULL_TREE,
2900 TYPE_BINFO (totype),
2901 TYPE_BINFO (totype),
2905 cand = add_function_candidate (&candidates, ctor, totype,
2906 first_arg, args, TYPE_BINFO (totype),
2907 TYPE_BINFO (totype),
2912 cand->second_conv = build_identity_conv (totype, NULL_TREE);
2914 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
2915 set, then this is copy-initialization. In that case, "The
2916 result of the call is then used to direct-initialize the
2917 object that is the destination of the copy-initialization."
2920 We represent this in the conversion sequence with an
2921 rvalue conversion, which means a constructor call. */
2922 if (TREE_CODE (totype) != REFERENCE_TYPE
2923 && !(convflags & LOOKUP_NO_TEMP_BIND))
2925 = build_conv (ck_rvalue, totype, cand->second_conv);
2930 first_arg = build_this (expr);
2932 for (; conv_fns; conv_fns = TREE_CHAIN (conv_fns))
2935 tree conversion_path = TREE_PURPOSE (conv_fns);
2937 /* If we are called to convert to a reference type, we are trying to
2938 find an lvalue binding, so don't even consider temporaries. If
2939 we don't find an lvalue binding, the caller will try again to
2940 look for a temporary binding. */
2941 if (TREE_CODE (totype) == REFERENCE_TYPE)
2942 convflags |= LOOKUP_NO_TEMP_BIND;
2944 for (fns = TREE_VALUE (conv_fns); fns; fns = OVL_NEXT (fns))
2946 tree fn = OVL_CURRENT (fns);
2948 if (DECL_NONCONVERTING_P (fn)
2949 && (flags & LOOKUP_ONLYCONVERTING))
2952 /* [over.match.funcs] For conversion functions, the function
2953 is considered to be a member of the class of the implicit
2954 object argument for the purpose of defining the type of
2955 the implicit object parameter.
2957 So we pass fromtype as CTYPE to add_*_candidate. */
2959 if (TREE_CODE (fn) == TEMPLATE_DECL)
2960 cand = add_template_candidate (&candidates, fn, fromtype,
2962 first_arg, NULL, totype,
2963 TYPE_BINFO (fromtype),
2968 cand = add_function_candidate (&candidates, fn, fromtype,
2970 TYPE_BINFO (fromtype),
2977 = implicit_conversion (totype,
2978 TREE_TYPE (TREE_TYPE (cand->fn)),
2980 /*c_cast_p=*/false, convflags);
2982 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
2983 copy-initialization. In that case, "The result of the
2984 call is then used to direct-initialize the object that is
2985 the destination of the copy-initialization." [dcl.init]
2987 We represent this in the conversion sequence with an
2988 rvalue conversion, which means a constructor call. But
2989 don't add a second rvalue conversion if there's already
2990 one there. Which there really shouldn't be, but it's
2991 harmless since we'd add it here anyway. */
2992 if (ics && MAYBE_CLASS_TYPE_P (totype) && ics->kind != ck_rvalue
2993 && !(convflags & LOOKUP_NO_TEMP_BIND))
2994 ics = build_conv (ck_rvalue, totype, ics);
2996 cand->second_conv = ics;
3000 else if (candidates->viable == 1 && ics->bad_p)
3006 candidates = splice_viable (candidates, pedantic, &any_viable_p);
3010 cand = tourney (candidates);
3013 if (flags & LOOKUP_COMPLAIN)
3015 error ("conversion from %qT to %qT is ambiguous",
3017 print_z_candidates (candidates);
3020 cand = candidates; /* any one will do */
3021 cand->second_conv = build_ambiguous_conv (totype, expr);
3022 cand->second_conv->user_conv_p = true;
3023 if (!any_strictly_viable (candidates))
3024 cand->second_conv->bad_p = true;
3025 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3026 ambiguous conversion is no worse than another user-defined
3032 /* Build the user conversion sequence. */
3035 (DECL_CONSTRUCTOR_P (cand->fn)
3036 ? totype : non_reference (TREE_TYPE (TREE_TYPE (cand->fn)))),
3037 build_identity_conv (TREE_TYPE (expr), expr));
3040 /* Remember that this was a list-initialization. */
3041 if (flags & LOOKUP_NO_NARROWING)
3042 conv->check_narrowing = true;
3044 /* Combine it with the second conversion sequence. */
3045 cand->second_conv = merge_conversion_sequences (conv,
3048 if (cand->viable == -1)
3049 cand->second_conv->bad_p = true;
3055 build_user_type_conversion (tree totype, tree expr, int flags)
3057 struct z_candidate *cand
3058 = build_user_type_conversion_1 (totype, expr, flags);
3062 if (cand->second_conv->kind == ck_ambig)
3063 return error_mark_node;
3064 expr = convert_like (cand->second_conv, expr, tf_warning_or_error);
3065 return convert_from_reference (expr);
3070 /* Do any initial processing on the arguments to a function call. */
3072 static VEC(tree,gc) *
3073 resolve_args (VEC(tree,gc) *args)
3078 for (ix = 0; VEC_iterate (tree, args, ix, arg); ++ix)
3080 if (error_operand_p (arg))
3082 else if (VOID_TYPE_P (TREE_TYPE (arg)))
3084 error ("invalid use of void expression");
3087 else if (invalid_nonstatic_memfn_p (arg, tf_warning_or_error))
3093 /* Perform overload resolution on FN, which is called with the ARGS.
3095 Return the candidate function selected by overload resolution, or
3096 NULL if the event that overload resolution failed. In the case
3097 that overload resolution fails, *CANDIDATES will be the set of
3098 candidates considered, and ANY_VIABLE_P will be set to true or
3099 false to indicate whether or not any of the candidates were
3102 The ARGS should already have gone through RESOLVE_ARGS before this
3103 function is called. */
3105 static struct z_candidate *
3106 perform_overload_resolution (tree fn,
3107 const VEC(tree,gc) *args,
3108 struct z_candidate **candidates,
3111 struct z_candidate *cand;
3112 tree explicit_targs = NULL_TREE;
3113 int template_only = 0;
3116 *any_viable_p = true;
3119 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
3120 || TREE_CODE (fn) == TEMPLATE_DECL
3121 || TREE_CODE (fn) == OVERLOAD
3122 || TREE_CODE (fn) == TEMPLATE_ID_EXPR);
3124 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
3126 explicit_targs = TREE_OPERAND (fn, 1);
3127 fn = TREE_OPERAND (fn, 0);
3131 /* Add the various candidate functions. */
3132 add_candidates (fn, args, explicit_targs, template_only,
3133 /*conversion_path=*/NULL_TREE,
3134 /*access_path=*/NULL_TREE,
3138 *candidates = splice_viable (*candidates, pedantic, any_viable_p);
3142 cand = tourney (*candidates);
3146 /* Return an expression for a call to FN (a namespace-scope function,
3147 or a static member function) with the ARGS. This may change
3151 build_new_function_call (tree fn, VEC(tree,gc) **args, bool koenig_p,
3152 tsubst_flags_t complain)
3154 struct z_candidate *candidates, *cand;
3159 if (args != NULL && *args != NULL)
3161 *args = resolve_args (*args);
3163 return error_mark_node;
3166 /* If this function was found without using argument dependent
3167 lookup, then we want to ignore any undeclared friend
3173 fn = remove_hidden_names (fn);
3176 if (complain & tf_error)
3177 error ("no matching function for call to %<%D(%A)%>",
3178 DECL_NAME (OVL_CURRENT (orig_fn)),
3179 build_tree_list_vec (*args));
3180 return error_mark_node;
3184 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3185 p = conversion_obstack_alloc (0);
3187 cand = perform_overload_resolution (fn, *args, &candidates, &any_viable_p);
3191 if (complain & tf_error)
3193 if (!any_viable_p && candidates && ! candidates->next)
3194 return cp_build_function_call_vec (candidates->fn, args, complain);
3195 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
3196 fn = TREE_OPERAND (fn, 0);
3198 error ("no matching function for call to %<%D(%A)%>",
3199 DECL_NAME (OVL_CURRENT (fn)), build_tree_list_vec (*args));
3201 error ("call of overloaded %<%D(%A)%> is ambiguous",
3202 DECL_NAME (OVL_CURRENT (fn)), build_tree_list_vec (*args));
3204 print_z_candidates (candidates);
3206 result = error_mark_node;
3209 result = build_over_call (cand, LOOKUP_NORMAL, complain);
3211 /* Free all the conversions we allocated. */
3212 obstack_free (&conversion_obstack, p);
3217 /* Build a call to a global operator new. FNNAME is the name of the
3218 operator (either "operator new" or "operator new[]") and ARGS are
3219 the arguments provided. This may change ARGS. *SIZE points to the
3220 total number of bytes required by the allocation, and is updated if
3221 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
3222 be used. If this function determines that no cookie should be
3223 used, after all, *COOKIE_SIZE is set to NULL_TREE. If FN is
3224 non-NULL, it will be set, upon return, to the allocation function
3228 build_operator_new_call (tree fnname, VEC(tree,gc) **args,
3229 tree *size, tree *cookie_size,
3233 struct z_candidate *candidates;
3234 struct z_candidate *cand;
3239 VEC_safe_insert (tree, gc, *args, 0, *size);
3240 *args = resolve_args (*args);
3242 return error_mark_node;
3248 If this lookup fails to find the name, or if the allocated type
3249 is not a class type, the allocation function's name is looked
3250 up in the global scope.
3252 we disregard block-scope declarations of "operator new". */
3253 fns = lookup_function_nonclass (fnname, *args, /*block_p=*/false);
3255 /* Figure out what function is being called. */
3256 cand = perform_overload_resolution (fns, *args, &candidates, &any_viable_p);
3258 /* If no suitable function could be found, issue an error message
3263 error ("no matching function for call to %<%D(%A)%>",
3264 DECL_NAME (OVL_CURRENT (fns)), build_tree_list_vec (*args));
3266 error ("call of overloaded %<%D(%A)%> is ambiguous",
3267 DECL_NAME (OVL_CURRENT (fns)), build_tree_list_vec (*args));
3269 print_z_candidates (candidates);
3270 return error_mark_node;
3273 /* If a cookie is required, add some extra space. Whether
3274 or not a cookie is required cannot be determined until
3275 after we know which function was called. */
3278 bool use_cookie = true;
3279 if (!abi_version_at_least (2))
3281 /* In G++ 3.2, the check was implemented incorrectly; it
3282 looked at the placement expression, rather than the
3283 type of the function. */
3284 if (VEC_length (tree, *args) == 2
3285 && same_type_p (TREE_TYPE (VEC_index (tree, *args, 1)),
3293 arg_types = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
3294 /* Skip the size_t parameter. */
3295 arg_types = TREE_CHAIN (arg_types);
3296 /* Check the remaining parameters (if any). */
3298 && TREE_CHAIN (arg_types) == void_list_node
3299 && same_type_p (TREE_VALUE (arg_types),
3303 /* If we need a cookie, adjust the number of bytes allocated. */
3306 /* Update the total size. */
3307 *size = size_binop (PLUS_EXPR, *size, *cookie_size);
3308 /* Update the argument list to reflect the adjusted size. */
3309 VEC_replace (tree, *args, 0, *size);
3312 *cookie_size = NULL_TREE;
3315 /* Tell our caller which function we decided to call. */
3319 /* Build the CALL_EXPR. */
3320 return build_over_call (cand, LOOKUP_NORMAL, tf_warning_or_error);
3323 /* Build a new call to operator(). This may change ARGS. */
3326 build_op_call (tree obj, VEC(tree,gc) **args, tsubst_flags_t complain)
3328 struct z_candidate *candidates = 0, *cand;
3329 tree fns, convs, first_mem_arg = NULL_TREE;
3330 tree type = TREE_TYPE (obj);
3332 tree result = NULL_TREE;
3335 if (error_operand_p (obj))
3336 return error_mark_node;
3338 obj = prep_operand (obj);
3340 if (TYPE_PTRMEMFUNC_P (type))
3342 if (complain & tf_error)
3343 /* It's no good looking for an overloaded operator() on a
3344 pointer-to-member-function. */
3345 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj);
3346 return error_mark_node;
3349 if (TYPE_BINFO (type))
3351 fns = lookup_fnfields (TYPE_BINFO (type), ansi_opname (CALL_EXPR), 1);
3352 if (fns == error_mark_node)
3353 return error_mark_node;
3358 if (args != NULL && *args != NULL)
3360 *args = resolve_args (*args);
3362 return error_mark_node;
3365 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3366 p = conversion_obstack_alloc (0);
3370 tree base = BINFO_TYPE (BASELINK_BINFO (fns));
3371 first_mem_arg = build_this (obj);
3373 for (fns = BASELINK_FUNCTIONS (fns); fns; fns = OVL_NEXT (fns))
3375 tree fn = OVL_CURRENT (fns);
3377 if (TREE_CODE (fn) == TEMPLATE_DECL)
3378 add_template_candidate (&candidates, fn, base, NULL_TREE,
3379 first_mem_arg, *args, NULL_TREE,
3382 LOOKUP_NORMAL, DEDUCE_CALL);
3384 add_function_candidate
3385 (&candidates, fn, base, first_mem_arg, *args, TYPE_BINFO (type),
3386 TYPE_BINFO (type), LOOKUP_NORMAL);
3390 convs = lookup_conversions (type, /*lookup_template_convs_p=*/true);
3392 for (; convs; convs = TREE_CHAIN (convs))
3394 tree fns = TREE_VALUE (convs);
3395 tree totype = TREE_TYPE (convs);
3397 if ((TREE_CODE (totype) == POINTER_TYPE
3398 && TREE_CODE (TREE_TYPE (totype)) == FUNCTION_TYPE)
3399 || (TREE_CODE (totype) == REFERENCE_TYPE
3400 && TREE_CODE (TREE_TYPE (totype)) == FUNCTION_TYPE)
3401 || (TREE_CODE (totype) == REFERENCE_TYPE
3402 && TREE_CODE (TREE_TYPE (totype)) == POINTER_TYPE
3403 && TREE_CODE (TREE_TYPE (TREE_TYPE (totype))) == FUNCTION_TYPE))
3404 for (; fns; fns = OVL_NEXT (fns))
3406 tree fn = OVL_CURRENT (fns);
3408 if (DECL_NONCONVERTING_P (fn))
3411 if (TREE_CODE (fn) == TEMPLATE_DECL)
3412 add_template_conv_candidate
3413 (&candidates, fn, obj, NULL_TREE, *args, totype,
3414 /*access_path=*/NULL_TREE,
3415 /*conversion_path=*/NULL_TREE);
3417 add_conv_candidate (&candidates, fn, obj, NULL_TREE,
3418 *args, /*conversion_path=*/NULL_TREE,
3419 /*access_path=*/NULL_TREE);
3423 candidates = splice_viable (candidates, pedantic, &any_viable_p);
3426 if (complain & tf_error)
3428 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj),
3429 build_tree_list_vec (*args));
3430 print_z_candidates (candidates);
3432 result = error_mark_node;
3436 cand = tourney (candidates);
3439 if (complain & tf_error)
3441 error ("call of %<(%T) (%A)%> is ambiguous",
3442 TREE_TYPE (obj), build_tree_list_vec (*args));
3443 print_z_candidates (candidates);
3445 result = error_mark_node;
3447 /* Since cand->fn will be a type, not a function, for a conversion
3448 function, we must be careful not to unconditionally look at
3450 else if (TREE_CODE (cand->fn) == FUNCTION_DECL
3451 && DECL_OVERLOADED_OPERATOR_P (cand->fn) == CALL_EXPR)
3452 result = build_over_call (cand, LOOKUP_NORMAL, complain);
3455 obj = convert_like_with_context (cand->convs[0], obj, cand->fn, -1,
3457 obj = convert_from_reference (obj);
3458 result = cp_build_function_call_vec (obj, args, complain);
3462 /* Free all the conversions we allocated. */
3463 obstack_free (&conversion_obstack, p);
3469 op_error (enum tree_code code, enum tree_code code2,
3470 tree arg1, tree arg2, tree arg3, bool match)
3474 if (code == MODIFY_EXPR)
3475 opname = assignment_operator_name_info[code2].name;
3477 opname = operator_name_info[code].name;
3483 error ("ambiguous overload for ternary %<operator?:%> "
3484 "in %<%E ? %E : %E%>", arg1, arg2, arg3);
3486 error ("no match for ternary %<operator?:%> "
3487 "in %<%E ? %E : %E%>", arg1, arg2, arg3);
3490 case POSTINCREMENT_EXPR:
3491 case POSTDECREMENT_EXPR:
3493 error ("ambiguous overload for %<operator%s%> in %<%E%s%>",
3494 opname, arg1, opname);
3496 error ("no match for %<operator%s%> in %<%E%s%>",
3497 opname, arg1, opname);
3502 error ("ambiguous overload for %<operator[]%> in %<%E[%E]%>",
3505 error ("no match for %<operator[]%> in %<%E[%E]%>",
3512 error ("ambiguous overload for %qs in %<%s %E%>",
3513 opname, opname, arg1);
3515 error ("no match for %qs in %<%s %E%>",
3516 opname, opname, arg1);
3522 error ("ambiguous overload for %<operator%s%> in %<%E %s %E%>",
3523 opname, arg1, opname, arg2);
3525 error ("no match for %<operator%s%> in %<%E %s %E%>",
3526 opname, arg1, opname, arg2);
3529 error ("ambiguous overload for %<operator%s%> in %<%s%E%>",
3530 opname, opname, arg1);
3532 error ("no match for %<operator%s%> in %<%s%E%>",
3533 opname, opname, arg1);
3538 /* Return the implicit conversion sequence that could be used to
3539 convert E1 to E2 in [expr.cond]. */
3542 conditional_conversion (tree e1, tree e2)
3544 tree t1 = non_reference (TREE_TYPE (e1));
3545 tree t2 = non_reference (TREE_TYPE (e2));
3551 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
3552 implicitly converted (clause _conv_) to the type "reference to
3553 T2", subject to the constraint that in the conversion the
3554 reference must bind directly (_dcl.init.ref_) to E1. */
3555 if (real_lvalue_p (e2))
3557 conv = implicit_conversion (build_reference_type (t2),
3561 LOOKUP_NO_TEMP_BIND|LOOKUP_ONLYCONVERTING);
3568 If E1 and E2 have class type, and the underlying class types are
3569 the same or one is a base class of the other: E1 can be converted
3570 to match E2 if the class of T2 is the same type as, or a base
3571 class of, the class of T1, and the cv-qualification of T2 is the
3572 same cv-qualification as, or a greater cv-qualification than, the
3573 cv-qualification of T1. If the conversion is applied, E1 is
3574 changed to an rvalue of type T2 that still refers to the original
3575 source class object (or the appropriate subobject thereof). */
3576 if (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
3577 && ((good_base = DERIVED_FROM_P (t2, t1)) || DERIVED_FROM_P (t1, t2)))
3579 if (good_base && at_least_as_qualified_p (t2, t1))
3581 conv = build_identity_conv (t1, e1);
3582 if (!same_type_p (TYPE_MAIN_VARIANT (t1),
3583 TYPE_MAIN_VARIANT (t2)))
3584 conv = build_conv (ck_base, t2, conv);
3586 conv = build_conv (ck_rvalue, t2, conv);
3595 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
3596 converted to the type that expression E2 would have if E2 were
3597 converted to an rvalue (or the type it has, if E2 is an rvalue). */
3598 return implicit_conversion (t2, t1, e1, /*c_cast_p=*/false,
3602 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
3603 arguments to the conditional expression. */
3606 build_conditional_expr (tree arg1, tree arg2, tree arg3,
3607 tsubst_flags_t complain)
3611 tree result = NULL_TREE;
3613 tree result_type = NULL_TREE;
3614 bool lvalue_p = true;
3615 struct z_candidate *candidates = 0;
3616 struct z_candidate *cand;
3619 /* As a G++ extension, the second argument to the conditional can be
3620 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
3621 c'.) If the second operand is omitted, make sure it is
3622 calculated only once. */
3625 if (complain & tf_error)
3626 pedwarn (input_location, OPT_pedantic,
3627 "ISO C++ forbids omitting the middle term of a ?: expression");
3629 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
3630 if (real_lvalue_p (arg1))
3631 arg2 = arg1 = stabilize_reference (arg1);
3633 arg2 = arg1 = save_expr (arg1);
3638 The first expression is implicitly converted to bool (clause
3640 arg1 = perform_implicit_conversion_flags (boolean_type_node, arg1, complain,
3643 /* If something has already gone wrong, just pass that fact up the
3645 if (error_operand_p (arg1)
3646 || error_operand_p (arg2)
3647 || error_operand_p (arg3))
3648 return error_mark_node;
3652 If either the second or the third operand has type (possibly
3653 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
3654 array-to-pointer (_conv.array_), and function-to-pointer
3655 (_conv.func_) standard conversions are performed on the second
3656 and third operands. */
3657 arg2_type = unlowered_expr_type (arg2);
3658 arg3_type = unlowered_expr_type (arg3);
3659 if (VOID_TYPE_P (arg2_type) || VOID_TYPE_P (arg3_type))
3661 /* Do the conversions. We don't these for `void' type arguments
3662 since it can't have any effect and since decay_conversion
3663 does not handle that case gracefully. */
3664 if (!VOID_TYPE_P (arg2_type))
3665 arg2 = decay_conversion (arg2);
3666 if (!VOID_TYPE_P (arg3_type))
3667 arg3 = decay_conversion (arg3);
3668 arg2_type = TREE_TYPE (arg2);
3669 arg3_type = TREE_TYPE (arg3);
3673 One of the following shall hold:
3675 --The second or the third operand (but not both) is a
3676 throw-expression (_except.throw_); the result is of the
3677 type of the other and is an rvalue.
3679 --Both the second and the third operands have type void; the
3680 result is of type void and is an rvalue.
3682 We must avoid calling force_rvalue for expressions of type
3683 "void" because it will complain that their value is being
3685 if (TREE_CODE (arg2) == THROW_EXPR
3686 && TREE_CODE (arg3) != THROW_EXPR)
3688 if (!VOID_TYPE_P (arg3_type))
3689 arg3 = force_rvalue (arg3);
3690 arg3_type = TREE_TYPE (arg3);
3691 result_type = arg3_type;
3693 else if (TREE_CODE (arg2) != THROW_EXPR
3694 && TREE_CODE (arg3) == THROW_EXPR)
3696 if (!VOID_TYPE_P (arg2_type))
3697 arg2 = force_rvalue (arg2);
3698 arg2_type = TREE_TYPE (arg2);
3699 result_type = arg2_type;
3701 else if (VOID_TYPE_P (arg2_type) && VOID_TYPE_P (arg3_type))
3702 result_type = void_type_node;
3705 if (complain & tf_error)
3707 if (VOID_TYPE_P (arg2_type))
3708 error ("second operand to the conditional operator "
3709 "is of type %<void%>, "
3710 "but the third operand is neither a throw-expression "
3711 "nor of type %<void%>");
3713 error ("third operand to the conditional operator "
3714 "is of type %<void%>, "
3715 "but the second operand is neither a throw-expression "
3716 "nor of type %<void%>");
3718 return error_mark_node;
3722 goto valid_operands;
3726 Otherwise, if the second and third operand have different types,
3727 and either has (possibly cv-qualified) class type, an attempt is
3728 made to convert each of those operands to the type of the other. */
3729 else if (!same_type_p (arg2_type, arg3_type)
3730 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
3735 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3736 p = conversion_obstack_alloc (0);
3738 conv2 = conditional_conversion (arg2, arg3);
3739 conv3 = conditional_conversion (arg3, arg2);
3743 If both can be converted, or one can be converted but the
3744 conversion is ambiguous, the program is ill-formed. If
3745 neither can be converted, the operands are left unchanged and
3746 further checking is performed as described below. If exactly
3747 one conversion is possible, that conversion is applied to the
3748 chosen operand and the converted operand is used in place of
3749 the original operand for the remainder of this section. */
3750 if ((conv2 && !conv2->bad_p
3751 && conv3 && !conv3->bad_p)
3752 || (conv2 && conv2->kind == ck_ambig)
3753 || (conv3 && conv3->kind == ck_ambig))
3755 error ("operands to ?: have different types %qT and %qT",
3756 arg2_type, arg3_type);
3757 result = error_mark_node;
3759 else if (conv2 && (!conv2->bad_p || !conv3))
3761 arg2 = convert_like (conv2, arg2, complain);
3762 arg2 = convert_from_reference (arg2);
3763 arg2_type = TREE_TYPE (arg2);
3764 /* Even if CONV2 is a valid conversion, the result of the
3765 conversion may be invalid. For example, if ARG3 has type
3766 "volatile X", and X does not have a copy constructor
3767 accepting a "volatile X&", then even if ARG2 can be
3768 converted to X, the conversion will fail. */
3769 if (error_operand_p (arg2))
3770 result = error_mark_node;
3772 else if (conv3 && (!conv3->bad_p || !conv2))
3774 arg3 = convert_like (conv3, arg3, complain);
3775 arg3 = convert_from_reference (arg3);
3776 arg3_type = TREE_TYPE (arg3);
3777 if (error_operand_p (arg3))
3778 result = error_mark_node;
3781 /* Free all the conversions we allocated. */
3782 obstack_free (&conversion_obstack, p);
3787 /* If, after the conversion, both operands have class type,
3788 treat the cv-qualification of both operands as if it were the
3789 union of the cv-qualification of the operands.
3791 The standard is not clear about what to do in this
3792 circumstance. For example, if the first operand has type
3793 "const X" and the second operand has a user-defined
3794 conversion to "volatile X", what is the type of the second
3795 operand after this step? Making it be "const X" (matching
3796 the first operand) seems wrong, as that discards the
3797 qualification without actually performing a copy. Leaving it
3798 as "volatile X" seems wrong as that will result in the
3799 conditional expression failing altogether, even though,
3800 according to this step, the one operand could be converted to
3801 the type of the other. */
3802 if ((conv2 || conv3)
3803 && CLASS_TYPE_P (arg2_type)
3804 && TYPE_QUALS (arg2_type) != TYPE_QUALS (arg3_type))
3805 arg2_type = arg3_type =
3806 cp_build_qualified_type (arg2_type,
3807 TYPE_QUALS (arg2_type)
3808 | TYPE_QUALS (arg3_type));
3813 If the second and third operands are lvalues and have the same
3814 type, the result is of that type and is an lvalue. */
3815 if (real_lvalue_p (arg2)
3816 && real_lvalue_p (arg3)
3817 && same_type_p (arg2_type, arg3_type))
3819 result_type = arg2_type;
3820 goto valid_operands;
3825 Otherwise, the result is an rvalue. If the second and third
3826 operand do not have the same type, and either has (possibly
3827 cv-qualified) class type, overload resolution is used to
3828 determine the conversions (if any) to be applied to the operands
3829 (_over.match.oper_, _over.built_). */
3831 if (!same_type_p (arg2_type, arg3_type)
3832 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
3838 /* Rearrange the arguments so that add_builtin_candidate only has
3839 to know about two args. In build_builtin_candidate, the
3840 arguments are unscrambled. */
3844 add_builtin_candidates (&candidates,
3847 ansi_opname (COND_EXPR),
3853 If the overload resolution fails, the program is
3855 candidates = splice_viable (candidates, pedantic, &any_viable_p);
3858 if (complain & tf_error)
3860 op_error (COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE);
3861 print_z_candidates (candidates);
3863 return error_mark_node;
3865 cand = tourney (candidates);
3868 if (complain & tf_error)
3870 op_error (COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE);
3871 print_z_candidates (candidates);
3873 return error_mark_node;
3878 Otherwise, the conversions thus determined are applied, and
3879 the converted operands are used in place of the original
3880 operands for the remainder of this section. */
3881 conv = cand->convs[0];
3882 arg1 = convert_like (conv, arg1, complain);
3883 conv = cand->convs[1];
3884 arg2 = convert_like (conv, arg2, complain);
3885 arg2_type = TREE_TYPE (arg2);
3886 conv = cand->convs[2];
3887 arg3 = convert_like (conv, arg3, complain);
3888 arg3_type = TREE_TYPE (arg3);
3893 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
3894 and function-to-pointer (_conv.func_) standard conversions are
3895 performed on the second and third operands.
3897 We need to force the lvalue-to-rvalue conversion here for class types,
3898 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
3899 that isn't wrapped with a TARGET_EXPR plays havoc with exception
3902 arg2 = force_rvalue (arg2);
3903 if (!CLASS_TYPE_P (arg2_type))
3904 arg2_type = TREE_TYPE (arg2);
3906 arg3 = force_rvalue (arg3);
3907 if (!CLASS_TYPE_P (arg3_type))
3908 arg3_type = TREE_TYPE (arg3);
3910 if (arg2 == error_mark_node || arg3 == error_mark_node)
3911 return error_mark_node;
3915 After those conversions, one of the following shall hold:
3917 --The second and third operands have the same type; the result is of
3919 if (same_type_p (arg2_type, arg3_type))
3920 result_type = arg2_type;
3923 --The second and third operands have arithmetic or enumeration
3924 type; the usual arithmetic conversions are performed to bring
3925 them to a common type, and the result is of that type. */
3926 else if ((ARITHMETIC_TYPE_P (arg2_type)
3927 || UNSCOPED_ENUM_P (arg2_type))
3928 && (ARITHMETIC_TYPE_P (arg3_type)
3929 || UNSCOPED_ENUM_P (arg3_type)))
3931 /* In this case, there is always a common type. */
3932 result_type = type_after_usual_arithmetic_conversions (arg2_type,
3935 if (TREE_CODE (arg2_type) == ENUMERAL_TYPE
3936 && TREE_CODE (arg3_type) == ENUMERAL_TYPE)
3938 if (complain & tf_warning)
3940 "enumeral mismatch in conditional expression: %qT vs %qT",
3941 arg2_type, arg3_type);
3943 else if (extra_warnings
3944 && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE
3945 && !same_type_p (arg3_type, type_promotes_to (arg2_type)))
3946 || (TREE_CODE (arg3_type) == ENUMERAL_TYPE
3947 && !same_type_p (arg2_type, type_promotes_to (arg3_type)))))
3949 if (complain & tf_warning)
3951 "enumeral and non-enumeral type in conditional expression");
3954 arg2 = perform_implicit_conversion (result_type, arg2, complain);
3955 arg3 = perform_implicit_conversion (result_type, arg3, complain);
3959 --The second and third operands have pointer type, or one has
3960 pointer type and the other is a null pointer constant; pointer
3961 conversions (_conv.ptr_) and qualification conversions
3962 (_conv.qual_) are performed to bring them to their composite
3963 pointer type (_expr.rel_). The result is of the composite
3966 --The second and third operands have pointer to member type, or
3967 one has pointer to member type and the other is a null pointer
3968 constant; pointer to member conversions (_conv.mem_) and
3969 qualification conversions (_conv.qual_) are performed to bring
3970 them to a common type, whose cv-qualification shall match the
3971 cv-qualification of either the second or the third operand.
3972 The result is of the common type. */
3973 else if ((null_ptr_cst_p (arg2)
3974 && (TYPE_PTR_P (arg3_type) || TYPE_PTR_TO_MEMBER_P (arg3_type)))
3975 || (null_ptr_cst_p (arg3)
3976 && (TYPE_PTR_P (arg2_type) || TYPE_PTR_TO_MEMBER_P (arg2_type)))
3977 || (TYPE_PTR_P (arg2_type) && TYPE_PTR_P (arg3_type))
3978 || (TYPE_PTRMEM_P (arg2_type) && TYPE_PTRMEM_P (arg3_type))
3979 || (TYPE_PTRMEMFUNC_P (arg2_type) && TYPE_PTRMEMFUNC_P (arg3_type)))
3981 result_type = composite_pointer_type (arg2_type, arg3_type, arg2,
3982 arg3, CPO_CONDITIONAL_EXPR,
3984 if (result_type == error_mark_node)
3985 return error_mark_node;
3986 arg2 = perform_implicit_conversion (result_type, arg2, complain);
3987 arg3 = perform_implicit_conversion (result_type, arg3, complain);
3992 if (complain & tf_error)
3993 error ("operands to ?: have different types %qT and %qT",
3994 arg2_type, arg3_type);
3995 return error_mark_node;
3999 result_save = build3 (COND_EXPR, result_type, arg1, arg2, arg3);
4000 result = fold_if_not_in_template (result_save);
4002 if (cp_unevaluated_operand && TREE_CODE (result) == CALL_EXPR)
4003 /* Avoid folding to a CALL_EXPR within decltype (c++/42013). */
4004 result = result_save;
4006 /* We can't use result_type below, as fold might have returned a
4011 /* Expand both sides into the same slot, hopefully the target of
4012 the ?: expression. We used to check for TARGET_EXPRs here,
4013 but now we sometimes wrap them in NOP_EXPRs so the test would
4015 if (CLASS_TYPE_P (TREE_TYPE (result)))
4016 result = get_target_expr (result);
4017 /* If this expression is an rvalue, but might be mistaken for an
4018 lvalue, we must add a NON_LVALUE_EXPR. */
4019 result = rvalue (result);
4025 /* OPERAND is an operand to an expression. Perform necessary steps
4026 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
4030 prep_operand (tree operand)
4034 if (CLASS_TYPE_P (TREE_TYPE (operand))
4035 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand)))
4036 /* Make sure the template type is instantiated now. */
4037 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand)));
4043 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
4044 OVERLOAD) to the CANDIDATES, returning an updated list of
4045 CANDIDATES. The ARGS are the arguments provided to the call,
4046 without any implicit object parameter. This may change ARGS. The
4047 EXPLICIT_TARGS are explicit template arguments provided.
4048 TEMPLATE_ONLY is true if only template functions should be
4049 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
4050 add_function_candidate. */
4053 add_candidates (tree fns, const VEC(tree,gc) *args,
4054 tree explicit_targs, bool template_only,
4055 tree conversion_path, tree access_path,
4057 struct z_candidate **candidates)
4060 VEC(tree,gc) *non_static_args;
4063 ctype = conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE;
4064 /* Delay creating the implicit this parameter until it is needed. */
4065 non_static_args = NULL;
4066 first_arg = NULL_TREE;
4072 const VEC(tree,gc) *fn_args;
4074 fn = OVL_CURRENT (fns);
4075 /* Figure out which set of arguments to use. */
4076 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
4078 /* If this function is a non-static member, prepend the implicit
4079 object parameter. */
4080 if (non_static_args == NULL)
4085 non_static_args = VEC_alloc (tree, gc,
4086 VEC_length (tree, args) - 1);
4087 for (ix = 1; VEC_iterate (tree, args, ix, arg); ++ix)
4088 VEC_quick_push (tree, non_static_args, arg);
4090 if (first_arg == NULL_TREE)
4091 first_arg = build_this (VEC_index (tree, args, 0));
4092 fn_first_arg = first_arg;
4093 fn_args = non_static_args;
4097 /* Otherwise, just use the list of arguments provided. */
4098 fn_first_arg = NULL_TREE;
4102 if (TREE_CODE (fn) == TEMPLATE_DECL)
4103 add_template_candidate (candidates,
4114 else if (!template_only)
4115 add_function_candidate (candidates,
4123 fns = OVL_NEXT (fns);
4127 /* Even unsigned enum types promote to signed int. We don't want to
4128 issue -Wsign-compare warnings for this case. Here ORIG_ARG is the
4129 original argument and ARG is the argument after any conversions
4130 have been applied. We set TREE_NO_WARNING if we have added a cast
4131 from an unsigned enum type to a signed integer type. */
4134 avoid_sign_compare_warnings (tree orig_arg, tree arg)
4136 if (orig_arg != NULL_TREE
4139 && TREE_CODE (TREE_TYPE (orig_arg)) == ENUMERAL_TYPE
4140 && TYPE_UNSIGNED (TREE_TYPE (orig_arg))
4141 && INTEGRAL_TYPE_P (TREE_TYPE (arg))
4142 && !TYPE_UNSIGNED (TREE_TYPE (arg)))
4143 TREE_NO_WARNING (arg) = 1;
4147 build_new_op (enum tree_code code, int flags, tree arg1, tree arg2, tree arg3,
4148 bool *overloaded_p, tsubst_flags_t complain)
4150 tree orig_arg1 = arg1;
4151 tree orig_arg2 = arg2;
4152 tree orig_arg3 = arg3;
4153 struct z_candidate *candidates = 0, *cand;
4154 VEC(tree,gc) *arglist;
4157 tree result = NULL_TREE;
4158 bool result_valid_p = false;
4159 enum tree_code code2 = NOP_EXPR;
4160 enum tree_code code_orig_arg1 = ERROR_MARK;
4161 enum tree_code code_orig_arg2 = ERROR_MARK;
4167 if (error_operand_p (arg1)
4168 || error_operand_p (arg2)
4169 || error_operand_p (arg3))
4170 return error_mark_node;
4172 if (code == MODIFY_EXPR)
4174 code2 = TREE_CODE (arg3);
4176 fnname = ansi_assopname (code2);
4179 fnname = ansi_opname (code);
4181 arg1 = prep_operand (arg1);
4187 case VEC_DELETE_EXPR:
4189 /* Use build_op_new_call and build_op_delete_call instead. */
4193 /* Use build_op_call instead. */
4196 case TRUTH_ORIF_EXPR:
4197 case TRUTH_ANDIF_EXPR:
4198 case TRUTH_AND_EXPR:
4200 /* These are saved for the sake of warn_logical_operator. */
4201 code_orig_arg1 = TREE_CODE (arg1);
4202 code_orig_arg2 = TREE_CODE (arg2);
4208 arg2 = prep_operand (arg2);
4209 arg3 = prep_operand (arg3);
4211 if (code == COND_EXPR)
4212 /* Use build_conditional_expr instead. */
4214 else if (! IS_OVERLOAD_TYPE (TREE_TYPE (arg1))
4215 && (! arg2 || ! IS_OVERLOAD_TYPE (TREE_TYPE (arg2))))
4218 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
4219 arg2 = integer_zero_node;
4221 arglist = VEC_alloc (tree, gc, 3);
4222 VEC_quick_push (tree, arglist, arg1);
4223 if (arg2 != NULL_TREE)
4224 VEC_quick_push (tree, arglist, arg2);
4225 if (arg3 != NULL_TREE)
4226 VEC_quick_push (tree, arglist, arg3);
4228 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4229 p = conversion_obstack_alloc (0);
4231 /* Add namespace-scope operators to the list of functions to
4233 add_candidates (lookup_function_nonclass (fnname, arglist, /*block_p=*/true),
4234 arglist, NULL_TREE, false, NULL_TREE, NULL_TREE,
4235 flags, &candidates);
4236 /* Add class-member operators to the candidate set. */
4237 if (CLASS_TYPE_P (TREE_TYPE (arg1)))
4241 fns = lookup_fnfields (TREE_TYPE (arg1), fnname, 1);
4242 if (fns == error_mark_node)
4244 result = error_mark_node;
4245 goto user_defined_result_ready;
4248 add_candidates (BASELINK_FUNCTIONS (fns), arglist,
4250 BASELINK_BINFO (fns),
4251 TYPE_BINFO (TREE_TYPE (arg1)),
4252 flags, &candidates);
4257 args[2] = NULL_TREE;
4259 add_builtin_candidates (&candidates, code, code2, fnname, args, flags);
4265 /* For these, the built-in candidates set is empty
4266 [over.match.oper]/3. We don't want non-strict matches
4267 because exact matches are always possible with built-in
4268 operators. The built-in candidate set for COMPONENT_REF
4269 would be empty too, but since there are no such built-in
4270 operators, we accept non-strict matches for them. */
4275 strict_p = pedantic;
4279 candidates = splice_viable (candidates, strict_p, &any_viable_p);
4284 case POSTINCREMENT_EXPR:
4285 case POSTDECREMENT_EXPR:
4286 /* Don't try anything fancy if we're not allowed to produce
4288 if (!(complain & tf_error))
4289 return error_mark_node;
4291 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
4292 distinguish between prefix and postfix ++ and
4293 operator++() was used for both, so we allow this with
4295 if (flags & LOOKUP_COMPLAIN)
4297 const char *msg = (flag_permissive)
4298 ? G_("no %<%D(int)%> declared for postfix %qs,"
4299 " trying prefix operator instead")
4300 : G_("no %<%D(int)%> declared for postfix %qs");
4301 permerror (input_location, msg, fnname,
4302 operator_name_info[code].name);
4305 if (!flag_permissive)
4306 return error_mark_node;
4308 if (code == POSTINCREMENT_EXPR)
4309 code = PREINCREMENT_EXPR;
4311 code = PREDECREMENT_EXPR;
4312 result = build_new_op (code, flags, arg1, NULL_TREE, NULL_TREE,
4313 overloaded_p, complain);
4316 /* The caller will deal with these. */
4321 result_valid_p = true;
4325 if ((flags & LOOKUP_COMPLAIN) && (complain & tf_error))
4327 /* If one of the arguments of the operator represents
4328 an invalid use of member function pointer, try to report
4329 a meaningful error ... */
4330 if (invalid_nonstatic_memfn_p (arg1, tf_error)
4331 || invalid_nonstatic_memfn_p (arg2, tf_error)
4332 || invalid_nonstatic_memfn_p (arg3, tf_error))
4333 /* We displayed the error message. */;
4336 /* ... Otherwise, report the more generic
4337 "no matching operator found" error */
4338 op_error (code, code2, arg1, arg2, arg3, FALSE);
4339 print_z_candidates (candidates);
4342 result = error_mark_node;
4348 cand = tourney (candidates);
4351 if ((flags & LOOKUP_COMPLAIN) && (complain & tf_error))
4353 op_error (code, code2, arg1, arg2, arg3, TRUE);
4354 print_z_candidates (candidates);
4356 result = error_mark_node;
4358 else if (TREE_CODE (cand->fn) == FUNCTION_DECL)
4361 *overloaded_p = true;
4363 if (resolve_args (arglist) == NULL)
4364 result = error_mark_node;
4366 result = build_over_call (cand, LOOKUP_NORMAL, complain);
4370 /* Give any warnings we noticed during overload resolution. */
4371 if (cand->warnings && (complain & tf_warning))
4373 struct candidate_warning *w;
4374 for (w = cand->warnings; w; w = w->next)
4375 joust (cand, w->loser, 1);
4378 /* Check for comparison of different enum types. */
4387 if (TREE_CODE (TREE_TYPE (arg1)) == ENUMERAL_TYPE
4388 && TREE_CODE (TREE_TYPE (arg2)) == ENUMERAL_TYPE
4389 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1))
4390 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2)))
4391 && (complain & tf_warning))
4393 warning (OPT_Wenum_compare,
4394 "comparison between %q#T and %q#T",
4395 TREE_TYPE (arg1), TREE_TYPE (arg2));
4402 /* We need to strip any leading REF_BIND so that bitfields
4403 don't cause errors. This should not remove any important
4404 conversions, because builtins don't apply to class
4405 objects directly. */
4406 conv = cand->convs[0];
4407 if (conv->kind == ck_ref_bind)
4408 conv = conv->u.next;
4409 arg1 = convert_like (conv, arg1, complain);
4413 /* We need to call warn_logical_operator before
4414 converting arg2 to a boolean_type. */
4415 if (complain & tf_warning)
4416 warn_logical_operator (input_location, code, boolean_type_node,
4417 code_orig_arg1, arg1,
4418 code_orig_arg2, arg2);
4420 conv = cand->convs[1];
4421 if (conv->kind == ck_ref_bind)
4422 conv = conv->u.next;
4423 arg2 = convert_like (conv, arg2, complain);
4427 conv = cand->convs[2];
4428 if (conv->kind == ck_ref_bind)
4429 conv = conv->u.next;
4430 arg3 = convert_like (conv, arg3, complain);
4436 user_defined_result_ready:
4438 /* Free all the conversions we allocated. */
4439 obstack_free (&conversion_obstack, p);
4441 if (result || result_valid_p)
4445 avoid_sign_compare_warnings (orig_arg1, arg1);
4446 avoid_sign_compare_warnings (orig_arg2, arg2);
4447 avoid_sign_compare_warnings (orig_arg3, arg3);
4452 return cp_build_modify_expr (arg1, code2, arg2, complain);
4455 return cp_build_indirect_ref (arg1, RO_UNARY_STAR, complain);
4457 case TRUTH_ANDIF_EXPR:
4458 case TRUTH_ORIF_EXPR:
4459 case TRUTH_AND_EXPR:
4461 warn_logical_operator (input_location, code, boolean_type_node,
4462 code_orig_arg1, arg1, code_orig_arg2, arg2);
4467 case TRUNC_DIV_EXPR:
4478 case TRUNC_MOD_EXPR:
4482 return cp_build_binary_op (input_location, code, arg1, arg2, complain);
4484 case UNARY_PLUS_EXPR:
4487 case TRUTH_NOT_EXPR:
4488 case PREINCREMENT_EXPR:
4489 case POSTINCREMENT_EXPR:
4490 case PREDECREMENT_EXPR:
4491 case POSTDECREMENT_EXPR:
4494 return cp_build_unary_op (code, arg1, candidates != 0, complain);
4497 return build_array_ref (input_location, arg1, arg2);
4500 return build_m_component_ref (cp_build_indirect_ref (arg1, RO_NULL,
4504 /* The caller will deal with these. */
4516 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
4517 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
4520 non_placement_deallocation_fn_p (tree t)
4522 /* A template instance is never a usual deallocation function,
4523 regardless of its signature. */
4524 if (TREE_CODE (t) == TEMPLATE_DECL
4525 || primary_template_instantiation_p (t))
4528 /* If a class T has a member deallocation function named operator delete
4529 with exactly one parameter, then that function is a usual
4530 (non-placement) deallocation function. If class T does not declare
4531 such an operator delete but does declare a member deallocation
4532 function named operator delete with exactly two parameters, the second
4533 of which has type std::size_t (18.2), then this function is a usual
4534 deallocation function. */
4535 t = FUNCTION_ARG_CHAIN (t);
4536 if (t == void_list_node
4537 || (t && same_type_p (TREE_VALUE (t), size_type_node)
4538 && TREE_CHAIN (t) == void_list_node))
4543 /* Build a call to operator delete. This has to be handled very specially,
4544 because the restrictions on what signatures match are different from all
4545 other call instances. For a normal delete, only a delete taking (void *)
4546 or (void *, size_t) is accepted. For a placement delete, only an exact
4547 match with the placement new is accepted.
4549 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
4550 ADDR is the pointer to be deleted.
4551 SIZE is the size of the memory block to be deleted.
4552 GLOBAL_P is true if the delete-expression should not consider
4553 class-specific delete operators.
4554 PLACEMENT is the corresponding placement new call, or NULL_TREE.
4556 If this call to "operator delete" is being generated as part to
4557 deallocate memory allocated via a new-expression (as per [expr.new]
4558 which requires that if the initialization throws an exception then
4559 we call a deallocation function), then ALLOC_FN is the allocation
4563 build_op_delete_call (enum tree_code code, tree addr, tree size,
4564 bool global_p, tree placement,
4567 tree fn = NULL_TREE;
4568 tree fns, fnname, type, t;
4570 if (addr == error_mark_node)
4571 return error_mark_node;
4573 type = strip_array_types (TREE_TYPE (TREE_TYPE (addr)));
4575 fnname = ansi_opname (code);
4577 if (CLASS_TYPE_P (type)
4578 && COMPLETE_TYPE_P (complete_type (type))
4582 If the result of the lookup is ambiguous or inaccessible, or if
4583 the lookup selects a placement deallocation function, the
4584 program is ill-formed.
4586 Therefore, we ask lookup_fnfields to complain about ambiguity. */
4588 fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1);
4589 if (fns == error_mark_node)
4590 return error_mark_node;
4595 if (fns == NULL_TREE)
4596 fns = lookup_name_nonclass (fnname);
4598 /* Strip const and volatile from addr. */
4599 addr = cp_convert (ptr_type_node, addr);
4603 /* "A declaration of a placement deallocation function matches the
4604 declaration of a placement allocation function if it has the same
4605 number of parameters and, after parameter transformations (8.3.5),
4606 all parameter types except the first are identical."
4608 So we build up the function type we want and ask instantiate_type
4609 to get it for us. */
4610 t = FUNCTION_ARG_CHAIN (alloc_fn);
4611 t = tree_cons (NULL_TREE, ptr_type_node, t);
4612 t = build_function_type (void_type_node, t);
4614 fn = instantiate_type (t, fns, tf_none);
4615 if (fn == error_mark_node)
4618 if (BASELINK_P (fn))
4619 fn = BASELINK_FUNCTIONS (fn);
4621 /* "If the lookup finds the two-parameter form of a usual deallocation
4622 function (3.7.4.2) and that function, considered as a placement
4623 deallocation function, would have been selected as a match for the
4624 allocation function, the program is ill-formed." */
4625 if (non_placement_deallocation_fn_p (fn))
4627 /* But if the class has an operator delete (void *), then that is
4628 the usual deallocation function, so we shouldn't complain
4629 about using the operator delete (void *, size_t). */
4630 for (t = BASELINK_P (fns) ? BASELINK_FUNCTIONS (fns) : fns;
4631 t; t = OVL_NEXT (t))
4633 tree elt = OVL_CURRENT (t);
4634 if (non_placement_deallocation_fn_p (elt)
4635 && FUNCTION_ARG_CHAIN (elt) == void_list_node)
4638 permerror (0, "non-placement deallocation function %q+D", fn);
4639 permerror (input_location, "selected for placement delete");
4644 /* "Any non-placement deallocation function matches a non-placement
4645 allocation function. If the lookup finds a single matching
4646 deallocation function, that function will be called; otherwise, no
4647 deallocation function will be called." */
4648 for (t = BASELINK_P (fns) ? BASELINK_FUNCTIONS (fns) : fns;
4649 t; t = OVL_NEXT (t))
4651 tree elt = OVL_CURRENT (t);
4652 if (non_placement_deallocation_fn_p (elt))
4655 /* "If a class T has a member deallocation function named
4656 operator delete with exactly one parameter, then that
4657 function is a usual (non-placement) deallocation
4658 function. If class T does not declare such an operator
4659 delete but does declare a member deallocation function named
4660 operator delete with exactly two parameters, the second of
4661 which has type std::size_t (18.2), then this function is a
4662 usual deallocation function."
4664 So (void*) beats (void*, size_t). */
4665 if (FUNCTION_ARG_CHAIN (fn) == void_list_node)
4670 /* If we have a matching function, call it. */
4673 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
4675 /* If the FN is a member function, make sure that it is
4677 if (BASELINK_P (fns))
4678 perform_or_defer_access_check (BASELINK_BINFO (fns), fn, fn);
4680 /* Core issue 901: It's ok to new a type with deleted delete. */
4681 if (DECL_DELETED_FN (fn) && alloc_fn)
4686 /* The placement args might not be suitable for overload
4687 resolution at this point, so build the call directly. */
4688 int nargs = call_expr_nargs (placement);
4689 tree *argarray = (tree *) alloca (nargs * sizeof (tree));
4692 for (i = 1; i < nargs; i++)
4693 argarray[i] = CALL_EXPR_ARG (placement, i);
4695 return build_cxx_call (fn, nargs, argarray);
4700 VEC(tree,gc) *args = VEC_alloc (tree, gc, 2);
4701 VEC_quick_push (tree, args, addr);
4702 if (FUNCTION_ARG_CHAIN (fn) != void_list_node)
4703 VEC_quick_push (tree, args, size);
4704 ret = cp_build_function_call_vec (fn, &args, tf_warning_or_error);
4705 VEC_free (tree, gc, args);
4712 If no unambiguous matching deallocation function can be found,
4713 propagating the exception does not cause the object's memory to
4718 warning (0, "no corresponding deallocation function for %qD",
4723 error ("no suitable %<operator %s%> for %qT",
4724 operator_name_info[(int)code].name, type);
4725 return error_mark_node;
4728 /* If the current scope isn't allowed to access DECL along
4729 BASETYPE_PATH, give an error. The most derived class in
4730 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
4731 the declaration to use in the error diagnostic. */
4734 enforce_access (tree basetype_path, tree decl, tree diag_decl)
4736 gcc_assert (TREE_CODE (basetype_path) == TREE_BINFO);
4738 if (!accessible_p (basetype_path, decl, true))
4740 if (TREE_PRIVATE (decl))
4741 error ("%q+#D is private", diag_decl);
4742 else if (TREE_PROTECTED (decl))
4743 error ("%q+#D is protected", diag_decl);
4745 error ("%q+#D is inaccessible", diag_decl);
4746 error ("within this context");
4753 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
4754 bitwise or of LOOKUP_* values. If any errors are warnings are
4755 generated, set *DIAGNOSTIC_FN to "error" or "warning",
4756 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
4760 build_temp (tree expr, tree type, int flags,
4761 diagnostic_t *diagnostic_kind)
4766 savew = warningcount, savee = errorcount;
4767 args = make_tree_vector_single (expr);
4768 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
4769 &args, type, flags, tf_warning_or_error);
4770 release_tree_vector (args);
4771 if (warningcount > savew)
4772 *diagnostic_kind = DK_WARNING;
4773 else if (errorcount > savee)
4774 *diagnostic_kind = DK_ERROR;
4776 *diagnostic_kind = DK_UNSPECIFIED;
4780 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
4781 EXPR is implicitly converted to type TOTYPE.
4782 FN and ARGNUM are used for diagnostics. */
4785 conversion_null_warnings (tree totype, tree expr, tree fn, int argnum)
4787 tree t = non_reference (totype);
4789 /* Issue warnings about peculiar, but valid, uses of NULL. */
4790 if (expr == null_node && TREE_CODE (t) != BOOLEAN_TYPE && ARITHMETIC_TYPE_P (t))
4793 warning_at (input_location, OPT_Wconversion_null,
4794 "passing NULL to non-pointer argument %P of %qD",
4797 warning_at (input_location, OPT_Wconversion_null,
4798 "converting to non-pointer type %qT from NULL", t);
4801 /* Issue warnings if "false" is converted to a NULL pointer */
4802 else if (expr == boolean_false_node && fn && POINTER_TYPE_P (t))
4803 warning_at (input_location, OPT_Wconversion_null,
4804 "converting %<false%> to pointer type for argument %P of %qD",
4808 /* Perform the conversions in CONVS on the expression EXPR. FN and
4809 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
4810 indicates the `this' argument of a method. INNER is nonzero when
4811 being called to continue a conversion chain. It is negative when a
4812 reference binding will be applied, positive otherwise. If
4813 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
4814 conversions will be emitted if appropriate. If C_CAST_P is true,
4815 this conversion is coming from a C-style cast; in that case,
4816 conversions to inaccessible bases are permitted. */
4819 convert_like_real (conversion *convs, tree expr, tree fn, int argnum,
4820 int inner, bool issue_conversion_warnings,
4821 bool c_cast_p, tsubst_flags_t complain)
4823 tree totype = convs->type;
4824 diagnostic_t diag_kind;
4828 && convs->kind != ck_user
4829 && convs->kind != ck_list
4830 && convs->kind != ck_ambig
4831 && convs->kind != ck_ref_bind
4832 && convs->kind != ck_rvalue
4833 && convs->kind != ck_base)
4835 conversion *t = convs;
4837 /* Give a helpful error if this is bad because of excess braces. */
4838 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
4839 && SCALAR_TYPE_P (totype)
4840 && CONSTRUCTOR_NELTS (expr) > 0
4841 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr, 0)->value))
4842 permerror (input_location, "too many braces around initializer for %qT", totype);
4844 for (; t; t = convs->u.next)
4846 if (t->kind == ck_user || !t->bad_p)
4848 expr = convert_like_real (t, expr, fn, argnum, 1,
4849 /*issue_conversion_warnings=*/false,
4854 else if (t->kind == ck_ambig)
4855 return convert_like_real (t, expr, fn, argnum, 1,
4856 /*issue_conversion_warnings=*/false,
4859 else if (t->kind == ck_identity)
4862 if (complain & tf_error)
4864 permerror (input_location, "invalid conversion from %qT to %qT", TREE_TYPE (expr), totype);
4866 permerror (input_location, " initializing argument %P of %qD", argnum, fn);
4869 return error_mark_node;
4871 return cp_convert (totype, expr);
4874 if (issue_conversion_warnings && (complain & tf_warning))
4875 conversion_null_warnings (totype, expr, fn, argnum);
4877 switch (convs->kind)
4881 struct z_candidate *cand = convs->cand;
4882 tree convfn = cand->fn;
4885 /* When converting from an init list we consider explicit
4886 constructors, but actually trying to call one is an error. */
4887 if (DECL_NONCONVERTING_P (convfn) && DECL_CONSTRUCTOR_P (convfn))
4889 if (complain & tf_error)
4890 error ("converting to %qT from initializer list would use "
4891 "explicit constructor %qD", totype, convfn);
4893 return error_mark_node;
4896 /* Set user_conv_p on the argument conversions, so rvalue/base
4897 handling knows not to allow any more UDCs. */
4898 for (i = 0; i < cand->num_convs; ++i)
4899 cand->convs[i]->user_conv_p = true;
4901 expr = build_over_call (cand, LOOKUP_NORMAL, complain);
4903 /* If this is a constructor or a function returning an aggr type,
4904 we need to build up a TARGET_EXPR. */
4905 if (DECL_CONSTRUCTOR_P (convfn))
4907 expr = build_cplus_new (totype, expr);
4909 /* Remember that this was list-initialization. */
4910 if (convs->check_narrowing)
4911 TARGET_EXPR_LIST_INIT_P (expr) = true;
4917 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
4919 int nelts = CONSTRUCTOR_NELTS (expr);
4921 expr = integer_zero_node;
4922 else if (nelts == 1)
4923 expr = CONSTRUCTOR_ELT (expr, 0)->value;
4928 if (type_unknown_p (expr))
4929 expr = instantiate_type (totype, expr, complain);
4930 /* Convert a constant to its underlying value, unless we are
4931 about to bind it to a reference, in which case we need to
4932 leave it as an lvalue. */
4935 expr = decl_constant_value (expr);
4936 if (expr == null_node && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype))
4937 /* If __null has been converted to an integer type, we do not
4938 want to warn about uses of EXPR as an integer, rather than
4940 expr = build_int_cst (totype, 0);
4944 /* Call build_user_type_conversion again for the error. */
4945 return build_user_type_conversion
4946 (totype, convs->u.expr, LOOKUP_NORMAL);
4950 /* Conversion to std::initializer_list<T>. */
4951 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype), 0);
4952 tree new_ctor = build_constructor (init_list_type_node, NULL);
4953 unsigned len = CONSTRUCTOR_NELTS (expr);
4955 VEC(tree,gc) *parms;
4958 /* Convert all the elements. */
4959 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr), ix, val)
4961 tree sub = convert_like_real (convs->u.list[ix], val, fn, argnum,
4962 1, false, false, complain);
4963 if (sub == error_mark_node)
4965 check_narrowing (TREE_TYPE (sub), val);
4966 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor), NULL_TREE, sub);
4968 /* Build up the array. */
4969 elttype = cp_build_qualified_type
4970 (elttype, TYPE_QUALS (elttype) | TYPE_QUAL_CONST);
4971 array = build_array_of_n_type (elttype, len);
4972 array = finish_compound_literal (array, new_ctor);
4974 parms = make_tree_vector ();
4975 VEC_safe_push (tree, gc, parms, decay_conversion (array));
4976 VEC_safe_push (tree, gc, parms, size_int (len));
4977 /* Call the private constructor. */
4978 push_deferring_access_checks (dk_no_check);
4979 new_ctor = build_special_member_call
4980 (NULL_TREE, complete_ctor_identifier, &parms, totype, 0, complain);
4981 release_tree_vector (parms);
4982 pop_deferring_access_checks ();
4983 return build_cplus_new (totype, new_ctor);
4987 return get_target_expr (digest_init (totype, expr));
4993 expr = convert_like_real (convs->u.next, expr, fn, argnum,
4994 convs->kind == ck_ref_bind ? -1 : 1,
4995 convs->kind == ck_ref_bind ? issue_conversion_warnings : false,
4998 if (expr == error_mark_node)
4999 return error_mark_node;
5001 switch (convs->kind)
5004 expr = decay_conversion (expr);
5005 if (! MAYBE_CLASS_TYPE_P (totype))
5007 /* Else fall through. */
5009 if (convs->kind == ck_base && !convs->need_temporary_p)
5011 /* We are going to bind a reference directly to a base-class
5012 subobject of EXPR. */
5013 /* Build an expression for `*((base*) &expr)'. */
5014 expr = cp_build_unary_op (ADDR_EXPR, expr, 0, complain);
5015 expr = convert_to_base (expr, build_pointer_type (totype),
5016 !c_cast_p, /*nonnull=*/true);
5017 expr = cp_build_indirect_ref (expr, RO_IMPLICIT_CONVERSION, complain);
5021 /* Copy-initialization where the cv-unqualified version of the source
5022 type is the same class as, or a derived class of, the class of the
5023 destination [is treated as direct-initialization]. [dcl.init] */
5024 flags = LOOKUP_NORMAL|LOOKUP_ONLYCONVERTING;
5025 if (convs->user_conv_p)
5026 /* This conversion is being done in the context of a user-defined
5027 conversion (i.e. the second step of copy-initialization), so
5028 don't allow any more. */
5029 flags |= LOOKUP_NO_CONVERSION;
5030 expr = build_temp (expr, totype, flags, &diag_kind);
5031 if (diag_kind && fn)
5033 if ((complain & tf_error))
5034 emit_diagnostic (diag_kind, input_location, 0,
5035 " initializing argument %P of %qD", argnum, fn);
5036 else if (diag_kind == DK_ERROR)
5037 return error_mark_node;
5039 return build_cplus_new (totype, expr);
5043 tree ref_type = totype;
5045 if (convs->bad_p && TYPE_REF_IS_RVALUE (ref_type)
5046 && real_lvalue_p (expr))
5048 if (complain & tf_error)
5050 error ("cannot bind %qT lvalue to %qT",
5051 TREE_TYPE (expr), totype);
5053 error (" initializing argument %P of %q+D", argnum, fn);
5055 return error_mark_node;
5058 /* If necessary, create a temporary.
5060 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
5061 that need temporaries, even when their types are reference
5062 compatible with the type of reference being bound, so the
5063 upcoming call to cp_build_unary_op (ADDR_EXPR, expr, ...)
5065 if (convs->need_temporary_p
5066 || TREE_CODE (expr) == CONSTRUCTOR
5067 || TREE_CODE (expr) == VA_ARG_EXPR)
5069 tree type = convs->u.next->type;
5070 cp_lvalue_kind lvalue = real_lvalue_p (expr);
5072 if (!CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type))
5073 && !TYPE_REF_IS_RVALUE (ref_type))
5075 if (complain & tf_error)
5077 /* If the reference is volatile or non-const, we
5078 cannot create a temporary. */
5079 if (lvalue & clk_bitfield)
5080 error ("cannot bind bitfield %qE to %qT",
5082 else if (lvalue & clk_packed)
5083 error ("cannot bind packed field %qE to %qT",
5086 error ("cannot bind rvalue %qE to %qT", expr, ref_type);
5088 return error_mark_node;
5090 /* If the source is a packed field, and we must use a copy
5091 constructor, then building the target expr will require
5092 binding the field to the reference parameter to the
5093 copy constructor, and we'll end up with an infinite
5094 loop. If we can use a bitwise copy, then we'll be
5096 if ((lvalue & clk_packed)
5097 && CLASS_TYPE_P (type)
5098 && !TYPE_HAS_TRIVIAL_INIT_REF (type))
5100 if (complain & tf_error)
5101 error ("cannot bind packed field %qE to %qT",
5103 return error_mark_node;
5105 if (lvalue & clk_bitfield)
5107 expr = convert_bitfield_to_declared_type (expr);
5108 expr = fold_convert (type, expr);
5110 expr = build_target_expr_with_type (expr, type);
5113 /* Take the address of the thing to which we will bind the
5115 expr = cp_build_unary_op (ADDR_EXPR, expr, 1, complain);
5116 if (expr == error_mark_node)
5117 return error_mark_node;
5119 /* Convert it to a pointer to the type referred to by the
5120 reference. This will adjust the pointer if a derived to
5121 base conversion is being performed. */
5122 expr = cp_convert (build_pointer_type (TREE_TYPE (ref_type)),
5124 /* Convert the pointer to the desired reference type. */
5125 return build_nop (ref_type, expr);
5129 return decay_conversion (expr);
5132 /* Warn about deprecated conversion if appropriate. */
5133 string_conv_p (totype, expr, 1);
5138 expr = convert_to_base (expr, totype, !c_cast_p,
5140 return build_nop (totype, expr);
5143 return convert_ptrmem (totype, expr, /*allow_inverse_p=*/false,
5150 if (convs->check_narrowing)
5151 check_narrowing (totype, expr);
5153 if (issue_conversion_warnings && (complain & tf_warning))
5154 expr = convert_and_check (totype, expr);
5156 expr = convert (totype, expr);
5161 /* ARG is being passed to a varargs function. Perform any conversions
5162 required. Return the converted value. */
5165 convert_arg_to_ellipsis (tree arg)
5169 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
5170 standard conversions are performed. */
5171 arg = decay_conversion (arg);
5174 If the argument has integral or enumeration type that is subject
5175 to the integral promotions (_conv.prom_), or a floating point
5176 type that is subject to the floating point promotion
5177 (_conv.fpprom_), the value of the argument is converted to the
5178 promoted type before the call. */
5179 if (TREE_CODE (TREE_TYPE (arg)) == REAL_TYPE
5180 && (TYPE_PRECISION (TREE_TYPE (arg))
5181 < TYPE_PRECISION (double_type_node))
5182 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (arg))))
5183 arg = convert_to_real (double_type_node, arg);
5184 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (arg)))
5185 arg = perform_integral_promotions (arg);
5187 arg = require_complete_type (arg);
5189 if (arg != error_mark_node
5190 && (type_has_nontrivial_copy_init (TREE_TYPE (arg))
5191 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (arg))))
5193 /* [expr.call] 5.2.2/7:
5194 Passing a potentially-evaluated argument of class type (Clause 9)
5195 with a non-trivial copy constructor or a non-trivial destructor
5196 with no corresponding parameter is conditionally-supported, with
5197 implementation-defined semantics.
5199 We used to just warn here and do a bitwise copy, but now
5200 cp_expr_size will abort if we try to do that.
5202 If the call appears in the context of a sizeof expression,
5203 it is not potentially-evaluated. */
5204 if (cp_unevaluated_operand == 0)
5205 error ("cannot pass objects of non-trivially-copyable "
5206 "type %q#T through %<...%>", TREE_TYPE (arg));
5212 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
5215 build_x_va_arg (tree expr, tree type)
5217 if (processing_template_decl)
5218 return build_min (VA_ARG_EXPR, type, expr);
5220 type = complete_type_or_else (type, NULL_TREE);
5222 if (expr == error_mark_node || !type)
5223 return error_mark_node;
5225 if (type_has_nontrivial_copy_init (type)
5226 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
5227 || TREE_CODE (type) == REFERENCE_TYPE)
5229 /* Remove reference types so we don't ICE later on. */
5230 tree type1 = non_reference (type);
5231 /* conditionally-supported behavior [expr.call] 5.2.2/7. */
5232 error ("cannot receive objects of non-trivially-copyable type %q#T "
5233 "through %<...%>; ", type);
5234 expr = convert (build_pointer_type (type1), null_node);
5235 expr = cp_build_indirect_ref (expr, RO_NULL, tf_warning_or_error);
5239 return build_va_arg (input_location, expr, type);
5242 /* TYPE has been given to va_arg. Apply the default conversions which
5243 would have happened when passed via ellipsis. Return the promoted
5244 type, or the passed type if there is no change. */
5247 cxx_type_promotes_to (tree type)
5251 /* Perform the array-to-pointer and function-to-pointer
5253 type = type_decays_to (type);
5255 promote = type_promotes_to (type);
5256 if (same_type_p (type, promote))
5262 /* ARG is a default argument expression being passed to a parameter of
5263 the indicated TYPE, which is a parameter to FN. Do any required
5264 conversions. Return the converted value. */
5266 static GTY(()) VEC(tree,gc) *default_arg_context;
5269 convert_default_arg (tree type, tree arg, tree fn, int parmnum)
5274 /* If the ARG is an unparsed default argument expression, the
5275 conversion cannot be performed. */
5276 if (TREE_CODE (arg) == DEFAULT_ARG)
5278 error ("the default argument for parameter %d of %qD has "
5279 "not yet been parsed",
5281 return error_mark_node;
5284 /* Detect recursion. */
5285 for (i = 0; VEC_iterate (tree, default_arg_context, i, t); ++i)
5288 error ("recursive evaluation of default argument for %q#D", fn);
5289 return error_mark_node;
5291 VEC_safe_push (tree, gc, default_arg_context, fn);
5293 if (fn && DECL_TEMPLATE_INFO (fn))
5294 arg = tsubst_default_argument (fn, type, arg);
5300 The names in the expression are bound, and the semantic
5301 constraints are checked, at the point where the default
5302 expressions appears.
5304 we must not perform access checks here. */
5305 push_deferring_access_checks (dk_no_check);
5306 arg = break_out_target_exprs (arg);
5307 if (TREE_CODE (arg) == CONSTRUCTOR)
5309 arg = digest_init (type, arg);
5310 arg = convert_for_initialization (0, type, arg, LOOKUP_NORMAL,
5311 "default argument", fn, parmnum,
5312 tf_warning_or_error);
5316 /* We must make a copy of ARG, in case subsequent processing
5317 alters any part of it. For example, during gimplification a
5318 cast of the form (T) &X::f (where "f" is a member function)
5319 will lead to replacing the PTRMEM_CST for &X::f with a
5320 VAR_DECL. We can avoid the copy for constants, since they
5321 are never modified in place. */
5322 if (!CONSTANT_CLASS_P (arg))
5323 arg = unshare_expr (arg);
5324 arg = convert_for_initialization (0, type, arg, LOOKUP_NORMAL,
5325 "default argument", fn, parmnum,
5326 tf_warning_or_error);
5327 arg = convert_for_arg_passing (type, arg);
5329 pop_deferring_access_checks();
5331 VEC_pop (tree, default_arg_context);
5336 /* Returns the type which will really be used for passing an argument of
5340 type_passed_as (tree type)
5342 /* Pass classes with copy ctors by invisible reference. */
5343 if (TREE_ADDRESSABLE (type))
5345 type = build_reference_type (type);
5346 /* There are no other pointers to this temporary. */
5347 type = build_qualified_type (type, TYPE_QUAL_RESTRICT);
5349 else if (targetm.calls.promote_prototypes (type)
5350 && INTEGRAL_TYPE_P (type)
5351 && COMPLETE_TYPE_P (type)
5352 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type),
5353 TYPE_SIZE (integer_type_node)))
5354 type = integer_type_node;
5359 /* Actually perform the appropriate conversion. */
5362 convert_for_arg_passing (tree type, tree val)
5366 /* If VAL is a bitfield, then -- since it has already been converted
5367 to TYPE -- it cannot have a precision greater than TYPE.
5369 If it has a smaller precision, we must widen it here. For
5370 example, passing "int f:3;" to a function expecting an "int" will
5371 not result in any conversion before this point.
5373 If the precision is the same we must not risk widening. For
5374 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
5375 often have type "int", even though the C++ type for the field is
5376 "long long". If the value is being passed to a function
5377 expecting an "int", then no conversions will be required. But,
5378 if we call convert_bitfield_to_declared_type, the bitfield will
5379 be converted to "long long". */
5380 bitfield_type = is_bitfield_expr_with_lowered_type (val);
5382 && TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type))
5383 val = convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type), val);
5385 if (val == error_mark_node)
5387 /* Pass classes with copy ctors by invisible reference. */
5388 else if (TREE_ADDRESSABLE (type))
5389 val = build1 (ADDR_EXPR, build_reference_type (type), val);
5390 else if (targetm.calls.promote_prototypes (type)
5391 && INTEGRAL_TYPE_P (type)
5392 && COMPLETE_TYPE_P (type)
5393 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type),
5394 TYPE_SIZE (integer_type_node)))
5395 val = perform_integral_promotions (val);
5396 if (warn_missing_format_attribute)
5398 tree rhstype = TREE_TYPE (val);
5399 const enum tree_code coder = TREE_CODE (rhstype);
5400 const enum tree_code codel = TREE_CODE (type);
5401 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
5403 && check_missing_format_attribute (type, rhstype))
5404 warning (OPT_Wmissing_format_attribute,
5405 "argument of function call might be a candidate for a format attribute");
5410 /* Returns true iff FN is a function with magic varargs, i.e. ones for
5411 which no conversions at all should be done. This is true for some
5412 builtins which don't act like normal functions. */
5415 magic_varargs_p (tree fn)
5417 if (DECL_BUILT_IN (fn))
5418 switch (DECL_FUNCTION_CODE (fn))
5420 case BUILT_IN_CLASSIFY_TYPE:
5421 case BUILT_IN_CONSTANT_P:
5422 case BUILT_IN_NEXT_ARG:
5423 case BUILT_IN_VA_START:
5427 return lookup_attribute ("type generic",
5428 TYPE_ATTRIBUTES (TREE_TYPE (fn))) != 0;
5434 /* Subroutine of the various build_*_call functions. Overload resolution
5435 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
5436 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
5437 bitmask of various LOOKUP_* flags which apply to the call itself. */
5440 build_over_call (struct z_candidate *cand, int flags, tsubst_flags_t complain)
5443 const VEC(tree,gc) *args = cand->args;
5444 tree first_arg = cand->first_arg;
5445 conversion **convs = cand->convs;
5447 tree parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
5452 unsigned int arg_index = 0;
5456 bool already_used = false;
5458 /* In a template, there is no need to perform all of the work that
5459 is normally done. We are only interested in the type of the call
5460 expression, i.e., the return type of the function. Any semantic
5461 errors will be deferred until the template is instantiated. */
5462 if (processing_template_decl)
5466 const tree *argarray;
5469 return_type = TREE_TYPE (TREE_TYPE (fn));
5470 nargs = VEC_length (tree, args);
5471 if (first_arg == NULL_TREE)
5472 argarray = VEC_address (tree, CONST_CAST (VEC(tree,gc) *, args));
5480 alcarray = XALLOCAVEC (tree, nargs);
5481 alcarray[0] = first_arg;
5482 for (ix = 0; VEC_iterate (tree, args, ix, arg); ++ix)
5483 alcarray[ix + 1] = arg;
5484 argarray = alcarray;
5486 expr = build_call_array_loc (input_location,
5487 return_type, build_addr_func (fn), nargs,
5489 if (TREE_THIS_VOLATILE (fn) && cfun)
5490 current_function_returns_abnormally = 1;
5491 if (!VOID_TYPE_P (return_type))
5492 require_complete_type (return_type);
5493 return convert_from_reference (expr);
5496 /* Give any warnings we noticed during overload resolution. */
5499 struct candidate_warning *w;
5500 for (w = cand->warnings; w; w = w->next)
5501 joust (cand, w->loser, 1);
5504 /* Make =delete work with SFINAE. */
5505 if (DECL_DELETED_FN (fn) && !(complain & tf_error))
5506 return error_mark_node;
5508 if (DECL_FUNCTION_MEMBER_P (fn))
5510 /* If FN is a template function, two cases must be considered.
5515 template <class T> void f();
5517 template <class T> struct B {
5521 struct C : A, B<int> {
5523 using B<int>::g; // #2
5526 In case #1 where `A::f' is a member template, DECL_ACCESS is
5527 recorded in the primary template but not in its specialization.
5528 We check access of FN using its primary template.
5530 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
5531 because it is a member of class template B, DECL_ACCESS is
5532 recorded in the specialization `B<int>::g'. We cannot use its
5533 primary template because `B<T>::g' and `B<int>::g' may have
5534 different access. */
5535 if (DECL_TEMPLATE_INFO (fn)
5536 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
5537 perform_or_defer_access_check (cand->access_path,
5538 DECL_TI_TEMPLATE (fn), fn);
5540 perform_or_defer_access_check (cand->access_path, fn, fn);
5543 /* Find maximum size of vector to hold converted arguments. */
5544 parmlen = list_length (parm);
5545 nargs = VEC_length (tree, args) + (first_arg != NULL_TREE ? 1 : 0);
5546 if (parmlen > nargs)
5548 argarray = (tree *) alloca (nargs * sizeof (tree));
5550 /* The implicit parameters to a constructor are not considered by overload
5551 resolution, and must be of the proper type. */
5552 if (DECL_CONSTRUCTOR_P (fn))
5554 if (first_arg != NULL_TREE)
5556 argarray[j++] = first_arg;
5557 first_arg = NULL_TREE;
5561 argarray[j++] = VEC_index (tree, args, arg_index);
5564 parm = TREE_CHAIN (parm);
5565 /* We should never try to call the abstract constructor. */
5566 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn));
5568 if (DECL_HAS_VTT_PARM_P (fn))
5570 argarray[j++] = VEC_index (tree, args, arg_index);
5572 parm = TREE_CHAIN (parm);
5575 /* Bypass access control for 'this' parameter. */
5576 else if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
5578 tree parmtype = TREE_VALUE (parm);
5579 tree arg = (first_arg != NULL_TREE
5581 : VEC_index (tree, args, arg_index));
5582 tree argtype = TREE_TYPE (arg);
5586 if (convs[i]->bad_p)
5588 if (complain & tf_error)
5589 permerror (input_location, "passing %qT as %<this%> argument of %q#D discards qualifiers",
5590 TREE_TYPE (argtype), fn);
5592 return error_mark_node;
5595 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
5596 X is called for an object that is not of type X, or of a type
5597 derived from X, the behavior is undefined.
5599 So we can assume that anything passed as 'this' is non-null, and
5600 optimize accordingly. */
5601 gcc_assert (TREE_CODE (parmtype) == POINTER_TYPE);
5602 /* Convert to the base in which the function was declared. */
5603 gcc_assert (cand->conversion_path != NULL_TREE);
5604 converted_arg = build_base_path (PLUS_EXPR,
5606 cand->conversion_path,
5608 /* Check that the base class is accessible. */
5609 if (!accessible_base_p (TREE_TYPE (argtype),
5610 BINFO_TYPE (cand->conversion_path), true))
5611 error ("%qT is not an accessible base of %qT",
5612 BINFO_TYPE (cand->conversion_path),
5613 TREE_TYPE (argtype));
5614 /* If fn was found by a using declaration, the conversion path
5615 will be to the derived class, not the base declaring fn. We
5616 must convert from derived to base. */
5617 base_binfo = lookup_base (TREE_TYPE (TREE_TYPE (converted_arg)),
5618 TREE_TYPE (parmtype), ba_unique, NULL);
5619 converted_arg = build_base_path (PLUS_EXPR, converted_arg,
5622 argarray[j++] = converted_arg;
5623 parm = TREE_CHAIN (parm);
5624 if (first_arg != NULL_TREE)
5625 first_arg = NULL_TREE;
5632 gcc_assert (first_arg == NULL_TREE);
5633 for (; arg_index < VEC_length (tree, args) && parm;
5634 parm = TREE_CHAIN (parm), ++arg_index, ++i)
5636 tree type = TREE_VALUE (parm);
5640 /* Don't make a copy here if build_call is going to. */
5641 if (conv->kind == ck_rvalue
5642 && COMPLETE_TYPE_P (complete_type (type))
5643 && !TREE_ADDRESSABLE (type))
5644 conv = conv->u.next;
5646 /* Warn about initializer_list deduction that isn't currently in the
5648 if (cxx_dialect > cxx98
5649 && flag_deduce_init_list
5650 && cand->template_decl
5651 && is_std_init_list (non_reference (type)))
5653 tree tmpl = TI_TEMPLATE (cand->template_decl);
5654 tree realparm = chain_index (j, DECL_ARGUMENTS (cand->fn));
5655 tree patparm = get_pattern_parm (realparm, tmpl);
5656 tree pattype = TREE_TYPE (patparm);
5657 if (PACK_EXPANSION_P (pattype))
5658 pattype = PACK_EXPANSION_PATTERN (pattype);
5659 pattype = non_reference (pattype);
5661 if (!is_std_init_list (pattype))
5663 pedwarn (input_location, 0, "deducing %qT as %qT",
5664 non_reference (TREE_TYPE (patparm)),
5665 non_reference (type));
5666 pedwarn (input_location, 0, " in call to %q+D", cand->fn);
5667 pedwarn (input_location, 0,
5668 " (you can disable this with -fno-deduce-init-list)");
5672 val = convert_like_with_context
5673 (conv, VEC_index (tree, args, arg_index), fn, i - is_method,
5676 val = convert_for_arg_passing (type, val);
5677 if (val == error_mark_node)
5678 return error_mark_node;
5680 argarray[j++] = val;
5683 /* Default arguments */
5684 for (; parm && parm != void_list_node; parm = TREE_CHAIN (parm), i++)
5685 argarray[j++] = convert_default_arg (TREE_VALUE (parm),
5686 TREE_PURPOSE (parm),
5689 for (; arg_index < VEC_length (tree, args); ++arg_index)
5691 tree a = VEC_index (tree, args, arg_index);
5692 if (magic_varargs_p (fn))
5693 /* Do no conversions for magic varargs. */;
5695 a = convert_arg_to_ellipsis (a);
5699 gcc_assert (j <= nargs);
5702 check_function_arguments (TYPE_ATTRIBUTES (TREE_TYPE (fn)),
5703 nargs, argarray, TYPE_ARG_TYPES (TREE_TYPE (fn)));
5705 /* Avoid actually calling copy constructors and copy assignment operators,
5708 if (! flag_elide_constructors)
5709 /* Do things the hard way. */;
5710 else if (cand->num_convs == 1
5711 && (DECL_COPY_CONSTRUCTOR_P (fn)
5712 || DECL_MOVE_CONSTRUCTOR_P (fn)))
5715 tree arg = argarray[num_artificial_parms_for (fn)];
5718 /* Pull out the real argument, disregarding const-correctness. */
5720 while (CONVERT_EXPR_P (targ)
5721 || TREE_CODE (targ) == NON_LVALUE_EXPR)
5722 targ = TREE_OPERAND (targ, 0);
5723 if (TREE_CODE (targ) == ADDR_EXPR)
5725 targ = TREE_OPERAND (targ, 0);
5726 if (!same_type_ignoring_top_level_qualifiers_p
5727 (TREE_TYPE (TREE_TYPE (arg)), TREE_TYPE (targ)))
5736 arg = cp_build_indirect_ref (arg, RO_NULL, complain);
5738 if (TREE_CODE (arg) == TARGET_EXPR
5739 && TARGET_EXPR_LIST_INIT_P (arg))
5741 /* Copy-list-initialization doesn't require the copy constructor
5744 /* [class.copy]: the copy constructor is implicitly defined even if
5745 the implementation elided its use. */
5746 else if (TYPE_HAS_COMPLEX_INIT_REF (DECL_CONTEXT (fn)))
5749 already_used = true;
5752 /* If we're creating a temp and we already have one, don't create a
5753 new one. If we're not creating a temp but we get one, use
5754 INIT_EXPR to collapse the temp into our target. Otherwise, if the
5755 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
5756 temp or an INIT_EXPR otherwise. */
5757 fa = (cand->first_arg != NULL_TREE
5759 : VEC_index (tree, args, 0));
5760 if (integer_zerop (fa))
5762 if (TREE_CODE (arg) == TARGET_EXPR)
5764 else if (TYPE_HAS_TRIVIAL_INIT_REF (DECL_CONTEXT (fn)))
5765 return build_target_expr_with_type (arg, DECL_CONTEXT (fn));
5767 else if (TREE_CODE (arg) == TARGET_EXPR
5768 || (TYPE_HAS_TRIVIAL_INIT_REF (DECL_CONTEXT (fn))
5769 && !move_fn_p (fn)))
5771 tree to = stabilize_reference (cp_build_indirect_ref (fa, RO_NULL,
5773 tree type = TREE_TYPE (to);
5775 if (TREE_CODE (arg) != TARGET_EXPR
5776 && TREE_CODE (arg) != AGGR_INIT_EXPR
5777 && is_really_empty_class (type))
5779 /* Avoid copying empty classes. */
5780 val = build2 (COMPOUND_EXPR, void_type_node, to, arg);
5781 TREE_NO_WARNING (val) = 1;
5782 val = build2 (COMPOUND_EXPR, type, val, to);
5783 TREE_NO_WARNING (val) = 1;
5786 val = build2 (INIT_EXPR, DECL_CONTEXT (fn), to, arg);
5790 else if (DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR
5792 && TYPE_HAS_TRIVIAL_ASSIGN_REF (DECL_CONTEXT (fn)))
5794 tree to = stabilize_reference
5795 (cp_build_indirect_ref (argarray[0], RO_NULL, complain));
5796 tree type = TREE_TYPE (to);
5797 tree as_base = CLASSTYPE_AS_BASE (type);
5798 tree arg = argarray[1];
5800 if (is_really_empty_class (type))
5802 /* Avoid copying empty classes. */
5803 val = build2 (COMPOUND_EXPR, void_type_node, to, arg);
5804 TREE_NO_WARNING (val) = 1;
5805 val = build2 (COMPOUND_EXPR, type, val, to);
5806 TREE_NO_WARNING (val) = 1;
5808 else if (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (as_base)))
5810 arg = cp_build_indirect_ref (arg, RO_NULL, complain);
5811 val = build2 (MODIFY_EXPR, TREE_TYPE (to), to, arg);
5815 /* We must only copy the non-tail padding parts.
5816 Use __builtin_memcpy for the bitwise copy.
5817 FIXME fix 22488 so we can go back to using MODIFY_EXPR
5818 instead of an explicit call to memcpy. */
5820 tree arg0, arg1, arg2, t;
5821 tree test = NULL_TREE;
5823 arg2 = TYPE_SIZE_UNIT (as_base);
5825 arg0 = cp_build_unary_op (ADDR_EXPR, to, 0, complain);
5827 if (!can_trust_pointer_alignment ())
5829 /* If we can't be sure about pointer alignment, a call
5830 to __builtin_memcpy is expanded as a call to memcpy, which
5831 is invalid with identical args. Otherwise it is
5832 expanded as a block move, which should be safe. */
5833 arg0 = save_expr (arg0);
5834 arg1 = save_expr (arg1);
5835 test = build2 (EQ_EXPR, boolean_type_node, arg0, arg1);
5837 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
5838 t = build_call_n (t, 3, arg0, arg1, arg2);
5840 t = convert (TREE_TYPE (arg0), t);
5842 t = build3 (COND_EXPR, TREE_TYPE (t), test, arg0, t);
5843 val = cp_build_indirect_ref (t, RO_NULL, complain);
5844 TREE_NO_WARNING (val) = 1;
5853 if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0)
5856 tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (argarray[0])),
5859 gcc_assert (binfo && binfo != error_mark_node);
5861 /* Warn about deprecated virtual functions now, since we're about
5862 to throw away the decl. */
5863 if (TREE_DEPRECATED (fn))
5864 warn_deprecated_use (fn, NULL_TREE);
5866 argarray[0] = build_base_path (PLUS_EXPR, argarray[0], binfo, 1);
5867 if (TREE_SIDE_EFFECTS (argarray[0]))
5868 argarray[0] = save_expr (argarray[0]);
5869 t = build_pointer_type (TREE_TYPE (fn));
5870 if (DECL_CONTEXT (fn) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn)))
5871 fn = build_java_interface_fn_ref (fn, argarray[0]);
5873 fn = build_vfn_ref (argarray[0], DECL_VINDEX (fn));
5877 fn = build_addr_func (fn);
5879 return build_cxx_call (fn, nargs, argarray);
5882 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
5883 This function performs no overload resolution, conversion, or other
5884 high-level operations. */
5887 build_cxx_call (tree fn, int nargs, tree *argarray)
5891 fn = build_call_a (fn, nargs, argarray);
5893 /* If this call might throw an exception, note that fact. */
5894 fndecl = get_callee_fndecl (fn);
5895 if ((!fndecl || !TREE_NOTHROW (fndecl))
5896 && at_function_scope_p ()
5898 cp_function_chain->can_throw = 1;
5900 /* Check that arguments to builtin functions match the expectations. */
5902 && DECL_BUILT_IN (fndecl)
5903 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
5904 && !check_builtin_function_arguments (fndecl, nargs, argarray))
5905 return error_mark_node;
5907 /* Some built-in function calls will be evaluated at compile-time in
5909 fn = fold_if_not_in_template (fn);
5911 if (VOID_TYPE_P (TREE_TYPE (fn)))
5914 fn = require_complete_type (fn);
5915 if (fn == error_mark_node)
5916 return error_mark_node;
5918 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn)))
5919 fn = build_cplus_new (TREE_TYPE (fn), fn);
5920 return convert_from_reference (fn);
5923 static GTY(()) tree java_iface_lookup_fn;
5925 /* Make an expression which yields the address of the Java interface
5926 method FN. This is achieved by generating a call to libjava's
5927 _Jv_LookupInterfaceMethodIdx(). */
5930 build_java_interface_fn_ref (tree fn, tree instance)
5932 tree lookup_fn, method, idx;
5933 tree klass_ref, iface, iface_ref;
5936 if (!java_iface_lookup_fn)
5938 tree endlink = build_void_list_node ();
5939 tree t = tree_cons (NULL_TREE, ptr_type_node,
5940 tree_cons (NULL_TREE, ptr_type_node,
5941 tree_cons (NULL_TREE, java_int_type_node,
5943 java_iface_lookup_fn
5944 = add_builtin_function ("_Jv_LookupInterfaceMethodIdx",
5945 build_function_type (ptr_type_node, t),
5946 0, NOT_BUILT_IN, NULL, NULL_TREE);
5949 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
5950 This is the first entry in the vtable. */
5951 klass_ref = build_vtbl_ref (cp_build_indirect_ref (instance, RO_NULL,
5952 tf_warning_or_error),
5955 /* Get the java.lang.Class pointer for the interface being called. */
5956 iface = DECL_CONTEXT (fn);
5957 iface_ref = lookup_field (iface, get_identifier ("class$"), 0, false);
5958 if (!iface_ref || TREE_CODE (iface_ref) != VAR_DECL
5959 || DECL_CONTEXT (iface_ref) != iface)
5961 error ("could not find class$ field in java interface type %qT",
5963 return error_mark_node;
5965 iface_ref = build_address (iface_ref);
5966 iface_ref = convert (build_pointer_type (iface), iface_ref);
5968 /* Determine the itable index of FN. */
5970 for (method = TYPE_METHODS (iface); method; method = TREE_CHAIN (method))
5972 if (!DECL_VIRTUAL_P (method))
5978 idx = build_int_cst (NULL_TREE, i);
5980 lookup_fn = build1 (ADDR_EXPR,
5981 build_pointer_type (TREE_TYPE (java_iface_lookup_fn)),
5982 java_iface_lookup_fn);
5983 return build_call_nary (ptr_type_node, lookup_fn,
5984 3, klass_ref, iface_ref, idx);
5987 /* Returns the value to use for the in-charge parameter when making a
5988 call to a function with the indicated NAME.
5990 FIXME:Can't we find a neater way to do this mapping? */
5993 in_charge_arg_for_name (tree name)
5995 if (name == base_ctor_identifier
5996 || name == base_dtor_identifier)
5997 return integer_zero_node;
5998 else if (name == complete_ctor_identifier)
5999 return integer_one_node;
6000 else if (name == complete_dtor_identifier)
6001 return integer_two_node;
6002 else if (name == deleting_dtor_identifier)
6003 return integer_three_node;
6005 /* This function should only be called with one of the names listed
6011 /* Build a call to a constructor, destructor, or an assignment
6012 operator for INSTANCE, an expression with class type. NAME
6013 indicates the special member function to call; *ARGS are the
6014 arguments. ARGS may be NULL. This may change ARGS. BINFO
6015 indicates the base of INSTANCE that is to be passed as the `this'
6016 parameter to the member function called.
6018 FLAGS are the LOOKUP_* flags to use when processing the call.
6020 If NAME indicates a complete object constructor, INSTANCE may be
6021 NULL_TREE. In this case, the caller will call build_cplus_new to
6022 store the newly constructed object into a VAR_DECL. */
6025 build_special_member_call (tree instance, tree name, VEC(tree,gc) **args,
6026 tree binfo, int flags, tsubst_flags_t complain)
6029 /* The type of the subobject to be constructed or destroyed. */
6031 VEC(tree,gc) *allocated = NULL;
6034 gcc_assert (name == complete_ctor_identifier
6035 || name == base_ctor_identifier
6036 || name == complete_dtor_identifier
6037 || name == base_dtor_identifier
6038 || name == deleting_dtor_identifier
6039 || name == ansi_assopname (NOP_EXPR));
6042 /* Resolve the name. */
6043 if (!complete_type_or_else (binfo, NULL_TREE))
6044 return error_mark_node;
6046 binfo = TYPE_BINFO (binfo);
6049 gcc_assert (binfo != NULL_TREE);
6051 class_type = BINFO_TYPE (binfo);
6053 /* Handle the special case where INSTANCE is NULL_TREE. */
6054 if (name == complete_ctor_identifier && !instance)
6056 instance = build_int_cst (build_pointer_type (class_type), 0);
6057 instance = build1 (INDIRECT_REF, class_type, instance);
6061 if (name == complete_dtor_identifier
6062 || name == base_dtor_identifier
6063 || name == deleting_dtor_identifier)
6064 gcc_assert (args == NULL || VEC_empty (tree, *args));
6066 /* Convert to the base class, if necessary. */
6067 if (!same_type_ignoring_top_level_qualifiers_p
6068 (TREE_TYPE (instance), BINFO_TYPE (binfo)))
6070 if (name != ansi_assopname (NOP_EXPR))
6071 /* For constructors and destructors, either the base is
6072 non-virtual, or it is virtual but we are doing the
6073 conversion from a constructor or destructor for the
6074 complete object. In either case, we can convert
6076 instance = convert_to_base_statically (instance, binfo);
6078 /* However, for assignment operators, we must convert
6079 dynamically if the base is virtual. */
6080 instance = build_base_path (PLUS_EXPR, instance,
6081 binfo, /*nonnull=*/1);
6085 gcc_assert (instance != NULL_TREE);
6087 fns = lookup_fnfields (binfo, name, 1);
6089 /* When making a call to a constructor or destructor for a subobject
6090 that uses virtual base classes, pass down a pointer to a VTT for
6092 if ((name == base_ctor_identifier
6093 || name == base_dtor_identifier)
6094 && CLASSTYPE_VBASECLASSES (class_type))
6099 /* If the current function is a complete object constructor
6100 or destructor, then we fetch the VTT directly.
6101 Otherwise, we look it up using the VTT we were given. */
6102 vtt = TREE_CHAIN (CLASSTYPE_VTABLES (current_class_type));
6103 vtt = decay_conversion (vtt);
6104 vtt = build3 (COND_EXPR, TREE_TYPE (vtt),
6105 build2 (EQ_EXPR, boolean_type_node,
6106 current_in_charge_parm, integer_zero_node),
6109 gcc_assert (BINFO_SUBVTT_INDEX (binfo));
6110 sub_vtt = build2 (POINTER_PLUS_EXPR, TREE_TYPE (vtt), vtt,
6111 BINFO_SUBVTT_INDEX (binfo));
6115 allocated = make_tree_vector ();
6119 VEC_safe_insert (tree, gc, *args, 0, sub_vtt);
6122 ret = build_new_method_call (instance, fns, args,
6123 TYPE_BINFO (BINFO_TYPE (binfo)),
6127 if (allocated != NULL)
6128 release_tree_vector (allocated);
6133 /* Return the NAME, as a C string. The NAME indicates a function that
6134 is a member of TYPE. *FREE_P is set to true if the caller must
6135 free the memory returned.
6137 Rather than go through all of this, we should simply set the names
6138 of constructors and destructors appropriately, and dispense with
6139 ctor_identifier, dtor_identifier, etc. */
6142 name_as_c_string (tree name, tree type, bool *free_p)
6146 /* Assume that we will not allocate memory. */
6148 /* Constructors and destructors are special. */
6149 if (IDENTIFIER_CTOR_OR_DTOR_P (name))
6152 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type))));
6153 /* For a destructor, add the '~'. */
6154 if (name == complete_dtor_identifier
6155 || name == base_dtor_identifier
6156 || name == deleting_dtor_identifier)
6158 pretty_name = concat ("~", pretty_name, NULL);
6159 /* Remember that we need to free the memory allocated. */
6163 else if (IDENTIFIER_TYPENAME_P (name))
6165 pretty_name = concat ("operator ",
6166 type_as_string_translate (TREE_TYPE (name),
6167 TFF_PLAIN_IDENTIFIER),
6169 /* Remember that we need to free the memory allocated. */
6173 pretty_name = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name)));
6178 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
6179 be set, upon return, to the function called. ARGS may be NULL.
6180 This may change ARGS. */
6183 build_new_method_call (tree instance, tree fns, VEC(tree,gc) **args,
6184 tree conversion_path, int flags,
6185 tree *fn_p, tsubst_flags_t complain)
6187 struct z_candidate *candidates = 0, *cand;
6188 tree explicit_targs = NULL_TREE;
6189 tree basetype = NULL_TREE;
6192 tree first_mem_arg = NULL_TREE;
6195 bool skip_first_for_error;
6196 VEC(tree,gc) *user_args;
6200 int template_only = 0;
6204 VEC(tree,gc) *orig_args = NULL;
6207 gcc_assert (instance != NULL_TREE);
6209 /* We don't know what function we're going to call, yet. */
6213 if (error_operand_p (instance)
6214 || error_operand_p (fns))
6215 return error_mark_node;
6217 if (!BASELINK_P (fns))
6219 if (complain & tf_error)
6220 error ("call to non-function %qD", fns);
6221 return error_mark_node;
6224 orig_instance = instance;
6227 /* Dismantle the baselink to collect all the information we need. */
6228 if (!conversion_path)
6229 conversion_path = BASELINK_BINFO (fns);
6230 access_binfo = BASELINK_ACCESS_BINFO (fns);
6231 optype = BASELINK_OPTYPE (fns);
6232 fns = BASELINK_FUNCTIONS (fns);
6233 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
6235 explicit_targs = TREE_OPERAND (fns, 1);
6236 fns = TREE_OPERAND (fns, 0);
6239 gcc_assert (TREE_CODE (fns) == FUNCTION_DECL
6240 || TREE_CODE (fns) == TEMPLATE_DECL
6241 || TREE_CODE (fns) == OVERLOAD);
6242 fn = get_first_fn (fns);
6243 name = DECL_NAME (fn);
6245 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (instance));
6246 gcc_assert (CLASS_TYPE_P (basetype));
6248 if (processing_template_decl)
6250 orig_args = args == NULL ? NULL : make_tree_vector_copy (*args);
6251 instance = build_non_dependent_expr (instance);
6253 make_args_non_dependent (*args);
6256 user_args = args == NULL ? NULL : *args;
6257 /* Under DR 147 A::A() is an invalid constructor call,
6258 not a functional cast. */
6259 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
6261 if (! (complain & tf_error))
6262 return error_mark_node;
6264 permerror (input_location,
6265 "cannot call constructor %<%T::%D%> directly",
6267 permerror (input_location, " for a function-style cast, remove the "
6268 "redundant %<::%D%>", name);
6269 call = build_functional_cast (basetype, build_tree_list_vec (user_args),
6274 /* Figure out whether to skip the first argument for the error
6275 message we will display to users if an error occurs. We don't
6276 want to display any compiler-generated arguments. The "this"
6277 pointer hasn't been added yet. However, we must remove the VTT
6278 pointer if this is a call to a base-class constructor or
6280 skip_first_for_error = false;
6281 if (IDENTIFIER_CTOR_OR_DTOR_P (name))
6283 /* Callers should explicitly indicate whether they want to construct
6284 the complete object or just the part without virtual bases. */
6285 gcc_assert (name != ctor_identifier);
6286 /* Similarly for destructors. */
6287 gcc_assert (name != dtor_identifier);
6288 /* Remove the VTT pointer, if present. */
6289 if ((name == base_ctor_identifier || name == base_dtor_identifier)
6290 && CLASSTYPE_VBASECLASSES (basetype))
6291 skip_first_for_error = true;
6294 /* Process the argument list. */
6295 if (args != NULL && *args != NULL)
6297 *args = resolve_args (*args);
6299 return error_mark_node;
6302 instance_ptr = build_this (instance);
6304 /* It's OK to call destructors and constructors on cv-qualified objects.
6305 Therefore, convert the INSTANCE_PTR to the unqualified type, if
6307 if (DECL_DESTRUCTOR_P (fn)
6308 || DECL_CONSTRUCTOR_P (fn))
6310 tree type = build_pointer_type (basetype);
6311 if (!same_type_p (type, TREE_TYPE (instance_ptr)))
6312 instance_ptr = build_nop (type, instance_ptr);
6314 if (DECL_DESTRUCTOR_P (fn))
6315 name = complete_dtor_identifier;
6317 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
6318 initializer, not T({ }). If the type doesn't have a list ctor,
6319 break apart the list into separate ctor args. */
6320 if (DECL_CONSTRUCTOR_P (fn) && args != NULL && !VEC_empty (tree, *args)
6321 && BRACE_ENCLOSED_INITIALIZER_P (VEC_index (tree, *args, 0))
6322 && CONSTRUCTOR_IS_DIRECT_INIT (VEC_index (tree, *args, 0))
6323 && !TYPE_HAS_LIST_CTOR (basetype))
6325 gcc_assert (VEC_length (tree, *args) == 1);
6326 *args = ctor_to_vec (VEC_index (tree, *args, 0));
6329 class_type = (conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE);
6330 first_mem_arg = instance_ptr;
6332 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6333 p = conversion_obstack_alloc (0);
6335 for (fn = fns; fn; fn = OVL_NEXT (fn))
6337 tree t = OVL_CURRENT (fn);
6338 tree this_first_arg;
6340 /* We can end up here for copy-init of same or base class. */
6341 if ((flags & LOOKUP_ONLYCONVERTING)
6342 && DECL_NONCONVERTING_P (t))
6345 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (t))
6346 this_first_arg = first_mem_arg;
6348 this_first_arg = NULL_TREE;
6350 if (TREE_CODE (t) == TEMPLATE_DECL)
6351 /* A member template. */
6352 add_template_candidate (&candidates, t,
6356 args == NULL ? NULL : *args,
6362 else if (! template_only)
6363 add_function_candidate (&candidates, t,
6366 args == NULL ? NULL : *args,
6372 candidates = splice_viable (candidates, pedantic, &any_viable_p);
6375 if (complain & tf_error)
6377 if (!COMPLETE_TYPE_P (basetype))
6378 cxx_incomplete_type_error (instance_ptr, basetype);
6385 pretty_name = name_as_c_string (name, basetype, &free_p);
6386 arglist = build_tree_list_vec (user_args);
6387 if (skip_first_for_error)
6388 arglist = TREE_CHAIN (arglist);
6389 error ("no matching function for call to %<%T::%s(%A)%#V%>",
6390 basetype, pretty_name, arglist,
6391 TREE_TYPE (TREE_TYPE (instance_ptr)));
6395 print_z_candidates (candidates);
6397 call = error_mark_node;
6401 cand = tourney (candidates);
6408 if (complain & tf_error)
6410 pretty_name = name_as_c_string (name, basetype, &free_p);
6411 arglist = build_tree_list_vec (user_args);
6412 if (skip_first_for_error)
6413 arglist = TREE_CHAIN (arglist);
6414 error ("call of overloaded %<%s(%A)%> is ambiguous", pretty_name,
6416 print_z_candidates (candidates);
6420 call = error_mark_node;
6426 if (!(flags & LOOKUP_NONVIRTUAL)
6427 && DECL_PURE_VIRTUAL_P (fn)
6428 && instance == current_class_ref
6429 && (DECL_CONSTRUCTOR_P (current_function_decl)
6430 || DECL_DESTRUCTOR_P (current_function_decl))
6431 && (complain & tf_warning))
6432 /* This is not an error, it is runtime undefined
6434 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl) ?
6435 "abstract virtual %q#D called from constructor"
6436 : "abstract virtual %q#D called from destructor"),
6439 if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE
6440 && is_dummy_object (instance_ptr))
6442 if (complain & tf_error)
6443 error ("cannot call member function %qD without object",
6445 call = error_mark_node;
6449 if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL)
6450 && resolves_to_fixed_type_p (instance, 0))
6451 flags |= LOOKUP_NONVIRTUAL;
6452 /* Now we know what function is being called. */
6455 /* Build the actual CALL_EXPR. */
6456 call = build_over_call (cand, flags, complain);
6457 /* In an expression of the form `a->f()' where `f' turns
6458 out to be a static member function, `a' is
6459 none-the-less evaluated. */
6460 if (TREE_CODE (TREE_TYPE (fn)) != METHOD_TYPE
6461 && !is_dummy_object (instance_ptr)
6462 && TREE_SIDE_EFFECTS (instance_ptr))
6463 call = build2 (COMPOUND_EXPR, TREE_TYPE (call),
6464 instance_ptr, call);
6465 else if (call != error_mark_node
6466 && DECL_DESTRUCTOR_P (cand->fn)
6467 && !VOID_TYPE_P (TREE_TYPE (call)))
6468 /* An explicit call of the form "x->~X()" has type
6469 "void". However, on platforms where destructors
6470 return "this" (i.e., those where
6471 targetm.cxx.cdtor_returns_this is true), such calls
6472 will appear to have a return value of pointer type
6473 to the low-level call machinery. We do not want to
6474 change the low-level machinery, since we want to be
6475 able to optimize "delete f()" on such platforms as
6476 "operator delete(~X(f()))" (rather than generating
6477 "t = f(), ~X(t), operator delete (t)"). */
6478 call = build_nop (void_type_node, call);
6483 if (processing_template_decl && call != error_mark_node)
6485 bool cast_to_void = false;
6487 if (TREE_CODE (call) == COMPOUND_EXPR)
6488 call = TREE_OPERAND (call, 1);
6489 else if (TREE_CODE (call) == NOP_EXPR)
6491 cast_to_void = true;
6492 call = TREE_OPERAND (call, 0);
6494 if (TREE_CODE (call) == INDIRECT_REF)
6495 call = TREE_OPERAND (call, 0);
6496 call = (build_min_non_dep_call_vec
6498 build_min (COMPONENT_REF, TREE_TYPE (CALL_EXPR_FN (call)),
6499 orig_instance, orig_fns, NULL_TREE),
6501 call = convert_from_reference (call);
6503 call = build_nop (void_type_node, call);
6506 /* Free all the conversions we allocated. */
6507 obstack_free (&conversion_obstack, p);
6509 if (orig_args != NULL)
6510 release_tree_vector (orig_args);
6515 /* Returns true iff standard conversion sequence ICS1 is a proper
6516 subsequence of ICS2. */
6519 is_subseq (conversion *ics1, conversion *ics2)
6521 /* We can assume that a conversion of the same code
6522 between the same types indicates a subsequence since we only get
6523 here if the types we are converting from are the same. */
6525 while (ics1->kind == ck_rvalue
6526 || ics1->kind == ck_lvalue)
6527 ics1 = ics1->u.next;
6531 while (ics2->kind == ck_rvalue
6532 || ics2->kind == ck_lvalue)
6533 ics2 = ics2->u.next;
6535 if (ics2->kind == ck_user
6536 || ics2->kind == ck_ambig
6537 || ics2->kind == ck_identity)
6538 /* At this point, ICS1 cannot be a proper subsequence of
6539 ICS2. We can get a USER_CONV when we are comparing the
6540 second standard conversion sequence of two user conversion
6544 ics2 = ics2->u.next;
6546 if (ics2->kind == ics1->kind
6547 && same_type_p (ics2->type, ics1->type)
6548 && same_type_p (ics2->u.next->type,
6549 ics1->u.next->type))
6554 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
6555 be any _TYPE nodes. */
6558 is_properly_derived_from (tree derived, tree base)
6560 if (!CLASS_TYPE_P (derived) || !CLASS_TYPE_P (base))
6563 /* We only allow proper derivation here. The DERIVED_FROM_P macro
6564 considers every class derived from itself. */
6565 return (!same_type_ignoring_top_level_qualifiers_p (derived, base)
6566 && DERIVED_FROM_P (base, derived));
6569 /* We build the ICS for an implicit object parameter as a pointer
6570 conversion sequence. However, such a sequence should be compared
6571 as if it were a reference conversion sequence. If ICS is the
6572 implicit conversion sequence for an implicit object parameter,
6573 modify it accordingly. */
6576 maybe_handle_implicit_object (conversion **ics)
6580 /* [over.match.funcs]
6582 For non-static member functions, the type of the
6583 implicit object parameter is "reference to cv X"
6584 where X is the class of which the function is a
6585 member and cv is the cv-qualification on the member
6586 function declaration. */
6587 conversion *t = *ics;
6588 tree reference_type;
6590 /* The `this' parameter is a pointer to a class type. Make the
6591 implicit conversion talk about a reference to that same class
6593 reference_type = TREE_TYPE (t->type);
6594 reference_type = build_reference_type (reference_type);
6596 if (t->kind == ck_qual)
6598 if (t->kind == ck_ptr)
6600 t = build_identity_conv (TREE_TYPE (t->type), NULL_TREE);
6601 t = direct_reference_binding (reference_type, t);
6603 t->rvaluedness_matches_p = 0;
6608 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
6609 and return the initial reference binding conversion. Otherwise,
6610 leave *ICS unchanged and return NULL. */
6613 maybe_handle_ref_bind (conversion **ics)
6615 if ((*ics)->kind == ck_ref_bind)
6617 conversion *old_ics = *ics;
6618 *ics = old_ics->u.next;
6619 (*ics)->user_conv_p = old_ics->user_conv_p;
6626 /* Compare two implicit conversion sequences according to the rules set out in
6627 [over.ics.rank]. Return values:
6629 1: ics1 is better than ics2
6630 -1: ics2 is better than ics1
6631 0: ics1 and ics2 are indistinguishable */
6634 compare_ics (conversion *ics1, conversion *ics2)
6640 tree deref_from_type1 = NULL_TREE;
6641 tree deref_from_type2 = NULL_TREE;
6642 tree deref_to_type1 = NULL_TREE;
6643 tree deref_to_type2 = NULL_TREE;
6644 conversion_rank rank1, rank2;
6646 /* REF_BINDING is nonzero if the result of the conversion sequence
6647 is a reference type. In that case REF_CONV is the reference
6648 binding conversion. */
6649 conversion *ref_conv1;
6650 conversion *ref_conv2;
6652 /* Handle implicit object parameters. */
6653 maybe_handle_implicit_object (&ics1);
6654 maybe_handle_implicit_object (&ics2);
6656 /* Handle reference parameters. */
6657 ref_conv1 = maybe_handle_ref_bind (&ics1);
6658 ref_conv2 = maybe_handle_ref_bind (&ics2);
6660 /* List-initialization sequence L1 is a better conversion sequence than
6661 list-initialization sequence L2 if L1 converts to
6662 std::initializer_list<X> for some X and L2 does not. */
6663 if (ics1->kind == ck_list && ics2->kind != ck_list)
6665 if (ics2->kind == ck_list && ics1->kind != ck_list)
6670 When comparing the basic forms of implicit conversion sequences (as
6671 defined in _over.best.ics_)
6673 --a standard conversion sequence (_over.ics.scs_) is a better
6674 conversion sequence than a user-defined conversion sequence
6675 or an ellipsis conversion sequence, and
6677 --a user-defined conversion sequence (_over.ics.user_) is a
6678 better conversion sequence than an ellipsis conversion sequence
6679 (_over.ics.ellipsis_). */
6680 rank1 = CONVERSION_RANK (ics1);
6681 rank2 = CONVERSION_RANK (ics2);
6685 else if (rank1 < rank2)
6688 if (rank1 == cr_bad)
6690 /* XXX Isn't this an extension? */
6691 /* Both ICS are bad. We try to make a decision based on what
6692 would have happened if they'd been good. */
6693 if (ics1->user_conv_p > ics2->user_conv_p
6694 || ics1->rank > ics2->rank)
6696 else if (ics1->user_conv_p < ics2->user_conv_p
6697 || ics1->rank < ics2->rank)
6700 /* We couldn't make up our minds; try to figure it out below. */
6703 if (ics1->ellipsis_p || ics1->kind == ck_list)
6704 /* Both conversions are ellipsis conversions or both are building a
6705 std::initializer_list. */
6708 /* User-defined conversion sequence U1 is a better conversion sequence
6709 than another user-defined conversion sequence U2 if they contain the
6710 same user-defined conversion operator or constructor and if the sec-
6711 ond standard conversion sequence of U1 is better than the second
6712 standard conversion sequence of U2. */
6714 if (ics1->user_conv_p)
6719 for (t1 = ics1; t1->kind != ck_user; t1 = t1->u.next)
6720 if (t1->kind == ck_ambig || t1->kind == ck_aggr)
6722 for (t2 = ics2; t2->kind != ck_user; t2 = t2->u.next)
6723 if (t2->kind == ck_ambig || t2->kind == ck_aggr)
6726 if (t1->cand->fn != t2->cand->fn)
6729 /* We can just fall through here, after setting up
6730 FROM_TYPE1 and FROM_TYPE2. */
6731 from_type1 = t1->type;
6732 from_type2 = t2->type;
6739 /* We're dealing with two standard conversion sequences.
6743 Standard conversion sequence S1 is a better conversion
6744 sequence than standard conversion sequence S2 if
6746 --S1 is a proper subsequence of S2 (comparing the conversion
6747 sequences in the canonical form defined by _over.ics.scs_,
6748 excluding any Lvalue Transformation; the identity
6749 conversion sequence is considered to be a subsequence of
6750 any non-identity conversion sequence */
6753 while (t1->kind != ck_identity)
6755 from_type1 = t1->type;
6758 while (t2->kind != ck_identity)
6760 from_type2 = t2->type;
6763 /* One sequence can only be a subsequence of the other if they start with
6764 the same type. They can start with different types when comparing the
6765 second standard conversion sequence in two user-defined conversion
6767 if (same_type_p (from_type1, from_type2))
6769 if (is_subseq (ics1, ics2))
6771 if (is_subseq (ics2, ics1))
6779 --the rank of S1 is better than the rank of S2 (by the rules
6782 Standard conversion sequences are ordered by their ranks: an Exact
6783 Match is a better conversion than a Promotion, which is a better
6784 conversion than a Conversion.
6786 Two conversion sequences with the same rank are indistinguishable
6787 unless one of the following rules applies:
6789 --A conversion that is not a conversion of a pointer, or pointer
6790 to member, to bool is better than another conversion that is such
6793 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
6794 so that we do not have to check it explicitly. */
6795 if (ics1->rank < ics2->rank)
6797 else if (ics2->rank < ics1->rank)
6800 to_type1 = ics1->type;
6801 to_type2 = ics2->type;
6803 /* A conversion from scalar arithmetic type to complex is worse than a
6804 conversion between scalar arithmetic types. */
6805 if (same_type_p (from_type1, from_type2)
6806 && ARITHMETIC_TYPE_P (from_type1)
6807 && ARITHMETIC_TYPE_P (to_type1)
6808 && ARITHMETIC_TYPE_P (to_type2)
6809 && ((TREE_CODE (to_type1) == COMPLEX_TYPE)
6810 != (TREE_CODE (to_type2) == COMPLEX_TYPE)))
6812 if (TREE_CODE (to_type1) == COMPLEX_TYPE)
6818 if (TYPE_PTR_P (from_type1)
6819 && TYPE_PTR_P (from_type2)
6820 && TYPE_PTR_P (to_type1)
6821 && TYPE_PTR_P (to_type2))
6823 deref_from_type1 = TREE_TYPE (from_type1);
6824 deref_from_type2 = TREE_TYPE (from_type2);
6825 deref_to_type1 = TREE_TYPE (to_type1);
6826 deref_to_type2 = TREE_TYPE (to_type2);
6828 /* The rules for pointers to members A::* are just like the rules
6829 for pointers A*, except opposite: if B is derived from A then
6830 A::* converts to B::*, not vice versa. For that reason, we
6831 switch the from_ and to_ variables here. */
6832 else if ((TYPE_PTRMEM_P (from_type1) && TYPE_PTRMEM_P (from_type2)
6833 && TYPE_PTRMEM_P (to_type1) && TYPE_PTRMEM_P (to_type2))
6834 || (TYPE_PTRMEMFUNC_P (from_type1)
6835 && TYPE_PTRMEMFUNC_P (from_type2)
6836 && TYPE_PTRMEMFUNC_P (to_type1)
6837 && TYPE_PTRMEMFUNC_P (to_type2)))
6839 deref_to_type1 = TYPE_PTRMEM_CLASS_TYPE (from_type1);
6840 deref_to_type2 = TYPE_PTRMEM_CLASS_TYPE (from_type2);
6841 deref_from_type1 = TYPE_PTRMEM_CLASS_TYPE (to_type1);
6842 deref_from_type2 = TYPE_PTRMEM_CLASS_TYPE (to_type2);
6845 if (deref_from_type1 != NULL_TREE
6846 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1))
6847 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2)))
6849 /* This was one of the pointer or pointer-like conversions.
6853 --If class B is derived directly or indirectly from class A,
6854 conversion of B* to A* is better than conversion of B* to
6855 void*, and conversion of A* to void* is better than
6856 conversion of B* to void*. */
6857 if (TREE_CODE (deref_to_type1) == VOID_TYPE
6858 && TREE_CODE (deref_to_type2) == VOID_TYPE)
6860 if (is_properly_derived_from (deref_from_type1,
6863 else if (is_properly_derived_from (deref_from_type2,
6867 else if (TREE_CODE (deref_to_type1) == VOID_TYPE
6868 || TREE_CODE (deref_to_type2) == VOID_TYPE)
6870 if (same_type_p (deref_from_type1, deref_from_type2))
6872 if (TREE_CODE (deref_to_type2) == VOID_TYPE)
6874 if (is_properly_derived_from (deref_from_type1,
6878 /* We know that DEREF_TO_TYPE1 is `void' here. */
6879 else if (is_properly_derived_from (deref_from_type1,
6884 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1))
6885 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2)))
6889 --If class B is derived directly or indirectly from class A
6890 and class C is derived directly or indirectly from B,
6892 --conversion of C* to B* is better than conversion of C* to
6895 --conversion of B* to A* is better than conversion of C* to
6897 if (same_type_p (deref_from_type1, deref_from_type2))
6899 if (is_properly_derived_from (deref_to_type1,
6902 else if (is_properly_derived_from (deref_to_type2,
6906 else if (same_type_p (deref_to_type1, deref_to_type2))
6908 if (is_properly_derived_from (deref_from_type2,
6911 else if (is_properly_derived_from (deref_from_type1,
6917 else if (CLASS_TYPE_P (non_reference (from_type1))
6918 && same_type_p (from_type1, from_type2))
6920 tree from = non_reference (from_type1);
6924 --binding of an expression of type C to a reference of type
6925 B& is better than binding an expression of type C to a
6926 reference of type A&
6928 --conversion of C to B is better than conversion of C to A, */
6929 if (is_properly_derived_from (from, to_type1)
6930 && is_properly_derived_from (from, to_type2))
6932 if (is_properly_derived_from (to_type1, to_type2))
6934 else if (is_properly_derived_from (to_type2, to_type1))
6938 else if (CLASS_TYPE_P (non_reference (to_type1))
6939 && same_type_p (to_type1, to_type2))
6941 tree to = non_reference (to_type1);
6945 --binding of an expression of type B to a reference of type
6946 A& is better than binding an expression of type C to a
6947 reference of type A&,
6949 --conversion of B to A is better than conversion of C to A */
6950 if (is_properly_derived_from (from_type1, to)
6951 && is_properly_derived_from (from_type2, to))
6953 if (is_properly_derived_from (from_type2, from_type1))
6955 else if (is_properly_derived_from (from_type1, from_type2))
6962 --S1 and S2 differ only in their qualification conversion and yield
6963 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
6964 qualification signature of type T1 is a proper subset of the cv-
6965 qualification signature of type T2 */
6966 if (ics1->kind == ck_qual
6967 && ics2->kind == ck_qual
6968 && same_type_p (from_type1, from_type2))
6970 int result = comp_cv_qual_signature (to_type1, to_type2);
6977 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
6978 to an implicit object parameter, and either S1 binds an lvalue reference
6979 to an lvalue and S2 binds an rvalue reference or S1 binds an rvalue
6980 reference to an rvalue and S2 binds an lvalue reference
6981 (C++0x draft standard, 13.3.3.2)
6983 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
6984 types to which the references refer are the same type except for
6985 top-level cv-qualifiers, and the type to which the reference
6986 initialized by S2 refers is more cv-qualified than the type to
6987 which the reference initialized by S1 refers */
6989 if (ref_conv1 && ref_conv2)
6991 if (!ref_conv1->this_p && !ref_conv2->this_p
6992 && (TYPE_REF_IS_RVALUE (ref_conv1->type)
6993 != TYPE_REF_IS_RVALUE (ref_conv2->type)))
6995 if (ref_conv1->rvaluedness_matches_p)
6997 if (ref_conv2->rvaluedness_matches_p)
7001 if (same_type_ignoring_top_level_qualifiers_p (to_type1, to_type2))
7002 return comp_cv_qualification (TREE_TYPE (ref_conv2->type),
7003 TREE_TYPE (ref_conv1->type));
7006 /* Neither conversion sequence is better than the other. */
7010 /* The source type for this standard conversion sequence. */
7013 source_type (conversion *t)
7015 for (;; t = t->u.next)
7017 if (t->kind == ck_user
7018 || t->kind == ck_ambig
7019 || t->kind == ck_identity)
7025 /* Note a warning about preferring WINNER to LOSER. We do this by storing
7026 a pointer to LOSER and re-running joust to produce the warning if WINNER
7027 is actually used. */
7030 add_warning (struct z_candidate *winner, struct z_candidate *loser)
7032 candidate_warning *cw = (candidate_warning *)
7033 conversion_obstack_alloc (sizeof (candidate_warning));
7035 cw->next = winner->warnings;
7036 winner->warnings = cw;
7039 /* Compare two candidates for overloading as described in
7040 [over.match.best]. Return values:
7042 1: cand1 is better than cand2
7043 -1: cand2 is better than cand1
7044 0: cand1 and cand2 are indistinguishable */
7047 joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn)
7050 int off1 = 0, off2 = 0;
7054 /* Candidates that involve bad conversions are always worse than those
7056 if (cand1->viable > cand2->viable)
7058 if (cand1->viable < cand2->viable)
7061 /* If we have two pseudo-candidates for conversions to the same type,
7062 or two candidates for the same function, arbitrarily pick one. */
7063 if (cand1->fn == cand2->fn
7064 && (IS_TYPE_OR_DECL_P (cand1->fn)))
7067 /* a viable function F1
7068 is defined to be a better function than another viable function F2 if
7069 for all arguments i, ICSi(F1) is not a worse conversion sequence than
7070 ICSi(F2), and then */
7072 /* for some argument j, ICSj(F1) is a better conversion sequence than
7075 /* For comparing static and non-static member functions, we ignore
7076 the implicit object parameter of the non-static function. The
7077 standard says to pretend that the static function has an object
7078 parm, but that won't work with operator overloading. */
7079 len = cand1->num_convs;
7080 if (len != cand2->num_convs)
7082 int static_1 = DECL_STATIC_FUNCTION_P (cand1->fn);
7083 int static_2 = DECL_STATIC_FUNCTION_P (cand2->fn);
7085 gcc_assert (static_1 != static_2);
7096 for (i = 0; i < len; ++i)
7098 conversion *t1 = cand1->convs[i + off1];
7099 conversion *t2 = cand2->convs[i + off2];
7100 int comp = compare_ics (t1, t2);
7105 && (CONVERSION_RANK (t1) + CONVERSION_RANK (t2)
7106 == cr_std + cr_promotion)
7107 && t1->kind == ck_std
7108 && t2->kind == ck_std
7109 && TREE_CODE (t1->type) == INTEGER_TYPE
7110 && TREE_CODE (t2->type) == INTEGER_TYPE
7111 && (TYPE_PRECISION (t1->type)
7112 == TYPE_PRECISION (t2->type))
7113 && (TYPE_UNSIGNED (t1->u.next->type)
7114 || (TREE_CODE (t1->u.next->type)
7117 tree type = t1->u.next->type;
7119 struct z_candidate *w, *l;
7121 type1 = t1->type, type2 = t2->type,
7122 w = cand1, l = cand2;
7124 type1 = t2->type, type2 = t1->type,
7125 w = cand2, l = cand1;
7129 warning (OPT_Wsign_promo, "passing %qT chooses %qT over %qT",
7130 type, type1, type2);
7131 warning (OPT_Wsign_promo, " in call to %qD", w->fn);
7137 if (winner && comp != winner)
7146 /* warn about confusing overload resolution for user-defined conversions,
7147 either between a constructor and a conversion op, or between two
7149 if (winner && warn_conversion && cand1->second_conv
7150 && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn))
7151 && winner != compare_ics (cand1->second_conv, cand2->second_conv))
7153 struct z_candidate *w, *l;
7154 bool give_warning = false;
7157 w = cand1, l = cand2;
7159 w = cand2, l = cand1;
7161 /* We don't want to complain about `X::operator T1 ()'
7162 beating `X::operator T2 () const', when T2 is a no less
7163 cv-qualified version of T1. */
7164 if (DECL_CONTEXT (w->fn) == DECL_CONTEXT (l->fn)
7165 && !DECL_CONSTRUCTOR_P (w->fn) && !DECL_CONSTRUCTOR_P (l->fn))
7167 tree t = TREE_TYPE (TREE_TYPE (l->fn));
7168 tree f = TREE_TYPE (TREE_TYPE (w->fn));
7170 if (TREE_CODE (t) == TREE_CODE (f) && POINTER_TYPE_P (t))
7175 if (!comp_ptr_ttypes (t, f))
7176 give_warning = true;
7179 give_warning = true;
7185 tree source = source_type (w->convs[0]);
7186 if (! DECL_CONSTRUCTOR_P (w->fn))
7187 source = TREE_TYPE (source);
7188 if (warning (OPT_Wconversion, "choosing %qD over %qD", w->fn, l->fn)
7189 && warning (OPT_Wconversion, " for conversion from %qT to %qT",
7190 source, w->second_conv->type))
7192 inform (input_location, " because conversion sequence for the argument is better");
7203 F1 is a non-template function and F2 is a template function
7206 if (!cand1->template_decl && cand2->template_decl)
7208 else if (cand1->template_decl && !cand2->template_decl)
7212 F1 and F2 are template functions and the function template for F1 is
7213 more specialized than the template for F2 according to the partial
7216 if (cand1->template_decl && cand2->template_decl)
7218 winner = more_specialized_fn
7219 (TI_TEMPLATE (cand1->template_decl),
7220 TI_TEMPLATE (cand2->template_decl),
7221 /* [temp.func.order]: The presence of unused ellipsis and default
7222 arguments has no effect on the partial ordering of function
7223 templates. add_function_candidate() will not have
7224 counted the "this" argument for constructors. */
7225 cand1->num_convs + DECL_CONSTRUCTOR_P (cand1->fn));
7231 the context is an initialization by user-defined conversion (see
7232 _dcl.init_ and _over.match.user_) and the standard conversion
7233 sequence from the return type of F1 to the destination type (i.e.,
7234 the type of the entity being initialized) is a better conversion
7235 sequence than the standard conversion sequence from the return type
7236 of F2 to the destination type. */
7238 if (cand1->second_conv)
7240 winner = compare_ics (cand1->second_conv, cand2->second_conv);
7245 /* Check whether we can discard a builtin candidate, either because we
7246 have two identical ones or matching builtin and non-builtin candidates.
7248 (Pedantically in the latter case the builtin which matched the user
7249 function should not be added to the overload set, but we spot it here.
7252 ... the builtin candidates include ...
7253 - do not have the same parameter type list as any non-template
7254 non-member candidate. */
7256 if (TREE_CODE (cand1->fn) == IDENTIFIER_NODE
7257 || TREE_CODE (cand2->fn) == IDENTIFIER_NODE)
7259 for (i = 0; i < len; ++i)
7260 if (!same_type_p (cand1->convs[i]->type,
7261 cand2->convs[i]->type))
7263 if (i == cand1->num_convs)
7265 if (cand1->fn == cand2->fn)
7266 /* Two built-in candidates; arbitrarily pick one. */
7268 else if (TREE_CODE (cand1->fn) == IDENTIFIER_NODE)
7269 /* cand1 is built-in; prefer cand2. */
7272 /* cand2 is built-in; prefer cand1. */
7277 /* If the two function declarations represent the same function (this can
7278 happen with declarations in multiple scopes and arg-dependent lookup),
7279 arbitrarily choose one. But first make sure the default args we're
7281 if (DECL_P (cand1->fn) && DECL_P (cand2->fn)
7282 && equal_functions (cand1->fn, cand2->fn))
7284 tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (cand1->fn));
7285 tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (cand2->fn));
7287 gcc_assert (!DECL_CONSTRUCTOR_P (cand1->fn));
7289 for (i = 0; i < len; ++i)
7291 /* Don't crash if the fn is variadic. */
7294 parms1 = TREE_CHAIN (parms1);
7295 parms2 = TREE_CHAIN (parms2);
7299 parms1 = TREE_CHAIN (parms1);
7301 parms2 = TREE_CHAIN (parms2);
7305 if (!cp_tree_equal (TREE_PURPOSE (parms1),
7306 TREE_PURPOSE (parms2)))
7310 permerror (input_location, "default argument mismatch in "
7311 "overload resolution");
7312 inform (input_location,
7313 " candidate 1: %q+#F", cand1->fn);
7314 inform (input_location,
7315 " candidate 2: %q+#F", cand2->fn);
7318 add_warning (cand1, cand2);
7321 parms1 = TREE_CHAIN (parms1);
7322 parms2 = TREE_CHAIN (parms2);
7330 /* Extension: If the worst conversion for one candidate is worse than the
7331 worst conversion for the other, take the first. */
7334 conversion_rank rank1 = cr_identity, rank2 = cr_identity;
7335 struct z_candidate *w = 0, *l = 0;
7337 for (i = 0; i < len; ++i)
7339 if (CONVERSION_RANK (cand1->convs[i+off1]) > rank1)
7340 rank1 = CONVERSION_RANK (cand1->convs[i+off1]);
7341 if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2)
7342 rank2 = CONVERSION_RANK (cand2->convs[i + off2]);
7345 winner = 1, w = cand1, l = cand2;
7347 winner = -1, w = cand2, l = cand1;
7352 pedwarn (input_location, 0,
7353 "ISO C++ says that these are ambiguous, even "
7354 "though the worst conversion for the first is better than "
7355 "the worst conversion for the second:");
7356 print_z_candidate (_("candidate 1:"), w);
7357 print_z_candidate (_("candidate 2:"), l);
7365 gcc_assert (!winner);
7369 /* Given a list of candidates for overloading, find the best one, if any.
7370 This algorithm has a worst case of O(2n) (winner is last), and a best
7371 case of O(n/2) (totally ambiguous); much better than a sorting
7374 static struct z_candidate *
7375 tourney (struct z_candidate *candidates)
7377 struct z_candidate *champ = candidates, *challenger;
7379 int champ_compared_to_predecessor = 0;
7381 /* Walk through the list once, comparing each current champ to the next
7382 candidate, knocking out a candidate or two with each comparison. */
7384 for (challenger = champ->next; challenger; )
7386 fate = joust (champ, challenger, 0);
7388 challenger = challenger->next;
7393 champ = challenger->next;
7396 champ_compared_to_predecessor = 0;
7401 champ_compared_to_predecessor = 1;
7404 challenger = champ->next;
7408 /* Make sure the champ is better than all the candidates it hasn't yet
7409 been compared to. */
7411 for (challenger = candidates;
7413 && !(champ_compared_to_predecessor && challenger->next == champ);
7414 challenger = challenger->next)
7416 fate = joust (champ, challenger, 0);
7424 /* Returns nonzero if things of type FROM can be converted to TO. */
7427 can_convert (tree to, tree from)
7429 return can_convert_arg (to, from, NULL_TREE, LOOKUP_IMPLICIT);
7432 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
7435 can_convert_arg (tree to, tree from, tree arg, int flags)
7441 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7442 p = conversion_obstack_alloc (0);
7444 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
7446 ok_p = (t && !t->bad_p);
7448 /* Free all the conversions we allocated. */
7449 obstack_free (&conversion_obstack, p);
7454 /* Like can_convert_arg, but allows dubious conversions as well. */
7457 can_convert_arg_bad (tree to, tree from, tree arg, int flags)
7462 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7463 p = conversion_obstack_alloc (0);
7464 /* Try to perform the conversion. */
7465 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
7467 /* Free all the conversions we allocated. */
7468 obstack_free (&conversion_obstack, p);
7473 /* Convert EXPR to TYPE. Return the converted expression.
7475 Note that we allow bad conversions here because by the time we get to
7476 this point we are committed to doing the conversion. If we end up
7477 doing a bad conversion, convert_like will complain. */
7480 perform_implicit_conversion_flags (tree type, tree expr, tsubst_flags_t complain, int flags)
7485 if (error_operand_p (expr))
7486 return error_mark_node;
7488 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7489 p = conversion_obstack_alloc (0);
7491 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
7497 if (complain & tf_error)
7499 /* If expr has unknown type, then it is an overloaded function.
7500 Call instantiate_type to get good error messages. */
7501 if (TREE_TYPE (expr) == unknown_type_node)
7502 instantiate_type (type, expr, complain);
7503 else if (invalid_nonstatic_memfn_p (expr, complain))
7504 /* We gave an error. */;
7506 error ("could not convert %qE to %qT", expr, type);
7508 expr = error_mark_node;
7510 else if (processing_template_decl)
7512 /* In a template, we are only concerned about determining the
7513 type of non-dependent expressions, so we do not have to
7514 perform the actual conversion. */
7515 if (TREE_TYPE (expr) != type)
7516 expr = build_nop (type, expr);
7519 expr = convert_like (conv, expr, complain);
7521 /* Free all the conversions we allocated. */
7522 obstack_free (&conversion_obstack, p);
7528 perform_implicit_conversion (tree type, tree expr, tsubst_flags_t complain)
7530 return perform_implicit_conversion_flags (type, expr, complain, LOOKUP_IMPLICIT);
7533 /* Convert EXPR to TYPE (as a direct-initialization) if that is
7534 permitted. If the conversion is valid, the converted expression is
7535 returned. Otherwise, NULL_TREE is returned, except in the case
7536 that TYPE is a class type; in that case, an error is issued. If
7537 C_CAST_P is true, then this direction initialization is taking
7538 place as part of a static_cast being attempted as part of a C-style
7542 perform_direct_initialization_if_possible (tree type,
7545 tsubst_flags_t complain)
7550 if (type == error_mark_node || error_operand_p (expr))
7551 return error_mark_node;
7554 If the destination type is a (possibly cv-qualified) class type:
7556 -- If the initialization is direct-initialization ...,
7557 constructors are considered. ... If no constructor applies, or
7558 the overload resolution is ambiguous, the initialization is
7560 if (CLASS_TYPE_P (type))
7562 VEC(tree,gc) *args = make_tree_vector_single (expr);
7563 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
7564 &args, type, LOOKUP_NORMAL, complain);
7565 release_tree_vector (args);
7566 return build_cplus_new (type, expr);
7569 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7570 p = conversion_obstack_alloc (0);
7572 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
7575 if (!conv || conv->bad_p)
7578 expr = convert_like_real (conv, expr, NULL_TREE, 0, 0,
7579 /*issue_conversion_warnings=*/false,
7581 tf_warning_or_error);
7583 /* Free all the conversions we allocated. */
7584 obstack_free (&conversion_obstack, p);
7589 /* DECL is a VAR_DECL whose type is a REFERENCE_TYPE. The reference
7590 is being bound to a temporary. Create and return a new VAR_DECL
7591 with the indicated TYPE; this variable will store the value to
7592 which the reference is bound. */
7595 make_temporary_var_for_ref_to_temp (tree decl, tree type)
7599 /* Create the variable. */
7600 var = create_temporary_var (type);
7602 /* Register the variable. */
7603 if (TREE_STATIC (decl))
7605 /* Namespace-scope or local static; give it a mangled name. */
7608 TREE_STATIC (var) = 1;
7609 name = mangle_ref_init_variable (decl);
7610 DECL_NAME (var) = name;
7611 SET_DECL_ASSEMBLER_NAME (var, name);
7612 var = pushdecl_top_level (var);
7615 /* Create a new cleanup level if necessary. */
7616 maybe_push_cleanup_level (type);
7621 /* EXPR is the initializer for a variable DECL of reference or
7622 std::initializer_list type. Create, push and return a new VAR_DECL
7623 for the initializer so that it will live as long as DECL. Any
7624 cleanup for the new variable is returned through CLEANUP, and the
7625 code to initialize the new variable is returned through INITP. */
7628 set_up_extended_ref_temp (tree decl, tree expr, tree *cleanup, tree *initp)
7634 /* Create the temporary variable. */
7635 type = TREE_TYPE (expr);
7636 var = make_temporary_var_for_ref_to_temp (decl, type);
7637 layout_decl (var, 0);
7638 /* If the rvalue is the result of a function call it will be
7639 a TARGET_EXPR. If it is some other construct (such as a
7640 member access expression where the underlying object is
7641 itself the result of a function call), turn it into a
7642 TARGET_EXPR here. It is important that EXPR be a
7643 TARGET_EXPR below since otherwise the INIT_EXPR will
7644 attempt to make a bitwise copy of EXPR to initialize
7646 if (TREE_CODE (expr) != TARGET_EXPR)
7647 expr = get_target_expr (expr);
7648 /* Create the INIT_EXPR that will initialize the temporary
7650 init = build2 (INIT_EXPR, type, var, expr);
7651 if (at_function_scope_p ())
7653 add_decl_expr (var);
7655 if (TREE_STATIC (var))
7656 init = add_stmt_to_compound (init, register_dtor_fn (var));
7658 *cleanup = cxx_maybe_build_cleanup (var);
7660 /* We must be careful to destroy the temporary only
7661 after its initialization has taken place. If the
7662 initialization throws an exception, then the
7663 destructor should not be run. We cannot simply
7664 transform INIT into something like:
7666 (INIT, ({ CLEANUP_STMT; }))
7668 because emit_local_var always treats the
7669 initializer as a full-expression. Thus, the
7670 destructor would run too early; it would run at the
7671 end of initializing the reference variable, rather
7672 than at the end of the block enclosing the
7675 The solution is to pass back a cleanup expression
7676 which the caller is responsible for attaching to
7677 the statement tree. */
7681 rest_of_decl_compilation (var, /*toplev=*/1, at_eof);
7682 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
7683 static_aggregates = tree_cons (NULL_TREE, var,
7691 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
7692 initializing a variable of that TYPE. If DECL is non-NULL, it is
7693 the VAR_DECL being initialized with the EXPR. (In that case, the
7694 type of DECL will be TYPE.) If DECL is non-NULL, then CLEANUP must
7695 also be non-NULL, and with *CLEANUP initialized to NULL. Upon
7696 return, if *CLEANUP is no longer NULL, it will be an expression
7697 that should be pushed as a cleanup after the returned expression
7698 is used to initialize DECL.
7700 Return the converted expression. */
7703 initialize_reference (tree type, tree expr, tree decl, tree *cleanup,
7704 tsubst_flags_t complain)
7709 if (type == error_mark_node || error_operand_p (expr))
7710 return error_mark_node;
7712 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7713 p = conversion_obstack_alloc (0);
7715 conv = reference_binding (type, TREE_TYPE (expr), expr, /*c_cast_p=*/false,
7717 if (!conv || conv->bad_p)
7719 if (complain & tf_error)
7721 if (!(TYPE_QUALS (TREE_TYPE (type)) & TYPE_QUAL_CONST)
7722 && !TYPE_REF_IS_RVALUE (type)
7723 && !real_lvalue_p (expr))
7724 error ("invalid initialization of non-const reference of "
7725 "type %qT from an rvalue of type %qT",
7726 type, TREE_TYPE (expr));
7728 error ("invalid initialization of reference of type "
7729 "%qT from expression of type %qT", type,
7732 return error_mark_node;
7735 /* If DECL is non-NULL, then this special rule applies:
7739 The temporary to which the reference is bound or the temporary
7740 that is the complete object to which the reference is bound
7741 persists for the lifetime of the reference.
7743 The temporaries created during the evaluation of the expression
7744 initializing the reference, except the temporary to which the
7745 reference is bound, are destroyed at the end of the
7746 full-expression in which they are created.
7748 In that case, we store the converted expression into a new
7749 VAR_DECL in a new scope.
7751 However, we want to be careful not to create temporaries when
7752 they are not required. For example, given:
7755 struct D : public B {};
7759 there is no need to copy the return value from "f"; we can just
7760 extend its lifetime. Similarly, given:
7763 struct T { operator S(); };
7767 we can extend the lifetime of the return value of the conversion
7769 gcc_assert (conv->kind == ck_ref_bind);
7773 tree base_conv_type;
7775 /* Skip over the REF_BIND. */
7776 conv = conv->u.next;
7777 /* If the next conversion is a BASE_CONV, skip that too -- but
7778 remember that the conversion was required. */
7779 if (conv->kind == ck_base)
7781 base_conv_type = conv->type;
7782 conv = conv->u.next;
7785 base_conv_type = NULL_TREE;
7786 /* Perform the remainder of the conversion. */
7787 expr = convert_like_real (conv, expr,
7788 /*fn=*/NULL_TREE, /*argnum=*/0,
7790 /*issue_conversion_warnings=*/true,
7792 tf_warning_or_error);
7793 if (error_operand_p (expr))
7794 expr = error_mark_node;
7797 if (!lvalue_or_rvalue_with_address_p (expr))
7800 var = set_up_extended_ref_temp (decl, expr, cleanup, &init);
7801 /* Use its address to initialize the reference variable. */
7802 expr = build_address (var);
7804 expr = convert_to_base (expr,
7805 build_pointer_type (base_conv_type),
7806 /*check_access=*/true,
7808 expr = build2 (COMPOUND_EXPR, TREE_TYPE (expr), init, expr);
7811 /* Take the address of EXPR. */
7812 expr = cp_build_unary_op (ADDR_EXPR, expr, 0, tf_warning_or_error);
7813 /* If a BASE_CONV was required, perform it now. */
7815 expr = (perform_implicit_conversion
7816 (build_pointer_type (base_conv_type), expr,
7817 tf_warning_or_error));
7818 expr = build_nop (type, expr);
7822 /* Perform the conversion. */
7823 expr = convert_like (conv, expr, tf_warning_or_error);
7825 /* Free all the conversions we allocated. */
7826 obstack_free (&conversion_obstack, p);
7831 /* Returns true iff TYPE is some variant of std::initializer_list. */
7834 is_std_init_list (tree type)
7836 return (CLASS_TYPE_P (type)
7837 && CP_TYPE_CONTEXT (type) == std_node
7838 && strcmp (TYPE_NAME_STRING (type), "initializer_list") == 0);
7841 /* Returns true iff DECL is a list constructor: i.e. a constructor which
7842 will accept an argument list of a single std::initializer_list<T>. */
7845 is_list_ctor (tree decl)
7847 tree args = FUNCTION_FIRST_USER_PARMTYPE (decl);
7850 if (!args || args == void_list_node)
7853 arg = non_reference (TREE_VALUE (args));
7854 if (!is_std_init_list (arg))
7857 args = TREE_CHAIN (args);
7859 if (args && args != void_list_node && !TREE_PURPOSE (args))
7860 /* There are more non-defaulted parms. */
7866 #include "gt-cp-call.h"