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)
552 t = integral_constant_value (t);
554 if (integer_zerop (t) && !TREE_OVERFLOW (t))
560 /* Returns true iff T is a null member pointer value (4.11). */
563 null_member_pointer_value_p (tree t)
565 tree type = TREE_TYPE (t);
568 else if (TYPE_PTRMEMFUNC_P (type))
569 return (TREE_CODE (t) == CONSTRUCTOR
570 && integer_zerop (CONSTRUCTOR_ELT (t, 0)->value));
571 else if (TYPE_PTRMEM_P (type))
572 return integer_all_onesp (t);
577 /* Returns nonzero if PARMLIST consists of only default parms,
578 ellipsis, and/or undeduced parameter packs. */
581 sufficient_parms_p (const_tree parmlist)
583 for (; parmlist && parmlist != void_list_node;
584 parmlist = TREE_CHAIN (parmlist))
585 if (!TREE_PURPOSE (parmlist)
586 && !PACK_EXPANSION_P (TREE_VALUE (parmlist)))
591 /* Allocate N bytes of memory from the conversion obstack. The memory
592 is zeroed before being returned. */
595 conversion_obstack_alloc (size_t n)
598 if (!conversion_obstack_initialized)
600 gcc_obstack_init (&conversion_obstack);
601 conversion_obstack_initialized = true;
603 p = obstack_alloc (&conversion_obstack, n);
608 /* Allocate rejection reasons. */
610 static struct rejection_reason *
611 alloc_rejection (enum rejection_reason_code code)
613 struct rejection_reason *p;
614 p = (struct rejection_reason *) conversion_obstack_alloc (sizeof *p);
619 static struct rejection_reason *
620 arity_rejection (tree first_arg, int expected, int actual)
622 struct rejection_reason *r = alloc_rejection (rr_arity);
623 int adjust = first_arg != NULL_TREE;
624 r->u.arity.expected = expected - adjust;
625 r->u.arity.actual = actual - adjust;
629 static struct rejection_reason *
630 arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to)
632 struct rejection_reason *r = alloc_rejection (rr_arg_conversion);
633 int adjust = first_arg != NULL_TREE;
634 r->u.conversion.n_arg = n_arg - adjust;
635 r->u.conversion.from_type = from;
636 r->u.conversion.to_type = to;
640 static struct rejection_reason *
641 bad_arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to)
643 struct rejection_reason *r = alloc_rejection (rr_bad_arg_conversion);
644 int adjust = first_arg != NULL_TREE;
645 r->u.bad_conversion.n_arg = n_arg - adjust;
646 r->u.bad_conversion.from_type = from;
647 r->u.bad_conversion.to_type = to;
651 static struct rejection_reason *
652 explicit_conversion_rejection (tree from, tree to)
654 struct rejection_reason *r = alloc_rejection (rr_explicit_conversion);
655 r->u.conversion.n_arg = 0;
656 r->u.conversion.from_type = from;
657 r->u.conversion.to_type = to;
661 static struct rejection_reason *
662 template_conversion_rejection (tree from, tree to)
664 struct rejection_reason *r = alloc_rejection (rr_template_conversion);
665 r->u.conversion.n_arg = 0;
666 r->u.conversion.from_type = from;
667 r->u.conversion.to_type = to;
671 static struct rejection_reason *
672 template_unification_rejection (tree tmpl, tree explicit_targs, tree targs,
673 const tree *args, unsigned int nargs,
674 tree return_type, unification_kind_t strict,
677 size_t args_n_bytes = sizeof (*args) * nargs;
678 tree *args1 = (tree *) conversion_obstack_alloc (args_n_bytes);
679 struct rejection_reason *r = alloc_rejection (rr_template_unification);
680 r->u.template_unification.tmpl = tmpl;
681 r->u.template_unification.explicit_targs = explicit_targs;
682 r->u.template_unification.targs = targs;
683 /* Copy args to our own storage. */
684 memcpy (args1, args, args_n_bytes);
685 r->u.template_unification.args = args1;
686 r->u.template_unification.nargs = nargs;
687 r->u.template_unification.return_type = return_type;
688 r->u.template_unification.strict = strict;
689 r->u.template_unification.flags = flags;
693 static struct rejection_reason *
694 template_unification_error_rejection (void)
696 return alloc_rejection (rr_template_unification);
699 static struct rejection_reason *
700 template_instantiation_rejection (tree tmpl, tree targs)
702 struct rejection_reason *r = alloc_rejection (rr_template_instantiation);
703 r->u.template_instantiation.tmpl = tmpl;
704 r->u.template_instantiation.targs = targs;
708 static struct rejection_reason *
709 invalid_copy_with_fn_template_rejection (void)
711 struct rejection_reason *r = alloc_rejection (rr_invalid_copy);
715 /* Dynamically allocate a conversion. */
718 alloc_conversion (conversion_kind kind)
721 c = (conversion *) conversion_obstack_alloc (sizeof (conversion));
726 #ifdef ENABLE_CHECKING
728 /* Make sure that all memory on the conversion obstack has been
732 validate_conversion_obstack (void)
734 if (conversion_obstack_initialized)
735 gcc_assert ((obstack_next_free (&conversion_obstack)
736 == obstack_base (&conversion_obstack)));
739 #endif /* ENABLE_CHECKING */
741 /* Dynamically allocate an array of N conversions. */
744 alloc_conversions (size_t n)
746 return (conversion **) conversion_obstack_alloc (n * sizeof (conversion *));
750 build_conv (conversion_kind code, tree type, conversion *from)
753 conversion_rank rank = CONVERSION_RANK (from);
755 /* Note that the caller is responsible for filling in t->cand for
756 user-defined conversions. */
757 t = alloc_conversion (code);
780 t->user_conv_p = (code == ck_user || from->user_conv_p);
781 t->bad_p = from->bad_p;
786 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
787 specialization of std::initializer_list<T>, if such a conversion is
791 build_list_conv (tree type, tree ctor, int flags)
793 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type), 0);
794 unsigned len = CONSTRUCTOR_NELTS (ctor);
795 conversion **subconvs = alloc_conversions (len);
800 /* Within a list-initialization we can have more user-defined
802 flags &= ~LOOKUP_NO_CONVERSION;
803 /* But no narrowing conversions. */
804 flags |= LOOKUP_NO_NARROWING;
806 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
809 = implicit_conversion (elttype, TREE_TYPE (val), val,
817 t = alloc_conversion (ck_list);
819 t->u.list = subconvs;
822 for (i = 0; i < len; ++i)
824 conversion *sub = subconvs[i];
825 if (sub->rank > t->rank)
827 if (sub->user_conv_p)
828 t->user_conv_p = true;
836 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
837 is a valid aggregate initializer for array type ATYPE. */
840 can_convert_array (tree atype, tree ctor, int flags)
843 tree elttype = TREE_TYPE (atype);
844 for (i = 0; i < CONSTRUCTOR_NELTS (ctor); ++i)
846 tree val = CONSTRUCTOR_ELT (ctor, i)->value;
848 if (TREE_CODE (elttype) == ARRAY_TYPE
849 && TREE_CODE (val) == CONSTRUCTOR)
850 ok = can_convert_array (elttype, val, flags);
852 ok = can_convert_arg (elttype, TREE_TYPE (val), val, flags);
859 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
860 aggregate class, if such a conversion is possible. */
863 build_aggr_conv (tree type, tree ctor, int flags)
865 unsigned HOST_WIDE_INT i = 0;
867 tree field = next_initializable_field (TYPE_FIELDS (type));
868 tree empty_ctor = NULL_TREE;
870 for (; field; field = next_initializable_field (DECL_CHAIN (field)))
872 tree ftype = TREE_TYPE (field);
876 if (i < CONSTRUCTOR_NELTS (ctor))
877 val = CONSTRUCTOR_ELT (ctor, i)->value;
880 if (empty_ctor == NULL_TREE)
881 empty_ctor = build_constructor (init_list_type_node, NULL);
886 if (TREE_CODE (ftype) == ARRAY_TYPE
887 && TREE_CODE (val) == CONSTRUCTOR)
888 ok = can_convert_array (ftype, val, flags);
890 ok = can_convert_arg (ftype, TREE_TYPE (val), val, flags);
895 if (TREE_CODE (type) == UNION_TYPE)
899 if (i < CONSTRUCTOR_NELTS (ctor))
902 c = alloc_conversion (ck_aggr);
905 c->user_conv_p = true;
910 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
911 array type, if such a conversion is possible. */
914 build_array_conv (tree type, tree ctor, int flags)
917 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
918 tree elttype = TREE_TYPE (type);
923 enum conversion_rank rank = cr_exact;
925 if (TYPE_DOMAIN (type))
927 unsigned HOST_WIDE_INT alen = tree_low_cst (array_type_nelts_top (type), 1);
932 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
935 = implicit_conversion (elttype, TREE_TYPE (val), val,
940 if (sub->rank > rank)
942 if (sub->user_conv_p)
948 c = alloc_conversion (ck_aggr);
951 c->user_conv_p = user;
957 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
958 complex type, if such a conversion is possible. */
961 build_complex_conv (tree type, tree ctor, int flags)
964 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
965 tree elttype = TREE_TYPE (type);
970 enum conversion_rank rank = cr_exact;
975 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
978 = implicit_conversion (elttype, TREE_TYPE (val), val,
983 if (sub->rank > rank)
985 if (sub->user_conv_p)
991 c = alloc_conversion (ck_aggr);
994 c->user_conv_p = user;
1000 /* Build a representation of the identity conversion from EXPR to
1001 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1004 build_identity_conv (tree type, tree expr)
1008 c = alloc_conversion (ck_identity);
1015 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1016 were multiple user-defined conversions to accomplish the job.
1017 Build a conversion that indicates that ambiguity. */
1020 build_ambiguous_conv (tree type, tree expr)
1024 c = alloc_conversion (ck_ambig);
1032 strip_top_quals (tree t)
1034 if (TREE_CODE (t) == ARRAY_TYPE)
1036 return cp_build_qualified_type (t, 0);
1039 /* Returns the standard conversion path (see [conv]) from type FROM to type
1040 TO, if any. For proper handling of null pointer constants, you must
1041 also pass the expression EXPR to convert from. If C_CAST_P is true,
1042 this conversion is coming from a C-style cast. */
1045 standard_conversion (tree to, tree from, tree expr, bool c_cast_p,
1048 enum tree_code fcode, tcode;
1050 bool fromref = false;
1053 to = non_reference (to);
1054 if (TREE_CODE (from) == REFERENCE_TYPE)
1057 from = TREE_TYPE (from);
1060 to = strip_top_quals (to);
1061 from = strip_top_quals (from);
1063 if ((TYPE_PTRFN_P (to) || TYPE_PTRMEMFUNC_P (to))
1064 && expr && type_unknown_p (expr))
1066 tsubst_flags_t tflags = tf_conv;
1067 if (!(flags & LOOKUP_PROTECT))
1068 tflags |= tf_no_access_control;
1069 expr = instantiate_type (to, expr, tflags);
1070 if (expr == error_mark_node)
1072 from = TREE_TYPE (expr);
1075 fcode = TREE_CODE (from);
1076 tcode = TREE_CODE (to);
1078 conv = build_identity_conv (from, expr);
1079 if (fcode == FUNCTION_TYPE || fcode == ARRAY_TYPE)
1081 from = type_decays_to (from);
1082 fcode = TREE_CODE (from);
1083 conv = build_conv (ck_lvalue, from, conv);
1085 else if (fromref || (expr && lvalue_p (expr)))
1090 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
1093 from = strip_top_quals (bitfield_type);
1094 fcode = TREE_CODE (from);
1097 conv = build_conv (ck_rvalue, from, conv);
1098 if (flags & LOOKUP_PREFER_RVALUE)
1099 conv->rvaluedness_matches_p = true;
1102 /* Allow conversion between `__complex__' data types. */
1103 if (tcode == COMPLEX_TYPE && fcode == COMPLEX_TYPE)
1105 /* The standard conversion sequence to convert FROM to TO is
1106 the standard conversion sequence to perform componentwise
1108 conversion *part_conv = standard_conversion
1109 (TREE_TYPE (to), TREE_TYPE (from), NULL_TREE, c_cast_p, flags);
1113 conv = build_conv (part_conv->kind, to, conv);
1114 conv->rank = part_conv->rank;
1122 if (same_type_p (from, to))
1124 if (CLASS_TYPE_P (to) && conv->kind == ck_rvalue)
1125 conv->type = qualified_to;
1130 A null pointer constant can be converted to a pointer type; ... A
1131 null pointer constant of integral type can be converted to an
1132 rvalue of type std::nullptr_t. */
1133 if ((tcode == POINTER_TYPE || TYPE_PTR_TO_MEMBER_P (to)
1134 || NULLPTR_TYPE_P (to))
1135 && expr && null_ptr_cst_p (expr))
1136 conv = build_conv (ck_std, to, conv);
1137 else if ((tcode == INTEGER_TYPE && fcode == POINTER_TYPE)
1138 || (tcode == POINTER_TYPE && fcode == INTEGER_TYPE))
1140 /* For backwards brain damage compatibility, allow interconversion of
1141 pointers and integers with a pedwarn. */
1142 conv = build_conv (ck_std, to, conv);
1145 else if (UNSCOPED_ENUM_P (to) && fcode == INTEGER_TYPE)
1147 /* For backwards brain damage compatibility, allow interconversion of
1148 enums and integers with a pedwarn. */
1149 conv = build_conv (ck_std, to, conv);
1152 else if ((tcode == POINTER_TYPE && fcode == POINTER_TYPE)
1153 || (TYPE_PTRMEM_P (to) && TYPE_PTRMEM_P (from)))
1158 if (tcode == POINTER_TYPE
1159 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from),
1162 else if (VOID_TYPE_P (TREE_TYPE (to))
1163 && !TYPE_PTRMEM_P (from)
1164 && TREE_CODE (TREE_TYPE (from)) != FUNCTION_TYPE)
1166 tree nfrom = TREE_TYPE (from);
1167 from = build_pointer_type
1168 (cp_build_qualified_type (void_type_node,
1169 cp_type_quals (nfrom)));
1170 conv = build_conv (ck_ptr, from, conv);
1172 else if (TYPE_PTRMEM_P (from))
1174 tree fbase = TYPE_PTRMEM_CLASS_TYPE (from);
1175 tree tbase = TYPE_PTRMEM_CLASS_TYPE (to);
1177 if (DERIVED_FROM_P (fbase, tbase)
1178 && (same_type_ignoring_top_level_qualifiers_p
1179 (TYPE_PTRMEM_POINTED_TO_TYPE (from),
1180 TYPE_PTRMEM_POINTED_TO_TYPE (to))))
1182 from = build_ptrmem_type (tbase,
1183 TYPE_PTRMEM_POINTED_TO_TYPE (from));
1184 conv = build_conv (ck_pmem, from, conv);
1186 else if (!same_type_p (fbase, tbase))
1189 else if (CLASS_TYPE_P (TREE_TYPE (from))
1190 && CLASS_TYPE_P (TREE_TYPE (to))
1193 An rvalue of type "pointer to cv D," where D is a
1194 class type, can be converted to an rvalue of type
1195 "pointer to cv B," where B is a base class (clause
1196 _class.derived_) of D. If B is an inaccessible
1197 (clause _class.access_) or ambiguous
1198 (_class.member.lookup_) base class of D, a program
1199 that necessitates this conversion is ill-formed.
1200 Therefore, we use DERIVED_FROM_P, and do not check
1201 access or uniqueness. */
1202 && DERIVED_FROM_P (TREE_TYPE (to), TREE_TYPE (from)))
1205 cp_build_qualified_type (TREE_TYPE (to),
1206 cp_type_quals (TREE_TYPE (from)));
1207 from = build_pointer_type (from);
1208 conv = build_conv (ck_ptr, from, conv);
1209 conv->base_p = true;
1212 if (tcode == POINTER_TYPE)
1214 to_pointee = TREE_TYPE (to);
1215 from_pointee = TREE_TYPE (from);
1219 to_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (to);
1220 from_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (from);
1223 if (same_type_p (from, to))
1225 else if (c_cast_p && comp_ptr_ttypes_const (to, from))
1226 /* In a C-style cast, we ignore CV-qualification because we
1227 are allowed to perform a static_cast followed by a
1229 conv = build_conv (ck_qual, to, conv);
1230 else if (!c_cast_p && comp_ptr_ttypes (to_pointee, from_pointee))
1231 conv = build_conv (ck_qual, to, conv);
1232 else if (expr && string_conv_p (to, expr, 0))
1233 /* converting from string constant to char *. */
1234 conv = build_conv (ck_qual, to, conv);
1235 /* Allow conversions among compatible ObjC pointer types (base
1236 conversions have been already handled above). */
1237 else if (c_dialect_objc ()
1238 && objc_compare_types (to, from, -4, NULL_TREE))
1239 conv = build_conv (ck_ptr, to, conv);
1240 else if (ptr_reasonably_similar (to_pointee, from_pointee))
1242 conv = build_conv (ck_ptr, to, conv);
1250 else if (TYPE_PTRMEMFUNC_P (to) && TYPE_PTRMEMFUNC_P (from))
1252 tree fromfn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from));
1253 tree tofn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to));
1254 tree fbase = class_of_this_parm (fromfn);
1255 tree tbase = class_of_this_parm (tofn);
1257 if (!DERIVED_FROM_P (fbase, tbase)
1258 || !same_type_p (TREE_TYPE (fromfn), TREE_TYPE (tofn))
1259 || !compparms (TREE_CHAIN (TYPE_ARG_TYPES (fromfn)),
1260 TREE_CHAIN (TYPE_ARG_TYPES (tofn)))
1261 || cp_type_quals (fbase) != cp_type_quals (tbase))
1264 from = build_memfn_type (fromfn, tbase, cp_type_quals (tbase));
1265 from = build_ptrmemfunc_type (build_pointer_type (from));
1266 conv = build_conv (ck_pmem, from, conv);
1267 conv->base_p = true;
1269 else if (tcode == BOOLEAN_TYPE)
1273 An rvalue of arithmetic, unscoped enumeration, pointer, or
1274 pointer to member type can be converted to an rvalue of type
1275 bool. ... An rvalue of type std::nullptr_t can be converted
1276 to an rvalue of type bool; */
1277 if (ARITHMETIC_TYPE_P (from)
1278 || UNSCOPED_ENUM_P (from)
1279 || fcode == POINTER_TYPE
1280 || TYPE_PTR_TO_MEMBER_P (from)
1281 || NULLPTR_TYPE_P (from))
1283 conv = build_conv (ck_std, to, conv);
1284 if (fcode == POINTER_TYPE
1285 || TYPE_PTRMEM_P (from)
1286 || (TYPE_PTRMEMFUNC_P (from)
1287 && conv->rank < cr_pbool)
1288 || NULLPTR_TYPE_P (from))
1289 conv->rank = cr_pbool;
1295 /* We don't check for ENUMERAL_TYPE here because there are no standard
1296 conversions to enum type. */
1297 /* As an extension, allow conversion to complex type. */
1298 else if (ARITHMETIC_TYPE_P (to))
1300 if (! (INTEGRAL_CODE_P (fcode) || fcode == REAL_TYPE)
1301 || SCOPED_ENUM_P (from))
1303 conv = build_conv (ck_std, to, conv);
1305 /* Give this a better rank if it's a promotion. */
1306 if (same_type_p (to, type_promotes_to (from))
1307 && conv->u.next->rank <= cr_promotion)
1308 conv->rank = cr_promotion;
1310 else if (fcode == VECTOR_TYPE && tcode == VECTOR_TYPE
1311 && vector_types_convertible_p (from, to, false))
1312 return build_conv (ck_std, to, conv);
1313 else if (MAYBE_CLASS_TYPE_P (to) && MAYBE_CLASS_TYPE_P (from)
1314 && is_properly_derived_from (from, to))
1316 if (conv->kind == ck_rvalue)
1317 conv = conv->u.next;
1318 conv = build_conv (ck_base, to, conv);
1319 /* The derived-to-base conversion indicates the initialization
1320 of a parameter with base type from an object of a derived
1321 type. A temporary object is created to hold the result of
1322 the conversion unless we're binding directly to a reference. */
1323 conv->need_temporary_p = !(flags & LOOKUP_NO_TEMP_BIND);
1328 if (flags & LOOKUP_NO_NARROWING)
1329 conv->check_narrowing = true;
1334 /* Returns nonzero if T1 is reference-related to T2. */
1337 reference_related_p (tree t1, tree t2)
1339 if (t1 == error_mark_node || t2 == error_mark_node)
1342 t1 = TYPE_MAIN_VARIANT (t1);
1343 t2 = TYPE_MAIN_VARIANT (t2);
1347 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1348 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1350 return (same_type_p (t1, t2)
1351 || (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
1352 && DERIVED_FROM_P (t1, t2)));
1355 /* Returns nonzero if T1 is reference-compatible with T2. */
1358 reference_compatible_p (tree t1, tree t2)
1362 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
1363 reference-related to T2 and cv1 is the same cv-qualification as,
1364 or greater cv-qualification than, cv2. */
1365 return (reference_related_p (t1, t2)
1366 && at_least_as_qualified_p (t1, t2));
1369 /* A reference of the indicated TYPE is being bound directly to the
1370 expression represented by the implicit conversion sequence CONV.
1371 Return a conversion sequence for this binding. */
1374 direct_reference_binding (tree type, conversion *conv)
1378 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
1379 gcc_assert (TREE_CODE (conv->type) != REFERENCE_TYPE);
1381 t = TREE_TYPE (type);
1385 When a parameter of reference type binds directly
1386 (_dcl.init.ref_) to an argument expression, the implicit
1387 conversion sequence is the identity conversion, unless the
1388 argument expression has a type that is a derived class of the
1389 parameter type, in which case the implicit conversion sequence is
1390 a derived-to-base Conversion.
1392 If the parameter binds directly to the result of applying a
1393 conversion function to the argument expression, the implicit
1394 conversion sequence is a user-defined conversion sequence
1395 (_over.ics.user_), with the second standard conversion sequence
1396 either an identity conversion or, if the conversion function
1397 returns an entity of a type that is a derived class of the
1398 parameter type, a derived-to-base conversion. */
1399 if (!same_type_ignoring_top_level_qualifiers_p (t, conv->type))
1401 /* Represent the derived-to-base conversion. */
1402 conv = build_conv (ck_base, t, conv);
1403 /* We will actually be binding to the base-class subobject in
1404 the derived class, so we mark this conversion appropriately.
1405 That way, convert_like knows not to generate a temporary. */
1406 conv->need_temporary_p = false;
1408 return build_conv (ck_ref_bind, type, conv);
1411 /* Returns the conversion path from type FROM to reference type TO for
1412 purposes of reference binding. For lvalue binding, either pass a
1413 reference type to FROM or an lvalue expression to EXPR. If the
1414 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1415 the conversion returned. If C_CAST_P is true, this
1416 conversion is coming from a C-style cast. */
1419 reference_binding (tree rto, tree rfrom, tree expr, bool c_cast_p, int flags)
1421 conversion *conv = NULL;
1422 tree to = TREE_TYPE (rto);
1427 cp_lvalue_kind gl_kind;
1430 if (TREE_CODE (to) == FUNCTION_TYPE && expr && type_unknown_p (expr))
1432 expr = instantiate_type (to, expr, tf_none);
1433 if (expr == error_mark_node)
1435 from = TREE_TYPE (expr);
1438 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1440 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
1441 conv = implicit_conversion (to, from, expr, c_cast_p,
1443 if (!CLASS_TYPE_P (to)
1444 && CONSTRUCTOR_NELTS (expr) == 1)
1446 expr = CONSTRUCTOR_ELT (expr, 0)->value;
1447 if (error_operand_p (expr))
1449 from = TREE_TYPE (expr);
1453 if (TREE_CODE (from) == REFERENCE_TYPE)
1455 from = TREE_TYPE (from);
1456 if (!TYPE_REF_IS_RVALUE (rfrom)
1457 || TREE_CODE (from) == FUNCTION_TYPE)
1458 gl_kind = clk_ordinary;
1460 gl_kind = clk_rvalueref;
1464 gl_kind = lvalue_kind (expr);
1465 if (gl_kind & clk_class)
1466 /* A class prvalue is not a glvalue. */
1471 is_lvalue = gl_kind && !(gl_kind & clk_rvalueref);
1474 if ((gl_kind & clk_bitfield) != 0)
1475 tfrom = unlowered_expr_type (expr);
1477 /* Figure out whether or not the types are reference-related and
1478 reference compatible. We have do do this after stripping
1479 references from FROM. */
1480 related_p = reference_related_p (to, tfrom);
1481 /* If this is a C cast, first convert to an appropriately qualified
1482 type, so that we can later do a const_cast to the desired type. */
1483 if (related_p && c_cast_p
1484 && !at_least_as_qualified_p (to, tfrom))
1485 to = cp_build_qualified_type (to, cp_type_quals (tfrom));
1486 compatible_p = reference_compatible_p (to, tfrom);
1488 /* Directly bind reference when target expression's type is compatible with
1489 the reference and expression is an lvalue. In DR391, the wording in
1490 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1491 const and rvalue references to rvalues of compatible class type.
1492 We should also do direct bindings for non-class xvalues. */
1495 || (((CP_TYPE_CONST_NON_VOLATILE_P (to)
1496 && !(flags & LOOKUP_NO_RVAL_BIND))
1497 || TYPE_REF_IS_RVALUE (rto))
1499 || (!(flags & LOOKUP_NO_TEMP_BIND)
1500 && (CLASS_TYPE_P (from)
1501 || TREE_CODE (from) == ARRAY_TYPE))))))
1505 If the initializer expression
1507 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1508 is reference-compatible with "cv2 T2,"
1510 the reference is bound directly to the initializer expression
1514 If the initializer expression is an rvalue, with T2 a class type,
1515 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1516 is bound to the object represented by the rvalue or to a sub-object
1517 within that object. */
1519 conv = build_identity_conv (tfrom, expr);
1520 conv = direct_reference_binding (rto, conv);
1522 if (flags & LOOKUP_PREFER_RVALUE)
1523 /* The top-level caller requested that we pretend that the lvalue
1524 be treated as an rvalue. */
1525 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
1526 else if (TREE_CODE (rfrom) == REFERENCE_TYPE)
1527 /* Handle rvalue reference to function properly. */
1528 conv->rvaluedness_matches_p
1529 = (TYPE_REF_IS_RVALUE (rto) == TYPE_REF_IS_RVALUE (rfrom));
1531 conv->rvaluedness_matches_p
1532 = (TYPE_REF_IS_RVALUE (rto) == !is_lvalue);
1534 if ((gl_kind & clk_bitfield) != 0
1535 || ((gl_kind & clk_packed) != 0 && !TYPE_PACKED (to)))
1536 /* For the purposes of overload resolution, we ignore the fact
1537 this expression is a bitfield or packed field. (In particular,
1538 [over.ics.ref] says specifically that a function with a
1539 non-const reference parameter is viable even if the
1540 argument is a bitfield.)
1542 However, when we actually call the function we must create
1543 a temporary to which to bind the reference. If the
1544 reference is volatile, or isn't const, then we cannot make
1545 a temporary, so we just issue an error when the conversion
1547 conv->need_temporary_p = true;
1549 /* Don't allow binding of lvalues (other than function lvalues) to
1550 rvalue references. */
1551 if (is_lvalue && TYPE_REF_IS_RVALUE (rto)
1552 && TREE_CODE (to) != FUNCTION_TYPE
1553 && !(flags & LOOKUP_PREFER_RVALUE))
1558 /* [class.conv.fct] A conversion function is never used to convert a
1559 (possibly cv-qualified) object to the (possibly cv-qualified) same
1560 object type (or a reference to it), to a (possibly cv-qualified) base
1561 class of that type (or a reference to it).... */
1562 else if (CLASS_TYPE_P (from) && !related_p
1563 && !(flags & LOOKUP_NO_CONVERSION))
1567 If the initializer expression
1569 -- has a class type (i.e., T2 is a class type) can be
1570 implicitly converted to an lvalue of type "cv3 T3," where
1571 "cv1 T1" is reference-compatible with "cv3 T3". (this
1572 conversion is selected by enumerating the applicable
1573 conversion functions (_over.match.ref_) and choosing the
1574 best one through overload resolution. (_over.match_).
1576 the reference is bound to the lvalue result of the conversion
1577 in the second case. */
1578 z_candidate *cand = build_user_type_conversion_1 (rto, expr, flags);
1580 return cand->second_conv;
1583 /* From this point on, we conceptually need temporaries, even if we
1584 elide them. Only the cases above are "direct bindings". */
1585 if (flags & LOOKUP_NO_TEMP_BIND)
1590 When a parameter of reference type is not bound directly to an
1591 argument expression, the conversion sequence is the one required
1592 to convert the argument expression to the underlying type of the
1593 reference according to _over.best.ics_. Conceptually, this
1594 conversion sequence corresponds to copy-initializing a temporary
1595 of the underlying type with the argument expression. Any
1596 difference in top-level cv-qualification is subsumed by the
1597 initialization itself and does not constitute a conversion. */
1601 Otherwise, the reference shall be to a non-volatile const type.
1603 Under C++0x, [8.5.3/5 dcl.init.ref] it may also be an rvalue reference */
1604 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto))
1609 Otherwise, a temporary of type "cv1 T1" is created and
1610 initialized from the initializer expression using the rules for a
1611 non-reference copy initialization. If T1 is reference-related to
1612 T2, cv1 must be the same cv-qualification as, or greater
1613 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1614 if (related_p && !at_least_as_qualified_p (to, from))
1617 /* We're generating a temporary now, but don't bind any more in the
1618 conversion (specifically, don't slice the temporary returned by a
1619 conversion operator). */
1620 flags |= LOOKUP_NO_TEMP_BIND;
1622 /* Core issue 899: When [copy-]initializing a temporary to be bound
1623 to the first parameter of a copy constructor (12.8) called with
1624 a single argument in the context of direct-initialization,
1625 explicit conversion functions are also considered.
1627 So don't set LOOKUP_ONLYCONVERTING in that case. */
1628 if (!(flags & LOOKUP_COPY_PARM))
1629 flags |= LOOKUP_ONLYCONVERTING;
1632 conv = implicit_conversion (to, from, expr, c_cast_p,
1637 conv = build_conv (ck_ref_bind, rto, conv);
1638 /* This reference binding, unlike those above, requires the
1639 creation of a temporary. */
1640 conv->need_temporary_p = true;
1641 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
1646 /* Returns the implicit conversion sequence (see [over.ics]) from type
1647 FROM to type TO. The optional expression EXPR may affect the
1648 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1649 true, this conversion is coming from a C-style cast. */
1652 implicit_conversion (tree to, tree from, tree expr, bool c_cast_p,
1657 if (from == error_mark_node || to == error_mark_node
1658 || expr == error_mark_node)
1661 /* Other flags only apply to the primary function in overload
1662 resolution, or after we've chosen one. */
1663 flags &= (LOOKUP_ONLYCONVERTING|LOOKUP_NO_CONVERSION|LOOKUP_COPY_PARM
1664 |LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND|LOOKUP_PREFER_RVALUE
1665 |LOOKUP_NO_NARROWING|LOOKUP_PROTECT);
1667 if (TREE_CODE (to) == REFERENCE_TYPE)
1668 conv = reference_binding (to, from, expr, c_cast_p, flags);
1670 conv = standard_conversion (to, from, expr, c_cast_p, flags);
1675 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1677 if (is_std_init_list (to))
1678 return build_list_conv (to, expr, flags);
1680 /* As an extension, allow list-initialization of _Complex. */
1681 if (TREE_CODE (to) == COMPLEX_TYPE)
1683 conv = build_complex_conv (to, expr, flags);
1688 /* Allow conversion from an initializer-list with one element to a
1690 if (SCALAR_TYPE_P (to))
1692 int nelts = CONSTRUCTOR_NELTS (expr);
1696 elt = build_value_init (to, tf_none);
1697 else if (nelts == 1)
1698 elt = CONSTRUCTOR_ELT (expr, 0)->value;
1700 elt = error_mark_node;
1702 conv = implicit_conversion (to, TREE_TYPE (elt), elt,
1706 conv->check_narrowing = true;
1707 if (BRACE_ENCLOSED_INITIALIZER_P (elt))
1708 /* Too many levels of braces, i.e. '{{1}}'. */
1713 else if (TREE_CODE (to) == ARRAY_TYPE)
1714 return build_array_conv (to, expr, flags);
1717 if (expr != NULL_TREE
1718 && (MAYBE_CLASS_TYPE_P (from)
1719 || MAYBE_CLASS_TYPE_P (to))
1720 && (flags & LOOKUP_NO_CONVERSION) == 0)
1722 struct z_candidate *cand;
1724 if (CLASS_TYPE_P (to)
1725 && BRACE_ENCLOSED_INITIALIZER_P (expr)
1726 && !CLASSTYPE_NON_AGGREGATE (complete_type (to)))
1727 return build_aggr_conv (to, expr, flags);
1729 cand = build_user_type_conversion_1 (to, expr, flags);
1731 conv = cand->second_conv;
1733 /* We used to try to bind a reference to a temporary here, but that
1734 is now handled after the recursive call to this function at the end
1735 of reference_binding. */
1742 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1743 functions. ARGS will not be changed until a single candidate is
1746 static struct z_candidate *
1747 add_candidate (struct z_candidate **candidates,
1748 tree fn, tree first_arg, const VEC(tree,gc) *args,
1749 size_t num_convs, conversion **convs,
1750 tree access_path, tree conversion_path,
1751 int viable, struct rejection_reason *reason)
1753 struct z_candidate *cand = (struct z_candidate *)
1754 conversion_obstack_alloc (sizeof (struct z_candidate));
1757 cand->first_arg = first_arg;
1759 cand->convs = convs;
1760 cand->num_convs = num_convs;
1761 cand->access_path = access_path;
1762 cand->conversion_path = conversion_path;
1763 cand->viable = viable;
1764 cand->reason = reason;
1765 cand->next = *candidates;
1771 /* Return the number of remaining arguments in the parameter list
1772 beginning with ARG. */
1775 remaining_arguments (tree arg)
1779 for (n = 0; arg != NULL_TREE && arg != void_list_node;
1780 arg = TREE_CHAIN (arg))
1786 /* Create an overload candidate for the function or method FN called
1787 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1788 FLAGS is passed on to implicit_conversion.
1790 This does not change ARGS.
1792 CTYPE, if non-NULL, is the type we want to pretend this function
1793 comes from for purposes of overload resolution. */
1795 static struct z_candidate *
1796 add_function_candidate (struct z_candidate **candidates,
1797 tree fn, tree ctype, tree first_arg,
1798 const VEC(tree,gc) *args, tree access_path,
1799 tree conversion_path, int flags)
1801 tree parmlist = TYPE_ARG_TYPES (TREE_TYPE (fn));
1805 tree orig_first_arg = first_arg;
1808 struct rejection_reason *reason = NULL;
1810 /* At this point we should not see any functions which haven't been
1811 explicitly declared, except for friend functions which will have
1812 been found using argument dependent lookup. */
1813 gcc_assert (!DECL_ANTICIPATED (fn) || DECL_HIDDEN_FRIEND_P (fn));
1815 /* The `this', `in_chrg' and VTT arguments to constructors are not
1816 considered in overload resolution. */
1817 if (DECL_CONSTRUCTOR_P (fn))
1819 parmlist = skip_artificial_parms_for (fn, parmlist);
1820 skip = num_artificial_parms_for (fn);
1821 if (skip > 0 && first_arg != NULL_TREE)
1824 first_arg = NULL_TREE;
1830 len = VEC_length (tree, args) - skip + (first_arg != NULL_TREE ? 1 : 0);
1831 convs = alloc_conversions (len);
1833 /* 13.3.2 - Viable functions [over.match.viable]
1834 First, to be a viable function, a candidate function shall have enough
1835 parameters to agree in number with the arguments in the list.
1837 We need to check this first; otherwise, checking the ICSes might cause
1838 us to produce an ill-formed template instantiation. */
1840 parmnode = parmlist;
1841 for (i = 0; i < len; ++i)
1843 if (parmnode == NULL_TREE || parmnode == void_list_node)
1845 parmnode = TREE_CHAIN (parmnode);
1848 if ((i < len && parmnode)
1849 || !sufficient_parms_p (parmnode))
1851 int remaining = remaining_arguments (parmnode);
1853 reason = arity_rejection (first_arg, i + remaining, len);
1855 /* When looking for a function from a subobject from an implicit
1856 copy/move constructor/operator=, don't consider anything that takes (a
1857 reference to) an unrelated type. See c++/44909 and core 1092. */
1858 else if (parmlist && (flags & LOOKUP_DEFAULTED))
1860 if (DECL_CONSTRUCTOR_P (fn))
1862 else if (DECL_ASSIGNMENT_OPERATOR_P (fn)
1863 && DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR)
1869 parmnode = chain_index (i-1, parmlist);
1870 if (!reference_related_p (non_reference (TREE_VALUE (parmnode)),
1875 /* This only applies at the top level. */
1876 flags &= ~LOOKUP_DEFAULTED;
1882 /* Second, for F to be a viable function, there shall exist for each
1883 argument an implicit conversion sequence that converts that argument
1884 to the corresponding parameter of F. */
1886 parmnode = parmlist;
1888 for (i = 0; i < len; ++i)
1890 tree arg, argtype, to_type;
1894 if (parmnode == void_list_node)
1897 if (i == 0 && first_arg != NULL_TREE)
1900 arg = VEC_index (tree, args,
1901 i + skip - (first_arg != NULL_TREE ? 1 : 0));
1902 argtype = lvalue_type (arg);
1904 is_this = (i == 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
1905 && ! DECL_CONSTRUCTOR_P (fn));
1909 tree parmtype = TREE_VALUE (parmnode);
1912 parmnode = TREE_CHAIN (parmnode);
1914 /* The type of the implicit object parameter ('this') for
1915 overload resolution is not always the same as for the
1916 function itself; conversion functions are considered to
1917 be members of the class being converted, and functions
1918 introduced by a using-declaration are considered to be
1919 members of the class that uses them.
1921 Since build_over_call ignores the ICS for the `this'
1922 parameter, we can just change the parm type. */
1923 if (ctype && is_this)
1925 parmtype = cp_build_qualified_type
1926 (ctype, cp_type_quals (TREE_TYPE (parmtype)));
1927 parmtype = build_pointer_type (parmtype);
1930 /* Core issue 899: When [copy-]initializing a temporary to be bound
1931 to the first parameter of a copy constructor (12.8) called with
1932 a single argument in the context of direct-initialization,
1933 explicit conversion functions are also considered.
1935 So set LOOKUP_COPY_PARM to let reference_binding know that
1936 it's being called in that context. We generalize the above
1937 to handle move constructors and template constructors as well;
1938 the standardese should soon be updated similarly. */
1939 if (ctype && i == 0 && (len-skip == 1)
1940 && !(flags & LOOKUP_ONLYCONVERTING)
1941 && DECL_CONSTRUCTOR_P (fn)
1942 && parmtype != error_mark_node
1943 && (same_type_ignoring_top_level_qualifiers_p
1944 (non_reference (parmtype), ctype)))
1946 lflags |= LOOKUP_COPY_PARM;
1947 /* We allow user-defined conversions within init-lists, but
1948 not for the copy constructor. */
1949 if (flags & LOOKUP_NO_COPY_CTOR_CONVERSION)
1950 lflags |= LOOKUP_NO_CONVERSION;
1953 lflags |= LOOKUP_ONLYCONVERTING;
1955 t = implicit_conversion (parmtype, argtype, arg,
1956 /*c_cast_p=*/false, lflags);
1961 t = build_identity_conv (argtype, arg);
1962 t->ellipsis_p = true;
1973 reason = arg_conversion_rejection (first_arg, i, argtype, to_type);
1980 reason = bad_arg_conversion_rejection (first_arg, i, argtype, to_type);
1985 return add_candidate (candidates, fn, orig_first_arg, args, len, convs,
1986 access_path, conversion_path, viable, reason);
1989 /* Create an overload candidate for the conversion function FN which will
1990 be invoked for expression OBJ, producing a pointer-to-function which
1991 will in turn be called with the argument list FIRST_ARG/ARGLIST,
1992 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
1993 passed on to implicit_conversion.
1995 Actually, we don't really care about FN; we care about the type it
1996 converts to. There may be multiple conversion functions that will
1997 convert to that type, and we rely on build_user_type_conversion_1 to
1998 choose the best one; so when we create our candidate, we record the type
1999 instead of the function. */
2001 static struct z_candidate *
2002 add_conv_candidate (struct z_candidate **candidates, tree fn, tree obj,
2003 tree first_arg, const VEC(tree,gc) *arglist,
2004 tree access_path, tree conversion_path)
2006 tree totype = TREE_TYPE (TREE_TYPE (fn));
2007 int i, len, viable, flags;
2008 tree parmlist, parmnode;
2010 struct rejection_reason *reason;
2012 for (parmlist = totype; TREE_CODE (parmlist) != FUNCTION_TYPE; )
2013 parmlist = TREE_TYPE (parmlist);
2014 parmlist = TYPE_ARG_TYPES (parmlist);
2016 len = VEC_length (tree, arglist) + (first_arg != NULL_TREE ? 1 : 0) + 1;
2017 convs = alloc_conversions (len);
2018 parmnode = parmlist;
2020 flags = LOOKUP_IMPLICIT;
2023 /* Don't bother looking up the same type twice. */
2024 if (*candidates && (*candidates)->fn == totype)
2027 for (i = 0; i < len; ++i)
2029 tree arg, argtype, convert_type = NULL_TREE;
2034 else if (i == 1 && first_arg != NULL_TREE)
2037 arg = VEC_index (tree, arglist,
2038 i - (first_arg != NULL_TREE ? 1 : 0) - 1);
2039 argtype = lvalue_type (arg);
2043 t = implicit_conversion (totype, argtype, arg, /*c_cast_p=*/false,
2045 convert_type = totype;
2047 else if (parmnode == void_list_node)
2051 t = implicit_conversion (TREE_VALUE (parmnode), argtype, arg,
2052 /*c_cast_p=*/false, flags);
2053 convert_type = TREE_VALUE (parmnode);
2057 t = build_identity_conv (argtype, arg);
2058 t->ellipsis_p = true;
2059 convert_type = argtype;
2069 reason = bad_arg_conversion_rejection (NULL_TREE, i, argtype, convert_type);
2076 parmnode = TREE_CHAIN (parmnode);
2080 || ! sufficient_parms_p (parmnode))
2082 int remaining = remaining_arguments (parmnode);
2084 reason = arity_rejection (NULL_TREE, i + remaining, len);
2087 return add_candidate (candidates, totype, first_arg, arglist, len, convs,
2088 access_path, conversion_path, viable, reason);
2092 build_builtin_candidate (struct z_candidate **candidates, tree fnname,
2093 tree type1, tree type2, tree *args, tree *argtypes,
2101 struct rejection_reason *reason = NULL;
2106 num_convs = args[2] ? 3 : (args[1] ? 2 : 1);
2107 convs = alloc_conversions (num_convs);
2109 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2110 conversion ops are allowed. We handle that here by just checking for
2111 boolean_type_node because other operators don't ask for it. COND_EXPR
2112 also does contextual conversion to bool for the first operand, but we
2113 handle that in build_conditional_expr, and type1 here is operand 2. */
2114 if (type1 != boolean_type_node)
2115 flags |= LOOKUP_ONLYCONVERTING;
2117 for (i = 0; i < 2; ++i)
2122 t = implicit_conversion (types[i], argtypes[i], args[i],
2123 /*c_cast_p=*/false, flags);
2127 /* We need something for printing the candidate. */
2128 t = build_identity_conv (types[i], NULL_TREE);
2129 reason = arg_conversion_rejection (NULL_TREE, i, argtypes[i], types[i]);
2134 reason = bad_arg_conversion_rejection (NULL_TREE, i, argtypes[i], types[i]);
2139 /* For COND_EXPR we rearranged the arguments; undo that now. */
2142 convs[2] = convs[1];
2143 convs[1] = convs[0];
2144 t = implicit_conversion (boolean_type_node, argtypes[2], args[2],
2145 /*c_cast_p=*/false, flags);
2151 reason = arg_conversion_rejection (NULL_TREE, 0, argtypes[2],
2156 add_candidate (candidates, fnname, /*first_arg=*/NULL_TREE, /*args=*/NULL,
2158 /*access_path=*/NULL_TREE,
2159 /*conversion_path=*/NULL_TREE,
2164 is_complete (tree t)
2166 return COMPLETE_TYPE_P (complete_type (t));
2169 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2172 promoted_arithmetic_type_p (tree type)
2176 In this section, the term promoted integral type is used to refer
2177 to those integral types which are preserved by integral promotion
2178 (including e.g. int and long but excluding e.g. char).
2179 Similarly, the term promoted arithmetic type refers to promoted
2180 integral types plus floating types. */
2181 return ((CP_INTEGRAL_TYPE_P (type)
2182 && same_type_p (type_promotes_to (type), type))
2183 || TREE_CODE (type) == REAL_TYPE);
2186 /* Create any builtin operator overload candidates for the operator in
2187 question given the converted operand types TYPE1 and TYPE2. The other
2188 args are passed through from add_builtin_candidates to
2189 build_builtin_candidate.
2191 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2192 If CODE is requires candidates operands of the same type of the kind
2193 of which TYPE1 and TYPE2 are, we add both candidates
2194 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2197 add_builtin_candidate (struct z_candidate **candidates, enum tree_code code,
2198 enum tree_code code2, tree fnname, tree type1,
2199 tree type2, tree *args, tree *argtypes, int flags)
2203 case POSTINCREMENT_EXPR:
2204 case POSTDECREMENT_EXPR:
2205 args[1] = integer_zero_node;
2206 type2 = integer_type_node;
2215 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2216 and VQ is either volatile or empty, there exist candidate operator
2217 functions of the form
2218 VQ T& operator++(VQ T&);
2219 T operator++(VQ T&, int);
2220 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2221 type other than bool, and VQ is either volatile or empty, there exist
2222 candidate operator functions of the form
2223 VQ T& operator--(VQ T&);
2224 T operator--(VQ T&, int);
2225 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2226 complete object type, and VQ is either volatile or empty, there exist
2227 candidate operator functions of the form
2228 T*VQ& operator++(T*VQ&);
2229 T*VQ& operator--(T*VQ&);
2230 T* operator++(T*VQ&, int);
2231 T* operator--(T*VQ&, int); */
2233 case POSTDECREMENT_EXPR:
2234 case PREDECREMENT_EXPR:
2235 if (TREE_CODE (type1) == BOOLEAN_TYPE)
2237 case POSTINCREMENT_EXPR:
2238 case PREINCREMENT_EXPR:
2239 if (ARITHMETIC_TYPE_P (type1) || TYPE_PTROB_P (type1))
2241 type1 = build_reference_type (type1);
2246 /* 7 For every cv-qualified or cv-unqualified object type T, there
2247 exist candidate operator functions of the form
2251 8 For every function type T, there exist candidate operator functions of
2253 T& operator*(T*); */
2256 if (TREE_CODE (type1) == POINTER_TYPE
2257 && !uses_template_parms (TREE_TYPE (type1))
2258 && (TYPE_PTROB_P (type1)
2259 || TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE))
2263 /* 9 For every type T, there exist candidate operator functions of the form
2266 10For every promoted arithmetic type T, there exist candidate operator
2267 functions of the form
2271 case UNARY_PLUS_EXPR: /* unary + */
2272 if (TREE_CODE (type1) == POINTER_TYPE)
2275 if (ARITHMETIC_TYPE_P (type1))
2279 /* 11For every promoted integral type T, there exist candidate operator
2280 functions of the form
2284 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1))
2288 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2289 is the same type as C2 or is a derived class of C2, T is a complete
2290 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2291 there exist candidate operator functions of the form
2292 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2293 where CV12 is the union of CV1 and CV2. */
2296 if (TREE_CODE (type1) == POINTER_TYPE
2297 && TYPE_PTR_TO_MEMBER_P (type2))
2299 tree c1 = TREE_TYPE (type1);
2300 tree c2 = TYPE_PTRMEM_CLASS_TYPE (type2);
2302 if (MAYBE_CLASS_TYPE_P (c1) && DERIVED_FROM_P (c2, c1)
2303 && (TYPE_PTRMEMFUNC_P (type2)
2304 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2))))
2309 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2310 didate operator functions of the form
2315 bool operator<(L, R);
2316 bool operator>(L, R);
2317 bool operator<=(L, R);
2318 bool operator>=(L, R);
2319 bool operator==(L, R);
2320 bool operator!=(L, R);
2321 where LR is the result of the usual arithmetic conversions between
2324 14For every pair of types T and I, where T is a cv-qualified or cv-
2325 unqualified complete object type and I is a promoted integral type,
2326 there exist candidate operator functions of the form
2327 T* operator+(T*, I);
2328 T& operator[](T*, I);
2329 T* operator-(T*, I);
2330 T* operator+(I, T*);
2331 T& operator[](I, T*);
2333 15For every T, where T is a pointer to complete object type, there exist
2334 candidate operator functions of the form112)
2335 ptrdiff_t operator-(T, T);
2337 16For every pointer or enumeration type T, there exist candidate operator
2338 functions of the form
2339 bool operator<(T, T);
2340 bool operator>(T, T);
2341 bool operator<=(T, T);
2342 bool operator>=(T, T);
2343 bool operator==(T, T);
2344 bool operator!=(T, T);
2346 17For every pointer to member type T, there exist candidate operator
2347 functions of the form
2348 bool operator==(T, T);
2349 bool operator!=(T, T); */
2352 if (TYPE_PTROB_P (type1) && TYPE_PTROB_P (type2))
2354 if (TYPE_PTROB_P (type1)
2355 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2357 type2 = ptrdiff_type_node;
2361 case TRUNC_DIV_EXPR:
2362 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2368 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2369 || (TYPE_PTRMEM_P (type1) && TYPE_PTRMEM_P (type2)))
2371 if (TYPE_PTR_TO_MEMBER_P (type1) && null_ptr_cst_p (args[1]))
2376 if (TYPE_PTR_TO_MEMBER_P (type2) && null_ptr_cst_p (args[0]))
2388 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2390 if (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2392 if (TREE_CODE (type1) == ENUMERAL_TYPE
2393 && TREE_CODE (type2) == ENUMERAL_TYPE)
2395 if (TYPE_PTR_P (type1)
2396 && null_ptr_cst_p (args[1])
2397 && !uses_template_parms (type1))
2402 if (null_ptr_cst_p (args[0])
2403 && TYPE_PTR_P (type2)
2404 && !uses_template_parms (type2))
2412 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2415 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && TYPE_PTROB_P (type2))
2417 type1 = ptrdiff_type_node;
2420 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2422 type2 = ptrdiff_type_node;
2427 /* 18For every pair of promoted integral types L and R, there exist candi-
2428 date operator functions of the form
2435 where LR is the result of the usual arithmetic conversions between
2438 case TRUNC_MOD_EXPR:
2444 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2448 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2449 type, VQ is either volatile or empty, and R is a promoted arithmetic
2450 type, there exist candidate operator functions of the form
2451 VQ L& operator=(VQ L&, R);
2452 VQ L& operator*=(VQ L&, R);
2453 VQ L& operator/=(VQ L&, R);
2454 VQ L& operator+=(VQ L&, R);
2455 VQ L& operator-=(VQ L&, R);
2457 20For every pair T, VQ), where T is any type and VQ is either volatile
2458 or empty, there exist candidate operator functions of the form
2459 T*VQ& operator=(T*VQ&, T*);
2461 21For every pair T, VQ), where T is a pointer to member type and VQ is
2462 either volatile or empty, there exist candidate operator functions of
2464 VQ T& operator=(VQ T&, T);
2466 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2467 unqualified complete object type, VQ is either volatile or empty, and
2468 I is a promoted integral type, there exist candidate operator func-
2470 T*VQ& operator+=(T*VQ&, I);
2471 T*VQ& operator-=(T*VQ&, I);
2473 23For every triple L, VQ, R), where L is an integral or enumeration
2474 type, VQ is either volatile or empty, and R is a promoted integral
2475 type, there exist candidate operator functions of the form
2477 VQ L& operator%=(VQ L&, R);
2478 VQ L& operator<<=(VQ L&, R);
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); */
2489 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2491 type2 = ptrdiff_type_node;
2495 case TRUNC_DIV_EXPR:
2496 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2500 case TRUNC_MOD_EXPR:
2506 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2511 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2513 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2514 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2515 || (TYPE_PTRMEM_P (type1) && TYPE_PTRMEM_P (type2))
2516 || ((TYPE_PTRMEMFUNC_P (type1)
2517 || TREE_CODE (type1) == POINTER_TYPE)
2518 && null_ptr_cst_p (args[1])))
2528 type1 = build_reference_type (type1);
2534 For every pair of promoted arithmetic types L and R, there
2535 exist candidate operator functions of the form
2537 LR operator?(bool, L, R);
2539 where LR is the result of the usual arithmetic conversions
2540 between types L and R.
2542 For every type T, where T is a pointer or pointer-to-member
2543 type, there exist candidate operator functions of the form T
2544 operator?(bool, T, T); */
2546 if (promoted_arithmetic_type_p (type1)
2547 && promoted_arithmetic_type_p (type2))
2551 /* Otherwise, the types should be pointers. */
2552 if (!(TYPE_PTR_P (type1) || TYPE_PTR_TO_MEMBER_P (type1))
2553 || !(TYPE_PTR_P (type2) || TYPE_PTR_TO_MEMBER_P (type2)))
2556 /* We don't check that the two types are the same; the logic
2557 below will actually create two candidates; one in which both
2558 parameter types are TYPE1, and one in which both parameter
2564 if (ARITHMETIC_TYPE_P (type1))
2572 /* If we're dealing with two pointer types or two enumeral types,
2573 we need candidates for both of them. */
2574 if (type2 && !same_type_p (type1, type2)
2575 && TREE_CODE (type1) == TREE_CODE (type2)
2576 && (TREE_CODE (type1) == REFERENCE_TYPE
2577 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2578 || (TYPE_PTRMEM_P (type1) && TYPE_PTRMEM_P (type2))
2579 || TYPE_PTRMEMFUNC_P (type1)
2580 || MAYBE_CLASS_TYPE_P (type1)
2581 || TREE_CODE (type1) == ENUMERAL_TYPE))
2583 if (TYPE_PTR_P (type1) || TYPE_PTR_TO_MEMBER_P (type1))
2585 tree cptype = composite_pointer_type (type1, type2,
2590 if (cptype != error_mark_node)
2592 build_builtin_candidate
2593 (candidates, fnname, cptype, cptype, args, argtypes, flags);
2598 build_builtin_candidate
2599 (candidates, fnname, type1, type1, args, argtypes, flags);
2600 build_builtin_candidate
2601 (candidates, fnname, type2, type2, args, argtypes, flags);
2605 build_builtin_candidate
2606 (candidates, fnname, type1, type2, args, argtypes, flags);
2610 type_decays_to (tree type)
2612 if (TREE_CODE (type) == ARRAY_TYPE)
2613 return build_pointer_type (TREE_TYPE (type));
2614 if (TREE_CODE (type) == FUNCTION_TYPE)
2615 return build_pointer_type (type);
2619 /* There are three conditions of builtin candidates:
2621 1) bool-taking candidates. These are the same regardless of the input.
2622 2) pointer-pair taking candidates. These are generated for each type
2623 one of the input types converts to.
2624 3) arithmetic candidates. According to the standard, we should generate
2625 all of these, but I'm trying not to...
2627 Here we generate a superset of the possible candidates for this particular
2628 case. That is a subset of the full set the standard defines, plus some
2629 other cases which the standard disallows. add_builtin_candidate will
2630 filter out the invalid set. */
2633 add_builtin_candidates (struct z_candidate **candidates, enum tree_code code,
2634 enum tree_code code2, tree fnname, tree *args,
2639 tree type, argtypes[3], t;
2640 /* TYPES[i] is the set of possible builtin-operator parameter types
2641 we will consider for the Ith argument. */
2642 VEC(tree,gc) *types[2];
2645 for (i = 0; i < 3; ++i)
2648 argtypes[i] = unlowered_expr_type (args[i]);
2650 argtypes[i] = NULL_TREE;
2655 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2656 and VQ is either volatile or empty, there exist candidate operator
2657 functions of the form
2658 VQ T& operator++(VQ T&); */
2660 case POSTINCREMENT_EXPR:
2661 case PREINCREMENT_EXPR:
2662 case POSTDECREMENT_EXPR:
2663 case PREDECREMENT_EXPR:
2668 /* 24There also exist candidate operator functions of the form
2669 bool operator!(bool);
2670 bool operator&&(bool, bool);
2671 bool operator||(bool, bool); */
2673 case TRUTH_NOT_EXPR:
2674 build_builtin_candidate
2675 (candidates, fnname, boolean_type_node,
2676 NULL_TREE, args, argtypes, flags);
2679 case TRUTH_ORIF_EXPR:
2680 case TRUTH_ANDIF_EXPR:
2681 build_builtin_candidate
2682 (candidates, fnname, boolean_type_node,
2683 boolean_type_node, args, argtypes, flags);
2705 types[0] = make_tree_vector ();
2706 types[1] = make_tree_vector ();
2708 for (i = 0; i < 2; ++i)
2712 else if (MAYBE_CLASS_TYPE_P (argtypes[i]))
2716 if (i == 0 && code == MODIFY_EXPR && code2 == NOP_EXPR)
2719 convs = lookup_conversions (argtypes[i]);
2721 if (code == COND_EXPR)
2723 if (real_lvalue_p (args[i]))
2724 VEC_safe_push (tree, gc, types[i],
2725 build_reference_type (argtypes[i]));
2727 VEC_safe_push (tree, gc, types[i],
2728 TYPE_MAIN_VARIANT (argtypes[i]));
2734 for (; convs; convs = TREE_CHAIN (convs))
2736 type = TREE_TYPE (convs);
2739 && (TREE_CODE (type) != REFERENCE_TYPE
2740 || CP_TYPE_CONST_P (TREE_TYPE (type))))
2743 if (code == COND_EXPR && TREE_CODE (type) == REFERENCE_TYPE)
2744 VEC_safe_push (tree, gc, types[i], type);
2746 type = non_reference (type);
2747 if (i != 0 || ! ref1)
2749 type = cv_unqualified (type_decays_to (type));
2750 if (enum_p && TREE_CODE (type) == ENUMERAL_TYPE)
2751 VEC_safe_push (tree, gc, types[i], type);
2752 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
2753 type = type_promotes_to (type);
2756 if (! vec_member (type, types[i]))
2757 VEC_safe_push (tree, gc, types[i], type);
2762 if (code == COND_EXPR && real_lvalue_p (args[i]))
2763 VEC_safe_push (tree, gc, types[i],
2764 build_reference_type (argtypes[i]));
2765 type = non_reference (argtypes[i]);
2766 if (i != 0 || ! ref1)
2768 type = cv_unqualified (type_decays_to (type));
2769 if (enum_p && UNSCOPED_ENUM_P (type))
2770 VEC_safe_push (tree, gc, types[i], type);
2771 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
2772 type = type_promotes_to (type);
2774 VEC_safe_push (tree, gc, types[i], type);
2778 /* Run through the possible parameter types of both arguments,
2779 creating candidates with those parameter types. */
2780 FOR_EACH_VEC_ELT_REVERSE (tree, types[0], ix, t)
2785 if (!VEC_empty (tree, types[1]))
2786 FOR_EACH_VEC_ELT_REVERSE (tree, types[1], jx, u)
2787 add_builtin_candidate
2788 (candidates, code, code2, fnname, t,
2789 u, args, argtypes, flags);
2791 add_builtin_candidate
2792 (candidates, code, code2, fnname, t,
2793 NULL_TREE, args, argtypes, flags);
2796 release_tree_vector (types[0]);
2797 release_tree_vector (types[1]);
2801 /* If TMPL can be successfully instantiated as indicated by
2802 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2804 TMPL is the template. EXPLICIT_TARGS are any explicit template
2805 arguments. ARGLIST is the arguments provided at the call-site.
2806 This does not change ARGLIST. The RETURN_TYPE is the desired type
2807 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
2808 as for add_function_candidate. If an OBJ is supplied, FLAGS and
2809 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
2811 static struct z_candidate*
2812 add_template_candidate_real (struct z_candidate **candidates, tree tmpl,
2813 tree ctype, tree explicit_targs, tree first_arg,
2814 const VEC(tree,gc) *arglist, tree return_type,
2815 tree access_path, tree conversion_path,
2816 int flags, tree obj, unification_kind_t strict)
2818 int ntparms = DECL_NTPARMS (tmpl);
2819 tree targs = make_tree_vec (ntparms);
2820 unsigned int len = VEC_length (tree, arglist);
2821 unsigned int nargs = (first_arg == NULL_TREE ? 0 : 1) + len;
2822 unsigned int skip_without_in_chrg = 0;
2823 tree first_arg_without_in_chrg = first_arg;
2824 tree *args_without_in_chrg;
2825 unsigned int nargs_without_in_chrg;
2826 unsigned int ia, ix;
2828 struct z_candidate *cand;
2831 struct rejection_reason *reason = NULL;
2834 /* We don't do deduction on the in-charge parameter, the VTT
2835 parameter or 'this'. */
2836 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl))
2838 if (first_arg_without_in_chrg != NULL_TREE)
2839 first_arg_without_in_chrg = NULL_TREE;
2841 ++skip_without_in_chrg;
2844 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl)
2845 || DECL_BASE_CONSTRUCTOR_P (tmpl))
2846 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl)))
2848 if (first_arg_without_in_chrg != NULL_TREE)
2849 first_arg_without_in_chrg = NULL_TREE;
2851 ++skip_without_in_chrg;
2854 if (len < skip_without_in_chrg)
2857 nargs_without_in_chrg = ((first_arg_without_in_chrg != NULL_TREE ? 1 : 0)
2858 + (len - skip_without_in_chrg));
2859 args_without_in_chrg = XALLOCAVEC (tree, nargs_without_in_chrg);
2861 if (first_arg_without_in_chrg != NULL_TREE)
2863 args_without_in_chrg[ia] = first_arg_without_in_chrg;
2866 for (ix = skip_without_in_chrg;
2867 VEC_iterate (tree, arglist, ix, arg);
2870 args_without_in_chrg[ia] = arg;
2873 gcc_assert (ia == nargs_without_in_chrg);
2875 errs = errorcount+sorrycount;
2876 i = fn_type_unification (tmpl, explicit_targs, targs,
2877 args_without_in_chrg,
2878 nargs_without_in_chrg,
2879 return_type, strict, flags, false);
2883 /* Don't repeat unification later if it already resulted in errors. */
2884 if (errorcount+sorrycount == errs)
2885 reason = template_unification_rejection (tmpl, explicit_targs,
2886 targs, args_without_in_chrg,
2887 nargs_without_in_chrg,
2888 return_type, strict, flags);
2890 reason = template_unification_error_rejection ();
2894 fn = instantiate_template (tmpl, targs, tf_none);
2895 if (fn == error_mark_node)
2897 reason = template_instantiation_rejection (tmpl, targs);
2903 A member function template is never instantiated to perform the
2904 copy of a class object to an object of its class type.
2906 It's a little unclear what this means; the standard explicitly
2907 does allow a template to be used to copy a class. For example,
2912 template <class T> A(const T&);
2915 void g () { A a (f ()); }
2917 the member template will be used to make the copy. The section
2918 quoted above appears in the paragraph that forbids constructors
2919 whose only parameter is (a possibly cv-qualified variant of) the
2920 class type, and a logical interpretation is that the intent was
2921 to forbid the instantiation of member templates which would then
2923 if (DECL_CONSTRUCTOR_P (fn) && nargs == 2)
2925 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (fn);
2926 if (arg_types && same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types)),
2929 reason = invalid_copy_with_fn_template_rejection ();
2934 if (obj != NULL_TREE)
2935 /* Aha, this is a conversion function. */
2936 cand = add_conv_candidate (candidates, fn, obj, first_arg, arglist,
2937 access_path, conversion_path);
2939 cand = add_function_candidate (candidates, fn, ctype,
2940 first_arg, arglist, access_path,
2941 conversion_path, flags);
2942 if (DECL_TI_TEMPLATE (fn) != tmpl)
2943 /* This situation can occur if a member template of a template
2944 class is specialized. Then, instantiate_template might return
2945 an instantiation of the specialization, in which case the
2946 DECL_TI_TEMPLATE field will point at the original
2947 specialization. For example:
2949 template <class T> struct S { template <class U> void f(U);
2950 template <> void f(int) {}; };
2954 Here, TMPL will be template <class U> S<double>::f(U).
2955 And, instantiate template will give us the specialization
2956 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
2957 for this will point at template <class T> template <> S<T>::f(int),
2958 so that we can find the definition. For the purposes of
2959 overload resolution, however, we want the original TMPL. */
2960 cand->template_decl = build_template_info (tmpl, targs);
2962 cand->template_decl = DECL_TEMPLATE_INFO (fn);
2963 cand->explicit_targs = explicit_targs;
2967 return add_candidate (candidates, tmpl, first_arg, arglist, nargs, NULL,
2968 access_path, conversion_path, 0, reason);
2972 static struct z_candidate *
2973 add_template_candidate (struct z_candidate **candidates, tree tmpl, tree ctype,
2974 tree explicit_targs, tree first_arg,
2975 const VEC(tree,gc) *arglist, tree return_type,
2976 tree access_path, tree conversion_path, int flags,
2977 unification_kind_t strict)
2980 add_template_candidate_real (candidates, tmpl, ctype,
2981 explicit_targs, first_arg, arglist,
2982 return_type, access_path, conversion_path,
2983 flags, NULL_TREE, strict);
2987 static struct z_candidate *
2988 add_template_conv_candidate (struct z_candidate **candidates, tree tmpl,
2989 tree obj, tree first_arg,
2990 const VEC(tree,gc) *arglist,
2991 tree return_type, tree access_path,
2992 tree conversion_path)
2995 add_template_candidate_real (candidates, tmpl, NULL_TREE, NULL_TREE,
2996 first_arg, arglist, return_type, access_path,
2997 conversion_path, 0, obj, DEDUCE_CONV);
3000 /* The CANDS are the set of candidates that were considered for
3001 overload resolution. Return the set of viable candidates, or CANDS
3002 if none are viable. If any of the candidates were viable, set
3003 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3004 considered viable only if it is strictly viable. */
3006 static struct z_candidate*
3007 splice_viable (struct z_candidate *cands,
3011 struct z_candidate *viable;
3012 struct z_candidate **last_viable;
3013 struct z_candidate **cand;
3015 /* Be strict inside templates, since build_over_call won't actually
3016 do the conversions to get pedwarns. */
3017 if (processing_template_decl)
3021 last_viable = &viable;
3022 *any_viable_p = false;
3027 struct z_candidate *c = *cand;
3028 if (strict_p ? c->viable == 1 : c->viable)
3033 last_viable = &c->next;
3034 *any_viable_p = true;
3040 return viable ? viable : cands;
3044 any_strictly_viable (struct z_candidate *cands)
3046 for (; cands; cands = cands->next)
3047 if (cands->viable == 1)
3052 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3053 words, it is about to become the "this" pointer for a member
3054 function call. Take the address of the object. */
3057 build_this (tree obj)
3059 /* In a template, we are only concerned about the type of the
3060 expression, so we can take a shortcut. */
3061 if (processing_template_decl)
3062 return build_address (obj);
3064 return cp_build_addr_expr (obj, tf_warning_or_error);
3067 /* Returns true iff functions are equivalent. Equivalent functions are
3068 not '==' only if one is a function-local extern function or if
3069 both are extern "C". */
3072 equal_functions (tree fn1, tree fn2)
3074 if (TREE_CODE (fn1) != TREE_CODE (fn2))
3076 if (TREE_CODE (fn1) == TEMPLATE_DECL)
3078 if (DECL_LOCAL_FUNCTION_P (fn1) || DECL_LOCAL_FUNCTION_P (fn2)
3079 || DECL_EXTERN_C_FUNCTION_P (fn1))
3080 return decls_match (fn1, fn2);
3084 /* Print information about a candidate being rejected due to INFO. */
3087 print_conversion_rejection (location_t loc, struct conversion_info *info)
3089 if (info->n_arg == -1)
3090 /* Conversion of implicit `this' argument failed. */
3091 inform (loc, " no known conversion for implicit "
3092 "%<this%> parameter from %qT to %qT",
3093 info->from_type, info->to_type);
3095 inform (loc, " no known conversion for argument %d from %qT to %qT",
3096 info->n_arg+1, info->from_type, info->to_type);
3099 /* Print information about a candidate with WANT parameters and we found
3103 print_arity_information (location_t loc, unsigned int have, unsigned int want)
3105 inform_n (loc, want,
3106 " candidate expects %d argument, %d provided",
3107 " candidate expects %d arguments, %d provided",
3111 /* Print information about one overload candidate CANDIDATE. MSGSTR
3112 is the text to print before the candidate itself.
3114 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3115 to have been run through gettext by the caller. This wart makes
3116 life simpler in print_z_candidates and for the translators. */
3119 print_z_candidate (const char *msgstr, struct z_candidate *candidate)
3121 const char *msg = (msgstr == NULL
3123 : ACONCAT ((msgstr, " ", NULL)));
3124 location_t loc = location_of (candidate->fn);
3126 if (TREE_CODE (candidate->fn) == IDENTIFIER_NODE)
3128 if (candidate->num_convs == 3)
3129 inform (input_location, "%s%D(%T, %T, %T) <built-in>", msg, candidate->fn,
3130 candidate->convs[0]->type,
3131 candidate->convs[1]->type,
3132 candidate->convs[2]->type);
3133 else if (candidate->num_convs == 2)
3134 inform (input_location, "%s%D(%T, %T) <built-in>", msg, candidate->fn,
3135 candidate->convs[0]->type,
3136 candidate->convs[1]->type);
3138 inform (input_location, "%s%D(%T) <built-in>", msg, candidate->fn,
3139 candidate->convs[0]->type);
3141 else if (TYPE_P (candidate->fn))
3142 inform (input_location, "%s%T <conversion>", msg, candidate->fn);
3143 else if (candidate->viable == -1)
3144 inform (loc, "%s%#D <near match>", msg, candidate->fn);
3145 else if (DECL_DELETED_FN (STRIP_TEMPLATE (candidate->fn)))
3146 inform (loc, "%s%#D <deleted>", msg, candidate->fn);
3148 inform (loc, "%s%#D", msg, candidate->fn);
3149 /* Give the user some information about why this candidate failed. */
3150 if (candidate->reason != NULL)
3152 struct rejection_reason *r = candidate->reason;
3157 print_arity_information (loc, r->u.arity.actual,
3158 r->u.arity.expected);
3160 case rr_arg_conversion:
3161 print_conversion_rejection (loc, &r->u.conversion);
3163 case rr_bad_arg_conversion:
3164 print_conversion_rejection (loc, &r->u.bad_conversion);
3166 case rr_explicit_conversion:
3167 inform (loc, " return type %qT of explicit conversion function "
3168 "cannot be converted to %qT with a qualification "
3169 "conversion", r->u.conversion.from_type,
3170 r->u.conversion.to_type);
3172 case rr_template_conversion:
3173 inform (loc, " conversion from return type %qT of template "
3174 "conversion function specialization to %qT is not an "
3175 "exact match", r->u.conversion.from_type,
3176 r->u.conversion.to_type);
3178 case rr_template_unification:
3179 /* We use template_unification_error_rejection if unification caused
3180 actual non-SFINAE errors, in which case we don't need to repeat
3182 if (r->u.template_unification.tmpl == NULL_TREE)
3184 inform (loc, " substitution of deduced template arguments "
3185 "resulted in errors seen above");
3188 /* Re-run template unification with diagnostics. */
3189 inform (loc, " template argument deduction/substitution failed:");
3190 fn_type_unification (r->u.template_unification.tmpl,
3191 r->u.template_unification.explicit_targs,
3192 r->u.template_unification.targs,
3193 r->u.template_unification.args,
3194 r->u.template_unification.nargs,
3195 r->u.template_unification.return_type,
3196 r->u.template_unification.strict,
3197 r->u.template_unification.flags,
3200 case rr_template_instantiation:
3201 /* Re-run template instantiation with diagnostics. */
3202 instantiate_template (r->u.template_instantiation.tmpl,
3203 r->u.template_instantiation.targs,
3204 tf_warning_or_error);
3206 case rr_invalid_copy:
3208 " a constructor taking a single argument of its own "
3209 "class type is invalid");
3213 /* This candidate didn't have any issues or we failed to
3214 handle a particular code. Either way... */
3221 print_z_candidates (location_t loc, struct z_candidate *candidates)
3223 struct z_candidate *cand1;
3224 struct z_candidate **cand2;
3230 /* Remove non-viable deleted candidates. */
3232 for (cand2 = &cand1; *cand2; )
3234 if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL
3235 && !(*cand2)->viable
3236 && DECL_DELETED_FN ((*cand2)->fn))
3237 *cand2 = (*cand2)->next;
3239 cand2 = &(*cand2)->next;
3241 /* ...if there are any non-deleted ones. */
3245 /* There may be duplicates in the set of candidates. We put off
3246 checking this condition as long as possible, since we have no way
3247 to eliminate duplicates from a set of functions in less than n^2
3248 time. Now we are about to emit an error message, so it is more
3249 permissible to go slowly. */
3250 for (cand1 = candidates; cand1; cand1 = cand1->next)
3252 tree fn = cand1->fn;
3253 /* Skip builtin candidates and conversion functions. */
3256 cand2 = &cand1->next;
3259 if (DECL_P ((*cand2)->fn)
3260 && equal_functions (fn, (*cand2)->fn))
3261 *cand2 = (*cand2)->next;
3263 cand2 = &(*cand2)->next;
3267 for (n_candidates = 0, cand1 = candidates; cand1; cand1 = cand1->next)
3270 inform_n (loc, n_candidates, "candidate is:", "candidates are:");
3271 for (; candidates; candidates = candidates->next)
3272 print_z_candidate (NULL, candidates);
3275 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3276 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3277 the result of the conversion function to convert it to the final
3278 desired type. Merge the two sequences into a single sequence,
3279 and return the merged sequence. */
3282 merge_conversion_sequences (conversion *user_seq, conversion *std_seq)
3285 bool bad = user_seq->bad_p;
3287 gcc_assert (user_seq->kind == ck_user);
3289 /* Find the end of the second conversion sequence. */
3290 for (t = &std_seq; (*t)->kind != ck_identity; t = &((*t)->u.next))
3292 /* The entire sequence is a user-conversion sequence. */
3293 (*t)->user_conv_p = true;
3298 /* Replace the identity conversion with the user conversion
3305 /* Handle overload resolution for initializing an object of class type from
3306 an initializer list. First we look for a suitable constructor that
3307 takes a std::initializer_list; if we don't find one, we then look for a
3308 non-list constructor.
3310 Parameters are as for add_candidates, except that the arguments are in
3311 the form of a CONSTRUCTOR (the initializer list) rather than a VEC, and
3312 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3315 add_list_candidates (tree fns, tree first_arg,
3316 tree init_list, tree totype,
3317 tree explicit_targs, bool template_only,
3318 tree conversion_path, tree access_path,
3320 struct z_candidate **candidates)
3324 gcc_assert (*candidates == NULL);
3326 /* For list-initialization we consider explicit constructors, but
3327 give an error if one is selected. */
3328 flags &= ~LOOKUP_ONLYCONVERTING;
3329 /* And we don't allow narrowing conversions. We also use this flag to
3330 avoid the copy constructor call for copy-list-initialization. */
3331 flags |= LOOKUP_NO_NARROWING;
3333 /* Always use the default constructor if the list is empty (DR 990). */
3334 if (CONSTRUCTOR_NELTS (init_list) == 0
3335 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
3337 /* If the class has a list ctor, try passing the list as a single
3338 argument first, but only consider list ctors. */
3339 else if (TYPE_HAS_LIST_CTOR (totype))
3341 flags |= LOOKUP_LIST_ONLY;
3342 args = make_tree_vector_single (init_list);
3343 add_candidates (fns, first_arg, args, NULL_TREE,
3344 explicit_targs, template_only, conversion_path,
3345 access_path, flags, candidates);
3346 if (any_strictly_viable (*candidates))
3350 args = ctor_to_vec (init_list);
3352 /* We aren't looking for list-ctors anymore. */
3353 flags &= ~LOOKUP_LIST_ONLY;
3354 /* We allow more user-defined conversions within an init-list. */
3355 flags &= ~LOOKUP_NO_CONVERSION;
3356 /* But not for the copy ctor. */
3357 flags |= LOOKUP_NO_COPY_CTOR_CONVERSION;
3359 add_candidates (fns, first_arg, args, NULL_TREE,
3360 explicit_targs, template_only, conversion_path,
3361 access_path, flags, candidates);
3364 /* Returns the best overload candidate to perform the requested
3365 conversion. This function is used for three the overloading situations
3366 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3367 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3368 per [dcl.init.ref], so we ignore temporary bindings. */
3370 static struct z_candidate *
3371 build_user_type_conversion_1 (tree totype, tree expr, int flags)
3373 struct z_candidate *candidates, *cand;
3375 tree ctors = NULL_TREE;
3376 tree conv_fns = NULL_TREE;
3377 conversion *conv = NULL;
3378 tree first_arg = NULL_TREE;
3379 VEC(tree,gc) *args = NULL;
3386 fromtype = TREE_TYPE (expr);
3388 /* We represent conversion within a hierarchy using RVALUE_CONV and
3389 BASE_CONV, as specified by [over.best.ics]; these become plain
3390 constructor calls, as specified in [dcl.init]. */
3391 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype) || !MAYBE_CLASS_TYPE_P (totype)
3392 || !DERIVED_FROM_P (totype, fromtype));
3394 if (MAYBE_CLASS_TYPE_P (totype))
3395 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3396 creating a garbage BASELINK; constructors can't be inherited. */
3397 ctors = lookup_fnfields_slot (totype, complete_ctor_identifier);
3399 if (MAYBE_CLASS_TYPE_P (fromtype))
3401 tree to_nonref = non_reference (totype);
3402 if (same_type_ignoring_top_level_qualifiers_p (to_nonref, fromtype) ||
3403 (CLASS_TYPE_P (to_nonref) && CLASS_TYPE_P (fromtype)
3404 && DERIVED_FROM_P (to_nonref, fromtype)))
3406 /* [class.conv.fct] A conversion function is never used to
3407 convert a (possibly cv-qualified) object to the (possibly
3408 cv-qualified) same object type (or a reference to it), to a
3409 (possibly cv-qualified) base class of that type (or a
3410 reference to it)... */
3413 conv_fns = lookup_conversions (fromtype);
3417 flags |= LOOKUP_NO_CONVERSION;
3418 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3419 flags |= LOOKUP_NO_NARROWING;
3421 /* It's OK to bind a temporary for converting constructor arguments, but
3422 not in converting the return value of a conversion operator. */
3423 convflags = ((flags & LOOKUP_NO_TEMP_BIND) | LOOKUP_NO_CONVERSION);
3424 flags &= ~LOOKUP_NO_TEMP_BIND;
3428 int ctorflags = flags;
3430 first_arg = build_int_cst (build_pointer_type (totype), 0);
3432 /* We should never try to call the abstract or base constructor
3434 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors))
3435 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors)));
3437 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3439 /* List-initialization. */
3440 add_list_candidates (ctors, first_arg, expr, totype, NULL_TREE,
3441 false, TYPE_BINFO (totype), TYPE_BINFO (totype),
3442 ctorflags, &candidates);
3446 args = make_tree_vector_single (expr);
3447 add_candidates (ctors, first_arg, args, NULL_TREE, NULL_TREE, false,
3448 TYPE_BINFO (totype), TYPE_BINFO (totype),
3449 ctorflags, &candidates);
3452 for (cand = candidates; cand; cand = cand->next)
3454 cand->second_conv = build_identity_conv (totype, NULL_TREE);
3456 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3457 set, then this is copy-initialization. In that case, "The
3458 result of the call is then used to direct-initialize the
3459 object that is the destination of the copy-initialization."
3462 We represent this in the conversion sequence with an
3463 rvalue conversion, which means a constructor call. */
3464 if (TREE_CODE (totype) != REFERENCE_TYPE
3465 && !(convflags & LOOKUP_NO_TEMP_BIND))
3467 = build_conv (ck_rvalue, totype, cand->second_conv);
3472 first_arg = build_this (expr);
3474 for (; conv_fns; conv_fns = TREE_CHAIN (conv_fns))
3476 tree conversion_path = TREE_PURPOSE (conv_fns);
3477 struct z_candidate *old_candidates;
3479 /* If we are called to convert to a reference type, we are trying to
3480 find a direct binding, so don't even consider temporaries. If
3481 we don't find a direct binding, the caller will try again to
3482 look for a temporary binding. */
3483 if (TREE_CODE (totype) == REFERENCE_TYPE)
3484 convflags |= LOOKUP_NO_TEMP_BIND;
3486 old_candidates = candidates;
3487 add_candidates (TREE_VALUE (conv_fns), first_arg, NULL, totype,
3489 conversion_path, TYPE_BINFO (fromtype),
3490 flags, &candidates);
3492 for (cand = candidates; cand != old_candidates; cand = cand->next)
3494 tree rettype = TREE_TYPE (TREE_TYPE (cand->fn));
3496 = implicit_conversion (totype,
3499 /*c_cast_p=*/false, convflags);
3501 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3502 copy-initialization. In that case, "The result of the
3503 call is then used to direct-initialize the object that is
3504 the destination of the copy-initialization." [dcl.init]
3506 We represent this in the conversion sequence with an
3507 rvalue conversion, which means a constructor call. But
3508 don't add a second rvalue conversion if there's already
3509 one there. Which there really shouldn't be, but it's
3510 harmless since we'd add it here anyway. */
3511 if (ics && MAYBE_CLASS_TYPE_P (totype) && ics->kind != ck_rvalue
3512 && !(convflags & LOOKUP_NO_TEMP_BIND))
3513 ics = build_conv (ck_rvalue, totype, ics);
3515 cand->second_conv = ics;
3520 cand->reason = arg_conversion_rejection (NULL_TREE, -1,
3523 else if (DECL_NONCONVERTING_P (cand->fn)
3524 && ics->rank > cr_exact)
3526 /* 13.3.1.5: For direct-initialization, those explicit
3527 conversion functions that are not hidden within S and
3528 yield type T or a type that can be converted to type T
3529 with a qualification conversion (4.4) are also candidate
3531 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3532 I've raised this issue with the committee. --jason 9/2011 */
3534 cand->reason = explicit_conversion_rejection (rettype, totype);
3536 else if (cand->viable == 1 && ics->bad_p)
3540 = bad_arg_conversion_rejection (NULL_TREE, -1,
3543 else if (primary_template_instantiation_p (cand->fn)
3544 && ics->rank > cr_exact)
3546 /* 13.3.3.1.2: If the user-defined conversion is specified by
3547 a specialization of a conversion function template, the
3548 second standard conversion sequence shall have exact match
3551 cand->reason = template_conversion_rejection (rettype, totype);
3556 candidates = splice_viable (candidates, pedantic, &any_viable_p);
3560 release_tree_vector (args);
3564 cand = tourney (candidates);
3567 if (flags & LOOKUP_COMPLAIN)
3569 error ("conversion from %qT to %qT is ambiguous",
3571 print_z_candidates (location_of (expr), candidates);
3574 cand = candidates; /* any one will do */
3575 cand->second_conv = build_ambiguous_conv (totype, expr);
3576 cand->second_conv->user_conv_p = true;
3577 if (!any_strictly_viable (candidates))
3578 cand->second_conv->bad_p = true;
3579 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3580 ambiguous conversion is no worse than another user-defined
3586 /* Build the user conversion sequence. */
3589 (DECL_CONSTRUCTOR_P (cand->fn)
3590 ? totype : non_reference (TREE_TYPE (TREE_TYPE (cand->fn)))),
3591 build_identity_conv (TREE_TYPE (expr), expr));
3593 if (cand->viable == -1)
3596 /* Remember that this was a list-initialization. */
3597 if (flags & LOOKUP_NO_NARROWING)
3598 conv->check_narrowing = true;
3600 /* Combine it with the second conversion sequence. */
3601 cand->second_conv = merge_conversion_sequences (conv,
3607 /* Wrapper for above. */
3610 build_user_type_conversion (tree totype, tree expr, int flags)
3612 struct z_candidate *cand;
3615 bool subtime = timevar_cond_start (TV_OVERLOAD);
3616 cand = build_user_type_conversion_1 (totype, expr, flags);
3620 if (cand->second_conv->kind == ck_ambig)
3621 ret = error_mark_node;
3624 expr = convert_like (cand->second_conv, expr, tf_warning_or_error);
3625 ret = convert_from_reference (expr);
3631 timevar_cond_stop (TV_OVERLOAD, subtime);
3635 /* Subroutine of convert_nontype_argument.
3637 EXPR is an argument for a template non-type parameter of integral or
3638 enumeration type. Do any necessary conversions (that are permitted for
3639 non-type arguments) to convert it to the parameter type.
3641 If conversion is successful, returns the converted expression;
3642 otherwise, returns error_mark_node. */
3645 build_integral_nontype_arg_conv (tree type, tree expr, tsubst_flags_t complain)
3651 if (error_operand_p (expr))
3652 return error_mark_node;
3654 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
3656 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3657 p = conversion_obstack_alloc (0);
3659 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
3663 /* for a non-type template-parameter of integral or
3664 enumeration type, integral promotions (4.5) and integral
3665 conversions (4.7) are applied. */
3666 /* It should be sufficient to check the outermost conversion step, since
3667 there are no qualification conversions to integer type. */
3671 /* A conversion function is OK. If it isn't constexpr, we'll
3672 complain later that the argument isn't constant. */
3674 /* The lvalue-to-rvalue conversion is OK. */
3680 t = conv->u.next->type;
3681 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t))
3684 if (complain & tf_error)
3685 error ("conversion from %qT to %qT not considered for "
3686 "non-type template argument", t, type);
3687 /* and fall through. */
3695 expr = convert_like (conv, expr, complain);
3697 expr = error_mark_node;
3699 /* Free all the conversions we allocated. */
3700 obstack_free (&conversion_obstack, p);
3705 /* Do any initial processing on the arguments to a function call. */
3707 static VEC(tree,gc) *
3708 resolve_args (VEC(tree,gc) *args, tsubst_flags_t complain)
3713 FOR_EACH_VEC_ELT (tree, args, ix, arg)
3715 if (error_operand_p (arg))
3717 else if (VOID_TYPE_P (TREE_TYPE (arg)))
3719 if (complain & tf_error)
3720 error ("invalid use of void expression");
3723 else if (invalid_nonstatic_memfn_p (arg, tf_warning_or_error))
3729 /* Perform overload resolution on FN, which is called with the ARGS.
3731 Return the candidate function selected by overload resolution, or
3732 NULL if the event that overload resolution failed. In the case
3733 that overload resolution fails, *CANDIDATES will be the set of
3734 candidates considered, and ANY_VIABLE_P will be set to true or
3735 false to indicate whether or not any of the candidates were
3738 The ARGS should already have gone through RESOLVE_ARGS before this
3739 function is called. */
3741 static struct z_candidate *
3742 perform_overload_resolution (tree fn,
3743 const VEC(tree,gc) *args,
3744 struct z_candidate **candidates,
3747 struct z_candidate *cand;
3748 tree explicit_targs;
3751 bool subtime = timevar_cond_start (TV_OVERLOAD);
3753 explicit_targs = NULL_TREE;
3757 *any_viable_p = true;
3760 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
3761 || TREE_CODE (fn) == TEMPLATE_DECL
3762 || TREE_CODE (fn) == OVERLOAD
3763 || TREE_CODE (fn) == TEMPLATE_ID_EXPR);
3765 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
3767 explicit_targs = TREE_OPERAND (fn, 1);
3768 fn = TREE_OPERAND (fn, 0);
3772 /* Add the various candidate functions. */
3773 add_candidates (fn, NULL_TREE, args, NULL_TREE,
3774 explicit_targs, template_only,
3775 /*conversion_path=*/NULL_TREE,
3776 /*access_path=*/NULL_TREE,
3780 *candidates = splice_viable (*candidates, pedantic, any_viable_p);
3782 cand = tourney (*candidates);
3786 timevar_cond_stop (TV_OVERLOAD, subtime);
3790 /* Print an error message about being unable to build a call to FN with
3791 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
3792 be located; CANDIDATES is a possibly empty list of such
3796 print_error_for_call_failure (tree fn, VEC(tree,gc) *args, bool any_viable_p,
3797 struct z_candidate *candidates)
3799 tree name = DECL_NAME (OVL_CURRENT (fn));
3800 location_t loc = location_of (name);
3803 error_at (loc, "no matching function for call to %<%D(%A)%>",
3804 name, build_tree_list_vec (args));
3806 error_at (loc, "call of overloaded %<%D(%A)%> is ambiguous",
3807 name, build_tree_list_vec (args));
3809 print_z_candidates (loc, candidates);
3812 /* Return an expression for a call to FN (a namespace-scope function,
3813 or a static member function) with the ARGS. This may change
3817 build_new_function_call (tree fn, VEC(tree,gc) **args, bool koenig_p,
3818 tsubst_flags_t complain)
3820 struct z_candidate *candidates, *cand;
3825 if (args != NULL && *args != NULL)
3827 *args = resolve_args (*args, complain);
3829 return error_mark_node;
3833 tm_malloc_replacement (fn);
3835 /* If this function was found without using argument dependent
3836 lookup, then we want to ignore any undeclared friend
3842 fn = remove_hidden_names (fn);
3845 if (complain & tf_error)
3846 print_error_for_call_failure (orig_fn, *args, false, NULL);
3847 return error_mark_node;
3851 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3852 p = conversion_obstack_alloc (0);
3854 cand = perform_overload_resolution (fn, *args, &candidates, &any_viable_p);
3858 if (complain & tf_error)
3860 if (!any_viable_p && candidates && ! candidates->next
3861 && (TREE_CODE (candidates->fn) == FUNCTION_DECL))
3862 return cp_build_function_call_vec (candidates->fn, args, complain);
3863 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
3864 fn = TREE_OPERAND (fn, 0);
3865 print_error_for_call_failure (fn, *args, any_viable_p, candidates);
3867 result = error_mark_node;
3871 int flags = LOOKUP_NORMAL;
3872 /* If fn is template_id_expr, the call has explicit template arguments
3873 (e.g. func<int>(5)), communicate this info to build_over_call
3874 through flags so that later we can use it to decide whether to warn
3875 about peculiar null pointer conversion. */
3876 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
3877 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
3878 result = build_over_call (cand, flags, complain);
3881 /* Free all the conversions we allocated. */
3882 obstack_free (&conversion_obstack, p);
3887 /* Build a call to a global operator new. FNNAME is the name of the
3888 operator (either "operator new" or "operator new[]") and ARGS are
3889 the arguments provided. This may change ARGS. *SIZE points to the
3890 total number of bytes required by the allocation, and is updated if
3891 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
3892 be used. If this function determines that no cookie should be
3893 used, after all, *COOKIE_SIZE is set to NULL_TREE. If FN is
3894 non-NULL, it will be set, upon return, to the allocation function
3898 build_operator_new_call (tree fnname, VEC(tree,gc) **args,
3899 tree *size, tree *cookie_size,
3903 struct z_candidate *candidates;
3904 struct z_candidate *cand;
3909 VEC_safe_insert (tree, gc, *args, 0, *size);
3910 *args = resolve_args (*args, tf_warning_or_error);
3912 return error_mark_node;
3918 If this lookup fails to find the name, or if the allocated type
3919 is not a class type, the allocation function's name is looked
3920 up in the global scope.
3922 we disregard block-scope declarations of "operator new". */
3923 fns = lookup_function_nonclass (fnname, *args, /*block_p=*/false);
3925 /* Figure out what function is being called. */
3926 cand = perform_overload_resolution (fns, *args, &candidates, &any_viable_p);
3928 /* If no suitable function could be found, issue an error message
3932 print_error_for_call_failure (fns, *args, any_viable_p, candidates);
3933 return error_mark_node;
3936 /* If a cookie is required, add some extra space. Whether
3937 or not a cookie is required cannot be determined until
3938 after we know which function was called. */
3941 bool use_cookie = true;
3942 if (!abi_version_at_least (2))
3944 /* In G++ 3.2, the check was implemented incorrectly; it
3945 looked at the placement expression, rather than the
3946 type of the function. */
3947 if (VEC_length (tree, *args) == 2
3948 && same_type_p (TREE_TYPE (VEC_index (tree, *args, 1)),
3956 arg_types = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
3957 /* Skip the size_t parameter. */
3958 arg_types = TREE_CHAIN (arg_types);
3959 /* Check the remaining parameters (if any). */
3961 && TREE_CHAIN (arg_types) == void_list_node
3962 && same_type_p (TREE_VALUE (arg_types),
3966 /* If we need a cookie, adjust the number of bytes allocated. */
3969 /* Update the total size. */
3970 *size = size_binop (PLUS_EXPR, *size, *cookie_size);
3971 /* Update the argument list to reflect the adjusted size. */
3972 VEC_replace (tree, *args, 0, *size);
3975 *cookie_size = NULL_TREE;
3978 /* Tell our caller which function we decided to call. */
3982 /* Build the CALL_EXPR. */
3983 return build_over_call (cand, LOOKUP_NORMAL, tf_warning_or_error);
3986 /* Build a new call to operator(). This may change ARGS. */
3989 build_op_call_1 (tree obj, VEC(tree,gc) **args, tsubst_flags_t complain)
3991 struct z_candidate *candidates = 0, *cand;
3992 tree fns, convs, first_mem_arg = NULL_TREE;
3993 tree type = TREE_TYPE (obj);
3995 tree result = NULL_TREE;
3998 if (error_operand_p (obj))
3999 return error_mark_node;
4001 obj = prep_operand (obj);
4003 if (TYPE_PTRMEMFUNC_P (type))
4005 if (complain & tf_error)
4006 /* It's no good looking for an overloaded operator() on a
4007 pointer-to-member-function. */
4008 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj);
4009 return error_mark_node;
4012 if (TYPE_BINFO (type))
4014 fns = lookup_fnfields (TYPE_BINFO (type), ansi_opname (CALL_EXPR), 1);
4015 if (fns == error_mark_node)
4016 return error_mark_node;
4021 if (args != NULL && *args != NULL)
4023 *args = resolve_args (*args, complain);
4025 return error_mark_node;
4028 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4029 p = conversion_obstack_alloc (0);
4033 first_mem_arg = build_this (obj);
4035 add_candidates (BASELINK_FUNCTIONS (fns),
4036 first_mem_arg, *args, NULL_TREE,
4038 BASELINK_BINFO (fns), BASELINK_ACCESS_BINFO (fns),
4039 LOOKUP_NORMAL, &candidates);
4042 convs = lookup_conversions (type);
4044 for (; convs; convs = TREE_CHAIN (convs))
4046 tree fns = TREE_VALUE (convs);
4047 tree totype = TREE_TYPE (convs);
4049 if ((TREE_CODE (totype) == POINTER_TYPE
4050 && TREE_CODE (TREE_TYPE (totype)) == FUNCTION_TYPE)
4051 || (TREE_CODE (totype) == REFERENCE_TYPE
4052 && TREE_CODE (TREE_TYPE (totype)) == FUNCTION_TYPE)
4053 || (TREE_CODE (totype) == REFERENCE_TYPE
4054 && TREE_CODE (TREE_TYPE (totype)) == POINTER_TYPE
4055 && TREE_CODE (TREE_TYPE (TREE_TYPE (totype))) == FUNCTION_TYPE))
4056 for (; fns; fns = OVL_NEXT (fns))
4058 tree fn = OVL_CURRENT (fns);
4060 if (DECL_NONCONVERTING_P (fn))
4063 if (TREE_CODE (fn) == TEMPLATE_DECL)
4064 add_template_conv_candidate
4065 (&candidates, fn, obj, NULL_TREE, *args, totype,
4066 /*access_path=*/NULL_TREE,
4067 /*conversion_path=*/NULL_TREE);
4069 add_conv_candidate (&candidates, fn, obj, NULL_TREE,
4070 *args, /*conversion_path=*/NULL_TREE,
4071 /*access_path=*/NULL_TREE);
4075 candidates = splice_viable (candidates, pedantic, &any_viable_p);
4078 if (complain & tf_error)
4080 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj),
4081 build_tree_list_vec (*args));
4082 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4084 result = error_mark_node;
4088 cand = tourney (candidates);
4091 if (complain & tf_error)
4093 error ("call of %<(%T) (%A)%> is ambiguous",
4094 TREE_TYPE (obj), build_tree_list_vec (*args));
4095 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4097 result = error_mark_node;
4099 /* Since cand->fn will be a type, not a function, for a conversion
4100 function, we must be careful not to unconditionally look at
4102 else if (TREE_CODE (cand->fn) == FUNCTION_DECL
4103 && DECL_OVERLOADED_OPERATOR_P (cand->fn) == CALL_EXPR)
4104 result = build_over_call (cand, LOOKUP_NORMAL, complain);
4107 obj = convert_like_with_context (cand->convs[0], obj, cand->fn, -1,
4109 obj = convert_from_reference (obj);
4110 result = cp_build_function_call_vec (obj, args, complain);
4114 /* Free all the conversions we allocated. */
4115 obstack_free (&conversion_obstack, p);
4120 /* Wrapper for above. */
4123 build_op_call (tree obj, VEC(tree,gc) **args, tsubst_flags_t complain)
4126 bool subtime = timevar_cond_start (TV_OVERLOAD);
4127 ret = build_op_call_1 (obj, args, complain);
4128 timevar_cond_stop (TV_OVERLOAD, subtime);
4133 op_error (enum tree_code code, enum tree_code code2,
4134 tree arg1, tree arg2, tree arg3, bool match)
4138 if (code == MODIFY_EXPR)
4139 opname = assignment_operator_name_info[code2].name;
4141 opname = operator_name_info[code].name;
4147 error ("ambiguous overload for ternary %<operator?:%> "
4148 "in %<%E ? %E : %E%>", arg1, arg2, arg3);
4150 error ("no match for ternary %<operator?:%> "
4151 "in %<%E ? %E : %E%>", arg1, arg2, arg3);
4154 case POSTINCREMENT_EXPR:
4155 case POSTDECREMENT_EXPR:
4157 error ("ambiguous overload for %<operator%s%> in %<%E%s%>",
4158 opname, arg1, opname);
4160 error ("no match for %<operator%s%> in %<%E%s%>",
4161 opname, arg1, opname);
4166 error ("ambiguous overload for %<operator[]%> in %<%E[%E]%>",
4169 error ("no match for %<operator[]%> in %<%E[%E]%>",
4176 error ("ambiguous overload for %qs in %<%s %E%>",
4177 opname, opname, arg1);
4179 error ("no match for %qs in %<%s %E%>",
4180 opname, opname, arg1);
4186 error ("ambiguous overload for %<operator%s%> in %<%E %s %E%>",
4187 opname, arg1, opname, arg2);
4189 error ("no match for %<operator%s%> in %<%E %s %E%>",
4190 opname, arg1, opname, arg2);
4193 error ("ambiguous overload for %<operator%s%> in %<%s%E%>",
4194 opname, opname, arg1);
4196 error ("no match for %<operator%s%> in %<%s%E%>",
4197 opname, opname, arg1);
4202 /* Return the implicit conversion sequence that could be used to
4203 convert E1 to E2 in [expr.cond]. */
4206 conditional_conversion (tree e1, tree e2)
4208 tree t1 = non_reference (TREE_TYPE (e1));
4209 tree t2 = non_reference (TREE_TYPE (e2));
4215 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4216 implicitly converted (clause _conv_) to the type "lvalue reference to
4217 T2", subject to the constraint that in the conversion the
4218 reference must bind directly (_dcl.init.ref_) to an lvalue. */
4219 if (real_lvalue_p (e2))
4221 conv = implicit_conversion (build_reference_type (t2),
4225 LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND
4226 |LOOKUP_ONLYCONVERTING);
4233 If E1 and E2 have class type, and the underlying class types are
4234 the same or one is a base class of the other: E1 can be converted
4235 to match E2 if the class of T2 is the same type as, or a base
4236 class of, the class of T1, and the cv-qualification of T2 is the
4237 same cv-qualification as, or a greater cv-qualification than, the
4238 cv-qualification of T1. If the conversion is applied, E1 is
4239 changed to an rvalue of type T2 that still refers to the original
4240 source class object (or the appropriate subobject thereof). */
4241 if (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
4242 && ((good_base = DERIVED_FROM_P (t2, t1)) || DERIVED_FROM_P (t1, t2)))
4244 if (good_base && at_least_as_qualified_p (t2, t1))
4246 conv = build_identity_conv (t1, e1);
4247 if (!same_type_p (TYPE_MAIN_VARIANT (t1),
4248 TYPE_MAIN_VARIANT (t2)))
4249 conv = build_conv (ck_base, t2, conv);
4251 conv = build_conv (ck_rvalue, t2, conv);
4260 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4261 converted to the type that expression E2 would have if E2 were
4262 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4263 return implicit_conversion (t2, t1, e1, /*c_cast_p=*/false,
4267 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4268 arguments to the conditional expression. */
4271 build_conditional_expr_1 (tree arg1, tree arg2, tree arg3,
4272 tsubst_flags_t complain)
4276 tree result = NULL_TREE;
4277 tree result_type = NULL_TREE;
4278 bool lvalue_p = true;
4279 struct z_candidate *candidates = 0;
4280 struct z_candidate *cand;
4283 /* As a G++ extension, the second argument to the conditional can be
4284 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4285 c'.) If the second operand is omitted, make sure it is
4286 calculated only once. */
4289 if (complain & tf_error)
4290 pedwarn (input_location, OPT_pedantic,
4291 "ISO C++ forbids omitting the middle term of a ?: expression");
4293 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4294 if (real_lvalue_p (arg1))
4295 arg2 = arg1 = stabilize_reference (arg1);
4297 arg2 = arg1 = save_expr (arg1);
4302 The first expression is implicitly converted to bool (clause
4304 arg1 = perform_implicit_conversion_flags (boolean_type_node, arg1, complain,
4307 /* If something has already gone wrong, just pass that fact up the
4309 if (error_operand_p (arg1)
4310 || error_operand_p (arg2)
4311 || error_operand_p (arg3))
4312 return error_mark_node;
4316 If either the second or the third operand has type (possibly
4317 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4318 array-to-pointer (_conv.array_), and function-to-pointer
4319 (_conv.func_) standard conversions are performed on the second
4320 and third operands. */
4321 arg2_type = unlowered_expr_type (arg2);
4322 arg3_type = unlowered_expr_type (arg3);
4323 if (VOID_TYPE_P (arg2_type) || VOID_TYPE_P (arg3_type))
4325 /* Do the conversions. We don't these for `void' type arguments
4326 since it can't have any effect and since decay_conversion
4327 does not handle that case gracefully. */
4328 if (!VOID_TYPE_P (arg2_type))
4329 arg2 = decay_conversion (arg2);
4330 if (!VOID_TYPE_P (arg3_type))
4331 arg3 = decay_conversion (arg3);
4332 arg2_type = TREE_TYPE (arg2);
4333 arg3_type = TREE_TYPE (arg3);
4337 One of the following shall hold:
4339 --The second or the third operand (but not both) is a
4340 throw-expression (_except.throw_); the result is of the
4341 type of the other and is an rvalue.
4343 --Both the second and the third operands have type void; the
4344 result is of type void and is an rvalue.
4346 We must avoid calling force_rvalue for expressions of type
4347 "void" because it will complain that their value is being
4349 if (TREE_CODE (arg2) == THROW_EXPR
4350 && TREE_CODE (arg3) != THROW_EXPR)
4352 if (!VOID_TYPE_P (arg3_type))
4354 arg3 = force_rvalue (arg3, complain);
4355 if (arg3 == error_mark_node)
4356 return error_mark_node;
4358 arg3_type = TREE_TYPE (arg3);
4359 result_type = arg3_type;
4361 else if (TREE_CODE (arg2) != THROW_EXPR
4362 && TREE_CODE (arg3) == THROW_EXPR)
4364 if (!VOID_TYPE_P (arg2_type))
4366 arg2 = force_rvalue (arg2, complain);
4367 if (arg2 == error_mark_node)
4368 return error_mark_node;
4370 arg2_type = TREE_TYPE (arg2);
4371 result_type = arg2_type;
4373 else if (VOID_TYPE_P (arg2_type) && VOID_TYPE_P (arg3_type))
4374 result_type = void_type_node;
4377 if (complain & tf_error)
4379 if (VOID_TYPE_P (arg2_type))
4380 error ("second operand to the conditional operator "
4381 "is of type %<void%>, "
4382 "but the third operand is neither a throw-expression "
4383 "nor of type %<void%>");
4385 error ("third operand to the conditional operator "
4386 "is of type %<void%>, "
4387 "but the second operand is neither a throw-expression "
4388 "nor of type %<void%>");
4390 return error_mark_node;
4394 goto valid_operands;
4398 Otherwise, if the second and third operand have different types,
4399 and either has (possibly cv-qualified) class type, an attempt is
4400 made to convert each of those operands to the type of the other. */
4401 else if (!same_type_p (arg2_type, arg3_type)
4402 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
4407 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4408 p = conversion_obstack_alloc (0);
4410 conv2 = conditional_conversion (arg2, arg3);
4411 conv3 = conditional_conversion (arg3, arg2);
4415 If both can be converted, or one can be converted but the
4416 conversion is ambiguous, the program is ill-formed. If
4417 neither can be converted, the operands are left unchanged and
4418 further checking is performed as described below. If exactly
4419 one conversion is possible, that conversion is applied to the
4420 chosen operand and the converted operand is used in place of
4421 the original operand for the remainder of this section. */
4422 if ((conv2 && !conv2->bad_p
4423 && conv3 && !conv3->bad_p)
4424 || (conv2 && conv2->kind == ck_ambig)
4425 || (conv3 && conv3->kind == ck_ambig))
4427 error ("operands to ?: have different types %qT and %qT",
4428 arg2_type, arg3_type);
4429 result = error_mark_node;
4431 else if (conv2 && (!conv2->bad_p || !conv3))
4433 arg2 = convert_like (conv2, arg2, complain);
4434 arg2 = convert_from_reference (arg2);
4435 arg2_type = TREE_TYPE (arg2);
4436 /* Even if CONV2 is a valid conversion, the result of the
4437 conversion may be invalid. For example, if ARG3 has type
4438 "volatile X", and X does not have a copy constructor
4439 accepting a "volatile X&", then even if ARG2 can be
4440 converted to X, the conversion will fail. */
4441 if (error_operand_p (arg2))
4442 result = error_mark_node;
4444 else if (conv3 && (!conv3->bad_p || !conv2))
4446 arg3 = convert_like (conv3, arg3, complain);
4447 arg3 = convert_from_reference (arg3);
4448 arg3_type = TREE_TYPE (arg3);
4449 if (error_operand_p (arg3))
4450 result = error_mark_node;
4453 /* Free all the conversions we allocated. */
4454 obstack_free (&conversion_obstack, p);
4459 /* If, after the conversion, both operands have class type,
4460 treat the cv-qualification of both operands as if it were the
4461 union of the cv-qualification of the operands.
4463 The standard is not clear about what to do in this
4464 circumstance. For example, if the first operand has type
4465 "const X" and the second operand has a user-defined
4466 conversion to "volatile X", what is the type of the second
4467 operand after this step? Making it be "const X" (matching
4468 the first operand) seems wrong, as that discards the
4469 qualification without actually performing a copy. Leaving it
4470 as "volatile X" seems wrong as that will result in the
4471 conditional expression failing altogether, even though,
4472 according to this step, the one operand could be converted to
4473 the type of the other. */
4474 if ((conv2 || conv3)
4475 && CLASS_TYPE_P (arg2_type)
4476 && cp_type_quals (arg2_type) != cp_type_quals (arg3_type))
4477 arg2_type = arg3_type =
4478 cp_build_qualified_type (arg2_type,
4479 cp_type_quals (arg2_type)
4480 | cp_type_quals (arg3_type));
4485 If the second and third operands are lvalues and have the same
4486 type, the result is of that type and is an lvalue. */
4487 if (real_lvalue_p (arg2)
4488 && real_lvalue_p (arg3)
4489 && same_type_p (arg2_type, arg3_type))
4491 result_type = arg2_type;
4492 arg2 = mark_lvalue_use (arg2);
4493 arg3 = mark_lvalue_use (arg3);
4494 goto valid_operands;
4499 Otherwise, the result is an rvalue. If the second and third
4500 operand do not have the same type, and either has (possibly
4501 cv-qualified) class type, overload resolution is used to
4502 determine the conversions (if any) to be applied to the operands
4503 (_over.match.oper_, _over.built_). */
4505 if (!same_type_p (arg2_type, arg3_type)
4506 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
4512 /* Rearrange the arguments so that add_builtin_candidate only has
4513 to know about two args. In build_builtin_candidate, the
4514 arguments are unscrambled. */
4518 add_builtin_candidates (&candidates,
4521 ansi_opname (COND_EXPR),
4527 If the overload resolution fails, the program is
4529 candidates = splice_viable (candidates, pedantic, &any_viable_p);
4532 if (complain & tf_error)
4534 op_error (COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE);
4535 print_z_candidates (location_of (arg1), candidates);
4537 return error_mark_node;
4539 cand = tourney (candidates);
4542 if (complain & tf_error)
4544 op_error (COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE);
4545 print_z_candidates (location_of (arg1), candidates);
4547 return error_mark_node;
4552 Otherwise, the conversions thus determined are applied, and
4553 the converted operands are used in place of the original
4554 operands for the remainder of this section. */
4555 conv = cand->convs[0];
4556 arg1 = convert_like (conv, arg1, complain);
4557 conv = cand->convs[1];
4558 arg2 = convert_like (conv, arg2, complain);
4559 arg2_type = TREE_TYPE (arg2);
4560 conv = cand->convs[2];
4561 arg3 = convert_like (conv, arg3, complain);
4562 arg3_type = TREE_TYPE (arg3);
4567 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
4568 and function-to-pointer (_conv.func_) standard conversions are
4569 performed on the second and third operands.
4571 We need to force the lvalue-to-rvalue conversion here for class types,
4572 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
4573 that isn't wrapped with a TARGET_EXPR plays havoc with exception
4576 arg2 = force_rvalue (arg2, complain);
4577 if (!CLASS_TYPE_P (arg2_type))
4578 arg2_type = TREE_TYPE (arg2);
4580 arg3 = force_rvalue (arg3, complain);
4581 if (!CLASS_TYPE_P (arg3_type))
4582 arg3_type = TREE_TYPE (arg3);
4584 if (arg2 == error_mark_node || arg3 == error_mark_node)
4585 return error_mark_node;
4589 After those conversions, one of the following shall hold:
4591 --The second and third operands have the same type; the result is of
4593 if (same_type_p (arg2_type, arg3_type))
4594 result_type = arg2_type;
4597 --The second and third operands have arithmetic or enumeration
4598 type; the usual arithmetic conversions are performed to bring
4599 them to a common type, and the result is of that type. */
4600 else if ((ARITHMETIC_TYPE_P (arg2_type)
4601 || UNSCOPED_ENUM_P (arg2_type))
4602 && (ARITHMETIC_TYPE_P (arg3_type)
4603 || UNSCOPED_ENUM_P (arg3_type)))
4605 /* In this case, there is always a common type. */
4606 result_type = type_after_usual_arithmetic_conversions (arg2_type,
4608 do_warn_double_promotion (result_type, arg2_type, arg3_type,
4609 "implicit conversion from %qT to %qT to "
4610 "match other result of conditional",
4613 if (TREE_CODE (arg2_type) == ENUMERAL_TYPE
4614 && TREE_CODE (arg3_type) == ENUMERAL_TYPE)
4616 if (complain & tf_warning)
4618 "enumeral mismatch in conditional expression: %qT vs %qT",
4619 arg2_type, arg3_type);
4621 else if (extra_warnings
4622 && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE
4623 && !same_type_p (arg3_type, type_promotes_to (arg2_type)))
4624 || (TREE_CODE (arg3_type) == ENUMERAL_TYPE
4625 && !same_type_p (arg2_type, type_promotes_to (arg3_type)))))
4627 if (complain & tf_warning)
4629 "enumeral and non-enumeral type in conditional expression");
4632 arg2 = perform_implicit_conversion (result_type, arg2, complain);
4633 arg3 = perform_implicit_conversion (result_type, arg3, complain);
4637 --The second and third operands have pointer type, or one has
4638 pointer type and the other is a null pointer constant; pointer
4639 conversions (_conv.ptr_) and qualification conversions
4640 (_conv.qual_) are performed to bring them to their composite
4641 pointer type (_expr.rel_). The result is of the composite
4644 --The second and third operands have pointer to member type, or
4645 one has pointer to member type and the other is a null pointer
4646 constant; pointer to member conversions (_conv.mem_) and
4647 qualification conversions (_conv.qual_) are performed to bring
4648 them to a common type, whose cv-qualification shall match the
4649 cv-qualification of either the second or the third operand.
4650 The result is of the common type. */
4651 else if ((null_ptr_cst_p (arg2)
4652 && (TYPE_PTR_P (arg3_type) || TYPE_PTR_TO_MEMBER_P (arg3_type)))
4653 || (null_ptr_cst_p (arg3)
4654 && (TYPE_PTR_P (arg2_type) || TYPE_PTR_TO_MEMBER_P (arg2_type)))
4655 || (TYPE_PTR_P (arg2_type) && TYPE_PTR_P (arg3_type))
4656 || (TYPE_PTRMEM_P (arg2_type) && TYPE_PTRMEM_P (arg3_type))
4657 || (TYPE_PTRMEMFUNC_P (arg2_type) && TYPE_PTRMEMFUNC_P (arg3_type)))
4659 result_type = composite_pointer_type (arg2_type, arg3_type, arg2,
4660 arg3, CPO_CONDITIONAL_EXPR,
4662 if (result_type == error_mark_node)
4663 return error_mark_node;
4664 arg2 = perform_implicit_conversion (result_type, arg2, complain);
4665 arg3 = perform_implicit_conversion (result_type, arg3, complain);
4670 if (complain & tf_error)
4671 error ("operands to ?: have different types %qT and %qT",
4672 arg2_type, arg3_type);
4673 return error_mark_node;
4677 result = build3 (COND_EXPR, result_type, arg1, arg2, arg3);
4678 if (!cp_unevaluated_operand)
4679 /* Avoid folding within decltype (c++/42013) and noexcept. */
4680 result = fold_if_not_in_template (result);
4682 /* We can't use result_type below, as fold might have returned a
4687 /* Expand both sides into the same slot, hopefully the target of
4688 the ?: expression. We used to check for TARGET_EXPRs here,
4689 but now we sometimes wrap them in NOP_EXPRs so the test would
4691 if (CLASS_TYPE_P (TREE_TYPE (result)))
4692 result = get_target_expr (result);
4693 /* If this expression is an rvalue, but might be mistaken for an
4694 lvalue, we must add a NON_LVALUE_EXPR. */
4695 result = rvalue (result);
4701 /* Wrapper for above. */
4704 build_conditional_expr (tree arg1, tree arg2, tree arg3,
4705 tsubst_flags_t complain)
4708 bool subtime = timevar_cond_start (TV_OVERLOAD);
4709 ret = build_conditional_expr_1 (arg1, arg2, arg3, complain);
4710 timevar_cond_stop (TV_OVERLOAD, subtime);
4714 /* OPERAND is an operand to an expression. Perform necessary steps
4715 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
4719 prep_operand (tree operand)
4723 if (CLASS_TYPE_P (TREE_TYPE (operand))
4724 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand)))
4725 /* Make sure the template type is instantiated now. */
4726 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand)));
4732 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
4733 OVERLOAD) to the CANDIDATES, returning an updated list of
4734 CANDIDATES. The ARGS are the arguments provided to the call;
4735 if FIRST_ARG is non-null it is the implicit object argument,
4736 otherwise the first element of ARGS is used if needed. The
4737 EXPLICIT_TARGS are explicit template arguments provided.
4738 TEMPLATE_ONLY is true if only template functions should be
4739 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
4740 add_function_candidate. */
4743 add_candidates (tree fns, tree first_arg, const VEC(tree,gc) *args,
4745 tree explicit_targs, bool template_only,
4746 tree conversion_path, tree access_path,
4748 struct z_candidate **candidates)
4751 const VEC(tree,gc) *non_static_args;
4752 bool check_list_ctor;
4753 bool check_converting;
4754 unification_kind_t strict;
4760 /* Precalculate special handling of constructors and conversion ops. */
4761 fn = OVL_CURRENT (fns);
4762 if (DECL_CONV_FN_P (fn))
4764 check_list_ctor = false;
4765 check_converting = !!(flags & LOOKUP_ONLYCONVERTING);
4766 if (flags & LOOKUP_NO_CONVERSION)
4767 /* We're doing return_type(x). */
4768 strict = DEDUCE_CONV;
4770 /* We're doing x.operator return_type(). */
4771 strict = DEDUCE_EXACT;
4772 /* [over.match.funcs] For conversion functions, the function
4773 is considered to be a member of the class of the implicit
4774 object argument for the purpose of defining the type of
4775 the implicit object parameter. */
4776 ctype = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (first_arg)));
4780 if (DECL_CONSTRUCTOR_P (fn))
4782 check_list_ctor = !!(flags & LOOKUP_LIST_ONLY);
4783 check_converting = !!(flags & LOOKUP_ONLYCONVERTING);
4787 check_list_ctor = false;
4788 check_converting = false;
4790 strict = DEDUCE_CALL;
4791 ctype = conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE;
4795 non_static_args = args;
4797 /* Delay creating the implicit this parameter until it is needed. */
4798 non_static_args = NULL;
4800 for (; fns; fns = OVL_NEXT (fns))
4803 const VEC(tree,gc) *fn_args;
4805 fn = OVL_CURRENT (fns);
4807 if (check_converting && DECL_NONCONVERTING_P (fn))
4809 if (check_list_ctor && !is_list_ctor (fn))
4812 /* Figure out which set of arguments to use. */
4813 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
4815 /* If this function is a non-static member and we didn't get an
4816 implicit object argument, move it out of args. */
4817 if (first_arg == NULL_TREE)
4821 VEC(tree,gc) *tempvec
4822 = VEC_alloc (tree, gc, VEC_length (tree, args) - 1);
4823 for (ix = 1; VEC_iterate (tree, args, ix, arg); ++ix)
4824 VEC_quick_push (tree, tempvec, arg);
4825 non_static_args = tempvec;
4826 first_arg = build_this (VEC_index (tree, args, 0));
4829 fn_first_arg = first_arg;
4830 fn_args = non_static_args;
4834 /* Otherwise, just use the list of arguments provided. */
4835 fn_first_arg = NULL_TREE;
4839 if (TREE_CODE (fn) == TEMPLATE_DECL)
4840 add_template_candidate (candidates,
4851 else if (!template_only)
4852 add_function_candidate (candidates,
4863 /* Even unsigned enum types promote to signed int. We don't want to
4864 issue -Wsign-compare warnings for this case. Here ORIG_ARG is the
4865 original argument and ARG is the argument after any conversions
4866 have been applied. We set TREE_NO_WARNING if we have added a cast
4867 from an unsigned enum type to a signed integer type. */
4870 avoid_sign_compare_warnings (tree orig_arg, tree arg)
4872 if (orig_arg != NULL_TREE
4875 && TREE_CODE (TREE_TYPE (orig_arg)) == ENUMERAL_TYPE
4876 && TYPE_UNSIGNED (TREE_TYPE (orig_arg))
4877 && INTEGRAL_TYPE_P (TREE_TYPE (arg))
4878 && !TYPE_UNSIGNED (TREE_TYPE (arg)))
4879 TREE_NO_WARNING (arg) = 1;
4883 build_new_op_1 (enum tree_code code, int flags, tree arg1, tree arg2, tree arg3,
4884 tree *overload, tsubst_flags_t complain)
4886 tree orig_arg1 = arg1;
4887 tree orig_arg2 = arg2;
4888 tree orig_arg3 = arg3;
4889 struct z_candidate *candidates = 0, *cand;
4890 VEC(tree,gc) *arglist;
4893 tree result = NULL_TREE;
4894 bool result_valid_p = false;
4895 enum tree_code code2 = NOP_EXPR;
4896 enum tree_code code_orig_arg1 = ERROR_MARK;
4897 enum tree_code code_orig_arg2 = ERROR_MARK;
4903 if (error_operand_p (arg1)
4904 || error_operand_p (arg2)
4905 || error_operand_p (arg3))
4906 return error_mark_node;
4908 if (code == MODIFY_EXPR)
4910 code2 = TREE_CODE (arg3);
4912 fnname = ansi_assopname (code2);
4915 fnname = ansi_opname (code);
4917 arg1 = prep_operand (arg1);
4923 case VEC_DELETE_EXPR:
4925 /* Use build_op_new_call and build_op_delete_call instead. */
4929 /* Use build_op_call instead. */
4932 case TRUTH_ORIF_EXPR:
4933 case TRUTH_ANDIF_EXPR:
4934 case TRUTH_AND_EXPR:
4936 /* These are saved for the sake of warn_logical_operator. */
4937 code_orig_arg1 = TREE_CODE (arg1);
4938 code_orig_arg2 = TREE_CODE (arg2);
4944 arg2 = prep_operand (arg2);
4945 arg3 = prep_operand (arg3);
4947 if (code == COND_EXPR)
4948 /* Use build_conditional_expr instead. */
4950 else if (! IS_OVERLOAD_TYPE (TREE_TYPE (arg1))
4951 && (! arg2 || ! IS_OVERLOAD_TYPE (TREE_TYPE (arg2))))
4954 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
4955 arg2 = integer_zero_node;
4957 arglist = VEC_alloc (tree, gc, 3);
4958 VEC_quick_push (tree, arglist, arg1);
4959 if (arg2 != NULL_TREE)
4960 VEC_quick_push (tree, arglist, arg2);
4961 if (arg3 != NULL_TREE)
4962 VEC_quick_push (tree, arglist, arg3);
4964 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4965 p = conversion_obstack_alloc (0);
4967 /* Add namespace-scope operators to the list of functions to
4969 add_candidates (lookup_function_nonclass (fnname, arglist, /*block_p=*/true),
4970 NULL_TREE, arglist, NULL_TREE,
4971 NULL_TREE, false, NULL_TREE, NULL_TREE,
4972 flags, &candidates);
4973 /* Add class-member operators to the candidate set. */
4974 if (CLASS_TYPE_P (TREE_TYPE (arg1)))
4978 fns = lookup_fnfields (TREE_TYPE (arg1), fnname, 1);
4979 if (fns == error_mark_node)
4981 result = error_mark_node;
4982 goto user_defined_result_ready;
4985 add_candidates (BASELINK_FUNCTIONS (fns),
4986 NULL_TREE, arglist, NULL_TREE,
4988 BASELINK_BINFO (fns),
4989 BASELINK_ACCESS_BINFO (fns),
4990 flags, &candidates);
4995 args[2] = NULL_TREE;
4997 add_builtin_candidates (&candidates, code, code2, fnname, args, flags);
5003 /* For these, the built-in candidates set is empty
5004 [over.match.oper]/3. We don't want non-strict matches
5005 because exact matches are always possible with built-in
5006 operators. The built-in candidate set for COMPONENT_REF
5007 would be empty too, but since there are no such built-in
5008 operators, we accept non-strict matches for them. */
5013 strict_p = pedantic;
5017 candidates = splice_viable (candidates, strict_p, &any_viable_p);
5022 case POSTINCREMENT_EXPR:
5023 case POSTDECREMENT_EXPR:
5024 /* Don't try anything fancy if we're not allowed to produce
5026 if (!(complain & tf_error))
5027 return error_mark_node;
5029 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5030 distinguish between prefix and postfix ++ and
5031 operator++() was used for both, so we allow this with
5033 if (flags & LOOKUP_COMPLAIN)
5035 const char *msg = (flag_permissive)
5036 ? G_("no %<%D(int)%> declared for postfix %qs,"
5037 " trying prefix operator instead")
5038 : G_("no %<%D(int)%> declared for postfix %qs");
5039 permerror (input_location, msg, fnname,
5040 operator_name_info[code].name);
5043 if (!flag_permissive)
5044 return error_mark_node;
5046 if (code == POSTINCREMENT_EXPR)
5047 code = PREINCREMENT_EXPR;
5049 code = PREDECREMENT_EXPR;
5050 result = build_new_op_1 (code, flags, arg1, NULL_TREE, NULL_TREE,
5051 overload, complain);
5054 /* The caller will deal with these. */
5059 result_valid_p = true;
5063 if ((flags & LOOKUP_COMPLAIN) && (complain & tf_error))
5065 /* If one of the arguments of the operator represents
5066 an invalid use of member function pointer, try to report
5067 a meaningful error ... */
5068 if (invalid_nonstatic_memfn_p (arg1, tf_error)
5069 || invalid_nonstatic_memfn_p (arg2, tf_error)
5070 || invalid_nonstatic_memfn_p (arg3, tf_error))
5071 /* We displayed the error message. */;
5074 /* ... Otherwise, report the more generic
5075 "no matching operator found" error */
5076 op_error (code, code2, arg1, arg2, arg3, FALSE);
5077 print_z_candidates (input_location, candidates);
5080 result = error_mark_node;
5086 cand = tourney (candidates);
5089 if ((flags & LOOKUP_COMPLAIN) && (complain & tf_error))
5091 op_error (code, code2, arg1, arg2, arg3, TRUE);
5092 print_z_candidates (input_location, candidates);
5094 result = error_mark_node;
5096 else if (TREE_CODE (cand->fn) == FUNCTION_DECL)
5099 *overload = cand->fn;
5101 if (resolve_args (arglist, complain) == NULL)
5102 result = error_mark_node;
5104 result = build_over_call (cand, LOOKUP_NORMAL, complain);
5108 /* Give any warnings we noticed during overload resolution. */
5109 if (cand->warnings && (complain & tf_warning))
5111 struct candidate_warning *w;
5112 for (w = cand->warnings; w; w = w->next)
5113 joust (cand, w->loser, 1);
5116 /* Check for comparison of different enum types. */
5125 if (TREE_CODE (TREE_TYPE (arg1)) == ENUMERAL_TYPE
5126 && TREE_CODE (TREE_TYPE (arg2)) == ENUMERAL_TYPE
5127 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1))
5128 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2)))
5129 && (complain & tf_warning))
5131 warning (OPT_Wenum_compare,
5132 "comparison between %q#T and %q#T",
5133 TREE_TYPE (arg1), TREE_TYPE (arg2));
5140 /* We need to strip any leading REF_BIND so that bitfields
5141 don't cause errors. This should not remove any important
5142 conversions, because builtins don't apply to class
5143 objects directly. */
5144 conv = cand->convs[0];
5145 if (conv->kind == ck_ref_bind)
5146 conv = conv->u.next;
5147 arg1 = convert_like (conv, arg1, complain);
5151 /* We need to call warn_logical_operator before
5152 converting arg2 to a boolean_type. */
5153 if (complain & tf_warning)
5154 warn_logical_operator (input_location, code, boolean_type_node,
5155 code_orig_arg1, arg1,
5156 code_orig_arg2, arg2);
5158 conv = cand->convs[1];
5159 if (conv->kind == ck_ref_bind)
5160 conv = conv->u.next;
5161 arg2 = convert_like (conv, arg2, complain);
5165 conv = cand->convs[2];
5166 if (conv->kind == ck_ref_bind)
5167 conv = conv->u.next;
5168 arg3 = convert_like (conv, arg3, complain);
5174 user_defined_result_ready:
5176 /* Free all the conversions we allocated. */
5177 obstack_free (&conversion_obstack, p);
5179 if (result || result_valid_p)
5183 avoid_sign_compare_warnings (orig_arg1, arg1);
5184 avoid_sign_compare_warnings (orig_arg2, arg2);
5185 avoid_sign_compare_warnings (orig_arg3, arg3);
5190 return cp_build_modify_expr (arg1, code2, arg2, complain);
5193 return cp_build_indirect_ref (arg1, RO_UNARY_STAR, complain);
5195 case TRUTH_ANDIF_EXPR:
5196 case TRUTH_ORIF_EXPR:
5197 case TRUTH_AND_EXPR:
5199 warn_logical_operator (input_location, code, boolean_type_node,
5200 code_orig_arg1, arg1, code_orig_arg2, arg2);
5205 case TRUNC_DIV_EXPR:
5216 case TRUNC_MOD_EXPR:
5220 return cp_build_binary_op (input_location, code, arg1, arg2, complain);
5222 case UNARY_PLUS_EXPR:
5225 case TRUTH_NOT_EXPR:
5226 case PREINCREMENT_EXPR:
5227 case POSTINCREMENT_EXPR:
5228 case PREDECREMENT_EXPR:
5229 case POSTDECREMENT_EXPR:
5233 return cp_build_unary_op (code, arg1, candidates != 0, complain);
5236 return cp_build_array_ref (input_location, arg1, arg2, complain);
5239 return build_m_component_ref (cp_build_indirect_ref (arg1, RO_NULL,
5243 /* The caller will deal with these. */
5255 /* Wrapper for above. */
5258 build_new_op (enum tree_code code, int flags, tree arg1, tree arg2, tree arg3,
5259 tree *overload, tsubst_flags_t complain)
5262 bool subtime = timevar_cond_start (TV_OVERLOAD);
5263 ret = build_new_op_1 (code, flags, arg1, arg2, arg3, overload, complain);
5264 timevar_cond_stop (TV_OVERLOAD, subtime);
5268 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
5269 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
5272 non_placement_deallocation_fn_p (tree t)
5274 /* A template instance is never a usual deallocation function,
5275 regardless of its signature. */
5276 if (TREE_CODE (t) == TEMPLATE_DECL
5277 || primary_template_instantiation_p (t))
5280 /* If a class T has a member deallocation function named operator delete
5281 with exactly one parameter, then that function is a usual
5282 (non-placement) deallocation function. If class T does not declare
5283 such an operator delete but does declare a member deallocation
5284 function named operator delete with exactly two parameters, the second
5285 of which has type std::size_t (18.2), then this function is a usual
5286 deallocation function. */
5287 t = FUNCTION_ARG_CHAIN (t);
5288 if (t == void_list_node
5289 || (t && same_type_p (TREE_VALUE (t), size_type_node)
5290 && TREE_CHAIN (t) == void_list_node))
5295 /* Build a call to operator delete. This has to be handled very specially,
5296 because the restrictions on what signatures match are different from all
5297 other call instances. For a normal delete, only a delete taking (void *)
5298 or (void *, size_t) is accepted. For a placement delete, only an exact
5299 match with the placement new is accepted.
5301 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
5302 ADDR is the pointer to be deleted.
5303 SIZE is the size of the memory block to be deleted.
5304 GLOBAL_P is true if the delete-expression should not consider
5305 class-specific delete operators.
5306 PLACEMENT is the corresponding placement new call, or NULL_TREE.
5308 If this call to "operator delete" is being generated as part to
5309 deallocate memory allocated via a new-expression (as per [expr.new]
5310 which requires that if the initialization throws an exception then
5311 we call a deallocation function), then ALLOC_FN is the allocation
5315 build_op_delete_call (enum tree_code code, tree addr, tree size,
5316 bool global_p, tree placement,
5319 tree fn = NULL_TREE;
5320 tree fns, fnname, type, t;
5322 if (addr == error_mark_node)
5323 return error_mark_node;
5325 type = strip_array_types (TREE_TYPE (TREE_TYPE (addr)));
5327 fnname = ansi_opname (code);
5329 if (CLASS_TYPE_P (type)
5330 && COMPLETE_TYPE_P (complete_type (type))
5334 If the result of the lookup is ambiguous or inaccessible, or if
5335 the lookup selects a placement deallocation function, the
5336 program is ill-formed.
5338 Therefore, we ask lookup_fnfields to complain about ambiguity. */
5340 fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1);
5341 if (fns == error_mark_node)
5342 return error_mark_node;
5347 if (fns == NULL_TREE)
5348 fns = lookup_name_nonclass (fnname);
5350 /* Strip const and volatile from addr. */
5351 addr = cp_convert (ptr_type_node, addr);
5355 /* "A declaration of a placement deallocation function matches the
5356 declaration of a placement allocation function if it has the same
5357 number of parameters and, after parameter transformations (8.3.5),
5358 all parameter types except the first are identical."
5360 So we build up the function type we want and ask instantiate_type
5361 to get it for us. */
5362 t = FUNCTION_ARG_CHAIN (alloc_fn);
5363 t = tree_cons (NULL_TREE, ptr_type_node, t);
5364 t = build_function_type (void_type_node, t);
5366 fn = instantiate_type (t, fns, tf_none);
5367 if (fn == error_mark_node)
5370 if (BASELINK_P (fn))
5371 fn = BASELINK_FUNCTIONS (fn);
5373 /* "If the lookup finds the two-parameter form of a usual deallocation
5374 function (3.7.4.2) and that function, considered as a placement
5375 deallocation function, would have been selected as a match for the
5376 allocation function, the program is ill-formed." */
5377 if (non_placement_deallocation_fn_p (fn))
5379 /* But if the class has an operator delete (void *), then that is
5380 the usual deallocation function, so we shouldn't complain
5381 about using the operator delete (void *, size_t). */
5382 for (t = BASELINK_P (fns) ? BASELINK_FUNCTIONS (fns) : fns;
5383 t; t = OVL_NEXT (t))
5385 tree elt = OVL_CURRENT (t);
5386 if (non_placement_deallocation_fn_p (elt)
5387 && FUNCTION_ARG_CHAIN (elt) == void_list_node)
5390 permerror (0, "non-placement deallocation function %q+D", fn);
5391 permerror (input_location, "selected for placement delete");
5396 /* "Any non-placement deallocation function matches a non-placement
5397 allocation function. If the lookup finds a single matching
5398 deallocation function, that function will be called; otherwise, no
5399 deallocation function will be called." */
5400 for (t = BASELINK_P (fns) ? BASELINK_FUNCTIONS (fns) : fns;
5401 t; t = OVL_NEXT (t))
5403 tree elt = OVL_CURRENT (t);
5404 if (non_placement_deallocation_fn_p (elt))
5407 /* "If a class T has a member deallocation function named
5408 operator delete with exactly one parameter, then that
5409 function is a usual (non-placement) deallocation
5410 function. If class T does not declare such an operator
5411 delete but does declare a member deallocation function named
5412 operator delete with exactly two parameters, the second of
5413 which has type std::size_t (18.2), then this function is a
5414 usual deallocation function."
5416 So (void*) beats (void*, size_t). */
5417 if (FUNCTION_ARG_CHAIN (fn) == void_list_node)
5422 /* If we have a matching function, call it. */
5425 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
5427 /* If the FN is a member function, make sure that it is
5429 if (BASELINK_P (fns))
5430 perform_or_defer_access_check (BASELINK_BINFO (fns), fn, fn);
5432 /* Core issue 901: It's ok to new a type with deleted delete. */
5433 if (DECL_DELETED_FN (fn) && alloc_fn)
5438 /* The placement args might not be suitable for overload
5439 resolution at this point, so build the call directly. */
5440 int nargs = call_expr_nargs (placement);
5441 tree *argarray = XALLOCAVEC (tree, nargs);
5444 for (i = 1; i < nargs; i++)
5445 argarray[i] = CALL_EXPR_ARG (placement, i);
5447 return build_cxx_call (fn, nargs, argarray);
5452 VEC(tree,gc) *args = VEC_alloc (tree, gc, 2);
5453 VEC_quick_push (tree, args, addr);
5454 if (FUNCTION_ARG_CHAIN (fn) != void_list_node)
5455 VEC_quick_push (tree, args, size);
5456 ret = cp_build_function_call_vec (fn, &args, tf_warning_or_error);
5457 VEC_free (tree, gc, args);
5464 If no unambiguous matching deallocation function can be found,
5465 propagating the exception does not cause the object's memory to
5470 warning (0, "no corresponding deallocation function for %qD",
5475 error ("no suitable %<operator %s%> for %qT",
5476 operator_name_info[(int)code].name, type);
5477 return error_mark_node;
5480 /* If the current scope isn't allowed to access DECL along
5481 BASETYPE_PATH, give an error. The most derived class in
5482 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
5483 the declaration to use in the error diagnostic. */
5486 enforce_access (tree basetype_path, tree decl, tree diag_decl)
5488 gcc_assert (TREE_CODE (basetype_path) == TREE_BINFO);
5490 if (!accessible_p (basetype_path, decl, true))
5492 if (TREE_PRIVATE (decl))
5493 error ("%q+#D is private", diag_decl);
5494 else if (TREE_PROTECTED (decl))
5495 error ("%q+#D is protected", diag_decl);
5497 error ("%q+#D is inaccessible", diag_decl);
5498 error ("within this context");
5505 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
5506 bitwise or of LOOKUP_* values. If any errors are warnings are
5507 generated, set *DIAGNOSTIC_FN to "error" or "warning",
5508 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
5512 build_temp (tree expr, tree type, int flags,
5513 diagnostic_t *diagnostic_kind, tsubst_flags_t complain)
5518 savew = warningcount, savee = errorcount;
5519 args = make_tree_vector_single (expr);
5520 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
5521 &args, type, flags, complain);
5522 release_tree_vector (args);
5523 if (warningcount > savew)
5524 *diagnostic_kind = DK_WARNING;
5525 else if (errorcount > savee)
5526 *diagnostic_kind = DK_ERROR;
5528 *diagnostic_kind = DK_UNSPECIFIED;
5532 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
5533 EXPR is implicitly converted to type TOTYPE.
5534 FN and ARGNUM are used for diagnostics. */
5537 conversion_null_warnings (tree totype, tree expr, tree fn, int argnum)
5539 /* Issue warnings about peculiar, but valid, uses of NULL. */
5540 if (expr == null_node && TREE_CODE (totype) != BOOLEAN_TYPE
5541 && ARITHMETIC_TYPE_P (totype))
5544 warning_at (input_location, OPT_Wconversion_null,
5545 "passing NULL to non-pointer argument %P of %qD",
5548 warning_at (input_location, OPT_Wconversion_null,
5549 "converting to non-pointer type %qT from NULL", totype);
5552 /* Issue warnings if "false" is converted to a NULL pointer */
5553 else if (TREE_CODE (TREE_TYPE (expr)) == BOOLEAN_TYPE
5554 && TYPE_PTR_P (totype))
5557 warning_at (input_location, OPT_Wconversion_null,
5558 "converting %<false%> to pointer type for argument %P "
5559 "of %qD", argnum, fn);
5561 warning_at (input_location, OPT_Wconversion_null,
5562 "converting %<false%> to pointer type %qT", totype);
5566 /* Perform the conversions in CONVS on the expression EXPR. FN and
5567 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
5568 indicates the `this' argument of a method. INNER is nonzero when
5569 being called to continue a conversion chain. It is negative when a
5570 reference binding will be applied, positive otherwise. If
5571 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
5572 conversions will be emitted if appropriate. If C_CAST_P is true,
5573 this conversion is coming from a C-style cast; in that case,
5574 conversions to inaccessible bases are permitted. */
5577 convert_like_real (conversion *convs, tree expr, tree fn, int argnum,
5578 int inner, bool issue_conversion_warnings,
5579 bool c_cast_p, tsubst_flags_t complain)
5581 tree totype = convs->type;
5582 diagnostic_t diag_kind;
5585 if (convs->bad_p && !(complain & tf_error))
5586 return error_mark_node;
5589 && convs->kind != ck_user
5590 && convs->kind != ck_list
5591 && convs->kind != ck_ambig
5592 && (convs->kind != ck_ref_bind
5593 || convs->user_conv_p)
5594 && convs->kind != ck_rvalue
5595 && convs->kind != ck_base)
5597 conversion *t = convs;
5599 /* Give a helpful error if this is bad because of excess braces. */
5600 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
5601 && SCALAR_TYPE_P (totype)
5602 && CONSTRUCTOR_NELTS (expr) > 0
5603 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr, 0)->value))
5604 permerror (input_location, "too many braces around initializer for %qT", totype);
5606 for (; t; t = t->u.next)
5608 if (t->kind == ck_user && t->cand->reason)
5610 permerror (input_location, "invalid user-defined conversion "
5611 "from %qT to %qT", TREE_TYPE (expr), totype);
5612 print_z_candidate ("candidate is:", t->cand);
5613 expr = convert_like_real (t, expr, fn, argnum, 1,
5614 /*issue_conversion_warnings=*/false,
5617 if (convs->kind == ck_ref_bind)
5618 return convert_to_reference (totype, expr, CONV_IMPLICIT,
5619 LOOKUP_NORMAL, NULL_TREE);
5621 return cp_convert (totype, expr);
5623 else if (t->kind == ck_user || !t->bad_p)
5625 expr = convert_like_real (t, expr, fn, argnum, 1,
5626 /*issue_conversion_warnings=*/false,
5631 else if (t->kind == ck_ambig)
5632 return convert_like_real (t, expr, fn, argnum, 1,
5633 /*issue_conversion_warnings=*/false,
5636 else if (t->kind == ck_identity)
5640 permerror (input_location, "invalid conversion from %qT to %qT",
5641 TREE_TYPE (expr), totype);
5643 permerror (DECL_SOURCE_LOCATION (fn),
5644 " initializing argument %P of %qD", argnum, fn);
5646 return cp_convert (totype, expr);
5649 if (issue_conversion_warnings && (complain & tf_warning))
5650 conversion_null_warnings (totype, expr, fn, argnum);
5652 switch (convs->kind)
5656 struct z_candidate *cand = convs->cand;
5657 tree convfn = cand->fn;
5660 /* If we're initializing from {}, it's value-initialization. */
5661 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
5662 && CONSTRUCTOR_NELTS (expr) == 0
5663 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
5665 bool direct = CONSTRUCTOR_IS_DIRECT_INIT (expr);
5666 expr = build_value_init (totype, complain);
5667 expr = get_target_expr_sfinae (expr, complain);
5668 if (expr != error_mark_node)
5670 TARGET_EXPR_LIST_INIT_P (expr) = true;
5671 TARGET_EXPR_DIRECT_INIT_P (expr) = direct;
5676 expr = mark_rvalue_use (expr);
5678 /* When converting from an init list we consider explicit
5679 constructors, but actually trying to call one is an error. */
5680 if (DECL_NONCONVERTING_P (convfn) && DECL_CONSTRUCTOR_P (convfn)
5681 /* Unless this is for direct-list-initialization. */
5682 && !(BRACE_ENCLOSED_INITIALIZER_P (expr)
5683 && CONSTRUCTOR_IS_DIRECT_INIT (expr))
5684 /* Unless we're calling it for value-initialization from an
5685 empty list, since that is handled separately in 8.5.4. */
5686 && cand->num_convs > 0)
5688 error ("converting to %qT from initializer list would use "
5689 "explicit constructor %qD", totype, convfn);
5692 /* Set user_conv_p on the argument conversions, so rvalue/base
5693 handling knows not to allow any more UDCs. */
5694 for (i = 0; i < cand->num_convs; ++i)
5695 cand->convs[i]->user_conv_p = true;
5697 expr = build_over_call (cand, LOOKUP_NORMAL, complain);
5699 /* If this is a constructor or a function returning an aggr type,
5700 we need to build up a TARGET_EXPR. */
5701 if (DECL_CONSTRUCTOR_P (convfn))
5703 expr = build_cplus_new (totype, expr, complain);
5705 /* Remember that this was list-initialization. */
5706 if (convs->check_narrowing && expr != error_mark_node)
5707 TARGET_EXPR_LIST_INIT_P (expr) = true;
5713 expr = mark_rvalue_use (expr);
5714 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
5716 int nelts = CONSTRUCTOR_NELTS (expr);
5718 expr = build_value_init (totype, complain);
5719 else if (nelts == 1)
5720 expr = CONSTRUCTOR_ELT (expr, 0)->value;
5725 if (type_unknown_p (expr))
5726 expr = instantiate_type (totype, expr, complain);
5727 /* Convert a constant to its underlying value, unless we are
5728 about to bind it to a reference, in which case we need to
5729 leave it as an lvalue. */
5732 expr = decl_constant_value_safe (expr);
5733 if (expr == null_node && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype))
5734 /* If __null has been converted to an integer type, we do not
5735 want to warn about uses of EXPR as an integer, rather than
5737 expr = build_int_cst (totype, 0);
5741 /* We leave bad_p off ck_ambig because overload resolution considers
5742 it valid, it just fails when we try to perform it. So we need to
5743 check complain here, too. */
5744 if (complain & tf_error)
5746 /* Call build_user_type_conversion again for the error. */
5747 build_user_type_conversion (totype, convs->u.expr, LOOKUP_NORMAL);
5749 error (" initializing argument %P of %q+D", argnum, fn);
5751 return error_mark_node;
5755 /* Conversion to std::initializer_list<T>. */
5756 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype), 0);
5757 tree new_ctor = build_constructor (init_list_type_node, NULL);
5758 unsigned len = CONSTRUCTOR_NELTS (expr);
5759 tree array, val, field;
5760 VEC(constructor_elt,gc) *vec = NULL;
5763 /* Convert all the elements. */
5764 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr), ix, val)
5766 tree sub = convert_like_real (convs->u.list[ix], val, fn, argnum,
5767 1, false, false, complain);
5768 if (sub == error_mark_node)
5770 if (!BRACE_ENCLOSED_INITIALIZER_P (val))
5771 check_narrowing (TREE_TYPE (sub), val);
5772 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor), NULL_TREE, sub);
5773 if (!TREE_CONSTANT (sub))
5774 TREE_CONSTANT (new_ctor) = false;
5776 /* Build up the array. */
5777 elttype = cp_build_qualified_type
5778 (elttype, cp_type_quals (elttype) | TYPE_QUAL_CONST);
5779 array = build_array_of_n_type (elttype, len);
5780 array = finish_compound_literal (array, new_ctor, complain);
5782 /* Build up the initializer_list object. */
5783 totype = complete_type (totype);
5784 field = next_initializable_field (TYPE_FIELDS (totype));
5785 CONSTRUCTOR_APPEND_ELT (vec, field, decay_conversion (array));
5786 field = next_initializable_field (DECL_CHAIN (field));
5787 CONSTRUCTOR_APPEND_ELT (vec, field, size_int (len));
5788 new_ctor = build_constructor (totype, vec);
5789 return get_target_expr (new_ctor);
5793 if (TREE_CODE (totype) == COMPLEX_TYPE)
5795 tree real = CONSTRUCTOR_ELT (expr, 0)->value;
5796 tree imag = CONSTRUCTOR_ELT (expr, 1)->value;
5797 real = perform_implicit_conversion (TREE_TYPE (totype),
5799 imag = perform_implicit_conversion (TREE_TYPE (totype),
5801 expr = build2 (COMPLEX_EXPR, totype, real, imag);
5802 return fold_if_not_in_template (expr);
5804 return get_target_expr (digest_init (totype, expr, complain));
5810 expr = convert_like_real (convs->u.next, expr, fn, argnum,
5811 convs->kind == ck_ref_bind ? -1 : 1,
5812 convs->kind == ck_ref_bind ? issue_conversion_warnings : false,
5815 if (expr == error_mark_node)
5816 return error_mark_node;
5818 switch (convs->kind)
5821 expr = decay_conversion (expr);
5822 if (! MAYBE_CLASS_TYPE_P (totype))
5824 /* Else fall through. */
5826 if (convs->kind == ck_base && !convs->need_temporary_p)
5828 /* We are going to bind a reference directly to a base-class
5829 subobject of EXPR. */
5830 /* Build an expression for `*((base*) &expr)'. */
5831 expr = cp_build_addr_expr (expr, complain);
5832 expr = convert_to_base (expr, build_pointer_type (totype),
5833 !c_cast_p, /*nonnull=*/true, complain);
5834 expr = cp_build_indirect_ref (expr, RO_IMPLICIT_CONVERSION, complain);
5838 /* Copy-initialization where the cv-unqualified version of the source
5839 type is the same class as, or a derived class of, the class of the
5840 destination [is treated as direct-initialization]. [dcl.init] */
5841 flags = LOOKUP_NORMAL|LOOKUP_ONLYCONVERTING;
5842 if (convs->user_conv_p)
5843 /* This conversion is being done in the context of a user-defined
5844 conversion (i.e. the second step of copy-initialization), so
5845 don't allow any more. */
5846 flags |= LOOKUP_NO_CONVERSION;
5847 if (convs->rvaluedness_matches_p)
5848 flags |= LOOKUP_PREFER_RVALUE;
5849 if (TREE_CODE (expr) == TARGET_EXPR
5850 && TARGET_EXPR_LIST_INIT_P (expr))
5851 /* Copy-list-initialization doesn't actually involve a copy. */
5853 expr = build_temp (expr, totype, flags, &diag_kind, complain);
5854 if (diag_kind && fn && complain)
5855 emit_diagnostic (diag_kind, DECL_SOURCE_LOCATION (fn), 0,
5856 " initializing argument %P of %qD", argnum, fn);
5857 return build_cplus_new (totype, expr, complain);
5861 tree ref_type = totype;
5863 if (convs->bad_p && !convs->u.next->bad_p)
5865 gcc_assert (TYPE_REF_IS_RVALUE (ref_type)
5866 && real_lvalue_p (expr));
5868 error ("cannot bind %qT lvalue to %qT",
5869 TREE_TYPE (expr), totype);
5871 error (" initializing argument %P of %q+D", argnum, fn);
5872 return error_mark_node;
5875 /* If necessary, create a temporary.
5877 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
5878 that need temporaries, even when their types are reference
5879 compatible with the type of reference being bound, so the
5880 upcoming call to cp_build_addr_expr doesn't fail. */
5881 if (convs->need_temporary_p
5882 || TREE_CODE (expr) == CONSTRUCTOR
5883 || TREE_CODE (expr) == VA_ARG_EXPR)
5885 /* Otherwise, a temporary of type "cv1 T1" is created and
5886 initialized from the initializer expression using the rules
5887 for a non-reference copy-initialization (8.5). */
5889 tree type = TREE_TYPE (ref_type);
5890 cp_lvalue_kind lvalue = real_lvalue_p (expr);
5892 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5893 (type, convs->u.next->type));
5894 if (!CP_TYPE_CONST_NON_VOLATILE_P (type)
5895 && !TYPE_REF_IS_RVALUE (ref_type))
5897 /* If the reference is volatile or non-const, we
5898 cannot create a temporary. */
5899 if (lvalue & clk_bitfield)
5900 error ("cannot bind bitfield %qE to %qT",
5902 else if (lvalue & clk_packed)
5903 error ("cannot bind packed field %qE to %qT",
5906 error ("cannot bind rvalue %qE to %qT", expr, ref_type);
5907 return error_mark_node;
5909 /* If the source is a packed field, and we must use a copy
5910 constructor, then building the target expr will require
5911 binding the field to the reference parameter to the
5912 copy constructor, and we'll end up with an infinite
5913 loop. If we can use a bitwise copy, then we'll be
5915 if ((lvalue & clk_packed)
5916 && CLASS_TYPE_P (type)
5917 && type_has_nontrivial_copy_init (type))
5919 error ("cannot bind packed field %qE to %qT",
5921 return error_mark_node;
5923 if (lvalue & clk_bitfield)
5925 expr = convert_bitfield_to_declared_type (expr);
5926 expr = fold_convert (type, expr);
5928 expr = build_target_expr_with_type (expr, type, complain);
5931 /* Take the address of the thing to which we will bind the
5933 expr = cp_build_addr_expr (expr, complain);
5934 if (expr == error_mark_node)
5935 return error_mark_node;
5937 /* Convert it to a pointer to the type referred to by the
5938 reference. This will adjust the pointer if a derived to
5939 base conversion is being performed. */
5940 expr = cp_convert (build_pointer_type (TREE_TYPE (ref_type)),
5942 /* Convert the pointer to the desired reference type. */
5943 return build_nop (ref_type, expr);
5947 return decay_conversion (expr);
5950 /* Warn about deprecated conversion if appropriate. */
5951 string_conv_p (totype, expr, 1);
5956 expr = convert_to_base (expr, totype, !c_cast_p,
5957 /*nonnull=*/false, complain);
5958 return build_nop (totype, expr);
5961 return convert_ptrmem (totype, expr, /*allow_inverse_p=*/false,
5962 c_cast_p, complain);
5968 if (convs->check_narrowing)
5969 check_narrowing (totype, expr);
5971 if (issue_conversion_warnings && (complain & tf_warning))
5972 expr = convert_and_check (totype, expr);
5974 expr = convert (totype, expr);
5979 /* ARG is being passed to a varargs function. Perform any conversions
5980 required. Return the converted value. */
5983 convert_arg_to_ellipsis (tree arg)
5989 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
5990 standard conversions are performed. */
5991 arg = decay_conversion (arg);
5992 arg_type = TREE_TYPE (arg);
5995 If the argument has integral or enumeration type that is subject
5996 to the integral promotions (_conv.prom_), or a floating point
5997 type that is subject to the floating point promotion
5998 (_conv.fpprom_), the value of the argument is converted to the
5999 promoted type before the call. */
6000 if (TREE_CODE (arg_type) == REAL_TYPE
6001 && (TYPE_PRECISION (arg_type)
6002 < TYPE_PRECISION (double_type_node))
6003 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type)))
6005 if (warn_double_promotion && !c_inhibit_evaluation_warnings)
6006 warning (OPT_Wdouble_promotion,
6007 "implicit conversion from %qT to %qT when passing "
6008 "argument to function",
6009 arg_type, double_type_node);
6010 arg = convert_to_real (double_type_node, arg);
6012 else if (NULLPTR_TYPE_P (arg_type))
6013 arg = null_pointer_node;
6014 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type))
6016 if (SCOPED_ENUM_P (arg_type) && !abi_version_at_least (6))
6018 warning (OPT_Wabi, "scoped enum %qT will not promote to an "
6019 "integral type in a future version of GCC", arg_type);
6020 arg = cp_convert (ENUM_UNDERLYING_TYPE (arg_type), arg);
6022 arg = perform_integral_promotions (arg);
6025 arg = require_complete_type (arg);
6026 arg_type = TREE_TYPE (arg);
6028 if (arg != error_mark_node
6029 /* In a template (or ill-formed code), we can have an incomplete type
6030 even after require_complete_type, in which case we don't know
6031 whether it has trivial copy or not. */
6032 && COMPLETE_TYPE_P (arg_type))
6034 /* Build up a real lvalue-to-rvalue conversion in case the
6035 copy constructor is trivial but not callable. */
6036 if (!cp_unevaluated_operand && CLASS_TYPE_P (arg_type))
6037 force_rvalue (arg, tf_warning_or_error);
6039 /* [expr.call] 5.2.2/7:
6040 Passing a potentially-evaluated argument of class type (Clause 9)
6041 with a non-trivial copy constructor or a non-trivial destructor
6042 with no corresponding parameter is conditionally-supported, with
6043 implementation-defined semantics.
6045 We used to just warn here and do a bitwise copy, but now
6046 cp_expr_size will abort if we try to do that.
6048 If the call appears in the context of a sizeof expression,
6049 it is not potentially-evaluated. */
6050 if (cp_unevaluated_operand == 0
6051 && (type_has_nontrivial_copy_init (arg_type)
6052 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type)))
6053 error ("cannot pass objects of non-trivially-copyable "
6054 "type %q#T through %<...%>", arg_type);
6060 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
6063 build_x_va_arg (tree expr, tree type)
6065 if (processing_template_decl)
6066 return build_min (VA_ARG_EXPR, type, expr);
6068 type = complete_type_or_else (type, NULL_TREE);
6070 if (expr == error_mark_node || !type)
6071 return error_mark_node;
6073 expr = mark_lvalue_use (expr);
6075 if (type_has_nontrivial_copy_init (type)
6076 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
6077 || TREE_CODE (type) == REFERENCE_TYPE)
6079 /* Remove reference types so we don't ICE later on. */
6080 tree type1 = non_reference (type);
6081 /* conditionally-supported behavior [expr.call] 5.2.2/7. */
6082 error ("cannot receive objects of non-trivially-copyable type %q#T "
6083 "through %<...%>; ", type);
6084 expr = convert (build_pointer_type (type1), null_node);
6085 expr = cp_build_indirect_ref (expr, RO_NULL, tf_warning_or_error);
6089 return build_va_arg (input_location, expr, type);
6092 /* TYPE has been given to va_arg. Apply the default conversions which
6093 would have happened when passed via ellipsis. Return the promoted
6094 type, or the passed type if there is no change. */
6097 cxx_type_promotes_to (tree type)
6101 /* Perform the array-to-pointer and function-to-pointer
6103 type = type_decays_to (type);
6105 promote = type_promotes_to (type);
6106 if (same_type_p (type, promote))
6112 /* ARG is a default argument expression being passed to a parameter of
6113 the indicated TYPE, which is a parameter to FN. PARMNUM is the
6114 zero-based argument number. Do any required conversions. Return
6115 the converted value. */
6117 static GTY(()) VEC(tree,gc) *default_arg_context;
6119 push_defarg_context (tree fn)
6120 { VEC_safe_push (tree, gc, default_arg_context, fn); }
6122 pop_defarg_context (void)
6123 { VEC_pop (tree, default_arg_context); }
6126 convert_default_arg (tree type, tree arg, tree fn, int parmnum)
6131 /* See through clones. */
6132 fn = DECL_ORIGIN (fn);
6134 /* Detect recursion. */
6135 FOR_EACH_VEC_ELT (tree, default_arg_context, i, t)
6138 error ("recursive evaluation of default argument for %q#D", fn);
6139 return error_mark_node;
6142 /* If the ARG is an unparsed default argument expression, the
6143 conversion cannot be performed. */
6144 if (TREE_CODE (arg) == DEFAULT_ARG)
6146 error ("call to %qD uses the default argument for parameter %P, which "
6147 "is not yet defined", fn, parmnum);
6148 return error_mark_node;
6151 push_defarg_context (fn);
6153 if (fn && DECL_TEMPLATE_INFO (fn))
6154 arg = tsubst_default_argument (fn, type, arg);
6160 The names in the expression are bound, and the semantic
6161 constraints are checked, at the point where the default
6162 expressions appears.
6164 we must not perform access checks here. */
6165 push_deferring_access_checks (dk_no_check);
6166 /* We must make a copy of ARG, in case subsequent processing
6167 alters any part of it. */
6168 arg = break_out_target_exprs (arg);
6169 if (TREE_CODE (arg) == CONSTRUCTOR)
6171 arg = digest_init (type, arg, tf_warning_or_error);
6172 arg = convert_for_initialization (0, type, arg, LOOKUP_IMPLICIT,
6173 ICR_DEFAULT_ARGUMENT, fn, parmnum,
6174 tf_warning_or_error);
6178 arg = convert_for_initialization (0, type, arg, LOOKUP_IMPLICIT,
6179 ICR_DEFAULT_ARGUMENT, fn, parmnum,
6180 tf_warning_or_error);
6181 arg = convert_for_arg_passing (type, arg);
6183 pop_deferring_access_checks();
6185 pop_defarg_context ();
6190 /* Returns the type which will really be used for passing an argument of
6194 type_passed_as (tree type)
6196 /* Pass classes with copy ctors by invisible reference. */
6197 if (TREE_ADDRESSABLE (type))
6199 type = build_reference_type (type);
6200 /* There are no other pointers to this temporary. */
6201 type = cp_build_qualified_type (type, TYPE_QUAL_RESTRICT);
6203 else if (targetm.calls.promote_prototypes (type)
6204 && INTEGRAL_TYPE_P (type)
6205 && COMPLETE_TYPE_P (type)
6206 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type),
6207 TYPE_SIZE (integer_type_node)))
6208 type = integer_type_node;
6213 /* Actually perform the appropriate conversion. */
6216 convert_for_arg_passing (tree type, tree val)
6220 /* If VAL is a bitfield, then -- since it has already been converted
6221 to TYPE -- it cannot have a precision greater than TYPE.
6223 If it has a smaller precision, we must widen it here. For
6224 example, passing "int f:3;" to a function expecting an "int" will
6225 not result in any conversion before this point.
6227 If the precision is the same we must not risk widening. For
6228 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
6229 often have type "int", even though the C++ type for the field is
6230 "long long". If the value is being passed to a function
6231 expecting an "int", then no conversions will be required. But,
6232 if we call convert_bitfield_to_declared_type, the bitfield will
6233 be converted to "long long". */
6234 bitfield_type = is_bitfield_expr_with_lowered_type (val);
6236 && TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type))
6237 val = convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type), val);
6239 if (val == error_mark_node)
6241 /* Pass classes with copy ctors by invisible reference. */
6242 else if (TREE_ADDRESSABLE (type))
6243 val = build1 (ADDR_EXPR, build_reference_type (type), val);
6244 else if (targetm.calls.promote_prototypes (type)
6245 && INTEGRAL_TYPE_P (type)
6246 && COMPLETE_TYPE_P (type)
6247 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type),
6248 TYPE_SIZE (integer_type_node)))
6249 val = perform_integral_promotions (val);
6250 if (warn_missing_format_attribute)
6252 tree rhstype = TREE_TYPE (val);
6253 const enum tree_code coder = TREE_CODE (rhstype);
6254 const enum tree_code codel = TREE_CODE (type);
6255 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
6257 && check_missing_format_attribute (type, rhstype))
6258 warning (OPT_Wmissing_format_attribute,
6259 "argument of function call might be a candidate for a format attribute");
6264 /* Returns true iff FN is a function with magic varargs, i.e. ones for
6265 which no conversions at all should be done. This is true for some
6266 builtins which don't act like normal functions. */
6269 magic_varargs_p (tree fn)
6271 if (DECL_BUILT_IN (fn))
6272 switch (DECL_FUNCTION_CODE (fn))
6274 case BUILT_IN_CLASSIFY_TYPE:
6275 case BUILT_IN_CONSTANT_P:
6276 case BUILT_IN_NEXT_ARG:
6277 case BUILT_IN_VA_START:
6281 return lookup_attribute ("type generic",
6282 TYPE_ATTRIBUTES (TREE_TYPE (fn))) != 0;
6288 /* Subroutine of the various build_*_call functions. Overload resolution
6289 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
6290 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
6291 bitmask of various LOOKUP_* flags which apply to the call itself. */
6294 build_over_call (struct z_candidate *cand, int flags, tsubst_flags_t complain)
6297 const VEC(tree,gc) *args = cand->args;
6298 tree first_arg = cand->first_arg;
6299 conversion **convs = cand->convs;
6301 tree parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
6306 unsigned int arg_index = 0;
6310 bool already_used = false;
6312 /* In a template, there is no need to perform all of the work that
6313 is normally done. We are only interested in the type of the call
6314 expression, i.e., the return type of the function. Any semantic
6315 errors will be deferred until the template is instantiated. */
6316 if (processing_template_decl)
6320 const tree *argarray;
6323 return_type = TREE_TYPE (TREE_TYPE (fn));
6324 nargs = VEC_length (tree, args);
6325 if (first_arg == NULL_TREE)
6326 argarray = VEC_address (tree, CONST_CAST (VEC(tree,gc) *, args));
6334 alcarray = XALLOCAVEC (tree, nargs);
6335 alcarray[0] = first_arg;
6336 FOR_EACH_VEC_ELT (tree, args, ix, arg)
6337 alcarray[ix + 1] = arg;
6338 argarray = alcarray;
6340 expr = build_call_array_loc (input_location,
6341 return_type, build_addr_func (fn), nargs,
6343 if (TREE_THIS_VOLATILE (fn) && cfun)
6344 current_function_returns_abnormally = 1;
6345 return convert_from_reference (expr);
6348 /* Give any warnings we noticed during overload resolution. */
6349 if (cand->warnings && (complain & tf_warning))
6351 struct candidate_warning *w;
6352 for (w = cand->warnings; w; w = w->next)
6353 joust (cand, w->loser, 1);
6356 /* Make =delete work with SFINAE. */
6357 if (DECL_DELETED_FN (fn) && !(complain & tf_error))
6358 return error_mark_node;
6360 if (DECL_FUNCTION_MEMBER_P (fn))
6363 /* If FN is a template function, two cases must be considered.
6368 template <class T> void f();
6370 template <class T> struct B {
6374 struct C : A, B<int> {
6376 using B<int>::g; // #2
6379 In case #1 where `A::f' is a member template, DECL_ACCESS is
6380 recorded in the primary template but not in its specialization.
6381 We check access of FN using its primary template.
6383 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
6384 because it is a member of class template B, DECL_ACCESS is
6385 recorded in the specialization `B<int>::g'. We cannot use its
6386 primary template because `B<T>::g' and `B<int>::g' may have
6387 different access. */
6388 if (DECL_TEMPLATE_INFO (fn)
6389 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
6390 access_fn = DECL_TI_TEMPLATE (fn);
6393 if (flags & LOOKUP_SPECULATIVE)
6395 if (!speculative_access_check (cand->access_path, access_fn, fn,
6396 !!(flags & LOOKUP_COMPLAIN)))
6397 return error_mark_node;
6400 perform_or_defer_access_check (cand->access_path, access_fn, fn);
6403 /* If we're checking for implicit delete, don't bother with argument
6405 if (flags & LOOKUP_SPECULATIVE)
6407 if (DECL_DELETED_FN (fn))
6409 if (flags & LOOKUP_COMPLAIN)
6411 return error_mark_node;
6413 if (cand->viable == 1)
6415 else if (!(flags & LOOKUP_COMPLAIN))
6416 /* Reject bad conversions now. */
6417 return error_mark_node;
6418 /* else continue to get conversion error. */
6421 /* Find maximum size of vector to hold converted arguments. */
6422 parmlen = list_length (parm);
6423 nargs = VEC_length (tree, args) + (first_arg != NULL_TREE ? 1 : 0);
6424 if (parmlen > nargs)
6426 argarray = XALLOCAVEC (tree, nargs);
6428 /* The implicit parameters to a constructor are not considered by overload
6429 resolution, and must be of the proper type. */
6430 if (DECL_CONSTRUCTOR_P (fn))
6432 if (first_arg != NULL_TREE)
6434 argarray[j++] = first_arg;
6435 first_arg = NULL_TREE;
6439 argarray[j++] = VEC_index (tree, args, arg_index);
6442 parm = TREE_CHAIN (parm);
6443 /* We should never try to call the abstract constructor. */
6444 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn));
6446 if (DECL_HAS_VTT_PARM_P (fn))
6448 argarray[j++] = VEC_index (tree, args, arg_index);
6450 parm = TREE_CHAIN (parm);
6453 /* Bypass access control for 'this' parameter. */
6454 else if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
6456 tree parmtype = TREE_VALUE (parm);
6457 tree arg = (first_arg != NULL_TREE
6459 : VEC_index (tree, args, arg_index));
6460 tree argtype = TREE_TYPE (arg);
6464 if (convs[i]->bad_p)
6466 if (complain & tf_error)
6467 permerror (input_location, "passing %qT as %<this%> argument of %q#D discards qualifiers",
6468 TREE_TYPE (argtype), fn);
6470 return error_mark_node;
6473 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
6474 X is called for an object that is not of type X, or of a type
6475 derived from X, the behavior is undefined.
6477 So we can assume that anything passed as 'this' is non-null, and
6478 optimize accordingly. */
6479 gcc_assert (TREE_CODE (parmtype) == POINTER_TYPE);
6480 /* Convert to the base in which the function was declared. */
6481 gcc_assert (cand->conversion_path != NULL_TREE);
6482 converted_arg = build_base_path (PLUS_EXPR,
6484 cand->conversion_path,
6486 /* Check that the base class is accessible. */
6487 if (!accessible_base_p (TREE_TYPE (argtype),
6488 BINFO_TYPE (cand->conversion_path), true))
6489 error ("%qT is not an accessible base of %qT",
6490 BINFO_TYPE (cand->conversion_path),
6491 TREE_TYPE (argtype));
6492 /* If fn was found by a using declaration, the conversion path
6493 will be to the derived class, not the base declaring fn. We
6494 must convert from derived to base. */
6495 base_binfo = lookup_base (TREE_TYPE (TREE_TYPE (converted_arg)),
6496 TREE_TYPE (parmtype), ba_unique, NULL);
6497 converted_arg = build_base_path (PLUS_EXPR, converted_arg,
6498 base_binfo, 1, complain);
6500 argarray[j++] = converted_arg;
6501 parm = TREE_CHAIN (parm);
6502 if (first_arg != NULL_TREE)
6503 first_arg = NULL_TREE;
6510 gcc_assert (first_arg == NULL_TREE);
6511 for (; arg_index < VEC_length (tree, args) && parm;
6512 parm = TREE_CHAIN (parm), ++arg_index, ++i)
6514 tree type = TREE_VALUE (parm);
6515 tree arg = VEC_index (tree, args, arg_index);
6516 bool conversion_warning = true;
6520 /* If the argument is NULL and used to (implicitly) instantiate a
6521 template function (and bind one of the template arguments to
6522 the type of 'long int'), we don't want to warn about passing NULL
6523 to non-pointer argument.
6524 For example, if we have this template function:
6526 template<typename T> void func(T x) {}
6528 we want to warn (when -Wconversion is enabled) in this case:
6534 but not in this case:
6540 if (arg == null_node
6541 && DECL_TEMPLATE_INFO (fn)
6542 && cand->template_decl
6543 && !(flags & LOOKUP_EXPLICIT_TMPL_ARGS))
6544 conversion_warning = false;
6546 /* Warn about initializer_list deduction that isn't currently in the
6548 if (cxx_dialect > cxx98
6549 && flag_deduce_init_list
6550 && cand->template_decl
6551 && is_std_init_list (non_reference (type))
6552 && BRACE_ENCLOSED_INITIALIZER_P (arg))
6554 tree tmpl = TI_TEMPLATE (cand->template_decl);
6555 tree realparm = chain_index (j, DECL_ARGUMENTS (cand->fn));
6556 tree patparm = get_pattern_parm (realparm, tmpl);
6557 tree pattype = TREE_TYPE (patparm);
6558 if (PACK_EXPANSION_P (pattype))
6559 pattype = PACK_EXPANSION_PATTERN (pattype);
6560 pattype = non_reference (pattype);
6562 if (TREE_CODE (pattype) == TEMPLATE_TYPE_PARM
6563 && (cand->explicit_targs == NULL_TREE
6564 || (TREE_VEC_LENGTH (cand->explicit_targs)
6565 <= TEMPLATE_TYPE_IDX (pattype))))
6567 pedwarn (input_location, 0, "deducing %qT as %qT",
6568 non_reference (TREE_TYPE (patparm)),
6569 non_reference (type));
6570 pedwarn (input_location, 0, " in call to %q+D", cand->fn);
6571 pedwarn (input_location, 0,
6572 " (you can disable this with -fno-deduce-init-list)");
6576 val = convert_like_with_context (conv, arg, fn, i-is_method,
6579 : complain & (~tf_warning));
6581 val = convert_for_arg_passing (type, val);
6582 if (val == error_mark_node)
6583 return error_mark_node;
6585 argarray[j++] = val;
6588 /* Default arguments */
6589 for (; parm && parm != void_list_node; parm = TREE_CHAIN (parm), i++)
6590 argarray[j++] = convert_default_arg (TREE_VALUE (parm),
6591 TREE_PURPOSE (parm),
6594 for (; arg_index < VEC_length (tree, args); ++arg_index)
6596 tree a = VEC_index (tree, args, arg_index);
6597 if (magic_varargs_p (fn))
6598 /* Do no conversions for magic varargs. */
6599 a = mark_type_use (a);
6601 a = convert_arg_to_ellipsis (a);
6605 gcc_assert (j <= nargs);
6608 check_function_arguments (TREE_TYPE (fn), nargs, argarray);
6610 /* Avoid actually calling copy constructors and copy assignment operators,
6613 if (! flag_elide_constructors)
6614 /* Do things the hard way. */;
6615 else if (cand->num_convs == 1
6616 && (DECL_COPY_CONSTRUCTOR_P (fn)
6617 || DECL_MOVE_CONSTRUCTOR_P (fn)))
6620 tree arg = argarray[num_artificial_parms_for (fn)];
6622 bool trivial = trivial_fn_p (fn);
6624 /* Pull out the real argument, disregarding const-correctness. */
6626 while (CONVERT_EXPR_P (targ)
6627 || TREE_CODE (targ) == NON_LVALUE_EXPR)
6628 targ = TREE_OPERAND (targ, 0);
6629 if (TREE_CODE (targ) == ADDR_EXPR)
6631 targ = TREE_OPERAND (targ, 0);
6632 if (!same_type_ignoring_top_level_qualifiers_p
6633 (TREE_TYPE (TREE_TYPE (arg)), TREE_TYPE (targ)))
6642 arg = cp_build_indirect_ref (arg, RO_NULL, complain);
6644 /* [class.copy]: the copy constructor is implicitly defined even if
6645 the implementation elided its use. */
6646 if (!trivial || DECL_DELETED_FN (fn))
6649 already_used = true;
6652 /* If we're creating a temp and we already have one, don't create a
6653 new one. If we're not creating a temp but we get one, use
6654 INIT_EXPR to collapse the temp into our target. Otherwise, if the
6655 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
6656 temp or an INIT_EXPR otherwise. */
6658 if (integer_zerop (fa))
6660 if (TREE_CODE (arg) == TARGET_EXPR)
6663 return force_target_expr (DECL_CONTEXT (fn), arg, complain);
6665 else if (TREE_CODE (arg) == TARGET_EXPR || trivial)
6667 tree to = stabilize_reference (cp_build_indirect_ref (fa, RO_NULL,
6670 val = build2 (INIT_EXPR, DECL_CONTEXT (fn), to, arg);
6674 else if (DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR
6675 && trivial_fn_p (fn)
6676 && !DECL_DELETED_FN (fn))
6678 tree to = stabilize_reference
6679 (cp_build_indirect_ref (argarray[0], RO_NULL, complain));
6680 tree type = TREE_TYPE (to);
6681 tree as_base = CLASSTYPE_AS_BASE (type);
6682 tree arg = argarray[1];
6684 if (is_really_empty_class (type))
6686 /* Avoid copying empty classes. */
6687 val = build2 (COMPOUND_EXPR, void_type_node, to, arg);
6688 TREE_NO_WARNING (val) = 1;
6689 val = build2 (COMPOUND_EXPR, type, val, to);
6690 TREE_NO_WARNING (val) = 1;
6692 else if (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (as_base)))
6694 arg = cp_build_indirect_ref (arg, RO_NULL, complain);
6695 val = build2 (MODIFY_EXPR, TREE_TYPE (to), to, arg);
6699 /* We must only copy the non-tail padding parts. */
6701 tree array_type, alias_set;
6703 arg2 = TYPE_SIZE_UNIT (as_base);
6704 arg0 = cp_build_addr_expr (to, complain);
6706 array_type = build_array_type (char_type_node,
6708 (size_binop (MINUS_EXPR,
6709 arg2, size_int (1))));
6710 alias_set = build_int_cst (build_pointer_type (type), 0);
6711 t = build2 (MODIFY_EXPR, void_type_node,
6712 build2 (MEM_REF, array_type, arg0, alias_set),
6713 build2 (MEM_REF, array_type, arg, alias_set));
6714 val = build2 (COMPOUND_EXPR, TREE_TYPE (to), t, to);
6715 TREE_NO_WARNING (val) = 1;
6720 else if (DECL_DESTRUCTOR_P (fn)
6721 && trivial_fn_p (fn)
6722 && !DECL_DELETED_FN (fn))
6723 return fold_convert (void_type_node, argarray[0]);
6724 /* FIXME handle trivial default constructor, too. */
6729 if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0)
6732 tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (argarray[0])),
6735 gcc_assert (binfo && binfo != error_mark_node);
6737 /* Warn about deprecated virtual functions now, since we're about
6738 to throw away the decl. */
6739 if (TREE_DEPRECATED (fn))
6740 warn_deprecated_use (fn, NULL_TREE);
6742 argarray[0] = build_base_path (PLUS_EXPR, argarray[0], binfo, 1,
6744 if (TREE_SIDE_EFFECTS (argarray[0]))
6745 argarray[0] = save_expr (argarray[0]);
6746 t = build_pointer_type (TREE_TYPE (fn));
6747 if (DECL_CONTEXT (fn) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn)))
6748 fn = build_java_interface_fn_ref (fn, argarray[0]);
6750 fn = build_vfn_ref (argarray[0], DECL_VINDEX (fn));
6754 fn = build_addr_func (fn);
6756 return build_cxx_call (fn, nargs, argarray);
6759 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
6760 This function performs no overload resolution, conversion, or other
6761 high-level operations. */
6764 build_cxx_call (tree fn, int nargs, tree *argarray)
6768 /* Remember roughly where this call is. */
6769 location_t loc = EXPR_LOC_OR_HERE (fn);
6770 fn = build_call_a (fn, nargs, argarray);
6771 SET_EXPR_LOCATION (fn, loc);
6773 fndecl = get_callee_fndecl (fn);
6775 /* Check that arguments to builtin functions match the expectations. */
6777 && DECL_BUILT_IN (fndecl)
6778 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
6779 && !check_builtin_function_arguments (fndecl, nargs, argarray))
6780 return error_mark_node;
6782 /* Some built-in function calls will be evaluated at compile-time in
6784 fn = fold_if_not_in_template (fn);
6786 if (VOID_TYPE_P (TREE_TYPE (fn)))
6789 fn = require_complete_type (fn);
6790 if (fn == error_mark_node)
6791 return error_mark_node;
6793 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn)))
6794 fn = build_cplus_new (TREE_TYPE (fn), fn, tf_warning_or_error);
6795 return convert_from_reference (fn);
6798 static GTY(()) tree java_iface_lookup_fn;
6800 /* Make an expression which yields the address of the Java interface
6801 method FN. This is achieved by generating a call to libjava's
6802 _Jv_LookupInterfaceMethodIdx(). */
6805 build_java_interface_fn_ref (tree fn, tree instance)
6807 tree lookup_fn, method, idx;
6808 tree klass_ref, iface, iface_ref;
6811 if (!java_iface_lookup_fn)
6813 tree ftype = build_function_type_list (ptr_type_node,
6814 ptr_type_node, ptr_type_node,
6815 java_int_type_node, NULL_TREE);
6816 java_iface_lookup_fn
6817 = add_builtin_function ("_Jv_LookupInterfaceMethodIdx", ftype,
6818 0, NOT_BUILT_IN, NULL, NULL_TREE);
6821 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
6822 This is the first entry in the vtable. */
6823 klass_ref = build_vtbl_ref (cp_build_indirect_ref (instance, RO_NULL,
6824 tf_warning_or_error),
6827 /* Get the java.lang.Class pointer for the interface being called. */
6828 iface = DECL_CONTEXT (fn);
6829 iface_ref = lookup_field (iface, get_identifier ("class$"), 0, false);
6830 if (!iface_ref || TREE_CODE (iface_ref) != VAR_DECL
6831 || DECL_CONTEXT (iface_ref) != iface)
6833 error ("could not find class$ field in java interface type %qT",
6835 return error_mark_node;
6837 iface_ref = build_address (iface_ref);
6838 iface_ref = convert (build_pointer_type (iface), iface_ref);
6840 /* Determine the itable index of FN. */
6842 for (method = TYPE_METHODS (iface); method; method = DECL_CHAIN (method))
6844 if (!DECL_VIRTUAL_P (method))
6850 idx = build_int_cst (NULL_TREE, i);
6852 lookup_fn = build1 (ADDR_EXPR,
6853 build_pointer_type (TREE_TYPE (java_iface_lookup_fn)),
6854 java_iface_lookup_fn);
6855 return build_call_nary (ptr_type_node, lookup_fn,
6856 3, klass_ref, iface_ref, idx);
6859 /* Returns the value to use for the in-charge parameter when making a
6860 call to a function with the indicated NAME.
6862 FIXME:Can't we find a neater way to do this mapping? */
6865 in_charge_arg_for_name (tree name)
6867 if (name == base_ctor_identifier
6868 || name == base_dtor_identifier)
6869 return integer_zero_node;
6870 else if (name == complete_ctor_identifier)
6871 return integer_one_node;
6872 else if (name == complete_dtor_identifier)
6873 return integer_two_node;
6874 else if (name == deleting_dtor_identifier)
6875 return integer_three_node;
6877 /* This function should only be called with one of the names listed
6883 /* Build a call to a constructor, destructor, or an assignment
6884 operator for INSTANCE, an expression with class type. NAME
6885 indicates the special member function to call; *ARGS are the
6886 arguments. ARGS may be NULL. This may change ARGS. BINFO
6887 indicates the base of INSTANCE that is to be passed as the `this'
6888 parameter to the member function called.
6890 FLAGS are the LOOKUP_* flags to use when processing the call.
6892 If NAME indicates a complete object constructor, INSTANCE may be
6893 NULL_TREE. In this case, the caller will call build_cplus_new to
6894 store the newly constructed object into a VAR_DECL. */
6897 build_special_member_call (tree instance, tree name, VEC(tree,gc) **args,
6898 tree binfo, int flags, tsubst_flags_t complain)
6901 /* The type of the subobject to be constructed or destroyed. */
6903 VEC(tree,gc) *allocated = NULL;
6906 gcc_assert (name == complete_ctor_identifier
6907 || name == base_ctor_identifier
6908 || name == complete_dtor_identifier
6909 || name == base_dtor_identifier
6910 || name == deleting_dtor_identifier
6911 || name == ansi_assopname (NOP_EXPR));
6914 /* Resolve the name. */
6915 if (!complete_type_or_maybe_complain (binfo, NULL_TREE, complain))
6916 return error_mark_node;
6918 binfo = TYPE_BINFO (binfo);
6921 gcc_assert (binfo != NULL_TREE);
6923 class_type = BINFO_TYPE (binfo);
6925 /* Handle the special case where INSTANCE is NULL_TREE. */
6926 if (name == complete_ctor_identifier && !instance)
6928 instance = build_int_cst (build_pointer_type (class_type), 0);
6929 instance = build1 (INDIRECT_REF, class_type, instance);
6933 if (name == complete_dtor_identifier
6934 || name == base_dtor_identifier
6935 || name == deleting_dtor_identifier)
6936 gcc_assert (args == NULL || VEC_empty (tree, *args));
6938 /* Convert to the base class, if necessary. */
6939 if (!same_type_ignoring_top_level_qualifiers_p
6940 (TREE_TYPE (instance), BINFO_TYPE (binfo)))
6942 if (name != ansi_assopname (NOP_EXPR))
6943 /* For constructors and destructors, either the base is
6944 non-virtual, or it is virtual but we are doing the
6945 conversion from a constructor or destructor for the
6946 complete object. In either case, we can convert
6948 instance = convert_to_base_statically (instance, binfo);
6950 /* However, for assignment operators, we must convert
6951 dynamically if the base is virtual. */
6952 instance = build_base_path (PLUS_EXPR, instance,
6953 binfo, /*nonnull=*/1, complain);
6957 gcc_assert (instance != NULL_TREE);
6959 fns = lookup_fnfields (binfo, name, 1);
6961 /* When making a call to a constructor or destructor for a subobject
6962 that uses virtual base classes, pass down a pointer to a VTT for
6964 if ((name == base_ctor_identifier
6965 || name == base_dtor_identifier)
6966 && CLASSTYPE_VBASECLASSES (class_type))
6971 /* If the current function is a complete object constructor
6972 or destructor, then we fetch the VTT directly.
6973 Otherwise, we look it up using the VTT we were given. */
6974 vtt = DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type));
6975 vtt = decay_conversion (vtt);
6976 vtt = build3 (COND_EXPR, TREE_TYPE (vtt),
6977 build2 (EQ_EXPR, boolean_type_node,
6978 current_in_charge_parm, integer_zero_node),
6981 gcc_assert (BINFO_SUBVTT_INDEX (binfo));
6982 sub_vtt = fold_build_pointer_plus (vtt, BINFO_SUBVTT_INDEX (binfo));
6986 allocated = make_tree_vector ();
6990 VEC_safe_insert (tree, gc, *args, 0, sub_vtt);
6993 ret = build_new_method_call (instance, fns, args,
6994 TYPE_BINFO (BINFO_TYPE (binfo)),
6998 if (allocated != NULL)
6999 release_tree_vector (allocated);
7004 /* Return the NAME, as a C string. The NAME indicates a function that
7005 is a member of TYPE. *FREE_P is set to true if the caller must
7006 free the memory returned.
7008 Rather than go through all of this, we should simply set the names
7009 of constructors and destructors appropriately, and dispense with
7010 ctor_identifier, dtor_identifier, etc. */
7013 name_as_c_string (tree name, tree type, bool *free_p)
7017 /* Assume that we will not allocate memory. */
7019 /* Constructors and destructors are special. */
7020 if (IDENTIFIER_CTOR_OR_DTOR_P (name))
7023 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type))));
7024 /* For a destructor, add the '~'. */
7025 if (name == complete_dtor_identifier
7026 || name == base_dtor_identifier
7027 || name == deleting_dtor_identifier)
7029 pretty_name = concat ("~", pretty_name, NULL);
7030 /* Remember that we need to free the memory allocated. */
7034 else if (IDENTIFIER_TYPENAME_P (name))
7036 pretty_name = concat ("operator ",
7037 type_as_string_translate (TREE_TYPE (name),
7038 TFF_PLAIN_IDENTIFIER),
7040 /* Remember that we need to free the memory allocated. */
7044 pretty_name = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name)));
7049 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
7050 be set, upon return, to the function called. ARGS may be NULL.
7051 This may change ARGS. */
7054 build_new_method_call_1 (tree instance, tree fns, VEC(tree,gc) **args,
7055 tree conversion_path, int flags,
7056 tree *fn_p, tsubst_flags_t complain)
7058 struct z_candidate *candidates = 0, *cand;
7059 tree explicit_targs = NULL_TREE;
7060 tree basetype = NULL_TREE;
7063 tree first_mem_arg = NULL_TREE;
7066 bool skip_first_for_error;
7067 VEC(tree,gc) *user_args;
7070 int template_only = 0;
7074 VEC(tree,gc) *orig_args = NULL;
7077 gcc_assert (instance != NULL_TREE);
7079 /* We don't know what function we're going to call, yet. */
7083 if (error_operand_p (instance)
7084 || !fns || error_operand_p (fns))
7085 return error_mark_node;
7087 if (!BASELINK_P (fns))
7089 if (complain & tf_error)
7090 error ("call to non-function %qD", fns);
7091 return error_mark_node;
7094 orig_instance = instance;
7097 /* Dismantle the baselink to collect all the information we need. */
7098 if (!conversion_path)
7099 conversion_path = BASELINK_BINFO (fns);
7100 access_binfo = BASELINK_ACCESS_BINFO (fns);
7101 optype = BASELINK_OPTYPE (fns);
7102 fns = BASELINK_FUNCTIONS (fns);
7103 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
7105 explicit_targs = TREE_OPERAND (fns, 1);
7106 fns = TREE_OPERAND (fns, 0);
7109 gcc_assert (TREE_CODE (fns) == FUNCTION_DECL
7110 || TREE_CODE (fns) == TEMPLATE_DECL
7111 || TREE_CODE (fns) == OVERLOAD);
7112 fn = get_first_fn (fns);
7113 name = DECL_NAME (fn);
7115 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (instance));
7116 gcc_assert (CLASS_TYPE_P (basetype));
7118 if (processing_template_decl)
7120 orig_args = args == NULL ? NULL : make_tree_vector_copy (*args);
7121 instance = build_non_dependent_expr (instance);
7123 make_args_non_dependent (*args);
7126 user_args = args == NULL ? NULL : *args;
7127 /* Under DR 147 A::A() is an invalid constructor call,
7128 not a functional cast. */
7129 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
7131 if (! (complain & tf_error))
7132 return error_mark_node;
7134 permerror (input_location,
7135 "cannot call constructor %<%T::%D%> directly",
7137 permerror (input_location, " for a function-style cast, remove the "
7138 "redundant %<::%D%>", name);
7139 call = build_functional_cast (basetype, build_tree_list_vec (user_args),
7144 /* Figure out whether to skip the first argument for the error
7145 message we will display to users if an error occurs. We don't
7146 want to display any compiler-generated arguments. The "this"
7147 pointer hasn't been added yet. However, we must remove the VTT
7148 pointer if this is a call to a base-class constructor or
7150 skip_first_for_error = false;
7151 if (IDENTIFIER_CTOR_OR_DTOR_P (name))
7153 /* Callers should explicitly indicate whether they want to construct
7154 the complete object or just the part without virtual bases. */
7155 gcc_assert (name != ctor_identifier);
7156 /* Similarly for destructors. */
7157 gcc_assert (name != dtor_identifier);
7158 /* Remove the VTT pointer, if present. */
7159 if ((name == base_ctor_identifier || name == base_dtor_identifier)
7160 && CLASSTYPE_VBASECLASSES (basetype))
7161 skip_first_for_error = true;
7164 /* Process the argument list. */
7165 if (args != NULL && *args != NULL)
7167 *args = resolve_args (*args, complain);
7169 return error_mark_node;
7172 instance_ptr = build_this (instance);
7174 /* It's OK to call destructors and constructors on cv-qualified objects.
7175 Therefore, convert the INSTANCE_PTR to the unqualified type, if
7177 if (DECL_DESTRUCTOR_P (fn)
7178 || DECL_CONSTRUCTOR_P (fn))
7180 tree type = build_pointer_type (basetype);
7181 if (!same_type_p (type, TREE_TYPE (instance_ptr)))
7182 instance_ptr = build_nop (type, instance_ptr);
7184 if (DECL_DESTRUCTOR_P (fn))
7185 name = complete_dtor_identifier;
7187 first_mem_arg = instance_ptr;
7189 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7190 p = conversion_obstack_alloc (0);
7192 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
7193 initializer, not T({ }). */
7194 if (DECL_CONSTRUCTOR_P (fn) && args != NULL && !VEC_empty (tree, *args)
7195 && BRACE_ENCLOSED_INITIALIZER_P (VEC_index (tree, *args, 0))
7196 && CONSTRUCTOR_IS_DIRECT_INIT (VEC_index (tree, *args, 0)))
7198 tree init_list = VEC_index (tree, *args, 0);
7199 tree init = NULL_TREE;
7201 gcc_assert (VEC_length (tree, *args) == 1
7202 && !(flags & LOOKUP_ONLYCONVERTING));
7204 /* If the initializer list has no elements and T is a class type with
7205 a default constructor, the object is value-initialized. Handle
7206 this here so we don't need to handle it wherever we use
7207 build_special_member_call. */
7208 if (CONSTRUCTOR_NELTS (init_list) == 0
7209 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype)
7210 && !processing_template_decl)
7211 init = build_value_init (basetype, complain);
7213 /* If BASETYPE is an aggregate, we need to do aggregate
7215 else if (CP_AGGREGATE_TYPE_P (basetype))
7216 init = digest_init (basetype, init_list, complain);
7221 if (integer_zerop (instance_ptr))
7222 return get_target_expr_sfinae (init, complain);
7223 ob = build_fold_indirect_ref (instance_ptr);
7224 init = build2 (INIT_EXPR, TREE_TYPE (ob), ob, init);
7225 TREE_SIDE_EFFECTS (init) = true;
7229 /* Otherwise go ahead with overload resolution. */
7230 add_list_candidates (fns, first_mem_arg, init_list,
7231 basetype, explicit_targs, template_only,
7232 conversion_path, access_binfo, flags, &candidates);
7236 add_candidates (fns, first_mem_arg, user_args, optype,
7237 explicit_targs, template_only, conversion_path,
7238 access_binfo, flags, &candidates);
7240 any_viable_p = false;
7241 candidates = splice_viable (candidates, pedantic, &any_viable_p);
7245 if (complain & tf_error)
7247 if (!COMPLETE_OR_OPEN_TYPE_P (basetype))
7248 cxx_incomplete_type_error (instance_ptr, basetype);
7250 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
7251 basetype, optype, build_tree_list_vec (user_args),
7252 TREE_TYPE (TREE_TYPE (instance_ptr)));
7259 pretty_name = name_as_c_string (name, basetype, &free_p);
7260 arglist = build_tree_list_vec (user_args);
7261 if (skip_first_for_error)
7262 arglist = TREE_CHAIN (arglist);
7263 error ("no matching function for call to %<%T::%s(%A)%#V%>",
7264 basetype, pretty_name, arglist,
7265 TREE_TYPE (TREE_TYPE (instance_ptr)));
7269 print_z_candidates (location_of (name), candidates);
7271 call = error_mark_node;
7275 cand = tourney (candidates);
7282 if (complain & tf_error)
7284 pretty_name = name_as_c_string (name, basetype, &free_p);
7285 arglist = build_tree_list_vec (user_args);
7286 if (skip_first_for_error)
7287 arglist = TREE_CHAIN (arglist);
7288 error ("call of overloaded %<%s(%A)%> is ambiguous", pretty_name,
7290 print_z_candidates (location_of (name), candidates);
7294 call = error_mark_node;
7300 if (!(flags & LOOKUP_NONVIRTUAL)
7301 && DECL_PURE_VIRTUAL_P (fn)
7302 && instance == current_class_ref
7303 && (DECL_CONSTRUCTOR_P (current_function_decl)
7304 || DECL_DESTRUCTOR_P (current_function_decl))
7305 && (complain & tf_warning))
7306 /* This is not an error, it is runtime undefined
7308 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl) ?
7309 "pure virtual %q#D called from constructor"
7310 : "pure virtual %q#D called from destructor"),
7313 if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE
7314 && is_dummy_object (instance_ptr))
7316 if (complain & tf_error)
7317 error ("cannot call member function %qD without object",
7319 call = error_mark_node;
7323 /* Optimize away vtable lookup if we know that this function
7324 can't be overridden. */
7325 if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL)
7326 && (resolves_to_fixed_type_p (instance, 0)
7327 || DECL_FINAL_P (fn) || CLASSTYPE_FINAL (basetype)))
7328 flags |= LOOKUP_NONVIRTUAL;
7330 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
7331 /* Now we know what function is being called. */
7334 /* Build the actual CALL_EXPR. */
7335 call = build_over_call (cand, flags, complain);
7336 /* In an expression of the form `a->f()' where `f' turns
7337 out to be a static member function, `a' is
7338 none-the-less evaluated. */
7339 if (TREE_CODE (TREE_TYPE (fn)) != METHOD_TYPE
7340 && !is_dummy_object (instance_ptr)
7341 && TREE_SIDE_EFFECTS (instance_ptr))
7342 call = build2 (COMPOUND_EXPR, TREE_TYPE (call),
7343 instance_ptr, call);
7344 else if (call != error_mark_node
7345 && DECL_DESTRUCTOR_P (cand->fn)
7346 && !VOID_TYPE_P (TREE_TYPE (call)))
7347 /* An explicit call of the form "x->~X()" has type
7348 "void". However, on platforms where destructors
7349 return "this" (i.e., those where
7350 targetm.cxx.cdtor_returns_this is true), such calls
7351 will appear to have a return value of pointer type
7352 to the low-level call machinery. We do not want to
7353 change the low-level machinery, since we want to be
7354 able to optimize "delete f()" on such platforms as
7355 "operator delete(~X(f()))" (rather than generating
7356 "t = f(), ~X(t), operator delete (t)"). */
7357 call = build_nop (void_type_node, call);
7362 if (processing_template_decl && call != error_mark_node)
7364 bool cast_to_void = false;
7366 if (TREE_CODE (call) == COMPOUND_EXPR)
7367 call = TREE_OPERAND (call, 1);
7368 else if (TREE_CODE (call) == NOP_EXPR)
7370 cast_to_void = true;
7371 call = TREE_OPERAND (call, 0);
7373 if (TREE_CODE (call) == INDIRECT_REF)
7374 call = TREE_OPERAND (call, 0);
7375 call = (build_min_non_dep_call_vec
7377 build_min (COMPONENT_REF, TREE_TYPE (CALL_EXPR_FN (call)),
7378 orig_instance, orig_fns, NULL_TREE),
7380 call = convert_from_reference (call);
7382 call = build_nop (void_type_node, call);
7385 /* Free all the conversions we allocated. */
7386 obstack_free (&conversion_obstack, p);
7388 if (orig_args != NULL)
7389 release_tree_vector (orig_args);
7394 /* Wrapper for above. */
7397 build_new_method_call (tree instance, tree fns, VEC(tree,gc) **args,
7398 tree conversion_path, int flags,
7399 tree *fn_p, tsubst_flags_t complain)
7402 bool subtime = timevar_cond_start (TV_OVERLOAD);
7403 ret = build_new_method_call_1 (instance, fns, args, conversion_path, flags,
7405 timevar_cond_stop (TV_OVERLOAD, subtime);
7409 /* Returns true iff standard conversion sequence ICS1 is a proper
7410 subsequence of ICS2. */
7413 is_subseq (conversion *ics1, conversion *ics2)
7415 /* We can assume that a conversion of the same code
7416 between the same types indicates a subsequence since we only get
7417 here if the types we are converting from are the same. */
7419 while (ics1->kind == ck_rvalue
7420 || ics1->kind == ck_lvalue)
7421 ics1 = ics1->u.next;
7425 while (ics2->kind == ck_rvalue
7426 || ics2->kind == ck_lvalue)
7427 ics2 = ics2->u.next;
7429 if (ics2->kind == ck_user
7430 || ics2->kind == ck_ambig
7431 || ics2->kind == ck_aggr
7432 || ics2->kind == ck_list
7433 || ics2->kind == ck_identity)
7434 /* At this point, ICS1 cannot be a proper subsequence of
7435 ICS2. We can get a USER_CONV when we are comparing the
7436 second standard conversion sequence of two user conversion
7440 ics2 = ics2->u.next;
7442 if (ics2->kind == ics1->kind
7443 && same_type_p (ics2->type, ics1->type)
7444 && same_type_p (ics2->u.next->type,
7445 ics1->u.next->type))
7450 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
7451 be any _TYPE nodes. */
7454 is_properly_derived_from (tree derived, tree base)
7456 if (!CLASS_TYPE_P (derived) || !CLASS_TYPE_P (base))
7459 /* We only allow proper derivation here. The DERIVED_FROM_P macro
7460 considers every class derived from itself. */
7461 return (!same_type_ignoring_top_level_qualifiers_p (derived, base)
7462 && DERIVED_FROM_P (base, derived));
7465 /* We build the ICS for an implicit object parameter as a pointer
7466 conversion sequence. However, such a sequence should be compared
7467 as if it were a reference conversion sequence. If ICS is the
7468 implicit conversion sequence for an implicit object parameter,
7469 modify it accordingly. */
7472 maybe_handle_implicit_object (conversion **ics)
7476 /* [over.match.funcs]
7478 For non-static member functions, the type of the
7479 implicit object parameter is "reference to cv X"
7480 where X is the class of which the function is a
7481 member and cv is the cv-qualification on the member
7482 function declaration. */
7483 conversion *t = *ics;
7484 tree reference_type;
7486 /* The `this' parameter is a pointer to a class type. Make the
7487 implicit conversion talk about a reference to that same class
7489 reference_type = TREE_TYPE (t->type);
7490 reference_type = build_reference_type (reference_type);
7492 if (t->kind == ck_qual)
7494 if (t->kind == ck_ptr)
7496 t = build_identity_conv (TREE_TYPE (t->type), NULL_TREE);
7497 t = direct_reference_binding (reference_type, t);
7499 t->rvaluedness_matches_p = 0;
7504 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
7505 and return the initial reference binding conversion. Otherwise,
7506 leave *ICS unchanged and return NULL. */
7509 maybe_handle_ref_bind (conversion **ics)
7511 if ((*ics)->kind == ck_ref_bind)
7513 conversion *old_ics = *ics;
7514 *ics = old_ics->u.next;
7515 (*ics)->user_conv_p = old_ics->user_conv_p;
7522 /* Compare two implicit conversion sequences according to the rules set out in
7523 [over.ics.rank]. Return values:
7525 1: ics1 is better than ics2
7526 -1: ics2 is better than ics1
7527 0: ics1 and ics2 are indistinguishable */
7530 compare_ics (conversion *ics1, conversion *ics2)
7536 tree deref_from_type1 = NULL_TREE;
7537 tree deref_from_type2 = NULL_TREE;
7538 tree deref_to_type1 = NULL_TREE;
7539 tree deref_to_type2 = NULL_TREE;
7540 conversion_rank rank1, rank2;
7542 /* REF_BINDING is nonzero if the result of the conversion sequence
7543 is a reference type. In that case REF_CONV is the reference
7544 binding conversion. */
7545 conversion *ref_conv1;
7546 conversion *ref_conv2;
7548 /* Handle implicit object parameters. */
7549 maybe_handle_implicit_object (&ics1);
7550 maybe_handle_implicit_object (&ics2);
7552 /* Handle reference parameters. */
7553 ref_conv1 = maybe_handle_ref_bind (&ics1);
7554 ref_conv2 = maybe_handle_ref_bind (&ics2);
7556 /* List-initialization sequence L1 is a better conversion sequence than
7557 list-initialization sequence L2 if L1 converts to
7558 std::initializer_list<X> for some X and L2 does not. */
7559 if (ics1->kind == ck_list && ics2->kind != ck_list)
7561 if (ics2->kind == ck_list && ics1->kind != ck_list)
7566 When comparing the basic forms of implicit conversion sequences (as
7567 defined in _over.best.ics_)
7569 --a standard conversion sequence (_over.ics.scs_) is a better
7570 conversion sequence than a user-defined conversion sequence
7571 or an ellipsis conversion sequence, and
7573 --a user-defined conversion sequence (_over.ics.user_) is a
7574 better conversion sequence than an ellipsis conversion sequence
7575 (_over.ics.ellipsis_). */
7576 rank1 = CONVERSION_RANK (ics1);
7577 rank2 = CONVERSION_RANK (ics2);
7581 else if (rank1 < rank2)
7584 if (rank1 == cr_bad)
7586 /* Both ICS are bad. We try to make a decision based on what would
7587 have happened if they'd been good. This is not an extension,
7588 we'll still give an error when we build up the call; this just
7589 helps us give a more helpful error message. */
7590 rank1 = BAD_CONVERSION_RANK (ics1);
7591 rank2 = BAD_CONVERSION_RANK (ics2);
7595 else if (rank1 < rank2)
7598 /* We couldn't make up our minds; try to figure it out below. */
7601 if (ics1->ellipsis_p)
7602 /* Both conversions are ellipsis conversions. */
7605 /* User-defined conversion sequence U1 is a better conversion sequence
7606 than another user-defined conversion sequence U2 if they contain the
7607 same user-defined conversion operator or constructor and if the sec-
7608 ond standard conversion sequence of U1 is better than the second
7609 standard conversion sequence of U2. */
7611 /* Handle list-conversion with the same code even though it isn't always
7612 ranked as a user-defined conversion and it doesn't have a second
7613 standard conversion sequence; it will still have the desired effect.
7614 Specifically, we need to do the reference binding comparison at the
7615 end of this function. */
7617 if (ics1->user_conv_p || ics1->kind == ck_list)
7622 for (t1 = ics1; t1->kind != ck_user; t1 = t1->u.next)
7623 if (t1->kind == ck_ambig || t1->kind == ck_aggr
7624 || t1->kind == ck_list)
7626 for (t2 = ics2; t2->kind != ck_user; t2 = t2->u.next)
7627 if (t2->kind == ck_ambig || t2->kind == ck_aggr
7628 || t2->kind == ck_list)
7631 if (t1->kind != t2->kind)
7633 else if (t1->kind == ck_user)
7635 if (t1->cand->fn != t2->cand->fn)
7640 /* For ambiguous or aggregate conversions, use the target type as
7641 a proxy for the conversion function. */
7642 if (!same_type_ignoring_top_level_qualifiers_p (t1->type, t2->type))
7646 /* We can just fall through here, after setting up
7647 FROM_TYPE1 and FROM_TYPE2. */
7648 from_type1 = t1->type;
7649 from_type2 = t2->type;
7656 /* We're dealing with two standard conversion sequences.
7660 Standard conversion sequence S1 is a better conversion
7661 sequence than standard conversion sequence S2 if
7663 --S1 is a proper subsequence of S2 (comparing the conversion
7664 sequences in the canonical form defined by _over.ics.scs_,
7665 excluding any Lvalue Transformation; the identity
7666 conversion sequence is considered to be a subsequence of
7667 any non-identity conversion sequence */
7670 while (t1->kind != ck_identity)
7672 from_type1 = t1->type;
7675 while (t2->kind != ck_identity)
7677 from_type2 = t2->type;
7680 /* One sequence can only be a subsequence of the other if they start with
7681 the same type. They can start with different types when comparing the
7682 second standard conversion sequence in two user-defined conversion
7684 if (same_type_p (from_type1, from_type2))
7686 if (is_subseq (ics1, ics2))
7688 if (is_subseq (ics2, ics1))
7696 --the rank of S1 is better than the rank of S2 (by the rules
7699 Standard conversion sequences are ordered by their ranks: an Exact
7700 Match is a better conversion than a Promotion, which is a better
7701 conversion than a Conversion.
7703 Two conversion sequences with the same rank are indistinguishable
7704 unless one of the following rules applies:
7706 --A conversion that does not a convert a pointer, pointer to member,
7707 or std::nullptr_t to bool is better than one that does.
7709 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
7710 so that we do not have to check it explicitly. */
7711 if (ics1->rank < ics2->rank)
7713 else if (ics2->rank < ics1->rank)
7716 to_type1 = ics1->type;
7717 to_type2 = ics2->type;
7719 /* A conversion from scalar arithmetic type to complex is worse than a
7720 conversion between scalar arithmetic types. */
7721 if (same_type_p (from_type1, from_type2)
7722 && ARITHMETIC_TYPE_P (from_type1)
7723 && ARITHMETIC_TYPE_P (to_type1)
7724 && ARITHMETIC_TYPE_P (to_type2)
7725 && ((TREE_CODE (to_type1) == COMPLEX_TYPE)
7726 != (TREE_CODE (to_type2) == COMPLEX_TYPE)))
7728 if (TREE_CODE (to_type1) == COMPLEX_TYPE)
7734 if (TYPE_PTR_P (from_type1)
7735 && TYPE_PTR_P (from_type2)
7736 && TYPE_PTR_P (to_type1)
7737 && TYPE_PTR_P (to_type2))
7739 deref_from_type1 = TREE_TYPE (from_type1);
7740 deref_from_type2 = TREE_TYPE (from_type2);
7741 deref_to_type1 = TREE_TYPE (to_type1);
7742 deref_to_type2 = TREE_TYPE (to_type2);
7744 /* The rules for pointers to members A::* are just like the rules
7745 for pointers A*, except opposite: if B is derived from A then
7746 A::* converts to B::*, not vice versa. For that reason, we
7747 switch the from_ and to_ variables here. */
7748 else if ((TYPE_PTRMEM_P (from_type1) && TYPE_PTRMEM_P (from_type2)
7749 && TYPE_PTRMEM_P (to_type1) && TYPE_PTRMEM_P (to_type2))
7750 || (TYPE_PTRMEMFUNC_P (from_type1)
7751 && TYPE_PTRMEMFUNC_P (from_type2)
7752 && TYPE_PTRMEMFUNC_P (to_type1)
7753 && TYPE_PTRMEMFUNC_P (to_type2)))
7755 deref_to_type1 = TYPE_PTRMEM_CLASS_TYPE (from_type1);
7756 deref_to_type2 = TYPE_PTRMEM_CLASS_TYPE (from_type2);
7757 deref_from_type1 = TYPE_PTRMEM_CLASS_TYPE (to_type1);
7758 deref_from_type2 = TYPE_PTRMEM_CLASS_TYPE (to_type2);
7761 if (deref_from_type1 != NULL_TREE
7762 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1))
7763 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2)))
7765 /* This was one of the pointer or pointer-like conversions.
7769 --If class B is derived directly or indirectly from class A,
7770 conversion of B* to A* is better than conversion of B* to
7771 void*, and conversion of A* to void* is better than
7772 conversion of B* to void*. */
7773 if (TREE_CODE (deref_to_type1) == VOID_TYPE
7774 && TREE_CODE (deref_to_type2) == VOID_TYPE)
7776 if (is_properly_derived_from (deref_from_type1,
7779 else if (is_properly_derived_from (deref_from_type2,
7783 else if (TREE_CODE (deref_to_type1) == VOID_TYPE
7784 || TREE_CODE (deref_to_type2) == VOID_TYPE)
7786 if (same_type_p (deref_from_type1, deref_from_type2))
7788 if (TREE_CODE (deref_to_type2) == VOID_TYPE)
7790 if (is_properly_derived_from (deref_from_type1,
7794 /* We know that DEREF_TO_TYPE1 is `void' here. */
7795 else if (is_properly_derived_from (deref_from_type1,
7800 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1))
7801 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2)))
7805 --If class B is derived directly or indirectly from class A
7806 and class C is derived directly or indirectly from B,
7808 --conversion of C* to B* is better than conversion of C* to
7811 --conversion of B* to A* is better than conversion of C* to
7813 if (same_type_p (deref_from_type1, deref_from_type2))
7815 if (is_properly_derived_from (deref_to_type1,
7818 else if (is_properly_derived_from (deref_to_type2,
7822 else if (same_type_p (deref_to_type1, deref_to_type2))
7824 if (is_properly_derived_from (deref_from_type2,
7827 else if (is_properly_derived_from (deref_from_type1,
7833 else if (CLASS_TYPE_P (non_reference (from_type1))
7834 && same_type_p (from_type1, from_type2))
7836 tree from = non_reference (from_type1);
7840 --binding of an expression of type C to a reference of type
7841 B& is better than binding an expression of type C to a
7842 reference of type A&
7844 --conversion of C to B is better than conversion of C to A, */
7845 if (is_properly_derived_from (from, to_type1)
7846 && is_properly_derived_from (from, to_type2))
7848 if (is_properly_derived_from (to_type1, to_type2))
7850 else if (is_properly_derived_from (to_type2, to_type1))
7854 else if (CLASS_TYPE_P (non_reference (to_type1))
7855 && same_type_p (to_type1, to_type2))
7857 tree to = non_reference (to_type1);
7861 --binding of an expression of type B to a reference of type
7862 A& is better than binding an expression of type C to a
7863 reference of type A&,
7865 --conversion of B to A is better than conversion of C to A */
7866 if (is_properly_derived_from (from_type1, to)
7867 && is_properly_derived_from (from_type2, to))
7869 if (is_properly_derived_from (from_type2, from_type1))
7871 else if (is_properly_derived_from (from_type1, from_type2))
7878 --S1 and S2 differ only in their qualification conversion and yield
7879 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
7880 qualification signature of type T1 is a proper subset of the cv-
7881 qualification signature of type T2 */
7882 if (ics1->kind == ck_qual
7883 && ics2->kind == ck_qual
7884 && same_type_p (from_type1, from_type2))
7886 int result = comp_cv_qual_signature (to_type1, to_type2);
7893 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
7894 to an implicit object parameter, and either S1 binds an lvalue reference
7895 to an lvalue and S2 binds an rvalue reference or S1 binds an rvalue
7896 reference to an rvalue and S2 binds an lvalue reference
7897 (C++0x draft standard, 13.3.3.2)
7899 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
7900 types to which the references refer are the same type except for
7901 top-level cv-qualifiers, and the type to which the reference
7902 initialized by S2 refers is more cv-qualified than the type to
7903 which the reference initialized by S1 refers.
7905 DR 1328 [over.match.best]: the context is an initialization by
7906 conversion function for direct reference binding (13.3.1.6) of a
7907 reference to function type, the return type of F1 is the same kind of
7908 reference (i.e. lvalue or rvalue) as the reference being initialized,
7909 and the return type of F2 is not. */
7911 if (ref_conv1 && ref_conv2)
7913 if (!ref_conv1->this_p && !ref_conv2->this_p
7914 && (ref_conv1->rvaluedness_matches_p
7915 != ref_conv2->rvaluedness_matches_p)
7916 && (same_type_p (ref_conv1->type, ref_conv2->type)
7917 || (TYPE_REF_IS_RVALUE (ref_conv1->type)
7918 != TYPE_REF_IS_RVALUE (ref_conv2->type))))
7920 return (ref_conv1->rvaluedness_matches_p
7921 - ref_conv2->rvaluedness_matches_p);
7924 if (same_type_ignoring_top_level_qualifiers_p (to_type1, to_type2))
7925 return comp_cv_qualification (TREE_TYPE (ref_conv2->type),
7926 TREE_TYPE (ref_conv1->type));
7929 /* Neither conversion sequence is better than the other. */
7933 /* The source type for this standard conversion sequence. */
7936 source_type (conversion *t)
7938 for (;; t = t->u.next)
7940 if (t->kind == ck_user
7941 || t->kind == ck_ambig
7942 || t->kind == ck_identity)
7948 /* Note a warning about preferring WINNER to LOSER. We do this by storing
7949 a pointer to LOSER and re-running joust to produce the warning if WINNER
7950 is actually used. */
7953 add_warning (struct z_candidate *winner, struct z_candidate *loser)
7955 candidate_warning *cw = (candidate_warning *)
7956 conversion_obstack_alloc (sizeof (candidate_warning));
7958 cw->next = winner->warnings;
7959 winner->warnings = cw;
7962 /* Compare two candidates for overloading as described in
7963 [over.match.best]. Return values:
7965 1: cand1 is better than cand2
7966 -1: cand2 is better than cand1
7967 0: cand1 and cand2 are indistinguishable */
7970 joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn)
7973 int off1 = 0, off2 = 0;
7977 /* Candidates that involve bad conversions are always worse than those
7979 if (cand1->viable > cand2->viable)
7981 if (cand1->viable < cand2->viable)
7984 /* If we have two pseudo-candidates for conversions to the same type,
7985 or two candidates for the same function, arbitrarily pick one. */
7986 if (cand1->fn == cand2->fn
7987 && (IS_TYPE_OR_DECL_P (cand1->fn)))
7990 /* a viable function F1
7991 is defined to be a better function than another viable function F2 if
7992 for all arguments i, ICSi(F1) is not a worse conversion sequence than
7993 ICSi(F2), and then */
7995 /* for some argument j, ICSj(F1) is a better conversion sequence than
7998 /* For comparing static and non-static member functions, we ignore
7999 the implicit object parameter of the non-static function. The
8000 standard says to pretend that the static function has an object
8001 parm, but that won't work with operator overloading. */
8002 len = cand1->num_convs;
8003 if (len != cand2->num_convs)
8005 int static_1 = DECL_STATIC_FUNCTION_P (cand1->fn);
8006 int static_2 = DECL_STATIC_FUNCTION_P (cand2->fn);
8008 gcc_assert (static_1 != static_2);
8019 for (i = 0; i < len; ++i)
8021 conversion *t1 = cand1->convs[i + off1];
8022 conversion *t2 = cand2->convs[i + off2];
8023 int comp = compare_ics (t1, t2);
8028 && (CONVERSION_RANK (t1) + CONVERSION_RANK (t2)
8029 == cr_std + cr_promotion)
8030 && t1->kind == ck_std
8031 && t2->kind == ck_std
8032 && TREE_CODE (t1->type) == INTEGER_TYPE
8033 && TREE_CODE (t2->type) == INTEGER_TYPE
8034 && (TYPE_PRECISION (t1->type)
8035 == TYPE_PRECISION (t2->type))
8036 && (TYPE_UNSIGNED (t1->u.next->type)
8037 || (TREE_CODE (t1->u.next->type)
8040 tree type = t1->u.next->type;
8042 struct z_candidate *w, *l;
8044 type1 = t1->type, type2 = t2->type,
8045 w = cand1, l = cand2;
8047 type1 = t2->type, type2 = t1->type,
8048 w = cand2, l = cand1;
8052 warning (OPT_Wsign_promo, "passing %qT chooses %qT over %qT",
8053 type, type1, type2);
8054 warning (OPT_Wsign_promo, " in call to %qD", w->fn);
8060 if (winner && comp != winner)
8069 /* warn about confusing overload resolution for user-defined conversions,
8070 either between a constructor and a conversion op, or between two
8072 if (winner && warn_conversion && cand1->second_conv
8073 && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn))
8074 && winner != compare_ics (cand1->second_conv, cand2->second_conv))
8076 struct z_candidate *w, *l;
8077 bool give_warning = false;
8080 w = cand1, l = cand2;
8082 w = cand2, l = cand1;
8084 /* We don't want to complain about `X::operator T1 ()'
8085 beating `X::operator T2 () const', when T2 is a no less
8086 cv-qualified version of T1. */
8087 if (DECL_CONTEXT (w->fn) == DECL_CONTEXT (l->fn)
8088 && !DECL_CONSTRUCTOR_P (w->fn) && !DECL_CONSTRUCTOR_P (l->fn))
8090 tree t = TREE_TYPE (TREE_TYPE (l->fn));
8091 tree f = TREE_TYPE (TREE_TYPE (w->fn));
8093 if (TREE_CODE (t) == TREE_CODE (f) && POINTER_TYPE_P (t))
8098 if (!comp_ptr_ttypes (t, f))
8099 give_warning = true;
8102 give_warning = true;
8108 tree source = source_type (w->convs[0]);
8109 if (! DECL_CONSTRUCTOR_P (w->fn))
8110 source = TREE_TYPE (source);
8111 if (warning (OPT_Wconversion, "choosing %qD over %qD", w->fn, l->fn)
8112 && warning (OPT_Wconversion, " for conversion from %qT to %qT",
8113 source, w->second_conv->type))
8115 inform (input_location, " because conversion sequence for the argument is better");
8125 /* DR 495 moved this tiebreaker above the template ones. */
8127 the context is an initialization by user-defined conversion (see
8128 _dcl.init_ and _over.match.user_) and the standard conversion
8129 sequence from the return type of F1 to the destination type (i.e.,
8130 the type of the entity being initialized) is a better conversion
8131 sequence than the standard conversion sequence from the return type
8132 of F2 to the destination type. */
8134 if (cand1->second_conv)
8136 winner = compare_ics (cand1->second_conv, cand2->second_conv);
8142 F1 is a non-template function and F2 is a template function
8145 if (!cand1->template_decl && cand2->template_decl)
8147 else if (cand1->template_decl && !cand2->template_decl)
8151 F1 and F2 are template functions and the function template for F1 is
8152 more specialized than the template for F2 according to the partial
8155 if (cand1->template_decl && cand2->template_decl)
8157 winner = more_specialized_fn
8158 (TI_TEMPLATE (cand1->template_decl),
8159 TI_TEMPLATE (cand2->template_decl),
8160 /* [temp.func.order]: The presence of unused ellipsis and default
8161 arguments has no effect on the partial ordering of function
8162 templates. add_function_candidate() will not have
8163 counted the "this" argument for constructors. */
8164 cand1->num_convs + DECL_CONSTRUCTOR_P (cand1->fn));
8169 /* Check whether we can discard a builtin candidate, either because we
8170 have two identical ones or matching builtin and non-builtin candidates.
8172 (Pedantically in the latter case the builtin which matched the user
8173 function should not be added to the overload set, but we spot it here.
8176 ... the builtin candidates include ...
8177 - do not have the same parameter type list as any non-template
8178 non-member candidate. */
8180 if (TREE_CODE (cand1->fn) == IDENTIFIER_NODE
8181 || TREE_CODE (cand2->fn) == IDENTIFIER_NODE)
8183 for (i = 0; i < len; ++i)
8184 if (!same_type_p (cand1->convs[i]->type,
8185 cand2->convs[i]->type))
8187 if (i == cand1->num_convs)
8189 if (cand1->fn == cand2->fn)
8190 /* Two built-in candidates; arbitrarily pick one. */
8192 else if (TREE_CODE (cand1->fn) == IDENTIFIER_NODE)
8193 /* cand1 is built-in; prefer cand2. */
8196 /* cand2 is built-in; prefer cand1. */
8201 /* If the two function declarations represent the same function (this can
8202 happen with declarations in multiple scopes and arg-dependent lookup),
8203 arbitrarily choose one. But first make sure the default args we're
8205 if (DECL_P (cand1->fn) && DECL_P (cand2->fn)
8206 && equal_functions (cand1->fn, cand2->fn))
8208 tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (cand1->fn));
8209 tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (cand2->fn));
8211 gcc_assert (!DECL_CONSTRUCTOR_P (cand1->fn));
8213 for (i = 0; i < len; ++i)
8215 /* Don't crash if the fn is variadic. */
8218 parms1 = TREE_CHAIN (parms1);
8219 parms2 = TREE_CHAIN (parms2);
8223 parms1 = TREE_CHAIN (parms1);
8225 parms2 = TREE_CHAIN (parms2);
8229 if (!cp_tree_equal (TREE_PURPOSE (parms1),
8230 TREE_PURPOSE (parms2)))
8234 permerror (input_location, "default argument mismatch in "
8235 "overload resolution");
8236 inform (input_location,
8237 " candidate 1: %q+#F", cand1->fn);
8238 inform (input_location,
8239 " candidate 2: %q+#F", cand2->fn);
8242 add_warning (cand1, cand2);
8245 parms1 = TREE_CHAIN (parms1);
8246 parms2 = TREE_CHAIN (parms2);
8254 /* Extension: If the worst conversion for one candidate is worse than the
8255 worst conversion for the other, take the first. */
8258 conversion_rank rank1 = cr_identity, rank2 = cr_identity;
8259 struct z_candidate *w = 0, *l = 0;
8261 for (i = 0; i < len; ++i)
8263 if (CONVERSION_RANK (cand1->convs[i+off1]) > rank1)
8264 rank1 = CONVERSION_RANK (cand1->convs[i+off1]);
8265 if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2)
8266 rank2 = CONVERSION_RANK (cand2->convs[i + off2]);
8269 winner = 1, w = cand1, l = cand2;
8271 winner = -1, w = cand2, l = cand1;
8274 /* Don't choose a deleted function over ambiguity. */
8275 if (DECL_P (w->fn) && DECL_DELETED_FN (w->fn))
8279 pedwarn (input_location, 0,
8280 "ISO C++ says that these are ambiguous, even "
8281 "though the worst conversion for the first is better than "
8282 "the worst conversion for the second:");
8283 print_z_candidate (_("candidate 1:"), w);
8284 print_z_candidate (_("candidate 2:"), l);
8292 gcc_assert (!winner);
8296 /* Given a list of candidates for overloading, find the best one, if any.
8297 This algorithm has a worst case of O(2n) (winner is last), and a best
8298 case of O(n/2) (totally ambiguous); much better than a sorting
8301 static struct z_candidate *
8302 tourney (struct z_candidate *candidates)
8304 struct z_candidate *champ = candidates, *challenger;
8306 int champ_compared_to_predecessor = 0;
8308 /* Walk through the list once, comparing each current champ to the next
8309 candidate, knocking out a candidate or two with each comparison. */
8311 for (challenger = champ->next; challenger; )
8313 fate = joust (champ, challenger, 0);
8315 challenger = challenger->next;
8320 champ = challenger->next;
8323 champ_compared_to_predecessor = 0;
8328 champ_compared_to_predecessor = 1;
8331 challenger = champ->next;
8335 /* Make sure the champ is better than all the candidates it hasn't yet
8336 been compared to. */
8338 for (challenger = candidates;
8340 && !(champ_compared_to_predecessor && challenger->next == champ);
8341 challenger = challenger->next)
8343 fate = joust (champ, challenger, 0);
8351 /* Returns nonzero if things of type FROM can be converted to TO. */
8354 can_convert (tree to, tree from)
8356 return can_convert_arg (to, from, NULL_TREE, LOOKUP_IMPLICIT);
8359 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
8362 can_convert_arg (tree to, tree from, tree arg, int flags)
8368 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8369 p = conversion_obstack_alloc (0);
8371 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
8373 ok_p = (t && !t->bad_p);
8375 /* Free all the conversions we allocated. */
8376 obstack_free (&conversion_obstack, p);
8381 /* Like can_convert_arg, but allows dubious conversions as well. */
8384 can_convert_arg_bad (tree to, tree from, tree arg, int flags)
8389 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8390 p = conversion_obstack_alloc (0);
8391 /* Try to perform the conversion. */
8392 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
8394 /* Free all the conversions we allocated. */
8395 obstack_free (&conversion_obstack, p);
8400 /* Convert EXPR to TYPE. Return the converted expression.
8402 Note that we allow bad conversions here because by the time we get to
8403 this point we are committed to doing the conversion. If we end up
8404 doing a bad conversion, convert_like will complain. */
8407 perform_implicit_conversion_flags (tree type, tree expr, tsubst_flags_t complain, int flags)
8412 if (error_operand_p (expr))
8413 return error_mark_node;
8415 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8416 p = conversion_obstack_alloc (0);
8418 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
8424 if (complain & tf_error)
8426 /* If expr has unknown type, then it is an overloaded function.
8427 Call instantiate_type to get good error messages. */
8428 if (TREE_TYPE (expr) == unknown_type_node)
8429 instantiate_type (type, expr, complain);
8430 else if (invalid_nonstatic_memfn_p (expr, complain))
8431 /* We gave an error. */;
8433 error ("could not convert %qE from %qT to %qT", expr,
8434 TREE_TYPE (expr), type);
8436 expr = error_mark_node;
8438 else if (processing_template_decl
8439 /* As a kludge, we always perform conversions between scalar
8440 types, as IMPLICIT_CONV_EXPR confuses c_finish_omp_for. */
8441 && !(SCALAR_TYPE_P (type) && SCALAR_TYPE_P (TREE_TYPE (expr))))
8443 /* In a template, we are only concerned about determining the
8444 type of non-dependent expressions, so we do not have to
8445 perform the actual conversion. But for initializers, we
8446 need to be able to perform it at instantiation
8447 (or fold_non_dependent_expr) time. */
8448 expr = build1 (IMPLICIT_CONV_EXPR, type, expr);
8449 if (!(flags & LOOKUP_ONLYCONVERTING))
8450 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true;
8453 expr = convert_like (conv, expr, complain);
8455 /* Free all the conversions we allocated. */
8456 obstack_free (&conversion_obstack, p);
8462 perform_implicit_conversion (tree type, tree expr, tsubst_flags_t complain)
8464 return perform_implicit_conversion_flags (type, expr, complain, LOOKUP_IMPLICIT);
8467 /* Convert EXPR to TYPE (as a direct-initialization) if that is
8468 permitted. If the conversion is valid, the converted expression is
8469 returned. Otherwise, NULL_TREE is returned, except in the case
8470 that TYPE is a class type; in that case, an error is issued. If
8471 C_CAST_P is true, then this direct-initialization is taking
8472 place as part of a static_cast being attempted as part of a C-style
8476 perform_direct_initialization_if_possible (tree type,
8479 tsubst_flags_t complain)
8484 if (type == error_mark_node || error_operand_p (expr))
8485 return error_mark_node;
8488 If the destination type is a (possibly cv-qualified) class type:
8490 -- If the initialization is direct-initialization ...,
8491 constructors are considered. ... If no constructor applies, or
8492 the overload resolution is ambiguous, the initialization is
8494 if (CLASS_TYPE_P (type))
8496 VEC(tree,gc) *args = make_tree_vector_single (expr);
8497 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
8498 &args, type, LOOKUP_NORMAL, complain);
8499 release_tree_vector (args);
8500 return build_cplus_new (type, expr, complain);
8503 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8504 p = conversion_obstack_alloc (0);
8506 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
8509 if (!conv || conv->bad_p)
8512 expr = convert_like_real (conv, expr, NULL_TREE, 0, 0,
8513 /*issue_conversion_warnings=*/false,
8517 /* Free all the conversions we allocated. */
8518 obstack_free (&conversion_obstack, p);
8523 /* When initializing a reference that lasts longer than a full-expression,
8524 this special rule applies:
8528 The temporary to which the reference is bound or the temporary
8529 that is the complete object to which the reference is bound
8530 persists for the lifetime of the reference.
8532 The temporaries created during the evaluation of the expression
8533 initializing the reference, except the temporary to which the
8534 reference is bound, are destroyed at the end of the
8535 full-expression in which they are created.
8537 In that case, we store the converted expression into a new
8538 VAR_DECL in a new scope.
8540 However, we want to be careful not to create temporaries when
8541 they are not required. For example, given:
8544 struct D : public B {};
8548 there is no need to copy the return value from "f"; we can just
8549 extend its lifetime. Similarly, given:
8552 struct T { operator S(); };
8556 we can extend the lifetime of the return value of the conversion
8559 The next several functions are involved in this lifetime extension. */
8561 /* DECL is a VAR_DECL whose type is a REFERENCE_TYPE. The reference
8562 is being bound to a temporary. Create and return a new VAR_DECL
8563 with the indicated TYPE; this variable will store the value to
8564 which the reference is bound. */
8567 make_temporary_var_for_ref_to_temp (tree decl, tree type)
8571 /* Create the variable. */
8572 var = create_temporary_var (type);
8574 /* Register the variable. */
8575 if (TREE_STATIC (decl))
8577 /* Namespace-scope or local static; give it a mangled name. */
8578 /* FIXME share comdat with decl? */
8581 TREE_STATIC (var) = 1;
8582 name = mangle_ref_init_variable (decl);
8583 DECL_NAME (var) = name;
8584 SET_DECL_ASSEMBLER_NAME (var, name);
8585 var = pushdecl_top_level (var);
8588 /* Create a new cleanup level if necessary. */
8589 maybe_push_cleanup_level (type);
8594 /* EXPR is the initializer for a variable DECL of reference or
8595 std::initializer_list type. Create, push and return a new VAR_DECL
8596 for the initializer so that it will live as long as DECL. Any
8597 cleanup for the new variable is returned through CLEANUP, and the
8598 code to initialize the new variable is returned through INITP. */
8601 set_up_extended_ref_temp (tree decl, tree expr, VEC(tree,gc) **cleanups,
8608 /* Create the temporary variable. */
8609 type = TREE_TYPE (expr);
8610 var = make_temporary_var_for_ref_to_temp (decl, type);
8611 layout_decl (var, 0);
8612 /* If the rvalue is the result of a function call it will be
8613 a TARGET_EXPR. If it is some other construct (such as a
8614 member access expression where the underlying object is
8615 itself the result of a function call), turn it into a
8616 TARGET_EXPR here. It is important that EXPR be a
8617 TARGET_EXPR below since otherwise the INIT_EXPR will
8618 attempt to make a bitwise copy of EXPR to initialize
8620 if (TREE_CODE (expr) != TARGET_EXPR)
8621 expr = get_target_expr (expr);
8623 if (TREE_CODE (decl) == FIELD_DECL
8624 && extra_warnings && !TREE_NO_WARNING (decl))
8626 warning (OPT_Wextra, "a temporary bound to %qD only persists "
8627 "until the constructor exits", decl);
8628 TREE_NO_WARNING (decl) = true;
8631 /* Recursively extend temps in this initializer. */
8632 TARGET_EXPR_INITIAL (expr)
8633 = extend_ref_init_temps (decl, TARGET_EXPR_INITIAL (expr), cleanups);
8635 /* If the initializer is constant, put it in DECL_INITIAL so we get
8636 static initialization and use in constant expressions. */
8637 init = maybe_constant_init (expr);
8638 if (TREE_CONSTANT (init))
8640 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
8642 /* 5.19 says that a constant expression can include an
8643 lvalue-rvalue conversion applied to "a glvalue of literal type
8644 that refers to a non-volatile temporary object initialized
8645 with a constant expression". Rather than try to communicate
8646 that this VAR_DECL is a temporary, just mark it constexpr.
8648 Currently this is only useful for initializer_list temporaries,
8649 since reference vars can't appear in constant expressions. */
8650 DECL_DECLARED_CONSTEXPR_P (var) = true;
8651 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var) = true;
8652 TREE_CONSTANT (var) = true;
8654 DECL_INITIAL (var) = init;
8658 /* Create the INIT_EXPR that will initialize the temporary
8660 init = build2 (INIT_EXPR, type, var, expr);
8661 if (at_function_scope_p ())
8663 add_decl_expr (var);
8665 if (TREE_STATIC (var))
8666 init = add_stmt_to_compound (init, register_dtor_fn (var));
8669 tree cleanup = cxx_maybe_build_cleanup (var, tf_warning_or_error);
8671 VEC_safe_push (tree, gc, *cleanups, cleanup);
8674 /* We must be careful to destroy the temporary only
8675 after its initialization has taken place. If the
8676 initialization throws an exception, then the
8677 destructor should not be run. We cannot simply
8678 transform INIT into something like:
8680 (INIT, ({ CLEANUP_STMT; }))
8682 because emit_local_var always treats the
8683 initializer as a full-expression. Thus, the
8684 destructor would run too early; it would run at the
8685 end of initializing the reference variable, rather
8686 than at the end of the block enclosing the
8689 The solution is to pass back a cleanup expression
8690 which the caller is responsible for attaching to
8691 the statement tree. */
8695 rest_of_decl_compilation (var, /*toplev=*/1, at_eof);
8696 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
8697 static_aggregates = tree_cons (NULL_TREE, var,
8705 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
8706 initializing a variable of that TYPE. */
8709 initialize_reference (tree type, tree expr,
8710 int flags, tsubst_flags_t complain)
8715 if (type == error_mark_node || error_operand_p (expr))
8716 return error_mark_node;
8718 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8719 p = conversion_obstack_alloc (0);
8721 conv = reference_binding (type, TREE_TYPE (expr), expr, /*c_cast_p=*/false,
8723 if (!conv || conv->bad_p)
8725 if (complain & tf_error)
8728 convert_like (conv, expr, complain);
8729 else if (!CP_TYPE_CONST_P (TREE_TYPE (type))
8730 && !TYPE_REF_IS_RVALUE (type)
8731 && !real_lvalue_p (expr))
8732 error ("invalid initialization of non-const reference of "
8733 "type %qT from an rvalue of type %qT",
8734 type, TREE_TYPE (expr));
8736 error ("invalid initialization of reference of type "
8737 "%qT from expression of type %qT", type,
8740 return error_mark_node;
8743 gcc_assert (conv->kind == ck_ref_bind);
8745 /* Perform the conversion. */
8746 expr = convert_like (conv, expr, complain);
8748 /* Free all the conversions we allocated. */
8749 obstack_free (&conversion_obstack, p);
8754 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
8755 which is bound either to a reference or a std::initializer_list. */
8758 extend_ref_init_temps_1 (tree decl, tree init, VEC(tree,gc) **cleanups)
8763 if (TREE_CODE (sub) != ADDR_EXPR)
8765 /* Deal with binding to a subobject. */
8766 for (p = &TREE_OPERAND (sub, 0); TREE_CODE (*p) == COMPONENT_REF; )
8767 p = &TREE_OPERAND (*p, 0);
8768 if (TREE_CODE (*p) == TARGET_EXPR)
8770 tree subinit = NULL_TREE;
8771 *p = set_up_extended_ref_temp (decl, *p, cleanups, &subinit);
8773 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), subinit, init);
8778 /* INIT is part of the initializer for DECL. If there are any
8779 reference or initializer lists being initialized, extend their
8780 lifetime to match that of DECL. */
8783 extend_ref_init_temps (tree decl, tree init, VEC(tree,gc) **cleanups)
8785 tree type = TREE_TYPE (init);
8786 if (processing_template_decl)
8788 if (TREE_CODE (type) == REFERENCE_TYPE)
8789 init = extend_ref_init_temps_1 (decl, init, cleanups);
8790 else if (is_std_init_list (type))
8792 /* The temporary array underlying a std::initializer_list
8793 is handled like a reference temporary. */
8795 if (TREE_CODE (ctor) == TARGET_EXPR)
8796 ctor = TARGET_EXPR_INITIAL (ctor);
8797 if (TREE_CODE (ctor) == CONSTRUCTOR)
8799 tree array = CONSTRUCTOR_ELT (ctor, 0)->value;
8800 array = extend_ref_init_temps_1 (decl, array, cleanups);
8801 CONSTRUCTOR_ELT (ctor, 0)->value = array;
8804 else if (TREE_CODE (init) == CONSTRUCTOR)
8808 VEC(constructor_elt,gc) *elts = CONSTRUCTOR_ELTS (init);
8809 FOR_EACH_VEC_ELT (constructor_elt, elts, i, p)
8810 p->value = extend_ref_init_temps (decl, p->value, cleanups);
8816 /* Returns true iff TYPE is some variant of std::initializer_list. */
8819 is_std_init_list (tree type)
8821 /* Look through typedefs. */
8824 type = TYPE_MAIN_VARIANT (type);
8825 return (CLASS_TYPE_P (type)
8826 && CP_TYPE_CONTEXT (type) == std_node
8827 && strcmp (TYPE_NAME_STRING (type), "initializer_list") == 0);
8830 /* Returns true iff DECL is a list constructor: i.e. a constructor which
8831 will accept an argument list of a single std::initializer_list<T>. */
8834 is_list_ctor (tree decl)
8836 tree args = FUNCTION_FIRST_USER_PARMTYPE (decl);
8839 if (!args || args == void_list_node)
8842 arg = non_reference (TREE_VALUE (args));
8843 if (!is_std_init_list (arg))
8846 args = TREE_CHAIN (args);
8848 if (args && args != void_list_node && !TREE_PURPOSE (args))
8849 /* There are more non-defaulted parms. */
8855 #include "gt-cp-call.h"