2010-11-10 Tobias Burnus <burnus@net-b.de>
[official-gcc.git] / gcc / cp / call.c
blobeb7247dad93fbde156fe1d9ff91d43cd7a265eef
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, 2010
4 Free Software Foundation, Inc.
5 Contributed by Michael Tiemann (tiemann@cygnus.com) and
6 modified by Brendan Kehoe (brendan@cygnus.com).
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 3, or (at your option)
13 any later version.
15 GCC is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
25 /* High-level class interface. */
27 #include "config.h"
28 #include "system.h"
29 #include "coretypes.h"
30 #include "tm.h"
31 #include "tree.h"
32 #include "cp-tree.h"
33 #include "output.h"
34 #include "flags.h"
35 #include "toplev.h"
36 #include "diagnostic-core.h"
37 #include "intl.h"
38 #include "target.h"
39 #include "convert.h"
40 #include "langhooks.h"
42 /* The various kinds of conversion. */
44 typedef enum conversion_kind {
45 ck_identity,
46 ck_lvalue,
47 ck_qual,
48 ck_std,
49 ck_ptr,
50 ck_pmem,
51 ck_base,
52 ck_ref_bind,
53 ck_user,
54 ck_ambig,
55 ck_list,
56 ck_aggr,
57 ck_rvalue
58 } conversion_kind;
60 /* The rank of the conversion. Order of the enumerals matters; better
61 conversions should come earlier in the list. */
63 typedef enum conversion_rank {
64 cr_identity,
65 cr_exact,
66 cr_promotion,
67 cr_std,
68 cr_pbool,
69 cr_user,
70 cr_ellipsis,
71 cr_bad
72 } conversion_rank;
74 /* An implicit conversion sequence, in the sense of [over.best.ics].
75 The first conversion to be performed is at the end of the chain.
76 That conversion is always a cr_identity conversion. */
78 typedef struct conversion conversion;
79 struct conversion {
80 /* The kind of conversion represented by this step. */
81 conversion_kind kind;
82 /* The rank of this conversion. */
83 conversion_rank rank;
84 BOOL_BITFIELD user_conv_p : 1;
85 BOOL_BITFIELD ellipsis_p : 1;
86 BOOL_BITFIELD this_p : 1;
87 BOOL_BITFIELD bad_p : 1;
88 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
89 temporary should be created to hold the result of the
90 conversion. */
91 BOOL_BITFIELD need_temporary_p : 1;
92 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
93 from a pointer-to-derived to pointer-to-base is being performed. */
94 BOOL_BITFIELD base_p : 1;
95 /* If KIND is ck_ref_bind, true when either an lvalue reference is
96 being bound to an lvalue expression or an rvalue reference is
97 being bound to an rvalue expression. */
98 BOOL_BITFIELD rvaluedness_matches_p: 1;
99 BOOL_BITFIELD check_narrowing: 1;
100 /* The type of the expression resulting from the conversion. */
101 tree type;
102 union {
103 /* The next conversion in the chain. Since the conversions are
104 arranged from outermost to innermost, the NEXT conversion will
105 actually be performed before this conversion. This variant is
106 used only when KIND is neither ck_identity nor ck_ambig. */
107 conversion *next;
108 /* The expression at the beginning of the conversion chain. This
109 variant is used only if KIND is ck_identity or ck_ambig. */
110 tree expr;
111 /* The array of conversions for an initializer_list. */
112 conversion **list;
113 } u;
114 /* The function candidate corresponding to this conversion
115 sequence. This field is only used if KIND is ck_user. */
116 struct z_candidate *cand;
119 #define CONVERSION_RANK(NODE) \
120 ((NODE)->bad_p ? cr_bad \
121 : (NODE)->ellipsis_p ? cr_ellipsis \
122 : (NODE)->user_conv_p ? cr_user \
123 : (NODE)->rank)
125 #define BAD_CONVERSION_RANK(NODE) \
126 ((NODE)->ellipsis_p ? cr_ellipsis \
127 : (NODE)->user_conv_p ? cr_user \
128 : (NODE)->rank)
130 static struct obstack conversion_obstack;
131 static bool conversion_obstack_initialized;
133 static struct z_candidate * tourney (struct z_candidate *);
134 static int equal_functions (tree, tree);
135 static int joust (struct z_candidate *, struct z_candidate *, bool);
136 static int compare_ics (conversion *, conversion *);
137 static tree build_over_call (struct z_candidate *, int, tsubst_flags_t);
138 static tree build_java_interface_fn_ref (tree, tree);
139 #define convert_like(CONV, EXPR, COMPLAIN) \
140 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
141 /*issue_conversion_warnings=*/true, \
142 /*c_cast_p=*/false, (COMPLAIN))
143 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
144 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
145 /*issue_conversion_warnings=*/true, \
146 /*c_cast_p=*/false, (COMPLAIN))
147 static tree convert_like_real (conversion *, tree, tree, int, int, bool,
148 bool, tsubst_flags_t);
149 static void op_error (enum tree_code, enum tree_code, tree, tree,
150 tree, bool);
151 static VEC(tree,gc) *resolve_args (VEC(tree,gc) *);
152 static struct z_candidate *build_user_type_conversion_1 (tree, tree, int);
153 static void print_z_candidate (const char *, struct z_candidate *);
154 static void print_z_candidates (struct z_candidate *);
155 static tree build_this (tree);
156 static struct z_candidate *splice_viable (struct z_candidate *, bool, bool *);
157 static bool any_strictly_viable (struct z_candidate *);
158 static struct z_candidate *add_template_candidate
159 (struct z_candidate **, tree, tree, tree, tree, const VEC(tree,gc) *,
160 tree, tree, tree, int, unification_kind_t);
161 static struct z_candidate *add_template_candidate_real
162 (struct z_candidate **, tree, tree, tree, tree, const VEC(tree,gc) *,
163 tree, tree, tree, int, tree, unification_kind_t);
164 static struct z_candidate *add_template_conv_candidate
165 (struct z_candidate **, tree, tree, tree, const VEC(tree,gc) *, tree,
166 tree, tree);
167 static void add_builtin_candidates
168 (struct z_candidate **, enum tree_code, enum tree_code,
169 tree, tree *, int);
170 static void add_builtin_candidate
171 (struct z_candidate **, enum tree_code, enum tree_code,
172 tree, tree, tree, tree *, tree *, int);
173 static bool is_complete (tree);
174 static void build_builtin_candidate
175 (struct z_candidate **, tree, tree, tree, tree *, tree *,
176 int);
177 static struct z_candidate *add_conv_candidate
178 (struct z_candidate **, tree, tree, tree, const VEC(tree,gc) *, tree,
179 tree);
180 static struct z_candidate *add_function_candidate
181 (struct z_candidate **, tree, tree, tree, const VEC(tree,gc) *, tree,
182 tree, int);
183 static conversion *implicit_conversion (tree, tree, tree, bool, int);
184 static conversion *standard_conversion (tree, tree, tree, bool, int);
185 static conversion *reference_binding (tree, tree, tree, bool, int);
186 static conversion *build_conv (conversion_kind, tree, conversion *);
187 static conversion *build_list_conv (tree, tree, int);
188 static bool is_subseq (conversion *, conversion *);
189 static conversion *maybe_handle_ref_bind (conversion **);
190 static void maybe_handle_implicit_object (conversion **);
191 static struct z_candidate *add_candidate
192 (struct z_candidate **, tree, tree, const VEC(tree,gc) *, size_t,
193 conversion **, tree, tree, int);
194 static tree source_type (conversion *);
195 static void add_warning (struct z_candidate *, struct z_candidate *);
196 static bool reference_compatible_p (tree, tree);
197 static conversion *convert_class_to_reference (tree, tree, tree, int);
198 static conversion *direct_reference_binding (tree, conversion *);
199 static bool promoted_arithmetic_type_p (tree);
200 static conversion *conditional_conversion (tree, tree);
201 static char *name_as_c_string (tree, tree, bool *);
202 static tree prep_operand (tree);
203 static void add_candidates (tree, tree, const VEC(tree,gc) *, tree, tree, bool,
204 tree, tree, int, struct z_candidate **);
205 static conversion *merge_conversion_sequences (conversion *, conversion *);
206 static bool magic_varargs_p (tree);
207 static tree build_temp (tree, tree, int, diagnostic_t *, tsubst_flags_t);
209 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
210 NAME can take many forms... */
212 bool
213 check_dtor_name (tree basetype, tree name)
215 /* Just accept something we've already complained about. */
216 if (name == error_mark_node)
217 return true;
219 if (TREE_CODE (name) == TYPE_DECL)
220 name = TREE_TYPE (name);
221 else if (TYPE_P (name))
222 /* OK */;
223 else if (TREE_CODE (name) == IDENTIFIER_NODE)
225 if ((MAYBE_CLASS_TYPE_P (basetype)
226 && name == constructor_name (basetype))
227 || (TREE_CODE (basetype) == ENUMERAL_TYPE
228 && name == TYPE_IDENTIFIER (basetype)))
229 return true;
230 else
231 name = get_type_value (name);
233 else
235 /* In the case of:
237 template <class T> struct S { ~S(); };
238 int i;
239 i.~S();
241 NAME will be a class template. */
242 gcc_assert (DECL_CLASS_TEMPLATE_P (name));
243 return false;
246 if (!name || name == error_mark_node)
247 return false;
248 return same_type_p (TYPE_MAIN_VARIANT (basetype), TYPE_MAIN_VARIANT (name));
251 /* We want the address of a function or method. We avoid creating a
252 pointer-to-member function. */
254 tree
255 build_addr_func (tree function)
257 tree type = TREE_TYPE (function);
259 /* We have to do these by hand to avoid real pointer to member
260 functions. */
261 if (TREE_CODE (type) == METHOD_TYPE)
263 if (TREE_CODE (function) == OFFSET_REF)
265 tree object = build_address (TREE_OPERAND (function, 0));
266 return get_member_function_from_ptrfunc (&object,
267 TREE_OPERAND (function, 1));
269 function = build_address (function);
271 else
272 function = decay_conversion (function);
274 return function;
277 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
278 POINTER_TYPE to those. Note, pointer to member function types
279 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
280 two variants. build_call_a is the primitive taking an array of
281 arguments, while build_call_n is a wrapper that handles varargs. */
283 tree
284 build_call_n (tree function, int n, ...)
286 if (n == 0)
287 return build_call_a (function, 0, NULL);
288 else
290 tree *argarray = XALLOCAVEC (tree, n);
291 va_list ap;
292 int i;
294 va_start (ap, n);
295 for (i = 0; i < n; i++)
296 argarray[i] = va_arg (ap, tree);
297 va_end (ap);
298 return build_call_a (function, n, argarray);
302 tree
303 build_call_a (tree function, int n, tree *argarray)
305 int is_constructor = 0;
306 int nothrow;
307 tree decl;
308 tree result_type;
309 tree fntype;
310 int i;
312 function = build_addr_func (function);
314 gcc_assert (TYPE_PTR_P (TREE_TYPE (function)));
315 fntype = TREE_TYPE (TREE_TYPE (function));
316 gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE
317 || TREE_CODE (fntype) == METHOD_TYPE);
318 result_type = TREE_TYPE (fntype);
319 /* An rvalue has no cv-qualifiers. */
320 if (SCALAR_TYPE_P (result_type) || VOID_TYPE_P (result_type))
321 result_type = cv_unqualified (result_type);
323 if (TREE_CODE (function) == ADDR_EXPR
324 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
326 decl = TREE_OPERAND (function, 0);
327 if (!TREE_USED (decl))
329 /* We invoke build_call directly for several library
330 functions. These may have been declared normally if
331 we're building libgcc, so we can't just check
332 DECL_ARTIFICIAL. */
333 gcc_assert (DECL_ARTIFICIAL (decl)
334 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl)),
335 "__", 2));
336 mark_used (decl);
339 else
340 decl = NULL_TREE;
342 /* We check both the decl and the type; a function may be known not to
343 throw without being declared throw(). */
344 nothrow = ((decl && TREE_NOTHROW (decl))
345 || TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (function))));
347 if (decl && TREE_THIS_VOLATILE (decl) && cfun && cp_function_chain)
348 current_function_returns_abnormally = 1;
350 if (decl && TREE_DEPRECATED (decl))
351 warn_deprecated_use (decl, NULL_TREE);
352 require_complete_eh_spec_types (fntype, decl);
354 if (decl && DECL_CONSTRUCTOR_P (decl))
355 is_constructor = 1;
357 /* Don't pass empty class objects by value. This is useful
358 for tags in STL, which are used to control overload resolution.
359 We don't need to handle other cases of copying empty classes. */
360 if (! decl || ! DECL_BUILT_IN (decl))
361 for (i = 0; i < n; i++)
362 if (is_empty_class (TREE_TYPE (argarray[i]))
363 && ! TREE_ADDRESSABLE (TREE_TYPE (argarray[i])))
365 tree t = build0 (EMPTY_CLASS_EXPR, TREE_TYPE (argarray[i]));
366 argarray[i] = build2 (COMPOUND_EXPR, TREE_TYPE (t),
367 argarray[i], t);
370 function = build_call_array_loc (input_location,
371 result_type, function, n, argarray);
372 TREE_HAS_CONSTRUCTOR (function) = is_constructor;
373 TREE_NOTHROW (function) = nothrow;
375 return function;
378 /* Build something of the form ptr->method (args)
379 or object.method (args). This can also build
380 calls to constructors, and find friends.
382 Member functions always take their class variable
383 as a pointer.
385 INSTANCE is a class instance.
387 NAME is the name of the method desired, usually an IDENTIFIER_NODE.
389 PARMS help to figure out what that NAME really refers to.
391 BASETYPE_PATH, if non-NULL, contains a chain from the type of INSTANCE
392 down to the real instance type to use for access checking. We need this
393 information to get protected accesses correct.
395 FLAGS is the logical disjunction of zero or more LOOKUP_
396 flags. See cp-tree.h for more info.
398 If this is all OK, calls build_function_call with the resolved
399 member function.
401 This function must also handle being called to perform
402 initialization, promotion/coercion of arguments, and
403 instantiation of default parameters.
405 Note that NAME may refer to an instance variable name. If
406 `operator()()' is defined for the type of that field, then we return
407 that result. */
409 /* New overloading code. */
411 typedef struct z_candidate z_candidate;
413 typedef struct candidate_warning candidate_warning;
414 struct candidate_warning {
415 z_candidate *loser;
416 candidate_warning *next;
419 struct z_candidate {
420 /* The FUNCTION_DECL that will be called if this candidate is
421 selected by overload resolution. */
422 tree fn;
423 /* If not NULL_TREE, the first argument to use when calling this
424 function. */
425 tree first_arg;
426 /* The rest of the arguments to use when calling this function. If
427 there are no further arguments this may be NULL or it may be an
428 empty vector. */
429 const VEC(tree,gc) *args;
430 /* The implicit conversion sequences for each of the arguments to
431 FN. */
432 conversion **convs;
433 /* The number of implicit conversion sequences. */
434 size_t num_convs;
435 /* If FN is a user-defined conversion, the standard conversion
436 sequence from the type returned by FN to the desired destination
437 type. */
438 conversion *second_conv;
439 int viable;
440 /* If FN is a member function, the binfo indicating the path used to
441 qualify the name of FN at the call site. This path is used to
442 determine whether or not FN is accessible if it is selected by
443 overload resolution. The DECL_CONTEXT of FN will always be a
444 (possibly improper) base of this binfo. */
445 tree access_path;
446 /* If FN is a non-static member function, the binfo indicating the
447 subobject to which the `this' pointer should be converted if FN
448 is selected by overload resolution. The type pointed to the by
449 the `this' pointer must correspond to the most derived class
450 indicated by the CONVERSION_PATH. */
451 tree conversion_path;
452 tree template_decl;
453 tree explicit_targs;
454 candidate_warning *warnings;
455 z_candidate *next;
458 /* Returns true iff T is a null pointer constant in the sense of
459 [conv.ptr]. */
461 bool
462 null_ptr_cst_p (tree t)
464 /* [conv.ptr]
466 A null pointer constant is an integral constant expression
467 (_expr.const_) rvalue of integer type that evaluates to zero or
468 an rvalue of type std::nullptr_t. */
469 if (NULLPTR_TYPE_P (TREE_TYPE (t)))
470 return true;
471 if (CP_INTEGRAL_TYPE_P (TREE_TYPE (t)))
473 if (cxx_dialect >= cxx0x)
475 t = fold_non_dependent_expr (t);
476 t = maybe_constant_value (t);
477 if (TREE_CONSTANT (t) && integer_zerop (t))
478 return true;
480 else
482 t = integral_constant_value (t);
483 STRIP_NOPS (t);
484 if (integer_zerop (t) && !TREE_OVERFLOW (t))
485 return true;
488 return false;
491 /* Returns nonzero if PARMLIST consists of only default parms and/or
492 ellipsis. */
494 bool
495 sufficient_parms_p (const_tree parmlist)
497 for (; parmlist && parmlist != void_list_node;
498 parmlist = TREE_CHAIN (parmlist))
499 if (!TREE_PURPOSE (parmlist))
500 return false;
501 return true;
504 /* Allocate N bytes of memory from the conversion obstack. The memory
505 is zeroed before being returned. */
507 static void *
508 conversion_obstack_alloc (size_t n)
510 void *p;
511 if (!conversion_obstack_initialized)
513 gcc_obstack_init (&conversion_obstack);
514 conversion_obstack_initialized = true;
516 p = obstack_alloc (&conversion_obstack, n);
517 memset (p, 0, n);
518 return p;
521 /* Dynamically allocate a conversion. */
523 static conversion *
524 alloc_conversion (conversion_kind kind)
526 conversion *c;
527 c = (conversion *) conversion_obstack_alloc (sizeof (conversion));
528 c->kind = kind;
529 return c;
532 #ifdef ENABLE_CHECKING
534 /* Make sure that all memory on the conversion obstack has been
535 freed. */
537 void
538 validate_conversion_obstack (void)
540 if (conversion_obstack_initialized)
541 gcc_assert ((obstack_next_free (&conversion_obstack)
542 == obstack_base (&conversion_obstack)));
545 #endif /* ENABLE_CHECKING */
547 /* Dynamically allocate an array of N conversions. */
549 static conversion **
550 alloc_conversions (size_t n)
552 return (conversion **) conversion_obstack_alloc (n * sizeof (conversion *));
555 static conversion *
556 build_conv (conversion_kind code, tree type, conversion *from)
558 conversion *t;
559 conversion_rank rank = CONVERSION_RANK (from);
561 /* Note that the caller is responsible for filling in t->cand for
562 user-defined conversions. */
563 t = alloc_conversion (code);
564 t->type = type;
565 t->u.next = from;
567 switch (code)
569 case ck_ptr:
570 case ck_pmem:
571 case ck_base:
572 case ck_std:
573 if (rank < cr_std)
574 rank = cr_std;
575 break;
577 case ck_qual:
578 if (rank < cr_exact)
579 rank = cr_exact;
580 break;
582 default:
583 break;
585 t->rank = rank;
586 t->user_conv_p = (code == ck_user || from->user_conv_p);
587 t->bad_p = from->bad_p;
588 t->base_p = false;
589 return t;
592 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
593 specialization of std::initializer_list<T>, if such a conversion is
594 possible. */
596 static conversion *
597 build_list_conv (tree type, tree ctor, int flags)
599 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type), 0);
600 unsigned len = CONSTRUCTOR_NELTS (ctor);
601 conversion **subconvs = alloc_conversions (len);
602 conversion *t;
603 unsigned i;
604 tree val;
606 /* Within a list-initialization we can have more user-defined
607 conversions. */
608 flags &= ~LOOKUP_NO_CONVERSION;
609 /* But no narrowing conversions. */
610 flags |= LOOKUP_NO_NARROWING;
612 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
614 conversion *sub
615 = implicit_conversion (elttype, TREE_TYPE (val), val,
616 false, flags);
617 if (sub == NULL)
618 return NULL;
620 subconvs[i] = sub;
623 t = alloc_conversion (ck_list);
624 t->type = type;
625 t->u.list = subconvs;
626 t->rank = cr_exact;
628 for (i = 0; i < len; ++i)
630 conversion *sub = subconvs[i];
631 if (sub->rank > t->rank)
632 t->rank = sub->rank;
633 if (sub->user_conv_p)
634 t->user_conv_p = true;
635 if (sub->bad_p)
636 t->bad_p = true;
639 return t;
642 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
643 is a valid aggregate initializer for array type ATYPE. */
645 static bool
646 can_convert_array (tree atype, tree ctor, int flags)
648 unsigned i;
649 tree elttype = TREE_TYPE (atype);
650 for (i = 0; i < CONSTRUCTOR_NELTS (ctor); ++i)
652 tree val = CONSTRUCTOR_ELT (ctor, i)->value;
653 bool ok;
654 if (TREE_CODE (elttype) == ARRAY_TYPE
655 && TREE_CODE (val) == CONSTRUCTOR)
656 ok = can_convert_array (elttype, val, flags);
657 else
658 ok = can_convert_arg (elttype, TREE_TYPE (val), val, flags);
659 if (!ok)
660 return false;
662 return true;
665 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
666 aggregate class, if such a conversion is possible. */
668 static conversion *
669 build_aggr_conv (tree type, tree ctor, int flags)
671 unsigned HOST_WIDE_INT i = 0;
672 conversion *c;
673 tree field = next_initializable_field (TYPE_FIELDS (type));
674 tree empty_ctor = NULL_TREE;
676 for (; field; field = next_initializable_field (DECL_CHAIN (field)))
678 tree ftype = TREE_TYPE (field);
679 tree val;
680 bool ok;
682 if (i < CONSTRUCTOR_NELTS (ctor))
683 val = CONSTRUCTOR_ELT (ctor, i)->value;
684 else
686 if (empty_ctor == NULL_TREE)
687 empty_ctor = build_constructor (init_list_type_node, NULL);
688 val = empty_ctor;
690 ++i;
692 if (TREE_CODE (ftype) == ARRAY_TYPE
693 && TREE_CODE (val) == CONSTRUCTOR)
694 ok = can_convert_array (ftype, val, flags);
695 else
696 ok = can_convert_arg (ftype, TREE_TYPE (val), val, flags);
698 if (!ok)
699 return NULL;
701 if (TREE_CODE (type) == UNION_TYPE)
702 break;
705 if (i < CONSTRUCTOR_NELTS (ctor))
706 return NULL;
708 c = alloc_conversion (ck_aggr);
709 c->type = type;
710 c->rank = cr_exact;
711 c->user_conv_p = true;
712 c->u.next = NULL;
713 return c;
716 /* Build a representation of the identity conversion from EXPR to
717 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
719 static conversion *
720 build_identity_conv (tree type, tree expr)
722 conversion *c;
724 c = alloc_conversion (ck_identity);
725 c->type = type;
726 c->u.expr = expr;
728 return c;
731 /* Converting from EXPR to TYPE was ambiguous in the sense that there
732 were multiple user-defined conversions to accomplish the job.
733 Build a conversion that indicates that ambiguity. */
735 static conversion *
736 build_ambiguous_conv (tree type, tree expr)
738 conversion *c;
740 c = alloc_conversion (ck_ambig);
741 c->type = type;
742 c->u.expr = expr;
744 return c;
747 tree
748 strip_top_quals (tree t)
750 if (TREE_CODE (t) == ARRAY_TYPE)
751 return t;
752 return cp_build_qualified_type (t, 0);
755 /* Returns the standard conversion path (see [conv]) from type FROM to type
756 TO, if any. For proper handling of null pointer constants, you must
757 also pass the expression EXPR to convert from. If C_CAST_P is true,
758 this conversion is coming from a C-style cast. */
760 static conversion *
761 standard_conversion (tree to, tree from, tree expr, bool c_cast_p,
762 int flags)
764 enum tree_code fcode, tcode;
765 conversion *conv;
766 bool fromref = false;
768 to = non_reference (to);
769 if (TREE_CODE (from) == REFERENCE_TYPE)
771 fromref = true;
772 from = TREE_TYPE (from);
774 to = strip_top_quals (to);
775 from = strip_top_quals (from);
777 if ((TYPE_PTRFN_P (to) || TYPE_PTRMEMFUNC_P (to))
778 && expr && type_unknown_p (expr))
780 tsubst_flags_t tflags = tf_conv;
781 if (!(flags & LOOKUP_PROTECT))
782 tflags |= tf_no_access_control;
783 expr = instantiate_type (to, expr, tflags);
784 if (expr == error_mark_node)
785 return NULL;
786 from = TREE_TYPE (expr);
789 fcode = TREE_CODE (from);
790 tcode = TREE_CODE (to);
792 conv = build_identity_conv (from, expr);
793 if (fcode == FUNCTION_TYPE || fcode == ARRAY_TYPE)
795 from = type_decays_to (from);
796 fcode = TREE_CODE (from);
797 conv = build_conv (ck_lvalue, from, conv);
799 else if (fromref || (expr && lvalue_p (expr)))
801 if (expr)
803 tree bitfield_type;
804 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
805 if (bitfield_type)
807 from = strip_top_quals (bitfield_type);
808 fcode = TREE_CODE (from);
811 conv = build_conv (ck_rvalue, from, conv);
814 /* Allow conversion between `__complex__' data types. */
815 if (tcode == COMPLEX_TYPE && fcode == COMPLEX_TYPE)
817 /* The standard conversion sequence to convert FROM to TO is
818 the standard conversion sequence to perform componentwise
819 conversion. */
820 conversion *part_conv = standard_conversion
821 (TREE_TYPE (to), TREE_TYPE (from), NULL_TREE, c_cast_p, flags);
823 if (part_conv)
825 conv = build_conv (part_conv->kind, to, conv);
826 conv->rank = part_conv->rank;
828 else
829 conv = NULL;
831 return conv;
834 if (same_type_p (from, to))
835 return conv;
837 /* [conv.ptr]
838 A null pointer constant can be converted to a pointer type; ... A
839 null pointer constant of integral type can be converted to an
840 rvalue of type std::nullptr_t. */
841 if ((tcode == POINTER_TYPE || TYPE_PTR_TO_MEMBER_P (to)
842 || NULLPTR_TYPE_P (to))
843 && expr && null_ptr_cst_p (expr))
844 conv = build_conv (ck_std, to, conv);
845 else if ((tcode == INTEGER_TYPE && fcode == POINTER_TYPE)
846 || (tcode == POINTER_TYPE && fcode == INTEGER_TYPE))
848 /* For backwards brain damage compatibility, allow interconversion of
849 pointers and integers with a pedwarn. */
850 conv = build_conv (ck_std, to, conv);
851 conv->bad_p = true;
853 else if (UNSCOPED_ENUM_P (to) && fcode == INTEGER_TYPE)
855 /* For backwards brain damage compatibility, allow interconversion of
856 enums and integers with a pedwarn. */
857 conv = build_conv (ck_std, to, conv);
858 conv->bad_p = true;
860 else if ((tcode == POINTER_TYPE && fcode == POINTER_TYPE)
861 || (TYPE_PTRMEM_P (to) && TYPE_PTRMEM_P (from)))
863 tree to_pointee;
864 tree from_pointee;
866 if (tcode == POINTER_TYPE
867 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from),
868 TREE_TYPE (to)))
870 else if (VOID_TYPE_P (TREE_TYPE (to))
871 && !TYPE_PTRMEM_P (from)
872 && TREE_CODE (TREE_TYPE (from)) != FUNCTION_TYPE)
874 tree nfrom = TREE_TYPE (from);
875 if (c_dialect_objc ())
876 nfrom = objc_non_volatilized_type (nfrom);
877 from = build_pointer_type
878 (cp_build_qualified_type (void_type_node,
879 cp_type_quals (nfrom)));
880 conv = build_conv (ck_ptr, from, conv);
882 else if (TYPE_PTRMEM_P (from))
884 tree fbase = TYPE_PTRMEM_CLASS_TYPE (from);
885 tree tbase = TYPE_PTRMEM_CLASS_TYPE (to);
887 if (DERIVED_FROM_P (fbase, tbase)
888 && (same_type_ignoring_top_level_qualifiers_p
889 (TYPE_PTRMEM_POINTED_TO_TYPE (from),
890 TYPE_PTRMEM_POINTED_TO_TYPE (to))))
892 from = build_ptrmem_type (tbase,
893 TYPE_PTRMEM_POINTED_TO_TYPE (from));
894 conv = build_conv (ck_pmem, from, conv);
896 else if (!same_type_p (fbase, tbase))
897 return NULL;
899 else if (CLASS_TYPE_P (TREE_TYPE (from))
900 && CLASS_TYPE_P (TREE_TYPE (to))
901 /* [conv.ptr]
903 An rvalue of type "pointer to cv D," where D is a
904 class type, can be converted to an rvalue of type
905 "pointer to cv B," where B is a base class (clause
906 _class.derived_) of D. If B is an inaccessible
907 (clause _class.access_) or ambiguous
908 (_class.member.lookup_) base class of D, a program
909 that necessitates this conversion is ill-formed.
910 Therefore, we use DERIVED_FROM_P, and do not check
911 access or uniqueness. */
912 && DERIVED_FROM_P (TREE_TYPE (to), TREE_TYPE (from)))
914 from =
915 cp_build_qualified_type (TREE_TYPE (to),
916 cp_type_quals (TREE_TYPE (from)));
917 from = build_pointer_type (from);
918 conv = build_conv (ck_ptr, from, conv);
919 conv->base_p = true;
922 if (tcode == POINTER_TYPE)
924 to_pointee = TREE_TYPE (to);
925 from_pointee = TREE_TYPE (from);
927 else
929 to_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (to);
930 from_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (from);
933 if (same_type_p (from, to))
934 /* OK */;
935 else if (c_cast_p && comp_ptr_ttypes_const (to, from))
936 /* In a C-style cast, we ignore CV-qualification because we
937 are allowed to perform a static_cast followed by a
938 const_cast. */
939 conv = build_conv (ck_qual, to, conv);
940 else if (!c_cast_p && comp_ptr_ttypes (to_pointee, from_pointee))
941 conv = build_conv (ck_qual, to, conv);
942 else if (expr && string_conv_p (to, expr, 0))
943 /* converting from string constant to char *. */
944 conv = build_conv (ck_qual, to, conv);
945 /* Allow conversions among compatible ObjC pointer types (base
946 conversions have been already handled above). */
947 else if (c_dialect_objc ()
948 && objc_compare_types (to, from, -4, NULL_TREE))
949 conv = build_conv (ck_ptr, to, conv);
950 else if (ptr_reasonably_similar (to_pointee, from_pointee))
952 conv = build_conv (ck_ptr, to, conv);
953 conv->bad_p = true;
955 else
956 return NULL;
958 from = to;
960 else if (TYPE_PTRMEMFUNC_P (to) && TYPE_PTRMEMFUNC_P (from))
962 tree fromfn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from));
963 tree tofn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to));
964 tree fbase = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fromfn)));
965 tree tbase = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (tofn)));
967 if (!DERIVED_FROM_P (fbase, tbase)
968 || !same_type_p (TREE_TYPE (fromfn), TREE_TYPE (tofn))
969 || !compparms (TREE_CHAIN (TYPE_ARG_TYPES (fromfn)),
970 TREE_CHAIN (TYPE_ARG_TYPES (tofn)))
971 || cp_type_quals (fbase) != cp_type_quals (tbase))
972 return NULL;
974 from = build_memfn_type (fromfn, tbase, cp_type_quals (tbase));
975 from = build_ptrmemfunc_type (build_pointer_type (from));
976 conv = build_conv (ck_pmem, from, conv);
977 conv->base_p = true;
979 else if (tcode == BOOLEAN_TYPE)
981 /* [conv.bool]
983 An rvalue of arithmetic, unscoped enumeration, pointer, or
984 pointer to member type can be converted to an rvalue of type
985 bool. ... An rvalue of type std::nullptr_t can be converted
986 to an rvalue of type bool; */
987 if (ARITHMETIC_TYPE_P (from)
988 || UNSCOPED_ENUM_P (from)
989 || fcode == POINTER_TYPE
990 || TYPE_PTR_TO_MEMBER_P (from)
991 || NULLPTR_TYPE_P (from))
993 conv = build_conv (ck_std, to, conv);
994 if (fcode == POINTER_TYPE
995 || TYPE_PTRMEM_P (from)
996 || (TYPE_PTRMEMFUNC_P (from)
997 && conv->rank < cr_pbool)
998 || NULLPTR_TYPE_P (from))
999 conv->rank = cr_pbool;
1000 return conv;
1003 return NULL;
1005 /* We don't check for ENUMERAL_TYPE here because there are no standard
1006 conversions to enum type. */
1007 /* As an extension, allow conversion to complex type. */
1008 else if (ARITHMETIC_TYPE_P (to))
1010 if (! (INTEGRAL_CODE_P (fcode) || fcode == REAL_TYPE)
1011 || SCOPED_ENUM_P (from))
1012 return NULL;
1013 conv = build_conv (ck_std, to, conv);
1015 /* Give this a better rank if it's a promotion. */
1016 if (same_type_p (to, type_promotes_to (from))
1017 && conv->u.next->rank <= cr_promotion)
1018 conv->rank = cr_promotion;
1020 else if (fcode == VECTOR_TYPE && tcode == VECTOR_TYPE
1021 && vector_types_convertible_p (from, to, false))
1022 return build_conv (ck_std, to, conv);
1023 else if (MAYBE_CLASS_TYPE_P (to) && MAYBE_CLASS_TYPE_P (from)
1024 && is_properly_derived_from (from, to))
1026 if (conv->kind == ck_rvalue)
1027 conv = conv->u.next;
1028 conv = build_conv (ck_base, to, conv);
1029 /* The derived-to-base conversion indicates the initialization
1030 of a parameter with base type from an object of a derived
1031 type. A temporary object is created to hold the result of
1032 the conversion unless we're binding directly to a reference. */
1033 conv->need_temporary_p = !(flags & LOOKUP_NO_TEMP_BIND);
1035 else
1036 return NULL;
1038 if (flags & LOOKUP_NO_NARROWING)
1039 conv->check_narrowing = true;
1041 return conv;
1044 /* Returns nonzero if T1 is reference-related to T2. */
1046 bool
1047 reference_related_p (tree t1, tree t2)
1049 if (t1 == error_mark_node || t2 == error_mark_node)
1050 return false;
1052 t1 = TYPE_MAIN_VARIANT (t1);
1053 t2 = TYPE_MAIN_VARIANT (t2);
1055 /* [dcl.init.ref]
1057 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1058 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1059 of T2. */
1060 return (same_type_p (t1, t2)
1061 || (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
1062 && DERIVED_FROM_P (t1, t2)));
1065 /* Returns nonzero if T1 is reference-compatible with T2. */
1067 static bool
1068 reference_compatible_p (tree t1, tree t2)
1070 /* [dcl.init.ref]
1072 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
1073 reference-related to T2 and cv1 is the same cv-qualification as,
1074 or greater cv-qualification than, cv2. */
1075 return (reference_related_p (t1, t2)
1076 && at_least_as_qualified_p (t1, t2));
1079 /* Determine whether or not the EXPR (of class type S) can be
1080 converted to T as in [over.match.ref]. */
1082 static conversion *
1083 convert_class_to_reference (tree reference_type, tree s, tree expr, int flags)
1085 tree conversions;
1086 tree first_arg;
1087 conversion *conv;
1088 tree t;
1089 struct z_candidate *candidates;
1090 struct z_candidate *cand;
1091 bool any_viable_p;
1093 if (!expr)
1094 return NULL;
1096 conversions = lookup_conversions (s, /*lookup_template_convs_p=*/true);
1097 if (!conversions)
1098 return NULL;
1100 /* [over.match.ref]
1102 Assuming that "cv1 T" is the underlying type of the reference
1103 being initialized, and "cv S" is the type of the initializer
1104 expression, with S a class type, the candidate functions are
1105 selected as follows:
1107 --The conversion functions of S and its base classes are
1108 considered. Those that are not hidden within S and yield type
1109 "reference to cv2 T2", where "cv1 T" is reference-compatible
1110 (_dcl.init.ref_) with "cv2 T2", are candidate functions.
1112 The argument list has one argument, which is the initializer
1113 expression. */
1115 candidates = 0;
1117 /* Conceptually, we should take the address of EXPR and put it in
1118 the argument list. Unfortunately, however, that can result in
1119 error messages, which we should not issue now because we are just
1120 trying to find a conversion operator. Therefore, we use NULL,
1121 cast to the appropriate type. */
1122 first_arg = build_int_cst (build_pointer_type (s), 0);
1124 t = TREE_TYPE (reference_type);
1126 /* We're performing a user-defined conversion to a desired type, so set
1127 this for the benefit of add_candidates. */
1128 flags |= LOOKUP_NO_CONVERSION;
1130 for (; conversions; conversions = TREE_CHAIN (conversions))
1132 tree fns = TREE_VALUE (conversions);
1133 tree binfo = TREE_PURPOSE (conversions);
1134 struct z_candidate *old_candidates = candidates;;
1136 add_candidates (fns, first_arg, NULL, reference_type,
1137 NULL_TREE, false,
1138 binfo, TYPE_BINFO (s),
1139 flags, &candidates);
1141 for (cand = candidates; cand != old_candidates; cand = cand->next)
1143 /* Now, see if the conversion function really returns
1144 an lvalue of the appropriate type. From the
1145 point of view of unification, simply returning an
1146 rvalue of the right type is good enough. */
1147 tree f = cand->fn;
1148 tree t2 = TREE_TYPE (TREE_TYPE (f));
1149 if (TREE_CODE (t2) != REFERENCE_TYPE
1150 || !reference_compatible_p (t, TREE_TYPE (t2)))
1152 cand->viable = 0;
1154 else
1156 conversion *identity_conv;
1157 /* Build a standard conversion sequence indicating the
1158 binding from the reference type returned by the
1159 function to the desired REFERENCE_TYPE. */
1160 identity_conv
1161 = build_identity_conv (TREE_TYPE (TREE_TYPE
1162 (TREE_TYPE (cand->fn))),
1163 NULL_TREE);
1164 cand->second_conv
1165 = (direct_reference_binding
1166 (reference_type, identity_conv));
1167 cand->second_conv->rvaluedness_matches_p
1168 = TYPE_REF_IS_RVALUE (TREE_TYPE (TREE_TYPE (cand->fn)))
1169 == TYPE_REF_IS_RVALUE (reference_type);
1170 cand->second_conv->bad_p |= cand->convs[0]->bad_p;
1172 /* Don't allow binding of lvalues to rvalue references. */
1173 if (TYPE_REF_IS_RVALUE (reference_type)
1174 && !TYPE_REF_IS_RVALUE (TREE_TYPE (TREE_TYPE (cand->fn))))
1175 cand->second_conv->bad_p = true;
1180 candidates = splice_viable (candidates, pedantic, &any_viable_p);
1181 /* If none of the conversion functions worked out, let our caller
1182 know. */
1183 if (!any_viable_p)
1184 return NULL;
1186 cand = tourney (candidates);
1187 if (!cand)
1188 return NULL;
1190 /* Now that we know that this is the function we're going to use fix
1191 the dummy first argument. */
1192 gcc_assert (cand->first_arg == NULL_TREE
1193 || integer_zerop (cand->first_arg));
1194 cand->first_arg = build_this (expr);
1196 /* Build a user-defined conversion sequence representing the
1197 conversion. */
1198 conv = build_conv (ck_user,
1199 TREE_TYPE (TREE_TYPE (cand->fn)),
1200 build_identity_conv (TREE_TYPE (expr), expr));
1201 conv->cand = cand;
1203 if (cand->viable == -1)
1204 conv->bad_p = true;
1206 /* Merge it with the standard conversion sequence from the
1207 conversion function's return type to the desired type. */
1208 cand->second_conv = merge_conversion_sequences (conv, cand->second_conv);
1210 return cand->second_conv;
1213 /* A reference of the indicated TYPE is being bound directly to the
1214 expression represented by the implicit conversion sequence CONV.
1215 Return a conversion sequence for this binding. */
1217 static conversion *
1218 direct_reference_binding (tree type, conversion *conv)
1220 tree t;
1222 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
1223 gcc_assert (TREE_CODE (conv->type) != REFERENCE_TYPE);
1225 t = TREE_TYPE (type);
1227 /* [over.ics.rank]
1229 When a parameter of reference type binds directly
1230 (_dcl.init.ref_) to an argument expression, the implicit
1231 conversion sequence is the identity conversion, unless the
1232 argument expression has a type that is a derived class of the
1233 parameter type, in which case the implicit conversion sequence is
1234 a derived-to-base Conversion.
1236 If the parameter binds directly to the result of applying a
1237 conversion function to the argument expression, the implicit
1238 conversion sequence is a user-defined conversion sequence
1239 (_over.ics.user_), with the second standard conversion sequence
1240 either an identity conversion or, if the conversion function
1241 returns an entity of a type that is a derived class of the
1242 parameter type, a derived-to-base conversion. */
1243 if (!same_type_ignoring_top_level_qualifiers_p (t, conv->type))
1245 /* Represent the derived-to-base conversion. */
1246 conv = build_conv (ck_base, t, conv);
1247 /* We will actually be binding to the base-class subobject in
1248 the derived class, so we mark this conversion appropriately.
1249 That way, convert_like knows not to generate a temporary. */
1250 conv->need_temporary_p = false;
1252 return build_conv (ck_ref_bind, type, conv);
1255 /* Returns the conversion path from type FROM to reference type TO for
1256 purposes of reference binding. For lvalue binding, either pass a
1257 reference type to FROM or an lvalue expression to EXPR. If the
1258 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1259 the conversion returned. If C_CAST_P is true, this
1260 conversion is coming from a C-style cast. */
1262 static conversion *
1263 reference_binding (tree rto, tree rfrom, tree expr, bool c_cast_p, int flags)
1265 conversion *conv = NULL;
1266 tree to = TREE_TYPE (rto);
1267 tree from = rfrom;
1268 tree tfrom;
1269 bool related_p;
1270 bool compatible_p;
1271 cp_lvalue_kind is_lvalue = clk_none;
1273 if (TREE_CODE (to) == FUNCTION_TYPE && expr && type_unknown_p (expr))
1275 expr = instantiate_type (to, expr, tf_none);
1276 if (expr == error_mark_node)
1277 return NULL;
1278 from = TREE_TYPE (expr);
1281 if (TREE_CODE (from) == REFERENCE_TYPE)
1283 /* Anything with reference type is an lvalue. */
1284 is_lvalue = clk_ordinary;
1285 from = TREE_TYPE (from);
1288 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1290 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
1291 conv = implicit_conversion (to, from, expr, c_cast_p,
1292 flags);
1293 if (!CLASS_TYPE_P (to)
1294 && CONSTRUCTOR_NELTS (expr) == 1)
1296 expr = CONSTRUCTOR_ELT (expr, 0)->value;
1297 if (error_operand_p (expr))
1298 return NULL;
1299 from = TREE_TYPE (expr);
1303 if (is_lvalue == clk_none && expr)
1304 is_lvalue = real_lvalue_p (expr);
1306 tfrom = from;
1307 if ((is_lvalue & clk_bitfield) != 0)
1308 tfrom = unlowered_expr_type (expr);
1310 /* Figure out whether or not the types are reference-related and
1311 reference compatible. We have do do this after stripping
1312 references from FROM. */
1313 related_p = reference_related_p (to, tfrom);
1314 /* If this is a C cast, first convert to an appropriately qualified
1315 type, so that we can later do a const_cast to the desired type. */
1316 if (related_p && c_cast_p
1317 && !at_least_as_qualified_p (to, tfrom))
1318 to = cp_build_qualified_type (to, cp_type_quals (tfrom));
1319 compatible_p = reference_compatible_p (to, tfrom);
1321 /* Directly bind reference when target expression's type is compatible with
1322 the reference and expression is an lvalue. In DR391, the wording in
1323 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1324 const and rvalue references to rvalues of compatible class type.
1325 We should also do direct bindings for non-class "rvalues" derived from
1326 rvalue references. */
1327 if (compatible_p
1328 && (is_lvalue
1329 || (((CP_TYPE_CONST_NON_VOLATILE_P (to)
1330 && !(flags & LOOKUP_NO_TEMP_BIND))
1331 || TYPE_REF_IS_RVALUE (rto))
1332 && (CLASS_TYPE_P (from) || (expr && lvalue_p (expr))))))
1334 /* [dcl.init.ref]
1336 If the initializer expression
1338 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1339 is reference-compatible with "cv2 T2,"
1341 the reference is bound directly to the initializer expression
1342 lvalue.
1344 [...]
1345 If the initializer expression is an rvalue, with T2 a class type,
1346 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1347 is bound to the object represented by the rvalue or to a sub-object
1348 within that object. */
1350 conv = build_identity_conv (tfrom, expr);
1351 conv = direct_reference_binding (rto, conv);
1353 if (flags & LOOKUP_PREFER_RVALUE)
1354 /* The top-level caller requested that we pretend that the lvalue
1355 be treated as an rvalue. */
1356 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
1357 else
1358 conv->rvaluedness_matches_p
1359 = (TYPE_REF_IS_RVALUE (rto) == !is_lvalue);
1361 if ((is_lvalue & clk_bitfield) != 0
1362 || ((is_lvalue & clk_packed) != 0 && !TYPE_PACKED (to)))
1363 /* For the purposes of overload resolution, we ignore the fact
1364 this expression is a bitfield or packed field. (In particular,
1365 [over.ics.ref] says specifically that a function with a
1366 non-const reference parameter is viable even if the
1367 argument is a bitfield.)
1369 However, when we actually call the function we must create
1370 a temporary to which to bind the reference. If the
1371 reference is volatile, or isn't const, then we cannot make
1372 a temporary, so we just issue an error when the conversion
1373 actually occurs. */
1374 conv->need_temporary_p = true;
1376 /* Don't allow binding of lvalues to rvalue references. */
1377 if (is_lvalue && TYPE_REF_IS_RVALUE (rto)
1378 && !(flags & LOOKUP_PREFER_RVALUE))
1379 conv->bad_p = true;
1381 return conv;
1383 /* [class.conv.fct] A conversion function is never used to convert a
1384 (possibly cv-qualified) object to the (possibly cv-qualified) same
1385 object type (or a reference to it), to a (possibly cv-qualified) base
1386 class of that type (or a reference to it).... */
1387 else if (CLASS_TYPE_P (from) && !related_p
1388 && !(flags & LOOKUP_NO_CONVERSION))
1390 /* [dcl.init.ref]
1392 If the initializer expression
1394 -- has a class type (i.e., T2 is a class type) can be
1395 implicitly converted to an lvalue of type "cv3 T3," where
1396 "cv1 T1" is reference-compatible with "cv3 T3". (this
1397 conversion is selected by enumerating the applicable
1398 conversion functions (_over.match.ref_) and choosing the
1399 best one through overload resolution. (_over.match_).
1401 the reference is bound to the lvalue result of the conversion
1402 in the second case. */
1403 conv = convert_class_to_reference (rto, from, expr, flags);
1404 if (conv)
1405 return conv;
1408 /* From this point on, we conceptually need temporaries, even if we
1409 elide them. Only the cases above are "direct bindings". */
1410 if (flags & LOOKUP_NO_TEMP_BIND)
1411 return NULL;
1413 /* [over.ics.rank]
1415 When a parameter of reference type is not bound directly to an
1416 argument expression, the conversion sequence is the one required
1417 to convert the argument expression to the underlying type of the
1418 reference according to _over.best.ics_. Conceptually, this
1419 conversion sequence corresponds to copy-initializing a temporary
1420 of the underlying type with the argument expression. Any
1421 difference in top-level cv-qualification is subsumed by the
1422 initialization itself and does not constitute a conversion. */
1424 /* [dcl.init.ref]
1426 Otherwise, the reference shall be to a non-volatile const type.
1428 Under C++0x, [8.5.3/5 dcl.init.ref] it may also be an rvalue reference */
1429 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto))
1430 return NULL;
1432 /* [dcl.init.ref]
1434 Otherwise, a temporary of type "cv1 T1" is created and
1435 initialized from the initializer expression using the rules for a
1436 non-reference copy initialization. If T1 is reference-related to
1437 T2, cv1 must be the same cv-qualification as, or greater
1438 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1439 if (related_p && !at_least_as_qualified_p (to, from))
1440 return NULL;
1442 /* We're generating a temporary now, but don't bind any more in the
1443 conversion (specifically, don't slice the temporary returned by a
1444 conversion operator). */
1445 flags |= LOOKUP_NO_TEMP_BIND;
1447 /* Core issue 899: When [copy-]initializing a temporary to be bound
1448 to the first parameter of a copy constructor (12.8) called with
1449 a single argument in the context of direct-initialization,
1450 explicit conversion functions are also considered.
1452 So don't set LOOKUP_ONLYCONVERTING in that case. */
1453 if (!(flags & LOOKUP_COPY_PARM))
1454 flags |= LOOKUP_ONLYCONVERTING;
1456 if (!conv)
1457 conv = implicit_conversion (to, from, expr, c_cast_p,
1458 flags);
1459 if (!conv)
1460 return NULL;
1462 conv = build_conv (ck_ref_bind, rto, conv);
1463 /* This reference binding, unlike those above, requires the
1464 creation of a temporary. */
1465 conv->need_temporary_p = true;
1466 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
1468 return conv;
1471 /* Returns the implicit conversion sequence (see [over.ics]) from type
1472 FROM to type TO. The optional expression EXPR may affect the
1473 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1474 true, this conversion is coming from a C-style cast. */
1476 static conversion *
1477 implicit_conversion (tree to, tree from, tree expr, bool c_cast_p,
1478 int flags)
1480 conversion *conv;
1482 if (from == error_mark_node || to == error_mark_node
1483 || expr == error_mark_node)
1484 return NULL;
1486 if (c_dialect_objc ())
1487 from = objc_non_volatilized_type (from);
1489 if (TREE_CODE (to) == REFERENCE_TYPE)
1490 conv = reference_binding (to, from, expr, c_cast_p, flags);
1491 else
1492 conv = standard_conversion (to, from, expr, c_cast_p, flags);
1494 if (conv)
1495 return conv;
1497 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1499 if (is_std_init_list (to))
1500 return build_list_conv (to, expr, flags);
1502 /* Allow conversion from an initializer-list with one element to a
1503 scalar type. */
1504 if (SCALAR_TYPE_P (to))
1506 int nelts = CONSTRUCTOR_NELTS (expr);
1507 tree elt;
1509 if (nelts == 0)
1510 elt = build_value_init (to, tf_none);
1511 else if (nelts == 1)
1512 elt = CONSTRUCTOR_ELT (expr, 0)->value;
1513 else
1514 elt = error_mark_node;
1516 conv = implicit_conversion (to, TREE_TYPE (elt), elt,
1517 c_cast_p, flags);
1518 if (conv)
1520 conv->check_narrowing = true;
1521 if (BRACE_ENCLOSED_INITIALIZER_P (elt))
1522 /* Too many levels of braces, i.e. '{{1}}'. */
1523 conv->bad_p = true;
1524 return conv;
1529 if (expr != NULL_TREE
1530 && (MAYBE_CLASS_TYPE_P (from)
1531 || MAYBE_CLASS_TYPE_P (to))
1532 && (flags & LOOKUP_NO_CONVERSION) == 0)
1534 struct z_candidate *cand;
1535 int convflags = (flags & (LOOKUP_NO_TEMP_BIND|LOOKUP_ONLYCONVERTING
1536 |LOOKUP_NO_NARROWING));
1538 if (CLASS_TYPE_P (to)
1539 && !CLASSTYPE_NON_AGGREGATE (complete_type (to))
1540 && BRACE_ENCLOSED_INITIALIZER_P (expr))
1541 return build_aggr_conv (to, expr, flags);
1543 cand = build_user_type_conversion_1 (to, expr, convflags);
1544 if (cand)
1545 conv = cand->second_conv;
1547 /* We used to try to bind a reference to a temporary here, but that
1548 is now handled after the recursive call to this function at the end
1549 of reference_binding. */
1550 return conv;
1553 return NULL;
1556 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1557 functions. ARGS will not be changed until a single candidate is
1558 selected. */
1560 static struct z_candidate *
1561 add_candidate (struct z_candidate **candidates,
1562 tree fn, tree first_arg, const VEC(tree,gc) *args,
1563 size_t num_convs, conversion **convs,
1564 tree access_path, tree conversion_path,
1565 int viable)
1567 struct z_candidate *cand = (struct z_candidate *)
1568 conversion_obstack_alloc (sizeof (struct z_candidate));
1570 cand->fn = fn;
1571 cand->first_arg = first_arg;
1572 cand->args = args;
1573 cand->convs = convs;
1574 cand->num_convs = num_convs;
1575 cand->access_path = access_path;
1576 cand->conversion_path = conversion_path;
1577 cand->viable = viable;
1578 cand->next = *candidates;
1579 *candidates = cand;
1581 return cand;
1584 /* Create an overload candidate for the function or method FN called
1585 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1586 FLAGS is passed on to implicit_conversion.
1588 This does not change ARGS.
1590 CTYPE, if non-NULL, is the type we want to pretend this function
1591 comes from for purposes of overload resolution. */
1593 static struct z_candidate *
1594 add_function_candidate (struct z_candidate **candidates,
1595 tree fn, tree ctype, tree first_arg,
1596 const VEC(tree,gc) *args, tree access_path,
1597 tree conversion_path, int flags)
1599 tree parmlist = TYPE_ARG_TYPES (TREE_TYPE (fn));
1600 int i, len;
1601 conversion **convs;
1602 tree parmnode;
1603 tree orig_first_arg = first_arg;
1604 int skip;
1605 int viable = 1;
1607 /* At this point we should not see any functions which haven't been
1608 explicitly declared, except for friend functions which will have
1609 been found using argument dependent lookup. */
1610 gcc_assert (!DECL_ANTICIPATED (fn) || DECL_HIDDEN_FRIEND_P (fn));
1612 /* The `this', `in_chrg' and VTT arguments to constructors are not
1613 considered in overload resolution. */
1614 if (DECL_CONSTRUCTOR_P (fn))
1616 parmlist = skip_artificial_parms_for (fn, parmlist);
1617 skip = num_artificial_parms_for (fn);
1618 if (skip > 0 && first_arg != NULL_TREE)
1620 --skip;
1621 first_arg = NULL_TREE;
1624 else
1625 skip = 0;
1627 len = VEC_length (tree, args) - skip + (first_arg != NULL_TREE ? 1 : 0);
1628 convs = alloc_conversions (len);
1630 /* 13.3.2 - Viable functions [over.match.viable]
1631 First, to be a viable function, a candidate function shall have enough
1632 parameters to agree in number with the arguments in the list.
1634 We need to check this first; otherwise, checking the ICSes might cause
1635 us to produce an ill-formed template instantiation. */
1637 parmnode = parmlist;
1638 for (i = 0; i < len; ++i)
1640 if (parmnode == NULL_TREE || parmnode == void_list_node)
1641 break;
1642 parmnode = TREE_CHAIN (parmnode);
1645 if (i < len && parmnode)
1646 viable = 0;
1648 /* Make sure there are default args for the rest of the parms. */
1649 else if (!sufficient_parms_p (parmnode))
1650 viable = 0;
1652 /* Kludge: When looking for a function from a subobject while generating
1653 an implicit copy/move constructor/operator=, don't consider anything
1654 that takes (a reference to) an unrelated type. See c++/44909. */
1655 else if (parmlist
1656 && ((flags & LOOKUP_SPECULATIVE)
1657 || (current_function_decl
1658 && DECL_DEFAULTED_FN (current_function_decl))))
1660 if (DECL_CONSTRUCTOR_P (fn))
1661 i = 1;
1662 else if (DECL_ASSIGNMENT_OPERATOR_P (fn)
1663 && DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR)
1664 i = 2;
1665 else
1666 i = 0;
1667 if (i && len == i)
1669 parmnode = chain_index (i-1, parmlist);
1670 if (!reference_related_p (non_reference (TREE_VALUE (parmnode)),
1671 ctype))
1672 viable = 0;
1676 if (! viable)
1677 goto out;
1679 /* Second, for F to be a viable function, there shall exist for each
1680 argument an implicit conversion sequence that converts that argument
1681 to the corresponding parameter of F. */
1683 parmnode = parmlist;
1685 for (i = 0; i < len; ++i)
1687 tree arg, argtype;
1688 conversion *t;
1689 int is_this;
1691 if (parmnode == void_list_node)
1692 break;
1694 if (i == 0 && first_arg != NULL_TREE)
1695 arg = first_arg;
1696 else
1697 arg = VEC_index (tree, args,
1698 i + skip - (first_arg != NULL_TREE ? 1 : 0));
1699 argtype = lvalue_type (arg);
1701 is_this = (i == 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
1702 && ! DECL_CONSTRUCTOR_P (fn));
1704 if (parmnode)
1706 tree parmtype = TREE_VALUE (parmnode);
1707 int lflags = flags;
1709 parmnode = TREE_CHAIN (parmnode);
1711 /* The type of the implicit object parameter ('this') for
1712 overload resolution is not always the same as for the
1713 function itself; conversion functions are considered to
1714 be members of the class being converted, and functions
1715 introduced by a using-declaration are considered to be
1716 members of the class that uses them.
1718 Since build_over_call ignores the ICS for the `this'
1719 parameter, we can just change the parm type. */
1720 if (ctype && is_this)
1722 parmtype = cp_build_qualified_type
1723 (ctype, cp_type_quals (TREE_TYPE (parmtype)));
1724 parmtype = build_pointer_type (parmtype);
1727 /* Core issue 899: When [copy-]initializing a temporary to be bound
1728 to the first parameter of a copy constructor (12.8) called with
1729 a single argument in the context of direct-initialization,
1730 explicit conversion functions are also considered.
1732 So set LOOKUP_COPY_PARM to let reference_binding know that
1733 it's being called in that context. We generalize the above
1734 to handle move constructors and template constructors as well;
1735 the standardese should soon be updated similarly. */
1736 if (ctype && i == 0 && (len-skip == 1)
1737 && !(flags & LOOKUP_ONLYCONVERTING)
1738 && DECL_CONSTRUCTOR_P (fn)
1739 && parmtype != error_mark_node
1740 && (same_type_ignoring_top_level_qualifiers_p
1741 (non_reference (parmtype), ctype)))
1743 lflags |= LOOKUP_COPY_PARM;
1744 /* We allow user-defined conversions within init-lists, but
1745 not for the copy constructor. */
1746 if (flags & LOOKUP_NO_COPY_CTOR_CONVERSION)
1747 lflags |= LOOKUP_NO_CONVERSION;
1749 else
1750 lflags |= LOOKUP_ONLYCONVERTING;
1752 t = implicit_conversion (parmtype, argtype, arg,
1753 /*c_cast_p=*/false, lflags);
1755 else
1757 t = build_identity_conv (argtype, arg);
1758 t->ellipsis_p = true;
1761 if (t && is_this)
1762 t->this_p = true;
1764 convs[i] = t;
1765 if (! t)
1767 viable = 0;
1768 break;
1771 if (t->bad_p)
1772 viable = -1;
1775 out:
1776 return add_candidate (candidates, fn, orig_first_arg, args, len, convs,
1777 access_path, conversion_path, viable);
1780 /* Create an overload candidate for the conversion function FN which will
1781 be invoked for expression OBJ, producing a pointer-to-function which
1782 will in turn be called with the argument list FIRST_ARG/ARGLIST,
1783 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
1784 passed on to implicit_conversion.
1786 Actually, we don't really care about FN; we care about the type it
1787 converts to. There may be multiple conversion functions that will
1788 convert to that type, and we rely on build_user_type_conversion_1 to
1789 choose the best one; so when we create our candidate, we record the type
1790 instead of the function. */
1792 static struct z_candidate *
1793 add_conv_candidate (struct z_candidate **candidates, tree fn, tree obj,
1794 tree first_arg, const VEC(tree,gc) *arglist,
1795 tree access_path, tree conversion_path)
1797 tree totype = TREE_TYPE (TREE_TYPE (fn));
1798 int i, len, viable, flags;
1799 tree parmlist, parmnode;
1800 conversion **convs;
1802 for (parmlist = totype; TREE_CODE (parmlist) != FUNCTION_TYPE; )
1803 parmlist = TREE_TYPE (parmlist);
1804 parmlist = TYPE_ARG_TYPES (parmlist);
1806 len = VEC_length (tree, arglist) + (first_arg != NULL_TREE ? 1 : 0) + 1;
1807 convs = alloc_conversions (len);
1808 parmnode = parmlist;
1809 viable = 1;
1810 flags = LOOKUP_IMPLICIT;
1812 /* Don't bother looking up the same type twice. */
1813 if (*candidates && (*candidates)->fn == totype)
1814 return NULL;
1816 for (i = 0; i < len; ++i)
1818 tree arg, argtype;
1819 conversion *t;
1821 if (i == 0)
1822 arg = obj;
1823 else if (i == 1 && first_arg != NULL_TREE)
1824 arg = first_arg;
1825 else
1826 arg = VEC_index (tree, arglist,
1827 i - (first_arg != NULL_TREE ? 1 : 0) - 1);
1828 argtype = lvalue_type (arg);
1830 if (i == 0)
1831 t = implicit_conversion (totype, argtype, arg, /*c_cast_p=*/false,
1832 flags);
1833 else if (parmnode == void_list_node)
1834 break;
1835 else if (parmnode)
1836 t = implicit_conversion (TREE_VALUE (parmnode), argtype, arg,
1837 /*c_cast_p=*/false, flags);
1838 else
1840 t = build_identity_conv (argtype, arg);
1841 t->ellipsis_p = true;
1844 convs[i] = t;
1845 if (! t)
1846 break;
1848 if (t->bad_p)
1849 viable = -1;
1851 if (i == 0)
1852 continue;
1854 if (parmnode)
1855 parmnode = TREE_CHAIN (parmnode);
1858 if (i < len)
1859 viable = 0;
1861 if (!sufficient_parms_p (parmnode))
1862 viable = 0;
1864 return add_candidate (candidates, totype, first_arg, arglist, len, convs,
1865 access_path, conversion_path, viable);
1868 static void
1869 build_builtin_candidate (struct z_candidate **candidates, tree fnname,
1870 tree type1, tree type2, tree *args, tree *argtypes,
1871 int flags)
1873 conversion *t;
1874 conversion **convs;
1875 size_t num_convs;
1876 int viable = 1, i;
1877 tree types[2];
1879 types[0] = type1;
1880 types[1] = type2;
1882 num_convs = args[2] ? 3 : (args[1] ? 2 : 1);
1883 convs = alloc_conversions (num_convs);
1885 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
1886 conversion ops are allowed. We handle that here by just checking for
1887 boolean_type_node because other operators don't ask for it. COND_EXPR
1888 also does contextual conversion to bool for the first operand, but we
1889 handle that in build_conditional_expr, and type1 here is operand 2. */
1890 if (type1 != boolean_type_node)
1891 flags |= LOOKUP_ONLYCONVERTING;
1893 for (i = 0; i < 2; ++i)
1895 if (! args[i])
1896 break;
1898 t = implicit_conversion (types[i], argtypes[i], args[i],
1899 /*c_cast_p=*/false, flags);
1900 if (! t)
1902 viable = 0;
1903 /* We need something for printing the candidate. */
1904 t = build_identity_conv (types[i], NULL_TREE);
1906 else if (t->bad_p)
1907 viable = 0;
1908 convs[i] = t;
1911 /* For COND_EXPR we rearranged the arguments; undo that now. */
1912 if (args[2])
1914 convs[2] = convs[1];
1915 convs[1] = convs[0];
1916 t = implicit_conversion (boolean_type_node, argtypes[2], args[2],
1917 /*c_cast_p=*/false, flags);
1918 if (t)
1919 convs[0] = t;
1920 else
1921 viable = 0;
1924 add_candidate (candidates, fnname, /*first_arg=*/NULL_TREE, /*args=*/NULL,
1925 num_convs, convs,
1926 /*access_path=*/NULL_TREE,
1927 /*conversion_path=*/NULL_TREE,
1928 viable);
1931 static bool
1932 is_complete (tree t)
1934 return COMPLETE_TYPE_P (complete_type (t));
1937 /* Returns nonzero if TYPE is a promoted arithmetic type. */
1939 static bool
1940 promoted_arithmetic_type_p (tree type)
1942 /* [over.built]
1944 In this section, the term promoted integral type is used to refer
1945 to those integral types which are preserved by integral promotion
1946 (including e.g. int and long but excluding e.g. char).
1947 Similarly, the term promoted arithmetic type refers to promoted
1948 integral types plus floating types. */
1949 return ((CP_INTEGRAL_TYPE_P (type)
1950 && same_type_p (type_promotes_to (type), type))
1951 || TREE_CODE (type) == REAL_TYPE);
1954 /* Create any builtin operator overload candidates for the operator in
1955 question given the converted operand types TYPE1 and TYPE2. The other
1956 args are passed through from add_builtin_candidates to
1957 build_builtin_candidate.
1959 TYPE1 and TYPE2 may not be permissible, and we must filter them.
1960 If CODE is requires candidates operands of the same type of the kind
1961 of which TYPE1 and TYPE2 are, we add both candidates
1962 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
1964 static void
1965 add_builtin_candidate (struct z_candidate **candidates, enum tree_code code,
1966 enum tree_code code2, tree fnname, tree type1,
1967 tree type2, tree *args, tree *argtypes, int flags)
1969 switch (code)
1971 case POSTINCREMENT_EXPR:
1972 case POSTDECREMENT_EXPR:
1973 args[1] = integer_zero_node;
1974 type2 = integer_type_node;
1975 break;
1976 default:
1977 break;
1980 switch (code)
1983 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
1984 and VQ is either volatile or empty, there exist candidate operator
1985 functions of the form
1986 VQ T& operator++(VQ T&);
1987 T operator++(VQ T&, int);
1988 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
1989 type other than bool, and VQ is either volatile or empty, there exist
1990 candidate operator functions of the form
1991 VQ T& operator--(VQ T&);
1992 T operator--(VQ T&, int);
1993 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
1994 complete object type, and VQ is either volatile or empty, there exist
1995 candidate operator functions of the form
1996 T*VQ& operator++(T*VQ&);
1997 T*VQ& operator--(T*VQ&);
1998 T* operator++(T*VQ&, int);
1999 T* operator--(T*VQ&, int); */
2001 case POSTDECREMENT_EXPR:
2002 case PREDECREMENT_EXPR:
2003 if (TREE_CODE (type1) == BOOLEAN_TYPE)
2004 return;
2005 case POSTINCREMENT_EXPR:
2006 case PREINCREMENT_EXPR:
2007 if (ARITHMETIC_TYPE_P (type1) || TYPE_PTROB_P (type1))
2009 type1 = build_reference_type (type1);
2010 break;
2012 return;
2014 /* 7 For every cv-qualified or cv-unqualified complete object type T, there
2015 exist candidate operator functions of the form
2017 T& operator*(T*);
2019 8 For every function type T, there exist candidate operator functions of
2020 the form
2021 T& operator*(T*); */
2023 case INDIRECT_REF:
2024 if (TREE_CODE (type1) == POINTER_TYPE
2025 && (TYPE_PTROB_P (type1)
2026 || TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE))
2027 break;
2028 return;
2030 /* 9 For every type T, there exist candidate operator functions of the form
2031 T* operator+(T*);
2033 10For every promoted arithmetic type T, there exist candidate operator
2034 functions of the form
2035 T operator+(T);
2036 T operator-(T); */
2038 case UNARY_PLUS_EXPR: /* unary + */
2039 if (TREE_CODE (type1) == POINTER_TYPE)
2040 break;
2041 case NEGATE_EXPR:
2042 if (ARITHMETIC_TYPE_P (type1))
2043 break;
2044 return;
2046 /* 11For every promoted integral type T, there exist candidate operator
2047 functions of the form
2048 T operator~(T); */
2050 case BIT_NOT_EXPR:
2051 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1))
2052 break;
2053 return;
2055 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2056 is the same type as C2 or is a derived class of C2, T is a complete
2057 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2058 there exist candidate operator functions of the form
2059 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2060 where CV12 is the union of CV1 and CV2. */
2062 case MEMBER_REF:
2063 if (TREE_CODE (type1) == POINTER_TYPE
2064 && TYPE_PTR_TO_MEMBER_P (type2))
2066 tree c1 = TREE_TYPE (type1);
2067 tree c2 = TYPE_PTRMEM_CLASS_TYPE (type2);
2069 if (MAYBE_CLASS_TYPE_P (c1) && DERIVED_FROM_P (c2, c1)
2070 && (TYPE_PTRMEMFUNC_P (type2)
2071 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2))))
2072 break;
2074 return;
2076 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2077 didate operator functions of the form
2078 LR operator*(L, R);
2079 LR operator/(L, R);
2080 LR operator+(L, R);
2081 LR operator-(L, R);
2082 bool operator<(L, R);
2083 bool operator>(L, R);
2084 bool operator<=(L, R);
2085 bool operator>=(L, R);
2086 bool operator==(L, R);
2087 bool operator!=(L, R);
2088 where LR is the result of the usual arithmetic conversions between
2089 types L and R.
2091 14For every pair of types T and I, where T is a cv-qualified or cv-
2092 unqualified complete object type and I is a promoted integral type,
2093 there exist candidate operator functions of the form
2094 T* operator+(T*, I);
2095 T& operator[](T*, I);
2096 T* operator-(T*, I);
2097 T* operator+(I, T*);
2098 T& operator[](I, T*);
2100 15For every T, where T is a pointer to complete object type, there exist
2101 candidate operator functions of the form112)
2102 ptrdiff_t operator-(T, T);
2104 16For every pointer or enumeration type T, there exist candidate operator
2105 functions of the form
2106 bool operator<(T, T);
2107 bool operator>(T, T);
2108 bool operator<=(T, T);
2109 bool operator>=(T, T);
2110 bool operator==(T, T);
2111 bool operator!=(T, T);
2113 17For every pointer to member type T, there exist candidate operator
2114 functions of the form
2115 bool operator==(T, T);
2116 bool operator!=(T, T); */
2118 case MINUS_EXPR:
2119 if (TYPE_PTROB_P (type1) && TYPE_PTROB_P (type2))
2120 break;
2121 if (TYPE_PTROB_P (type1)
2122 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2124 type2 = ptrdiff_type_node;
2125 break;
2127 case MULT_EXPR:
2128 case TRUNC_DIV_EXPR:
2129 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2130 break;
2131 return;
2133 case EQ_EXPR:
2134 case NE_EXPR:
2135 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2136 || (TYPE_PTRMEM_P (type1) && TYPE_PTRMEM_P (type2)))
2137 break;
2138 if (TYPE_PTR_TO_MEMBER_P (type1) && null_ptr_cst_p (args[1]))
2140 type2 = type1;
2141 break;
2143 if (TYPE_PTR_TO_MEMBER_P (type2) && null_ptr_cst_p (args[0]))
2145 type1 = type2;
2146 break;
2148 /* Fall through. */
2149 case LT_EXPR:
2150 case GT_EXPR:
2151 case LE_EXPR:
2152 case GE_EXPR:
2153 case MAX_EXPR:
2154 case MIN_EXPR:
2155 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2156 break;
2157 if (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2158 break;
2159 if (TREE_CODE (type1) == ENUMERAL_TYPE
2160 && TREE_CODE (type2) == ENUMERAL_TYPE)
2161 break;
2162 if (TYPE_PTR_P (type1)
2163 && null_ptr_cst_p (args[1])
2164 && !uses_template_parms (type1))
2166 type2 = type1;
2167 break;
2169 if (null_ptr_cst_p (args[0])
2170 && TYPE_PTR_P (type2)
2171 && !uses_template_parms (type2))
2173 type1 = type2;
2174 break;
2176 return;
2178 case PLUS_EXPR:
2179 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2180 break;
2181 case ARRAY_REF:
2182 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && TYPE_PTROB_P (type2))
2184 type1 = ptrdiff_type_node;
2185 break;
2187 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2189 type2 = ptrdiff_type_node;
2190 break;
2192 return;
2194 /* 18For every pair of promoted integral types L and R, there exist candi-
2195 date operator functions of the form
2196 LR operator%(L, R);
2197 LR operator&(L, R);
2198 LR operator^(L, R);
2199 LR operator|(L, R);
2200 L operator<<(L, R);
2201 L operator>>(L, R);
2202 where LR is the result of the usual arithmetic conversions between
2203 types L and R. */
2205 case TRUNC_MOD_EXPR:
2206 case BIT_AND_EXPR:
2207 case BIT_IOR_EXPR:
2208 case BIT_XOR_EXPR:
2209 case LSHIFT_EXPR:
2210 case RSHIFT_EXPR:
2211 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2212 break;
2213 return;
2215 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2216 type, VQ is either volatile or empty, and R is a promoted arithmetic
2217 type, there exist candidate operator functions of the form
2218 VQ L& operator=(VQ L&, R);
2219 VQ L& operator*=(VQ L&, R);
2220 VQ L& operator/=(VQ L&, R);
2221 VQ L& operator+=(VQ L&, R);
2222 VQ L& operator-=(VQ L&, R);
2224 20For every pair T, VQ), where T is any type and VQ is either volatile
2225 or empty, there exist candidate operator functions of the form
2226 T*VQ& operator=(T*VQ&, T*);
2228 21For every pair T, VQ), where T is a pointer to member type and VQ is
2229 either volatile or empty, there exist candidate operator functions of
2230 the form
2231 VQ T& operator=(VQ T&, T);
2233 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2234 unqualified complete object type, VQ is either volatile or empty, and
2235 I is a promoted integral type, there exist candidate operator func-
2236 tions of the form
2237 T*VQ& operator+=(T*VQ&, I);
2238 T*VQ& operator-=(T*VQ&, I);
2240 23For every triple L, VQ, R), where L is an integral or enumeration
2241 type, VQ is either volatile or empty, and R is a promoted integral
2242 type, there exist candidate operator functions of the form
2244 VQ L& operator%=(VQ L&, R);
2245 VQ L& operator<<=(VQ L&, R);
2246 VQ L& operator>>=(VQ L&, R);
2247 VQ L& operator&=(VQ L&, R);
2248 VQ L& operator^=(VQ L&, R);
2249 VQ L& operator|=(VQ L&, R); */
2251 case MODIFY_EXPR:
2252 switch (code2)
2254 case PLUS_EXPR:
2255 case MINUS_EXPR:
2256 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2258 type2 = ptrdiff_type_node;
2259 break;
2261 case MULT_EXPR:
2262 case TRUNC_DIV_EXPR:
2263 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2264 break;
2265 return;
2267 case TRUNC_MOD_EXPR:
2268 case BIT_AND_EXPR:
2269 case BIT_IOR_EXPR:
2270 case BIT_XOR_EXPR:
2271 case LSHIFT_EXPR:
2272 case RSHIFT_EXPR:
2273 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2274 break;
2275 return;
2277 case NOP_EXPR:
2278 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2279 break;
2280 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2281 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2282 || (TYPE_PTRMEM_P (type1) && TYPE_PTRMEM_P (type2))
2283 || ((TYPE_PTRMEMFUNC_P (type1)
2284 || TREE_CODE (type1) == POINTER_TYPE)
2285 && null_ptr_cst_p (args[1])))
2287 type2 = type1;
2288 break;
2290 return;
2292 default:
2293 gcc_unreachable ();
2295 type1 = build_reference_type (type1);
2296 break;
2298 case COND_EXPR:
2299 /* [over.built]
2301 For every pair of promoted arithmetic types L and R, there
2302 exist candidate operator functions of the form
2304 LR operator?(bool, L, R);
2306 where LR is the result of the usual arithmetic conversions
2307 between types L and R.
2309 For every type T, where T is a pointer or pointer-to-member
2310 type, there exist candidate operator functions of the form T
2311 operator?(bool, T, T); */
2313 if (promoted_arithmetic_type_p (type1)
2314 && promoted_arithmetic_type_p (type2))
2315 /* That's OK. */
2316 break;
2318 /* Otherwise, the types should be pointers. */
2319 if (!(TYPE_PTR_P (type1) || TYPE_PTR_TO_MEMBER_P (type1))
2320 || !(TYPE_PTR_P (type2) || TYPE_PTR_TO_MEMBER_P (type2)))
2321 return;
2323 /* We don't check that the two types are the same; the logic
2324 below will actually create two candidates; one in which both
2325 parameter types are TYPE1, and one in which both parameter
2326 types are TYPE2. */
2327 break;
2329 default:
2330 gcc_unreachable ();
2333 /* If we're dealing with two pointer types or two enumeral types,
2334 we need candidates for both of them. */
2335 if (type2 && !same_type_p (type1, type2)
2336 && TREE_CODE (type1) == TREE_CODE (type2)
2337 && (TREE_CODE (type1) == REFERENCE_TYPE
2338 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2339 || (TYPE_PTRMEM_P (type1) && TYPE_PTRMEM_P (type2))
2340 || TYPE_PTRMEMFUNC_P (type1)
2341 || MAYBE_CLASS_TYPE_P (type1)
2342 || TREE_CODE (type1) == ENUMERAL_TYPE))
2344 build_builtin_candidate
2345 (candidates, fnname, type1, type1, args, argtypes, flags);
2346 build_builtin_candidate
2347 (candidates, fnname, type2, type2, args, argtypes, flags);
2348 return;
2351 build_builtin_candidate
2352 (candidates, fnname, type1, type2, args, argtypes, flags);
2355 tree
2356 type_decays_to (tree type)
2358 if (TREE_CODE (type) == ARRAY_TYPE)
2359 return build_pointer_type (TREE_TYPE (type));
2360 if (TREE_CODE (type) == FUNCTION_TYPE)
2361 return build_pointer_type (type);
2362 if (!MAYBE_CLASS_TYPE_P (type))
2363 type = cv_unqualified (type);
2364 return type;
2367 /* There are three conditions of builtin candidates:
2369 1) bool-taking candidates. These are the same regardless of the input.
2370 2) pointer-pair taking candidates. These are generated for each type
2371 one of the input types converts to.
2372 3) arithmetic candidates. According to the standard, we should generate
2373 all of these, but I'm trying not to...
2375 Here we generate a superset of the possible candidates for this particular
2376 case. That is a subset of the full set the standard defines, plus some
2377 other cases which the standard disallows. add_builtin_candidate will
2378 filter out the invalid set. */
2380 static void
2381 add_builtin_candidates (struct z_candidate **candidates, enum tree_code code,
2382 enum tree_code code2, tree fnname, tree *args,
2383 int flags)
2385 int ref1, i;
2386 int enum_p = 0;
2387 tree type, argtypes[3], t;
2388 /* TYPES[i] is the set of possible builtin-operator parameter types
2389 we will consider for the Ith argument. */
2390 VEC(tree,gc) *types[2];
2391 unsigned ix;
2393 for (i = 0; i < 3; ++i)
2395 if (args[i])
2396 argtypes[i] = unlowered_expr_type (args[i]);
2397 else
2398 argtypes[i] = NULL_TREE;
2401 switch (code)
2403 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2404 and VQ is either volatile or empty, there exist candidate operator
2405 functions of the form
2406 VQ T& operator++(VQ T&); */
2408 case POSTINCREMENT_EXPR:
2409 case PREINCREMENT_EXPR:
2410 case POSTDECREMENT_EXPR:
2411 case PREDECREMENT_EXPR:
2412 case MODIFY_EXPR:
2413 ref1 = 1;
2414 break;
2416 /* 24There also exist candidate operator functions of the form
2417 bool operator!(bool);
2418 bool operator&&(bool, bool);
2419 bool operator||(bool, bool); */
2421 case TRUTH_NOT_EXPR:
2422 build_builtin_candidate
2423 (candidates, fnname, boolean_type_node,
2424 NULL_TREE, args, argtypes, flags);
2425 return;
2427 case TRUTH_ORIF_EXPR:
2428 case TRUTH_ANDIF_EXPR:
2429 build_builtin_candidate
2430 (candidates, fnname, boolean_type_node,
2431 boolean_type_node, args, argtypes, flags);
2432 return;
2434 case ADDR_EXPR:
2435 case COMPOUND_EXPR:
2436 case COMPONENT_REF:
2437 return;
2439 case COND_EXPR:
2440 case EQ_EXPR:
2441 case NE_EXPR:
2442 case LT_EXPR:
2443 case LE_EXPR:
2444 case GT_EXPR:
2445 case GE_EXPR:
2446 enum_p = 1;
2447 /* Fall through. */
2449 default:
2450 ref1 = 0;
2453 types[0] = make_tree_vector ();
2454 types[1] = make_tree_vector ();
2456 for (i = 0; i < 2; ++i)
2458 if (! args[i])
2460 else if (MAYBE_CLASS_TYPE_P (argtypes[i]))
2462 tree convs;
2464 if (i == 0 && code == MODIFY_EXPR && code2 == NOP_EXPR)
2465 return;
2467 convs = lookup_conversions (argtypes[i],
2468 /*lookup_template_convs_p=*/false);
2470 if (code == COND_EXPR)
2472 if (real_lvalue_p (args[i]))
2473 VEC_safe_push (tree, gc, types[i],
2474 build_reference_type (argtypes[i]));
2476 VEC_safe_push (tree, gc, types[i],
2477 TYPE_MAIN_VARIANT (argtypes[i]));
2480 else if (! convs)
2481 return;
2483 for (; convs; convs = TREE_CHAIN (convs))
2485 type = TREE_TYPE (convs);
2487 if (i == 0 && ref1
2488 && (TREE_CODE (type) != REFERENCE_TYPE
2489 || CP_TYPE_CONST_P (TREE_TYPE (type))))
2490 continue;
2492 if (code == COND_EXPR && TREE_CODE (type) == REFERENCE_TYPE)
2493 VEC_safe_push (tree, gc, types[i], type);
2495 type = non_reference (type);
2496 if (i != 0 || ! ref1)
2498 type = TYPE_MAIN_VARIANT (type_decays_to (type));
2499 if (enum_p && TREE_CODE (type) == ENUMERAL_TYPE)
2500 VEC_safe_push (tree, gc, types[i], type);
2501 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
2502 type = type_promotes_to (type);
2505 if (! vec_member (type, types[i]))
2506 VEC_safe_push (tree, gc, types[i], type);
2509 else
2511 if (code == COND_EXPR && real_lvalue_p (args[i]))
2512 VEC_safe_push (tree, gc, types[i],
2513 build_reference_type (argtypes[i]));
2514 type = non_reference (argtypes[i]);
2515 if (i != 0 || ! ref1)
2517 type = TYPE_MAIN_VARIANT (type_decays_to (type));
2518 if (enum_p && UNSCOPED_ENUM_P (type))
2519 VEC_safe_push (tree, gc, types[i], type);
2520 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
2521 type = type_promotes_to (type);
2523 VEC_safe_push (tree, gc, types[i], type);
2527 /* Run through the possible parameter types of both arguments,
2528 creating candidates with those parameter types. */
2529 FOR_EACH_VEC_ELT_REVERSE (tree, types[0], ix, t)
2531 unsigned jx;
2532 tree u;
2534 if (!VEC_empty (tree, types[1]))
2535 FOR_EACH_VEC_ELT_REVERSE (tree, types[1], jx, u)
2536 add_builtin_candidate
2537 (candidates, code, code2, fnname, t,
2538 u, args, argtypes, flags);
2539 else
2540 add_builtin_candidate
2541 (candidates, code, code2, fnname, t,
2542 NULL_TREE, args, argtypes, flags);
2545 release_tree_vector (types[0]);
2546 release_tree_vector (types[1]);
2550 /* If TMPL can be successfully instantiated as indicated by
2551 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2553 TMPL is the template. EXPLICIT_TARGS are any explicit template
2554 arguments. ARGLIST is the arguments provided at the call-site.
2555 This does not change ARGLIST. The RETURN_TYPE is the desired type
2556 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
2557 as for add_function_candidate. If an OBJ is supplied, FLAGS and
2558 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
2560 static struct z_candidate*
2561 add_template_candidate_real (struct z_candidate **candidates, tree tmpl,
2562 tree ctype, tree explicit_targs, tree first_arg,
2563 const VEC(tree,gc) *arglist, tree return_type,
2564 tree access_path, tree conversion_path,
2565 int flags, tree obj, unification_kind_t strict)
2567 int ntparms = DECL_NTPARMS (tmpl);
2568 tree targs = make_tree_vec (ntparms);
2569 unsigned int len = VEC_length (tree, arglist);
2570 unsigned int nargs = (first_arg == NULL_TREE ? 0 : 1) + len;
2571 unsigned int skip_without_in_chrg = 0;
2572 tree first_arg_without_in_chrg = first_arg;
2573 tree *args_without_in_chrg;
2574 unsigned int nargs_without_in_chrg;
2575 unsigned int ia, ix;
2576 tree arg;
2577 struct z_candidate *cand;
2578 int i;
2579 tree fn;
2581 /* We don't do deduction on the in-charge parameter, the VTT
2582 parameter or 'this'. */
2583 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl))
2585 if (first_arg_without_in_chrg != NULL_TREE)
2586 first_arg_without_in_chrg = NULL_TREE;
2587 else
2588 ++skip_without_in_chrg;
2591 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl)
2592 || DECL_BASE_CONSTRUCTOR_P (tmpl))
2593 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl)))
2595 if (first_arg_without_in_chrg != NULL_TREE)
2596 first_arg_without_in_chrg = NULL_TREE;
2597 else
2598 ++skip_without_in_chrg;
2601 if (len < skip_without_in_chrg)
2602 return NULL;
2604 nargs_without_in_chrg = ((first_arg_without_in_chrg != NULL_TREE ? 1 : 0)
2605 + (len - skip_without_in_chrg));
2606 args_without_in_chrg = XALLOCAVEC (tree, nargs_without_in_chrg);
2607 ia = 0;
2608 if (first_arg_without_in_chrg != NULL_TREE)
2610 args_without_in_chrg[ia] = first_arg_without_in_chrg;
2611 ++ia;
2613 for (ix = skip_without_in_chrg;
2614 VEC_iterate (tree, arglist, ix, arg);
2615 ++ix)
2617 args_without_in_chrg[ia] = arg;
2618 ++ia;
2620 gcc_assert (ia == nargs_without_in_chrg);
2622 i = fn_type_unification (tmpl, explicit_targs, targs,
2623 args_without_in_chrg,
2624 nargs_without_in_chrg,
2625 return_type, strict, flags);
2627 if (i != 0)
2628 goto fail;
2630 fn = instantiate_template (tmpl, targs, tf_none);
2631 if (fn == error_mark_node)
2632 goto fail;
2634 /* In [class.copy]:
2636 A member function template is never instantiated to perform the
2637 copy of a class object to an object of its class type.
2639 It's a little unclear what this means; the standard explicitly
2640 does allow a template to be used to copy a class. For example,
2643 struct A {
2644 A(A&);
2645 template <class T> A(const T&);
2647 const A f ();
2648 void g () { A a (f ()); }
2650 the member template will be used to make the copy. The section
2651 quoted above appears in the paragraph that forbids constructors
2652 whose only parameter is (a possibly cv-qualified variant of) the
2653 class type, and a logical interpretation is that the intent was
2654 to forbid the instantiation of member templates which would then
2655 have that form. */
2656 if (DECL_CONSTRUCTOR_P (fn) && nargs == 2)
2658 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (fn);
2659 if (arg_types && same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types)),
2660 ctype))
2661 goto fail;
2664 if (obj != NULL_TREE)
2665 /* Aha, this is a conversion function. */
2666 cand = add_conv_candidate (candidates, fn, obj, first_arg, arglist,
2667 access_path, conversion_path);
2668 else
2669 cand = add_function_candidate (candidates, fn, ctype,
2670 first_arg, arglist, access_path,
2671 conversion_path, flags);
2672 if (DECL_TI_TEMPLATE (fn) != tmpl)
2673 /* This situation can occur if a member template of a template
2674 class is specialized. Then, instantiate_template might return
2675 an instantiation of the specialization, in which case the
2676 DECL_TI_TEMPLATE field will point at the original
2677 specialization. For example:
2679 template <class T> struct S { template <class U> void f(U);
2680 template <> void f(int) {}; };
2681 S<double> sd;
2682 sd.f(3);
2684 Here, TMPL will be template <class U> S<double>::f(U).
2685 And, instantiate template will give us the specialization
2686 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
2687 for this will point at template <class T> template <> S<T>::f(int),
2688 so that we can find the definition. For the purposes of
2689 overload resolution, however, we want the original TMPL. */
2690 cand->template_decl = build_template_info (tmpl, targs);
2691 else
2692 cand->template_decl = DECL_TEMPLATE_INFO (fn);
2693 cand->explicit_targs = explicit_targs;
2695 return cand;
2696 fail:
2697 return add_candidate (candidates, tmpl, first_arg, arglist, nargs, NULL,
2698 access_path, conversion_path, 0);
2702 static struct z_candidate *
2703 add_template_candidate (struct z_candidate **candidates, tree tmpl, tree ctype,
2704 tree explicit_targs, tree first_arg,
2705 const VEC(tree,gc) *arglist, tree return_type,
2706 tree access_path, tree conversion_path, int flags,
2707 unification_kind_t strict)
2709 return
2710 add_template_candidate_real (candidates, tmpl, ctype,
2711 explicit_targs, first_arg, arglist,
2712 return_type, access_path, conversion_path,
2713 flags, NULL_TREE, strict);
2717 static struct z_candidate *
2718 add_template_conv_candidate (struct z_candidate **candidates, tree tmpl,
2719 tree obj, tree first_arg,
2720 const VEC(tree,gc) *arglist,
2721 tree return_type, tree access_path,
2722 tree conversion_path)
2724 return
2725 add_template_candidate_real (candidates, tmpl, NULL_TREE, NULL_TREE,
2726 first_arg, arglist, return_type, access_path,
2727 conversion_path, 0, obj, DEDUCE_CONV);
2730 /* The CANDS are the set of candidates that were considered for
2731 overload resolution. Return the set of viable candidates, or CANDS
2732 if none are viable. If any of the candidates were viable, set
2733 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
2734 considered viable only if it is strictly viable. */
2736 static struct z_candidate*
2737 splice_viable (struct z_candidate *cands,
2738 bool strict_p,
2739 bool *any_viable_p)
2741 struct z_candidate *viable;
2742 struct z_candidate **last_viable;
2743 struct z_candidate **cand;
2745 viable = NULL;
2746 last_viable = &viable;
2747 *any_viable_p = false;
2749 cand = &cands;
2750 while (*cand)
2752 struct z_candidate *c = *cand;
2753 if (strict_p ? c->viable == 1 : c->viable)
2755 *last_viable = c;
2756 *cand = c->next;
2757 c->next = NULL;
2758 last_viable = &c->next;
2759 *any_viable_p = true;
2761 else
2762 cand = &c->next;
2765 return viable ? viable : cands;
2768 static bool
2769 any_strictly_viable (struct z_candidate *cands)
2771 for (; cands; cands = cands->next)
2772 if (cands->viable == 1)
2773 return true;
2774 return false;
2777 /* OBJ is being used in an expression like "OBJ.f (...)". In other
2778 words, it is about to become the "this" pointer for a member
2779 function call. Take the address of the object. */
2781 static tree
2782 build_this (tree obj)
2784 /* In a template, we are only concerned about the type of the
2785 expression, so we can take a shortcut. */
2786 if (processing_template_decl)
2787 return build_address (obj);
2789 return cp_build_addr_expr (obj, tf_warning_or_error);
2792 /* Returns true iff functions are equivalent. Equivalent functions are
2793 not '==' only if one is a function-local extern function or if
2794 both are extern "C". */
2796 static inline int
2797 equal_functions (tree fn1, tree fn2)
2799 if (TREE_CODE (fn1) != TREE_CODE (fn2))
2800 return 0;
2801 if (TREE_CODE (fn1) == TEMPLATE_DECL)
2802 return fn1 == fn2;
2803 if (DECL_LOCAL_FUNCTION_P (fn1) || DECL_LOCAL_FUNCTION_P (fn2)
2804 || DECL_EXTERN_C_FUNCTION_P (fn1))
2805 return decls_match (fn1, fn2);
2806 return fn1 == fn2;
2809 /* Print information about one overload candidate CANDIDATE. MSGSTR
2810 is the text to print before the candidate itself.
2812 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
2813 to have been run through gettext by the caller. This wart makes
2814 life simpler in print_z_candidates and for the translators. */
2816 static void
2817 print_z_candidate (const char *msgstr, struct z_candidate *candidate)
2819 if (TREE_CODE (candidate->fn) == IDENTIFIER_NODE)
2821 if (candidate->num_convs == 3)
2822 inform (input_location, "%s %D(%T, %T, %T) <built-in>", msgstr, candidate->fn,
2823 candidate->convs[0]->type,
2824 candidate->convs[1]->type,
2825 candidate->convs[2]->type);
2826 else if (candidate->num_convs == 2)
2827 inform (input_location, "%s %D(%T, %T) <built-in>", msgstr, candidate->fn,
2828 candidate->convs[0]->type,
2829 candidate->convs[1]->type);
2830 else
2831 inform (input_location, "%s %D(%T) <built-in>", msgstr, candidate->fn,
2832 candidate->convs[0]->type);
2834 else if (TYPE_P (candidate->fn))
2835 inform (input_location, "%s %T <conversion>", msgstr, candidate->fn);
2836 else if (candidate->viable == -1)
2837 inform (input_location, "%s %+#D <near match>", msgstr, candidate->fn);
2838 else if (DECL_DELETED_FN (STRIP_TEMPLATE (candidate->fn)))
2839 inform (input_location, "%s %+#D <deleted>", msgstr, candidate->fn);
2840 else
2841 inform (input_location, "%s %+#D", msgstr, candidate->fn);
2844 static void
2845 print_z_candidates (struct z_candidate *candidates)
2847 const char *str;
2848 struct z_candidate *cand1;
2849 struct z_candidate **cand2;
2850 char *spaces;
2852 if (!candidates)
2853 return;
2855 /* Remove non-viable deleted candidates. */
2856 cand1 = candidates;
2857 for (cand2 = &cand1; *cand2; )
2859 if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL
2860 && !(*cand2)->viable
2861 && DECL_DELETED_FN ((*cand2)->fn))
2862 *cand2 = (*cand2)->next;
2863 else
2864 cand2 = &(*cand2)->next;
2866 /* ...if there are any non-deleted ones. */
2867 if (cand1)
2868 candidates = cand1;
2870 /* There may be duplicates in the set of candidates. We put off
2871 checking this condition as long as possible, since we have no way
2872 to eliminate duplicates from a set of functions in less than n^2
2873 time. Now we are about to emit an error message, so it is more
2874 permissible to go slowly. */
2875 for (cand1 = candidates; cand1; cand1 = cand1->next)
2877 tree fn = cand1->fn;
2878 /* Skip builtin candidates and conversion functions. */
2879 if (!DECL_P (fn))
2880 continue;
2881 cand2 = &cand1->next;
2882 while (*cand2)
2884 if (DECL_P ((*cand2)->fn)
2885 && equal_functions (fn, (*cand2)->fn))
2886 *cand2 = (*cand2)->next;
2887 else
2888 cand2 = &(*cand2)->next;
2892 str = candidates->next ? _("candidates are:") : _("candidate is:");
2893 spaces = NULL;
2894 for (; candidates; candidates = candidates->next)
2896 print_z_candidate (spaces ? spaces : str, candidates);
2897 spaces = spaces ? spaces : get_spaces (str);
2899 free (spaces);
2902 /* USER_SEQ is a user-defined conversion sequence, beginning with a
2903 USER_CONV. STD_SEQ is the standard conversion sequence applied to
2904 the result of the conversion function to convert it to the final
2905 desired type. Merge the two sequences into a single sequence,
2906 and return the merged sequence. */
2908 static conversion *
2909 merge_conversion_sequences (conversion *user_seq, conversion *std_seq)
2911 conversion **t;
2913 gcc_assert (user_seq->kind == ck_user);
2915 /* Find the end of the second conversion sequence. */
2916 t = &(std_seq);
2917 while ((*t)->kind != ck_identity)
2918 t = &((*t)->u.next);
2920 /* Replace the identity conversion with the user conversion
2921 sequence. */
2922 *t = user_seq;
2924 /* The entire sequence is a user-conversion sequence. */
2925 std_seq->user_conv_p = true;
2927 return std_seq;
2930 /* Handle overload resolution for initializing an object of class type from
2931 an initializer list. First we look for a suitable constructor that
2932 takes a std::initializer_list; if we don't find one, we then look for a
2933 non-list constructor.
2935 Parameters are as for add_candidates, except that the arguments are in
2936 the form of a CONSTRUCTOR (the initializer list) rather than a VEC, and
2937 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
2939 static void
2940 add_list_candidates (tree fns, tree first_arg,
2941 tree init_list, tree totype,
2942 tree explicit_targs, bool template_only,
2943 tree conversion_path, tree access_path,
2944 int flags,
2945 struct z_candidate **candidates)
2947 VEC(tree,gc) *args;
2949 gcc_assert (*candidates == NULL);
2951 /* For list-initialization we consider explicit constructors, but
2952 give an error if one is selected. */
2953 flags &= ~LOOKUP_ONLYCONVERTING;
2954 /* And we don't allow narrowing conversions. We also use this flag to
2955 avoid the copy constructor call for copy-list-initialization. */
2956 flags |= LOOKUP_NO_NARROWING;
2958 /* Always use the default constructor if the list is empty (DR 990). */
2959 if (CONSTRUCTOR_NELTS (init_list) == 0
2960 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
2962 /* If the class has a list ctor, try passing the list as a single
2963 argument first, but only consider list ctors. */
2964 else if (TYPE_HAS_LIST_CTOR (totype))
2966 flags |= LOOKUP_LIST_ONLY;
2967 args = make_tree_vector_single (init_list);
2968 add_candidates (fns, first_arg, args, NULL_TREE,
2969 explicit_targs, template_only, conversion_path,
2970 access_path, flags, candidates);
2971 if (any_strictly_viable (*candidates))
2972 return;
2975 args = ctor_to_vec (init_list);
2977 /* We aren't looking for list-ctors anymore. */
2978 flags &= ~LOOKUP_LIST_ONLY;
2979 /* We allow more user-defined conversions within an init-list. */
2980 flags &= ~LOOKUP_NO_CONVERSION;
2981 /* But not for the copy ctor. */
2982 flags |= LOOKUP_NO_COPY_CTOR_CONVERSION;
2984 add_candidates (fns, first_arg, args, NULL_TREE,
2985 explicit_targs, template_only, conversion_path,
2986 access_path, flags, candidates);
2989 /* Returns the best overload candidate to perform the requested
2990 conversion. This function is used for three the overloading situations
2991 described in [over.match.copy], [over.match.conv], and [over.match.ref].
2992 If TOTYPE is a REFERENCE_TYPE, we're trying to find an lvalue binding as
2993 per [dcl.init.ref], so we ignore temporary bindings. */
2995 static struct z_candidate *
2996 build_user_type_conversion_1 (tree totype, tree expr, int flags)
2998 struct z_candidate *candidates, *cand;
2999 tree fromtype = TREE_TYPE (expr);
3000 tree ctors = NULL_TREE;
3001 tree conv_fns = NULL_TREE;
3002 conversion *conv = NULL;
3003 tree first_arg = NULL_TREE;
3004 VEC(tree,gc) *args = NULL;
3005 bool any_viable_p;
3006 int convflags;
3008 /* We represent conversion within a hierarchy using RVALUE_CONV and
3009 BASE_CONV, as specified by [over.best.ics]; these become plain
3010 constructor calls, as specified in [dcl.init]. */
3011 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype) || !MAYBE_CLASS_TYPE_P (totype)
3012 || !DERIVED_FROM_P (totype, fromtype));
3014 if (MAYBE_CLASS_TYPE_P (totype))
3015 ctors = lookup_fnfields (totype, complete_ctor_identifier, 0);
3017 if (MAYBE_CLASS_TYPE_P (fromtype))
3019 tree to_nonref = non_reference (totype);
3020 if (same_type_ignoring_top_level_qualifiers_p (to_nonref, fromtype) ||
3021 (CLASS_TYPE_P (to_nonref) && CLASS_TYPE_P (fromtype)
3022 && DERIVED_FROM_P (to_nonref, fromtype)))
3024 /* [class.conv.fct] A conversion function is never used to
3025 convert a (possibly cv-qualified) object to the (possibly
3026 cv-qualified) same object type (or a reference to it), to a
3027 (possibly cv-qualified) base class of that type (or a
3028 reference to it)... */
3030 else
3031 conv_fns = lookup_conversions (fromtype,
3032 /*lookup_template_convs_p=*/true);
3035 candidates = 0;
3036 flags |= LOOKUP_NO_CONVERSION;
3037 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3038 flags |= LOOKUP_NO_NARROWING;
3040 /* It's OK to bind a temporary for converting constructor arguments, but
3041 not in converting the return value of a conversion operator. */
3042 convflags = ((flags & LOOKUP_NO_TEMP_BIND) | LOOKUP_NO_CONVERSION);
3043 flags &= ~LOOKUP_NO_TEMP_BIND;
3045 if (ctors)
3047 int ctorflags = flags;
3048 ctors = BASELINK_FUNCTIONS (ctors);
3050 first_arg = build_int_cst (build_pointer_type (totype), 0);
3052 /* We should never try to call the abstract or base constructor
3053 from here. */
3054 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors))
3055 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors)));
3057 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3059 /* List-initialization. */
3060 add_list_candidates (ctors, first_arg, expr, totype, NULL_TREE,
3061 false, TYPE_BINFO (totype), TYPE_BINFO (totype),
3062 ctorflags, &candidates);
3064 else
3066 args = make_tree_vector_single (expr);
3067 add_candidates (ctors, first_arg, args, NULL_TREE, NULL_TREE, false,
3068 TYPE_BINFO (totype), TYPE_BINFO (totype),
3069 ctorflags, &candidates);
3072 for (cand = candidates; cand; cand = cand->next)
3074 cand->second_conv = build_identity_conv (totype, NULL_TREE);
3076 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3077 set, then this is copy-initialization. In that case, "The
3078 result of the call is then used to direct-initialize the
3079 object that is the destination of the copy-initialization."
3080 [dcl.init]
3082 We represent this in the conversion sequence with an
3083 rvalue conversion, which means a constructor call. */
3084 if (TREE_CODE (totype) != REFERENCE_TYPE
3085 && !(convflags & LOOKUP_NO_TEMP_BIND))
3086 cand->second_conv
3087 = build_conv (ck_rvalue, totype, cand->second_conv);
3091 if (conv_fns)
3092 first_arg = build_this (expr);
3094 for (; conv_fns; conv_fns = TREE_CHAIN (conv_fns))
3096 tree conversion_path = TREE_PURPOSE (conv_fns);
3097 struct z_candidate *old_candidates;
3099 /* If we are called to convert to a reference type, we are trying to
3100 find an lvalue binding, so don't even consider temporaries. If
3101 we don't find an lvalue binding, the caller will try again to
3102 look for a temporary binding. */
3103 if (TREE_CODE (totype) == REFERENCE_TYPE)
3104 convflags |= LOOKUP_NO_TEMP_BIND;
3106 old_candidates = candidates;
3107 add_candidates (TREE_VALUE (conv_fns), first_arg, NULL, totype,
3108 NULL_TREE, false,
3109 conversion_path, TYPE_BINFO (fromtype),
3110 flags, &candidates);
3112 for (cand = candidates; cand != old_candidates; cand = cand->next)
3114 conversion *ics
3115 = implicit_conversion (totype,
3116 TREE_TYPE (TREE_TYPE (cand->fn)),
3118 /*c_cast_p=*/false, convflags);
3120 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3121 copy-initialization. In that case, "The result of the
3122 call is then used to direct-initialize the object that is
3123 the destination of the copy-initialization." [dcl.init]
3125 We represent this in the conversion sequence with an
3126 rvalue conversion, which means a constructor call. But
3127 don't add a second rvalue conversion if there's already
3128 one there. Which there really shouldn't be, but it's
3129 harmless since we'd add it here anyway. */
3130 if (ics && MAYBE_CLASS_TYPE_P (totype) && ics->kind != ck_rvalue
3131 && !(convflags & LOOKUP_NO_TEMP_BIND))
3132 ics = build_conv (ck_rvalue, totype, ics);
3134 cand->second_conv = ics;
3136 if (!ics)
3137 cand->viable = 0;
3138 else if (cand->viable == 1 && ics->bad_p)
3139 cand->viable = -1;
3143 candidates = splice_viable (candidates, pedantic, &any_viable_p);
3144 if (!any_viable_p)
3145 return NULL;
3147 cand = tourney (candidates);
3148 if (cand == 0)
3150 if (flags & LOOKUP_COMPLAIN)
3152 error ("conversion from %qT to %qT is ambiguous",
3153 fromtype, totype);
3154 print_z_candidates (candidates);
3157 cand = candidates; /* any one will do */
3158 cand->second_conv = build_ambiguous_conv (totype, expr);
3159 cand->second_conv->user_conv_p = true;
3160 if (!any_strictly_viable (candidates))
3161 cand->second_conv->bad_p = true;
3162 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3163 ambiguous conversion is no worse than another user-defined
3164 conversion. */
3166 return cand;
3169 /* Build the user conversion sequence. */
3170 conv = build_conv
3171 (ck_user,
3172 (DECL_CONSTRUCTOR_P (cand->fn)
3173 ? totype : non_reference (TREE_TYPE (TREE_TYPE (cand->fn)))),
3174 build_identity_conv (TREE_TYPE (expr), expr));
3175 conv->cand = cand;
3177 /* Remember that this was a list-initialization. */
3178 if (flags & LOOKUP_NO_NARROWING)
3179 conv->check_narrowing = true;
3181 /* Combine it with the second conversion sequence. */
3182 cand->second_conv = merge_conversion_sequences (conv,
3183 cand->second_conv);
3185 if (cand->viable == -1)
3186 cand->second_conv->bad_p = true;
3188 return cand;
3191 tree
3192 build_user_type_conversion (tree totype, tree expr, int flags)
3194 struct z_candidate *cand
3195 = build_user_type_conversion_1 (totype, expr, flags);
3197 if (cand)
3199 if (cand->second_conv->kind == ck_ambig)
3200 return error_mark_node;
3201 expr = convert_like (cand->second_conv, expr, tf_warning_or_error);
3202 return convert_from_reference (expr);
3204 return NULL_TREE;
3207 /* Subroutine of convert_nontype_argument.
3209 EXPR is an argument for a template non-type parameter of integral or
3210 enumeration type. Do any necessary conversions (that are permitted for
3211 non-type arguments) to convert it to the parameter type.
3213 If conversion is successful, returns the converted expression;
3214 otherwise, returns error_mark_node. */
3216 tree
3217 build_integral_nontype_arg_conv (tree type, tree expr, tsubst_flags_t complain)
3219 conversion *conv;
3220 void *p;
3221 tree t;
3223 if (error_operand_p (expr))
3224 return error_mark_node;
3226 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
3228 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3229 p = conversion_obstack_alloc (0);
3231 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
3232 /*c_cast_p=*/false,
3233 LOOKUP_IMPLICIT);
3235 /* for a non-type template-parameter of integral or
3236 enumeration type, integral promotions (4.5) and integral
3237 conversions (4.7) are applied. */
3238 /* It should be sufficient to check the outermost conversion step, since
3239 there are no qualification conversions to integer type. */
3240 if (conv)
3241 switch (conv->kind)
3243 /* A conversion function is OK. If it isn't constexpr, we'll
3244 complain later that the argument isn't constant. */
3245 case ck_user:
3246 /* The lvalue-to-rvalue conversion is OK. */
3247 case ck_rvalue:
3248 case ck_identity:
3249 break;
3251 case ck_std:
3252 t = conv->u.next->type;
3253 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t))
3254 break;
3256 if (complain & tf_error)
3257 error ("conversion from %qT to %qT not considered for "
3258 "non-type template argument", t, type);
3259 /* and fall through. */
3261 default:
3262 conv = NULL;
3263 break;
3266 if (conv)
3267 expr = convert_like (conv, expr, complain);
3268 else
3269 expr = error_mark_node;
3271 /* Free all the conversions we allocated. */
3272 obstack_free (&conversion_obstack, p);
3274 return expr;
3277 /* Do any initial processing on the arguments to a function call. */
3279 static VEC(tree,gc) *
3280 resolve_args (VEC(tree,gc) *args)
3282 unsigned int ix;
3283 tree arg;
3285 FOR_EACH_VEC_ELT (tree, args, ix, arg)
3287 if (error_operand_p (arg))
3288 return NULL;
3289 else if (VOID_TYPE_P (TREE_TYPE (arg)))
3291 error ("invalid use of void expression");
3292 return NULL;
3294 else if (invalid_nonstatic_memfn_p (arg, tf_warning_or_error))
3295 return NULL;
3297 return args;
3300 /* Perform overload resolution on FN, which is called with the ARGS.
3302 Return the candidate function selected by overload resolution, or
3303 NULL if the event that overload resolution failed. In the case
3304 that overload resolution fails, *CANDIDATES will be the set of
3305 candidates considered, and ANY_VIABLE_P will be set to true or
3306 false to indicate whether or not any of the candidates were
3307 viable.
3309 The ARGS should already have gone through RESOLVE_ARGS before this
3310 function is called. */
3312 static struct z_candidate *
3313 perform_overload_resolution (tree fn,
3314 const VEC(tree,gc) *args,
3315 struct z_candidate **candidates,
3316 bool *any_viable_p)
3318 struct z_candidate *cand;
3319 tree explicit_targs = NULL_TREE;
3320 int template_only = 0;
3322 *candidates = NULL;
3323 *any_viable_p = true;
3325 /* Check FN. */
3326 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
3327 || TREE_CODE (fn) == TEMPLATE_DECL
3328 || TREE_CODE (fn) == OVERLOAD
3329 || TREE_CODE (fn) == TEMPLATE_ID_EXPR);
3331 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
3333 explicit_targs = TREE_OPERAND (fn, 1);
3334 fn = TREE_OPERAND (fn, 0);
3335 template_only = 1;
3338 /* Add the various candidate functions. */
3339 add_candidates (fn, NULL_TREE, args, NULL_TREE,
3340 explicit_targs, template_only,
3341 /*conversion_path=*/NULL_TREE,
3342 /*access_path=*/NULL_TREE,
3343 LOOKUP_NORMAL,
3344 candidates);
3346 *candidates = splice_viable (*candidates, pedantic, any_viable_p);
3347 if (!*any_viable_p)
3348 return NULL;
3350 cand = tourney (*candidates);
3351 return cand;
3354 /* Return an expression for a call to FN (a namespace-scope function,
3355 or a static member function) with the ARGS. This may change
3356 ARGS. */
3358 tree
3359 build_new_function_call (tree fn, VEC(tree,gc) **args, bool koenig_p,
3360 tsubst_flags_t complain)
3362 struct z_candidate *candidates, *cand;
3363 bool any_viable_p;
3364 void *p;
3365 tree result;
3367 if (args != NULL && *args != NULL)
3369 *args = resolve_args (*args);
3370 if (*args == NULL)
3371 return error_mark_node;
3374 /* If this function was found without using argument dependent
3375 lookup, then we want to ignore any undeclared friend
3376 functions. */
3377 if (!koenig_p)
3379 tree orig_fn = fn;
3381 fn = remove_hidden_names (fn);
3382 if (!fn)
3384 if (complain & tf_error)
3385 error ("no matching function for call to %<%D(%A)%>",
3386 DECL_NAME (OVL_CURRENT (orig_fn)),
3387 build_tree_list_vec (*args));
3388 return error_mark_node;
3392 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3393 p = conversion_obstack_alloc (0);
3395 cand = perform_overload_resolution (fn, *args, &candidates, &any_viable_p);
3397 if (!cand)
3399 if (complain & tf_error)
3401 if (!any_viable_p && candidates && ! candidates->next
3402 && (TREE_CODE (candidates->fn) == FUNCTION_DECL))
3403 return cp_build_function_call_vec (candidates->fn, args, complain);
3404 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
3405 fn = TREE_OPERAND (fn, 0);
3406 if (!any_viable_p)
3407 error ("no matching function for call to %<%D(%A)%>",
3408 DECL_NAME (OVL_CURRENT (fn)), build_tree_list_vec (*args));
3409 else
3410 error ("call of overloaded %<%D(%A)%> is ambiguous",
3411 DECL_NAME (OVL_CURRENT (fn)), build_tree_list_vec (*args));
3412 if (candidates)
3413 print_z_candidates (candidates);
3415 result = error_mark_node;
3417 else
3418 result = build_over_call (cand, LOOKUP_NORMAL, complain);
3420 /* Free all the conversions we allocated. */
3421 obstack_free (&conversion_obstack, p);
3423 return result;
3426 /* Build a call to a global operator new. FNNAME is the name of the
3427 operator (either "operator new" or "operator new[]") and ARGS are
3428 the arguments provided. This may change ARGS. *SIZE points to the
3429 total number of bytes required by the allocation, and is updated if
3430 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
3431 be used. If this function determines that no cookie should be
3432 used, after all, *COOKIE_SIZE is set to NULL_TREE. If FN is
3433 non-NULL, it will be set, upon return, to the allocation function
3434 called. */
3436 tree
3437 build_operator_new_call (tree fnname, VEC(tree,gc) **args,
3438 tree *size, tree *cookie_size,
3439 tree *fn)
3441 tree fns;
3442 struct z_candidate *candidates;
3443 struct z_candidate *cand;
3444 bool any_viable_p;
3446 if (fn)
3447 *fn = NULL_TREE;
3448 VEC_safe_insert (tree, gc, *args, 0, *size);
3449 *args = resolve_args (*args);
3450 if (*args == NULL)
3451 return error_mark_node;
3453 /* Based on:
3455 [expr.new]
3457 If this lookup fails to find the name, or if the allocated type
3458 is not a class type, the allocation function's name is looked
3459 up in the global scope.
3461 we disregard block-scope declarations of "operator new". */
3462 fns = lookup_function_nonclass (fnname, *args, /*block_p=*/false);
3464 /* Figure out what function is being called. */
3465 cand = perform_overload_resolution (fns, *args, &candidates, &any_viable_p);
3467 /* If no suitable function could be found, issue an error message
3468 and give up. */
3469 if (!cand)
3471 if (!any_viable_p)
3472 error ("no matching function for call to %<%D(%A)%>",
3473 DECL_NAME (OVL_CURRENT (fns)), build_tree_list_vec (*args));
3474 else
3475 error ("call of overloaded %<%D(%A)%> is ambiguous",
3476 DECL_NAME (OVL_CURRENT (fns)), build_tree_list_vec (*args));
3477 if (candidates)
3478 print_z_candidates (candidates);
3479 return error_mark_node;
3482 /* If a cookie is required, add some extra space. Whether
3483 or not a cookie is required cannot be determined until
3484 after we know which function was called. */
3485 if (*cookie_size)
3487 bool use_cookie = true;
3488 if (!abi_version_at_least (2))
3490 /* In G++ 3.2, the check was implemented incorrectly; it
3491 looked at the placement expression, rather than the
3492 type of the function. */
3493 if (VEC_length (tree, *args) == 2
3494 && same_type_p (TREE_TYPE (VEC_index (tree, *args, 1)),
3495 ptr_type_node))
3496 use_cookie = false;
3498 else
3500 tree arg_types;
3502 arg_types = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
3503 /* Skip the size_t parameter. */
3504 arg_types = TREE_CHAIN (arg_types);
3505 /* Check the remaining parameters (if any). */
3506 if (arg_types
3507 && TREE_CHAIN (arg_types) == void_list_node
3508 && same_type_p (TREE_VALUE (arg_types),
3509 ptr_type_node))
3510 use_cookie = false;
3512 /* If we need a cookie, adjust the number of bytes allocated. */
3513 if (use_cookie)
3515 /* Update the total size. */
3516 *size = size_binop (PLUS_EXPR, *size, *cookie_size);
3517 /* Update the argument list to reflect the adjusted size. */
3518 VEC_replace (tree, *args, 0, *size);
3520 else
3521 *cookie_size = NULL_TREE;
3524 /* Tell our caller which function we decided to call. */
3525 if (fn)
3526 *fn = cand->fn;
3528 /* Build the CALL_EXPR. */
3529 return build_over_call (cand, LOOKUP_NORMAL, tf_warning_or_error);
3532 /* Build a new call to operator(). This may change ARGS. */
3534 tree
3535 build_op_call (tree obj, VEC(tree,gc) **args, tsubst_flags_t complain)
3537 struct z_candidate *candidates = 0, *cand;
3538 tree fns, convs, first_mem_arg = NULL_TREE;
3539 tree type = TREE_TYPE (obj);
3540 bool any_viable_p;
3541 tree result = NULL_TREE;
3542 void *p;
3544 if (error_operand_p (obj))
3545 return error_mark_node;
3547 obj = prep_operand (obj);
3549 if (TYPE_PTRMEMFUNC_P (type))
3551 if (complain & tf_error)
3552 /* It's no good looking for an overloaded operator() on a
3553 pointer-to-member-function. */
3554 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj);
3555 return error_mark_node;
3558 if (TYPE_BINFO (type))
3560 fns = lookup_fnfields (TYPE_BINFO (type), ansi_opname (CALL_EXPR), 1);
3561 if (fns == error_mark_node)
3562 return error_mark_node;
3564 else
3565 fns = NULL_TREE;
3567 if (args != NULL && *args != NULL)
3569 *args = resolve_args (*args);
3570 if (*args == NULL)
3571 return error_mark_node;
3574 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3575 p = conversion_obstack_alloc (0);
3577 if (fns)
3579 first_mem_arg = build_this (obj);
3581 add_candidates (BASELINK_FUNCTIONS (fns),
3582 first_mem_arg, *args, NULL_TREE,
3583 NULL_TREE, false,
3584 BASELINK_BINFO (fns), BASELINK_ACCESS_BINFO (fns),
3585 LOOKUP_NORMAL, &candidates);
3588 convs = lookup_conversions (type, /*lookup_template_convs_p=*/true);
3590 for (; convs; convs = TREE_CHAIN (convs))
3592 tree fns = TREE_VALUE (convs);
3593 tree totype = TREE_TYPE (convs);
3595 if ((TREE_CODE (totype) == POINTER_TYPE
3596 && TREE_CODE (TREE_TYPE (totype)) == FUNCTION_TYPE)
3597 || (TREE_CODE (totype) == REFERENCE_TYPE
3598 && TREE_CODE (TREE_TYPE (totype)) == FUNCTION_TYPE)
3599 || (TREE_CODE (totype) == REFERENCE_TYPE
3600 && TREE_CODE (TREE_TYPE (totype)) == POINTER_TYPE
3601 && TREE_CODE (TREE_TYPE (TREE_TYPE (totype))) == FUNCTION_TYPE))
3602 for (; fns; fns = OVL_NEXT (fns))
3604 tree fn = OVL_CURRENT (fns);
3606 if (DECL_NONCONVERTING_P (fn))
3607 continue;
3609 if (TREE_CODE (fn) == TEMPLATE_DECL)
3610 add_template_conv_candidate
3611 (&candidates, fn, obj, NULL_TREE, *args, totype,
3612 /*access_path=*/NULL_TREE,
3613 /*conversion_path=*/NULL_TREE);
3614 else
3615 add_conv_candidate (&candidates, fn, obj, NULL_TREE,
3616 *args, /*conversion_path=*/NULL_TREE,
3617 /*access_path=*/NULL_TREE);
3621 candidates = splice_viable (candidates, pedantic, &any_viable_p);
3622 if (!any_viable_p)
3624 if (complain & tf_error)
3626 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj),
3627 build_tree_list_vec (*args));
3628 print_z_candidates (candidates);
3630 result = error_mark_node;
3632 else
3634 cand = tourney (candidates);
3635 if (cand == 0)
3637 if (complain & tf_error)
3639 error ("call of %<(%T) (%A)%> is ambiguous",
3640 TREE_TYPE (obj), build_tree_list_vec (*args));
3641 print_z_candidates (candidates);
3643 result = error_mark_node;
3645 /* Since cand->fn will be a type, not a function, for a conversion
3646 function, we must be careful not to unconditionally look at
3647 DECL_NAME here. */
3648 else if (TREE_CODE (cand->fn) == FUNCTION_DECL
3649 && DECL_OVERLOADED_OPERATOR_P (cand->fn) == CALL_EXPR)
3650 result = build_over_call (cand, LOOKUP_NORMAL, complain);
3651 else
3653 obj = convert_like_with_context (cand->convs[0], obj, cand->fn, -1,
3654 complain);
3655 obj = convert_from_reference (obj);
3656 result = cp_build_function_call_vec (obj, args, complain);
3660 /* Free all the conversions we allocated. */
3661 obstack_free (&conversion_obstack, p);
3663 return result;
3666 static void
3667 op_error (enum tree_code code, enum tree_code code2,
3668 tree arg1, tree arg2, tree arg3, bool match)
3670 const char *opname;
3672 if (code == MODIFY_EXPR)
3673 opname = assignment_operator_name_info[code2].name;
3674 else
3675 opname = operator_name_info[code].name;
3677 switch (code)
3679 case COND_EXPR:
3680 if (match)
3681 error ("ambiguous overload for ternary %<operator?:%> "
3682 "in %<%E ? %E : %E%>", arg1, arg2, arg3);
3683 else
3684 error ("no match for ternary %<operator?:%> "
3685 "in %<%E ? %E : %E%>", arg1, arg2, arg3);
3686 break;
3688 case POSTINCREMENT_EXPR:
3689 case POSTDECREMENT_EXPR:
3690 if (match)
3691 error ("ambiguous overload for %<operator%s%> in %<%E%s%>",
3692 opname, arg1, opname);
3693 else
3694 error ("no match for %<operator%s%> in %<%E%s%>",
3695 opname, arg1, opname);
3696 break;
3698 case ARRAY_REF:
3699 if (match)
3700 error ("ambiguous overload for %<operator[]%> in %<%E[%E]%>",
3701 arg1, arg2);
3702 else
3703 error ("no match for %<operator[]%> in %<%E[%E]%>",
3704 arg1, arg2);
3705 break;
3707 case REALPART_EXPR:
3708 case IMAGPART_EXPR:
3709 if (match)
3710 error ("ambiguous overload for %qs in %<%s %E%>",
3711 opname, opname, arg1);
3712 else
3713 error ("no match for %qs in %<%s %E%>",
3714 opname, opname, arg1);
3715 break;
3717 default:
3718 if (arg2)
3719 if (match)
3720 error ("ambiguous overload for %<operator%s%> in %<%E %s %E%>",
3721 opname, arg1, opname, arg2);
3722 else
3723 error ("no match for %<operator%s%> in %<%E %s %E%>",
3724 opname, arg1, opname, arg2);
3725 else
3726 if (match)
3727 error ("ambiguous overload for %<operator%s%> in %<%s%E%>",
3728 opname, opname, arg1);
3729 else
3730 error ("no match for %<operator%s%> in %<%s%E%>",
3731 opname, opname, arg1);
3732 break;
3736 /* Return the implicit conversion sequence that could be used to
3737 convert E1 to E2 in [expr.cond]. */
3739 static conversion *
3740 conditional_conversion (tree e1, tree e2)
3742 tree t1 = non_reference (TREE_TYPE (e1));
3743 tree t2 = non_reference (TREE_TYPE (e2));
3744 conversion *conv;
3745 bool good_base;
3747 /* [expr.cond]
3749 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
3750 implicitly converted (clause _conv_) to the type "reference to
3751 T2", subject to the constraint that in the conversion the
3752 reference must bind directly (_dcl.init.ref_) to E1. */
3753 if (real_lvalue_p (e2))
3755 conv = implicit_conversion (build_reference_type (t2),
3758 /*c_cast_p=*/false,
3759 LOOKUP_NO_TEMP_BIND|LOOKUP_ONLYCONVERTING);
3760 if (conv)
3761 return conv;
3764 /* [expr.cond]
3766 If E1 and E2 have class type, and the underlying class types are
3767 the same or one is a base class of the other: E1 can be converted
3768 to match E2 if the class of T2 is the same type as, or a base
3769 class of, the class of T1, and the cv-qualification of T2 is the
3770 same cv-qualification as, or a greater cv-qualification than, the
3771 cv-qualification of T1. If the conversion is applied, E1 is
3772 changed to an rvalue of type T2 that still refers to the original
3773 source class object (or the appropriate subobject thereof). */
3774 if (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
3775 && ((good_base = DERIVED_FROM_P (t2, t1)) || DERIVED_FROM_P (t1, t2)))
3777 if (good_base && at_least_as_qualified_p (t2, t1))
3779 conv = build_identity_conv (t1, e1);
3780 if (!same_type_p (TYPE_MAIN_VARIANT (t1),
3781 TYPE_MAIN_VARIANT (t2)))
3782 conv = build_conv (ck_base, t2, conv);
3783 else
3784 conv = build_conv (ck_rvalue, t2, conv);
3785 return conv;
3787 else
3788 return NULL;
3790 else
3791 /* [expr.cond]
3793 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
3794 converted to the type that expression E2 would have if E2 were
3795 converted to an rvalue (or the type it has, if E2 is an rvalue). */
3796 return implicit_conversion (t2, t1, e1, /*c_cast_p=*/false,
3797 LOOKUP_IMPLICIT);
3800 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
3801 arguments to the conditional expression. */
3803 tree
3804 build_conditional_expr (tree arg1, tree arg2, tree arg3,
3805 tsubst_flags_t complain)
3807 tree arg2_type;
3808 tree arg3_type;
3809 tree result = NULL_TREE;
3810 tree result_type = NULL_TREE;
3811 bool lvalue_p = true;
3812 struct z_candidate *candidates = 0;
3813 struct z_candidate *cand;
3814 void *p;
3816 /* As a G++ extension, the second argument to the conditional can be
3817 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
3818 c'.) If the second operand is omitted, make sure it is
3819 calculated only once. */
3820 if (!arg2)
3822 if (complain & tf_error)
3823 pedwarn (input_location, OPT_pedantic,
3824 "ISO C++ forbids omitting the middle term of a ?: expression");
3826 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
3827 if (real_lvalue_p (arg1))
3828 arg2 = arg1 = stabilize_reference (arg1);
3829 else
3830 arg2 = arg1 = save_expr (arg1);
3833 /* [expr.cond]
3835 The first expression is implicitly converted to bool (clause
3836 _conv_). */
3837 arg1 = perform_implicit_conversion_flags (boolean_type_node, arg1, complain,
3838 LOOKUP_NORMAL);
3840 /* If something has already gone wrong, just pass that fact up the
3841 tree. */
3842 if (error_operand_p (arg1)
3843 || error_operand_p (arg2)
3844 || error_operand_p (arg3))
3845 return error_mark_node;
3847 /* [expr.cond]
3849 If either the second or the third operand has type (possibly
3850 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
3851 array-to-pointer (_conv.array_), and function-to-pointer
3852 (_conv.func_) standard conversions are performed on the second
3853 and third operands. */
3854 arg2_type = unlowered_expr_type (arg2);
3855 arg3_type = unlowered_expr_type (arg3);
3856 if (VOID_TYPE_P (arg2_type) || VOID_TYPE_P (arg3_type))
3858 /* Do the conversions. We don't these for `void' type arguments
3859 since it can't have any effect and since decay_conversion
3860 does not handle that case gracefully. */
3861 if (!VOID_TYPE_P (arg2_type))
3862 arg2 = decay_conversion (arg2);
3863 if (!VOID_TYPE_P (arg3_type))
3864 arg3 = decay_conversion (arg3);
3865 arg2_type = TREE_TYPE (arg2);
3866 arg3_type = TREE_TYPE (arg3);
3868 /* [expr.cond]
3870 One of the following shall hold:
3872 --The second or the third operand (but not both) is a
3873 throw-expression (_except.throw_); the result is of the
3874 type of the other and is an rvalue.
3876 --Both the second and the third operands have type void; the
3877 result is of type void and is an rvalue.
3879 We must avoid calling force_rvalue for expressions of type
3880 "void" because it will complain that their value is being
3881 used. */
3882 if (TREE_CODE (arg2) == THROW_EXPR
3883 && TREE_CODE (arg3) != THROW_EXPR)
3885 if (!VOID_TYPE_P (arg3_type))
3886 arg3 = force_rvalue (arg3);
3887 arg3_type = TREE_TYPE (arg3);
3888 result_type = arg3_type;
3890 else if (TREE_CODE (arg2) != THROW_EXPR
3891 && TREE_CODE (arg3) == THROW_EXPR)
3893 if (!VOID_TYPE_P (arg2_type))
3894 arg2 = force_rvalue (arg2);
3895 arg2_type = TREE_TYPE (arg2);
3896 result_type = arg2_type;
3898 else if (VOID_TYPE_P (arg2_type) && VOID_TYPE_P (arg3_type))
3899 result_type = void_type_node;
3900 else
3902 if (complain & tf_error)
3904 if (VOID_TYPE_P (arg2_type))
3905 error ("second operand to the conditional operator "
3906 "is of type %<void%>, "
3907 "but the third operand is neither a throw-expression "
3908 "nor of type %<void%>");
3909 else
3910 error ("third operand to the conditional operator "
3911 "is of type %<void%>, "
3912 "but the second operand is neither a throw-expression "
3913 "nor of type %<void%>");
3915 return error_mark_node;
3918 lvalue_p = false;
3919 goto valid_operands;
3921 /* [expr.cond]
3923 Otherwise, if the second and third operand have different types,
3924 and either has (possibly cv-qualified) class type, an attempt is
3925 made to convert each of those operands to the type of the other. */
3926 else if (!same_type_p (arg2_type, arg3_type)
3927 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
3929 conversion *conv2;
3930 conversion *conv3;
3932 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3933 p = conversion_obstack_alloc (0);
3935 conv2 = conditional_conversion (arg2, arg3);
3936 conv3 = conditional_conversion (arg3, arg2);
3938 /* [expr.cond]
3940 If both can be converted, or one can be converted but the
3941 conversion is ambiguous, the program is ill-formed. If
3942 neither can be converted, the operands are left unchanged and
3943 further checking is performed as described below. If exactly
3944 one conversion is possible, that conversion is applied to the
3945 chosen operand and the converted operand is used in place of
3946 the original operand for the remainder of this section. */
3947 if ((conv2 && !conv2->bad_p
3948 && conv3 && !conv3->bad_p)
3949 || (conv2 && conv2->kind == ck_ambig)
3950 || (conv3 && conv3->kind == ck_ambig))
3952 error ("operands to ?: have different types %qT and %qT",
3953 arg2_type, arg3_type);
3954 result = error_mark_node;
3956 else if (conv2 && (!conv2->bad_p || !conv3))
3958 arg2 = convert_like (conv2, arg2, complain);
3959 arg2 = convert_from_reference (arg2);
3960 arg2_type = TREE_TYPE (arg2);
3961 /* Even if CONV2 is a valid conversion, the result of the
3962 conversion may be invalid. For example, if ARG3 has type
3963 "volatile X", and X does not have a copy constructor
3964 accepting a "volatile X&", then even if ARG2 can be
3965 converted to X, the conversion will fail. */
3966 if (error_operand_p (arg2))
3967 result = error_mark_node;
3969 else if (conv3 && (!conv3->bad_p || !conv2))
3971 arg3 = convert_like (conv3, arg3, complain);
3972 arg3 = convert_from_reference (arg3);
3973 arg3_type = TREE_TYPE (arg3);
3974 if (error_operand_p (arg3))
3975 result = error_mark_node;
3978 /* Free all the conversions we allocated. */
3979 obstack_free (&conversion_obstack, p);
3981 if (result)
3982 return result;
3984 /* If, after the conversion, both operands have class type,
3985 treat the cv-qualification of both operands as if it were the
3986 union of the cv-qualification of the operands.
3988 The standard is not clear about what to do in this
3989 circumstance. For example, if the first operand has type
3990 "const X" and the second operand has a user-defined
3991 conversion to "volatile X", what is the type of the second
3992 operand after this step? Making it be "const X" (matching
3993 the first operand) seems wrong, as that discards the
3994 qualification without actually performing a copy. Leaving it
3995 as "volatile X" seems wrong as that will result in the
3996 conditional expression failing altogether, even though,
3997 according to this step, the one operand could be converted to
3998 the type of the other. */
3999 if ((conv2 || conv3)
4000 && CLASS_TYPE_P (arg2_type)
4001 && cp_type_quals (arg2_type) != cp_type_quals (arg3_type))
4002 arg2_type = arg3_type =
4003 cp_build_qualified_type (arg2_type,
4004 cp_type_quals (arg2_type)
4005 | cp_type_quals (arg3_type));
4008 /* [expr.cond]
4010 If the second and third operands are lvalues and have the same
4011 type, the result is of that type and is an lvalue. */
4012 if (real_lvalue_p (arg2)
4013 && real_lvalue_p (arg3)
4014 && same_type_p (arg2_type, arg3_type))
4016 result_type = arg2_type;
4017 arg2 = mark_lvalue_use (arg2);
4018 arg3 = mark_lvalue_use (arg3);
4019 goto valid_operands;
4022 /* [expr.cond]
4024 Otherwise, the result is an rvalue. If the second and third
4025 operand do not have the same type, and either has (possibly
4026 cv-qualified) class type, overload resolution is used to
4027 determine the conversions (if any) to be applied to the operands
4028 (_over.match.oper_, _over.built_). */
4029 lvalue_p = false;
4030 if (!same_type_p (arg2_type, arg3_type)
4031 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
4033 tree args[3];
4034 conversion *conv;
4035 bool any_viable_p;
4037 /* Rearrange the arguments so that add_builtin_candidate only has
4038 to know about two args. In build_builtin_candidate, the
4039 arguments are unscrambled. */
4040 args[0] = arg2;
4041 args[1] = arg3;
4042 args[2] = arg1;
4043 add_builtin_candidates (&candidates,
4044 COND_EXPR,
4045 NOP_EXPR,
4046 ansi_opname (COND_EXPR),
4047 args,
4048 LOOKUP_NORMAL);
4050 /* [expr.cond]
4052 If the overload resolution fails, the program is
4053 ill-formed. */
4054 candidates = splice_viable (candidates, pedantic, &any_viable_p);
4055 if (!any_viable_p)
4057 if (complain & tf_error)
4059 op_error (COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE);
4060 print_z_candidates (candidates);
4062 return error_mark_node;
4064 cand = tourney (candidates);
4065 if (!cand)
4067 if (complain & tf_error)
4069 op_error (COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE);
4070 print_z_candidates (candidates);
4072 return error_mark_node;
4075 /* [expr.cond]
4077 Otherwise, the conversions thus determined are applied, and
4078 the converted operands are used in place of the original
4079 operands for the remainder of this section. */
4080 conv = cand->convs[0];
4081 arg1 = convert_like (conv, arg1, complain);
4082 conv = cand->convs[1];
4083 arg2 = convert_like (conv, arg2, complain);
4084 arg2_type = TREE_TYPE (arg2);
4085 conv = cand->convs[2];
4086 arg3 = convert_like (conv, arg3, complain);
4087 arg3_type = TREE_TYPE (arg3);
4090 /* [expr.cond]
4092 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
4093 and function-to-pointer (_conv.func_) standard conversions are
4094 performed on the second and third operands.
4096 We need to force the lvalue-to-rvalue conversion here for class types,
4097 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
4098 that isn't wrapped with a TARGET_EXPR plays havoc with exception
4099 regions. */
4101 arg2 = force_rvalue (arg2);
4102 if (!CLASS_TYPE_P (arg2_type))
4103 arg2_type = TREE_TYPE (arg2);
4105 arg3 = force_rvalue (arg3);
4106 if (!CLASS_TYPE_P (arg3_type))
4107 arg3_type = TREE_TYPE (arg3);
4109 if (arg2 == error_mark_node || arg3 == error_mark_node)
4110 return error_mark_node;
4112 /* [expr.cond]
4114 After those conversions, one of the following shall hold:
4116 --The second and third operands have the same type; the result is of
4117 that type. */
4118 if (same_type_p (arg2_type, arg3_type))
4119 result_type = arg2_type;
4120 /* [expr.cond]
4122 --The second and third operands have arithmetic or enumeration
4123 type; the usual arithmetic conversions are performed to bring
4124 them to a common type, and the result is of that type. */
4125 else if ((ARITHMETIC_TYPE_P (arg2_type)
4126 || UNSCOPED_ENUM_P (arg2_type))
4127 && (ARITHMETIC_TYPE_P (arg3_type)
4128 || UNSCOPED_ENUM_P (arg3_type)))
4130 /* In this case, there is always a common type. */
4131 result_type = type_after_usual_arithmetic_conversions (arg2_type,
4132 arg3_type);
4133 do_warn_double_promotion (result_type, arg2_type, arg3_type,
4134 "implicit conversion from %qT to %qT to "
4135 "match other result of conditional",
4136 input_location);
4138 if (TREE_CODE (arg2_type) == ENUMERAL_TYPE
4139 && TREE_CODE (arg3_type) == ENUMERAL_TYPE)
4141 if (complain & tf_warning)
4142 warning (0,
4143 "enumeral mismatch in conditional expression: %qT vs %qT",
4144 arg2_type, arg3_type);
4146 else if (extra_warnings
4147 && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE
4148 && !same_type_p (arg3_type, type_promotes_to (arg2_type)))
4149 || (TREE_CODE (arg3_type) == ENUMERAL_TYPE
4150 && !same_type_p (arg2_type, type_promotes_to (arg3_type)))))
4152 if (complain & tf_warning)
4153 warning (0,
4154 "enumeral and non-enumeral type in conditional expression");
4157 arg2 = perform_implicit_conversion (result_type, arg2, complain);
4158 arg3 = perform_implicit_conversion (result_type, arg3, complain);
4160 /* [expr.cond]
4162 --The second and third operands have pointer type, or one has
4163 pointer type and the other is a null pointer constant; pointer
4164 conversions (_conv.ptr_) and qualification conversions
4165 (_conv.qual_) are performed to bring them to their composite
4166 pointer type (_expr.rel_). The result is of the composite
4167 pointer type.
4169 --The second and third operands have pointer to member type, or
4170 one has pointer to member type and the other is a null pointer
4171 constant; pointer to member conversions (_conv.mem_) and
4172 qualification conversions (_conv.qual_) are performed to bring
4173 them to a common type, whose cv-qualification shall match the
4174 cv-qualification of either the second or the third operand.
4175 The result is of the common type. */
4176 else if ((null_ptr_cst_p (arg2)
4177 && (TYPE_PTR_P (arg3_type) || TYPE_PTR_TO_MEMBER_P (arg3_type)))
4178 || (null_ptr_cst_p (arg3)
4179 && (TYPE_PTR_P (arg2_type) || TYPE_PTR_TO_MEMBER_P (arg2_type)))
4180 || (TYPE_PTR_P (arg2_type) && TYPE_PTR_P (arg3_type))
4181 || (TYPE_PTRMEM_P (arg2_type) && TYPE_PTRMEM_P (arg3_type))
4182 || (TYPE_PTRMEMFUNC_P (arg2_type) && TYPE_PTRMEMFUNC_P (arg3_type)))
4184 result_type = composite_pointer_type (arg2_type, arg3_type, arg2,
4185 arg3, CPO_CONDITIONAL_EXPR,
4186 complain);
4187 if (result_type == error_mark_node)
4188 return error_mark_node;
4189 arg2 = perform_implicit_conversion (result_type, arg2, complain);
4190 arg3 = perform_implicit_conversion (result_type, arg3, complain);
4193 if (!result_type)
4195 if (complain & tf_error)
4196 error ("operands to ?: have different types %qT and %qT",
4197 arg2_type, arg3_type);
4198 return error_mark_node;
4201 valid_operands:
4202 result = build3 (COND_EXPR, result_type, arg1, arg2, arg3);
4203 if (!cp_unevaluated_operand)
4204 /* Avoid folding within decltype (c++/42013) and noexcept. */
4205 result = fold_if_not_in_template (result);
4207 /* We can't use result_type below, as fold might have returned a
4208 throw_expr. */
4210 if (!lvalue_p)
4212 /* Expand both sides into the same slot, hopefully the target of
4213 the ?: expression. We used to check for TARGET_EXPRs here,
4214 but now we sometimes wrap them in NOP_EXPRs so the test would
4215 fail. */
4216 if (CLASS_TYPE_P (TREE_TYPE (result)))
4217 result = get_target_expr (result);
4218 /* If this expression is an rvalue, but might be mistaken for an
4219 lvalue, we must add a NON_LVALUE_EXPR. */
4220 result = rvalue (result);
4223 return result;
4226 /* OPERAND is an operand to an expression. Perform necessary steps
4227 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
4228 returned. */
4230 static tree
4231 prep_operand (tree operand)
4233 if (operand)
4235 if (CLASS_TYPE_P (TREE_TYPE (operand))
4236 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand)))
4237 /* Make sure the template type is instantiated now. */
4238 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand)));
4241 return operand;
4244 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
4245 OVERLOAD) to the CANDIDATES, returning an updated list of
4246 CANDIDATES. The ARGS are the arguments provided to the call;
4247 if FIRST_ARG is non-null it is the implicit object argument,
4248 otherwise the first element of ARGS is used if needed. The
4249 EXPLICIT_TARGS are explicit template arguments provided.
4250 TEMPLATE_ONLY is true if only template functions should be
4251 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
4252 add_function_candidate. */
4254 static void
4255 add_candidates (tree fns, tree first_arg, const VEC(tree,gc) *args,
4256 tree return_type,
4257 tree explicit_targs, bool template_only,
4258 tree conversion_path, tree access_path,
4259 int flags,
4260 struct z_candidate **candidates)
4262 tree ctype;
4263 const VEC(tree,gc) *non_static_args;
4264 bool check_list_ctor;
4265 bool check_converting;
4266 unification_kind_t strict;
4267 tree fn;
4269 if (!fns)
4270 return;
4272 /* Precalculate special handling of constructors and conversion ops. */
4273 fn = OVL_CURRENT (fns);
4274 if (DECL_CONV_FN_P (fn))
4276 check_list_ctor = false;
4277 check_converting = !!(flags & LOOKUP_ONLYCONVERTING);
4278 if (flags & LOOKUP_NO_CONVERSION)
4279 /* We're doing return_type(x). */
4280 strict = DEDUCE_CONV;
4281 else
4282 /* We're doing x.operator return_type(). */
4283 strict = DEDUCE_EXACT;
4284 /* [over.match.funcs] For conversion functions, the function
4285 is considered to be a member of the class of the implicit
4286 object argument for the purpose of defining the type of
4287 the implicit object parameter. */
4288 ctype = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (first_arg)));
4290 else
4292 if (DECL_CONSTRUCTOR_P (fn))
4294 check_list_ctor = !!(flags & LOOKUP_LIST_ONLY);
4295 check_converting = !!(flags & LOOKUP_ONLYCONVERTING);
4297 else
4299 check_list_ctor = false;
4300 check_converting = false;
4302 strict = DEDUCE_CALL;
4303 ctype = conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE;
4306 if (first_arg)
4307 non_static_args = args;
4308 else
4309 /* Delay creating the implicit this parameter until it is needed. */
4310 non_static_args = NULL;
4312 for (; fns; fns = OVL_NEXT (fns))
4314 tree fn_first_arg;
4315 const VEC(tree,gc) *fn_args;
4317 fn = OVL_CURRENT (fns);
4319 if (check_converting && DECL_NONCONVERTING_P (fn))
4320 continue;
4321 if (check_list_ctor && !is_list_ctor (fn))
4322 continue;
4324 /* Figure out which set of arguments to use. */
4325 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
4327 /* If this function is a non-static member and we didn't get an
4328 implicit object argument, move it out of args. */
4329 if (first_arg == NULL_TREE)
4331 unsigned int ix;
4332 tree arg;
4333 VEC(tree,gc) *tempvec
4334 = VEC_alloc (tree, gc, VEC_length (tree, args) - 1);
4335 for (ix = 1; VEC_iterate (tree, args, ix, arg); ++ix)
4336 VEC_quick_push (tree, tempvec, arg);
4337 non_static_args = tempvec;
4338 first_arg = build_this (VEC_index (tree, args, 0));
4341 fn_first_arg = first_arg;
4342 fn_args = non_static_args;
4344 else
4346 /* Otherwise, just use the list of arguments provided. */
4347 fn_first_arg = NULL_TREE;
4348 fn_args = args;
4351 if (TREE_CODE (fn) == TEMPLATE_DECL)
4352 add_template_candidate (candidates,
4354 ctype,
4355 explicit_targs,
4356 fn_first_arg,
4357 fn_args,
4358 return_type,
4359 access_path,
4360 conversion_path,
4361 flags,
4362 strict);
4363 else if (!template_only)
4364 add_function_candidate (candidates,
4366 ctype,
4367 fn_first_arg,
4368 fn_args,
4369 access_path,
4370 conversion_path,
4371 flags);
4375 /* Even unsigned enum types promote to signed int. We don't want to
4376 issue -Wsign-compare warnings for this case. Here ORIG_ARG is the
4377 original argument and ARG is the argument after any conversions
4378 have been applied. We set TREE_NO_WARNING if we have added a cast
4379 from an unsigned enum type to a signed integer type. */
4381 static void
4382 avoid_sign_compare_warnings (tree orig_arg, tree arg)
4384 if (orig_arg != NULL_TREE
4385 && arg != NULL_TREE
4386 && orig_arg != arg
4387 && TREE_CODE (TREE_TYPE (orig_arg)) == ENUMERAL_TYPE
4388 && TYPE_UNSIGNED (TREE_TYPE (orig_arg))
4389 && INTEGRAL_TYPE_P (TREE_TYPE (arg))
4390 && !TYPE_UNSIGNED (TREE_TYPE (arg)))
4391 TREE_NO_WARNING (arg) = 1;
4394 tree
4395 build_new_op (enum tree_code code, int flags, tree arg1, tree arg2, tree arg3,
4396 bool *overloaded_p, tsubst_flags_t complain)
4398 tree orig_arg1 = arg1;
4399 tree orig_arg2 = arg2;
4400 tree orig_arg3 = arg3;
4401 struct z_candidate *candidates = 0, *cand;
4402 VEC(tree,gc) *arglist;
4403 tree fnname;
4404 tree args[3];
4405 tree result = NULL_TREE;
4406 bool result_valid_p = false;
4407 enum tree_code code2 = NOP_EXPR;
4408 enum tree_code code_orig_arg1 = ERROR_MARK;
4409 enum tree_code code_orig_arg2 = ERROR_MARK;
4410 conversion *conv;
4411 void *p;
4412 bool strict_p;
4413 bool any_viable_p;
4415 if (error_operand_p (arg1)
4416 || error_operand_p (arg2)
4417 || error_operand_p (arg3))
4418 return error_mark_node;
4420 if (code == MODIFY_EXPR)
4422 code2 = TREE_CODE (arg3);
4423 arg3 = NULL_TREE;
4424 fnname = ansi_assopname (code2);
4426 else
4427 fnname = ansi_opname (code);
4429 arg1 = prep_operand (arg1);
4431 switch (code)
4433 case NEW_EXPR:
4434 case VEC_NEW_EXPR:
4435 case VEC_DELETE_EXPR:
4436 case DELETE_EXPR:
4437 /* Use build_op_new_call and build_op_delete_call instead. */
4438 gcc_unreachable ();
4440 case CALL_EXPR:
4441 /* Use build_op_call instead. */
4442 gcc_unreachable ();
4444 case TRUTH_ORIF_EXPR:
4445 case TRUTH_ANDIF_EXPR:
4446 case TRUTH_AND_EXPR:
4447 case TRUTH_OR_EXPR:
4448 /* These are saved for the sake of warn_logical_operator. */
4449 code_orig_arg1 = TREE_CODE (arg1);
4450 code_orig_arg2 = TREE_CODE (arg2);
4452 default:
4453 break;
4456 arg2 = prep_operand (arg2);
4457 arg3 = prep_operand (arg3);
4459 if (code == COND_EXPR)
4460 /* Use build_conditional_expr instead. */
4461 gcc_unreachable ();
4462 else if (! IS_OVERLOAD_TYPE (TREE_TYPE (arg1))
4463 && (! arg2 || ! IS_OVERLOAD_TYPE (TREE_TYPE (arg2))))
4464 goto builtin;
4466 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
4467 arg2 = integer_zero_node;
4469 arglist = VEC_alloc (tree, gc, 3);
4470 VEC_quick_push (tree, arglist, arg1);
4471 if (arg2 != NULL_TREE)
4472 VEC_quick_push (tree, arglist, arg2);
4473 if (arg3 != NULL_TREE)
4474 VEC_quick_push (tree, arglist, arg3);
4476 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4477 p = conversion_obstack_alloc (0);
4479 /* Add namespace-scope operators to the list of functions to
4480 consider. */
4481 add_candidates (lookup_function_nonclass (fnname, arglist, /*block_p=*/true),
4482 NULL_TREE, arglist, NULL_TREE,
4483 NULL_TREE, false, NULL_TREE, NULL_TREE,
4484 flags, &candidates);
4485 /* Add class-member operators to the candidate set. */
4486 if (CLASS_TYPE_P (TREE_TYPE (arg1)))
4488 tree fns;
4490 fns = lookup_fnfields (TREE_TYPE (arg1), fnname, 1);
4491 if (fns == error_mark_node)
4493 result = error_mark_node;
4494 goto user_defined_result_ready;
4496 if (fns)
4497 add_candidates (BASELINK_FUNCTIONS (fns),
4498 NULL_TREE, arglist, NULL_TREE,
4499 NULL_TREE, false,
4500 BASELINK_BINFO (fns),
4501 BASELINK_ACCESS_BINFO (fns),
4502 flags, &candidates);
4505 args[0] = arg1;
4506 args[1] = arg2;
4507 args[2] = NULL_TREE;
4509 add_builtin_candidates (&candidates, code, code2, fnname, args, flags);
4511 switch (code)
4513 case COMPOUND_EXPR:
4514 case ADDR_EXPR:
4515 /* For these, the built-in candidates set is empty
4516 [over.match.oper]/3. We don't want non-strict matches
4517 because exact matches are always possible with built-in
4518 operators. The built-in candidate set for COMPONENT_REF
4519 would be empty too, but since there are no such built-in
4520 operators, we accept non-strict matches for them. */
4521 strict_p = true;
4522 break;
4524 default:
4525 strict_p = pedantic;
4526 break;
4529 candidates = splice_viable (candidates, strict_p, &any_viable_p);
4530 if (!any_viable_p)
4532 switch (code)
4534 case POSTINCREMENT_EXPR:
4535 case POSTDECREMENT_EXPR:
4536 /* Don't try anything fancy if we're not allowed to produce
4537 errors. */
4538 if (!(complain & tf_error))
4539 return error_mark_node;
4541 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
4542 distinguish between prefix and postfix ++ and
4543 operator++() was used for both, so we allow this with
4544 -fpermissive. */
4545 if (flags & LOOKUP_COMPLAIN)
4547 const char *msg = (flag_permissive)
4548 ? G_("no %<%D(int)%> declared for postfix %qs,"
4549 " trying prefix operator instead")
4550 : G_("no %<%D(int)%> declared for postfix %qs");
4551 permerror (input_location, msg, fnname,
4552 operator_name_info[code].name);
4555 if (!flag_permissive)
4556 return error_mark_node;
4558 if (code == POSTINCREMENT_EXPR)
4559 code = PREINCREMENT_EXPR;
4560 else
4561 code = PREDECREMENT_EXPR;
4562 result = build_new_op (code, flags, arg1, NULL_TREE, NULL_TREE,
4563 overloaded_p, complain);
4564 break;
4566 /* The caller will deal with these. */
4567 case ADDR_EXPR:
4568 case COMPOUND_EXPR:
4569 case COMPONENT_REF:
4570 result = NULL_TREE;
4571 result_valid_p = true;
4572 break;
4574 default:
4575 if ((flags & LOOKUP_COMPLAIN) && (complain & tf_error))
4577 /* If one of the arguments of the operator represents
4578 an invalid use of member function pointer, try to report
4579 a meaningful error ... */
4580 if (invalid_nonstatic_memfn_p (arg1, tf_error)
4581 || invalid_nonstatic_memfn_p (arg2, tf_error)
4582 || invalid_nonstatic_memfn_p (arg3, tf_error))
4583 /* We displayed the error message. */;
4584 else
4586 /* ... Otherwise, report the more generic
4587 "no matching operator found" error */
4588 op_error (code, code2, arg1, arg2, arg3, FALSE);
4589 print_z_candidates (candidates);
4592 result = error_mark_node;
4593 break;
4596 else
4598 cand = tourney (candidates);
4599 if (cand == 0)
4601 if ((flags & LOOKUP_COMPLAIN) && (complain & tf_error))
4603 op_error (code, code2, arg1, arg2, arg3, TRUE);
4604 print_z_candidates (candidates);
4606 result = error_mark_node;
4608 else if (TREE_CODE (cand->fn) == FUNCTION_DECL)
4610 if (overloaded_p)
4611 *overloaded_p = true;
4613 if (resolve_args (arglist) == NULL)
4614 result = error_mark_node;
4615 else
4616 result = build_over_call (cand, LOOKUP_NORMAL, complain);
4618 else
4620 /* Give any warnings we noticed during overload resolution. */
4621 if (cand->warnings && (complain & tf_warning))
4623 struct candidate_warning *w;
4624 for (w = cand->warnings; w; w = w->next)
4625 joust (cand, w->loser, 1);
4628 /* Check for comparison of different enum types. */
4629 switch (code)
4631 case GT_EXPR:
4632 case LT_EXPR:
4633 case GE_EXPR:
4634 case LE_EXPR:
4635 case EQ_EXPR:
4636 case NE_EXPR:
4637 if (TREE_CODE (TREE_TYPE (arg1)) == ENUMERAL_TYPE
4638 && TREE_CODE (TREE_TYPE (arg2)) == ENUMERAL_TYPE
4639 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1))
4640 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2)))
4641 && (complain & tf_warning))
4643 warning (OPT_Wenum_compare,
4644 "comparison between %q#T and %q#T",
4645 TREE_TYPE (arg1), TREE_TYPE (arg2));
4647 break;
4648 default:
4649 break;
4652 /* We need to strip any leading REF_BIND so that bitfields
4653 don't cause errors. This should not remove any important
4654 conversions, because builtins don't apply to class
4655 objects directly. */
4656 conv = cand->convs[0];
4657 if (conv->kind == ck_ref_bind)
4658 conv = conv->u.next;
4659 arg1 = convert_like (conv, arg1, complain);
4661 if (arg2)
4663 /* We need to call warn_logical_operator before
4664 converting arg2 to a boolean_type. */
4665 if (complain & tf_warning)
4666 warn_logical_operator (input_location, code, boolean_type_node,
4667 code_orig_arg1, arg1,
4668 code_orig_arg2, arg2);
4670 conv = cand->convs[1];
4671 if (conv->kind == ck_ref_bind)
4672 conv = conv->u.next;
4673 arg2 = convert_like (conv, arg2, complain);
4675 if (arg3)
4677 conv = cand->convs[2];
4678 if (conv->kind == ck_ref_bind)
4679 conv = conv->u.next;
4680 arg3 = convert_like (conv, arg3, complain);
4686 user_defined_result_ready:
4688 /* Free all the conversions we allocated. */
4689 obstack_free (&conversion_obstack, p);
4691 if (result || result_valid_p)
4692 return result;
4694 builtin:
4695 avoid_sign_compare_warnings (orig_arg1, arg1);
4696 avoid_sign_compare_warnings (orig_arg2, arg2);
4697 avoid_sign_compare_warnings (orig_arg3, arg3);
4699 switch (code)
4701 case MODIFY_EXPR:
4702 return cp_build_modify_expr (arg1, code2, arg2, complain);
4704 case INDIRECT_REF:
4705 return cp_build_indirect_ref (arg1, RO_UNARY_STAR, complain);
4707 case TRUTH_ANDIF_EXPR:
4708 case TRUTH_ORIF_EXPR:
4709 case TRUTH_AND_EXPR:
4710 case TRUTH_OR_EXPR:
4711 warn_logical_operator (input_location, code, boolean_type_node,
4712 code_orig_arg1, arg1, code_orig_arg2, arg2);
4713 /* Fall through. */
4714 case PLUS_EXPR:
4715 case MINUS_EXPR:
4716 case MULT_EXPR:
4717 case TRUNC_DIV_EXPR:
4718 case GT_EXPR:
4719 case LT_EXPR:
4720 case GE_EXPR:
4721 case LE_EXPR:
4722 case EQ_EXPR:
4723 case NE_EXPR:
4724 case MAX_EXPR:
4725 case MIN_EXPR:
4726 case LSHIFT_EXPR:
4727 case RSHIFT_EXPR:
4728 case TRUNC_MOD_EXPR:
4729 case BIT_AND_EXPR:
4730 case BIT_IOR_EXPR:
4731 case BIT_XOR_EXPR:
4732 return cp_build_binary_op (input_location, code, arg1, arg2, complain);
4734 case UNARY_PLUS_EXPR:
4735 case NEGATE_EXPR:
4736 case BIT_NOT_EXPR:
4737 case TRUTH_NOT_EXPR:
4738 case PREINCREMENT_EXPR:
4739 case POSTINCREMENT_EXPR:
4740 case PREDECREMENT_EXPR:
4741 case POSTDECREMENT_EXPR:
4742 case REALPART_EXPR:
4743 case IMAGPART_EXPR:
4744 return cp_build_unary_op (code, arg1, candidates != 0, complain);
4746 case ARRAY_REF:
4747 return cp_build_array_ref (input_location, arg1, arg2, complain);
4749 case MEMBER_REF:
4750 return build_m_component_ref (cp_build_indirect_ref (arg1, RO_NULL,
4751 complain),
4752 arg2);
4754 /* The caller will deal with these. */
4755 case ADDR_EXPR:
4756 case COMPONENT_REF:
4757 case COMPOUND_EXPR:
4758 return NULL_TREE;
4760 default:
4761 gcc_unreachable ();
4763 return NULL_TREE;
4766 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
4767 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
4769 static bool
4770 non_placement_deallocation_fn_p (tree t)
4772 /* A template instance is never a usual deallocation function,
4773 regardless of its signature. */
4774 if (TREE_CODE (t) == TEMPLATE_DECL
4775 || primary_template_instantiation_p (t))
4776 return false;
4778 /* If a class T has a member deallocation function named operator delete
4779 with exactly one parameter, then that function is a usual
4780 (non-placement) deallocation function. If class T does not declare
4781 such an operator delete but does declare a member deallocation
4782 function named operator delete with exactly two parameters, the second
4783 of which has type std::size_t (18.2), then this function is a usual
4784 deallocation function. */
4785 t = FUNCTION_ARG_CHAIN (t);
4786 if (t == void_list_node
4787 || (t && same_type_p (TREE_VALUE (t), size_type_node)
4788 && TREE_CHAIN (t) == void_list_node))
4789 return true;
4790 return false;
4793 /* Build a call to operator delete. This has to be handled very specially,
4794 because the restrictions on what signatures match are different from all
4795 other call instances. For a normal delete, only a delete taking (void *)
4796 or (void *, size_t) is accepted. For a placement delete, only an exact
4797 match with the placement new is accepted.
4799 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
4800 ADDR is the pointer to be deleted.
4801 SIZE is the size of the memory block to be deleted.
4802 GLOBAL_P is true if the delete-expression should not consider
4803 class-specific delete operators.
4804 PLACEMENT is the corresponding placement new call, or NULL_TREE.
4806 If this call to "operator delete" is being generated as part to
4807 deallocate memory allocated via a new-expression (as per [expr.new]
4808 which requires that if the initialization throws an exception then
4809 we call a deallocation function), then ALLOC_FN is the allocation
4810 function. */
4812 tree
4813 build_op_delete_call (enum tree_code code, tree addr, tree size,
4814 bool global_p, tree placement,
4815 tree alloc_fn)
4817 tree fn = NULL_TREE;
4818 tree fns, fnname, type, t;
4820 if (addr == error_mark_node)
4821 return error_mark_node;
4823 type = strip_array_types (TREE_TYPE (TREE_TYPE (addr)));
4825 fnname = ansi_opname (code);
4827 if (CLASS_TYPE_P (type)
4828 && COMPLETE_TYPE_P (complete_type (type))
4829 && !global_p)
4830 /* In [class.free]
4832 If the result of the lookup is ambiguous or inaccessible, or if
4833 the lookup selects a placement deallocation function, the
4834 program is ill-formed.
4836 Therefore, we ask lookup_fnfields to complain about ambiguity. */
4838 fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1);
4839 if (fns == error_mark_node)
4840 return error_mark_node;
4842 else
4843 fns = NULL_TREE;
4845 if (fns == NULL_TREE)
4846 fns = lookup_name_nonclass (fnname);
4848 /* Strip const and volatile from addr. */
4849 addr = cp_convert (ptr_type_node, addr);
4851 if (placement)
4853 /* "A declaration of a placement deallocation function matches the
4854 declaration of a placement allocation function if it has the same
4855 number of parameters and, after parameter transformations (8.3.5),
4856 all parameter types except the first are identical."
4858 So we build up the function type we want and ask instantiate_type
4859 to get it for us. */
4860 t = FUNCTION_ARG_CHAIN (alloc_fn);
4861 t = tree_cons (NULL_TREE, ptr_type_node, t);
4862 t = build_function_type (void_type_node, t);
4864 fn = instantiate_type (t, fns, tf_none);
4865 if (fn == error_mark_node)
4866 return NULL_TREE;
4868 if (BASELINK_P (fn))
4869 fn = BASELINK_FUNCTIONS (fn);
4871 /* "If the lookup finds the two-parameter form of a usual deallocation
4872 function (3.7.4.2) and that function, considered as a placement
4873 deallocation function, would have been selected as a match for the
4874 allocation function, the program is ill-formed." */
4875 if (non_placement_deallocation_fn_p (fn))
4877 /* But if the class has an operator delete (void *), then that is
4878 the usual deallocation function, so we shouldn't complain
4879 about using the operator delete (void *, size_t). */
4880 for (t = BASELINK_P (fns) ? BASELINK_FUNCTIONS (fns) : fns;
4881 t; t = OVL_NEXT (t))
4883 tree elt = OVL_CURRENT (t);
4884 if (non_placement_deallocation_fn_p (elt)
4885 && FUNCTION_ARG_CHAIN (elt) == void_list_node)
4886 goto ok;
4888 permerror (0, "non-placement deallocation function %q+D", fn);
4889 permerror (input_location, "selected for placement delete");
4890 ok:;
4893 else
4894 /* "Any non-placement deallocation function matches a non-placement
4895 allocation function. If the lookup finds a single matching
4896 deallocation function, that function will be called; otherwise, no
4897 deallocation function will be called." */
4898 for (t = BASELINK_P (fns) ? BASELINK_FUNCTIONS (fns) : fns;
4899 t; t = OVL_NEXT (t))
4901 tree elt = OVL_CURRENT (t);
4902 if (non_placement_deallocation_fn_p (elt))
4904 fn = elt;
4905 /* "If a class T has a member deallocation function named
4906 operator delete with exactly one parameter, then that
4907 function is a usual (non-placement) deallocation
4908 function. If class T does not declare such an operator
4909 delete but does declare a member deallocation function named
4910 operator delete with exactly two parameters, the second of
4911 which has type std::size_t (18.2), then this function is a
4912 usual deallocation function."
4914 So (void*) beats (void*, size_t). */
4915 if (FUNCTION_ARG_CHAIN (fn) == void_list_node)
4916 break;
4920 /* If we have a matching function, call it. */
4921 if (fn)
4923 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
4925 /* If the FN is a member function, make sure that it is
4926 accessible. */
4927 if (BASELINK_P (fns))
4928 perform_or_defer_access_check (BASELINK_BINFO (fns), fn, fn);
4930 /* Core issue 901: It's ok to new a type with deleted delete. */
4931 if (DECL_DELETED_FN (fn) && alloc_fn)
4932 return NULL_TREE;
4934 if (placement)
4936 /* The placement args might not be suitable for overload
4937 resolution at this point, so build the call directly. */
4938 int nargs = call_expr_nargs (placement);
4939 tree *argarray = XALLOCAVEC (tree, nargs);
4940 int i;
4941 argarray[0] = addr;
4942 for (i = 1; i < nargs; i++)
4943 argarray[i] = CALL_EXPR_ARG (placement, i);
4944 mark_used (fn);
4945 return build_cxx_call (fn, nargs, argarray);
4947 else
4949 tree ret;
4950 VEC(tree,gc) *args = VEC_alloc (tree, gc, 2);
4951 VEC_quick_push (tree, args, addr);
4952 if (FUNCTION_ARG_CHAIN (fn) != void_list_node)
4953 VEC_quick_push (tree, args, size);
4954 ret = cp_build_function_call_vec (fn, &args, tf_warning_or_error);
4955 VEC_free (tree, gc, args);
4956 return ret;
4960 /* [expr.new]
4962 If no unambiguous matching deallocation function can be found,
4963 propagating the exception does not cause the object's memory to
4964 be freed. */
4965 if (alloc_fn)
4967 if (!placement)
4968 warning (0, "no corresponding deallocation function for %qD",
4969 alloc_fn);
4970 return NULL_TREE;
4973 error ("no suitable %<operator %s%> for %qT",
4974 operator_name_info[(int)code].name, type);
4975 return error_mark_node;
4978 /* If the current scope isn't allowed to access DECL along
4979 BASETYPE_PATH, give an error. The most derived class in
4980 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
4981 the declaration to use in the error diagnostic. */
4983 bool
4984 enforce_access (tree basetype_path, tree decl, tree diag_decl)
4986 gcc_assert (TREE_CODE (basetype_path) == TREE_BINFO);
4988 if (!accessible_p (basetype_path, decl, true))
4990 if (TREE_PRIVATE (decl))
4991 error ("%q+#D is private", diag_decl);
4992 else if (TREE_PROTECTED (decl))
4993 error ("%q+#D is protected", diag_decl);
4994 else
4995 error ("%q+#D is inaccessible", diag_decl);
4996 error ("within this context");
4997 return false;
5000 return true;
5003 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
5004 bitwise or of LOOKUP_* values. If any errors are warnings are
5005 generated, set *DIAGNOSTIC_FN to "error" or "warning",
5006 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
5007 to NULL. */
5009 static tree
5010 build_temp (tree expr, tree type, int flags,
5011 diagnostic_t *diagnostic_kind, tsubst_flags_t complain)
5013 int savew, savee;
5014 VEC(tree,gc) *args;
5016 savew = warningcount, savee = errorcount;
5017 args = make_tree_vector_single (expr);
5018 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
5019 &args, type, flags, complain);
5020 release_tree_vector (args);
5021 if (warningcount > savew)
5022 *diagnostic_kind = DK_WARNING;
5023 else if (errorcount > savee)
5024 *diagnostic_kind = DK_ERROR;
5025 else
5026 *diagnostic_kind = DK_UNSPECIFIED;
5027 return expr;
5030 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
5031 EXPR is implicitly converted to type TOTYPE.
5032 FN and ARGNUM are used for diagnostics. */
5034 static void
5035 conversion_null_warnings (tree totype, tree expr, tree fn, int argnum)
5037 tree t = non_reference (totype);
5039 /* Issue warnings about peculiar, but valid, uses of NULL. */
5040 if (expr == null_node && TREE_CODE (t) != BOOLEAN_TYPE && ARITHMETIC_TYPE_P (t))
5042 if (fn)
5043 warning_at (input_location, OPT_Wconversion_null,
5044 "passing NULL to non-pointer argument %P of %qD",
5045 argnum, fn);
5046 else
5047 warning_at (input_location, OPT_Wconversion_null,
5048 "converting to non-pointer type %qT from NULL", t);
5051 /* Issue warnings if "false" is converted to a NULL pointer */
5052 else if (expr == boolean_false_node && fn && POINTER_TYPE_P (t))
5053 warning_at (input_location, OPT_Wconversion_null,
5054 "converting %<false%> to pointer type for argument %P of %qD",
5055 argnum, fn);
5058 /* Perform the conversions in CONVS on the expression EXPR. FN and
5059 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
5060 indicates the `this' argument of a method. INNER is nonzero when
5061 being called to continue a conversion chain. It is negative when a
5062 reference binding will be applied, positive otherwise. If
5063 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
5064 conversions will be emitted if appropriate. If C_CAST_P is true,
5065 this conversion is coming from a C-style cast; in that case,
5066 conversions to inaccessible bases are permitted. */
5068 static tree
5069 convert_like_real (conversion *convs, tree expr, tree fn, int argnum,
5070 int inner, bool issue_conversion_warnings,
5071 bool c_cast_p, tsubst_flags_t complain)
5073 tree totype = convs->type;
5074 diagnostic_t diag_kind;
5075 int flags;
5077 if (convs->bad_p
5078 && convs->kind != ck_user
5079 && convs->kind != ck_list
5080 && convs->kind != ck_ambig
5081 && convs->kind != ck_ref_bind
5082 && convs->kind != ck_rvalue
5083 && convs->kind != ck_base)
5085 conversion *t = convs;
5087 /* Give a helpful error if this is bad because of excess braces. */
5088 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
5089 && SCALAR_TYPE_P (totype)
5090 && CONSTRUCTOR_NELTS (expr) > 0
5091 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr, 0)->value))
5092 permerror (input_location, "too many braces around initializer for %qT", totype);
5094 for (; t; t = convs->u.next)
5096 if (t->kind == ck_user || !t->bad_p)
5098 expr = convert_like_real (t, expr, fn, argnum, 1,
5099 /*issue_conversion_warnings=*/false,
5100 /*c_cast_p=*/false,
5101 complain);
5102 break;
5104 else if (t->kind == ck_ambig)
5105 return convert_like_real (t, expr, fn, argnum, 1,
5106 /*issue_conversion_warnings=*/false,
5107 /*c_cast_p=*/false,
5108 complain);
5109 else if (t->kind == ck_identity)
5110 break;
5112 if (complain & tf_error)
5114 permerror (input_location, "invalid conversion from %qT to %qT", TREE_TYPE (expr), totype);
5115 if (fn)
5116 permerror (DECL_SOURCE_LOCATION (fn),
5117 " initializing argument %P of %qD", argnum, fn);
5119 else
5120 return error_mark_node;
5122 return cp_convert (totype, expr);
5125 if (issue_conversion_warnings && (complain & tf_warning))
5126 conversion_null_warnings (totype, expr, fn, argnum);
5128 switch (convs->kind)
5130 case ck_user:
5132 struct z_candidate *cand = convs->cand;
5133 tree convfn = cand->fn;
5134 unsigned i;
5136 expr = mark_rvalue_use (expr);
5138 /* When converting from an init list we consider explicit
5139 constructors, but actually trying to call one is an error. */
5140 if (DECL_NONCONVERTING_P (convfn) && DECL_CONSTRUCTOR_P (convfn)
5141 /* Unless we're calling it for value-initialization from an
5142 empty list, since that is handled separately in 8.5.4. */
5143 && cand->num_convs > 0)
5145 if (complain & tf_error)
5146 error ("converting to %qT from initializer list would use "
5147 "explicit constructor %qD", totype, convfn);
5148 else
5149 return error_mark_node;
5152 /* Set user_conv_p on the argument conversions, so rvalue/base
5153 handling knows not to allow any more UDCs. */
5154 for (i = 0; i < cand->num_convs; ++i)
5155 cand->convs[i]->user_conv_p = true;
5157 expr = build_over_call (cand, LOOKUP_NORMAL, complain);
5159 /* If this is a constructor or a function returning an aggr type,
5160 we need to build up a TARGET_EXPR. */
5161 if (DECL_CONSTRUCTOR_P (convfn))
5163 expr = build_cplus_new (totype, expr);
5165 /* Remember that this was list-initialization. */
5166 if (convs->check_narrowing)
5167 TARGET_EXPR_LIST_INIT_P (expr) = true;
5170 return expr;
5172 case ck_identity:
5173 expr = mark_rvalue_use (expr);
5174 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
5176 int nelts = CONSTRUCTOR_NELTS (expr);
5177 if (nelts == 0)
5178 expr = build_value_init (totype, tf_warning_or_error);
5179 else if (nelts == 1)
5180 expr = CONSTRUCTOR_ELT (expr, 0)->value;
5181 else
5182 gcc_unreachable ();
5185 if (type_unknown_p (expr))
5186 expr = instantiate_type (totype, expr, complain);
5187 /* Convert a constant to its underlying value, unless we are
5188 about to bind it to a reference, in which case we need to
5189 leave it as an lvalue. */
5190 if (inner >= 0)
5192 expr = decl_constant_value (expr);
5193 if (expr == null_node && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype))
5194 /* If __null has been converted to an integer type, we do not
5195 want to warn about uses of EXPR as an integer, rather than
5196 as a pointer. */
5197 expr = build_int_cst (totype, 0);
5199 return expr;
5200 case ck_ambig:
5201 if (complain & tf_error)
5203 /* Call build_user_type_conversion again for the error. */
5204 build_user_type_conversion (totype, convs->u.expr, LOOKUP_NORMAL);
5205 if (fn)
5206 error (" initializing argument %P of %q+D", argnum, fn);
5208 return error_mark_node;
5210 case ck_list:
5212 /* Conversion to std::initializer_list<T>. */
5213 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype), 0);
5214 tree new_ctor = build_constructor (init_list_type_node, NULL);
5215 unsigned len = CONSTRUCTOR_NELTS (expr);
5216 tree array, val;
5217 VEC(tree,gc) *parms;
5218 unsigned ix;
5220 /* Convert all the elements. */
5221 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr), ix, val)
5223 tree sub = convert_like_real (convs->u.list[ix], val, fn, argnum,
5224 1, false, false, complain);
5225 if (sub == error_mark_node)
5226 return sub;
5227 if (!BRACE_ENCLOSED_INITIALIZER_P (val))
5228 check_narrowing (TREE_TYPE (sub), val);
5229 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor), NULL_TREE, sub);
5231 /* Build up the array. */
5232 elttype = cp_build_qualified_type
5233 (elttype, cp_type_quals (elttype) | TYPE_QUAL_CONST);
5234 array = build_array_of_n_type (elttype, len);
5235 array = finish_compound_literal (array, new_ctor);
5237 parms = make_tree_vector ();
5238 VEC_safe_push (tree, gc, parms, decay_conversion (array));
5239 VEC_safe_push (tree, gc, parms, size_int (len));
5240 /* Call the private constructor. */
5241 push_deferring_access_checks (dk_no_check);
5242 new_ctor = build_special_member_call
5243 (NULL_TREE, complete_ctor_identifier, &parms, totype, 0, complain);
5244 release_tree_vector (parms);
5245 pop_deferring_access_checks ();
5246 return build_cplus_new (totype, new_ctor);
5249 case ck_aggr:
5250 return get_target_expr (digest_init (totype, expr));
5252 default:
5253 break;
5256 expr = convert_like_real (convs->u.next, expr, fn, argnum,
5257 convs->kind == ck_ref_bind ? -1 : 1,
5258 convs->kind == ck_ref_bind ? issue_conversion_warnings : false,
5259 c_cast_p,
5260 complain);
5261 if (expr == error_mark_node)
5262 return error_mark_node;
5264 switch (convs->kind)
5266 case ck_rvalue:
5267 expr = decay_conversion (expr);
5268 if (! MAYBE_CLASS_TYPE_P (totype))
5269 return expr;
5270 /* Else fall through. */
5271 case ck_base:
5272 if (convs->kind == ck_base && !convs->need_temporary_p)
5274 /* We are going to bind a reference directly to a base-class
5275 subobject of EXPR. */
5276 /* Build an expression for `*((base*) &expr)'. */
5277 expr = cp_build_addr_expr (expr, complain);
5278 expr = convert_to_base (expr, build_pointer_type (totype),
5279 !c_cast_p, /*nonnull=*/true, complain);
5280 expr = cp_build_indirect_ref (expr, RO_IMPLICIT_CONVERSION, complain);
5281 return expr;
5284 /* Copy-initialization where the cv-unqualified version of the source
5285 type is the same class as, or a derived class of, the class of the
5286 destination [is treated as direct-initialization]. [dcl.init] */
5287 flags = LOOKUP_NORMAL|LOOKUP_ONLYCONVERTING;
5288 if (convs->user_conv_p)
5289 /* This conversion is being done in the context of a user-defined
5290 conversion (i.e. the second step of copy-initialization), so
5291 don't allow any more. */
5292 flags |= LOOKUP_NO_CONVERSION;
5293 expr = build_temp (expr, totype, flags, &diag_kind, complain);
5294 if (diag_kind && fn)
5296 if ((complain & tf_error))
5297 emit_diagnostic (diag_kind, DECL_SOURCE_LOCATION (fn), 0,
5298 " initializing argument %P of %qD", argnum, fn);
5299 else if (diag_kind == DK_ERROR)
5300 return error_mark_node;
5302 return build_cplus_new (totype, expr);
5304 case ck_ref_bind:
5306 tree ref_type = totype;
5308 if (convs->bad_p && TYPE_REF_IS_RVALUE (ref_type)
5309 && real_lvalue_p (expr))
5311 if (complain & tf_error)
5313 error ("cannot bind %qT lvalue to %qT",
5314 TREE_TYPE (expr), totype);
5315 if (fn)
5316 error (" initializing argument %P of %q+D", argnum, fn);
5318 return error_mark_node;
5321 /* If necessary, create a temporary.
5323 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
5324 that need temporaries, even when their types are reference
5325 compatible with the type of reference being bound, so the
5326 upcoming call to cp_build_addr_expr doesn't fail. */
5327 if (convs->need_temporary_p
5328 || TREE_CODE (expr) == CONSTRUCTOR
5329 || TREE_CODE (expr) == VA_ARG_EXPR)
5331 /* Otherwise, a temporary of type "cv1 T1" is created and
5332 initialized from the initializer expression using the rules
5333 for a non-reference copy-initialization (8.5). */
5335 tree type = TREE_TYPE (ref_type);
5336 cp_lvalue_kind lvalue = real_lvalue_p (expr);
5338 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5339 (type, convs->u.next->type));
5340 if (!CP_TYPE_CONST_NON_VOLATILE_P (type)
5341 && !TYPE_REF_IS_RVALUE (ref_type))
5343 if (complain & tf_error)
5345 /* If the reference is volatile or non-const, we
5346 cannot create a temporary. */
5347 if (lvalue & clk_bitfield)
5348 error ("cannot bind bitfield %qE to %qT",
5349 expr, ref_type);
5350 else if (lvalue & clk_packed)
5351 error ("cannot bind packed field %qE to %qT",
5352 expr, ref_type);
5353 else
5354 error ("cannot bind rvalue %qE to %qT", expr, ref_type);
5356 return error_mark_node;
5358 /* If the source is a packed field, and we must use a copy
5359 constructor, then building the target expr will require
5360 binding the field to the reference parameter to the
5361 copy constructor, and we'll end up with an infinite
5362 loop. If we can use a bitwise copy, then we'll be
5363 OK. */
5364 if ((lvalue & clk_packed)
5365 && CLASS_TYPE_P (type)
5366 && type_has_nontrivial_copy_init (type))
5368 if (complain & tf_error)
5369 error ("cannot bind packed field %qE to %qT",
5370 expr, ref_type);
5371 return error_mark_node;
5373 if (lvalue & clk_bitfield)
5375 expr = convert_bitfield_to_declared_type (expr);
5376 expr = fold_convert (type, expr);
5378 expr = build_target_expr_with_type (expr, type);
5381 /* Take the address of the thing to which we will bind the
5382 reference. */
5383 expr = cp_build_addr_expr (expr, complain);
5384 if (expr == error_mark_node)
5385 return error_mark_node;
5387 /* Convert it to a pointer to the type referred to by the
5388 reference. This will adjust the pointer if a derived to
5389 base conversion is being performed. */
5390 expr = cp_convert (build_pointer_type (TREE_TYPE (ref_type)),
5391 expr);
5392 /* Convert the pointer to the desired reference type. */
5393 return build_nop (ref_type, expr);
5396 case ck_lvalue:
5397 return decay_conversion (expr);
5399 case ck_qual:
5400 /* Warn about deprecated conversion if appropriate. */
5401 string_conv_p (totype, expr, 1);
5402 break;
5404 case ck_ptr:
5405 if (convs->base_p)
5406 expr = convert_to_base (expr, totype, !c_cast_p,
5407 /*nonnull=*/false, complain);
5408 return build_nop (totype, expr);
5410 case ck_pmem:
5411 return convert_ptrmem (totype, expr, /*allow_inverse_p=*/false,
5412 c_cast_p, complain);
5414 default:
5415 break;
5418 if (convs->check_narrowing)
5419 check_narrowing (totype, expr);
5421 if (issue_conversion_warnings && (complain & tf_warning))
5422 expr = convert_and_check (totype, expr);
5423 else
5424 expr = convert (totype, expr);
5426 return expr;
5429 /* ARG is being passed to a varargs function. Perform any conversions
5430 required. Return the converted value. */
5432 tree
5433 convert_arg_to_ellipsis (tree arg)
5435 tree arg_type;
5437 /* [expr.call]
5439 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
5440 standard conversions are performed. */
5441 arg = decay_conversion (arg);
5442 arg_type = TREE_TYPE (arg);
5443 /* [expr.call]
5445 If the argument has integral or enumeration type that is subject
5446 to the integral promotions (_conv.prom_), or a floating point
5447 type that is subject to the floating point promotion
5448 (_conv.fpprom_), the value of the argument is converted to the
5449 promoted type before the call. */
5450 if (TREE_CODE (arg_type) == REAL_TYPE
5451 && (TYPE_PRECISION (arg_type)
5452 < TYPE_PRECISION (double_type_node))
5453 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type)))
5455 if (warn_double_promotion && !c_inhibit_evaluation_warnings)
5456 warning (OPT_Wdouble_promotion,
5457 "implicit conversion from %qT to %qT when passing "
5458 "argument to function",
5459 arg_type, double_type_node);
5460 arg = convert_to_real (double_type_node, arg);
5462 else if (NULLPTR_TYPE_P (arg_type))
5463 arg = null_pointer_node;
5464 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type))
5465 arg = perform_integral_promotions (arg);
5467 arg = require_complete_type (arg);
5468 arg_type = TREE_TYPE (arg);
5470 if (arg != error_mark_node
5471 && (type_has_nontrivial_copy_init (arg_type)
5472 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type)))
5474 /* [expr.call] 5.2.2/7:
5475 Passing a potentially-evaluated argument of class type (Clause 9)
5476 with a non-trivial copy constructor or a non-trivial destructor
5477 with no corresponding parameter is conditionally-supported, with
5478 implementation-defined semantics.
5480 We used to just warn here and do a bitwise copy, but now
5481 cp_expr_size will abort if we try to do that.
5483 If the call appears in the context of a sizeof expression,
5484 it is not potentially-evaluated. */
5485 if (cp_unevaluated_operand == 0)
5486 error ("cannot pass objects of non-trivially-copyable "
5487 "type %q#T through %<...%>", arg_type);
5490 return arg;
5493 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
5495 tree
5496 build_x_va_arg (tree expr, tree type)
5498 if (processing_template_decl)
5499 return build_min (VA_ARG_EXPR, type, expr);
5501 type = complete_type_or_else (type, NULL_TREE);
5503 if (expr == error_mark_node || !type)
5504 return error_mark_node;
5506 expr = mark_lvalue_use (expr);
5508 if (type_has_nontrivial_copy_init (type)
5509 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
5510 || TREE_CODE (type) == REFERENCE_TYPE)
5512 /* Remove reference types so we don't ICE later on. */
5513 tree type1 = non_reference (type);
5514 /* conditionally-supported behavior [expr.call] 5.2.2/7. */
5515 error ("cannot receive objects of non-trivially-copyable type %q#T "
5516 "through %<...%>; ", type);
5517 expr = convert (build_pointer_type (type1), null_node);
5518 expr = cp_build_indirect_ref (expr, RO_NULL, tf_warning_or_error);
5519 return expr;
5522 return build_va_arg (input_location, expr, type);
5525 /* TYPE has been given to va_arg. Apply the default conversions which
5526 would have happened when passed via ellipsis. Return the promoted
5527 type, or the passed type if there is no change. */
5529 tree
5530 cxx_type_promotes_to (tree type)
5532 tree promote;
5534 /* Perform the array-to-pointer and function-to-pointer
5535 conversions. */
5536 type = type_decays_to (type);
5538 promote = type_promotes_to (type);
5539 if (same_type_p (type, promote))
5540 promote = type;
5542 return promote;
5545 /* ARG is a default argument expression being passed to a parameter of
5546 the indicated TYPE, which is a parameter to FN. Do any required
5547 conversions. Return the converted value. */
5549 static GTY(()) VEC(tree,gc) *default_arg_context;
5551 tree
5552 convert_default_arg (tree type, tree arg, tree fn, int parmnum)
5554 int i;
5555 tree t;
5557 /* If the ARG is an unparsed default argument expression, the
5558 conversion cannot be performed. */
5559 if (TREE_CODE (arg) == DEFAULT_ARG)
5561 error ("the default argument for parameter %d of %qD has "
5562 "not yet been parsed",
5563 parmnum, fn);
5564 return error_mark_node;
5567 /* Detect recursion. */
5568 FOR_EACH_VEC_ELT (tree, default_arg_context, i, t)
5569 if (t == fn)
5571 error ("recursive evaluation of default argument for %q#D", fn);
5572 return error_mark_node;
5574 VEC_safe_push (tree, gc, default_arg_context, fn);
5576 if (fn && DECL_TEMPLATE_INFO (fn))
5577 arg = tsubst_default_argument (fn, type, arg);
5579 /* Due to:
5581 [dcl.fct.default]
5583 The names in the expression are bound, and the semantic
5584 constraints are checked, at the point where the default
5585 expressions appears.
5587 we must not perform access checks here. */
5588 push_deferring_access_checks (dk_no_check);
5589 arg = break_out_target_exprs (arg);
5590 if (TREE_CODE (arg) == CONSTRUCTOR)
5592 arg = digest_init (type, arg);
5593 arg = convert_for_initialization (0, type, arg, LOOKUP_NORMAL,
5594 ICR_DEFAULT_ARGUMENT, fn, parmnum,
5595 tf_warning_or_error);
5597 else
5599 /* We must make a copy of ARG, in case subsequent processing
5600 alters any part of it. For example, during gimplification a
5601 cast of the form (T) &X::f (where "f" is a member function)
5602 will lead to replacing the PTRMEM_CST for &X::f with a
5603 VAR_DECL. We can avoid the copy for constants, since they
5604 are never modified in place. */
5605 if (!CONSTANT_CLASS_P (arg))
5606 arg = unshare_expr (arg);
5607 arg = convert_for_initialization (0, type, arg, LOOKUP_NORMAL,
5608 ICR_DEFAULT_ARGUMENT, fn, parmnum,
5609 tf_warning_or_error);
5610 arg = convert_for_arg_passing (type, arg);
5612 pop_deferring_access_checks();
5614 VEC_pop (tree, default_arg_context);
5616 return arg;
5619 /* Returns the type which will really be used for passing an argument of
5620 type TYPE. */
5622 tree
5623 type_passed_as (tree type)
5625 /* Pass classes with copy ctors by invisible reference. */
5626 if (TREE_ADDRESSABLE (type))
5628 type = build_reference_type (type);
5629 /* There are no other pointers to this temporary. */
5630 type = cp_build_qualified_type (type, TYPE_QUAL_RESTRICT);
5632 else if (targetm.calls.promote_prototypes (type)
5633 && INTEGRAL_TYPE_P (type)
5634 && COMPLETE_TYPE_P (type)
5635 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type),
5636 TYPE_SIZE (integer_type_node)))
5637 type = integer_type_node;
5639 return type;
5642 /* Actually perform the appropriate conversion. */
5644 tree
5645 convert_for_arg_passing (tree type, tree val)
5647 tree bitfield_type;
5649 /* If VAL is a bitfield, then -- since it has already been converted
5650 to TYPE -- it cannot have a precision greater than TYPE.
5652 If it has a smaller precision, we must widen it here. For
5653 example, passing "int f:3;" to a function expecting an "int" will
5654 not result in any conversion before this point.
5656 If the precision is the same we must not risk widening. For
5657 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
5658 often have type "int", even though the C++ type for the field is
5659 "long long". If the value is being passed to a function
5660 expecting an "int", then no conversions will be required. But,
5661 if we call convert_bitfield_to_declared_type, the bitfield will
5662 be converted to "long long". */
5663 bitfield_type = is_bitfield_expr_with_lowered_type (val);
5664 if (bitfield_type
5665 && TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type))
5666 val = convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type), val);
5668 if (val == error_mark_node)
5670 /* Pass classes with copy ctors by invisible reference. */
5671 else if (TREE_ADDRESSABLE (type))
5672 val = build1 (ADDR_EXPR, build_reference_type (type), val);
5673 else if (targetm.calls.promote_prototypes (type)
5674 && INTEGRAL_TYPE_P (type)
5675 && COMPLETE_TYPE_P (type)
5676 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type),
5677 TYPE_SIZE (integer_type_node)))
5678 val = perform_integral_promotions (val);
5679 if (warn_missing_format_attribute)
5681 tree rhstype = TREE_TYPE (val);
5682 const enum tree_code coder = TREE_CODE (rhstype);
5683 const enum tree_code codel = TREE_CODE (type);
5684 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
5685 && coder == codel
5686 && check_missing_format_attribute (type, rhstype))
5687 warning (OPT_Wmissing_format_attribute,
5688 "argument of function call might be a candidate for a format attribute");
5690 return val;
5693 /* Returns true iff FN is a function with magic varargs, i.e. ones for
5694 which no conversions at all should be done. This is true for some
5695 builtins which don't act like normal functions. */
5697 static bool
5698 magic_varargs_p (tree fn)
5700 if (DECL_BUILT_IN (fn))
5701 switch (DECL_FUNCTION_CODE (fn))
5703 case BUILT_IN_CLASSIFY_TYPE:
5704 case BUILT_IN_CONSTANT_P:
5705 case BUILT_IN_NEXT_ARG:
5706 case BUILT_IN_VA_START:
5707 return true;
5709 default:;
5710 return lookup_attribute ("type generic",
5711 TYPE_ATTRIBUTES (TREE_TYPE (fn))) != 0;
5714 return false;
5717 /* Subroutine of the various build_*_call functions. Overload resolution
5718 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
5719 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
5720 bitmask of various LOOKUP_* flags which apply to the call itself. */
5722 static tree
5723 build_over_call (struct z_candidate *cand, int flags, tsubst_flags_t complain)
5725 tree fn = cand->fn;
5726 const VEC(tree,gc) *args = cand->args;
5727 tree first_arg = cand->first_arg;
5728 conversion **convs = cand->convs;
5729 conversion *conv;
5730 tree parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
5731 int parmlen;
5732 tree val;
5733 int i = 0;
5734 int j = 0;
5735 unsigned int arg_index = 0;
5736 int is_method = 0;
5737 int nargs;
5738 tree *argarray;
5739 bool already_used = false;
5741 /* In a template, there is no need to perform all of the work that
5742 is normally done. We are only interested in the type of the call
5743 expression, i.e., the return type of the function. Any semantic
5744 errors will be deferred until the template is instantiated. */
5745 if (processing_template_decl)
5747 tree expr;
5748 tree return_type;
5749 const tree *argarray;
5750 unsigned int nargs;
5752 return_type = TREE_TYPE (TREE_TYPE (fn));
5753 nargs = VEC_length (tree, args);
5754 if (first_arg == NULL_TREE)
5755 argarray = VEC_address (tree, CONST_CAST (VEC(tree,gc) *, args));
5756 else
5758 tree *alcarray;
5759 unsigned int ix;
5760 tree arg;
5762 ++nargs;
5763 alcarray = XALLOCAVEC (tree, nargs);
5764 alcarray[0] = first_arg;
5765 FOR_EACH_VEC_ELT (tree, args, ix, arg)
5766 alcarray[ix + 1] = arg;
5767 argarray = alcarray;
5769 expr = build_call_array_loc (input_location,
5770 return_type, build_addr_func (fn), nargs,
5771 argarray);
5772 if (TREE_THIS_VOLATILE (fn) && cfun)
5773 current_function_returns_abnormally = 1;
5774 if (!VOID_TYPE_P (return_type))
5775 require_complete_type_sfinae (return_type, complain);
5776 return convert_from_reference (expr);
5779 /* Give any warnings we noticed during overload resolution. */
5780 if (cand->warnings && (complain & tf_warning))
5782 struct candidate_warning *w;
5783 for (w = cand->warnings; w; w = w->next)
5784 joust (cand, w->loser, 1);
5787 /* Make =delete work with SFINAE. */
5788 if (DECL_DELETED_FN (fn) && !(complain & tf_error))
5789 return error_mark_node;
5791 if (DECL_FUNCTION_MEMBER_P (fn))
5793 tree access_fn;
5794 /* If FN is a template function, two cases must be considered.
5795 For example:
5797 struct A {
5798 protected:
5799 template <class T> void f();
5801 template <class T> struct B {
5802 protected:
5803 void g();
5805 struct C : A, B<int> {
5806 using A::f; // #1
5807 using B<int>::g; // #2
5810 In case #1 where `A::f' is a member template, DECL_ACCESS is
5811 recorded in the primary template but not in its specialization.
5812 We check access of FN using its primary template.
5814 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
5815 because it is a member of class template B, DECL_ACCESS is
5816 recorded in the specialization `B<int>::g'. We cannot use its
5817 primary template because `B<T>::g' and `B<int>::g' may have
5818 different access. */
5819 if (DECL_TEMPLATE_INFO (fn)
5820 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
5821 access_fn = DECL_TI_TEMPLATE (fn);
5822 else
5823 access_fn = fn;
5824 if (flags & LOOKUP_SPECULATIVE)
5826 if (!speculative_access_check (cand->access_path, access_fn, fn,
5827 !!(flags & LOOKUP_COMPLAIN)))
5828 return error_mark_node;
5830 else
5831 perform_or_defer_access_check (cand->access_path, access_fn, fn);
5834 /* If we're checking for implicit delete, don't bother with argument
5835 conversions. */
5836 if (flags & LOOKUP_SPECULATIVE)
5838 if (DECL_DELETED_FN (fn))
5840 if (flags & LOOKUP_COMPLAIN)
5841 mark_used (fn);
5842 return error_mark_node;
5844 if (cand->viable == 1)
5845 return fn;
5846 else if (!(flags & LOOKUP_COMPLAIN))
5847 /* Reject bad conversions now. */
5848 return error_mark_node;
5849 /* else continue to get conversion error. */
5852 /* Find maximum size of vector to hold converted arguments. */
5853 parmlen = list_length (parm);
5854 nargs = VEC_length (tree, args) + (first_arg != NULL_TREE ? 1 : 0);
5855 if (parmlen > nargs)
5856 nargs = parmlen;
5857 argarray = XALLOCAVEC (tree, nargs);
5859 /* The implicit parameters to a constructor are not considered by overload
5860 resolution, and must be of the proper type. */
5861 if (DECL_CONSTRUCTOR_P (fn))
5863 if (first_arg != NULL_TREE)
5865 argarray[j++] = first_arg;
5866 first_arg = NULL_TREE;
5868 else
5870 argarray[j++] = VEC_index (tree, args, arg_index);
5871 ++arg_index;
5873 parm = TREE_CHAIN (parm);
5874 /* We should never try to call the abstract constructor. */
5875 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn));
5877 if (DECL_HAS_VTT_PARM_P (fn))
5879 argarray[j++] = VEC_index (tree, args, arg_index);
5880 ++arg_index;
5881 parm = TREE_CHAIN (parm);
5884 /* Bypass access control for 'this' parameter. */
5885 else if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
5887 tree parmtype = TREE_VALUE (parm);
5888 tree arg = (first_arg != NULL_TREE
5889 ? first_arg
5890 : VEC_index (tree, args, arg_index));
5891 tree argtype = TREE_TYPE (arg);
5892 tree converted_arg;
5893 tree base_binfo;
5895 if (convs[i]->bad_p)
5897 if (complain & tf_error)
5898 permerror (input_location, "passing %qT as %<this%> argument of %q#D discards qualifiers",
5899 TREE_TYPE (argtype), fn);
5900 else
5901 return error_mark_node;
5904 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
5905 X is called for an object that is not of type X, or of a type
5906 derived from X, the behavior is undefined.
5908 So we can assume that anything passed as 'this' is non-null, and
5909 optimize accordingly. */
5910 gcc_assert (TREE_CODE (parmtype) == POINTER_TYPE);
5911 /* Convert to the base in which the function was declared. */
5912 gcc_assert (cand->conversion_path != NULL_TREE);
5913 converted_arg = build_base_path (PLUS_EXPR,
5914 arg,
5915 cand->conversion_path,
5917 /* Check that the base class is accessible. */
5918 if (!accessible_base_p (TREE_TYPE (argtype),
5919 BINFO_TYPE (cand->conversion_path), true))
5920 error ("%qT is not an accessible base of %qT",
5921 BINFO_TYPE (cand->conversion_path),
5922 TREE_TYPE (argtype));
5923 /* If fn was found by a using declaration, the conversion path
5924 will be to the derived class, not the base declaring fn. We
5925 must convert from derived to base. */
5926 base_binfo = lookup_base (TREE_TYPE (TREE_TYPE (converted_arg)),
5927 TREE_TYPE (parmtype), ba_unique, NULL);
5928 converted_arg = build_base_path (PLUS_EXPR, converted_arg,
5929 base_binfo, 1);
5931 argarray[j++] = converted_arg;
5932 parm = TREE_CHAIN (parm);
5933 if (first_arg != NULL_TREE)
5934 first_arg = NULL_TREE;
5935 else
5936 ++arg_index;
5937 ++i;
5938 is_method = 1;
5941 gcc_assert (first_arg == NULL_TREE);
5942 for (; arg_index < VEC_length (tree, args) && parm;
5943 parm = TREE_CHAIN (parm), ++arg_index, ++i)
5945 tree type = TREE_VALUE (parm);
5946 tree arg = VEC_index (tree, args, arg_index);
5948 conv = convs[i];
5950 /* Don't make a copy here if build_call is going to. */
5951 if (conv->kind == ck_rvalue
5952 && COMPLETE_TYPE_P (complete_type (type))
5953 && !TREE_ADDRESSABLE (type))
5954 conv = conv->u.next;
5956 /* Warn about initializer_list deduction that isn't currently in the
5957 working draft. */
5958 if (cxx_dialect > cxx98
5959 && flag_deduce_init_list
5960 && cand->template_decl
5961 && is_std_init_list (non_reference (type))
5962 && BRACE_ENCLOSED_INITIALIZER_P (arg))
5964 tree tmpl = TI_TEMPLATE (cand->template_decl);
5965 tree realparm = chain_index (j, DECL_ARGUMENTS (cand->fn));
5966 tree patparm = get_pattern_parm (realparm, tmpl);
5967 tree pattype = TREE_TYPE (patparm);
5968 if (PACK_EXPANSION_P (pattype))
5969 pattype = PACK_EXPANSION_PATTERN (pattype);
5970 pattype = non_reference (pattype);
5972 if (TREE_CODE (pattype) == TEMPLATE_TYPE_PARM
5973 && (cand->explicit_targs == NULL_TREE
5974 || (TREE_VEC_LENGTH (cand->explicit_targs)
5975 <= TEMPLATE_TYPE_IDX (pattype))))
5977 pedwarn (input_location, 0, "deducing %qT as %qT",
5978 non_reference (TREE_TYPE (patparm)),
5979 non_reference (type));
5980 pedwarn (input_location, 0, " in call to %q+D", cand->fn);
5981 pedwarn (input_location, 0,
5982 " (you can disable this with -fno-deduce-init-list)");
5986 val = convert_like_with_context (conv, arg, fn, i-is_method, complain);
5988 val = convert_for_arg_passing (type, val);
5989 if (val == error_mark_node)
5990 return error_mark_node;
5991 else
5992 argarray[j++] = val;
5995 /* Default arguments */
5996 for (; parm && parm != void_list_node; parm = TREE_CHAIN (parm), i++)
5997 argarray[j++] = convert_default_arg (TREE_VALUE (parm),
5998 TREE_PURPOSE (parm),
5999 fn, i - is_method);
6000 /* Ellipsis */
6001 for (; arg_index < VEC_length (tree, args); ++arg_index)
6003 tree a = VEC_index (tree, args, arg_index);
6004 if (magic_varargs_p (fn))
6005 /* Do no conversions for magic varargs. */
6006 a = mark_type_use (a);
6007 else
6008 a = convert_arg_to_ellipsis (a);
6009 argarray[j++] = a;
6012 gcc_assert (j <= nargs);
6013 nargs = j;
6015 check_function_arguments (TYPE_ATTRIBUTES (TREE_TYPE (fn)),
6016 nargs, argarray, TYPE_ARG_TYPES (TREE_TYPE (fn)));
6018 /* Avoid actually calling copy constructors and copy assignment operators,
6019 if possible. */
6021 if (! flag_elide_constructors)
6022 /* Do things the hard way. */;
6023 else if (cand->num_convs == 1
6024 && (DECL_COPY_CONSTRUCTOR_P (fn)
6025 || DECL_MOVE_CONSTRUCTOR_P (fn)))
6027 tree targ;
6028 tree arg = argarray[num_artificial_parms_for (fn)];
6029 tree fa;
6030 bool trivial = trivial_fn_p (fn);
6032 /* Pull out the real argument, disregarding const-correctness. */
6033 targ = arg;
6034 while (CONVERT_EXPR_P (targ)
6035 || TREE_CODE (targ) == NON_LVALUE_EXPR)
6036 targ = TREE_OPERAND (targ, 0);
6037 if (TREE_CODE (targ) == ADDR_EXPR)
6039 targ = TREE_OPERAND (targ, 0);
6040 if (!same_type_ignoring_top_level_qualifiers_p
6041 (TREE_TYPE (TREE_TYPE (arg)), TREE_TYPE (targ)))
6042 targ = NULL_TREE;
6044 else
6045 targ = NULL_TREE;
6047 if (targ)
6048 arg = targ;
6049 else
6050 arg = cp_build_indirect_ref (arg, RO_NULL, complain);
6052 if (TREE_CODE (arg) == TARGET_EXPR
6053 && TARGET_EXPR_LIST_INIT_P (arg))
6055 /* Copy-list-initialization doesn't require the constructor
6056 to be defined. */
6058 /* [class.copy]: the copy constructor is implicitly defined even if
6059 the implementation elided its use. */
6060 else if (!trivial)
6062 mark_used (fn);
6063 already_used = true;
6066 /* If we're creating a temp and we already have one, don't create a
6067 new one. If we're not creating a temp but we get one, use
6068 INIT_EXPR to collapse the temp into our target. Otherwise, if the
6069 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
6070 temp or an INIT_EXPR otherwise. */
6071 fa = argarray[0];
6072 if (integer_zerop (fa))
6074 if (TREE_CODE (arg) == TARGET_EXPR)
6075 return arg;
6076 else if (trivial)
6077 return force_target_expr (DECL_CONTEXT (fn), arg);
6079 else if (TREE_CODE (arg) == TARGET_EXPR || trivial)
6081 tree to = stabilize_reference (cp_build_indirect_ref (fa, RO_NULL,
6082 complain));
6084 val = build2 (INIT_EXPR, DECL_CONTEXT (fn), to, arg);
6085 return val;
6088 else if (DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR
6089 && trivial_fn_p (fn))
6091 tree to = stabilize_reference
6092 (cp_build_indirect_ref (argarray[0], RO_NULL, complain));
6093 tree type = TREE_TYPE (to);
6094 tree as_base = CLASSTYPE_AS_BASE (type);
6095 tree arg = argarray[1];
6097 if (is_really_empty_class (type))
6099 /* Avoid copying empty classes. */
6100 val = build2 (COMPOUND_EXPR, void_type_node, to, arg);
6101 TREE_NO_WARNING (val) = 1;
6102 val = build2 (COMPOUND_EXPR, type, val, to);
6103 TREE_NO_WARNING (val) = 1;
6105 else if (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (as_base)))
6107 arg = cp_build_indirect_ref (arg, RO_NULL, complain);
6108 val = build2 (MODIFY_EXPR, TREE_TYPE (to), to, arg);
6110 else
6112 /* We must only copy the non-tail padding parts.
6113 Use __builtin_memcpy for the bitwise copy.
6114 FIXME fix 22488 so we can go back to using MODIFY_EXPR
6115 instead of an explicit call to memcpy. */
6117 tree arg0, arg1, arg2, t;
6118 tree test = NULL_TREE;
6120 arg2 = TYPE_SIZE_UNIT (as_base);
6121 arg1 = arg;
6122 arg0 = cp_build_addr_expr (to, complain);
6124 if (!can_trust_pointer_alignment ())
6126 /* If we can't be sure about pointer alignment, a call
6127 to __builtin_memcpy is expanded as a call to memcpy, which
6128 is invalid with identical args. Otherwise it is
6129 expanded as a block move, which should be safe. */
6130 arg0 = save_expr (arg0);
6131 arg1 = save_expr (arg1);
6132 test = build2 (EQ_EXPR, boolean_type_node, arg0, arg1);
6134 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
6135 t = build_call_n (t, 3, arg0, arg1, arg2);
6137 t = convert (TREE_TYPE (arg0), t);
6138 if (test)
6139 t = build3 (COND_EXPR, TREE_TYPE (t), test, arg0, t);
6140 val = cp_build_indirect_ref (t, RO_NULL, complain);
6141 TREE_NO_WARNING (val) = 1;
6144 return val;
6146 /* FIXME handle trivial default constructor and destructor, too. */
6148 if (!already_used)
6149 mark_used (fn);
6151 if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0)
6153 tree t;
6154 tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (argarray[0])),
6155 DECL_CONTEXT (fn),
6156 ba_any, NULL);
6157 gcc_assert (binfo && binfo != error_mark_node);
6159 /* Warn about deprecated virtual functions now, since we're about
6160 to throw away the decl. */
6161 if (TREE_DEPRECATED (fn))
6162 warn_deprecated_use (fn, NULL_TREE);
6164 argarray[0] = build_base_path (PLUS_EXPR, argarray[0], binfo, 1);
6165 if (TREE_SIDE_EFFECTS (argarray[0]))
6166 argarray[0] = save_expr (argarray[0]);
6167 t = build_pointer_type (TREE_TYPE (fn));
6168 if (DECL_CONTEXT (fn) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn)))
6169 fn = build_java_interface_fn_ref (fn, argarray[0]);
6170 else
6171 fn = build_vfn_ref (argarray[0], DECL_VINDEX (fn));
6172 TREE_TYPE (fn) = t;
6174 else
6175 fn = build_addr_func (fn);
6177 return build_cxx_call (fn, nargs, argarray);
6180 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
6181 This function performs no overload resolution, conversion, or other
6182 high-level operations. */
6184 tree
6185 build_cxx_call (tree fn, int nargs, tree *argarray)
6187 tree fndecl;
6189 fn = build_call_a (fn, nargs, argarray);
6191 /* If this call might throw an exception, note that fact. */
6192 fndecl = get_callee_fndecl (fn);
6193 if ((!fndecl || !TREE_NOTHROW (fndecl))
6194 && at_function_scope_p ()
6195 && cfun
6196 && cp_function_chain)
6197 cp_function_chain->can_throw = 1;
6199 /* Check that arguments to builtin functions match the expectations. */
6200 if (fndecl
6201 && DECL_BUILT_IN (fndecl)
6202 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
6203 && !check_builtin_function_arguments (fndecl, nargs, argarray))
6204 return error_mark_node;
6206 /* Some built-in function calls will be evaluated at compile-time in
6207 fold (). */
6208 fn = fold_if_not_in_template (fn);
6210 if (VOID_TYPE_P (TREE_TYPE (fn)))
6211 return fn;
6213 fn = require_complete_type (fn);
6214 if (fn == error_mark_node)
6215 return error_mark_node;
6217 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn)))
6218 fn = build_cplus_new (TREE_TYPE (fn), fn);
6219 return convert_from_reference (fn);
6222 static GTY(()) tree java_iface_lookup_fn;
6224 /* Make an expression which yields the address of the Java interface
6225 method FN. This is achieved by generating a call to libjava's
6226 _Jv_LookupInterfaceMethodIdx(). */
6228 static tree
6229 build_java_interface_fn_ref (tree fn, tree instance)
6231 tree lookup_fn, method, idx;
6232 tree klass_ref, iface, iface_ref;
6233 int i;
6235 if (!java_iface_lookup_fn)
6237 tree ftype = build_function_type_list (ptr_type_node,
6238 ptr_type_node, ptr_type_node,
6239 java_int_type_node, NULL_TREE);
6240 java_iface_lookup_fn
6241 = add_builtin_function ("_Jv_LookupInterfaceMethodIdx", ftype,
6242 0, NOT_BUILT_IN, NULL, NULL_TREE);
6245 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
6246 This is the first entry in the vtable. */
6247 klass_ref = build_vtbl_ref (cp_build_indirect_ref (instance, RO_NULL,
6248 tf_warning_or_error),
6249 integer_zero_node);
6251 /* Get the java.lang.Class pointer for the interface being called. */
6252 iface = DECL_CONTEXT (fn);
6253 iface_ref = lookup_field (iface, get_identifier ("class$"), 0, false);
6254 if (!iface_ref || TREE_CODE (iface_ref) != VAR_DECL
6255 || DECL_CONTEXT (iface_ref) != iface)
6257 error ("could not find class$ field in java interface type %qT",
6258 iface);
6259 return error_mark_node;
6261 iface_ref = build_address (iface_ref);
6262 iface_ref = convert (build_pointer_type (iface), iface_ref);
6264 /* Determine the itable index of FN. */
6265 i = 1;
6266 for (method = TYPE_METHODS (iface); method; method = DECL_CHAIN (method))
6268 if (!DECL_VIRTUAL_P (method))
6269 continue;
6270 if (fn == method)
6271 break;
6272 i++;
6274 idx = build_int_cst (NULL_TREE, i);
6276 lookup_fn = build1 (ADDR_EXPR,
6277 build_pointer_type (TREE_TYPE (java_iface_lookup_fn)),
6278 java_iface_lookup_fn);
6279 return build_call_nary (ptr_type_node, lookup_fn,
6280 3, klass_ref, iface_ref, idx);
6283 /* Returns the value to use for the in-charge parameter when making a
6284 call to a function with the indicated NAME.
6286 FIXME:Can't we find a neater way to do this mapping? */
6288 tree
6289 in_charge_arg_for_name (tree name)
6291 if (name == base_ctor_identifier
6292 || name == base_dtor_identifier)
6293 return integer_zero_node;
6294 else if (name == complete_ctor_identifier)
6295 return integer_one_node;
6296 else if (name == complete_dtor_identifier)
6297 return integer_two_node;
6298 else if (name == deleting_dtor_identifier)
6299 return integer_three_node;
6301 /* This function should only be called with one of the names listed
6302 above. */
6303 gcc_unreachable ();
6304 return NULL_TREE;
6307 /* Build a call to a constructor, destructor, or an assignment
6308 operator for INSTANCE, an expression with class type. NAME
6309 indicates the special member function to call; *ARGS are the
6310 arguments. ARGS may be NULL. This may change ARGS. BINFO
6311 indicates the base of INSTANCE that is to be passed as the `this'
6312 parameter to the member function called.
6314 FLAGS are the LOOKUP_* flags to use when processing the call.
6316 If NAME indicates a complete object constructor, INSTANCE may be
6317 NULL_TREE. In this case, the caller will call build_cplus_new to
6318 store the newly constructed object into a VAR_DECL. */
6320 tree
6321 build_special_member_call (tree instance, tree name, VEC(tree,gc) **args,
6322 tree binfo, int flags, tsubst_flags_t complain)
6324 tree fns;
6325 /* The type of the subobject to be constructed or destroyed. */
6326 tree class_type;
6327 VEC(tree,gc) *allocated = NULL;
6328 tree ret;
6330 gcc_assert (name == complete_ctor_identifier
6331 || name == base_ctor_identifier
6332 || name == complete_dtor_identifier
6333 || name == base_dtor_identifier
6334 || name == deleting_dtor_identifier
6335 || name == ansi_assopname (NOP_EXPR));
6336 if (TYPE_P (binfo))
6338 /* Resolve the name. */
6339 if (!complete_type_or_maybe_complain (binfo, NULL_TREE, complain))
6340 return error_mark_node;
6342 binfo = TYPE_BINFO (binfo);
6345 gcc_assert (binfo != NULL_TREE);
6347 class_type = BINFO_TYPE (binfo);
6349 /* Handle the special case where INSTANCE is NULL_TREE. */
6350 if (name == complete_ctor_identifier && !instance)
6352 instance = build_int_cst (build_pointer_type (class_type), 0);
6353 instance = build1 (INDIRECT_REF, class_type, instance);
6355 else
6357 if (name == complete_dtor_identifier
6358 || name == base_dtor_identifier
6359 || name == deleting_dtor_identifier)
6360 gcc_assert (args == NULL || VEC_empty (tree, *args));
6362 /* Convert to the base class, if necessary. */
6363 if (!same_type_ignoring_top_level_qualifiers_p
6364 (TREE_TYPE (instance), BINFO_TYPE (binfo)))
6366 if (name != ansi_assopname (NOP_EXPR))
6367 /* For constructors and destructors, either the base is
6368 non-virtual, or it is virtual but we are doing the
6369 conversion from a constructor or destructor for the
6370 complete object. In either case, we can convert
6371 statically. */
6372 instance = convert_to_base_statically (instance, binfo);
6373 else
6374 /* However, for assignment operators, we must convert
6375 dynamically if the base is virtual. */
6376 instance = build_base_path (PLUS_EXPR, instance,
6377 binfo, /*nonnull=*/1);
6381 gcc_assert (instance != NULL_TREE);
6383 fns = lookup_fnfields (binfo, name, 1);
6385 /* When making a call to a constructor or destructor for a subobject
6386 that uses virtual base classes, pass down a pointer to a VTT for
6387 the subobject. */
6388 if ((name == base_ctor_identifier
6389 || name == base_dtor_identifier)
6390 && CLASSTYPE_VBASECLASSES (class_type))
6392 tree vtt;
6393 tree sub_vtt;
6395 /* If the current function is a complete object constructor
6396 or destructor, then we fetch the VTT directly.
6397 Otherwise, we look it up using the VTT we were given. */
6398 vtt = DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type));
6399 vtt = decay_conversion (vtt);
6400 vtt = build3 (COND_EXPR, TREE_TYPE (vtt),
6401 build2 (EQ_EXPR, boolean_type_node,
6402 current_in_charge_parm, integer_zero_node),
6403 current_vtt_parm,
6404 vtt);
6405 gcc_assert (BINFO_SUBVTT_INDEX (binfo));
6406 sub_vtt = build2 (POINTER_PLUS_EXPR, TREE_TYPE (vtt), vtt,
6407 BINFO_SUBVTT_INDEX (binfo));
6409 if (args == NULL)
6411 allocated = make_tree_vector ();
6412 args = &allocated;
6415 VEC_safe_insert (tree, gc, *args, 0, sub_vtt);
6418 ret = build_new_method_call (instance, fns, args,
6419 TYPE_BINFO (BINFO_TYPE (binfo)),
6420 flags, /*fn=*/NULL,
6421 complain);
6423 if (allocated != NULL)
6424 release_tree_vector (allocated);
6426 return ret;
6429 /* Return the NAME, as a C string. The NAME indicates a function that
6430 is a member of TYPE. *FREE_P is set to true if the caller must
6431 free the memory returned.
6433 Rather than go through all of this, we should simply set the names
6434 of constructors and destructors appropriately, and dispense with
6435 ctor_identifier, dtor_identifier, etc. */
6437 static char *
6438 name_as_c_string (tree name, tree type, bool *free_p)
6440 char *pretty_name;
6442 /* Assume that we will not allocate memory. */
6443 *free_p = false;
6444 /* Constructors and destructors are special. */
6445 if (IDENTIFIER_CTOR_OR_DTOR_P (name))
6447 pretty_name
6448 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type))));
6449 /* For a destructor, add the '~'. */
6450 if (name == complete_dtor_identifier
6451 || name == base_dtor_identifier
6452 || name == deleting_dtor_identifier)
6454 pretty_name = concat ("~", pretty_name, NULL);
6455 /* Remember that we need to free the memory allocated. */
6456 *free_p = true;
6459 else if (IDENTIFIER_TYPENAME_P (name))
6461 pretty_name = concat ("operator ",
6462 type_as_string_translate (TREE_TYPE (name),
6463 TFF_PLAIN_IDENTIFIER),
6464 NULL);
6465 /* Remember that we need to free the memory allocated. */
6466 *free_p = true;
6468 else
6469 pretty_name = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name)));
6471 return pretty_name;
6474 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
6475 be set, upon return, to the function called. ARGS may be NULL.
6476 This may change ARGS. */
6478 tree
6479 build_new_method_call (tree instance, tree fns, VEC(tree,gc) **args,
6480 tree conversion_path, int flags,
6481 tree *fn_p, tsubst_flags_t complain)
6483 struct z_candidate *candidates = 0, *cand;
6484 tree explicit_targs = NULL_TREE;
6485 tree basetype = NULL_TREE;
6486 tree access_binfo;
6487 tree optype;
6488 tree first_mem_arg = NULL_TREE;
6489 tree instance_ptr;
6490 tree name;
6491 bool skip_first_for_error;
6492 VEC(tree,gc) *user_args;
6493 tree call;
6494 tree fn;
6495 int template_only = 0;
6496 bool any_viable_p;
6497 tree orig_instance;
6498 tree orig_fns;
6499 VEC(tree,gc) *orig_args = NULL;
6500 void *p;
6502 gcc_assert (instance != NULL_TREE);
6504 /* We don't know what function we're going to call, yet. */
6505 if (fn_p)
6506 *fn_p = NULL_TREE;
6508 if (error_operand_p (instance)
6509 || !fns || error_operand_p (fns))
6510 return error_mark_node;
6512 if (!BASELINK_P (fns))
6514 if (complain & tf_error)
6515 error ("call to non-function %qD", fns);
6516 return error_mark_node;
6519 orig_instance = instance;
6520 orig_fns = fns;
6522 /* Dismantle the baselink to collect all the information we need. */
6523 if (!conversion_path)
6524 conversion_path = BASELINK_BINFO (fns);
6525 access_binfo = BASELINK_ACCESS_BINFO (fns);
6526 optype = BASELINK_OPTYPE (fns);
6527 fns = BASELINK_FUNCTIONS (fns);
6528 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
6530 explicit_targs = TREE_OPERAND (fns, 1);
6531 fns = TREE_OPERAND (fns, 0);
6532 template_only = 1;
6534 gcc_assert (TREE_CODE (fns) == FUNCTION_DECL
6535 || TREE_CODE (fns) == TEMPLATE_DECL
6536 || TREE_CODE (fns) == OVERLOAD);
6537 fn = get_first_fn (fns);
6538 name = DECL_NAME (fn);
6540 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (instance));
6541 gcc_assert (CLASS_TYPE_P (basetype));
6543 if (processing_template_decl)
6545 orig_args = args == NULL ? NULL : make_tree_vector_copy (*args);
6546 instance = build_non_dependent_expr (instance);
6547 if (args != NULL)
6548 make_args_non_dependent (*args);
6551 user_args = args == NULL ? NULL : *args;
6552 /* Under DR 147 A::A() is an invalid constructor call,
6553 not a functional cast. */
6554 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
6556 if (! (complain & tf_error))
6557 return error_mark_node;
6559 permerror (input_location,
6560 "cannot call constructor %<%T::%D%> directly",
6561 basetype, name);
6562 permerror (input_location, " for a function-style cast, remove the "
6563 "redundant %<::%D%>", name);
6564 call = build_functional_cast (basetype, build_tree_list_vec (user_args),
6565 complain);
6566 return call;
6569 /* Figure out whether to skip the first argument for the error
6570 message we will display to users if an error occurs. We don't
6571 want to display any compiler-generated arguments. The "this"
6572 pointer hasn't been added yet. However, we must remove the VTT
6573 pointer if this is a call to a base-class constructor or
6574 destructor. */
6575 skip_first_for_error = false;
6576 if (IDENTIFIER_CTOR_OR_DTOR_P (name))
6578 /* Callers should explicitly indicate whether they want to construct
6579 the complete object or just the part without virtual bases. */
6580 gcc_assert (name != ctor_identifier);
6581 /* Similarly for destructors. */
6582 gcc_assert (name != dtor_identifier);
6583 /* Remove the VTT pointer, if present. */
6584 if ((name == base_ctor_identifier || name == base_dtor_identifier)
6585 && CLASSTYPE_VBASECLASSES (basetype))
6586 skip_first_for_error = true;
6589 /* Process the argument list. */
6590 if (args != NULL && *args != NULL)
6592 *args = resolve_args (*args);
6593 if (*args == NULL)
6594 return error_mark_node;
6597 instance_ptr = build_this (instance);
6599 /* It's OK to call destructors and constructors on cv-qualified objects.
6600 Therefore, convert the INSTANCE_PTR to the unqualified type, if
6601 necessary. */
6602 if (DECL_DESTRUCTOR_P (fn)
6603 || DECL_CONSTRUCTOR_P (fn))
6605 tree type = build_pointer_type (basetype);
6606 if (!same_type_p (type, TREE_TYPE (instance_ptr)))
6607 instance_ptr = build_nop (type, instance_ptr);
6609 if (DECL_DESTRUCTOR_P (fn))
6610 name = complete_dtor_identifier;
6612 first_mem_arg = instance_ptr;
6614 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6615 p = conversion_obstack_alloc (0);
6617 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
6618 initializer, not T({ }). */
6619 if (DECL_CONSTRUCTOR_P (fn) && args != NULL && !VEC_empty (tree, *args)
6620 && BRACE_ENCLOSED_INITIALIZER_P (VEC_index (tree, *args, 0))
6621 && CONSTRUCTOR_IS_DIRECT_INIT (VEC_index (tree, *args, 0)))
6623 gcc_assert (VEC_length (tree, *args) == 1
6624 && !(flags & LOOKUP_ONLYCONVERTING));
6626 add_list_candidates (fns, first_mem_arg, VEC_index (tree, *args, 0),
6627 basetype, explicit_targs, template_only,
6628 conversion_path, access_binfo, flags, &candidates);
6630 else
6632 add_candidates (fns, first_mem_arg, user_args, optype,
6633 explicit_targs, template_only, conversion_path,
6634 access_binfo, flags, &candidates);
6636 any_viable_p = false;
6637 candidates = splice_viable (candidates, pedantic, &any_viable_p);
6639 if (!any_viable_p)
6641 if (complain & tf_error)
6643 if (!COMPLETE_TYPE_P (basetype))
6644 cxx_incomplete_type_error (instance_ptr, basetype);
6645 else if (optype)
6646 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
6647 basetype, optype, build_tree_list_vec (user_args),
6648 TREE_TYPE (TREE_TYPE (instance_ptr)));
6649 else
6651 char *pretty_name;
6652 bool free_p;
6653 tree arglist;
6655 pretty_name = name_as_c_string (name, basetype, &free_p);
6656 arglist = build_tree_list_vec (user_args);
6657 if (skip_first_for_error)
6658 arglist = TREE_CHAIN (arglist);
6659 error ("no matching function for call to %<%T::%s(%A)%#V%>",
6660 basetype, pretty_name, arglist,
6661 TREE_TYPE (TREE_TYPE (instance_ptr)));
6662 if (free_p)
6663 free (pretty_name);
6665 print_z_candidates (candidates);
6667 call = error_mark_node;
6669 else
6671 cand = tourney (candidates);
6672 if (cand == 0)
6674 char *pretty_name;
6675 bool free_p;
6676 tree arglist;
6678 if (complain & tf_error)
6680 pretty_name = name_as_c_string (name, basetype, &free_p);
6681 arglist = build_tree_list_vec (user_args);
6682 if (skip_first_for_error)
6683 arglist = TREE_CHAIN (arglist);
6684 error ("call of overloaded %<%s(%A)%> is ambiguous", pretty_name,
6685 arglist);
6686 print_z_candidates (candidates);
6687 if (free_p)
6688 free (pretty_name);
6690 call = error_mark_node;
6692 else
6694 fn = cand->fn;
6696 if (!(flags & LOOKUP_NONVIRTUAL)
6697 && DECL_PURE_VIRTUAL_P (fn)
6698 && instance == current_class_ref
6699 && (DECL_CONSTRUCTOR_P (current_function_decl)
6700 || DECL_DESTRUCTOR_P (current_function_decl))
6701 && (complain & tf_warning))
6702 /* This is not an error, it is runtime undefined
6703 behavior. */
6704 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl) ?
6705 "pure virtual %q#D called from constructor"
6706 : "pure virtual %q#D called from destructor"),
6707 fn);
6709 if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE
6710 && is_dummy_object (instance_ptr))
6712 if (complain & tf_error)
6713 error ("cannot call member function %qD without object",
6714 fn);
6715 call = error_mark_node;
6717 else
6719 if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL)
6720 && resolves_to_fixed_type_p (instance, 0))
6721 flags |= LOOKUP_NONVIRTUAL;
6722 /* Now we know what function is being called. */
6723 if (fn_p)
6724 *fn_p = fn;
6725 /* Build the actual CALL_EXPR. */
6726 call = build_over_call (cand, flags, complain);
6727 /* In an expression of the form `a->f()' where `f' turns
6728 out to be a static member function, `a' is
6729 none-the-less evaluated. */
6730 if (TREE_CODE (TREE_TYPE (fn)) != METHOD_TYPE
6731 && !is_dummy_object (instance_ptr)
6732 && TREE_SIDE_EFFECTS (instance_ptr))
6733 call = build2 (COMPOUND_EXPR, TREE_TYPE (call),
6734 instance_ptr, call);
6735 else if (call != error_mark_node
6736 && DECL_DESTRUCTOR_P (cand->fn)
6737 && !VOID_TYPE_P (TREE_TYPE (call)))
6738 /* An explicit call of the form "x->~X()" has type
6739 "void". However, on platforms where destructors
6740 return "this" (i.e., those where
6741 targetm.cxx.cdtor_returns_this is true), such calls
6742 will appear to have a return value of pointer type
6743 to the low-level call machinery. We do not want to
6744 change the low-level machinery, since we want to be
6745 able to optimize "delete f()" on such platforms as
6746 "operator delete(~X(f()))" (rather than generating
6747 "t = f(), ~X(t), operator delete (t)"). */
6748 call = build_nop (void_type_node, call);
6753 if (processing_template_decl && call != error_mark_node)
6755 bool cast_to_void = false;
6757 if (TREE_CODE (call) == COMPOUND_EXPR)
6758 call = TREE_OPERAND (call, 1);
6759 else if (TREE_CODE (call) == NOP_EXPR)
6761 cast_to_void = true;
6762 call = TREE_OPERAND (call, 0);
6764 if (TREE_CODE (call) == INDIRECT_REF)
6765 call = TREE_OPERAND (call, 0);
6766 call = (build_min_non_dep_call_vec
6767 (call,
6768 build_min (COMPONENT_REF, TREE_TYPE (CALL_EXPR_FN (call)),
6769 orig_instance, orig_fns, NULL_TREE),
6770 orig_args));
6771 call = convert_from_reference (call);
6772 if (cast_to_void)
6773 call = build_nop (void_type_node, call);
6776 /* Free all the conversions we allocated. */
6777 obstack_free (&conversion_obstack, p);
6779 if (orig_args != NULL)
6780 release_tree_vector (orig_args);
6782 return call;
6785 /* Returns true iff standard conversion sequence ICS1 is a proper
6786 subsequence of ICS2. */
6788 static bool
6789 is_subseq (conversion *ics1, conversion *ics2)
6791 /* We can assume that a conversion of the same code
6792 between the same types indicates a subsequence since we only get
6793 here if the types we are converting from are the same. */
6795 while (ics1->kind == ck_rvalue
6796 || ics1->kind == ck_lvalue)
6797 ics1 = ics1->u.next;
6799 while (1)
6801 while (ics2->kind == ck_rvalue
6802 || ics2->kind == ck_lvalue)
6803 ics2 = ics2->u.next;
6805 if (ics2->kind == ck_user
6806 || ics2->kind == ck_ambig
6807 || ics2->kind == ck_aggr
6808 || ics2->kind == ck_list
6809 || ics2->kind == ck_identity)
6810 /* At this point, ICS1 cannot be a proper subsequence of
6811 ICS2. We can get a USER_CONV when we are comparing the
6812 second standard conversion sequence of two user conversion
6813 sequences. */
6814 return false;
6816 ics2 = ics2->u.next;
6818 if (ics2->kind == ics1->kind
6819 && same_type_p (ics2->type, ics1->type)
6820 && same_type_p (ics2->u.next->type,
6821 ics1->u.next->type))
6822 return true;
6826 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
6827 be any _TYPE nodes. */
6829 bool
6830 is_properly_derived_from (tree derived, tree base)
6832 if (!CLASS_TYPE_P (derived) || !CLASS_TYPE_P (base))
6833 return false;
6835 /* We only allow proper derivation here. The DERIVED_FROM_P macro
6836 considers every class derived from itself. */
6837 return (!same_type_ignoring_top_level_qualifiers_p (derived, base)
6838 && DERIVED_FROM_P (base, derived));
6841 /* We build the ICS for an implicit object parameter as a pointer
6842 conversion sequence. However, such a sequence should be compared
6843 as if it were a reference conversion sequence. If ICS is the
6844 implicit conversion sequence for an implicit object parameter,
6845 modify it accordingly. */
6847 static void
6848 maybe_handle_implicit_object (conversion **ics)
6850 if ((*ics)->this_p)
6852 /* [over.match.funcs]
6854 For non-static member functions, the type of the
6855 implicit object parameter is "reference to cv X"
6856 where X is the class of which the function is a
6857 member and cv is the cv-qualification on the member
6858 function declaration. */
6859 conversion *t = *ics;
6860 tree reference_type;
6862 /* The `this' parameter is a pointer to a class type. Make the
6863 implicit conversion talk about a reference to that same class
6864 type. */
6865 reference_type = TREE_TYPE (t->type);
6866 reference_type = build_reference_type (reference_type);
6868 if (t->kind == ck_qual)
6869 t = t->u.next;
6870 if (t->kind == ck_ptr)
6871 t = t->u.next;
6872 t = build_identity_conv (TREE_TYPE (t->type), NULL_TREE);
6873 t = direct_reference_binding (reference_type, t);
6874 t->this_p = 1;
6875 t->rvaluedness_matches_p = 0;
6876 *ics = t;
6880 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
6881 and return the initial reference binding conversion. Otherwise,
6882 leave *ICS unchanged and return NULL. */
6884 static conversion *
6885 maybe_handle_ref_bind (conversion **ics)
6887 if ((*ics)->kind == ck_ref_bind)
6889 conversion *old_ics = *ics;
6890 *ics = old_ics->u.next;
6891 (*ics)->user_conv_p = old_ics->user_conv_p;
6892 return old_ics;
6895 return NULL;
6898 /* Compare two implicit conversion sequences according to the rules set out in
6899 [over.ics.rank]. Return values:
6901 1: ics1 is better than ics2
6902 -1: ics2 is better than ics1
6903 0: ics1 and ics2 are indistinguishable */
6905 static int
6906 compare_ics (conversion *ics1, conversion *ics2)
6908 tree from_type1;
6909 tree from_type2;
6910 tree to_type1;
6911 tree to_type2;
6912 tree deref_from_type1 = NULL_TREE;
6913 tree deref_from_type2 = NULL_TREE;
6914 tree deref_to_type1 = NULL_TREE;
6915 tree deref_to_type2 = NULL_TREE;
6916 conversion_rank rank1, rank2;
6918 /* REF_BINDING is nonzero if the result of the conversion sequence
6919 is a reference type. In that case REF_CONV is the reference
6920 binding conversion. */
6921 conversion *ref_conv1;
6922 conversion *ref_conv2;
6924 /* Handle implicit object parameters. */
6925 maybe_handle_implicit_object (&ics1);
6926 maybe_handle_implicit_object (&ics2);
6928 /* Handle reference parameters. */
6929 ref_conv1 = maybe_handle_ref_bind (&ics1);
6930 ref_conv2 = maybe_handle_ref_bind (&ics2);
6932 /* List-initialization sequence L1 is a better conversion sequence than
6933 list-initialization sequence L2 if L1 converts to
6934 std::initializer_list<X> for some X and L2 does not. */
6935 if (ics1->kind == ck_list && ics2->kind != ck_list)
6936 return 1;
6937 if (ics2->kind == ck_list && ics1->kind != ck_list)
6938 return -1;
6940 /* [over.ics.rank]
6942 When comparing the basic forms of implicit conversion sequences (as
6943 defined in _over.best.ics_)
6945 --a standard conversion sequence (_over.ics.scs_) is a better
6946 conversion sequence than a user-defined conversion sequence
6947 or an ellipsis conversion sequence, and
6949 --a user-defined conversion sequence (_over.ics.user_) is a
6950 better conversion sequence than an ellipsis conversion sequence
6951 (_over.ics.ellipsis_). */
6952 rank1 = CONVERSION_RANK (ics1);
6953 rank2 = CONVERSION_RANK (ics2);
6955 if (rank1 > rank2)
6956 return -1;
6957 else if (rank1 < rank2)
6958 return 1;
6960 if (rank1 == cr_bad)
6962 /* Both ICS are bad. We try to make a decision based on what would
6963 have happened if they'd been good. This is not an extension,
6964 we'll still give an error when we build up the call; this just
6965 helps us give a more helpful error message. */
6966 rank1 = BAD_CONVERSION_RANK (ics1);
6967 rank2 = BAD_CONVERSION_RANK (ics2);
6969 if (rank1 > rank2)
6970 return -1;
6971 else if (rank1 < rank2)
6972 return 1;
6974 /* We couldn't make up our minds; try to figure it out below. */
6977 if (ics1->ellipsis_p)
6978 /* Both conversions are ellipsis conversions. */
6979 return 0;
6981 /* User-defined conversion sequence U1 is a better conversion sequence
6982 than another user-defined conversion sequence U2 if they contain the
6983 same user-defined conversion operator or constructor and if the sec-
6984 ond standard conversion sequence of U1 is better than the second
6985 standard conversion sequence of U2. */
6987 /* Handle list-conversion with the same code even though it isn't always
6988 ranked as a user-defined conversion and it doesn't have a second
6989 standard conversion sequence; it will still have the desired effect.
6990 Specifically, we need to do the reference binding comparison at the
6991 end of this function. */
6993 if (ics1->user_conv_p || ics1->kind == ck_list)
6995 conversion *t1;
6996 conversion *t2;
6998 for (t1 = ics1; t1->kind != ck_user; t1 = t1->u.next)
6999 if (t1->kind == ck_ambig || t1->kind == ck_aggr
7000 || t1->kind == ck_list)
7001 break;
7002 for (t2 = ics2; t2->kind != ck_user; t2 = t2->u.next)
7003 if (t2->kind == ck_ambig || t2->kind == ck_aggr
7004 || t2->kind == ck_list)
7005 break;
7007 if (t1->kind != t2->kind)
7008 return 0;
7009 else if (t1->kind == ck_user)
7011 if (t1->cand->fn != t2->cand->fn)
7012 return 0;
7014 else
7016 /* For ambiguous or aggregate conversions, use the target type as
7017 a proxy for the conversion function. */
7018 if (!same_type_ignoring_top_level_qualifiers_p (t1->type, t2->type))
7019 return 0;
7022 /* We can just fall through here, after setting up
7023 FROM_TYPE1 and FROM_TYPE2. */
7024 from_type1 = t1->type;
7025 from_type2 = t2->type;
7027 else
7029 conversion *t1;
7030 conversion *t2;
7032 /* We're dealing with two standard conversion sequences.
7034 [over.ics.rank]
7036 Standard conversion sequence S1 is a better conversion
7037 sequence than standard conversion sequence S2 if
7039 --S1 is a proper subsequence of S2 (comparing the conversion
7040 sequences in the canonical form defined by _over.ics.scs_,
7041 excluding any Lvalue Transformation; the identity
7042 conversion sequence is considered to be a subsequence of
7043 any non-identity conversion sequence */
7045 t1 = ics1;
7046 while (t1->kind != ck_identity)
7047 t1 = t1->u.next;
7048 from_type1 = t1->type;
7050 t2 = ics2;
7051 while (t2->kind != ck_identity)
7052 t2 = t2->u.next;
7053 from_type2 = t2->type;
7056 /* One sequence can only be a subsequence of the other if they start with
7057 the same type. They can start with different types when comparing the
7058 second standard conversion sequence in two user-defined conversion
7059 sequences. */
7060 if (same_type_p (from_type1, from_type2))
7062 if (is_subseq (ics1, ics2))
7063 return 1;
7064 if (is_subseq (ics2, ics1))
7065 return -1;
7068 /* [over.ics.rank]
7070 Or, if not that,
7072 --the rank of S1 is better than the rank of S2 (by the rules
7073 defined below):
7075 Standard conversion sequences are ordered by their ranks: an Exact
7076 Match is a better conversion than a Promotion, which is a better
7077 conversion than a Conversion.
7079 Two conversion sequences with the same rank are indistinguishable
7080 unless one of the following rules applies:
7082 --A conversion that does not a convert a pointer, pointer to member,
7083 or std::nullptr_t to bool is better than one that does.
7085 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
7086 so that we do not have to check it explicitly. */
7087 if (ics1->rank < ics2->rank)
7088 return 1;
7089 else if (ics2->rank < ics1->rank)
7090 return -1;
7092 to_type1 = ics1->type;
7093 to_type2 = ics2->type;
7095 /* A conversion from scalar arithmetic type to complex is worse than a
7096 conversion between scalar arithmetic types. */
7097 if (same_type_p (from_type1, from_type2)
7098 && ARITHMETIC_TYPE_P (from_type1)
7099 && ARITHMETIC_TYPE_P (to_type1)
7100 && ARITHMETIC_TYPE_P (to_type2)
7101 && ((TREE_CODE (to_type1) == COMPLEX_TYPE)
7102 != (TREE_CODE (to_type2) == COMPLEX_TYPE)))
7104 if (TREE_CODE (to_type1) == COMPLEX_TYPE)
7105 return -1;
7106 else
7107 return 1;
7110 if (TYPE_PTR_P (from_type1)
7111 && TYPE_PTR_P (from_type2)
7112 && TYPE_PTR_P (to_type1)
7113 && TYPE_PTR_P (to_type2))
7115 deref_from_type1 = TREE_TYPE (from_type1);
7116 deref_from_type2 = TREE_TYPE (from_type2);
7117 deref_to_type1 = TREE_TYPE (to_type1);
7118 deref_to_type2 = TREE_TYPE (to_type2);
7120 /* The rules for pointers to members A::* are just like the rules
7121 for pointers A*, except opposite: if B is derived from A then
7122 A::* converts to B::*, not vice versa. For that reason, we
7123 switch the from_ and to_ variables here. */
7124 else if ((TYPE_PTRMEM_P (from_type1) && TYPE_PTRMEM_P (from_type2)
7125 && TYPE_PTRMEM_P (to_type1) && TYPE_PTRMEM_P (to_type2))
7126 || (TYPE_PTRMEMFUNC_P (from_type1)
7127 && TYPE_PTRMEMFUNC_P (from_type2)
7128 && TYPE_PTRMEMFUNC_P (to_type1)
7129 && TYPE_PTRMEMFUNC_P (to_type2)))
7131 deref_to_type1 = TYPE_PTRMEM_CLASS_TYPE (from_type1);
7132 deref_to_type2 = TYPE_PTRMEM_CLASS_TYPE (from_type2);
7133 deref_from_type1 = TYPE_PTRMEM_CLASS_TYPE (to_type1);
7134 deref_from_type2 = TYPE_PTRMEM_CLASS_TYPE (to_type2);
7137 if (deref_from_type1 != NULL_TREE
7138 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1))
7139 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2)))
7141 /* This was one of the pointer or pointer-like conversions.
7143 [over.ics.rank]
7145 --If class B is derived directly or indirectly from class A,
7146 conversion of B* to A* is better than conversion of B* to
7147 void*, and conversion of A* to void* is better than
7148 conversion of B* to void*. */
7149 if (TREE_CODE (deref_to_type1) == VOID_TYPE
7150 && TREE_CODE (deref_to_type2) == VOID_TYPE)
7152 if (is_properly_derived_from (deref_from_type1,
7153 deref_from_type2))
7154 return -1;
7155 else if (is_properly_derived_from (deref_from_type2,
7156 deref_from_type1))
7157 return 1;
7159 else if (TREE_CODE (deref_to_type1) == VOID_TYPE
7160 || TREE_CODE (deref_to_type2) == VOID_TYPE)
7162 if (same_type_p (deref_from_type1, deref_from_type2))
7164 if (TREE_CODE (deref_to_type2) == VOID_TYPE)
7166 if (is_properly_derived_from (deref_from_type1,
7167 deref_to_type1))
7168 return 1;
7170 /* We know that DEREF_TO_TYPE1 is `void' here. */
7171 else if (is_properly_derived_from (deref_from_type1,
7172 deref_to_type2))
7173 return -1;
7176 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1))
7177 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2)))
7179 /* [over.ics.rank]
7181 --If class B is derived directly or indirectly from class A
7182 and class C is derived directly or indirectly from B,
7184 --conversion of C* to B* is better than conversion of C* to
7187 --conversion of B* to A* is better than conversion of C* to
7188 A* */
7189 if (same_type_p (deref_from_type1, deref_from_type2))
7191 if (is_properly_derived_from (deref_to_type1,
7192 deref_to_type2))
7193 return 1;
7194 else if (is_properly_derived_from (deref_to_type2,
7195 deref_to_type1))
7196 return -1;
7198 else if (same_type_p (deref_to_type1, deref_to_type2))
7200 if (is_properly_derived_from (deref_from_type2,
7201 deref_from_type1))
7202 return 1;
7203 else if (is_properly_derived_from (deref_from_type1,
7204 deref_from_type2))
7205 return -1;
7209 else if (CLASS_TYPE_P (non_reference (from_type1))
7210 && same_type_p (from_type1, from_type2))
7212 tree from = non_reference (from_type1);
7214 /* [over.ics.rank]
7216 --binding of an expression of type C to a reference of type
7217 B& is better than binding an expression of type C to a
7218 reference of type A&
7220 --conversion of C to B is better than conversion of C to A, */
7221 if (is_properly_derived_from (from, to_type1)
7222 && is_properly_derived_from (from, to_type2))
7224 if (is_properly_derived_from (to_type1, to_type2))
7225 return 1;
7226 else if (is_properly_derived_from (to_type2, to_type1))
7227 return -1;
7230 else if (CLASS_TYPE_P (non_reference (to_type1))
7231 && same_type_p (to_type1, to_type2))
7233 tree to = non_reference (to_type1);
7235 /* [over.ics.rank]
7237 --binding of an expression of type B to a reference of type
7238 A& is better than binding an expression of type C to a
7239 reference of type A&,
7241 --conversion of B to A is better than conversion of C to A */
7242 if (is_properly_derived_from (from_type1, to)
7243 && is_properly_derived_from (from_type2, to))
7245 if (is_properly_derived_from (from_type2, from_type1))
7246 return 1;
7247 else if (is_properly_derived_from (from_type1, from_type2))
7248 return -1;
7252 /* [over.ics.rank]
7254 --S1 and S2 differ only in their qualification conversion and yield
7255 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
7256 qualification signature of type T1 is a proper subset of the cv-
7257 qualification signature of type T2 */
7258 if (ics1->kind == ck_qual
7259 && ics2->kind == ck_qual
7260 && same_type_p (from_type1, from_type2))
7262 int result = comp_cv_qual_signature (to_type1, to_type2);
7263 if (result != 0)
7264 return result;
7267 /* [over.ics.rank]
7269 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
7270 to an implicit object parameter, and either S1 binds an lvalue reference
7271 to an lvalue and S2 binds an rvalue reference or S1 binds an rvalue
7272 reference to an rvalue and S2 binds an lvalue reference
7273 (C++0x draft standard, 13.3.3.2)
7275 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
7276 types to which the references refer are the same type except for
7277 top-level cv-qualifiers, and the type to which the reference
7278 initialized by S2 refers is more cv-qualified than the type to
7279 which the reference initialized by S1 refers */
7281 if (ref_conv1 && ref_conv2)
7283 if (!ref_conv1->this_p && !ref_conv2->this_p
7284 && (TYPE_REF_IS_RVALUE (ref_conv1->type)
7285 != TYPE_REF_IS_RVALUE (ref_conv2->type)))
7287 if (ref_conv1->rvaluedness_matches_p)
7288 return 1;
7289 if (ref_conv2->rvaluedness_matches_p)
7290 return -1;
7293 if (same_type_ignoring_top_level_qualifiers_p (to_type1, to_type2))
7294 return comp_cv_qualification (TREE_TYPE (ref_conv2->type),
7295 TREE_TYPE (ref_conv1->type));
7298 /* Neither conversion sequence is better than the other. */
7299 return 0;
7302 /* The source type for this standard conversion sequence. */
7304 static tree
7305 source_type (conversion *t)
7307 for (;; t = t->u.next)
7309 if (t->kind == ck_user
7310 || t->kind == ck_ambig
7311 || t->kind == ck_identity)
7312 return t->type;
7314 gcc_unreachable ();
7317 /* Note a warning about preferring WINNER to LOSER. We do this by storing
7318 a pointer to LOSER and re-running joust to produce the warning if WINNER
7319 is actually used. */
7321 static void
7322 add_warning (struct z_candidate *winner, struct z_candidate *loser)
7324 candidate_warning *cw = (candidate_warning *)
7325 conversion_obstack_alloc (sizeof (candidate_warning));
7326 cw->loser = loser;
7327 cw->next = winner->warnings;
7328 winner->warnings = cw;
7331 /* Compare two candidates for overloading as described in
7332 [over.match.best]. Return values:
7334 1: cand1 is better than cand2
7335 -1: cand2 is better than cand1
7336 0: cand1 and cand2 are indistinguishable */
7338 static int
7339 joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn)
7341 int winner = 0;
7342 int off1 = 0, off2 = 0;
7343 size_t i;
7344 size_t len;
7346 /* Candidates that involve bad conversions are always worse than those
7347 that don't. */
7348 if (cand1->viable > cand2->viable)
7349 return 1;
7350 if (cand1->viable < cand2->viable)
7351 return -1;
7353 /* If we have two pseudo-candidates for conversions to the same type,
7354 or two candidates for the same function, arbitrarily pick one. */
7355 if (cand1->fn == cand2->fn
7356 && (IS_TYPE_OR_DECL_P (cand1->fn)))
7357 return 1;
7359 /* a viable function F1
7360 is defined to be a better function than another viable function F2 if
7361 for all arguments i, ICSi(F1) is not a worse conversion sequence than
7362 ICSi(F2), and then */
7364 /* for some argument j, ICSj(F1) is a better conversion sequence than
7365 ICSj(F2) */
7367 /* For comparing static and non-static member functions, we ignore
7368 the implicit object parameter of the non-static function. The
7369 standard says to pretend that the static function has an object
7370 parm, but that won't work with operator overloading. */
7371 len = cand1->num_convs;
7372 if (len != cand2->num_convs)
7374 int static_1 = DECL_STATIC_FUNCTION_P (cand1->fn);
7375 int static_2 = DECL_STATIC_FUNCTION_P (cand2->fn);
7377 gcc_assert (static_1 != static_2);
7379 if (static_1)
7380 off2 = 1;
7381 else
7383 off1 = 1;
7384 --len;
7388 for (i = 0; i < len; ++i)
7390 conversion *t1 = cand1->convs[i + off1];
7391 conversion *t2 = cand2->convs[i + off2];
7392 int comp = compare_ics (t1, t2);
7394 if (comp != 0)
7396 if (warn_sign_promo
7397 && (CONVERSION_RANK (t1) + CONVERSION_RANK (t2)
7398 == cr_std + cr_promotion)
7399 && t1->kind == ck_std
7400 && t2->kind == ck_std
7401 && TREE_CODE (t1->type) == INTEGER_TYPE
7402 && TREE_CODE (t2->type) == INTEGER_TYPE
7403 && (TYPE_PRECISION (t1->type)
7404 == TYPE_PRECISION (t2->type))
7405 && (TYPE_UNSIGNED (t1->u.next->type)
7406 || (TREE_CODE (t1->u.next->type)
7407 == ENUMERAL_TYPE)))
7409 tree type = t1->u.next->type;
7410 tree type1, type2;
7411 struct z_candidate *w, *l;
7412 if (comp > 0)
7413 type1 = t1->type, type2 = t2->type,
7414 w = cand1, l = cand2;
7415 else
7416 type1 = t2->type, type2 = t1->type,
7417 w = cand2, l = cand1;
7419 if (warn)
7421 warning (OPT_Wsign_promo, "passing %qT chooses %qT over %qT",
7422 type, type1, type2);
7423 warning (OPT_Wsign_promo, " in call to %qD", w->fn);
7425 else
7426 add_warning (w, l);
7429 if (winner && comp != winner)
7431 winner = 0;
7432 goto tweak;
7434 winner = comp;
7438 /* warn about confusing overload resolution for user-defined conversions,
7439 either between a constructor and a conversion op, or between two
7440 conversion ops. */
7441 if (winner && warn_conversion && cand1->second_conv
7442 && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn))
7443 && winner != compare_ics (cand1->second_conv, cand2->second_conv))
7445 struct z_candidate *w, *l;
7446 bool give_warning = false;
7448 if (winner == 1)
7449 w = cand1, l = cand2;
7450 else
7451 w = cand2, l = cand1;
7453 /* We don't want to complain about `X::operator T1 ()'
7454 beating `X::operator T2 () const', when T2 is a no less
7455 cv-qualified version of T1. */
7456 if (DECL_CONTEXT (w->fn) == DECL_CONTEXT (l->fn)
7457 && !DECL_CONSTRUCTOR_P (w->fn) && !DECL_CONSTRUCTOR_P (l->fn))
7459 tree t = TREE_TYPE (TREE_TYPE (l->fn));
7460 tree f = TREE_TYPE (TREE_TYPE (w->fn));
7462 if (TREE_CODE (t) == TREE_CODE (f) && POINTER_TYPE_P (t))
7464 t = TREE_TYPE (t);
7465 f = TREE_TYPE (f);
7467 if (!comp_ptr_ttypes (t, f))
7468 give_warning = true;
7470 else
7471 give_warning = true;
7473 if (!give_warning)
7474 /*NOP*/;
7475 else if (warn)
7477 tree source = source_type (w->convs[0]);
7478 if (! DECL_CONSTRUCTOR_P (w->fn))
7479 source = TREE_TYPE (source);
7480 if (warning (OPT_Wconversion, "choosing %qD over %qD", w->fn, l->fn)
7481 && warning (OPT_Wconversion, " for conversion from %qT to %qT",
7482 source, w->second_conv->type))
7484 inform (input_location, " because conversion sequence for the argument is better");
7487 else
7488 add_warning (w, l);
7491 if (winner)
7492 return winner;
7494 /* or, if not that,
7495 F1 is a non-template function and F2 is a template function
7496 specialization. */
7498 if (!cand1->template_decl && cand2->template_decl)
7499 return 1;
7500 else if (cand1->template_decl && !cand2->template_decl)
7501 return -1;
7503 /* or, if not that,
7504 F1 and F2 are template functions and the function template for F1 is
7505 more specialized than the template for F2 according to the partial
7506 ordering rules. */
7508 if (cand1->template_decl && cand2->template_decl)
7510 winner = more_specialized_fn
7511 (TI_TEMPLATE (cand1->template_decl),
7512 TI_TEMPLATE (cand2->template_decl),
7513 /* [temp.func.order]: The presence of unused ellipsis and default
7514 arguments has no effect on the partial ordering of function
7515 templates. add_function_candidate() will not have
7516 counted the "this" argument for constructors. */
7517 cand1->num_convs + DECL_CONSTRUCTOR_P (cand1->fn));
7518 if (winner)
7519 return winner;
7522 /* or, if not that,
7523 the context is an initialization by user-defined conversion (see
7524 _dcl.init_ and _over.match.user_) and the standard conversion
7525 sequence from the return type of F1 to the destination type (i.e.,
7526 the type of the entity being initialized) is a better conversion
7527 sequence than the standard conversion sequence from the return type
7528 of F2 to the destination type. */
7530 if (cand1->second_conv)
7532 winner = compare_ics (cand1->second_conv, cand2->second_conv);
7533 if (winner)
7534 return winner;
7537 /* Check whether we can discard a builtin candidate, either because we
7538 have two identical ones or matching builtin and non-builtin candidates.
7540 (Pedantically in the latter case the builtin which matched the user
7541 function should not be added to the overload set, but we spot it here.
7543 [over.match.oper]
7544 ... the builtin candidates include ...
7545 - do not have the same parameter type list as any non-template
7546 non-member candidate. */
7548 if (TREE_CODE (cand1->fn) == IDENTIFIER_NODE
7549 || TREE_CODE (cand2->fn) == IDENTIFIER_NODE)
7551 for (i = 0; i < len; ++i)
7552 if (!same_type_p (cand1->convs[i]->type,
7553 cand2->convs[i]->type))
7554 break;
7555 if (i == cand1->num_convs)
7557 if (cand1->fn == cand2->fn)
7558 /* Two built-in candidates; arbitrarily pick one. */
7559 return 1;
7560 else if (TREE_CODE (cand1->fn) == IDENTIFIER_NODE)
7561 /* cand1 is built-in; prefer cand2. */
7562 return -1;
7563 else
7564 /* cand2 is built-in; prefer cand1. */
7565 return 1;
7569 /* If the two function declarations represent the same function (this can
7570 happen with declarations in multiple scopes and arg-dependent lookup),
7571 arbitrarily choose one. But first make sure the default args we're
7572 using match. */
7573 if (DECL_P (cand1->fn) && DECL_P (cand2->fn)
7574 && equal_functions (cand1->fn, cand2->fn))
7576 tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (cand1->fn));
7577 tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (cand2->fn));
7579 gcc_assert (!DECL_CONSTRUCTOR_P (cand1->fn));
7581 for (i = 0; i < len; ++i)
7583 /* Don't crash if the fn is variadic. */
7584 if (!parms1)
7585 break;
7586 parms1 = TREE_CHAIN (parms1);
7587 parms2 = TREE_CHAIN (parms2);
7590 if (off1)
7591 parms1 = TREE_CHAIN (parms1);
7592 else if (off2)
7593 parms2 = TREE_CHAIN (parms2);
7595 for (; parms1; ++i)
7597 if (!cp_tree_equal (TREE_PURPOSE (parms1),
7598 TREE_PURPOSE (parms2)))
7600 if (warn)
7602 permerror (input_location, "default argument mismatch in "
7603 "overload resolution");
7604 inform (input_location,
7605 " candidate 1: %q+#F", cand1->fn);
7606 inform (input_location,
7607 " candidate 2: %q+#F", cand2->fn);
7609 else
7610 add_warning (cand1, cand2);
7611 break;
7613 parms1 = TREE_CHAIN (parms1);
7614 parms2 = TREE_CHAIN (parms2);
7617 return 1;
7620 tweak:
7622 /* Extension: If the worst conversion for one candidate is worse than the
7623 worst conversion for the other, take the first. */
7624 if (!pedantic)
7626 conversion_rank rank1 = cr_identity, rank2 = cr_identity;
7627 struct z_candidate *w = 0, *l = 0;
7629 for (i = 0; i < len; ++i)
7631 if (CONVERSION_RANK (cand1->convs[i+off1]) > rank1)
7632 rank1 = CONVERSION_RANK (cand1->convs[i+off1]);
7633 if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2)
7634 rank2 = CONVERSION_RANK (cand2->convs[i + off2]);
7636 if (rank1 < rank2)
7637 winner = 1, w = cand1, l = cand2;
7638 if (rank1 > rank2)
7639 winner = -1, w = cand2, l = cand1;
7640 if (winner)
7642 /* Don't choose a deleted function over ambiguity. */
7643 if (DECL_P (w->fn) && DECL_DELETED_FN (w->fn))
7644 return 0;
7645 if (warn)
7647 pedwarn (input_location, 0,
7648 "ISO C++ says that these are ambiguous, even "
7649 "though the worst conversion for the first is better than "
7650 "the worst conversion for the second:");
7651 print_z_candidate (_("candidate 1:"), w);
7652 print_z_candidate (_("candidate 2:"), l);
7654 else
7655 add_warning (w, l);
7656 return winner;
7660 gcc_assert (!winner);
7661 return 0;
7664 /* Given a list of candidates for overloading, find the best one, if any.
7665 This algorithm has a worst case of O(2n) (winner is last), and a best
7666 case of O(n/2) (totally ambiguous); much better than a sorting
7667 algorithm. */
7669 static struct z_candidate *
7670 tourney (struct z_candidate *candidates)
7672 struct z_candidate *champ = candidates, *challenger;
7673 int fate;
7674 int champ_compared_to_predecessor = 0;
7676 /* Walk through the list once, comparing each current champ to the next
7677 candidate, knocking out a candidate or two with each comparison. */
7679 for (challenger = champ->next; challenger; )
7681 fate = joust (champ, challenger, 0);
7682 if (fate == 1)
7683 challenger = challenger->next;
7684 else
7686 if (fate == 0)
7688 champ = challenger->next;
7689 if (champ == 0)
7690 return NULL;
7691 champ_compared_to_predecessor = 0;
7693 else
7695 champ = challenger;
7696 champ_compared_to_predecessor = 1;
7699 challenger = champ->next;
7703 /* Make sure the champ is better than all the candidates it hasn't yet
7704 been compared to. */
7706 for (challenger = candidates;
7707 challenger != champ
7708 && !(champ_compared_to_predecessor && challenger->next == champ);
7709 challenger = challenger->next)
7711 fate = joust (champ, challenger, 0);
7712 if (fate != 1)
7713 return NULL;
7716 return champ;
7719 /* Returns nonzero if things of type FROM can be converted to TO. */
7721 bool
7722 can_convert (tree to, tree from)
7724 return can_convert_arg (to, from, NULL_TREE, LOOKUP_IMPLICIT);
7727 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
7729 bool
7730 can_convert_arg (tree to, tree from, tree arg, int flags)
7732 conversion *t;
7733 void *p;
7734 bool ok_p;
7736 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7737 p = conversion_obstack_alloc (0);
7739 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
7740 flags);
7741 ok_p = (t && !t->bad_p);
7743 /* Free all the conversions we allocated. */
7744 obstack_free (&conversion_obstack, p);
7746 return ok_p;
7749 /* Like can_convert_arg, but allows dubious conversions as well. */
7751 bool
7752 can_convert_arg_bad (tree to, tree from, tree arg, int flags)
7754 conversion *t;
7755 void *p;
7757 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7758 p = conversion_obstack_alloc (0);
7759 /* Try to perform the conversion. */
7760 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
7761 flags);
7762 /* Free all the conversions we allocated. */
7763 obstack_free (&conversion_obstack, p);
7765 return t != NULL;
7768 /* Convert EXPR to TYPE. Return the converted expression.
7770 Note that we allow bad conversions here because by the time we get to
7771 this point we are committed to doing the conversion. If we end up
7772 doing a bad conversion, convert_like will complain. */
7774 tree
7775 perform_implicit_conversion_flags (tree type, tree expr, tsubst_flags_t complain, int flags)
7777 conversion *conv;
7778 void *p;
7780 if (error_operand_p (expr))
7781 return error_mark_node;
7783 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7784 p = conversion_obstack_alloc (0);
7786 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
7787 /*c_cast_p=*/false,
7788 flags);
7790 if (!conv)
7792 if (complain & tf_error)
7794 /* If expr has unknown type, then it is an overloaded function.
7795 Call instantiate_type to get good error messages. */
7796 if (TREE_TYPE (expr) == unknown_type_node)
7797 instantiate_type (type, expr, complain);
7798 else if (invalid_nonstatic_memfn_p (expr, complain))
7799 /* We gave an error. */;
7800 else
7801 error ("could not convert %qE to %qT", expr, type);
7803 expr = error_mark_node;
7805 else if (processing_template_decl)
7807 /* In a template, we are only concerned about determining the
7808 type of non-dependent expressions, so we do not have to
7809 perform the actual conversion. */
7810 if (TREE_TYPE (expr) != type)
7811 expr = build_nop (type, expr);
7813 else
7814 expr = convert_like (conv, expr, complain);
7816 /* Free all the conversions we allocated. */
7817 obstack_free (&conversion_obstack, p);
7819 return expr;
7822 tree
7823 perform_implicit_conversion (tree type, tree expr, tsubst_flags_t complain)
7825 return perform_implicit_conversion_flags (type, expr, complain, LOOKUP_IMPLICIT);
7828 /* Convert EXPR to TYPE (as a direct-initialization) if that is
7829 permitted. If the conversion is valid, the converted expression is
7830 returned. Otherwise, NULL_TREE is returned, except in the case
7831 that TYPE is a class type; in that case, an error is issued. If
7832 C_CAST_P is true, then this direction initialization is taking
7833 place as part of a static_cast being attempted as part of a C-style
7834 cast. */
7836 tree
7837 perform_direct_initialization_if_possible (tree type,
7838 tree expr,
7839 bool c_cast_p,
7840 tsubst_flags_t complain)
7842 conversion *conv;
7843 void *p;
7845 if (type == error_mark_node || error_operand_p (expr))
7846 return error_mark_node;
7847 /* [dcl.init]
7849 If the destination type is a (possibly cv-qualified) class type:
7851 -- If the initialization is direct-initialization ...,
7852 constructors are considered. ... If no constructor applies, or
7853 the overload resolution is ambiguous, the initialization is
7854 ill-formed. */
7855 if (CLASS_TYPE_P (type))
7857 VEC(tree,gc) *args = make_tree_vector_single (expr);
7858 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
7859 &args, type, LOOKUP_NORMAL, complain);
7860 release_tree_vector (args);
7861 return build_cplus_new (type, expr);
7864 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7865 p = conversion_obstack_alloc (0);
7867 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
7868 c_cast_p,
7869 LOOKUP_NORMAL);
7870 if (!conv || conv->bad_p)
7871 expr = NULL_TREE;
7872 else
7873 expr = convert_like_real (conv, expr, NULL_TREE, 0, 0,
7874 /*issue_conversion_warnings=*/false,
7875 c_cast_p,
7876 complain);
7878 /* Free all the conversions we allocated. */
7879 obstack_free (&conversion_obstack, p);
7881 return expr;
7884 /* DECL is a VAR_DECL whose type is a REFERENCE_TYPE. The reference
7885 is being bound to a temporary. Create and return a new VAR_DECL
7886 with the indicated TYPE; this variable will store the value to
7887 which the reference is bound. */
7889 tree
7890 make_temporary_var_for_ref_to_temp (tree decl, tree type)
7892 tree var;
7894 /* Create the variable. */
7895 var = create_temporary_var (type);
7897 /* Register the variable. */
7898 if (TREE_STATIC (decl))
7900 /* Namespace-scope or local static; give it a mangled name. */
7901 tree name;
7903 TREE_STATIC (var) = 1;
7904 name = mangle_ref_init_variable (decl);
7905 DECL_NAME (var) = name;
7906 SET_DECL_ASSEMBLER_NAME (var, name);
7907 var = pushdecl_top_level (var);
7909 else
7910 /* Create a new cleanup level if necessary. */
7911 maybe_push_cleanup_level (type);
7913 return var;
7916 /* EXPR is the initializer for a variable DECL of reference or
7917 std::initializer_list type. Create, push and return a new VAR_DECL
7918 for the initializer so that it will live as long as DECL. Any
7919 cleanup for the new variable is returned through CLEANUP, and the
7920 code to initialize the new variable is returned through INITP. */
7922 tree
7923 set_up_extended_ref_temp (tree decl, tree expr, tree *cleanup, tree *initp)
7925 tree init;
7926 tree type;
7927 tree var;
7929 /* Create the temporary variable. */
7930 type = TREE_TYPE (expr);
7931 var = make_temporary_var_for_ref_to_temp (decl, type);
7932 layout_decl (var, 0);
7933 /* If the rvalue is the result of a function call it will be
7934 a TARGET_EXPR. If it is some other construct (such as a
7935 member access expression where the underlying object is
7936 itself the result of a function call), turn it into a
7937 TARGET_EXPR here. It is important that EXPR be a
7938 TARGET_EXPR below since otherwise the INIT_EXPR will
7939 attempt to make a bitwise copy of EXPR to initialize
7940 VAR. */
7941 if (TREE_CODE (expr) != TARGET_EXPR)
7942 expr = get_target_expr (expr);
7944 /* If the initializer is constant, put it in DECL_INITIAL so we get
7945 static initialization and use in constant expressions. */
7946 init = maybe_constant_init (expr);
7947 if (TREE_CONSTANT (init))
7949 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
7951 /* 5.19 says that a constant expression can include an
7952 lvalue-rvalue conversion applied to "a glvalue of literal type
7953 that refers to a non-volatile temporary object initialized
7954 with a constant expression". Rather than try to communicate
7955 that this VAR_DECL is a temporary, just mark it constexpr.
7957 Currently this is only useful for initializer_list temporaries,
7958 since reference vars can't appear in constant expressions. */
7959 DECL_DECLARED_CONSTEXPR_P (var) = true;
7960 TREE_CONSTANT (var) = true;
7962 DECL_INITIAL (var) = init;
7963 init = NULL_TREE;
7965 else
7966 /* Create the INIT_EXPR that will initialize the temporary
7967 variable. */
7968 init = build2 (INIT_EXPR, type, var, expr);
7969 if (at_function_scope_p ())
7971 add_decl_expr (var);
7973 if (TREE_STATIC (var))
7974 init = add_stmt_to_compound (init, register_dtor_fn (var));
7975 else
7976 *cleanup = cxx_maybe_build_cleanup (var);
7978 /* We must be careful to destroy the temporary only
7979 after its initialization has taken place. If the
7980 initialization throws an exception, then the
7981 destructor should not be run. We cannot simply
7982 transform INIT into something like:
7984 (INIT, ({ CLEANUP_STMT; }))
7986 because emit_local_var always treats the
7987 initializer as a full-expression. Thus, the
7988 destructor would run too early; it would run at the
7989 end of initializing the reference variable, rather
7990 than at the end of the block enclosing the
7991 reference variable.
7993 The solution is to pass back a cleanup expression
7994 which the caller is responsible for attaching to
7995 the statement tree. */
7997 else
7999 rest_of_decl_compilation (var, /*toplev=*/1, at_eof);
8000 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
8001 static_aggregates = tree_cons (NULL_TREE, var,
8002 static_aggregates);
8005 *initp = init;
8006 return var;
8009 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
8010 initializing a variable of that TYPE. If DECL is non-NULL, it is
8011 the VAR_DECL being initialized with the EXPR. (In that case, the
8012 type of DECL will be TYPE.) If DECL is non-NULL, then CLEANUP must
8013 also be non-NULL, and with *CLEANUP initialized to NULL. Upon
8014 return, if *CLEANUP is no longer NULL, it will be an expression
8015 that should be pushed as a cleanup after the returned expression
8016 is used to initialize DECL.
8018 Return the converted expression. */
8020 tree
8021 initialize_reference (tree type, tree expr, tree decl, tree *cleanup,
8022 tsubst_flags_t complain)
8024 conversion *conv;
8025 void *p;
8027 if (type == error_mark_node || error_operand_p (expr))
8028 return error_mark_node;
8030 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8031 p = conversion_obstack_alloc (0);
8033 conv = reference_binding (type, TREE_TYPE (expr), expr, /*c_cast_p=*/false,
8034 LOOKUP_NORMAL);
8035 if (!conv || conv->bad_p)
8037 if (complain & tf_error)
8039 if (!CP_TYPE_CONST_P (TREE_TYPE (type))
8040 && !TYPE_REF_IS_RVALUE (type)
8041 && !real_lvalue_p (expr))
8042 error ("invalid initialization of non-const reference of "
8043 "type %qT from an rvalue of type %qT",
8044 type, TREE_TYPE (expr));
8045 else
8046 error ("invalid initialization of reference of type "
8047 "%qT from expression of type %qT", type,
8048 TREE_TYPE (expr));
8050 return error_mark_node;
8053 /* If DECL is non-NULL, then this special rule applies:
8055 [class.temporary]
8057 The temporary to which the reference is bound or the temporary
8058 that is the complete object to which the reference is bound
8059 persists for the lifetime of the reference.
8061 The temporaries created during the evaluation of the expression
8062 initializing the reference, except the temporary to which the
8063 reference is bound, are destroyed at the end of the
8064 full-expression in which they are created.
8066 In that case, we store the converted expression into a new
8067 VAR_DECL in a new scope.
8069 However, we want to be careful not to create temporaries when
8070 they are not required. For example, given:
8072 struct B {};
8073 struct D : public B {};
8074 D f();
8075 const B& b = f();
8077 there is no need to copy the return value from "f"; we can just
8078 extend its lifetime. Similarly, given:
8080 struct S {};
8081 struct T { operator S(); };
8082 T t;
8083 const S& s = t;
8085 we can extend the lifetime of the return value of the conversion
8086 operator. */
8087 gcc_assert (conv->kind == ck_ref_bind);
8088 if (decl)
8090 tree var;
8091 tree base_conv_type;
8093 /* Skip over the REF_BIND. */
8094 conv = conv->u.next;
8095 /* If the next conversion is a BASE_CONV, skip that too -- but
8096 remember that the conversion was required. */
8097 if (conv->kind == ck_base)
8099 base_conv_type = conv->type;
8100 conv = conv->u.next;
8102 else
8103 base_conv_type = NULL_TREE;
8104 /* Perform the remainder of the conversion. */
8105 expr = convert_like_real (conv, expr,
8106 /*fn=*/NULL_TREE, /*argnum=*/0,
8107 /*inner=*/-1,
8108 /*issue_conversion_warnings=*/true,
8109 /*c_cast_p=*/false,
8110 tf_warning_or_error);
8111 if (error_operand_p (expr))
8112 expr = error_mark_node;
8113 else
8115 if (!lvalue_or_rvalue_with_address_p (expr))
8117 tree init;
8118 var = set_up_extended_ref_temp (decl, expr, cleanup, &init);
8119 /* Use its address to initialize the reference variable. */
8120 expr = build_address (var);
8121 if (base_conv_type)
8122 expr = convert_to_base (expr,
8123 build_pointer_type (base_conv_type),
8124 /*check_access=*/true,
8125 /*nonnull=*/true, complain);
8126 if (init)
8127 expr = build2 (COMPOUND_EXPR, TREE_TYPE (expr), init, expr);
8129 else
8130 /* Take the address of EXPR. */
8131 expr = cp_build_addr_expr (expr, tf_warning_or_error);
8132 /* If a BASE_CONV was required, perform it now. */
8133 if (base_conv_type)
8134 expr = (perform_implicit_conversion
8135 (build_pointer_type (base_conv_type), expr,
8136 tf_warning_or_error));
8137 expr = build_nop (type, expr);
8140 else
8141 /* Perform the conversion. */
8142 expr = convert_like (conv, expr, tf_warning_or_error);
8144 /* Free all the conversions we allocated. */
8145 obstack_free (&conversion_obstack, p);
8147 return expr;
8150 /* Returns true iff TYPE is some variant of std::initializer_list. */
8152 bool
8153 is_std_init_list (tree type)
8155 /* Look through typedefs. */
8156 if (!TYPE_P (type))
8157 return false;
8158 type = TYPE_MAIN_VARIANT (type);
8159 return (CLASS_TYPE_P (type)
8160 && CP_TYPE_CONTEXT (type) == std_node
8161 && strcmp (TYPE_NAME_STRING (type), "initializer_list") == 0);
8164 /* Returns true iff DECL is a list constructor: i.e. a constructor which
8165 will accept an argument list of a single std::initializer_list<T>. */
8167 bool
8168 is_list_ctor (tree decl)
8170 tree args = FUNCTION_FIRST_USER_PARMTYPE (decl);
8171 tree arg;
8173 if (!args || args == void_list_node)
8174 return false;
8176 arg = non_reference (TREE_VALUE (args));
8177 if (!is_std_init_list (arg))
8178 return false;
8180 args = TREE_CHAIN (args);
8182 if (args && args != void_list_node && !TREE_PURPOSE (args))
8183 /* There are more non-defaulted parms. */
8184 return false;
8186 return true;
8189 #include "gt-cp-call.h"