2016-12-07 François Dumont <fdumont@gcc.gnu.org>
[official-gcc.git] / gcc / cp / call.c
blobb7aa97cc947e8fa80dd99aef7cf2e8a89b861c43
1 /* Functions related to invoking -*- C++ -*- methods and overloaded functions.
2 Copyright (C) 1987-2016 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com) and
4 modified by Brendan Kehoe (brendan@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
11 any later version.
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* High-level class interface. */
25 #include "config.h"
26 #include "system.h"
27 #include "coretypes.h"
28 #include "target.h"
29 #include "cp-tree.h"
30 #include "timevar.h"
31 #include "stringpool.h"
32 #include "cgraph.h"
33 #include "stor-layout.h"
34 #include "trans-mem.h"
35 #include "flags.h"
36 #include "toplev.h"
37 #include "intl.h"
38 #include "convert.h"
39 #include "langhooks.h"
40 #include "c-family/c-objc.h"
41 #include "internal-fn.h"
43 /* The various kinds of conversion. */
45 enum conversion_kind {
46 ck_identity,
47 ck_lvalue,
48 ck_fnptr,
49 ck_qual,
50 ck_std,
51 ck_ptr,
52 ck_pmem,
53 ck_base,
54 ck_ref_bind,
55 ck_user,
56 ck_ambig,
57 ck_list,
58 ck_aggr,
59 ck_rvalue
62 /* The rank of the conversion. Order of the enumerals matters; better
63 conversions should come earlier in the list. */
65 enum conversion_rank {
66 cr_identity,
67 cr_exact,
68 cr_promotion,
69 cr_std,
70 cr_pbool,
71 cr_user,
72 cr_ellipsis,
73 cr_bad
76 /* An implicit conversion sequence, in the sense of [over.best.ics].
77 The first conversion to be performed is at the end of the chain.
78 That conversion is always a cr_identity conversion. */
80 struct conversion {
81 /* The kind of conversion represented by this step. */
82 conversion_kind kind;
83 /* The rank of this conversion. */
84 conversion_rank rank;
85 BOOL_BITFIELD user_conv_p : 1;
86 BOOL_BITFIELD ellipsis_p : 1;
87 BOOL_BITFIELD this_p : 1;
88 /* True if this conversion would be permitted with a bending of
89 language standards, e.g. disregarding pointer qualifiers or
90 converting integers to pointers. */
91 BOOL_BITFIELD bad_p : 1;
92 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
93 temporary should be created to hold the result of the
94 conversion. */
95 BOOL_BITFIELD need_temporary_p : 1;
96 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
97 from a pointer-to-derived to pointer-to-base is being performed. */
98 BOOL_BITFIELD base_p : 1;
99 /* If KIND is ck_ref_bind, true when either an lvalue reference is
100 being bound to an lvalue expression or an rvalue reference is
101 being bound to an rvalue expression. If KIND is ck_rvalue,
102 true when we should treat an lvalue as an rvalue (12.8p33). If
103 KIND is ck_base, always false. */
104 BOOL_BITFIELD rvaluedness_matches_p: 1;
105 BOOL_BITFIELD check_narrowing: 1;
106 /* The type of the expression resulting from the conversion. */
107 tree type;
108 union {
109 /* The next conversion in the chain. Since the conversions are
110 arranged from outermost to innermost, the NEXT conversion will
111 actually be performed before this conversion. This variant is
112 used only when KIND is neither ck_identity, ck_ambig nor
113 ck_list. Please use the next_conversion function instead
114 of using this field directly. */
115 conversion *next;
116 /* The expression at the beginning of the conversion chain. This
117 variant is used only if KIND is ck_identity or ck_ambig. */
118 tree expr;
119 /* The array of conversions for an initializer_list, so this
120 variant is used only when KIN D is ck_list. */
121 conversion **list;
122 } u;
123 /* The function candidate corresponding to this conversion
124 sequence. This field is only used if KIND is ck_user. */
125 struct z_candidate *cand;
128 #define CONVERSION_RANK(NODE) \
129 ((NODE)->bad_p ? cr_bad \
130 : (NODE)->ellipsis_p ? cr_ellipsis \
131 : (NODE)->user_conv_p ? cr_user \
132 : (NODE)->rank)
134 #define BAD_CONVERSION_RANK(NODE) \
135 ((NODE)->ellipsis_p ? cr_ellipsis \
136 : (NODE)->user_conv_p ? cr_user \
137 : (NODE)->rank)
139 static struct obstack conversion_obstack;
140 static bool conversion_obstack_initialized;
141 struct rejection_reason;
143 static struct z_candidate * tourney (struct z_candidate *, tsubst_flags_t);
144 static int equal_functions (tree, tree);
145 static int joust (struct z_candidate *, struct z_candidate *, bool,
146 tsubst_flags_t);
147 static int compare_ics (conversion *, conversion *);
148 static tree build_over_call (struct z_candidate *, int, tsubst_flags_t);
149 #define convert_like(CONV, EXPR, COMPLAIN) \
150 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
151 /*issue_conversion_warnings=*/true, \
152 /*c_cast_p=*/false, (COMPLAIN))
153 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
154 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
155 /*issue_conversion_warnings=*/true, \
156 /*c_cast_p=*/false, (COMPLAIN))
157 static tree convert_like_real (conversion *, tree, tree, int, int, bool,
158 bool, tsubst_flags_t);
159 static void op_error (location_t, enum tree_code, enum tree_code, tree,
160 tree, tree, bool);
161 static struct z_candidate *build_user_type_conversion_1 (tree, tree, int,
162 tsubst_flags_t);
163 static void print_z_candidate (location_t, const char *, struct z_candidate *);
164 static void print_z_candidates (location_t, struct z_candidate *);
165 static tree build_this (tree);
166 static struct z_candidate *splice_viable (struct z_candidate *, bool, bool *);
167 static bool any_strictly_viable (struct z_candidate *);
168 static struct z_candidate *add_template_candidate
169 (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *,
170 tree, tree, tree, int, unification_kind_t, tsubst_flags_t);
171 static struct z_candidate *add_template_candidate_real
172 (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *,
173 tree, tree, tree, int, tree, unification_kind_t, tsubst_flags_t);
174 static void add_builtin_candidates
175 (struct z_candidate **, enum tree_code, enum tree_code,
176 tree, tree *, int, tsubst_flags_t);
177 static void add_builtin_candidate
178 (struct z_candidate **, enum tree_code, enum tree_code,
179 tree, tree, tree, tree *, tree *, int, tsubst_flags_t);
180 static bool is_complete (tree);
181 static void build_builtin_candidate
182 (struct z_candidate **, tree, tree, tree, tree *, tree *,
183 int, tsubst_flags_t);
184 static struct z_candidate *add_conv_candidate
185 (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, tree,
186 tree, tsubst_flags_t);
187 static struct z_candidate *add_function_candidate
188 (struct z_candidate **, tree, tree, tree, const vec<tree, va_gc> *, tree,
189 tree, int, tsubst_flags_t);
190 static conversion *implicit_conversion (tree, tree, tree, bool, int,
191 tsubst_flags_t);
192 static conversion *reference_binding (tree, tree, tree, bool, int,
193 tsubst_flags_t);
194 static conversion *build_conv (conversion_kind, tree, conversion *);
195 static conversion *build_list_conv (tree, tree, int, tsubst_flags_t);
196 static conversion *next_conversion (conversion *);
197 static bool is_subseq (conversion *, conversion *);
198 static conversion *maybe_handle_ref_bind (conversion **);
199 static void maybe_handle_implicit_object (conversion **);
200 static struct z_candidate *add_candidate
201 (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, size_t,
202 conversion **, tree, tree, int, struct rejection_reason *, int);
203 static tree source_type (conversion *);
204 static void add_warning (struct z_candidate *, struct z_candidate *);
205 static bool reference_compatible_p (tree, tree);
206 static conversion *direct_reference_binding (tree, conversion *);
207 static bool promoted_arithmetic_type_p (tree);
208 static conversion *conditional_conversion (tree, tree, tsubst_flags_t);
209 static char *name_as_c_string (tree, tree, bool *);
210 static tree prep_operand (tree);
211 static void add_candidates (tree, tree, const vec<tree, va_gc> *, tree, tree,
212 bool, tree, tree, int, struct z_candidate **,
213 tsubst_flags_t);
214 static conversion *merge_conversion_sequences (conversion *, conversion *);
215 static tree build_temp (tree, tree, int, diagnostic_t *, tsubst_flags_t);
217 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
218 NAME can take many forms... */
220 bool
221 check_dtor_name (tree basetype, tree name)
223 /* Just accept something we've already complained about. */
224 if (name == error_mark_node)
225 return true;
227 if (TREE_CODE (name) == TYPE_DECL)
228 name = TREE_TYPE (name);
229 else if (TYPE_P (name))
230 /* OK */;
231 else if (identifier_p (name))
233 if ((MAYBE_CLASS_TYPE_P (basetype)
234 && name == constructor_name (basetype))
235 || (TREE_CODE (basetype) == ENUMERAL_TYPE
236 && name == TYPE_IDENTIFIER (basetype)))
237 return true;
238 else
239 name = get_type_value (name);
241 else
243 /* In the case of:
245 template <class T> struct S { ~S(); };
246 int i;
247 i.~S();
249 NAME will be a class template. */
250 gcc_assert (DECL_CLASS_TEMPLATE_P (name));
251 return false;
254 if (!name || name == error_mark_node)
255 return false;
256 return same_type_p (TYPE_MAIN_VARIANT (basetype), TYPE_MAIN_VARIANT (name));
259 /* We want the address of a function or method. We avoid creating a
260 pointer-to-member function. */
262 tree
263 build_addr_func (tree function, tsubst_flags_t complain)
265 tree type = TREE_TYPE (function);
267 /* We have to do these by hand to avoid real pointer to member
268 functions. */
269 if (TREE_CODE (type) == METHOD_TYPE)
271 if (TREE_CODE (function) == OFFSET_REF)
273 tree object = build_address (TREE_OPERAND (function, 0));
274 return get_member_function_from_ptrfunc (&object,
275 TREE_OPERAND (function, 1),
276 complain);
278 function = build_address (function);
280 else
281 function = decay_conversion (function, complain, /*reject_builtin=*/false);
283 return function;
286 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
287 POINTER_TYPE to those. Note, pointer to member function types
288 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
289 two variants. build_call_a is the primitive taking an array of
290 arguments, while build_call_n is a wrapper that handles varargs. */
292 tree
293 build_call_n (tree function, int n, ...)
295 if (n == 0)
296 return build_call_a (function, 0, NULL);
297 else
299 tree *argarray = XALLOCAVEC (tree, n);
300 va_list ap;
301 int i;
303 va_start (ap, n);
304 for (i = 0; i < n; i++)
305 argarray[i] = va_arg (ap, tree);
306 va_end (ap);
307 return build_call_a (function, n, argarray);
311 /* Update various flags in cfun and the call itself based on what is being
312 called. Split out of build_call_a so that bot_manip can use it too. */
314 void
315 set_flags_from_callee (tree call)
317 bool nothrow;
318 tree decl = get_callee_fndecl (call);
320 /* We check both the decl and the type; a function may be known not to
321 throw without being declared throw(). */
322 nothrow = decl && TREE_NOTHROW (decl);
323 if (CALL_EXPR_FN (call))
324 nothrow |= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call))));
325 else if (internal_fn_flags (CALL_EXPR_IFN (call)) & ECF_NOTHROW)
326 nothrow = true;
328 if (!nothrow && at_function_scope_p () && cfun && cp_function_chain)
329 cp_function_chain->can_throw = 1;
331 if (decl && TREE_THIS_VOLATILE (decl) && cfun && cp_function_chain)
332 current_function_returns_abnormally = 1;
334 TREE_NOTHROW (call) = nothrow;
337 tree
338 build_call_a (tree function, int n, tree *argarray)
340 tree decl;
341 tree result_type;
342 tree fntype;
343 int i;
345 function = build_addr_func (function, tf_warning_or_error);
347 gcc_assert (TYPE_PTR_P (TREE_TYPE (function)));
348 fntype = TREE_TYPE (TREE_TYPE (function));
349 gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE
350 || TREE_CODE (fntype) == METHOD_TYPE);
351 result_type = TREE_TYPE (fntype);
352 /* An rvalue has no cv-qualifiers. */
353 if (SCALAR_TYPE_P (result_type) || VOID_TYPE_P (result_type))
354 result_type = cv_unqualified (result_type);
356 function = build_call_array_loc (input_location,
357 result_type, function, n, argarray);
358 set_flags_from_callee (function);
360 decl = get_callee_fndecl (function);
362 if (decl && !TREE_USED (decl))
364 /* We invoke build_call directly for several library
365 functions. These may have been declared normally if
366 we're building libgcc, so we can't just check
367 DECL_ARTIFICIAL. */
368 gcc_assert (DECL_ARTIFICIAL (decl)
369 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl)),
370 "__", 2));
371 mark_used (decl);
374 require_complete_eh_spec_types (fntype, decl);
376 TREE_HAS_CONSTRUCTOR (function) = (decl && DECL_CONSTRUCTOR_P (decl));
378 if (current_function_decl && decl
379 && flag_new_inheriting_ctors
380 && DECL_INHERITED_CTOR (current_function_decl)
381 && (DECL_INHERITED_CTOR (current_function_decl)
382 == DECL_CLONED_FUNCTION (decl)))
383 /* Pass arguments directly to the inherited constructor. */
384 CALL_FROM_THUNK_P (function) = true;
386 /* Don't pass empty class objects by value. This is useful
387 for tags in STL, which are used to control overload resolution.
388 We don't need to handle other cases of copying empty classes. */
389 else if (! decl || ! DECL_BUILT_IN (decl))
390 for (i = 0; i < n; i++)
392 tree arg = CALL_EXPR_ARG (function, i);
393 if (is_empty_class (TREE_TYPE (arg))
394 && ! TREE_ADDRESSABLE (TREE_TYPE (arg)))
396 tree t = build0 (EMPTY_CLASS_EXPR, TREE_TYPE (arg));
397 arg = build2 (COMPOUND_EXPR, TREE_TYPE (t), arg, t);
398 CALL_EXPR_ARG (function, i) = arg;
402 return function;
405 /* New overloading code. */
407 struct z_candidate;
409 struct candidate_warning {
410 z_candidate *loser;
411 candidate_warning *next;
414 /* Information for providing diagnostics about why overloading failed. */
416 enum rejection_reason_code {
417 rr_none,
418 rr_arity,
419 rr_explicit_conversion,
420 rr_template_conversion,
421 rr_arg_conversion,
422 rr_bad_arg_conversion,
423 rr_template_unification,
424 rr_invalid_copy,
425 rr_inherited_ctor,
426 rr_constraint_failure
429 struct conversion_info {
430 /* The index of the argument, 0-based. */
431 int n_arg;
432 /* The actual argument or its type. */
433 tree from;
434 /* The type of the parameter. */
435 tree to_type;
438 struct rejection_reason {
439 enum rejection_reason_code code;
440 union {
441 /* Information about an arity mismatch. */
442 struct {
443 /* The expected number of arguments. */
444 int expected;
445 /* The actual number of arguments in the call. */
446 int actual;
447 /* Whether the call was a varargs call. */
448 bool call_varargs_p;
449 } arity;
450 /* Information about an argument conversion mismatch. */
451 struct conversion_info conversion;
452 /* Same, but for bad argument conversions. */
453 struct conversion_info bad_conversion;
454 /* Information about template unification failures. These are the
455 parameters passed to fn_type_unification. */
456 struct {
457 tree tmpl;
458 tree explicit_targs;
459 int num_targs;
460 const tree *args;
461 unsigned int nargs;
462 tree return_type;
463 unification_kind_t strict;
464 int flags;
465 } template_unification;
466 /* Information about template instantiation failures. These are the
467 parameters passed to instantiate_template. */
468 struct {
469 tree tmpl;
470 tree targs;
471 } template_instantiation;
472 } u;
475 struct z_candidate {
476 /* The FUNCTION_DECL that will be called if this candidate is
477 selected by overload resolution. */
478 tree fn;
479 /* If not NULL_TREE, the first argument to use when calling this
480 function. */
481 tree first_arg;
482 /* The rest of the arguments to use when calling this function. If
483 there are no further arguments this may be NULL or it may be an
484 empty vector. */
485 const vec<tree, va_gc> *args;
486 /* The implicit conversion sequences for each of the arguments to
487 FN. */
488 conversion **convs;
489 /* The number of implicit conversion sequences. */
490 size_t num_convs;
491 /* If FN is a user-defined conversion, the standard conversion
492 sequence from the type returned by FN to the desired destination
493 type. */
494 conversion *second_conv;
495 struct rejection_reason *reason;
496 /* If FN is a member function, the binfo indicating the path used to
497 qualify the name of FN at the call site. This path is used to
498 determine whether or not FN is accessible if it is selected by
499 overload resolution. The DECL_CONTEXT of FN will always be a
500 (possibly improper) base of this binfo. */
501 tree access_path;
502 /* If FN is a non-static member function, the binfo indicating the
503 subobject to which the `this' pointer should be converted if FN
504 is selected by overload resolution. The type pointed to by
505 the `this' pointer must correspond to the most derived class
506 indicated by the CONVERSION_PATH. */
507 tree conversion_path;
508 tree template_decl;
509 tree explicit_targs;
510 candidate_warning *warnings;
511 z_candidate *next;
512 int viable;
514 /* The flags active in add_candidate. */
515 int flags;
518 /* Returns true iff T is a null pointer constant in the sense of
519 [conv.ptr]. */
521 bool
522 null_ptr_cst_p (tree t)
524 tree type = TREE_TYPE (t);
526 /* [conv.ptr]
528 A null pointer constant is an integral constant expression
529 (_expr.const_) rvalue of integer type that evaluates to zero or
530 an rvalue of type std::nullptr_t. */
531 if (NULLPTR_TYPE_P (type))
532 return true;
534 if (cxx_dialect >= cxx11)
536 /* Core issue 903 says only literal 0 is a null pointer constant. */
537 if (TREE_CODE (type) == INTEGER_TYPE
538 && !char_type_p (type)
539 && TREE_CODE (t) == INTEGER_CST
540 && integer_zerop (t)
541 && !TREE_OVERFLOW (t))
542 return true;
544 else if (CP_INTEGRAL_TYPE_P (type))
546 t = fold_non_dependent_expr (t);
547 STRIP_NOPS (t);
548 if (integer_zerop (t) && !TREE_OVERFLOW (t))
549 return true;
552 return false;
555 /* Returns true iff T is a null member pointer value (4.11). */
557 bool
558 null_member_pointer_value_p (tree t)
560 tree type = TREE_TYPE (t);
561 if (!type)
562 return false;
563 else if (TYPE_PTRMEMFUNC_P (type))
564 return (TREE_CODE (t) == CONSTRUCTOR
565 && integer_zerop (CONSTRUCTOR_ELT (t, 0)->value));
566 else if (TYPE_PTRDATAMEM_P (type))
567 return integer_all_onesp (t);
568 else
569 return false;
572 /* Returns nonzero if PARMLIST consists of only default parms,
573 ellipsis, and/or undeduced parameter packs. */
575 bool
576 sufficient_parms_p (const_tree parmlist)
578 for (; parmlist && parmlist != void_list_node;
579 parmlist = TREE_CHAIN (parmlist))
580 if (!TREE_PURPOSE (parmlist)
581 && !PACK_EXPANSION_P (TREE_VALUE (parmlist)))
582 return false;
583 return true;
586 /* Allocate N bytes of memory from the conversion obstack. The memory
587 is zeroed before being returned. */
589 static void *
590 conversion_obstack_alloc (size_t n)
592 void *p;
593 if (!conversion_obstack_initialized)
595 gcc_obstack_init (&conversion_obstack);
596 conversion_obstack_initialized = true;
598 p = obstack_alloc (&conversion_obstack, n);
599 memset (p, 0, n);
600 return p;
603 /* Allocate rejection reasons. */
605 static struct rejection_reason *
606 alloc_rejection (enum rejection_reason_code code)
608 struct rejection_reason *p;
609 p = (struct rejection_reason *) conversion_obstack_alloc (sizeof *p);
610 p->code = code;
611 return p;
614 static struct rejection_reason *
615 arity_rejection (tree first_arg, int expected, int actual)
617 struct rejection_reason *r = alloc_rejection (rr_arity);
618 int adjust = first_arg != NULL_TREE;
619 r->u.arity.expected = expected - adjust;
620 r->u.arity.actual = actual - adjust;
621 return r;
624 static struct rejection_reason *
625 arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to)
627 struct rejection_reason *r = alloc_rejection (rr_arg_conversion);
628 int adjust = first_arg != NULL_TREE;
629 r->u.conversion.n_arg = n_arg - adjust;
630 r->u.conversion.from = from;
631 r->u.conversion.to_type = to;
632 return r;
635 static struct rejection_reason *
636 bad_arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to)
638 struct rejection_reason *r = alloc_rejection (rr_bad_arg_conversion);
639 int adjust = first_arg != NULL_TREE;
640 r->u.bad_conversion.n_arg = n_arg - adjust;
641 r->u.bad_conversion.from = from;
642 r->u.bad_conversion.to_type = to;
643 return r;
646 static struct rejection_reason *
647 explicit_conversion_rejection (tree from, tree to)
649 struct rejection_reason *r = alloc_rejection (rr_explicit_conversion);
650 r->u.conversion.n_arg = 0;
651 r->u.conversion.from = from;
652 r->u.conversion.to_type = to;
653 return r;
656 static struct rejection_reason *
657 template_conversion_rejection (tree from, tree to)
659 struct rejection_reason *r = alloc_rejection (rr_template_conversion);
660 r->u.conversion.n_arg = 0;
661 r->u.conversion.from = from;
662 r->u.conversion.to_type = to;
663 return r;
666 static struct rejection_reason *
667 template_unification_rejection (tree tmpl, tree explicit_targs, tree targs,
668 const tree *args, unsigned int nargs,
669 tree return_type, unification_kind_t strict,
670 int flags)
672 size_t args_n_bytes = sizeof (*args) * nargs;
673 tree *args1 = (tree *) conversion_obstack_alloc (args_n_bytes);
674 struct rejection_reason *r = alloc_rejection (rr_template_unification);
675 r->u.template_unification.tmpl = tmpl;
676 r->u.template_unification.explicit_targs = explicit_targs;
677 r->u.template_unification.num_targs = TREE_VEC_LENGTH (targs);
678 /* Copy args to our own storage. */
679 memcpy (args1, args, args_n_bytes);
680 r->u.template_unification.args = args1;
681 r->u.template_unification.nargs = nargs;
682 r->u.template_unification.return_type = return_type;
683 r->u.template_unification.strict = strict;
684 r->u.template_unification.flags = flags;
685 return r;
688 static struct rejection_reason *
689 template_unification_error_rejection (void)
691 return alloc_rejection (rr_template_unification);
694 static struct rejection_reason *
695 invalid_copy_with_fn_template_rejection (void)
697 struct rejection_reason *r = alloc_rejection (rr_invalid_copy);
698 return r;
701 static struct rejection_reason *
702 inherited_ctor_rejection (void)
704 struct rejection_reason *r = alloc_rejection (rr_inherited_ctor);
705 return r;
708 // Build a constraint failure record, saving information into the
709 // template_instantiation field of the rejection. If FN is not a template
710 // declaration, the TMPL member is the FN declaration and TARGS is empty.
712 static struct rejection_reason *
713 constraint_failure (tree fn)
715 struct rejection_reason *r = alloc_rejection (rr_constraint_failure);
716 if (tree ti = DECL_TEMPLATE_INFO (fn))
718 r->u.template_instantiation.tmpl = TI_TEMPLATE (ti);
719 r->u.template_instantiation.targs = TI_ARGS (ti);
721 else
723 r->u.template_instantiation.tmpl = fn;
724 r->u.template_instantiation.targs = NULL_TREE;
726 return r;
729 /* Dynamically allocate a conversion. */
731 static conversion *
732 alloc_conversion (conversion_kind kind)
734 conversion *c;
735 c = (conversion *) conversion_obstack_alloc (sizeof (conversion));
736 c->kind = kind;
737 return c;
740 /* Make sure that all memory on the conversion obstack has been
741 freed. */
743 void
744 validate_conversion_obstack (void)
746 if (conversion_obstack_initialized)
747 gcc_assert ((obstack_next_free (&conversion_obstack)
748 == obstack_base (&conversion_obstack)));
751 /* Dynamically allocate an array of N conversions. */
753 static conversion **
754 alloc_conversions (size_t n)
756 return (conversion **) conversion_obstack_alloc (n * sizeof (conversion *));
759 static conversion *
760 build_conv (conversion_kind code, tree type, conversion *from)
762 conversion *t;
763 conversion_rank rank = CONVERSION_RANK (from);
765 /* Note that the caller is responsible for filling in t->cand for
766 user-defined conversions. */
767 t = alloc_conversion (code);
768 t->type = type;
769 t->u.next = from;
771 switch (code)
773 case ck_ptr:
774 case ck_pmem:
775 case ck_base:
776 case ck_std:
777 if (rank < cr_std)
778 rank = cr_std;
779 break;
781 case ck_qual:
782 case ck_fnptr:
783 if (rank < cr_exact)
784 rank = cr_exact;
785 break;
787 default:
788 break;
790 t->rank = rank;
791 t->user_conv_p = (code == ck_user || from->user_conv_p);
792 t->bad_p = from->bad_p;
793 t->base_p = false;
794 return t;
797 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
798 specialization of std::initializer_list<T>, if such a conversion is
799 possible. */
801 static conversion *
802 build_list_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
804 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type), 0);
805 unsigned len = CONSTRUCTOR_NELTS (ctor);
806 conversion **subconvs = alloc_conversions (len);
807 conversion *t;
808 unsigned i;
809 tree val;
811 /* Within a list-initialization we can have more user-defined
812 conversions. */
813 flags &= ~LOOKUP_NO_CONVERSION;
814 /* But no narrowing conversions. */
815 flags |= LOOKUP_NO_NARROWING;
817 /* Can't make an array of these types. */
818 if (TREE_CODE (elttype) == REFERENCE_TYPE
819 || TREE_CODE (elttype) == FUNCTION_TYPE
820 || VOID_TYPE_P (elttype))
821 return NULL;
823 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
825 conversion *sub
826 = implicit_conversion (elttype, TREE_TYPE (val), val,
827 false, flags, complain);
828 if (sub == NULL)
829 return NULL;
831 subconvs[i] = sub;
834 t = alloc_conversion (ck_list);
835 t->type = type;
836 t->u.list = subconvs;
837 t->rank = cr_exact;
839 for (i = 0; i < len; ++i)
841 conversion *sub = subconvs[i];
842 if (sub->rank > t->rank)
843 t->rank = sub->rank;
844 if (sub->user_conv_p)
845 t->user_conv_p = true;
846 if (sub->bad_p)
847 t->bad_p = true;
850 return t;
853 /* Return the next conversion of the conversion chain (if applicable),
854 or NULL otherwise. Please use this function instead of directly
855 accessing fields of struct conversion. */
857 static conversion *
858 next_conversion (conversion *conv)
860 if (conv == NULL
861 || conv->kind == ck_identity
862 || conv->kind == ck_ambig
863 || conv->kind == ck_list)
864 return NULL;
865 return conv->u.next;
868 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
869 is a valid aggregate initializer for array type ATYPE. */
871 static bool
872 can_convert_array (tree atype, tree ctor, int flags, tsubst_flags_t complain)
874 unsigned i;
875 tree elttype = TREE_TYPE (atype);
876 for (i = 0; i < CONSTRUCTOR_NELTS (ctor); ++i)
878 tree val = CONSTRUCTOR_ELT (ctor, i)->value;
879 bool ok;
880 if (TREE_CODE (elttype) == ARRAY_TYPE
881 && TREE_CODE (val) == CONSTRUCTOR)
882 ok = can_convert_array (elttype, val, flags, complain);
883 else
884 ok = can_convert_arg (elttype, TREE_TYPE (val), val, flags,
885 complain);
886 if (!ok)
887 return false;
889 return true;
892 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
893 aggregate class, if such a conversion is possible. */
895 static conversion *
896 build_aggr_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
898 unsigned HOST_WIDE_INT i = 0;
899 conversion *c;
900 tree field = next_initializable_field (TYPE_FIELDS (type));
901 tree empty_ctor = NULL_TREE;
903 /* We already called reshape_init in implicit_conversion. */
905 /* The conversions within the init-list aren't affected by the enclosing
906 context; they're always simple copy-initialization. */
907 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
909 for (; field; field = next_initializable_field (DECL_CHAIN (field)))
911 tree ftype = TREE_TYPE (field);
912 tree val;
913 bool ok;
915 if (i < CONSTRUCTOR_NELTS (ctor))
916 val = CONSTRUCTOR_ELT (ctor, i)->value;
917 else if (DECL_INITIAL (field))
918 val = get_nsdmi (field, /*ctor*/false);
919 else if (TREE_CODE (ftype) == REFERENCE_TYPE)
920 /* Value-initialization of reference is ill-formed. */
921 return NULL;
922 else
924 if (empty_ctor == NULL_TREE)
925 empty_ctor = build_constructor (init_list_type_node, NULL);
926 val = empty_ctor;
928 ++i;
930 if (TREE_CODE (ftype) == ARRAY_TYPE
931 && TREE_CODE (val) == CONSTRUCTOR)
932 ok = can_convert_array (ftype, val, flags, complain);
933 else
934 ok = can_convert_arg (ftype, TREE_TYPE (val), val, flags,
935 complain);
937 if (!ok)
938 return NULL;
940 if (TREE_CODE (type) == UNION_TYPE)
941 break;
944 if (i < CONSTRUCTOR_NELTS (ctor))
945 return NULL;
947 c = alloc_conversion (ck_aggr);
948 c->type = type;
949 c->rank = cr_exact;
950 c->user_conv_p = true;
951 c->check_narrowing = true;
952 c->u.next = NULL;
953 return c;
956 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
957 array type, if such a conversion is possible. */
959 static conversion *
960 build_array_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
962 conversion *c;
963 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
964 tree elttype = TREE_TYPE (type);
965 unsigned i;
966 tree val;
967 bool bad = false;
968 bool user = false;
969 enum conversion_rank rank = cr_exact;
971 /* We might need to propagate the size from the element to the array. */
972 complete_type (type);
974 if (TYPE_DOMAIN (type)
975 && !variably_modified_type_p (TYPE_DOMAIN (type), NULL_TREE))
977 unsigned HOST_WIDE_INT alen = tree_to_uhwi (array_type_nelts_top (type));
978 if (alen < len)
979 return NULL;
982 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
984 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
986 conversion *sub
987 = implicit_conversion (elttype, TREE_TYPE (val), val,
988 false, flags, complain);
989 if (sub == NULL)
990 return NULL;
992 if (sub->rank > rank)
993 rank = sub->rank;
994 if (sub->user_conv_p)
995 user = true;
996 if (sub->bad_p)
997 bad = true;
1000 c = alloc_conversion (ck_aggr);
1001 c->type = type;
1002 c->rank = rank;
1003 c->user_conv_p = user;
1004 c->bad_p = bad;
1005 c->u.next = NULL;
1006 return c;
1009 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1010 complex type, if such a conversion is possible. */
1012 static conversion *
1013 build_complex_conv (tree type, tree ctor, int flags,
1014 tsubst_flags_t complain)
1016 conversion *c;
1017 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
1018 tree elttype = TREE_TYPE (type);
1019 unsigned i;
1020 tree val;
1021 bool bad = false;
1022 bool user = false;
1023 enum conversion_rank rank = cr_exact;
1025 if (len != 2)
1026 return NULL;
1028 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
1030 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
1032 conversion *sub
1033 = implicit_conversion (elttype, TREE_TYPE (val), val,
1034 false, flags, complain);
1035 if (sub == NULL)
1036 return NULL;
1038 if (sub->rank > rank)
1039 rank = sub->rank;
1040 if (sub->user_conv_p)
1041 user = true;
1042 if (sub->bad_p)
1043 bad = true;
1046 c = alloc_conversion (ck_aggr);
1047 c->type = type;
1048 c->rank = rank;
1049 c->user_conv_p = user;
1050 c->bad_p = bad;
1051 c->u.next = NULL;
1052 return c;
1055 /* Build a representation of the identity conversion from EXPR to
1056 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1058 static conversion *
1059 build_identity_conv (tree type, tree expr)
1061 conversion *c;
1063 c = alloc_conversion (ck_identity);
1064 c->type = type;
1065 c->u.expr = expr;
1067 return c;
1070 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1071 were multiple user-defined conversions to accomplish the job.
1072 Build a conversion that indicates that ambiguity. */
1074 static conversion *
1075 build_ambiguous_conv (tree type, tree expr)
1077 conversion *c;
1079 c = alloc_conversion (ck_ambig);
1080 c->type = type;
1081 c->u.expr = expr;
1083 return c;
1086 tree
1087 strip_top_quals (tree t)
1089 if (TREE_CODE (t) == ARRAY_TYPE)
1090 return t;
1091 return cp_build_qualified_type (t, 0);
1094 /* Returns the standard conversion path (see [conv]) from type FROM to type
1095 TO, if any. For proper handling of null pointer constants, you must
1096 also pass the expression EXPR to convert from. If C_CAST_P is true,
1097 this conversion is coming from a C-style cast. */
1099 static conversion *
1100 standard_conversion (tree to, tree from, tree expr, bool c_cast_p,
1101 int flags, tsubst_flags_t complain)
1103 enum tree_code fcode, tcode;
1104 conversion *conv;
1105 bool fromref = false;
1106 tree qualified_to;
1108 to = non_reference (to);
1109 if (TREE_CODE (from) == REFERENCE_TYPE)
1111 fromref = true;
1112 from = TREE_TYPE (from);
1114 qualified_to = to;
1115 to = strip_top_quals (to);
1116 from = strip_top_quals (from);
1118 if (expr && type_unknown_p (expr))
1120 if (TYPE_PTRFN_P (to) || TYPE_PTRMEMFUNC_P (to))
1122 tsubst_flags_t tflags = tf_conv;
1123 expr = instantiate_type (to, expr, tflags);
1124 if (expr == error_mark_node)
1125 return NULL;
1126 from = TREE_TYPE (expr);
1128 else if (TREE_CODE (to) == BOOLEAN_TYPE)
1130 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1131 expr = resolve_nondeduced_context (expr, complain);
1132 from = TREE_TYPE (expr);
1136 fcode = TREE_CODE (from);
1137 tcode = TREE_CODE (to);
1139 conv = build_identity_conv (from, expr);
1140 if (fcode == FUNCTION_TYPE || fcode == ARRAY_TYPE)
1142 from = type_decays_to (from);
1143 fcode = TREE_CODE (from);
1144 conv = build_conv (ck_lvalue, from, conv);
1146 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1147 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1148 express the copy constructor call required by copy-initialization. */
1149 else if (fromref || (expr && obvalue_p (expr)))
1151 if (expr)
1153 tree bitfield_type;
1154 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
1155 if (bitfield_type)
1157 from = strip_top_quals (bitfield_type);
1158 fcode = TREE_CODE (from);
1161 conv = build_conv (ck_rvalue, from, conv);
1162 if (flags & LOOKUP_PREFER_RVALUE)
1163 conv->rvaluedness_matches_p = true;
1166 /* Allow conversion between `__complex__' data types. */
1167 if (tcode == COMPLEX_TYPE && fcode == COMPLEX_TYPE)
1169 /* The standard conversion sequence to convert FROM to TO is
1170 the standard conversion sequence to perform componentwise
1171 conversion. */
1172 conversion *part_conv = standard_conversion
1173 (TREE_TYPE (to), TREE_TYPE (from), NULL_TREE, c_cast_p, flags,
1174 complain);
1176 if (part_conv)
1178 conv = build_conv (part_conv->kind, to, conv);
1179 conv->rank = part_conv->rank;
1181 else
1182 conv = NULL;
1184 return conv;
1187 if (same_type_p (from, to))
1189 if (CLASS_TYPE_P (to) && conv->kind == ck_rvalue)
1190 conv->type = qualified_to;
1191 return conv;
1194 /* [conv.ptr]
1195 A null pointer constant can be converted to a pointer type; ... A
1196 null pointer constant of integral type can be converted to an
1197 rvalue of type std::nullptr_t. */
1198 if ((tcode == POINTER_TYPE || TYPE_PTRMEM_P (to)
1199 || NULLPTR_TYPE_P (to))
1200 && ((expr && null_ptr_cst_p (expr))
1201 || NULLPTR_TYPE_P (from)))
1202 conv = build_conv (ck_std, to, conv);
1203 else if ((tcode == INTEGER_TYPE && fcode == POINTER_TYPE)
1204 || (tcode == POINTER_TYPE && fcode == INTEGER_TYPE))
1206 /* For backwards brain damage compatibility, allow interconversion of
1207 pointers and integers with a pedwarn. */
1208 conv = build_conv (ck_std, to, conv);
1209 conv->bad_p = true;
1211 else if (UNSCOPED_ENUM_P (to) && fcode == INTEGER_TYPE)
1213 /* For backwards brain damage compatibility, allow interconversion of
1214 enums and integers with a pedwarn. */
1215 conv = build_conv (ck_std, to, conv);
1216 conv->bad_p = true;
1218 else if ((tcode == POINTER_TYPE && fcode == POINTER_TYPE)
1219 || (TYPE_PTRDATAMEM_P (to) && TYPE_PTRDATAMEM_P (from)))
1221 tree to_pointee;
1222 tree from_pointee;
1224 if (tcode == POINTER_TYPE)
1226 to_pointee = TREE_TYPE (to);
1227 from_pointee = TREE_TYPE (from);
1229 /* Since this is the target of a pointer, it can't have function
1230 qualifiers, so any TYPE_QUALS must be for attributes const or
1231 noreturn. Strip them. */
1232 if (TREE_CODE (to_pointee) == FUNCTION_TYPE
1233 && TYPE_QUALS (to_pointee))
1234 to_pointee = build_qualified_type (to_pointee, TYPE_UNQUALIFIED);
1235 if (TREE_CODE (from_pointee) == FUNCTION_TYPE
1236 && TYPE_QUALS (from_pointee))
1237 from_pointee = build_qualified_type (from_pointee, TYPE_UNQUALIFIED);
1239 else
1241 to_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (to);
1242 from_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (from);
1245 if (tcode == POINTER_TYPE
1246 && same_type_ignoring_top_level_qualifiers_p (from_pointee,
1247 to_pointee))
1249 else if (VOID_TYPE_P (to_pointee)
1250 && !TYPE_PTRDATAMEM_P (from)
1251 && TREE_CODE (from_pointee) != FUNCTION_TYPE)
1253 tree nfrom = TREE_TYPE (from);
1254 /* Don't try to apply restrict to void. */
1255 int quals = cp_type_quals (nfrom) & ~TYPE_QUAL_RESTRICT;
1256 from_pointee = cp_build_qualified_type (void_type_node, quals);
1257 from = build_pointer_type (from_pointee);
1258 conv = build_conv (ck_ptr, from, conv);
1260 else if (TYPE_PTRDATAMEM_P (from))
1262 tree fbase = TYPE_PTRMEM_CLASS_TYPE (from);
1263 tree tbase = TYPE_PTRMEM_CLASS_TYPE (to);
1265 if (DERIVED_FROM_P (fbase, tbase)
1266 && (same_type_ignoring_top_level_qualifiers_p
1267 (from_pointee, to_pointee)))
1269 from = build_ptrmem_type (tbase, from_pointee);
1270 conv = build_conv (ck_pmem, from, conv);
1272 else if (!same_type_p (fbase, tbase))
1273 return NULL;
1275 else if (CLASS_TYPE_P (from_pointee)
1276 && CLASS_TYPE_P (to_pointee)
1277 /* [conv.ptr]
1279 An rvalue of type "pointer to cv D," where D is a
1280 class type, can be converted to an rvalue of type
1281 "pointer to cv B," where B is a base class (clause
1282 _class.derived_) of D. If B is an inaccessible
1283 (clause _class.access_) or ambiguous
1284 (_class.member.lookup_) base class of D, a program
1285 that necessitates this conversion is ill-formed.
1286 Therefore, we use DERIVED_FROM_P, and do not check
1287 access or uniqueness. */
1288 && DERIVED_FROM_P (to_pointee, from_pointee))
1290 from_pointee
1291 = cp_build_qualified_type (to_pointee,
1292 cp_type_quals (from_pointee));
1293 from = build_pointer_type (from_pointee);
1294 conv = build_conv (ck_ptr, from, conv);
1295 conv->base_p = true;
1298 if (same_type_p (from, to))
1299 /* OK */;
1300 else if (c_cast_p && comp_ptr_ttypes_const (to, from))
1301 /* In a C-style cast, we ignore CV-qualification because we
1302 are allowed to perform a static_cast followed by a
1303 const_cast. */
1304 conv = build_conv (ck_qual, to, conv);
1305 else if (!c_cast_p && comp_ptr_ttypes (to_pointee, from_pointee))
1306 conv = build_conv (ck_qual, to, conv);
1307 else if (expr && string_conv_p (to, expr, 0))
1308 /* converting from string constant to char *. */
1309 conv = build_conv (ck_qual, to, conv);
1310 else if (fnptr_conv_p (to, from))
1311 conv = build_conv (ck_fnptr, to, conv);
1312 /* Allow conversions among compatible ObjC pointer types (base
1313 conversions have been already handled above). */
1314 else if (c_dialect_objc ()
1315 && objc_compare_types (to, from, -4, NULL_TREE))
1316 conv = build_conv (ck_ptr, to, conv);
1317 else if (ptr_reasonably_similar (to_pointee, from_pointee))
1319 conv = build_conv (ck_ptr, to, conv);
1320 conv->bad_p = true;
1322 else
1323 return NULL;
1325 from = to;
1327 else if (TYPE_PTRMEMFUNC_P (to) && TYPE_PTRMEMFUNC_P (from))
1329 tree fromfn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from));
1330 tree tofn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to));
1331 tree fbase = class_of_this_parm (fromfn);
1332 tree tbase = class_of_this_parm (tofn);
1334 if (!DERIVED_FROM_P (fbase, tbase))
1335 return NULL;
1337 tree fstat = static_fn_type (fromfn);
1338 tree tstat = static_fn_type (tofn);
1339 if (same_type_p (tstat, fstat)
1340 || fnptr_conv_p (tstat, fstat))
1341 /* OK */;
1342 else
1343 return NULL;
1345 if (!same_type_p (fbase, tbase))
1347 from = build_memfn_type (fstat,
1348 tbase,
1349 cp_type_quals (tbase),
1350 type_memfn_rqual (tofn));
1351 from = build_ptrmemfunc_type (build_pointer_type (from));
1352 conv = build_conv (ck_pmem, from, conv);
1353 conv->base_p = true;
1355 if (fnptr_conv_p (tstat, fstat))
1356 conv = build_conv (ck_fnptr, to, conv);
1358 else if (tcode == BOOLEAN_TYPE)
1360 /* [conv.bool]
1362 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1363 to member type can be converted to a prvalue of type bool. ...
1364 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1365 std::nullptr_t can be converted to a prvalue of type bool; */
1366 if (ARITHMETIC_TYPE_P (from)
1367 || UNSCOPED_ENUM_P (from)
1368 || fcode == POINTER_TYPE
1369 || TYPE_PTRMEM_P (from)
1370 || NULLPTR_TYPE_P (from))
1372 conv = build_conv (ck_std, to, conv);
1373 if (fcode == POINTER_TYPE
1374 || TYPE_PTRDATAMEM_P (from)
1375 || (TYPE_PTRMEMFUNC_P (from)
1376 && conv->rank < cr_pbool)
1377 || NULLPTR_TYPE_P (from))
1378 conv->rank = cr_pbool;
1379 if (NULLPTR_TYPE_P (from) && (flags & LOOKUP_ONLYCONVERTING))
1380 conv->bad_p = true;
1381 return conv;
1384 return NULL;
1386 /* We don't check for ENUMERAL_TYPE here because there are no standard
1387 conversions to enum type. */
1388 /* As an extension, allow conversion to complex type. */
1389 else if (ARITHMETIC_TYPE_P (to))
1391 if (! (INTEGRAL_CODE_P (fcode)
1392 || (fcode == REAL_TYPE && !(flags & LOOKUP_NO_NON_INTEGRAL)))
1393 || SCOPED_ENUM_P (from))
1394 return NULL;
1395 conv = build_conv (ck_std, to, conv);
1397 /* Give this a better rank if it's a promotion. */
1398 if (same_type_p (to, type_promotes_to (from))
1399 && next_conversion (conv)->rank <= cr_promotion)
1400 conv->rank = cr_promotion;
1402 else if (fcode == VECTOR_TYPE && tcode == VECTOR_TYPE
1403 && vector_types_convertible_p (from, to, false))
1404 return build_conv (ck_std, to, conv);
1405 else if (MAYBE_CLASS_TYPE_P (to) && MAYBE_CLASS_TYPE_P (from)
1406 && is_properly_derived_from (from, to))
1408 if (conv->kind == ck_rvalue)
1409 conv = next_conversion (conv);
1410 conv = build_conv (ck_base, to, conv);
1411 /* The derived-to-base conversion indicates the initialization
1412 of a parameter with base type from an object of a derived
1413 type. A temporary object is created to hold the result of
1414 the conversion unless we're binding directly to a reference. */
1415 conv->need_temporary_p = !(flags & LOOKUP_NO_TEMP_BIND);
1417 else
1418 return NULL;
1420 if (flags & LOOKUP_NO_NARROWING)
1421 conv->check_narrowing = true;
1423 return conv;
1426 /* Returns nonzero if T1 is reference-related to T2. */
1428 bool
1429 reference_related_p (tree t1, tree t2)
1431 if (t1 == error_mark_node || t2 == error_mark_node)
1432 return false;
1434 t1 = TYPE_MAIN_VARIANT (t1);
1435 t2 = TYPE_MAIN_VARIANT (t2);
1437 /* [dcl.init.ref]
1439 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1440 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1441 of T2. */
1442 return (same_type_p (t1, t2)
1443 || (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
1444 && DERIVED_FROM_P (t1, t2)));
1447 /* Returns nonzero if T1 is reference-compatible with T2. */
1449 static bool
1450 reference_compatible_p (tree t1, tree t2)
1452 /* [dcl.init.ref]
1454 "cv1 T1" is reference compatible with "cv2 T2" if
1455 * T1 is reference-related to T2 or
1456 * T2 is "noexcept function" and T1 is "function", where the
1457 function types are otherwise the same,
1458 and cv1 is the same cv-qualification as, or greater cv-qualification
1459 than, cv2. */
1460 return ((reference_related_p (t1, t2)
1461 || fnptr_conv_p (t1, t2))
1462 && at_least_as_qualified_p (t1, t2));
1465 /* A reference of the indicated TYPE is being bound directly to the
1466 expression represented by the implicit conversion sequence CONV.
1467 Return a conversion sequence for this binding. */
1469 static conversion *
1470 direct_reference_binding (tree type, conversion *conv)
1472 tree t;
1474 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
1475 gcc_assert (TREE_CODE (conv->type) != REFERENCE_TYPE);
1477 t = TREE_TYPE (type);
1479 /* [over.ics.rank]
1481 When a parameter of reference type binds directly
1482 (_dcl.init.ref_) to an argument expression, the implicit
1483 conversion sequence is the identity conversion, unless the
1484 argument expression has a type that is a derived class of the
1485 parameter type, in which case the implicit conversion sequence is
1486 a derived-to-base Conversion.
1488 If the parameter binds directly to the result of applying a
1489 conversion function to the argument expression, the implicit
1490 conversion sequence is a user-defined conversion sequence
1491 (_over.ics.user_), with the second standard conversion sequence
1492 either an identity conversion or, if the conversion function
1493 returns an entity of a type that is a derived class of the
1494 parameter type, a derived-to-base conversion. */
1495 if (is_properly_derived_from (conv->type, t))
1497 /* Represent the derived-to-base conversion. */
1498 conv = build_conv (ck_base, t, conv);
1499 /* We will actually be binding to the base-class subobject in
1500 the derived class, so we mark this conversion appropriately.
1501 That way, convert_like knows not to generate a temporary. */
1502 conv->need_temporary_p = false;
1504 return build_conv (ck_ref_bind, type, conv);
1507 /* Returns the conversion path from type FROM to reference type TO for
1508 purposes of reference binding. For lvalue binding, either pass a
1509 reference type to FROM or an lvalue expression to EXPR. If the
1510 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1511 the conversion returned. If C_CAST_P is true, this
1512 conversion is coming from a C-style cast. */
1514 static conversion *
1515 reference_binding (tree rto, tree rfrom, tree expr, bool c_cast_p, int flags,
1516 tsubst_flags_t complain)
1518 conversion *conv = NULL;
1519 tree to = TREE_TYPE (rto);
1520 tree from = rfrom;
1521 tree tfrom;
1522 bool related_p;
1523 bool compatible_p;
1524 cp_lvalue_kind gl_kind;
1525 bool is_lvalue;
1527 if (TREE_CODE (to) == FUNCTION_TYPE && expr && type_unknown_p (expr))
1529 expr = instantiate_type (to, expr, tf_none);
1530 if (expr == error_mark_node)
1531 return NULL;
1532 from = TREE_TYPE (expr);
1535 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1537 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
1538 /* DR 1288: Otherwise, if the initializer list has a single element
1539 of type E and ... [T's] referenced type is reference-related to E,
1540 the object or reference is initialized from that element... */
1541 if (CONSTRUCTOR_NELTS (expr) == 1)
1543 tree elt = CONSTRUCTOR_ELT (expr, 0)->value;
1544 if (error_operand_p (elt))
1545 return NULL;
1546 tree etype = TREE_TYPE (elt);
1547 if (reference_related_p (to, etype))
1549 expr = elt;
1550 from = etype;
1551 goto skip;
1554 /* Otherwise, if T is a reference type, a prvalue temporary of the
1555 type referenced by T is copy-list-initialized or
1556 direct-list-initialized, depending on the kind of initialization
1557 for the reference, and the reference is bound to that temporary. */
1558 conv = implicit_conversion (to, from, expr, c_cast_p,
1559 flags|LOOKUP_NO_TEMP_BIND, complain);
1560 skip:;
1563 if (TREE_CODE (from) == REFERENCE_TYPE)
1565 from = TREE_TYPE (from);
1566 if (!TYPE_REF_IS_RVALUE (rfrom)
1567 || TREE_CODE (from) == FUNCTION_TYPE)
1568 gl_kind = clk_ordinary;
1569 else
1570 gl_kind = clk_rvalueref;
1572 else if (expr)
1573 gl_kind = lvalue_kind (expr);
1574 else if (CLASS_TYPE_P (from)
1575 || TREE_CODE (from) == ARRAY_TYPE)
1576 gl_kind = clk_class;
1577 else
1578 gl_kind = clk_none;
1580 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1581 if ((flags & LOOKUP_NO_TEMP_BIND)
1582 && (gl_kind & clk_class))
1583 gl_kind = clk_none;
1585 /* Same mask as real_lvalue_p. */
1586 is_lvalue = gl_kind && !(gl_kind & (clk_rvalueref|clk_class));
1588 tfrom = from;
1589 if ((gl_kind & clk_bitfield) != 0)
1590 tfrom = unlowered_expr_type (expr);
1592 /* Figure out whether or not the types are reference-related and
1593 reference compatible. We have to do this after stripping
1594 references from FROM. */
1595 related_p = reference_related_p (to, tfrom);
1596 /* If this is a C cast, first convert to an appropriately qualified
1597 type, so that we can later do a const_cast to the desired type. */
1598 if (related_p && c_cast_p
1599 && !at_least_as_qualified_p (to, tfrom))
1600 to = cp_build_qualified_type (to, cp_type_quals (tfrom));
1601 compatible_p = reference_compatible_p (to, tfrom);
1603 /* Directly bind reference when target expression's type is compatible with
1604 the reference and expression is an lvalue. In DR391, the wording in
1605 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1606 const and rvalue references to rvalues of compatible class type.
1607 We should also do direct bindings for non-class xvalues. */
1608 if ((related_p || compatible_p) && gl_kind)
1610 /* [dcl.init.ref]
1612 If the initializer expression
1614 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1615 is reference-compatible with "cv2 T2,"
1617 the reference is bound directly to the initializer expression
1618 lvalue.
1620 [...]
1621 If the initializer expression is an rvalue, with T2 a class type,
1622 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1623 is bound to the object represented by the rvalue or to a sub-object
1624 within that object. */
1626 conv = build_identity_conv (tfrom, expr);
1627 conv = direct_reference_binding (rto, conv);
1629 if (flags & LOOKUP_PREFER_RVALUE)
1630 /* The top-level caller requested that we pretend that the lvalue
1631 be treated as an rvalue. */
1632 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
1633 else if (TREE_CODE (rfrom) == REFERENCE_TYPE)
1634 /* Handle rvalue reference to function properly. */
1635 conv->rvaluedness_matches_p
1636 = (TYPE_REF_IS_RVALUE (rto) == TYPE_REF_IS_RVALUE (rfrom));
1637 else
1638 conv->rvaluedness_matches_p
1639 = (TYPE_REF_IS_RVALUE (rto) == !is_lvalue);
1641 if ((gl_kind & clk_bitfield) != 0
1642 || ((gl_kind & clk_packed) != 0 && !TYPE_PACKED (to)))
1643 /* For the purposes of overload resolution, we ignore the fact
1644 this expression is a bitfield or packed field. (In particular,
1645 [over.ics.ref] says specifically that a function with a
1646 non-const reference parameter is viable even if the
1647 argument is a bitfield.)
1649 However, when we actually call the function we must create
1650 a temporary to which to bind the reference. If the
1651 reference is volatile, or isn't const, then we cannot make
1652 a temporary, so we just issue an error when the conversion
1653 actually occurs. */
1654 conv->need_temporary_p = true;
1656 /* Don't allow binding of lvalues (other than function lvalues) to
1657 rvalue references. */
1658 if (is_lvalue && TYPE_REF_IS_RVALUE (rto)
1659 && TREE_CODE (to) != FUNCTION_TYPE
1660 && !(flags & LOOKUP_PREFER_RVALUE))
1661 conv->bad_p = true;
1663 /* Nor the reverse. */
1664 if (!is_lvalue && !TYPE_REF_IS_RVALUE (rto)
1665 && (!CP_TYPE_CONST_NON_VOLATILE_P (to)
1666 || (flags & LOOKUP_NO_RVAL_BIND))
1667 && TREE_CODE (to) != FUNCTION_TYPE)
1668 conv->bad_p = true;
1670 if (!compatible_p)
1671 conv->bad_p = true;
1673 return conv;
1675 /* [class.conv.fct] A conversion function is never used to convert a
1676 (possibly cv-qualified) object to the (possibly cv-qualified) same
1677 object type (or a reference to it), to a (possibly cv-qualified) base
1678 class of that type (or a reference to it).... */
1679 else if (CLASS_TYPE_P (from) && !related_p
1680 && !(flags & LOOKUP_NO_CONVERSION))
1682 /* [dcl.init.ref]
1684 If the initializer expression
1686 -- has a class type (i.e., T2 is a class type) can be
1687 implicitly converted to an lvalue of type "cv3 T3," where
1688 "cv1 T1" is reference-compatible with "cv3 T3". (this
1689 conversion is selected by enumerating the applicable
1690 conversion functions (_over.match.ref_) and choosing the
1691 best one through overload resolution. (_over.match_).
1693 the reference is bound to the lvalue result of the conversion
1694 in the second case. */
1695 z_candidate *cand = build_user_type_conversion_1 (rto, expr, flags,
1696 complain);
1697 if (cand)
1698 return cand->second_conv;
1701 /* From this point on, we conceptually need temporaries, even if we
1702 elide them. Only the cases above are "direct bindings". */
1703 if (flags & LOOKUP_NO_TEMP_BIND)
1704 return NULL;
1706 /* [over.ics.rank]
1708 When a parameter of reference type is not bound directly to an
1709 argument expression, the conversion sequence is the one required
1710 to convert the argument expression to the underlying type of the
1711 reference according to _over.best.ics_. Conceptually, this
1712 conversion sequence corresponds to copy-initializing a temporary
1713 of the underlying type with the argument expression. Any
1714 difference in top-level cv-qualification is subsumed by the
1715 initialization itself and does not constitute a conversion. */
1717 /* [dcl.init.ref]
1719 Otherwise, the reference shall be an lvalue reference to a
1720 non-volatile const type, or the reference shall be an rvalue
1721 reference.
1723 We try below to treat this as a bad conversion to improve diagnostics,
1724 but if TO is an incomplete class, we need to reject this conversion
1725 now to avoid unnecessary instantiation. */
1726 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto)
1727 && !COMPLETE_TYPE_P (to))
1728 return NULL;
1730 /* We're generating a temporary now, but don't bind any more in the
1731 conversion (specifically, don't slice the temporary returned by a
1732 conversion operator). */
1733 flags |= LOOKUP_NO_TEMP_BIND;
1735 /* Core issue 899: When [copy-]initializing a temporary to be bound
1736 to the first parameter of a copy constructor (12.8) called with
1737 a single argument in the context of direct-initialization,
1738 explicit conversion functions are also considered.
1740 So don't set LOOKUP_ONLYCONVERTING in that case. */
1741 if (!(flags & LOOKUP_COPY_PARM))
1742 flags |= LOOKUP_ONLYCONVERTING;
1744 if (!conv)
1745 conv = implicit_conversion (to, from, expr, c_cast_p,
1746 flags, complain);
1747 if (!conv)
1748 return NULL;
1750 if (conv->user_conv_p)
1752 /* If initializing the temporary used a conversion function,
1753 recalculate the second conversion sequence. */
1754 for (conversion *t = conv; t; t = next_conversion (t))
1755 if (t->kind == ck_user
1756 && DECL_CONV_FN_P (t->cand->fn))
1758 tree ftype = TREE_TYPE (TREE_TYPE (t->cand->fn));
1759 int sflags = (flags|LOOKUP_NO_CONVERSION)&~LOOKUP_NO_TEMP_BIND;
1760 conversion *new_second
1761 = reference_binding (rto, ftype, NULL_TREE, c_cast_p,
1762 sflags, complain);
1763 if (!new_second)
1764 return NULL;
1765 return merge_conversion_sequences (t, new_second);
1769 conv = build_conv (ck_ref_bind, rto, conv);
1770 /* This reference binding, unlike those above, requires the
1771 creation of a temporary. */
1772 conv->need_temporary_p = true;
1773 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
1775 /* [dcl.init.ref]
1777 Otherwise, the reference shall be an lvalue reference to a
1778 non-volatile const type, or the reference shall be an rvalue
1779 reference. */
1780 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto))
1781 conv->bad_p = true;
1783 /* [dcl.init.ref]
1785 Otherwise, a temporary of type "cv1 T1" is created and
1786 initialized from the initializer expression using the rules for a
1787 non-reference copy initialization. If T1 is reference-related to
1788 T2, cv1 must be the same cv-qualification as, or greater
1789 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1790 if (related_p && !at_least_as_qualified_p (to, from))
1791 conv->bad_p = true;
1793 return conv;
1796 /* Returns the implicit conversion sequence (see [over.ics]) from type
1797 FROM to type TO. The optional expression EXPR may affect the
1798 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1799 true, this conversion is coming from a C-style cast. */
1801 static conversion *
1802 implicit_conversion (tree to, tree from, tree expr, bool c_cast_p,
1803 int flags, tsubst_flags_t complain)
1805 conversion *conv;
1807 if (from == error_mark_node || to == error_mark_node
1808 || expr == error_mark_node)
1809 return NULL;
1811 /* Other flags only apply to the primary function in overload
1812 resolution, or after we've chosen one. */
1813 flags &= (LOOKUP_ONLYCONVERTING|LOOKUP_NO_CONVERSION|LOOKUP_COPY_PARM
1814 |LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND|LOOKUP_PREFER_RVALUE
1815 |LOOKUP_NO_NARROWING|LOOKUP_PROTECT|LOOKUP_NO_NON_INTEGRAL);
1817 /* FIXME: actually we don't want warnings either, but we can't just
1818 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1819 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1820 We really ought not to issue that warning until we've committed
1821 to that conversion. */
1822 complain &= ~tf_error;
1824 /* Call reshape_init early to remove redundant braces. */
1825 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr)
1826 && CLASS_TYPE_P (to)
1827 && COMPLETE_TYPE_P (complete_type (to))
1828 && !CLASSTYPE_NON_AGGREGATE (to))
1830 expr = reshape_init (to, expr, complain);
1831 if (expr == error_mark_node)
1832 return NULL;
1833 from = TREE_TYPE (expr);
1836 if (TREE_CODE (to) == REFERENCE_TYPE)
1837 conv = reference_binding (to, from, expr, c_cast_p, flags, complain);
1838 else
1839 conv = standard_conversion (to, from, expr, c_cast_p, flags, complain);
1841 if (conv)
1842 return conv;
1844 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1846 if (is_std_init_list (to))
1847 return build_list_conv (to, expr, flags, complain);
1849 /* As an extension, allow list-initialization of _Complex. */
1850 if (TREE_CODE (to) == COMPLEX_TYPE)
1852 conv = build_complex_conv (to, expr, flags, complain);
1853 if (conv)
1854 return conv;
1857 /* Allow conversion from an initializer-list with one element to a
1858 scalar type. */
1859 if (SCALAR_TYPE_P (to))
1861 int nelts = CONSTRUCTOR_NELTS (expr);
1862 tree elt;
1864 if (nelts == 0)
1865 elt = build_value_init (to, tf_none);
1866 else if (nelts == 1)
1867 elt = CONSTRUCTOR_ELT (expr, 0)->value;
1868 else
1869 elt = error_mark_node;
1871 conv = implicit_conversion (to, TREE_TYPE (elt), elt,
1872 c_cast_p, flags, complain);
1873 if (conv)
1875 conv->check_narrowing = true;
1876 if (BRACE_ENCLOSED_INITIALIZER_P (elt))
1877 /* Too many levels of braces, i.e. '{{1}}'. */
1878 conv->bad_p = true;
1879 return conv;
1882 else if (TREE_CODE (to) == ARRAY_TYPE)
1883 return build_array_conv (to, expr, flags, complain);
1886 if (expr != NULL_TREE
1887 && (MAYBE_CLASS_TYPE_P (from)
1888 || MAYBE_CLASS_TYPE_P (to))
1889 && (flags & LOOKUP_NO_CONVERSION) == 0)
1891 struct z_candidate *cand;
1893 if (CLASS_TYPE_P (to)
1894 && BRACE_ENCLOSED_INITIALIZER_P (expr)
1895 && !CLASSTYPE_NON_AGGREGATE (complete_type (to)))
1896 return build_aggr_conv (to, expr, flags, complain);
1898 cand = build_user_type_conversion_1 (to, expr, flags, complain);
1899 if (cand)
1901 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
1902 && CONSTRUCTOR_NELTS (expr) == 1
1903 && !is_list_ctor (cand->fn))
1905 /* "If C is not an initializer-list constructor and the
1906 initializer list has a single element of type cv U, where U is
1907 X or a class derived from X, the implicit conversion sequence
1908 has Exact Match rank if U is X, or Conversion rank if U is
1909 derived from X." */
1910 tree elt = CONSTRUCTOR_ELT (expr, 0)->value;
1911 tree elttype = TREE_TYPE (elt);
1912 if (reference_related_p (to, elttype))
1913 return implicit_conversion (to, elttype, elt,
1914 c_cast_p, flags, complain);
1916 conv = cand->second_conv;
1919 /* We used to try to bind a reference to a temporary here, but that
1920 is now handled after the recursive call to this function at the end
1921 of reference_binding. */
1922 return conv;
1925 return NULL;
1928 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1929 functions. ARGS will not be changed until a single candidate is
1930 selected. */
1932 static struct z_candidate *
1933 add_candidate (struct z_candidate **candidates,
1934 tree fn, tree first_arg, const vec<tree, va_gc> *args,
1935 size_t num_convs, conversion **convs,
1936 tree access_path, tree conversion_path,
1937 int viable, struct rejection_reason *reason,
1938 int flags)
1940 struct z_candidate *cand = (struct z_candidate *)
1941 conversion_obstack_alloc (sizeof (struct z_candidate));
1943 cand->fn = fn;
1944 cand->first_arg = first_arg;
1945 cand->args = args;
1946 cand->convs = convs;
1947 cand->num_convs = num_convs;
1948 cand->access_path = access_path;
1949 cand->conversion_path = conversion_path;
1950 cand->viable = viable;
1951 cand->reason = reason;
1952 cand->next = *candidates;
1953 cand->flags = flags;
1954 *candidates = cand;
1956 return cand;
1959 /* Return the number of remaining arguments in the parameter list
1960 beginning with ARG. */
1963 remaining_arguments (tree arg)
1965 int n;
1967 for (n = 0; arg != NULL_TREE && arg != void_list_node;
1968 arg = TREE_CHAIN (arg))
1969 n++;
1971 return n;
1974 /* Create an overload candidate for the function or method FN called
1975 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1976 FLAGS is passed on to implicit_conversion.
1978 This does not change ARGS.
1980 CTYPE, if non-NULL, is the type we want to pretend this function
1981 comes from for purposes of overload resolution. */
1983 static struct z_candidate *
1984 add_function_candidate (struct z_candidate **candidates,
1985 tree fn, tree ctype, tree first_arg,
1986 const vec<tree, va_gc> *args, tree access_path,
1987 tree conversion_path, int flags,
1988 tsubst_flags_t complain)
1990 tree parmlist = TYPE_ARG_TYPES (TREE_TYPE (fn));
1991 int i, len;
1992 conversion **convs;
1993 tree parmnode;
1994 tree orig_first_arg = first_arg;
1995 int skip;
1996 int viable = 1;
1997 struct rejection_reason *reason = NULL;
1999 /* At this point we should not see any functions which haven't been
2000 explicitly declared, except for friend functions which will have
2001 been found using argument dependent lookup. */
2002 gcc_assert (!DECL_ANTICIPATED (fn) || DECL_HIDDEN_FRIEND_P (fn));
2004 /* The `this', `in_chrg' and VTT arguments to constructors are not
2005 considered in overload resolution. */
2006 if (DECL_CONSTRUCTOR_P (fn))
2008 parmlist = skip_artificial_parms_for (fn, parmlist);
2009 skip = num_artificial_parms_for (fn);
2010 if (skip > 0 && first_arg != NULL_TREE)
2012 --skip;
2013 first_arg = NULL_TREE;
2016 else
2017 skip = 0;
2019 len = vec_safe_length (args) - skip + (first_arg != NULL_TREE ? 1 : 0);
2020 convs = alloc_conversions (len);
2022 /* 13.3.2 - Viable functions [over.match.viable]
2023 First, to be a viable function, a candidate function shall have enough
2024 parameters to agree in number with the arguments in the list.
2026 We need to check this first; otherwise, checking the ICSes might cause
2027 us to produce an ill-formed template instantiation. */
2029 parmnode = parmlist;
2030 for (i = 0; i < len; ++i)
2032 if (parmnode == NULL_TREE || parmnode == void_list_node)
2033 break;
2034 parmnode = TREE_CHAIN (parmnode);
2037 if ((i < len && parmnode)
2038 || !sufficient_parms_p (parmnode))
2040 int remaining = remaining_arguments (parmnode);
2041 viable = 0;
2042 reason = arity_rejection (first_arg, i + remaining, len);
2045 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2046 parameter of type "reference to cv C" (including such a constructor
2047 instantiated from a template) is excluded from the set of candidate
2048 functions when used to construct an object of type D with an argument list
2049 containing a single argument if C is reference-related to D. */
2050 if (viable && len == 1 && parmlist && DECL_CONSTRUCTOR_P (fn)
2051 && flag_new_inheriting_ctors
2052 && DECL_INHERITED_CTOR (fn))
2054 tree ptype = non_reference (TREE_VALUE (parmlist));
2055 tree dtype = DECL_CONTEXT (fn);
2056 if (reference_related_p (ptype, dtype))
2058 viable = false;
2059 reason = inherited_ctor_rejection ();
2063 /* Second, for a function to be viable, its constraints must be
2064 satisfied. */
2065 if (flag_concepts && viable
2066 && !constraints_satisfied_p (fn))
2068 reason = constraint_failure (fn);
2069 viable = false;
2072 /* When looking for a function from a subobject from an implicit
2073 copy/move constructor/operator=, don't consider anything that takes (a
2074 reference to) an unrelated type. See c++/44909 and core 1092. */
2075 if (viable && parmlist && (flags & LOOKUP_DEFAULTED))
2077 if (DECL_CONSTRUCTOR_P (fn))
2078 i = 1;
2079 else if (DECL_ASSIGNMENT_OPERATOR_P (fn)
2080 && DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR)
2081 i = 2;
2082 else
2083 i = 0;
2084 if (i && len == i)
2086 parmnode = chain_index (i-1, parmlist);
2087 if (!reference_related_p (non_reference (TREE_VALUE (parmnode)),
2088 ctype))
2089 viable = 0;
2092 /* This only applies at the top level. */
2093 flags &= ~LOOKUP_DEFAULTED;
2096 if (! viable)
2097 goto out;
2099 /* Third, for F to be a viable function, there shall exist for each
2100 argument an implicit conversion sequence that converts that argument
2101 to the corresponding parameter of F. */
2103 parmnode = parmlist;
2105 for (i = 0; i < len; ++i)
2107 tree argtype, to_type;
2108 tree arg;
2109 conversion *t;
2110 int is_this;
2112 if (parmnode == void_list_node)
2113 break;
2115 if (i == 0 && first_arg != NULL_TREE)
2116 arg = first_arg;
2117 else
2118 arg = CONST_CAST_TREE (
2119 (*args)[i + skip - (first_arg != NULL_TREE ? 1 : 0)]);
2120 argtype = lvalue_type (arg);
2122 is_this = (i == 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
2123 && ! DECL_CONSTRUCTOR_P (fn));
2125 if (parmnode)
2127 tree parmtype = TREE_VALUE (parmnode);
2128 int lflags = flags;
2130 parmnode = TREE_CHAIN (parmnode);
2132 /* The type of the implicit object parameter ('this') for
2133 overload resolution is not always the same as for the
2134 function itself; conversion functions are considered to
2135 be members of the class being converted, and functions
2136 introduced by a using-declaration are considered to be
2137 members of the class that uses them.
2139 Since build_over_call ignores the ICS for the `this'
2140 parameter, we can just change the parm type. */
2141 if (ctype && is_this)
2143 parmtype = cp_build_qualified_type
2144 (ctype, cp_type_quals (TREE_TYPE (parmtype)));
2145 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn)))
2147 /* If the function has a ref-qualifier, the implicit
2148 object parameter has reference type. */
2149 bool rv = FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn));
2150 parmtype = cp_build_reference_type (parmtype, rv);
2151 /* The special handling of 'this' conversions in compare_ics
2152 does not apply if there is a ref-qualifier. */
2153 is_this = false;
2155 else
2157 parmtype = build_pointer_type (parmtype);
2158 arg = build_this (arg);
2159 argtype = lvalue_type (arg);
2163 /* Core issue 899: When [copy-]initializing a temporary to be bound
2164 to the first parameter of a copy constructor (12.8) called with
2165 a single argument in the context of direct-initialization,
2166 explicit conversion functions are also considered.
2168 So set LOOKUP_COPY_PARM to let reference_binding know that
2169 it's being called in that context. We generalize the above
2170 to handle move constructors and template constructors as well;
2171 the standardese should soon be updated similarly. */
2172 if (ctype && i == 0 && (len-skip == 1)
2173 && DECL_CONSTRUCTOR_P (fn)
2174 && parmtype != error_mark_node
2175 && (same_type_ignoring_top_level_qualifiers_p
2176 (non_reference (parmtype), ctype)))
2178 if (!(flags & LOOKUP_ONLYCONVERTING))
2179 lflags |= LOOKUP_COPY_PARM;
2180 /* We allow user-defined conversions within init-lists, but
2181 don't list-initialize the copy parm, as that would mean
2182 using two levels of braces for the same type. */
2183 if ((flags & LOOKUP_LIST_INIT_CTOR)
2184 && BRACE_ENCLOSED_INITIALIZER_P (arg))
2185 lflags |= LOOKUP_NO_CONVERSION;
2187 else
2188 lflags |= LOOKUP_ONLYCONVERTING;
2190 t = implicit_conversion (parmtype, argtype, arg,
2191 /*c_cast_p=*/false, lflags, complain);
2192 to_type = parmtype;
2194 else
2196 t = build_identity_conv (argtype, arg);
2197 t->ellipsis_p = true;
2198 to_type = argtype;
2201 if (t && is_this)
2202 t->this_p = true;
2204 convs[i] = t;
2205 if (! t)
2207 viable = 0;
2208 reason = arg_conversion_rejection (first_arg, i, argtype, to_type);
2209 break;
2212 if (t->bad_p)
2214 viable = -1;
2215 reason = bad_arg_conversion_rejection (first_arg, i, arg, to_type);
2219 out:
2220 return add_candidate (candidates, fn, orig_first_arg, args, len, convs,
2221 access_path, conversion_path, viable, reason, flags);
2224 /* Create an overload candidate for the conversion function FN which will
2225 be invoked for expression OBJ, producing a pointer-to-function which
2226 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2227 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2228 passed on to implicit_conversion.
2230 Actually, we don't really care about FN; we care about the type it
2231 converts to. There may be multiple conversion functions that will
2232 convert to that type, and we rely on build_user_type_conversion_1 to
2233 choose the best one; so when we create our candidate, we record the type
2234 instead of the function. */
2236 static struct z_candidate *
2237 add_conv_candidate (struct z_candidate **candidates, tree fn, tree obj,
2238 const vec<tree, va_gc> *arglist,
2239 tree access_path, tree conversion_path,
2240 tsubst_flags_t complain)
2242 tree totype = TREE_TYPE (TREE_TYPE (fn));
2243 int i, len, viable, flags;
2244 tree parmlist, parmnode;
2245 conversion **convs;
2246 struct rejection_reason *reason;
2248 for (parmlist = totype; TREE_CODE (parmlist) != FUNCTION_TYPE; )
2249 parmlist = TREE_TYPE (parmlist);
2250 parmlist = TYPE_ARG_TYPES (parmlist);
2252 len = vec_safe_length (arglist) + 1;
2253 convs = alloc_conversions (len);
2254 parmnode = parmlist;
2255 viable = 1;
2256 flags = LOOKUP_IMPLICIT;
2257 reason = NULL;
2259 /* Don't bother looking up the same type twice. */
2260 if (*candidates && (*candidates)->fn == totype)
2261 return NULL;
2263 for (i = 0; i < len; ++i)
2265 tree arg, argtype, convert_type = NULL_TREE;
2266 conversion *t;
2268 if (i == 0)
2269 arg = obj;
2270 else
2271 arg = (*arglist)[i - 1];
2272 argtype = lvalue_type (arg);
2274 if (i == 0)
2276 t = implicit_conversion (totype, argtype, arg, /*c_cast_p=*/false,
2277 flags, complain);
2278 convert_type = totype;
2280 else if (parmnode == void_list_node)
2281 break;
2282 else if (parmnode)
2284 t = implicit_conversion (TREE_VALUE (parmnode), argtype, arg,
2285 /*c_cast_p=*/false, flags, complain);
2286 convert_type = TREE_VALUE (parmnode);
2288 else
2290 t = build_identity_conv (argtype, arg);
2291 t->ellipsis_p = true;
2292 convert_type = argtype;
2295 convs[i] = t;
2296 if (! t)
2297 break;
2299 if (t->bad_p)
2301 viable = -1;
2302 reason = bad_arg_conversion_rejection (NULL_TREE, i, arg, convert_type);
2305 if (i == 0)
2306 continue;
2308 if (parmnode)
2309 parmnode = TREE_CHAIN (parmnode);
2312 if (i < len
2313 || ! sufficient_parms_p (parmnode))
2315 int remaining = remaining_arguments (parmnode);
2316 viable = 0;
2317 reason = arity_rejection (NULL_TREE, i + remaining, len);
2320 return add_candidate (candidates, totype, obj, arglist, len, convs,
2321 access_path, conversion_path, viable, reason, flags);
2324 static void
2325 build_builtin_candidate (struct z_candidate **candidates, tree fnname,
2326 tree type1, tree type2, tree *args, tree *argtypes,
2327 int flags, tsubst_flags_t complain)
2329 conversion *t;
2330 conversion **convs;
2331 size_t num_convs;
2332 int viable = 1, i;
2333 tree types[2];
2334 struct rejection_reason *reason = NULL;
2336 types[0] = type1;
2337 types[1] = type2;
2339 num_convs = args[2] ? 3 : (args[1] ? 2 : 1);
2340 convs = alloc_conversions (num_convs);
2342 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2343 conversion ops are allowed. We handle that here by just checking for
2344 boolean_type_node because other operators don't ask for it. COND_EXPR
2345 also does contextual conversion to bool for the first operand, but we
2346 handle that in build_conditional_expr, and type1 here is operand 2. */
2347 if (type1 != boolean_type_node)
2348 flags |= LOOKUP_ONLYCONVERTING;
2350 for (i = 0; i < 2; ++i)
2352 if (! args[i])
2353 break;
2355 t = implicit_conversion (types[i], argtypes[i], args[i],
2356 /*c_cast_p=*/false, flags, complain);
2357 if (! t)
2359 viable = 0;
2360 /* We need something for printing the candidate. */
2361 t = build_identity_conv (types[i], NULL_TREE);
2362 reason = arg_conversion_rejection (NULL_TREE, i, argtypes[i],
2363 types[i]);
2365 else if (t->bad_p)
2367 viable = 0;
2368 reason = bad_arg_conversion_rejection (NULL_TREE, i, args[i],
2369 types[i]);
2371 convs[i] = t;
2374 /* For COND_EXPR we rearranged the arguments; undo that now. */
2375 if (args[2])
2377 convs[2] = convs[1];
2378 convs[1] = convs[0];
2379 t = implicit_conversion (boolean_type_node, argtypes[2], args[2],
2380 /*c_cast_p=*/false, flags,
2381 complain);
2382 if (t)
2383 convs[0] = t;
2384 else
2386 viable = 0;
2387 reason = arg_conversion_rejection (NULL_TREE, 0, argtypes[2],
2388 boolean_type_node);
2392 add_candidate (candidates, fnname, /*first_arg=*/NULL_TREE, /*args=*/NULL,
2393 num_convs, convs,
2394 /*access_path=*/NULL_TREE,
2395 /*conversion_path=*/NULL_TREE,
2396 viable, reason, flags);
2399 static bool
2400 is_complete (tree t)
2402 return COMPLETE_TYPE_P (complete_type (t));
2405 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2407 static bool
2408 promoted_arithmetic_type_p (tree type)
2410 /* [over.built]
2412 In this section, the term promoted integral type is used to refer
2413 to those integral types which are preserved by integral promotion
2414 (including e.g. int and long but excluding e.g. char).
2415 Similarly, the term promoted arithmetic type refers to promoted
2416 integral types plus floating types. */
2417 return ((CP_INTEGRAL_TYPE_P (type)
2418 && same_type_p (type_promotes_to (type), type))
2419 || TREE_CODE (type) == REAL_TYPE);
2422 /* Create any builtin operator overload candidates for the operator in
2423 question given the converted operand types TYPE1 and TYPE2. The other
2424 args are passed through from add_builtin_candidates to
2425 build_builtin_candidate.
2427 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2428 If CODE is requires candidates operands of the same type of the kind
2429 of which TYPE1 and TYPE2 are, we add both candidates
2430 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2432 static void
2433 add_builtin_candidate (struct z_candidate **candidates, enum tree_code code,
2434 enum tree_code code2, tree fnname, tree type1,
2435 tree type2, tree *args, tree *argtypes, int flags,
2436 tsubst_flags_t complain)
2438 switch (code)
2440 case POSTINCREMENT_EXPR:
2441 case POSTDECREMENT_EXPR:
2442 args[1] = integer_zero_node;
2443 type2 = integer_type_node;
2444 break;
2445 default:
2446 break;
2449 switch (code)
2452 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2453 and VQ is either volatile or empty, there exist candidate operator
2454 functions of the form
2455 VQ T& operator++(VQ T&);
2456 T operator++(VQ T&, int);
2457 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2458 type other than bool, and VQ is either volatile or empty, there exist
2459 candidate operator functions of the form
2460 VQ T& operator--(VQ T&);
2461 T operator--(VQ T&, int);
2462 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2463 complete object type, and VQ is either volatile or empty, there exist
2464 candidate operator functions of the form
2465 T*VQ& operator++(T*VQ&);
2466 T*VQ& operator--(T*VQ&);
2467 T* operator++(T*VQ&, int);
2468 T* operator--(T*VQ&, int); */
2470 case POSTDECREMENT_EXPR:
2471 case PREDECREMENT_EXPR:
2472 if (TREE_CODE (type1) == BOOLEAN_TYPE)
2473 return;
2474 /* FALLTHRU */
2475 case POSTINCREMENT_EXPR:
2476 case PREINCREMENT_EXPR:
2477 if (ARITHMETIC_TYPE_P (type1) || TYPE_PTROB_P (type1))
2479 type1 = build_reference_type (type1);
2480 break;
2482 return;
2484 /* 7 For every cv-qualified or cv-unqualified object type T, there
2485 exist candidate operator functions of the form
2487 T& operator*(T*);
2489 8 For every function type T, there exist candidate operator functions of
2490 the form
2491 T& operator*(T*); */
2493 case INDIRECT_REF:
2494 if (TYPE_PTR_P (type1)
2495 && (TYPE_PTROB_P (type1)
2496 || TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE))
2497 break;
2498 return;
2500 /* 9 For every type T, there exist candidate operator functions of the form
2501 T* operator+(T*);
2503 10For every promoted arithmetic type T, there exist candidate operator
2504 functions of the form
2505 T operator+(T);
2506 T operator-(T); */
2508 case UNARY_PLUS_EXPR: /* unary + */
2509 if (TYPE_PTR_P (type1))
2510 break;
2511 /* FALLTHRU */
2512 case NEGATE_EXPR:
2513 if (ARITHMETIC_TYPE_P (type1))
2514 break;
2515 return;
2517 /* 11For every promoted integral type T, there exist candidate operator
2518 functions of the form
2519 T operator~(T); */
2521 case BIT_NOT_EXPR:
2522 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1))
2523 break;
2524 return;
2526 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2527 is the same type as C2 or is a derived class of C2, T is a complete
2528 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2529 there exist candidate operator functions of the form
2530 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2531 where CV12 is the union of CV1 and CV2. */
2533 case MEMBER_REF:
2534 if (TYPE_PTR_P (type1) && TYPE_PTRMEM_P (type2))
2536 tree c1 = TREE_TYPE (type1);
2537 tree c2 = TYPE_PTRMEM_CLASS_TYPE (type2);
2539 if (MAYBE_CLASS_TYPE_P (c1) && DERIVED_FROM_P (c2, c1)
2540 && (TYPE_PTRMEMFUNC_P (type2)
2541 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2))))
2542 break;
2544 return;
2546 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2547 didate operator functions of the form
2548 LR operator*(L, R);
2549 LR operator/(L, R);
2550 LR operator+(L, R);
2551 LR operator-(L, R);
2552 bool operator<(L, R);
2553 bool operator>(L, R);
2554 bool operator<=(L, R);
2555 bool operator>=(L, R);
2556 bool operator==(L, R);
2557 bool operator!=(L, R);
2558 where LR is the result of the usual arithmetic conversions between
2559 types L and R.
2561 14For every pair of types T and I, where T is a cv-qualified or cv-
2562 unqualified complete object type and I is a promoted integral type,
2563 there exist candidate operator functions of the form
2564 T* operator+(T*, I);
2565 T& operator[](T*, I);
2566 T* operator-(T*, I);
2567 T* operator+(I, T*);
2568 T& operator[](I, T*);
2570 15For every T, where T is a pointer to complete object type, there exist
2571 candidate operator functions of the form112)
2572 ptrdiff_t operator-(T, T);
2574 16For every pointer or enumeration type T, there exist candidate operator
2575 functions of the form
2576 bool operator<(T, T);
2577 bool operator>(T, T);
2578 bool operator<=(T, T);
2579 bool operator>=(T, T);
2580 bool operator==(T, T);
2581 bool operator!=(T, T);
2583 17For every pointer to member type T, there exist candidate operator
2584 functions of the form
2585 bool operator==(T, T);
2586 bool operator!=(T, T); */
2588 case MINUS_EXPR:
2589 if (TYPE_PTROB_P (type1) && TYPE_PTROB_P (type2))
2590 break;
2591 if (TYPE_PTROB_P (type1)
2592 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2594 type2 = ptrdiff_type_node;
2595 break;
2597 /* FALLTHRU */
2598 case MULT_EXPR:
2599 case TRUNC_DIV_EXPR:
2600 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2601 break;
2602 return;
2604 case EQ_EXPR:
2605 case NE_EXPR:
2606 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2607 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2)))
2608 break;
2609 if (TYPE_PTRMEM_P (type1) && null_ptr_cst_p (args[1]))
2611 type2 = type1;
2612 break;
2614 if (TYPE_PTRMEM_P (type2) && null_ptr_cst_p (args[0]))
2616 type1 = type2;
2617 break;
2619 /* Fall through. */
2620 case LT_EXPR:
2621 case GT_EXPR:
2622 case LE_EXPR:
2623 case GE_EXPR:
2624 case MAX_EXPR:
2625 case MIN_EXPR:
2626 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2627 break;
2628 if (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2629 break;
2630 if (TREE_CODE (type1) == ENUMERAL_TYPE
2631 && TREE_CODE (type2) == ENUMERAL_TYPE)
2632 break;
2633 if (TYPE_PTR_P (type1)
2634 && null_ptr_cst_p (args[1]))
2636 type2 = type1;
2637 break;
2639 if (null_ptr_cst_p (args[0])
2640 && TYPE_PTR_P (type2))
2642 type1 = type2;
2643 break;
2645 return;
2647 case PLUS_EXPR:
2648 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2649 break;
2650 /* FALLTHRU */
2651 case ARRAY_REF:
2652 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && TYPE_PTROB_P (type2))
2654 type1 = ptrdiff_type_node;
2655 break;
2657 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2659 type2 = ptrdiff_type_node;
2660 break;
2662 return;
2664 /* 18For every pair of promoted integral types L and R, there exist candi-
2665 date operator functions of the form
2666 LR operator%(L, R);
2667 LR operator&(L, R);
2668 LR operator^(L, R);
2669 LR operator|(L, R);
2670 L operator<<(L, R);
2671 L operator>>(L, R);
2672 where LR is the result of the usual arithmetic conversions between
2673 types L and R. */
2675 case TRUNC_MOD_EXPR:
2676 case BIT_AND_EXPR:
2677 case BIT_IOR_EXPR:
2678 case BIT_XOR_EXPR:
2679 case LSHIFT_EXPR:
2680 case RSHIFT_EXPR:
2681 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2682 break;
2683 return;
2685 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2686 type, VQ is either volatile or empty, and R is a promoted arithmetic
2687 type, there exist candidate operator functions of the form
2688 VQ L& operator=(VQ L&, R);
2689 VQ L& operator*=(VQ L&, R);
2690 VQ L& operator/=(VQ L&, R);
2691 VQ L& operator+=(VQ L&, R);
2692 VQ L& operator-=(VQ L&, R);
2694 20For every pair T, VQ), where T is any type and VQ is either volatile
2695 or empty, there exist candidate operator functions of the form
2696 T*VQ& operator=(T*VQ&, T*);
2698 21For every pair T, VQ), where T is a pointer to member type and VQ is
2699 either volatile or empty, there exist candidate operator functions of
2700 the form
2701 VQ T& operator=(VQ T&, T);
2703 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2704 unqualified complete object type, VQ is either volatile or empty, and
2705 I is a promoted integral type, there exist candidate operator func-
2706 tions of the form
2707 T*VQ& operator+=(T*VQ&, I);
2708 T*VQ& operator-=(T*VQ&, I);
2710 23For every triple L, VQ, R), where L is an integral or enumeration
2711 type, VQ is either volatile or empty, and R is a promoted integral
2712 type, there exist candidate operator functions of the form
2714 VQ L& operator%=(VQ L&, R);
2715 VQ L& operator<<=(VQ L&, R);
2716 VQ L& operator>>=(VQ L&, R);
2717 VQ L& operator&=(VQ L&, R);
2718 VQ L& operator^=(VQ L&, R);
2719 VQ L& operator|=(VQ L&, R); */
2721 case MODIFY_EXPR:
2722 switch (code2)
2724 case PLUS_EXPR:
2725 case MINUS_EXPR:
2726 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2728 type2 = ptrdiff_type_node;
2729 break;
2731 /* FALLTHRU */
2732 case MULT_EXPR:
2733 case TRUNC_DIV_EXPR:
2734 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2735 break;
2736 return;
2738 case TRUNC_MOD_EXPR:
2739 case BIT_AND_EXPR:
2740 case BIT_IOR_EXPR:
2741 case BIT_XOR_EXPR:
2742 case LSHIFT_EXPR:
2743 case RSHIFT_EXPR:
2744 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2745 break;
2746 return;
2748 case NOP_EXPR:
2749 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2750 break;
2751 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2752 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2753 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
2754 || ((TYPE_PTRMEMFUNC_P (type1)
2755 || TYPE_PTR_P (type1))
2756 && null_ptr_cst_p (args[1])))
2758 type2 = type1;
2759 break;
2761 return;
2763 default:
2764 gcc_unreachable ();
2766 type1 = build_reference_type (type1);
2767 break;
2769 case COND_EXPR:
2770 /* [over.built]
2772 For every pair of promoted arithmetic types L and R, there
2773 exist candidate operator functions of the form
2775 LR operator?(bool, L, R);
2777 where LR is the result of the usual arithmetic conversions
2778 between types L and R.
2780 For every type T, where T is a pointer or pointer-to-member
2781 type, there exist candidate operator functions of the form T
2782 operator?(bool, T, T); */
2784 if (promoted_arithmetic_type_p (type1)
2785 && promoted_arithmetic_type_p (type2))
2786 /* That's OK. */
2787 break;
2789 /* Otherwise, the types should be pointers. */
2790 if (!TYPE_PTR_OR_PTRMEM_P (type1) || !TYPE_PTR_OR_PTRMEM_P (type2))
2791 return;
2793 /* We don't check that the two types are the same; the logic
2794 below will actually create two candidates; one in which both
2795 parameter types are TYPE1, and one in which both parameter
2796 types are TYPE2. */
2797 break;
2799 case REALPART_EXPR:
2800 case IMAGPART_EXPR:
2801 if (ARITHMETIC_TYPE_P (type1))
2802 break;
2803 return;
2805 default:
2806 gcc_unreachable ();
2809 /* Make sure we don't create builtin candidates with dependent types. */
2810 bool u1 = uses_template_parms (type1);
2811 bool u2 = type2 ? uses_template_parms (type2) : false;
2812 if (u1 || u2)
2814 /* Try to recover if one of the types is non-dependent. But if
2815 there's only one type, there's nothing we can do. */
2816 if (!type2)
2817 return;
2818 /* And we lose if both are dependent. */
2819 if (u1 && u2)
2820 return;
2821 /* Or if they have different forms. */
2822 if (TREE_CODE (type1) != TREE_CODE (type2))
2823 return;
2825 if (u1 && !u2)
2826 type1 = type2;
2827 else if (u2 && !u1)
2828 type2 = type1;
2831 /* If we're dealing with two pointer types or two enumeral types,
2832 we need candidates for both of them. */
2833 if (type2 && !same_type_p (type1, type2)
2834 && TREE_CODE (type1) == TREE_CODE (type2)
2835 && (TREE_CODE (type1) == REFERENCE_TYPE
2836 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2837 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
2838 || TYPE_PTRMEMFUNC_P (type1)
2839 || MAYBE_CLASS_TYPE_P (type1)
2840 || TREE_CODE (type1) == ENUMERAL_TYPE))
2842 if (TYPE_PTR_OR_PTRMEM_P (type1))
2844 tree cptype = composite_pointer_type (type1, type2,
2845 error_mark_node,
2846 error_mark_node,
2847 CPO_CONVERSION,
2848 tf_none);
2849 if (cptype != error_mark_node)
2851 build_builtin_candidate
2852 (candidates, fnname, cptype, cptype, args, argtypes,
2853 flags, complain);
2854 return;
2858 build_builtin_candidate
2859 (candidates, fnname, type1, type1, args, argtypes, flags, complain);
2860 build_builtin_candidate
2861 (candidates, fnname, type2, type2, args, argtypes, flags, complain);
2862 return;
2865 build_builtin_candidate
2866 (candidates, fnname, type1, type2, args, argtypes, flags, complain);
2869 tree
2870 type_decays_to (tree type)
2872 if (TREE_CODE (type) == ARRAY_TYPE)
2873 return build_pointer_type (TREE_TYPE (type));
2874 if (TREE_CODE (type) == FUNCTION_TYPE)
2875 return build_pointer_type (type);
2876 return type;
2879 /* There are three conditions of builtin candidates:
2881 1) bool-taking candidates. These are the same regardless of the input.
2882 2) pointer-pair taking candidates. These are generated for each type
2883 one of the input types converts to.
2884 3) arithmetic candidates. According to the standard, we should generate
2885 all of these, but I'm trying not to...
2887 Here we generate a superset of the possible candidates for this particular
2888 case. That is a subset of the full set the standard defines, plus some
2889 other cases which the standard disallows. add_builtin_candidate will
2890 filter out the invalid set. */
2892 static void
2893 add_builtin_candidates (struct z_candidate **candidates, enum tree_code code,
2894 enum tree_code code2, tree fnname, tree *args,
2895 int flags, tsubst_flags_t complain)
2897 int ref1, i;
2898 int enum_p = 0;
2899 tree type, argtypes[3], t;
2900 /* TYPES[i] is the set of possible builtin-operator parameter types
2901 we will consider for the Ith argument. */
2902 vec<tree, va_gc> *types[2];
2903 unsigned ix;
2905 for (i = 0; i < 3; ++i)
2907 if (args[i])
2908 argtypes[i] = unlowered_expr_type (args[i]);
2909 else
2910 argtypes[i] = NULL_TREE;
2913 switch (code)
2915 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2916 and VQ is either volatile or empty, there exist candidate operator
2917 functions of the form
2918 VQ T& operator++(VQ T&); */
2920 case POSTINCREMENT_EXPR:
2921 case PREINCREMENT_EXPR:
2922 case POSTDECREMENT_EXPR:
2923 case PREDECREMENT_EXPR:
2924 case MODIFY_EXPR:
2925 ref1 = 1;
2926 break;
2928 /* 24There also exist candidate operator functions of the form
2929 bool operator!(bool);
2930 bool operator&&(bool, bool);
2931 bool operator||(bool, bool); */
2933 case TRUTH_NOT_EXPR:
2934 build_builtin_candidate
2935 (candidates, fnname, boolean_type_node,
2936 NULL_TREE, args, argtypes, flags, complain);
2937 return;
2939 case TRUTH_ORIF_EXPR:
2940 case TRUTH_ANDIF_EXPR:
2941 build_builtin_candidate
2942 (candidates, fnname, boolean_type_node,
2943 boolean_type_node, args, argtypes, flags, complain);
2944 return;
2946 case ADDR_EXPR:
2947 case COMPOUND_EXPR:
2948 case COMPONENT_REF:
2949 return;
2951 case COND_EXPR:
2952 case EQ_EXPR:
2953 case NE_EXPR:
2954 case LT_EXPR:
2955 case LE_EXPR:
2956 case GT_EXPR:
2957 case GE_EXPR:
2958 enum_p = 1;
2959 /* Fall through. */
2961 default:
2962 ref1 = 0;
2965 types[0] = make_tree_vector ();
2966 types[1] = make_tree_vector ();
2968 for (i = 0; i < 2; ++i)
2970 if (! args[i])
2972 else if (MAYBE_CLASS_TYPE_P (argtypes[i]))
2974 tree convs;
2976 if (i == 0 && code == MODIFY_EXPR && code2 == NOP_EXPR)
2977 return;
2979 convs = lookup_conversions (argtypes[i]);
2981 if (code == COND_EXPR)
2983 if (lvalue_p (args[i]))
2984 vec_safe_push (types[i], build_reference_type (argtypes[i]));
2986 vec_safe_push (types[i], TYPE_MAIN_VARIANT (argtypes[i]));
2989 else if (! convs)
2990 return;
2992 for (; convs; convs = TREE_CHAIN (convs))
2994 type = TREE_TYPE (convs);
2996 if (i == 0 && ref1
2997 && (TREE_CODE (type) != REFERENCE_TYPE
2998 || CP_TYPE_CONST_P (TREE_TYPE (type))))
2999 continue;
3001 if (code == COND_EXPR && TREE_CODE (type) == REFERENCE_TYPE)
3002 vec_safe_push (types[i], type);
3004 type = non_reference (type);
3005 if (i != 0 || ! ref1)
3007 type = cv_unqualified (type_decays_to (type));
3008 if (enum_p && TREE_CODE (type) == ENUMERAL_TYPE)
3009 vec_safe_push (types[i], type);
3010 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
3011 type = type_promotes_to (type);
3014 if (! vec_member (type, types[i]))
3015 vec_safe_push (types[i], type);
3018 else
3020 if (code == COND_EXPR && lvalue_p (args[i]))
3021 vec_safe_push (types[i], build_reference_type (argtypes[i]));
3022 type = non_reference (argtypes[i]);
3023 if (i != 0 || ! ref1)
3025 type = cv_unqualified (type_decays_to (type));
3026 if (enum_p && UNSCOPED_ENUM_P (type))
3027 vec_safe_push (types[i], type);
3028 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
3029 type = type_promotes_to (type);
3031 vec_safe_push (types[i], type);
3035 /* Run through the possible parameter types of both arguments,
3036 creating candidates with those parameter types. */
3037 FOR_EACH_VEC_ELT_REVERSE (*(types[0]), ix, t)
3039 unsigned jx;
3040 tree u;
3042 if (!types[1]->is_empty ())
3043 FOR_EACH_VEC_ELT_REVERSE (*(types[1]), jx, u)
3044 add_builtin_candidate
3045 (candidates, code, code2, fnname, t,
3046 u, args, argtypes, flags, complain);
3047 else
3048 add_builtin_candidate
3049 (candidates, code, code2, fnname, t,
3050 NULL_TREE, args, argtypes, flags, complain);
3053 release_tree_vector (types[0]);
3054 release_tree_vector (types[1]);
3058 /* If TMPL can be successfully instantiated as indicated by
3059 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3061 TMPL is the template. EXPLICIT_TARGS are any explicit template
3062 arguments. ARGLIST is the arguments provided at the call-site.
3063 This does not change ARGLIST. The RETURN_TYPE is the desired type
3064 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3065 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3066 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3068 static struct z_candidate*
3069 add_template_candidate_real (struct z_candidate **candidates, tree tmpl,
3070 tree ctype, tree explicit_targs, tree first_arg,
3071 const vec<tree, va_gc> *arglist, tree return_type,
3072 tree access_path, tree conversion_path,
3073 int flags, tree obj, unification_kind_t strict,
3074 tsubst_flags_t complain)
3076 int ntparms = DECL_NTPARMS (tmpl);
3077 tree targs = make_tree_vec (ntparms);
3078 unsigned int len = vec_safe_length (arglist);
3079 unsigned int nargs = (first_arg == NULL_TREE ? 0 : 1) + len;
3080 unsigned int skip_without_in_chrg = 0;
3081 tree first_arg_without_in_chrg = first_arg;
3082 tree *args_without_in_chrg;
3083 unsigned int nargs_without_in_chrg;
3084 unsigned int ia, ix;
3085 tree arg;
3086 struct z_candidate *cand;
3087 tree fn;
3088 struct rejection_reason *reason = NULL;
3089 int errs;
3091 /* We don't do deduction on the in-charge parameter, the VTT
3092 parameter or 'this'. */
3093 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl))
3095 if (first_arg_without_in_chrg != NULL_TREE)
3096 first_arg_without_in_chrg = NULL_TREE;
3097 else if (return_type && strict == DEDUCE_CALL)
3098 /* We're deducing for a call to the result of a template conversion
3099 function, so the args don't contain 'this'; leave them alone. */;
3100 else
3101 ++skip_without_in_chrg;
3104 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl)
3105 || DECL_BASE_CONSTRUCTOR_P (tmpl))
3106 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl)))
3108 if (first_arg_without_in_chrg != NULL_TREE)
3109 first_arg_without_in_chrg = NULL_TREE;
3110 else
3111 ++skip_without_in_chrg;
3114 if (len < skip_without_in_chrg)
3115 return NULL;
3117 if (DECL_CONSTRUCTOR_P (tmpl) && nargs == 2
3118 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg),
3119 TREE_TYPE ((*arglist)[0])))
3121 /* 12.8/6 says, "A declaration of a constructor for a class X is
3122 ill-formed if its first parameter is of type (optionally cv-qualified)
3123 X and either there are no other parameters or else all other
3124 parameters have default arguments. A member function template is never
3125 instantiated to produce such a constructor signature."
3127 So if we're trying to copy an object of the containing class, don't
3128 consider a template constructor that has a first parameter type that
3129 is just a template parameter, as we would deduce a signature that we
3130 would then reject in the code below. */
3131 if (tree firstparm = FUNCTION_FIRST_USER_PARMTYPE (tmpl))
3133 firstparm = TREE_VALUE (firstparm);
3134 if (PACK_EXPANSION_P (firstparm))
3135 firstparm = PACK_EXPANSION_PATTERN (firstparm);
3136 if (TREE_CODE (firstparm) == TEMPLATE_TYPE_PARM)
3138 gcc_assert (!explicit_targs);
3139 reason = invalid_copy_with_fn_template_rejection ();
3140 goto fail;
3145 nargs_without_in_chrg = ((first_arg_without_in_chrg != NULL_TREE ? 1 : 0)
3146 + (len - skip_without_in_chrg));
3147 args_without_in_chrg = XALLOCAVEC (tree, nargs_without_in_chrg);
3148 ia = 0;
3149 if (first_arg_without_in_chrg != NULL_TREE)
3151 args_without_in_chrg[ia] = first_arg_without_in_chrg;
3152 ++ia;
3154 for (ix = skip_without_in_chrg;
3155 vec_safe_iterate (arglist, ix, &arg);
3156 ++ix)
3158 args_without_in_chrg[ia] = arg;
3159 ++ia;
3161 gcc_assert (ia == nargs_without_in_chrg);
3163 errs = errorcount+sorrycount;
3164 fn = fn_type_unification (tmpl, explicit_targs, targs,
3165 args_without_in_chrg,
3166 nargs_without_in_chrg,
3167 return_type, strict, flags, false,
3168 complain & tf_decltype);
3170 if (fn == error_mark_node)
3172 /* Don't repeat unification later if it already resulted in errors. */
3173 if (errorcount+sorrycount == errs)
3174 reason = template_unification_rejection (tmpl, explicit_targs,
3175 targs, args_without_in_chrg,
3176 nargs_without_in_chrg,
3177 return_type, strict, flags);
3178 else
3179 reason = template_unification_error_rejection ();
3180 goto fail;
3183 if (DECL_CONSTRUCTOR_P (fn) && nargs == 2)
3185 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (fn);
3186 if (arg_types && same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types)),
3187 ctype))
3189 /* We're trying to produce a constructor with a prohibited signature,
3190 as discussed above; handle here any cases we didn't catch then,
3191 such as X(X<T>). */
3192 reason = invalid_copy_with_fn_template_rejection ();
3193 goto fail;
3197 if (obj != NULL_TREE)
3198 /* Aha, this is a conversion function. */
3199 cand = add_conv_candidate (candidates, fn, obj, arglist,
3200 access_path, conversion_path, complain);
3201 else
3202 cand = add_function_candidate (candidates, fn, ctype,
3203 first_arg, arglist, access_path,
3204 conversion_path, flags, complain);
3205 if (DECL_TI_TEMPLATE (fn) != tmpl)
3206 /* This situation can occur if a member template of a template
3207 class is specialized. Then, instantiate_template might return
3208 an instantiation of the specialization, in which case the
3209 DECL_TI_TEMPLATE field will point at the original
3210 specialization. For example:
3212 template <class T> struct S { template <class U> void f(U);
3213 template <> void f(int) {}; };
3214 S<double> sd;
3215 sd.f(3);
3217 Here, TMPL will be template <class U> S<double>::f(U).
3218 And, instantiate template will give us the specialization
3219 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3220 for this will point at template <class T> template <> S<T>::f(int),
3221 so that we can find the definition. For the purposes of
3222 overload resolution, however, we want the original TMPL. */
3223 cand->template_decl = build_template_info (tmpl, targs);
3224 else
3225 cand->template_decl = DECL_TEMPLATE_INFO (fn);
3226 cand->explicit_targs = explicit_targs;
3228 return cand;
3229 fail:
3230 return add_candidate (candidates, tmpl, first_arg, arglist, nargs, NULL,
3231 access_path, conversion_path, 0, reason, flags);
3235 static struct z_candidate *
3236 add_template_candidate (struct z_candidate **candidates, tree tmpl, tree ctype,
3237 tree explicit_targs, tree first_arg,
3238 const vec<tree, va_gc> *arglist, tree return_type,
3239 tree access_path, tree conversion_path, int flags,
3240 unification_kind_t strict, tsubst_flags_t complain)
3242 return
3243 add_template_candidate_real (candidates, tmpl, ctype,
3244 explicit_targs, first_arg, arglist,
3245 return_type, access_path, conversion_path,
3246 flags, NULL_TREE, strict, complain);
3249 /* Create an overload candidate for the conversion function template TMPL,
3250 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3251 pointer-to-function which will in turn be called with the argument list
3252 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3253 passed on to implicit_conversion. */
3255 static struct z_candidate *
3256 add_template_conv_candidate (struct z_candidate **candidates, tree tmpl,
3257 tree obj,
3258 const vec<tree, va_gc> *arglist,
3259 tree return_type, tree access_path,
3260 tree conversion_path, tsubst_flags_t complain)
3262 /* Making this work broke PR 71117, so until the committee resolves core
3263 issue 2189, let's disable this candidate if there are any viable call
3264 operators. */
3265 if (any_strictly_viable (*candidates))
3266 return NULL;
3268 return
3269 add_template_candidate_real (candidates, tmpl, NULL_TREE, NULL_TREE,
3270 NULL_TREE, arglist, return_type, access_path,
3271 conversion_path, 0, obj, DEDUCE_CALL,
3272 complain);
3275 /* The CANDS are the set of candidates that were considered for
3276 overload resolution. Return the set of viable candidates, or CANDS
3277 if none are viable. If any of the candidates were viable, set
3278 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3279 considered viable only if it is strictly viable. */
3281 static struct z_candidate*
3282 splice_viable (struct z_candidate *cands,
3283 bool strict_p,
3284 bool *any_viable_p)
3286 struct z_candidate *viable;
3287 struct z_candidate **last_viable;
3288 struct z_candidate **cand;
3289 bool found_strictly_viable = false;
3291 /* Be strict inside templates, since build_over_call won't actually
3292 do the conversions to get pedwarns. */
3293 if (processing_template_decl)
3294 strict_p = true;
3296 viable = NULL;
3297 last_viable = &viable;
3298 *any_viable_p = false;
3300 cand = &cands;
3301 while (*cand)
3303 struct z_candidate *c = *cand;
3304 if (!strict_p
3305 && (c->viable == 1 || TREE_CODE (c->fn) == TEMPLATE_DECL))
3307 /* Be strict in the presence of a viable candidate. Also if
3308 there are template candidates, so that we get deduction errors
3309 for them instead of silently preferring a bad conversion. */
3310 strict_p = true;
3311 if (viable && !found_strictly_viable)
3313 /* Put any spliced near matches back onto the main list so
3314 that we see them if there is no strict match. */
3315 *any_viable_p = false;
3316 *last_viable = cands;
3317 cands = viable;
3318 viable = NULL;
3319 last_viable = &viable;
3323 if (strict_p ? c->viable == 1 : c->viable)
3325 *last_viable = c;
3326 *cand = c->next;
3327 c->next = NULL;
3328 last_viable = &c->next;
3329 *any_viable_p = true;
3330 if (c->viable == 1)
3331 found_strictly_viable = true;
3333 else
3334 cand = &c->next;
3337 return viable ? viable : cands;
3340 static bool
3341 any_strictly_viable (struct z_candidate *cands)
3343 for (; cands; cands = cands->next)
3344 if (cands->viable == 1)
3345 return true;
3346 return false;
3349 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3350 words, it is about to become the "this" pointer for a member
3351 function call. Take the address of the object. */
3353 static tree
3354 build_this (tree obj)
3356 /* In a template, we are only concerned about the type of the
3357 expression, so we can take a shortcut. */
3358 if (processing_template_decl)
3359 return build_address (obj);
3361 return cp_build_addr_expr (obj, tf_warning_or_error);
3364 /* Returns true iff functions are equivalent. Equivalent functions are
3365 not '==' only if one is a function-local extern function or if
3366 both are extern "C". */
3368 static inline int
3369 equal_functions (tree fn1, tree fn2)
3371 if (TREE_CODE (fn1) != TREE_CODE (fn2))
3372 return 0;
3373 if (TREE_CODE (fn1) == TEMPLATE_DECL)
3374 return fn1 == fn2;
3375 if (DECL_LOCAL_FUNCTION_P (fn1) || DECL_LOCAL_FUNCTION_P (fn2)
3376 || DECL_EXTERN_C_FUNCTION_P (fn1))
3377 return decls_match (fn1, fn2);
3378 return fn1 == fn2;
3381 /* Print information about a candidate being rejected due to INFO. */
3383 static void
3384 print_conversion_rejection (location_t loc, struct conversion_info *info)
3386 tree from = info->from;
3387 if (!TYPE_P (from))
3388 from = lvalue_type (from);
3389 if (info->n_arg == -1)
3391 /* Conversion of implicit `this' argument failed. */
3392 if (!TYPE_P (info->from))
3393 /* A bad conversion for 'this' must be discarding cv-quals. */
3394 inform (loc, " passing %qT as %<this%> "
3395 "argument discards qualifiers",
3396 from);
3397 else
3398 inform (loc, " no known conversion for implicit "
3399 "%<this%> parameter from %qT to %qT",
3400 from, info->to_type);
3402 else if (!TYPE_P (info->from))
3404 if (info->n_arg >= 0)
3405 inform (loc, " conversion of argument %d would be ill-formed:",
3406 info->n_arg + 1);
3407 perform_implicit_conversion (info->to_type, info->from,
3408 tf_warning_or_error);
3410 else if (info->n_arg == -2)
3411 /* Conversion of conversion function return value failed. */
3412 inform (loc, " no known conversion from %qT to %qT",
3413 from, info->to_type);
3414 else
3415 inform (loc, " no known conversion for argument %d from %qT to %qT",
3416 info->n_arg + 1, from, info->to_type);
3419 /* Print information about a candidate with WANT parameters and we found
3420 HAVE. */
3422 static void
3423 print_arity_information (location_t loc, unsigned int have, unsigned int want)
3425 inform_n (loc, want,
3426 " candidate expects %d argument, %d provided",
3427 " candidate expects %d arguments, %d provided",
3428 want, have);
3431 /* Print information about one overload candidate CANDIDATE. MSGSTR
3432 is the text to print before the candidate itself.
3434 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3435 to have been run through gettext by the caller. This wart makes
3436 life simpler in print_z_candidates and for the translators. */
3438 static void
3439 print_z_candidate (location_t loc, const char *msgstr,
3440 struct z_candidate *candidate)
3442 const char *msg = (msgstr == NULL
3443 ? ""
3444 : ACONCAT ((msgstr, " ", NULL)));
3445 tree fn = candidate->fn;
3446 if (flag_new_inheriting_ctors)
3447 fn = strip_inheriting_ctors (fn);
3448 location_t cloc = location_of (fn);
3450 if (identifier_p (fn))
3452 cloc = loc;
3453 if (candidate->num_convs == 3)
3454 inform (cloc, "%s%D(%T, %T, %T) <built-in>", msg, fn,
3455 candidate->convs[0]->type,
3456 candidate->convs[1]->type,
3457 candidate->convs[2]->type);
3458 else if (candidate->num_convs == 2)
3459 inform (cloc, "%s%D(%T, %T) <built-in>", msg, fn,
3460 candidate->convs[0]->type,
3461 candidate->convs[1]->type);
3462 else
3463 inform (cloc, "%s%D(%T) <built-in>", msg, fn,
3464 candidate->convs[0]->type);
3466 else if (TYPE_P (fn))
3467 inform (cloc, "%s%T <conversion>", msg, fn);
3468 else if (candidate->viable == -1)
3469 inform (cloc, "%s%#D <near match>", msg, fn);
3470 else if (DECL_DELETED_FN (fn))
3471 inform (cloc, "%s%#D <deleted>", msg, fn);
3472 else
3473 inform (cloc, "%s%#D", msg, fn);
3474 if (fn != candidate->fn)
3476 cloc = location_of (candidate->fn);
3477 inform (cloc, " inherited here");
3479 /* Give the user some information about why this candidate failed. */
3480 if (candidate->reason != NULL)
3482 struct rejection_reason *r = candidate->reason;
3484 switch (r->code)
3486 case rr_arity:
3487 print_arity_information (cloc, r->u.arity.actual,
3488 r->u.arity.expected);
3489 break;
3490 case rr_arg_conversion:
3491 print_conversion_rejection (cloc, &r->u.conversion);
3492 break;
3493 case rr_bad_arg_conversion:
3494 print_conversion_rejection (cloc, &r->u.bad_conversion);
3495 break;
3496 case rr_explicit_conversion:
3497 inform (cloc, " return type %qT of explicit conversion function "
3498 "cannot be converted to %qT with a qualification "
3499 "conversion", r->u.conversion.from,
3500 r->u.conversion.to_type);
3501 break;
3502 case rr_template_conversion:
3503 inform (cloc, " conversion from return type %qT of template "
3504 "conversion function specialization to %qT is not an "
3505 "exact match", r->u.conversion.from,
3506 r->u.conversion.to_type);
3507 break;
3508 case rr_template_unification:
3509 /* We use template_unification_error_rejection if unification caused
3510 actual non-SFINAE errors, in which case we don't need to repeat
3511 them here. */
3512 if (r->u.template_unification.tmpl == NULL_TREE)
3514 inform (cloc, " substitution of deduced template arguments "
3515 "resulted in errors seen above");
3516 break;
3518 /* Re-run template unification with diagnostics. */
3519 inform (cloc, " template argument deduction/substitution failed:");
3520 fn_type_unification (r->u.template_unification.tmpl,
3521 r->u.template_unification.explicit_targs,
3522 (make_tree_vec
3523 (r->u.template_unification.num_targs)),
3524 r->u.template_unification.args,
3525 r->u.template_unification.nargs,
3526 r->u.template_unification.return_type,
3527 r->u.template_unification.strict,
3528 r->u.template_unification.flags,
3529 true, false);
3530 break;
3531 case rr_invalid_copy:
3532 inform (cloc,
3533 " a constructor taking a single argument of its own "
3534 "class type is invalid");
3535 break;
3536 case rr_constraint_failure:
3538 tree tmpl = r->u.template_instantiation.tmpl;
3539 tree args = r->u.template_instantiation.targs;
3540 diagnose_constraints (cloc, tmpl, args);
3542 break;
3543 case rr_inherited_ctor:
3544 inform (cloc, " an inherited constructor is not a candidate for "
3545 "initialization from an expression of the same or derived "
3546 "type");
3547 break;
3548 case rr_none:
3549 default:
3550 /* This candidate didn't have any issues or we failed to
3551 handle a particular code. Either way... */
3552 gcc_unreachable ();
3557 static void
3558 print_z_candidates (location_t loc, struct z_candidate *candidates)
3560 struct z_candidate *cand1;
3561 struct z_candidate **cand2;
3563 if (!candidates)
3564 return;
3566 /* Remove non-viable deleted candidates. */
3567 cand1 = candidates;
3568 for (cand2 = &cand1; *cand2; )
3570 if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL
3571 && !(*cand2)->viable
3572 && DECL_DELETED_FN ((*cand2)->fn))
3573 *cand2 = (*cand2)->next;
3574 else
3575 cand2 = &(*cand2)->next;
3577 /* ...if there are any non-deleted ones. */
3578 if (cand1)
3579 candidates = cand1;
3581 /* There may be duplicates in the set of candidates. We put off
3582 checking this condition as long as possible, since we have no way
3583 to eliminate duplicates from a set of functions in less than n^2
3584 time. Now we are about to emit an error message, so it is more
3585 permissible to go slowly. */
3586 for (cand1 = candidates; cand1; cand1 = cand1->next)
3588 tree fn = cand1->fn;
3589 /* Skip builtin candidates and conversion functions. */
3590 if (!DECL_P (fn))
3591 continue;
3592 cand2 = &cand1->next;
3593 while (*cand2)
3595 if (DECL_P ((*cand2)->fn)
3596 && equal_functions (fn, (*cand2)->fn))
3597 *cand2 = (*cand2)->next;
3598 else
3599 cand2 = &(*cand2)->next;
3603 for (; candidates; candidates = candidates->next)
3604 print_z_candidate (loc, "candidate:", candidates);
3607 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3608 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3609 the result of the conversion function to convert it to the final
3610 desired type. Merge the two sequences into a single sequence,
3611 and return the merged sequence. */
3613 static conversion *
3614 merge_conversion_sequences (conversion *user_seq, conversion *std_seq)
3616 conversion **t;
3617 bool bad = user_seq->bad_p;
3619 gcc_assert (user_seq->kind == ck_user);
3621 /* Find the end of the second conversion sequence. */
3622 for (t = &std_seq; (*t)->kind != ck_identity; t = &((*t)->u.next))
3624 /* The entire sequence is a user-conversion sequence. */
3625 (*t)->user_conv_p = true;
3626 if (bad)
3627 (*t)->bad_p = true;
3630 /* Replace the identity conversion with the user conversion
3631 sequence. */
3632 *t = user_seq;
3634 return std_seq;
3637 /* Handle overload resolution for initializing an object of class type from
3638 an initializer list. First we look for a suitable constructor that
3639 takes a std::initializer_list; if we don't find one, we then look for a
3640 non-list constructor.
3642 Parameters are as for add_candidates, except that the arguments are in
3643 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3644 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3646 static void
3647 add_list_candidates (tree fns, tree first_arg,
3648 const vec<tree, va_gc> *args, tree totype,
3649 tree explicit_targs, bool template_only,
3650 tree conversion_path, tree access_path,
3651 int flags,
3652 struct z_candidate **candidates,
3653 tsubst_flags_t complain)
3655 gcc_assert (*candidates == NULL);
3657 /* We're looking for a ctor for list-initialization. */
3658 flags |= LOOKUP_LIST_INIT_CTOR;
3659 /* And we don't allow narrowing conversions. We also use this flag to
3660 avoid the copy constructor call for copy-list-initialization. */
3661 flags |= LOOKUP_NO_NARROWING;
3663 unsigned nart = num_artificial_parms_for (get_first_fn (fns)) - 1;
3664 tree init_list = (*args)[nart];
3666 /* Always use the default constructor if the list is empty (DR 990). */
3667 if (CONSTRUCTOR_NELTS (init_list) == 0
3668 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
3670 /* If the class has a list ctor, try passing the list as a single
3671 argument first, but only consider list ctors. */
3672 else if (TYPE_HAS_LIST_CTOR (totype))
3674 flags |= LOOKUP_LIST_ONLY;
3675 add_candidates (fns, first_arg, args, NULL_TREE,
3676 explicit_targs, template_only, conversion_path,
3677 access_path, flags, candidates, complain);
3678 if (any_strictly_viable (*candidates))
3679 return;
3682 /* Expand the CONSTRUCTOR into a new argument vec. */
3683 vec<tree, va_gc> *new_args;
3684 vec_alloc (new_args, nart + CONSTRUCTOR_NELTS (init_list));
3685 for (unsigned i = 0; i < nart; ++i)
3686 new_args->quick_push ((*args)[i]);
3687 for (unsigned i = 0; i < CONSTRUCTOR_NELTS (init_list); ++i)
3688 new_args->quick_push (CONSTRUCTOR_ELT (init_list, i)->value);
3690 /* We aren't looking for list-ctors anymore. */
3691 flags &= ~LOOKUP_LIST_ONLY;
3692 /* We allow more user-defined conversions within an init-list. */
3693 flags &= ~LOOKUP_NO_CONVERSION;
3695 add_candidates (fns, first_arg, new_args, NULL_TREE,
3696 explicit_targs, template_only, conversion_path,
3697 access_path, flags, candidates, complain);
3700 /* Returns the best overload candidate to perform the requested
3701 conversion. This function is used for three the overloading situations
3702 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3703 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3704 per [dcl.init.ref], so we ignore temporary bindings. */
3706 static struct z_candidate *
3707 build_user_type_conversion_1 (tree totype, tree expr, int flags,
3708 tsubst_flags_t complain)
3710 struct z_candidate *candidates, *cand;
3711 tree fromtype;
3712 tree ctors = NULL_TREE;
3713 tree conv_fns = NULL_TREE;
3714 conversion *conv = NULL;
3715 tree first_arg = NULL_TREE;
3716 vec<tree, va_gc> *args = NULL;
3717 bool any_viable_p;
3718 int convflags;
3720 if (!expr)
3721 return NULL;
3723 fromtype = TREE_TYPE (expr);
3725 /* We represent conversion within a hierarchy using RVALUE_CONV and
3726 BASE_CONV, as specified by [over.best.ics]; these become plain
3727 constructor calls, as specified in [dcl.init]. */
3728 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype) || !MAYBE_CLASS_TYPE_P (totype)
3729 || !DERIVED_FROM_P (totype, fromtype));
3731 if (MAYBE_CLASS_TYPE_P (totype))
3732 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3733 creating a garbage BASELINK; constructors can't be inherited. */
3734 ctors = lookup_fnfields_slot (totype, complete_ctor_identifier);
3736 /* FIXME P0135 doesn't say what to do in C++17 about list-initialization from
3737 a single element. For now, let's handle constructors as before and also
3738 consider conversion operators from the element. */
3739 if (cxx_dialect >= cxx1z
3740 && BRACE_ENCLOSED_INITIALIZER_P (expr)
3741 && CONSTRUCTOR_NELTS (expr) == 1)
3742 fromtype = TREE_TYPE (CONSTRUCTOR_ELT (expr, 0)->value);
3744 if (MAYBE_CLASS_TYPE_P (fromtype))
3746 tree to_nonref = non_reference (totype);
3747 if (same_type_ignoring_top_level_qualifiers_p (to_nonref, fromtype) ||
3748 (CLASS_TYPE_P (to_nonref) && CLASS_TYPE_P (fromtype)
3749 && DERIVED_FROM_P (to_nonref, fromtype)))
3751 /* [class.conv.fct] A conversion function is never used to
3752 convert a (possibly cv-qualified) object to the (possibly
3753 cv-qualified) same object type (or a reference to it), to a
3754 (possibly cv-qualified) base class of that type (or a
3755 reference to it)... */
3757 else
3758 conv_fns = lookup_conversions (fromtype);
3761 candidates = 0;
3762 flags |= LOOKUP_NO_CONVERSION;
3763 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3764 flags |= LOOKUP_NO_NARROWING;
3766 /* It's OK to bind a temporary for converting constructor arguments, but
3767 not in converting the return value of a conversion operator. */
3768 convflags = ((flags & LOOKUP_NO_TEMP_BIND) | LOOKUP_NO_CONVERSION
3769 | (flags & LOOKUP_NO_NARROWING));
3770 flags &= ~LOOKUP_NO_TEMP_BIND;
3772 if (ctors)
3774 int ctorflags = flags;
3776 first_arg = build_dummy_object (totype);
3778 /* We should never try to call the abstract or base constructor
3779 from here. */
3780 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors))
3781 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors)));
3783 args = make_tree_vector_single (expr);
3784 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3786 /* List-initialization. */
3787 add_list_candidates (ctors, first_arg, args, totype, NULL_TREE,
3788 false, TYPE_BINFO (totype), TYPE_BINFO (totype),
3789 ctorflags, &candidates, complain);
3791 else
3793 add_candidates (ctors, first_arg, args, NULL_TREE, NULL_TREE, false,
3794 TYPE_BINFO (totype), TYPE_BINFO (totype),
3795 ctorflags, &candidates, complain);
3798 for (cand = candidates; cand; cand = cand->next)
3800 cand->second_conv = build_identity_conv (totype, NULL_TREE);
3802 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3803 set, then this is copy-initialization. In that case, "The
3804 result of the call is then used to direct-initialize the
3805 object that is the destination of the copy-initialization."
3806 [dcl.init]
3808 We represent this in the conversion sequence with an
3809 rvalue conversion, which means a constructor call. */
3810 if (TREE_CODE (totype) != REFERENCE_TYPE
3811 && !(convflags & LOOKUP_NO_TEMP_BIND))
3812 cand->second_conv
3813 = build_conv (ck_rvalue, totype, cand->second_conv);
3817 if (conv_fns)
3819 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3820 /* FIXME see above about C++17. */
3821 first_arg = CONSTRUCTOR_ELT (expr, 0)->value;
3822 else
3823 first_arg = expr;
3826 for (; conv_fns; conv_fns = TREE_CHAIN (conv_fns))
3828 tree conversion_path = TREE_PURPOSE (conv_fns);
3829 struct z_candidate *old_candidates;
3831 /* If we are called to convert to a reference type, we are trying to
3832 find a direct binding, so don't even consider temporaries. If
3833 we don't find a direct binding, the caller will try again to
3834 look for a temporary binding. */
3835 if (TREE_CODE (totype) == REFERENCE_TYPE)
3836 convflags |= LOOKUP_NO_TEMP_BIND;
3838 old_candidates = candidates;
3839 add_candidates (TREE_VALUE (conv_fns), first_arg, NULL, totype,
3840 NULL_TREE, false,
3841 conversion_path, TYPE_BINFO (fromtype),
3842 flags, &candidates, complain);
3844 for (cand = candidates; cand != old_candidates; cand = cand->next)
3846 tree rettype = TREE_TYPE (TREE_TYPE (cand->fn));
3847 conversion *ics
3848 = implicit_conversion (totype,
3849 rettype,
3851 /*c_cast_p=*/false, convflags,
3852 complain);
3854 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3855 copy-initialization. In that case, "The result of the
3856 call is then used to direct-initialize the object that is
3857 the destination of the copy-initialization." [dcl.init]
3859 We represent this in the conversion sequence with an
3860 rvalue conversion, which means a constructor call. But
3861 don't add a second rvalue conversion if there's already
3862 one there. Which there really shouldn't be, but it's
3863 harmless since we'd add it here anyway. */
3864 if (ics && MAYBE_CLASS_TYPE_P (totype) && ics->kind != ck_rvalue
3865 && !(convflags & LOOKUP_NO_TEMP_BIND))
3866 ics = build_conv (ck_rvalue, totype, ics);
3868 cand->second_conv = ics;
3870 if (!ics)
3872 cand->viable = 0;
3873 cand->reason = arg_conversion_rejection (NULL_TREE, -2,
3874 rettype, totype);
3876 else if (DECL_NONCONVERTING_P (cand->fn)
3877 && ics->rank > cr_exact)
3879 /* 13.3.1.5: For direct-initialization, those explicit
3880 conversion functions that are not hidden within S and
3881 yield type T or a type that can be converted to type T
3882 with a qualification conversion (4.4) are also candidate
3883 functions. */
3884 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3885 I've raised this issue with the committee. --jason 9/2011 */
3886 cand->viable = -1;
3887 cand->reason = explicit_conversion_rejection (rettype, totype);
3889 else if (cand->viable == 1 && ics->bad_p)
3891 cand->viable = -1;
3892 cand->reason
3893 = bad_arg_conversion_rejection (NULL_TREE, -2,
3894 rettype, totype);
3896 else if (primary_template_instantiation_p (cand->fn)
3897 && ics->rank > cr_exact)
3899 /* 13.3.3.1.2: If the user-defined conversion is specified by
3900 a specialization of a conversion function template, the
3901 second standard conversion sequence shall have exact match
3902 rank. */
3903 cand->viable = -1;
3904 cand->reason = template_conversion_rejection (rettype, totype);
3909 candidates = splice_viable (candidates, false, &any_viable_p);
3910 if (!any_viable_p)
3912 if (args)
3913 release_tree_vector (args);
3914 return NULL;
3917 cand = tourney (candidates, complain);
3918 if (cand == 0)
3920 if (complain & tf_error)
3922 error ("conversion from %qT to %qT is ambiguous",
3923 fromtype, totype);
3924 print_z_candidates (location_of (expr), candidates);
3927 cand = candidates; /* any one will do */
3928 cand->second_conv = build_ambiguous_conv (totype, expr);
3929 cand->second_conv->user_conv_p = true;
3930 if (!any_strictly_viable (candidates))
3931 cand->second_conv->bad_p = true;
3932 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3933 ambiguous conversion is no worse than another user-defined
3934 conversion. */
3936 return cand;
3939 tree convtype;
3940 if (!DECL_CONSTRUCTOR_P (cand->fn))
3941 convtype = non_reference (TREE_TYPE (TREE_TYPE (cand->fn)));
3942 else if (cand->second_conv->kind == ck_rvalue)
3943 /* DR 5: [in the first step of copy-initialization]...if the function
3944 is a constructor, the call initializes a temporary of the
3945 cv-unqualified version of the destination type. */
3946 convtype = cv_unqualified (totype);
3947 else
3948 convtype = totype;
3949 /* Build the user conversion sequence. */
3950 conv = build_conv
3951 (ck_user,
3952 convtype,
3953 build_identity_conv (TREE_TYPE (expr), expr));
3954 conv->cand = cand;
3955 if (cand->viable == -1)
3956 conv->bad_p = true;
3958 /* Remember that this was a list-initialization. */
3959 if (flags & LOOKUP_NO_NARROWING)
3960 conv->check_narrowing = true;
3962 /* Combine it with the second conversion sequence. */
3963 cand->second_conv = merge_conversion_sequences (conv,
3964 cand->second_conv);
3966 return cand;
3969 /* Wrapper for above. */
3971 tree
3972 build_user_type_conversion (tree totype, tree expr, int flags,
3973 tsubst_flags_t complain)
3975 struct z_candidate *cand;
3976 tree ret;
3978 bool subtime = timevar_cond_start (TV_OVERLOAD);
3979 cand = build_user_type_conversion_1 (totype, expr, flags, complain);
3981 if (cand)
3983 if (cand->second_conv->kind == ck_ambig)
3984 ret = error_mark_node;
3985 else
3987 expr = convert_like (cand->second_conv, expr, complain);
3988 ret = convert_from_reference (expr);
3991 else
3992 ret = NULL_TREE;
3994 timevar_cond_stop (TV_OVERLOAD, subtime);
3995 return ret;
3998 /* Subroutine of convert_nontype_argument.
4000 EXPR is an argument for a template non-type parameter of integral or
4001 enumeration type. Do any necessary conversions (that are permitted for
4002 non-type arguments) to convert it to the parameter type.
4004 If conversion is successful, returns the converted expression;
4005 otherwise, returns error_mark_node. */
4007 tree
4008 build_integral_nontype_arg_conv (tree type, tree expr, tsubst_flags_t complain)
4010 conversion *conv;
4011 void *p;
4012 tree t;
4013 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
4015 if (error_operand_p (expr))
4016 return error_mark_node;
4018 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
4020 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4021 p = conversion_obstack_alloc (0);
4023 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
4024 /*c_cast_p=*/false,
4025 LOOKUP_IMPLICIT, complain);
4027 /* for a non-type template-parameter of integral or
4028 enumeration type, integral promotions (4.5) and integral
4029 conversions (4.7) are applied. */
4030 /* It should be sufficient to check the outermost conversion step, since
4031 there are no qualification conversions to integer type. */
4032 if (conv)
4033 switch (conv->kind)
4035 /* A conversion function is OK. If it isn't constexpr, we'll
4036 complain later that the argument isn't constant. */
4037 case ck_user:
4038 /* The lvalue-to-rvalue conversion is OK. */
4039 case ck_rvalue:
4040 case ck_identity:
4041 break;
4043 case ck_std:
4044 t = next_conversion (conv)->type;
4045 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t))
4046 break;
4048 if (complain & tf_error)
4049 error_at (loc, "conversion from %qT to %qT not considered for "
4050 "non-type template argument", t, type);
4051 /* fall through. */
4053 default:
4054 conv = NULL;
4055 break;
4058 if (conv)
4059 expr = convert_like (conv, expr, complain);
4060 else
4061 expr = error_mark_node;
4063 /* Free all the conversions we allocated. */
4064 obstack_free (&conversion_obstack, p);
4066 return expr;
4069 /* Do any initial processing on the arguments to a function call. */
4071 static vec<tree, va_gc> *
4072 resolve_args (vec<tree, va_gc> *args, tsubst_flags_t complain)
4074 unsigned int ix;
4075 tree arg;
4077 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
4079 if (error_operand_p (arg))
4080 return NULL;
4081 else if (VOID_TYPE_P (TREE_TYPE (arg)))
4083 if (complain & tf_error)
4084 error ("invalid use of void expression");
4085 return NULL;
4087 else if (invalid_nonstatic_memfn_p (input_location, arg, complain))
4088 return NULL;
4090 return args;
4093 /* Perform overload resolution on FN, which is called with the ARGS.
4095 Return the candidate function selected by overload resolution, or
4096 NULL if the event that overload resolution failed. In the case
4097 that overload resolution fails, *CANDIDATES will be the set of
4098 candidates considered, and ANY_VIABLE_P will be set to true or
4099 false to indicate whether or not any of the candidates were
4100 viable.
4102 The ARGS should already have gone through RESOLVE_ARGS before this
4103 function is called. */
4105 static struct z_candidate *
4106 perform_overload_resolution (tree fn,
4107 const vec<tree, va_gc> *args,
4108 struct z_candidate **candidates,
4109 bool *any_viable_p, tsubst_flags_t complain)
4111 struct z_candidate *cand;
4112 tree explicit_targs;
4113 int template_only;
4115 bool subtime = timevar_cond_start (TV_OVERLOAD);
4117 explicit_targs = NULL_TREE;
4118 template_only = 0;
4120 *candidates = NULL;
4121 *any_viable_p = true;
4123 /* Check FN. */
4124 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
4125 || TREE_CODE (fn) == TEMPLATE_DECL
4126 || TREE_CODE (fn) == OVERLOAD
4127 || TREE_CODE (fn) == TEMPLATE_ID_EXPR);
4129 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4131 explicit_targs = TREE_OPERAND (fn, 1);
4132 fn = TREE_OPERAND (fn, 0);
4133 template_only = 1;
4136 /* Add the various candidate functions. */
4137 add_candidates (fn, NULL_TREE, args, NULL_TREE,
4138 explicit_targs, template_only,
4139 /*conversion_path=*/NULL_TREE,
4140 /*access_path=*/NULL_TREE,
4141 LOOKUP_NORMAL,
4142 candidates, complain);
4144 *candidates = splice_viable (*candidates, false, any_viable_p);
4145 if (*any_viable_p)
4146 cand = tourney (*candidates, complain);
4147 else
4148 cand = NULL;
4150 timevar_cond_stop (TV_OVERLOAD, subtime);
4151 return cand;
4154 /* Print an error message about being unable to build a call to FN with
4155 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4156 be located; CANDIDATES is a possibly empty list of such
4157 functions. */
4159 static void
4160 print_error_for_call_failure (tree fn, vec<tree, va_gc> *args,
4161 struct z_candidate *candidates)
4163 tree targs = NULL_TREE;
4164 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4166 targs = TREE_OPERAND (fn, 1);
4167 fn = TREE_OPERAND (fn, 0);
4169 tree name = DECL_NAME (OVL_CURRENT (fn));
4170 location_t loc = location_of (name);
4171 if (targs)
4172 name = lookup_template_function (name, targs);
4174 if (!any_strictly_viable (candidates))
4175 error_at (loc, "no matching function for call to %<%D(%A)%>",
4176 name, build_tree_list_vec (args));
4177 else
4178 error_at (loc, "call of overloaded %<%D(%A)%> is ambiguous",
4179 name, build_tree_list_vec (args));
4180 if (candidates)
4181 print_z_candidates (loc, candidates);
4184 /* Return an expression for a call to FN (a namespace-scope function,
4185 or a static member function) with the ARGS. This may change
4186 ARGS. */
4188 tree
4189 build_new_function_call (tree fn, vec<tree, va_gc> **args, bool koenig_p,
4190 tsubst_flags_t complain)
4192 struct z_candidate *candidates, *cand;
4193 bool any_viable_p;
4194 void *p;
4195 tree result;
4197 if (args != NULL && *args != NULL)
4199 *args = resolve_args (*args, complain);
4200 if (*args == NULL)
4201 return error_mark_node;
4204 if (flag_tm)
4205 tm_malloc_replacement (fn);
4207 /* If this function was found without using argument dependent
4208 lookup, then we want to ignore any undeclared friend
4209 functions. */
4210 if (!koenig_p)
4212 tree orig_fn = fn;
4214 fn = remove_hidden_names (fn);
4215 if (!fn)
4217 if (complain & tf_error)
4218 print_error_for_call_failure (orig_fn, *args, NULL);
4219 return error_mark_node;
4223 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4224 p = conversion_obstack_alloc (0);
4226 cand = perform_overload_resolution (fn, *args, &candidates, &any_viable_p,
4227 complain);
4229 if (!cand)
4231 if (complain & tf_error)
4233 // If there is a single (non-viable) function candidate,
4234 // let the error be diagnosed by cp_build_function_call_vec.
4235 if (!any_viable_p && candidates && ! candidates->next
4236 && (TREE_CODE (candidates->fn) == FUNCTION_DECL))
4237 return cp_build_function_call_vec (candidates->fn, args, complain);
4239 // Otherwise, emit notes for non-viable candidates.
4240 print_error_for_call_failure (fn, *args, candidates);
4242 result = error_mark_node;
4244 else
4246 int flags = LOOKUP_NORMAL;
4247 /* If fn is template_id_expr, the call has explicit template arguments
4248 (e.g. func<int>(5)), communicate this info to build_over_call
4249 through flags so that later we can use it to decide whether to warn
4250 about peculiar null pointer conversion. */
4251 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4253 /* If overload resolution selects a specialization of a
4254 function concept for non-dependent template arguments,
4255 the expression is true if the constraints are satisfied
4256 and false otherwise.
4258 NOTE: This is an extension of Concepts Lite TS that
4259 allows constraints to be used in expressions. */
4260 if (flag_concepts && !processing_template_decl)
4262 tree tmpl = DECL_TI_TEMPLATE (cand->fn);
4263 tree targs = DECL_TI_ARGS (cand->fn);
4264 tree decl = DECL_TEMPLATE_RESULT (tmpl);
4265 if (DECL_DECLARED_CONCEPT_P (decl))
4266 return evaluate_function_concept (decl, targs);
4269 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
4272 result = build_over_call (cand, flags, complain);
4275 /* Free all the conversions we allocated. */
4276 obstack_free (&conversion_obstack, p);
4278 return result;
4281 /* Build a call to a global operator new. FNNAME is the name of the
4282 operator (either "operator new" or "operator new[]") and ARGS are
4283 the arguments provided. This may change ARGS. *SIZE points to the
4284 total number of bytes required by the allocation, and is updated if
4285 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4286 be used. If this function determines that no cookie should be
4287 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4288 is not NULL_TREE, it is evaluated before calculating the final
4289 array size, and if it fails, the array size is replaced with
4290 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4291 is non-NULL, it will be set, upon return, to the allocation
4292 function called. */
4294 tree
4295 build_operator_new_call (tree fnname, vec<tree, va_gc> **args,
4296 tree *size, tree *cookie_size,
4297 tree align_arg, tree size_check,
4298 tree *fn, tsubst_flags_t complain)
4300 tree original_size = *size;
4301 tree fns;
4302 struct z_candidate *candidates;
4303 struct z_candidate *cand = NULL;
4304 bool any_viable_p;
4306 if (fn)
4307 *fn = NULL_TREE;
4308 /* Set to (size_t)-1 if the size check fails. */
4309 if (size_check != NULL_TREE)
4311 tree errval = TYPE_MAX_VALUE (sizetype);
4312 if (cxx_dialect >= cxx11 && flag_exceptions)
4313 errval = throw_bad_array_new_length ();
4314 *size = fold_build3 (COND_EXPR, sizetype, size_check,
4315 original_size, errval);
4317 vec_safe_insert (*args, 0, *size);
4318 *args = resolve_args (*args, complain);
4319 if (*args == NULL)
4320 return error_mark_node;
4322 /* Based on:
4324 [expr.new]
4326 If this lookup fails to find the name, or if the allocated type
4327 is not a class type, the allocation function's name is looked
4328 up in the global scope.
4330 we disregard block-scope declarations of "operator new". */
4331 fns = lookup_function_nonclass (fnname, *args, /*block_p=*/false);
4333 if (align_arg)
4335 vec<tree, va_gc>* align_args
4336 = vec_copy_and_insert (*args, align_arg, 1);
4337 cand = perform_overload_resolution (fns, align_args, &candidates,
4338 &any_viable_p, tf_none);
4339 /* If no aligned allocation function matches, try again without the
4340 alignment. */
4343 /* Figure out what function is being called. */
4344 if (!cand)
4345 cand = perform_overload_resolution (fns, *args, &candidates, &any_viable_p,
4346 complain);
4348 /* If no suitable function could be found, issue an error message
4349 and give up. */
4350 if (!cand)
4352 if (complain & tf_error)
4353 print_error_for_call_failure (fns, *args, candidates);
4354 return error_mark_node;
4357 /* If a cookie is required, add some extra space. Whether
4358 or not a cookie is required cannot be determined until
4359 after we know which function was called. */
4360 if (*cookie_size)
4362 bool use_cookie = true;
4363 tree arg_types;
4365 arg_types = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
4366 /* Skip the size_t parameter. */
4367 arg_types = TREE_CHAIN (arg_types);
4368 /* Check the remaining parameters (if any). */
4369 if (arg_types
4370 && TREE_CHAIN (arg_types) == void_list_node
4371 && same_type_p (TREE_VALUE (arg_types),
4372 ptr_type_node))
4373 use_cookie = false;
4374 /* If we need a cookie, adjust the number of bytes allocated. */
4375 if (use_cookie)
4377 /* Update the total size. */
4378 *size = size_binop (PLUS_EXPR, original_size, *cookie_size);
4379 if (size_check)
4381 /* Set to (size_t)-1 if the size check fails. */
4382 gcc_assert (size_check != NULL_TREE);
4383 *size = fold_build3 (COND_EXPR, sizetype, size_check,
4384 *size, TYPE_MAX_VALUE (sizetype));
4386 /* Update the argument list to reflect the adjusted size. */
4387 (**args)[0] = *size;
4389 else
4390 *cookie_size = NULL_TREE;
4393 /* Tell our caller which function we decided to call. */
4394 if (fn)
4395 *fn = cand->fn;
4397 /* Build the CALL_EXPR. */
4398 return build_over_call (cand, LOOKUP_NORMAL, complain);
4401 /* Build a new call to operator(). This may change ARGS. */
4403 static tree
4404 build_op_call_1 (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
4406 struct z_candidate *candidates = 0, *cand;
4407 tree fns, convs, first_mem_arg = NULL_TREE;
4408 tree type = TREE_TYPE (obj);
4409 bool any_viable_p;
4410 tree result = NULL_TREE;
4411 void *p;
4413 if (error_operand_p (obj))
4414 return error_mark_node;
4416 obj = prep_operand (obj);
4418 if (TYPE_PTRMEMFUNC_P (type))
4420 if (complain & tf_error)
4421 /* It's no good looking for an overloaded operator() on a
4422 pointer-to-member-function. */
4423 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj);
4424 return error_mark_node;
4427 if (TYPE_BINFO (type))
4429 fns = lookup_fnfields (TYPE_BINFO (type), ansi_opname (CALL_EXPR), 1);
4430 if (fns == error_mark_node)
4431 return error_mark_node;
4433 else
4434 fns = NULL_TREE;
4436 if (args != NULL && *args != NULL)
4438 *args = resolve_args (*args, complain);
4439 if (*args == NULL)
4440 return error_mark_node;
4443 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4444 p = conversion_obstack_alloc (0);
4446 if (fns)
4448 first_mem_arg = obj;
4450 add_candidates (BASELINK_FUNCTIONS (fns),
4451 first_mem_arg, *args, NULL_TREE,
4452 NULL_TREE, false,
4453 BASELINK_BINFO (fns), BASELINK_ACCESS_BINFO (fns),
4454 LOOKUP_NORMAL, &candidates, complain);
4457 convs = lookup_conversions (type);
4459 for (; convs; convs = TREE_CHAIN (convs))
4461 tree fns = TREE_VALUE (convs);
4462 tree totype = TREE_TYPE (convs);
4464 if (TYPE_PTRFN_P (totype)
4465 || TYPE_REFFN_P (totype)
4466 || (TREE_CODE (totype) == REFERENCE_TYPE
4467 && TYPE_PTRFN_P (TREE_TYPE (totype))))
4468 for (; fns; fns = OVL_NEXT (fns))
4470 tree fn = OVL_CURRENT (fns);
4472 if (DECL_NONCONVERTING_P (fn))
4473 continue;
4475 if (TREE_CODE (fn) == TEMPLATE_DECL)
4476 add_template_conv_candidate
4477 (&candidates, fn, obj, *args, totype,
4478 /*access_path=*/NULL_TREE,
4479 /*conversion_path=*/NULL_TREE, complain);
4480 else
4481 add_conv_candidate (&candidates, fn, obj,
4482 *args, /*conversion_path=*/NULL_TREE,
4483 /*access_path=*/NULL_TREE, complain);
4487 /* Be strict here because if we choose a bad conversion candidate, the
4488 errors we get won't mention the call context. */
4489 candidates = splice_viable (candidates, true, &any_viable_p);
4490 if (!any_viable_p)
4492 if (complain & tf_error)
4494 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj),
4495 build_tree_list_vec (*args));
4496 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4498 result = error_mark_node;
4500 else
4502 cand = tourney (candidates, complain);
4503 if (cand == 0)
4505 if (complain & tf_error)
4507 error ("call of %<(%T) (%A)%> is ambiguous",
4508 TREE_TYPE (obj), build_tree_list_vec (*args));
4509 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4511 result = error_mark_node;
4513 /* Since cand->fn will be a type, not a function, for a conversion
4514 function, we must be careful not to unconditionally look at
4515 DECL_NAME here. */
4516 else if (TREE_CODE (cand->fn) == FUNCTION_DECL
4517 && DECL_OVERLOADED_OPERATOR_P (cand->fn) == CALL_EXPR)
4518 result = build_over_call (cand, LOOKUP_NORMAL, complain);
4519 else
4521 if (DECL_P (cand->fn))
4522 obj = convert_like_with_context (cand->convs[0], obj, cand->fn,
4523 -1, complain);
4524 else
4525 obj = convert_like (cand->convs[0], obj, complain);
4526 obj = convert_from_reference (obj);
4527 result = cp_build_function_call_vec (obj, args, complain);
4531 /* Free all the conversions we allocated. */
4532 obstack_free (&conversion_obstack, p);
4534 return result;
4537 /* Wrapper for above. */
4539 tree
4540 build_op_call (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
4542 tree ret;
4543 bool subtime = timevar_cond_start (TV_OVERLOAD);
4544 ret = build_op_call_1 (obj, args, complain);
4545 timevar_cond_stop (TV_OVERLOAD, subtime);
4546 return ret;
4549 /* Called by op_error to prepare format strings suitable for the error
4550 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4551 and a suffix (controlled by NTYPES). */
4553 static const char *
4554 op_error_string (const char *errmsg, int ntypes, bool match)
4556 const char *msg;
4558 const char *msgp = concat (match ? G_("ambiguous overload for ")
4559 : G_("no match for "), errmsg, NULL);
4561 if (ntypes == 3)
4562 msg = concat (msgp, G_(" (operand types are %qT, %qT, and %qT)"), NULL);
4563 else if (ntypes == 2)
4564 msg = concat (msgp, G_(" (operand types are %qT and %qT)"), NULL);
4565 else
4566 msg = concat (msgp, G_(" (operand type is %qT)"), NULL);
4568 return msg;
4571 static void
4572 op_error (location_t loc, enum tree_code code, enum tree_code code2,
4573 tree arg1, tree arg2, tree arg3, bool match)
4575 const char *opname;
4577 if (code == MODIFY_EXPR)
4578 opname = assignment_operator_name_info[code2].name;
4579 else
4580 opname = operator_name_info[code].name;
4582 switch (code)
4584 case COND_EXPR:
4585 if (flag_diagnostics_show_caret)
4586 error_at (loc, op_error_string (G_("ternary %<operator?:%>"),
4587 3, match),
4588 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
4589 else
4590 error_at (loc, op_error_string (G_("ternary %<operator?:%> "
4591 "in %<%E ? %E : %E%>"), 3, match),
4592 arg1, arg2, arg3,
4593 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
4594 break;
4596 case POSTINCREMENT_EXPR:
4597 case POSTDECREMENT_EXPR:
4598 if (flag_diagnostics_show_caret)
4599 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
4600 opname, TREE_TYPE (arg1));
4601 else
4602 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4603 1, match),
4604 opname, arg1, opname, TREE_TYPE (arg1));
4605 break;
4607 case ARRAY_REF:
4608 if (flag_diagnostics_show_caret)
4609 error_at (loc, op_error_string (G_("%<operator[]%>"), 2, match),
4610 TREE_TYPE (arg1), TREE_TYPE (arg2));
4611 else
4612 error_at (loc, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4613 2, match),
4614 arg1, arg2, TREE_TYPE (arg1), TREE_TYPE (arg2));
4615 break;
4617 case REALPART_EXPR:
4618 case IMAGPART_EXPR:
4619 if (flag_diagnostics_show_caret)
4620 error_at (loc, op_error_string (G_("%qs"), 1, match),
4621 opname, TREE_TYPE (arg1));
4622 else
4623 error_at (loc, op_error_string (G_("%qs in %<%s %E%>"), 1, match),
4624 opname, opname, arg1, TREE_TYPE (arg1));
4625 break;
4627 default:
4628 if (arg2)
4629 if (flag_diagnostics_show_caret)
4630 error_at (loc, op_error_string (G_("%<operator%s%>"), 2, match),
4631 opname, TREE_TYPE (arg1), TREE_TYPE (arg2));
4632 else
4633 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4634 2, match),
4635 opname, arg1, opname, arg2,
4636 TREE_TYPE (arg1), TREE_TYPE (arg2));
4637 else
4638 if (flag_diagnostics_show_caret)
4639 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
4640 opname, TREE_TYPE (arg1));
4641 else
4642 error_at (loc, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4643 1, match),
4644 opname, opname, arg1, TREE_TYPE (arg1));
4645 break;
4649 /* Return the implicit conversion sequence that could be used to
4650 convert E1 to E2 in [expr.cond]. */
4652 static conversion *
4653 conditional_conversion (tree e1, tree e2, tsubst_flags_t complain)
4655 tree t1 = non_reference (TREE_TYPE (e1));
4656 tree t2 = non_reference (TREE_TYPE (e2));
4657 conversion *conv;
4658 bool good_base;
4660 /* [expr.cond]
4662 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4663 implicitly converted (clause _conv_) to the type "lvalue reference to
4664 T2", subject to the constraint that in the conversion the
4665 reference must bind directly (_dcl.init.ref_) to an lvalue.
4667 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4668 implicitly converted to the type "rvalue reference to T2", subject to
4669 the constraint that the reference must bind directly. */
4670 if (glvalue_p (e2))
4672 tree rtype = cp_build_reference_type (t2, !lvalue_p (e2));
4673 conv = implicit_conversion (rtype,
4676 /*c_cast_p=*/false,
4677 LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND
4678 |LOOKUP_ONLYCONVERTING,
4679 complain);
4680 if (conv && !conv->bad_p)
4681 return conv;
4684 /* If E2 is a prvalue or if neither of the conversions above can be done
4685 and at least one of the operands has (possibly cv-qualified) class
4686 type: */
4687 if (!CLASS_TYPE_P (t1) && !CLASS_TYPE_P (t2))
4688 return NULL;
4690 /* [expr.cond]
4692 If E1 and E2 have class type, and the underlying class types are
4693 the same or one is a base class of the other: E1 can be converted
4694 to match E2 if the class of T2 is the same type as, or a base
4695 class of, the class of T1, and the cv-qualification of T2 is the
4696 same cv-qualification as, or a greater cv-qualification than, the
4697 cv-qualification of T1. If the conversion is applied, E1 is
4698 changed to an rvalue of type T2 that still refers to the original
4699 source class object (or the appropriate subobject thereof). */
4700 if (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
4701 && ((good_base = DERIVED_FROM_P (t2, t1)) || DERIVED_FROM_P (t1, t2)))
4703 if (good_base && at_least_as_qualified_p (t2, t1))
4705 conv = build_identity_conv (t1, e1);
4706 if (!same_type_p (TYPE_MAIN_VARIANT (t1),
4707 TYPE_MAIN_VARIANT (t2)))
4708 conv = build_conv (ck_base, t2, conv);
4709 else
4710 conv = build_conv (ck_rvalue, t2, conv);
4711 return conv;
4713 else
4714 return NULL;
4716 else
4717 /* [expr.cond]
4719 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4720 converted to the type that expression E2 would have if E2 were
4721 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4722 return implicit_conversion (t2, t1, e1, /*c_cast_p=*/false,
4723 LOOKUP_IMPLICIT, complain);
4726 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4727 arguments to the conditional expression. */
4729 static tree
4730 build_conditional_expr_1 (location_t loc, tree arg1, tree arg2, tree arg3,
4731 tsubst_flags_t complain)
4733 tree arg2_type;
4734 tree arg3_type;
4735 tree result = NULL_TREE;
4736 tree result_type = NULL_TREE;
4737 bool is_lvalue = true;
4738 struct z_candidate *candidates = 0;
4739 struct z_candidate *cand;
4740 void *p;
4741 tree orig_arg2, orig_arg3;
4743 /* As a G++ extension, the second argument to the conditional can be
4744 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4745 c'.) If the second operand is omitted, make sure it is
4746 calculated only once. */
4747 if (!arg2)
4749 if (complain & tf_error)
4750 pedwarn (loc, OPT_Wpedantic,
4751 "ISO C++ forbids omitting the middle term of a ?: expression");
4753 if ((complain & tf_warning) && !truth_value_p (TREE_CODE (arg1)))
4754 warn_for_omitted_condop (loc, arg1);
4756 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4757 if (lvalue_p (arg1))
4758 arg2 = arg1 = cp_stabilize_reference (arg1);
4759 else
4760 arg2 = arg1 = save_expr (arg1);
4763 /* If something has already gone wrong, just pass that fact up the
4764 tree. */
4765 if (error_operand_p (arg1)
4766 || error_operand_p (arg2)
4767 || error_operand_p (arg3))
4768 return error_mark_node;
4770 orig_arg2 = arg2;
4771 orig_arg3 = arg3;
4773 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1)))
4775 tree arg1_type = TREE_TYPE (arg1);
4777 /* If arg1 is another cond_expr choosing between -1 and 0,
4778 then we can use its comparison. It may help to avoid
4779 additional comparison, produce more accurate diagnostics
4780 and enables folding. */
4781 if (TREE_CODE (arg1) == VEC_COND_EXPR
4782 && integer_minus_onep (TREE_OPERAND (arg1, 1))
4783 && integer_zerop (TREE_OPERAND (arg1, 2)))
4784 arg1 = TREE_OPERAND (arg1, 0);
4786 arg1 = force_rvalue (arg1, complain);
4787 arg2 = force_rvalue (arg2, complain);
4788 arg3 = force_rvalue (arg3, complain);
4790 /* force_rvalue can return error_mark on valid arguments. */
4791 if (error_operand_p (arg1)
4792 || error_operand_p (arg2)
4793 || error_operand_p (arg3))
4794 return error_mark_node;
4796 arg2_type = TREE_TYPE (arg2);
4797 arg3_type = TREE_TYPE (arg3);
4799 if (!VECTOR_TYPE_P (arg2_type)
4800 && !VECTOR_TYPE_P (arg3_type))
4802 /* Rely on the error messages of the scalar version. */
4803 tree scal = build_conditional_expr_1 (loc, integer_one_node,
4804 orig_arg2, orig_arg3, complain);
4805 if (scal == error_mark_node)
4806 return error_mark_node;
4807 tree stype = TREE_TYPE (scal);
4808 tree ctype = TREE_TYPE (arg1_type);
4809 if (TYPE_SIZE (stype) != TYPE_SIZE (ctype)
4810 || (!INTEGRAL_TYPE_P (stype) && !SCALAR_FLOAT_TYPE_P (stype)))
4812 if (complain & tf_error)
4813 error_at (loc, "inferred scalar type %qT is not an integer or "
4814 "floating point type of the same size as %qT", stype,
4815 COMPARISON_CLASS_P (arg1)
4816 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1, 0)))
4817 : ctype);
4818 return error_mark_node;
4821 tree vtype = build_opaque_vector_type (stype,
4822 TYPE_VECTOR_SUBPARTS (arg1_type));
4823 /* We could pass complain & tf_warning to unsafe_conversion_p,
4824 but the warnings (like Wsign-conversion) have already been
4825 given by the scalar build_conditional_expr_1. We still check
4826 unsafe_conversion_p to forbid truncating long long -> float. */
4827 if (unsafe_conversion_p (loc, stype, arg2, false))
4829 if (complain & tf_error)
4830 error_at (loc, "conversion of scalar %qT to vector %qT "
4831 "involves truncation", arg2_type, vtype);
4832 return error_mark_node;
4834 if (unsafe_conversion_p (loc, stype, arg3, false))
4836 if (complain & tf_error)
4837 error_at (loc, "conversion of scalar %qT to vector %qT "
4838 "involves truncation", arg3_type, vtype);
4839 return error_mark_node;
4842 arg2 = cp_convert (stype, arg2, complain);
4843 arg2 = save_expr (arg2);
4844 arg2 = build_vector_from_val (vtype, arg2);
4845 arg2_type = vtype;
4846 arg3 = cp_convert (stype, arg3, complain);
4847 arg3 = save_expr (arg3);
4848 arg3 = build_vector_from_val (vtype, arg3);
4849 arg3_type = vtype;
4852 if (VECTOR_TYPE_P (arg2_type) != VECTOR_TYPE_P (arg3_type))
4854 enum stv_conv convert_flag =
4855 scalar_to_vector (loc, VEC_COND_EXPR, arg2, arg3,
4856 complain & tf_error);
4858 switch (convert_flag)
4860 case stv_error:
4861 return error_mark_node;
4862 case stv_firstarg:
4864 arg2 = save_expr (arg2);
4865 arg2 = convert (TREE_TYPE (arg3_type), arg2);
4866 arg2 = build_vector_from_val (arg3_type, arg2);
4867 arg2_type = TREE_TYPE (arg2);
4868 break;
4870 case stv_secondarg:
4872 arg3 = save_expr (arg3);
4873 arg3 = convert (TREE_TYPE (arg2_type), arg3);
4874 arg3 = build_vector_from_val (arg2_type, arg3);
4875 arg3_type = TREE_TYPE (arg3);
4876 break;
4878 default:
4879 break;
4883 if (!same_type_p (arg2_type, arg3_type)
4884 || TYPE_VECTOR_SUBPARTS (arg1_type)
4885 != TYPE_VECTOR_SUBPARTS (arg2_type)
4886 || TYPE_SIZE (arg1_type) != TYPE_SIZE (arg2_type))
4888 if (complain & tf_error)
4889 error_at (loc,
4890 "incompatible vector types in conditional expression: "
4891 "%qT, %qT and %qT", TREE_TYPE (arg1),
4892 TREE_TYPE (orig_arg2), TREE_TYPE (orig_arg3));
4893 return error_mark_node;
4896 if (!COMPARISON_CLASS_P (arg1))
4898 tree cmp_type = build_same_sized_truth_vector_type (arg1_type);
4899 arg1 = build2 (NE_EXPR, cmp_type, arg1, build_zero_cst (arg1_type));
4901 return build3_loc (loc, VEC_COND_EXPR, arg2_type, arg1, arg2, arg3);
4904 /* [expr.cond]
4906 The first expression is implicitly converted to bool (clause
4907 _conv_). */
4908 arg1 = perform_implicit_conversion_flags (boolean_type_node, arg1, complain,
4909 LOOKUP_NORMAL);
4910 if (error_operand_p (arg1))
4911 return error_mark_node;
4913 /* [expr.cond]
4915 If either the second or the third operand has type (possibly
4916 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4917 array-to-pointer (_conv.array_), and function-to-pointer
4918 (_conv.func_) standard conversions are performed on the second
4919 and third operands. */
4920 arg2_type = unlowered_expr_type (arg2);
4921 arg3_type = unlowered_expr_type (arg3);
4922 if (VOID_TYPE_P (arg2_type) || VOID_TYPE_P (arg3_type))
4924 /* Do the conversions. We don't these for `void' type arguments
4925 since it can't have any effect and since decay_conversion
4926 does not handle that case gracefully. */
4927 if (!VOID_TYPE_P (arg2_type))
4928 arg2 = decay_conversion (arg2, complain);
4929 if (!VOID_TYPE_P (arg3_type))
4930 arg3 = decay_conversion (arg3, complain);
4931 arg2_type = TREE_TYPE (arg2);
4932 arg3_type = TREE_TYPE (arg3);
4934 /* [expr.cond]
4936 One of the following shall hold:
4938 --The second or the third operand (but not both) is a
4939 throw-expression (_except.throw_); the result is of the
4940 type of the other and is an rvalue.
4942 --Both the second and the third operands have type void; the
4943 result is of type void and is an rvalue.
4945 We must avoid calling force_rvalue for expressions of type
4946 "void" because it will complain that their value is being
4947 used. */
4948 if (TREE_CODE (arg2) == THROW_EXPR
4949 && TREE_CODE (arg3) != THROW_EXPR)
4951 if (!VOID_TYPE_P (arg3_type))
4953 arg3 = force_rvalue (arg3, complain);
4954 if (arg3 == error_mark_node)
4955 return error_mark_node;
4957 arg3_type = TREE_TYPE (arg3);
4958 result_type = arg3_type;
4960 else if (TREE_CODE (arg2) != THROW_EXPR
4961 && TREE_CODE (arg3) == THROW_EXPR)
4963 if (!VOID_TYPE_P (arg2_type))
4965 arg2 = force_rvalue (arg2, complain);
4966 if (arg2 == error_mark_node)
4967 return error_mark_node;
4969 arg2_type = TREE_TYPE (arg2);
4970 result_type = arg2_type;
4972 else if (VOID_TYPE_P (arg2_type) && VOID_TYPE_P (arg3_type))
4973 result_type = void_type_node;
4974 else
4976 if (complain & tf_error)
4978 if (VOID_TYPE_P (arg2_type))
4979 error_at (EXPR_LOC_OR_LOC (arg3, loc),
4980 "second operand to the conditional operator "
4981 "is of type %<void%>, but the third operand is "
4982 "neither a throw-expression nor of type %<void%>");
4983 else
4984 error_at (EXPR_LOC_OR_LOC (arg2, loc),
4985 "third operand to the conditional operator "
4986 "is of type %<void%>, but the second operand is "
4987 "neither a throw-expression nor of type %<void%>");
4989 return error_mark_node;
4992 is_lvalue = false;
4993 goto valid_operands;
4995 /* [expr.cond]
4997 Otherwise, if the second and third operand have different types,
4998 and either has (possibly cv-qualified) class type, or if both are
4999 glvalues of the same value category and the same type except for
5000 cv-qualification, an attempt is made to convert each of those operands
5001 to the type of the other. */
5002 else if (!same_type_p (arg2_type, arg3_type)
5003 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)
5004 || (same_type_ignoring_top_level_qualifiers_p (arg2_type,
5005 arg3_type)
5006 && glvalue_p (arg2) && glvalue_p (arg3)
5007 && lvalue_p (arg2) == lvalue_p (arg3))))
5009 conversion *conv2;
5010 conversion *conv3;
5011 bool converted = false;
5013 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5014 p = conversion_obstack_alloc (0);
5016 conv2 = conditional_conversion (arg2, arg3, complain);
5017 conv3 = conditional_conversion (arg3, arg2, complain);
5019 /* [expr.cond]
5021 If both can be converted, or one can be converted but the
5022 conversion is ambiguous, the program is ill-formed. If
5023 neither can be converted, the operands are left unchanged and
5024 further checking is performed as described below. If exactly
5025 one conversion is possible, that conversion is applied to the
5026 chosen operand and the converted operand is used in place of
5027 the original operand for the remainder of this section. */
5028 if ((conv2 && !conv2->bad_p
5029 && conv3 && !conv3->bad_p)
5030 || (conv2 && conv2->kind == ck_ambig)
5031 || (conv3 && conv3->kind == ck_ambig))
5033 if (complain & tf_error)
5035 error_at (loc, "operands to ?: have different types %qT and %qT",
5036 arg2_type, arg3_type);
5037 if (conv2 && !conv2->bad_p && conv3 && !conv3->bad_p)
5038 inform (loc, " and each type can be converted to the other");
5039 else if (conv2 && conv2->kind == ck_ambig)
5040 convert_like (conv2, arg2, complain);
5041 else
5042 convert_like (conv3, arg3, complain);
5044 result = error_mark_node;
5046 else if (conv2 && !conv2->bad_p)
5048 arg2 = convert_like (conv2, arg2, complain);
5049 arg2 = convert_from_reference (arg2);
5050 arg2_type = TREE_TYPE (arg2);
5051 /* Even if CONV2 is a valid conversion, the result of the
5052 conversion may be invalid. For example, if ARG3 has type
5053 "volatile X", and X does not have a copy constructor
5054 accepting a "volatile X&", then even if ARG2 can be
5055 converted to X, the conversion will fail. */
5056 if (error_operand_p (arg2))
5057 result = error_mark_node;
5058 converted = true;
5060 else if (conv3 && !conv3->bad_p)
5062 arg3 = convert_like (conv3, arg3, complain);
5063 arg3 = convert_from_reference (arg3);
5064 arg3_type = TREE_TYPE (arg3);
5065 if (error_operand_p (arg3))
5066 result = error_mark_node;
5067 converted = true;
5070 /* Free all the conversions we allocated. */
5071 obstack_free (&conversion_obstack, p);
5073 if (result)
5074 return result;
5076 /* If, after the conversion, both operands have class type,
5077 treat the cv-qualification of both operands as if it were the
5078 union of the cv-qualification of the operands.
5080 The standard is not clear about what to do in this
5081 circumstance. For example, if the first operand has type
5082 "const X" and the second operand has a user-defined
5083 conversion to "volatile X", what is the type of the second
5084 operand after this step? Making it be "const X" (matching
5085 the first operand) seems wrong, as that discards the
5086 qualification without actually performing a copy. Leaving it
5087 as "volatile X" seems wrong as that will result in the
5088 conditional expression failing altogether, even though,
5089 according to this step, the one operand could be converted to
5090 the type of the other. */
5091 if (converted
5092 && CLASS_TYPE_P (arg2_type)
5093 && cp_type_quals (arg2_type) != cp_type_quals (arg3_type))
5094 arg2_type = arg3_type =
5095 cp_build_qualified_type (arg2_type,
5096 cp_type_quals (arg2_type)
5097 | cp_type_quals (arg3_type));
5100 /* [expr.cond]
5102 If the second and third operands are glvalues of the same value
5103 category and have the same type, the result is of that type and
5104 value category. */
5105 if (((lvalue_p (arg2) && lvalue_p (arg3))
5106 || (xvalue_p (arg2) && xvalue_p (arg3)))
5107 && same_type_p (arg2_type, arg3_type))
5109 result_type = arg2_type;
5110 arg2 = mark_lvalue_use (arg2);
5111 arg3 = mark_lvalue_use (arg3);
5112 goto valid_operands;
5115 /* [expr.cond]
5117 Otherwise, the result is an rvalue. If the second and third
5118 operand do not have the same type, and either has (possibly
5119 cv-qualified) class type, overload resolution is used to
5120 determine the conversions (if any) to be applied to the operands
5121 (_over.match.oper_, _over.built_). */
5122 is_lvalue = false;
5123 if (!same_type_p (arg2_type, arg3_type)
5124 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
5126 tree args[3];
5127 conversion *conv;
5128 bool any_viable_p;
5130 /* Rearrange the arguments so that add_builtin_candidate only has
5131 to know about two args. In build_builtin_candidate, the
5132 arguments are unscrambled. */
5133 args[0] = arg2;
5134 args[1] = arg3;
5135 args[2] = arg1;
5136 add_builtin_candidates (&candidates,
5137 COND_EXPR,
5138 NOP_EXPR,
5139 ansi_opname (COND_EXPR),
5140 args,
5141 LOOKUP_NORMAL, complain);
5143 /* [expr.cond]
5145 If the overload resolution fails, the program is
5146 ill-formed. */
5147 candidates = splice_viable (candidates, false, &any_viable_p);
5148 if (!any_viable_p)
5150 if (complain & tf_error)
5151 error_at (loc, "operands to ?: have different types %qT and %qT",
5152 arg2_type, arg3_type);
5153 return error_mark_node;
5155 cand = tourney (candidates, complain);
5156 if (!cand)
5158 if (complain & tf_error)
5160 op_error (loc, COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE);
5161 print_z_candidates (loc, candidates);
5163 return error_mark_node;
5166 /* [expr.cond]
5168 Otherwise, the conversions thus determined are applied, and
5169 the converted operands are used in place of the original
5170 operands for the remainder of this section. */
5171 conv = cand->convs[0];
5172 arg1 = convert_like (conv, arg1, complain);
5173 conv = cand->convs[1];
5174 arg2 = convert_like (conv, arg2, complain);
5175 arg2_type = TREE_TYPE (arg2);
5176 conv = cand->convs[2];
5177 arg3 = convert_like (conv, arg3, complain);
5178 arg3_type = TREE_TYPE (arg3);
5181 /* [expr.cond]
5183 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5184 and function-to-pointer (_conv.func_) standard conversions are
5185 performed on the second and third operands.
5187 We need to force the lvalue-to-rvalue conversion here for class types,
5188 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5189 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5190 regions. */
5192 arg2 = force_rvalue (arg2, complain);
5193 if (!CLASS_TYPE_P (arg2_type))
5194 arg2_type = TREE_TYPE (arg2);
5196 arg3 = force_rvalue (arg3, complain);
5197 if (!CLASS_TYPE_P (arg3_type))
5198 arg3_type = TREE_TYPE (arg3);
5200 if (arg2 == error_mark_node || arg3 == error_mark_node)
5201 return error_mark_node;
5203 /* [expr.cond]
5205 After those conversions, one of the following shall hold:
5207 --The second and third operands have the same type; the result is of
5208 that type. */
5209 if (same_type_p (arg2_type, arg3_type))
5210 result_type = arg2_type;
5211 /* [expr.cond]
5213 --The second and third operands have arithmetic or enumeration
5214 type; the usual arithmetic conversions are performed to bring
5215 them to a common type, and the result is of that type. */
5216 else if ((ARITHMETIC_TYPE_P (arg2_type)
5217 || UNSCOPED_ENUM_P (arg2_type))
5218 && (ARITHMETIC_TYPE_P (arg3_type)
5219 || UNSCOPED_ENUM_P (arg3_type)))
5221 /* In this case, there is always a common type. */
5222 result_type = type_after_usual_arithmetic_conversions (arg2_type,
5223 arg3_type);
5224 if (complain & tf_warning)
5225 do_warn_double_promotion (result_type, arg2_type, arg3_type,
5226 "implicit conversion from %qT to %qT to "
5227 "match other result of conditional",
5228 loc);
5230 if (TREE_CODE (arg2_type) == ENUMERAL_TYPE
5231 && TREE_CODE (arg3_type) == ENUMERAL_TYPE)
5233 if (TREE_CODE (orig_arg2) == CONST_DECL
5234 && TREE_CODE (orig_arg3) == CONST_DECL
5235 && DECL_CONTEXT (orig_arg2) == DECL_CONTEXT (orig_arg3))
5236 /* Two enumerators from the same enumeration can have different
5237 types when the enumeration is still being defined. */;
5238 else if (complain & tf_warning)
5239 warning_at (loc, OPT_Wenum_compare, "enumeral mismatch in "
5240 "conditional expression: %qT vs %qT",
5241 arg2_type, arg3_type);
5243 else if (extra_warnings
5244 && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE
5245 && !same_type_p (arg3_type, type_promotes_to (arg2_type)))
5246 || (TREE_CODE (arg3_type) == ENUMERAL_TYPE
5247 && !same_type_p (arg2_type,
5248 type_promotes_to (arg3_type)))))
5250 if (complain & tf_warning)
5251 warning_at (loc, OPT_Wextra, "enumeral and non-enumeral type in "
5252 "conditional expression");
5255 arg2 = perform_implicit_conversion (result_type, arg2, complain);
5256 arg3 = perform_implicit_conversion (result_type, arg3, complain);
5258 /* [expr.cond]
5260 --The second and third operands have pointer type, or one has
5261 pointer type and the other is a null pointer constant; pointer
5262 conversions (_conv.ptr_) and qualification conversions
5263 (_conv.qual_) are performed to bring them to their composite
5264 pointer type (_expr.rel_). The result is of the composite
5265 pointer type.
5267 --The second and third operands have pointer to member type, or
5268 one has pointer to member type and the other is a null pointer
5269 constant; pointer to member conversions (_conv.mem_) and
5270 qualification conversions (_conv.qual_) are performed to bring
5271 them to a common type, whose cv-qualification shall match the
5272 cv-qualification of either the second or the third operand.
5273 The result is of the common type. */
5274 else if ((null_ptr_cst_p (arg2)
5275 && TYPE_PTR_OR_PTRMEM_P (arg3_type))
5276 || (null_ptr_cst_p (arg3)
5277 && TYPE_PTR_OR_PTRMEM_P (arg2_type))
5278 || (TYPE_PTR_P (arg2_type) && TYPE_PTR_P (arg3_type))
5279 || (TYPE_PTRDATAMEM_P (arg2_type) && TYPE_PTRDATAMEM_P (arg3_type))
5280 || (TYPE_PTRMEMFUNC_P (arg2_type) && TYPE_PTRMEMFUNC_P (arg3_type)))
5282 result_type = composite_pointer_type (arg2_type, arg3_type, arg2,
5283 arg3, CPO_CONDITIONAL_EXPR,
5284 complain);
5285 if (result_type == error_mark_node)
5286 return error_mark_node;
5287 arg2 = perform_implicit_conversion (result_type, arg2, complain);
5288 arg3 = perform_implicit_conversion (result_type, arg3, complain);
5291 if (!result_type)
5293 if (complain & tf_error)
5294 error_at (loc, "operands to ?: have different types %qT and %qT",
5295 arg2_type, arg3_type);
5296 return error_mark_node;
5299 if (arg2 == error_mark_node || arg3 == error_mark_node)
5300 return error_mark_node;
5302 valid_operands:
5303 result = build3_loc (loc, COND_EXPR, result_type, arg1, arg2, arg3);
5305 /* We can't use result_type below, as fold might have returned a
5306 throw_expr. */
5308 if (!is_lvalue)
5310 /* Expand both sides into the same slot, hopefully the target of
5311 the ?: expression. We used to check for TARGET_EXPRs here,
5312 but now we sometimes wrap them in NOP_EXPRs so the test would
5313 fail. */
5314 if (CLASS_TYPE_P (TREE_TYPE (result)))
5315 result = get_target_expr_sfinae (result, complain);
5316 /* If this expression is an rvalue, but might be mistaken for an
5317 lvalue, we must add a NON_LVALUE_EXPR. */
5318 result = rvalue (result);
5320 else
5321 result = force_paren_expr (result);
5323 return result;
5326 /* Wrapper for above. */
5328 tree
5329 build_conditional_expr (location_t loc, tree arg1, tree arg2, tree arg3,
5330 tsubst_flags_t complain)
5332 tree ret;
5333 bool subtime = timevar_cond_start (TV_OVERLOAD);
5334 ret = build_conditional_expr_1 (loc, arg1, arg2, arg3, complain);
5335 timevar_cond_stop (TV_OVERLOAD, subtime);
5336 return ret;
5339 /* OPERAND is an operand to an expression. Perform necessary steps
5340 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5341 returned. */
5343 static tree
5344 prep_operand (tree operand)
5346 if (operand)
5348 if (CLASS_TYPE_P (TREE_TYPE (operand))
5349 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand)))
5350 /* Make sure the template type is instantiated now. */
5351 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand)));
5354 return operand;
5357 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5358 OVERLOAD) to the CANDIDATES, returning an updated list of
5359 CANDIDATES. The ARGS are the arguments provided to the call;
5360 if FIRST_ARG is non-null it is the implicit object argument,
5361 otherwise the first element of ARGS is used if needed. The
5362 EXPLICIT_TARGS are explicit template arguments provided.
5363 TEMPLATE_ONLY is true if only template functions should be
5364 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5365 add_function_candidate. */
5367 static void
5368 add_candidates (tree fns, tree first_arg, const vec<tree, va_gc> *args,
5369 tree return_type,
5370 tree explicit_targs, bool template_only,
5371 tree conversion_path, tree access_path,
5372 int flags,
5373 struct z_candidate **candidates,
5374 tsubst_flags_t complain)
5376 tree ctype;
5377 const vec<tree, va_gc> *non_static_args;
5378 bool check_list_ctor;
5379 bool check_converting;
5380 unification_kind_t strict;
5381 tree fn;
5383 if (!fns)
5384 return;
5386 /* Precalculate special handling of constructors and conversion ops. */
5387 fn = OVL_CURRENT (fns);
5388 if (DECL_CONV_FN_P (fn))
5390 check_list_ctor = false;
5391 check_converting = !!(flags & LOOKUP_ONLYCONVERTING);
5392 if (flags & LOOKUP_NO_CONVERSION)
5393 /* We're doing return_type(x). */
5394 strict = DEDUCE_CONV;
5395 else
5396 /* We're doing x.operator return_type(). */
5397 strict = DEDUCE_EXACT;
5398 /* [over.match.funcs] For conversion functions, the function
5399 is considered to be a member of the class of the implicit
5400 object argument for the purpose of defining the type of
5401 the implicit object parameter. */
5402 ctype = TYPE_MAIN_VARIANT (TREE_TYPE (first_arg));
5404 else
5406 if (DECL_CONSTRUCTOR_P (fn))
5408 check_list_ctor = !!(flags & LOOKUP_LIST_ONLY);
5409 /* For list-initialization we consider explicit constructors
5410 and complain if one is chosen. */
5411 check_converting
5412 = ((flags & (LOOKUP_ONLYCONVERTING|LOOKUP_LIST_INIT_CTOR))
5413 == LOOKUP_ONLYCONVERTING);
5415 else
5417 check_list_ctor = false;
5418 check_converting = false;
5420 strict = DEDUCE_CALL;
5421 ctype = conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE;
5424 if (first_arg)
5425 non_static_args = args;
5426 else
5427 /* Delay creating the implicit this parameter until it is needed. */
5428 non_static_args = NULL;
5430 for (; fns; fns = OVL_NEXT (fns))
5432 tree fn_first_arg;
5433 const vec<tree, va_gc> *fn_args;
5435 fn = OVL_CURRENT (fns);
5437 if (check_converting && DECL_NONCONVERTING_P (fn))
5438 continue;
5439 if (check_list_ctor && !is_list_ctor (fn))
5440 continue;
5442 /* Figure out which set of arguments to use. */
5443 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
5445 /* If this function is a non-static member and we didn't get an
5446 implicit object argument, move it out of args. */
5447 if (first_arg == NULL_TREE)
5449 unsigned int ix;
5450 tree arg;
5451 vec<tree, va_gc> *tempvec;
5452 vec_alloc (tempvec, args->length () - 1);
5453 for (ix = 1; args->iterate (ix, &arg); ++ix)
5454 tempvec->quick_push (arg);
5455 non_static_args = tempvec;
5456 first_arg = (*args)[0];
5459 fn_first_arg = first_arg;
5460 fn_args = non_static_args;
5462 else
5464 /* Otherwise, just use the list of arguments provided. */
5465 fn_first_arg = NULL_TREE;
5466 fn_args = args;
5469 if (TREE_CODE (fn) == TEMPLATE_DECL)
5470 add_template_candidate (candidates,
5472 ctype,
5473 explicit_targs,
5474 fn_first_arg,
5475 fn_args,
5476 return_type,
5477 access_path,
5478 conversion_path,
5479 flags,
5480 strict,
5481 complain);
5482 else if (!template_only)
5483 add_function_candidate (candidates,
5485 ctype,
5486 fn_first_arg,
5487 fn_args,
5488 access_path,
5489 conversion_path,
5490 flags,
5491 complain);
5495 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5496 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5498 static int
5499 op_is_ordered (tree_code code)
5501 switch (code)
5503 // 5. b @= a
5504 case MODIFY_EXPR:
5505 return (flag_strong_eval_order > 1 ? -1 : 0);
5507 // 6. a[b]
5508 case ARRAY_REF:
5509 return (flag_strong_eval_order > 1 ? 1 : 0);
5511 // 1. a.b
5512 // Not overloadable (yet).
5513 // 2. a->b
5514 // Only one argument.
5515 // 3. a->*b
5516 case MEMBER_REF:
5517 // 7. a << b
5518 case LSHIFT_EXPR:
5519 // 8. a >> b
5520 case RSHIFT_EXPR:
5521 return (flag_strong_eval_order ? 1 : 0);
5523 default:
5524 return 0;
5528 static tree
5529 build_new_op_1 (location_t loc, enum tree_code code, int flags, tree arg1,
5530 tree arg2, tree arg3, tree *overload, tsubst_flags_t complain)
5532 struct z_candidate *candidates = 0, *cand;
5533 vec<tree, va_gc> *arglist;
5534 tree fnname;
5535 tree args[3];
5536 tree result = NULL_TREE;
5537 bool result_valid_p = false;
5538 enum tree_code code2 = NOP_EXPR;
5539 enum tree_code code_orig_arg1 = ERROR_MARK;
5540 enum tree_code code_orig_arg2 = ERROR_MARK;
5541 conversion *conv;
5542 void *p;
5543 bool strict_p;
5544 bool any_viable_p;
5546 if (error_operand_p (arg1)
5547 || error_operand_p (arg2)
5548 || error_operand_p (arg3))
5549 return error_mark_node;
5551 if (code == MODIFY_EXPR)
5553 code2 = TREE_CODE (arg3);
5554 arg3 = NULL_TREE;
5555 fnname = ansi_assopname (code2);
5557 else
5558 fnname = ansi_opname (code);
5560 arg1 = prep_operand (arg1);
5562 bool memonly = false;
5563 switch (code)
5565 case NEW_EXPR:
5566 case VEC_NEW_EXPR:
5567 case VEC_DELETE_EXPR:
5568 case DELETE_EXPR:
5569 /* Use build_op_new_call and build_op_delete_call instead. */
5570 gcc_unreachable ();
5572 case CALL_EXPR:
5573 /* Use build_op_call instead. */
5574 gcc_unreachable ();
5576 case TRUTH_ORIF_EXPR:
5577 case TRUTH_ANDIF_EXPR:
5578 case TRUTH_AND_EXPR:
5579 case TRUTH_OR_EXPR:
5580 /* These are saved for the sake of warn_logical_operator. */
5581 code_orig_arg1 = TREE_CODE (arg1);
5582 code_orig_arg2 = TREE_CODE (arg2);
5583 break;
5584 case GT_EXPR:
5585 case LT_EXPR:
5586 case GE_EXPR:
5587 case LE_EXPR:
5588 case EQ_EXPR:
5589 case NE_EXPR:
5590 /* These are saved for the sake of maybe_warn_bool_compare. */
5591 code_orig_arg1 = TREE_CODE (TREE_TYPE (arg1));
5592 code_orig_arg2 = TREE_CODE (TREE_TYPE (arg2));
5593 break;
5595 /* =, ->, [], () must be non-static member functions. */
5596 case MODIFY_EXPR:
5597 if (code2 != NOP_EXPR)
5598 break;
5599 /* FALLTHRU */
5600 case COMPONENT_REF:
5601 case ARRAY_REF:
5602 memonly = true;
5603 break;
5605 default:
5606 break;
5609 arg2 = prep_operand (arg2);
5610 arg3 = prep_operand (arg3);
5612 if (code == COND_EXPR)
5613 /* Use build_conditional_expr instead. */
5614 gcc_unreachable ();
5615 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1))
5616 && (! arg2 || ! OVERLOAD_TYPE_P (TREE_TYPE (arg2))))
5617 goto builtin;
5619 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
5620 arg2 = integer_zero_node;
5622 vec_alloc (arglist, 3);
5623 arglist->quick_push (arg1);
5624 if (arg2 != NULL_TREE)
5625 arglist->quick_push (arg2);
5626 if (arg3 != NULL_TREE)
5627 arglist->quick_push (arg3);
5629 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5630 p = conversion_obstack_alloc (0);
5632 /* Add namespace-scope operators to the list of functions to
5633 consider. */
5634 if (!memonly)
5635 add_candidates (lookup_function_nonclass (fnname, arglist,
5636 /*block_p=*/true),
5637 NULL_TREE, arglist, NULL_TREE,
5638 NULL_TREE, false, NULL_TREE, NULL_TREE,
5639 flags, &candidates, complain);
5641 args[0] = arg1;
5642 args[1] = arg2;
5643 args[2] = NULL_TREE;
5645 /* Add class-member operators to the candidate set. */
5646 if (CLASS_TYPE_P (TREE_TYPE (arg1)))
5648 tree fns;
5650 fns = lookup_fnfields (TREE_TYPE (arg1), fnname, 1);
5651 if (fns == error_mark_node)
5653 result = error_mark_node;
5654 goto user_defined_result_ready;
5656 if (fns)
5657 add_candidates (BASELINK_FUNCTIONS (fns),
5658 NULL_TREE, arglist, NULL_TREE,
5659 NULL_TREE, false,
5660 BASELINK_BINFO (fns),
5661 BASELINK_ACCESS_BINFO (fns),
5662 flags, &candidates, complain);
5664 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5665 only non-member functions that have type T1 or reference to
5666 cv-qualified-opt T1 for the first argument, if the first argument
5667 has an enumeration type, or T2 or reference to cv-qualified-opt
5668 T2 for the second argument, if the second argument has an
5669 enumeration type. Filter out those that don't match. */
5670 else if (! arg2 || ! CLASS_TYPE_P (TREE_TYPE (arg2)))
5672 struct z_candidate **candp, **next;
5674 for (candp = &candidates; *candp; candp = next)
5676 tree parmlist, parmtype;
5677 int i, nargs = (arg2 ? 2 : 1);
5679 cand = *candp;
5680 next = &cand->next;
5682 parmlist = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
5684 for (i = 0; i < nargs; ++i)
5686 parmtype = TREE_VALUE (parmlist);
5688 if (TREE_CODE (parmtype) == REFERENCE_TYPE)
5689 parmtype = TREE_TYPE (parmtype);
5690 if (TREE_CODE (TREE_TYPE (args[i])) == ENUMERAL_TYPE
5691 && (same_type_ignoring_top_level_qualifiers_p
5692 (TREE_TYPE (args[i]), parmtype)))
5693 break;
5695 parmlist = TREE_CHAIN (parmlist);
5698 /* No argument has an appropriate type, so remove this
5699 candidate function from the list. */
5700 if (i == nargs)
5702 *candp = cand->next;
5703 next = candp;
5708 add_builtin_candidates (&candidates, code, code2, fnname, args,
5709 flags, complain);
5711 switch (code)
5713 case COMPOUND_EXPR:
5714 case ADDR_EXPR:
5715 /* For these, the built-in candidates set is empty
5716 [over.match.oper]/3. We don't want non-strict matches
5717 because exact matches are always possible with built-in
5718 operators. The built-in candidate set for COMPONENT_REF
5719 would be empty too, but since there are no such built-in
5720 operators, we accept non-strict matches for them. */
5721 strict_p = true;
5722 break;
5724 default:
5725 strict_p = false;
5726 break;
5729 candidates = splice_viable (candidates, strict_p, &any_viable_p);
5730 if (!any_viable_p)
5732 switch (code)
5734 case POSTINCREMENT_EXPR:
5735 case POSTDECREMENT_EXPR:
5736 /* Don't try anything fancy if we're not allowed to produce
5737 errors. */
5738 if (!(complain & tf_error))
5739 return error_mark_node;
5741 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5742 distinguish between prefix and postfix ++ and
5743 operator++() was used for both, so we allow this with
5744 -fpermissive. */
5745 else
5747 const char *msg = (flag_permissive)
5748 ? G_("no %<%D(int)%> declared for postfix %qs,"
5749 " trying prefix operator instead")
5750 : G_("no %<%D(int)%> declared for postfix %qs");
5751 permerror (loc, msg, fnname, operator_name_info[code].name);
5754 if (!flag_permissive)
5755 return error_mark_node;
5757 if (code == POSTINCREMENT_EXPR)
5758 code = PREINCREMENT_EXPR;
5759 else
5760 code = PREDECREMENT_EXPR;
5761 result = build_new_op_1 (loc, code, flags, arg1, NULL_TREE,
5762 NULL_TREE, overload, complain);
5763 break;
5765 /* The caller will deal with these. */
5766 case ADDR_EXPR:
5767 case COMPOUND_EXPR:
5768 case COMPONENT_REF:
5769 result = NULL_TREE;
5770 result_valid_p = true;
5771 break;
5773 default:
5774 if (complain & tf_error)
5776 /* If one of the arguments of the operator represents
5777 an invalid use of member function pointer, try to report
5778 a meaningful error ... */
5779 if (invalid_nonstatic_memfn_p (loc, arg1, tf_error)
5780 || invalid_nonstatic_memfn_p (loc, arg2, tf_error)
5781 || invalid_nonstatic_memfn_p (loc, arg3, tf_error))
5782 /* We displayed the error message. */;
5783 else
5785 /* ... Otherwise, report the more generic
5786 "no matching operator found" error */
5787 op_error (loc, code, code2, arg1, arg2, arg3, FALSE);
5788 print_z_candidates (loc, candidates);
5791 result = error_mark_node;
5792 break;
5795 else
5797 cand = tourney (candidates, complain);
5798 if (cand == 0)
5800 if (complain & tf_error)
5802 op_error (loc, code, code2, arg1, arg2, arg3, TRUE);
5803 print_z_candidates (loc, candidates);
5805 result = error_mark_node;
5807 else if (TREE_CODE (cand->fn) == FUNCTION_DECL)
5809 if (overload)
5810 *overload = cand->fn;
5812 if (resolve_args (arglist, complain) == NULL)
5813 result = error_mark_node;
5814 else
5815 result = build_over_call (cand, LOOKUP_NORMAL, complain);
5817 if (trivial_fn_p (cand->fn))
5818 /* There won't be a CALL_EXPR. */;
5819 else if (result && result != error_mark_node)
5821 tree call = extract_call_expr (result);
5822 CALL_EXPR_OPERATOR_SYNTAX (call) = true;
5824 if (processing_template_decl && DECL_HIDDEN_FRIEND_P (cand->fn))
5825 /* This prevents build_new_function_call from discarding this
5826 function during instantiation of the enclosing template. */
5827 KOENIG_LOOKUP_P (call) = 1;
5829 /* Specify evaluation order as per P0145R2. */
5830 CALL_EXPR_ORDERED_ARGS (call) = false;
5831 switch (op_is_ordered (code))
5833 case -1:
5834 CALL_EXPR_REVERSE_ARGS (call) = true;
5835 break;
5837 case 1:
5838 CALL_EXPR_ORDERED_ARGS (call) = true;
5839 break;
5841 default:
5842 break;
5846 else
5848 /* Give any warnings we noticed during overload resolution. */
5849 if (cand->warnings && (complain & tf_warning))
5851 struct candidate_warning *w;
5852 for (w = cand->warnings; w; w = w->next)
5853 joust (cand, w->loser, 1, complain);
5856 /* Check for comparison of different enum types. */
5857 switch (code)
5859 case GT_EXPR:
5860 case LT_EXPR:
5861 case GE_EXPR:
5862 case LE_EXPR:
5863 case EQ_EXPR:
5864 case NE_EXPR:
5865 if (TREE_CODE (TREE_TYPE (arg1)) == ENUMERAL_TYPE
5866 && TREE_CODE (TREE_TYPE (arg2)) == ENUMERAL_TYPE
5867 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1))
5868 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2)))
5869 && (complain & tf_warning))
5871 warning (OPT_Wenum_compare,
5872 "comparison between %q#T and %q#T",
5873 TREE_TYPE (arg1), TREE_TYPE (arg2));
5875 break;
5876 default:
5877 break;
5880 /* We need to strip any leading REF_BIND so that bitfields
5881 don't cause errors. This should not remove any important
5882 conversions, because builtins don't apply to class
5883 objects directly. */
5884 conv = cand->convs[0];
5885 if (conv->kind == ck_ref_bind)
5886 conv = next_conversion (conv);
5887 arg1 = convert_like (conv, arg1, complain);
5889 if (arg2)
5891 conv = cand->convs[1];
5892 if (conv->kind == ck_ref_bind)
5893 conv = next_conversion (conv);
5894 else
5895 arg2 = decay_conversion (arg2, complain);
5897 /* We need to call warn_logical_operator before
5898 converting arg2 to a boolean_type, but after
5899 decaying an enumerator to its value. */
5900 if (complain & tf_warning)
5901 warn_logical_operator (loc, code, boolean_type_node,
5902 code_orig_arg1, arg1,
5903 code_orig_arg2, arg2);
5905 arg2 = convert_like (conv, arg2, complain);
5907 if (arg3)
5909 conv = cand->convs[2];
5910 if (conv->kind == ck_ref_bind)
5911 conv = next_conversion (conv);
5912 arg3 = convert_like (conv, arg3, complain);
5918 user_defined_result_ready:
5920 /* Free all the conversions we allocated. */
5921 obstack_free (&conversion_obstack, p);
5923 if (result || result_valid_p)
5924 return result;
5926 builtin:
5927 switch (code)
5929 case MODIFY_EXPR:
5930 return cp_build_modify_expr (loc, arg1, code2, arg2, complain);
5932 case INDIRECT_REF:
5933 return cp_build_indirect_ref (arg1, RO_UNARY_STAR, complain);
5935 case TRUTH_ANDIF_EXPR:
5936 case TRUTH_ORIF_EXPR:
5937 case TRUTH_AND_EXPR:
5938 case TRUTH_OR_EXPR:
5939 if (complain & tf_warning)
5940 warn_logical_operator (loc, code, boolean_type_node,
5941 code_orig_arg1, arg1,
5942 code_orig_arg2, arg2);
5943 /* Fall through. */
5944 case GT_EXPR:
5945 case LT_EXPR:
5946 case GE_EXPR:
5947 case LE_EXPR:
5948 case EQ_EXPR:
5949 case NE_EXPR:
5950 if ((complain & tf_warning)
5951 && ((code_orig_arg1 == BOOLEAN_TYPE)
5952 ^ (code_orig_arg2 == BOOLEAN_TYPE)))
5953 maybe_warn_bool_compare (loc, code, arg1, arg2);
5954 if (complain & tf_warning && warn_tautological_compare)
5955 warn_tautological_cmp (loc, code, arg1, arg2);
5956 /* Fall through. */
5957 case PLUS_EXPR:
5958 case MINUS_EXPR:
5959 case MULT_EXPR:
5960 case TRUNC_DIV_EXPR:
5961 case MAX_EXPR:
5962 case MIN_EXPR:
5963 case LSHIFT_EXPR:
5964 case RSHIFT_EXPR:
5965 case TRUNC_MOD_EXPR:
5966 case BIT_AND_EXPR:
5967 case BIT_IOR_EXPR:
5968 case BIT_XOR_EXPR:
5969 return cp_build_binary_op (loc, code, arg1, arg2, complain);
5971 case UNARY_PLUS_EXPR:
5972 case NEGATE_EXPR:
5973 case BIT_NOT_EXPR:
5974 case TRUTH_NOT_EXPR:
5975 case PREINCREMENT_EXPR:
5976 case POSTINCREMENT_EXPR:
5977 case PREDECREMENT_EXPR:
5978 case POSTDECREMENT_EXPR:
5979 case REALPART_EXPR:
5980 case IMAGPART_EXPR:
5981 case ABS_EXPR:
5982 return cp_build_unary_op (code, arg1, candidates != 0, complain);
5984 case ARRAY_REF:
5985 return cp_build_array_ref (input_location, arg1, arg2, complain);
5987 case MEMBER_REF:
5988 return build_m_component_ref (cp_build_indirect_ref (arg1, RO_ARROW_STAR,
5989 complain),
5990 arg2, complain);
5992 /* The caller will deal with these. */
5993 case ADDR_EXPR:
5994 case COMPONENT_REF:
5995 case COMPOUND_EXPR:
5996 return NULL_TREE;
5998 default:
5999 gcc_unreachable ();
6001 return NULL_TREE;
6004 /* Wrapper for above. */
6006 tree
6007 build_new_op (location_t loc, enum tree_code code, int flags,
6008 tree arg1, tree arg2, tree arg3,
6009 tree *overload, tsubst_flags_t complain)
6011 tree ret;
6012 bool subtime = timevar_cond_start (TV_OVERLOAD);
6013 ret = build_new_op_1 (loc, code, flags, arg1, arg2, arg3,
6014 overload, complain);
6015 timevar_cond_stop (TV_OVERLOAD, subtime);
6016 return ret;
6019 /* CALL was returned by some call-building function; extract the actual
6020 CALL_EXPR from any bits that have been tacked on, e.g. by
6021 convert_from_reference. */
6023 tree
6024 extract_call_expr (tree call)
6026 while (TREE_CODE (call) == COMPOUND_EXPR)
6027 call = TREE_OPERAND (call, 1);
6028 if (REFERENCE_REF_P (call))
6029 call = TREE_OPERAND (call, 0);
6030 if (TREE_CODE (call) == TARGET_EXPR)
6031 call = TARGET_EXPR_INITIAL (call);
6032 gcc_assert (TREE_CODE (call) == CALL_EXPR
6033 || TREE_CODE (call) == AGGR_INIT_EXPR
6034 || call == error_mark_node);
6035 return call;
6038 /* Returns true if FN has two parameters, of which the second has type
6039 size_t. */
6041 static bool
6042 second_parm_is_size_t (tree fn)
6044 tree t = FUNCTION_ARG_CHAIN (fn);
6045 if (!t || !same_type_p (TREE_VALUE (t), size_type_node))
6046 return false;
6047 t = TREE_CHAIN (t);
6048 if (t == void_list_node)
6049 return true;
6050 if (aligned_new_threshold && t
6051 && same_type_p (TREE_VALUE (t), align_type_node)
6052 && TREE_CHAIN (t) == void_list_node)
6053 return true;
6054 return false;
6057 /* True if T, an allocation function, has std::align_val_t as its second
6058 argument. */
6060 bool
6061 aligned_allocation_fn_p (tree t)
6063 if (!aligned_new_threshold)
6064 return false;
6066 tree a = FUNCTION_ARG_CHAIN (t);
6067 return (a && same_type_p (TREE_VALUE (a), align_type_node));
6070 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6071 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6072 std::align_val_t. */
6074 static bool
6075 aligned_deallocation_fn_p (tree t)
6077 if (!aligned_new_threshold)
6078 return false;
6080 /* A template instance is never a usual deallocation function,
6081 regardless of its signature. */
6082 if (TREE_CODE (t) == TEMPLATE_DECL
6083 || primary_template_instantiation_p (t))
6084 return false;
6086 tree a = FUNCTION_ARG_CHAIN (t);
6087 if (same_type_p (TREE_VALUE (a), align_type_node)
6088 && TREE_CHAIN (a) == void_list_node)
6089 return true;
6090 if (!same_type_p (TREE_VALUE (a), size_type_node))
6091 return false;
6092 a = TREE_CHAIN (a);
6093 if (a && same_type_p (TREE_VALUE (a), align_type_node)
6094 && TREE_CHAIN (a) == void_list_node)
6095 return true;
6096 return false;
6099 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6100 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6102 bool
6103 usual_deallocation_fn_p (tree t)
6105 /* A template instance is never a usual deallocation function,
6106 regardless of its signature. */
6107 if (TREE_CODE (t) == TEMPLATE_DECL
6108 || primary_template_instantiation_p (t))
6109 return false;
6111 /* If a class T has a member deallocation function named operator delete
6112 with exactly one parameter, then that function is a usual
6113 (non-placement) deallocation function. If class T does not declare
6114 such an operator delete but does declare a member deallocation
6115 function named operator delete with exactly two parameters, the second
6116 of which has type std::size_t (18.2), then this function is a usual
6117 deallocation function. */
6118 bool global = DECL_NAMESPACE_SCOPE_P (t);
6119 tree chain = FUNCTION_ARG_CHAIN (t);
6120 if (!chain)
6121 return false;
6122 if (chain == void_list_node
6123 || ((!global || flag_sized_deallocation)
6124 && second_parm_is_size_t (t)))
6125 return true;
6126 if (aligned_deallocation_fn_p (t))
6127 return true;
6128 return false;
6131 /* Build a call to operator delete. This has to be handled very specially,
6132 because the restrictions on what signatures match are different from all
6133 other call instances. For a normal delete, only a delete taking (void *)
6134 or (void *, size_t) is accepted. For a placement delete, only an exact
6135 match with the placement new is accepted.
6137 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6138 ADDR is the pointer to be deleted.
6139 SIZE is the size of the memory block to be deleted.
6140 GLOBAL_P is true if the delete-expression should not consider
6141 class-specific delete operators.
6142 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6144 If this call to "operator delete" is being generated as part to
6145 deallocate memory allocated via a new-expression (as per [expr.new]
6146 which requires that if the initialization throws an exception then
6147 we call a deallocation function), then ALLOC_FN is the allocation
6148 function. */
6150 tree
6151 build_op_delete_call (enum tree_code code, tree addr, tree size,
6152 bool global_p, tree placement,
6153 tree alloc_fn, tsubst_flags_t complain)
6155 tree fn = NULL_TREE;
6156 tree fns, fnname, type, t;
6158 if (addr == error_mark_node)
6159 return error_mark_node;
6161 type = strip_array_types (TREE_TYPE (TREE_TYPE (addr)));
6163 fnname = ansi_opname (code);
6165 if (CLASS_TYPE_P (type)
6166 && COMPLETE_TYPE_P (complete_type (type))
6167 && !global_p)
6168 /* In [class.free]
6170 If the result of the lookup is ambiguous or inaccessible, or if
6171 the lookup selects a placement deallocation function, the
6172 program is ill-formed.
6174 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6176 fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1);
6177 if (fns == error_mark_node)
6178 return error_mark_node;
6180 else
6181 fns = NULL_TREE;
6183 if (fns == NULL_TREE)
6184 fns = lookup_name_nonclass (fnname);
6186 /* Strip const and volatile from addr. */
6187 addr = cp_convert (ptr_type_node, addr, complain);
6189 if (placement)
6191 /* "A declaration of a placement deallocation function matches the
6192 declaration of a placement allocation function if it has the same
6193 number of parameters and, after parameter transformations (8.3.5),
6194 all parameter types except the first are identical."
6196 So we build up the function type we want and ask instantiate_type
6197 to get it for us. */
6198 t = FUNCTION_ARG_CHAIN (alloc_fn);
6199 t = tree_cons (NULL_TREE, ptr_type_node, t);
6200 t = build_function_type (void_type_node, t);
6202 fn = instantiate_type (t, fns, tf_none);
6203 if (fn == error_mark_node)
6204 return NULL_TREE;
6206 if (BASELINK_P (fn))
6207 fn = BASELINK_FUNCTIONS (fn);
6209 /* "If the lookup finds the two-parameter form of a usual deallocation
6210 function (3.7.4.2) and that function, considered as a placement
6211 deallocation function, would have been selected as a match for the
6212 allocation function, the program is ill-formed." */
6213 if (second_parm_is_size_t (fn))
6215 const char *msg1
6216 = G_("exception cleanup for this placement new selects "
6217 "non-placement operator delete");
6218 const char *msg2
6219 = G_("%qD is a usual (non-placement) deallocation "
6220 "function in C++14 (or with -fsized-deallocation)");
6222 /* But if the class has an operator delete (void *), then that is
6223 the usual deallocation function, so we shouldn't complain
6224 about using the operator delete (void *, size_t). */
6225 if (DECL_CLASS_SCOPE_P (fn))
6226 for (t = BASELINK_P (fns) ? BASELINK_FUNCTIONS (fns) : fns;
6227 t; t = OVL_NEXT (t))
6229 tree elt = OVL_CURRENT (t);
6230 if (usual_deallocation_fn_p (elt)
6231 && FUNCTION_ARG_CHAIN (elt) == void_list_node)
6232 goto ok;
6234 /* Before C++14 a two-parameter global deallocation function is
6235 always a placement deallocation function, but warn if
6236 -Wc++14-compat. */
6237 else if (!flag_sized_deallocation)
6239 if ((complain & tf_warning)
6240 && warning (OPT_Wc__14_compat, msg1))
6241 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
6242 goto ok;
6245 if (complain & tf_warning_or_error)
6247 if (permerror (input_location, msg1))
6249 /* Only mention C++14 for namespace-scope delete. */
6250 if (DECL_NAMESPACE_SCOPE_P (fn))
6251 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
6252 else
6253 inform (DECL_SOURCE_LOCATION (fn),
6254 "%qD is a usual (non-placement) deallocation "
6255 "function", fn);
6258 else
6259 return error_mark_node;
6260 ok:;
6263 else
6264 /* "Any non-placement deallocation function matches a non-placement
6265 allocation function. If the lookup finds a single matching
6266 deallocation function, that function will be called; otherwise, no
6267 deallocation function will be called." */
6268 for (t = BASELINK_P (fns) ? BASELINK_FUNCTIONS (fns) : fns;
6269 t; t = OVL_NEXT (t))
6271 tree elt = OVL_CURRENT (t);
6272 if (usual_deallocation_fn_p (elt))
6274 if (!fn)
6276 fn = elt;
6277 continue;
6280 /* -- If the type has new-extended alignment, a function with a
6281 parameter of type std::align_val_t is preferred; otherwise a
6282 function without such a parameter is preferred. If exactly one
6283 preferred function is found, that function is selected and the
6284 selection process terminates. If more than one preferred
6285 function is found, all non-preferred functions are eliminated
6286 from further consideration. */
6287 if (aligned_new_threshold)
6289 bool want_align = type_has_new_extended_alignment (type);
6290 bool fn_align = aligned_deallocation_fn_p (fn);
6291 bool elt_align = aligned_deallocation_fn_p (elt);
6293 if (elt_align != fn_align)
6295 if (want_align == elt_align)
6296 fn = elt;
6297 continue;
6301 /* -- If the deallocation functions have class scope, the one
6302 without a parameter of type std::size_t is selected. */
6303 bool want_size;
6304 if (DECL_CLASS_SCOPE_P (fn))
6305 want_size = false;
6307 /* -- If the type is complete and if, for the second alternative
6308 (delete array) only, the operand is a pointer to a class type
6309 with a non-trivial destructor or a (possibly multi-dimensional)
6310 array thereof, the function with a parameter of type std::size_t
6311 is selected.
6313 -- Otherwise, it is unspecified whether a deallocation function
6314 with a parameter of type std::size_t is selected. */
6315 else
6317 want_size = COMPLETE_TYPE_P (type);
6318 if (code == VEC_DELETE_EXPR
6319 && !TYPE_VEC_NEW_USES_COOKIE (type))
6320 /* We need a cookie to determine the array size. */
6321 want_size = false;
6323 bool fn_size = second_parm_is_size_t (fn);
6324 bool elt_size = second_parm_is_size_t (elt);
6325 gcc_assert (fn_size != elt_size);
6326 if (want_size == elt_size)
6327 fn = elt;
6331 /* If we have a matching function, call it. */
6332 if (fn)
6334 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
6336 /* If the FN is a member function, make sure that it is
6337 accessible. */
6338 if (BASELINK_P (fns))
6339 perform_or_defer_access_check (BASELINK_BINFO (fns), fn, fn,
6340 complain);
6342 /* Core issue 901: It's ok to new a type with deleted delete. */
6343 if (DECL_DELETED_FN (fn) && alloc_fn)
6344 return NULL_TREE;
6346 if (placement)
6348 /* The placement args might not be suitable for overload
6349 resolution at this point, so build the call directly. */
6350 int nargs = call_expr_nargs (placement);
6351 tree *argarray = XALLOCAVEC (tree, nargs);
6352 int i;
6353 argarray[0] = addr;
6354 for (i = 1; i < nargs; i++)
6355 argarray[i] = CALL_EXPR_ARG (placement, i);
6356 if (!mark_used (fn, complain) && !(complain & tf_error))
6357 return error_mark_node;
6358 return build_cxx_call (fn, nargs, argarray, complain);
6360 else
6362 tree ret;
6363 vec<tree, va_gc> *args = make_tree_vector ();
6364 args->quick_push (addr);
6365 if (second_parm_is_size_t (fn))
6366 args->quick_push (size);
6367 if (aligned_deallocation_fn_p (fn))
6369 tree al = build_int_cst (align_type_node, TYPE_ALIGN_UNIT (type));
6370 args->quick_push (al);
6372 ret = cp_build_function_call_vec (fn, &args, complain);
6373 release_tree_vector (args);
6374 return ret;
6378 /* [expr.new]
6380 If no unambiguous matching deallocation function can be found,
6381 propagating the exception does not cause the object's memory to
6382 be freed. */
6383 if (alloc_fn)
6385 if ((complain & tf_warning)
6386 && !placement)
6387 warning (0, "no corresponding deallocation function for %qD",
6388 alloc_fn);
6389 return NULL_TREE;
6392 if (complain & tf_error)
6393 error ("no suitable %<operator %s%> for %qT",
6394 operator_name_info[(int)code].name, type);
6395 return error_mark_node;
6398 /* If the current scope isn't allowed to access DECL along
6399 BASETYPE_PATH, give an error. The most derived class in
6400 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6401 the declaration to use in the error diagnostic. */
6403 bool
6404 enforce_access (tree basetype_path, tree decl, tree diag_decl,
6405 tsubst_flags_t complain)
6407 gcc_assert (TREE_CODE (basetype_path) == TREE_BINFO);
6409 if (flag_new_inheriting_ctors
6410 && DECL_INHERITED_CTOR (decl))
6412 /* 7.3.3/18: The additional constructors are accessible if they would be
6413 accessible when used to construct an object of the corresponding base
6414 class. */
6415 decl = strip_inheriting_ctors (decl);
6416 basetype_path = TYPE_BINFO (DECL_CONTEXT (decl));
6419 if (!accessible_p (basetype_path, decl, true))
6421 if (complain & tf_error)
6423 if (flag_new_inheriting_ctors)
6424 diag_decl = strip_inheriting_ctors (diag_decl);
6425 if (TREE_PRIVATE (decl))
6427 error ("%q#D is private within this context", diag_decl);
6428 inform (DECL_SOURCE_LOCATION (diag_decl),
6429 "declared private here");
6431 else if (TREE_PROTECTED (decl))
6433 error ("%q#D is protected within this context", diag_decl);
6434 inform (DECL_SOURCE_LOCATION (diag_decl),
6435 "declared protected here");
6437 else
6439 error ("%q#D is inaccessible within this context", diag_decl);
6440 inform (DECL_SOURCE_LOCATION (diag_decl), "declared here");
6443 return false;
6446 return true;
6449 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6450 bitwise or of LOOKUP_* values. If any errors are warnings are
6451 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6452 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6453 to NULL. */
6455 static tree
6456 build_temp (tree expr, tree type, int flags,
6457 diagnostic_t *diagnostic_kind, tsubst_flags_t complain)
6459 int savew, savee;
6460 vec<tree, va_gc> *args;
6462 *diagnostic_kind = DK_UNSPECIFIED;
6464 /* If the source is a packed field, calling the copy constructor will require
6465 binding the field to the reference parameter to the copy constructor, and
6466 we'll end up with an infinite loop. If we can use a bitwise copy, then
6467 do that now. */
6468 if ((lvalue_kind (expr) & clk_packed)
6469 && CLASS_TYPE_P (TREE_TYPE (expr))
6470 && !type_has_nontrivial_copy_init (TREE_TYPE (expr)))
6471 return get_target_expr_sfinae (expr, complain);
6473 savew = warningcount + werrorcount, savee = errorcount;
6474 args = make_tree_vector_single (expr);
6475 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
6476 &args, type, flags, complain);
6477 release_tree_vector (args);
6478 if (warningcount + werrorcount > savew)
6479 *diagnostic_kind = DK_WARNING;
6480 else if (errorcount > savee)
6481 *diagnostic_kind = DK_ERROR;
6482 return expr;
6485 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6486 EXPR is implicitly converted to type TOTYPE.
6487 FN and ARGNUM are used for diagnostics. */
6489 static void
6490 conversion_null_warnings (tree totype, tree expr, tree fn, int argnum)
6492 /* Issue warnings about peculiar, but valid, uses of NULL. */
6493 if (expr == null_node && TREE_CODE (totype) != BOOLEAN_TYPE
6494 && ARITHMETIC_TYPE_P (totype))
6496 source_location loc =
6497 expansion_point_location_if_in_system_header (input_location);
6499 if (fn)
6500 warning_at (loc, OPT_Wconversion_null,
6501 "passing NULL to non-pointer argument %P of %qD",
6502 argnum, fn);
6503 else
6504 warning_at (loc, OPT_Wconversion_null,
6505 "converting to non-pointer type %qT from NULL", totype);
6508 /* Issue warnings if "false" is converted to a NULL pointer */
6509 else if (TREE_CODE (TREE_TYPE (expr)) == BOOLEAN_TYPE
6510 && TYPE_PTR_P (totype))
6512 if (fn)
6513 warning_at (input_location, OPT_Wconversion_null,
6514 "converting %<false%> to pointer type for argument %P "
6515 "of %qD", argnum, fn);
6516 else
6517 warning_at (input_location, OPT_Wconversion_null,
6518 "converting %<false%> to pointer type %qT", totype);
6522 /* We gave a diagnostic during a conversion. If this was in the second
6523 standard conversion sequence of a user-defined conversion sequence, say
6524 which user-defined conversion. */
6526 static void
6527 maybe_print_user_conv_context (conversion *convs)
6529 if (convs->user_conv_p)
6530 for (conversion *t = convs; t; t = next_conversion (t))
6531 if (t->kind == ck_user)
6533 print_z_candidate (0, " after user-defined conversion:",
6534 t->cand);
6535 break;
6539 /* Perform the conversions in CONVS on the expression EXPR. FN and
6540 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6541 indicates the `this' argument of a method. INNER is nonzero when
6542 being called to continue a conversion chain. It is negative when a
6543 reference binding will be applied, positive otherwise. If
6544 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6545 conversions will be emitted if appropriate. If C_CAST_P is true,
6546 this conversion is coming from a C-style cast; in that case,
6547 conversions to inaccessible bases are permitted. */
6549 static tree
6550 convert_like_real (conversion *convs, tree expr, tree fn, int argnum,
6551 int inner, bool issue_conversion_warnings,
6552 bool c_cast_p, tsubst_flags_t complain)
6554 tree totype = convs->type;
6555 diagnostic_t diag_kind;
6556 int flags;
6557 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
6559 if (convs->bad_p && !(complain & tf_error))
6560 return error_mark_node;
6562 if (convs->bad_p
6563 && convs->kind != ck_user
6564 && convs->kind != ck_list
6565 && convs->kind != ck_ambig
6566 && (convs->kind != ck_ref_bind
6567 || (convs->user_conv_p && next_conversion (convs)->bad_p))
6568 && (convs->kind != ck_rvalue
6569 || SCALAR_TYPE_P (totype))
6570 && convs->kind != ck_base)
6572 bool complained = false;
6573 conversion *t = convs;
6575 /* Give a helpful error if this is bad because of excess braces. */
6576 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6577 && SCALAR_TYPE_P (totype)
6578 && CONSTRUCTOR_NELTS (expr) > 0
6579 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr, 0)->value))
6581 complained = permerror (loc, "too many braces around initializer "
6582 "for %qT", totype);
6583 while (BRACE_ENCLOSED_INITIALIZER_P (expr)
6584 && CONSTRUCTOR_NELTS (expr) == 1)
6585 expr = CONSTRUCTOR_ELT (expr, 0)->value;
6588 /* Give a helpful error if this is bad because a conversion to bool
6589 from std::nullptr_t requires direct-initialization. */
6590 if (NULLPTR_TYPE_P (TREE_TYPE (expr))
6591 && TREE_CODE (totype) == BOOLEAN_TYPE)
6592 complained = permerror (loc, "converting to %qT from %qT requires "
6593 "direct-initialization",
6594 totype, TREE_TYPE (expr));
6596 for (; t ; t = next_conversion (t))
6598 if (t->kind == ck_user && t->cand->reason)
6600 complained = permerror (loc, "invalid user-defined conversion "
6601 "from %qT to %qT", TREE_TYPE (expr),
6602 totype);
6603 if (complained)
6604 print_z_candidate (loc, "candidate is:", t->cand);
6605 expr = convert_like_real (t, expr, fn, argnum, 1,
6606 /*issue_conversion_warnings=*/false,
6607 /*c_cast_p=*/false,
6608 complain);
6609 if (convs->kind == ck_ref_bind)
6610 expr = convert_to_reference (totype, expr, CONV_IMPLICIT,
6611 LOOKUP_NORMAL, NULL_TREE,
6612 complain);
6613 else
6614 expr = cp_convert (totype, expr, complain);
6615 if (complained && fn)
6616 inform (DECL_SOURCE_LOCATION (fn),
6617 " initializing argument %P of %qD", argnum, fn);
6618 return expr;
6620 else if (t->kind == ck_user || !t->bad_p)
6622 expr = convert_like_real (t, expr, fn, argnum, 1,
6623 /*issue_conversion_warnings=*/false,
6624 /*c_cast_p=*/false,
6625 complain);
6626 break;
6628 else if (t->kind == ck_ambig)
6629 return convert_like_real (t, expr, fn, argnum, 1,
6630 /*issue_conversion_warnings=*/false,
6631 /*c_cast_p=*/false,
6632 complain);
6633 else if (t->kind == ck_identity)
6634 break;
6636 if (!complained)
6637 complained = permerror (loc, "invalid conversion from %qT to %qT",
6638 TREE_TYPE (expr), totype);
6639 if (complained && fn)
6640 inform (DECL_SOURCE_LOCATION (fn),
6641 " initializing argument %P of %qD", argnum, fn);
6643 return cp_convert (totype, expr, complain);
6646 if (issue_conversion_warnings && (complain & tf_warning))
6647 conversion_null_warnings (totype, expr, fn, argnum);
6649 switch (convs->kind)
6651 case ck_user:
6653 struct z_candidate *cand = convs->cand;
6654 tree convfn = cand->fn;
6656 /* When converting from an init list we consider explicit
6657 constructors, but actually trying to call one is an error. */
6658 if (DECL_NONCONVERTING_P (convfn) && DECL_CONSTRUCTOR_P (convfn)
6659 && BRACE_ENCLOSED_INITIALIZER_P (expr)
6660 /* Unless this is for direct-list-initialization. */
6661 && !CONSTRUCTOR_IS_DIRECT_INIT (expr)
6662 /* And in C++98 a default constructor can't be explicit. */
6663 && cxx_dialect >= cxx11)
6665 if (!(complain & tf_error))
6666 return error_mark_node;
6667 location_t loc = location_of (expr);
6668 if (CONSTRUCTOR_NELTS (expr) == 0
6669 && FUNCTION_FIRST_USER_PARMTYPE (convfn) != void_list_node)
6671 if (pedwarn (loc, 0, "converting to %qT from initializer list "
6672 "would use explicit constructor %qD",
6673 totype, convfn))
6674 inform (loc, "in C++11 and above a default constructor "
6675 "can be explicit");
6677 else
6678 error ("converting to %qT from initializer list would use "
6679 "explicit constructor %qD", totype, convfn);
6682 /* If we're initializing from {}, it's value-initialization. */
6683 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6684 && CONSTRUCTOR_NELTS (expr) == 0
6685 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
6687 bool direct = CONSTRUCTOR_IS_DIRECT_INIT (expr);
6688 expr = build_value_init (totype, complain);
6689 expr = get_target_expr_sfinae (expr, complain);
6690 if (expr != error_mark_node)
6692 TARGET_EXPR_LIST_INIT_P (expr) = true;
6693 TARGET_EXPR_DIRECT_INIT_P (expr) = direct;
6695 return expr;
6698 expr = mark_rvalue_use (expr);
6700 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
6701 any more UDCs. */
6702 expr = build_over_call (cand, LOOKUP_NORMAL|LOOKUP_NO_CONVERSION,
6703 complain);
6705 /* If this is a constructor or a function returning an aggr type,
6706 we need to build up a TARGET_EXPR. */
6707 if (DECL_CONSTRUCTOR_P (convfn))
6709 expr = build_cplus_new (totype, expr, complain);
6711 /* Remember that this was list-initialization. */
6712 if (convs->check_narrowing && expr != error_mark_node)
6713 TARGET_EXPR_LIST_INIT_P (expr) = true;
6716 return expr;
6718 case ck_identity:
6719 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
6721 int nelts = CONSTRUCTOR_NELTS (expr);
6722 if (nelts == 0)
6723 expr = build_value_init (totype, complain);
6724 else if (nelts == 1)
6725 expr = CONSTRUCTOR_ELT (expr, 0)->value;
6726 else
6727 gcc_unreachable ();
6729 expr = mark_rvalue_use (expr);
6731 if (type_unknown_p (expr))
6732 expr = instantiate_type (totype, expr, complain);
6733 /* Convert a constant to its underlying value, unless we are
6734 about to bind it to a reference, in which case we need to
6735 leave it as an lvalue. */
6736 if (inner >= 0)
6738 expr = scalar_constant_value (expr);
6739 if (expr == null_node && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype))
6740 /* If __null has been converted to an integer type, we do not
6741 want to warn about uses of EXPR as an integer, rather than
6742 as a pointer. */
6743 expr = build_int_cst (totype, 0);
6745 return expr;
6746 case ck_ambig:
6747 /* We leave bad_p off ck_ambig because overload resolution considers
6748 it valid, it just fails when we try to perform it. So we need to
6749 check complain here, too. */
6750 if (complain & tf_error)
6752 /* Call build_user_type_conversion again for the error. */
6753 build_user_type_conversion (totype, convs->u.expr, LOOKUP_NORMAL,
6754 complain);
6755 if (fn)
6756 inform (DECL_SOURCE_LOCATION (fn),
6757 " initializing argument %P of %qD", argnum, fn);
6759 return error_mark_node;
6761 case ck_list:
6763 /* Conversion to std::initializer_list<T>. */
6764 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype), 0);
6765 tree new_ctor = build_constructor (init_list_type_node, NULL);
6766 unsigned len = CONSTRUCTOR_NELTS (expr);
6767 tree array, val, field;
6768 vec<constructor_elt, va_gc> *vec = NULL;
6769 unsigned ix;
6771 /* Convert all the elements. */
6772 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr), ix, val)
6774 tree sub = convert_like_real (convs->u.list[ix], val, fn, argnum,
6775 1, false, false, complain);
6776 if (sub == error_mark_node)
6777 return sub;
6778 if (!BRACE_ENCLOSED_INITIALIZER_P (val)
6779 && !check_narrowing (TREE_TYPE (sub), val, complain))
6780 return error_mark_node;
6781 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor), NULL_TREE, sub);
6782 if (!TREE_CONSTANT (sub))
6783 TREE_CONSTANT (new_ctor) = false;
6785 /* Build up the array. */
6786 elttype = cp_build_qualified_type
6787 (elttype, cp_type_quals (elttype) | TYPE_QUAL_CONST);
6788 array = build_array_of_n_type (elttype, len);
6789 array = finish_compound_literal (array, new_ctor, complain);
6790 /* Take the address explicitly rather than via decay_conversion
6791 to avoid the error about taking the address of a temporary. */
6792 array = cp_build_addr_expr (array, complain);
6793 array = cp_convert (build_pointer_type (elttype), array, complain);
6794 if (array == error_mark_node)
6795 return error_mark_node;
6797 /* Build up the initializer_list object. */
6798 totype = complete_type (totype);
6799 field = next_initializable_field (TYPE_FIELDS (totype));
6800 CONSTRUCTOR_APPEND_ELT (vec, field, array);
6801 field = next_initializable_field (DECL_CHAIN (field));
6802 CONSTRUCTOR_APPEND_ELT (vec, field, size_int (len));
6803 new_ctor = build_constructor (totype, vec);
6804 return get_target_expr_sfinae (new_ctor, complain);
6807 case ck_aggr:
6808 if (TREE_CODE (totype) == COMPLEX_TYPE)
6810 tree real = CONSTRUCTOR_ELT (expr, 0)->value;
6811 tree imag = CONSTRUCTOR_ELT (expr, 1)->value;
6812 real = perform_implicit_conversion (TREE_TYPE (totype),
6813 real, complain);
6814 imag = perform_implicit_conversion (TREE_TYPE (totype),
6815 imag, complain);
6816 expr = build2 (COMPLEX_EXPR, totype, real, imag);
6817 return expr;
6819 expr = reshape_init (totype, expr, complain);
6820 expr = get_target_expr_sfinae (digest_init (totype, expr, complain),
6821 complain);
6822 if (expr != error_mark_node)
6823 TARGET_EXPR_LIST_INIT_P (expr) = true;
6824 return expr;
6826 default:
6827 break;
6830 expr = convert_like_real (next_conversion (convs), expr, fn, argnum,
6831 convs->kind == ck_ref_bind ? -1 : 1,
6832 convs->kind == ck_ref_bind ? issue_conversion_warnings : false,
6833 c_cast_p,
6834 complain);
6835 if (expr == error_mark_node)
6836 return error_mark_node;
6838 switch (convs->kind)
6840 case ck_rvalue:
6841 expr = decay_conversion (expr, complain);
6842 if (expr == error_mark_node)
6844 if (complain & tf_error)
6846 maybe_print_user_conv_context (convs);
6847 if (fn)
6848 inform (DECL_SOURCE_LOCATION (fn),
6849 " initializing argument %P of %qD", argnum, fn);
6851 return error_mark_node;
6854 if (! MAYBE_CLASS_TYPE_P (totype))
6855 return expr;
6857 /* Don't introduce copies when passing arguments along to the inherited
6858 constructor. */
6859 if (current_function_decl
6860 && flag_new_inheriting_ctors
6861 && DECL_INHERITED_CTOR (current_function_decl))
6862 return expr;
6864 /* Fall through. */
6865 case ck_base:
6866 if (convs->kind == ck_base && !convs->need_temporary_p)
6868 /* We are going to bind a reference directly to a base-class
6869 subobject of EXPR. */
6870 /* Build an expression for `*((base*) &expr)'. */
6871 expr = convert_to_base (expr, totype,
6872 !c_cast_p, /*nonnull=*/true, complain);
6873 return expr;
6876 /* Copy-initialization where the cv-unqualified version of the source
6877 type is the same class as, or a derived class of, the class of the
6878 destination [is treated as direct-initialization]. [dcl.init] */
6879 flags = LOOKUP_NORMAL;
6880 if (convs->user_conv_p)
6881 /* This conversion is being done in the context of a user-defined
6882 conversion (i.e. the second step of copy-initialization), so
6883 don't allow any more. */
6884 flags |= LOOKUP_NO_CONVERSION;
6885 else
6886 flags |= LOOKUP_ONLYCONVERTING;
6887 if (convs->rvaluedness_matches_p)
6888 flags |= LOOKUP_PREFER_RVALUE;
6889 if (TREE_CODE (expr) == TARGET_EXPR
6890 && TARGET_EXPR_LIST_INIT_P (expr))
6891 /* Copy-list-initialization doesn't actually involve a copy. */
6892 return expr;
6893 expr = build_temp (expr, totype, flags, &diag_kind, complain);
6894 if (diag_kind && complain)
6896 maybe_print_user_conv_context (convs);
6897 if (fn)
6898 inform (DECL_SOURCE_LOCATION (fn),
6899 " initializing argument %P of %qD", argnum, fn);
6902 return build_cplus_new (totype, expr, complain);
6904 case ck_ref_bind:
6906 tree ref_type = totype;
6908 if (convs->bad_p && !next_conversion (convs)->bad_p)
6910 tree extype = TREE_TYPE (expr);
6911 if (TYPE_REF_IS_RVALUE (ref_type)
6912 && lvalue_p (expr))
6913 error_at (loc, "cannot bind rvalue reference of type %qT to "
6914 "lvalue of type %qT", totype, extype);
6915 else if (!TYPE_REF_IS_RVALUE (ref_type) && !lvalue_p (expr)
6916 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type)))
6917 error_at (loc, "cannot bind non-const lvalue reference of "
6918 "type %qT to an rvalue of type %qT", totype, extype);
6919 else if (!reference_compatible_p (TREE_TYPE (totype), extype))
6920 error_at (loc, "binding reference of type %qT to %qT "
6921 "discards qualifiers", totype, extype);
6922 else
6923 gcc_unreachable ();
6924 maybe_print_user_conv_context (convs);
6925 if (fn)
6926 inform (DECL_SOURCE_LOCATION (fn),
6927 " initializing argument %P of %qD", argnum, fn);
6928 return error_mark_node;
6931 /* If necessary, create a temporary.
6933 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
6934 that need temporaries, even when their types are reference
6935 compatible with the type of reference being bound, so the
6936 upcoming call to cp_build_addr_expr doesn't fail. */
6937 if (convs->need_temporary_p
6938 || TREE_CODE (expr) == CONSTRUCTOR
6939 || TREE_CODE (expr) == VA_ARG_EXPR)
6941 /* Otherwise, a temporary of type "cv1 T1" is created and
6942 initialized from the initializer expression using the rules
6943 for a non-reference copy-initialization (8.5). */
6945 tree type = TREE_TYPE (ref_type);
6946 cp_lvalue_kind lvalue = lvalue_kind (expr);
6948 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6949 (type, next_conversion (convs)->type));
6950 if (!CP_TYPE_CONST_NON_VOLATILE_P (type)
6951 && !TYPE_REF_IS_RVALUE (ref_type))
6953 /* If the reference is volatile or non-const, we
6954 cannot create a temporary. */
6955 if (lvalue & clk_bitfield)
6956 error_at (loc, "cannot bind bitfield %qE to %qT",
6957 expr, ref_type);
6958 else if (lvalue & clk_packed)
6959 error_at (loc, "cannot bind packed field %qE to %qT",
6960 expr, ref_type);
6961 else
6962 error_at (loc, "cannot bind rvalue %qE to %qT",
6963 expr, ref_type);
6964 return error_mark_node;
6966 /* If the source is a packed field, and we must use a copy
6967 constructor, then building the target expr will require
6968 binding the field to the reference parameter to the
6969 copy constructor, and we'll end up with an infinite
6970 loop. If we can use a bitwise copy, then we'll be
6971 OK. */
6972 if ((lvalue & clk_packed)
6973 && CLASS_TYPE_P (type)
6974 && type_has_nontrivial_copy_init (type))
6976 error_at (loc, "cannot bind packed field %qE to %qT",
6977 expr, ref_type);
6978 return error_mark_node;
6980 if (lvalue & clk_bitfield)
6982 expr = convert_bitfield_to_declared_type (expr);
6983 expr = fold_convert (type, expr);
6985 expr = build_target_expr_with_type (expr, type, complain);
6988 /* Take the address of the thing to which we will bind the
6989 reference. */
6990 expr = cp_build_addr_expr (expr, complain);
6991 if (expr == error_mark_node)
6992 return error_mark_node;
6994 /* Convert it to a pointer to the type referred to by the
6995 reference. This will adjust the pointer if a derived to
6996 base conversion is being performed. */
6997 expr = cp_convert (build_pointer_type (TREE_TYPE (ref_type)),
6998 expr, complain);
6999 /* Convert the pointer to the desired reference type. */
7000 return build_nop (ref_type, expr);
7003 case ck_lvalue:
7004 return decay_conversion (expr, complain);
7006 case ck_fnptr:
7007 /* ??? Should the address of a transaction-safe pointer point to the TM
7008 clone, and this conversion look up the primary function? */
7009 return build_nop (totype, expr);
7011 case ck_qual:
7012 /* Warn about deprecated conversion if appropriate. */
7013 string_conv_p (totype, expr, 1);
7014 break;
7016 case ck_ptr:
7017 if (convs->base_p)
7018 expr = convert_to_base (expr, totype, !c_cast_p,
7019 /*nonnull=*/false, complain);
7020 return build_nop (totype, expr);
7022 case ck_pmem:
7023 return convert_ptrmem (totype, expr, /*allow_inverse_p=*/false,
7024 c_cast_p, complain);
7026 default:
7027 break;
7030 if (convs->check_narrowing
7031 && !check_narrowing (totype, expr, complain))
7032 return error_mark_node;
7034 if (issue_conversion_warnings)
7035 expr = cp_convert_and_check (totype, expr, complain);
7036 else
7037 expr = cp_convert (totype, expr, complain);
7039 return expr;
7042 /* ARG is being passed to a varargs function. Perform any conversions
7043 required. Return the converted value. */
7045 tree
7046 convert_arg_to_ellipsis (tree arg, tsubst_flags_t complain)
7048 tree arg_type;
7049 location_t loc = EXPR_LOC_OR_LOC (arg, input_location);
7051 /* [expr.call]
7053 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7054 standard conversions are performed. */
7055 arg = decay_conversion (arg, complain);
7056 arg_type = TREE_TYPE (arg);
7057 /* [expr.call]
7059 If the argument has integral or enumeration type that is subject
7060 to the integral promotions (_conv.prom_), or a floating point
7061 type that is subject to the floating point promotion
7062 (_conv.fpprom_), the value of the argument is converted to the
7063 promoted type before the call. */
7064 if (TREE_CODE (arg_type) == REAL_TYPE
7065 && (TYPE_PRECISION (arg_type)
7066 < TYPE_PRECISION (double_type_node))
7067 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type)))
7069 if ((complain & tf_warning)
7070 && warn_double_promotion && !c_inhibit_evaluation_warnings)
7071 warning_at (loc, OPT_Wdouble_promotion,
7072 "implicit conversion from %qT to %qT when passing "
7073 "argument to function",
7074 arg_type, double_type_node);
7075 arg = convert_to_real_nofold (double_type_node, arg);
7077 else if (NULLPTR_TYPE_P (arg_type))
7078 arg = null_pointer_node;
7079 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type))
7081 if (SCOPED_ENUM_P (arg_type))
7083 tree prom = cp_convert (ENUM_UNDERLYING_TYPE (arg_type), arg,
7084 complain);
7085 prom = cp_perform_integral_promotions (prom, complain);
7086 if (abi_version_crosses (6)
7087 && TYPE_MODE (TREE_TYPE (prom)) != TYPE_MODE (arg_type)
7088 && (complain & tf_warning))
7089 warning_at (loc, OPT_Wabi, "scoped enum %qT passed through ... as "
7090 "%qT before -fabi-version=6, %qT after", arg_type,
7091 TREE_TYPE (prom), ENUM_UNDERLYING_TYPE (arg_type));
7092 if (!abi_version_at_least (6))
7093 arg = prom;
7095 else
7096 arg = cp_perform_integral_promotions (arg, complain);
7099 arg = require_complete_type_sfinae (arg, complain);
7100 arg_type = TREE_TYPE (arg);
7102 if (arg != error_mark_node
7103 /* In a template (or ill-formed code), we can have an incomplete type
7104 even after require_complete_type_sfinae, in which case we don't know
7105 whether it has trivial copy or not. */
7106 && COMPLETE_TYPE_P (arg_type))
7108 /* Build up a real lvalue-to-rvalue conversion in case the
7109 copy constructor is trivial but not callable. */
7110 if (!cp_unevaluated_operand && CLASS_TYPE_P (arg_type))
7111 force_rvalue (arg, complain);
7113 /* [expr.call] 5.2.2/7:
7114 Passing a potentially-evaluated argument of class type (Clause 9)
7115 with a non-trivial copy constructor or a non-trivial destructor
7116 with no corresponding parameter is conditionally-supported, with
7117 implementation-defined semantics.
7119 We support it as pass-by-invisible-reference, just like a normal
7120 value parameter.
7122 If the call appears in the context of a sizeof expression,
7123 it is not potentially-evaluated. */
7124 if (cp_unevaluated_operand == 0
7125 && (type_has_nontrivial_copy_init (arg_type)
7126 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type)))
7128 if (complain & tf_warning)
7129 warning (OPT_Wconditionally_supported,
7130 "passing objects of non-trivially-copyable "
7131 "type %q#T through %<...%> is conditionally supported",
7132 arg_type);
7133 return cp_build_addr_expr (arg, complain);
7137 return arg;
7140 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7142 tree
7143 build_x_va_arg (source_location loc, tree expr, tree type)
7145 if (processing_template_decl)
7147 tree r = build_min (VA_ARG_EXPR, type, expr);
7148 SET_EXPR_LOCATION (r, loc);
7149 return r;
7152 type = complete_type_or_else (type, NULL_TREE);
7154 if (expr == error_mark_node || !type)
7155 return error_mark_node;
7157 expr = mark_lvalue_use (expr);
7159 if (TREE_CODE (type) == REFERENCE_TYPE)
7161 error ("cannot receive reference type %qT through %<...%>", type);
7162 return error_mark_node;
7165 if (type_has_nontrivial_copy_init (type)
7166 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
7168 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7169 it as pass by invisible reference. */
7170 warning_at (loc, OPT_Wconditionally_supported,
7171 "receiving objects of non-trivially-copyable type %q#T "
7172 "through %<...%> is conditionally-supported", type);
7174 tree ref = cp_build_reference_type (type, false);
7175 expr = build_va_arg (loc, expr, ref);
7176 return convert_from_reference (expr);
7179 tree ret = build_va_arg (loc, expr, type);
7180 if (CLASS_TYPE_P (type))
7181 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7182 know how to handle it. */
7183 ret = get_target_expr (ret);
7184 return ret;
7187 /* TYPE has been given to va_arg. Apply the default conversions which
7188 would have happened when passed via ellipsis. Return the promoted
7189 type, or the passed type if there is no change. */
7191 tree
7192 cxx_type_promotes_to (tree type)
7194 tree promote;
7196 /* Perform the array-to-pointer and function-to-pointer
7197 conversions. */
7198 type = type_decays_to (type);
7200 promote = type_promotes_to (type);
7201 if (same_type_p (type, promote))
7202 promote = type;
7204 return promote;
7207 /* ARG is a default argument expression being passed to a parameter of
7208 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7209 zero-based argument number. Do any required conversions. Return
7210 the converted value. */
7212 static GTY(()) vec<tree, va_gc> *default_arg_context;
7213 void
7214 push_defarg_context (tree fn)
7215 { vec_safe_push (default_arg_context, fn); }
7217 void
7218 pop_defarg_context (void)
7219 { default_arg_context->pop (); }
7221 tree
7222 convert_default_arg (tree type, tree arg, tree fn, int parmnum,
7223 tsubst_flags_t complain)
7225 int i;
7226 tree t;
7228 /* See through clones. */
7229 fn = DECL_ORIGIN (fn);
7230 /* And inheriting ctors. */
7231 if (flag_new_inheriting_ctors)
7232 fn = strip_inheriting_ctors (fn);
7234 /* Detect recursion. */
7235 FOR_EACH_VEC_SAFE_ELT (default_arg_context, i, t)
7236 if (t == fn)
7238 if (complain & tf_error)
7239 error ("recursive evaluation of default argument for %q#D", fn);
7240 return error_mark_node;
7243 /* If the ARG is an unparsed default argument expression, the
7244 conversion cannot be performed. */
7245 if (TREE_CODE (arg) == DEFAULT_ARG)
7247 if (complain & tf_error)
7248 error ("call to %qD uses the default argument for parameter %P, which "
7249 "is not yet defined", fn, parmnum);
7250 return error_mark_node;
7253 push_defarg_context (fn);
7255 if (fn && DECL_TEMPLATE_INFO (fn))
7256 arg = tsubst_default_argument (fn, type, arg, complain);
7258 /* Due to:
7260 [dcl.fct.default]
7262 The names in the expression are bound, and the semantic
7263 constraints are checked, at the point where the default
7264 expressions appears.
7266 we must not perform access checks here. */
7267 push_deferring_access_checks (dk_no_check);
7268 /* We must make a copy of ARG, in case subsequent processing
7269 alters any part of it. */
7270 arg = break_out_target_exprs (arg);
7271 arg = convert_for_initialization (0, type, arg, LOOKUP_IMPLICIT,
7272 ICR_DEFAULT_ARGUMENT, fn, parmnum,
7273 complain);
7274 arg = convert_for_arg_passing (type, arg, complain);
7275 pop_deferring_access_checks();
7277 pop_defarg_context ();
7279 return arg;
7282 /* Returns the type which will really be used for passing an argument of
7283 type TYPE. */
7285 tree
7286 type_passed_as (tree type)
7288 /* Pass classes with copy ctors by invisible reference. */
7289 if (TREE_ADDRESSABLE (type))
7291 type = build_reference_type (type);
7292 /* There are no other pointers to this temporary. */
7293 type = cp_build_qualified_type (type, TYPE_QUAL_RESTRICT);
7295 else if (targetm.calls.promote_prototypes (type)
7296 && INTEGRAL_TYPE_P (type)
7297 && COMPLETE_TYPE_P (type)
7298 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
7299 type = integer_type_node;
7301 return type;
7304 /* Actually perform the appropriate conversion. */
7306 tree
7307 convert_for_arg_passing (tree type, tree val, tsubst_flags_t complain)
7309 tree bitfield_type;
7311 /* If VAL is a bitfield, then -- since it has already been converted
7312 to TYPE -- it cannot have a precision greater than TYPE.
7314 If it has a smaller precision, we must widen it here. For
7315 example, passing "int f:3;" to a function expecting an "int" will
7316 not result in any conversion before this point.
7318 If the precision is the same we must not risk widening. For
7319 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7320 often have type "int", even though the C++ type for the field is
7321 "long long". If the value is being passed to a function
7322 expecting an "int", then no conversions will be required. But,
7323 if we call convert_bitfield_to_declared_type, the bitfield will
7324 be converted to "long long". */
7325 bitfield_type = is_bitfield_expr_with_lowered_type (val);
7326 if (bitfield_type
7327 && TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type))
7328 val = convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type), val);
7330 if (val == error_mark_node)
7332 /* Pass classes with copy ctors by invisible reference. */
7333 else if (TREE_ADDRESSABLE (type))
7334 val = build1 (ADDR_EXPR, build_reference_type (type), val);
7335 else if (targetm.calls.promote_prototypes (type)
7336 && INTEGRAL_TYPE_P (type)
7337 && COMPLETE_TYPE_P (type)
7338 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
7339 val = cp_perform_integral_promotions (val, complain);
7340 if ((complain & tf_warning)
7341 && warn_suggest_attribute_format)
7343 tree rhstype = TREE_TYPE (val);
7344 const enum tree_code coder = TREE_CODE (rhstype);
7345 const enum tree_code codel = TREE_CODE (type);
7346 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
7347 && coder == codel
7348 && check_missing_format_attribute (type, rhstype))
7349 warning (OPT_Wsuggest_attribute_format,
7350 "argument of function call might be a candidate for a format attribute");
7352 return val;
7355 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7356 which just decay_conversion or no conversions at all should be done.
7357 This is true for some builtins which don't act like normal functions.
7358 Return 2 if no conversions at all should be done, 1 if just
7359 decay_conversion. Return 3 for special treatment of the 3rd argument
7360 for __builtin_*_overflow_p. */
7363 magic_varargs_p (tree fn)
7365 if (flag_cilkplus && is_cilkplus_reduce_builtin (fn) != BUILT_IN_NONE)
7366 return 2;
7368 if (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL)
7369 switch (DECL_FUNCTION_CODE (fn))
7371 case BUILT_IN_CLASSIFY_TYPE:
7372 case BUILT_IN_CONSTANT_P:
7373 case BUILT_IN_NEXT_ARG:
7374 case BUILT_IN_VA_START:
7375 return 1;
7377 case BUILT_IN_ADD_OVERFLOW_P:
7378 case BUILT_IN_SUB_OVERFLOW_P:
7379 case BUILT_IN_MUL_OVERFLOW_P:
7380 return 3;
7382 default:;
7383 return lookup_attribute ("type generic",
7384 TYPE_ATTRIBUTES (TREE_TYPE (fn))) != 0;
7387 return 0;
7390 /* Returns the decl of the dispatcher function if FN is a function version. */
7392 tree
7393 get_function_version_dispatcher (tree fn)
7395 tree dispatcher_decl = NULL;
7397 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
7398 && DECL_FUNCTION_VERSIONED (fn));
7400 gcc_assert (targetm.get_function_versions_dispatcher);
7401 dispatcher_decl = targetm.get_function_versions_dispatcher (fn);
7403 if (dispatcher_decl == NULL)
7405 error_at (input_location, "use of multiversioned function "
7406 "without a default");
7407 return NULL;
7410 retrofit_lang_decl (dispatcher_decl);
7411 gcc_assert (dispatcher_decl != NULL);
7412 return dispatcher_decl;
7415 /* fn is a function version dispatcher that is marked used. Mark all the
7416 semantically identical function versions it will dispatch as used. */
7418 void
7419 mark_versions_used (tree fn)
7421 struct cgraph_node *node;
7422 struct cgraph_function_version_info *node_v;
7423 struct cgraph_function_version_info *it_v;
7425 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7427 node = cgraph_node::get (fn);
7428 if (node == NULL)
7429 return;
7431 gcc_assert (node->dispatcher_function);
7433 node_v = node->function_version ();
7434 if (node_v == NULL)
7435 return;
7437 /* All semantically identical versions are chained. Traverse and mark each
7438 one of them as used. */
7439 it_v = node_v->next;
7440 while (it_v != NULL)
7442 mark_used (it_v->this_node->decl);
7443 it_v = it_v->next;
7447 /* Build a call to "the copy constructor" for the type of A, even if it
7448 wouldn't be selected by normal overload resolution. Used for
7449 diagnostics. */
7451 static tree
7452 call_copy_ctor (tree a, tsubst_flags_t complain)
7454 tree ctype = TYPE_MAIN_VARIANT (TREE_TYPE (a));
7455 tree binfo = TYPE_BINFO (ctype);
7456 tree copy = get_copy_ctor (ctype, complain);
7457 copy = build_baselink (binfo, binfo, copy, NULL_TREE);
7458 tree ob = build_dummy_object (ctype);
7459 vec<tree, va_gc>* args = make_tree_vector_single (a);
7460 tree r = build_new_method_call (ob, copy, &args, NULL_TREE,
7461 LOOKUP_NORMAL, NULL, complain);
7462 release_tree_vector (args);
7463 return r;
7466 /* Return true iff T refers to a base field. */
7468 static bool
7469 is_base_field_ref (tree t)
7471 STRIP_NOPS (t);
7472 if (TREE_CODE (t) == ADDR_EXPR)
7473 t = TREE_OPERAND (t, 0);
7474 if (TREE_CODE (t) == COMPONENT_REF)
7475 t = TREE_OPERAND (t, 1);
7476 if (TREE_CODE (t) == FIELD_DECL)
7477 return DECL_FIELD_IS_BASE (t);
7478 return false;
7481 /* We can't elide a copy from a function returning by value to a base
7482 subobject, as the callee might clobber tail padding. Return true iff this
7483 could be that case. */
7485 static bool
7486 unsafe_copy_elision_p (tree target, tree exp)
7488 /* Copy elision only happens with a TARGET_EXPR. */
7489 if (TREE_CODE (exp) != TARGET_EXPR)
7490 return false;
7491 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
7492 /* It's safe to elide the copy for a class with no tail padding. */
7493 if (tree_int_cst_equal (TYPE_SIZE (type), CLASSTYPE_SIZE (type)))
7494 return false;
7495 /* It's safe to elide the copy if we aren't initializing a base object. */
7496 if (!is_base_field_ref (target))
7497 return false;
7498 tree init = TARGET_EXPR_INITIAL (exp);
7499 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7500 while (TREE_CODE (init) == COMPOUND_EXPR)
7501 init = TREE_OPERAND (init, 1);
7502 return (TREE_CODE (init) == AGGR_INIT_EXPR
7503 && !AGGR_INIT_VIA_CTOR_P (init));
7506 /* Subroutine of the various build_*_call functions. Overload resolution
7507 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7508 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7509 bitmask of various LOOKUP_* flags which apply to the call itself. */
7511 static tree
7512 build_over_call (struct z_candidate *cand, int flags, tsubst_flags_t complain)
7514 tree fn = cand->fn;
7515 const vec<tree, va_gc> *args = cand->args;
7516 tree first_arg = cand->first_arg;
7517 conversion **convs = cand->convs;
7518 conversion *conv;
7519 tree parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
7520 int parmlen;
7521 tree val;
7522 int i = 0;
7523 int j = 0;
7524 unsigned int arg_index = 0;
7525 int is_method = 0;
7526 int nargs;
7527 tree *argarray;
7528 bool already_used = false;
7530 /* In a template, there is no need to perform all of the work that
7531 is normally done. We are only interested in the type of the call
7532 expression, i.e., the return type of the function. Any semantic
7533 errors will be deferred until the template is instantiated. */
7534 if (processing_template_decl)
7536 tree expr, addr;
7537 tree return_type;
7538 const tree *argarray;
7539 unsigned int nargs;
7541 return_type = TREE_TYPE (TREE_TYPE (fn));
7542 nargs = vec_safe_length (args);
7543 if (first_arg == NULL_TREE)
7544 argarray = args->address ();
7545 else
7547 tree *alcarray;
7548 unsigned int ix;
7549 tree arg;
7551 ++nargs;
7552 alcarray = XALLOCAVEC (tree, nargs);
7553 alcarray[0] = build_this (first_arg);
7554 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
7555 alcarray[ix + 1] = arg;
7556 argarray = alcarray;
7559 addr = build_addr_func (fn, complain);
7560 if (addr == error_mark_node)
7561 return error_mark_node;
7562 expr = build_call_array_loc (input_location, return_type,
7563 addr, nargs, argarray);
7564 if (TREE_THIS_VOLATILE (fn) && cfun)
7565 current_function_returns_abnormally = 1;
7566 return convert_from_reference (expr);
7569 /* Give any warnings we noticed during overload resolution. */
7570 if (cand->warnings && (complain & tf_warning))
7572 struct candidate_warning *w;
7573 for (w = cand->warnings; w; w = w->next)
7574 joust (cand, w->loser, 1, complain);
7577 /* Make =delete work with SFINAE. */
7578 if (DECL_DELETED_FN (fn) && !(complain & tf_error))
7579 return error_mark_node;
7581 if (DECL_FUNCTION_MEMBER_P (fn))
7583 tree access_fn;
7584 /* If FN is a template function, two cases must be considered.
7585 For example:
7587 struct A {
7588 protected:
7589 template <class T> void f();
7591 template <class T> struct B {
7592 protected:
7593 void g();
7595 struct C : A, B<int> {
7596 using A::f; // #1
7597 using B<int>::g; // #2
7600 In case #1 where `A::f' is a member template, DECL_ACCESS is
7601 recorded in the primary template but not in its specialization.
7602 We check access of FN using its primary template.
7604 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7605 because it is a member of class template B, DECL_ACCESS is
7606 recorded in the specialization `B<int>::g'. We cannot use its
7607 primary template because `B<T>::g' and `B<int>::g' may have
7608 different access. */
7609 if (DECL_TEMPLATE_INFO (fn)
7610 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
7611 access_fn = DECL_TI_TEMPLATE (fn);
7612 else
7613 access_fn = fn;
7614 if (!perform_or_defer_access_check (cand->access_path, access_fn,
7615 fn, complain))
7616 return error_mark_node;
7619 /* If we're checking for implicit delete, don't bother with argument
7620 conversions. */
7621 if (flags & LOOKUP_SPECULATIVE)
7623 if (DECL_DELETED_FN (fn))
7625 if (complain & tf_error)
7626 mark_used (fn);
7627 return error_mark_node;
7629 if (cand->viable == 1)
7630 return fn;
7631 else if (!(complain & tf_error))
7632 /* Reject bad conversions now. */
7633 return error_mark_node;
7634 /* else continue to get conversion error. */
7637 /* N3276 magic doesn't apply to nested calls. */
7638 int decltype_flag = (complain & tf_decltype);
7639 complain &= ~tf_decltype;
7641 /* Find maximum size of vector to hold converted arguments. */
7642 parmlen = list_length (parm);
7643 nargs = vec_safe_length (args) + (first_arg != NULL_TREE ? 1 : 0);
7644 if (parmlen > nargs)
7645 nargs = parmlen;
7646 argarray = XALLOCAVEC (tree, nargs);
7648 /* The implicit parameters to a constructor are not considered by overload
7649 resolution, and must be of the proper type. */
7650 if (DECL_CONSTRUCTOR_P (fn))
7652 tree object_arg;
7653 if (first_arg != NULL_TREE)
7655 object_arg = first_arg;
7656 first_arg = NULL_TREE;
7658 else
7660 object_arg = (*args)[arg_index];
7661 ++arg_index;
7663 argarray[j++] = build_this (object_arg);
7664 parm = TREE_CHAIN (parm);
7665 /* We should never try to call the abstract constructor. */
7666 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn));
7668 if (DECL_HAS_VTT_PARM_P (fn))
7670 argarray[j++] = (*args)[arg_index];
7671 ++arg_index;
7672 parm = TREE_CHAIN (parm);
7675 /* Bypass access control for 'this' parameter. */
7676 else if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
7678 tree parmtype = TREE_VALUE (parm);
7679 tree arg = build_this (first_arg != NULL_TREE
7680 ? first_arg
7681 : (*args)[arg_index]);
7682 tree argtype = TREE_TYPE (arg);
7683 tree converted_arg;
7684 tree base_binfo;
7686 if (convs[i]->bad_p)
7688 if (complain & tf_error)
7690 if (permerror (input_location, "passing %qT as %<this%> "
7691 "argument discards qualifiers",
7692 TREE_TYPE (argtype)))
7693 inform (DECL_SOURCE_LOCATION (fn), " in call to %qD", fn);
7695 else
7696 return error_mark_node;
7699 /* See if the function member or the whole class type is declared
7700 final and the call can be devirtualized. */
7701 if (DECL_FINAL_P (fn)
7702 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn))))
7703 flags |= LOOKUP_NONVIRTUAL;
7705 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
7706 X is called for an object that is not of type X, or of a type
7707 derived from X, the behavior is undefined.
7709 So we can assume that anything passed as 'this' is non-null, and
7710 optimize accordingly. */
7711 gcc_assert (TYPE_PTR_P (parmtype));
7712 /* Convert to the base in which the function was declared. */
7713 gcc_assert (cand->conversion_path != NULL_TREE);
7714 converted_arg = build_base_path (PLUS_EXPR,
7715 arg,
7716 cand->conversion_path,
7717 1, complain);
7718 /* Check that the base class is accessible. */
7719 if (!accessible_base_p (TREE_TYPE (argtype),
7720 BINFO_TYPE (cand->conversion_path), true))
7722 if (complain & tf_error)
7723 error ("%qT is not an accessible base of %qT",
7724 BINFO_TYPE (cand->conversion_path),
7725 TREE_TYPE (argtype));
7726 else
7727 return error_mark_node;
7729 /* If fn was found by a using declaration, the conversion path
7730 will be to the derived class, not the base declaring fn. We
7731 must convert from derived to base. */
7732 base_binfo = lookup_base (TREE_TYPE (TREE_TYPE (converted_arg)),
7733 TREE_TYPE (parmtype), ba_unique,
7734 NULL, complain);
7735 converted_arg = build_base_path (PLUS_EXPR, converted_arg,
7736 base_binfo, 1, complain);
7738 argarray[j++] = converted_arg;
7739 parm = TREE_CHAIN (parm);
7740 if (first_arg != NULL_TREE)
7741 first_arg = NULL_TREE;
7742 else
7743 ++arg_index;
7744 ++i;
7745 is_method = 1;
7748 gcc_assert (first_arg == NULL_TREE);
7749 for (; arg_index < vec_safe_length (args) && parm;
7750 parm = TREE_CHAIN (parm), ++arg_index, ++i)
7752 tree type = TREE_VALUE (parm);
7753 tree arg = (*args)[arg_index];
7754 bool conversion_warning = true;
7756 conv = convs[i];
7758 /* If the argument is NULL and used to (implicitly) instantiate a
7759 template function (and bind one of the template arguments to
7760 the type of 'long int'), we don't want to warn about passing NULL
7761 to non-pointer argument.
7762 For example, if we have this template function:
7764 template<typename T> void func(T x) {}
7766 we want to warn (when -Wconversion is enabled) in this case:
7768 void foo() {
7769 func<int>(NULL);
7772 but not in this case:
7774 void foo() {
7775 func(NULL);
7778 if (arg == null_node
7779 && DECL_TEMPLATE_INFO (fn)
7780 && cand->template_decl
7781 && !(flags & LOOKUP_EXPLICIT_TMPL_ARGS))
7782 conversion_warning = false;
7784 /* Warn about initializer_list deduction that isn't currently in the
7785 working draft. */
7786 if (cxx_dialect > cxx98
7787 && flag_deduce_init_list
7788 && cand->template_decl
7789 && is_std_init_list (non_reference (type))
7790 && BRACE_ENCLOSED_INITIALIZER_P (arg))
7792 tree tmpl = TI_TEMPLATE (cand->template_decl);
7793 tree realparm = chain_index (j, DECL_ARGUMENTS (cand->fn));
7794 tree patparm = get_pattern_parm (realparm, tmpl);
7795 tree pattype = TREE_TYPE (patparm);
7796 if (PACK_EXPANSION_P (pattype))
7797 pattype = PACK_EXPANSION_PATTERN (pattype);
7798 pattype = non_reference (pattype);
7800 if (TREE_CODE (pattype) == TEMPLATE_TYPE_PARM
7801 && (cand->explicit_targs == NULL_TREE
7802 || (TREE_VEC_LENGTH (cand->explicit_targs)
7803 <= TEMPLATE_TYPE_IDX (pattype))))
7805 pedwarn (input_location, 0, "deducing %qT as %qT",
7806 non_reference (TREE_TYPE (patparm)),
7807 non_reference (type));
7808 pedwarn (DECL_SOURCE_LOCATION (cand->fn), 0,
7809 " in call to %qD", cand->fn);
7810 pedwarn (input_location, 0,
7811 " (you can disable this with -fno-deduce-init-list)");
7815 /* Set user_conv_p on the argument conversions, so rvalue/base handling
7816 knows not to allow any more UDCs. This needs to happen after we
7817 process cand->warnings. */
7818 if (flags & LOOKUP_NO_CONVERSION)
7819 conv->user_conv_p = true;
7821 val = convert_like_with_context (conv, arg, fn, i - is_method,
7822 conversion_warning
7823 ? complain
7824 : complain & (~tf_warning));
7826 val = convert_for_arg_passing (type, val, complain);
7828 if (val == error_mark_node)
7829 return error_mark_node;
7830 else
7831 argarray[j++] = val;
7834 /* Default arguments */
7835 for (; parm && parm != void_list_node; parm = TREE_CHAIN (parm), i++)
7837 if (TREE_VALUE (parm) == error_mark_node)
7838 return error_mark_node;
7839 argarray[j++] = convert_default_arg (TREE_VALUE (parm),
7840 TREE_PURPOSE (parm),
7841 fn, i - is_method,
7842 complain);
7845 /* Ellipsis */
7846 int magic = magic_varargs_p (fn);
7847 for (; arg_index < vec_safe_length (args); ++arg_index)
7849 tree a = (*args)[arg_index];
7850 if ((magic == 3 && arg_index == 2) || magic == 2)
7852 /* Do no conversions for certain magic varargs. */
7853 a = mark_type_use (a);
7854 if (TREE_CODE (a) == FUNCTION_DECL && reject_gcc_builtin (a))
7855 return error_mark_node;
7857 else if (magic != 0)
7858 /* For other magic varargs only do decay_conversion. */
7859 a = decay_conversion (a, complain);
7860 else if (DECL_CONSTRUCTOR_P (fn)
7861 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn),
7862 TREE_TYPE (a)))
7864 /* Avoid infinite recursion trying to call A(...). */
7865 if (complain & tf_error)
7866 /* Try to call the actual copy constructor for a good error. */
7867 call_copy_ctor (a, complain);
7868 return error_mark_node;
7870 else
7871 a = convert_arg_to_ellipsis (a, complain);
7872 if (a == error_mark_node)
7873 return error_mark_node;
7874 argarray[j++] = a;
7877 gcc_assert (j <= nargs);
7878 nargs = j;
7880 /* Avoid to do argument-transformation, if warnings for format, and for
7881 nonnull are disabled. Just in case that at least one of them is active
7882 the check_function_arguments function might warn about something. */
7884 if (warn_nonnull || warn_format || warn_suggest_attribute_format)
7886 tree *fargs = (!nargs ? argarray
7887 : (tree *) alloca (nargs * sizeof (tree)));
7888 for (j = 0; j < nargs; j++)
7889 fargs[j] = maybe_constant_value (argarray[j]);
7891 check_function_arguments (input_location, TREE_TYPE (fn), nargs, fargs);
7894 if (DECL_INHERITED_CTOR (fn))
7896 /* Check for passing ellipsis arguments to an inherited constructor. We
7897 could handle this by open-coding the inherited constructor rather than
7898 defining it, but let's not bother now. */
7899 if (!cp_unevaluated_operand
7900 && cand->convs[cand->num_convs-1]->ellipsis_p)
7902 if (complain & tf_error)
7904 sorry ("passing arguments to ellipsis of inherited constructor "
7905 "%qD", cand->fn);
7906 inform (DECL_SOURCE_LOCATION (cand->fn), "declared here");
7908 return error_mark_node;
7911 /* A base constructor inheriting from a virtual base doesn't get the
7912 inherited arguments, just this and __vtt. */
7913 if (ctor_omit_inherited_parms (fn))
7914 nargs = 2;
7917 /* Avoid actually calling copy constructors and copy assignment operators,
7918 if possible. */
7920 if (! flag_elide_constructors)
7921 /* Do things the hard way. */;
7922 else if (cand->num_convs == 1
7923 && (DECL_COPY_CONSTRUCTOR_P (fn)
7924 || DECL_MOVE_CONSTRUCTOR_P (fn))
7925 /* It's unsafe to elide the constructor when handling
7926 a noexcept-expression, it may evaluate to the wrong
7927 value (c++/53025). */
7928 && cp_noexcept_operand == 0)
7930 tree targ;
7931 tree arg = argarray[num_artificial_parms_for (fn)];
7932 tree fa;
7933 bool trivial = trivial_fn_p (fn);
7935 /* Pull out the real argument, disregarding const-correctness. */
7936 targ = arg;
7937 while (CONVERT_EXPR_P (targ)
7938 || TREE_CODE (targ) == NON_LVALUE_EXPR)
7939 targ = TREE_OPERAND (targ, 0);
7940 if (TREE_CODE (targ) == ADDR_EXPR)
7942 targ = TREE_OPERAND (targ, 0);
7943 if (!same_type_ignoring_top_level_qualifiers_p
7944 (TREE_TYPE (TREE_TYPE (arg)), TREE_TYPE (targ)))
7945 targ = NULL_TREE;
7947 else
7948 targ = NULL_TREE;
7950 if (targ)
7951 arg = targ;
7952 else
7953 arg = cp_build_indirect_ref (arg, RO_NULL, complain);
7955 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
7956 subobject. */
7957 if (CHECKING_P && cxx_dialect >= cxx1z)
7958 gcc_assert (TREE_CODE (arg) != TARGET_EXPR
7959 || seen_error ()
7960 /* See unsafe_copy_elision_p. */
7961 || DECL_BASE_CONSTRUCTOR_P (fn));
7963 /* [class.copy]: the copy constructor is implicitly defined even if
7964 the implementation elided its use. */
7965 if (!trivial || DECL_DELETED_FN (fn))
7967 if (!mark_used (fn, complain) && !(complain & tf_error))
7968 return error_mark_node;
7969 already_used = true;
7972 /* If we're creating a temp and we already have one, don't create a
7973 new one. If we're not creating a temp but we get one, use
7974 INIT_EXPR to collapse the temp into our target. Otherwise, if the
7975 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
7976 temp or an INIT_EXPR otherwise. */
7977 fa = argarray[0];
7978 if (is_dummy_object (fa))
7980 if (TREE_CODE (arg) == TARGET_EXPR)
7981 return arg;
7982 else if (trivial)
7983 return force_target_expr (DECL_CONTEXT (fn), arg, complain);
7985 else if ((trivial || TREE_CODE (arg) == TARGET_EXPR)
7986 && !unsafe_copy_elision_p (fa, arg))
7988 tree to = cp_stabilize_reference (cp_build_indirect_ref (fa,
7989 RO_NULL,
7990 complain));
7992 val = build2 (INIT_EXPR, DECL_CONTEXT (fn), to, arg);
7993 return val;
7996 else if (DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR
7997 && trivial_fn_p (fn)
7998 && !DECL_DELETED_FN (fn))
8000 tree to = cp_stabilize_reference
8001 (cp_build_indirect_ref (argarray[0], RO_NULL, complain));
8002 tree type = TREE_TYPE (to);
8003 tree as_base = CLASSTYPE_AS_BASE (type);
8004 tree arg = argarray[1];
8006 if (is_really_empty_class (type))
8008 /* Avoid copying empty classes. */
8009 val = build2 (COMPOUND_EXPR, type, arg, to);
8010 TREE_NO_WARNING (val) = 1;
8012 else if (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (as_base)))
8014 arg = cp_build_indirect_ref (arg, RO_NULL, complain);
8015 val = build2 (MODIFY_EXPR, TREE_TYPE (to), to, arg);
8017 else
8019 /* We must only copy the non-tail padding parts. */
8020 tree arg0, arg2, t;
8021 tree array_type, alias_set;
8023 arg2 = TYPE_SIZE_UNIT (as_base);
8024 arg0 = cp_build_addr_expr (to, complain);
8026 array_type = build_array_type (unsigned_char_type_node,
8027 build_index_type
8028 (size_binop (MINUS_EXPR,
8029 arg2, size_int (1))));
8030 alias_set = build_int_cst (build_pointer_type (type), 0);
8031 t = build2 (MODIFY_EXPR, void_type_node,
8032 build2 (MEM_REF, array_type, arg0, alias_set),
8033 build2 (MEM_REF, array_type, arg, alias_set));
8034 val = build2 (COMPOUND_EXPR, TREE_TYPE (to), t, to);
8035 TREE_NO_WARNING (val) = 1;
8038 return val;
8040 else if (!DECL_DELETED_FN (fn)
8041 && trivial_fn_p (fn))
8043 if (DECL_DESTRUCTOR_P (fn))
8044 return fold_convert (void_type_node, argarray[0]);
8045 else if (default_ctor_p (fn))
8047 if (is_dummy_object (argarray[0]))
8048 return force_target_expr (DECL_CONTEXT (fn), void_node, complain);
8049 else
8050 return cp_build_indirect_ref (argarray[0], RO_NULL, complain);
8054 /* For calls to a multi-versioned function, overload resolution
8055 returns the function with the highest target priority, that is,
8056 the version that will checked for dispatching first. If this
8057 version is inlinable, a direct call to this version can be made
8058 otherwise the call should go through the dispatcher. */
8060 if (DECL_FUNCTION_VERSIONED (fn)
8061 && (current_function_decl == NULL
8062 || !targetm.target_option.can_inline_p (current_function_decl, fn)))
8064 fn = get_function_version_dispatcher (fn);
8065 if (fn == NULL)
8066 return NULL;
8067 if (!already_used)
8068 mark_versions_used (fn);
8071 if (!already_used
8072 && !mark_used (fn, complain))
8073 return error_mark_node;
8075 if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0
8076 /* Don't mess with virtual lookup in instantiate_non_dependent_expr;
8077 virtual functions can't be constexpr. */
8078 && !in_template_function ())
8080 tree t;
8081 tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (argarray[0])),
8082 DECL_CONTEXT (fn),
8083 ba_any, NULL, complain);
8084 gcc_assert (binfo && binfo != error_mark_node);
8086 argarray[0] = build_base_path (PLUS_EXPR, argarray[0], binfo, 1,
8087 complain);
8088 if (TREE_SIDE_EFFECTS (argarray[0]))
8089 argarray[0] = save_expr (argarray[0]);
8090 t = build_pointer_type (TREE_TYPE (fn));
8091 fn = build_vfn_ref (argarray[0], DECL_VINDEX (fn));
8092 TREE_TYPE (fn) = t;
8094 else
8096 fn = build_addr_func (fn, complain);
8097 if (fn == error_mark_node)
8098 return error_mark_node;
8101 tree call = build_cxx_call (fn, nargs, argarray, complain|decltype_flag);
8102 if (call == error_mark_node)
8103 return call;
8104 if (cand->flags & LOOKUP_LIST_INIT_CTOR)
8106 tree c = extract_call_expr (call);
8107 /* build_new_op_1 will clear this when appropriate. */
8108 CALL_EXPR_ORDERED_ARGS (c) = true;
8110 return call;
8113 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
8114 This function performs no overload resolution, conversion, or other
8115 high-level operations. */
8117 tree
8118 build_cxx_call (tree fn, int nargs, tree *argarray,
8119 tsubst_flags_t complain)
8121 tree fndecl;
8123 /* Remember roughly where this call is. */
8124 location_t loc = EXPR_LOC_OR_LOC (fn, input_location);
8125 fn = build_call_a (fn, nargs, argarray);
8126 SET_EXPR_LOCATION (fn, loc);
8128 fndecl = get_callee_fndecl (fn);
8130 /* Check that arguments to builtin functions match the expectations. */
8131 if (fndecl
8132 && DECL_BUILT_IN (fndecl)
8133 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
8135 int i;
8137 /* We need to take care that values to BUILT_IN_NORMAL
8138 are reduced. */
8139 for (i = 0; i < nargs; i++)
8140 argarray[i] = fold_non_dependent_expr (argarray[i]);
8142 if (!check_builtin_function_arguments (EXPR_LOCATION (fn), vNULL, fndecl,
8143 nargs, argarray))
8144 return error_mark_node;
8147 /* If it is a built-in array notation function, then the return type of
8148 the function is the element type of the array passed in as array
8149 notation (i.e. the first parameter of the function). */
8150 if (flag_cilkplus && TREE_CODE (fn) == CALL_EXPR)
8152 enum built_in_function bif =
8153 is_cilkplus_reduce_builtin (CALL_EXPR_FN (fn));
8154 if (bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ADD
8155 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MUL
8156 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MAX
8157 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MIN
8158 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE
8159 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MUTATING)
8161 if (call_expr_nargs (fn) == 0)
8163 error_at (EXPR_LOCATION (fn), "Invalid builtin arguments");
8164 return error_mark_node;
8166 /* for bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_ZERO or
8167 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_ZERO or
8168 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_NONZERO or
8169 BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_NONZERO or
8170 BUILT_IN_CILKPLUS_SEC_REDUCE_MIN_IND or
8171 BUILT_IN_CILKPLUS_SEC_REDUCE_MAX_IND
8172 The pre-defined return-type is the correct one. */
8173 tree array_ntn = CALL_EXPR_ARG (fn, 0);
8174 TREE_TYPE (fn) = TREE_TYPE (array_ntn);
8175 return fn;
8179 if (VOID_TYPE_P (TREE_TYPE (fn)))
8180 return fn;
8182 /* 5.2.2/11: If a function call is a prvalue of object type: if the
8183 function call is either the operand of a decltype-specifier or the
8184 right operand of a comma operator that is the operand of a
8185 decltype-specifier, a temporary object is not introduced for the
8186 prvalue. The type of the prvalue may be incomplete. */
8187 if (!(complain & tf_decltype))
8189 fn = require_complete_type_sfinae (fn, complain);
8190 if (fn == error_mark_node)
8191 return error_mark_node;
8193 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn)))
8194 fn = build_cplus_new (TREE_TYPE (fn), fn, complain);
8196 return convert_from_reference (fn);
8199 /* Returns the value to use for the in-charge parameter when making a
8200 call to a function with the indicated NAME.
8202 FIXME:Can't we find a neater way to do this mapping? */
8204 tree
8205 in_charge_arg_for_name (tree name)
8207 if (name == base_ctor_identifier
8208 || name == base_dtor_identifier)
8209 return integer_zero_node;
8210 else if (name == complete_ctor_identifier)
8211 return integer_one_node;
8212 else if (name == complete_dtor_identifier)
8213 return integer_two_node;
8214 else if (name == deleting_dtor_identifier)
8215 return integer_three_node;
8217 /* This function should only be called with one of the names listed
8218 above. */
8219 gcc_unreachable ();
8220 return NULL_TREE;
8223 /* We've built up a constructor call RET. Complain if it delegates to the
8224 constructor we're currently compiling. */
8226 static void
8227 check_self_delegation (tree ret)
8229 if (TREE_CODE (ret) == TARGET_EXPR)
8230 ret = TARGET_EXPR_INITIAL (ret);
8231 tree fn = cp_get_callee_fndecl (ret);
8232 if (fn && DECL_ABSTRACT_ORIGIN (fn) == current_function_decl)
8233 error ("constructor delegates to itself");
8236 /* Build a call to a constructor, destructor, or an assignment
8237 operator for INSTANCE, an expression with class type. NAME
8238 indicates the special member function to call; *ARGS are the
8239 arguments. ARGS may be NULL. This may change ARGS. BINFO
8240 indicates the base of INSTANCE that is to be passed as the `this'
8241 parameter to the member function called.
8243 FLAGS are the LOOKUP_* flags to use when processing the call.
8245 If NAME indicates a complete object constructor, INSTANCE may be
8246 NULL_TREE. In this case, the caller will call build_cplus_new to
8247 store the newly constructed object into a VAR_DECL. */
8249 tree
8250 build_special_member_call (tree instance, tree name, vec<tree, va_gc> **args,
8251 tree binfo, int flags, tsubst_flags_t complain)
8253 tree fns;
8254 /* The type of the subobject to be constructed or destroyed. */
8255 tree class_type;
8256 vec<tree, va_gc> *allocated = NULL;
8257 tree ret;
8259 gcc_assert (name == complete_ctor_identifier
8260 || name == base_ctor_identifier
8261 || name == complete_dtor_identifier
8262 || name == base_dtor_identifier
8263 || name == deleting_dtor_identifier
8264 || name == ansi_assopname (NOP_EXPR));
8265 if (TYPE_P (binfo))
8267 /* Resolve the name. */
8268 if (!complete_type_or_maybe_complain (binfo, NULL_TREE, complain))
8269 return error_mark_node;
8271 binfo = TYPE_BINFO (binfo);
8274 gcc_assert (binfo != NULL_TREE);
8276 class_type = BINFO_TYPE (binfo);
8278 /* Handle the special case where INSTANCE is NULL_TREE. */
8279 if (name == complete_ctor_identifier && !instance)
8280 instance = build_dummy_object (class_type);
8281 else
8283 if (name == complete_dtor_identifier
8284 || name == base_dtor_identifier
8285 || name == deleting_dtor_identifier)
8286 gcc_assert (args == NULL || vec_safe_is_empty (*args));
8288 /* Convert to the base class, if necessary. */
8289 if (!same_type_ignoring_top_level_qualifiers_p
8290 (TREE_TYPE (instance), BINFO_TYPE (binfo)))
8292 if (name != ansi_assopname (NOP_EXPR))
8293 /* For constructors and destructors, either the base is
8294 non-virtual, or it is virtual but we are doing the
8295 conversion from a constructor or destructor for the
8296 complete object. In either case, we can convert
8297 statically. */
8298 instance = convert_to_base_statically (instance, binfo);
8299 else
8300 /* However, for assignment operators, we must convert
8301 dynamically if the base is virtual. */
8302 instance = build_base_path (PLUS_EXPR, instance,
8303 binfo, /*nonnull=*/1, complain);
8307 gcc_assert (instance != NULL_TREE);
8309 /* In C++17, "If the initializer expression is a prvalue and the
8310 cv-unqualified version of the source type is the same class as the class
8311 of the destination, the initializer expression is used to initialize the
8312 destination object." Handle that here to avoid doing overload
8313 resolution. */
8314 if (cxx_dialect >= cxx1z
8315 && args && vec_safe_length (*args) == 1
8316 && name == complete_ctor_identifier)
8318 tree arg = (**args)[0];
8320 /* FIXME P0135 doesn't say how to handle direct initialization from a
8321 type with a suitable conversion operator. Let's handle it like
8322 copy-initialization, but allowing explict conversions. */
8323 if (!reference_related_p (class_type, TREE_TYPE (arg)))
8324 arg = perform_implicit_conversion_flags (class_type, arg,
8325 tf_warning, flags);
8326 if ((TREE_CODE (arg) == TARGET_EXPR
8327 || TREE_CODE (arg) == CONSTRUCTOR)
8328 && (same_type_ignoring_top_level_qualifiers_p
8329 (class_type, TREE_TYPE (arg))))
8331 if (is_dummy_object (instance))
8332 return arg;
8333 if ((complain & tf_error)
8334 && (flags & LOOKUP_DELEGATING_CONS))
8335 check_self_delegation (arg);
8336 /* Avoid change of behavior on Wunused-var-2.C. */
8337 mark_lvalue_use (instance);
8338 return build2 (INIT_EXPR, class_type, instance, arg);
8342 fns = lookup_fnfields (binfo, name, 1);
8344 /* When making a call to a constructor or destructor for a subobject
8345 that uses virtual base classes, pass down a pointer to a VTT for
8346 the subobject. */
8347 if ((name == base_ctor_identifier
8348 || name == base_dtor_identifier)
8349 && CLASSTYPE_VBASECLASSES (class_type))
8351 tree vtt;
8352 tree sub_vtt;
8354 /* If the current function is a complete object constructor
8355 or destructor, then we fetch the VTT directly.
8356 Otherwise, we look it up using the VTT we were given. */
8357 vtt = DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type));
8358 vtt = decay_conversion (vtt, complain);
8359 if (vtt == error_mark_node)
8360 return error_mark_node;
8361 vtt = build_if_in_charge (vtt, current_vtt_parm);
8362 if (BINFO_SUBVTT_INDEX (binfo))
8363 sub_vtt = fold_build_pointer_plus (vtt, BINFO_SUBVTT_INDEX (binfo));
8364 else
8365 sub_vtt = vtt;
8367 if (args == NULL)
8369 allocated = make_tree_vector ();
8370 args = &allocated;
8373 vec_safe_insert (*args, 0, sub_vtt);
8376 ret = build_new_method_call (instance, fns, args,
8377 TYPE_BINFO (BINFO_TYPE (binfo)),
8378 flags, /*fn=*/NULL,
8379 complain);
8381 if (allocated != NULL)
8382 release_tree_vector (allocated);
8384 if ((complain & tf_error)
8385 && (flags & LOOKUP_DELEGATING_CONS)
8386 && name == complete_ctor_identifier)
8387 check_self_delegation (ret);
8389 return ret;
8392 /* Return the NAME, as a C string. The NAME indicates a function that
8393 is a member of TYPE. *FREE_P is set to true if the caller must
8394 free the memory returned.
8396 Rather than go through all of this, we should simply set the names
8397 of constructors and destructors appropriately, and dispense with
8398 ctor_identifier, dtor_identifier, etc. */
8400 static char *
8401 name_as_c_string (tree name, tree type, bool *free_p)
8403 char *pretty_name;
8405 /* Assume that we will not allocate memory. */
8406 *free_p = false;
8407 /* Constructors and destructors are special. */
8408 if (IDENTIFIER_CTOR_OR_DTOR_P (name))
8410 pretty_name
8411 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type))));
8412 /* For a destructor, add the '~'. */
8413 if (name == complete_dtor_identifier
8414 || name == base_dtor_identifier
8415 || name == deleting_dtor_identifier)
8417 pretty_name = concat ("~", pretty_name, NULL);
8418 /* Remember that we need to free the memory allocated. */
8419 *free_p = true;
8422 else if (IDENTIFIER_TYPENAME_P (name))
8424 pretty_name = concat ("operator ",
8425 type_as_string_translate (TREE_TYPE (name),
8426 TFF_PLAIN_IDENTIFIER),
8427 NULL);
8428 /* Remember that we need to free the memory allocated. */
8429 *free_p = true;
8431 else
8432 pretty_name = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name)));
8434 return pretty_name;
8437 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
8438 be set, upon return, to the function called. ARGS may be NULL.
8439 This may change ARGS. */
8441 static tree
8442 build_new_method_call_1 (tree instance, tree fns, vec<tree, va_gc> **args,
8443 tree conversion_path, int flags,
8444 tree *fn_p, tsubst_flags_t complain)
8446 struct z_candidate *candidates = 0, *cand;
8447 tree explicit_targs = NULL_TREE;
8448 tree basetype = NULL_TREE;
8449 tree access_binfo, binfo;
8450 tree optype;
8451 tree first_mem_arg = NULL_TREE;
8452 tree name;
8453 bool skip_first_for_error;
8454 vec<tree, va_gc> *user_args;
8455 tree call;
8456 tree fn;
8457 int template_only = 0;
8458 bool any_viable_p;
8459 tree orig_instance;
8460 tree orig_fns;
8461 vec<tree, va_gc> *orig_args = NULL;
8462 void *p;
8464 gcc_assert (instance != NULL_TREE);
8466 /* We don't know what function we're going to call, yet. */
8467 if (fn_p)
8468 *fn_p = NULL_TREE;
8470 if (error_operand_p (instance)
8471 || !fns || error_operand_p (fns))
8472 return error_mark_node;
8474 if (!BASELINK_P (fns))
8476 if (complain & tf_error)
8477 error ("call to non-function %qD", fns);
8478 return error_mark_node;
8481 orig_instance = instance;
8482 orig_fns = fns;
8484 /* Dismantle the baselink to collect all the information we need. */
8485 if (!conversion_path)
8486 conversion_path = BASELINK_BINFO (fns);
8487 access_binfo = BASELINK_ACCESS_BINFO (fns);
8488 binfo = BASELINK_BINFO (fns);
8489 optype = BASELINK_OPTYPE (fns);
8490 fns = BASELINK_FUNCTIONS (fns);
8491 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
8493 explicit_targs = TREE_OPERAND (fns, 1);
8494 fns = TREE_OPERAND (fns, 0);
8495 template_only = 1;
8497 gcc_assert (TREE_CODE (fns) == FUNCTION_DECL
8498 || TREE_CODE (fns) == TEMPLATE_DECL
8499 || TREE_CODE (fns) == OVERLOAD);
8500 fn = get_first_fn (fns);
8501 name = DECL_NAME (fn);
8503 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (instance));
8504 gcc_assert (CLASS_TYPE_P (basetype));
8506 if (processing_template_decl)
8508 orig_args = args == NULL ? NULL : make_tree_vector_copy (*args);
8509 instance = build_non_dependent_expr (instance);
8510 if (args != NULL)
8511 make_args_non_dependent (*args);
8514 user_args = args == NULL ? NULL : *args;
8515 /* Under DR 147 A::A() is an invalid constructor call,
8516 not a functional cast. */
8517 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
8519 if (! (complain & tf_error))
8520 return error_mark_node;
8522 if (permerror (input_location,
8523 "cannot call constructor %<%T::%D%> directly",
8524 basetype, name))
8525 inform (input_location, "for a function-style cast, remove the "
8526 "redundant %<::%D%>", name);
8527 call = build_functional_cast (basetype, build_tree_list_vec (user_args),
8528 complain);
8529 return call;
8532 /* Figure out whether to skip the first argument for the error
8533 message we will display to users if an error occurs. We don't
8534 want to display any compiler-generated arguments. The "this"
8535 pointer hasn't been added yet. However, we must remove the VTT
8536 pointer if this is a call to a base-class constructor or
8537 destructor. */
8538 skip_first_for_error = false;
8539 if (IDENTIFIER_CTOR_OR_DTOR_P (name))
8541 /* Callers should explicitly indicate whether they want to construct
8542 the complete object or just the part without virtual bases. */
8543 gcc_assert (name != ctor_identifier);
8544 /* Similarly for destructors. */
8545 gcc_assert (name != dtor_identifier);
8546 /* Remove the VTT pointer, if present. */
8547 if ((name == base_ctor_identifier || name == base_dtor_identifier)
8548 && CLASSTYPE_VBASECLASSES (basetype))
8549 skip_first_for_error = true;
8552 /* Process the argument list. */
8553 if (args != NULL && *args != NULL)
8555 *args = resolve_args (*args, complain);
8556 if (*args == NULL)
8557 return error_mark_node;
8560 /* Consider the object argument to be used even if we end up selecting a
8561 static member function. */
8562 instance = mark_type_use (instance);
8564 /* It's OK to call destructors and constructors on cv-qualified objects.
8565 Therefore, convert the INSTANCE to the unqualified type, if
8566 necessary. */
8567 if (DECL_DESTRUCTOR_P (fn)
8568 || DECL_CONSTRUCTOR_P (fn))
8570 if (!same_type_p (basetype, TREE_TYPE (instance)))
8572 instance = build_this (instance);
8573 instance = build_nop (build_pointer_type (basetype), instance);
8574 instance = build_fold_indirect_ref (instance);
8577 if (DECL_DESTRUCTOR_P (fn))
8578 name = complete_dtor_identifier;
8580 /* For the overload resolution we need to find the actual `this`
8581 that would be captured if the call turns out to be to a
8582 non-static member function. Do not actually capture it at this
8583 point. */
8584 if (DECL_CONSTRUCTOR_P (fn))
8585 /* Constructors don't use the enclosing 'this'. */
8586 first_mem_arg = instance;
8587 else
8588 first_mem_arg = maybe_resolve_dummy (instance, false);
8590 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8591 p = conversion_obstack_alloc (0);
8593 /* The number of arguments artificial parms in ARGS; we subtract one because
8594 there's no 'this' in ARGS. */
8595 unsigned skip = num_artificial_parms_for (fn) - 1;
8597 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
8598 initializer, not T({ }). */
8599 if (DECL_CONSTRUCTOR_P (fn)
8600 && vec_safe_length (user_args) > skip
8601 && DIRECT_LIST_INIT_P ((*user_args)[skip]))
8603 tree init_list = (*user_args)[skip];
8604 tree init = NULL_TREE;
8606 gcc_assert (user_args->length () == skip + 1
8607 && !(flags & LOOKUP_ONLYCONVERTING));
8609 /* If the initializer list has no elements and T is a class type with
8610 a default constructor, the object is value-initialized. Handle
8611 this here so we don't need to handle it wherever we use
8612 build_special_member_call. */
8613 if (CONSTRUCTOR_NELTS (init_list) == 0
8614 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype)
8615 /* For a user-provided default constructor, use the normal
8616 mechanisms so that protected access works. */
8617 && type_has_non_user_provided_default_constructor (basetype)
8618 && !processing_template_decl)
8619 init = build_value_init (basetype, complain);
8621 /* If BASETYPE is an aggregate, we need to do aggregate
8622 initialization. */
8623 else if (CP_AGGREGATE_TYPE_P (basetype))
8625 init = reshape_init (basetype, init_list, complain);
8626 init = digest_init (basetype, init, complain);
8629 if (init)
8631 if (is_dummy_object (instance))
8632 return get_target_expr_sfinae (init, complain);
8633 init = build2 (INIT_EXPR, TREE_TYPE (instance), instance, init);
8634 TREE_SIDE_EFFECTS (init) = true;
8635 return init;
8638 /* Otherwise go ahead with overload resolution. */
8639 add_list_candidates (fns, first_mem_arg, user_args,
8640 basetype, explicit_targs, template_only,
8641 conversion_path, access_binfo, flags,
8642 &candidates, complain);
8644 else
8646 add_candidates (fns, first_mem_arg, user_args, optype,
8647 explicit_targs, template_only, conversion_path,
8648 access_binfo, flags, &candidates, complain);
8650 any_viable_p = false;
8651 candidates = splice_viable (candidates, false, &any_viable_p);
8653 if (!any_viable_p)
8655 if (complain & tf_error)
8657 if (!COMPLETE_OR_OPEN_TYPE_P (basetype))
8658 cxx_incomplete_type_error (instance, basetype);
8659 else if (optype)
8660 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
8661 basetype, optype, build_tree_list_vec (user_args),
8662 TREE_TYPE (instance));
8663 else
8665 tree arglist = build_tree_list_vec (user_args);
8666 tree errname = name;
8667 if (IDENTIFIER_CTOR_OR_DTOR_P (errname))
8669 tree fn = DECL_ORIGIN (get_first_fn (fns));
8670 errname = DECL_NAME (fn);
8672 if (explicit_targs)
8673 errname = lookup_template_function (errname, explicit_targs);
8674 if (skip_first_for_error)
8675 arglist = TREE_CHAIN (arglist);
8676 error ("no matching function for call to %<%T::%E(%A)%#V%>",
8677 basetype, errname, arglist,
8678 TREE_TYPE (instance));
8680 print_z_candidates (location_of (name), candidates);
8682 call = error_mark_node;
8684 else
8686 cand = tourney (candidates, complain);
8687 if (cand == 0)
8689 char *pretty_name;
8690 bool free_p;
8691 tree arglist;
8693 if (complain & tf_error)
8695 pretty_name = name_as_c_string (name, basetype, &free_p);
8696 arglist = build_tree_list_vec (user_args);
8697 if (skip_first_for_error)
8698 arglist = TREE_CHAIN (arglist);
8699 if (!any_strictly_viable (candidates))
8700 error ("no matching function for call to %<%s(%A)%>",
8701 pretty_name, arglist);
8702 else
8703 error ("call of overloaded %<%s(%A)%> is ambiguous",
8704 pretty_name, arglist);
8705 print_z_candidates (location_of (name), candidates);
8706 if (free_p)
8707 free (pretty_name);
8709 call = error_mark_node;
8711 else
8713 fn = cand->fn;
8714 call = NULL_TREE;
8716 if (!(flags & LOOKUP_NONVIRTUAL)
8717 && DECL_PURE_VIRTUAL_P (fn)
8718 && instance == current_class_ref
8719 && (complain & tf_warning))
8721 /* This is not an error, it is runtime undefined
8722 behavior. */
8723 if (!current_function_decl)
8724 warning (0, "pure virtual %q#D called from "
8725 "non-static data member initializer", fn);
8726 else if (DECL_CONSTRUCTOR_P (current_function_decl)
8727 || DECL_DESTRUCTOR_P (current_function_decl))
8728 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl)
8729 ? "pure virtual %q#D called from constructor"
8730 : "pure virtual %q#D called from destructor"),
8731 fn);
8734 if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE
8735 && !DECL_CONSTRUCTOR_P (fn)
8736 && is_dummy_object (instance))
8738 instance = maybe_resolve_dummy (instance, true);
8739 if (instance == error_mark_node)
8740 call = error_mark_node;
8741 else if (!is_dummy_object (instance))
8743 /* We captured 'this' in the current lambda now that
8744 we know we really need it. */
8745 cand->first_arg = instance;
8747 else if (any_dependent_bases_p ())
8748 /* We can't tell until instantiation time whether we can use
8749 *this as the implicit object argument. */;
8750 else
8752 if (complain & tf_error)
8753 error ("cannot call member function %qD without object",
8754 fn);
8755 call = error_mark_node;
8759 if (call != error_mark_node)
8761 /* Optimize away vtable lookup if we know that this
8762 function can't be overridden. We need to check if
8763 the context and the type where we found fn are the same,
8764 actually FN might be defined in a different class
8765 type because of a using-declaration. In this case, we
8766 do not want to perform a non-virtual call. */
8767 if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL)
8768 && same_type_ignoring_top_level_qualifiers_p
8769 (DECL_CONTEXT (fn), BINFO_TYPE (binfo))
8770 && resolves_to_fixed_type_p (instance, 0))
8771 flags |= LOOKUP_NONVIRTUAL;
8772 if (explicit_targs)
8773 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
8774 /* Now we know what function is being called. */
8775 if (fn_p)
8776 *fn_p = fn;
8777 /* Build the actual CALL_EXPR. */
8778 call = build_over_call (cand, flags, complain);
8779 /* In an expression of the form `a->f()' where `f' turns
8780 out to be a static member function, `a' is
8781 none-the-less evaluated. */
8782 if (TREE_CODE (TREE_TYPE (fn)) != METHOD_TYPE
8783 && !is_dummy_object (instance)
8784 && TREE_SIDE_EFFECTS (instance))
8785 call = build2 (COMPOUND_EXPR, TREE_TYPE (call),
8786 instance, call);
8787 else if (call != error_mark_node
8788 && DECL_DESTRUCTOR_P (cand->fn)
8789 && !VOID_TYPE_P (TREE_TYPE (call)))
8790 /* An explicit call of the form "x->~X()" has type
8791 "void". However, on platforms where destructors
8792 return "this" (i.e., those where
8793 targetm.cxx.cdtor_returns_this is true), such calls
8794 will appear to have a return value of pointer type
8795 to the low-level call machinery. We do not want to
8796 change the low-level machinery, since we want to be
8797 able to optimize "delete f()" on such platforms as
8798 "operator delete(~X(f()))" (rather than generating
8799 "t = f(), ~X(t), operator delete (t)"). */
8800 call = build_nop (void_type_node, call);
8805 if (processing_template_decl && call != error_mark_node)
8807 bool cast_to_void = false;
8809 if (TREE_CODE (call) == COMPOUND_EXPR)
8810 call = TREE_OPERAND (call, 1);
8811 else if (TREE_CODE (call) == NOP_EXPR)
8813 cast_to_void = true;
8814 call = TREE_OPERAND (call, 0);
8816 if (INDIRECT_REF_P (call))
8817 call = TREE_OPERAND (call, 0);
8818 call = (build_min_non_dep_call_vec
8819 (call,
8820 build_min (COMPONENT_REF, TREE_TYPE (CALL_EXPR_FN (call)),
8821 orig_instance, orig_fns, NULL_TREE),
8822 orig_args));
8823 SET_EXPR_LOCATION (call, input_location);
8824 call = convert_from_reference (call);
8825 if (cast_to_void)
8826 call = build_nop (void_type_node, call);
8829 /* Free all the conversions we allocated. */
8830 obstack_free (&conversion_obstack, p);
8832 if (orig_args != NULL)
8833 release_tree_vector (orig_args);
8835 return call;
8838 /* Wrapper for above. */
8840 tree
8841 build_new_method_call (tree instance, tree fns, vec<tree, va_gc> **args,
8842 tree conversion_path, int flags,
8843 tree *fn_p, tsubst_flags_t complain)
8845 tree ret;
8846 bool subtime = timevar_cond_start (TV_OVERLOAD);
8847 ret = build_new_method_call_1 (instance, fns, args, conversion_path, flags,
8848 fn_p, complain);
8849 timevar_cond_stop (TV_OVERLOAD, subtime);
8850 return ret;
8853 /* Returns true iff standard conversion sequence ICS1 is a proper
8854 subsequence of ICS2. */
8856 static bool
8857 is_subseq (conversion *ics1, conversion *ics2)
8859 /* We can assume that a conversion of the same code
8860 between the same types indicates a subsequence since we only get
8861 here if the types we are converting from are the same. */
8863 while (ics1->kind == ck_rvalue
8864 || ics1->kind == ck_lvalue)
8865 ics1 = next_conversion (ics1);
8867 while (1)
8869 while (ics2->kind == ck_rvalue
8870 || ics2->kind == ck_lvalue)
8871 ics2 = next_conversion (ics2);
8873 if (ics2->kind == ck_user
8874 || ics2->kind == ck_ambig
8875 || ics2->kind == ck_aggr
8876 || ics2->kind == ck_list
8877 || ics2->kind == ck_identity)
8878 /* At this point, ICS1 cannot be a proper subsequence of
8879 ICS2. We can get a USER_CONV when we are comparing the
8880 second standard conversion sequence of two user conversion
8881 sequences. */
8882 return false;
8884 ics2 = next_conversion (ics2);
8886 while (ics2->kind == ck_rvalue
8887 || ics2->kind == ck_lvalue)
8888 ics2 = next_conversion (ics2);
8890 if (ics2->kind == ics1->kind
8891 && same_type_p (ics2->type, ics1->type)
8892 && (ics1->kind == ck_identity
8893 || same_type_p (next_conversion (ics2)->type,
8894 next_conversion (ics1)->type)))
8895 return true;
8899 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
8900 be any _TYPE nodes. */
8902 bool
8903 is_properly_derived_from (tree derived, tree base)
8905 if (!CLASS_TYPE_P (derived) || !CLASS_TYPE_P (base))
8906 return false;
8908 /* We only allow proper derivation here. The DERIVED_FROM_P macro
8909 considers every class derived from itself. */
8910 return (!same_type_ignoring_top_level_qualifiers_p (derived, base)
8911 && DERIVED_FROM_P (base, derived));
8914 /* We build the ICS for an implicit object parameter as a pointer
8915 conversion sequence. However, such a sequence should be compared
8916 as if it were a reference conversion sequence. If ICS is the
8917 implicit conversion sequence for an implicit object parameter,
8918 modify it accordingly. */
8920 static void
8921 maybe_handle_implicit_object (conversion **ics)
8923 if ((*ics)->this_p)
8925 /* [over.match.funcs]
8927 For non-static member functions, the type of the
8928 implicit object parameter is "reference to cv X"
8929 where X is the class of which the function is a
8930 member and cv is the cv-qualification on the member
8931 function declaration. */
8932 conversion *t = *ics;
8933 tree reference_type;
8935 /* The `this' parameter is a pointer to a class type. Make the
8936 implicit conversion talk about a reference to that same class
8937 type. */
8938 reference_type = TREE_TYPE (t->type);
8939 reference_type = build_reference_type (reference_type);
8941 if (t->kind == ck_qual)
8942 t = next_conversion (t);
8943 if (t->kind == ck_ptr)
8944 t = next_conversion (t);
8945 t = build_identity_conv (TREE_TYPE (t->type), NULL_TREE);
8946 t = direct_reference_binding (reference_type, t);
8947 t->this_p = 1;
8948 t->rvaluedness_matches_p = 0;
8949 *ics = t;
8953 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
8954 and return the initial reference binding conversion. Otherwise,
8955 leave *ICS unchanged and return NULL. */
8957 static conversion *
8958 maybe_handle_ref_bind (conversion **ics)
8960 if ((*ics)->kind == ck_ref_bind)
8962 conversion *old_ics = *ics;
8963 *ics = next_conversion (old_ics);
8964 (*ics)->user_conv_p = old_ics->user_conv_p;
8965 return old_ics;
8968 return NULL;
8971 /* Compare two implicit conversion sequences according to the rules set out in
8972 [over.ics.rank]. Return values:
8974 1: ics1 is better than ics2
8975 -1: ics2 is better than ics1
8976 0: ics1 and ics2 are indistinguishable */
8978 static int
8979 compare_ics (conversion *ics1, conversion *ics2)
8981 tree from_type1;
8982 tree from_type2;
8983 tree to_type1;
8984 tree to_type2;
8985 tree deref_from_type1 = NULL_TREE;
8986 tree deref_from_type2 = NULL_TREE;
8987 tree deref_to_type1 = NULL_TREE;
8988 tree deref_to_type2 = NULL_TREE;
8989 conversion_rank rank1, rank2;
8991 /* REF_BINDING is nonzero if the result of the conversion sequence
8992 is a reference type. In that case REF_CONV is the reference
8993 binding conversion. */
8994 conversion *ref_conv1;
8995 conversion *ref_conv2;
8997 /* Compare badness before stripping the reference conversion. */
8998 if (ics1->bad_p > ics2->bad_p)
8999 return -1;
9000 else if (ics1->bad_p < ics2->bad_p)
9001 return 1;
9003 /* Handle implicit object parameters. */
9004 maybe_handle_implicit_object (&ics1);
9005 maybe_handle_implicit_object (&ics2);
9007 /* Handle reference parameters. */
9008 ref_conv1 = maybe_handle_ref_bind (&ics1);
9009 ref_conv2 = maybe_handle_ref_bind (&ics2);
9011 /* List-initialization sequence L1 is a better conversion sequence than
9012 list-initialization sequence L2 if L1 converts to
9013 std::initializer_list<X> for some X and L2 does not. */
9014 if (ics1->kind == ck_list && ics2->kind != ck_list)
9015 return 1;
9016 if (ics2->kind == ck_list && ics1->kind != ck_list)
9017 return -1;
9019 /* [over.ics.rank]
9021 When comparing the basic forms of implicit conversion sequences (as
9022 defined in _over.best.ics_)
9024 --a standard conversion sequence (_over.ics.scs_) is a better
9025 conversion sequence than a user-defined conversion sequence
9026 or an ellipsis conversion sequence, and
9028 --a user-defined conversion sequence (_over.ics.user_) is a
9029 better conversion sequence than an ellipsis conversion sequence
9030 (_over.ics.ellipsis_). */
9031 /* Use BAD_CONVERSION_RANK because we already checked for a badness
9032 mismatch. If both ICS are bad, we try to make a decision based on
9033 what would have happened if they'd been good. This is not an
9034 extension, we'll still give an error when we build up the call; this
9035 just helps us give a more helpful error message. */
9036 rank1 = BAD_CONVERSION_RANK (ics1);
9037 rank2 = BAD_CONVERSION_RANK (ics2);
9039 if (rank1 > rank2)
9040 return -1;
9041 else if (rank1 < rank2)
9042 return 1;
9044 if (ics1->ellipsis_p)
9045 /* Both conversions are ellipsis conversions. */
9046 return 0;
9048 /* User-defined conversion sequence U1 is a better conversion sequence
9049 than another user-defined conversion sequence U2 if they contain the
9050 same user-defined conversion operator or constructor and if the sec-
9051 ond standard conversion sequence of U1 is better than the second
9052 standard conversion sequence of U2. */
9054 /* Handle list-conversion with the same code even though it isn't always
9055 ranked as a user-defined conversion and it doesn't have a second
9056 standard conversion sequence; it will still have the desired effect.
9057 Specifically, we need to do the reference binding comparison at the
9058 end of this function. */
9060 if (ics1->user_conv_p || ics1->kind == ck_list || ics1->kind == ck_aggr)
9062 conversion *t1;
9063 conversion *t2;
9065 for (t1 = ics1; t1->kind != ck_user; t1 = next_conversion (t1))
9066 if (t1->kind == ck_ambig || t1->kind == ck_aggr
9067 || t1->kind == ck_list)
9068 break;
9069 for (t2 = ics2; t2->kind != ck_user; t2 = next_conversion (t2))
9070 if (t2->kind == ck_ambig || t2->kind == ck_aggr
9071 || t2->kind == ck_list)
9072 break;
9074 if (t1->kind != t2->kind)
9075 return 0;
9076 else if (t1->kind == ck_user)
9078 if (t1->cand->fn != t2->cand->fn)
9079 return 0;
9081 else
9083 /* For ambiguous or aggregate conversions, use the target type as
9084 a proxy for the conversion function. */
9085 if (!same_type_ignoring_top_level_qualifiers_p (t1->type, t2->type))
9086 return 0;
9089 /* We can just fall through here, after setting up
9090 FROM_TYPE1 and FROM_TYPE2. */
9091 from_type1 = t1->type;
9092 from_type2 = t2->type;
9094 else
9096 conversion *t1;
9097 conversion *t2;
9099 /* We're dealing with two standard conversion sequences.
9101 [over.ics.rank]
9103 Standard conversion sequence S1 is a better conversion
9104 sequence than standard conversion sequence S2 if
9106 --S1 is a proper subsequence of S2 (comparing the conversion
9107 sequences in the canonical form defined by _over.ics.scs_,
9108 excluding any Lvalue Transformation; the identity
9109 conversion sequence is considered to be a subsequence of
9110 any non-identity conversion sequence */
9112 t1 = ics1;
9113 while (t1->kind != ck_identity)
9114 t1 = next_conversion (t1);
9115 from_type1 = t1->type;
9117 t2 = ics2;
9118 while (t2->kind != ck_identity)
9119 t2 = next_conversion (t2);
9120 from_type2 = t2->type;
9123 /* One sequence can only be a subsequence of the other if they start with
9124 the same type. They can start with different types when comparing the
9125 second standard conversion sequence in two user-defined conversion
9126 sequences. */
9127 if (same_type_p (from_type1, from_type2))
9129 if (is_subseq (ics1, ics2))
9130 return 1;
9131 if (is_subseq (ics2, ics1))
9132 return -1;
9135 /* [over.ics.rank]
9137 Or, if not that,
9139 --the rank of S1 is better than the rank of S2 (by the rules
9140 defined below):
9142 Standard conversion sequences are ordered by their ranks: an Exact
9143 Match is a better conversion than a Promotion, which is a better
9144 conversion than a Conversion.
9146 Two conversion sequences with the same rank are indistinguishable
9147 unless one of the following rules applies:
9149 --A conversion that does not a convert a pointer, pointer to member,
9150 or std::nullptr_t to bool is better than one that does.
9152 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
9153 so that we do not have to check it explicitly. */
9154 if (ics1->rank < ics2->rank)
9155 return 1;
9156 else if (ics2->rank < ics1->rank)
9157 return -1;
9159 to_type1 = ics1->type;
9160 to_type2 = ics2->type;
9162 /* A conversion from scalar arithmetic type to complex is worse than a
9163 conversion between scalar arithmetic types. */
9164 if (same_type_p (from_type1, from_type2)
9165 && ARITHMETIC_TYPE_P (from_type1)
9166 && ARITHMETIC_TYPE_P (to_type1)
9167 && ARITHMETIC_TYPE_P (to_type2)
9168 && ((TREE_CODE (to_type1) == COMPLEX_TYPE)
9169 != (TREE_CODE (to_type2) == COMPLEX_TYPE)))
9171 if (TREE_CODE (to_type1) == COMPLEX_TYPE)
9172 return -1;
9173 else
9174 return 1;
9177 if (TYPE_PTR_P (from_type1)
9178 && TYPE_PTR_P (from_type2)
9179 && TYPE_PTR_P (to_type1)
9180 && TYPE_PTR_P (to_type2))
9182 deref_from_type1 = TREE_TYPE (from_type1);
9183 deref_from_type2 = TREE_TYPE (from_type2);
9184 deref_to_type1 = TREE_TYPE (to_type1);
9185 deref_to_type2 = TREE_TYPE (to_type2);
9187 /* The rules for pointers to members A::* are just like the rules
9188 for pointers A*, except opposite: if B is derived from A then
9189 A::* converts to B::*, not vice versa. For that reason, we
9190 switch the from_ and to_ variables here. */
9191 else if ((TYPE_PTRDATAMEM_P (from_type1) && TYPE_PTRDATAMEM_P (from_type2)
9192 && TYPE_PTRDATAMEM_P (to_type1) && TYPE_PTRDATAMEM_P (to_type2))
9193 || (TYPE_PTRMEMFUNC_P (from_type1)
9194 && TYPE_PTRMEMFUNC_P (from_type2)
9195 && TYPE_PTRMEMFUNC_P (to_type1)
9196 && TYPE_PTRMEMFUNC_P (to_type2)))
9198 deref_to_type1 = TYPE_PTRMEM_CLASS_TYPE (from_type1);
9199 deref_to_type2 = TYPE_PTRMEM_CLASS_TYPE (from_type2);
9200 deref_from_type1 = TYPE_PTRMEM_CLASS_TYPE (to_type1);
9201 deref_from_type2 = TYPE_PTRMEM_CLASS_TYPE (to_type2);
9204 if (deref_from_type1 != NULL_TREE
9205 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1))
9206 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2)))
9208 /* This was one of the pointer or pointer-like conversions.
9210 [over.ics.rank]
9212 --If class B is derived directly or indirectly from class A,
9213 conversion of B* to A* is better than conversion of B* to
9214 void*, and conversion of A* to void* is better than
9215 conversion of B* to void*. */
9216 if (VOID_TYPE_P (deref_to_type1)
9217 && VOID_TYPE_P (deref_to_type2))
9219 if (is_properly_derived_from (deref_from_type1,
9220 deref_from_type2))
9221 return -1;
9222 else if (is_properly_derived_from (deref_from_type2,
9223 deref_from_type1))
9224 return 1;
9226 else if (VOID_TYPE_P (deref_to_type1)
9227 || VOID_TYPE_P (deref_to_type2))
9229 if (same_type_p (deref_from_type1, deref_from_type2))
9231 if (VOID_TYPE_P (deref_to_type2))
9233 if (is_properly_derived_from (deref_from_type1,
9234 deref_to_type1))
9235 return 1;
9237 /* We know that DEREF_TO_TYPE1 is `void' here. */
9238 else if (is_properly_derived_from (deref_from_type1,
9239 deref_to_type2))
9240 return -1;
9243 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1))
9244 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2)))
9246 /* [over.ics.rank]
9248 --If class B is derived directly or indirectly from class A
9249 and class C is derived directly or indirectly from B,
9251 --conversion of C* to B* is better than conversion of C* to
9254 --conversion of B* to A* is better than conversion of C* to
9255 A* */
9256 if (same_type_p (deref_from_type1, deref_from_type2))
9258 if (is_properly_derived_from (deref_to_type1,
9259 deref_to_type2))
9260 return 1;
9261 else if (is_properly_derived_from (deref_to_type2,
9262 deref_to_type1))
9263 return -1;
9265 else if (same_type_p (deref_to_type1, deref_to_type2))
9267 if (is_properly_derived_from (deref_from_type2,
9268 deref_from_type1))
9269 return 1;
9270 else if (is_properly_derived_from (deref_from_type1,
9271 deref_from_type2))
9272 return -1;
9276 else if (CLASS_TYPE_P (non_reference (from_type1))
9277 && same_type_p (from_type1, from_type2))
9279 tree from = non_reference (from_type1);
9281 /* [over.ics.rank]
9283 --binding of an expression of type C to a reference of type
9284 B& is better than binding an expression of type C to a
9285 reference of type A&
9287 --conversion of C to B is better than conversion of C to A, */
9288 if (is_properly_derived_from (from, to_type1)
9289 && is_properly_derived_from (from, to_type2))
9291 if (is_properly_derived_from (to_type1, to_type2))
9292 return 1;
9293 else if (is_properly_derived_from (to_type2, to_type1))
9294 return -1;
9297 else if (CLASS_TYPE_P (non_reference (to_type1))
9298 && same_type_p (to_type1, to_type2))
9300 tree to = non_reference (to_type1);
9302 /* [over.ics.rank]
9304 --binding of an expression of type B to a reference of type
9305 A& is better than binding an expression of type C to a
9306 reference of type A&,
9308 --conversion of B to A is better than conversion of C to A */
9309 if (is_properly_derived_from (from_type1, to)
9310 && is_properly_derived_from (from_type2, to))
9312 if (is_properly_derived_from (from_type2, from_type1))
9313 return 1;
9314 else if (is_properly_derived_from (from_type1, from_type2))
9315 return -1;
9319 /* [over.ics.rank]
9321 --S1 and S2 differ only in their qualification conversion and yield
9322 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
9323 qualification signature of type T1 is a proper subset of the cv-
9324 qualification signature of type T2 */
9325 if (ics1->kind == ck_qual
9326 && ics2->kind == ck_qual
9327 && same_type_p (from_type1, from_type2))
9329 int result = comp_cv_qual_signature (to_type1, to_type2);
9330 if (result != 0)
9331 return result;
9334 /* [over.ics.rank]
9336 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
9337 to an implicit object parameter of a non-static member function
9338 declared without a ref-qualifier, and either S1 binds an lvalue
9339 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
9340 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
9341 draft standard, 13.3.3.2)
9343 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
9344 types to which the references refer are the same type except for
9345 top-level cv-qualifiers, and the type to which the reference
9346 initialized by S2 refers is more cv-qualified than the type to
9347 which the reference initialized by S1 refers.
9349 DR 1328 [over.match.best]: the context is an initialization by
9350 conversion function for direct reference binding (13.3.1.6) of a
9351 reference to function type, the return type of F1 is the same kind of
9352 reference (i.e. lvalue or rvalue) as the reference being initialized,
9353 and the return type of F2 is not. */
9355 if (ref_conv1 && ref_conv2)
9357 if (!ref_conv1->this_p && !ref_conv2->this_p
9358 && (ref_conv1->rvaluedness_matches_p
9359 != ref_conv2->rvaluedness_matches_p)
9360 && (same_type_p (ref_conv1->type, ref_conv2->type)
9361 || (TYPE_REF_IS_RVALUE (ref_conv1->type)
9362 != TYPE_REF_IS_RVALUE (ref_conv2->type))))
9364 if (ref_conv1->bad_p
9365 && !same_type_p (TREE_TYPE (ref_conv1->type),
9366 TREE_TYPE (ref_conv2->type)))
9367 /* Don't prefer a bad conversion that drops cv-quals to a bad
9368 conversion with the wrong rvalueness. */
9369 return 0;
9370 return (ref_conv1->rvaluedness_matches_p
9371 - ref_conv2->rvaluedness_matches_p);
9374 if (same_type_ignoring_top_level_qualifiers_p (to_type1, to_type2))
9376 int q1 = cp_type_quals (TREE_TYPE (ref_conv1->type));
9377 int q2 = cp_type_quals (TREE_TYPE (ref_conv2->type));
9378 if (ref_conv1->bad_p)
9380 /* Prefer the one that drops fewer cv-quals. */
9381 tree ftype = next_conversion (ref_conv1)->type;
9382 int fquals = cp_type_quals (ftype);
9383 q1 ^= fquals;
9384 q2 ^= fquals;
9386 return comp_cv_qualification (q2, q1);
9390 /* Neither conversion sequence is better than the other. */
9391 return 0;
9394 /* The source type for this standard conversion sequence. */
9396 static tree
9397 source_type (conversion *t)
9399 for (;; t = next_conversion (t))
9401 if (t->kind == ck_user
9402 || t->kind == ck_ambig
9403 || t->kind == ck_identity)
9404 return t->type;
9406 gcc_unreachable ();
9409 /* Note a warning about preferring WINNER to LOSER. We do this by storing
9410 a pointer to LOSER and re-running joust to produce the warning if WINNER
9411 is actually used. */
9413 static void
9414 add_warning (struct z_candidate *winner, struct z_candidate *loser)
9416 candidate_warning *cw = (candidate_warning *)
9417 conversion_obstack_alloc (sizeof (candidate_warning));
9418 cw->loser = loser;
9419 cw->next = winner->warnings;
9420 winner->warnings = cw;
9423 /* Compare two candidates for overloading as described in
9424 [over.match.best]. Return values:
9426 1: cand1 is better than cand2
9427 -1: cand2 is better than cand1
9428 0: cand1 and cand2 are indistinguishable */
9430 static int
9431 joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn,
9432 tsubst_flags_t complain)
9434 int winner = 0;
9435 int off1 = 0, off2 = 0;
9436 size_t i;
9437 size_t len;
9439 /* Candidates that involve bad conversions are always worse than those
9440 that don't. */
9441 if (cand1->viable > cand2->viable)
9442 return 1;
9443 if (cand1->viable < cand2->viable)
9444 return -1;
9446 /* If we have two pseudo-candidates for conversions to the same type,
9447 or two candidates for the same function, arbitrarily pick one. */
9448 if (cand1->fn == cand2->fn
9449 && (IS_TYPE_OR_DECL_P (cand1->fn)))
9450 return 1;
9452 /* Prefer a non-deleted function over an implicitly deleted move
9453 constructor or assignment operator. This differs slightly from the
9454 wording for issue 1402 (which says the move op is ignored by overload
9455 resolution), but this way produces better error messages. */
9456 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
9457 && TREE_CODE (cand2->fn) == FUNCTION_DECL
9458 && DECL_DELETED_FN (cand1->fn) != DECL_DELETED_FN (cand2->fn))
9460 if (DECL_DELETED_FN (cand1->fn) && DECL_DEFAULTED_FN (cand1->fn)
9461 && move_fn_p (cand1->fn))
9462 return -1;
9463 if (DECL_DELETED_FN (cand2->fn) && DECL_DEFAULTED_FN (cand2->fn)
9464 && move_fn_p (cand2->fn))
9465 return 1;
9468 /* a viable function F1
9469 is defined to be a better function than another viable function F2 if
9470 for all arguments i, ICSi(F1) is not a worse conversion sequence than
9471 ICSi(F2), and then */
9473 /* for some argument j, ICSj(F1) is a better conversion sequence than
9474 ICSj(F2) */
9476 /* For comparing static and non-static member functions, we ignore
9477 the implicit object parameter of the non-static function. The
9478 standard says to pretend that the static function has an object
9479 parm, but that won't work with operator overloading. */
9480 len = cand1->num_convs;
9481 if (len != cand2->num_convs)
9483 int static_1 = DECL_STATIC_FUNCTION_P (cand1->fn);
9484 int static_2 = DECL_STATIC_FUNCTION_P (cand2->fn);
9486 if (DECL_CONSTRUCTOR_P (cand1->fn)
9487 && is_list_ctor (cand1->fn) != is_list_ctor (cand2->fn))
9488 /* We're comparing a near-match list constructor and a near-match
9489 non-list constructor. Just treat them as unordered. */
9490 return 0;
9492 gcc_assert (static_1 != static_2);
9494 if (static_1)
9495 off2 = 1;
9496 else
9498 off1 = 1;
9499 --len;
9503 for (i = 0; i < len; ++i)
9505 conversion *t1 = cand1->convs[i + off1];
9506 conversion *t2 = cand2->convs[i + off2];
9507 int comp = compare_ics (t1, t2);
9509 if (comp != 0)
9511 if ((complain & tf_warning)
9512 && warn_sign_promo
9513 && (CONVERSION_RANK (t1) + CONVERSION_RANK (t2)
9514 == cr_std + cr_promotion)
9515 && t1->kind == ck_std
9516 && t2->kind == ck_std
9517 && TREE_CODE (t1->type) == INTEGER_TYPE
9518 && TREE_CODE (t2->type) == INTEGER_TYPE
9519 && (TYPE_PRECISION (t1->type)
9520 == TYPE_PRECISION (t2->type))
9521 && (TYPE_UNSIGNED (next_conversion (t1)->type)
9522 || (TREE_CODE (next_conversion (t1)->type)
9523 == ENUMERAL_TYPE)))
9525 tree type = next_conversion (t1)->type;
9526 tree type1, type2;
9527 struct z_candidate *w, *l;
9528 if (comp > 0)
9529 type1 = t1->type, type2 = t2->type,
9530 w = cand1, l = cand2;
9531 else
9532 type1 = t2->type, type2 = t1->type,
9533 w = cand2, l = cand1;
9535 if (warn)
9537 warning (OPT_Wsign_promo, "passing %qT chooses %qT over %qT",
9538 type, type1, type2);
9539 warning (OPT_Wsign_promo, " in call to %qD", w->fn);
9541 else
9542 add_warning (w, l);
9545 if (winner && comp != winner)
9547 winner = 0;
9548 goto tweak;
9550 winner = comp;
9554 /* warn about confusing overload resolution for user-defined conversions,
9555 either between a constructor and a conversion op, or between two
9556 conversion ops. */
9557 if ((complain & tf_warning)
9558 && winner && warn_conversion && cand1->second_conv
9559 && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn))
9560 && winner != compare_ics (cand1->second_conv, cand2->second_conv))
9562 struct z_candidate *w, *l;
9563 bool give_warning = false;
9565 if (winner == 1)
9566 w = cand1, l = cand2;
9567 else
9568 w = cand2, l = cand1;
9570 /* We don't want to complain about `X::operator T1 ()'
9571 beating `X::operator T2 () const', when T2 is a no less
9572 cv-qualified version of T1. */
9573 if (DECL_CONTEXT (w->fn) == DECL_CONTEXT (l->fn)
9574 && !DECL_CONSTRUCTOR_P (w->fn) && !DECL_CONSTRUCTOR_P (l->fn))
9576 tree t = TREE_TYPE (TREE_TYPE (l->fn));
9577 tree f = TREE_TYPE (TREE_TYPE (w->fn));
9579 if (TREE_CODE (t) == TREE_CODE (f) && POINTER_TYPE_P (t))
9581 t = TREE_TYPE (t);
9582 f = TREE_TYPE (f);
9584 if (!comp_ptr_ttypes (t, f))
9585 give_warning = true;
9587 else
9588 give_warning = true;
9590 if (!give_warning)
9591 /*NOP*/;
9592 else if (warn)
9594 tree source = source_type (w->convs[0]);
9595 if (! DECL_CONSTRUCTOR_P (w->fn))
9596 source = TREE_TYPE (source);
9597 if (warning (OPT_Wconversion, "choosing %qD over %qD", w->fn, l->fn)
9598 && warning (OPT_Wconversion, " for conversion from %qT to %qT",
9599 source, w->second_conv->type))
9601 inform (input_location, " because conversion sequence for the argument is better");
9604 else
9605 add_warning (w, l);
9608 if (winner)
9609 return winner;
9611 /* DR 495 moved this tiebreaker above the template ones. */
9612 /* or, if not that,
9613 the context is an initialization by user-defined conversion (see
9614 _dcl.init_ and _over.match.user_) and the standard conversion
9615 sequence from the return type of F1 to the destination type (i.e.,
9616 the type of the entity being initialized) is a better conversion
9617 sequence than the standard conversion sequence from the return type
9618 of F2 to the destination type. */
9620 if (cand1->second_conv)
9622 winner = compare_ics (cand1->second_conv, cand2->second_conv);
9623 if (winner)
9624 return winner;
9627 /* or, if not that,
9628 F1 is a non-template function and F2 is a template function
9629 specialization. */
9631 if (!cand1->template_decl && cand2->template_decl)
9632 return 1;
9633 else if (cand1->template_decl && !cand2->template_decl)
9634 return -1;
9636 /* or, if not that,
9637 F1 and F2 are template functions and the function template for F1 is
9638 more specialized than the template for F2 according to the partial
9639 ordering rules. */
9641 if (cand1->template_decl && cand2->template_decl)
9643 winner = more_specialized_fn
9644 (TI_TEMPLATE (cand1->template_decl),
9645 TI_TEMPLATE (cand2->template_decl),
9646 /* [temp.func.order]: The presence of unused ellipsis and default
9647 arguments has no effect on the partial ordering of function
9648 templates. add_function_candidate() will not have
9649 counted the "this" argument for constructors. */
9650 cand1->num_convs + DECL_CONSTRUCTOR_P (cand1->fn));
9651 if (winner)
9652 return winner;
9655 // C++ Concepts
9656 // or, if not that, F1 is more constrained than F2.
9657 if (flag_concepts && DECL_P (cand1->fn) && DECL_P (cand2->fn))
9659 winner = more_constrained (cand1->fn, cand2->fn);
9660 if (winner)
9661 return winner;
9664 /* or, if not that, F2 is from a using-declaration, F1 is not, and the
9665 conversion sequences are equivalent.
9666 (proposed in http://lists.isocpp.org/core/2016/10/1142.php) */
9667 if (DECL_P (cand1->fn) && DECL_CLASS_SCOPE_P (cand1->fn)
9668 && !DECL_CONV_FN_P (cand1->fn)
9669 && DECL_P (cand2->fn) && DECL_CLASS_SCOPE_P (cand2->fn)
9670 && !DECL_CONV_FN_P (cand2->fn))
9672 bool used1 = (DECL_INHERITED_CTOR (cand1->fn)
9673 || (BINFO_TYPE (cand1->access_path)
9674 != DECL_CONTEXT (cand1->fn)));
9675 bool used2 = (DECL_INHERITED_CTOR (cand2->fn)
9676 || (BINFO_TYPE (cand2->access_path)
9677 != DECL_CONTEXT (cand2->fn)));
9678 if (int diff = used2 - used1)
9680 for (i = 0; i < len; ++i)
9682 conversion *t1 = cand1->convs[i + off1];
9683 conversion *t2 = cand2->convs[i + off2];
9684 if (!same_type_p (t1->type, t2->type))
9685 break;
9687 if (i == len)
9688 return diff;
9692 /* Check whether we can discard a builtin candidate, either because we
9693 have two identical ones or matching builtin and non-builtin candidates.
9695 (Pedantically in the latter case the builtin which matched the user
9696 function should not be added to the overload set, but we spot it here.
9698 [over.match.oper]
9699 ... the builtin candidates include ...
9700 - do not have the same parameter type list as any non-template
9701 non-member candidate. */
9703 if (identifier_p (cand1->fn) || identifier_p (cand2->fn))
9705 for (i = 0; i < len; ++i)
9706 if (!same_type_p (cand1->convs[i]->type,
9707 cand2->convs[i]->type))
9708 break;
9709 if (i == cand1->num_convs)
9711 if (cand1->fn == cand2->fn)
9712 /* Two built-in candidates; arbitrarily pick one. */
9713 return 1;
9714 else if (identifier_p (cand1->fn))
9715 /* cand1 is built-in; prefer cand2. */
9716 return -1;
9717 else
9718 /* cand2 is built-in; prefer cand1. */
9719 return 1;
9723 /* For candidates of a multi-versioned function, make the version with
9724 the highest priority win. This version will be checked for dispatching
9725 first. If this version can be inlined into the caller, the front-end
9726 will simply make a direct call to this function. */
9728 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
9729 && DECL_FUNCTION_VERSIONED (cand1->fn)
9730 && TREE_CODE (cand2->fn) == FUNCTION_DECL
9731 && DECL_FUNCTION_VERSIONED (cand2->fn))
9733 tree f1 = TREE_TYPE (cand1->fn);
9734 tree f2 = TREE_TYPE (cand2->fn);
9735 tree p1 = TYPE_ARG_TYPES (f1);
9736 tree p2 = TYPE_ARG_TYPES (f2);
9738 /* Check if cand1->fn and cand2->fn are versions of the same function. It
9739 is possible that cand1->fn and cand2->fn are function versions but of
9740 different functions. Check types to see if they are versions of the same
9741 function. */
9742 if (compparms (p1, p2)
9743 && same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
9745 /* Always make the version with the higher priority, more
9746 specialized, win. */
9747 gcc_assert (targetm.compare_version_priority);
9748 if (targetm.compare_version_priority (cand1->fn, cand2->fn) >= 0)
9749 return 1;
9750 else
9751 return -1;
9755 /* If the two function declarations represent the same function (this can
9756 happen with declarations in multiple scopes and arg-dependent lookup),
9757 arbitrarily choose one. But first make sure the default args we're
9758 using match. */
9759 if (DECL_P (cand1->fn) && DECL_P (cand2->fn)
9760 && equal_functions (cand1->fn, cand2->fn))
9762 tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (cand1->fn));
9763 tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (cand2->fn));
9765 gcc_assert (!DECL_CONSTRUCTOR_P (cand1->fn));
9767 for (i = 0; i < len; ++i)
9769 /* Don't crash if the fn is variadic. */
9770 if (!parms1)
9771 break;
9772 parms1 = TREE_CHAIN (parms1);
9773 parms2 = TREE_CHAIN (parms2);
9776 if (off1)
9777 parms1 = TREE_CHAIN (parms1);
9778 else if (off2)
9779 parms2 = TREE_CHAIN (parms2);
9781 for (; parms1; ++i)
9783 if (!cp_tree_equal (TREE_PURPOSE (parms1),
9784 TREE_PURPOSE (parms2)))
9786 if (warn)
9788 if (complain & tf_error)
9790 if (permerror (input_location,
9791 "default argument mismatch in "
9792 "overload resolution"))
9794 inform (DECL_SOURCE_LOCATION (cand1->fn),
9795 " candidate 1: %q#F", cand1->fn);
9796 inform (DECL_SOURCE_LOCATION (cand2->fn),
9797 " candidate 2: %q#F", cand2->fn);
9800 else
9801 return 0;
9803 else
9804 add_warning (cand1, cand2);
9805 break;
9807 parms1 = TREE_CHAIN (parms1);
9808 parms2 = TREE_CHAIN (parms2);
9811 return 1;
9814 tweak:
9816 /* Extension: If the worst conversion for one candidate is worse than the
9817 worst conversion for the other, take the first. */
9818 if (!pedantic && (complain & tf_warning_or_error))
9820 conversion_rank rank1 = cr_identity, rank2 = cr_identity;
9821 struct z_candidate *w = 0, *l = 0;
9823 for (i = 0; i < len; ++i)
9825 if (CONVERSION_RANK (cand1->convs[i+off1]) > rank1)
9826 rank1 = CONVERSION_RANK (cand1->convs[i+off1]);
9827 if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2)
9828 rank2 = CONVERSION_RANK (cand2->convs[i + off2]);
9830 if (rank1 < rank2)
9831 winner = 1, w = cand1, l = cand2;
9832 if (rank1 > rank2)
9833 winner = -1, w = cand2, l = cand1;
9834 if (winner)
9836 /* Don't choose a deleted function over ambiguity. */
9837 if (DECL_P (w->fn) && DECL_DELETED_FN (w->fn))
9838 return 0;
9839 if (warn)
9841 pedwarn (input_location, 0,
9842 "ISO C++ says that these are ambiguous, even "
9843 "though the worst conversion for the first is better than "
9844 "the worst conversion for the second:");
9845 print_z_candidate (input_location, _("candidate 1:"), w);
9846 print_z_candidate (input_location, _("candidate 2:"), l);
9848 else
9849 add_warning (w, l);
9850 return winner;
9854 gcc_assert (!winner);
9855 return 0;
9858 /* Given a list of candidates for overloading, find the best one, if any.
9859 This algorithm has a worst case of O(2n) (winner is last), and a best
9860 case of O(n/2) (totally ambiguous); much better than a sorting
9861 algorithm. */
9863 static struct z_candidate *
9864 tourney (struct z_candidate *candidates, tsubst_flags_t complain)
9866 struct z_candidate *champ = candidates, *challenger;
9867 int fate;
9868 int champ_compared_to_predecessor = 0;
9870 /* Walk through the list once, comparing each current champ to the next
9871 candidate, knocking out a candidate or two with each comparison. */
9873 for (challenger = champ->next; challenger; )
9875 fate = joust (champ, challenger, 0, complain);
9876 if (fate == 1)
9877 challenger = challenger->next;
9878 else
9880 if (fate == 0)
9882 champ = challenger->next;
9883 if (champ == 0)
9884 return NULL;
9885 champ_compared_to_predecessor = 0;
9887 else
9889 champ = challenger;
9890 champ_compared_to_predecessor = 1;
9893 challenger = champ->next;
9897 /* Make sure the champ is better than all the candidates it hasn't yet
9898 been compared to. */
9900 for (challenger = candidates;
9901 challenger != champ
9902 && !(champ_compared_to_predecessor && challenger->next == champ);
9903 challenger = challenger->next)
9905 fate = joust (champ, challenger, 0, complain);
9906 if (fate != 1)
9907 return NULL;
9910 return champ;
9913 /* Returns nonzero if things of type FROM can be converted to TO. */
9915 bool
9916 can_convert (tree to, tree from, tsubst_flags_t complain)
9918 tree arg = NULL_TREE;
9919 /* implicit_conversion only considers user-defined conversions
9920 if it has an expression for the call argument list. */
9921 if (CLASS_TYPE_P (from) || CLASS_TYPE_P (to))
9922 arg = build1 (CAST_EXPR, from, NULL_TREE);
9923 return can_convert_arg (to, from, arg, LOOKUP_IMPLICIT, complain);
9926 /* Returns nonzero if things of type FROM can be converted to TO with a
9927 standard conversion. */
9929 bool
9930 can_convert_standard (tree to, tree from, tsubst_flags_t complain)
9932 return can_convert_arg (to, from, NULL_TREE, LOOKUP_IMPLICIT, complain);
9935 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
9937 bool
9938 can_convert_arg (tree to, tree from, tree arg, int flags,
9939 tsubst_flags_t complain)
9941 conversion *t;
9942 void *p;
9943 bool ok_p;
9945 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9946 p = conversion_obstack_alloc (0);
9947 /* We want to discard any access checks done for this test,
9948 as we might not be in the appropriate access context and
9949 we'll do the check again when we actually perform the
9950 conversion. */
9951 push_deferring_access_checks (dk_deferred);
9953 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
9954 flags, complain);
9955 ok_p = (t && !t->bad_p);
9957 /* Discard the access checks now. */
9958 pop_deferring_access_checks ();
9959 /* Free all the conversions we allocated. */
9960 obstack_free (&conversion_obstack, p);
9962 return ok_p;
9965 /* Like can_convert_arg, but allows dubious conversions as well. */
9967 bool
9968 can_convert_arg_bad (tree to, tree from, tree arg, int flags,
9969 tsubst_flags_t complain)
9971 conversion *t;
9972 void *p;
9974 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9975 p = conversion_obstack_alloc (0);
9976 /* Try to perform the conversion. */
9977 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
9978 flags, complain);
9979 /* Free all the conversions we allocated. */
9980 obstack_free (&conversion_obstack, p);
9982 return t != NULL;
9985 /* Convert EXPR to TYPE. Return the converted expression.
9987 Note that we allow bad conversions here because by the time we get to
9988 this point we are committed to doing the conversion. If we end up
9989 doing a bad conversion, convert_like will complain. */
9991 tree
9992 perform_implicit_conversion_flags (tree type, tree expr,
9993 tsubst_flags_t complain, int flags)
9995 conversion *conv;
9996 void *p;
9997 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
9999 if (error_operand_p (expr))
10000 return error_mark_node;
10002 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10003 p = conversion_obstack_alloc (0);
10005 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
10006 /*c_cast_p=*/false,
10007 flags, complain);
10009 if (!conv)
10011 if (complain & tf_error)
10013 /* If expr has unknown type, then it is an overloaded function.
10014 Call instantiate_type to get good error messages. */
10015 if (TREE_TYPE (expr) == unknown_type_node)
10016 instantiate_type (type, expr, complain);
10017 else if (invalid_nonstatic_memfn_p (loc, expr, complain))
10018 /* We gave an error. */;
10019 else
10020 error_at (loc, "could not convert %qE from %qT to %qT", expr,
10021 TREE_TYPE (expr), type);
10023 expr = error_mark_node;
10025 else if (processing_template_decl && conv->kind != ck_identity)
10027 /* In a template, we are only concerned about determining the
10028 type of non-dependent expressions, so we do not have to
10029 perform the actual conversion. But for initializers, we
10030 need to be able to perform it at instantiation
10031 (or instantiate_non_dependent_expr) time. */
10032 expr = build1 (IMPLICIT_CONV_EXPR, type, expr);
10033 if (!(flags & LOOKUP_ONLYCONVERTING))
10034 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true;
10036 else
10037 expr = convert_like (conv, expr, complain);
10039 /* Free all the conversions we allocated. */
10040 obstack_free (&conversion_obstack, p);
10042 return expr;
10045 tree
10046 perform_implicit_conversion (tree type, tree expr, tsubst_flags_t complain)
10048 return perform_implicit_conversion_flags (type, expr, complain,
10049 LOOKUP_IMPLICIT);
10052 /* Convert EXPR to TYPE (as a direct-initialization) if that is
10053 permitted. If the conversion is valid, the converted expression is
10054 returned. Otherwise, NULL_TREE is returned, except in the case
10055 that TYPE is a class type; in that case, an error is issued. If
10056 C_CAST_P is true, then this direct-initialization is taking
10057 place as part of a static_cast being attempted as part of a C-style
10058 cast. */
10060 tree
10061 perform_direct_initialization_if_possible (tree type,
10062 tree expr,
10063 bool c_cast_p,
10064 tsubst_flags_t complain)
10066 conversion *conv;
10067 void *p;
10069 if (type == error_mark_node || error_operand_p (expr))
10070 return error_mark_node;
10071 /* [dcl.init]
10073 If the destination type is a (possibly cv-qualified) class type:
10075 -- If the initialization is direct-initialization ...,
10076 constructors are considered. ... If no constructor applies, or
10077 the overload resolution is ambiguous, the initialization is
10078 ill-formed. */
10079 if (CLASS_TYPE_P (type))
10081 vec<tree, va_gc> *args = make_tree_vector_single (expr);
10082 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
10083 &args, type, LOOKUP_NORMAL, complain);
10084 release_tree_vector (args);
10085 return build_cplus_new (type, expr, complain);
10088 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10089 p = conversion_obstack_alloc (0);
10091 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
10092 c_cast_p,
10093 LOOKUP_NORMAL, complain);
10094 if (!conv || conv->bad_p)
10095 expr = NULL_TREE;
10096 else
10097 expr = convert_like_real (conv, expr, NULL_TREE, 0, 0,
10098 /*issue_conversion_warnings=*/false,
10099 c_cast_p,
10100 complain);
10102 /* Free all the conversions we allocated. */
10103 obstack_free (&conversion_obstack, p);
10105 return expr;
10108 /* When initializing a reference that lasts longer than a full-expression,
10109 this special rule applies:
10111 [class.temporary]
10113 The temporary to which the reference is bound or the temporary
10114 that is the complete object to which the reference is bound
10115 persists for the lifetime of the reference.
10117 The temporaries created during the evaluation of the expression
10118 initializing the reference, except the temporary to which the
10119 reference is bound, are destroyed at the end of the
10120 full-expression in which they are created.
10122 In that case, we store the converted expression into a new
10123 VAR_DECL in a new scope.
10125 However, we want to be careful not to create temporaries when
10126 they are not required. For example, given:
10128 struct B {};
10129 struct D : public B {};
10130 D f();
10131 const B& b = f();
10133 there is no need to copy the return value from "f"; we can just
10134 extend its lifetime. Similarly, given:
10136 struct S {};
10137 struct T { operator S(); };
10138 T t;
10139 const S& s = t;
10141 we can extend the lifetime of the return value of the conversion
10142 operator.
10144 The next several functions are involved in this lifetime extension. */
10146 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
10147 reference is being bound to a temporary. Create and return a new
10148 VAR_DECL with the indicated TYPE; this variable will store the value to
10149 which the reference is bound. */
10151 tree
10152 make_temporary_var_for_ref_to_temp (tree decl, tree type)
10154 tree var;
10156 /* Create the variable. */
10157 var = create_temporary_var (type);
10159 /* Register the variable. */
10160 if (VAR_P (decl)
10161 && (TREE_STATIC (decl) || CP_DECL_THREAD_LOCAL_P (decl)))
10163 /* Namespace-scope or local static; give it a mangled name. */
10164 /* FIXME share comdat with decl? */
10165 tree name;
10167 TREE_STATIC (var) = TREE_STATIC (decl);
10168 CP_DECL_THREAD_LOCAL_P (var) = CP_DECL_THREAD_LOCAL_P (decl);
10169 set_decl_tls_model (var, DECL_TLS_MODEL (decl));
10170 name = mangle_ref_init_variable (decl);
10171 DECL_NAME (var) = name;
10172 SET_DECL_ASSEMBLER_NAME (var, name);
10173 var = pushdecl_top_level (var);
10175 else
10176 /* Create a new cleanup level if necessary. */
10177 maybe_push_cleanup_level (type);
10179 return var;
10182 /* EXPR is the initializer for a variable DECL of reference or
10183 std::initializer_list type. Create, push and return a new VAR_DECL
10184 for the initializer so that it will live as long as DECL. Any
10185 cleanup for the new variable is returned through CLEANUP, and the
10186 code to initialize the new variable is returned through INITP. */
10188 static tree
10189 set_up_extended_ref_temp (tree decl, tree expr, vec<tree, va_gc> **cleanups,
10190 tree *initp)
10192 tree init;
10193 tree type;
10194 tree var;
10196 /* Create the temporary variable. */
10197 type = TREE_TYPE (expr);
10198 var = make_temporary_var_for_ref_to_temp (decl, type);
10199 layout_decl (var, 0);
10200 /* If the rvalue is the result of a function call it will be
10201 a TARGET_EXPR. If it is some other construct (such as a
10202 member access expression where the underlying object is
10203 itself the result of a function call), turn it into a
10204 TARGET_EXPR here. It is important that EXPR be a
10205 TARGET_EXPR below since otherwise the INIT_EXPR will
10206 attempt to make a bitwise copy of EXPR to initialize
10207 VAR. */
10208 if (TREE_CODE (expr) != TARGET_EXPR)
10209 expr = get_target_expr (expr);
10211 if (TREE_CODE (decl) == FIELD_DECL
10212 && extra_warnings && !TREE_NO_WARNING (decl))
10214 warning (OPT_Wextra, "a temporary bound to %qD only persists "
10215 "until the constructor exits", decl);
10216 TREE_NO_WARNING (decl) = true;
10219 /* Recursively extend temps in this initializer. */
10220 TARGET_EXPR_INITIAL (expr)
10221 = extend_ref_init_temps (decl, TARGET_EXPR_INITIAL (expr), cleanups);
10223 /* Any reference temp has a non-trivial initializer. */
10224 DECL_NONTRIVIALLY_INITIALIZED_P (var) = true;
10226 /* If the initializer is constant, put it in DECL_INITIAL so we get
10227 static initialization and use in constant expressions. */
10228 init = maybe_constant_init (expr);
10229 if (TREE_CONSTANT (init))
10231 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
10233 /* 5.19 says that a constant expression can include an
10234 lvalue-rvalue conversion applied to "a glvalue of literal type
10235 that refers to a non-volatile temporary object initialized
10236 with a constant expression". Rather than try to communicate
10237 that this VAR_DECL is a temporary, just mark it constexpr.
10239 Currently this is only useful for initializer_list temporaries,
10240 since reference vars can't appear in constant expressions. */
10241 DECL_DECLARED_CONSTEXPR_P (var) = true;
10242 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var) = true;
10243 TREE_CONSTANT (var) = true;
10245 DECL_INITIAL (var) = init;
10246 init = NULL_TREE;
10248 else
10249 /* Create the INIT_EXPR that will initialize the temporary
10250 variable. */
10251 init = split_nonconstant_init (var, expr);
10252 if (at_function_scope_p ())
10254 add_decl_expr (var);
10256 if (TREE_STATIC (var))
10257 init = add_stmt_to_compound (init, register_dtor_fn (var));
10258 else
10260 tree cleanup = cxx_maybe_build_cleanup (var, tf_warning_or_error);
10261 if (cleanup)
10262 vec_safe_push (*cleanups, cleanup);
10265 /* We must be careful to destroy the temporary only
10266 after its initialization has taken place. If the
10267 initialization throws an exception, then the
10268 destructor should not be run. We cannot simply
10269 transform INIT into something like:
10271 (INIT, ({ CLEANUP_STMT; }))
10273 because emit_local_var always treats the
10274 initializer as a full-expression. Thus, the
10275 destructor would run too early; it would run at the
10276 end of initializing the reference variable, rather
10277 than at the end of the block enclosing the
10278 reference variable.
10280 The solution is to pass back a cleanup expression
10281 which the caller is responsible for attaching to
10282 the statement tree. */
10284 else
10286 rest_of_decl_compilation (var, /*toplev=*/1, at_eof);
10287 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
10289 if (CP_DECL_THREAD_LOCAL_P (var))
10290 tls_aggregates = tree_cons (NULL_TREE, var,
10291 tls_aggregates);
10292 else
10293 static_aggregates = tree_cons (NULL_TREE, var,
10294 static_aggregates);
10296 else
10297 /* Check whether the dtor is callable. */
10298 cxx_maybe_build_cleanup (var, tf_warning_or_error);
10300 /* Avoid -Wunused-variable warning (c++/38958). */
10301 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
10302 && VAR_P (decl))
10303 TREE_USED (decl) = DECL_READ_P (decl) = true;
10305 *initp = init;
10306 return var;
10309 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
10310 initializing a variable of that TYPE. */
10312 tree
10313 initialize_reference (tree type, tree expr,
10314 int flags, tsubst_flags_t complain)
10316 conversion *conv;
10317 void *p;
10318 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
10320 if (type == error_mark_node || error_operand_p (expr))
10321 return error_mark_node;
10323 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10324 p = conversion_obstack_alloc (0);
10326 conv = reference_binding (type, TREE_TYPE (expr), expr, /*c_cast_p=*/false,
10327 flags, complain);
10328 if (!conv || conv->bad_p)
10330 if (complain & tf_error)
10332 if (conv)
10333 convert_like (conv, expr, complain);
10334 else if (!CP_TYPE_CONST_P (TREE_TYPE (type))
10335 && !TYPE_REF_IS_RVALUE (type)
10336 && !lvalue_p (expr))
10337 error_at (loc, "invalid initialization of non-const reference of "
10338 "type %qT from an rvalue of type %qT",
10339 type, TREE_TYPE (expr));
10340 else
10341 error_at (loc, "invalid initialization of reference of type "
10342 "%qT from expression of type %qT", type,
10343 TREE_TYPE (expr));
10345 return error_mark_node;
10348 if (conv->kind == ck_ref_bind)
10349 /* Perform the conversion. */
10350 expr = convert_like (conv, expr, complain);
10351 else if (conv->kind == ck_ambig)
10352 /* We gave an error in build_user_type_conversion_1. */
10353 expr = error_mark_node;
10354 else
10355 gcc_unreachable ();
10357 /* Free all the conversions we allocated. */
10358 obstack_free (&conversion_obstack, p);
10360 return expr;
10363 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
10364 which is bound either to a reference or a std::initializer_list. */
10366 static tree
10367 extend_ref_init_temps_1 (tree decl, tree init, vec<tree, va_gc> **cleanups)
10369 tree sub = init;
10370 tree *p;
10371 STRIP_NOPS (sub);
10372 if (TREE_CODE (sub) == COMPOUND_EXPR)
10374 TREE_OPERAND (sub, 1)
10375 = extend_ref_init_temps_1 (decl, TREE_OPERAND (sub, 1), cleanups);
10376 return init;
10378 if (TREE_CODE (sub) != ADDR_EXPR)
10379 return init;
10380 /* Deal with binding to a subobject. */
10381 for (p = &TREE_OPERAND (sub, 0); TREE_CODE (*p) == COMPONENT_REF; )
10382 p = &TREE_OPERAND (*p, 0);
10383 if (TREE_CODE (*p) == TARGET_EXPR)
10385 tree subinit = NULL_TREE;
10386 *p = set_up_extended_ref_temp (decl, *p, cleanups, &subinit);
10387 recompute_tree_invariant_for_addr_expr (sub);
10388 if (init != sub)
10389 init = fold_convert (TREE_TYPE (init), sub);
10390 if (subinit)
10391 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), subinit, init);
10393 return init;
10396 /* INIT is part of the initializer for DECL. If there are any
10397 reference or initializer lists being initialized, extend their
10398 lifetime to match that of DECL. */
10400 tree
10401 extend_ref_init_temps (tree decl, tree init, vec<tree, va_gc> **cleanups)
10403 tree type = TREE_TYPE (init);
10404 if (processing_template_decl)
10405 return init;
10406 if (TREE_CODE (type) == REFERENCE_TYPE)
10407 init = extend_ref_init_temps_1 (decl, init, cleanups);
10408 else
10410 tree ctor = init;
10411 if (TREE_CODE (ctor) == TARGET_EXPR)
10412 ctor = TARGET_EXPR_INITIAL (ctor);
10413 if (TREE_CODE (ctor) == CONSTRUCTOR)
10415 if (is_std_init_list (type))
10417 /* The temporary array underlying a std::initializer_list
10418 is handled like a reference temporary. */
10419 tree array = CONSTRUCTOR_ELT (ctor, 0)->value;
10420 array = extend_ref_init_temps_1 (decl, array, cleanups);
10421 CONSTRUCTOR_ELT (ctor, 0)->value = array;
10423 else
10425 unsigned i;
10426 constructor_elt *p;
10427 vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (ctor);
10428 FOR_EACH_VEC_SAFE_ELT (elts, i, p)
10429 p->value = extend_ref_init_temps (decl, p->value, cleanups);
10434 return init;
10437 /* Returns true iff an initializer for TYPE could contain temporaries that
10438 need to be extended because they are bound to references or
10439 std::initializer_list. */
10441 bool
10442 type_has_extended_temps (tree type)
10444 type = strip_array_types (type);
10445 if (TREE_CODE (type) == REFERENCE_TYPE)
10446 return true;
10447 if (CLASS_TYPE_P (type))
10449 if (is_std_init_list (type))
10450 return true;
10451 for (tree f = next_initializable_field (TYPE_FIELDS (type));
10452 f; f = next_initializable_field (DECL_CHAIN (f)))
10453 if (type_has_extended_temps (TREE_TYPE (f)))
10454 return true;
10456 return false;
10459 /* Returns true iff TYPE is some variant of std::initializer_list. */
10461 bool
10462 is_std_init_list (tree type)
10464 /* Look through typedefs. */
10465 if (!TYPE_P (type))
10466 return false;
10467 if (cxx_dialect == cxx98)
10468 return false;
10469 type = TYPE_MAIN_VARIANT (type);
10470 return (CLASS_TYPE_P (type)
10471 && CP_TYPE_CONTEXT (type) == std_node
10472 && strcmp (TYPE_NAME_STRING (type), "initializer_list") == 0);
10475 /* Returns true iff DECL is a list constructor: i.e. a constructor which
10476 will accept an argument list of a single std::initializer_list<T>. */
10478 bool
10479 is_list_ctor (tree decl)
10481 tree args = FUNCTION_FIRST_USER_PARMTYPE (decl);
10482 tree arg;
10484 if (!args || args == void_list_node)
10485 return false;
10487 arg = non_reference (TREE_VALUE (args));
10488 if (!is_std_init_list (arg))
10489 return false;
10491 args = TREE_CHAIN (args);
10493 if (args && args != void_list_node && !TREE_PURPOSE (args))
10494 /* There are more non-defaulted parms. */
10495 return false;
10497 return true;
10500 #include "gt-cp-call.h"