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,
5 Free Software Foundation, Inc.
6 Contributed by Michael Tiemann (tiemann@cygnus.com) and
7 modified by Brendan Kehoe (brendan@cygnus.com).
9 This file is part of GCC.
11 GCC is free software; you can redistribute it and/or modify
12 it under the terms of the GNU General Public License as published by
13 the Free Software Foundation; either version 3, or (at your option)
16 GCC is distributed in the hope that it will be useful,
17 but WITHOUT ANY WARRANTY; without even the implied warranty of
18 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 GNU General Public License for more details.
21 You should have received a copy of the GNU General Public License
22 along with GCC; see the file COPYING3. If not see
23 <http://www.gnu.org/licenses/>. */
26 /* High-level class interface. */
30 #include "coretypes.h"
37 #include "diagnostic-core.h"
41 #include "langhooks.h"
42 #include "c-family/c-objc.h"
45 /* The various kinds of conversion. */
47 typedef enum conversion_kind {
63 /* The rank of the conversion. Order of the enumerals matters; better
64 conversions should come earlier in the list. */
66 typedef enum conversion_rank {
77 /* An implicit conversion sequence, in the sense of [over.best.ics].
78 The first conversion to be performed is at the end of the chain.
79 That conversion is always a cr_identity conversion. */
81 typedef struct conversion conversion;
83 /* The kind of conversion represented by this step. */
85 /* The rank of this conversion. */
87 BOOL_BITFIELD user_conv_p : 1;
88 BOOL_BITFIELD ellipsis_p : 1;
89 BOOL_BITFIELD this_p : 1;
90 /* True if this conversion would be permitted with a bending of
91 language standards, e.g. disregarding pointer qualifiers or
92 converting integers to pointers. */
93 BOOL_BITFIELD bad_p : 1;
94 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
95 temporary should be created to hold the result of the
97 BOOL_BITFIELD need_temporary_p : 1;
98 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
99 from a pointer-to-derived to pointer-to-base is being performed. */
100 BOOL_BITFIELD base_p : 1;
101 /* If KIND is ck_ref_bind, true when either an lvalue reference is
102 being bound to an lvalue expression or an rvalue reference is
103 being bound to an rvalue expression. If KIND is ck_rvalue,
104 true when we should treat an lvalue as an rvalue (12.8p33). If
105 KIND is ck_base, always false. */
106 BOOL_BITFIELD rvaluedness_matches_p: 1;
107 BOOL_BITFIELD check_narrowing: 1;
108 /* The type of the expression resulting from the conversion. */
111 /* The next conversion in the chain. Since the conversions are
112 arranged from outermost to innermost, the NEXT conversion will
113 actually be performed before this conversion. This variant is
114 used only when KIND is neither ck_identity nor ck_ambig. */
116 /* The expression at the beginning of the conversion chain. This
117 variant is used only if KIND is ck_identity or ck_ambig. */
119 /* The array of conversions for an initializer_list. */
122 /* The function candidate corresponding to this conversion
123 sequence. This field is only used if KIND is ck_user. */
124 struct z_candidate *cand;
127 #define CONVERSION_RANK(NODE) \
128 ((NODE)->bad_p ? cr_bad \
129 : (NODE)->ellipsis_p ? cr_ellipsis \
130 : (NODE)->user_conv_p ? cr_user \
133 #define BAD_CONVERSION_RANK(NODE) \
134 ((NODE)->ellipsis_p ? cr_ellipsis \
135 : (NODE)->user_conv_p ? cr_user \
138 static struct obstack conversion_obstack;
139 static bool conversion_obstack_initialized;
140 struct rejection_reason;
142 static struct z_candidate * tourney (struct z_candidate *);
143 static int equal_functions (tree, tree);
144 static int joust (struct z_candidate *, struct z_candidate *, bool);
145 static int compare_ics (conversion *, conversion *);
146 static tree build_over_call (struct z_candidate *, int, tsubst_flags_t);
147 static tree build_java_interface_fn_ref (tree, tree);
148 #define convert_like(CONV, EXPR, COMPLAIN) \
149 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
150 /*issue_conversion_warnings=*/true, \
151 /*c_cast_p=*/false, (COMPLAIN))
152 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
153 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
154 /*issue_conversion_warnings=*/true, \
155 /*c_cast_p=*/false, (COMPLAIN))
156 static tree convert_like_real (conversion *, tree, tree, int, int, bool,
157 bool, tsubst_flags_t);
158 static void op_error (enum tree_code, enum tree_code, tree, tree,
160 static struct z_candidate *build_user_type_conversion_1 (tree, tree, int);
161 static void print_z_candidate (const char *, struct z_candidate *);
162 static void print_z_candidates (location_t, struct z_candidate *);
163 static tree build_this (tree);
164 static struct z_candidate *splice_viable (struct z_candidate *, bool, bool *);
165 static bool any_strictly_viable (struct z_candidate *);
166 static struct z_candidate *add_template_candidate
167 (struct z_candidate **, tree, tree, tree, tree, const VEC(tree,gc) *,
168 tree, tree, tree, int, unification_kind_t);
169 static struct z_candidate *add_template_candidate_real
170 (struct z_candidate **, tree, tree, tree, tree, const VEC(tree,gc) *,
171 tree, tree, tree, int, tree, unification_kind_t);
172 static struct z_candidate *add_template_conv_candidate
173 (struct z_candidate **, tree, tree, tree, const VEC(tree,gc) *, tree,
175 static void add_builtin_candidates
176 (struct z_candidate **, enum tree_code, enum tree_code,
178 static void add_builtin_candidate
179 (struct z_candidate **, enum tree_code, enum tree_code,
180 tree, tree, tree, tree *, tree *, int);
181 static bool is_complete (tree);
182 static void build_builtin_candidate
183 (struct z_candidate **, tree, tree, tree, tree *, tree *,
185 static struct z_candidate *add_conv_candidate
186 (struct z_candidate **, tree, tree, tree, const VEC(tree,gc) *, tree,
188 static struct z_candidate *add_function_candidate
189 (struct z_candidate **, tree, tree, tree, const VEC(tree,gc) *, tree,
191 static conversion *implicit_conversion (tree, tree, tree, bool, int);
192 static conversion *standard_conversion (tree, tree, tree, bool, int);
193 static conversion *reference_binding (tree, tree, tree, bool, int);
194 static conversion *build_conv (conversion_kind, tree, conversion *);
195 static conversion *build_list_conv (tree, tree, int);
196 static bool is_subseq (conversion *, conversion *);
197 static conversion *maybe_handle_ref_bind (conversion **);
198 static void maybe_handle_implicit_object (conversion **);
199 static struct z_candidate *add_candidate
200 (struct z_candidate **, tree, tree, const VEC(tree,gc) *, size_t,
201 conversion **, tree, tree, int, struct rejection_reason *);
202 static tree source_type (conversion *);
203 static void add_warning (struct z_candidate *, struct z_candidate *);
204 static bool reference_compatible_p (tree, tree);
205 static conversion *direct_reference_binding (tree, conversion *);
206 static bool promoted_arithmetic_type_p (tree);
207 static conversion *conditional_conversion (tree, tree);
208 static char *name_as_c_string (tree, tree, bool *);
209 static tree prep_operand (tree);
210 static void add_candidates (tree, tree, const VEC(tree,gc) *, tree, tree, bool,
211 tree, tree, int, struct z_candidate **);
212 static conversion *merge_conversion_sequences (conversion *, conversion *);
213 static bool magic_varargs_p (tree);
214 static tree build_temp (tree, tree, int, diagnostic_t *, tsubst_flags_t);
216 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
217 NAME can take many forms... */
220 check_dtor_name (tree basetype, tree name)
222 /* Just accept something we've already complained about. */
223 if (name == error_mark_node)
226 if (TREE_CODE (name) == TYPE_DECL)
227 name = TREE_TYPE (name);
228 else if (TYPE_P (name))
230 else if (TREE_CODE (name) == IDENTIFIER_NODE)
232 if ((MAYBE_CLASS_TYPE_P (basetype)
233 && name == constructor_name (basetype))
234 || (TREE_CODE (basetype) == ENUMERAL_TYPE
235 && name == TYPE_IDENTIFIER (basetype)))
238 name = get_type_value (name);
244 template <class T> struct S { ~S(); };
248 NAME will be a class template. */
249 gcc_assert (DECL_CLASS_TEMPLATE_P (name));
253 if (!name || name == error_mark_node)
255 return same_type_p (TYPE_MAIN_VARIANT (basetype), TYPE_MAIN_VARIANT (name));
258 /* We want the address of a function or method. We avoid creating a
259 pointer-to-member function. */
262 build_addr_func (tree function)
264 tree type = TREE_TYPE (function);
266 /* We have to do these by hand to avoid real pointer to member
268 if (TREE_CODE (type) == METHOD_TYPE)
270 if (TREE_CODE (function) == OFFSET_REF)
272 tree object = build_address (TREE_OPERAND (function, 0));
273 return get_member_function_from_ptrfunc (&object,
274 TREE_OPERAND (function, 1));
276 function = build_address (function);
279 function = decay_conversion (function);
284 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
285 POINTER_TYPE to those. Note, pointer to member function types
286 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
287 two variants. build_call_a is the primitive taking an array of
288 arguments, while build_call_n is a wrapper that handles varargs. */
291 build_call_n (tree function, int n, ...)
294 return build_call_a (function, 0, NULL);
297 tree *argarray = XALLOCAVEC (tree, n);
302 for (i = 0; i < n; i++)
303 argarray[i] = va_arg (ap, tree);
305 return build_call_a (function, n, argarray);
309 /* Update various flags in cfun and the call itself based on what is being
310 called. Split out of build_call_a so that bot_manip can use it too. */
313 set_flags_from_callee (tree call)
316 tree decl = get_callee_fndecl (call);
318 /* We check both the decl and the type; a function may be known not to
319 throw without being declared throw(). */
320 nothrow = ((decl && TREE_NOTHROW (decl))
321 || TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call)))));
323 if (!nothrow && at_function_scope_p () && cfun && cp_function_chain)
324 cp_function_chain->can_throw = 1;
326 if (decl && TREE_THIS_VOLATILE (decl) && cfun && cp_function_chain)
327 current_function_returns_abnormally = 1;
329 TREE_NOTHROW (call) = nothrow;
333 build_call_a (tree function, int n, tree *argarray)
340 function = build_addr_func (function);
342 gcc_assert (TYPE_PTR_P (TREE_TYPE (function)));
343 fntype = TREE_TYPE (TREE_TYPE (function));
344 gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE
345 || TREE_CODE (fntype) == METHOD_TYPE);
346 result_type = TREE_TYPE (fntype);
347 /* An rvalue has no cv-qualifiers. */
348 if (SCALAR_TYPE_P (result_type) || VOID_TYPE_P (result_type))
349 result_type = cv_unqualified (result_type);
351 function = build_call_array_loc (input_location,
352 result_type, function, n, argarray);
353 set_flags_from_callee (function);
355 decl = get_callee_fndecl (function);
357 if (decl && !TREE_USED (decl))
359 /* We invoke build_call directly for several library
360 functions. These may have been declared normally if
361 we're building libgcc, so we can't just check
363 gcc_assert (DECL_ARTIFICIAL (decl)
364 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl)),
369 if (decl && TREE_DEPRECATED (decl))
370 warn_deprecated_use (decl, NULL_TREE);
371 require_complete_eh_spec_types (fntype, decl);
373 TREE_HAS_CONSTRUCTOR (function) = (decl && DECL_CONSTRUCTOR_P (decl));
375 /* Don't pass empty class objects by value. This is useful
376 for tags in STL, which are used to control overload resolution.
377 We don't need to handle other cases of copying empty classes. */
378 if (! decl || ! DECL_BUILT_IN (decl))
379 for (i = 0; i < n; i++)
381 tree arg = CALL_EXPR_ARG (function, i);
382 if (is_empty_class (TREE_TYPE (arg))
383 && ! TREE_ADDRESSABLE (TREE_TYPE (arg)))
385 tree t = build0 (EMPTY_CLASS_EXPR, TREE_TYPE (arg));
386 arg = build2 (COMPOUND_EXPR, TREE_TYPE (t), arg, t);
387 CALL_EXPR_ARG (function, i) = arg;
394 /* Build something of the form ptr->method (args)
395 or object.method (args). This can also build
396 calls to constructors, and find friends.
398 Member functions always take their class variable
401 INSTANCE is a class instance.
403 NAME is the name of the method desired, usually an IDENTIFIER_NODE.
405 PARMS help to figure out what that NAME really refers to.
407 BASETYPE_PATH, if non-NULL, contains a chain from the type of INSTANCE
408 down to the real instance type to use for access checking. We need this
409 information to get protected accesses correct.
411 FLAGS is the logical disjunction of zero or more LOOKUP_
412 flags. See cp-tree.h for more info.
414 If this is all OK, calls build_function_call with the resolved
417 This function must also handle being called to perform
418 initialization, promotion/coercion of arguments, and
419 instantiation of default parameters.
421 Note that NAME may refer to an instance variable name. If
422 `operator()()' is defined for the type of that field, then we return
425 /* New overloading code. */
427 typedef struct z_candidate z_candidate;
429 typedef struct candidate_warning candidate_warning;
430 struct candidate_warning {
432 candidate_warning *next;
435 /* Information for providing diagnostics about why overloading failed. */
437 enum rejection_reason_code {
440 rr_explicit_conversion,
441 rr_template_conversion,
443 rr_bad_arg_conversion,
444 rr_template_unification,
445 rr_template_instantiation,
449 struct conversion_info {
450 /* The index of the argument, 0-based. */
452 /* The type of the actual argument. */
454 /* The type of the formal argument. */
458 struct rejection_reason {
459 enum rejection_reason_code code;
461 /* Information about an arity mismatch. */
463 /* The expected number of arguments. */
465 /* The actual number of arguments in the call. */
467 /* Whether the call was a varargs call. */
470 /* Information about an argument conversion mismatch. */
471 struct conversion_info conversion;
472 /* Same, but for bad argument conversions. */
473 struct conversion_info bad_conversion;
474 /* Information about template unification failures. These are the
475 parameters passed to fn_type_unification. */
483 unification_kind_t strict;
485 } template_unification;
486 /* Information about template instantiation failures. These are the
487 parameters passed to instantiate_template. */
491 } template_instantiation;
496 /* The FUNCTION_DECL that will be called if this candidate is
497 selected by overload resolution. */
499 /* If not NULL_TREE, the first argument to use when calling this
502 /* The rest of the arguments to use when calling this function. If
503 there are no further arguments this may be NULL or it may be an
505 const VEC(tree,gc) *args;
506 /* The implicit conversion sequences for each of the arguments to
509 /* The number of implicit conversion sequences. */
511 /* If FN is a user-defined conversion, the standard conversion
512 sequence from the type returned by FN to the desired destination
514 conversion *second_conv;
516 struct rejection_reason *reason;
517 /* If FN is a member function, the binfo indicating the path used to
518 qualify the name of FN at the call site. This path is used to
519 determine whether or not FN is accessible if it is selected by
520 overload resolution. The DECL_CONTEXT of FN will always be a
521 (possibly improper) base of this binfo. */
523 /* If FN is a non-static member function, the binfo indicating the
524 subobject to which the `this' pointer should be converted if FN
525 is selected by overload resolution. The type pointed to the by
526 the `this' pointer must correspond to the most derived class
527 indicated by the CONVERSION_PATH. */
528 tree conversion_path;
531 candidate_warning *warnings;
535 /* Returns true iff T is a null pointer constant in the sense of
539 null_ptr_cst_p (tree t)
543 A null pointer constant is an integral constant expression
544 (_expr.const_) rvalue of integer type that evaluates to zero or
545 an rvalue of type std::nullptr_t. */
546 if (NULLPTR_TYPE_P (TREE_TYPE (t)))
548 if (CP_INTEGRAL_TYPE_P (TREE_TYPE (t)))
550 /* Core issue 903 says only literal 0 is a null pointer constant. */
551 if (cxx_dialect < cxx0x)
553 t = integral_constant_value (t);
556 if (integer_zerop (t) && !TREE_OVERFLOW (t))
562 /* Returns true iff T is a null member pointer value (4.11). */
565 null_member_pointer_value_p (tree t)
567 tree type = TREE_TYPE (t);
570 else if (TYPE_PTRMEMFUNC_P (type))
571 return (TREE_CODE (t) == CONSTRUCTOR
572 && integer_zerop (CONSTRUCTOR_ELT (t, 0)->value));
573 else if (TYPE_PTRMEM_P (type))
574 return integer_all_onesp (t);
579 /* Returns nonzero if PARMLIST consists of only default parms,
580 ellipsis, and/or undeduced parameter packs. */
583 sufficient_parms_p (const_tree parmlist)
585 for (; parmlist && parmlist != void_list_node;
586 parmlist = TREE_CHAIN (parmlist))
587 if (!TREE_PURPOSE (parmlist)
588 && !PACK_EXPANSION_P (TREE_VALUE (parmlist)))
593 /* Allocate N bytes of memory from the conversion obstack. The memory
594 is zeroed before being returned. */
597 conversion_obstack_alloc (size_t n)
600 if (!conversion_obstack_initialized)
602 gcc_obstack_init (&conversion_obstack);
603 conversion_obstack_initialized = true;
605 p = obstack_alloc (&conversion_obstack, n);
610 /* Allocate rejection reasons. */
612 static struct rejection_reason *
613 alloc_rejection (enum rejection_reason_code code)
615 struct rejection_reason *p;
616 p = (struct rejection_reason *) conversion_obstack_alloc (sizeof *p);
621 static struct rejection_reason *
622 arity_rejection (tree first_arg, int expected, int actual)
624 struct rejection_reason *r = alloc_rejection (rr_arity);
625 int adjust = first_arg != NULL_TREE;
626 r->u.arity.expected = expected - adjust;
627 r->u.arity.actual = actual - adjust;
631 static struct rejection_reason *
632 arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to)
634 struct rejection_reason *r = alloc_rejection (rr_arg_conversion);
635 int adjust = first_arg != NULL_TREE;
636 r->u.conversion.n_arg = n_arg - adjust;
637 r->u.conversion.from_type = from;
638 r->u.conversion.to_type = to;
642 static struct rejection_reason *
643 bad_arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to)
645 struct rejection_reason *r = alloc_rejection (rr_bad_arg_conversion);
646 int adjust = first_arg != NULL_TREE;
647 r->u.bad_conversion.n_arg = n_arg - adjust;
648 r->u.bad_conversion.from_type = from;
649 r->u.bad_conversion.to_type = to;
653 static struct rejection_reason *
654 explicit_conversion_rejection (tree from, tree to)
656 struct rejection_reason *r = alloc_rejection (rr_explicit_conversion);
657 r->u.conversion.n_arg = 0;
658 r->u.conversion.from_type = from;
659 r->u.conversion.to_type = to;
663 static struct rejection_reason *
664 template_conversion_rejection (tree from, tree to)
666 struct rejection_reason *r = alloc_rejection (rr_template_conversion);
667 r->u.conversion.n_arg = 0;
668 r->u.conversion.from_type = from;
669 r->u.conversion.to_type = to;
673 static struct rejection_reason *
674 template_unification_rejection (tree tmpl, tree explicit_targs, tree targs,
675 const tree *args, unsigned int nargs,
676 tree return_type, unification_kind_t strict,
679 size_t args_n_bytes = sizeof (*args) * nargs;
680 tree *args1 = (tree *) conversion_obstack_alloc (args_n_bytes);
681 struct rejection_reason *r = alloc_rejection (rr_template_unification);
682 r->u.template_unification.tmpl = tmpl;
683 r->u.template_unification.explicit_targs = explicit_targs;
684 r->u.template_unification.targs = targs;
685 /* Copy args to our own storage. */
686 memcpy (args1, args, args_n_bytes);
687 r->u.template_unification.args = args1;
688 r->u.template_unification.nargs = nargs;
689 r->u.template_unification.return_type = return_type;
690 r->u.template_unification.strict = strict;
691 r->u.template_unification.flags = flags;
695 static struct rejection_reason *
696 template_unification_error_rejection (void)
698 return alloc_rejection (rr_template_unification);
701 static struct rejection_reason *
702 template_instantiation_rejection (tree tmpl, tree targs)
704 struct rejection_reason *r = alloc_rejection (rr_template_instantiation);
705 r->u.template_instantiation.tmpl = tmpl;
706 r->u.template_instantiation.targs = targs;
710 static struct rejection_reason *
711 invalid_copy_with_fn_template_rejection (void)
713 struct rejection_reason *r = alloc_rejection (rr_invalid_copy);
717 /* Dynamically allocate a conversion. */
720 alloc_conversion (conversion_kind kind)
723 c = (conversion *) conversion_obstack_alloc (sizeof (conversion));
728 #ifdef ENABLE_CHECKING
730 /* Make sure that all memory on the conversion obstack has been
734 validate_conversion_obstack (void)
736 if (conversion_obstack_initialized)
737 gcc_assert ((obstack_next_free (&conversion_obstack)
738 == obstack_base (&conversion_obstack)));
741 #endif /* ENABLE_CHECKING */
743 /* Dynamically allocate an array of N conversions. */
746 alloc_conversions (size_t n)
748 return (conversion **) conversion_obstack_alloc (n * sizeof (conversion *));
752 build_conv (conversion_kind code, tree type, conversion *from)
755 conversion_rank rank = CONVERSION_RANK (from);
757 /* Note that the caller is responsible for filling in t->cand for
758 user-defined conversions. */
759 t = alloc_conversion (code);
782 t->user_conv_p = (code == ck_user || from->user_conv_p);
783 t->bad_p = from->bad_p;
788 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
789 specialization of std::initializer_list<T>, if such a conversion is
793 build_list_conv (tree type, tree ctor, int flags)
795 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type), 0);
796 unsigned len = CONSTRUCTOR_NELTS (ctor);
797 conversion **subconvs = alloc_conversions (len);
802 /* Within a list-initialization we can have more user-defined
804 flags &= ~LOOKUP_NO_CONVERSION;
805 /* But no narrowing conversions. */
806 flags |= LOOKUP_NO_NARROWING;
808 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
811 = implicit_conversion (elttype, TREE_TYPE (val), val,
819 t = alloc_conversion (ck_list);
821 t->u.list = subconvs;
824 for (i = 0; i < len; ++i)
826 conversion *sub = subconvs[i];
827 if (sub->rank > t->rank)
829 if (sub->user_conv_p)
830 t->user_conv_p = true;
838 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
839 is a valid aggregate initializer for array type ATYPE. */
842 can_convert_array (tree atype, tree ctor, int flags)
845 tree elttype = TREE_TYPE (atype);
846 for (i = 0; i < CONSTRUCTOR_NELTS (ctor); ++i)
848 tree val = CONSTRUCTOR_ELT (ctor, i)->value;
850 if (TREE_CODE (elttype) == ARRAY_TYPE
851 && TREE_CODE (val) == CONSTRUCTOR)
852 ok = can_convert_array (elttype, val, flags);
854 ok = can_convert_arg (elttype, TREE_TYPE (val), val, flags);
861 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
862 aggregate class, if such a conversion is possible. */
865 build_aggr_conv (tree type, tree ctor, int flags)
867 unsigned HOST_WIDE_INT i = 0;
869 tree field = next_initializable_field (TYPE_FIELDS (type));
870 tree empty_ctor = NULL_TREE;
872 for (; field; field = next_initializable_field (DECL_CHAIN (field)))
874 tree ftype = TREE_TYPE (field);
878 if (i < CONSTRUCTOR_NELTS (ctor))
879 val = CONSTRUCTOR_ELT (ctor, i)->value;
882 if (empty_ctor == NULL_TREE)
883 empty_ctor = build_constructor (init_list_type_node, NULL);
888 if (TREE_CODE (ftype) == ARRAY_TYPE
889 && TREE_CODE (val) == CONSTRUCTOR)
890 ok = can_convert_array (ftype, val, flags);
892 ok = can_convert_arg (ftype, TREE_TYPE (val), val, flags);
897 if (TREE_CODE (type) == UNION_TYPE)
901 if (i < CONSTRUCTOR_NELTS (ctor))
904 c = alloc_conversion (ck_aggr);
907 c->user_conv_p = true;
912 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
913 array type, if such a conversion is possible. */
916 build_array_conv (tree type, tree ctor, int flags)
919 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
920 tree elttype = TREE_TYPE (type);
925 enum conversion_rank rank = cr_exact;
927 if (TYPE_DOMAIN (type))
929 unsigned HOST_WIDE_INT alen = tree_low_cst (array_type_nelts_top (type), 1);
934 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
937 = implicit_conversion (elttype, TREE_TYPE (val), val,
942 if (sub->rank > rank)
944 if (sub->user_conv_p)
950 c = alloc_conversion (ck_aggr);
953 c->user_conv_p = user;
959 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
960 complex type, if such a conversion is possible. */
963 build_complex_conv (tree type, tree ctor, int flags)
966 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
967 tree elttype = TREE_TYPE (type);
972 enum conversion_rank rank = cr_exact;
977 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
980 = implicit_conversion (elttype, TREE_TYPE (val), val,
985 if (sub->rank > rank)
987 if (sub->user_conv_p)
993 c = alloc_conversion (ck_aggr);
996 c->user_conv_p = user;
1002 /* Build a representation of the identity conversion from EXPR to
1003 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1006 build_identity_conv (tree type, tree expr)
1010 c = alloc_conversion (ck_identity);
1017 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1018 were multiple user-defined conversions to accomplish the job.
1019 Build a conversion that indicates that ambiguity. */
1022 build_ambiguous_conv (tree type, tree expr)
1026 c = alloc_conversion (ck_ambig);
1034 strip_top_quals (tree t)
1036 if (TREE_CODE (t) == ARRAY_TYPE)
1038 return cp_build_qualified_type (t, 0);
1041 /* Returns the standard conversion path (see [conv]) from type FROM to type
1042 TO, if any. For proper handling of null pointer constants, you must
1043 also pass the expression EXPR to convert from. If C_CAST_P is true,
1044 this conversion is coming from a C-style cast. */
1047 standard_conversion (tree to, tree from, tree expr, bool c_cast_p,
1050 enum tree_code fcode, tcode;
1052 bool fromref = false;
1055 to = non_reference (to);
1056 if (TREE_CODE (from) == REFERENCE_TYPE)
1059 from = TREE_TYPE (from);
1062 to = strip_top_quals (to);
1063 from = strip_top_quals (from);
1065 if ((TYPE_PTRFN_P (to) || TYPE_PTRMEMFUNC_P (to))
1066 && expr && type_unknown_p (expr))
1068 tsubst_flags_t tflags = tf_conv;
1069 if (!(flags & LOOKUP_PROTECT))
1070 tflags |= tf_no_access_control;
1071 expr = instantiate_type (to, expr, tflags);
1072 if (expr == error_mark_node)
1074 from = TREE_TYPE (expr);
1077 fcode = TREE_CODE (from);
1078 tcode = TREE_CODE (to);
1080 conv = build_identity_conv (from, expr);
1081 if (fcode == FUNCTION_TYPE || fcode == ARRAY_TYPE)
1083 from = type_decays_to (from);
1084 fcode = TREE_CODE (from);
1085 conv = build_conv (ck_lvalue, from, conv);
1087 else if (fromref || (expr && lvalue_p (expr)))
1092 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
1095 from = strip_top_quals (bitfield_type);
1096 fcode = TREE_CODE (from);
1099 conv = build_conv (ck_rvalue, from, conv);
1100 if (flags & LOOKUP_PREFER_RVALUE)
1101 conv->rvaluedness_matches_p = true;
1104 /* Allow conversion between `__complex__' data types. */
1105 if (tcode == COMPLEX_TYPE && fcode == COMPLEX_TYPE)
1107 /* The standard conversion sequence to convert FROM to TO is
1108 the standard conversion sequence to perform componentwise
1110 conversion *part_conv = standard_conversion
1111 (TREE_TYPE (to), TREE_TYPE (from), NULL_TREE, c_cast_p, flags);
1115 conv = build_conv (part_conv->kind, to, conv);
1116 conv->rank = part_conv->rank;
1124 if (same_type_p (from, to))
1126 if (CLASS_TYPE_P (to) && conv->kind == ck_rvalue)
1127 conv->type = qualified_to;
1132 A null pointer constant can be converted to a pointer type; ... A
1133 null pointer constant of integral type can be converted to an
1134 rvalue of type std::nullptr_t. */
1135 if ((tcode == POINTER_TYPE || TYPE_PTR_TO_MEMBER_P (to)
1136 || NULLPTR_TYPE_P (to))
1137 && expr && null_ptr_cst_p (expr))
1138 conv = build_conv (ck_std, to, conv);
1139 else if ((tcode == INTEGER_TYPE && fcode == POINTER_TYPE)
1140 || (tcode == POINTER_TYPE && fcode == INTEGER_TYPE))
1142 /* For backwards brain damage compatibility, allow interconversion of
1143 pointers and integers with a pedwarn. */
1144 conv = build_conv (ck_std, to, conv);
1147 else if (UNSCOPED_ENUM_P (to) && fcode == INTEGER_TYPE)
1149 /* For backwards brain damage compatibility, allow interconversion of
1150 enums and integers with a pedwarn. */
1151 conv = build_conv (ck_std, to, conv);
1154 else if ((tcode == POINTER_TYPE && fcode == POINTER_TYPE)
1155 || (TYPE_PTRMEM_P (to) && TYPE_PTRMEM_P (from)))
1160 if (tcode == POINTER_TYPE
1161 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from),
1164 else if (VOID_TYPE_P (TREE_TYPE (to))
1165 && !TYPE_PTRMEM_P (from)
1166 && TREE_CODE (TREE_TYPE (from)) != FUNCTION_TYPE)
1168 tree nfrom = TREE_TYPE (from);
1169 from = build_pointer_type
1170 (cp_build_qualified_type (void_type_node,
1171 cp_type_quals (nfrom)));
1172 conv = build_conv (ck_ptr, from, conv);
1174 else if (TYPE_PTRMEM_P (from))
1176 tree fbase = TYPE_PTRMEM_CLASS_TYPE (from);
1177 tree tbase = TYPE_PTRMEM_CLASS_TYPE (to);
1179 if (DERIVED_FROM_P (fbase, tbase)
1180 && (same_type_ignoring_top_level_qualifiers_p
1181 (TYPE_PTRMEM_POINTED_TO_TYPE (from),
1182 TYPE_PTRMEM_POINTED_TO_TYPE (to))))
1184 from = build_ptrmem_type (tbase,
1185 TYPE_PTRMEM_POINTED_TO_TYPE (from));
1186 conv = build_conv (ck_pmem, from, conv);
1188 else if (!same_type_p (fbase, tbase))
1191 else if (CLASS_TYPE_P (TREE_TYPE (from))
1192 && CLASS_TYPE_P (TREE_TYPE (to))
1195 An rvalue of type "pointer to cv D," where D is a
1196 class type, can be converted to an rvalue of type
1197 "pointer to cv B," where B is a base class (clause
1198 _class.derived_) of D. If B is an inaccessible
1199 (clause _class.access_) or ambiguous
1200 (_class.member.lookup_) base class of D, a program
1201 that necessitates this conversion is ill-formed.
1202 Therefore, we use DERIVED_FROM_P, and do not check
1203 access or uniqueness. */
1204 && DERIVED_FROM_P (TREE_TYPE (to), TREE_TYPE (from)))
1207 cp_build_qualified_type (TREE_TYPE (to),
1208 cp_type_quals (TREE_TYPE (from)));
1209 from = build_pointer_type (from);
1210 conv = build_conv (ck_ptr, from, conv);
1211 conv->base_p = true;
1214 if (tcode == POINTER_TYPE)
1216 to_pointee = TREE_TYPE (to);
1217 from_pointee = TREE_TYPE (from);
1221 to_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (to);
1222 from_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (from);
1225 if (same_type_p (from, to))
1227 else if (c_cast_p && comp_ptr_ttypes_const (to, from))
1228 /* In a C-style cast, we ignore CV-qualification because we
1229 are allowed to perform a static_cast followed by a
1231 conv = build_conv (ck_qual, to, conv);
1232 else if (!c_cast_p && comp_ptr_ttypes (to_pointee, from_pointee))
1233 conv = build_conv (ck_qual, to, conv);
1234 else if (expr && string_conv_p (to, expr, 0))
1235 /* converting from string constant to char *. */
1236 conv = build_conv (ck_qual, to, conv);
1237 /* Allow conversions among compatible ObjC pointer types (base
1238 conversions have been already handled above). */
1239 else if (c_dialect_objc ()
1240 && objc_compare_types (to, from, -4, NULL_TREE))
1241 conv = build_conv (ck_ptr, to, conv);
1242 else if (ptr_reasonably_similar (to_pointee, from_pointee))
1244 conv = build_conv (ck_ptr, to, conv);
1252 else if (TYPE_PTRMEMFUNC_P (to) && TYPE_PTRMEMFUNC_P (from))
1254 tree fromfn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from));
1255 tree tofn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to));
1256 tree fbase = class_of_this_parm (fromfn);
1257 tree tbase = class_of_this_parm (tofn);
1259 if (!DERIVED_FROM_P (fbase, tbase)
1260 || !same_type_p (TREE_TYPE (fromfn), TREE_TYPE (tofn))
1261 || !compparms (TREE_CHAIN (TYPE_ARG_TYPES (fromfn)),
1262 TREE_CHAIN (TYPE_ARG_TYPES (tofn)))
1263 || cp_type_quals (fbase) != cp_type_quals (tbase))
1266 from = build_memfn_type (fromfn, tbase, cp_type_quals (tbase));
1267 from = build_ptrmemfunc_type (build_pointer_type (from));
1268 conv = build_conv (ck_pmem, from, conv);
1269 conv->base_p = true;
1271 else if (tcode == BOOLEAN_TYPE)
1275 An rvalue of arithmetic, unscoped enumeration, pointer, or
1276 pointer to member type can be converted to an rvalue of type
1277 bool. ... An rvalue of type std::nullptr_t can be converted
1278 to an rvalue of type bool; */
1279 if (ARITHMETIC_TYPE_P (from)
1280 || UNSCOPED_ENUM_P (from)
1281 || fcode == POINTER_TYPE
1282 || TYPE_PTR_TO_MEMBER_P (from)
1283 || NULLPTR_TYPE_P (from))
1285 conv = build_conv (ck_std, to, conv);
1286 if (fcode == POINTER_TYPE
1287 || TYPE_PTRMEM_P (from)
1288 || (TYPE_PTRMEMFUNC_P (from)
1289 && conv->rank < cr_pbool)
1290 || NULLPTR_TYPE_P (from))
1291 conv->rank = cr_pbool;
1297 /* We don't check for ENUMERAL_TYPE here because there are no standard
1298 conversions to enum type. */
1299 /* As an extension, allow conversion to complex type. */
1300 else if (ARITHMETIC_TYPE_P (to))
1302 if (! (INTEGRAL_CODE_P (fcode) || fcode == REAL_TYPE)
1303 || SCOPED_ENUM_P (from))
1305 conv = build_conv (ck_std, to, conv);
1307 /* Give this a better rank if it's a promotion. */
1308 if (same_type_p (to, type_promotes_to (from))
1309 && conv->u.next->rank <= cr_promotion)
1310 conv->rank = cr_promotion;
1312 else if (fcode == VECTOR_TYPE && tcode == VECTOR_TYPE
1313 && vector_types_convertible_p (from, to, false))
1314 return build_conv (ck_std, to, conv);
1315 else if (MAYBE_CLASS_TYPE_P (to) && MAYBE_CLASS_TYPE_P (from)
1316 && is_properly_derived_from (from, to))
1318 if (conv->kind == ck_rvalue)
1319 conv = conv->u.next;
1320 conv = build_conv (ck_base, to, conv);
1321 /* The derived-to-base conversion indicates the initialization
1322 of a parameter with base type from an object of a derived
1323 type. A temporary object is created to hold the result of
1324 the conversion unless we're binding directly to a reference. */
1325 conv->need_temporary_p = !(flags & LOOKUP_NO_TEMP_BIND);
1330 if (flags & LOOKUP_NO_NARROWING)
1331 conv->check_narrowing = true;
1336 /* Returns nonzero if T1 is reference-related to T2. */
1339 reference_related_p (tree t1, tree t2)
1341 if (t1 == error_mark_node || t2 == error_mark_node)
1344 t1 = TYPE_MAIN_VARIANT (t1);
1345 t2 = TYPE_MAIN_VARIANT (t2);
1349 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1350 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1352 return (same_type_p (t1, t2)
1353 || (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
1354 && DERIVED_FROM_P (t1, t2)));
1357 /* Returns nonzero if T1 is reference-compatible with T2. */
1360 reference_compatible_p (tree t1, tree t2)
1364 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
1365 reference-related to T2 and cv1 is the same cv-qualification as,
1366 or greater cv-qualification than, cv2. */
1367 return (reference_related_p (t1, t2)
1368 && at_least_as_qualified_p (t1, t2));
1371 /* A reference of the indicated TYPE is being bound directly to the
1372 expression represented by the implicit conversion sequence CONV.
1373 Return a conversion sequence for this binding. */
1376 direct_reference_binding (tree type, conversion *conv)
1380 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
1381 gcc_assert (TREE_CODE (conv->type) != REFERENCE_TYPE);
1383 t = TREE_TYPE (type);
1387 When a parameter of reference type binds directly
1388 (_dcl.init.ref_) to an argument expression, the implicit
1389 conversion sequence is the identity conversion, unless the
1390 argument expression has a type that is a derived class of the
1391 parameter type, in which case the implicit conversion sequence is
1392 a derived-to-base Conversion.
1394 If the parameter binds directly to the result of applying a
1395 conversion function to the argument expression, the implicit
1396 conversion sequence is a user-defined conversion sequence
1397 (_over.ics.user_), with the second standard conversion sequence
1398 either an identity conversion or, if the conversion function
1399 returns an entity of a type that is a derived class of the
1400 parameter type, a derived-to-base conversion. */
1401 if (!same_type_ignoring_top_level_qualifiers_p (t, conv->type))
1403 /* Represent the derived-to-base conversion. */
1404 conv = build_conv (ck_base, t, conv);
1405 /* We will actually be binding to the base-class subobject in
1406 the derived class, so we mark this conversion appropriately.
1407 That way, convert_like knows not to generate a temporary. */
1408 conv->need_temporary_p = false;
1410 return build_conv (ck_ref_bind, type, conv);
1413 /* Returns the conversion path from type FROM to reference type TO for
1414 purposes of reference binding. For lvalue binding, either pass a
1415 reference type to FROM or an lvalue expression to EXPR. If the
1416 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1417 the conversion returned. If C_CAST_P is true, this
1418 conversion is coming from a C-style cast. */
1421 reference_binding (tree rto, tree rfrom, tree expr, bool c_cast_p, int flags)
1423 conversion *conv = NULL;
1424 tree to = TREE_TYPE (rto);
1429 cp_lvalue_kind gl_kind;
1432 if (TREE_CODE (to) == FUNCTION_TYPE && expr && type_unknown_p (expr))
1434 expr = instantiate_type (to, expr, tf_none);
1435 if (expr == error_mark_node)
1437 from = TREE_TYPE (expr);
1440 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1442 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
1443 conv = implicit_conversion (to, from, expr, c_cast_p,
1445 if (!CLASS_TYPE_P (to)
1446 && CONSTRUCTOR_NELTS (expr) == 1)
1448 expr = CONSTRUCTOR_ELT (expr, 0)->value;
1449 if (error_operand_p (expr))
1451 from = TREE_TYPE (expr);
1455 if (TREE_CODE (from) == REFERENCE_TYPE)
1457 from = TREE_TYPE (from);
1458 if (!TYPE_REF_IS_RVALUE (rfrom)
1459 || TREE_CODE (from) == FUNCTION_TYPE)
1460 gl_kind = clk_ordinary;
1462 gl_kind = clk_rvalueref;
1466 gl_kind = lvalue_kind (expr);
1467 if (gl_kind & clk_class)
1468 /* A class prvalue is not a glvalue. */
1473 is_lvalue = gl_kind && !(gl_kind & clk_rvalueref);
1476 if ((gl_kind & clk_bitfield) != 0)
1477 tfrom = unlowered_expr_type (expr);
1479 /* Figure out whether or not the types are reference-related and
1480 reference compatible. We have do do this after stripping
1481 references from FROM. */
1482 related_p = reference_related_p (to, tfrom);
1483 /* If this is a C cast, first convert to an appropriately qualified
1484 type, so that we can later do a const_cast to the desired type. */
1485 if (related_p && c_cast_p
1486 && !at_least_as_qualified_p (to, tfrom))
1487 to = cp_build_qualified_type (to, cp_type_quals (tfrom));
1488 compatible_p = reference_compatible_p (to, tfrom);
1490 /* Directly bind reference when target expression's type is compatible with
1491 the reference and expression is an lvalue. In DR391, the wording in
1492 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1493 const and rvalue references to rvalues of compatible class type.
1494 We should also do direct bindings for non-class xvalues. */
1497 || (((CP_TYPE_CONST_NON_VOLATILE_P (to)
1498 && !(flags & LOOKUP_NO_RVAL_BIND))
1499 || TYPE_REF_IS_RVALUE (rto))
1501 || (!(flags & LOOKUP_NO_TEMP_BIND)
1502 && (CLASS_TYPE_P (from)
1503 || TREE_CODE (from) == ARRAY_TYPE))))))
1507 If the initializer expression
1509 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1510 is reference-compatible with "cv2 T2,"
1512 the reference is bound directly to the initializer expression
1516 If the initializer expression is an rvalue, with T2 a class type,
1517 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1518 is bound to the object represented by the rvalue or to a sub-object
1519 within that object. */
1521 conv = build_identity_conv (tfrom, expr);
1522 conv = direct_reference_binding (rto, conv);
1524 if (flags & LOOKUP_PREFER_RVALUE)
1525 /* The top-level caller requested that we pretend that the lvalue
1526 be treated as an rvalue. */
1527 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
1528 else if (TREE_CODE (rfrom) == REFERENCE_TYPE)
1529 /* Handle rvalue reference to function properly. */
1530 conv->rvaluedness_matches_p
1531 = (TYPE_REF_IS_RVALUE (rto) == TYPE_REF_IS_RVALUE (rfrom));
1533 conv->rvaluedness_matches_p
1534 = (TYPE_REF_IS_RVALUE (rto) == !is_lvalue);
1536 if ((gl_kind & clk_bitfield) != 0
1537 || ((gl_kind & clk_packed) != 0 && !TYPE_PACKED (to)))
1538 /* For the purposes of overload resolution, we ignore the fact
1539 this expression is a bitfield or packed field. (In particular,
1540 [over.ics.ref] says specifically that a function with a
1541 non-const reference parameter is viable even if the
1542 argument is a bitfield.)
1544 However, when we actually call the function we must create
1545 a temporary to which to bind the reference. If the
1546 reference is volatile, or isn't const, then we cannot make
1547 a temporary, so we just issue an error when the conversion
1549 conv->need_temporary_p = true;
1551 /* Don't allow binding of lvalues (other than function lvalues) to
1552 rvalue references. */
1553 if (is_lvalue && TYPE_REF_IS_RVALUE (rto)
1554 && TREE_CODE (to) != FUNCTION_TYPE
1555 && !(flags & LOOKUP_PREFER_RVALUE))
1560 /* [class.conv.fct] A conversion function is never used to convert a
1561 (possibly cv-qualified) object to the (possibly cv-qualified) same
1562 object type (or a reference to it), to a (possibly cv-qualified) base
1563 class of that type (or a reference to it).... */
1564 else if (CLASS_TYPE_P (from) && !related_p
1565 && !(flags & LOOKUP_NO_CONVERSION))
1569 If the initializer expression
1571 -- has a class type (i.e., T2 is a class type) can be
1572 implicitly converted to an lvalue of type "cv3 T3," where
1573 "cv1 T1" is reference-compatible with "cv3 T3". (this
1574 conversion is selected by enumerating the applicable
1575 conversion functions (_over.match.ref_) and choosing the
1576 best one through overload resolution. (_over.match_).
1578 the reference is bound to the lvalue result of the conversion
1579 in the second case. */
1580 z_candidate *cand = build_user_type_conversion_1 (rto, expr, flags);
1582 return cand->second_conv;
1585 /* From this point on, we conceptually need temporaries, even if we
1586 elide them. Only the cases above are "direct bindings". */
1587 if (flags & LOOKUP_NO_TEMP_BIND)
1592 When a parameter of reference type is not bound directly to an
1593 argument expression, the conversion sequence is the one required
1594 to convert the argument expression to the underlying type of the
1595 reference according to _over.best.ics_. Conceptually, this
1596 conversion sequence corresponds to copy-initializing a temporary
1597 of the underlying type with the argument expression. Any
1598 difference in top-level cv-qualification is subsumed by the
1599 initialization itself and does not constitute a conversion. */
1603 Otherwise, the reference shall be to a non-volatile const type.
1605 Under C++0x, [8.5.3/5 dcl.init.ref] it may also be an rvalue reference */
1606 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto))
1611 Otherwise, a temporary of type "cv1 T1" is created and
1612 initialized from the initializer expression using the rules for a
1613 non-reference copy initialization. If T1 is reference-related to
1614 T2, cv1 must be the same cv-qualification as, or greater
1615 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1616 if (related_p && !at_least_as_qualified_p (to, from))
1619 /* We're generating a temporary now, but don't bind any more in the
1620 conversion (specifically, don't slice the temporary returned by a
1621 conversion operator). */
1622 flags |= LOOKUP_NO_TEMP_BIND;
1624 /* Core issue 899: When [copy-]initializing a temporary to be bound
1625 to the first parameter of a copy constructor (12.8) called with
1626 a single argument in the context of direct-initialization,
1627 explicit conversion functions are also considered.
1629 So don't set LOOKUP_ONLYCONVERTING in that case. */
1630 if (!(flags & LOOKUP_COPY_PARM))
1631 flags |= LOOKUP_ONLYCONVERTING;
1634 conv = implicit_conversion (to, from, expr, c_cast_p,
1639 conv = build_conv (ck_ref_bind, rto, conv);
1640 /* This reference binding, unlike those above, requires the
1641 creation of a temporary. */
1642 conv->need_temporary_p = true;
1643 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
1648 /* Returns the implicit conversion sequence (see [over.ics]) from type
1649 FROM to type TO. The optional expression EXPR may affect the
1650 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1651 true, this conversion is coming from a C-style cast. */
1654 implicit_conversion (tree to, tree from, tree expr, bool c_cast_p,
1659 if (from == error_mark_node || to == error_mark_node
1660 || expr == error_mark_node)
1663 /* Other flags only apply to the primary function in overload
1664 resolution, or after we've chosen one. */
1665 flags &= (LOOKUP_ONLYCONVERTING|LOOKUP_NO_CONVERSION|LOOKUP_COPY_PARM
1666 |LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND|LOOKUP_PREFER_RVALUE
1667 |LOOKUP_NO_NARROWING|LOOKUP_PROTECT);
1669 if (TREE_CODE (to) == REFERENCE_TYPE)
1670 conv = reference_binding (to, from, expr, c_cast_p, flags);
1672 conv = standard_conversion (to, from, expr, c_cast_p, flags);
1677 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1679 if (is_std_init_list (to))
1680 return build_list_conv (to, expr, flags);
1682 /* As an extension, allow list-initialization of _Complex. */
1683 if (TREE_CODE (to) == COMPLEX_TYPE)
1685 conv = build_complex_conv (to, expr, flags);
1690 /* Allow conversion from an initializer-list with one element to a
1692 if (SCALAR_TYPE_P (to))
1694 int nelts = CONSTRUCTOR_NELTS (expr);
1698 elt = build_value_init (to, tf_none);
1699 else if (nelts == 1)
1700 elt = CONSTRUCTOR_ELT (expr, 0)->value;
1702 elt = error_mark_node;
1704 conv = implicit_conversion (to, TREE_TYPE (elt), elt,
1708 conv->check_narrowing = true;
1709 if (BRACE_ENCLOSED_INITIALIZER_P (elt))
1710 /* Too many levels of braces, i.e. '{{1}}'. */
1715 else if (TREE_CODE (to) == ARRAY_TYPE)
1716 return build_array_conv (to, expr, flags);
1719 if (expr != NULL_TREE
1720 && (MAYBE_CLASS_TYPE_P (from)
1721 || MAYBE_CLASS_TYPE_P (to))
1722 && (flags & LOOKUP_NO_CONVERSION) == 0)
1724 struct z_candidate *cand;
1726 if (CLASS_TYPE_P (to)
1727 && BRACE_ENCLOSED_INITIALIZER_P (expr)
1728 && !CLASSTYPE_NON_AGGREGATE (complete_type (to)))
1729 return build_aggr_conv (to, expr, flags);
1731 cand = build_user_type_conversion_1 (to, expr, flags);
1733 conv = cand->second_conv;
1735 /* We used to try to bind a reference to a temporary here, but that
1736 is now handled after the recursive call to this function at the end
1737 of reference_binding. */
1744 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1745 functions. ARGS will not be changed until a single candidate is
1748 static struct z_candidate *
1749 add_candidate (struct z_candidate **candidates,
1750 tree fn, tree first_arg, const VEC(tree,gc) *args,
1751 size_t num_convs, conversion **convs,
1752 tree access_path, tree conversion_path,
1753 int viable, struct rejection_reason *reason)
1755 struct z_candidate *cand = (struct z_candidate *)
1756 conversion_obstack_alloc (sizeof (struct z_candidate));
1759 cand->first_arg = first_arg;
1761 cand->convs = convs;
1762 cand->num_convs = num_convs;
1763 cand->access_path = access_path;
1764 cand->conversion_path = conversion_path;
1765 cand->viable = viable;
1766 cand->reason = reason;
1767 cand->next = *candidates;
1773 /* Return the number of remaining arguments in the parameter list
1774 beginning with ARG. */
1777 remaining_arguments (tree arg)
1781 for (n = 0; arg != NULL_TREE && arg != void_list_node;
1782 arg = TREE_CHAIN (arg))
1788 /* Create an overload candidate for the function or method FN called
1789 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1790 FLAGS is passed on to implicit_conversion.
1792 This does not change ARGS.
1794 CTYPE, if non-NULL, is the type we want to pretend this function
1795 comes from for purposes of overload resolution. */
1797 static struct z_candidate *
1798 add_function_candidate (struct z_candidate **candidates,
1799 tree fn, tree ctype, tree first_arg,
1800 const VEC(tree,gc) *args, tree access_path,
1801 tree conversion_path, int flags)
1803 tree parmlist = TYPE_ARG_TYPES (TREE_TYPE (fn));
1807 tree orig_first_arg = first_arg;
1810 struct rejection_reason *reason = NULL;
1812 /* At this point we should not see any functions which haven't been
1813 explicitly declared, except for friend functions which will have
1814 been found using argument dependent lookup. */
1815 gcc_assert (!DECL_ANTICIPATED (fn) || DECL_HIDDEN_FRIEND_P (fn));
1817 /* The `this', `in_chrg' and VTT arguments to constructors are not
1818 considered in overload resolution. */
1819 if (DECL_CONSTRUCTOR_P (fn))
1821 parmlist = skip_artificial_parms_for (fn, parmlist);
1822 skip = num_artificial_parms_for (fn);
1823 if (skip > 0 && first_arg != NULL_TREE)
1826 first_arg = NULL_TREE;
1832 len = VEC_length (tree, args) - skip + (first_arg != NULL_TREE ? 1 : 0);
1833 convs = alloc_conversions (len);
1835 /* 13.3.2 - Viable functions [over.match.viable]
1836 First, to be a viable function, a candidate function shall have enough
1837 parameters to agree in number with the arguments in the list.
1839 We need to check this first; otherwise, checking the ICSes might cause
1840 us to produce an ill-formed template instantiation. */
1842 parmnode = parmlist;
1843 for (i = 0; i < len; ++i)
1845 if (parmnode == NULL_TREE || parmnode == void_list_node)
1847 parmnode = TREE_CHAIN (parmnode);
1850 if ((i < len && parmnode)
1851 || !sufficient_parms_p (parmnode))
1853 int remaining = remaining_arguments (parmnode);
1855 reason = arity_rejection (first_arg, i + remaining, len);
1857 /* When looking for a function from a subobject from an implicit
1858 copy/move constructor/operator=, don't consider anything that takes (a
1859 reference to) an unrelated type. See c++/44909 and core 1092. */
1860 else if (parmlist && (flags & LOOKUP_DEFAULTED))
1862 if (DECL_CONSTRUCTOR_P (fn))
1864 else if (DECL_ASSIGNMENT_OPERATOR_P (fn)
1865 && DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR)
1871 parmnode = chain_index (i-1, parmlist);
1872 if (!reference_related_p (non_reference (TREE_VALUE (parmnode)),
1877 /* This only applies at the top level. */
1878 flags &= ~LOOKUP_DEFAULTED;
1884 /* Second, for F to be a viable function, there shall exist for each
1885 argument an implicit conversion sequence that converts that argument
1886 to the corresponding parameter of F. */
1888 parmnode = parmlist;
1890 for (i = 0; i < len; ++i)
1892 tree arg, argtype, to_type;
1896 if (parmnode == void_list_node)
1899 if (i == 0 && first_arg != NULL_TREE)
1902 arg = VEC_index (tree, args,
1903 i + skip - (first_arg != NULL_TREE ? 1 : 0));
1904 argtype = lvalue_type (arg);
1906 is_this = (i == 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
1907 && ! DECL_CONSTRUCTOR_P (fn));
1911 tree parmtype = TREE_VALUE (parmnode);
1914 parmnode = TREE_CHAIN (parmnode);
1916 /* The type of the implicit object parameter ('this') for
1917 overload resolution is not always the same as for the
1918 function itself; conversion functions are considered to
1919 be members of the class being converted, and functions
1920 introduced by a using-declaration are considered to be
1921 members of the class that uses them.
1923 Since build_over_call ignores the ICS for the `this'
1924 parameter, we can just change the parm type. */
1925 if (ctype && is_this)
1927 parmtype = cp_build_qualified_type
1928 (ctype, cp_type_quals (TREE_TYPE (parmtype)));
1929 parmtype = build_pointer_type (parmtype);
1932 /* Core issue 899: When [copy-]initializing a temporary to be bound
1933 to the first parameter of a copy constructor (12.8) called with
1934 a single argument in the context of direct-initialization,
1935 explicit conversion functions are also considered.
1937 So set LOOKUP_COPY_PARM to let reference_binding know that
1938 it's being called in that context. We generalize the above
1939 to handle move constructors and template constructors as well;
1940 the standardese should soon be updated similarly. */
1941 if (ctype && i == 0 && (len-skip == 1)
1942 && !(flags & LOOKUP_ONLYCONVERTING)
1943 && DECL_CONSTRUCTOR_P (fn)
1944 && parmtype != error_mark_node
1945 && (same_type_ignoring_top_level_qualifiers_p
1946 (non_reference (parmtype), ctype)))
1948 lflags |= LOOKUP_COPY_PARM;
1949 /* We allow user-defined conversions within init-lists, but
1950 not for the copy constructor. */
1951 if (flags & LOOKUP_NO_COPY_CTOR_CONVERSION)
1952 lflags |= LOOKUP_NO_CONVERSION;
1955 lflags |= LOOKUP_ONLYCONVERTING;
1957 t = implicit_conversion (parmtype, argtype, arg,
1958 /*c_cast_p=*/false, lflags);
1963 t = build_identity_conv (argtype, arg);
1964 t->ellipsis_p = true;
1975 reason = arg_conversion_rejection (first_arg, i, argtype, to_type);
1982 reason = bad_arg_conversion_rejection (first_arg, i, argtype, to_type);
1987 return add_candidate (candidates, fn, orig_first_arg, args, len, convs,
1988 access_path, conversion_path, viable, reason);
1991 /* Create an overload candidate for the conversion function FN which will
1992 be invoked for expression OBJ, producing a pointer-to-function which
1993 will in turn be called with the argument list FIRST_ARG/ARGLIST,
1994 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
1995 passed on to implicit_conversion.
1997 Actually, we don't really care about FN; we care about the type it
1998 converts to. There may be multiple conversion functions that will
1999 convert to that type, and we rely on build_user_type_conversion_1 to
2000 choose the best one; so when we create our candidate, we record the type
2001 instead of the function. */
2003 static struct z_candidate *
2004 add_conv_candidate (struct z_candidate **candidates, tree fn, tree obj,
2005 tree first_arg, const VEC(tree,gc) *arglist,
2006 tree access_path, tree conversion_path)
2008 tree totype = TREE_TYPE (TREE_TYPE (fn));
2009 int i, len, viable, flags;
2010 tree parmlist, parmnode;
2012 struct rejection_reason *reason;
2014 for (parmlist = totype; TREE_CODE (parmlist) != FUNCTION_TYPE; )
2015 parmlist = TREE_TYPE (parmlist);
2016 parmlist = TYPE_ARG_TYPES (parmlist);
2018 len = VEC_length (tree, arglist) + (first_arg != NULL_TREE ? 1 : 0) + 1;
2019 convs = alloc_conversions (len);
2020 parmnode = parmlist;
2022 flags = LOOKUP_IMPLICIT;
2025 /* Don't bother looking up the same type twice. */
2026 if (*candidates && (*candidates)->fn == totype)
2029 for (i = 0; i < len; ++i)
2031 tree arg, argtype, convert_type = NULL_TREE;
2036 else if (i == 1 && first_arg != NULL_TREE)
2039 arg = VEC_index (tree, arglist,
2040 i - (first_arg != NULL_TREE ? 1 : 0) - 1);
2041 argtype = lvalue_type (arg);
2045 t = implicit_conversion (totype, argtype, arg, /*c_cast_p=*/false,
2047 convert_type = totype;
2049 else if (parmnode == void_list_node)
2053 t = implicit_conversion (TREE_VALUE (parmnode), argtype, arg,
2054 /*c_cast_p=*/false, flags);
2055 convert_type = TREE_VALUE (parmnode);
2059 t = build_identity_conv (argtype, arg);
2060 t->ellipsis_p = true;
2061 convert_type = argtype;
2071 reason = bad_arg_conversion_rejection (NULL_TREE, i, argtype, convert_type);
2078 parmnode = TREE_CHAIN (parmnode);
2082 || ! sufficient_parms_p (parmnode))
2084 int remaining = remaining_arguments (parmnode);
2086 reason = arity_rejection (NULL_TREE, i + remaining, len);
2089 return add_candidate (candidates, totype, first_arg, arglist, len, convs,
2090 access_path, conversion_path, viable, reason);
2094 build_builtin_candidate (struct z_candidate **candidates, tree fnname,
2095 tree type1, tree type2, tree *args, tree *argtypes,
2103 struct rejection_reason *reason = NULL;
2108 num_convs = args[2] ? 3 : (args[1] ? 2 : 1);
2109 convs = alloc_conversions (num_convs);
2111 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2112 conversion ops are allowed. We handle that here by just checking for
2113 boolean_type_node because other operators don't ask for it. COND_EXPR
2114 also does contextual conversion to bool for the first operand, but we
2115 handle that in build_conditional_expr, and type1 here is operand 2. */
2116 if (type1 != boolean_type_node)
2117 flags |= LOOKUP_ONLYCONVERTING;
2119 for (i = 0; i < 2; ++i)
2124 t = implicit_conversion (types[i], argtypes[i], args[i],
2125 /*c_cast_p=*/false, flags);
2129 /* We need something for printing the candidate. */
2130 t = build_identity_conv (types[i], NULL_TREE);
2131 reason = arg_conversion_rejection (NULL_TREE, i, argtypes[i], types[i]);
2136 reason = bad_arg_conversion_rejection (NULL_TREE, i, argtypes[i], types[i]);
2141 /* For COND_EXPR we rearranged the arguments; undo that now. */
2144 convs[2] = convs[1];
2145 convs[1] = convs[0];
2146 t = implicit_conversion (boolean_type_node, argtypes[2], args[2],
2147 /*c_cast_p=*/false, flags);
2153 reason = arg_conversion_rejection (NULL_TREE, 0, argtypes[2],
2158 add_candidate (candidates, fnname, /*first_arg=*/NULL_TREE, /*args=*/NULL,
2160 /*access_path=*/NULL_TREE,
2161 /*conversion_path=*/NULL_TREE,
2166 is_complete (tree t)
2168 return COMPLETE_TYPE_P (complete_type (t));
2171 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2174 promoted_arithmetic_type_p (tree type)
2178 In this section, the term promoted integral type is used to refer
2179 to those integral types which are preserved by integral promotion
2180 (including e.g. int and long but excluding e.g. char).
2181 Similarly, the term promoted arithmetic type refers to promoted
2182 integral types plus floating types. */
2183 return ((CP_INTEGRAL_TYPE_P (type)
2184 && same_type_p (type_promotes_to (type), type))
2185 || TREE_CODE (type) == REAL_TYPE);
2188 /* Create any builtin operator overload candidates for the operator in
2189 question given the converted operand types TYPE1 and TYPE2. The other
2190 args are passed through from add_builtin_candidates to
2191 build_builtin_candidate.
2193 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2194 If CODE is requires candidates operands of the same type of the kind
2195 of which TYPE1 and TYPE2 are, we add both candidates
2196 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2199 add_builtin_candidate (struct z_candidate **candidates, enum tree_code code,
2200 enum tree_code code2, tree fnname, tree type1,
2201 tree type2, tree *args, tree *argtypes, int flags)
2205 case POSTINCREMENT_EXPR:
2206 case POSTDECREMENT_EXPR:
2207 args[1] = integer_zero_node;
2208 type2 = integer_type_node;
2217 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2218 and VQ is either volatile or empty, there exist candidate operator
2219 functions of the form
2220 VQ T& operator++(VQ T&);
2221 T operator++(VQ T&, int);
2222 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2223 type other than bool, and VQ is either volatile or empty, there exist
2224 candidate operator functions of the form
2225 VQ T& operator--(VQ T&);
2226 T operator--(VQ T&, int);
2227 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2228 complete object type, and VQ is either volatile or empty, there exist
2229 candidate operator functions of the form
2230 T*VQ& operator++(T*VQ&);
2231 T*VQ& operator--(T*VQ&);
2232 T* operator++(T*VQ&, int);
2233 T* operator--(T*VQ&, int); */
2235 case POSTDECREMENT_EXPR:
2236 case PREDECREMENT_EXPR:
2237 if (TREE_CODE (type1) == BOOLEAN_TYPE)
2239 case POSTINCREMENT_EXPR:
2240 case PREINCREMENT_EXPR:
2241 if (ARITHMETIC_TYPE_P (type1) || TYPE_PTROB_P (type1))
2243 type1 = build_reference_type (type1);
2248 /* 7 For every cv-qualified or cv-unqualified object type T, there
2249 exist candidate operator functions of the form
2253 8 For every function type T, there exist candidate operator functions of
2255 T& operator*(T*); */
2258 if (TREE_CODE (type1) == POINTER_TYPE
2259 && !uses_template_parms (TREE_TYPE (type1))
2260 && (TYPE_PTROB_P (type1)
2261 || TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE))
2265 /* 9 For every type T, there exist candidate operator functions of the form
2268 10For every promoted arithmetic type T, there exist candidate operator
2269 functions of the form
2273 case UNARY_PLUS_EXPR: /* unary + */
2274 if (TREE_CODE (type1) == POINTER_TYPE)
2277 if (ARITHMETIC_TYPE_P (type1))
2281 /* 11For every promoted integral type T, there exist candidate operator
2282 functions of the form
2286 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1))
2290 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2291 is the same type as C2 or is a derived class of C2, T is a complete
2292 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2293 there exist candidate operator functions of the form
2294 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2295 where CV12 is the union of CV1 and CV2. */
2298 if (TREE_CODE (type1) == POINTER_TYPE
2299 && TYPE_PTR_TO_MEMBER_P (type2))
2301 tree c1 = TREE_TYPE (type1);
2302 tree c2 = TYPE_PTRMEM_CLASS_TYPE (type2);
2304 if (MAYBE_CLASS_TYPE_P (c1) && DERIVED_FROM_P (c2, c1)
2305 && (TYPE_PTRMEMFUNC_P (type2)
2306 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2))))
2311 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2312 didate operator functions of the form
2317 bool operator<(L, R);
2318 bool operator>(L, R);
2319 bool operator<=(L, R);
2320 bool operator>=(L, R);
2321 bool operator==(L, R);
2322 bool operator!=(L, R);
2323 where LR is the result of the usual arithmetic conversions between
2326 14For every pair of types T and I, where T is a cv-qualified or cv-
2327 unqualified complete object type and I is a promoted integral type,
2328 there exist candidate operator functions of the form
2329 T* operator+(T*, I);
2330 T& operator[](T*, I);
2331 T* operator-(T*, I);
2332 T* operator+(I, T*);
2333 T& operator[](I, T*);
2335 15For every T, where T is a pointer to complete object type, there exist
2336 candidate operator functions of the form112)
2337 ptrdiff_t operator-(T, T);
2339 16For every pointer or enumeration type T, there exist candidate operator
2340 functions of the form
2341 bool operator<(T, T);
2342 bool operator>(T, T);
2343 bool operator<=(T, T);
2344 bool operator>=(T, T);
2345 bool operator==(T, T);
2346 bool operator!=(T, T);
2348 17For every pointer to member type T, there exist candidate operator
2349 functions of the form
2350 bool operator==(T, T);
2351 bool operator!=(T, T); */
2354 if (TYPE_PTROB_P (type1) && TYPE_PTROB_P (type2))
2356 if (TYPE_PTROB_P (type1)
2357 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2359 type2 = ptrdiff_type_node;
2363 case TRUNC_DIV_EXPR:
2364 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2370 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2371 || (TYPE_PTRMEM_P (type1) && TYPE_PTRMEM_P (type2)))
2373 if (TYPE_PTR_TO_MEMBER_P (type1) && null_ptr_cst_p (args[1]))
2378 if (TYPE_PTR_TO_MEMBER_P (type2) && null_ptr_cst_p (args[0]))
2390 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2392 if (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2394 if (TREE_CODE (type1) == ENUMERAL_TYPE
2395 && TREE_CODE (type2) == ENUMERAL_TYPE)
2397 if (TYPE_PTR_P (type1)
2398 && null_ptr_cst_p (args[1])
2399 && !uses_template_parms (type1))
2404 if (null_ptr_cst_p (args[0])
2405 && TYPE_PTR_P (type2)
2406 && !uses_template_parms (type2))
2414 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2417 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && TYPE_PTROB_P (type2))
2419 type1 = ptrdiff_type_node;
2422 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2424 type2 = ptrdiff_type_node;
2429 /* 18For every pair of promoted integral types L and R, there exist candi-
2430 date operator functions of the form
2437 where LR is the result of the usual arithmetic conversions between
2440 case TRUNC_MOD_EXPR:
2446 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2450 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2451 type, VQ is either volatile or empty, and R is a promoted arithmetic
2452 type, there exist candidate operator functions of the form
2453 VQ L& operator=(VQ L&, R);
2454 VQ L& operator*=(VQ L&, R);
2455 VQ L& operator/=(VQ L&, R);
2456 VQ L& operator+=(VQ L&, R);
2457 VQ L& operator-=(VQ L&, R);
2459 20For every pair T, VQ), where T is any type and VQ is either volatile
2460 or empty, there exist candidate operator functions of the form
2461 T*VQ& operator=(T*VQ&, T*);
2463 21For every pair T, VQ), where T is a pointer to member type and VQ is
2464 either volatile or empty, there exist candidate operator functions of
2466 VQ T& operator=(VQ T&, T);
2468 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2469 unqualified complete object type, VQ is either volatile or empty, and
2470 I is a promoted integral type, there exist candidate operator func-
2472 T*VQ& operator+=(T*VQ&, I);
2473 T*VQ& operator-=(T*VQ&, I);
2475 23For every triple L, VQ, R), where L is an integral or enumeration
2476 type, VQ is either volatile or empty, and R is a promoted integral
2477 type, there exist candidate operator functions of the form
2479 VQ L& operator%=(VQ L&, R);
2480 VQ L& operator<<=(VQ L&, R);
2481 VQ L& operator>>=(VQ L&, R);
2482 VQ L& operator&=(VQ L&, R);
2483 VQ L& operator^=(VQ L&, R);
2484 VQ L& operator|=(VQ L&, R); */
2491 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2493 type2 = ptrdiff_type_node;
2497 case TRUNC_DIV_EXPR:
2498 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2502 case TRUNC_MOD_EXPR:
2508 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2513 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2515 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2516 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2517 || (TYPE_PTRMEM_P (type1) && TYPE_PTRMEM_P (type2))
2518 || ((TYPE_PTRMEMFUNC_P (type1)
2519 || TREE_CODE (type1) == POINTER_TYPE)
2520 && null_ptr_cst_p (args[1])))
2530 type1 = build_reference_type (type1);
2536 For every pair of promoted arithmetic types L and R, there
2537 exist candidate operator functions of the form
2539 LR operator?(bool, L, R);
2541 where LR is the result of the usual arithmetic conversions
2542 between types L and R.
2544 For every type T, where T is a pointer or pointer-to-member
2545 type, there exist candidate operator functions of the form T
2546 operator?(bool, T, T); */
2548 if (promoted_arithmetic_type_p (type1)
2549 && promoted_arithmetic_type_p (type2))
2553 /* Otherwise, the types should be pointers. */
2554 if (!(TYPE_PTR_P (type1) || TYPE_PTR_TO_MEMBER_P (type1))
2555 || !(TYPE_PTR_P (type2) || TYPE_PTR_TO_MEMBER_P (type2)))
2558 /* We don't check that the two types are the same; the logic
2559 below will actually create two candidates; one in which both
2560 parameter types are TYPE1, and one in which both parameter
2566 if (ARITHMETIC_TYPE_P (type1))
2574 /* If we're dealing with two pointer types or two enumeral types,
2575 we need candidates for both of them. */
2576 if (type2 && !same_type_p (type1, type2)
2577 && TREE_CODE (type1) == TREE_CODE (type2)
2578 && (TREE_CODE (type1) == REFERENCE_TYPE
2579 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2580 || (TYPE_PTRMEM_P (type1) && TYPE_PTRMEM_P (type2))
2581 || TYPE_PTRMEMFUNC_P (type1)
2582 || MAYBE_CLASS_TYPE_P (type1)
2583 || TREE_CODE (type1) == ENUMERAL_TYPE))
2585 if (TYPE_PTR_P (type1) || TYPE_PTR_TO_MEMBER_P (type1))
2587 tree cptype = composite_pointer_type (type1, type2,
2592 if (cptype != error_mark_node)
2594 build_builtin_candidate
2595 (candidates, fnname, cptype, cptype, args, argtypes, flags);
2600 build_builtin_candidate
2601 (candidates, fnname, type1, type1, args, argtypes, flags);
2602 build_builtin_candidate
2603 (candidates, fnname, type2, type2, args, argtypes, flags);
2607 build_builtin_candidate
2608 (candidates, fnname, type1, type2, args, argtypes, flags);
2612 type_decays_to (tree type)
2614 if (TREE_CODE (type) == ARRAY_TYPE)
2615 return build_pointer_type (TREE_TYPE (type));
2616 if (TREE_CODE (type) == FUNCTION_TYPE)
2617 return build_pointer_type (type);
2621 /* There are three conditions of builtin candidates:
2623 1) bool-taking candidates. These are the same regardless of the input.
2624 2) pointer-pair taking candidates. These are generated for each type
2625 one of the input types converts to.
2626 3) arithmetic candidates. According to the standard, we should generate
2627 all of these, but I'm trying not to...
2629 Here we generate a superset of the possible candidates for this particular
2630 case. That is a subset of the full set the standard defines, plus some
2631 other cases which the standard disallows. add_builtin_candidate will
2632 filter out the invalid set. */
2635 add_builtin_candidates (struct z_candidate **candidates, enum tree_code code,
2636 enum tree_code code2, tree fnname, tree *args,
2641 tree type, argtypes[3], t;
2642 /* TYPES[i] is the set of possible builtin-operator parameter types
2643 we will consider for the Ith argument. */
2644 VEC(tree,gc) *types[2];
2647 for (i = 0; i < 3; ++i)
2650 argtypes[i] = unlowered_expr_type (args[i]);
2652 argtypes[i] = NULL_TREE;
2657 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2658 and VQ is either volatile or empty, there exist candidate operator
2659 functions of the form
2660 VQ T& operator++(VQ T&); */
2662 case POSTINCREMENT_EXPR:
2663 case PREINCREMENT_EXPR:
2664 case POSTDECREMENT_EXPR:
2665 case PREDECREMENT_EXPR:
2670 /* 24There also exist candidate operator functions of the form
2671 bool operator!(bool);
2672 bool operator&&(bool, bool);
2673 bool operator||(bool, bool); */
2675 case TRUTH_NOT_EXPR:
2676 build_builtin_candidate
2677 (candidates, fnname, boolean_type_node,
2678 NULL_TREE, args, argtypes, flags);
2681 case TRUTH_ORIF_EXPR:
2682 case TRUTH_ANDIF_EXPR:
2683 build_builtin_candidate
2684 (candidates, fnname, boolean_type_node,
2685 boolean_type_node, args, argtypes, flags);
2707 types[0] = make_tree_vector ();
2708 types[1] = make_tree_vector ();
2710 for (i = 0; i < 2; ++i)
2714 else if (MAYBE_CLASS_TYPE_P (argtypes[i]))
2718 if (i == 0 && code == MODIFY_EXPR && code2 == NOP_EXPR)
2721 convs = lookup_conversions (argtypes[i]);
2723 if (code == COND_EXPR)
2725 if (real_lvalue_p (args[i]))
2726 VEC_safe_push (tree, gc, types[i],
2727 build_reference_type (argtypes[i]));
2729 VEC_safe_push (tree, gc, types[i],
2730 TYPE_MAIN_VARIANT (argtypes[i]));
2736 for (; convs; convs = TREE_CHAIN (convs))
2738 type = TREE_TYPE (convs);
2741 && (TREE_CODE (type) != REFERENCE_TYPE
2742 || CP_TYPE_CONST_P (TREE_TYPE (type))))
2745 if (code == COND_EXPR && TREE_CODE (type) == REFERENCE_TYPE)
2746 VEC_safe_push (tree, gc, types[i], type);
2748 type = non_reference (type);
2749 if (i != 0 || ! ref1)
2751 type = cv_unqualified (type_decays_to (type));
2752 if (enum_p && TREE_CODE (type) == ENUMERAL_TYPE)
2753 VEC_safe_push (tree, gc, types[i], type);
2754 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
2755 type = type_promotes_to (type);
2758 if (! vec_member (type, types[i]))
2759 VEC_safe_push (tree, gc, types[i], type);
2764 if (code == COND_EXPR && real_lvalue_p (args[i]))
2765 VEC_safe_push (tree, gc, types[i],
2766 build_reference_type (argtypes[i]));
2767 type = non_reference (argtypes[i]);
2768 if (i != 0 || ! ref1)
2770 type = cv_unqualified (type_decays_to (type));
2771 if (enum_p && UNSCOPED_ENUM_P (type))
2772 VEC_safe_push (tree, gc, types[i], type);
2773 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
2774 type = type_promotes_to (type);
2776 VEC_safe_push (tree, gc, types[i], type);
2780 /* Run through the possible parameter types of both arguments,
2781 creating candidates with those parameter types. */
2782 FOR_EACH_VEC_ELT_REVERSE (tree, types[0], ix, t)
2787 if (!VEC_empty (tree, types[1]))
2788 FOR_EACH_VEC_ELT_REVERSE (tree, types[1], jx, u)
2789 add_builtin_candidate
2790 (candidates, code, code2, fnname, t,
2791 u, args, argtypes, flags);
2793 add_builtin_candidate
2794 (candidates, code, code2, fnname, t,
2795 NULL_TREE, args, argtypes, flags);
2798 release_tree_vector (types[0]);
2799 release_tree_vector (types[1]);
2803 /* If TMPL can be successfully instantiated as indicated by
2804 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2806 TMPL is the template. EXPLICIT_TARGS are any explicit template
2807 arguments. ARGLIST is the arguments provided at the call-site.
2808 This does not change ARGLIST. The RETURN_TYPE is the desired type
2809 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
2810 as for add_function_candidate. If an OBJ is supplied, FLAGS and
2811 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
2813 static struct z_candidate*
2814 add_template_candidate_real (struct z_candidate **candidates, tree tmpl,
2815 tree ctype, tree explicit_targs, tree first_arg,
2816 const VEC(tree,gc) *arglist, tree return_type,
2817 tree access_path, tree conversion_path,
2818 int flags, tree obj, unification_kind_t strict)
2820 int ntparms = DECL_NTPARMS (tmpl);
2821 tree targs = make_tree_vec (ntparms);
2822 unsigned int len = VEC_length (tree, arglist);
2823 unsigned int nargs = (first_arg == NULL_TREE ? 0 : 1) + len;
2824 unsigned int skip_without_in_chrg = 0;
2825 tree first_arg_without_in_chrg = first_arg;
2826 tree *args_without_in_chrg;
2827 unsigned int nargs_without_in_chrg;
2828 unsigned int ia, ix;
2830 struct z_candidate *cand;
2833 struct rejection_reason *reason = NULL;
2836 /* We don't do deduction on the in-charge parameter, the VTT
2837 parameter or 'this'. */
2838 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl))
2840 if (first_arg_without_in_chrg != NULL_TREE)
2841 first_arg_without_in_chrg = NULL_TREE;
2843 ++skip_without_in_chrg;
2846 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl)
2847 || DECL_BASE_CONSTRUCTOR_P (tmpl))
2848 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl)))
2850 if (first_arg_without_in_chrg != NULL_TREE)
2851 first_arg_without_in_chrg = NULL_TREE;
2853 ++skip_without_in_chrg;
2856 if (len < skip_without_in_chrg)
2859 nargs_without_in_chrg = ((first_arg_without_in_chrg != NULL_TREE ? 1 : 0)
2860 + (len - skip_without_in_chrg));
2861 args_without_in_chrg = XALLOCAVEC (tree, nargs_without_in_chrg);
2863 if (first_arg_without_in_chrg != NULL_TREE)
2865 args_without_in_chrg[ia] = first_arg_without_in_chrg;
2868 for (ix = skip_without_in_chrg;
2869 VEC_iterate (tree, arglist, ix, arg);
2872 args_without_in_chrg[ia] = arg;
2875 gcc_assert (ia == nargs_without_in_chrg);
2877 errs = errorcount+sorrycount;
2878 i = fn_type_unification (tmpl, explicit_targs, targs,
2879 args_without_in_chrg,
2880 nargs_without_in_chrg,
2881 return_type, strict, flags, false);
2885 /* Don't repeat unification later if it already resulted in errors. */
2886 if (errorcount+sorrycount == errs)
2887 reason = template_unification_rejection (tmpl, explicit_targs,
2888 targs, args_without_in_chrg,
2889 nargs_without_in_chrg,
2890 return_type, strict, flags);
2892 reason = template_unification_error_rejection ();
2896 fn = instantiate_template (tmpl, targs, tf_none);
2897 if (fn == error_mark_node)
2899 reason = template_instantiation_rejection (tmpl, targs);
2905 A member function template is never instantiated to perform the
2906 copy of a class object to an object of its class type.
2908 It's a little unclear what this means; the standard explicitly
2909 does allow a template to be used to copy a class. For example,
2914 template <class T> A(const T&);
2917 void g () { A a (f ()); }
2919 the member template will be used to make the copy. The section
2920 quoted above appears in the paragraph that forbids constructors
2921 whose only parameter is (a possibly cv-qualified variant of) the
2922 class type, and a logical interpretation is that the intent was
2923 to forbid the instantiation of member templates which would then
2925 if (DECL_CONSTRUCTOR_P (fn) && nargs == 2)
2927 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (fn);
2928 if (arg_types && same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types)),
2931 reason = invalid_copy_with_fn_template_rejection ();
2936 if (obj != NULL_TREE)
2937 /* Aha, this is a conversion function. */
2938 cand = add_conv_candidate (candidates, fn, obj, first_arg, arglist,
2939 access_path, conversion_path);
2941 cand = add_function_candidate (candidates, fn, ctype,
2942 first_arg, arglist, access_path,
2943 conversion_path, flags);
2944 if (DECL_TI_TEMPLATE (fn) != tmpl)
2945 /* This situation can occur if a member template of a template
2946 class is specialized. Then, instantiate_template might return
2947 an instantiation of the specialization, in which case the
2948 DECL_TI_TEMPLATE field will point at the original
2949 specialization. For example:
2951 template <class T> struct S { template <class U> void f(U);
2952 template <> void f(int) {}; };
2956 Here, TMPL will be template <class U> S<double>::f(U).
2957 And, instantiate template will give us the specialization
2958 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
2959 for this will point at template <class T> template <> S<T>::f(int),
2960 so that we can find the definition. For the purposes of
2961 overload resolution, however, we want the original TMPL. */
2962 cand->template_decl = build_template_info (tmpl, targs);
2964 cand->template_decl = DECL_TEMPLATE_INFO (fn);
2965 cand->explicit_targs = explicit_targs;
2969 return add_candidate (candidates, tmpl, first_arg, arglist, nargs, NULL,
2970 access_path, conversion_path, 0, reason);
2974 static struct z_candidate *
2975 add_template_candidate (struct z_candidate **candidates, tree tmpl, tree ctype,
2976 tree explicit_targs, tree first_arg,
2977 const VEC(tree,gc) *arglist, tree return_type,
2978 tree access_path, tree conversion_path, int flags,
2979 unification_kind_t strict)
2982 add_template_candidate_real (candidates, tmpl, ctype,
2983 explicit_targs, first_arg, arglist,
2984 return_type, access_path, conversion_path,
2985 flags, NULL_TREE, strict);
2989 static struct z_candidate *
2990 add_template_conv_candidate (struct z_candidate **candidates, tree tmpl,
2991 tree obj, tree first_arg,
2992 const VEC(tree,gc) *arglist,
2993 tree return_type, tree access_path,
2994 tree conversion_path)
2997 add_template_candidate_real (candidates, tmpl, NULL_TREE, NULL_TREE,
2998 first_arg, arglist, return_type, access_path,
2999 conversion_path, 0, obj, DEDUCE_CONV);
3002 /* The CANDS are the set of candidates that were considered for
3003 overload resolution. Return the set of viable candidates, or CANDS
3004 if none are viable. If any of the candidates were viable, set
3005 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3006 considered viable only if it is strictly viable. */
3008 static struct z_candidate*
3009 splice_viable (struct z_candidate *cands,
3013 struct z_candidate *viable;
3014 struct z_candidate **last_viable;
3015 struct z_candidate **cand;
3017 /* Be strict inside templates, since build_over_call won't actually
3018 do the conversions to get pedwarns. */
3019 if (processing_template_decl)
3023 last_viable = &viable;
3024 *any_viable_p = false;
3029 struct z_candidate *c = *cand;
3030 if (strict_p ? c->viable == 1 : c->viable)
3035 last_viable = &c->next;
3036 *any_viable_p = true;
3042 return viable ? viable : cands;
3046 any_strictly_viable (struct z_candidate *cands)
3048 for (; cands; cands = cands->next)
3049 if (cands->viable == 1)
3054 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3055 words, it is about to become the "this" pointer for a member
3056 function call. Take the address of the object. */
3059 build_this (tree obj)
3061 /* In a template, we are only concerned about the type of the
3062 expression, so we can take a shortcut. */
3063 if (processing_template_decl)
3064 return build_address (obj);
3066 return cp_build_addr_expr (obj, tf_warning_or_error);
3069 /* Returns true iff functions are equivalent. Equivalent functions are
3070 not '==' only if one is a function-local extern function or if
3071 both are extern "C". */
3074 equal_functions (tree fn1, tree fn2)
3076 if (TREE_CODE (fn1) != TREE_CODE (fn2))
3078 if (TREE_CODE (fn1) == TEMPLATE_DECL)
3080 if (DECL_LOCAL_FUNCTION_P (fn1) || DECL_LOCAL_FUNCTION_P (fn2)
3081 || DECL_EXTERN_C_FUNCTION_P (fn1))
3082 return decls_match (fn1, fn2);
3086 /* Print information about a candidate being rejected due to INFO. */
3089 print_conversion_rejection (location_t loc, struct conversion_info *info)
3091 if (info->n_arg == -1)
3092 /* Conversion of implicit `this' argument failed. */
3093 inform (loc, " no known conversion for implicit "
3094 "%<this%> parameter from %qT to %qT",
3095 info->from_type, info->to_type);
3097 inform (loc, " no known conversion for argument %d from %qT to %qT",
3098 info->n_arg+1, info->from_type, info->to_type);
3101 /* Print information about a candidate with WANT parameters and we found
3105 print_arity_information (location_t loc, unsigned int have, unsigned int want)
3107 inform_n (loc, want,
3108 " candidate expects %d argument, %d provided",
3109 " candidate expects %d arguments, %d provided",
3113 /* Print information about one overload candidate CANDIDATE. MSGSTR
3114 is the text to print before the candidate itself.
3116 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3117 to have been run through gettext by the caller. This wart makes
3118 life simpler in print_z_candidates and for the translators. */
3121 print_z_candidate (const char *msgstr, struct z_candidate *candidate)
3123 const char *msg = (msgstr == NULL
3125 : ACONCAT ((msgstr, " ", NULL)));
3126 location_t loc = location_of (candidate->fn);
3128 if (TREE_CODE (candidate->fn) == IDENTIFIER_NODE)
3130 if (candidate->num_convs == 3)
3131 inform (input_location, "%s%D(%T, %T, %T) <built-in>", msg, candidate->fn,
3132 candidate->convs[0]->type,
3133 candidate->convs[1]->type,
3134 candidate->convs[2]->type);
3135 else if (candidate->num_convs == 2)
3136 inform (input_location, "%s%D(%T, %T) <built-in>", msg, candidate->fn,
3137 candidate->convs[0]->type,
3138 candidate->convs[1]->type);
3140 inform (input_location, "%s%D(%T) <built-in>", msg, candidate->fn,
3141 candidate->convs[0]->type);
3143 else if (TYPE_P (candidate->fn))
3144 inform (input_location, "%s%T <conversion>", msg, candidate->fn);
3145 else if (candidate->viable == -1)
3146 inform (loc, "%s%#D <near match>", msg, candidate->fn);
3147 else if (DECL_DELETED_FN (STRIP_TEMPLATE (candidate->fn)))
3148 inform (loc, "%s%#D <deleted>", msg, candidate->fn);
3150 inform (loc, "%s%#D", msg, candidate->fn);
3151 /* Give the user some information about why this candidate failed. */
3152 if (candidate->reason != NULL)
3154 struct rejection_reason *r = candidate->reason;
3159 print_arity_information (loc, r->u.arity.actual,
3160 r->u.arity.expected);
3162 case rr_arg_conversion:
3163 print_conversion_rejection (loc, &r->u.conversion);
3165 case rr_bad_arg_conversion:
3166 print_conversion_rejection (loc, &r->u.bad_conversion);
3168 case rr_explicit_conversion:
3169 inform (loc, " return type %qT of explicit conversion function "
3170 "cannot be converted to %qT with a qualification "
3171 "conversion", r->u.conversion.from_type,
3172 r->u.conversion.to_type);
3174 case rr_template_conversion:
3175 inform (loc, " conversion from return type %qT of template "
3176 "conversion function specialization to %qT is not an "
3177 "exact match", r->u.conversion.from_type,
3178 r->u.conversion.to_type);
3180 case rr_template_unification:
3181 /* We use template_unification_error_rejection if unification caused
3182 actual non-SFINAE errors, in which case we don't need to repeat
3184 if (r->u.template_unification.tmpl == NULL_TREE)
3186 inform (loc, " substitution of deduced template arguments "
3187 "resulted in errors seen above");
3190 /* Re-run template unification with diagnostics. */
3191 inform (loc, " template argument deduction/substitution failed:");
3192 fn_type_unification (r->u.template_unification.tmpl,
3193 r->u.template_unification.explicit_targs,
3194 r->u.template_unification.targs,
3195 r->u.template_unification.args,
3196 r->u.template_unification.nargs,
3197 r->u.template_unification.return_type,
3198 r->u.template_unification.strict,
3199 r->u.template_unification.flags,
3202 case rr_template_instantiation:
3203 /* Re-run template instantiation with diagnostics. */
3204 instantiate_template (r->u.template_instantiation.tmpl,
3205 r->u.template_instantiation.targs,
3206 tf_warning_or_error);
3208 case rr_invalid_copy:
3210 " a constructor taking a single argument of its own "
3211 "class type is invalid");
3215 /* This candidate didn't have any issues or we failed to
3216 handle a particular code. Either way... */
3223 print_z_candidates (location_t loc, struct z_candidate *candidates)
3225 struct z_candidate *cand1;
3226 struct z_candidate **cand2;
3232 /* Remove non-viable deleted candidates. */
3234 for (cand2 = &cand1; *cand2; )
3236 if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL
3237 && !(*cand2)->viable
3238 && DECL_DELETED_FN ((*cand2)->fn))
3239 *cand2 = (*cand2)->next;
3241 cand2 = &(*cand2)->next;
3243 /* ...if there are any non-deleted ones. */
3247 /* There may be duplicates in the set of candidates. We put off
3248 checking this condition as long as possible, since we have no way
3249 to eliminate duplicates from a set of functions in less than n^2
3250 time. Now we are about to emit an error message, so it is more
3251 permissible to go slowly. */
3252 for (cand1 = candidates; cand1; cand1 = cand1->next)
3254 tree fn = cand1->fn;
3255 /* Skip builtin candidates and conversion functions. */
3258 cand2 = &cand1->next;
3261 if (DECL_P ((*cand2)->fn)
3262 && equal_functions (fn, (*cand2)->fn))
3263 *cand2 = (*cand2)->next;
3265 cand2 = &(*cand2)->next;
3269 for (n_candidates = 0, cand1 = candidates; cand1; cand1 = cand1->next)
3272 inform_n (loc, n_candidates, "candidate is:", "candidates are:");
3273 for (; candidates; candidates = candidates->next)
3274 print_z_candidate (NULL, candidates);
3277 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3278 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3279 the result of the conversion function to convert it to the final
3280 desired type. Merge the two sequences into a single sequence,
3281 and return the merged sequence. */
3284 merge_conversion_sequences (conversion *user_seq, conversion *std_seq)
3287 bool bad = user_seq->bad_p;
3289 gcc_assert (user_seq->kind == ck_user);
3291 /* Find the end of the second conversion sequence. */
3292 for (t = &std_seq; (*t)->kind != ck_identity; t = &((*t)->u.next))
3294 /* The entire sequence is a user-conversion sequence. */
3295 (*t)->user_conv_p = true;
3300 /* Replace the identity conversion with the user conversion
3307 /* Handle overload resolution for initializing an object of class type from
3308 an initializer list. First we look for a suitable constructor that
3309 takes a std::initializer_list; if we don't find one, we then look for a
3310 non-list constructor.
3312 Parameters are as for add_candidates, except that the arguments are in
3313 the form of a CONSTRUCTOR (the initializer list) rather than a VEC, and
3314 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3317 add_list_candidates (tree fns, tree first_arg,
3318 tree init_list, tree totype,
3319 tree explicit_targs, bool template_only,
3320 tree conversion_path, tree access_path,
3322 struct z_candidate **candidates)
3326 gcc_assert (*candidates == NULL);
3328 /* For list-initialization we consider explicit constructors, but
3329 give an error if one is selected. */
3330 flags &= ~LOOKUP_ONLYCONVERTING;
3331 /* And we don't allow narrowing conversions. We also use this flag to
3332 avoid the copy constructor call for copy-list-initialization. */
3333 flags |= LOOKUP_NO_NARROWING;
3335 /* Always use the default constructor if the list is empty (DR 990). */
3336 if (CONSTRUCTOR_NELTS (init_list) == 0
3337 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
3339 /* If the class has a list ctor, try passing the list as a single
3340 argument first, but only consider list ctors. */
3341 else if (TYPE_HAS_LIST_CTOR (totype))
3343 flags |= LOOKUP_LIST_ONLY;
3344 args = make_tree_vector_single (init_list);
3345 add_candidates (fns, first_arg, args, NULL_TREE,
3346 explicit_targs, template_only, conversion_path,
3347 access_path, flags, candidates);
3348 if (any_strictly_viable (*candidates))
3352 args = ctor_to_vec (init_list);
3354 /* We aren't looking for list-ctors anymore. */
3355 flags &= ~LOOKUP_LIST_ONLY;
3356 /* We allow more user-defined conversions within an init-list. */
3357 flags &= ~LOOKUP_NO_CONVERSION;
3358 /* But not for the copy ctor. */
3359 flags |= LOOKUP_NO_COPY_CTOR_CONVERSION;
3361 add_candidates (fns, first_arg, args, NULL_TREE,
3362 explicit_targs, template_only, conversion_path,
3363 access_path, flags, candidates);
3366 /* Returns the best overload candidate to perform the requested
3367 conversion. This function is used for three the overloading situations
3368 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3369 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3370 per [dcl.init.ref], so we ignore temporary bindings. */
3372 static struct z_candidate *
3373 build_user_type_conversion_1 (tree totype, tree expr, int flags)
3375 struct z_candidate *candidates, *cand;
3376 tree fromtype = TREE_TYPE (expr);
3377 tree ctors = NULL_TREE;
3378 tree conv_fns = NULL_TREE;
3379 conversion *conv = NULL;
3380 tree first_arg = NULL_TREE;
3381 VEC(tree,gc) *args = NULL;
3385 /* We represent conversion within a hierarchy using RVALUE_CONV and
3386 BASE_CONV, as specified by [over.best.ics]; these become plain
3387 constructor calls, as specified in [dcl.init]. */
3388 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype) || !MAYBE_CLASS_TYPE_P (totype)
3389 || !DERIVED_FROM_P (totype, fromtype));
3391 if (MAYBE_CLASS_TYPE_P (totype))
3392 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3393 creating a garbage BASELINK; constructors can't be inherited. */
3394 ctors = lookup_fnfields_slot (totype, complete_ctor_identifier);
3396 if (MAYBE_CLASS_TYPE_P (fromtype))
3398 tree to_nonref = non_reference (totype);
3399 if (same_type_ignoring_top_level_qualifiers_p (to_nonref, fromtype) ||
3400 (CLASS_TYPE_P (to_nonref) && CLASS_TYPE_P (fromtype)
3401 && DERIVED_FROM_P (to_nonref, fromtype)))
3403 /* [class.conv.fct] A conversion function is never used to
3404 convert a (possibly cv-qualified) object to the (possibly
3405 cv-qualified) same object type (or a reference to it), to a
3406 (possibly cv-qualified) base class of that type (or a
3407 reference to it)... */
3410 conv_fns = lookup_conversions (fromtype);
3414 flags |= LOOKUP_NO_CONVERSION;
3415 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3416 flags |= LOOKUP_NO_NARROWING;
3418 /* It's OK to bind a temporary for converting constructor arguments, but
3419 not in converting the return value of a conversion operator. */
3420 convflags = ((flags & LOOKUP_NO_TEMP_BIND) | LOOKUP_NO_CONVERSION);
3421 flags &= ~LOOKUP_NO_TEMP_BIND;
3425 int ctorflags = flags;
3427 first_arg = build_int_cst (build_pointer_type (totype), 0);
3429 /* We should never try to call the abstract or base constructor
3431 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors))
3432 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors)));
3434 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3436 /* List-initialization. */
3437 add_list_candidates (ctors, first_arg, expr, totype, NULL_TREE,
3438 false, TYPE_BINFO (totype), TYPE_BINFO (totype),
3439 ctorflags, &candidates);
3443 args = make_tree_vector_single (expr);
3444 add_candidates (ctors, first_arg, args, NULL_TREE, NULL_TREE, false,
3445 TYPE_BINFO (totype), TYPE_BINFO (totype),
3446 ctorflags, &candidates);
3449 for (cand = candidates; cand; cand = cand->next)
3451 cand->second_conv = build_identity_conv (totype, NULL_TREE);
3453 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3454 set, then this is copy-initialization. In that case, "The
3455 result of the call is then used to direct-initialize the
3456 object that is the destination of the copy-initialization."
3459 We represent this in the conversion sequence with an
3460 rvalue conversion, which means a constructor call. */
3461 if (TREE_CODE (totype) != REFERENCE_TYPE
3462 && !(convflags & LOOKUP_NO_TEMP_BIND))
3464 = build_conv (ck_rvalue, totype, cand->second_conv);
3469 first_arg = build_this (expr);
3471 for (; conv_fns; conv_fns = TREE_CHAIN (conv_fns))
3473 tree conversion_path = TREE_PURPOSE (conv_fns);
3474 struct z_candidate *old_candidates;
3476 /* If we are called to convert to a reference type, we are trying to
3477 find a direct binding, so don't even consider temporaries. If
3478 we don't find a direct binding, the caller will try again to
3479 look for a temporary binding. */
3480 if (TREE_CODE (totype) == REFERENCE_TYPE)
3481 convflags |= LOOKUP_NO_TEMP_BIND;
3483 old_candidates = candidates;
3484 add_candidates (TREE_VALUE (conv_fns), first_arg, NULL, totype,
3486 conversion_path, TYPE_BINFO (fromtype),
3487 flags, &candidates);
3489 for (cand = candidates; cand != old_candidates; cand = cand->next)
3491 tree rettype = TREE_TYPE (TREE_TYPE (cand->fn));
3493 = implicit_conversion (totype,
3496 /*c_cast_p=*/false, convflags);
3498 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3499 copy-initialization. In that case, "The result of the
3500 call is then used to direct-initialize the object that is
3501 the destination of the copy-initialization." [dcl.init]
3503 We represent this in the conversion sequence with an
3504 rvalue conversion, which means a constructor call. But
3505 don't add a second rvalue conversion if there's already
3506 one there. Which there really shouldn't be, but it's
3507 harmless since we'd add it here anyway. */
3508 if (ics && MAYBE_CLASS_TYPE_P (totype) && ics->kind != ck_rvalue
3509 && !(convflags & LOOKUP_NO_TEMP_BIND))
3510 ics = build_conv (ck_rvalue, totype, ics);
3512 cand->second_conv = ics;
3517 cand->reason = arg_conversion_rejection (NULL_TREE, -1,
3520 else if (DECL_NONCONVERTING_P (cand->fn)
3521 && ics->rank > cr_exact)
3523 /* 13.3.1.5: For direct-initialization, those explicit
3524 conversion functions that are not hidden within S and
3525 yield type T or a type that can be converted to type T
3526 with a qualification conversion (4.4) are also candidate
3528 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3529 I've raised this issue with the committee. --jason 9/2011 */
3531 cand->reason = explicit_conversion_rejection (rettype, totype);
3533 else if (cand->viable == 1 && ics->bad_p)
3537 = bad_arg_conversion_rejection (NULL_TREE, -1,
3540 else if (primary_template_instantiation_p (cand->fn)
3541 && ics->rank > cr_exact)
3543 /* 13.3.3.1.2: If the user-defined conversion is specified by
3544 a specialization of a conversion function template, the
3545 second standard conversion sequence shall have exact match
3548 cand->reason = template_conversion_rejection (rettype, totype);
3553 candidates = splice_viable (candidates, pedantic, &any_viable_p);
3557 release_tree_vector (args);
3561 cand = tourney (candidates);
3564 if (flags & LOOKUP_COMPLAIN)
3566 error ("conversion from %qT to %qT is ambiguous",
3568 print_z_candidates (location_of (expr), candidates);
3571 cand = candidates; /* any one will do */
3572 cand->second_conv = build_ambiguous_conv (totype, expr);
3573 cand->second_conv->user_conv_p = true;
3574 if (!any_strictly_viable (candidates))
3575 cand->second_conv->bad_p = true;
3576 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3577 ambiguous conversion is no worse than another user-defined
3583 /* Build the user conversion sequence. */
3586 (DECL_CONSTRUCTOR_P (cand->fn)
3587 ? totype : non_reference (TREE_TYPE (TREE_TYPE (cand->fn)))),
3588 build_identity_conv (TREE_TYPE (expr), expr));
3590 if (cand->viable == -1)
3593 /* Remember that this was a list-initialization. */
3594 if (flags & LOOKUP_NO_NARROWING)
3595 conv->check_narrowing = true;
3597 /* Combine it with the second conversion sequence. */
3598 cand->second_conv = merge_conversion_sequences (conv,
3604 /* Wrapper for above. */
3607 build_user_type_conversion (tree totype, tree expr, int flags)
3609 struct z_candidate *cand;
3612 bool subtime = timevar_cond_start (TV_OVERLOAD);
3613 cand = build_user_type_conversion_1 (totype, expr, flags);
3617 if (cand->second_conv->kind == ck_ambig)
3618 ret = error_mark_node;
3621 expr = convert_like (cand->second_conv, expr, tf_warning_or_error);
3622 ret = convert_from_reference (expr);
3628 timevar_cond_stop (TV_OVERLOAD, subtime);
3632 /* Subroutine of convert_nontype_argument.
3634 EXPR is an argument for a template non-type parameter of integral or
3635 enumeration type. Do any necessary conversions (that are permitted for
3636 non-type arguments) to convert it to the parameter type.
3638 If conversion is successful, returns the converted expression;
3639 otherwise, returns error_mark_node. */
3642 build_integral_nontype_arg_conv (tree type, tree expr, tsubst_flags_t complain)
3648 if (error_operand_p (expr))
3649 return error_mark_node;
3651 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
3653 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3654 p = conversion_obstack_alloc (0);
3656 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
3660 /* for a non-type template-parameter of integral or
3661 enumeration type, integral promotions (4.5) and integral
3662 conversions (4.7) are applied. */
3663 /* It should be sufficient to check the outermost conversion step, since
3664 there are no qualification conversions to integer type. */
3668 /* A conversion function is OK. If it isn't constexpr, we'll
3669 complain later that the argument isn't constant. */
3671 /* The lvalue-to-rvalue conversion is OK. */
3677 t = conv->u.next->type;
3678 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t))
3681 if (complain & tf_error)
3682 error ("conversion from %qT to %qT not considered for "
3683 "non-type template argument", t, type);
3684 /* and fall through. */
3692 expr = convert_like (conv, expr, complain);
3694 expr = error_mark_node;
3696 /* Free all the conversions we allocated. */
3697 obstack_free (&conversion_obstack, p);
3702 /* Do any initial processing on the arguments to a function call. */
3704 static VEC(tree,gc) *
3705 resolve_args (VEC(tree,gc) *args, tsubst_flags_t complain)
3710 FOR_EACH_VEC_ELT (tree, args, ix, arg)
3712 if (error_operand_p (arg))
3714 else if (VOID_TYPE_P (TREE_TYPE (arg)))
3716 if (complain & tf_error)
3717 error ("invalid use of void expression");
3720 else if (invalid_nonstatic_memfn_p (arg, tf_warning_or_error))
3726 /* Perform overload resolution on FN, which is called with the ARGS.
3728 Return the candidate function selected by overload resolution, or
3729 NULL if the event that overload resolution failed. In the case
3730 that overload resolution fails, *CANDIDATES will be the set of
3731 candidates considered, and ANY_VIABLE_P will be set to true or
3732 false to indicate whether or not any of the candidates were
3735 The ARGS should already have gone through RESOLVE_ARGS before this
3736 function is called. */
3738 static struct z_candidate *
3739 perform_overload_resolution (tree fn,
3740 const VEC(tree,gc) *args,
3741 struct z_candidate **candidates,
3744 struct z_candidate *cand;
3745 tree explicit_targs;
3748 bool subtime = timevar_cond_start (TV_OVERLOAD);
3750 explicit_targs = NULL_TREE;
3754 *any_viable_p = true;
3757 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
3758 || TREE_CODE (fn) == TEMPLATE_DECL
3759 || TREE_CODE (fn) == OVERLOAD
3760 || TREE_CODE (fn) == TEMPLATE_ID_EXPR);
3762 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
3764 explicit_targs = TREE_OPERAND (fn, 1);
3765 fn = TREE_OPERAND (fn, 0);
3769 /* Add the various candidate functions. */
3770 add_candidates (fn, NULL_TREE, args, NULL_TREE,
3771 explicit_targs, template_only,
3772 /*conversion_path=*/NULL_TREE,
3773 /*access_path=*/NULL_TREE,
3777 *candidates = splice_viable (*candidates, pedantic, any_viable_p);
3779 cand = tourney (*candidates);
3783 timevar_cond_stop (TV_OVERLOAD, subtime);
3787 /* Print an error message about being unable to build a call to FN with
3788 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
3789 be located; CANDIDATES is a possibly empty list of such
3793 print_error_for_call_failure (tree fn, VEC(tree,gc) *args, bool any_viable_p,
3794 struct z_candidate *candidates)
3796 tree name = DECL_NAME (OVL_CURRENT (fn));
3797 location_t loc = location_of (name);
3800 error_at (loc, "no matching function for call to %<%D(%A)%>",
3801 name, build_tree_list_vec (args));
3803 error_at (loc, "call of overloaded %<%D(%A)%> is ambiguous",
3804 name, build_tree_list_vec (args));
3806 print_z_candidates (loc, candidates);
3809 /* Return an expression for a call to FN (a namespace-scope function,
3810 or a static member function) with the ARGS. This may change
3814 build_new_function_call (tree fn, VEC(tree,gc) **args, bool koenig_p,
3815 tsubst_flags_t complain)
3817 struct z_candidate *candidates, *cand;
3822 if (args != NULL && *args != NULL)
3824 *args = resolve_args (*args, complain);
3826 return error_mark_node;
3829 /* If this function was found without using argument dependent
3830 lookup, then we want to ignore any undeclared friend
3836 fn = remove_hidden_names (fn);
3839 if (complain & tf_error)
3840 print_error_for_call_failure (orig_fn, *args, false, NULL);
3841 return error_mark_node;
3845 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3846 p = conversion_obstack_alloc (0);
3848 cand = perform_overload_resolution (fn, *args, &candidates, &any_viable_p);
3852 if (complain & tf_error)
3854 if (!any_viable_p && candidates && ! candidates->next
3855 && (TREE_CODE (candidates->fn) == FUNCTION_DECL))
3856 return cp_build_function_call_vec (candidates->fn, args, complain);
3857 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
3858 fn = TREE_OPERAND (fn, 0);
3859 print_error_for_call_failure (fn, *args, any_viable_p, candidates);
3861 result = error_mark_node;
3865 int flags = LOOKUP_NORMAL;
3866 /* If fn is template_id_expr, the call has explicit template arguments
3867 (e.g. func<int>(5)), communicate this info to build_over_call
3868 through flags so that later we can use it to decide whether to warn
3869 about peculiar null pointer conversion. */
3870 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
3871 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
3872 result = build_over_call (cand, flags, complain);
3875 /* Free all the conversions we allocated. */
3876 obstack_free (&conversion_obstack, p);
3881 /* Build a call to a global operator new. FNNAME is the name of the
3882 operator (either "operator new" or "operator new[]") and ARGS are
3883 the arguments provided. This may change ARGS. *SIZE points to the
3884 total number of bytes required by the allocation, and is updated if
3885 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
3886 be used. If this function determines that no cookie should be
3887 used, after all, *COOKIE_SIZE is set to NULL_TREE. If FN is
3888 non-NULL, it will be set, upon return, to the allocation function
3892 build_operator_new_call (tree fnname, VEC(tree,gc) **args,
3893 tree *size, tree *cookie_size,
3897 struct z_candidate *candidates;
3898 struct z_candidate *cand;
3903 VEC_safe_insert (tree, gc, *args, 0, *size);
3904 *args = resolve_args (*args, tf_warning_or_error);
3906 return error_mark_node;
3912 If this lookup fails to find the name, or if the allocated type
3913 is not a class type, the allocation function's name is looked
3914 up in the global scope.
3916 we disregard block-scope declarations of "operator new". */
3917 fns = lookup_function_nonclass (fnname, *args, /*block_p=*/false);
3919 /* Figure out what function is being called. */
3920 cand = perform_overload_resolution (fns, *args, &candidates, &any_viable_p);
3922 /* If no suitable function could be found, issue an error message
3926 print_error_for_call_failure (fns, *args, any_viable_p, candidates);
3927 return error_mark_node;
3930 /* If a cookie is required, add some extra space. Whether
3931 or not a cookie is required cannot be determined until
3932 after we know which function was called. */
3935 bool use_cookie = true;
3936 if (!abi_version_at_least (2))
3938 /* In G++ 3.2, the check was implemented incorrectly; it
3939 looked at the placement expression, rather than the
3940 type of the function. */
3941 if (VEC_length (tree, *args) == 2
3942 && same_type_p (TREE_TYPE (VEC_index (tree, *args, 1)),
3950 arg_types = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
3951 /* Skip the size_t parameter. */
3952 arg_types = TREE_CHAIN (arg_types);
3953 /* Check the remaining parameters (if any). */
3955 && TREE_CHAIN (arg_types) == void_list_node
3956 && same_type_p (TREE_VALUE (arg_types),
3960 /* If we need a cookie, adjust the number of bytes allocated. */
3963 /* Update the total size. */
3964 *size = size_binop (PLUS_EXPR, *size, *cookie_size);
3965 /* Update the argument list to reflect the adjusted size. */
3966 VEC_replace (tree, *args, 0, *size);
3969 *cookie_size = NULL_TREE;
3972 /* Tell our caller which function we decided to call. */
3976 /* Build the CALL_EXPR. */
3977 return build_over_call (cand, LOOKUP_NORMAL, tf_warning_or_error);
3980 /* Build a new call to operator(). This may change ARGS. */
3983 build_op_call_1 (tree obj, VEC(tree,gc) **args, tsubst_flags_t complain)
3985 struct z_candidate *candidates = 0, *cand;
3986 tree fns, convs, first_mem_arg = NULL_TREE;
3987 tree type = TREE_TYPE (obj);
3989 tree result = NULL_TREE;
3992 if (error_operand_p (obj))
3993 return error_mark_node;
3995 obj = prep_operand (obj);
3997 if (TYPE_PTRMEMFUNC_P (type))
3999 if (complain & tf_error)
4000 /* It's no good looking for an overloaded operator() on a
4001 pointer-to-member-function. */
4002 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj);
4003 return error_mark_node;
4006 if (TYPE_BINFO (type))
4008 fns = lookup_fnfields (TYPE_BINFO (type), ansi_opname (CALL_EXPR), 1);
4009 if (fns == error_mark_node)
4010 return error_mark_node;
4015 if (args != NULL && *args != NULL)
4017 *args = resolve_args (*args, complain);
4019 return error_mark_node;
4022 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4023 p = conversion_obstack_alloc (0);
4027 first_mem_arg = build_this (obj);
4029 add_candidates (BASELINK_FUNCTIONS (fns),
4030 first_mem_arg, *args, NULL_TREE,
4032 BASELINK_BINFO (fns), BASELINK_ACCESS_BINFO (fns),
4033 LOOKUP_NORMAL, &candidates);
4036 convs = lookup_conversions (type);
4038 for (; convs; convs = TREE_CHAIN (convs))
4040 tree fns = TREE_VALUE (convs);
4041 tree totype = TREE_TYPE (convs);
4043 if ((TREE_CODE (totype) == POINTER_TYPE
4044 && TREE_CODE (TREE_TYPE (totype)) == FUNCTION_TYPE)
4045 || (TREE_CODE (totype) == REFERENCE_TYPE
4046 && TREE_CODE (TREE_TYPE (totype)) == FUNCTION_TYPE)
4047 || (TREE_CODE (totype) == REFERENCE_TYPE
4048 && TREE_CODE (TREE_TYPE (totype)) == POINTER_TYPE
4049 && TREE_CODE (TREE_TYPE (TREE_TYPE (totype))) == FUNCTION_TYPE))
4050 for (; fns; fns = OVL_NEXT (fns))
4052 tree fn = OVL_CURRENT (fns);
4054 if (DECL_NONCONVERTING_P (fn))
4057 if (TREE_CODE (fn) == TEMPLATE_DECL)
4058 add_template_conv_candidate
4059 (&candidates, fn, obj, NULL_TREE, *args, totype,
4060 /*access_path=*/NULL_TREE,
4061 /*conversion_path=*/NULL_TREE);
4063 add_conv_candidate (&candidates, fn, obj, NULL_TREE,
4064 *args, /*conversion_path=*/NULL_TREE,
4065 /*access_path=*/NULL_TREE);
4069 candidates = splice_viable (candidates, pedantic, &any_viable_p);
4072 if (complain & tf_error)
4074 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj),
4075 build_tree_list_vec (*args));
4076 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4078 result = error_mark_node;
4082 cand = tourney (candidates);
4085 if (complain & tf_error)
4087 error ("call of %<(%T) (%A)%> is ambiguous",
4088 TREE_TYPE (obj), build_tree_list_vec (*args));
4089 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4091 result = error_mark_node;
4093 /* Since cand->fn will be a type, not a function, for a conversion
4094 function, we must be careful not to unconditionally look at
4096 else if (TREE_CODE (cand->fn) == FUNCTION_DECL
4097 && DECL_OVERLOADED_OPERATOR_P (cand->fn) == CALL_EXPR)
4098 result = build_over_call (cand, LOOKUP_NORMAL, complain);
4101 obj = convert_like_with_context (cand->convs[0], obj, cand->fn, -1,
4103 obj = convert_from_reference (obj);
4104 result = cp_build_function_call_vec (obj, args, complain);
4108 /* Free all the conversions we allocated. */
4109 obstack_free (&conversion_obstack, p);
4114 /* Wrapper for above. */
4117 build_op_call (tree obj, VEC(tree,gc) **args, tsubst_flags_t complain)
4120 bool subtime = timevar_cond_start (TV_OVERLOAD);
4121 ret = build_op_call_1 (obj, args, complain);
4122 timevar_cond_stop (TV_OVERLOAD, subtime);
4127 op_error (enum tree_code code, enum tree_code code2,
4128 tree arg1, tree arg2, tree arg3, bool match)
4132 if (code == MODIFY_EXPR)
4133 opname = assignment_operator_name_info[code2].name;
4135 opname = operator_name_info[code].name;
4141 error ("ambiguous overload for ternary %<operator?:%> "
4142 "in %<%E ? %E : %E%>", arg1, arg2, arg3);
4144 error ("no match for ternary %<operator?:%> "
4145 "in %<%E ? %E : %E%>", arg1, arg2, arg3);
4148 case POSTINCREMENT_EXPR:
4149 case POSTDECREMENT_EXPR:
4151 error ("ambiguous overload for %<operator%s%> in %<%E%s%>",
4152 opname, arg1, opname);
4154 error ("no match for %<operator%s%> in %<%E%s%>",
4155 opname, arg1, opname);
4160 error ("ambiguous overload for %<operator[]%> in %<%E[%E]%>",
4163 error ("no match for %<operator[]%> in %<%E[%E]%>",
4170 error ("ambiguous overload for %qs in %<%s %E%>",
4171 opname, opname, arg1);
4173 error ("no match for %qs in %<%s %E%>",
4174 opname, opname, arg1);
4180 error ("ambiguous overload for %<operator%s%> in %<%E %s %E%>",
4181 opname, arg1, opname, arg2);
4183 error ("no match for %<operator%s%> in %<%E %s %E%>",
4184 opname, arg1, opname, arg2);
4187 error ("ambiguous overload for %<operator%s%> in %<%s%E%>",
4188 opname, opname, arg1);
4190 error ("no match for %<operator%s%> in %<%s%E%>",
4191 opname, opname, arg1);
4196 /* Return the implicit conversion sequence that could be used to
4197 convert E1 to E2 in [expr.cond]. */
4200 conditional_conversion (tree e1, tree e2)
4202 tree t1 = non_reference (TREE_TYPE (e1));
4203 tree t2 = non_reference (TREE_TYPE (e2));
4209 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4210 implicitly converted (clause _conv_) to the type "lvalue reference to
4211 T2", subject to the constraint that in the conversion the
4212 reference must bind directly (_dcl.init.ref_) to an lvalue. */
4213 if (real_lvalue_p (e2))
4215 conv = implicit_conversion (build_reference_type (t2),
4219 LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND
4220 |LOOKUP_ONLYCONVERTING);
4227 If E1 and E2 have class type, and the underlying class types are
4228 the same or one is a base class of the other: E1 can be converted
4229 to match E2 if the class of T2 is the same type as, or a base
4230 class of, the class of T1, and the cv-qualification of T2 is the
4231 same cv-qualification as, or a greater cv-qualification than, the
4232 cv-qualification of T1. If the conversion is applied, E1 is
4233 changed to an rvalue of type T2 that still refers to the original
4234 source class object (or the appropriate subobject thereof). */
4235 if (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
4236 && ((good_base = DERIVED_FROM_P (t2, t1)) || DERIVED_FROM_P (t1, t2)))
4238 if (good_base && at_least_as_qualified_p (t2, t1))
4240 conv = build_identity_conv (t1, e1);
4241 if (!same_type_p (TYPE_MAIN_VARIANT (t1),
4242 TYPE_MAIN_VARIANT (t2)))
4243 conv = build_conv (ck_base, t2, conv);
4245 conv = build_conv (ck_rvalue, t2, conv);
4254 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4255 converted to the type that expression E2 would have if E2 were
4256 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4257 return implicit_conversion (t2, t1, e1, /*c_cast_p=*/false,
4261 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4262 arguments to the conditional expression. */
4265 build_conditional_expr_1 (tree arg1, tree arg2, tree arg3,
4266 tsubst_flags_t complain)
4270 tree result = NULL_TREE;
4271 tree result_type = NULL_TREE;
4272 bool lvalue_p = true;
4273 struct z_candidate *candidates = 0;
4274 struct z_candidate *cand;
4277 /* As a G++ extension, the second argument to the conditional can be
4278 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4279 c'.) If the second operand is omitted, make sure it is
4280 calculated only once. */
4283 if (complain & tf_error)
4284 pedwarn (input_location, OPT_pedantic,
4285 "ISO C++ forbids omitting the middle term of a ?: expression");
4287 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4288 if (real_lvalue_p (arg1))
4289 arg2 = arg1 = stabilize_reference (arg1);
4291 arg2 = arg1 = save_expr (arg1);
4296 The first expression is implicitly converted to bool (clause
4298 arg1 = perform_implicit_conversion_flags (boolean_type_node, arg1, complain,
4301 /* If something has already gone wrong, just pass that fact up the
4303 if (error_operand_p (arg1)
4304 || error_operand_p (arg2)
4305 || error_operand_p (arg3))
4306 return error_mark_node;
4310 If either the second or the third operand has type (possibly
4311 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4312 array-to-pointer (_conv.array_), and function-to-pointer
4313 (_conv.func_) standard conversions are performed on the second
4314 and third operands. */
4315 arg2_type = unlowered_expr_type (arg2);
4316 arg3_type = unlowered_expr_type (arg3);
4317 if (VOID_TYPE_P (arg2_type) || VOID_TYPE_P (arg3_type))
4319 /* Do the conversions. We don't these for `void' type arguments
4320 since it can't have any effect and since decay_conversion
4321 does not handle that case gracefully. */
4322 if (!VOID_TYPE_P (arg2_type))
4323 arg2 = decay_conversion (arg2);
4324 if (!VOID_TYPE_P (arg3_type))
4325 arg3 = decay_conversion (arg3);
4326 arg2_type = TREE_TYPE (arg2);
4327 arg3_type = TREE_TYPE (arg3);
4331 One of the following shall hold:
4333 --The second or the third operand (but not both) is a
4334 throw-expression (_except.throw_); the result is of the
4335 type of the other and is an rvalue.
4337 --Both the second and the third operands have type void; the
4338 result is of type void and is an rvalue.
4340 We must avoid calling force_rvalue for expressions of type
4341 "void" because it will complain that their value is being
4343 if (TREE_CODE (arg2) == THROW_EXPR
4344 && TREE_CODE (arg3) != THROW_EXPR)
4346 if (!VOID_TYPE_P (arg3_type))
4348 arg3 = force_rvalue (arg3, complain);
4349 if (arg3 == error_mark_node)
4350 return error_mark_node;
4352 arg3_type = TREE_TYPE (arg3);
4353 result_type = arg3_type;
4355 else if (TREE_CODE (arg2) != THROW_EXPR
4356 && TREE_CODE (arg3) == THROW_EXPR)
4358 if (!VOID_TYPE_P (arg2_type))
4360 arg2 = force_rvalue (arg2, complain);
4361 if (arg2 == error_mark_node)
4362 return error_mark_node;
4364 arg2_type = TREE_TYPE (arg2);
4365 result_type = arg2_type;
4367 else if (VOID_TYPE_P (arg2_type) && VOID_TYPE_P (arg3_type))
4368 result_type = void_type_node;
4371 if (complain & tf_error)
4373 if (VOID_TYPE_P (arg2_type))
4374 error ("second operand to the conditional operator "
4375 "is of type %<void%>, "
4376 "but the third operand is neither a throw-expression "
4377 "nor of type %<void%>");
4379 error ("third operand to the conditional operator "
4380 "is of type %<void%>, "
4381 "but the second operand is neither a throw-expression "
4382 "nor of type %<void%>");
4384 return error_mark_node;
4388 goto valid_operands;
4392 Otherwise, if the second and third operand have different types,
4393 and either has (possibly cv-qualified) class type, an attempt is
4394 made to convert each of those operands to the type of the other. */
4395 else if (!same_type_p (arg2_type, arg3_type)
4396 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
4401 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4402 p = conversion_obstack_alloc (0);
4404 conv2 = conditional_conversion (arg2, arg3);
4405 conv3 = conditional_conversion (arg3, arg2);
4409 If both can be converted, or one can be converted but the
4410 conversion is ambiguous, the program is ill-formed. If
4411 neither can be converted, the operands are left unchanged and
4412 further checking is performed as described below. If exactly
4413 one conversion is possible, that conversion is applied to the
4414 chosen operand and the converted operand is used in place of
4415 the original operand for the remainder of this section. */
4416 if ((conv2 && !conv2->bad_p
4417 && conv3 && !conv3->bad_p)
4418 || (conv2 && conv2->kind == ck_ambig)
4419 || (conv3 && conv3->kind == ck_ambig))
4421 error ("operands to ?: have different types %qT and %qT",
4422 arg2_type, arg3_type);
4423 result = error_mark_node;
4425 else if (conv2 && (!conv2->bad_p || !conv3))
4427 arg2 = convert_like (conv2, arg2, complain);
4428 arg2 = convert_from_reference (arg2);
4429 arg2_type = TREE_TYPE (arg2);
4430 /* Even if CONV2 is a valid conversion, the result of the
4431 conversion may be invalid. For example, if ARG3 has type
4432 "volatile X", and X does not have a copy constructor
4433 accepting a "volatile X&", then even if ARG2 can be
4434 converted to X, the conversion will fail. */
4435 if (error_operand_p (arg2))
4436 result = error_mark_node;
4438 else if (conv3 && (!conv3->bad_p || !conv2))
4440 arg3 = convert_like (conv3, arg3, complain);
4441 arg3 = convert_from_reference (arg3);
4442 arg3_type = TREE_TYPE (arg3);
4443 if (error_operand_p (arg3))
4444 result = error_mark_node;
4447 /* Free all the conversions we allocated. */
4448 obstack_free (&conversion_obstack, p);
4453 /* If, after the conversion, both operands have class type,
4454 treat the cv-qualification of both operands as if it were the
4455 union of the cv-qualification of the operands.
4457 The standard is not clear about what to do in this
4458 circumstance. For example, if the first operand has type
4459 "const X" and the second operand has a user-defined
4460 conversion to "volatile X", what is the type of the second
4461 operand after this step? Making it be "const X" (matching
4462 the first operand) seems wrong, as that discards the
4463 qualification without actually performing a copy. Leaving it
4464 as "volatile X" seems wrong as that will result in the
4465 conditional expression failing altogether, even though,
4466 according to this step, the one operand could be converted to
4467 the type of the other. */
4468 if ((conv2 || conv3)
4469 && CLASS_TYPE_P (arg2_type)
4470 && cp_type_quals (arg2_type) != cp_type_quals (arg3_type))
4471 arg2_type = arg3_type =
4472 cp_build_qualified_type (arg2_type,
4473 cp_type_quals (arg2_type)
4474 | cp_type_quals (arg3_type));
4479 If the second and third operands are lvalues and have the same
4480 type, the result is of that type and is an lvalue. */
4481 if (real_lvalue_p (arg2)
4482 && real_lvalue_p (arg3)
4483 && same_type_p (arg2_type, arg3_type))
4485 result_type = arg2_type;
4486 arg2 = mark_lvalue_use (arg2);
4487 arg3 = mark_lvalue_use (arg3);
4488 goto valid_operands;
4493 Otherwise, the result is an rvalue. If the second and third
4494 operand do not have the same type, and either has (possibly
4495 cv-qualified) class type, overload resolution is used to
4496 determine the conversions (if any) to be applied to the operands
4497 (_over.match.oper_, _over.built_). */
4499 if (!same_type_p (arg2_type, arg3_type)
4500 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
4506 /* Rearrange the arguments so that add_builtin_candidate only has
4507 to know about two args. In build_builtin_candidate, the
4508 arguments are unscrambled. */
4512 add_builtin_candidates (&candidates,
4515 ansi_opname (COND_EXPR),
4521 If the overload resolution fails, the program is
4523 candidates = splice_viable (candidates, pedantic, &any_viable_p);
4526 if (complain & tf_error)
4528 op_error (COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE);
4529 print_z_candidates (location_of (arg1), candidates);
4531 return error_mark_node;
4533 cand = tourney (candidates);
4536 if (complain & tf_error)
4538 op_error (COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE);
4539 print_z_candidates (location_of (arg1), candidates);
4541 return error_mark_node;
4546 Otherwise, the conversions thus determined are applied, and
4547 the converted operands are used in place of the original
4548 operands for the remainder of this section. */
4549 conv = cand->convs[0];
4550 arg1 = convert_like (conv, arg1, complain);
4551 conv = cand->convs[1];
4552 arg2 = convert_like (conv, arg2, complain);
4553 arg2_type = TREE_TYPE (arg2);
4554 conv = cand->convs[2];
4555 arg3 = convert_like (conv, arg3, complain);
4556 arg3_type = TREE_TYPE (arg3);
4561 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
4562 and function-to-pointer (_conv.func_) standard conversions are
4563 performed on the second and third operands.
4565 We need to force the lvalue-to-rvalue conversion here for class types,
4566 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
4567 that isn't wrapped with a TARGET_EXPR plays havoc with exception
4570 arg2 = force_rvalue (arg2, complain);
4571 if (!CLASS_TYPE_P (arg2_type))
4572 arg2_type = TREE_TYPE (arg2);
4574 arg3 = force_rvalue (arg3, complain);
4575 if (!CLASS_TYPE_P (arg3_type))
4576 arg3_type = TREE_TYPE (arg3);
4578 if (arg2 == error_mark_node || arg3 == error_mark_node)
4579 return error_mark_node;
4583 After those conversions, one of the following shall hold:
4585 --The second and third operands have the same type; the result is of
4587 if (same_type_p (arg2_type, arg3_type))
4588 result_type = arg2_type;
4591 --The second and third operands have arithmetic or enumeration
4592 type; the usual arithmetic conversions are performed to bring
4593 them to a common type, and the result is of that type. */
4594 else if ((ARITHMETIC_TYPE_P (arg2_type)
4595 || UNSCOPED_ENUM_P (arg2_type))
4596 && (ARITHMETIC_TYPE_P (arg3_type)
4597 || UNSCOPED_ENUM_P (arg3_type)))
4599 /* In this case, there is always a common type. */
4600 result_type = type_after_usual_arithmetic_conversions (arg2_type,
4602 do_warn_double_promotion (result_type, arg2_type, arg3_type,
4603 "implicit conversion from %qT to %qT to "
4604 "match other result of conditional",
4607 if (TREE_CODE (arg2_type) == ENUMERAL_TYPE
4608 && TREE_CODE (arg3_type) == ENUMERAL_TYPE)
4610 if (complain & tf_warning)
4612 "enumeral mismatch in conditional expression: %qT vs %qT",
4613 arg2_type, arg3_type);
4615 else if (extra_warnings
4616 && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE
4617 && !same_type_p (arg3_type, type_promotes_to (arg2_type)))
4618 || (TREE_CODE (arg3_type) == ENUMERAL_TYPE
4619 && !same_type_p (arg2_type, type_promotes_to (arg3_type)))))
4621 if (complain & tf_warning)
4623 "enumeral and non-enumeral type in conditional expression");
4626 arg2 = perform_implicit_conversion (result_type, arg2, complain);
4627 arg3 = perform_implicit_conversion (result_type, arg3, complain);
4631 --The second and third operands have pointer type, or one has
4632 pointer type and the other is a null pointer constant; pointer
4633 conversions (_conv.ptr_) and qualification conversions
4634 (_conv.qual_) are performed to bring them to their composite
4635 pointer type (_expr.rel_). The result is of the composite
4638 --The second and third operands have pointer to member type, or
4639 one has pointer to member type and the other is a null pointer
4640 constant; pointer to member conversions (_conv.mem_) and
4641 qualification conversions (_conv.qual_) are performed to bring
4642 them to a common type, whose cv-qualification shall match the
4643 cv-qualification of either the second or the third operand.
4644 The result is of the common type. */
4645 else if ((null_ptr_cst_p (arg2)
4646 && (TYPE_PTR_P (arg3_type) || TYPE_PTR_TO_MEMBER_P (arg3_type)))
4647 || (null_ptr_cst_p (arg3)
4648 && (TYPE_PTR_P (arg2_type) || TYPE_PTR_TO_MEMBER_P (arg2_type)))
4649 || (TYPE_PTR_P (arg2_type) && TYPE_PTR_P (arg3_type))
4650 || (TYPE_PTRMEM_P (arg2_type) && TYPE_PTRMEM_P (arg3_type))
4651 || (TYPE_PTRMEMFUNC_P (arg2_type) && TYPE_PTRMEMFUNC_P (arg3_type)))
4653 result_type = composite_pointer_type (arg2_type, arg3_type, arg2,
4654 arg3, CPO_CONDITIONAL_EXPR,
4656 if (result_type == error_mark_node)
4657 return error_mark_node;
4658 arg2 = perform_implicit_conversion (result_type, arg2, complain);
4659 arg3 = perform_implicit_conversion (result_type, arg3, complain);
4664 if (complain & tf_error)
4665 error ("operands to ?: have different types %qT and %qT",
4666 arg2_type, arg3_type);
4667 return error_mark_node;
4671 result = build3 (COND_EXPR, result_type, arg1, arg2, arg3);
4672 if (!cp_unevaluated_operand)
4673 /* Avoid folding within decltype (c++/42013) and noexcept. */
4674 result = fold_if_not_in_template (result);
4676 /* We can't use result_type below, as fold might have returned a
4681 /* Expand both sides into the same slot, hopefully the target of
4682 the ?: expression. We used to check for TARGET_EXPRs here,
4683 but now we sometimes wrap them in NOP_EXPRs so the test would
4685 if (CLASS_TYPE_P (TREE_TYPE (result)))
4686 result = get_target_expr (result);
4687 /* If this expression is an rvalue, but might be mistaken for an
4688 lvalue, we must add a NON_LVALUE_EXPR. */
4689 result = rvalue (result);
4695 /* Wrapper for above. */
4698 build_conditional_expr (tree arg1, tree arg2, tree arg3,
4699 tsubst_flags_t complain)
4702 bool subtime = timevar_cond_start (TV_OVERLOAD);
4703 ret = build_conditional_expr_1 (arg1, arg2, arg3, complain);
4704 timevar_cond_stop (TV_OVERLOAD, subtime);
4708 /* OPERAND is an operand to an expression. Perform necessary steps
4709 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
4713 prep_operand (tree operand)
4717 if (CLASS_TYPE_P (TREE_TYPE (operand))
4718 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand)))
4719 /* Make sure the template type is instantiated now. */
4720 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand)));
4726 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
4727 OVERLOAD) to the CANDIDATES, returning an updated list of
4728 CANDIDATES. The ARGS are the arguments provided to the call;
4729 if FIRST_ARG is non-null it is the implicit object argument,
4730 otherwise the first element of ARGS is used if needed. The
4731 EXPLICIT_TARGS are explicit template arguments provided.
4732 TEMPLATE_ONLY is true if only template functions should be
4733 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
4734 add_function_candidate. */
4737 add_candidates (tree fns, tree first_arg, const VEC(tree,gc) *args,
4739 tree explicit_targs, bool template_only,
4740 tree conversion_path, tree access_path,
4742 struct z_candidate **candidates)
4745 const VEC(tree,gc) *non_static_args;
4746 bool check_list_ctor;
4747 bool check_converting;
4748 unification_kind_t strict;
4754 /* Precalculate special handling of constructors and conversion ops. */
4755 fn = OVL_CURRENT (fns);
4756 if (DECL_CONV_FN_P (fn))
4758 check_list_ctor = false;
4759 check_converting = !!(flags & LOOKUP_ONLYCONVERTING);
4760 if (flags & LOOKUP_NO_CONVERSION)
4761 /* We're doing return_type(x). */
4762 strict = DEDUCE_CONV;
4764 /* We're doing x.operator return_type(). */
4765 strict = DEDUCE_EXACT;
4766 /* [over.match.funcs] For conversion functions, the function
4767 is considered to be a member of the class of the implicit
4768 object argument for the purpose of defining the type of
4769 the implicit object parameter. */
4770 ctype = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (first_arg)));
4774 if (DECL_CONSTRUCTOR_P (fn))
4776 check_list_ctor = !!(flags & LOOKUP_LIST_ONLY);
4777 check_converting = !!(flags & LOOKUP_ONLYCONVERTING);
4781 check_list_ctor = false;
4782 check_converting = false;
4784 strict = DEDUCE_CALL;
4785 ctype = conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE;
4789 non_static_args = args;
4791 /* Delay creating the implicit this parameter until it is needed. */
4792 non_static_args = NULL;
4794 for (; fns; fns = OVL_NEXT (fns))
4797 const VEC(tree,gc) *fn_args;
4799 fn = OVL_CURRENT (fns);
4801 if (check_converting && DECL_NONCONVERTING_P (fn))
4803 if (check_list_ctor && !is_list_ctor (fn))
4806 /* Figure out which set of arguments to use. */
4807 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
4809 /* If this function is a non-static member and we didn't get an
4810 implicit object argument, move it out of args. */
4811 if (first_arg == NULL_TREE)
4815 VEC(tree,gc) *tempvec
4816 = VEC_alloc (tree, gc, VEC_length (tree, args) - 1);
4817 for (ix = 1; VEC_iterate (tree, args, ix, arg); ++ix)
4818 VEC_quick_push (tree, tempvec, arg);
4819 non_static_args = tempvec;
4820 first_arg = build_this (VEC_index (tree, args, 0));
4823 fn_first_arg = first_arg;
4824 fn_args = non_static_args;
4828 /* Otherwise, just use the list of arguments provided. */
4829 fn_first_arg = NULL_TREE;
4833 if (TREE_CODE (fn) == TEMPLATE_DECL)
4834 add_template_candidate (candidates,
4845 else if (!template_only)
4846 add_function_candidate (candidates,
4857 /* Even unsigned enum types promote to signed int. We don't want to
4858 issue -Wsign-compare warnings for this case. Here ORIG_ARG is the
4859 original argument and ARG is the argument after any conversions
4860 have been applied. We set TREE_NO_WARNING if we have added a cast
4861 from an unsigned enum type to a signed integer type. */
4864 avoid_sign_compare_warnings (tree orig_arg, tree arg)
4866 if (orig_arg != NULL_TREE
4869 && TREE_CODE (TREE_TYPE (orig_arg)) == ENUMERAL_TYPE
4870 && TYPE_UNSIGNED (TREE_TYPE (orig_arg))
4871 && INTEGRAL_TYPE_P (TREE_TYPE (arg))
4872 && !TYPE_UNSIGNED (TREE_TYPE (arg)))
4873 TREE_NO_WARNING (arg) = 1;
4877 build_new_op_1 (enum tree_code code, int flags, tree arg1, tree arg2, tree arg3,
4878 tree *overload, tsubst_flags_t complain)
4880 tree orig_arg1 = arg1;
4881 tree orig_arg2 = arg2;
4882 tree orig_arg3 = arg3;
4883 struct z_candidate *candidates = 0, *cand;
4884 VEC(tree,gc) *arglist;
4887 tree result = NULL_TREE;
4888 bool result_valid_p = false;
4889 enum tree_code code2 = NOP_EXPR;
4890 enum tree_code code_orig_arg1 = ERROR_MARK;
4891 enum tree_code code_orig_arg2 = ERROR_MARK;
4897 if (error_operand_p (arg1)
4898 || error_operand_p (arg2)
4899 || error_operand_p (arg3))
4900 return error_mark_node;
4902 if (code == MODIFY_EXPR)
4904 code2 = TREE_CODE (arg3);
4906 fnname = ansi_assopname (code2);
4909 fnname = ansi_opname (code);
4911 arg1 = prep_operand (arg1);
4917 case VEC_DELETE_EXPR:
4919 /* Use build_op_new_call and build_op_delete_call instead. */
4923 /* Use build_op_call instead. */
4926 case TRUTH_ORIF_EXPR:
4927 case TRUTH_ANDIF_EXPR:
4928 case TRUTH_AND_EXPR:
4930 /* These are saved for the sake of warn_logical_operator. */
4931 code_orig_arg1 = TREE_CODE (arg1);
4932 code_orig_arg2 = TREE_CODE (arg2);
4938 arg2 = prep_operand (arg2);
4939 arg3 = prep_operand (arg3);
4941 if (code == COND_EXPR)
4942 /* Use build_conditional_expr instead. */
4944 else if (! IS_OVERLOAD_TYPE (TREE_TYPE (arg1))
4945 && (! arg2 || ! IS_OVERLOAD_TYPE (TREE_TYPE (arg2))))
4948 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
4949 arg2 = integer_zero_node;
4951 arglist = VEC_alloc (tree, gc, 3);
4952 VEC_quick_push (tree, arglist, arg1);
4953 if (arg2 != NULL_TREE)
4954 VEC_quick_push (tree, arglist, arg2);
4955 if (arg3 != NULL_TREE)
4956 VEC_quick_push (tree, arglist, arg3);
4958 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4959 p = conversion_obstack_alloc (0);
4961 /* Add namespace-scope operators to the list of functions to
4963 add_candidates (lookup_function_nonclass (fnname, arglist, /*block_p=*/true),
4964 NULL_TREE, arglist, NULL_TREE,
4965 NULL_TREE, false, NULL_TREE, NULL_TREE,
4966 flags, &candidates);
4967 /* Add class-member operators to the candidate set. */
4968 if (CLASS_TYPE_P (TREE_TYPE (arg1)))
4972 fns = lookup_fnfields (TREE_TYPE (arg1), fnname, 1);
4973 if (fns == error_mark_node)
4975 result = error_mark_node;
4976 goto user_defined_result_ready;
4979 add_candidates (BASELINK_FUNCTIONS (fns),
4980 NULL_TREE, arglist, NULL_TREE,
4982 BASELINK_BINFO (fns),
4983 BASELINK_ACCESS_BINFO (fns),
4984 flags, &candidates);
4989 args[2] = NULL_TREE;
4991 add_builtin_candidates (&candidates, code, code2, fnname, args, flags);
4997 /* For these, the built-in candidates set is empty
4998 [over.match.oper]/3. We don't want non-strict matches
4999 because exact matches are always possible with built-in
5000 operators. The built-in candidate set for COMPONENT_REF
5001 would be empty too, but since there are no such built-in
5002 operators, we accept non-strict matches for them. */
5007 strict_p = pedantic;
5011 candidates = splice_viable (candidates, strict_p, &any_viable_p);
5016 case POSTINCREMENT_EXPR:
5017 case POSTDECREMENT_EXPR:
5018 /* Don't try anything fancy if we're not allowed to produce
5020 if (!(complain & tf_error))
5021 return error_mark_node;
5023 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5024 distinguish between prefix and postfix ++ and
5025 operator++() was used for both, so we allow this with
5027 if (flags & LOOKUP_COMPLAIN)
5029 const char *msg = (flag_permissive)
5030 ? G_("no %<%D(int)%> declared for postfix %qs,"
5031 " trying prefix operator instead")
5032 : G_("no %<%D(int)%> declared for postfix %qs");
5033 permerror (input_location, msg, fnname,
5034 operator_name_info[code].name);
5037 if (!flag_permissive)
5038 return error_mark_node;
5040 if (code == POSTINCREMENT_EXPR)
5041 code = PREINCREMENT_EXPR;
5043 code = PREDECREMENT_EXPR;
5044 result = build_new_op_1 (code, flags, arg1, NULL_TREE, NULL_TREE,
5045 overload, complain);
5048 /* The caller will deal with these. */
5053 result_valid_p = true;
5057 if ((flags & LOOKUP_COMPLAIN) && (complain & tf_error))
5059 /* If one of the arguments of the operator represents
5060 an invalid use of member function pointer, try to report
5061 a meaningful error ... */
5062 if (invalid_nonstatic_memfn_p (arg1, tf_error)
5063 || invalid_nonstatic_memfn_p (arg2, tf_error)
5064 || invalid_nonstatic_memfn_p (arg3, tf_error))
5065 /* We displayed the error message. */;
5068 /* ... Otherwise, report the more generic
5069 "no matching operator found" error */
5070 op_error (code, code2, arg1, arg2, arg3, FALSE);
5071 print_z_candidates (input_location, candidates);
5074 result = error_mark_node;
5080 cand = tourney (candidates);
5083 if ((flags & LOOKUP_COMPLAIN) && (complain & tf_error))
5085 op_error (code, code2, arg1, arg2, arg3, TRUE);
5086 print_z_candidates (input_location, candidates);
5088 result = error_mark_node;
5090 else if (TREE_CODE (cand->fn) == FUNCTION_DECL)
5093 *overload = cand->fn;
5095 if (resolve_args (arglist, complain) == NULL)
5096 result = error_mark_node;
5098 result = build_over_call (cand, LOOKUP_NORMAL, complain);
5102 /* Give any warnings we noticed during overload resolution. */
5103 if (cand->warnings && (complain & tf_warning))
5105 struct candidate_warning *w;
5106 for (w = cand->warnings; w; w = w->next)
5107 joust (cand, w->loser, 1);
5110 /* Check for comparison of different enum types. */
5119 if (TREE_CODE (TREE_TYPE (arg1)) == ENUMERAL_TYPE
5120 && TREE_CODE (TREE_TYPE (arg2)) == ENUMERAL_TYPE
5121 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1))
5122 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2)))
5123 && (complain & tf_warning))
5125 warning (OPT_Wenum_compare,
5126 "comparison between %q#T and %q#T",
5127 TREE_TYPE (arg1), TREE_TYPE (arg2));
5134 /* We need to strip any leading REF_BIND so that bitfields
5135 don't cause errors. This should not remove any important
5136 conversions, because builtins don't apply to class
5137 objects directly. */
5138 conv = cand->convs[0];
5139 if (conv->kind == ck_ref_bind)
5140 conv = conv->u.next;
5141 arg1 = convert_like (conv, arg1, complain);
5145 /* We need to call warn_logical_operator before
5146 converting arg2 to a boolean_type. */
5147 if (complain & tf_warning)
5148 warn_logical_operator (input_location, code, boolean_type_node,
5149 code_orig_arg1, arg1,
5150 code_orig_arg2, arg2);
5152 conv = cand->convs[1];
5153 if (conv->kind == ck_ref_bind)
5154 conv = conv->u.next;
5155 arg2 = convert_like (conv, arg2, complain);
5159 conv = cand->convs[2];
5160 if (conv->kind == ck_ref_bind)
5161 conv = conv->u.next;
5162 arg3 = convert_like (conv, arg3, complain);
5168 user_defined_result_ready:
5170 /* Free all the conversions we allocated. */
5171 obstack_free (&conversion_obstack, p);
5173 if (result || result_valid_p)
5177 avoid_sign_compare_warnings (orig_arg1, arg1);
5178 avoid_sign_compare_warnings (orig_arg2, arg2);
5179 avoid_sign_compare_warnings (orig_arg3, arg3);
5184 return cp_build_modify_expr (arg1, code2, arg2, complain);
5187 return cp_build_indirect_ref (arg1, RO_UNARY_STAR, complain);
5189 case TRUTH_ANDIF_EXPR:
5190 case TRUTH_ORIF_EXPR:
5191 case TRUTH_AND_EXPR:
5193 warn_logical_operator (input_location, code, boolean_type_node,
5194 code_orig_arg1, arg1, code_orig_arg2, arg2);
5199 case TRUNC_DIV_EXPR:
5210 case TRUNC_MOD_EXPR:
5214 return cp_build_binary_op (input_location, code, arg1, arg2, complain);
5216 case UNARY_PLUS_EXPR:
5219 case TRUTH_NOT_EXPR:
5220 case PREINCREMENT_EXPR:
5221 case POSTINCREMENT_EXPR:
5222 case PREDECREMENT_EXPR:
5223 case POSTDECREMENT_EXPR:
5226 return cp_build_unary_op (code, arg1, candidates != 0, complain);
5229 return cp_build_array_ref (input_location, arg1, arg2, complain);
5232 return build_m_component_ref (cp_build_indirect_ref (arg1, RO_NULL,
5236 /* The caller will deal with these. */
5248 /* Wrapper for above. */
5251 build_new_op (enum tree_code code, int flags, tree arg1, tree arg2, tree arg3,
5252 tree *overload, tsubst_flags_t complain)
5255 bool subtime = timevar_cond_start (TV_OVERLOAD);
5256 ret = build_new_op_1 (code, flags, arg1, arg2, arg3, overload, complain);
5257 timevar_cond_stop (TV_OVERLOAD, subtime);
5261 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
5262 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
5265 non_placement_deallocation_fn_p (tree t)
5267 /* A template instance is never a usual deallocation function,
5268 regardless of its signature. */
5269 if (TREE_CODE (t) == TEMPLATE_DECL
5270 || primary_template_instantiation_p (t))
5273 /* If a class T has a member deallocation function named operator delete
5274 with exactly one parameter, then that function is a usual
5275 (non-placement) deallocation function. If class T does not declare
5276 such an operator delete but does declare a member deallocation
5277 function named operator delete with exactly two parameters, the second
5278 of which has type std::size_t (18.2), then this function is a usual
5279 deallocation function. */
5280 t = FUNCTION_ARG_CHAIN (t);
5281 if (t == void_list_node
5282 || (t && same_type_p (TREE_VALUE (t), size_type_node)
5283 && TREE_CHAIN (t) == void_list_node))
5288 /* Build a call to operator delete. This has to be handled very specially,
5289 because the restrictions on what signatures match are different from all
5290 other call instances. For a normal delete, only a delete taking (void *)
5291 or (void *, size_t) is accepted. For a placement delete, only an exact
5292 match with the placement new is accepted.
5294 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
5295 ADDR is the pointer to be deleted.
5296 SIZE is the size of the memory block to be deleted.
5297 GLOBAL_P is true if the delete-expression should not consider
5298 class-specific delete operators.
5299 PLACEMENT is the corresponding placement new call, or NULL_TREE.
5301 If this call to "operator delete" is being generated as part to
5302 deallocate memory allocated via a new-expression (as per [expr.new]
5303 which requires that if the initialization throws an exception then
5304 we call a deallocation function), then ALLOC_FN is the allocation
5308 build_op_delete_call (enum tree_code code, tree addr, tree size,
5309 bool global_p, tree placement,
5312 tree fn = NULL_TREE;
5313 tree fns, fnname, type, t;
5315 if (addr == error_mark_node)
5316 return error_mark_node;
5318 type = strip_array_types (TREE_TYPE (TREE_TYPE (addr)));
5320 fnname = ansi_opname (code);
5322 if (CLASS_TYPE_P (type)
5323 && COMPLETE_TYPE_P (complete_type (type))
5327 If the result of the lookup is ambiguous or inaccessible, or if
5328 the lookup selects a placement deallocation function, the
5329 program is ill-formed.
5331 Therefore, we ask lookup_fnfields to complain about ambiguity. */
5333 fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1);
5334 if (fns == error_mark_node)
5335 return error_mark_node;
5340 if (fns == NULL_TREE)
5341 fns = lookup_name_nonclass (fnname);
5343 /* Strip const and volatile from addr. */
5344 addr = cp_convert (ptr_type_node, addr);
5348 /* "A declaration of a placement deallocation function matches the
5349 declaration of a placement allocation function if it has the same
5350 number of parameters and, after parameter transformations (8.3.5),
5351 all parameter types except the first are identical."
5353 So we build up the function type we want and ask instantiate_type
5354 to get it for us. */
5355 t = FUNCTION_ARG_CHAIN (alloc_fn);
5356 t = tree_cons (NULL_TREE, ptr_type_node, t);
5357 t = build_function_type (void_type_node, t);
5359 fn = instantiate_type (t, fns, tf_none);
5360 if (fn == error_mark_node)
5363 if (BASELINK_P (fn))
5364 fn = BASELINK_FUNCTIONS (fn);
5366 /* "If the lookup finds the two-parameter form of a usual deallocation
5367 function (3.7.4.2) and that function, considered as a placement
5368 deallocation function, would have been selected as a match for the
5369 allocation function, the program is ill-formed." */
5370 if (non_placement_deallocation_fn_p (fn))
5372 /* But if the class has an operator delete (void *), then that is
5373 the usual deallocation function, so we shouldn't complain
5374 about using the operator delete (void *, size_t). */
5375 for (t = BASELINK_P (fns) ? BASELINK_FUNCTIONS (fns) : fns;
5376 t; t = OVL_NEXT (t))
5378 tree elt = OVL_CURRENT (t);
5379 if (non_placement_deallocation_fn_p (elt)
5380 && FUNCTION_ARG_CHAIN (elt) == void_list_node)
5383 permerror (0, "non-placement deallocation function %q+D", fn);
5384 permerror (input_location, "selected for placement delete");
5389 /* "Any non-placement deallocation function matches a non-placement
5390 allocation function. If the lookup finds a single matching
5391 deallocation function, that function will be called; otherwise, no
5392 deallocation function will be called." */
5393 for (t = BASELINK_P (fns) ? BASELINK_FUNCTIONS (fns) : fns;
5394 t; t = OVL_NEXT (t))
5396 tree elt = OVL_CURRENT (t);
5397 if (non_placement_deallocation_fn_p (elt))
5400 /* "If a class T has a member deallocation function named
5401 operator delete with exactly one parameter, then that
5402 function is a usual (non-placement) deallocation
5403 function. If class T does not declare such an operator
5404 delete but does declare a member deallocation function named
5405 operator delete with exactly two parameters, the second of
5406 which has type std::size_t (18.2), then this function is a
5407 usual deallocation function."
5409 So (void*) beats (void*, size_t). */
5410 if (FUNCTION_ARG_CHAIN (fn) == void_list_node)
5415 /* If we have a matching function, call it. */
5418 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
5420 /* If the FN is a member function, make sure that it is
5422 if (BASELINK_P (fns))
5423 perform_or_defer_access_check (BASELINK_BINFO (fns), fn, fn);
5425 /* Core issue 901: It's ok to new a type with deleted delete. */
5426 if (DECL_DELETED_FN (fn) && alloc_fn)
5431 /* The placement args might not be suitable for overload
5432 resolution at this point, so build the call directly. */
5433 int nargs = call_expr_nargs (placement);
5434 tree *argarray = XALLOCAVEC (tree, nargs);
5437 for (i = 1; i < nargs; i++)
5438 argarray[i] = CALL_EXPR_ARG (placement, i);
5440 return build_cxx_call (fn, nargs, argarray);
5445 VEC(tree,gc) *args = VEC_alloc (tree, gc, 2);
5446 VEC_quick_push (tree, args, addr);
5447 if (FUNCTION_ARG_CHAIN (fn) != void_list_node)
5448 VEC_quick_push (tree, args, size);
5449 ret = cp_build_function_call_vec (fn, &args, tf_warning_or_error);
5450 VEC_free (tree, gc, args);
5457 If no unambiguous matching deallocation function can be found,
5458 propagating the exception does not cause the object's memory to
5463 warning (0, "no corresponding deallocation function for %qD",
5468 error ("no suitable %<operator %s%> for %qT",
5469 operator_name_info[(int)code].name, type);
5470 return error_mark_node;
5473 /* If the current scope isn't allowed to access DECL along
5474 BASETYPE_PATH, give an error. The most derived class in
5475 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
5476 the declaration to use in the error diagnostic. */
5479 enforce_access (tree basetype_path, tree decl, tree diag_decl)
5481 gcc_assert (TREE_CODE (basetype_path) == TREE_BINFO);
5483 if (!accessible_p (basetype_path, decl, true))
5485 if (TREE_PRIVATE (decl))
5486 error ("%q+#D is private", diag_decl);
5487 else if (TREE_PROTECTED (decl))
5488 error ("%q+#D is protected", diag_decl);
5490 error ("%q+#D is inaccessible", diag_decl);
5491 error ("within this context");
5498 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
5499 bitwise or of LOOKUP_* values. If any errors are warnings are
5500 generated, set *DIAGNOSTIC_FN to "error" or "warning",
5501 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
5505 build_temp (tree expr, tree type, int flags,
5506 diagnostic_t *diagnostic_kind, tsubst_flags_t complain)
5511 savew = warningcount, savee = errorcount;
5512 args = make_tree_vector_single (expr);
5513 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
5514 &args, type, flags, complain);
5515 release_tree_vector (args);
5516 if (warningcount > savew)
5517 *diagnostic_kind = DK_WARNING;
5518 else if (errorcount > savee)
5519 *diagnostic_kind = DK_ERROR;
5521 *diagnostic_kind = DK_UNSPECIFIED;
5525 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
5526 EXPR is implicitly converted to type TOTYPE.
5527 FN and ARGNUM are used for diagnostics. */
5530 conversion_null_warnings (tree totype, tree expr, tree fn, int argnum)
5532 /* Issue warnings about peculiar, but valid, uses of NULL. */
5533 if (expr == null_node && TREE_CODE (totype) != BOOLEAN_TYPE
5534 && ARITHMETIC_TYPE_P (totype))
5537 warning_at (input_location, OPT_Wconversion_null,
5538 "passing NULL to non-pointer argument %P of %qD",
5541 warning_at (input_location, OPT_Wconversion_null,
5542 "converting to non-pointer type %qT from NULL", totype);
5545 /* Issue warnings if "false" is converted to a NULL pointer */
5546 else if (expr == boolean_false_node && TYPE_PTR_P (totype))
5549 warning_at (input_location, OPT_Wconversion_null,
5550 "converting %<false%> to pointer type for argument %P "
5551 "of %qD", argnum, fn);
5553 warning_at (input_location, OPT_Wconversion_null,
5554 "converting %<false%> to pointer type %qT", totype);
5558 /* Perform the conversions in CONVS on the expression EXPR. FN and
5559 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
5560 indicates the `this' argument of a method. INNER is nonzero when
5561 being called to continue a conversion chain. It is negative when a
5562 reference binding will be applied, positive otherwise. If
5563 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
5564 conversions will be emitted if appropriate. If C_CAST_P is true,
5565 this conversion is coming from a C-style cast; in that case,
5566 conversions to inaccessible bases are permitted. */
5569 convert_like_real (conversion *convs, tree expr, tree fn, int argnum,
5570 int inner, bool issue_conversion_warnings,
5571 bool c_cast_p, tsubst_flags_t complain)
5573 tree totype = convs->type;
5574 diagnostic_t diag_kind;
5577 if (convs->bad_p && !(complain & tf_error))
5578 return error_mark_node;
5581 && convs->kind != ck_user
5582 && convs->kind != ck_list
5583 && convs->kind != ck_ambig
5584 && (convs->kind != ck_ref_bind
5585 || convs->user_conv_p)
5586 && convs->kind != ck_rvalue
5587 && convs->kind != ck_base)
5589 conversion *t = convs;
5591 /* Give a helpful error if this is bad because of excess braces. */
5592 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
5593 && SCALAR_TYPE_P (totype)
5594 && CONSTRUCTOR_NELTS (expr) > 0
5595 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr, 0)->value))
5596 permerror (input_location, "too many braces around initializer for %qT", totype);
5598 for (; t; t = t->u.next)
5600 if (t->kind == ck_user && t->cand->reason)
5602 permerror (input_location, "invalid user-defined conversion "
5603 "from %qT to %qT", TREE_TYPE (expr), totype);
5604 print_z_candidate ("candidate is:", t->cand);
5605 expr = convert_like_real (t, expr, fn, argnum, 1,
5606 /*issue_conversion_warnings=*/false,
5609 if (convs->kind == ck_ref_bind)
5610 return convert_to_reference (totype, expr, CONV_IMPLICIT,
5611 LOOKUP_NORMAL, NULL_TREE);
5613 return cp_convert (totype, expr);
5615 else if (t->kind == ck_user || !t->bad_p)
5617 expr = convert_like_real (t, expr, fn, argnum, 1,
5618 /*issue_conversion_warnings=*/false,
5623 else if (t->kind == ck_ambig)
5624 return convert_like_real (t, expr, fn, argnum, 1,
5625 /*issue_conversion_warnings=*/false,
5628 else if (t->kind == ck_identity)
5632 permerror (input_location, "invalid conversion from %qT to %qT",
5633 TREE_TYPE (expr), totype);
5635 permerror (DECL_SOURCE_LOCATION (fn),
5636 " initializing argument %P of %qD", argnum, fn);
5638 return cp_convert (totype, expr);
5641 if (issue_conversion_warnings && (complain & tf_warning))
5642 conversion_null_warnings (totype, expr, fn, argnum);
5644 switch (convs->kind)
5648 struct z_candidate *cand = convs->cand;
5649 tree convfn = cand->fn;
5652 /* If we're initializing from {}, it's value-initialization. */
5653 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
5654 && CONSTRUCTOR_NELTS (expr) == 0
5655 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
5657 expr = build_value_init (totype, complain);
5658 expr = get_target_expr_sfinae (expr, complain);
5659 if (expr != error_mark_node)
5660 TARGET_EXPR_LIST_INIT_P (expr) = true;
5664 expr = mark_rvalue_use (expr);
5666 /* When converting from an init list we consider explicit
5667 constructors, but actually trying to call one is an error. */
5668 if (DECL_NONCONVERTING_P (convfn) && DECL_CONSTRUCTOR_P (convfn)
5669 /* Unless this is for direct-list-initialization. */
5670 && !(BRACE_ENCLOSED_INITIALIZER_P (expr)
5671 && CONSTRUCTOR_IS_DIRECT_INIT (expr))
5672 /* Unless we're calling it for value-initialization from an
5673 empty list, since that is handled separately in 8.5.4. */
5674 && cand->num_convs > 0)
5676 error ("converting to %qT from initializer list would use "
5677 "explicit constructor %qD", totype, convfn);
5680 /* Set user_conv_p on the argument conversions, so rvalue/base
5681 handling knows not to allow any more UDCs. */
5682 for (i = 0; i < cand->num_convs; ++i)
5683 cand->convs[i]->user_conv_p = true;
5685 expr = build_over_call (cand, LOOKUP_NORMAL, complain);
5687 /* If this is a constructor or a function returning an aggr type,
5688 we need to build up a TARGET_EXPR. */
5689 if (DECL_CONSTRUCTOR_P (convfn))
5691 expr = build_cplus_new (totype, expr, complain);
5693 /* Remember that this was list-initialization. */
5694 if (convs->check_narrowing && expr != error_mark_node)
5695 TARGET_EXPR_LIST_INIT_P (expr) = true;
5701 expr = mark_rvalue_use (expr);
5702 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
5704 int nelts = CONSTRUCTOR_NELTS (expr);
5706 expr = build_value_init (totype, complain);
5707 else if (nelts == 1)
5708 expr = CONSTRUCTOR_ELT (expr, 0)->value;
5713 if (type_unknown_p (expr))
5714 expr = instantiate_type (totype, expr, complain);
5715 /* Convert a constant to its underlying value, unless we are
5716 about to bind it to a reference, in which case we need to
5717 leave it as an lvalue. */
5720 expr = decl_constant_value_safe (expr);
5721 if (expr == null_node && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype))
5722 /* If __null has been converted to an integer type, we do not
5723 want to warn about uses of EXPR as an integer, rather than
5725 expr = build_int_cst (totype, 0);
5729 /* We leave bad_p off ck_ambig because overload resolution considers
5730 it valid, it just fails when we try to perform it. So we need to
5731 check complain here, too. */
5732 if (complain & tf_error)
5734 /* Call build_user_type_conversion again for the error. */
5735 build_user_type_conversion (totype, convs->u.expr, LOOKUP_NORMAL);
5737 error (" initializing argument %P of %q+D", argnum, fn);
5739 return error_mark_node;
5743 /* Conversion to std::initializer_list<T>. */
5744 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype), 0);
5745 tree new_ctor = build_constructor (init_list_type_node, NULL);
5746 unsigned len = CONSTRUCTOR_NELTS (expr);
5747 tree array, val, field;
5748 VEC(constructor_elt,gc) *vec = NULL;
5751 /* Convert all the elements. */
5752 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr), ix, val)
5754 tree sub = convert_like_real (convs->u.list[ix], val, fn, argnum,
5755 1, false, false, complain);
5756 if (sub == error_mark_node)
5758 if (!BRACE_ENCLOSED_INITIALIZER_P (val))
5759 check_narrowing (TREE_TYPE (sub), val);
5760 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor), NULL_TREE, sub);
5761 if (!TREE_CONSTANT (sub))
5762 TREE_CONSTANT (new_ctor) = false;
5764 /* Build up the array. */
5765 elttype = cp_build_qualified_type
5766 (elttype, cp_type_quals (elttype) | TYPE_QUAL_CONST);
5767 array = build_array_of_n_type (elttype, len);
5768 array = finish_compound_literal (array, new_ctor, complain);
5770 /* Build up the initializer_list object. */
5771 totype = complete_type (totype);
5772 field = next_initializable_field (TYPE_FIELDS (totype));
5773 CONSTRUCTOR_APPEND_ELT (vec, field, decay_conversion (array));
5774 field = next_initializable_field (DECL_CHAIN (field));
5775 CONSTRUCTOR_APPEND_ELT (vec, field, size_int (len));
5776 new_ctor = build_constructor (totype, vec);
5777 return get_target_expr (new_ctor);
5781 if (TREE_CODE (totype) == COMPLEX_TYPE)
5783 tree real = CONSTRUCTOR_ELT (expr, 0)->value;
5784 tree imag = CONSTRUCTOR_ELT (expr, 1)->value;
5785 real = perform_implicit_conversion (TREE_TYPE (totype),
5787 imag = perform_implicit_conversion (TREE_TYPE (totype),
5789 expr = build2 (COMPLEX_EXPR, totype, real, imag);
5790 return fold_if_not_in_template (expr);
5792 return get_target_expr (digest_init (totype, expr, complain));
5798 expr = convert_like_real (convs->u.next, expr, fn, argnum,
5799 convs->kind == ck_ref_bind ? -1 : 1,
5800 convs->kind == ck_ref_bind ? issue_conversion_warnings : false,
5803 if (expr == error_mark_node)
5804 return error_mark_node;
5806 switch (convs->kind)
5809 expr = decay_conversion (expr);
5810 if (! MAYBE_CLASS_TYPE_P (totype))
5812 /* Else fall through. */
5814 if (convs->kind == ck_base && !convs->need_temporary_p)
5816 /* We are going to bind a reference directly to a base-class
5817 subobject of EXPR. */
5818 /* Build an expression for `*((base*) &expr)'. */
5819 expr = cp_build_addr_expr (expr, complain);
5820 expr = convert_to_base (expr, build_pointer_type (totype),
5821 !c_cast_p, /*nonnull=*/true, complain);
5822 expr = cp_build_indirect_ref (expr, RO_IMPLICIT_CONVERSION, complain);
5826 /* Copy-initialization where the cv-unqualified version of the source
5827 type is the same class as, or a derived class of, the class of the
5828 destination [is treated as direct-initialization]. [dcl.init] */
5829 flags = LOOKUP_NORMAL|LOOKUP_ONLYCONVERTING;
5830 if (convs->user_conv_p)
5831 /* This conversion is being done in the context of a user-defined
5832 conversion (i.e. the second step of copy-initialization), so
5833 don't allow any more. */
5834 flags |= LOOKUP_NO_CONVERSION;
5835 if (convs->rvaluedness_matches_p)
5836 flags |= LOOKUP_PREFER_RVALUE;
5837 if (TREE_CODE (expr) == TARGET_EXPR
5838 && TARGET_EXPR_LIST_INIT_P (expr))
5839 /* Copy-list-initialization doesn't actually involve a copy. */
5841 expr = build_temp (expr, totype, flags, &diag_kind, complain);
5842 if (diag_kind && fn && complain)
5843 emit_diagnostic (diag_kind, DECL_SOURCE_LOCATION (fn), 0,
5844 " initializing argument %P of %qD", argnum, fn);
5845 return build_cplus_new (totype, expr, complain);
5849 tree ref_type = totype;
5851 if (convs->bad_p && !convs->u.next->bad_p)
5853 gcc_assert (TYPE_REF_IS_RVALUE (ref_type)
5854 && real_lvalue_p (expr));
5856 error ("cannot bind %qT lvalue to %qT",
5857 TREE_TYPE (expr), totype);
5859 error (" initializing argument %P of %q+D", argnum, fn);
5860 return error_mark_node;
5863 /* If necessary, create a temporary.
5865 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
5866 that need temporaries, even when their types are reference
5867 compatible with the type of reference being bound, so the
5868 upcoming call to cp_build_addr_expr doesn't fail. */
5869 if (convs->need_temporary_p
5870 || TREE_CODE (expr) == CONSTRUCTOR
5871 || TREE_CODE (expr) == VA_ARG_EXPR)
5873 /* Otherwise, a temporary of type "cv1 T1" is created and
5874 initialized from the initializer expression using the rules
5875 for a non-reference copy-initialization (8.5). */
5877 tree type = TREE_TYPE (ref_type);
5878 cp_lvalue_kind lvalue = real_lvalue_p (expr);
5880 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5881 (type, convs->u.next->type));
5882 if (!CP_TYPE_CONST_NON_VOLATILE_P (type)
5883 && !TYPE_REF_IS_RVALUE (ref_type))
5885 /* If the reference is volatile or non-const, we
5886 cannot create a temporary. */
5887 if (lvalue & clk_bitfield)
5888 error ("cannot bind bitfield %qE to %qT",
5890 else if (lvalue & clk_packed)
5891 error ("cannot bind packed field %qE to %qT",
5894 error ("cannot bind rvalue %qE to %qT", expr, ref_type);
5895 return error_mark_node;
5897 /* If the source is a packed field, and we must use a copy
5898 constructor, then building the target expr will require
5899 binding the field to the reference parameter to the
5900 copy constructor, and we'll end up with an infinite
5901 loop. If we can use a bitwise copy, then we'll be
5903 if ((lvalue & clk_packed)
5904 && CLASS_TYPE_P (type)
5905 && type_has_nontrivial_copy_init (type))
5907 error ("cannot bind packed field %qE to %qT",
5909 return error_mark_node;
5911 if (lvalue & clk_bitfield)
5913 expr = convert_bitfield_to_declared_type (expr);
5914 expr = fold_convert (type, expr);
5916 expr = build_target_expr_with_type (expr, type, complain);
5919 /* Take the address of the thing to which we will bind the
5921 expr = cp_build_addr_expr (expr, complain);
5922 if (expr == error_mark_node)
5923 return error_mark_node;
5925 /* Convert it to a pointer to the type referred to by the
5926 reference. This will adjust the pointer if a derived to
5927 base conversion is being performed. */
5928 expr = cp_convert (build_pointer_type (TREE_TYPE (ref_type)),
5930 /* Convert the pointer to the desired reference type. */
5931 return build_nop (ref_type, expr);
5935 return decay_conversion (expr);
5938 /* Warn about deprecated conversion if appropriate. */
5939 string_conv_p (totype, expr, 1);
5944 expr = convert_to_base (expr, totype, !c_cast_p,
5945 /*nonnull=*/false, complain);
5946 return build_nop (totype, expr);
5949 return convert_ptrmem (totype, expr, /*allow_inverse_p=*/false,
5950 c_cast_p, complain);
5956 if (convs->check_narrowing)
5957 check_narrowing (totype, expr);
5959 if (issue_conversion_warnings && (complain & tf_warning))
5960 expr = convert_and_check (totype, expr);
5962 expr = convert (totype, expr);
5967 /* ARG is being passed to a varargs function. Perform any conversions
5968 required. Return the converted value. */
5971 convert_arg_to_ellipsis (tree arg)
5977 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
5978 standard conversions are performed. */
5979 arg = decay_conversion (arg);
5980 arg_type = TREE_TYPE (arg);
5983 If the argument has integral or enumeration type that is subject
5984 to the integral promotions (_conv.prom_), or a floating point
5985 type that is subject to the floating point promotion
5986 (_conv.fpprom_), the value of the argument is converted to the
5987 promoted type before the call. */
5988 if (TREE_CODE (arg_type) == REAL_TYPE
5989 && (TYPE_PRECISION (arg_type)
5990 < TYPE_PRECISION (double_type_node))
5991 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type)))
5993 if (warn_double_promotion && !c_inhibit_evaluation_warnings)
5994 warning (OPT_Wdouble_promotion,
5995 "implicit conversion from %qT to %qT when passing "
5996 "argument to function",
5997 arg_type, double_type_node);
5998 arg = convert_to_real (double_type_node, arg);
6000 else if (NULLPTR_TYPE_P (arg_type))
6001 arg = null_pointer_node;
6002 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type))
6004 if (SCOPED_ENUM_P (arg_type) && !abi_version_at_least (6))
6006 warning (OPT_Wabi, "scoped enum %qT will not promote to an "
6007 "integral type in a future version of GCC", arg_type);
6008 arg = cp_convert (ENUM_UNDERLYING_TYPE (arg_type), arg);
6010 arg = perform_integral_promotions (arg);
6013 arg = require_complete_type (arg);
6014 arg_type = TREE_TYPE (arg);
6016 if (arg != error_mark_node
6017 /* In a template (or ill-formed code), we can have an incomplete type
6018 even after require_complete_type, in which case we don't know
6019 whether it has trivial copy or not. */
6020 && COMPLETE_TYPE_P (arg_type))
6022 /* Build up a real lvalue-to-rvalue conversion in case the
6023 copy constructor is trivial but not callable. */
6024 if (!cp_unevaluated_operand && CLASS_TYPE_P (arg_type))
6025 force_rvalue (arg, tf_warning_or_error);
6027 /* [expr.call] 5.2.2/7:
6028 Passing a potentially-evaluated argument of class type (Clause 9)
6029 with a non-trivial copy constructor or a non-trivial destructor
6030 with no corresponding parameter is conditionally-supported, with
6031 implementation-defined semantics.
6033 We used to just warn here and do a bitwise copy, but now
6034 cp_expr_size will abort if we try to do that.
6036 If the call appears in the context of a sizeof expression,
6037 it is not potentially-evaluated. */
6038 if (cp_unevaluated_operand == 0
6039 && (type_has_nontrivial_copy_init (arg_type)
6040 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type)))
6041 error ("cannot pass objects of non-trivially-copyable "
6042 "type %q#T through %<...%>", arg_type);
6048 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
6051 build_x_va_arg (tree expr, tree type)
6053 if (processing_template_decl)
6054 return build_min (VA_ARG_EXPR, type, expr);
6056 type = complete_type_or_else (type, NULL_TREE);
6058 if (expr == error_mark_node || !type)
6059 return error_mark_node;
6061 expr = mark_lvalue_use (expr);
6063 if (type_has_nontrivial_copy_init (type)
6064 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
6065 || TREE_CODE (type) == REFERENCE_TYPE)
6067 /* Remove reference types so we don't ICE later on. */
6068 tree type1 = non_reference (type);
6069 /* conditionally-supported behavior [expr.call] 5.2.2/7. */
6070 error ("cannot receive objects of non-trivially-copyable type %q#T "
6071 "through %<...%>; ", type);
6072 expr = convert (build_pointer_type (type1), null_node);
6073 expr = cp_build_indirect_ref (expr, RO_NULL, tf_warning_or_error);
6077 return build_va_arg (input_location, expr, type);
6080 /* TYPE has been given to va_arg. Apply the default conversions which
6081 would have happened when passed via ellipsis. Return the promoted
6082 type, or the passed type if there is no change. */
6085 cxx_type_promotes_to (tree type)
6089 /* Perform the array-to-pointer and function-to-pointer
6091 type = type_decays_to (type);
6093 promote = type_promotes_to (type);
6094 if (same_type_p (type, promote))
6100 /* ARG is a default argument expression being passed to a parameter of
6101 the indicated TYPE, which is a parameter to FN. PARMNUM is the
6102 zero-based argument number. Do any required conversions. Return
6103 the converted value. */
6105 static GTY(()) VEC(tree,gc) *default_arg_context;
6107 push_defarg_context (tree fn)
6108 { VEC_safe_push (tree, gc, default_arg_context, fn); }
6110 pop_defarg_context (void)
6111 { VEC_pop (tree, default_arg_context); }
6114 convert_default_arg (tree type, tree arg, tree fn, int parmnum)
6119 /* See through clones. */
6120 fn = DECL_ORIGIN (fn);
6122 /* Detect recursion. */
6123 FOR_EACH_VEC_ELT (tree, default_arg_context, i, t)
6126 error ("recursive evaluation of default argument for %q#D", fn);
6127 return error_mark_node;
6130 /* If the ARG is an unparsed default argument expression, the
6131 conversion cannot be performed. */
6132 if (TREE_CODE (arg) == DEFAULT_ARG)
6134 error ("call to %qD uses the default argument for parameter %P, which "
6135 "is not yet defined", fn, parmnum);
6136 return error_mark_node;
6139 push_defarg_context (fn);
6141 if (fn && DECL_TEMPLATE_INFO (fn))
6142 arg = tsubst_default_argument (fn, type, arg);
6148 The names in the expression are bound, and the semantic
6149 constraints are checked, at the point where the default
6150 expressions appears.
6152 we must not perform access checks here. */
6153 push_deferring_access_checks (dk_no_check);
6154 /* We must make a copy of ARG, in case subsequent processing
6155 alters any part of it. */
6156 arg = break_out_target_exprs (arg);
6157 if (TREE_CODE (arg) == CONSTRUCTOR)
6159 arg = digest_init (type, arg, tf_warning_or_error);
6160 arg = convert_for_initialization (0, type, arg, LOOKUP_IMPLICIT,
6161 ICR_DEFAULT_ARGUMENT, fn, parmnum,
6162 tf_warning_or_error);
6166 arg = convert_for_initialization (0, type, arg, LOOKUP_IMPLICIT,
6167 ICR_DEFAULT_ARGUMENT, fn, parmnum,
6168 tf_warning_or_error);
6169 arg = convert_for_arg_passing (type, arg);
6171 pop_deferring_access_checks();
6173 pop_defarg_context ();
6178 /* Returns the type which will really be used for passing an argument of
6182 type_passed_as (tree type)
6184 /* Pass classes with copy ctors by invisible reference. */
6185 if (TREE_ADDRESSABLE (type))
6187 type = build_reference_type (type);
6188 /* There are no other pointers to this temporary. */
6189 type = cp_build_qualified_type (type, TYPE_QUAL_RESTRICT);
6191 else if (targetm.calls.promote_prototypes (type)
6192 && INTEGRAL_TYPE_P (type)
6193 && COMPLETE_TYPE_P (type)
6194 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type),
6195 TYPE_SIZE (integer_type_node)))
6196 type = integer_type_node;
6201 /* Actually perform the appropriate conversion. */
6204 convert_for_arg_passing (tree type, tree val)
6208 /* If VAL is a bitfield, then -- since it has already been converted
6209 to TYPE -- it cannot have a precision greater than TYPE.
6211 If it has a smaller precision, we must widen it here. For
6212 example, passing "int f:3;" to a function expecting an "int" will
6213 not result in any conversion before this point.
6215 If the precision is the same we must not risk widening. For
6216 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
6217 often have type "int", even though the C++ type for the field is
6218 "long long". If the value is being passed to a function
6219 expecting an "int", then no conversions will be required. But,
6220 if we call convert_bitfield_to_declared_type, the bitfield will
6221 be converted to "long long". */
6222 bitfield_type = is_bitfield_expr_with_lowered_type (val);
6224 && TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type))
6225 val = convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type), val);
6227 if (val == error_mark_node)
6229 /* Pass classes with copy ctors by invisible reference. */
6230 else if (TREE_ADDRESSABLE (type))
6231 val = build1 (ADDR_EXPR, build_reference_type (type), val);
6232 else if (targetm.calls.promote_prototypes (type)
6233 && INTEGRAL_TYPE_P (type)
6234 && COMPLETE_TYPE_P (type)
6235 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type),
6236 TYPE_SIZE (integer_type_node)))
6237 val = perform_integral_promotions (val);
6238 if (warn_missing_format_attribute)
6240 tree rhstype = TREE_TYPE (val);
6241 const enum tree_code coder = TREE_CODE (rhstype);
6242 const enum tree_code codel = TREE_CODE (type);
6243 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
6245 && check_missing_format_attribute (type, rhstype))
6246 warning (OPT_Wmissing_format_attribute,
6247 "argument of function call might be a candidate for a format attribute");
6252 /* Returns true iff FN is a function with magic varargs, i.e. ones for
6253 which no conversions at all should be done. This is true for some
6254 builtins which don't act like normal functions. */
6257 magic_varargs_p (tree fn)
6259 if (DECL_BUILT_IN (fn))
6260 switch (DECL_FUNCTION_CODE (fn))
6262 case BUILT_IN_CLASSIFY_TYPE:
6263 case BUILT_IN_CONSTANT_P:
6264 case BUILT_IN_NEXT_ARG:
6265 case BUILT_IN_VA_START:
6269 return lookup_attribute ("type generic",
6270 TYPE_ATTRIBUTES (TREE_TYPE (fn))) != 0;
6276 /* Subroutine of the various build_*_call functions. Overload resolution
6277 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
6278 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
6279 bitmask of various LOOKUP_* flags which apply to the call itself. */
6282 build_over_call (struct z_candidate *cand, int flags, tsubst_flags_t complain)
6285 const VEC(tree,gc) *args = cand->args;
6286 tree first_arg = cand->first_arg;
6287 conversion **convs = cand->convs;
6289 tree parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
6294 unsigned int arg_index = 0;
6298 bool already_used = false;
6300 /* In a template, there is no need to perform all of the work that
6301 is normally done. We are only interested in the type of the call
6302 expression, i.e., the return type of the function. Any semantic
6303 errors will be deferred until the template is instantiated. */
6304 if (processing_template_decl)
6308 const tree *argarray;
6311 return_type = TREE_TYPE (TREE_TYPE (fn));
6312 nargs = VEC_length (tree, args);
6313 if (first_arg == NULL_TREE)
6314 argarray = VEC_address (tree, CONST_CAST (VEC(tree,gc) *, args));
6322 alcarray = XALLOCAVEC (tree, nargs);
6323 alcarray[0] = first_arg;
6324 FOR_EACH_VEC_ELT (tree, args, ix, arg)
6325 alcarray[ix + 1] = arg;
6326 argarray = alcarray;
6328 expr = build_call_array_loc (input_location,
6329 return_type, build_addr_func (fn), nargs,
6331 if (TREE_THIS_VOLATILE (fn) && cfun)
6332 current_function_returns_abnormally = 1;
6333 return convert_from_reference (expr);
6336 /* Give any warnings we noticed during overload resolution. */
6337 if (cand->warnings && (complain & tf_warning))
6339 struct candidate_warning *w;
6340 for (w = cand->warnings; w; w = w->next)
6341 joust (cand, w->loser, 1);
6344 /* Make =delete work with SFINAE. */
6345 if (DECL_DELETED_FN (fn) && !(complain & tf_error))
6346 return error_mark_node;
6348 if (DECL_FUNCTION_MEMBER_P (fn))
6351 /* If FN is a template function, two cases must be considered.
6356 template <class T> void f();
6358 template <class T> struct B {
6362 struct C : A, B<int> {
6364 using B<int>::g; // #2
6367 In case #1 where `A::f' is a member template, DECL_ACCESS is
6368 recorded in the primary template but not in its specialization.
6369 We check access of FN using its primary template.
6371 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
6372 because it is a member of class template B, DECL_ACCESS is
6373 recorded in the specialization `B<int>::g'. We cannot use its
6374 primary template because `B<T>::g' and `B<int>::g' may have
6375 different access. */
6376 if (DECL_TEMPLATE_INFO (fn)
6377 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
6378 access_fn = DECL_TI_TEMPLATE (fn);
6381 if (flags & LOOKUP_SPECULATIVE)
6383 if (!speculative_access_check (cand->access_path, access_fn, fn,
6384 !!(flags & LOOKUP_COMPLAIN)))
6385 return error_mark_node;
6388 perform_or_defer_access_check (cand->access_path, access_fn, fn);
6391 /* If we're checking for implicit delete, don't bother with argument
6393 if (flags & LOOKUP_SPECULATIVE)
6395 if (DECL_DELETED_FN (fn))
6397 if (flags & LOOKUP_COMPLAIN)
6399 return error_mark_node;
6401 if (cand->viable == 1)
6403 else if (!(flags & LOOKUP_COMPLAIN))
6404 /* Reject bad conversions now. */
6405 return error_mark_node;
6406 /* else continue to get conversion error. */
6409 /* Find maximum size of vector to hold converted arguments. */
6410 parmlen = list_length (parm);
6411 nargs = VEC_length (tree, args) + (first_arg != NULL_TREE ? 1 : 0);
6412 if (parmlen > nargs)
6414 argarray = XALLOCAVEC (tree, nargs);
6416 /* The implicit parameters to a constructor are not considered by overload
6417 resolution, and must be of the proper type. */
6418 if (DECL_CONSTRUCTOR_P (fn))
6420 if (first_arg != NULL_TREE)
6422 argarray[j++] = first_arg;
6423 first_arg = NULL_TREE;
6427 argarray[j++] = VEC_index (tree, args, arg_index);
6430 parm = TREE_CHAIN (parm);
6431 /* We should never try to call the abstract constructor. */
6432 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn));
6434 if (DECL_HAS_VTT_PARM_P (fn))
6436 argarray[j++] = VEC_index (tree, args, arg_index);
6438 parm = TREE_CHAIN (parm);
6441 /* Bypass access control for 'this' parameter. */
6442 else if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
6444 tree parmtype = TREE_VALUE (parm);
6445 tree arg = (first_arg != NULL_TREE
6447 : VEC_index (tree, args, arg_index));
6448 tree argtype = TREE_TYPE (arg);
6452 if (convs[i]->bad_p)
6454 if (complain & tf_error)
6455 permerror (input_location, "passing %qT as %<this%> argument of %q#D discards qualifiers",
6456 TREE_TYPE (argtype), fn);
6458 return error_mark_node;
6461 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
6462 X is called for an object that is not of type X, or of a type
6463 derived from X, the behavior is undefined.
6465 So we can assume that anything passed as 'this' is non-null, and
6466 optimize accordingly. */
6467 gcc_assert (TREE_CODE (parmtype) == POINTER_TYPE);
6468 /* Convert to the base in which the function was declared. */
6469 gcc_assert (cand->conversion_path != NULL_TREE);
6470 converted_arg = build_base_path (PLUS_EXPR,
6472 cand->conversion_path,
6474 /* Check that the base class is accessible. */
6475 if (!accessible_base_p (TREE_TYPE (argtype),
6476 BINFO_TYPE (cand->conversion_path), true))
6477 error ("%qT is not an accessible base of %qT",
6478 BINFO_TYPE (cand->conversion_path),
6479 TREE_TYPE (argtype));
6480 /* If fn was found by a using declaration, the conversion path
6481 will be to the derived class, not the base declaring fn. We
6482 must convert from derived to base. */
6483 base_binfo = lookup_base (TREE_TYPE (TREE_TYPE (converted_arg)),
6484 TREE_TYPE (parmtype), ba_unique, NULL);
6485 converted_arg = build_base_path (PLUS_EXPR, converted_arg,
6486 base_binfo, 1, complain);
6488 argarray[j++] = converted_arg;
6489 parm = TREE_CHAIN (parm);
6490 if (first_arg != NULL_TREE)
6491 first_arg = NULL_TREE;
6498 gcc_assert (first_arg == NULL_TREE);
6499 for (; arg_index < VEC_length (tree, args) && parm;
6500 parm = TREE_CHAIN (parm), ++arg_index, ++i)
6502 tree type = TREE_VALUE (parm);
6503 tree arg = VEC_index (tree, args, arg_index);
6504 bool conversion_warning = true;
6508 /* If the argument is NULL and used to (implicitly) instantiate a
6509 template function (and bind one of the template arguments to
6510 the type of 'long int'), we don't want to warn about passing NULL
6511 to non-pointer argument.
6512 For example, if we have this template function:
6514 template<typename T> void func(T x) {}
6516 we want to warn (when -Wconversion is enabled) in this case:
6522 but not in this case:
6528 if (arg == null_node
6529 && DECL_TEMPLATE_INFO (fn)
6530 && cand->template_decl
6531 && !(flags & LOOKUP_EXPLICIT_TMPL_ARGS))
6532 conversion_warning = false;
6534 /* Warn about initializer_list deduction that isn't currently in the
6536 if (cxx_dialect > cxx98
6537 && flag_deduce_init_list
6538 && cand->template_decl
6539 && is_std_init_list (non_reference (type))
6540 && BRACE_ENCLOSED_INITIALIZER_P (arg))
6542 tree tmpl = TI_TEMPLATE (cand->template_decl);
6543 tree realparm = chain_index (j, DECL_ARGUMENTS (cand->fn));
6544 tree patparm = get_pattern_parm (realparm, tmpl);
6545 tree pattype = TREE_TYPE (patparm);
6546 if (PACK_EXPANSION_P (pattype))
6547 pattype = PACK_EXPANSION_PATTERN (pattype);
6548 pattype = non_reference (pattype);
6550 if (TREE_CODE (pattype) == TEMPLATE_TYPE_PARM
6551 && (cand->explicit_targs == NULL_TREE
6552 || (TREE_VEC_LENGTH (cand->explicit_targs)
6553 <= TEMPLATE_TYPE_IDX (pattype))))
6555 pedwarn (input_location, 0, "deducing %qT as %qT",
6556 non_reference (TREE_TYPE (patparm)),
6557 non_reference (type));
6558 pedwarn (input_location, 0, " in call to %q+D", cand->fn);
6559 pedwarn (input_location, 0,
6560 " (you can disable this with -fno-deduce-init-list)");
6564 val = convert_like_with_context (conv, arg, fn, i-is_method,
6567 : complain & (~tf_warning));
6569 val = convert_for_arg_passing (type, val);
6570 if (val == error_mark_node)
6571 return error_mark_node;
6573 argarray[j++] = val;
6576 /* Default arguments */
6577 for (; parm && parm != void_list_node; parm = TREE_CHAIN (parm), i++)
6578 argarray[j++] = convert_default_arg (TREE_VALUE (parm),
6579 TREE_PURPOSE (parm),
6582 for (; arg_index < VEC_length (tree, args); ++arg_index)
6584 tree a = VEC_index (tree, args, arg_index);
6585 if (magic_varargs_p (fn))
6586 /* Do no conversions for magic varargs. */
6587 a = mark_type_use (a);
6589 a = convert_arg_to_ellipsis (a);
6593 gcc_assert (j <= nargs);
6596 check_function_arguments (TREE_TYPE (fn), nargs, argarray);
6598 /* Avoid actually calling copy constructors and copy assignment operators,
6601 if (! flag_elide_constructors)
6602 /* Do things the hard way. */;
6603 else if (cand->num_convs == 1
6604 && (DECL_COPY_CONSTRUCTOR_P (fn)
6605 || DECL_MOVE_CONSTRUCTOR_P (fn)))
6608 tree arg = argarray[num_artificial_parms_for (fn)];
6610 bool trivial = trivial_fn_p (fn);
6612 /* Pull out the real argument, disregarding const-correctness. */
6614 while (CONVERT_EXPR_P (targ)
6615 || TREE_CODE (targ) == NON_LVALUE_EXPR)
6616 targ = TREE_OPERAND (targ, 0);
6617 if (TREE_CODE (targ) == ADDR_EXPR)
6619 targ = TREE_OPERAND (targ, 0);
6620 if (!same_type_ignoring_top_level_qualifiers_p
6621 (TREE_TYPE (TREE_TYPE (arg)), TREE_TYPE (targ)))
6630 arg = cp_build_indirect_ref (arg, RO_NULL, complain);
6632 /* [class.copy]: the copy constructor is implicitly defined even if
6633 the implementation elided its use. */
6634 if (!trivial || DECL_DELETED_FN (fn))
6637 already_used = true;
6640 /* If we're creating a temp and we already have one, don't create a
6641 new one. If we're not creating a temp but we get one, use
6642 INIT_EXPR to collapse the temp into our target. Otherwise, if the
6643 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
6644 temp or an INIT_EXPR otherwise. */
6646 if (integer_zerop (fa))
6648 if (TREE_CODE (arg) == TARGET_EXPR)
6651 return force_target_expr (DECL_CONTEXT (fn), arg, complain);
6653 else if (TREE_CODE (arg) == TARGET_EXPR || trivial)
6655 tree to = stabilize_reference (cp_build_indirect_ref (fa, RO_NULL,
6658 val = build2 (INIT_EXPR, DECL_CONTEXT (fn), to, arg);
6662 else if (DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR
6663 && trivial_fn_p (fn)
6664 && !DECL_DELETED_FN (fn))
6666 tree to = stabilize_reference
6667 (cp_build_indirect_ref (argarray[0], RO_NULL, complain));
6668 tree type = TREE_TYPE (to);
6669 tree as_base = CLASSTYPE_AS_BASE (type);
6670 tree arg = argarray[1];
6672 if (is_really_empty_class (type))
6674 /* Avoid copying empty classes. */
6675 val = build2 (COMPOUND_EXPR, void_type_node, to, arg);
6676 TREE_NO_WARNING (val) = 1;
6677 val = build2 (COMPOUND_EXPR, type, val, to);
6678 TREE_NO_WARNING (val) = 1;
6680 else if (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (as_base)))
6682 arg = cp_build_indirect_ref (arg, RO_NULL, complain);
6683 val = build2 (MODIFY_EXPR, TREE_TYPE (to), to, arg);
6687 /* We must only copy the non-tail padding parts. */
6689 tree array_type, alias_set;
6691 arg2 = TYPE_SIZE_UNIT (as_base);
6692 arg0 = cp_build_addr_expr (to, complain);
6694 array_type = build_array_type (char_type_node,
6696 (size_binop (MINUS_EXPR,
6697 arg2, size_int (1))));
6698 alias_set = build_int_cst (build_pointer_type (type), 0);
6699 t = build2 (MODIFY_EXPR, void_type_node,
6700 build2 (MEM_REF, array_type, arg0, alias_set),
6701 build2 (MEM_REF, array_type, arg, alias_set));
6702 val = build2 (COMPOUND_EXPR, TREE_TYPE (to), t, to);
6703 TREE_NO_WARNING (val) = 1;
6708 else if (DECL_DESTRUCTOR_P (fn)
6709 && trivial_fn_p (fn)
6710 && !DECL_DELETED_FN (fn))
6711 return fold_convert (void_type_node, argarray[0]);
6712 /* FIXME handle trivial default constructor, too. */
6717 if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0)
6720 tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (argarray[0])),
6723 gcc_assert (binfo && binfo != error_mark_node);
6725 /* Warn about deprecated virtual functions now, since we're about
6726 to throw away the decl. */
6727 if (TREE_DEPRECATED (fn))
6728 warn_deprecated_use (fn, NULL_TREE);
6730 argarray[0] = build_base_path (PLUS_EXPR, argarray[0], binfo, 1,
6732 if (TREE_SIDE_EFFECTS (argarray[0]))
6733 argarray[0] = save_expr (argarray[0]);
6734 t = build_pointer_type (TREE_TYPE (fn));
6735 if (DECL_CONTEXT (fn) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn)))
6736 fn = build_java_interface_fn_ref (fn, argarray[0]);
6738 fn = build_vfn_ref (argarray[0], DECL_VINDEX (fn));
6742 fn = build_addr_func (fn);
6744 return build_cxx_call (fn, nargs, argarray);
6747 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
6748 This function performs no overload resolution, conversion, or other
6749 high-level operations. */
6752 build_cxx_call (tree fn, int nargs, tree *argarray)
6756 /* Remember roughly where this call is. */
6757 location_t loc = EXPR_LOC_OR_HERE (fn);
6758 fn = build_call_a (fn, nargs, argarray);
6759 SET_EXPR_LOCATION (fn, loc);
6761 fndecl = get_callee_fndecl (fn);
6763 /* Check that arguments to builtin functions match the expectations. */
6765 && DECL_BUILT_IN (fndecl)
6766 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
6767 && !check_builtin_function_arguments (fndecl, nargs, argarray))
6768 return error_mark_node;
6770 /* Some built-in function calls will be evaluated at compile-time in
6772 fn = fold_if_not_in_template (fn);
6774 if (VOID_TYPE_P (TREE_TYPE (fn)))
6777 fn = require_complete_type (fn);
6778 if (fn == error_mark_node)
6779 return error_mark_node;
6781 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn)))
6782 fn = build_cplus_new (TREE_TYPE (fn), fn, tf_warning_or_error);
6783 return convert_from_reference (fn);
6786 static GTY(()) tree java_iface_lookup_fn;
6788 /* Make an expression which yields the address of the Java interface
6789 method FN. This is achieved by generating a call to libjava's
6790 _Jv_LookupInterfaceMethodIdx(). */
6793 build_java_interface_fn_ref (tree fn, tree instance)
6795 tree lookup_fn, method, idx;
6796 tree klass_ref, iface, iface_ref;
6799 if (!java_iface_lookup_fn)
6801 tree ftype = build_function_type_list (ptr_type_node,
6802 ptr_type_node, ptr_type_node,
6803 java_int_type_node, NULL_TREE);
6804 java_iface_lookup_fn
6805 = add_builtin_function ("_Jv_LookupInterfaceMethodIdx", ftype,
6806 0, NOT_BUILT_IN, NULL, NULL_TREE);
6809 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
6810 This is the first entry in the vtable. */
6811 klass_ref = build_vtbl_ref (cp_build_indirect_ref (instance, RO_NULL,
6812 tf_warning_or_error),
6815 /* Get the java.lang.Class pointer for the interface being called. */
6816 iface = DECL_CONTEXT (fn);
6817 iface_ref = lookup_field (iface, get_identifier ("class$"), 0, false);
6818 if (!iface_ref || TREE_CODE (iface_ref) != VAR_DECL
6819 || DECL_CONTEXT (iface_ref) != iface)
6821 error ("could not find class$ field in java interface type %qT",
6823 return error_mark_node;
6825 iface_ref = build_address (iface_ref);
6826 iface_ref = convert (build_pointer_type (iface), iface_ref);
6828 /* Determine the itable index of FN. */
6830 for (method = TYPE_METHODS (iface); method; method = DECL_CHAIN (method))
6832 if (!DECL_VIRTUAL_P (method))
6838 idx = build_int_cst (NULL_TREE, i);
6840 lookup_fn = build1 (ADDR_EXPR,
6841 build_pointer_type (TREE_TYPE (java_iface_lookup_fn)),
6842 java_iface_lookup_fn);
6843 return build_call_nary (ptr_type_node, lookup_fn,
6844 3, klass_ref, iface_ref, idx);
6847 /* Returns the value to use for the in-charge parameter when making a
6848 call to a function with the indicated NAME.
6850 FIXME:Can't we find a neater way to do this mapping? */
6853 in_charge_arg_for_name (tree name)
6855 if (name == base_ctor_identifier
6856 || name == base_dtor_identifier)
6857 return integer_zero_node;
6858 else if (name == complete_ctor_identifier)
6859 return integer_one_node;
6860 else if (name == complete_dtor_identifier)
6861 return integer_two_node;
6862 else if (name == deleting_dtor_identifier)
6863 return integer_three_node;
6865 /* This function should only be called with one of the names listed
6871 /* Build a call to a constructor, destructor, or an assignment
6872 operator for INSTANCE, an expression with class type. NAME
6873 indicates the special member function to call; *ARGS are the
6874 arguments. ARGS may be NULL. This may change ARGS. BINFO
6875 indicates the base of INSTANCE that is to be passed as the `this'
6876 parameter to the member function called.
6878 FLAGS are the LOOKUP_* flags to use when processing the call.
6880 If NAME indicates a complete object constructor, INSTANCE may be
6881 NULL_TREE. In this case, the caller will call build_cplus_new to
6882 store the newly constructed object into a VAR_DECL. */
6885 build_special_member_call (tree instance, tree name, VEC(tree,gc) **args,
6886 tree binfo, int flags, tsubst_flags_t complain)
6889 /* The type of the subobject to be constructed or destroyed. */
6891 VEC(tree,gc) *allocated = NULL;
6894 gcc_assert (name == complete_ctor_identifier
6895 || name == base_ctor_identifier
6896 || name == complete_dtor_identifier
6897 || name == base_dtor_identifier
6898 || name == deleting_dtor_identifier
6899 || name == ansi_assopname (NOP_EXPR));
6902 /* Resolve the name. */
6903 if (!complete_type_or_maybe_complain (binfo, NULL_TREE, complain))
6904 return error_mark_node;
6906 binfo = TYPE_BINFO (binfo);
6909 gcc_assert (binfo != NULL_TREE);
6911 class_type = BINFO_TYPE (binfo);
6913 /* Handle the special case where INSTANCE is NULL_TREE. */
6914 if (name == complete_ctor_identifier && !instance)
6916 instance = build_int_cst (build_pointer_type (class_type), 0);
6917 instance = build1 (INDIRECT_REF, class_type, instance);
6921 if (name == complete_dtor_identifier
6922 || name == base_dtor_identifier
6923 || name == deleting_dtor_identifier)
6924 gcc_assert (args == NULL || VEC_empty (tree, *args));
6926 /* Convert to the base class, if necessary. */
6927 if (!same_type_ignoring_top_level_qualifiers_p
6928 (TREE_TYPE (instance), BINFO_TYPE (binfo)))
6930 if (name != ansi_assopname (NOP_EXPR))
6931 /* For constructors and destructors, either the base is
6932 non-virtual, or it is virtual but we are doing the
6933 conversion from a constructor or destructor for the
6934 complete object. In either case, we can convert
6936 instance = convert_to_base_statically (instance, binfo);
6938 /* However, for assignment operators, we must convert
6939 dynamically if the base is virtual. */
6940 instance = build_base_path (PLUS_EXPR, instance,
6941 binfo, /*nonnull=*/1, complain);
6945 gcc_assert (instance != NULL_TREE);
6947 fns = lookup_fnfields (binfo, name, 1);
6949 /* When making a call to a constructor or destructor for a subobject
6950 that uses virtual base classes, pass down a pointer to a VTT for
6952 if ((name == base_ctor_identifier
6953 || name == base_dtor_identifier)
6954 && CLASSTYPE_VBASECLASSES (class_type))
6959 /* If the current function is a complete object constructor
6960 or destructor, then we fetch the VTT directly.
6961 Otherwise, we look it up using the VTT we were given. */
6962 vtt = DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type));
6963 vtt = decay_conversion (vtt);
6964 vtt = build3 (COND_EXPR, TREE_TYPE (vtt),
6965 build2 (EQ_EXPR, boolean_type_node,
6966 current_in_charge_parm, integer_zero_node),
6969 gcc_assert (BINFO_SUBVTT_INDEX (binfo));
6970 sub_vtt = fold_build_pointer_plus (vtt, BINFO_SUBVTT_INDEX (binfo));
6974 allocated = make_tree_vector ();
6978 VEC_safe_insert (tree, gc, *args, 0, sub_vtt);
6981 ret = build_new_method_call (instance, fns, args,
6982 TYPE_BINFO (BINFO_TYPE (binfo)),
6986 if (allocated != NULL)
6987 release_tree_vector (allocated);
6992 /* Return the NAME, as a C string. The NAME indicates a function that
6993 is a member of TYPE. *FREE_P is set to true if the caller must
6994 free the memory returned.
6996 Rather than go through all of this, we should simply set the names
6997 of constructors and destructors appropriately, and dispense with
6998 ctor_identifier, dtor_identifier, etc. */
7001 name_as_c_string (tree name, tree type, bool *free_p)
7005 /* Assume that we will not allocate memory. */
7007 /* Constructors and destructors are special. */
7008 if (IDENTIFIER_CTOR_OR_DTOR_P (name))
7011 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type))));
7012 /* For a destructor, add the '~'. */
7013 if (name == complete_dtor_identifier
7014 || name == base_dtor_identifier
7015 || name == deleting_dtor_identifier)
7017 pretty_name = concat ("~", pretty_name, NULL);
7018 /* Remember that we need to free the memory allocated. */
7022 else if (IDENTIFIER_TYPENAME_P (name))
7024 pretty_name = concat ("operator ",
7025 type_as_string_translate (TREE_TYPE (name),
7026 TFF_PLAIN_IDENTIFIER),
7028 /* Remember that we need to free the memory allocated. */
7032 pretty_name = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name)));
7037 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
7038 be set, upon return, to the function called. ARGS may be NULL.
7039 This may change ARGS. */
7042 build_new_method_call_1 (tree instance, tree fns, VEC(tree,gc) **args,
7043 tree conversion_path, int flags,
7044 tree *fn_p, tsubst_flags_t complain)
7046 struct z_candidate *candidates = 0, *cand;
7047 tree explicit_targs = NULL_TREE;
7048 tree basetype = NULL_TREE;
7051 tree first_mem_arg = NULL_TREE;
7054 bool skip_first_for_error;
7055 VEC(tree,gc) *user_args;
7058 int template_only = 0;
7062 VEC(tree,gc) *orig_args = NULL;
7065 gcc_assert (instance != NULL_TREE);
7067 /* We don't know what function we're going to call, yet. */
7071 if (error_operand_p (instance)
7072 || !fns || error_operand_p (fns))
7073 return error_mark_node;
7075 if (!BASELINK_P (fns))
7077 if (complain & tf_error)
7078 error ("call to non-function %qD", fns);
7079 return error_mark_node;
7082 orig_instance = instance;
7085 /* Dismantle the baselink to collect all the information we need. */
7086 if (!conversion_path)
7087 conversion_path = BASELINK_BINFO (fns);
7088 access_binfo = BASELINK_ACCESS_BINFO (fns);
7089 optype = BASELINK_OPTYPE (fns);
7090 fns = BASELINK_FUNCTIONS (fns);
7091 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
7093 explicit_targs = TREE_OPERAND (fns, 1);
7094 fns = TREE_OPERAND (fns, 0);
7097 gcc_assert (TREE_CODE (fns) == FUNCTION_DECL
7098 || TREE_CODE (fns) == TEMPLATE_DECL
7099 || TREE_CODE (fns) == OVERLOAD);
7100 fn = get_first_fn (fns);
7101 name = DECL_NAME (fn);
7103 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (instance));
7104 gcc_assert (CLASS_TYPE_P (basetype));
7106 if (processing_template_decl)
7108 orig_args = args == NULL ? NULL : make_tree_vector_copy (*args);
7109 instance = build_non_dependent_expr (instance);
7111 make_args_non_dependent (*args);
7114 user_args = args == NULL ? NULL : *args;
7115 /* Under DR 147 A::A() is an invalid constructor call,
7116 not a functional cast. */
7117 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
7119 if (! (complain & tf_error))
7120 return error_mark_node;
7122 permerror (input_location,
7123 "cannot call constructor %<%T::%D%> directly",
7125 permerror (input_location, " for a function-style cast, remove the "
7126 "redundant %<::%D%>", name);
7127 call = build_functional_cast (basetype, build_tree_list_vec (user_args),
7132 /* Figure out whether to skip the first argument for the error
7133 message we will display to users if an error occurs. We don't
7134 want to display any compiler-generated arguments. The "this"
7135 pointer hasn't been added yet. However, we must remove the VTT
7136 pointer if this is a call to a base-class constructor or
7138 skip_first_for_error = false;
7139 if (IDENTIFIER_CTOR_OR_DTOR_P (name))
7141 /* Callers should explicitly indicate whether they want to construct
7142 the complete object or just the part without virtual bases. */
7143 gcc_assert (name != ctor_identifier);
7144 /* Similarly for destructors. */
7145 gcc_assert (name != dtor_identifier);
7146 /* Remove the VTT pointer, if present. */
7147 if ((name == base_ctor_identifier || name == base_dtor_identifier)
7148 && CLASSTYPE_VBASECLASSES (basetype))
7149 skip_first_for_error = true;
7152 /* Process the argument list. */
7153 if (args != NULL && *args != NULL)
7155 *args = resolve_args (*args, complain);
7157 return error_mark_node;
7160 instance_ptr = build_this (instance);
7162 /* It's OK to call destructors and constructors on cv-qualified objects.
7163 Therefore, convert the INSTANCE_PTR to the unqualified type, if
7165 if (DECL_DESTRUCTOR_P (fn)
7166 || DECL_CONSTRUCTOR_P (fn))
7168 tree type = build_pointer_type (basetype);
7169 if (!same_type_p (type, TREE_TYPE (instance_ptr)))
7170 instance_ptr = build_nop (type, instance_ptr);
7172 if (DECL_DESTRUCTOR_P (fn))
7173 name = complete_dtor_identifier;
7175 first_mem_arg = instance_ptr;
7177 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7178 p = conversion_obstack_alloc (0);
7180 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
7181 initializer, not T({ }). */
7182 if (DECL_CONSTRUCTOR_P (fn) && args != NULL && !VEC_empty (tree, *args)
7183 && BRACE_ENCLOSED_INITIALIZER_P (VEC_index (tree, *args, 0))
7184 && CONSTRUCTOR_IS_DIRECT_INIT (VEC_index (tree, *args, 0)))
7186 tree init_list = VEC_index (tree, *args, 0);
7188 gcc_assert (VEC_length (tree, *args) == 1
7189 && !(flags & LOOKUP_ONLYCONVERTING));
7191 /* If the initializer list has no elements and T is a class type with
7192 a default constructor, the object is value-initialized. Handle
7193 this here so we don't need to handle it wherever we use
7194 build_special_member_call. */
7195 if (CONSTRUCTOR_NELTS (init_list) == 0
7196 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype)
7197 && !processing_template_decl)
7199 tree ob, init = build_value_init (basetype, complain);
7200 if (integer_zerop (instance_ptr))
7201 return get_target_expr_sfinae (init, complain);
7202 ob = build_fold_indirect_ref (instance_ptr);
7203 init = build2 (INIT_EXPR, TREE_TYPE (ob), ob, init);
7204 TREE_SIDE_EFFECTS (init) = true;
7208 add_list_candidates (fns, first_mem_arg, init_list,
7209 basetype, explicit_targs, template_only,
7210 conversion_path, access_binfo, flags, &candidates);
7214 add_candidates (fns, first_mem_arg, user_args, optype,
7215 explicit_targs, template_only, conversion_path,
7216 access_binfo, flags, &candidates);
7218 any_viable_p = false;
7219 candidates = splice_viable (candidates, pedantic, &any_viable_p);
7223 if (complain & tf_error)
7225 if (!COMPLETE_OR_OPEN_TYPE_P (basetype))
7226 cxx_incomplete_type_error (instance_ptr, basetype);
7228 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
7229 basetype, optype, build_tree_list_vec (user_args),
7230 TREE_TYPE (TREE_TYPE (instance_ptr)));
7237 pretty_name = name_as_c_string (name, basetype, &free_p);
7238 arglist = build_tree_list_vec (user_args);
7239 if (skip_first_for_error)
7240 arglist = TREE_CHAIN (arglist);
7241 error ("no matching function for call to %<%T::%s(%A)%#V%>",
7242 basetype, pretty_name, arglist,
7243 TREE_TYPE (TREE_TYPE (instance_ptr)));
7247 print_z_candidates (location_of (name), candidates);
7249 call = error_mark_node;
7253 cand = tourney (candidates);
7260 if (complain & tf_error)
7262 pretty_name = name_as_c_string (name, basetype, &free_p);
7263 arglist = build_tree_list_vec (user_args);
7264 if (skip_first_for_error)
7265 arglist = TREE_CHAIN (arglist);
7266 error ("call of overloaded %<%s(%A)%> is ambiguous", pretty_name,
7268 print_z_candidates (location_of (name), candidates);
7272 call = error_mark_node;
7278 if (!(flags & LOOKUP_NONVIRTUAL)
7279 && DECL_PURE_VIRTUAL_P (fn)
7280 && instance == current_class_ref
7281 && (DECL_CONSTRUCTOR_P (current_function_decl)
7282 || DECL_DESTRUCTOR_P (current_function_decl))
7283 && (complain & tf_warning))
7284 /* This is not an error, it is runtime undefined
7286 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl) ?
7287 "pure virtual %q#D called from constructor"
7288 : "pure virtual %q#D called from destructor"),
7291 if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE
7292 && is_dummy_object (instance_ptr))
7294 if (complain & tf_error)
7295 error ("cannot call member function %qD without object",
7297 call = error_mark_node;
7301 /* Optimize away vtable lookup if we know that this function
7302 can't be overridden. */
7303 if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL)
7304 && (resolves_to_fixed_type_p (instance, 0)
7305 || DECL_FINAL_P (fn) || CLASSTYPE_FINAL (basetype)))
7306 flags |= LOOKUP_NONVIRTUAL;
7308 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
7309 /* Now we know what function is being called. */
7312 /* Build the actual CALL_EXPR. */
7313 call = build_over_call (cand, flags, complain);
7314 /* In an expression of the form `a->f()' where `f' turns
7315 out to be a static member function, `a' is
7316 none-the-less evaluated. */
7317 if (TREE_CODE (TREE_TYPE (fn)) != METHOD_TYPE
7318 && !is_dummy_object (instance_ptr)
7319 && TREE_SIDE_EFFECTS (instance_ptr))
7320 call = build2 (COMPOUND_EXPR, TREE_TYPE (call),
7321 instance_ptr, call);
7322 else if (call != error_mark_node
7323 && DECL_DESTRUCTOR_P (cand->fn)
7324 && !VOID_TYPE_P (TREE_TYPE (call)))
7325 /* An explicit call of the form "x->~X()" has type
7326 "void". However, on platforms where destructors
7327 return "this" (i.e., those where
7328 targetm.cxx.cdtor_returns_this is true), such calls
7329 will appear to have a return value of pointer type
7330 to the low-level call machinery. We do not want to
7331 change the low-level machinery, since we want to be
7332 able to optimize "delete f()" on such platforms as
7333 "operator delete(~X(f()))" (rather than generating
7334 "t = f(), ~X(t), operator delete (t)"). */
7335 call = build_nop (void_type_node, call);
7340 if (processing_template_decl && call != error_mark_node)
7342 bool cast_to_void = false;
7344 if (TREE_CODE (call) == COMPOUND_EXPR)
7345 call = TREE_OPERAND (call, 1);
7346 else if (TREE_CODE (call) == NOP_EXPR)
7348 cast_to_void = true;
7349 call = TREE_OPERAND (call, 0);
7351 if (TREE_CODE (call) == INDIRECT_REF)
7352 call = TREE_OPERAND (call, 0);
7353 call = (build_min_non_dep_call_vec
7355 build_min (COMPONENT_REF, TREE_TYPE (CALL_EXPR_FN (call)),
7356 orig_instance, orig_fns, NULL_TREE),
7358 call = convert_from_reference (call);
7360 call = build_nop (void_type_node, call);
7363 /* Free all the conversions we allocated. */
7364 obstack_free (&conversion_obstack, p);
7366 if (orig_args != NULL)
7367 release_tree_vector (orig_args);
7372 /* Wrapper for above. */
7375 build_new_method_call (tree instance, tree fns, VEC(tree,gc) **args,
7376 tree conversion_path, int flags,
7377 tree *fn_p, tsubst_flags_t complain)
7380 bool subtime = timevar_cond_start (TV_OVERLOAD);
7381 ret = build_new_method_call_1 (instance, fns, args, conversion_path, flags,
7383 timevar_cond_stop (TV_OVERLOAD, subtime);
7387 /* Returns true iff standard conversion sequence ICS1 is a proper
7388 subsequence of ICS2. */
7391 is_subseq (conversion *ics1, conversion *ics2)
7393 /* We can assume that a conversion of the same code
7394 between the same types indicates a subsequence since we only get
7395 here if the types we are converting from are the same. */
7397 while (ics1->kind == ck_rvalue
7398 || ics1->kind == ck_lvalue)
7399 ics1 = ics1->u.next;
7403 while (ics2->kind == ck_rvalue
7404 || ics2->kind == ck_lvalue)
7405 ics2 = ics2->u.next;
7407 if (ics2->kind == ck_user
7408 || ics2->kind == ck_ambig
7409 || ics2->kind == ck_aggr
7410 || ics2->kind == ck_list
7411 || ics2->kind == ck_identity)
7412 /* At this point, ICS1 cannot be a proper subsequence of
7413 ICS2. We can get a USER_CONV when we are comparing the
7414 second standard conversion sequence of two user conversion
7418 ics2 = ics2->u.next;
7420 if (ics2->kind == ics1->kind
7421 && same_type_p (ics2->type, ics1->type)
7422 && same_type_p (ics2->u.next->type,
7423 ics1->u.next->type))
7428 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
7429 be any _TYPE nodes. */
7432 is_properly_derived_from (tree derived, tree base)
7434 if (!CLASS_TYPE_P (derived) || !CLASS_TYPE_P (base))
7437 /* We only allow proper derivation here. The DERIVED_FROM_P macro
7438 considers every class derived from itself. */
7439 return (!same_type_ignoring_top_level_qualifiers_p (derived, base)
7440 && DERIVED_FROM_P (base, derived));
7443 /* We build the ICS for an implicit object parameter as a pointer
7444 conversion sequence. However, such a sequence should be compared
7445 as if it were a reference conversion sequence. If ICS is the
7446 implicit conversion sequence for an implicit object parameter,
7447 modify it accordingly. */
7450 maybe_handle_implicit_object (conversion **ics)
7454 /* [over.match.funcs]
7456 For non-static member functions, the type of the
7457 implicit object parameter is "reference to cv X"
7458 where X is the class of which the function is a
7459 member and cv is the cv-qualification on the member
7460 function declaration. */
7461 conversion *t = *ics;
7462 tree reference_type;
7464 /* The `this' parameter is a pointer to a class type. Make the
7465 implicit conversion talk about a reference to that same class
7467 reference_type = TREE_TYPE (t->type);
7468 reference_type = build_reference_type (reference_type);
7470 if (t->kind == ck_qual)
7472 if (t->kind == ck_ptr)
7474 t = build_identity_conv (TREE_TYPE (t->type), NULL_TREE);
7475 t = direct_reference_binding (reference_type, t);
7477 t->rvaluedness_matches_p = 0;
7482 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
7483 and return the initial reference binding conversion. Otherwise,
7484 leave *ICS unchanged and return NULL. */
7487 maybe_handle_ref_bind (conversion **ics)
7489 if ((*ics)->kind == ck_ref_bind)
7491 conversion *old_ics = *ics;
7492 *ics = old_ics->u.next;
7493 (*ics)->user_conv_p = old_ics->user_conv_p;
7500 /* Compare two implicit conversion sequences according to the rules set out in
7501 [over.ics.rank]. Return values:
7503 1: ics1 is better than ics2
7504 -1: ics2 is better than ics1
7505 0: ics1 and ics2 are indistinguishable */
7508 compare_ics (conversion *ics1, conversion *ics2)
7514 tree deref_from_type1 = NULL_TREE;
7515 tree deref_from_type2 = NULL_TREE;
7516 tree deref_to_type1 = NULL_TREE;
7517 tree deref_to_type2 = NULL_TREE;
7518 conversion_rank rank1, rank2;
7520 /* REF_BINDING is nonzero if the result of the conversion sequence
7521 is a reference type. In that case REF_CONV is the reference
7522 binding conversion. */
7523 conversion *ref_conv1;
7524 conversion *ref_conv2;
7526 /* Handle implicit object parameters. */
7527 maybe_handle_implicit_object (&ics1);
7528 maybe_handle_implicit_object (&ics2);
7530 /* Handle reference parameters. */
7531 ref_conv1 = maybe_handle_ref_bind (&ics1);
7532 ref_conv2 = maybe_handle_ref_bind (&ics2);
7534 /* List-initialization sequence L1 is a better conversion sequence than
7535 list-initialization sequence L2 if L1 converts to
7536 std::initializer_list<X> for some X and L2 does not. */
7537 if (ics1->kind == ck_list && ics2->kind != ck_list)
7539 if (ics2->kind == ck_list && ics1->kind != ck_list)
7544 When comparing the basic forms of implicit conversion sequences (as
7545 defined in _over.best.ics_)
7547 --a standard conversion sequence (_over.ics.scs_) is a better
7548 conversion sequence than a user-defined conversion sequence
7549 or an ellipsis conversion sequence, and
7551 --a user-defined conversion sequence (_over.ics.user_) is a
7552 better conversion sequence than an ellipsis conversion sequence
7553 (_over.ics.ellipsis_). */
7554 rank1 = CONVERSION_RANK (ics1);
7555 rank2 = CONVERSION_RANK (ics2);
7559 else if (rank1 < rank2)
7562 if (rank1 == cr_bad)
7564 /* Both ICS are bad. We try to make a decision based on what would
7565 have happened if they'd been good. This is not an extension,
7566 we'll still give an error when we build up the call; this just
7567 helps us give a more helpful error message. */
7568 rank1 = BAD_CONVERSION_RANK (ics1);
7569 rank2 = BAD_CONVERSION_RANK (ics2);
7573 else if (rank1 < rank2)
7576 /* We couldn't make up our minds; try to figure it out below. */
7579 if (ics1->ellipsis_p)
7580 /* Both conversions are ellipsis conversions. */
7583 /* User-defined conversion sequence U1 is a better conversion sequence
7584 than another user-defined conversion sequence U2 if they contain the
7585 same user-defined conversion operator or constructor and if the sec-
7586 ond standard conversion sequence of U1 is better than the second
7587 standard conversion sequence of U2. */
7589 /* Handle list-conversion with the same code even though it isn't always
7590 ranked as a user-defined conversion and it doesn't have a second
7591 standard conversion sequence; it will still have the desired effect.
7592 Specifically, we need to do the reference binding comparison at the
7593 end of this function. */
7595 if (ics1->user_conv_p || ics1->kind == ck_list)
7600 for (t1 = ics1; t1->kind != ck_user; t1 = t1->u.next)
7601 if (t1->kind == ck_ambig || t1->kind == ck_aggr
7602 || t1->kind == ck_list)
7604 for (t2 = ics2; t2->kind != ck_user; t2 = t2->u.next)
7605 if (t2->kind == ck_ambig || t2->kind == ck_aggr
7606 || t2->kind == ck_list)
7609 if (t1->kind != t2->kind)
7611 else if (t1->kind == ck_user)
7613 if (t1->cand->fn != t2->cand->fn)
7618 /* For ambiguous or aggregate conversions, use the target type as
7619 a proxy for the conversion function. */
7620 if (!same_type_ignoring_top_level_qualifiers_p (t1->type, t2->type))
7624 /* We can just fall through here, after setting up
7625 FROM_TYPE1 and FROM_TYPE2. */
7626 from_type1 = t1->type;
7627 from_type2 = t2->type;
7634 /* We're dealing with two standard conversion sequences.
7638 Standard conversion sequence S1 is a better conversion
7639 sequence than standard conversion sequence S2 if
7641 --S1 is a proper subsequence of S2 (comparing the conversion
7642 sequences in the canonical form defined by _over.ics.scs_,
7643 excluding any Lvalue Transformation; the identity
7644 conversion sequence is considered to be a subsequence of
7645 any non-identity conversion sequence */
7648 while (t1->kind != ck_identity)
7650 from_type1 = t1->type;
7653 while (t2->kind != ck_identity)
7655 from_type2 = t2->type;
7658 /* One sequence can only be a subsequence of the other if they start with
7659 the same type. They can start with different types when comparing the
7660 second standard conversion sequence in two user-defined conversion
7662 if (same_type_p (from_type1, from_type2))
7664 if (is_subseq (ics1, ics2))
7666 if (is_subseq (ics2, ics1))
7674 --the rank of S1 is better than the rank of S2 (by the rules
7677 Standard conversion sequences are ordered by their ranks: an Exact
7678 Match is a better conversion than a Promotion, which is a better
7679 conversion than a Conversion.
7681 Two conversion sequences with the same rank are indistinguishable
7682 unless one of the following rules applies:
7684 --A conversion that does not a convert a pointer, pointer to member,
7685 or std::nullptr_t to bool is better than one that does.
7687 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
7688 so that we do not have to check it explicitly. */
7689 if (ics1->rank < ics2->rank)
7691 else if (ics2->rank < ics1->rank)
7694 to_type1 = ics1->type;
7695 to_type2 = ics2->type;
7697 /* A conversion from scalar arithmetic type to complex is worse than a
7698 conversion between scalar arithmetic types. */
7699 if (same_type_p (from_type1, from_type2)
7700 && ARITHMETIC_TYPE_P (from_type1)
7701 && ARITHMETIC_TYPE_P (to_type1)
7702 && ARITHMETIC_TYPE_P (to_type2)
7703 && ((TREE_CODE (to_type1) == COMPLEX_TYPE)
7704 != (TREE_CODE (to_type2) == COMPLEX_TYPE)))
7706 if (TREE_CODE (to_type1) == COMPLEX_TYPE)
7712 if (TYPE_PTR_P (from_type1)
7713 && TYPE_PTR_P (from_type2)
7714 && TYPE_PTR_P (to_type1)
7715 && TYPE_PTR_P (to_type2))
7717 deref_from_type1 = TREE_TYPE (from_type1);
7718 deref_from_type2 = TREE_TYPE (from_type2);
7719 deref_to_type1 = TREE_TYPE (to_type1);
7720 deref_to_type2 = TREE_TYPE (to_type2);
7722 /* The rules for pointers to members A::* are just like the rules
7723 for pointers A*, except opposite: if B is derived from A then
7724 A::* converts to B::*, not vice versa. For that reason, we
7725 switch the from_ and to_ variables here. */
7726 else if ((TYPE_PTRMEM_P (from_type1) && TYPE_PTRMEM_P (from_type2)
7727 && TYPE_PTRMEM_P (to_type1) && TYPE_PTRMEM_P (to_type2))
7728 || (TYPE_PTRMEMFUNC_P (from_type1)
7729 && TYPE_PTRMEMFUNC_P (from_type2)
7730 && TYPE_PTRMEMFUNC_P (to_type1)
7731 && TYPE_PTRMEMFUNC_P (to_type2)))
7733 deref_to_type1 = TYPE_PTRMEM_CLASS_TYPE (from_type1);
7734 deref_to_type2 = TYPE_PTRMEM_CLASS_TYPE (from_type2);
7735 deref_from_type1 = TYPE_PTRMEM_CLASS_TYPE (to_type1);
7736 deref_from_type2 = TYPE_PTRMEM_CLASS_TYPE (to_type2);
7739 if (deref_from_type1 != NULL_TREE
7740 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1))
7741 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2)))
7743 /* This was one of the pointer or pointer-like conversions.
7747 --If class B is derived directly or indirectly from class A,
7748 conversion of B* to A* is better than conversion of B* to
7749 void*, and conversion of A* to void* is better than
7750 conversion of B* to void*. */
7751 if (TREE_CODE (deref_to_type1) == VOID_TYPE
7752 && TREE_CODE (deref_to_type2) == VOID_TYPE)
7754 if (is_properly_derived_from (deref_from_type1,
7757 else if (is_properly_derived_from (deref_from_type2,
7761 else if (TREE_CODE (deref_to_type1) == VOID_TYPE
7762 || TREE_CODE (deref_to_type2) == VOID_TYPE)
7764 if (same_type_p (deref_from_type1, deref_from_type2))
7766 if (TREE_CODE (deref_to_type2) == VOID_TYPE)
7768 if (is_properly_derived_from (deref_from_type1,
7772 /* We know that DEREF_TO_TYPE1 is `void' here. */
7773 else if (is_properly_derived_from (deref_from_type1,
7778 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1))
7779 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2)))
7783 --If class B is derived directly or indirectly from class A
7784 and class C is derived directly or indirectly from B,
7786 --conversion of C* to B* is better than conversion of C* to
7789 --conversion of B* to A* is better than conversion of C* to
7791 if (same_type_p (deref_from_type1, deref_from_type2))
7793 if (is_properly_derived_from (deref_to_type1,
7796 else if (is_properly_derived_from (deref_to_type2,
7800 else if (same_type_p (deref_to_type1, deref_to_type2))
7802 if (is_properly_derived_from (deref_from_type2,
7805 else if (is_properly_derived_from (deref_from_type1,
7811 else if (CLASS_TYPE_P (non_reference (from_type1))
7812 && same_type_p (from_type1, from_type2))
7814 tree from = non_reference (from_type1);
7818 --binding of an expression of type C to a reference of type
7819 B& is better than binding an expression of type C to a
7820 reference of type A&
7822 --conversion of C to B is better than conversion of C to A, */
7823 if (is_properly_derived_from (from, to_type1)
7824 && is_properly_derived_from (from, to_type2))
7826 if (is_properly_derived_from (to_type1, to_type2))
7828 else if (is_properly_derived_from (to_type2, to_type1))
7832 else if (CLASS_TYPE_P (non_reference (to_type1))
7833 && same_type_p (to_type1, to_type2))
7835 tree to = non_reference (to_type1);
7839 --binding of an expression of type B to a reference of type
7840 A& is better than binding an expression of type C to a
7841 reference of type A&,
7843 --conversion of B to A is better than conversion of C to A */
7844 if (is_properly_derived_from (from_type1, to)
7845 && is_properly_derived_from (from_type2, to))
7847 if (is_properly_derived_from (from_type2, from_type1))
7849 else if (is_properly_derived_from (from_type1, from_type2))
7856 --S1 and S2 differ only in their qualification conversion and yield
7857 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
7858 qualification signature of type T1 is a proper subset of the cv-
7859 qualification signature of type T2 */
7860 if (ics1->kind == ck_qual
7861 && ics2->kind == ck_qual
7862 && same_type_p (from_type1, from_type2))
7864 int result = comp_cv_qual_signature (to_type1, to_type2);
7871 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
7872 to an implicit object parameter, and either S1 binds an lvalue reference
7873 to an lvalue and S2 binds an rvalue reference or S1 binds an rvalue
7874 reference to an rvalue and S2 binds an lvalue reference
7875 (C++0x draft standard, 13.3.3.2)
7877 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
7878 types to which the references refer are the same type except for
7879 top-level cv-qualifiers, and the type to which the reference
7880 initialized by S2 refers is more cv-qualified than the type to
7881 which the reference initialized by S1 refers.
7883 DR 1328 [over.match.best]: the context is an initialization by
7884 conversion function for direct reference binding (13.3.1.6) of a
7885 reference to function type, the return type of F1 is the same kind of
7886 reference (i.e. lvalue or rvalue) as the reference being initialized,
7887 and the return type of F2 is not. */
7889 if (ref_conv1 && ref_conv2)
7891 if (!ref_conv1->this_p && !ref_conv2->this_p
7892 && (ref_conv1->rvaluedness_matches_p
7893 != ref_conv2->rvaluedness_matches_p)
7894 && (same_type_p (ref_conv1->type, ref_conv2->type)
7895 || (TYPE_REF_IS_RVALUE (ref_conv1->type)
7896 != TYPE_REF_IS_RVALUE (ref_conv2->type))))
7898 return (ref_conv1->rvaluedness_matches_p
7899 - ref_conv2->rvaluedness_matches_p);
7902 if (same_type_ignoring_top_level_qualifiers_p (to_type1, to_type2))
7903 return comp_cv_qualification (TREE_TYPE (ref_conv2->type),
7904 TREE_TYPE (ref_conv1->type));
7907 /* Neither conversion sequence is better than the other. */
7911 /* The source type for this standard conversion sequence. */
7914 source_type (conversion *t)
7916 for (;; t = t->u.next)
7918 if (t->kind == ck_user
7919 || t->kind == ck_ambig
7920 || t->kind == ck_identity)
7926 /* Note a warning about preferring WINNER to LOSER. We do this by storing
7927 a pointer to LOSER and re-running joust to produce the warning if WINNER
7928 is actually used. */
7931 add_warning (struct z_candidate *winner, struct z_candidate *loser)
7933 candidate_warning *cw = (candidate_warning *)
7934 conversion_obstack_alloc (sizeof (candidate_warning));
7936 cw->next = winner->warnings;
7937 winner->warnings = cw;
7940 /* Compare two candidates for overloading as described in
7941 [over.match.best]. Return values:
7943 1: cand1 is better than cand2
7944 -1: cand2 is better than cand1
7945 0: cand1 and cand2 are indistinguishable */
7948 joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn)
7951 int off1 = 0, off2 = 0;
7955 /* Candidates that involve bad conversions are always worse than those
7957 if (cand1->viable > cand2->viable)
7959 if (cand1->viable < cand2->viable)
7962 /* If we have two pseudo-candidates for conversions to the same type,
7963 or two candidates for the same function, arbitrarily pick one. */
7964 if (cand1->fn == cand2->fn
7965 && (IS_TYPE_OR_DECL_P (cand1->fn)))
7968 /* a viable function F1
7969 is defined to be a better function than another viable function F2 if
7970 for all arguments i, ICSi(F1) is not a worse conversion sequence than
7971 ICSi(F2), and then */
7973 /* for some argument j, ICSj(F1) is a better conversion sequence than
7976 /* For comparing static and non-static member functions, we ignore
7977 the implicit object parameter of the non-static function. The
7978 standard says to pretend that the static function has an object
7979 parm, but that won't work with operator overloading. */
7980 len = cand1->num_convs;
7981 if (len != cand2->num_convs)
7983 int static_1 = DECL_STATIC_FUNCTION_P (cand1->fn);
7984 int static_2 = DECL_STATIC_FUNCTION_P (cand2->fn);
7986 gcc_assert (static_1 != static_2);
7997 for (i = 0; i < len; ++i)
7999 conversion *t1 = cand1->convs[i + off1];
8000 conversion *t2 = cand2->convs[i + off2];
8001 int comp = compare_ics (t1, t2);
8006 && (CONVERSION_RANK (t1) + CONVERSION_RANK (t2)
8007 == cr_std + cr_promotion)
8008 && t1->kind == ck_std
8009 && t2->kind == ck_std
8010 && TREE_CODE (t1->type) == INTEGER_TYPE
8011 && TREE_CODE (t2->type) == INTEGER_TYPE
8012 && (TYPE_PRECISION (t1->type)
8013 == TYPE_PRECISION (t2->type))
8014 && (TYPE_UNSIGNED (t1->u.next->type)
8015 || (TREE_CODE (t1->u.next->type)
8018 tree type = t1->u.next->type;
8020 struct z_candidate *w, *l;
8022 type1 = t1->type, type2 = t2->type,
8023 w = cand1, l = cand2;
8025 type1 = t2->type, type2 = t1->type,
8026 w = cand2, l = cand1;
8030 warning (OPT_Wsign_promo, "passing %qT chooses %qT over %qT",
8031 type, type1, type2);
8032 warning (OPT_Wsign_promo, " in call to %qD", w->fn);
8038 if (winner && comp != winner)
8047 /* warn about confusing overload resolution for user-defined conversions,
8048 either between a constructor and a conversion op, or between two
8050 if (winner && warn_conversion && cand1->second_conv
8051 && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn))
8052 && winner != compare_ics (cand1->second_conv, cand2->second_conv))
8054 struct z_candidate *w, *l;
8055 bool give_warning = false;
8058 w = cand1, l = cand2;
8060 w = cand2, l = cand1;
8062 /* We don't want to complain about `X::operator T1 ()'
8063 beating `X::operator T2 () const', when T2 is a no less
8064 cv-qualified version of T1. */
8065 if (DECL_CONTEXT (w->fn) == DECL_CONTEXT (l->fn)
8066 && !DECL_CONSTRUCTOR_P (w->fn) && !DECL_CONSTRUCTOR_P (l->fn))
8068 tree t = TREE_TYPE (TREE_TYPE (l->fn));
8069 tree f = TREE_TYPE (TREE_TYPE (w->fn));
8071 if (TREE_CODE (t) == TREE_CODE (f) && POINTER_TYPE_P (t))
8076 if (!comp_ptr_ttypes (t, f))
8077 give_warning = true;
8080 give_warning = true;
8086 tree source = source_type (w->convs[0]);
8087 if (! DECL_CONSTRUCTOR_P (w->fn))
8088 source = TREE_TYPE (source);
8089 if (warning (OPT_Wconversion, "choosing %qD over %qD", w->fn, l->fn)
8090 && warning (OPT_Wconversion, " for conversion from %qT to %qT",
8091 source, w->second_conv->type))
8093 inform (input_location, " because conversion sequence for the argument is better");
8104 F1 is a non-template function and F2 is a template function
8107 if (!cand1->template_decl && cand2->template_decl)
8109 else if (cand1->template_decl && !cand2->template_decl)
8113 F1 and F2 are template functions and the function template for F1 is
8114 more specialized than the template for F2 according to the partial
8117 if (cand1->template_decl && cand2->template_decl)
8119 winner = more_specialized_fn
8120 (TI_TEMPLATE (cand1->template_decl),
8121 TI_TEMPLATE (cand2->template_decl),
8122 /* [temp.func.order]: The presence of unused ellipsis and default
8123 arguments has no effect on the partial ordering of function
8124 templates. add_function_candidate() will not have
8125 counted the "this" argument for constructors. */
8126 cand1->num_convs + DECL_CONSTRUCTOR_P (cand1->fn));
8132 the context is an initialization by user-defined conversion (see
8133 _dcl.init_ and _over.match.user_) and the standard conversion
8134 sequence from the return type of F1 to the destination type (i.e.,
8135 the type of the entity being initialized) is a better conversion
8136 sequence than the standard conversion sequence from the return type
8137 of F2 to the destination type. */
8139 if (cand1->second_conv)
8141 winner = compare_ics (cand1->second_conv, cand2->second_conv);
8146 /* Check whether we can discard a builtin candidate, either because we
8147 have two identical ones or matching builtin and non-builtin candidates.
8149 (Pedantically in the latter case the builtin which matched the user
8150 function should not be added to the overload set, but we spot it here.
8153 ... the builtin candidates include ...
8154 - do not have the same parameter type list as any non-template
8155 non-member candidate. */
8157 if (TREE_CODE (cand1->fn) == IDENTIFIER_NODE
8158 || TREE_CODE (cand2->fn) == IDENTIFIER_NODE)
8160 for (i = 0; i < len; ++i)
8161 if (!same_type_p (cand1->convs[i]->type,
8162 cand2->convs[i]->type))
8164 if (i == cand1->num_convs)
8166 if (cand1->fn == cand2->fn)
8167 /* Two built-in candidates; arbitrarily pick one. */
8169 else if (TREE_CODE (cand1->fn) == IDENTIFIER_NODE)
8170 /* cand1 is built-in; prefer cand2. */
8173 /* cand2 is built-in; prefer cand1. */
8178 /* If the two function declarations represent the same function (this can
8179 happen with declarations in multiple scopes and arg-dependent lookup),
8180 arbitrarily choose one. But first make sure the default args we're
8182 if (DECL_P (cand1->fn) && DECL_P (cand2->fn)
8183 && equal_functions (cand1->fn, cand2->fn))
8185 tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (cand1->fn));
8186 tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (cand2->fn));
8188 gcc_assert (!DECL_CONSTRUCTOR_P (cand1->fn));
8190 for (i = 0; i < len; ++i)
8192 /* Don't crash if the fn is variadic. */
8195 parms1 = TREE_CHAIN (parms1);
8196 parms2 = TREE_CHAIN (parms2);
8200 parms1 = TREE_CHAIN (parms1);
8202 parms2 = TREE_CHAIN (parms2);
8206 if (!cp_tree_equal (TREE_PURPOSE (parms1),
8207 TREE_PURPOSE (parms2)))
8211 permerror (input_location, "default argument mismatch in "
8212 "overload resolution");
8213 inform (input_location,
8214 " candidate 1: %q+#F", cand1->fn);
8215 inform (input_location,
8216 " candidate 2: %q+#F", cand2->fn);
8219 add_warning (cand1, cand2);
8222 parms1 = TREE_CHAIN (parms1);
8223 parms2 = TREE_CHAIN (parms2);
8231 /* Extension: If the worst conversion for one candidate is worse than the
8232 worst conversion for the other, take the first. */
8235 conversion_rank rank1 = cr_identity, rank2 = cr_identity;
8236 struct z_candidate *w = 0, *l = 0;
8238 for (i = 0; i < len; ++i)
8240 if (CONVERSION_RANK (cand1->convs[i+off1]) > rank1)
8241 rank1 = CONVERSION_RANK (cand1->convs[i+off1]);
8242 if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2)
8243 rank2 = CONVERSION_RANK (cand2->convs[i + off2]);
8246 winner = 1, w = cand1, l = cand2;
8248 winner = -1, w = cand2, l = cand1;
8251 /* Don't choose a deleted function over ambiguity. */
8252 if (DECL_P (w->fn) && DECL_DELETED_FN (w->fn))
8256 pedwarn (input_location, 0,
8257 "ISO C++ says that these are ambiguous, even "
8258 "though the worst conversion for the first is better than "
8259 "the worst conversion for the second:");
8260 print_z_candidate (_("candidate 1:"), w);
8261 print_z_candidate (_("candidate 2:"), l);
8269 gcc_assert (!winner);
8273 /* Given a list of candidates for overloading, find the best one, if any.
8274 This algorithm has a worst case of O(2n) (winner is last), and a best
8275 case of O(n/2) (totally ambiguous); much better than a sorting
8278 static struct z_candidate *
8279 tourney (struct z_candidate *candidates)
8281 struct z_candidate *champ = candidates, *challenger;
8283 int champ_compared_to_predecessor = 0;
8285 /* Walk through the list once, comparing each current champ to the next
8286 candidate, knocking out a candidate or two with each comparison. */
8288 for (challenger = champ->next; challenger; )
8290 fate = joust (champ, challenger, 0);
8292 challenger = challenger->next;
8297 champ = challenger->next;
8300 champ_compared_to_predecessor = 0;
8305 champ_compared_to_predecessor = 1;
8308 challenger = champ->next;
8312 /* Make sure the champ is better than all the candidates it hasn't yet
8313 been compared to. */
8315 for (challenger = candidates;
8317 && !(champ_compared_to_predecessor && challenger->next == champ);
8318 challenger = challenger->next)
8320 fate = joust (champ, challenger, 0);
8328 /* Returns nonzero if things of type FROM can be converted to TO. */
8331 can_convert (tree to, tree from)
8333 return can_convert_arg (to, from, NULL_TREE, LOOKUP_IMPLICIT);
8336 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
8339 can_convert_arg (tree to, tree from, tree arg, int flags)
8345 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8346 p = conversion_obstack_alloc (0);
8348 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
8350 ok_p = (t && !t->bad_p);
8352 /* Free all the conversions we allocated. */
8353 obstack_free (&conversion_obstack, p);
8358 /* Like can_convert_arg, but allows dubious conversions as well. */
8361 can_convert_arg_bad (tree to, tree from, tree arg, int flags)
8366 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8367 p = conversion_obstack_alloc (0);
8368 /* Try to perform the conversion. */
8369 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
8371 /* Free all the conversions we allocated. */
8372 obstack_free (&conversion_obstack, p);
8377 /* Convert EXPR to TYPE. Return the converted expression.
8379 Note that we allow bad conversions here because by the time we get to
8380 this point we are committed to doing the conversion. If we end up
8381 doing a bad conversion, convert_like will complain. */
8384 perform_implicit_conversion_flags (tree type, tree expr, tsubst_flags_t complain, int flags)
8389 if (error_operand_p (expr))
8390 return error_mark_node;
8392 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8393 p = conversion_obstack_alloc (0);
8395 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
8401 if (complain & tf_error)
8403 /* If expr has unknown type, then it is an overloaded function.
8404 Call instantiate_type to get good error messages. */
8405 if (TREE_TYPE (expr) == unknown_type_node)
8406 instantiate_type (type, expr, complain);
8407 else if (invalid_nonstatic_memfn_p (expr, complain))
8408 /* We gave an error. */;
8410 error ("could not convert %qE from %qT to %qT", expr,
8411 TREE_TYPE (expr), type);
8413 expr = error_mark_node;
8415 else if (processing_template_decl
8416 /* As a kludge, we always perform conversions between scalar
8417 types, as IMPLICIT_CONV_EXPR confuses c_finish_omp_for. */
8418 && !(SCALAR_TYPE_P (type) && SCALAR_TYPE_P (TREE_TYPE (expr))))
8420 /* In a template, we are only concerned about determining the
8421 type of non-dependent expressions, so we do not have to
8422 perform the actual conversion. But for initializers, we
8423 need to be able to perform it at instantiation
8424 (or fold_non_dependent_expr) time. */
8425 expr = build1 (IMPLICIT_CONV_EXPR, type, expr);
8426 if (!(flags & LOOKUP_ONLYCONVERTING))
8427 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true;
8430 expr = convert_like (conv, expr, complain);
8432 /* Free all the conversions we allocated. */
8433 obstack_free (&conversion_obstack, p);
8439 perform_implicit_conversion (tree type, tree expr, tsubst_flags_t complain)
8441 return perform_implicit_conversion_flags (type, expr, complain, LOOKUP_IMPLICIT);
8444 /* Convert EXPR to TYPE (as a direct-initialization) if that is
8445 permitted. If the conversion is valid, the converted expression is
8446 returned. Otherwise, NULL_TREE is returned, except in the case
8447 that TYPE is a class type; in that case, an error is issued. If
8448 C_CAST_P is true, then this direct-initialization is taking
8449 place as part of a static_cast being attempted as part of a C-style
8453 perform_direct_initialization_if_possible (tree type,
8456 tsubst_flags_t complain)
8461 if (type == error_mark_node || error_operand_p (expr))
8462 return error_mark_node;
8465 If the destination type is a (possibly cv-qualified) class type:
8467 -- If the initialization is direct-initialization ...,
8468 constructors are considered. ... If no constructor applies, or
8469 the overload resolution is ambiguous, the initialization is
8471 if (CLASS_TYPE_P (type))
8473 VEC(tree,gc) *args = make_tree_vector_single (expr);
8474 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
8475 &args, type, LOOKUP_NORMAL, complain);
8476 release_tree_vector (args);
8477 return build_cplus_new (type, expr, complain);
8480 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8481 p = conversion_obstack_alloc (0);
8483 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
8486 if (!conv || conv->bad_p)
8489 expr = convert_like_real (conv, expr, NULL_TREE, 0, 0,
8490 /*issue_conversion_warnings=*/false,
8494 /* Free all the conversions we allocated. */
8495 obstack_free (&conversion_obstack, p);
8500 /* DECL is a VAR_DECL whose type is a REFERENCE_TYPE. The reference
8501 is being bound to a temporary. Create and return a new VAR_DECL
8502 with the indicated TYPE; this variable will store the value to
8503 which the reference is bound. */
8506 make_temporary_var_for_ref_to_temp (tree decl, tree type)
8510 /* Create the variable. */
8511 var = create_temporary_var (type);
8513 /* Register the variable. */
8514 if (TREE_STATIC (decl))
8516 /* Namespace-scope or local static; give it a mangled name. */
8519 TREE_STATIC (var) = 1;
8520 name = mangle_ref_init_variable (decl);
8521 DECL_NAME (var) = name;
8522 SET_DECL_ASSEMBLER_NAME (var, name);
8523 var = pushdecl_top_level (var);
8526 /* Create a new cleanup level if necessary. */
8527 maybe_push_cleanup_level (type);
8532 /* EXPR is the initializer for a variable DECL of reference or
8533 std::initializer_list type. Create, push and return a new VAR_DECL
8534 for the initializer so that it will live as long as DECL. Any
8535 cleanup for the new variable is returned through CLEANUP, and the
8536 code to initialize the new variable is returned through INITP. */
8539 set_up_extended_ref_temp (tree decl, tree expr, tree *cleanup, tree *initp)
8545 /* Create the temporary variable. */
8546 type = TREE_TYPE (expr);
8547 var = make_temporary_var_for_ref_to_temp (decl, type);
8548 layout_decl (var, 0);
8549 /* If the rvalue is the result of a function call it will be
8550 a TARGET_EXPR. If it is some other construct (such as a
8551 member access expression where the underlying object is
8552 itself the result of a function call), turn it into a
8553 TARGET_EXPR here. It is important that EXPR be a
8554 TARGET_EXPR below since otherwise the INIT_EXPR will
8555 attempt to make a bitwise copy of EXPR to initialize
8557 if (TREE_CODE (expr) != TARGET_EXPR)
8558 expr = get_target_expr (expr);
8560 /* If the initializer is constant, put it in DECL_INITIAL so we get
8561 static initialization and use in constant expressions. */
8562 init = maybe_constant_init (expr);
8563 if (TREE_CONSTANT (init))
8565 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
8567 /* 5.19 says that a constant expression can include an
8568 lvalue-rvalue conversion applied to "a glvalue of literal type
8569 that refers to a non-volatile temporary object initialized
8570 with a constant expression". Rather than try to communicate
8571 that this VAR_DECL is a temporary, just mark it constexpr.
8573 Currently this is only useful for initializer_list temporaries,
8574 since reference vars can't appear in constant expressions. */
8575 DECL_DECLARED_CONSTEXPR_P (var) = true;
8576 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var) = true;
8577 TREE_CONSTANT (var) = true;
8579 DECL_INITIAL (var) = init;
8583 /* Create the INIT_EXPR that will initialize the temporary
8585 init = build2 (INIT_EXPR, type, var, expr);
8586 if (at_function_scope_p ())
8588 add_decl_expr (var);
8590 if (TREE_STATIC (var))
8591 init = add_stmt_to_compound (init, register_dtor_fn (var));
8593 *cleanup = cxx_maybe_build_cleanup (var, tf_warning_or_error);
8595 /* We must be careful to destroy the temporary only
8596 after its initialization has taken place. If the
8597 initialization throws an exception, then the
8598 destructor should not be run. We cannot simply
8599 transform INIT into something like:
8601 (INIT, ({ CLEANUP_STMT; }))
8603 because emit_local_var always treats the
8604 initializer as a full-expression. Thus, the
8605 destructor would run too early; it would run at the
8606 end of initializing the reference variable, rather
8607 than at the end of the block enclosing the
8610 The solution is to pass back a cleanup expression
8611 which the caller is responsible for attaching to
8612 the statement tree. */
8616 rest_of_decl_compilation (var, /*toplev=*/1, at_eof);
8617 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
8618 static_aggregates = tree_cons (NULL_TREE, var,
8626 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
8627 initializing a variable of that TYPE. If DECL is non-NULL, it is
8628 the VAR_DECL being initialized with the EXPR. (In that case, the
8629 type of DECL will be TYPE.) If DECL is non-NULL, then CLEANUP must
8630 also be non-NULL, and with *CLEANUP initialized to NULL. Upon
8631 return, if *CLEANUP is no longer NULL, it will be an expression
8632 that should be pushed as a cleanup after the returned expression
8633 is used to initialize DECL.
8635 Return the converted expression. */
8638 initialize_reference (tree type, tree expr, tree decl, tree *cleanup,
8639 int flags, tsubst_flags_t complain)
8644 if (type == error_mark_node || error_operand_p (expr))
8645 return error_mark_node;
8647 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8648 p = conversion_obstack_alloc (0);
8650 conv = reference_binding (type, TREE_TYPE (expr), expr, /*c_cast_p=*/false,
8652 if (!conv || conv->bad_p)
8654 if (complain & tf_error)
8657 convert_like (conv, expr, complain);
8658 else if (!CP_TYPE_CONST_P (TREE_TYPE (type))
8659 && !TYPE_REF_IS_RVALUE (type)
8660 && !real_lvalue_p (expr))
8661 error ("invalid initialization of non-const reference of "
8662 "type %qT from an rvalue of type %qT",
8663 type, TREE_TYPE (expr));
8665 error ("invalid initialization of reference of type "
8666 "%qT from expression of type %qT", type,
8669 return error_mark_node;
8672 /* If DECL is non-NULL, then this special rule applies:
8676 The temporary to which the reference is bound or the temporary
8677 that is the complete object to which the reference is bound
8678 persists for the lifetime of the reference.
8680 The temporaries created during the evaluation of the expression
8681 initializing the reference, except the temporary to which the
8682 reference is bound, are destroyed at the end of the
8683 full-expression in which they are created.
8685 In that case, we store the converted expression into a new
8686 VAR_DECL in a new scope.
8688 However, we want to be careful not to create temporaries when
8689 they are not required. For example, given:
8692 struct D : public B {};
8696 there is no need to copy the return value from "f"; we can just
8697 extend its lifetime. Similarly, given:
8700 struct T { operator S(); };
8704 we can extend the lifetime of the return value of the conversion
8706 gcc_assert (conv->kind == ck_ref_bind);
8710 tree base_conv_type;
8712 gcc_assert (complain == tf_warning_or_error);
8714 /* Skip over the REF_BIND. */
8715 conv = conv->u.next;
8716 /* If the next conversion is a BASE_CONV, skip that too -- but
8717 remember that the conversion was required. */
8718 if (conv->kind == ck_base)
8720 base_conv_type = conv->type;
8721 conv = conv->u.next;
8724 base_conv_type = NULL_TREE;
8725 /* Perform the remainder of the conversion. */
8726 expr = convert_like_real (conv, expr,
8727 /*fn=*/NULL_TREE, /*argnum=*/0,
8729 /*issue_conversion_warnings=*/true,
8732 if (error_operand_p (expr))
8733 expr = error_mark_node;
8736 if (!lvalue_or_rvalue_with_address_p (expr))
8739 var = set_up_extended_ref_temp (decl, expr, cleanup, &init);
8740 /* Use its address to initialize the reference variable. */
8741 expr = build_address (var);
8743 expr = convert_to_base (expr,
8744 build_pointer_type (base_conv_type),
8745 /*check_access=*/true,
8746 /*nonnull=*/true, complain);
8748 expr = build2 (COMPOUND_EXPR, TREE_TYPE (expr), init, expr);
8751 /* Take the address of EXPR. */
8752 expr = cp_build_addr_expr (expr, complain);
8753 /* If a BASE_CONV was required, perform it now. */
8755 expr = (perform_implicit_conversion
8756 (build_pointer_type (base_conv_type), expr,
8758 expr = build_nop (type, expr);
8762 /* Perform the conversion. */
8763 expr = convert_like (conv, expr, complain);
8765 /* Free all the conversions we allocated. */
8766 obstack_free (&conversion_obstack, p);
8771 /* Returns true iff TYPE is some variant of std::initializer_list. */
8774 is_std_init_list (tree type)
8776 /* Look through typedefs. */
8779 type = TYPE_MAIN_VARIANT (type);
8780 return (CLASS_TYPE_P (type)
8781 && CP_TYPE_CONTEXT (type) == std_node
8782 && strcmp (TYPE_NAME_STRING (type), "initializer_list") == 0);
8785 /* Returns true iff DECL is a list constructor: i.e. a constructor which
8786 will accept an argument list of a single std::initializer_list<T>. */
8789 is_list_ctor (tree decl)
8791 tree args = FUNCTION_FIRST_USER_PARMTYPE (decl);
8794 if (!args || args == void_list_node)
8797 arg = non_reference (TREE_VALUE (args));
8798 if (!is_std_init_list (arg))
8801 args = TREE_CHAIN (args);
8803 if (args && args != void_list_node && !TREE_PURPOSE (args))
8804 /* There are more non-defaulted parms. */
8810 #include "gt-cp-call.h"