c++: P0847R7 (deducing this) - initial functionality. [PR102609]
[official-gcc.git] / gcc / cp / call.cc
blobdca8e5090e2677fb46ca7672e96a7d94f505bf30
1 /* Functions related to invoking -*- C++ -*- methods and overloaded functions.
2 Copyright (C) 1987-2024 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"
42 #include "stringpool.h"
43 #include "attribs.h"
44 #include "decl.h"
45 #include "gcc-rich-location.h"
46 #include "tristate.h"
48 /* The various kinds of conversion. */
50 enum conversion_kind {
51 ck_identity,
52 ck_lvalue,
53 ck_fnptr,
54 ck_qual,
55 ck_std,
56 ck_ptr,
57 ck_pmem,
58 ck_base,
59 ck_ref_bind,
60 ck_user,
61 ck_ambig,
62 ck_list,
63 ck_aggr,
64 ck_rvalue,
65 /* When LOOKUP_SHORTCUT_BAD_CONVS is set, we may return a conversion of
66 this kind whenever we know the true conversion is either bad or outright
67 invalid, but we don't want to attempt to compute the bad conversion (for
68 sake of avoiding unnecessary instantiation). bad_p should always be set
69 for these. */
70 ck_deferred_bad,
73 /* The rank of the conversion. Order of the enumerals matters; better
74 conversions should come earlier in the list. */
76 enum conversion_rank {
77 cr_identity,
78 cr_exact,
79 cr_promotion,
80 cr_std,
81 cr_pbool,
82 cr_user,
83 cr_ellipsis,
84 cr_bad
87 /* An implicit conversion sequence, in the sense of [over.best.ics].
88 The first conversion to be performed is at the end of the chain.
89 That conversion is always a cr_identity conversion. */
91 struct conversion {
92 /* The kind of conversion represented by this step. */
93 conversion_kind kind;
94 /* The rank of this conversion. */
95 conversion_rank rank;
96 BOOL_BITFIELD user_conv_p : 1;
97 BOOL_BITFIELD ellipsis_p : 1;
98 BOOL_BITFIELD this_p : 1;
99 /* True if this conversion would be permitted with a bending of
100 language standards, e.g. disregarding pointer qualifiers or
101 converting integers to pointers. */
102 BOOL_BITFIELD bad_p : 1;
103 /* If KIND is ck_ref_bind or ck_base, true to indicate that a
104 temporary should be created to hold the result of the
105 conversion. If KIND is ck_ambig or ck_user, true means force
106 copy-initialization. */
107 BOOL_BITFIELD need_temporary_p : 1;
108 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
109 from a pointer-to-derived to pointer-to-base is being performed. */
110 BOOL_BITFIELD base_p : 1;
111 /* If KIND is ck_ref_bind, true when either an lvalue reference is
112 being bound to an lvalue expression or an rvalue reference is
113 being bound to an rvalue expression. If KIND is ck_rvalue or ck_base,
114 true when we are treating an lvalue as an rvalue (12.8p33). If
115 ck_identity, we will be binding a reference directly or decaying to
116 a pointer. */
117 BOOL_BITFIELD rvaluedness_matches_p: 1;
118 BOOL_BITFIELD check_narrowing: 1;
119 /* Whether check_narrowing should only check TREE_CONSTANTs; used
120 in build_converted_constant_expr. */
121 BOOL_BITFIELD check_narrowing_const_only: 1;
122 /* True if this conversion is taking place in a copy-initialization context
123 and we should only consider converting constructors. Only set in
124 ck_base and ck_rvalue. */
125 BOOL_BITFIELD copy_init_p : 1;
126 /* The type of the expression resulting from the conversion. */
127 tree type;
128 union {
129 /* The next conversion in the chain. Since the conversions are
130 arranged from outermost to innermost, the NEXT conversion will
131 actually be performed before this conversion. This variant is
132 used only when KIND is neither ck_identity, ck_aggr, ck_ambig nor
133 ck_list. Please use the next_conversion function instead
134 of using this field directly. */
135 conversion *next;
136 /* The expression at the beginning of the conversion chain. This
137 variant is used only if KIND is ck_identity, ck_aggr, or ck_ambig.
138 You can use conv_get_original_expr to get this expression. */
139 tree expr;
140 /* The array of conversions for an initializer_list, so this
141 variant is used only when KIN D is ck_list. */
142 conversion **list;
143 } u;
144 /* The function candidate corresponding to this conversion
145 sequence. This field is only used if KIND is ck_user. */
146 struct z_candidate *cand;
149 #define CONVERSION_RANK(NODE) \
150 ((NODE)->bad_p ? cr_bad \
151 : (NODE)->ellipsis_p ? cr_ellipsis \
152 : (NODE)->user_conv_p ? cr_user \
153 : (NODE)->rank)
155 #define BAD_CONVERSION_RANK(NODE) \
156 ((NODE)->ellipsis_p ? cr_ellipsis \
157 : (NODE)->user_conv_p ? cr_user \
158 : (NODE)->rank)
160 static struct obstack conversion_obstack;
161 static bool conversion_obstack_initialized;
162 struct rejection_reason;
164 static struct z_candidate * tourney (struct z_candidate *, tsubst_flags_t);
165 static int equal_functions (tree, tree);
166 static int joust (struct z_candidate *, struct z_candidate *, bool,
167 tsubst_flags_t);
168 static int compare_ics (conversion *, conversion *);
169 static void maybe_warn_class_memaccess (location_t, tree,
170 const vec<tree, va_gc> *);
171 static tree build_over_call (struct z_candidate *, int, tsubst_flags_t);
172 static tree convert_like (conversion *, tree, tsubst_flags_t);
173 static tree convert_like_with_context (conversion *, tree, tree, int,
174 tsubst_flags_t);
175 static void op_error (const op_location_t &, enum tree_code, enum tree_code,
176 tree, tree, tree, bool);
177 static struct z_candidate *build_user_type_conversion_1 (tree, tree, int,
178 tsubst_flags_t);
179 static void print_z_candidate (location_t, const char *, struct z_candidate *);
180 static void print_z_candidates (location_t, struct z_candidate *,
181 tristate = tristate::unknown ());
182 static tree build_this (tree);
183 static struct z_candidate *splice_viable (struct z_candidate *, bool, bool *);
184 static bool any_strictly_viable (struct z_candidate *);
185 static struct z_candidate *add_template_candidate
186 (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *,
187 tree, tree, tree, int, unification_kind_t, bool, tsubst_flags_t);
188 static struct z_candidate *add_template_candidate_real
189 (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *,
190 tree, tree, tree, int, tree, unification_kind_t, bool, tsubst_flags_t);
191 static bool is_complete (tree);
192 static struct z_candidate *add_conv_candidate
193 (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, tree,
194 tree, tsubst_flags_t);
195 static struct z_candidate *add_function_candidate
196 (struct z_candidate **, tree, tree, tree, const vec<tree, va_gc> *, tree,
197 tree, int, conversion**, bool, tsubst_flags_t);
198 static conversion *implicit_conversion (tree, tree, tree, bool, int,
199 tsubst_flags_t);
200 static conversion *reference_binding (tree, tree, tree, bool, int,
201 tsubst_flags_t);
202 static conversion *build_conv (conversion_kind, tree, conversion *);
203 static conversion *build_list_conv (tree, tree, int, tsubst_flags_t);
204 static conversion *next_conversion (conversion *);
205 static bool is_subseq (conversion *, conversion *);
206 static conversion *maybe_handle_ref_bind (conversion **);
207 static void maybe_handle_implicit_object (conversion **);
208 static struct z_candidate *add_candidate
209 (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, size_t,
210 conversion **, tree, tree, int, struct rejection_reason *, int);
211 static tree source_type (conversion *);
212 static void add_warning (struct z_candidate *, struct z_candidate *);
213 static conversion *direct_reference_binding (tree, conversion *);
214 static bool promoted_arithmetic_type_p (tree);
215 static conversion *conditional_conversion (tree, tree, tsubst_flags_t);
216 static char *name_as_c_string (tree, tree, bool *);
217 static tree prep_operand (tree);
218 static void add_candidates (tree, tree, const vec<tree, va_gc> *, tree, tree,
219 bool, tree, tree, int, struct z_candidate **,
220 tsubst_flags_t);
221 static conversion *merge_conversion_sequences (conversion *, conversion *);
222 static tree build_temp (tree, tree, int, diagnostic_t *, tsubst_flags_t);
223 static conversion *build_identity_conv (tree, tree);
224 static inline bool conv_binds_to_array_of_unknown_bound (conversion *);
225 static bool conv_is_prvalue (conversion *);
226 static tree prevent_lifetime_extension (tree);
228 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
229 NAME can take many forms... */
231 bool
232 check_dtor_name (tree basetype, tree name)
234 /* Just accept something we've already complained about. */
235 if (name == error_mark_node)
236 return true;
238 if (TREE_CODE (name) == TYPE_DECL)
239 name = TREE_TYPE (name);
240 else if (TYPE_P (name))
241 /* OK */;
242 else if (identifier_p (name))
244 if ((MAYBE_CLASS_TYPE_P (basetype)
245 || TREE_CODE (basetype) == ENUMERAL_TYPE)
246 && name == constructor_name (basetype))
247 return true;
249 /* Otherwise lookup the name, it could be an unrelated typedef
250 of the correct type. */
251 name = lookup_name (name, LOOK_want::TYPE);
252 if (!name)
253 return false;
254 name = TREE_TYPE (name);
255 if (name == error_mark_node)
256 return false;
258 else
260 /* In the case of:
262 template <class T> struct S { ~S(); };
263 int i;
264 i.~S();
266 NAME will be a class template. */
267 gcc_assert (DECL_CLASS_TEMPLATE_P (name));
268 return false;
271 return same_type_p (TYPE_MAIN_VARIANT (basetype), TYPE_MAIN_VARIANT (name));
274 /* We want the address of a function or method. We avoid creating a
275 pointer-to-member function. */
277 tree
278 build_addr_func (tree function, tsubst_flags_t complain)
280 tree type = TREE_TYPE (function);
282 /* We have to do these by hand to avoid real pointer to member
283 functions. */
284 if (TREE_CODE (type) == METHOD_TYPE)
286 if (TREE_CODE (function) == OFFSET_REF)
288 tree object = build_address (TREE_OPERAND (function, 0));
289 return get_member_function_from_ptrfunc (&object,
290 TREE_OPERAND (function, 1),
291 complain);
293 function = build_address (function);
295 else if (TREE_CODE (function) == FUNCTION_DECL
296 && DECL_IMMEDIATE_FUNCTION_P (function))
297 function = build_address (function);
298 else
299 function = decay_conversion (function, complain, /*reject_builtin=*/false);
301 return function;
304 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
305 POINTER_TYPE to those. Note, pointer to member function types
306 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
307 two variants. build_call_a is the primitive taking an array of
308 arguments, while build_call_n is a wrapper that handles varargs. */
310 tree
311 build_call_n (tree function, int n, ...)
313 if (n == 0)
314 return build_call_a (function, 0, NULL);
315 else
317 tree *argarray = XALLOCAVEC (tree, n);
318 va_list ap;
319 int i;
321 va_start (ap, n);
322 for (i = 0; i < n; i++)
323 argarray[i] = va_arg (ap, tree);
324 va_end (ap);
325 return build_call_a (function, n, argarray);
329 /* Update various flags in cfun and the call itself based on what is being
330 called. Split out of build_call_a so that bot_manip can use it too. */
332 void
333 set_flags_from_callee (tree call)
335 /* Handle both CALL_EXPRs and AGGR_INIT_EXPRs. */
336 tree decl = cp_get_callee_fndecl_nofold (call);
338 /* We check both the decl and the type; a function may be known not to
339 throw without being declared throw(). */
340 bool nothrow = decl && TREE_NOTHROW (decl);
341 tree callee = cp_get_callee (call);
342 if (callee)
343 nothrow |= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (callee)));
344 else if (TREE_CODE (call) == CALL_EXPR
345 && internal_fn_flags (CALL_EXPR_IFN (call)) & ECF_NOTHROW)
346 nothrow = true;
348 if (cfun && cp_function_chain && !cp_unevaluated_operand)
350 if (!nothrow && at_function_scope_p ())
351 cp_function_chain->can_throw = 1;
353 if (decl && TREE_THIS_VOLATILE (decl))
354 current_function_returns_abnormally = 1;
357 TREE_NOTHROW (call) = nothrow;
360 tree
361 build_call_a (tree function, int n, tree *argarray)
363 tree decl;
364 tree result_type;
365 tree fntype;
366 int i;
368 function = build_addr_func (function, tf_warning_or_error);
370 gcc_assert (TYPE_PTR_P (TREE_TYPE (function)));
371 fntype = TREE_TYPE (TREE_TYPE (function));
372 gcc_assert (FUNC_OR_METHOD_TYPE_P (fntype));
373 result_type = TREE_TYPE (fntype);
374 /* An rvalue has no cv-qualifiers. */
375 if (SCALAR_TYPE_P (result_type) || VOID_TYPE_P (result_type))
376 result_type = cv_unqualified (result_type);
378 function = build_call_array_loc (input_location,
379 result_type, function, n, argarray);
380 set_flags_from_callee (function);
382 decl = get_callee_fndecl (function);
384 if (decl && !TREE_USED (decl))
386 /* We invoke build_call directly for several library
387 functions. These may have been declared normally if
388 we're building libgcc, so we can't just check
389 DECL_ARTIFICIAL. */
390 gcc_assert (DECL_ARTIFICIAL (decl)
391 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl)),
392 "__", 2));
393 mark_used (decl);
396 require_complete_eh_spec_types (fntype, decl);
398 TREE_HAS_CONSTRUCTOR (function) = (decl && DECL_CONSTRUCTOR_P (decl));
400 /* Don't pass empty class objects by value. This is useful
401 for tags in STL, which are used to control overload resolution.
402 We don't need to handle other cases of copying empty classes. */
403 if (!decl || !fndecl_built_in_p (decl))
404 for (i = 0; i < n; i++)
406 tree arg = CALL_EXPR_ARG (function, i);
407 if (is_empty_class (TREE_TYPE (arg))
408 && simple_empty_class_p (TREE_TYPE (arg), arg, INIT_EXPR))
410 while (TREE_CODE (arg) == TARGET_EXPR)
411 /* We're disconnecting the initializer from its target,
412 don't create a temporary. */
413 arg = TARGET_EXPR_INITIAL (arg);
414 tree t = build0 (EMPTY_CLASS_EXPR, TREE_TYPE (arg));
415 arg = build2 (COMPOUND_EXPR, TREE_TYPE (t), arg, t);
416 CALL_EXPR_ARG (function, i) = arg;
420 return function;
423 /* New overloading code. */
425 struct z_candidate;
427 struct candidate_warning {
428 z_candidate *loser;
429 candidate_warning *next;
432 /* Information for providing diagnostics about why overloading failed. */
434 enum rejection_reason_code {
435 rr_none,
436 rr_arity,
437 rr_explicit_conversion,
438 rr_template_conversion,
439 rr_arg_conversion,
440 rr_bad_arg_conversion,
441 rr_template_unification,
442 rr_invalid_copy,
443 rr_inherited_ctor,
444 rr_constraint_failure,
445 rr_ignored,
448 struct conversion_info {
449 /* The index of the argument, 0-based. */
450 int n_arg;
451 /* The actual argument or its type. */
452 tree from;
453 /* The type of the parameter. */
454 tree to_type;
455 /* The location of the argument. */
456 location_t loc;
459 struct rejection_reason {
460 enum rejection_reason_code code;
461 union {
462 /* Information about an arity mismatch. */
463 struct {
464 /* The expected number of arguments. */
465 int expected;
466 /* The actual number of arguments in the call. */
467 int actual;
468 /* Whether EXPECTED should be treated as a lower bound. */
469 bool least_p;
470 } arity;
471 /* Information about an argument conversion mismatch. */
472 struct conversion_info conversion;
473 /* Same, but for bad argument conversions. */
474 struct conversion_info bad_conversion;
475 /* Information about template unification failures. These are the
476 parameters passed to fn_type_unification. */
477 struct {
478 tree tmpl;
479 tree explicit_targs;
480 int num_targs;
481 const tree *args;
482 unsigned int nargs;
483 tree return_type;
484 unification_kind_t strict;
485 int flags;
486 } template_unification;
487 /* Information about template instantiation failures. These are the
488 parameters passed to instantiate_template. */
489 struct {
490 tree tmpl;
491 tree targs;
492 } template_instantiation;
493 } u;
496 struct z_candidate {
497 /* The FUNCTION_DECL that will be called if this candidate is
498 selected by overload resolution. */
499 tree fn;
500 /* If not NULL_TREE, the first argument to use when calling this
501 function. */
502 tree first_arg;
503 /* The rest of the arguments to use when calling this function. If
504 there are no further arguments this may be NULL or it may be an
505 empty vector. */
506 const vec<tree, va_gc> *args;
507 /* The implicit conversion sequences for each of the arguments to
508 FN. */
509 conversion **convs;
510 /* The number of implicit conversion sequences. */
511 size_t num_convs;
512 /* If FN is a user-defined conversion, the standard conversion
513 sequence from the type returned by FN to the desired destination
514 type. */
515 conversion *second_conv;
516 struct rejection_reason *reason;
517 /* If FN is a member function, the binfo indicating the path used to
518 qualify the name of FN at the call site. This path is used to
519 determine whether or not FN is accessible if it is selected by
520 overload resolution. The DECL_CONTEXT of FN will always be a
521 (possibly improper) base of this binfo. */
522 tree access_path;
523 /* If FN is a non-static member function, the binfo indicating the
524 subobject to which the `this' pointer should be converted if FN
525 is selected by overload resolution. The type pointed to by
526 the `this' pointer must correspond to the most derived class
527 indicated by the CONVERSION_PATH. */
528 tree conversion_path;
529 tree template_decl;
530 tree explicit_targs;
531 candidate_warning *warnings;
532 z_candidate *next;
533 int viable;
535 /* The flags active in add_candidate. */
536 int flags;
538 bool rewritten () const { return (flags & LOOKUP_REWRITTEN); }
539 bool reversed () const { return (flags & LOOKUP_REVERSED); }
542 /* Returns true iff T is a null pointer constant in the sense of
543 [conv.ptr]. */
545 bool
546 null_ptr_cst_p (tree t)
548 tree type = TREE_TYPE (t);
550 /* [conv.ptr]
552 A null pointer constant is an integer literal ([lex.icon]) with value
553 zero or a prvalue of type std::nullptr_t. */
554 if (NULLPTR_TYPE_P (type))
555 return true;
557 if (cxx_dialect >= cxx11)
559 STRIP_ANY_LOCATION_WRAPPER (t);
561 /* Core issue 903 says only literal 0 is a null pointer constant. */
562 if (TREE_CODE (t) == INTEGER_CST
563 && !TREE_OVERFLOW (t)
564 && TREE_CODE (type) == INTEGER_TYPE
565 && integer_zerop (t)
566 && !char_type_p (type))
567 return true;
569 else if (CP_INTEGRAL_TYPE_P (type))
571 t = fold_non_dependent_expr (t, tf_none);
572 STRIP_NOPS (t);
573 if (integer_zerop (t) && !TREE_OVERFLOW (t))
574 return true;
577 return false;
580 /* Returns true iff T is a null member pointer value (4.11). */
582 bool
583 null_member_pointer_value_p (tree t)
585 tree type = TREE_TYPE (t);
586 if (!type)
587 return false;
588 else if (TYPE_PTRMEMFUNC_P (type))
589 return (TREE_CODE (t) == CONSTRUCTOR
590 && CONSTRUCTOR_NELTS (t)
591 && integer_zerop (CONSTRUCTOR_ELT (t, 0)->value));
592 else if (TYPE_PTRDATAMEM_P (type))
593 return integer_all_onesp (t);
594 else
595 return false;
598 /* Returns nonzero if PARMLIST consists of only default parms,
599 ellipsis, and/or undeduced parameter packs. */
601 bool
602 sufficient_parms_p (const_tree parmlist)
604 for (; parmlist && parmlist != void_list_node;
605 parmlist = TREE_CHAIN (parmlist))
606 if (!TREE_PURPOSE (parmlist)
607 && !PACK_EXPANSION_P (TREE_VALUE (parmlist)))
608 return false;
609 return true;
612 /* Allocate N bytes of memory from the conversion obstack. The memory
613 is zeroed before being returned. */
615 static void *
616 conversion_obstack_alloc (size_t n)
618 void *p;
619 if (!conversion_obstack_initialized)
621 gcc_obstack_init (&conversion_obstack);
622 conversion_obstack_initialized = true;
624 p = obstack_alloc (&conversion_obstack, n);
625 memset (p, 0, n);
626 return p;
629 /* RAII class to discard anything added to conversion_obstack. */
631 struct conversion_obstack_sentinel
633 void *p;
634 conversion_obstack_sentinel (): p (conversion_obstack_alloc (0)) {}
635 ~conversion_obstack_sentinel () { obstack_free (&conversion_obstack, p); }
638 /* Allocate rejection reasons. */
640 static struct rejection_reason *
641 alloc_rejection (enum rejection_reason_code code)
643 struct rejection_reason *p;
644 p = (struct rejection_reason *) conversion_obstack_alloc (sizeof *p);
645 p->code = code;
646 return p;
649 static struct rejection_reason *
650 arity_rejection (tree first_arg, int expected, int actual, bool least_p = false)
652 struct rejection_reason *r = alloc_rejection (rr_arity);
653 int adjust = first_arg != NULL_TREE;
654 r->u.arity.expected = expected - adjust;
655 r->u.arity.actual = actual - adjust;
656 r->u.arity.least_p = least_p;
657 return r;
660 static struct rejection_reason *
661 arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to,
662 location_t loc)
664 struct rejection_reason *r = alloc_rejection (rr_arg_conversion);
665 int adjust = first_arg != NULL_TREE;
666 r->u.conversion.n_arg = n_arg - adjust;
667 r->u.conversion.from = from;
668 r->u.conversion.to_type = to;
669 r->u.conversion.loc = loc;
670 return r;
673 static struct rejection_reason *
674 bad_arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to,
675 location_t loc)
677 struct rejection_reason *r = alloc_rejection (rr_bad_arg_conversion);
678 int adjust = first_arg != NULL_TREE;
679 r->u.bad_conversion.n_arg = n_arg - adjust;
680 r->u.bad_conversion.from = from;
681 r->u.bad_conversion.to_type = to;
682 r->u.bad_conversion.loc = loc;
683 return r;
686 static struct rejection_reason *
687 explicit_conversion_rejection (tree from, tree to)
689 struct rejection_reason *r = alloc_rejection (rr_explicit_conversion);
690 r->u.conversion.n_arg = 0;
691 r->u.conversion.from = from;
692 r->u.conversion.to_type = to;
693 r->u.conversion.loc = UNKNOWN_LOCATION;
694 return r;
697 static struct rejection_reason *
698 template_conversion_rejection (tree from, tree to)
700 struct rejection_reason *r = alloc_rejection (rr_template_conversion);
701 r->u.conversion.n_arg = 0;
702 r->u.conversion.from = from;
703 r->u.conversion.to_type = to;
704 r->u.conversion.loc = UNKNOWN_LOCATION;
705 return r;
708 static struct rejection_reason *
709 template_unification_rejection (tree tmpl, tree explicit_targs, tree targs,
710 const tree *args, unsigned int nargs,
711 tree return_type, unification_kind_t strict,
712 int flags)
714 size_t args_n_bytes = sizeof (*args) * nargs;
715 tree *args1 = (tree *) conversion_obstack_alloc (args_n_bytes);
716 struct rejection_reason *r = alloc_rejection (rr_template_unification);
717 r->u.template_unification.tmpl = tmpl;
718 r->u.template_unification.explicit_targs = explicit_targs;
719 r->u.template_unification.num_targs = TREE_VEC_LENGTH (targs);
720 /* Copy args to our own storage. */
721 memcpy (args1, args, args_n_bytes);
722 r->u.template_unification.args = args1;
723 r->u.template_unification.nargs = nargs;
724 r->u.template_unification.return_type = return_type;
725 r->u.template_unification.strict = strict;
726 r->u.template_unification.flags = flags;
727 return r;
730 static struct rejection_reason *
731 template_unification_error_rejection (void)
733 return alloc_rejection (rr_template_unification);
736 static struct rejection_reason *
737 invalid_copy_with_fn_template_rejection (void)
739 struct rejection_reason *r = alloc_rejection (rr_invalid_copy);
740 return r;
743 static struct rejection_reason *
744 inherited_ctor_rejection (void)
746 struct rejection_reason *r = alloc_rejection (rr_inherited_ctor);
747 return r;
750 /* Build a constraint failure record. */
752 static struct rejection_reason *
753 constraint_failure (void)
755 struct rejection_reason *r = alloc_rejection (rr_constraint_failure);
756 return r;
759 /* Dynamically allocate a conversion. */
761 static conversion *
762 alloc_conversion (conversion_kind kind)
764 conversion *c;
765 c = (conversion *) conversion_obstack_alloc (sizeof (conversion));
766 c->kind = kind;
767 return c;
770 /* Make sure that all memory on the conversion obstack has been
771 freed. */
773 void
774 validate_conversion_obstack (void)
776 if (conversion_obstack_initialized)
777 gcc_assert ((obstack_next_free (&conversion_obstack)
778 == obstack_base (&conversion_obstack)));
781 /* Dynamically allocate an array of N conversions. */
783 static conversion **
784 alloc_conversions (size_t n)
786 return (conversion **) conversion_obstack_alloc (n * sizeof (conversion *));
789 /* True iff the active member of conversion::u for code CODE is NEXT. */
791 static inline bool
792 has_next (conversion_kind code)
794 return !(code == ck_identity
795 || code == ck_ambig
796 || code == ck_list
797 || code == ck_aggr
798 || code == ck_deferred_bad);
801 static conversion *
802 build_conv (conversion_kind code, tree type, conversion *from)
804 conversion *t;
805 conversion_rank rank = CONVERSION_RANK (from);
807 /* Only call this function for conversions that use u.next. */
808 gcc_assert (from == NULL || has_next (code));
810 /* Note that the caller is responsible for filling in t->cand for
811 user-defined conversions. */
812 t = alloc_conversion (code);
813 t->type = type;
814 t->u.next = from;
816 switch (code)
818 case ck_ptr:
819 case ck_pmem:
820 case ck_base:
821 case ck_std:
822 if (rank < cr_std)
823 rank = cr_std;
824 break;
826 case ck_qual:
827 case ck_fnptr:
828 if (rank < cr_exact)
829 rank = cr_exact;
830 break;
832 default:
833 break;
835 t->rank = rank;
836 t->user_conv_p = (code == ck_user || from->user_conv_p);
837 t->bad_p = from->bad_p;
838 t->base_p = false;
839 return t;
842 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
843 specialization of std::initializer_list<T>, if such a conversion is
844 possible. */
846 static conversion *
847 build_list_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
849 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type), 0);
850 unsigned len = CONSTRUCTOR_NELTS (ctor);
851 conversion **subconvs = alloc_conversions (len);
852 conversion *t;
853 unsigned i;
854 tree val;
856 /* Within a list-initialization we can have more user-defined
857 conversions. */
858 flags &= ~LOOKUP_NO_CONVERSION;
859 /* But no narrowing conversions. */
860 flags |= LOOKUP_NO_NARROWING;
862 /* Can't make an array of these types. */
863 if (TYPE_REF_P (elttype)
864 || TREE_CODE (elttype) == FUNCTION_TYPE
865 || VOID_TYPE_P (elttype))
866 return NULL;
868 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
870 conversion *sub
871 = implicit_conversion (elttype, TREE_TYPE (val), val,
872 false, flags, complain);
873 if (sub == NULL)
874 return NULL;
876 subconvs[i] = sub;
879 t = alloc_conversion (ck_list);
880 t->type = type;
881 t->u.list = subconvs;
882 t->rank = cr_exact;
884 for (i = 0; i < len; ++i)
886 conversion *sub = subconvs[i];
887 if (sub->rank > t->rank)
888 t->rank = sub->rank;
889 if (sub->user_conv_p)
890 t->user_conv_p = true;
891 if (sub->bad_p)
892 t->bad_p = true;
895 return t;
898 /* Return the next conversion of the conversion chain (if applicable),
899 or NULL otherwise. Please use this function instead of directly
900 accessing fields of struct conversion. */
902 static conversion *
903 next_conversion (conversion *conv)
905 if (conv == NULL
906 || !has_next (conv->kind))
907 return NULL;
908 return conv->u.next;
911 /* Strip to the first ck_user, ck_ambig, ck_list, ck_aggr or ck_identity
912 encountered. */
914 static conversion *
915 strip_standard_conversion (conversion *conv)
917 while (conv
918 && conv->kind != ck_user
919 && has_next (conv->kind))
920 conv = next_conversion (conv);
921 return conv;
924 /* Subroutine of build_aggr_conv: check whether FROM is a valid aggregate
925 initializer for array type ATYPE. */
927 static bool
928 can_convert_array (tree atype, tree from, int flags, tsubst_flags_t complain)
930 tree elttype = TREE_TYPE (atype);
931 unsigned i;
933 if (TREE_CODE (from) == CONSTRUCTOR)
935 for (i = 0; i < CONSTRUCTOR_NELTS (from); ++i)
937 tree val = CONSTRUCTOR_ELT (from, i)->value;
938 bool ok;
939 if (TREE_CODE (elttype) == ARRAY_TYPE)
940 ok = can_convert_array (elttype, val, flags, complain);
941 else
942 ok = can_convert_arg (elttype, TREE_TYPE (val), val, flags,
943 complain);
944 if (!ok)
945 return false;
947 return true;
950 if (char_type_p (TYPE_MAIN_VARIANT (elttype))
951 && TREE_CODE (tree_strip_any_location_wrapper (from)) == STRING_CST)
952 return array_string_literal_compatible_p (atype, from);
954 /* No other valid way to aggregate initialize an array. */
955 return false;
958 /* Helper for build_aggr_conv. Return true if FIELD is in PSET, or if
959 FIELD has ANON_AGGR_TYPE_P and any initializable field in there recursively
960 is in PSET. */
962 static bool
963 field_in_pset (hash_set<tree, true> &pset, tree field)
965 if (pset.contains (field))
966 return true;
967 if (ANON_AGGR_TYPE_P (TREE_TYPE (field)))
968 for (field = TYPE_FIELDS (TREE_TYPE (field));
969 field; field = DECL_CHAIN (field))
971 field = next_aggregate_field (field);
972 if (field == NULL_TREE)
973 break;
974 if (field_in_pset (pset, field))
975 return true;
977 return false;
980 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
981 aggregate class, if such a conversion is possible. */
983 static conversion *
984 build_aggr_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
986 unsigned HOST_WIDE_INT i = 0;
987 conversion *c;
988 tree field = next_aggregate_field (TYPE_FIELDS (type));
989 tree empty_ctor = NULL_TREE;
990 hash_set<tree, true> pset;
992 /* We already called reshape_init in implicit_conversion, but it might not
993 have done anything in the case of parenthesized aggr init. */
995 /* The conversions within the init-list aren't affected by the enclosing
996 context; they're always simple copy-initialization. */
997 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
999 /* For designated initializers, verify that each initializer is convertible
1000 to corresponding TREE_TYPE (ce->index) and mark those FIELD_DECLs as
1001 visited. In the following loop then ignore already visited
1002 FIELD_DECLs. */
1003 tree idx, val;
1004 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), i, idx, val)
1006 if (!idx)
1007 break;
1009 gcc_checking_assert (TREE_CODE (idx) == FIELD_DECL);
1011 tree ftype = TREE_TYPE (idx);
1012 bool ok;
1014 if (TREE_CODE (ftype) == ARRAY_TYPE)
1015 ok = can_convert_array (ftype, val, flags, complain);
1016 else
1017 ok = can_convert_arg (ftype, TREE_TYPE (val), val, flags,
1018 complain);
1020 if (!ok)
1021 return NULL;
1023 /* For unions, there should be just one initializer. */
1024 if (TREE_CODE (type) == UNION_TYPE)
1026 field = NULL_TREE;
1027 i = 1;
1028 break;
1030 pset.add (idx);
1033 for (; field; field = next_aggregate_field (DECL_CHAIN (field)))
1035 tree ftype = TREE_TYPE (field);
1036 bool ok;
1038 if (!pset.is_empty () && field_in_pset (pset, field))
1039 continue;
1040 if (i < CONSTRUCTOR_NELTS (ctor))
1042 constructor_elt *ce = CONSTRUCTOR_ELT (ctor, i);
1043 gcc_checking_assert (!ce->index);
1044 val = ce->value;
1045 ++i;
1047 else if (DECL_INITIAL (field))
1048 val = get_nsdmi (field, /*ctor*/false, complain);
1049 else if (TYPE_REF_P (ftype))
1050 /* Value-initialization of reference is ill-formed. */
1051 return NULL;
1052 else
1054 if (empty_ctor == NULL_TREE)
1055 empty_ctor = build_constructor (init_list_type_node, NULL);
1056 val = empty_ctor;
1059 if (TREE_CODE (ftype) == ARRAY_TYPE)
1060 ok = can_convert_array (ftype, val, flags, complain);
1061 else
1062 ok = can_convert_arg (ftype, TREE_TYPE (val), val, flags,
1063 complain);
1065 if (!ok)
1066 return NULL;
1068 if (TREE_CODE (type) == UNION_TYPE)
1069 break;
1072 if (i < CONSTRUCTOR_NELTS (ctor))
1073 return NULL;
1075 c = alloc_conversion (ck_aggr);
1076 c->type = type;
1077 c->rank = cr_exact;
1078 c->user_conv_p = true;
1079 c->check_narrowing = true;
1080 c->u.expr = ctor;
1081 return c;
1084 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
1085 array type, if such a conversion is possible. */
1087 static conversion *
1088 build_array_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
1090 conversion *c;
1091 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
1092 tree elttype = TREE_TYPE (type);
1093 bool bad = false;
1094 bool user = false;
1095 enum conversion_rank rank = cr_exact;
1097 /* We might need to propagate the size from the element to the array. */
1098 complete_type (type);
1100 if (TYPE_DOMAIN (type)
1101 && !variably_modified_type_p (TYPE_DOMAIN (type), NULL_TREE))
1103 unsigned HOST_WIDE_INT alen = tree_to_uhwi (array_type_nelts_top (type));
1104 if (alen < len)
1105 return NULL;
1108 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
1110 for (auto &e: CONSTRUCTOR_ELTS (ctor))
1112 conversion *sub
1113 = implicit_conversion (elttype, TREE_TYPE (e.value), e.value,
1114 false, flags, complain);
1115 if (sub == NULL)
1116 return NULL;
1118 if (sub->rank > rank)
1119 rank = sub->rank;
1120 if (sub->user_conv_p)
1121 user = true;
1122 if (sub->bad_p)
1123 bad = true;
1126 c = alloc_conversion (ck_aggr);
1127 c->type = type;
1128 c->rank = rank;
1129 c->user_conv_p = user;
1130 c->bad_p = bad;
1131 c->u.expr = ctor;
1132 return c;
1135 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1136 complex type, if such a conversion is possible. */
1138 static conversion *
1139 build_complex_conv (tree type, tree ctor, int flags,
1140 tsubst_flags_t complain)
1142 conversion *c;
1143 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
1144 tree elttype = TREE_TYPE (type);
1145 bool bad = false;
1146 bool user = false;
1147 enum conversion_rank rank = cr_exact;
1149 if (len != 2)
1150 return NULL;
1152 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
1154 for (auto &e: CONSTRUCTOR_ELTS (ctor))
1156 conversion *sub
1157 = implicit_conversion (elttype, TREE_TYPE (e.value), e.value,
1158 false, flags, complain);
1159 if (sub == NULL)
1160 return NULL;
1162 if (sub->rank > rank)
1163 rank = sub->rank;
1164 if (sub->user_conv_p)
1165 user = true;
1166 if (sub->bad_p)
1167 bad = true;
1170 c = alloc_conversion (ck_aggr);
1171 c->type = type;
1172 c->rank = rank;
1173 c->user_conv_p = user;
1174 c->bad_p = bad;
1175 c->u.expr = ctor;
1176 return c;
1179 /* Build a representation of the identity conversion from EXPR to
1180 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1182 static conversion *
1183 build_identity_conv (tree type, tree expr)
1185 conversion *c;
1187 c = alloc_conversion (ck_identity);
1188 c->type = type;
1189 c->u.expr = expr;
1191 return c;
1194 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1195 were multiple user-defined conversions to accomplish the job.
1196 Build a conversion that indicates that ambiguity. */
1198 static conversion *
1199 build_ambiguous_conv (tree type, tree expr)
1201 conversion *c;
1203 c = alloc_conversion (ck_ambig);
1204 c->type = type;
1205 c->u.expr = expr;
1207 return c;
1210 tree
1211 strip_top_quals (tree t)
1213 if (TREE_CODE (t) == ARRAY_TYPE)
1214 return t;
1215 return cp_build_qualified_type (t, 0);
1218 /* Returns the standard conversion path (see [conv]) from type FROM to type
1219 TO, if any. For proper handling of null pointer constants, you must
1220 also pass the expression EXPR to convert from. If C_CAST_P is true,
1221 this conversion is coming from a C-style cast. */
1223 static conversion *
1224 standard_conversion (tree to, tree from, tree expr, bool c_cast_p,
1225 int flags, tsubst_flags_t complain)
1227 enum tree_code fcode, tcode;
1228 conversion *conv;
1229 bool fromref = false;
1230 tree qualified_to;
1232 to = non_reference (to);
1233 if (TYPE_REF_P (from))
1235 fromref = true;
1236 from = TREE_TYPE (from);
1238 qualified_to = to;
1239 to = strip_top_quals (to);
1240 from = strip_top_quals (from);
1242 if (expr && type_unknown_p (expr))
1244 if (TYPE_PTRFN_P (to) || TYPE_PTRMEMFUNC_P (to))
1246 tsubst_flags_t tflags = tf_conv;
1247 expr = instantiate_type (to, expr, tflags);
1248 if (expr == error_mark_node)
1249 return NULL;
1250 from = TREE_TYPE (expr);
1252 else if (TREE_CODE (to) == BOOLEAN_TYPE)
1254 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1255 expr = resolve_nondeduced_context (expr, complain);
1256 from = TREE_TYPE (expr);
1260 fcode = TREE_CODE (from);
1261 tcode = TREE_CODE (to);
1263 conv = build_identity_conv (from, expr);
1264 if (fcode == FUNCTION_TYPE || fcode == ARRAY_TYPE)
1266 from = type_decays_to (from);
1267 fcode = TREE_CODE (from);
1268 /* Tell convert_like that we're using the address. */
1269 conv->rvaluedness_matches_p = true;
1270 conv = build_conv (ck_lvalue, from, conv);
1272 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1273 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1274 express the copy constructor call required by copy-initialization. */
1275 else if (fromref || (expr && obvalue_p (expr)))
1277 if (expr)
1279 tree bitfield_type;
1280 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
1281 if (bitfield_type)
1283 from = strip_top_quals (bitfield_type);
1284 fcode = TREE_CODE (from);
1287 conv = build_conv (ck_rvalue, from, conv);
1288 /* If we're performing copy-initialization, remember to skip
1289 explicit constructors. */
1290 if (flags & LOOKUP_ONLYCONVERTING)
1291 conv->copy_init_p = true;
1294 /* Allow conversion between `__complex__' data types. */
1295 if (tcode == COMPLEX_TYPE && fcode == COMPLEX_TYPE)
1297 /* The standard conversion sequence to convert FROM to TO is
1298 the standard conversion sequence to perform componentwise
1299 conversion. */
1300 conversion *part_conv = standard_conversion
1301 (TREE_TYPE (to), TREE_TYPE (from), NULL_TREE, c_cast_p, flags,
1302 complain);
1304 if (!part_conv)
1305 conv = NULL;
1306 else if (part_conv->kind == ck_identity)
1307 /* Leave conv alone. */;
1308 else
1310 conv = build_conv (part_conv->kind, to, conv);
1311 conv->rank = part_conv->rank;
1314 return conv;
1317 if (same_type_p (from, to))
1319 if (CLASS_TYPE_P (to) && conv->kind == ck_rvalue)
1320 conv->type = qualified_to;
1321 return conv;
1324 /* [conv.ptr]
1325 A null pointer constant can be converted to a pointer type; ... A
1326 null pointer constant of integral type can be converted to an
1327 rvalue of type std::nullptr_t. */
1328 if ((tcode == POINTER_TYPE || TYPE_PTRMEM_P (to)
1329 || NULLPTR_TYPE_P (to))
1330 && ((expr && null_ptr_cst_p (expr))
1331 || NULLPTR_TYPE_P (from)))
1332 conv = build_conv (ck_std, to, conv);
1333 else if ((tcode == INTEGER_TYPE && fcode == POINTER_TYPE)
1334 || (tcode == POINTER_TYPE && fcode == INTEGER_TYPE))
1336 /* For backwards brain damage compatibility, allow interconversion of
1337 pointers and integers with a pedwarn. */
1338 conv = build_conv (ck_std, to, conv);
1339 conv->bad_p = true;
1341 else if (UNSCOPED_ENUM_P (to) && fcode == INTEGER_TYPE)
1343 /* For backwards brain damage compatibility, allow interconversion of
1344 enums and integers with a pedwarn. */
1345 conv = build_conv (ck_std, to, conv);
1346 conv->bad_p = true;
1348 else if ((tcode == POINTER_TYPE && fcode == POINTER_TYPE)
1349 || (TYPE_PTRDATAMEM_P (to) && TYPE_PTRDATAMEM_P (from)))
1351 tree to_pointee;
1352 tree from_pointee;
1354 if (tcode == POINTER_TYPE)
1356 to_pointee = TREE_TYPE (to);
1357 from_pointee = TREE_TYPE (from);
1359 /* Since this is the target of a pointer, it can't have function
1360 qualifiers, so any TYPE_QUALS must be for attributes const or
1361 noreturn. Strip them. */
1362 if (TREE_CODE (to_pointee) == FUNCTION_TYPE
1363 && TYPE_QUALS (to_pointee))
1364 to_pointee = build_qualified_type (to_pointee, TYPE_UNQUALIFIED);
1365 if (TREE_CODE (from_pointee) == FUNCTION_TYPE
1366 && TYPE_QUALS (from_pointee))
1367 from_pointee = build_qualified_type (from_pointee, TYPE_UNQUALIFIED);
1369 else
1371 to_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (to);
1372 from_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (from);
1375 if (tcode == POINTER_TYPE
1376 && same_type_ignoring_top_level_qualifiers_p (from_pointee,
1377 to_pointee))
1379 else if (VOID_TYPE_P (to_pointee)
1380 && !TYPE_PTRDATAMEM_P (from)
1381 && TREE_CODE (from_pointee) != FUNCTION_TYPE)
1383 tree nfrom = TREE_TYPE (from);
1384 /* Don't try to apply restrict to void. */
1385 int quals = cp_type_quals (nfrom) & ~TYPE_QUAL_RESTRICT;
1386 from_pointee = cp_build_qualified_type (void_type_node, quals);
1387 from = build_pointer_type (from_pointee);
1388 conv = build_conv (ck_ptr, from, conv);
1390 else if (TYPE_PTRDATAMEM_P (from))
1392 tree fbase = TYPE_PTRMEM_CLASS_TYPE (from);
1393 tree tbase = TYPE_PTRMEM_CLASS_TYPE (to);
1395 if (same_type_p (fbase, tbase))
1396 /* No base conversion needed. */;
1397 else if (DERIVED_FROM_P (fbase, tbase)
1398 && (same_type_ignoring_top_level_qualifiers_p
1399 (from_pointee, to_pointee)))
1401 from = build_ptrmem_type (tbase, from_pointee);
1402 conv = build_conv (ck_pmem, from, conv);
1404 else
1405 return NULL;
1407 else if (CLASS_TYPE_P (from_pointee)
1408 && CLASS_TYPE_P (to_pointee)
1409 /* [conv.ptr]
1411 An rvalue of type "pointer to cv D," where D is a
1412 class type, can be converted to an rvalue of type
1413 "pointer to cv B," where B is a base class (clause
1414 _class.derived_) of D. If B is an inaccessible
1415 (clause _class.access_) or ambiguous
1416 (_class.member.lookup_) base class of D, a program
1417 that necessitates this conversion is ill-formed.
1418 Therefore, we use DERIVED_FROM_P, and do not check
1419 access or uniqueness. */
1420 && DERIVED_FROM_P (to_pointee, from_pointee))
1422 from_pointee
1423 = cp_build_qualified_type (to_pointee,
1424 cp_type_quals (from_pointee));
1425 from = build_pointer_type (from_pointee);
1426 conv = build_conv (ck_ptr, from, conv);
1427 conv->base_p = true;
1430 if (same_type_p (from, to))
1431 /* OK */;
1432 else if (c_cast_p && comp_ptr_ttypes_const (to, from, bounds_either))
1433 /* In a C-style cast, we ignore CV-qualification because we
1434 are allowed to perform a static_cast followed by a
1435 const_cast. */
1436 conv = build_conv (ck_qual, to, conv);
1437 else if (!c_cast_p && comp_ptr_ttypes (to_pointee, from_pointee))
1438 conv = build_conv (ck_qual, to, conv);
1439 else if (expr && string_conv_p (to, expr, 0))
1440 /* converting from string constant to char *. */
1441 conv = build_conv (ck_qual, to, conv);
1442 else if (fnptr_conv_p (to, from))
1443 conv = build_conv (ck_fnptr, to, conv);
1444 /* Allow conversions among compatible ObjC pointer types (base
1445 conversions have been already handled above). */
1446 else if (c_dialect_objc ()
1447 && objc_compare_types (to, from, -4, NULL_TREE))
1448 conv = build_conv (ck_ptr, to, conv);
1449 else if (ptr_reasonably_similar (to_pointee, from_pointee))
1451 conv = build_conv (ck_ptr, to, conv);
1452 conv->bad_p = true;
1454 else
1455 return NULL;
1457 from = to;
1459 else if (TYPE_PTRMEMFUNC_P (to) && TYPE_PTRMEMFUNC_P (from))
1461 tree fromfn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from));
1462 tree tofn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to));
1463 tree fbase = class_of_this_parm (fromfn);
1464 tree tbase = class_of_this_parm (tofn);
1466 /* If FBASE and TBASE are equivalent but incomplete, DERIVED_FROM_P
1467 yields false. But a pointer to member of incomplete class is OK. */
1468 if (!same_type_p (fbase, tbase) && !DERIVED_FROM_P (fbase, tbase))
1469 return NULL;
1471 tree fstat = static_fn_type (fromfn);
1472 tree tstat = static_fn_type (tofn);
1473 if (same_type_p (tstat, fstat)
1474 || fnptr_conv_p (tstat, fstat))
1475 /* OK */;
1476 else
1477 return NULL;
1479 if (!same_type_p (fbase, tbase))
1481 from = build_memfn_type (fstat,
1482 tbase,
1483 cp_type_quals (tbase),
1484 type_memfn_rqual (tofn));
1485 from = build_ptrmemfunc_type (build_pointer_type (from));
1486 conv = build_conv (ck_pmem, from, conv);
1487 conv->base_p = true;
1489 if (fnptr_conv_p (tstat, fstat))
1490 conv = build_conv (ck_fnptr, to, conv);
1492 else if (tcode == BOOLEAN_TYPE)
1494 /* [conv.bool]
1496 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1497 to member type can be converted to a prvalue of type bool. ...
1498 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1499 std::nullptr_t can be converted to a prvalue of type bool; */
1500 if (ARITHMETIC_TYPE_P (from)
1501 || UNSCOPED_ENUM_P (from)
1502 || fcode == POINTER_TYPE
1503 || TYPE_PTRMEM_P (from)
1504 || NULLPTR_TYPE_P (from))
1506 conv = build_conv (ck_std, to, conv);
1507 if (fcode == POINTER_TYPE
1508 || TYPE_PTRDATAMEM_P (from)
1509 || (TYPE_PTRMEMFUNC_P (from)
1510 && conv->rank < cr_pbool)
1511 || NULLPTR_TYPE_P (from))
1512 conv->rank = cr_pbool;
1513 if (NULLPTR_TYPE_P (from) && (flags & LOOKUP_ONLYCONVERTING))
1514 conv->bad_p = true;
1515 if (flags & LOOKUP_NO_NARROWING)
1516 conv->check_narrowing = true;
1517 return conv;
1520 return NULL;
1522 /* We don't check for ENUMERAL_TYPE here because there are no standard
1523 conversions to enum type. */
1524 /* As an extension, allow conversion to complex type. */
1525 else if (ARITHMETIC_TYPE_P (to))
1527 if (! (INTEGRAL_CODE_P (fcode)
1528 || (fcode == REAL_TYPE && !(flags & LOOKUP_NO_NON_INTEGRAL)))
1529 || SCOPED_ENUM_P (from))
1530 return NULL;
1532 /* If we're parsing an enum with no fixed underlying type, we're
1533 dealing with an incomplete type, which renders the conversion
1534 ill-formed. */
1535 if (!COMPLETE_TYPE_P (from))
1536 return NULL;
1538 conv = build_conv (ck_std, to, conv);
1540 tree underlying_type = NULL_TREE;
1541 if (TREE_CODE (from) == ENUMERAL_TYPE
1542 && ENUM_FIXED_UNDERLYING_TYPE_P (from))
1543 underlying_type = ENUM_UNDERLYING_TYPE (from);
1545 /* Give this a better rank if it's a promotion.
1547 To handle CWG 1601, also bump the rank if we are converting
1548 an enumeration with a fixed underlying type to the underlying
1549 type. */
1550 if ((same_type_p (to, type_promotes_to (from))
1551 || (underlying_type && same_type_p (to, underlying_type)))
1552 && next_conversion (conv)->rank <= cr_promotion)
1553 conv->rank = cr_promotion;
1555 /* A prvalue of floating-point type can be converted to a prvalue of
1556 another floating-point type with a greater or equal conversion
1557 rank ([conv.rank]). A prvalue of standard floating-point type can
1558 be converted to a prvalue of another standard floating-point type.
1559 For backwards compatibility with handling __float128 and other
1560 non-standard floating point types, allow all implicit floating
1561 point conversions if neither type is extended floating-point
1562 type and if at least one of them is, fail if they have unordered
1563 conversion rank or from has higher conversion rank. */
1564 if (fcode == REAL_TYPE
1565 && tcode == REAL_TYPE
1566 && (extended_float_type_p (from)
1567 || extended_float_type_p (to))
1568 && cp_compare_floating_point_conversion_ranks (from, to) >= 2)
1569 conv->bad_p = true;
1571 else if (fcode == VECTOR_TYPE && tcode == VECTOR_TYPE
1572 && vector_types_convertible_p (from, to, false))
1573 return build_conv (ck_std, to, conv);
1574 else if (MAYBE_CLASS_TYPE_P (to) && MAYBE_CLASS_TYPE_P (from)
1575 && is_properly_derived_from (from, to))
1577 if (conv->kind == ck_rvalue)
1578 conv = next_conversion (conv);
1579 conv = build_conv (ck_base, to, conv);
1580 /* The derived-to-base conversion indicates the initialization
1581 of a parameter with base type from an object of a derived
1582 type. A temporary object is created to hold the result of
1583 the conversion unless we're binding directly to a reference. */
1584 conv->need_temporary_p = !(flags & LOOKUP_NO_TEMP_BIND);
1585 /* If we're performing copy-initialization, remember to skip
1586 explicit constructors. */
1587 if (flags & LOOKUP_ONLYCONVERTING)
1588 conv->copy_init_p = true;
1590 else
1591 return NULL;
1593 if (flags & LOOKUP_NO_NARROWING)
1594 conv->check_narrowing = true;
1596 return conv;
1599 /* Returns nonzero if T1 is reference-related to T2. */
1601 bool
1602 reference_related_p (tree t1, tree t2)
1604 if (t1 == error_mark_node || t2 == error_mark_node)
1605 return false;
1607 t1 = TYPE_MAIN_VARIANT (t1);
1608 t2 = TYPE_MAIN_VARIANT (t2);
1610 /* [dcl.init.ref]
1612 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1613 to "cv2 T2" if T1 is similar to T2, or T1 is a base class of T2. */
1614 return (similar_type_p (t1, t2)
1615 || (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
1616 && DERIVED_FROM_P (t1, t2)));
1619 /* Returns nonzero if T1 is reference-compatible with T2. */
1621 bool
1622 reference_compatible_p (tree t1, tree t2)
1624 /* [dcl.init.ref]
1626 "cv1 T1" is reference compatible with "cv2 T2" if
1627 a prvalue of type "pointer to cv2 T2" can be converted to the type
1628 "pointer to cv1 T1" via a standard conversion sequence. */
1629 tree ptype1 = build_pointer_type (t1);
1630 tree ptype2 = build_pointer_type (t2);
1631 conversion *conv = standard_conversion (ptype1, ptype2, NULL_TREE,
1632 /*c_cast_p=*/false, 0, tf_none);
1633 if (!conv || conv->bad_p)
1634 return false;
1635 return true;
1638 /* Return true if converting FROM to TO would involve a qualification
1639 conversion. */
1641 static bool
1642 involves_qualification_conversion_p (tree to, tree from)
1644 /* If we're not convering a pointer to another one, we won't get
1645 a qualification conversion. */
1646 if (!((TYPE_PTR_P (to) && TYPE_PTR_P (from))
1647 || (TYPE_PTRDATAMEM_P (to) && TYPE_PTRDATAMEM_P (from))))
1648 return false;
1650 conversion *conv = standard_conversion (to, from, NULL_TREE,
1651 /*c_cast_p=*/false, 0, tf_none);
1652 for (conversion *t = conv; t; t = next_conversion (t))
1653 if (t->kind == ck_qual)
1654 return true;
1656 return false;
1659 /* A reference of the indicated TYPE is being bound directly to the
1660 expression represented by the implicit conversion sequence CONV.
1661 Return a conversion sequence for this binding. */
1663 static conversion *
1664 direct_reference_binding (tree type, conversion *conv)
1666 tree t;
1668 gcc_assert (TYPE_REF_P (type));
1669 gcc_assert (!TYPE_REF_P (conv->type));
1671 t = TREE_TYPE (type);
1673 if (conv->kind == ck_identity)
1674 /* Mark the identity conv as to not decay to rvalue. */
1675 conv->rvaluedness_matches_p = true;
1677 /* [over.ics.rank]
1679 When a parameter of reference type binds directly
1680 (_dcl.init.ref_) to an argument expression, the implicit
1681 conversion sequence is the identity conversion, unless the
1682 argument expression has a type that is a derived class of the
1683 parameter type, in which case the implicit conversion sequence is
1684 a derived-to-base Conversion.
1686 If the parameter binds directly to the result of applying a
1687 conversion function to the argument expression, the implicit
1688 conversion sequence is a user-defined conversion sequence
1689 (_over.ics.user_), with the second standard conversion sequence
1690 either an identity conversion or, if the conversion function
1691 returns an entity of a type that is a derived class of the
1692 parameter type, a derived-to-base conversion. */
1693 if (is_properly_derived_from (conv->type, t))
1695 /* Represent the derived-to-base conversion. */
1696 conv = build_conv (ck_base, t, conv);
1697 /* We will actually be binding to the base-class subobject in
1698 the derived class, so we mark this conversion appropriately.
1699 That way, convert_like knows not to generate a temporary. */
1700 conv->need_temporary_p = false;
1702 else if (involves_qualification_conversion_p (t, conv->type))
1703 /* Represent the qualification conversion. After DR 2352
1704 #1 and #2 were indistinguishable conversion sequences:
1706 void f(int*); // #1
1707 void f(const int* const &); // #2
1708 void g(int* p) { f(p); }
1710 because the types "int *" and "const int *const" are
1711 reference-related and we were binding both directly and they
1712 had the same rank. To break it up, we add a ck_qual under the
1713 ck_ref_bind so that conversion sequence ranking chooses #1.
1715 We strip_top_quals here which is also what standard_conversion
1716 does. Failure to do so would confuse comp_cv_qual_signature
1717 into thinking that in
1719 void f(const int * const &); // #1
1720 void f(const int *); // #2
1721 int *x;
1722 f(x);
1724 #2 is a better match than #1 even though they're ambiguous (97296). */
1725 conv = build_conv (ck_qual, strip_top_quals (t), conv);
1727 return build_conv (ck_ref_bind, type, conv);
1730 /* Returns the conversion path from type FROM to reference type TO for
1731 purposes of reference binding. For lvalue binding, either pass a
1732 reference type to FROM or an lvalue expression to EXPR. If the
1733 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1734 the conversion returned. If C_CAST_P is true, this
1735 conversion is coming from a C-style cast. */
1737 static conversion *
1738 reference_binding (tree rto, tree rfrom, tree expr, bool c_cast_p, int flags,
1739 tsubst_flags_t complain)
1741 conversion *conv = NULL;
1742 conversion *bad_direct_conv = nullptr;
1743 tree to = TREE_TYPE (rto);
1744 tree from = rfrom;
1745 tree tfrom;
1746 bool related_p;
1747 bool compatible_p;
1748 cp_lvalue_kind gl_kind;
1749 bool is_lvalue;
1751 if (TREE_CODE (to) == FUNCTION_TYPE && expr && type_unknown_p (expr))
1753 expr = instantiate_type (to, expr, tf_none);
1754 if (expr == error_mark_node)
1755 return NULL;
1756 from = TREE_TYPE (expr);
1759 bool copy_list_init = false;
1760 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1762 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
1763 /* DR 1288: Otherwise, if the initializer list has a single element
1764 of type E and ... [T's] referenced type is reference-related to E,
1765 the object or reference is initialized from that element...
1767 ??? With P0388R4, we should bind 't' directly to U{}:
1768 using U = A[2];
1769 A (&&t)[] = {U{}};
1770 because A[] and A[2] are reference-related. But we don't do it
1771 because grok_reference_init has deduced the array size (to 1), and
1772 A[1] and A[2] aren't reference-related. */
1773 if (CONSTRUCTOR_NELTS (expr) == 1
1774 && !CONSTRUCTOR_IS_DESIGNATED_INIT (expr))
1776 tree elt = CONSTRUCTOR_ELT (expr, 0)->value;
1777 if (error_operand_p (elt))
1778 return NULL;
1779 tree etype = TREE_TYPE (elt);
1780 if (reference_related_p (to, etype))
1782 expr = elt;
1783 from = etype;
1784 goto skip;
1787 /* Otherwise, if T is a reference type, a prvalue temporary of the type
1788 referenced by T is copy-list-initialized, and the reference is bound
1789 to that temporary. */
1790 copy_list_init = true;
1791 skip:;
1794 if (TYPE_REF_P (from))
1796 from = TREE_TYPE (from);
1797 if (!TYPE_REF_IS_RVALUE (rfrom)
1798 || TREE_CODE (from) == FUNCTION_TYPE)
1799 gl_kind = clk_ordinary;
1800 else
1801 gl_kind = clk_rvalueref;
1803 else if (expr)
1804 gl_kind = lvalue_kind (expr);
1805 else if (CLASS_TYPE_P (from)
1806 || TREE_CODE (from) == ARRAY_TYPE)
1807 gl_kind = clk_class;
1808 else
1809 gl_kind = clk_none;
1811 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1812 if ((flags & LOOKUP_NO_TEMP_BIND)
1813 && (gl_kind & clk_class))
1814 gl_kind = clk_none;
1816 /* Same mask as real_lvalue_p. */
1817 is_lvalue = gl_kind && !(gl_kind & (clk_rvalueref|clk_class));
1819 tfrom = from;
1820 if ((gl_kind & clk_bitfield) != 0)
1821 tfrom = unlowered_expr_type (expr);
1823 /* Figure out whether or not the types are reference-related and
1824 reference compatible. We have to do this after stripping
1825 references from FROM. */
1826 related_p = reference_related_p (to, tfrom);
1827 /* If this is a C cast, first convert to an appropriately qualified
1828 type, so that we can later do a const_cast to the desired type. */
1829 if (related_p && c_cast_p
1830 && !at_least_as_qualified_p (to, tfrom))
1831 to = cp_build_qualified_type (to, cp_type_quals (tfrom));
1832 compatible_p = reference_compatible_p (to, tfrom);
1834 /* Directly bind reference when target expression's type is compatible with
1835 the reference and expression is an lvalue. In DR391, the wording in
1836 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1837 const and rvalue references to rvalues of compatible class type.
1838 We should also do direct bindings for non-class xvalues. */
1839 if ((related_p || compatible_p) && gl_kind)
1841 /* [dcl.init.ref]
1843 If the initializer expression
1845 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1846 is reference-compatible with "cv2 T2,"
1848 the reference is bound directly to the initializer expression
1849 lvalue.
1851 [...]
1852 If the initializer expression is an rvalue, with T2 a class type,
1853 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1854 is bound to the object represented by the rvalue or to a sub-object
1855 within that object. */
1857 conv = build_identity_conv (tfrom, expr);
1858 conv = direct_reference_binding (rto, conv);
1860 if (TYPE_REF_P (rfrom))
1861 /* Handle rvalue reference to function properly. */
1862 conv->rvaluedness_matches_p
1863 = (TYPE_REF_IS_RVALUE (rto) == TYPE_REF_IS_RVALUE (rfrom));
1864 else
1865 conv->rvaluedness_matches_p
1866 = (TYPE_REF_IS_RVALUE (rto) == !is_lvalue);
1868 if ((gl_kind & clk_bitfield) != 0
1869 || ((gl_kind & clk_packed) != 0 && !TYPE_PACKED (to)))
1870 /* For the purposes of overload resolution, we ignore the fact
1871 this expression is a bitfield or packed field. (In particular,
1872 [over.ics.ref] says specifically that a function with a
1873 non-const reference parameter is viable even if the
1874 argument is a bitfield.)
1876 However, when we actually call the function we must create
1877 a temporary to which to bind the reference. If the
1878 reference is volatile, or isn't const, then we cannot make
1879 a temporary, so we just issue an error when the conversion
1880 actually occurs. */
1881 conv->need_temporary_p = true;
1883 /* Don't allow binding of lvalues (other than function lvalues) to
1884 rvalue references. */
1885 if (is_lvalue && TYPE_REF_IS_RVALUE (rto)
1886 && TREE_CODE (to) != FUNCTION_TYPE)
1887 conv->bad_p = true;
1889 /* Nor the reverse. */
1890 if (!is_lvalue && !TYPE_REF_IS_RVALUE (rto)
1891 /* Unless it's really a C++20 lvalue being treated as an xvalue.
1892 But in C++23, such an expression is just an xvalue, not a special
1893 lvalue, so the binding is once again ill-formed. */
1894 && !(cxx_dialect <= cxx20
1895 && (gl_kind & clk_implicit_rval))
1896 && (!CP_TYPE_CONST_NON_VOLATILE_P (to)
1897 || (flags & LOOKUP_NO_RVAL_BIND))
1898 && TREE_CODE (to) != FUNCTION_TYPE)
1899 conv->bad_p = true;
1901 if (!compatible_p)
1902 conv->bad_p = true;
1904 return conv;
1906 /* [class.conv.fct] A conversion function is never used to convert a
1907 (possibly cv-qualified) object to the (possibly cv-qualified) same
1908 object type (or a reference to it), to a (possibly cv-qualified) base
1909 class of that type (or a reference to it).... */
1910 else if (CLASS_TYPE_P (from) && !related_p
1911 && !(flags & LOOKUP_NO_CONVERSION))
1913 /* [dcl.init.ref]
1915 If the initializer expression
1917 -- has a class type (i.e., T2 is a class type) can be
1918 implicitly converted to an lvalue of type "cv3 T3," where
1919 "cv1 T1" is reference-compatible with "cv3 T3". (this
1920 conversion is selected by enumerating the applicable
1921 conversion functions (_over.match.ref_) and choosing the
1922 best one through overload resolution. (_over.match_).
1924 the reference is bound to the lvalue result of the conversion
1925 in the second case. */
1926 z_candidate *cand = build_user_type_conversion_1 (rto, expr, flags,
1927 complain);
1928 if (cand)
1930 if (!cand->second_conv->bad_p)
1931 return cand->second_conv;
1933 /* Direct reference binding wasn't successful and yielded a bad
1934 conversion. Proceed with trying to go through a temporary
1935 instead, and if that also fails then we'll return this bad
1936 conversion rather than no conversion for sake of better
1937 diagnostics. */
1938 bad_direct_conv = cand->second_conv;
1942 /* From this point on, we conceptually need temporaries, even if we
1943 elide them. Only the cases above are "direct bindings". */
1944 if (flags & LOOKUP_NO_TEMP_BIND)
1945 return bad_direct_conv ? bad_direct_conv : nullptr;
1947 /* [over.ics.rank]
1949 When a parameter of reference type is not bound directly to an
1950 argument expression, the conversion sequence is the one required
1951 to convert the argument expression to the underlying type of the
1952 reference according to _over.best.ics_. Conceptually, this
1953 conversion sequence corresponds to copy-initializing a temporary
1954 of the underlying type with the argument expression. Any
1955 difference in top-level cv-qualification is subsumed by the
1956 initialization itself and does not constitute a conversion. */
1958 bool maybe_valid_p = true;
1960 /* [dcl.init.ref]
1962 Otherwise, the reference shall be an lvalue reference to a
1963 non-volatile const type, or the reference shall be an rvalue
1964 reference. */
1965 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto))
1966 maybe_valid_p = false;
1968 /* [dcl.init.ref]
1970 Otherwise, a temporary of type "cv1 T1" is created and
1971 initialized from the initializer expression using the rules for a
1972 non-reference copy initialization. If T1 is reference-related to
1973 T2, cv1 must be the same cv-qualification as, or greater
1974 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1975 if (related_p && !at_least_as_qualified_p (to, from))
1976 maybe_valid_p = false;
1978 /* We try below to treat an invalid reference binding as a bad conversion
1979 to improve diagnostics, but doing so may cause otherwise unnecessary
1980 instantiations that can lead to a hard error. So during the first pass
1981 of overload resolution wherein we shortcut bad conversions, instead just
1982 produce a special conversion indicating a second pass is necessary if
1983 there's no strictly viable candidate. */
1984 if (!maybe_valid_p && (flags & LOOKUP_SHORTCUT_BAD_CONVS))
1986 if (bad_direct_conv)
1987 return bad_direct_conv;
1989 conv = alloc_conversion (ck_deferred_bad);
1990 conv->bad_p = true;
1991 return conv;
1994 /* We're generating a temporary now, but don't bind any more in the
1995 conversion (specifically, don't slice the temporary returned by a
1996 conversion operator). */
1997 flags |= LOOKUP_NO_TEMP_BIND;
1999 /* Core issue 899: When [copy-]initializing a temporary to be bound
2000 to the first parameter of a copy constructor (12.8) called with
2001 a single argument in the context of direct-initialization,
2002 explicit conversion functions are also considered.
2004 So don't set LOOKUP_ONLYCONVERTING in that case. */
2005 if (!(flags & LOOKUP_COPY_PARM))
2006 flags |= LOOKUP_ONLYCONVERTING;
2008 if (!conv)
2009 conv = implicit_conversion (to, from, expr, c_cast_p,
2010 flags, complain);
2011 if (!conv)
2012 return bad_direct_conv ? bad_direct_conv : nullptr;
2014 if (conv->user_conv_p)
2016 if (copy_list_init)
2017 /* Remember this was copy-list-initialization. */
2018 conv->need_temporary_p = true;
2020 /* If initializing the temporary used a conversion function,
2021 recalculate the second conversion sequence. */
2022 for (conversion *t = conv; t; t = next_conversion (t))
2023 if (t->kind == ck_user
2024 && DECL_CONV_FN_P (t->cand->fn))
2026 tree ftype = TREE_TYPE (TREE_TYPE (t->cand->fn));
2027 /* A prvalue of non-class type is cv-unqualified. */
2028 if (!TYPE_REF_P (ftype) && !CLASS_TYPE_P (ftype))
2029 ftype = cv_unqualified (ftype);
2030 int sflags = (flags|LOOKUP_NO_CONVERSION)&~LOOKUP_NO_TEMP_BIND;
2031 conversion *new_second
2032 = reference_binding (rto, ftype, NULL_TREE, c_cast_p,
2033 sflags, complain);
2034 if (!new_second)
2035 return bad_direct_conv ? bad_direct_conv : nullptr;
2036 conv = merge_conversion_sequences (t, new_second);
2037 gcc_assert (maybe_valid_p || conv->bad_p);
2038 return conv;
2042 conv = build_conv (ck_ref_bind, rto, conv);
2043 /* This reference binding, unlike those above, requires the
2044 creation of a temporary. */
2045 conv->need_temporary_p = true;
2046 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
2047 conv->bad_p |= !maybe_valid_p;
2049 return conv;
2052 /* Returns the implicit conversion sequence (see [over.ics]) from type
2053 FROM to type TO. The optional expression EXPR may affect the
2054 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
2055 true, this conversion is coming from a C-style cast. */
2057 static conversion *
2058 implicit_conversion (tree to, tree from, tree expr, bool c_cast_p,
2059 int flags, tsubst_flags_t complain)
2061 conversion *conv;
2063 if (from == error_mark_node || to == error_mark_node
2064 || expr == error_mark_node)
2065 return NULL;
2067 /* Other flags only apply to the primary function in overload
2068 resolution, or after we've chosen one. */
2069 flags &= (LOOKUP_ONLYCONVERTING|LOOKUP_NO_CONVERSION|LOOKUP_COPY_PARM
2070 |LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND|LOOKUP_NO_NARROWING
2071 |LOOKUP_PROTECT|LOOKUP_NO_NON_INTEGRAL|LOOKUP_SHORTCUT_BAD_CONVS);
2073 /* FIXME: actually we don't want warnings either, but we can't just
2074 have 'complain &= ~(tf_warning|tf_error)' because it would cause
2075 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
2076 We really ought not to issue that warning until we've committed
2077 to that conversion. */
2078 complain &= ~tf_error;
2080 /* Call reshape_init early to remove redundant braces. */
2081 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr) && CLASS_TYPE_P (to))
2083 to = complete_type (to);
2084 if (!COMPLETE_TYPE_P (to))
2085 return nullptr;
2086 if (!CLASSTYPE_NON_AGGREGATE (to))
2088 expr = reshape_init (to, expr, complain);
2089 if (expr == error_mark_node)
2090 return nullptr;
2091 from = TREE_TYPE (expr);
2095 if (TYPE_REF_P (to))
2096 conv = reference_binding (to, from, expr, c_cast_p, flags, complain);
2097 else
2098 conv = standard_conversion (to, from, expr, c_cast_p, flags, complain);
2100 if (conv)
2101 return conv;
2103 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
2105 if (is_std_init_list (to) && !CONSTRUCTOR_IS_DESIGNATED_INIT (expr))
2106 return build_list_conv (to, expr, flags, complain);
2108 /* As an extension, allow list-initialization of _Complex. */
2109 if (TREE_CODE (to) == COMPLEX_TYPE
2110 && !CONSTRUCTOR_IS_DESIGNATED_INIT (expr))
2112 conv = build_complex_conv (to, expr, flags, complain);
2113 if (conv)
2114 return conv;
2117 /* Allow conversion from an initializer-list with one element to a
2118 scalar type. */
2119 if (SCALAR_TYPE_P (to))
2121 int nelts = CONSTRUCTOR_NELTS (expr);
2122 tree elt;
2124 if (nelts == 0)
2125 elt = build_value_init (to, tf_none);
2126 else if (nelts == 1 && !CONSTRUCTOR_IS_DESIGNATED_INIT (expr))
2127 elt = CONSTRUCTOR_ELT (expr, 0)->value;
2128 else
2129 elt = error_mark_node;
2131 conv = implicit_conversion (to, TREE_TYPE (elt), elt,
2132 c_cast_p, flags, complain);
2133 if (conv)
2135 conv->check_narrowing = true;
2136 if (BRACE_ENCLOSED_INITIALIZER_P (elt))
2137 /* Too many levels of braces, i.e. '{{1}}'. */
2138 conv->bad_p = true;
2139 return conv;
2142 else if (TREE_CODE (to) == ARRAY_TYPE)
2143 return build_array_conv (to, expr, flags, complain);
2146 if (expr != NULL_TREE
2147 && (MAYBE_CLASS_TYPE_P (from)
2148 || MAYBE_CLASS_TYPE_P (to))
2149 && (flags & LOOKUP_NO_CONVERSION) == 0)
2151 struct z_candidate *cand;
2153 if (CLASS_TYPE_P (to)
2154 && BRACE_ENCLOSED_INITIALIZER_P (expr)
2155 && !CLASSTYPE_NON_AGGREGATE (complete_type (to)))
2156 return build_aggr_conv (to, expr, flags, complain);
2158 cand = build_user_type_conversion_1 (to, expr, flags, complain);
2159 if (cand)
2161 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
2162 && CONSTRUCTOR_NELTS (expr) == 1
2163 && !CONSTRUCTOR_IS_DESIGNATED_INIT (expr)
2164 && !is_list_ctor (cand->fn))
2166 /* "If C is not an initializer-list constructor and the
2167 initializer list has a single element of type cv U, where U is
2168 X or a class derived from X, the implicit conversion sequence
2169 has Exact Match rank if U is X, or Conversion rank if U is
2170 derived from X." */
2171 tree elt = CONSTRUCTOR_ELT (expr, 0)->value;
2172 tree elttype = TREE_TYPE (elt);
2173 if (reference_related_p (to, elttype))
2174 return implicit_conversion (to, elttype, elt,
2175 c_cast_p, flags, complain);
2177 conv = cand->second_conv;
2180 /* We used to try to bind a reference to a temporary here, but that
2181 is now handled after the recursive call to this function at the end
2182 of reference_binding. */
2183 return conv;
2186 return NULL;
2189 /* Like implicit_conversion, but return NULL if the conversion is bad.
2191 This is not static so that check_non_deducible_conversion can call it within
2192 add_template_candidate_real as part of overload resolution; it should not be
2193 called outside of overload resolution. */
2195 conversion *
2196 good_conversion (tree to, tree from, tree expr,
2197 int flags, tsubst_flags_t complain)
2199 conversion *c = implicit_conversion (to, from, expr, /*cast*/false,
2200 flags, complain);
2201 if (c && c->bad_p)
2202 c = NULL;
2203 return c;
2206 /* Add a new entry to the list of candidates. Used by the add_*_candidate
2207 functions. ARGS will not be changed until a single candidate is
2208 selected. */
2210 static struct z_candidate *
2211 add_candidate (struct z_candidate **candidates,
2212 tree fn, tree first_arg, const vec<tree, va_gc> *args,
2213 size_t num_convs, conversion **convs,
2214 tree access_path, tree conversion_path,
2215 int viable, struct rejection_reason *reason,
2216 int flags)
2218 struct z_candidate *cand = (struct z_candidate *)
2219 conversion_obstack_alloc (sizeof (struct z_candidate));
2221 cand->fn = fn;
2222 cand->first_arg = first_arg;
2223 cand->args = args;
2224 cand->convs = convs;
2225 cand->num_convs = num_convs;
2226 cand->access_path = access_path;
2227 cand->conversion_path = conversion_path;
2228 cand->viable = viable;
2229 cand->reason = reason;
2230 cand->next = *candidates;
2231 cand->flags = flags;
2232 *candidates = cand;
2234 if (convs && cand->reversed ())
2235 /* Swap the conversions for comparison in joust; we'll swap them back
2236 before build_over_call. */
2237 std::swap (convs[0], convs[1]);
2239 return cand;
2242 /* FN is a function from the overload set that we outright didn't even
2243 consider (for some reason); add it to the list as an non-viable "ignored"
2244 candidate. */
2246 static z_candidate *
2247 add_ignored_candidate (z_candidate **candidates, tree fn)
2249 /* No need to dynamically allocate these. */
2250 static const rejection_reason reason_ignored = { rr_ignored, {} };
2252 struct z_candidate *cand = (struct z_candidate *)
2253 conversion_obstack_alloc (sizeof (struct z_candidate));
2255 cand->fn = fn;
2256 cand->reason = const_cast<rejection_reason *> (&reason_ignored);
2257 cand->next = *candidates;
2258 *candidates = cand;
2260 return cand;
2263 /* True iff CAND is a candidate added by add_ignored_candidate. */
2265 static bool
2266 ignored_candidate_p (const z_candidate *cand)
2268 return cand->reason && cand->reason->code == rr_ignored;
2271 /* Return the number of remaining arguments in the parameter list
2272 beginning with ARG. */
2275 remaining_arguments (tree arg)
2277 int n;
2279 for (n = 0; arg != NULL_TREE && arg != void_list_node;
2280 arg = TREE_CHAIN (arg))
2281 n++;
2283 return n;
2286 /* [over.match.copy]: When initializing a temporary object (12.2) to be bound
2287 to the first parameter of a constructor where the parameter is of type
2288 "reference to possibly cv-qualified T" and the constructor is called with a
2289 single argument in the context of direct-initialization of an object of type
2290 "cv2 T", explicit conversion functions are also considered.
2292 So set LOOKUP_COPY_PARM to let reference_binding know that
2293 it's being called in that context. */
2296 conv_flags (int i, int nargs, tree fn, tree arg, int flags)
2298 int lflags = flags;
2299 tree t;
2300 if (i == 0 && nargs == 1 && DECL_CONSTRUCTOR_P (fn)
2301 && (t = FUNCTION_FIRST_USER_PARMTYPE (fn))
2302 && (same_type_ignoring_top_level_qualifiers_p
2303 (non_reference (TREE_VALUE (t)), DECL_CONTEXT (fn))))
2305 if (!(flags & LOOKUP_ONLYCONVERTING))
2306 lflags |= LOOKUP_COPY_PARM;
2307 if ((flags & LOOKUP_LIST_INIT_CTOR)
2308 && BRACE_ENCLOSED_INITIALIZER_P (arg))
2309 lflags |= LOOKUP_NO_CONVERSION;
2311 else
2312 lflags |= LOOKUP_ONLYCONVERTING;
2314 return lflags;
2317 /* Build an appropriate 'this' conversion for the method FN and class
2318 type CTYPE from the value ARG (having type ARGTYPE) to the type PARMTYPE.
2319 This function modifies PARMTYPE, ARGTYPE and ARG. */
2321 static conversion *
2322 build_this_conversion (tree fn, tree ctype,
2323 tree& parmtype, tree& argtype, tree& arg,
2324 int flags, tsubst_flags_t complain)
2326 gcc_assert (DECL_IOBJ_MEMBER_FUNCTION_P (fn)
2327 && !DECL_CONSTRUCTOR_P (fn));
2329 /* The type of the implicit object parameter ('this') for
2330 overload resolution is not always the same as for the
2331 function itself; conversion functions are considered to
2332 be members of the class being converted, and functions
2333 introduced by a using-declaration are considered to be
2334 members of the class that uses them.
2336 Since build_over_call ignores the ICS for the `this'
2337 parameter, we can just change the parm type. */
2338 parmtype = cp_build_qualified_type (ctype,
2339 cp_type_quals (TREE_TYPE (parmtype)));
2340 bool this_p = true;
2341 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn)))
2343 /* If the function has a ref-qualifier, the implicit
2344 object parameter has reference type. */
2345 bool rv = FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn));
2346 parmtype = cp_build_reference_type (parmtype, rv);
2347 /* The special handling of 'this' conversions in compare_ics
2348 does not apply if there is a ref-qualifier. */
2349 this_p = false;
2351 else
2353 parmtype = build_pointer_type (parmtype);
2354 /* We don't use build_this here because we don't want to
2355 capture the object argument until we've chosen a
2356 non-static member function. */
2357 arg = build_address (arg);
2358 argtype = lvalue_type (arg);
2360 flags |= LOOKUP_ONLYCONVERTING;
2361 conversion *t = implicit_conversion (parmtype, argtype, arg,
2362 /*c_cast_p=*/false, flags, complain);
2363 t->this_p = this_p;
2364 return t;
2367 /* Create an overload candidate for the function or method FN called
2368 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
2369 FLAGS is passed on to implicit_conversion.
2371 This does not change ARGS.
2373 CTYPE, if non-NULL, is the type we want to pretend this function
2374 comes from for purposes of overload resolution.
2376 SHORTCUT_BAD_CONVS controls how we handle "bad" argument conversions.
2377 If true, we stop computing conversions upon seeing the first bad
2378 conversion. This is used by add_candidates to avoid computing
2379 more conversions than necessary in the presence of a strictly viable
2380 candidate, while preserving the defacto behavior of overload resolution
2381 when it turns out there are only non-strictly viable candidates. */
2383 static struct z_candidate *
2384 add_function_candidate (struct z_candidate **candidates,
2385 tree fn, tree ctype, tree first_arg,
2386 const vec<tree, va_gc> *args, tree access_path,
2387 tree conversion_path, int flags,
2388 conversion **convs,
2389 bool shortcut_bad_convs,
2390 tsubst_flags_t complain)
2392 tree parmlist = TYPE_ARG_TYPES (TREE_TYPE (fn));
2393 int i, len;
2394 tree parmnode;
2395 tree orig_first_arg = first_arg;
2396 int skip;
2397 int viable = 1;
2398 struct rejection_reason *reason = NULL;
2400 /* The `this', `in_chrg' and VTT arguments to constructors are not
2401 considered in overload resolution. */
2402 if (DECL_CONSTRUCTOR_P (fn))
2404 if (ctor_omit_inherited_parms (fn))
2405 /* Bring back parameters omitted from an inherited ctor. */
2406 parmlist = FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn));
2407 else
2408 parmlist = skip_artificial_parms_for (fn, parmlist);
2409 skip = num_artificial_parms_for (fn);
2410 if (skip > 0 && first_arg != NULL_TREE)
2412 --skip;
2413 first_arg = NULL_TREE;
2416 else
2417 skip = 0;
2419 len = vec_safe_length (args) - skip + (first_arg != NULL_TREE ? 1 : 0);
2420 if (!convs)
2421 convs = alloc_conversions (len);
2423 /* 13.3.2 - Viable functions [over.match.viable]
2424 First, to be a viable function, a candidate function shall have enough
2425 parameters to agree in number with the arguments in the list.
2427 We need to check this first; otherwise, checking the ICSes might cause
2428 us to produce an ill-formed template instantiation. */
2430 parmnode = parmlist;
2431 for (i = 0; i < len; ++i)
2433 if (parmnode == NULL_TREE || parmnode == void_list_node)
2434 break;
2435 parmnode = TREE_CHAIN (parmnode);
2438 if ((i < len && parmnode)
2439 || !sufficient_parms_p (parmnode))
2441 int remaining = remaining_arguments (parmnode);
2442 viable = 0;
2443 reason = arity_rejection (first_arg, i + remaining, len);
2446 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2447 parameter of type "reference to cv C" (including such a constructor
2448 instantiated from a template) is excluded from the set of candidate
2449 functions when used to construct an object of type D with an argument list
2450 containing a single argument if C is reference-related to D. */
2451 if (viable && len == 1 && parmlist && DECL_CONSTRUCTOR_P (fn)
2452 && flag_new_inheriting_ctors
2453 && DECL_INHERITED_CTOR (fn))
2455 tree ptype = non_reference (TREE_VALUE (parmlist));
2456 tree dtype = DECL_CONTEXT (fn);
2457 tree btype = DECL_INHERITED_CTOR_BASE (fn);
2458 if (reference_related_p (ptype, dtype)
2459 && reference_related_p (btype, ptype))
2461 viable = false;
2462 reason = inherited_ctor_rejection ();
2466 /* Second, for a function to be viable, its constraints must be
2467 satisfied. */
2468 if (flag_concepts && viable && !constraints_satisfied_p (fn))
2470 reason = constraint_failure ();
2471 viable = false;
2474 /* When looking for a function from a subobject from an implicit
2475 copy/move constructor/operator=, don't consider anything that takes (a
2476 reference to) an unrelated type. See c++/44909 and core 1092. */
2477 if (viable && parmlist && (flags & LOOKUP_DEFAULTED))
2479 if (DECL_CONSTRUCTOR_P (fn))
2480 i = 1;
2481 else if (DECL_ASSIGNMENT_OPERATOR_P (fn)
2482 && DECL_OVERLOADED_OPERATOR_IS (fn, NOP_EXPR))
2483 i = 2;
2484 else
2485 i = 0;
2486 if (i && len == i)
2488 parmnode = chain_index (i-1, parmlist);
2489 if (!reference_related_p (non_reference (TREE_VALUE (parmnode)),
2490 ctype))
2491 viable = 0;
2494 /* This only applies at the top level. */
2495 flags &= ~LOOKUP_DEFAULTED;
2498 if (! viable)
2499 goto out;
2501 if (shortcut_bad_convs)
2502 flags |= LOOKUP_SHORTCUT_BAD_CONVS;
2503 else
2504 flags &= ~LOOKUP_SHORTCUT_BAD_CONVS;
2506 /* Third, for F to be a viable function, there shall exist for each
2507 argument an implicit conversion sequence that converts that argument
2508 to the corresponding parameter of F. */
2510 parmnode = parmlist;
2512 for (i = 0; i < len; ++i)
2514 tree argtype, to_type;
2515 tree arg;
2517 if (parmnode == void_list_node)
2518 break;
2520 if (convs[i])
2522 /* Already set during deduction. */
2523 parmnode = TREE_CHAIN (parmnode);
2524 continue;
2527 if (i == 0 && first_arg != NULL_TREE)
2528 arg = first_arg;
2529 else
2530 arg = CONST_CAST_TREE (
2531 (*args)[i + skip - (first_arg != NULL_TREE ? 1 : 0)]);
2532 argtype = lvalue_type (arg);
2534 conversion *t;
2535 if (parmnode)
2537 tree parmtype = TREE_VALUE (parmnode);
2538 if (i == 0
2539 && DECL_IOBJ_MEMBER_FUNCTION_P (fn)
2540 && !DECL_CONSTRUCTOR_P (fn))
2541 t = build_this_conversion (fn, ctype, parmtype, argtype, arg,
2542 flags, complain);
2543 else
2545 int lflags = conv_flags (i, len-skip, fn, arg, flags);
2546 t = implicit_conversion (parmtype, argtype, arg,
2547 /*c_cast_p=*/false, lflags, complain);
2549 to_type = parmtype;
2550 parmnode = TREE_CHAIN (parmnode);
2552 else
2554 t = build_identity_conv (argtype, arg);
2555 t->ellipsis_p = true;
2556 to_type = argtype;
2559 convs[i] = t;
2560 if (! t)
2562 viable = 0;
2563 reason = arg_conversion_rejection (first_arg, i, argtype, to_type,
2564 EXPR_LOCATION (arg));
2565 break;
2568 if (t->bad_p)
2570 viable = -1;
2571 reason = bad_arg_conversion_rejection (first_arg, i, arg, to_type,
2572 EXPR_LOCATION (arg));
2573 if (shortcut_bad_convs)
2574 break;
2578 out:
2579 return add_candidate (candidates, fn, orig_first_arg, args, len, convs,
2580 access_path, conversion_path, viable, reason, flags);
2583 /* Create an overload candidate for the conversion function FN which will
2584 be invoked for expression OBJ, producing a pointer-to-function which
2585 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2586 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2587 passed on to implicit_conversion.
2589 Actually, we don't really care about FN; we care about the type it
2590 converts to. There may be multiple conversion functions that will
2591 convert to that type, and we rely on build_user_type_conversion_1 to
2592 choose the best one; so when we create our candidate, we record the type
2593 instead of the function. */
2595 static struct z_candidate *
2596 add_conv_candidate (struct z_candidate **candidates, tree fn, tree obj,
2597 const vec<tree, va_gc> *arglist,
2598 tree access_path, tree conversion_path,
2599 tsubst_flags_t complain)
2601 tree totype = TREE_TYPE (TREE_TYPE (fn));
2602 int i, len, viable, flags;
2603 tree parmlist, parmnode;
2604 conversion **convs;
2605 struct rejection_reason *reason;
2607 for (parmlist = totype; TREE_CODE (parmlist) != FUNCTION_TYPE; )
2608 parmlist = TREE_TYPE (parmlist);
2609 parmlist = TYPE_ARG_TYPES (parmlist);
2611 len = vec_safe_length (arglist) + 1;
2612 convs = alloc_conversions (len);
2613 parmnode = parmlist;
2614 viable = 1;
2615 flags = LOOKUP_IMPLICIT;
2616 reason = NULL;
2618 /* Don't bother looking up the same type twice. */
2619 if (*candidates && (*candidates)->fn == totype)
2620 return NULL;
2622 if (!constraints_satisfied_p (fn))
2624 reason = constraint_failure ();
2625 viable = 0;
2626 return add_candidate (candidates, fn, obj, arglist, len, convs,
2627 access_path, conversion_path, viable, reason, flags);
2630 for (i = 0; i < len; ++i)
2632 tree arg, argtype, convert_type = NULL_TREE;
2633 conversion *t;
2635 if (i == 0)
2636 arg = obj;
2637 else
2638 arg = (*arglist)[i - 1];
2639 argtype = lvalue_type (arg);
2641 if (i == 0)
2643 t = build_identity_conv (argtype, NULL_TREE);
2644 t = build_conv (ck_user, totype, t);
2645 /* Leave the 'cand' field null; we'll figure out the conversion in
2646 convert_like if this candidate is chosen. */
2647 convert_type = totype;
2649 else if (parmnode == void_list_node)
2650 break;
2651 else if (parmnode)
2653 t = implicit_conversion (TREE_VALUE (parmnode), argtype, arg,
2654 /*c_cast_p=*/false, flags, complain);
2655 convert_type = TREE_VALUE (parmnode);
2657 else
2659 t = build_identity_conv (argtype, arg);
2660 t->ellipsis_p = true;
2661 convert_type = argtype;
2664 convs[i] = t;
2665 if (! t)
2666 break;
2668 if (t->bad_p)
2670 viable = -1;
2671 reason = bad_arg_conversion_rejection (NULL_TREE, i, arg, convert_type,
2672 EXPR_LOCATION (arg));
2675 if (i == 0)
2676 continue;
2678 if (parmnode)
2679 parmnode = TREE_CHAIN (parmnode);
2682 if (i < len
2683 || ! sufficient_parms_p (parmnode))
2685 int remaining = remaining_arguments (parmnode);
2686 viable = 0;
2687 reason = arity_rejection (NULL_TREE, i + remaining, len);
2690 return add_candidate (candidates, totype, obj, arglist, len, convs,
2691 access_path, conversion_path, viable, reason, flags);
2694 static void
2695 build_builtin_candidate (struct z_candidate **candidates, tree fnname,
2696 tree type1, tree type2, const vec<tree,va_gc> &args,
2697 tree *argtypes, int flags, tsubst_flags_t complain)
2699 conversion *t;
2700 conversion **convs;
2701 size_t num_convs;
2702 int viable = 1;
2703 tree types[2];
2704 struct rejection_reason *reason = NULL;
2706 types[0] = type1;
2707 types[1] = type2;
2709 num_convs = args.length ();
2710 convs = alloc_conversions (num_convs);
2712 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2713 conversion ops are allowed. We handle that here by just checking for
2714 boolean_type_node because other operators don't ask for it. COND_EXPR
2715 also does contextual conversion to bool for the first operand, but we
2716 handle that in build_conditional_expr, and type1 here is operand 2. */
2717 if (type1 != boolean_type_node)
2718 flags |= LOOKUP_ONLYCONVERTING;
2720 for (unsigned i = 0; i < 2 && i < num_convs; ++i)
2722 t = implicit_conversion (types[i], argtypes[i], args[i],
2723 /*c_cast_p=*/false, flags, complain);
2724 if (! t)
2726 viable = 0;
2727 /* We need something for printing the candidate. */
2728 t = build_identity_conv (types[i], NULL_TREE);
2729 reason = arg_conversion_rejection (NULL_TREE, i, argtypes[i],
2730 types[i], EXPR_LOCATION (args[i]));
2732 else if (t->bad_p)
2734 viable = 0;
2735 reason = bad_arg_conversion_rejection (NULL_TREE, i, args[i],
2736 types[i],
2737 EXPR_LOCATION (args[i]));
2739 convs[i] = t;
2742 /* For COND_EXPR we rearranged the arguments; undo that now. */
2743 if (num_convs == 3)
2745 convs[2] = convs[1];
2746 convs[1] = convs[0];
2747 t = implicit_conversion (boolean_type_node, argtypes[2], args[2],
2748 /*c_cast_p=*/false, flags,
2749 complain);
2750 if (t)
2751 convs[0] = t;
2752 else
2754 viable = 0;
2755 reason = arg_conversion_rejection (NULL_TREE, 0, argtypes[2],
2756 boolean_type_node,
2757 EXPR_LOCATION (args[2]));
2761 add_candidate (candidates, fnname, /*first_arg=*/NULL_TREE, /*args=*/NULL,
2762 num_convs, convs,
2763 /*access_path=*/NULL_TREE,
2764 /*conversion_path=*/NULL_TREE,
2765 viable, reason, flags);
2768 static bool
2769 is_complete (tree t)
2771 return COMPLETE_TYPE_P (complete_type (t));
2774 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2776 static bool
2777 promoted_arithmetic_type_p (tree type)
2779 /* [over.built]
2781 In this section, the term promoted integral type is used to refer
2782 to those integral types which are preserved by integral promotion
2783 (including e.g. int and long but excluding e.g. char).
2784 Similarly, the term promoted arithmetic type refers to promoted
2785 integral types plus floating types. */
2786 return ((CP_INTEGRAL_TYPE_P (type)
2787 && same_type_p (type_promotes_to (type), type))
2788 || SCALAR_FLOAT_TYPE_P (type));
2791 /* Create any builtin operator overload candidates for the operator in
2792 question given the converted operand types TYPE1 and TYPE2. The other
2793 args are passed through from add_builtin_candidates to
2794 build_builtin_candidate.
2796 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2797 If CODE is requires candidates operands of the same type of the kind
2798 of which TYPE1 and TYPE2 are, we add both candidates
2799 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2801 static void
2802 add_builtin_candidate (struct z_candidate **candidates, enum tree_code code,
2803 enum tree_code code2, tree fnname, tree type1,
2804 tree type2, vec<tree,va_gc> &args, tree *argtypes,
2805 int flags, tsubst_flags_t complain)
2807 switch (code)
2809 case POSTINCREMENT_EXPR:
2810 case POSTDECREMENT_EXPR:
2811 args[1] = integer_zero_node;
2812 type2 = integer_type_node;
2813 break;
2814 default:
2815 break;
2818 switch (code)
2821 /* 4 For every pair (T, VQ), where T is an arithmetic type other than bool,
2822 and VQ is either volatile or empty, there exist candidate operator
2823 functions of the form
2824 VQ T& operator++(VQ T&);
2825 T operator++(VQ T&, int);
2826 5 For every pair (T, VQ), where T is an arithmetic type other than bool,
2827 and VQ is either volatile or empty, there exist candidate operator
2828 functions of the form
2829 VQ T& operator--(VQ T&);
2830 T operator--(VQ T&, int);
2831 6 For every pair (T, VQ), where T is a cv-qualified or cv-unqualified object
2832 type, and VQ is either volatile or empty, there exist candidate operator
2833 functions of the form
2834 T*VQ& operator++(T*VQ&);
2835 T*VQ& operator--(T*VQ&);
2836 T* operator++(T*VQ&, int);
2837 T* operator--(T*VQ&, int); */
2839 case POSTDECREMENT_EXPR:
2840 case PREDECREMENT_EXPR:
2841 if (TREE_CODE (type1) == BOOLEAN_TYPE)
2842 return;
2843 /* FALLTHRU */
2844 case POSTINCREMENT_EXPR:
2845 case PREINCREMENT_EXPR:
2846 /* P0002R1, Remove deprecated operator++(bool) added "other than bool"
2847 to p4. */
2848 if (TREE_CODE (type1) == BOOLEAN_TYPE && cxx_dialect >= cxx17)
2849 return;
2850 if (ARITHMETIC_TYPE_P (type1) || TYPE_PTROB_P (type1))
2852 type1 = build_reference_type (type1);
2853 break;
2855 return;
2857 /* 7 For every cv-qualified or cv-unqualified object type T, there
2858 exist candidate operator functions of the form
2860 T& operator*(T*);
2863 8 For every function type T that does not have cv-qualifiers or
2864 a ref-qualifier, there exist candidate operator functions of the form
2865 T& operator*(T*); */
2867 case INDIRECT_REF:
2868 if (TYPE_PTR_P (type1)
2869 && (TYPE_PTROB_P (type1)
2870 || TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE))
2871 break;
2872 return;
2874 /* 9 For every type T, there exist candidate operator functions of the form
2875 T* operator+(T*);
2877 10 For every floating-point or promoted integral type T, there exist
2878 candidate operator functions of the form
2879 T operator+(T);
2880 T operator-(T); */
2882 case UNARY_PLUS_EXPR: /* unary + */
2883 if (TYPE_PTR_P (type1))
2884 break;
2885 /* FALLTHRU */
2886 case NEGATE_EXPR:
2887 if (ARITHMETIC_TYPE_P (type1))
2888 break;
2889 return;
2891 /* 11 For every promoted integral type T, there exist candidate operator
2892 functions of the form
2893 T operator~(T); */
2895 case BIT_NOT_EXPR:
2896 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1))
2897 break;
2898 return;
2900 /* 12 For every quintuple (C1, C2, T, CV1, CV2), where C2 is a class type, C1
2901 is the same type as C2 or is a derived class of C2, and T is an object
2902 type or a function type there exist candidate operator functions of the
2903 form
2904 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2905 where CV12 is the union of CV1 and CV2. */
2907 case MEMBER_REF:
2908 if (TYPE_PTR_P (type1) && TYPE_PTRMEM_P (type2))
2910 tree c1 = TREE_TYPE (type1);
2911 tree c2 = TYPE_PTRMEM_CLASS_TYPE (type2);
2913 if (CLASS_TYPE_P (c1) && DERIVED_FROM_P (c2, c1)
2914 && (TYPE_PTRMEMFUNC_P (type2)
2915 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2))))
2916 break;
2918 return;
2920 /* 13 For every pair of types L and R, where each of L and R is a floating-point
2921 or promoted integral type, there exist candidate operator functions of the
2922 form
2923 LR operator*(L, R);
2924 LR operator/(L, R);
2925 LR operator+(L, R);
2926 LR operator-(L, R);
2927 bool operator<(L, R);
2928 bool operator>(L, R);
2929 bool operator<=(L, R);
2930 bool operator>=(L, R);
2931 bool operator==(L, R);
2932 bool operator!=(L, R);
2933 where LR is the result of the usual arithmetic conversions between
2934 types L and R.
2936 14 For every integral type T there exists a candidate operator function of
2937 the form
2939 std::strong_ordering operator<=>(T, T);
2941 15 For every pair of floating-point types L and R, there exists a candidate
2942 operator function of the form
2944 std::partial_ordering operator<=>(L, R);
2946 16 For every cv-qualified or cv-unqualified object type T there exist
2947 candidate operator functions of the form
2948 T* operator+(T*, std::ptrdiff_t);
2949 T& operator[](T*, std::ptrdiff_t);
2950 T* operator-(T*, std::ptrdiff_t);
2951 T* operator+(std::ptrdiff_t, T*);
2952 T& operator[](std::ptrdiff_t, T*);
2954 17 For every T, where T is a pointer to object type, there exist candidate
2955 operator functions of the form
2956 std::ptrdiff_t operator-(T, T);
2958 18 For every T, where T is an enumeration type or a pointer type, there
2959 exist candidate operator functions of the form
2960 bool operator<(T, T);
2961 bool operator>(T, T);
2962 bool operator<=(T, T);
2963 bool operator>=(T, T);
2964 bool operator==(T, T);
2965 bool operator!=(T, T);
2966 R operator<=>(T, T);
2968 where R is the result type specified in [expr.spaceship].
2970 19 For every T, where T is a pointer-to-member type or std::nullptr_t,
2971 there exist candidate operator functions of the form
2972 bool operator==(T, T);
2973 bool operator!=(T, T); */
2975 case MINUS_EXPR:
2976 if (TYPE_PTROB_P (type1) && TYPE_PTROB_P (type2))
2977 break;
2978 if (TYPE_PTROB_P (type1)
2979 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2981 type2 = ptrdiff_type_node;
2982 break;
2984 /* FALLTHRU */
2985 case MULT_EXPR:
2986 case TRUNC_DIV_EXPR:
2987 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2988 break;
2989 return;
2991 /* This isn't exactly what's specified above for operator<=>, but it's
2992 close enough. In particular, we don't care about the return type
2993 specified above; it doesn't participate in overload resolution and it
2994 doesn't affect the semantics of the built-in operator. */
2995 case SPACESHIP_EXPR:
2996 case EQ_EXPR:
2997 case NE_EXPR:
2998 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2999 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2)))
3000 break;
3001 if (NULLPTR_TYPE_P (type1) && NULLPTR_TYPE_P (type2))
3002 break;
3003 if (TYPE_PTRMEM_P (type1) && null_ptr_cst_p (args[1]))
3005 type2 = type1;
3006 break;
3008 if (TYPE_PTRMEM_P (type2) && null_ptr_cst_p (args[0]))
3010 type1 = type2;
3011 break;
3013 /* Fall through. */
3014 case LT_EXPR:
3015 case GT_EXPR:
3016 case LE_EXPR:
3017 case GE_EXPR:
3018 case MAX_EXPR:
3019 case MIN_EXPR:
3020 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
3021 break;
3022 if (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
3023 break;
3024 if (TREE_CODE (type1) == ENUMERAL_TYPE
3025 && TREE_CODE (type2) == ENUMERAL_TYPE)
3026 break;
3027 if (TYPE_PTR_P (type1)
3028 && null_ptr_cst_p (args[1]))
3030 type2 = type1;
3031 break;
3033 if (null_ptr_cst_p (args[0])
3034 && TYPE_PTR_P (type2))
3036 type1 = type2;
3037 break;
3039 return;
3041 case PLUS_EXPR:
3042 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
3043 break;
3044 /* FALLTHRU */
3045 case ARRAY_REF:
3046 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && TYPE_PTROB_P (type2))
3048 type1 = ptrdiff_type_node;
3049 break;
3051 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
3053 type2 = ptrdiff_type_node;
3054 break;
3056 return;
3058 /* 18For every pair of promoted integral types L and R, there exist candi-
3059 date operator functions of the form
3060 LR operator%(L, R);
3061 LR operator&(L, R);
3062 LR operator^(L, R);
3063 LR operator|(L, R);
3064 L operator<<(L, R);
3065 L operator>>(L, R);
3066 where LR is the result of the usual arithmetic conversions between
3067 types L and R. */
3069 case TRUNC_MOD_EXPR:
3070 case BIT_AND_EXPR:
3071 case BIT_IOR_EXPR:
3072 case BIT_XOR_EXPR:
3073 case LSHIFT_EXPR:
3074 case RSHIFT_EXPR:
3075 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
3076 break;
3077 return;
3079 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
3080 type, VQ is either volatile or empty, and R is a promoted arithmetic
3081 type, there exist candidate operator functions of the form
3082 VQ L& operator=(VQ L&, R);
3083 VQ L& operator*=(VQ L&, R);
3084 VQ L& operator/=(VQ L&, R);
3085 VQ L& operator+=(VQ L&, R);
3086 VQ L& operator-=(VQ L&, R);
3088 20For every pair T, VQ), where T is any type and VQ is either volatile
3089 or empty, there exist candidate operator functions of the form
3090 T*VQ& operator=(T*VQ&, T*);
3092 21For every pair T, VQ), where T is a pointer to member type and VQ is
3093 either volatile or empty, there exist candidate operator functions of
3094 the form
3095 VQ T& operator=(VQ T&, T);
3097 22For every triple T, VQ, I), where T is a cv-qualified or cv-
3098 unqualified complete object type, VQ is either volatile or empty, and
3099 I is a promoted integral type, there exist candidate operator func-
3100 tions of the form
3101 T*VQ& operator+=(T*VQ&, I);
3102 T*VQ& operator-=(T*VQ&, I);
3104 23For every triple L, VQ, R), where L is an integral or enumeration
3105 type, VQ is either volatile or empty, and R is a promoted integral
3106 type, there exist candidate operator functions of the form
3108 VQ L& operator%=(VQ L&, R);
3109 VQ L& operator<<=(VQ L&, R);
3110 VQ L& operator>>=(VQ L&, R);
3111 VQ L& operator&=(VQ L&, R);
3112 VQ L& operator^=(VQ L&, R);
3113 VQ L& operator|=(VQ L&, R); */
3115 case MODIFY_EXPR:
3116 switch (code2)
3118 case PLUS_EXPR:
3119 case MINUS_EXPR:
3120 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
3122 type2 = ptrdiff_type_node;
3123 break;
3125 /* FALLTHRU */
3126 case MULT_EXPR:
3127 case TRUNC_DIV_EXPR:
3128 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
3129 break;
3130 return;
3132 case TRUNC_MOD_EXPR:
3133 case BIT_AND_EXPR:
3134 case BIT_IOR_EXPR:
3135 case BIT_XOR_EXPR:
3136 case LSHIFT_EXPR:
3137 case RSHIFT_EXPR:
3138 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
3139 break;
3140 return;
3142 case NOP_EXPR:
3143 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
3144 break;
3145 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
3146 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
3147 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
3148 || ((TYPE_PTRMEMFUNC_P (type1)
3149 || TYPE_PTR_P (type1))
3150 && null_ptr_cst_p (args[1])))
3152 type2 = type1;
3153 break;
3155 return;
3157 default:
3158 gcc_unreachable ();
3160 type1 = build_reference_type (type1);
3161 break;
3163 case COND_EXPR:
3164 /* [over.built]
3166 For every pair of promoted arithmetic types L and R, there
3167 exist candidate operator functions of the form
3169 LR operator?(bool, L, R);
3171 where LR is the result of the usual arithmetic conversions
3172 between types L and R.
3174 For every type T, where T is a pointer or pointer-to-member
3175 type, there exist candidate operator functions of the form T
3176 operator?(bool, T, T); */
3178 if (promoted_arithmetic_type_p (type1)
3179 && promoted_arithmetic_type_p (type2))
3180 /* That's OK. */
3181 break;
3183 /* Otherwise, the types should be pointers. */
3184 if (!TYPE_PTR_OR_PTRMEM_P (type1) || !TYPE_PTR_OR_PTRMEM_P (type2))
3185 return;
3187 /* We don't check that the two types are the same; the logic
3188 below will actually create two candidates; one in which both
3189 parameter types are TYPE1, and one in which both parameter
3190 types are TYPE2. */
3191 break;
3193 case REALPART_EXPR:
3194 case IMAGPART_EXPR:
3195 if (ARITHMETIC_TYPE_P (type1))
3196 break;
3197 return;
3199 default:
3200 gcc_unreachable ();
3203 /* Make sure we don't create builtin candidates with dependent types. */
3204 bool u1 = uses_template_parms (type1);
3205 bool u2 = type2 ? uses_template_parms (type2) : false;
3206 if (u1 || u2)
3208 /* Try to recover if one of the types is non-dependent. But if
3209 there's only one type, there's nothing we can do. */
3210 if (!type2)
3211 return;
3212 /* And we lose if both are dependent. */
3213 if (u1 && u2)
3214 return;
3215 /* Or if they have different forms. */
3216 if (TREE_CODE (type1) != TREE_CODE (type2))
3217 return;
3219 if (u1 && !u2)
3220 type1 = type2;
3221 else if (u2 && !u1)
3222 type2 = type1;
3225 /* If we're dealing with two pointer types or two enumeral types,
3226 we need candidates for both of them. */
3227 if (type2 && !same_type_p (type1, type2)
3228 && TREE_CODE (type1) == TREE_CODE (type2)
3229 && (TYPE_REF_P (type1)
3230 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
3231 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
3232 || TYPE_PTRMEMFUNC_P (type1)
3233 || MAYBE_CLASS_TYPE_P (type1)
3234 || TREE_CODE (type1) == ENUMERAL_TYPE))
3236 if (TYPE_PTR_OR_PTRMEM_P (type1))
3238 tree cptype = composite_pointer_type (input_location,
3239 type1, type2,
3240 error_mark_node,
3241 error_mark_node,
3242 CPO_CONVERSION,
3243 tf_none);
3244 if (cptype != error_mark_node)
3246 build_builtin_candidate
3247 (candidates, fnname, cptype, cptype, args, argtypes,
3248 flags, complain);
3249 return;
3253 build_builtin_candidate
3254 (candidates, fnname, type1, type1, args, argtypes, flags, complain);
3255 build_builtin_candidate
3256 (candidates, fnname, type2, type2, args, argtypes, flags, complain);
3257 return;
3260 build_builtin_candidate
3261 (candidates, fnname, type1, type2, args, argtypes, flags, complain);
3264 tree
3265 type_decays_to (tree type)
3267 if (TREE_CODE (type) == ARRAY_TYPE)
3268 return build_pointer_type (TREE_TYPE (type));
3269 if (TREE_CODE (type) == FUNCTION_TYPE)
3270 return build_pointer_type (type);
3271 return type;
3274 /* There are three conditions of builtin candidates:
3276 1) bool-taking candidates. These are the same regardless of the input.
3277 2) pointer-pair taking candidates. These are generated for each type
3278 one of the input types converts to.
3279 3) arithmetic candidates. According to the standard, we should generate
3280 all of these, but I'm trying not to...
3282 Here we generate a superset of the possible candidates for this particular
3283 case. That is a subset of the full set the standard defines, plus some
3284 other cases which the standard disallows. add_builtin_candidate will
3285 filter out the invalid set. */
3287 static void
3288 add_builtin_candidates (struct z_candidate **candidates, enum tree_code code,
3289 enum tree_code code2, tree fnname,
3290 vec<tree, va_gc> *argv,
3291 int flags, tsubst_flags_t complain)
3293 int ref1;
3294 int enum_p = 0;
3295 tree type, argtypes[3], t;
3296 /* TYPES[i] is the set of possible builtin-operator parameter types
3297 we will consider for the Ith argument. */
3298 vec<tree, va_gc> *types[2];
3299 unsigned ix;
3300 vec<tree, va_gc> &args = *argv;
3301 unsigned len = args.length ();
3303 for (unsigned i = 0; i < len; ++i)
3305 if (args[i])
3306 argtypes[i] = unlowered_expr_type (args[i]);
3307 else
3308 argtypes[i] = NULL_TREE;
3311 switch (code)
3313 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
3314 and VQ is either volatile or empty, there exist candidate operator
3315 functions of the form
3316 VQ T& operator++(VQ T&); */
3318 case POSTINCREMENT_EXPR:
3319 case PREINCREMENT_EXPR:
3320 case POSTDECREMENT_EXPR:
3321 case PREDECREMENT_EXPR:
3322 case MODIFY_EXPR:
3323 ref1 = 1;
3324 break;
3326 /* 24There also exist candidate operator functions of the form
3327 bool operator!(bool);
3328 bool operator&&(bool, bool);
3329 bool operator||(bool, bool); */
3331 case TRUTH_NOT_EXPR:
3332 build_builtin_candidate
3333 (candidates, fnname, boolean_type_node,
3334 NULL_TREE, args, argtypes, flags, complain);
3335 return;
3337 case TRUTH_ORIF_EXPR:
3338 case TRUTH_ANDIF_EXPR:
3339 build_builtin_candidate
3340 (candidates, fnname, boolean_type_node,
3341 boolean_type_node, args, argtypes, flags, complain);
3342 return;
3344 case ADDR_EXPR:
3345 case COMPOUND_EXPR:
3346 case COMPONENT_REF:
3347 case CO_AWAIT_EXPR:
3348 return;
3350 case COND_EXPR:
3351 case EQ_EXPR:
3352 case NE_EXPR:
3353 case LT_EXPR:
3354 case LE_EXPR:
3355 case GT_EXPR:
3356 case GE_EXPR:
3357 case SPACESHIP_EXPR:
3358 enum_p = 1;
3359 /* Fall through. */
3361 default:
3362 ref1 = 0;
3365 types[0] = make_tree_vector ();
3366 types[1] = make_tree_vector ();
3368 if (len == 3)
3369 len = 2;
3370 for (unsigned i = 0; i < len; ++i)
3372 if (MAYBE_CLASS_TYPE_P (argtypes[i]))
3374 tree convs;
3376 if (i == 0 && code == MODIFY_EXPR && code2 == NOP_EXPR)
3377 return;
3379 convs = lookup_conversions (argtypes[i]);
3381 if (code == COND_EXPR)
3383 if (lvalue_p (args[i]))
3384 vec_safe_push (types[i], build_reference_type (argtypes[i]));
3386 vec_safe_push (types[i], TYPE_MAIN_VARIANT (argtypes[i]));
3389 else if (! convs)
3390 return;
3392 for (; convs; convs = TREE_CHAIN (convs))
3394 type = TREE_TYPE (convs);
3396 if (i == 0 && ref1
3397 && (!TYPE_REF_P (type)
3398 || CP_TYPE_CONST_P (TREE_TYPE (type))))
3399 continue;
3401 if (code == COND_EXPR && TYPE_REF_P (type))
3402 vec_safe_push (types[i], type);
3404 type = non_reference (type);
3405 if (i != 0 || ! ref1)
3407 type = cv_unqualified (type_decays_to (type));
3408 if (enum_p && TREE_CODE (type) == ENUMERAL_TYPE)
3409 vec_safe_push (types[i], type);
3410 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
3411 type = type_promotes_to (type);
3414 if (! vec_member (type, types[i]))
3415 vec_safe_push (types[i], type);
3418 else
3420 if (code == COND_EXPR && lvalue_p (args[i]))
3421 vec_safe_push (types[i], build_reference_type (argtypes[i]));
3422 type = non_reference (argtypes[i]);
3423 if (i != 0 || ! ref1)
3425 type = cv_unqualified (type_decays_to (type));
3426 if (enum_p && UNSCOPED_ENUM_P (type))
3427 vec_safe_push (types[i], type);
3428 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
3429 type = type_promotes_to (type);
3431 vec_safe_push (types[i], type);
3435 /* Run through the possible parameter types of both arguments,
3436 creating candidates with those parameter types. */
3437 FOR_EACH_VEC_ELT_REVERSE (*(types[0]), ix, t)
3439 unsigned jx;
3440 tree u;
3442 if (!types[1]->is_empty ())
3443 FOR_EACH_VEC_ELT_REVERSE (*(types[1]), jx, u)
3444 add_builtin_candidate
3445 (candidates, code, code2, fnname, t,
3446 u, args, argtypes, flags, complain);
3447 else
3448 add_builtin_candidate
3449 (candidates, code, code2, fnname, t,
3450 NULL_TREE, args, argtypes, flags, complain);
3453 release_tree_vector (types[0]);
3454 release_tree_vector (types[1]);
3458 /* If TMPL can be successfully instantiated as indicated by
3459 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3461 TMPL is the template. EXPLICIT_TARGS are any explicit template
3462 arguments. ARGLIST is the arguments provided at the call-site.
3463 This does not change ARGLIST. The RETURN_TYPE is the desired type
3464 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3465 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3466 CTYPE are ignored, and OBJ is as for add_conv_candidate.
3468 SHORTCUT_BAD_CONVS is as in add_function_candidate. */
3470 static struct z_candidate*
3471 add_template_candidate_real (struct z_candidate **candidates, tree tmpl,
3472 tree ctype, tree explicit_targs, tree first_arg,
3473 const vec<tree, va_gc> *arglist, tree return_type,
3474 tree access_path, tree conversion_path,
3475 int flags, tree obj, unification_kind_t strict,
3476 bool shortcut_bad_convs, tsubst_flags_t complain)
3478 int ntparms = DECL_NTPARMS (tmpl);
3479 tree targs = make_tree_vec (ntparms);
3480 unsigned int len = vec_safe_length (arglist);
3481 unsigned int nargs = (first_arg == NULL_TREE ? 0 : 1) + len;
3482 unsigned int skip_without_in_chrg = 0;
3483 tree first_arg_without_in_chrg = first_arg;
3484 tree *args_without_in_chrg;
3485 unsigned int nargs_without_in_chrg;
3486 unsigned int ia, ix;
3487 tree arg;
3488 struct z_candidate *cand;
3489 tree fn;
3490 struct rejection_reason *reason = NULL;
3491 int errs;
3492 conversion **convs = NULL;
3494 /* We don't do deduction on the in-charge parameter, the VTT
3495 parameter or 'this'. */
3496 if (DECL_IOBJ_MEMBER_FUNCTION_P (tmpl))
3498 if (first_arg_without_in_chrg != NULL_TREE)
3499 first_arg_without_in_chrg = NULL_TREE;
3500 else if (return_type && strict == DEDUCE_CALL)
3501 /* We're deducing for a call to the result of a template conversion
3502 function, so the args don't contain 'this'; leave them alone. */;
3503 else
3504 ++skip_without_in_chrg;
3507 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl)
3508 || DECL_BASE_CONSTRUCTOR_P (tmpl))
3509 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl)))
3511 if (first_arg_without_in_chrg != NULL_TREE)
3512 first_arg_without_in_chrg = NULL_TREE;
3513 else
3514 ++skip_without_in_chrg;
3517 if (len < skip_without_in_chrg)
3518 return add_ignored_candidate (candidates, tmpl);
3520 if (DECL_CONSTRUCTOR_P (tmpl) && nargs == 2
3521 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg),
3522 TREE_TYPE ((*arglist)[0])))
3524 /* 12.8/6 says, "A declaration of a constructor for a class X is
3525 ill-formed if its first parameter is of type (optionally cv-qualified)
3526 X and either there are no other parameters or else all other
3527 parameters have default arguments. A member function template is never
3528 instantiated to produce such a constructor signature."
3530 So if we're trying to copy an object of the containing class, don't
3531 consider a template constructor that has a first parameter type that
3532 is just a template parameter, as we would deduce a signature that we
3533 would then reject in the code below. */
3534 if (tree firstparm = FUNCTION_FIRST_USER_PARMTYPE (tmpl))
3536 firstparm = TREE_VALUE (firstparm);
3537 if (PACK_EXPANSION_P (firstparm))
3538 firstparm = PACK_EXPANSION_PATTERN (firstparm);
3539 if (TREE_CODE (firstparm) == TEMPLATE_TYPE_PARM)
3541 gcc_assert (!explicit_targs);
3542 reason = invalid_copy_with_fn_template_rejection ();
3543 goto fail;
3548 nargs_without_in_chrg = ((first_arg_without_in_chrg != NULL_TREE ? 1 : 0)
3549 + (len - skip_without_in_chrg));
3550 args_without_in_chrg = XALLOCAVEC (tree, nargs_without_in_chrg);
3551 ia = 0;
3552 if (first_arg_without_in_chrg != NULL_TREE)
3554 args_without_in_chrg[ia] = first_arg_without_in_chrg;
3555 ++ia;
3557 for (ix = skip_without_in_chrg;
3558 vec_safe_iterate (arglist, ix, &arg);
3559 ++ix)
3561 args_without_in_chrg[ia] = arg;
3562 ++ia;
3564 gcc_assert (ia == nargs_without_in_chrg);
3566 if (!obj)
3568 /* Check that there's no obvious arity mismatch before proceeding with
3569 deduction. This avoids substituting explicit template arguments
3570 into the template or e.g. derived-to-base parm/arg unification
3571 (which could result in an error outside the immediate context) when
3572 the resulting candidate would be unviable anyway. */
3573 int min_arity = 0, max_arity = 0;
3574 tree parms = TYPE_ARG_TYPES (TREE_TYPE (tmpl));
3575 parms = skip_artificial_parms_for (tmpl, parms);
3576 for (; parms != void_list_node; parms = TREE_CHAIN (parms))
3578 if (!parms || PACK_EXPANSION_P (TREE_VALUE (parms)))
3580 max_arity = -1;
3581 break;
3583 if (TREE_PURPOSE (parms))
3584 /* A parameter with a default argument. */
3585 ++max_arity;
3586 else
3587 ++min_arity, ++max_arity;
3589 if (ia < (unsigned)min_arity)
3591 /* Too few arguments. */
3592 reason = arity_rejection (NULL_TREE, min_arity, ia,
3593 /*least_p=*/(max_arity == -1));
3594 goto fail;
3596 else if (max_arity != -1 && ia > (unsigned)max_arity)
3598 /* Too many arguments. */
3599 reason = arity_rejection (NULL_TREE, max_arity, ia);
3600 goto fail;
3603 convs = alloc_conversions (nargs);
3605 if (shortcut_bad_convs
3606 && DECL_IOBJ_MEMBER_FUNCTION_P (tmpl)
3607 && !DECL_CONSTRUCTOR_P (tmpl))
3609 /* Check the 'this' conversion before proceeding with deduction.
3610 This is effectively an extension of the DR 1391 resolution
3611 that we perform in check_non_deducible_conversions, though it's
3612 convenient to do this extra check here instead of there. */
3613 tree parmtype = TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (tmpl)));
3614 tree argtype = lvalue_type (first_arg);
3615 tree arg = first_arg;
3616 conversion *t = build_this_conversion (tmpl, ctype,
3617 parmtype, argtype, arg,
3618 flags, complain);
3619 convs[0] = t;
3620 if (t->bad_p)
3622 reason = bad_arg_conversion_rejection (first_arg, 0,
3623 arg, parmtype,
3624 EXPR_LOCATION (arg));
3625 goto fail;
3630 errs = errorcount+sorrycount;
3631 fn = fn_type_unification (tmpl, explicit_targs, targs,
3632 args_without_in_chrg,
3633 nargs_without_in_chrg,
3634 return_type, strict, flags, convs,
3635 false, complain & tf_decltype);
3637 if (fn == error_mark_node)
3639 /* Don't repeat unification later if it already resulted in errors. */
3640 if (errorcount+sorrycount == errs)
3641 reason = template_unification_rejection (tmpl, explicit_targs,
3642 targs, args_without_in_chrg,
3643 nargs_without_in_chrg,
3644 return_type, strict, flags);
3645 else
3646 reason = template_unification_error_rejection ();
3647 goto fail;
3650 /* Now the explicit specifier might have been deduced; check if this
3651 declaration is explicit. If it is and we're ignoring non-converting
3652 constructors, don't add this function to the set of candidates. */
3653 if (((flags & (LOOKUP_ONLYCONVERTING|LOOKUP_LIST_INIT_CTOR))
3654 == LOOKUP_ONLYCONVERTING)
3655 && DECL_NONCONVERTING_P (fn))
3656 return add_ignored_candidate (candidates, fn);
3658 if (DECL_CONSTRUCTOR_P (fn) && nargs == 2)
3660 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (fn);
3661 if (arg_types && same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types)),
3662 ctype))
3664 /* We're trying to produce a constructor with a prohibited signature,
3665 as discussed above; handle here any cases we didn't catch then,
3666 such as X(X<T>). */
3667 reason = invalid_copy_with_fn_template_rejection ();
3668 goto fail;
3672 if (obj != NULL_TREE)
3673 /* Aha, this is a conversion function. */
3674 cand = add_conv_candidate (candidates, fn, obj, arglist,
3675 access_path, conversion_path, complain);
3676 else
3677 cand = add_function_candidate (candidates, fn, ctype,
3678 first_arg, arglist, access_path,
3679 conversion_path, flags, convs,
3680 shortcut_bad_convs, complain);
3681 if (DECL_TI_TEMPLATE (fn) != tmpl)
3682 /* This situation can occur if a member template of a template
3683 class is specialized. Then, instantiate_template might return
3684 an instantiation of the specialization, in which case the
3685 DECL_TI_TEMPLATE field will point at the original
3686 specialization. For example:
3688 template <class T> struct S { template <class U> void f(U);
3689 template <> void f(int) {}; };
3690 S<double> sd;
3691 sd.f(3);
3693 Here, TMPL will be template <class U> S<double>::f(U).
3694 And, instantiate template will give us the specialization
3695 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3696 for this will point at template <class T> template <> S<T>::f(int),
3697 so that we can find the definition. For the purposes of
3698 overload resolution, however, we want the original TMPL. */
3699 cand->template_decl = build_template_info (tmpl, targs);
3700 else
3701 cand->template_decl = DECL_TEMPLATE_INFO (fn);
3702 cand->explicit_targs = explicit_targs;
3704 return cand;
3705 fail:
3706 int viable = (reason->code == rr_bad_arg_conversion ? -1 : 0);
3707 return add_candidate (candidates, tmpl, first_arg, arglist, nargs, convs,
3708 access_path, conversion_path, viable, reason, flags);
3712 static struct z_candidate *
3713 add_template_candidate (struct z_candidate **candidates, tree tmpl, tree ctype,
3714 tree explicit_targs, tree first_arg,
3715 const vec<tree, va_gc> *arglist, tree return_type,
3716 tree access_path, tree conversion_path, int flags,
3717 unification_kind_t strict, bool shortcut_bad_convs,
3718 tsubst_flags_t complain)
3720 return
3721 add_template_candidate_real (candidates, tmpl, ctype,
3722 explicit_targs, first_arg, arglist,
3723 return_type, access_path, conversion_path,
3724 flags, NULL_TREE, strict, shortcut_bad_convs,
3725 complain);
3728 /* Create an overload candidate for the conversion function template TMPL,
3729 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3730 pointer-to-function which will in turn be called with the argument list
3731 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3732 passed on to implicit_conversion. */
3734 static struct z_candidate *
3735 add_template_conv_candidate (struct z_candidate **candidates, tree tmpl,
3736 tree obj,
3737 const vec<tree, va_gc> *arglist,
3738 tree return_type, tree access_path,
3739 tree conversion_path, tsubst_flags_t complain)
3741 return
3742 add_template_candidate_real (candidates, tmpl, NULL_TREE, NULL_TREE,
3743 NULL_TREE, arglist, return_type, access_path,
3744 conversion_path, 0, obj, DEDUCE_CALL,
3745 /*shortcut_bad_convs=*/false, complain);
3748 /* The CANDS are the set of candidates that were considered for
3749 overload resolution. Sort CANDS so that the strictly viable
3750 candidates appear first, followed by non-strictly viable candidates,
3751 followed by non-viable candidates. Returns the first candidate
3752 in this sorted list. If any of the candidates were viable, set
3753 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3754 considered viable only if it is strictly viable when setting
3755 *ANY_VIABLE_P. */
3757 static struct z_candidate*
3758 splice_viable (struct z_candidate *cands,
3759 bool strict_p,
3760 bool *any_viable_p)
3762 z_candidate *strictly_viable = nullptr;
3763 z_candidate **strictly_viable_tail = &strictly_viable;
3765 z_candidate *non_strictly_viable = nullptr;
3766 z_candidate **non_strictly_viable_tail = &non_strictly_viable;
3768 z_candidate *non_viable = nullptr;
3769 z_candidate **non_viable_tail = &non_viable;
3771 z_candidate *non_viable_ignored = nullptr;
3772 z_candidate **non_viable_ignored_tail = &non_viable_ignored;
3774 /* Be strict inside templates, since build_over_call won't actually
3775 do the conversions to get pedwarns. */
3776 if (processing_template_decl)
3777 strict_p = true;
3779 for (z_candidate *cand = cands; cand; cand = cand->next)
3781 if (!strict_p
3782 && (cand->viable == 1 || TREE_CODE (cand->fn) == TEMPLATE_DECL))
3783 /* Be strict in the presence of a viable candidate. Also if
3784 there are template candidates, so that we get deduction errors
3785 for them instead of silently preferring a bad conversion. */
3786 strict_p = true;
3788 /* Move this candidate to the appropriate list according to
3789 its viability. */
3790 auto& tail = (cand->viable == 1 ? strictly_viable_tail
3791 : cand->viable == -1 ? non_strictly_viable_tail
3792 : ignored_candidate_p (cand) ? non_viable_ignored_tail
3793 : non_viable_tail);
3794 *tail = cand;
3795 tail = &cand->next;
3798 *any_viable_p = (strictly_viable != nullptr
3799 || (!strict_p && non_strictly_viable != nullptr));
3801 /* Combine the lists. */
3802 *non_viable_ignored_tail = nullptr;
3803 *non_viable_tail = non_viable_ignored;
3804 *non_strictly_viable_tail = non_viable;
3805 *strictly_viable_tail = non_strictly_viable;
3807 return strictly_viable;
3810 static bool
3811 any_strictly_viable (struct z_candidate *cands)
3813 for (; cands; cands = cands->next)
3814 if (cands->viable == 1)
3815 return true;
3816 return false;
3819 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3820 words, it is about to become the "this" pointer for a member
3821 function call. Take the address of the object. */
3823 static tree
3824 build_this (tree obj)
3826 /* In a template, we are only concerned about the type of the
3827 expression, so we can take a shortcut. */
3828 if (processing_template_decl)
3829 return build_address (obj);
3831 return cp_build_addr_expr (obj, tf_warning_or_error);
3834 /* Returns true iff functions are equivalent. Equivalent functions are
3835 not '==' only if one is a function-local extern function or if
3836 both are extern "C". */
3838 static inline int
3839 equal_functions (tree fn1, tree fn2)
3841 if (TREE_CODE (fn1) != TREE_CODE (fn2))
3842 return 0;
3843 if (TREE_CODE (fn1) == TEMPLATE_DECL)
3844 return fn1 == fn2;
3845 if (DECL_LOCAL_DECL_P (fn1) || DECL_LOCAL_DECL_P (fn2)
3846 || DECL_EXTERN_C_FUNCTION_P (fn1))
3847 return decls_match (fn1, fn2);
3848 return fn1 == fn2;
3851 /* Print information about a candidate FN being rejected due to INFO. */
3853 static void
3854 print_conversion_rejection (location_t loc, struct conversion_info *info,
3855 tree fn)
3857 tree from = info->from;
3858 if (!TYPE_P (from))
3859 from = lvalue_type (from);
3860 if (info->n_arg == -1)
3862 /* Conversion of implicit `this' argument failed. */
3863 if (!TYPE_P (info->from))
3864 /* A bad conversion for 'this' must be discarding cv-quals. */
3865 inform (loc, " passing %qT as %<this%> "
3866 "argument discards qualifiers",
3867 from);
3868 else
3869 inform (loc, " no known conversion for implicit "
3870 "%<this%> parameter from %qH to %qI",
3871 from, info->to_type);
3873 else if (!TYPE_P (info->from))
3875 if (info->n_arg >= 0)
3876 inform (loc, " conversion of argument %d would be ill-formed:",
3877 info->n_arg + 1);
3878 iloc_sentinel ils = loc;
3879 perform_implicit_conversion (info->to_type, info->from,
3880 tf_warning_or_error);
3882 else if (info->n_arg == -2)
3883 /* Conversion of conversion function return value failed. */
3884 inform (loc, " no known conversion from %qH to %qI",
3885 from, info->to_type);
3886 else
3888 if (TREE_CODE (fn) == FUNCTION_DECL)
3889 loc = get_fndecl_argument_location (fn, info->n_arg);
3890 inform (loc, " no known conversion for argument %d from %qH to %qI",
3891 info->n_arg + 1, from, info->to_type);
3895 /* Print information about a candidate with WANT parameters and we found
3896 HAVE. */
3898 static void
3899 print_arity_information (location_t loc, unsigned int have, unsigned int want,
3900 bool least_p)
3902 if (least_p)
3903 inform_n (loc, want,
3904 " candidate expects at least %d argument, %d provided",
3905 " candidate expects at least %d arguments, %d provided",
3906 want, have);
3907 else
3908 inform_n (loc, want,
3909 " candidate expects %d argument, %d provided",
3910 " candidate expects %d arguments, %d provided",
3911 want, have);
3914 /* Print information about one overload candidate CANDIDATE. MSGSTR
3915 is the text to print before the candidate itself.
3917 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3918 to have been run through gettext by the caller. This wart makes
3919 life simpler in print_z_candidates and for the translators. */
3921 static void
3922 print_z_candidate (location_t loc, const char *msgstr,
3923 struct z_candidate *candidate)
3925 const char *msg = (msgstr == NULL
3926 ? ""
3927 : ACONCAT ((_(msgstr), " ", NULL)));
3928 tree fn = candidate->fn;
3929 if (flag_new_inheriting_ctors)
3930 fn = strip_inheriting_ctors (fn);
3931 location_t cloc = location_of (fn);
3933 if (identifier_p (fn))
3935 cloc = loc;
3936 if (candidate->num_convs == 3)
3937 inform (cloc, "%s%<%D(%T, %T, %T)%> (built-in)", msg, fn,
3938 candidate->convs[0]->type,
3939 candidate->convs[1]->type,
3940 candidate->convs[2]->type);
3941 else if (candidate->num_convs == 2)
3942 inform (cloc, "%s%<%D(%T, %T)%> (built-in)", msg, fn,
3943 candidate->convs[0]->type,
3944 candidate->convs[1]->type);
3945 else
3946 inform (cloc, "%s%<%D(%T)%> (built-in)", msg, fn,
3947 candidate->convs[0]->type);
3949 else if (TYPE_P (fn))
3950 inform (cloc, "%s%qT (conversion)", msg, fn);
3951 else if (candidate->viable == -1)
3952 inform (cloc, "%s%#qD (near match)", msg, fn);
3953 else if (ignored_candidate_p (candidate))
3954 inform (cloc, "%s%#qD (ignored)", msg, fn);
3955 else if (DECL_DELETED_FN (fn))
3956 inform (cloc, "%s%#qD (deleted)", msg, fn);
3957 else if (candidate->reversed ())
3958 inform (cloc, "%s%#qD (reversed)", msg, fn);
3959 else if (candidate->rewritten ())
3960 inform (cloc, "%s%#qD (rewritten)", msg, fn);
3961 else
3962 inform (cloc, "%s%#qD", msg, fn);
3963 if (fn != candidate->fn)
3965 cloc = location_of (candidate->fn);
3966 inform (cloc, " inherited here");
3968 /* Give the user some information about why this candidate failed. */
3969 if (candidate->reason != NULL)
3971 struct rejection_reason *r = candidate->reason;
3973 switch (r->code)
3975 case rr_arity:
3976 print_arity_information (cloc, r->u.arity.actual,
3977 r->u.arity.expected,
3978 r->u.arity.least_p);
3979 break;
3980 case rr_arg_conversion:
3981 print_conversion_rejection (cloc, &r->u.conversion, fn);
3982 break;
3983 case rr_bad_arg_conversion:
3984 print_conversion_rejection (cloc, &r->u.bad_conversion, fn);
3985 break;
3986 case rr_explicit_conversion:
3987 inform (cloc, " return type %qT of explicit conversion function "
3988 "cannot be converted to %qT with a qualification "
3989 "conversion", r->u.conversion.from,
3990 r->u.conversion.to_type);
3991 break;
3992 case rr_template_conversion:
3993 inform (cloc, " conversion from return type %qT of template "
3994 "conversion function specialization to %qT is not an "
3995 "exact match", r->u.conversion.from,
3996 r->u.conversion.to_type);
3997 break;
3998 case rr_template_unification:
3999 /* We use template_unification_error_rejection if unification caused
4000 actual non-SFINAE errors, in which case we don't need to repeat
4001 them here. */
4002 if (r->u.template_unification.tmpl == NULL_TREE)
4004 inform (cloc, " substitution of deduced template arguments "
4005 "resulted in errors seen above");
4006 break;
4008 /* Re-run template unification with diagnostics. */
4009 inform (cloc, " template argument deduction/substitution failed:");
4010 fn_type_unification (r->u.template_unification.tmpl,
4011 r->u.template_unification.explicit_targs,
4012 (make_tree_vec
4013 (r->u.template_unification.num_targs)),
4014 r->u.template_unification.args,
4015 r->u.template_unification.nargs,
4016 r->u.template_unification.return_type,
4017 r->u.template_unification.strict,
4018 r->u.template_unification.flags,
4019 NULL, true, false);
4020 break;
4021 case rr_invalid_copy:
4022 inform (cloc,
4023 " a constructor taking a single argument of its own "
4024 "class type is invalid");
4025 break;
4026 case rr_constraint_failure:
4027 diagnose_constraints (cloc, fn, NULL_TREE);
4028 break;
4029 case rr_inherited_ctor:
4030 inform (cloc, " an inherited constructor is not a candidate for "
4031 "initialization from an expression of the same or derived "
4032 "type");
4033 break;
4034 case rr_ignored:
4035 break;
4036 case rr_none:
4037 default:
4038 /* This candidate didn't have any issues or we failed to
4039 handle a particular code. Either way... */
4040 gcc_unreachable ();
4045 /* Print information about each overload candidate in CANDIDATES,
4046 which is assumed to have gone through splice_viable and tourney
4047 (if splice_viable succeeded). */
4049 static void
4050 print_z_candidates (location_t loc, struct z_candidate *candidates,
4051 tristate only_viable_p /* = tristate::unknown () */)
4053 struct z_candidate *cand1;
4054 struct z_candidate **cand2;
4056 if (!candidates)
4057 return;
4059 /* Remove non-viable deleted candidates. */
4060 cand1 = candidates;
4061 for (cand2 = &cand1; *cand2; )
4063 if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL
4064 && !(*cand2)->viable
4065 && DECL_DELETED_FN ((*cand2)->fn))
4066 *cand2 = (*cand2)->next;
4067 else
4068 cand2 = &(*cand2)->next;
4070 /* ...if there are any non-deleted ones. */
4071 if (cand1)
4072 candidates = cand1;
4074 /* There may be duplicates in the set of candidates. We put off
4075 checking this condition as long as possible, since we have no way
4076 to eliminate duplicates from a set of functions in less than n^2
4077 time. Now we are about to emit an error message, so it is more
4078 permissible to go slowly. */
4079 for (cand1 = candidates; cand1; cand1 = cand1->next)
4081 tree fn = cand1->fn;
4082 /* Skip builtin candidates and conversion functions. */
4083 if (!DECL_P (fn))
4084 continue;
4085 cand2 = &cand1->next;
4086 while (*cand2)
4088 if (DECL_P ((*cand2)->fn)
4089 && equal_functions (fn, (*cand2)->fn))
4090 *cand2 = (*cand2)->next;
4091 else
4092 cand2 = &(*cand2)->next;
4096 /* Unless otherwise specified, if there's a (strictly) viable candidate
4097 then we assume we're being called as part of diagnosing ambiguity, in
4098 which case we want to print only viable candidates since non-viable
4099 candidates couldn't have contributed to the ambiguity. */
4100 if (only_viable_p.is_unknown ())
4101 only_viable_p = candidates->viable == 1;
4103 for (; candidates; candidates = candidates->next)
4105 if (only_viable_p.is_true () && candidates->viable != 1)
4106 break;
4107 if (ignored_candidate_p (candidates) && !flag_diagnostics_all_candidates)
4109 inform (loc, "some candidates omitted; "
4110 "use %<-fdiagnostics-all-candidates%> to display them");
4111 break;
4113 print_z_candidate (loc, N_("candidate:"), candidates);
4117 /* USER_SEQ is a user-defined conversion sequence, beginning with a
4118 USER_CONV. STD_SEQ is the standard conversion sequence applied to
4119 the result of the conversion function to convert it to the final
4120 desired type. Merge the two sequences into a single sequence,
4121 and return the merged sequence. */
4123 static conversion *
4124 merge_conversion_sequences (conversion *user_seq, conversion *std_seq)
4126 conversion **t;
4127 bool bad = user_seq->bad_p;
4129 gcc_assert (user_seq->kind == ck_user);
4131 /* Find the end of the second conversion sequence. */
4132 for (t = &std_seq; (*t)->kind != ck_identity; t = &((*t)->u.next))
4134 /* The entire sequence is a user-conversion sequence. */
4135 (*t)->user_conv_p = true;
4136 if (bad)
4137 (*t)->bad_p = true;
4140 if ((*t)->rvaluedness_matches_p)
4141 /* We're binding a reference directly to the result of the conversion.
4142 build_user_type_conversion_1 stripped the REFERENCE_TYPE from the return
4143 type, but we want it back. */
4144 user_seq->type = TREE_TYPE (TREE_TYPE (user_seq->cand->fn));
4146 /* Replace the identity conversion with the user conversion
4147 sequence. */
4148 *t = user_seq;
4150 return std_seq;
4153 /* Handle overload resolution for initializing an object of class type from
4154 an initializer list. First we look for a suitable constructor that
4155 takes a std::initializer_list; if we don't find one, we then look for a
4156 non-list constructor.
4158 Parameters are as for add_candidates, except that the arguments are in
4159 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
4160 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
4162 static void
4163 add_list_candidates (tree fns, tree first_arg,
4164 const vec<tree, va_gc> *args, tree totype,
4165 tree explicit_targs, bool template_only,
4166 tree conversion_path, tree access_path,
4167 int flags,
4168 struct z_candidate **candidates,
4169 tsubst_flags_t complain)
4171 gcc_assert (*candidates == NULL);
4173 /* We're looking for a ctor for list-initialization. */
4174 flags |= LOOKUP_LIST_INIT_CTOR;
4175 /* And we don't allow narrowing conversions. We also use this flag to
4176 avoid the copy constructor call for copy-list-initialization. */
4177 flags |= LOOKUP_NO_NARROWING;
4179 unsigned nart = num_artificial_parms_for (OVL_FIRST (fns)) - 1;
4180 tree init_list = (*args)[nart];
4182 /* Always use the default constructor if the list is empty (DR 990). */
4183 if (CONSTRUCTOR_NELTS (init_list) == 0
4184 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
4186 else if (CONSTRUCTOR_IS_DESIGNATED_INIT (init_list)
4187 && !CP_AGGREGATE_TYPE_P (totype))
4189 if (complain & tf_error)
4190 error ("designated initializers cannot be used with a "
4191 "non-aggregate type %qT", totype);
4192 return;
4194 /* If the class has a list ctor, try passing the list as a single
4195 argument first, but only consider list ctors. */
4196 else if (TYPE_HAS_LIST_CTOR (totype))
4198 flags |= LOOKUP_LIST_ONLY;
4199 add_candidates (fns, first_arg, args, NULL_TREE,
4200 explicit_targs, template_only, conversion_path,
4201 access_path, flags, candidates, complain);
4202 if (any_strictly_viable (*candidates))
4203 return;
4206 /* Expand the CONSTRUCTOR into a new argument vec. */
4207 vec<tree, va_gc> *new_args;
4208 vec_alloc (new_args, nart + CONSTRUCTOR_NELTS (init_list));
4209 for (unsigned i = 0; i < nart; ++i)
4210 new_args->quick_push ((*args)[i]);
4211 for (unsigned i = 0; i < CONSTRUCTOR_NELTS (init_list); ++i)
4212 new_args->quick_push (CONSTRUCTOR_ELT (init_list, i)->value);
4214 /* We aren't looking for list-ctors anymore. */
4215 flags &= ~LOOKUP_LIST_ONLY;
4216 /* We allow more user-defined conversions within an init-list. */
4217 flags &= ~LOOKUP_NO_CONVERSION;
4219 add_candidates (fns, first_arg, new_args, NULL_TREE,
4220 explicit_targs, template_only, conversion_path,
4221 access_path, flags, candidates, complain);
4224 /* Given C(std::initializer_list<A>), return A. */
4226 static tree
4227 list_ctor_element_type (tree fn)
4229 gcc_checking_assert (is_list_ctor (fn));
4231 tree parm = FUNCTION_FIRST_USER_PARMTYPE (fn);
4232 parm = non_reference (TREE_VALUE (parm));
4233 return TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm), 0);
4236 /* If EXPR is a braced-init-list where the elements all decay to the same type,
4237 return that type. */
4239 static tree
4240 braced_init_element_type (tree expr)
4242 if (TREE_CODE (expr) == CONSTRUCTOR
4243 && TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE)
4244 return TREE_TYPE (TREE_TYPE (expr));
4245 if (!BRACE_ENCLOSED_INITIALIZER_P (expr))
4246 return NULL_TREE;
4248 tree elttype = NULL_TREE;
4249 for (constructor_elt &e: CONSTRUCTOR_ELTS (expr))
4251 tree type = TREE_TYPE (e.value);
4252 type = type_decays_to (type);
4253 if (!elttype)
4254 elttype = type;
4255 else if (!same_type_p (type, elttype))
4256 return NULL_TREE;
4258 return elttype;
4261 /* True iff EXPR contains any temporaries with non-trivial destruction.
4263 ??? Also ignore classes with non-trivial but no-op destruction other than
4264 std::allocator? */
4266 static bool
4267 has_non_trivial_temporaries (tree expr)
4269 auto_vec<tree*> temps;
4270 cp_walk_tree_without_duplicates (&expr, find_temps_r, &temps);
4271 for (tree *p : temps)
4273 tree t = TREE_TYPE (*p);
4274 if (!TYPE_HAS_TRIVIAL_DESTRUCTOR (t)
4275 && !is_std_allocator (t))
4276 return true;
4278 return false;
4281 /* We're initializing an array of ELTTYPE from INIT. If it seems useful,
4282 return INIT as an array (of its own type) so the caller can initialize the
4283 target array in a loop. */
4285 static tree
4286 maybe_init_list_as_array (tree elttype, tree init)
4288 /* Only do this if the array can go in rodata but not once converted. */
4289 if (!TYPE_NON_AGGREGATE_CLASS (elttype))
4290 return NULL_TREE;
4291 tree init_elttype = braced_init_element_type (init);
4292 if (!init_elttype || !SCALAR_TYPE_P (init_elttype) || !TREE_CONSTANT (init))
4293 return NULL_TREE;
4295 /* Check with a stub expression to weed out special cases, and check whether
4296 we call the same function for direct-init as copy-list-init. */
4297 conversion_obstack_sentinel cos;
4298 tree arg = build_stub_object (init_elttype);
4299 conversion *c = implicit_conversion (elttype, init_elttype, arg, false,
4300 LOOKUP_NORMAL, tf_none);
4301 if (c && c->kind == ck_rvalue)
4302 c = next_conversion (c);
4303 if (!c || c->kind != ck_user)
4304 return NULL_TREE;
4306 tree first = CONSTRUCTOR_ELT (init, 0)->value;
4307 conversion *fc = implicit_conversion (elttype, init_elttype, first, false,
4308 LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING,
4309 tf_none);
4310 if (fc && fc->kind == ck_rvalue)
4311 fc = next_conversion (fc);
4312 if (!fc || fc->kind != ck_user || fc->cand->fn != c->cand->fn)
4313 return NULL_TREE;
4314 first = convert_like (fc, first, tf_none);
4315 if (first == error_mark_node)
4316 /* Let the normal code give the error. */
4317 return NULL_TREE;
4319 /* Don't do this if the conversion would be constant. */
4320 first = maybe_constant_init (first);
4321 if (TREE_CONSTANT (first))
4322 return NULL_TREE;
4324 /* We can't do this if the conversion creates temporaries that need
4325 to live until the whole array is initialized. */
4326 if (has_non_trivial_temporaries (first))
4327 return NULL_TREE;
4329 /* We can't do this if copying from the initializer_list would be
4330 ill-formed. */
4331 tree copy_argtypes = make_tree_vec (1);
4332 TREE_VEC_ELT (copy_argtypes, 0)
4333 = cp_build_qualified_type (elttype, TYPE_QUAL_CONST);
4334 if (!is_xible (INIT_EXPR, elttype, copy_argtypes))
4335 return NULL_TREE;
4337 init_elttype = cp_build_qualified_type (init_elttype, TYPE_QUAL_CONST);
4338 tree arr = build_array_of_n_type (init_elttype, CONSTRUCTOR_NELTS (init));
4339 arr = finish_compound_literal (arr, init, tf_none);
4340 DECL_MERGEABLE (TARGET_EXPR_SLOT (arr)) = true;
4341 return arr;
4344 /* If we were going to call e.g. vector(initializer_list<string>) starting
4345 with a list of string-literals (which is inefficient, see PR105838),
4346 instead build an array of const char* and pass it to the range constructor.
4347 But only do this for standard library types, where we can assume the
4348 transformation makes sense.
4350 Really the container classes should have initializer_list<U> constructors to
4351 get the same effect more simply; this is working around that lack. */
4353 static tree
4354 maybe_init_list_as_range (tree fn, tree expr)
4356 if (!processing_template_decl
4357 && BRACE_ENCLOSED_INITIALIZER_P (expr)
4358 && is_list_ctor (fn)
4359 && decl_in_std_namespace_p (fn))
4361 tree to = list_ctor_element_type (fn);
4362 if (tree init = maybe_init_list_as_array (to, expr))
4364 tree begin = decay_conversion (TARGET_EXPR_SLOT (init), tf_none);
4365 tree nelts = array_type_nelts_top (TREE_TYPE (init));
4366 tree end = cp_build_binary_op (input_location, PLUS_EXPR, begin,
4367 nelts, tf_none);
4368 begin = cp_build_compound_expr (init, begin, tf_none);
4369 return build_constructor_va (init_list_type_node, 2,
4370 NULL_TREE, begin, NULL_TREE, end);
4374 return NULL_TREE;
4377 /* Returns the best overload candidate to perform the requested
4378 conversion. This function is used for three the overloading situations
4379 described in [over.match.copy], [over.match.conv], and [over.match.ref].
4380 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
4381 per [dcl.init.ref], so we ignore temporary bindings. */
4383 static struct z_candidate *
4384 build_user_type_conversion_1 (tree totype, tree expr, int flags,
4385 tsubst_flags_t complain)
4387 struct z_candidate *candidates, *cand;
4388 tree fromtype;
4389 tree ctors = NULL_TREE;
4390 tree conv_fns = NULL_TREE;
4391 conversion *conv = NULL;
4392 tree first_arg = NULL_TREE;
4393 vec<tree, va_gc> *args = NULL;
4394 bool any_viable_p;
4395 int convflags;
4397 if (!expr)
4398 return NULL;
4400 fromtype = TREE_TYPE (expr);
4402 /* We represent conversion within a hierarchy using RVALUE_CONV and
4403 BASE_CONV, as specified by [over.best.ics]; these become plain
4404 constructor calls, as specified in [dcl.init]. */
4405 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype) || !MAYBE_CLASS_TYPE_P (totype)
4406 || !DERIVED_FROM_P (totype, fromtype));
4408 if (CLASS_TYPE_P (totype))
4409 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
4410 creating a garbage BASELINK; constructors can't be inherited. */
4411 ctors = get_class_binding (totype, complete_ctor_identifier);
4413 tree to_nonref = non_reference (totype);
4414 if (MAYBE_CLASS_TYPE_P (fromtype))
4416 if (same_type_ignoring_top_level_qualifiers_p (to_nonref, fromtype) ||
4417 (CLASS_TYPE_P (to_nonref) && CLASS_TYPE_P (fromtype)
4418 && DERIVED_FROM_P (to_nonref, fromtype)))
4420 /* [class.conv.fct] A conversion function is never used to
4421 convert a (possibly cv-qualified) object to the (possibly
4422 cv-qualified) same object type (or a reference to it), to a
4423 (possibly cv-qualified) base class of that type (or a
4424 reference to it)... */
4426 else
4427 conv_fns = lookup_conversions (fromtype);
4430 candidates = 0;
4431 flags |= LOOKUP_NO_CONVERSION;
4432 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
4433 flags |= LOOKUP_NO_NARROWING;
4434 /* Prevent add_candidates from treating a non-strictly viable candidate
4435 as unviable. */
4436 complain |= tf_conv;
4438 /* It's OK to bind a temporary for converting constructor arguments, but
4439 not in converting the return value of a conversion operator. */
4440 convflags = ((flags & LOOKUP_NO_TEMP_BIND) | LOOKUP_NO_CONVERSION
4441 | (flags & LOOKUP_NO_NARROWING));
4442 flags &= ~LOOKUP_NO_TEMP_BIND;
4444 if (ctors)
4446 int ctorflags = flags;
4448 first_arg = build_dummy_object (totype);
4450 /* We should never try to call the abstract or base constructor
4451 from here. */
4452 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors))
4453 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors)));
4455 args = make_tree_vector_single (expr);
4456 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
4458 /* List-initialization. */
4459 add_list_candidates (ctors, first_arg, args, totype, NULL_TREE,
4460 false, TYPE_BINFO (totype), TYPE_BINFO (totype),
4461 ctorflags, &candidates, complain);
4463 else
4465 add_candidates (ctors, first_arg, args, NULL_TREE, NULL_TREE, false,
4466 TYPE_BINFO (totype), TYPE_BINFO (totype),
4467 ctorflags, &candidates, complain);
4470 for (cand = candidates; cand; cand = cand->next)
4472 cand->second_conv = build_identity_conv (totype, NULL_TREE);
4474 /* If totype isn't a reference, and LOOKUP_ONLYCONVERTING is
4475 set, then this is copy-initialization. In that case, "The
4476 result of the call is then used to direct-initialize the
4477 object that is the destination of the copy-initialization."
4478 [dcl.init]
4480 We represent this in the conversion sequence with an
4481 rvalue conversion, which means a constructor call. */
4482 if (!TYPE_REF_P (totype)
4483 && cxx_dialect < cxx17
4484 && (flags & LOOKUP_ONLYCONVERTING)
4485 && !(convflags & LOOKUP_NO_TEMP_BIND))
4486 cand->second_conv
4487 = build_conv (ck_rvalue, totype, cand->second_conv);
4491 if (conv_fns)
4493 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
4494 first_arg = CONSTRUCTOR_ELT (expr, 0)->value;
4495 else
4496 first_arg = expr;
4499 for (; conv_fns; conv_fns = TREE_CHAIN (conv_fns))
4501 tree conversion_path = TREE_PURPOSE (conv_fns);
4502 struct z_candidate *old_candidates;
4504 /* If LOOKUP_NO_CONVERSION, don't consider a conversion function that
4505 would need an addional user-defined conversion, i.e. if the return
4506 type differs in class-ness from the desired type. So we avoid
4507 considering operator bool when calling a copy constructor.
4509 This optimization avoids the failure in PR97600, and is allowed by
4510 [temp.inst]/9: "If the function selected by overload resolution can be
4511 determined without instantiating a class template definition, it is
4512 unspecified whether that instantiation actually takes place." */
4513 tree convtype = non_reference (TREE_TYPE (conv_fns));
4514 if ((flags & LOOKUP_NO_CONVERSION)
4515 && !WILDCARD_TYPE_P (convtype)
4516 && (CLASS_TYPE_P (to_nonref)
4517 != CLASS_TYPE_P (convtype)))
4518 continue;
4520 /* If we are called to convert to a reference type, we are trying to
4521 find a direct binding, so don't even consider temporaries. If
4522 we don't find a direct binding, the caller will try again to
4523 look for a temporary binding. */
4524 if (TYPE_REF_P (totype))
4525 convflags |= LOOKUP_NO_TEMP_BIND;
4527 old_candidates = candidates;
4528 add_candidates (TREE_VALUE (conv_fns), first_arg, NULL, totype,
4529 NULL_TREE, false,
4530 conversion_path, TYPE_BINFO (fromtype),
4531 flags, &candidates, complain);
4533 for (cand = candidates; cand != old_candidates; cand = cand->next)
4535 if (cand->viable == 0)
4536 /* Already rejected, don't change to -1. */
4537 continue;
4539 tree rettype = TREE_TYPE (TREE_TYPE (cand->fn));
4540 conversion *ics
4541 = implicit_conversion (totype,
4542 rettype,
4544 /*c_cast_p=*/false, convflags,
4545 complain);
4547 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
4548 copy-initialization. In that case, "The result of the
4549 call is then used to direct-initialize the object that is
4550 the destination of the copy-initialization." [dcl.init]
4552 We represent this in the conversion sequence with an
4553 rvalue conversion, which means a constructor call. But
4554 don't add a second rvalue conversion if there's already
4555 one there. Which there really shouldn't be, but it's
4556 harmless since we'd add it here anyway. */
4557 if (ics && MAYBE_CLASS_TYPE_P (totype) && ics->kind != ck_rvalue
4558 && !(convflags & LOOKUP_NO_TEMP_BIND))
4559 ics = build_conv (ck_rvalue, totype, ics);
4561 cand->second_conv = ics;
4563 if (!ics)
4565 cand->viable = 0;
4566 cand->reason = arg_conversion_rejection (NULL_TREE, -2,
4567 rettype, totype,
4568 EXPR_LOCATION (expr));
4570 else if (TYPE_REF_P (totype) && !ics->rvaluedness_matches_p
4571 /* Limit this to non-templates for now (PR90546). */
4572 && !cand->template_decl
4573 && TREE_CODE (TREE_TYPE (totype)) != FUNCTION_TYPE)
4575 /* If we are called to convert to a reference type, we are trying
4576 to find a direct binding per [over.match.ref], so rvaluedness
4577 must match for non-functions. */
4578 cand->viable = 0;
4580 else if (DECL_NONCONVERTING_P (cand->fn)
4581 && ics->rank > cr_exact)
4583 /* 13.3.1.5: For direct-initialization, those explicit
4584 conversion functions that are not hidden within S and
4585 yield type T or a type that can be converted to type T
4586 with a qualification conversion (4.4) are also candidate
4587 functions. */
4588 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
4589 I've raised this issue with the committee. --jason 9/2011 */
4590 cand->viable = -1;
4591 cand->reason = explicit_conversion_rejection (rettype, totype);
4593 else if (cand->viable == 1 && ics->bad_p)
4595 cand->viable = -1;
4596 cand->reason
4597 = bad_arg_conversion_rejection (NULL_TREE, -2,
4598 rettype, totype,
4599 EXPR_LOCATION (expr));
4601 else if (primary_template_specialization_p (cand->fn)
4602 && ics->rank > cr_exact)
4604 /* 13.3.3.1.2: If the user-defined conversion is specified by
4605 a specialization of a conversion function template, the
4606 second standard conversion sequence shall have exact match
4607 rank. */
4608 cand->viable = -1;
4609 cand->reason = template_conversion_rejection (rettype, totype);
4614 candidates = splice_viable (candidates, false, &any_viable_p);
4615 if (!any_viable_p)
4617 if (args)
4618 release_tree_vector (args);
4619 return NULL;
4622 cand = tourney (candidates, complain);
4623 if (cand == NULL)
4625 if (complain & tf_error)
4627 auto_diagnostic_group d;
4628 error_at (cp_expr_loc_or_input_loc (expr),
4629 "conversion from %qH to %qI is ambiguous",
4630 fromtype, totype);
4631 print_z_candidates (location_of (expr), candidates);
4634 cand = candidates; /* any one will do */
4635 cand->second_conv = build_ambiguous_conv (totype, expr);
4636 cand->second_conv->user_conv_p = true;
4637 if (!any_strictly_viable (candidates))
4638 cand->second_conv->bad_p = true;
4639 if (flags & LOOKUP_ONLYCONVERTING)
4640 cand->second_conv->need_temporary_p = true;
4641 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
4642 ambiguous conversion is no worse than another user-defined
4643 conversion. */
4645 return cand;
4648 /* Maybe pass { } as iterators instead of an initializer_list. */
4649 if (tree iters = maybe_init_list_as_range (cand->fn, expr))
4650 if (z_candidate *cand2
4651 = build_user_type_conversion_1 (totype, iters, flags, tf_none))
4652 if (cand2->viable == 1 && !is_list_ctor (cand2->fn))
4654 cand = cand2;
4655 expr = iters;
4658 tree convtype;
4659 if (!DECL_CONSTRUCTOR_P (cand->fn))
4660 convtype = non_reference (TREE_TYPE (TREE_TYPE (cand->fn)));
4661 else if (cand->second_conv->kind == ck_rvalue)
4662 /* DR 5: [in the first step of copy-initialization]...if the function
4663 is a constructor, the call initializes a temporary of the
4664 cv-unqualified version of the destination type. */
4665 convtype = cv_unqualified (totype);
4666 else
4667 convtype = totype;
4668 /* Build the user conversion sequence. */
4669 conv = build_conv
4670 (ck_user,
4671 convtype,
4672 build_identity_conv (TREE_TYPE (expr), expr));
4673 conv->cand = cand;
4674 if (cand->viable == -1)
4675 conv->bad_p = true;
4677 /* Remember that this was a list-initialization. */
4678 if (flags & LOOKUP_NO_NARROWING)
4679 conv->check_narrowing = true;
4681 /* Combine it with the second conversion sequence. */
4682 cand->second_conv = merge_conversion_sequences (conv,
4683 cand->second_conv);
4685 return cand;
4688 /* Wrapper for above. */
4690 tree
4691 build_user_type_conversion (tree totype, tree expr, int flags,
4692 tsubst_flags_t complain)
4694 struct z_candidate *cand;
4695 tree ret;
4697 auto_cond_timevar tv (TV_OVERLOAD);
4699 conversion_obstack_sentinel cos;
4701 cand = build_user_type_conversion_1 (totype, expr, flags, complain);
4703 if (cand)
4705 if (cand->second_conv->kind == ck_ambig)
4706 ret = error_mark_node;
4707 else
4709 expr = convert_like (cand->second_conv, expr, complain);
4710 ret = convert_from_reference (expr);
4713 else
4714 ret = NULL_TREE;
4716 return ret;
4719 /* Give a helpful diagnostic when implicit_conversion fails. */
4721 static void
4722 implicit_conversion_error (location_t loc, tree type, tree expr)
4724 tsubst_flags_t complain = tf_warning_or_error;
4726 /* If expr has unknown type, then it is an overloaded function.
4727 Call instantiate_type to get good error messages. */
4728 if (TREE_TYPE (expr) == unknown_type_node)
4729 instantiate_type (type, expr, complain);
4730 else if (invalid_nonstatic_memfn_p (loc, expr, complain))
4731 /* We gave an error. */;
4732 else if (BRACE_ENCLOSED_INITIALIZER_P (expr)
4733 && CONSTRUCTOR_IS_DESIGNATED_INIT (expr)
4734 && !CP_AGGREGATE_TYPE_P (type))
4735 error_at (loc, "designated initializers cannot be used with a "
4736 "non-aggregate type %qT", type);
4737 else
4739 range_label_for_type_mismatch label (TREE_TYPE (expr), type);
4740 gcc_rich_location rich_loc (loc, &label);
4741 error_at (&rich_loc, "could not convert %qE from %qH to %qI",
4742 expr, TREE_TYPE (expr), type);
4746 /* Worker for build_converted_constant_expr. */
4748 static tree
4749 build_converted_constant_expr_internal (tree type, tree expr,
4750 int flags, tsubst_flags_t complain)
4752 conversion *conv;
4753 tree t;
4754 location_t loc = cp_expr_loc_or_input_loc (expr);
4756 if (error_operand_p (expr))
4757 return error_mark_node;
4759 conversion_obstack_sentinel cos;
4761 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
4762 /*c_cast_p=*/false, flags, complain);
4764 /* A converted constant expression of type T is an expression, implicitly
4765 converted to type T, where the converted expression is a constant
4766 expression and the implicit conversion sequence contains only
4768 * user-defined conversions,
4769 * lvalue-to-rvalue conversions (7.1),
4770 * array-to-pointer conversions (7.2),
4771 * function-to-pointer conversions (7.3),
4772 * qualification conversions (7.5),
4773 * integral promotions (7.6),
4774 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4775 * null pointer conversions (7.11) from std::nullptr_t,
4776 * null member pointer conversions (7.12) from std::nullptr_t, and
4777 * function pointer conversions (7.13),
4779 and where the reference binding (if any) binds directly. */
4781 for (conversion *c = conv;
4782 c && c->kind != ck_identity;
4783 c = next_conversion (c))
4785 switch (c->kind)
4787 /* A conversion function is OK. If it isn't constexpr, we'll
4788 complain later that the argument isn't constant. */
4789 case ck_user:
4790 /* List-initialization is OK. */
4791 case ck_aggr:
4792 /* The lvalue-to-rvalue conversion is OK. */
4793 case ck_rvalue:
4794 /* Array-to-pointer and function-to-pointer. */
4795 case ck_lvalue:
4796 /* Function pointer conversions. */
4797 case ck_fnptr:
4798 /* Qualification conversions. */
4799 case ck_qual:
4800 break;
4802 case ck_ref_bind:
4803 if (c->need_temporary_p)
4805 if (complain & tf_error)
4806 error_at (loc, "initializing %qH with %qI in converted "
4807 "constant expression does not bind directly",
4808 type, next_conversion (c)->type);
4809 conv = NULL;
4811 break;
4813 case ck_base:
4814 case ck_pmem:
4815 case ck_ptr:
4816 case ck_std:
4817 t = next_conversion (c)->type;
4818 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t)
4819 && INTEGRAL_OR_ENUMERATION_TYPE_P (type))
4820 /* Integral promotion or conversion. */
4821 break;
4822 if (NULLPTR_TYPE_P (t))
4823 /* Conversion from nullptr to pointer or pointer-to-member. */
4824 break;
4826 if (complain & tf_error)
4827 error_at (loc, "conversion from %qH to %qI in a "
4828 "converted constant expression", t, type);
4829 /* fall through. */
4831 default:
4832 conv = NULL;
4833 break;
4837 /* Avoid confusing convert_nontype_argument by introducing
4838 a redundant conversion to the same reference type. */
4839 if (conv && conv->kind == ck_ref_bind
4840 && REFERENCE_REF_P (expr))
4842 tree ref = TREE_OPERAND (expr, 0);
4843 if (same_type_p (type, TREE_TYPE (ref)))
4844 return ref;
4847 if (conv)
4849 /* Don't copy a class in a template. */
4850 if (CLASS_TYPE_P (type) && conv->kind == ck_rvalue
4851 && processing_template_decl)
4852 conv = next_conversion (conv);
4854 /* Issuing conversion warnings for value-dependent expressions is
4855 likely too noisy. */
4856 warning_sentinel w (warn_conversion);
4857 conv->check_narrowing = true;
4858 conv->check_narrowing_const_only = true;
4859 expr = convert_like (conv, expr, complain);
4861 else
4863 if (complain & tf_error)
4864 implicit_conversion_error (loc, type, expr);
4865 expr = error_mark_node;
4868 return expr;
4871 /* Subroutine of convert_nontype_argument.
4873 EXPR is an expression used in a context that requires a converted
4874 constant-expression, such as a template non-type parameter. Do any
4875 necessary conversions (that are permitted for converted
4876 constant-expressions) to convert it to the desired type.
4878 This function doesn't consider explicit conversion functions. If
4879 you mean to use "a contextually converted constant expression of type
4880 bool", use build_converted_constant_bool_expr.
4882 If conversion is successful, returns the converted expression;
4883 otherwise, returns error_mark_node. */
4885 tree
4886 build_converted_constant_expr (tree type, tree expr, tsubst_flags_t complain)
4888 return build_converted_constant_expr_internal (type, expr, LOOKUP_IMPLICIT,
4889 complain);
4892 /* Used to create "a contextually converted constant expression of type
4893 bool". This differs from build_converted_constant_expr in that it
4894 also considers explicit conversion functions. */
4896 tree
4897 build_converted_constant_bool_expr (tree expr, tsubst_flags_t complain)
4899 return build_converted_constant_expr_internal (boolean_type_node, expr,
4900 LOOKUP_NORMAL, complain);
4903 /* Do any initial processing on the arguments to a function call. */
4905 vec<tree, va_gc> *
4906 resolve_args (vec<tree, va_gc> *args, tsubst_flags_t complain)
4908 unsigned int ix;
4909 tree arg;
4911 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
4913 if (error_operand_p (arg))
4914 return NULL;
4915 else if (VOID_TYPE_P (TREE_TYPE (arg)))
4917 if (complain & tf_error)
4918 error_at (cp_expr_loc_or_input_loc (arg),
4919 "invalid use of void expression");
4920 return NULL;
4922 else if (invalid_nonstatic_memfn_p (EXPR_LOCATION (arg), arg, complain))
4923 return NULL;
4925 /* Force auto deduction now. Omit tf_warning to avoid redundant
4926 deprecated warning on deprecated-14.C. */
4927 if (!mark_single_function (arg, complain & ~tf_warning))
4928 return NULL;
4930 return args;
4933 /* Perform overload resolution on FN, which is called with the ARGS.
4935 Return the candidate function selected by overload resolution, or
4936 NULL if the event that overload resolution failed. In the case
4937 that overload resolution fails, *CANDIDATES will be the set of
4938 candidates considered, and ANY_VIABLE_P will be set to true or
4939 false to indicate whether or not any of the candidates were
4940 viable.
4942 The ARGS should already have gone through RESOLVE_ARGS before this
4943 function is called. */
4945 static struct z_candidate *
4946 perform_overload_resolution (tree fn,
4947 const vec<tree, va_gc> *args,
4948 struct z_candidate **candidates,
4949 bool *any_viable_p, tsubst_flags_t complain)
4951 struct z_candidate *cand;
4952 tree explicit_targs;
4953 int template_only;
4955 auto_cond_timevar tv (TV_OVERLOAD);
4957 explicit_targs = NULL_TREE;
4958 template_only = 0;
4960 *candidates = NULL;
4961 *any_viable_p = true;
4963 /* Check FN. */
4964 gcc_assert (OVL_P (fn) || TREE_CODE (fn) == TEMPLATE_ID_EXPR);
4966 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4968 explicit_targs = TREE_OPERAND (fn, 1);
4969 fn = TREE_OPERAND (fn, 0);
4970 template_only = 1;
4973 /* Add the various candidate functions. */
4974 add_candidates (fn, NULL_TREE, args, NULL_TREE,
4975 explicit_targs, template_only,
4976 /*conversion_path=*/NULL_TREE,
4977 /*access_path=*/NULL_TREE,
4978 LOOKUP_NORMAL,
4979 candidates, complain);
4981 *candidates = splice_viable (*candidates, false, any_viable_p);
4982 if (*any_viable_p)
4983 cand = tourney (*candidates, complain);
4984 else
4985 cand = NULL;
4987 return cand;
4990 /* Print an error message about being unable to build a call to FN with
4991 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4992 be located; CANDIDATES is a possibly empty list of such
4993 functions. */
4995 static void
4996 print_error_for_call_failure (tree fn, const vec<tree, va_gc> *args,
4997 struct z_candidate *candidates)
4999 tree targs = NULL_TREE;
5000 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
5002 targs = TREE_OPERAND (fn, 1);
5003 fn = TREE_OPERAND (fn, 0);
5005 tree name = OVL_NAME (fn);
5006 location_t loc = location_of (name);
5007 if (targs)
5008 name = lookup_template_function (name, targs);
5010 auto_diagnostic_group d;
5011 if (!any_strictly_viable (candidates))
5012 error_at (loc, "no matching function for call to %<%D(%A)%>",
5013 name, build_tree_list_vec (args));
5014 else
5015 error_at (loc, "call of overloaded %<%D(%A)%> is ambiguous",
5016 name, build_tree_list_vec (args));
5017 if (candidates)
5018 print_z_candidates (loc, candidates);
5021 /* Perform overload resolution on the set of deduction guides DGUIDES
5022 using ARGS. Returns the selected deduction guide, or error_mark_node
5023 if overload resolution fails. */
5025 tree
5026 perform_dguide_overload_resolution (tree dguides, const vec<tree, va_gc> *args,
5027 tsubst_flags_t complain)
5029 z_candidate *candidates;
5030 bool any_viable_p;
5031 tree result;
5033 gcc_assert (deduction_guide_p (OVL_FIRST (dguides)));
5035 conversion_obstack_sentinel cos;
5037 z_candidate *cand = perform_overload_resolution (dguides, args, &candidates,
5038 &any_viable_p, complain);
5039 if (!cand)
5041 if (complain & tf_error)
5042 print_error_for_call_failure (dguides, args, candidates);
5043 result = error_mark_node;
5045 else
5046 result = cand->fn;
5048 return result;
5051 /* Return an expression for a call to FN (a namespace-scope function,
5052 or a static member function) with the ARGS. This may change
5053 ARGS. */
5055 tree
5056 build_new_function_call (tree fn, vec<tree, va_gc> **args,
5057 tsubst_flags_t complain)
5059 struct z_candidate *candidates, *cand;
5060 bool any_viable_p;
5061 tree result;
5063 if (args != NULL && *args != NULL)
5065 *args = resolve_args (*args, complain);
5066 if (*args == NULL)
5067 return error_mark_node;
5070 if (flag_tm)
5071 tm_malloc_replacement (fn);
5073 conversion_obstack_sentinel cos;
5075 cand = perform_overload_resolution (fn, *args, &candidates, &any_viable_p,
5076 complain);
5078 if (!cand)
5080 if (complain & tf_error)
5082 // If there is a single (non-viable) function candidate,
5083 // let the error be diagnosed by cp_build_function_call_vec.
5084 if (!any_viable_p && candidates && ! candidates->next
5085 && TREE_CODE (candidates->fn) == FUNCTION_DECL
5086 /* A template-id callee consisting of a single (ignored)
5087 non-template candidate needs to be diagnosed the
5088 ordinary way. */
5089 && (TREE_CODE (fn) != TEMPLATE_ID_EXPR
5090 || candidates->template_decl))
5091 return cp_build_function_call_vec (candidates->fn, args, complain);
5093 // Otherwise, emit notes for non-viable candidates.
5094 print_error_for_call_failure (fn, *args, candidates);
5096 result = error_mark_node;
5098 else
5100 result = build_over_call (cand, LOOKUP_NORMAL, complain);
5103 if (flag_coroutines
5104 && result
5105 && TREE_CODE (result) == CALL_EXPR
5106 && DECL_BUILT_IN_CLASS (TREE_OPERAND (CALL_EXPR_FN (result), 0))
5107 == BUILT_IN_NORMAL)
5108 result = coro_validate_builtin_call (result);
5110 return result;
5113 /* Build a call to a global operator new. FNNAME is the name of the
5114 operator (either "operator new" or "operator new[]") and ARGS are
5115 the arguments provided. This may change ARGS. *SIZE points to the
5116 total number of bytes required by the allocation, and is updated if
5117 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
5118 be used. If this function determines that no cookie should be
5119 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
5120 is not NULL_TREE, it is evaluated before calculating the final
5121 array size, and if it fails, the array size is replaced with
5122 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
5123 is non-NULL, it will be set, upon return, to the allocation
5124 function called. */
5126 tree
5127 build_operator_new_call (tree fnname, vec<tree, va_gc> **args,
5128 tree *size, tree *cookie_size,
5129 tree align_arg, tree size_check,
5130 tree *fn, tsubst_flags_t complain)
5132 tree original_size = *size;
5133 tree fns;
5134 struct z_candidate *candidates;
5135 struct z_candidate *cand = NULL;
5136 bool any_viable_p;
5138 if (fn)
5139 *fn = NULL_TREE;
5140 /* Set to (size_t)-1 if the size check fails. */
5141 if (size_check != NULL_TREE)
5143 tree errval = TYPE_MAX_VALUE (sizetype);
5144 if (cxx_dialect >= cxx11 && flag_exceptions)
5145 errval = throw_bad_array_new_length ();
5146 *size = fold_build3 (COND_EXPR, sizetype, size_check,
5147 original_size, errval);
5149 vec_safe_insert (*args, 0, *size);
5150 *args = resolve_args (*args, complain);
5151 if (*args == NULL)
5152 return error_mark_node;
5154 conversion_obstack_sentinel cos;
5156 /* Based on:
5158 [expr.new]
5160 If this lookup fails to find the name, or if the allocated type
5161 is not a class type, the allocation function's name is looked
5162 up in the global scope.
5164 we disregard block-scope declarations of "operator new". */
5165 fns = lookup_qualified_name (global_namespace, fnname);
5167 if (align_arg)
5169 vec<tree, va_gc>* align_args
5170 = vec_copy_and_insert (*args, align_arg, 1);
5171 cand = perform_overload_resolution (fns, align_args, &candidates,
5172 &any_viable_p, tf_none);
5173 if (cand)
5174 *args = align_args;
5175 /* If no aligned allocation function matches, try again without the
5176 alignment. */
5179 /* Figure out what function is being called. */
5180 if (!cand)
5181 cand = perform_overload_resolution (fns, *args, &candidates, &any_viable_p,
5182 complain);
5184 /* If no suitable function could be found, issue an error message
5185 and give up. */
5186 if (!cand)
5188 if (complain & tf_error)
5189 print_error_for_call_failure (fns, *args, candidates);
5190 return error_mark_node;
5193 /* If a cookie is required, add some extra space. Whether
5194 or not a cookie is required cannot be determined until
5195 after we know which function was called. */
5196 if (*cookie_size)
5198 bool use_cookie = true;
5199 tree arg_types;
5201 arg_types = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
5202 /* Skip the size_t parameter. */
5203 arg_types = TREE_CHAIN (arg_types);
5204 /* Check the remaining parameters (if any). */
5205 if (arg_types
5206 && TREE_CHAIN (arg_types) == void_list_node
5207 && same_type_p (TREE_VALUE (arg_types),
5208 ptr_type_node))
5209 use_cookie = false;
5210 /* If we need a cookie, adjust the number of bytes allocated. */
5211 if (use_cookie)
5213 /* Update the total size. */
5214 *size = size_binop (PLUS_EXPR, original_size, *cookie_size);
5215 if (size_check)
5217 /* Set to (size_t)-1 if the size check fails. */
5218 gcc_assert (size_check != NULL_TREE);
5219 *size = fold_build3 (COND_EXPR, sizetype, size_check,
5220 *size, TYPE_MAX_VALUE (sizetype));
5222 /* Update the argument list to reflect the adjusted size. */
5223 (**args)[0] = *size;
5225 else
5226 *cookie_size = NULL_TREE;
5229 /* Tell our caller which function we decided to call. */
5230 if (fn)
5231 *fn = cand->fn;
5233 /* Build the CALL_EXPR. */
5234 tree ret = build_over_call (cand, LOOKUP_NORMAL, complain);
5236 /* Set this flag for all callers of this function. In addition to
5237 new-expressions, this is called for allocating coroutine state; treat
5238 that as an implicit new-expression. */
5239 tree call = extract_call_expr (ret);
5240 if (TREE_CODE (call) == CALL_EXPR)
5241 CALL_FROM_NEW_OR_DELETE_P (call) = 1;
5243 return ret;
5246 /* Evaluate side-effects from OBJ before evaluating call
5247 to FN in RESULT expression.
5248 This is for expressions of the form `obj->fn(...)'
5249 where `fn' turns out to be a static member function and
5250 `obj' needs to be evaluated. `fn' could be also static operator[]
5251 or static operator(), in which cases the source expression
5252 would be `obj[...]' or `obj(...)'. */
5254 tree
5255 keep_unused_object_arg (tree result, tree obj, tree fn)
5257 if (result == NULL_TREE
5258 || result == error_mark_node
5259 || TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE
5260 || !TREE_SIDE_EFFECTS (obj))
5261 return result;
5263 /* But avoid the implicit lvalue-rvalue conversion when `obj' is
5264 volatile. */
5265 tree a = obj;
5266 if (TREE_THIS_VOLATILE (a))
5267 a = build_this (a);
5268 if (TREE_SIDE_EFFECTS (a))
5269 return cp_build_compound_expr (a, result, tf_error);
5270 return result;
5273 /* Build a new call to operator(). This may change ARGS. */
5275 tree
5276 build_op_call (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
5278 struct z_candidate *candidates = 0, *cand;
5279 tree fns, convs, first_mem_arg = NULL_TREE;
5280 bool any_viable_p;
5281 tree result = NULL_TREE;
5283 auto_cond_timevar tv (TV_OVERLOAD);
5285 obj = mark_lvalue_use (obj);
5287 if (error_operand_p (obj))
5288 return error_mark_node;
5290 tree type = TREE_TYPE (obj);
5292 obj = prep_operand (obj);
5294 if (TYPE_PTRMEMFUNC_P (type))
5296 if (complain & tf_error)
5297 /* It's no good looking for an overloaded operator() on a
5298 pointer-to-member-function. */
5299 error ("pointer-to-member function %qE cannot be called without "
5300 "an object; consider using %<.*%> or %<->*%>", obj);
5301 return error_mark_node;
5304 if (TYPE_BINFO (type))
5306 fns = lookup_fnfields (TYPE_BINFO (type), call_op_identifier, 1, complain);
5307 if (fns == error_mark_node)
5308 return error_mark_node;
5310 else
5311 fns = NULL_TREE;
5313 if (args != NULL && *args != NULL)
5315 *args = resolve_args (*args, complain);
5316 if (*args == NULL)
5317 return error_mark_node;
5320 conversion_obstack_sentinel cos;
5322 if (fns)
5324 first_mem_arg = obj;
5326 add_candidates (BASELINK_FUNCTIONS (fns),
5327 first_mem_arg, *args, NULL_TREE,
5328 NULL_TREE, false,
5329 BASELINK_BINFO (fns), BASELINK_ACCESS_BINFO (fns),
5330 LOOKUP_NORMAL, &candidates, complain);
5333 bool any_call_ops = candidates != nullptr;
5335 convs = lookup_conversions (type);
5337 for (; convs; convs = TREE_CHAIN (convs))
5339 tree totype = TREE_TYPE (convs);
5341 if (TYPE_PTRFN_P (totype)
5342 || TYPE_REFFN_P (totype)
5343 || (TYPE_REF_P (totype)
5344 && TYPE_PTRFN_P (TREE_TYPE (totype))))
5345 for (tree fn : ovl_range (TREE_VALUE (convs)))
5347 if (DECL_NONCONVERTING_P (fn))
5348 continue;
5350 if (TREE_CODE (fn) == TEMPLATE_DECL)
5352 /* Making this work broke PR 71117 and 85118, so until the
5353 committee resolves core issue 2189, let's disable this
5354 candidate if there are any call operators. */
5355 if (any_call_ops)
5356 continue;
5358 add_template_conv_candidate
5359 (&candidates, fn, obj, *args, totype,
5360 /*access_path=*/NULL_TREE,
5361 /*conversion_path=*/NULL_TREE, complain);
5363 else
5364 add_conv_candidate (&candidates, fn, obj,
5365 *args, /*conversion_path=*/NULL_TREE,
5366 /*access_path=*/NULL_TREE, complain);
5370 /* Be strict here because if we choose a bad conversion candidate, the
5371 errors we get won't mention the call context. */
5372 candidates = splice_viable (candidates, true, &any_viable_p);
5373 if (!any_viable_p)
5375 if (complain & tf_error)
5377 auto_diagnostic_group d;
5378 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj),
5379 build_tree_list_vec (*args));
5380 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
5382 result = error_mark_node;
5384 else
5386 cand = tourney (candidates, complain);
5387 if (cand == 0)
5389 if (complain & tf_error)
5391 auto_diagnostic_group d;
5392 error ("call of %<(%T) (%A)%> is ambiguous",
5393 TREE_TYPE (obj), build_tree_list_vec (*args));
5394 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
5396 result = error_mark_node;
5398 else if (TREE_CODE (cand->fn) == FUNCTION_DECL
5399 && DECL_OVERLOADED_OPERATOR_P (cand->fn)
5400 && DECL_OVERLOADED_OPERATOR_IS (cand->fn, CALL_EXPR))
5402 result = build_over_call (cand, LOOKUP_NORMAL, complain);
5403 /* In an expression of the form `a()' where cand->fn
5404 which is operator() turns out to be a static member function,
5405 `a' is none-the-less evaluated. */
5406 result = keep_unused_object_arg (result, obj, cand->fn);
5408 else
5410 if (TREE_CODE (cand->fn) == FUNCTION_DECL)
5411 obj = convert_like_with_context (cand->convs[0], obj, cand->fn,
5412 -1, complain);
5413 else
5415 gcc_checking_assert (TYPE_P (cand->fn));
5416 obj = convert_like (cand->convs[0], obj, complain);
5418 obj = convert_from_reference (obj);
5419 result = cp_build_function_call_vec (obj, args, complain);
5423 return result;
5426 /* Called by op_error to prepare format strings suitable for the error
5427 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
5428 and a suffix (controlled by NTYPES). */
5430 static const char *
5431 op_error_string (const char *errmsg, int ntypes, bool match)
5433 const char *msg;
5435 const char *msgp = concat (match ? G_("ambiguous overload for ")
5436 : G_("no match for "), errmsg, NULL);
5438 if (ntypes == 3)
5439 msg = concat (msgp, G_(" (operand types are %qT, %qT, and %qT)"), NULL);
5440 else if (ntypes == 2)
5441 msg = concat (msgp, G_(" (operand types are %qT and %qT)"), NULL);
5442 else
5443 msg = concat (msgp, G_(" (operand type is %qT)"), NULL);
5445 return msg;
5448 static void
5449 op_error (const op_location_t &loc,
5450 enum tree_code code, enum tree_code code2,
5451 tree arg1, tree arg2, tree arg3, bool match)
5453 bool assop = code == MODIFY_EXPR;
5454 const char *opname = OVL_OP_INFO (assop, assop ? code2 : code)->name;
5456 switch (code)
5458 case COND_EXPR:
5459 if (flag_diagnostics_show_caret)
5460 error_at (loc, op_error_string (G_("ternary %<operator?:%>"),
5461 3, match),
5462 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
5463 else
5464 error_at (loc, op_error_string (G_("ternary %<operator?:%> "
5465 "in %<%E ? %E : %E%>"), 3, match),
5466 arg1, arg2, arg3,
5467 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
5468 break;
5470 case POSTINCREMENT_EXPR:
5471 case POSTDECREMENT_EXPR:
5472 if (flag_diagnostics_show_caret)
5473 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
5474 opname, TREE_TYPE (arg1));
5475 else
5476 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
5477 1, match),
5478 opname, arg1, opname, TREE_TYPE (arg1));
5479 break;
5481 case ARRAY_REF:
5482 if (flag_diagnostics_show_caret)
5483 error_at (loc, op_error_string (G_("%<operator[]%>"), 2, match),
5484 TREE_TYPE (arg1), TREE_TYPE (arg2));
5485 else
5486 error_at (loc, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
5487 2, match),
5488 arg1, arg2, TREE_TYPE (arg1), TREE_TYPE (arg2));
5489 break;
5491 case REALPART_EXPR:
5492 case IMAGPART_EXPR:
5493 if (flag_diagnostics_show_caret)
5494 error_at (loc, op_error_string (G_("%qs"), 1, match),
5495 opname, TREE_TYPE (arg1));
5496 else
5497 error_at (loc, op_error_string (G_("%qs in %<%s %E%>"), 1, match),
5498 opname, opname, arg1, TREE_TYPE (arg1));
5499 break;
5501 case CO_AWAIT_EXPR:
5502 if (flag_diagnostics_show_caret)
5503 error_at (loc, op_error_string (G_("%<operator %s%>"), 1, match),
5504 opname, TREE_TYPE (arg1));
5505 else
5506 error_at (loc, op_error_string (G_("%<operator %s%> in %<%s%E%>"),
5507 1, match),
5508 opname, opname, arg1, TREE_TYPE (arg1));
5509 break;
5511 default:
5512 if (arg2)
5513 if (flag_diagnostics_show_caret)
5515 binary_op_rich_location richloc (loc, arg1, arg2, true);
5516 error_at (&richloc,
5517 op_error_string (G_("%<operator%s%>"), 2, match),
5518 opname, TREE_TYPE (arg1), TREE_TYPE (arg2));
5520 else
5521 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
5522 2, match),
5523 opname, arg1, opname, arg2,
5524 TREE_TYPE (arg1), TREE_TYPE (arg2));
5525 else
5526 if (flag_diagnostics_show_caret)
5527 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
5528 opname, TREE_TYPE (arg1));
5529 else
5530 error_at (loc, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
5531 1, match),
5532 opname, opname, arg1, TREE_TYPE (arg1));
5533 break;
5537 /* Return the implicit conversion sequence that could be used to
5538 convert E1 to E2 in [expr.cond]. */
5540 static conversion *
5541 conditional_conversion (tree e1, tree e2, tsubst_flags_t complain)
5543 tree t1 = non_reference (TREE_TYPE (e1));
5544 tree t2 = non_reference (TREE_TYPE (e2));
5545 conversion *conv;
5546 bool good_base;
5548 /* [expr.cond]
5550 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
5551 implicitly converted (clause _conv_) to the type "lvalue reference to
5552 T2", subject to the constraint that in the conversion the
5553 reference must bind directly (_dcl.init.ref_) to an lvalue.
5555 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
5556 implicitly converted to the type "rvalue reference to T2", subject to
5557 the constraint that the reference must bind directly. */
5558 if (glvalue_p (e2))
5560 tree rtype = cp_build_reference_type (t2, !lvalue_p (e2));
5561 conv = implicit_conversion (rtype,
5564 /*c_cast_p=*/false,
5565 LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND
5566 |LOOKUP_ONLYCONVERTING,
5567 complain);
5568 if (conv && !conv->bad_p)
5569 return conv;
5572 /* If E2 is a prvalue or if neither of the conversions above can be done
5573 and at least one of the operands has (possibly cv-qualified) class
5574 type: */
5575 if (!CLASS_TYPE_P (t1) && !CLASS_TYPE_P (t2))
5576 return NULL;
5578 /* [expr.cond]
5580 If E1 and E2 have class type, and the underlying class types are
5581 the same or one is a base class of the other: E1 can be converted
5582 to match E2 if the class of T2 is the same type as, or a base
5583 class of, the class of T1, and the cv-qualification of T2 is the
5584 same cv-qualification as, or a greater cv-qualification than, the
5585 cv-qualification of T1. If the conversion is applied, E1 is
5586 changed to an rvalue of type T2 that still refers to the original
5587 source class object (or the appropriate subobject thereof). */
5588 if (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
5589 && ((good_base = DERIVED_FROM_P (t2, t1)) || DERIVED_FROM_P (t1, t2)))
5591 if (good_base && at_least_as_qualified_p (t2, t1))
5593 conv = build_identity_conv (t1, e1);
5594 if (!same_type_p (TYPE_MAIN_VARIANT (t1),
5595 TYPE_MAIN_VARIANT (t2)))
5596 conv = build_conv (ck_base, t2, conv);
5597 else
5598 conv = build_conv (ck_rvalue, t2, conv);
5599 return conv;
5601 else
5602 return NULL;
5604 else
5605 /* [expr.cond]
5607 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
5608 converted to the type that expression E2 would have if E2 were
5609 converted to an rvalue (or the type it has, if E2 is an rvalue). */
5610 return implicit_conversion (t2, t1, e1, /*c_cast_p=*/false,
5611 LOOKUP_IMPLICIT, complain);
5614 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
5615 arguments to the conditional expression. */
5617 tree
5618 build_conditional_expr (const op_location_t &loc,
5619 tree arg1, tree arg2, tree arg3,
5620 tsubst_flags_t complain)
5622 tree arg2_type;
5623 tree arg3_type;
5624 tree result = NULL_TREE;
5625 tree result_type = NULL_TREE;
5626 tree semantic_result_type = NULL_TREE;
5627 bool is_glvalue = true;
5628 struct z_candidate *candidates = 0;
5629 struct z_candidate *cand;
5630 tree orig_arg2, orig_arg3;
5632 auto_cond_timevar tv (TV_OVERLOAD);
5634 /* As a G++ extension, the second argument to the conditional can be
5635 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
5636 c'.) If the second operand is omitted, make sure it is
5637 calculated only once. */
5638 if (!arg2)
5640 if (complain & tf_error)
5641 pedwarn (loc, OPT_Wpedantic,
5642 "ISO C++ forbids omitting the middle term of "
5643 "a %<?:%> expression");
5645 if ((complain & tf_warning) && !truth_value_p (TREE_CODE (arg1)))
5646 warn_for_omitted_condop (loc, arg1);
5648 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
5649 if (glvalue_p (arg1))
5651 arg1 = cp_stabilize_reference (arg1);
5652 arg2 = arg1 = prevent_lifetime_extension (arg1);
5654 else if (TREE_CODE (arg1) == TARGET_EXPR)
5655 /* arg1 can't be a prvalue result of the conditional
5656 expression, since it needs to be materialized for the
5657 conversion to bool, so treat it as an xvalue in arg2. */
5658 arg2 = move (TARGET_EXPR_SLOT (arg1));
5659 else if (TREE_CODE (arg1) == EXCESS_PRECISION_EXPR)
5660 arg2 = arg1 = build1 (EXCESS_PRECISION_EXPR, TREE_TYPE (arg1),
5661 cp_save_expr (TREE_OPERAND (arg1, 0)));
5662 else
5663 arg2 = arg1 = cp_save_expr (arg1);
5666 /* If something has already gone wrong, just pass that fact up the
5667 tree. */
5668 if (error_operand_p (arg1)
5669 || error_operand_p (arg2)
5670 || error_operand_p (arg3))
5671 return error_mark_node;
5673 conversion_obstack_sentinel cos;
5675 orig_arg2 = arg2;
5676 orig_arg3 = arg3;
5678 if (gnu_vector_type_p (TREE_TYPE (arg1))
5679 && VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1)))
5681 tree arg1_type = TREE_TYPE (arg1);
5683 /* If arg1 is another cond_expr choosing between -1 and 0,
5684 then we can use its comparison. It may help to avoid
5685 additional comparison, produce more accurate diagnostics
5686 and enables folding. */
5687 if (TREE_CODE (arg1) == VEC_COND_EXPR
5688 && integer_minus_onep (TREE_OPERAND (arg1, 1))
5689 && integer_zerop (TREE_OPERAND (arg1, 2)))
5690 arg1 = TREE_OPERAND (arg1, 0);
5692 arg1 = force_rvalue (arg1, complain);
5693 arg2 = force_rvalue (arg2, complain);
5694 arg3 = force_rvalue (arg3, complain);
5696 /* force_rvalue can return error_mark on valid arguments. */
5697 if (error_operand_p (arg1)
5698 || error_operand_p (arg2)
5699 || error_operand_p (arg3))
5700 return error_mark_node;
5702 arg2_type = TREE_TYPE (arg2);
5703 arg3_type = TREE_TYPE (arg3);
5705 if (!VECTOR_TYPE_P (arg2_type)
5706 && !VECTOR_TYPE_P (arg3_type))
5708 /* Rely on the error messages of the scalar version. */
5709 tree scal = build_conditional_expr (loc, integer_one_node,
5710 orig_arg2, orig_arg3, complain);
5711 if (scal == error_mark_node)
5712 return error_mark_node;
5713 tree stype = TREE_TYPE (scal);
5714 tree ctype = TREE_TYPE (arg1_type);
5715 if (TYPE_SIZE (stype) != TYPE_SIZE (ctype)
5716 || (!INTEGRAL_TYPE_P (stype) && !SCALAR_FLOAT_TYPE_P (stype)))
5718 if (complain & tf_error)
5719 error_at (loc, "inferred scalar type %qT is not an integer or "
5720 "floating-point type of the same size as %qT", stype,
5721 COMPARISON_CLASS_P (arg1)
5722 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1, 0)))
5723 : ctype);
5724 return error_mark_node;
5727 tree vtype = build_opaque_vector_type (stype,
5728 TYPE_VECTOR_SUBPARTS (arg1_type));
5729 /* We could pass complain & tf_warning to unsafe_conversion_p,
5730 but the warnings (like Wsign-conversion) have already been
5731 given by the scalar build_conditional_expr_1. We still check
5732 unsafe_conversion_p to forbid truncating long long -> float. */
5733 if (unsafe_conversion_p (stype, arg2, NULL_TREE, false))
5735 if (complain & tf_error)
5736 error_at (loc, "conversion of scalar %qH to vector %qI "
5737 "involves truncation", arg2_type, vtype);
5738 return error_mark_node;
5740 if (unsafe_conversion_p (stype, arg3, NULL_TREE, false))
5742 if (complain & tf_error)
5743 error_at (loc, "conversion of scalar %qH to vector %qI "
5744 "involves truncation", arg3_type, vtype);
5745 return error_mark_node;
5748 arg2 = cp_convert (stype, arg2, complain);
5749 arg2 = save_expr (arg2);
5750 arg2 = build_vector_from_val (vtype, arg2);
5751 arg2_type = vtype;
5752 arg3 = cp_convert (stype, arg3, complain);
5753 arg3 = save_expr (arg3);
5754 arg3 = build_vector_from_val (vtype, arg3);
5755 arg3_type = vtype;
5758 if ((gnu_vector_type_p (arg2_type) && !VECTOR_TYPE_P (arg3_type))
5759 || (gnu_vector_type_p (arg3_type) && !VECTOR_TYPE_P (arg2_type)))
5761 enum stv_conv convert_flag =
5762 scalar_to_vector (loc, VEC_COND_EXPR, arg2, arg3,
5763 complain & tf_error);
5765 switch (convert_flag)
5767 case stv_error:
5768 return error_mark_node;
5769 case stv_firstarg:
5771 arg2 = save_expr (arg2);
5772 arg2 = convert (TREE_TYPE (arg3_type), arg2);
5773 arg2 = build_vector_from_val (arg3_type, arg2);
5774 arg2_type = TREE_TYPE (arg2);
5775 break;
5777 case stv_secondarg:
5779 arg3 = save_expr (arg3);
5780 arg3 = convert (TREE_TYPE (arg2_type), arg3);
5781 arg3 = build_vector_from_val (arg2_type, arg3);
5782 arg3_type = TREE_TYPE (arg3);
5783 break;
5785 default:
5786 break;
5790 if (!gnu_vector_type_p (arg2_type)
5791 || !gnu_vector_type_p (arg3_type)
5792 || !same_type_p (arg2_type, arg3_type)
5793 || maybe_ne (TYPE_VECTOR_SUBPARTS (arg1_type),
5794 TYPE_VECTOR_SUBPARTS (arg2_type))
5795 || TYPE_SIZE (arg1_type) != TYPE_SIZE (arg2_type))
5797 if (complain & tf_error)
5798 error_at (loc,
5799 "incompatible vector types in conditional expression: "
5800 "%qT, %qT and %qT", TREE_TYPE (arg1),
5801 TREE_TYPE (orig_arg2), TREE_TYPE (orig_arg3));
5802 return error_mark_node;
5805 if (!COMPARISON_CLASS_P (arg1))
5807 tree cmp_type = truth_type_for (arg1_type);
5808 arg1 = build2 (NE_EXPR, cmp_type, arg1, build_zero_cst (arg1_type));
5810 return build3_loc (loc, VEC_COND_EXPR, arg2_type, arg1, arg2, arg3);
5813 /* [expr.cond]
5815 The first expression is implicitly converted to bool (clause
5816 _conv_). */
5817 arg1 = perform_implicit_conversion_flags (boolean_type_node, arg1, complain,
5818 LOOKUP_NORMAL);
5819 if (error_operand_p (arg1))
5820 return error_mark_node;
5822 arg2_type = unlowered_expr_type (arg2);
5823 arg3_type = unlowered_expr_type (arg3);
5825 if ((TREE_CODE (arg2) == EXCESS_PRECISION_EXPR
5826 || TREE_CODE (arg3) == EXCESS_PRECISION_EXPR)
5827 && (TREE_CODE (arg2_type) == INTEGER_TYPE
5828 || SCALAR_FLOAT_TYPE_P (arg2_type)
5829 || TREE_CODE (arg2_type) == COMPLEX_TYPE)
5830 && (TREE_CODE (arg3_type) == INTEGER_TYPE
5831 || SCALAR_FLOAT_TYPE_P (arg3_type)
5832 || TREE_CODE (arg3_type) == COMPLEX_TYPE))
5834 semantic_result_type
5835 = type_after_usual_arithmetic_conversions (arg2_type, arg3_type);
5836 if (semantic_result_type == error_mark_node)
5838 tree t1 = arg2_type;
5839 tree t2 = arg3_type;
5840 if (TREE_CODE (t1) == COMPLEX_TYPE)
5841 t1 = TREE_TYPE (t1);
5842 if (TREE_CODE (t2) == COMPLEX_TYPE)
5843 t2 = TREE_TYPE (t2);
5844 gcc_checking_assert (SCALAR_FLOAT_TYPE_P (t1)
5845 && SCALAR_FLOAT_TYPE_P (t2)
5846 && (extended_float_type_p (t1)
5847 || extended_float_type_p (t2))
5848 && cp_compare_floating_point_conversion_ranks
5849 (t1, t2) == 3);
5850 if (complain & tf_error)
5851 error_at (loc, "operands to %<?:%> of types %qT and %qT "
5852 "have unordered conversion rank",
5853 arg2_type, arg3_type);
5854 return error_mark_node;
5856 if (TREE_CODE (arg2) == EXCESS_PRECISION_EXPR)
5858 arg2 = TREE_OPERAND (arg2, 0);
5859 arg2_type = TREE_TYPE (arg2);
5861 if (TREE_CODE (arg3) == EXCESS_PRECISION_EXPR)
5863 arg3 = TREE_OPERAND (arg3, 0);
5864 arg3_type = TREE_TYPE (arg3);
5868 /* [expr.cond]
5870 If either the second or the third operand has type (possibly
5871 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
5872 array-to-pointer (_conv.array_), and function-to-pointer
5873 (_conv.func_) standard conversions are performed on the second
5874 and third operands. */
5875 if (VOID_TYPE_P (arg2_type) || VOID_TYPE_P (arg3_type))
5877 /* 'void' won't help in resolving an overloaded expression on the
5878 other side, so require it to resolve by itself. */
5879 if (arg2_type == unknown_type_node)
5881 arg2 = resolve_nondeduced_context_or_error (arg2, complain);
5882 arg2_type = TREE_TYPE (arg2);
5884 if (arg3_type == unknown_type_node)
5886 arg3 = resolve_nondeduced_context_or_error (arg3, complain);
5887 arg3_type = TREE_TYPE (arg3);
5890 /* [expr.cond]
5892 One of the following shall hold:
5894 --The second or the third operand (but not both) is a
5895 throw-expression (_except.throw_); the result is of the type
5896 and value category of the other.
5898 --Both the second and the third operands have type void; the
5899 result is of type void and is a prvalue. */
5900 if (TREE_CODE (arg2) == THROW_EXPR
5901 && TREE_CODE (arg3) != THROW_EXPR)
5903 result_type = arg3_type;
5904 is_glvalue = glvalue_p (arg3);
5906 else if (TREE_CODE (arg2) != THROW_EXPR
5907 && TREE_CODE (arg3) == THROW_EXPR)
5909 result_type = arg2_type;
5910 is_glvalue = glvalue_p (arg2);
5912 else if (VOID_TYPE_P (arg2_type) && VOID_TYPE_P (arg3_type))
5914 result_type = void_type_node;
5915 is_glvalue = false;
5917 else
5919 if (complain & tf_error)
5921 if (VOID_TYPE_P (arg2_type))
5922 error_at (cp_expr_loc_or_loc (arg3, loc),
5923 "second operand to the conditional operator "
5924 "is of type %<void%>, but the third operand is "
5925 "neither a throw-expression nor of type %<void%>");
5926 else
5927 error_at (cp_expr_loc_or_loc (arg2, loc),
5928 "third operand to the conditional operator "
5929 "is of type %<void%>, but the second operand is "
5930 "neither a throw-expression nor of type %<void%>");
5932 return error_mark_node;
5935 goto valid_operands;
5937 /* [expr.cond]
5939 Otherwise, if the second and third operand have different types,
5940 and either has (possibly cv-qualified) class type, or if both are
5941 glvalues of the same value category and the same type except for
5942 cv-qualification, an attempt is made to convert each of those operands
5943 to the type of the other. */
5944 else if (!same_type_p (arg2_type, arg3_type)
5945 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)
5946 || (same_type_ignoring_top_level_qualifiers_p (arg2_type,
5947 arg3_type)
5948 && glvalue_p (arg2) && glvalue_p (arg3)
5949 && lvalue_p (arg2) == lvalue_p (arg3))))
5951 conversion *conv2;
5952 conversion *conv3;
5953 bool converted = false;
5955 conv2 = conditional_conversion (arg2, arg3, complain);
5956 conv3 = conditional_conversion (arg3, arg2, complain);
5958 /* [expr.cond]
5960 If both can be converted, or one can be converted but the
5961 conversion is ambiguous, the program is ill-formed. If
5962 neither can be converted, the operands are left unchanged and
5963 further checking is performed as described below. If exactly
5964 one conversion is possible, that conversion is applied to the
5965 chosen operand and the converted operand is used in place of
5966 the original operand for the remainder of this section. */
5967 if ((conv2 && !conv2->bad_p
5968 && conv3 && !conv3->bad_p)
5969 || (conv2 && conv2->kind == ck_ambig)
5970 || (conv3 && conv3->kind == ck_ambig))
5972 if (complain & tf_error)
5974 error_at (loc, "operands to %<?:%> have different types "
5975 "%qT and %qT",
5976 arg2_type, arg3_type);
5977 if (conv2 && !conv2->bad_p && conv3 && !conv3->bad_p)
5978 inform (loc, " and each type can be converted to the other");
5979 else if (conv2 && conv2->kind == ck_ambig)
5980 convert_like (conv2, arg2, complain);
5981 else
5982 convert_like (conv3, arg3, complain);
5984 result = error_mark_node;
5986 else if (conv2 && !conv2->bad_p)
5988 arg2 = convert_like (conv2, arg2, complain);
5989 arg2 = convert_from_reference (arg2);
5990 arg2_type = TREE_TYPE (arg2);
5991 /* Even if CONV2 is a valid conversion, the result of the
5992 conversion may be invalid. For example, if ARG3 has type
5993 "volatile X", and X does not have a copy constructor
5994 accepting a "volatile X&", then even if ARG2 can be
5995 converted to X, the conversion will fail. */
5996 if (error_operand_p (arg2))
5997 result = error_mark_node;
5998 converted = true;
6000 else if (conv3 && !conv3->bad_p)
6002 arg3 = convert_like (conv3, arg3, complain);
6003 arg3 = convert_from_reference (arg3);
6004 arg3_type = TREE_TYPE (arg3);
6005 if (error_operand_p (arg3))
6006 result = error_mark_node;
6007 converted = true;
6010 if (result)
6011 return result;
6013 /* If, after the conversion, both operands have class type,
6014 treat the cv-qualification of both operands as if it were the
6015 union of the cv-qualification of the operands.
6017 The standard is not clear about what to do in this
6018 circumstance. For example, if the first operand has type
6019 "const X" and the second operand has a user-defined
6020 conversion to "volatile X", what is the type of the second
6021 operand after this step? Making it be "const X" (matching
6022 the first operand) seems wrong, as that discards the
6023 qualification without actually performing a copy. Leaving it
6024 as "volatile X" seems wrong as that will result in the
6025 conditional expression failing altogether, even though,
6026 according to this step, the one operand could be converted to
6027 the type of the other. */
6028 if (converted
6029 && CLASS_TYPE_P (arg2_type)
6030 && cp_type_quals (arg2_type) != cp_type_quals (arg3_type))
6031 arg2_type = arg3_type =
6032 cp_build_qualified_type (arg2_type,
6033 cp_type_quals (arg2_type)
6034 | cp_type_quals (arg3_type));
6037 /* [expr.cond]
6039 If the second and third operands are glvalues of the same value
6040 category and have the same type, the result is of that type and
6041 value category. */
6042 if (((lvalue_p (arg2) && lvalue_p (arg3))
6043 || (xvalue_p (arg2) && xvalue_p (arg3)))
6044 && same_type_p (arg2_type, arg3_type))
6046 result_type = arg2_type;
6047 goto valid_operands;
6050 /* [expr.cond]
6052 Otherwise, the result is an rvalue. If the second and third
6053 operand do not have the same type, and either has (possibly
6054 cv-qualified) class type, overload resolution is used to
6055 determine the conversions (if any) to be applied to the operands
6056 (_over.match.oper_, _over.built_). */
6057 is_glvalue = false;
6058 if (!same_type_p (arg2_type, arg3_type)
6059 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
6061 releasing_vec args;
6062 conversion *conv;
6063 bool any_viable_p;
6065 /* Rearrange the arguments so that add_builtin_candidate only has
6066 to know about two args. In build_builtin_candidate, the
6067 arguments are unscrambled. */
6068 args->quick_push (arg2);
6069 args->quick_push (arg3);
6070 args->quick_push (arg1);
6071 add_builtin_candidates (&candidates,
6072 COND_EXPR,
6073 NOP_EXPR,
6074 ovl_op_identifier (false, COND_EXPR),
6075 args,
6076 LOOKUP_NORMAL, complain);
6078 /* [expr.cond]
6080 If the overload resolution fails, the program is
6081 ill-formed. */
6082 candidates = splice_viable (candidates, false, &any_viable_p);
6083 if (!any_viable_p)
6085 if (complain & tf_error)
6086 error_at (loc, "operands to %<?:%> have different types %qT and %qT",
6087 arg2_type, arg3_type);
6088 return error_mark_node;
6090 cand = tourney (candidates, complain);
6091 if (!cand)
6093 if (complain & tf_error)
6095 auto_diagnostic_group d;
6096 op_error (loc, COND_EXPR, NOP_EXPR, arg1, arg2, arg3, false);
6097 print_z_candidates (loc, candidates);
6099 return error_mark_node;
6102 /* [expr.cond]
6104 Otherwise, the conversions thus determined are applied, and
6105 the converted operands are used in place of the original
6106 operands for the remainder of this section. */
6107 conv = cand->convs[0];
6108 arg1 = convert_like (conv, arg1, complain);
6109 conv = cand->convs[1];
6110 arg2 = convert_like (conv, arg2, complain);
6111 arg2_type = TREE_TYPE (arg2);
6112 conv = cand->convs[2];
6113 arg3 = convert_like (conv, arg3, complain);
6114 arg3_type = TREE_TYPE (arg3);
6117 /* [expr.cond]
6119 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
6120 and function-to-pointer (_conv.func_) standard conversions are
6121 performed on the second and third operands.
6123 We need to force the lvalue-to-rvalue conversion here for class types,
6124 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
6125 that isn't wrapped with a TARGET_EXPR plays havoc with exception
6126 regions. */
6128 arg2 = force_rvalue (arg2, complain);
6129 if (!CLASS_TYPE_P (arg2_type))
6130 arg2_type = TREE_TYPE (arg2);
6132 arg3 = force_rvalue (arg3, complain);
6133 if (!CLASS_TYPE_P (arg3_type))
6134 arg3_type = TREE_TYPE (arg3);
6136 if (arg2 == error_mark_node || arg3 == error_mark_node)
6137 return error_mark_node;
6139 /* [expr.cond]
6141 After those conversions, one of the following shall hold:
6143 --The second and third operands have the same type; the result is of
6144 that type. */
6145 if (same_type_p (arg2_type, arg3_type))
6146 result_type = arg2_type;
6147 /* [expr.cond]
6149 --The second and third operands have arithmetic or enumeration
6150 type; the usual arithmetic conversions are performed to bring
6151 them to a common type, and the result is of that type. */
6152 else if ((ARITHMETIC_TYPE_P (arg2_type)
6153 || UNSCOPED_ENUM_P (arg2_type))
6154 && (ARITHMETIC_TYPE_P (arg3_type)
6155 || UNSCOPED_ENUM_P (arg3_type)))
6157 /* A conditional expression between a floating-point
6158 type and an integer type should convert the integer type to
6159 the evaluation format of the floating-point type, with
6160 possible excess precision. */
6161 tree eptype2 = arg2_type;
6162 tree eptype3 = arg3_type;
6163 tree eptype;
6164 if (ANY_INTEGRAL_TYPE_P (arg2_type)
6165 && (eptype = excess_precision_type (arg3_type)) != NULL_TREE)
6167 eptype3 = eptype;
6168 if (!semantic_result_type)
6169 semantic_result_type
6170 = type_after_usual_arithmetic_conversions (arg2_type, arg3_type);
6172 else if (ANY_INTEGRAL_TYPE_P (arg3_type)
6173 && (eptype = excess_precision_type (arg2_type)) != NULL_TREE)
6175 eptype2 = eptype;
6176 if (!semantic_result_type)
6177 semantic_result_type
6178 = type_after_usual_arithmetic_conversions (arg2_type, arg3_type);
6180 result_type = type_after_usual_arithmetic_conversions (eptype2,
6181 eptype3);
6182 if (result_type == error_mark_node)
6184 tree t1 = eptype2;
6185 tree t2 = eptype3;
6186 if (TREE_CODE (t1) == COMPLEX_TYPE)
6187 t1 = TREE_TYPE (t1);
6188 if (TREE_CODE (t2) == COMPLEX_TYPE)
6189 t2 = TREE_TYPE (t2);
6190 gcc_checking_assert (SCALAR_FLOAT_TYPE_P (t1)
6191 && SCALAR_FLOAT_TYPE_P (t2)
6192 && (extended_float_type_p (t1)
6193 || extended_float_type_p (t2))
6194 && cp_compare_floating_point_conversion_ranks
6195 (t1, t2) == 3);
6196 if (complain & tf_error)
6197 error_at (loc, "operands to %<?:%> of types %qT and %qT "
6198 "have unordered conversion rank",
6199 eptype2, eptype3);
6200 return error_mark_node;
6202 if (semantic_result_type == error_mark_node)
6204 tree t1 = arg2_type;
6205 tree t2 = arg3_type;
6206 if (TREE_CODE (t1) == COMPLEX_TYPE)
6207 t1 = TREE_TYPE (t1);
6208 if (TREE_CODE (t2) == COMPLEX_TYPE)
6209 t2 = TREE_TYPE (t2);
6210 gcc_checking_assert (SCALAR_FLOAT_TYPE_P (t1)
6211 && SCALAR_FLOAT_TYPE_P (t2)
6212 && (extended_float_type_p (t1)
6213 || extended_float_type_p (t2))
6214 && cp_compare_floating_point_conversion_ranks
6215 (t1, t2) == 3);
6216 if (complain & tf_error)
6217 error_at (loc, "operands to %<?:%> of types %qT and %qT "
6218 "have unordered conversion rank",
6219 arg2_type, arg3_type);
6220 return error_mark_node;
6223 if (complain & tf_warning)
6224 do_warn_double_promotion (result_type, arg2_type, arg3_type,
6225 "implicit conversion from %qH to %qI to "
6226 "match other result of conditional",
6227 loc);
6229 if (TREE_CODE (arg2_type) == ENUMERAL_TYPE
6230 && TREE_CODE (arg3_type) == ENUMERAL_TYPE)
6232 tree stripped_orig_arg2 = tree_strip_any_location_wrapper (orig_arg2);
6233 tree stripped_orig_arg3 = tree_strip_any_location_wrapper (orig_arg3);
6234 if (TREE_CODE (stripped_orig_arg2) == CONST_DECL
6235 && TREE_CODE (stripped_orig_arg3) == CONST_DECL
6236 && (DECL_CONTEXT (stripped_orig_arg2)
6237 == DECL_CONTEXT (stripped_orig_arg3)))
6238 /* Two enumerators from the same enumeration can have different
6239 types when the enumeration is still being defined. */;
6240 else if (complain & (cxx_dialect >= cxx26
6241 ? tf_warning_or_error : tf_warning))
6242 emit_diagnostic (cxx_dialect >= cxx26 ? DK_PEDWARN : DK_WARNING,
6243 loc, OPT_Wenum_compare, "enumerated mismatch "
6244 "in conditional expression: %qT vs %qT",
6245 arg2_type, arg3_type);
6246 else if (cxx_dialect >= cxx26)
6247 return error_mark_node;
6249 else if ((((complain & (cxx_dialect >= cxx26
6250 ? tf_warning_or_error : tf_warning))
6251 && warn_deprecated_enum_float_conv)
6252 || (cxx_dialect >= cxx26
6253 && (complain & tf_warning_or_error) == 0))
6254 && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE
6255 && SCALAR_FLOAT_TYPE_P (arg3_type))
6256 || (SCALAR_FLOAT_TYPE_P (arg2_type)
6257 && TREE_CODE (arg3_type) == ENUMERAL_TYPE)))
6259 if (cxx_dialect >= cxx26 && (complain & tf_warning_or_error) == 0)
6260 return error_mark_node;
6261 if (cxx_dialect >= cxx26 && TREE_CODE (arg2_type) == ENUMERAL_TYPE)
6262 pedwarn (loc, OPT_Wdeprecated_enum_float_conversion,
6263 "conditional expression between enumeration type "
6264 "%qT and floating-point type %qT", arg2_type, arg3_type);
6265 else if (cxx_dialect >= cxx26)
6266 pedwarn (loc, OPT_Wdeprecated_enum_float_conversion,
6267 "conditional expression between floating-point type "
6268 "%qT and enumeration type %qT", arg2_type, arg3_type);
6269 else if (TREE_CODE (arg2_type) == ENUMERAL_TYPE)
6270 warning_at (loc, OPT_Wdeprecated_enum_float_conversion,
6271 "conditional expression between enumeration type "
6272 "%qT and floating-point type %qT is deprecated",
6273 arg2_type, arg3_type);
6274 else
6275 warning_at (loc, OPT_Wdeprecated_enum_float_conversion,
6276 "conditional expression between floating-point "
6277 "type %qT and enumeration type %qT is deprecated",
6278 arg2_type, arg3_type);
6280 else if ((extra_warnings || warn_enum_conversion)
6281 && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE
6282 && !same_type_p (arg3_type, type_promotes_to (arg2_type)))
6283 || (TREE_CODE (arg3_type) == ENUMERAL_TYPE
6284 && !same_type_p (arg2_type,
6285 type_promotes_to (arg3_type)))))
6287 if (complain & tf_warning)
6289 enum opt_code opt = (warn_enum_conversion
6290 ? OPT_Wenum_conversion
6291 : OPT_Wextra);
6292 warning_at (loc, opt, "enumerated and "
6293 "non-enumerated type in conditional expression");
6297 arg2 = perform_implicit_conversion (result_type, arg2, complain);
6298 arg3 = perform_implicit_conversion (result_type, arg3, complain);
6300 /* [expr.cond]
6302 --The second and third operands have pointer type, or one has
6303 pointer type and the other is a null pointer constant; pointer
6304 conversions (_conv.ptr_) and qualification conversions
6305 (_conv.qual_) are performed to bring them to their composite
6306 pointer type (_expr.rel_). The result is of the composite
6307 pointer type.
6309 --The second and third operands have pointer to member type, or
6310 one has pointer to member type and the other is a null pointer
6311 constant; pointer to member conversions (_conv.mem_) and
6312 qualification conversions (_conv.qual_) are performed to bring
6313 them to a common type, whose cv-qualification shall match the
6314 cv-qualification of either the second or the third operand.
6315 The result is of the common type. */
6316 else if ((null_ptr_cst_p (arg2)
6317 && TYPE_PTR_OR_PTRMEM_P (arg3_type))
6318 || (null_ptr_cst_p (arg3)
6319 && TYPE_PTR_OR_PTRMEM_P (arg2_type))
6320 || (TYPE_PTR_P (arg2_type) && TYPE_PTR_P (arg3_type))
6321 || (TYPE_PTRDATAMEM_P (arg2_type) && TYPE_PTRDATAMEM_P (arg3_type))
6322 || (TYPE_PTRMEMFUNC_P (arg2_type) && TYPE_PTRMEMFUNC_P (arg3_type)))
6324 result_type = composite_pointer_type (loc,
6325 arg2_type, arg3_type, arg2,
6326 arg3, CPO_CONDITIONAL_EXPR,
6327 complain);
6328 if (result_type == error_mark_node)
6329 return error_mark_node;
6330 arg2 = perform_implicit_conversion (result_type, arg2, complain);
6331 arg3 = perform_implicit_conversion (result_type, arg3, complain);
6334 if (!result_type)
6336 if (complain & tf_error)
6337 error_at (loc, "operands to %<?:%> have different types %qT and %qT",
6338 arg2_type, arg3_type);
6339 return error_mark_node;
6342 if (arg2 == error_mark_node || arg3 == error_mark_node)
6343 return error_mark_node;
6345 valid_operands:
6346 if (processing_template_decl && is_glvalue)
6348 /* Let lvalue_kind know this was a glvalue. */
6349 tree arg = (result_type == arg2_type ? arg2 : arg3);
6350 result_type = cp_build_reference_type (result_type, xvalue_p (arg));
6353 result = build3_loc (loc, COND_EXPR, result_type, arg1, arg2, arg3);
6355 /* If the ARG2 and ARG3 are the same and don't have side-effects,
6356 warn here, because the COND_EXPR will be turned into ARG2. */
6357 if (warn_duplicated_branches
6358 && (complain & tf_warning)
6359 && (arg2 == arg3 || operand_equal_p (arg2, arg3,
6360 OEP_ADDRESS_OF_SAME_FIELD)))
6361 warning_at (EXPR_LOCATION (result), OPT_Wduplicated_branches,
6362 "this condition has identical branches");
6364 /* We can't use result_type below, as fold might have returned a
6365 throw_expr. */
6367 if (!is_glvalue)
6369 /* Expand both sides into the same slot, hopefully the target of
6370 the ?: expression. We used to check for TARGET_EXPRs here,
6371 but now we sometimes wrap them in NOP_EXPRs so the test would
6372 fail. */
6373 if (CLASS_TYPE_P (TREE_TYPE (result)))
6375 result = get_target_expr (result, complain);
6376 /* Tell gimplify_modify_expr_rhs not to strip this in
6377 assignment context: we want both arms to initialize
6378 the same temporary. */
6379 TARGET_EXPR_NO_ELIDE (result) = true;
6381 /* If this expression is an rvalue, but might be mistaken for an
6382 lvalue, we must add a NON_LVALUE_EXPR. */
6383 result = rvalue (result);
6384 if (semantic_result_type)
6385 result = build1 (EXCESS_PRECISION_EXPR, semantic_result_type,
6386 result);
6388 else
6390 result = force_paren_expr (result);
6391 gcc_assert (semantic_result_type == NULL_TREE);
6394 return result;
6397 /* OPERAND is an operand to an expression. Perform necessary steps
6398 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
6399 returned. */
6401 static tree
6402 prep_operand (tree operand)
6404 if (operand)
6406 if (CLASS_TYPE_P (TREE_TYPE (operand))
6407 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand)))
6408 /* Make sure the template type is instantiated now. */
6409 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand)));
6412 return operand;
6415 /* True iff CONV represents a conversion sequence which no other can be better
6416 than under [over.ics.rank]: in other words, a "conversion" to the exact same
6417 type (including binding to a reference to the same type). This is stronger
6418 than the standard's "identity" category, which also includes reference
6419 bindings that add cv-qualifiers or change rvalueness. */
6421 static bool
6422 perfect_conversion_p (conversion *conv)
6424 if (CONVERSION_RANK (conv) != cr_identity)
6425 return false;
6426 if (conv->kind == ck_ref_bind)
6428 if (!conv->rvaluedness_matches_p)
6429 return false;
6430 if (!same_type_p (TREE_TYPE (conv->type),
6431 next_conversion (conv)->type))
6432 return false;
6434 if (conv->check_narrowing)
6435 /* Brace elision is imperfect. */
6436 return false;
6437 return true;
6440 /* True if CAND represents a perfect match, i.e. all perfect conversions, so no
6441 other candidate can be a better match. Since the template/non-template
6442 tiebreaker comes immediately after the conversion comparison in
6443 [over.match.best], a perfect non-template candidate is better than all
6444 templates. */
6446 static bool
6447 perfect_candidate_p (z_candidate *cand)
6449 if (cand->viable < 1)
6450 return false;
6451 /* CWG1402 makes an implicitly deleted move op worse than other
6452 candidates. */
6453 if (DECL_DELETED_FN (cand->fn) && DECL_DEFAULTED_FN (cand->fn)
6454 && move_fn_p (cand->fn))
6455 return false;
6456 int len = cand->num_convs;
6457 for (int i = 0; i < len; ++i)
6458 if (!perfect_conversion_p (cand->convs[i]))
6459 return false;
6460 if (conversion *conv = cand->second_conv)
6461 if (!perfect_conversion_p (conv))
6462 return false;
6463 return true;
6466 /* True iff one of CAND's argument conversions is missing. */
6468 static bool
6469 missing_conversion_p (const z_candidate *cand)
6471 for (unsigned i = 0; i < cand->num_convs; ++i)
6473 conversion *conv = cand->convs[i];
6474 if (!conv)
6475 return true;
6476 if (conv->kind == ck_deferred_bad)
6478 /* We don't know whether this conversion is outright invalid or
6479 just bad, so conservatively assume it's missing. */
6480 gcc_checking_assert (conv->bad_p);
6481 return true;
6484 return false;
6487 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
6488 OVERLOAD) to the CANDIDATES, returning an updated list of
6489 CANDIDATES. The ARGS are the arguments provided to the call;
6490 if FIRST_ARG is non-null it is the implicit object argument,
6491 otherwise the first element of ARGS is used if needed. The
6492 EXPLICIT_TARGS are explicit template arguments provided.
6493 TEMPLATE_ONLY is true if only template functions should be
6494 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
6495 add_function_candidate. */
6497 static void
6498 add_candidates (tree fns, tree first_arg, const vec<tree, va_gc> *args,
6499 tree return_type,
6500 tree explicit_targs, bool template_only,
6501 tree conversion_path, tree access_path,
6502 int flags,
6503 struct z_candidate **candidates,
6504 tsubst_flags_t complain)
6506 tree ctype;
6507 const vec<tree, va_gc> *non_static_args;
6508 bool check_list_ctor = false;
6509 bool check_converting = false;
6510 unification_kind_t strict;
6511 tree ne_fns = NULL_TREE;
6513 if (!fns)
6514 return;
6516 /* Precalculate special handling of constructors and conversion ops. */
6517 tree fn = OVL_FIRST (fns);
6518 if (DECL_CONV_FN_P (fn))
6520 check_list_ctor = false;
6521 check_converting = (flags & LOOKUP_ONLYCONVERTING) != 0;
6522 if (flags & LOOKUP_NO_CONVERSION)
6523 /* We're doing return_type(x). */
6524 strict = DEDUCE_CONV;
6525 else
6526 /* We're doing x.operator return_type(). */
6527 strict = DEDUCE_EXACT;
6528 /* [over.match.funcs] For conversion functions, the function
6529 is considered to be a member of the class of the implicit
6530 object argument for the purpose of defining the type of
6531 the implicit object parameter. */
6532 ctype = TYPE_MAIN_VARIANT (TREE_TYPE (first_arg));
6534 else
6536 if (DECL_CONSTRUCTOR_P (fn))
6538 check_list_ctor = (flags & LOOKUP_LIST_ONLY) != 0;
6539 /* For list-initialization we consider explicit constructors
6540 and complain if one is chosen. */
6541 check_converting
6542 = ((flags & (LOOKUP_ONLYCONVERTING|LOOKUP_LIST_INIT_CTOR))
6543 == LOOKUP_ONLYCONVERTING);
6545 strict = DEDUCE_CALL;
6546 ctype = conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE;
6549 /* P2468: Check if operator== is a rewrite target with first operand
6550 (*args)[0]; for now just do the lookups. */
6551 if ((flags & (LOOKUP_REWRITTEN | LOOKUP_REVERSED))
6552 && DECL_OVERLOADED_OPERATOR_IS (fn, EQ_EXPR))
6554 tree ne_name = ovl_op_identifier (false, NE_EXPR);
6555 if (DECL_CLASS_SCOPE_P (fn))
6557 ne_fns = lookup_fnfields (TREE_TYPE ((*args)[0]), ne_name,
6558 1, tf_none);
6559 if (ne_fns == error_mark_node || ne_fns == NULL_TREE)
6560 ne_fns = NULL_TREE;
6561 else
6562 ne_fns = BASELINK_FUNCTIONS (ne_fns);
6564 else
6566 tree context = decl_namespace_context (fn);
6567 ne_fns = lookup_qualified_name (context, ne_name, LOOK_want::NORMAL,
6568 /*complain*/false);
6569 if (ne_fns == error_mark_node
6570 || !is_overloaded_fn (ne_fns))
6571 ne_fns = NULL_TREE;
6575 if (first_arg)
6576 non_static_args = args;
6577 else
6578 /* Delay creating the implicit this parameter until it is needed. */
6579 non_static_args = NULL;
6581 bool seen_strictly_viable = any_strictly_viable (*candidates);
6582 /* If there's a non-template perfect match, we don't need to consider
6583 templates. So check non-templates first. This optimization is only
6584 really needed for the defaulted copy constructor of tuple and the like
6585 (96926), but it seems like we might as well enable it more generally. */
6586 bool seen_perfect = false;
6587 enum { templates, non_templates, either } which = either;
6588 if (template_only)
6589 which = templates;
6590 else /*if (flags & LOOKUP_DEFAULTED)*/
6591 which = non_templates;
6593 /* Template candidates that we'll potentially ignore if the
6594 perfect candidate optimization succeeds. */
6595 z_candidate *ignored_template_cands = nullptr;
6597 /* During overload resolution, we first consider each function under the
6598 assumption that we'll eventually find a strictly viable candidate.
6599 This allows us to circumvent our defacto behavior when checking
6600 argument conversions and shortcut consideration of the candidate
6601 upon encountering the first bad conversion. If this assumption
6602 turns out to be false, and all candidates end up being non-strictly
6603 viable, then we reconsider such candidates under the defacto behavior.
6604 This trick is important for pruning member function overloads according
6605 to their const/ref-qualifiers (since all 'this' conversions are at
6606 worst bad) without breaking -fpermissive. */
6607 z_candidate *bad_cands = nullptr;
6608 bool shortcut_bad_convs = true;
6610 again:
6611 for (tree fn : lkp_range (fns))
6613 if (which == templates && TREE_CODE (fn) != TEMPLATE_DECL)
6615 if (template_only)
6616 add_ignored_candidate (candidates, fn);
6617 continue;
6619 if (which == non_templates && TREE_CODE (fn) == TEMPLATE_DECL)
6621 add_ignored_candidate (&ignored_template_cands, fn);
6622 continue;
6624 if ((check_converting && DECL_NONCONVERTING_P (fn))
6625 || (check_list_ctor && !is_list_ctor (fn)))
6627 add_ignored_candidate (candidates, fn);
6628 continue;
6631 tree fn_first_arg = NULL_TREE;
6632 const vec<tree, va_gc> *fn_args = args;
6634 if (DECL_OBJECT_MEMBER_FUNCTION_P (fn))
6636 /* Figure out where the object arg comes from. If this
6637 function is a non-static member and we didn't get an
6638 implicit object argument, move it out of args. */
6639 if (first_arg == NULL_TREE)
6641 unsigned int ix;
6642 tree arg;
6643 vec<tree, va_gc> *tempvec;
6644 vec_alloc (tempvec, args->length () - 1);
6645 for (ix = 1; args->iterate (ix, &arg); ++ix)
6646 tempvec->quick_push (arg);
6647 non_static_args = tempvec;
6648 first_arg = (*args)[0];
6651 fn_first_arg = first_arg;
6652 fn_args = non_static_args;
6655 /* Don't bother reversing an operator with two identical parameters. */
6656 else if (vec_safe_length (args) == 2 && (flags & LOOKUP_REVERSED))
6658 tree parmlist = TYPE_ARG_TYPES (TREE_TYPE (fn));
6659 if (same_type_p (TREE_VALUE (parmlist),
6660 TREE_VALUE (TREE_CHAIN (parmlist))))
6661 continue;
6664 /* When considering reversed operator==, if there's a corresponding
6665 operator!= in the same scope, it's not a rewrite target. */
6666 if (ne_fns)
6668 bool found = false;
6669 for (lkp_iterator ne (ne_fns); !found && ne; ++ne)
6670 if (0 && !ne.using_p ()
6671 && DECL_NAMESPACE_SCOPE_P (fn)
6672 && DECL_CONTEXT (*ne) != DECL_CONTEXT (fn))
6673 /* ??? This kludge excludes inline namespace members for the H
6674 test in spaceship-eq15.C, but I don't see why we would want
6675 that behavior. Asked Core 2022-11-04. Disabling for now. */;
6676 else if (fns_correspond (fn, *ne))
6678 found = true;
6679 break;
6681 if (found)
6682 continue;
6685 if (TREE_CODE (fn) == TEMPLATE_DECL)
6686 add_template_candidate (candidates,
6688 ctype,
6689 explicit_targs,
6690 fn_first_arg,
6691 fn_args,
6692 return_type,
6693 access_path,
6694 conversion_path,
6695 flags,
6696 strict,
6697 shortcut_bad_convs,
6698 complain);
6699 else
6701 add_function_candidate (candidates,
6703 ctype,
6704 fn_first_arg,
6705 fn_args,
6706 access_path,
6707 conversion_path,
6708 flags,
6709 NULL,
6710 shortcut_bad_convs,
6711 complain);
6712 if (perfect_candidate_p (*candidates))
6713 seen_perfect = true;
6716 z_candidate *cand = *candidates;
6717 if (cand->viable == 1)
6718 seen_strictly_viable = true;
6720 if (cand->viable == -1
6721 && shortcut_bad_convs
6722 && missing_conversion_p (cand))
6724 /* This candidate has been tentatively marked non-strictly viable,
6725 and we didn't compute all argument conversions for it (having
6726 stopped at the first bad conversion). Move it to BAD_CANDS to
6727 to fully reconsider later if we don't find any strictly viable
6728 candidates. */
6729 if (complain & (tf_error | tf_conv))
6731 *candidates = cand->next;
6732 cand->next = bad_cands;
6733 bad_cands = cand;
6735 else
6736 /* But if we're in a SFINAE context, just mark this candidate as
6737 unviable outright and avoid potentially reconsidering it.
6738 This is safe to do because in a SFINAE context, performing a bad
6739 conversion is always an error (even with -fpermissive), so a
6740 non-strictly viable candidate is effectively unviable anyway. */
6741 cand->viable = 0;
6744 if (which == non_templates && !seen_perfect)
6746 which = templates;
6747 ignored_template_cands = nullptr;
6748 goto again;
6750 else if (which == templates
6751 && !seen_strictly_viable
6752 && shortcut_bad_convs
6753 && bad_cands)
6755 /* None of the candidates are strictly viable, so consider again those
6756 functions in BAD_CANDS, this time without shortcutting bad conversions
6757 so that all their argument conversions are computed. */
6758 which = either;
6759 fns = NULL_TREE;
6760 for (z_candidate *cand = bad_cands; cand; cand = cand->next)
6762 tree fn = cand->fn;
6763 if (tree ti = cand->template_decl)
6764 fn = TI_TEMPLATE (ti);
6765 fns = ovl_make (fn, fns);
6767 shortcut_bad_convs = false;
6768 bad_cands = nullptr;
6769 goto again;
6772 if (complain & tf_error)
6774 /* Remember any omitted candidates; we may want to print all candidates
6775 as part of overload resolution failure diagnostics. */
6776 for (z_candidate *omitted_cands : { ignored_template_cands, bad_cands })
6778 z_candidate **omitted_cands_tail = &omitted_cands;
6779 while (*omitted_cands_tail)
6780 omitted_cands_tail = &(*omitted_cands_tail)->next;
6781 *omitted_cands_tail = *candidates;
6782 *candidates = omitted_cands;
6787 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
6788 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
6790 static int
6791 op_is_ordered (tree_code code)
6793 switch (code)
6795 // 5. b @= a
6796 case MODIFY_EXPR:
6797 return (flag_strong_eval_order > 1 ? -1 : 0);
6799 // 6. a[b]
6800 case ARRAY_REF:
6801 return (flag_strong_eval_order > 1 ? 1 : 0);
6803 // 1. a.b
6804 // Not overloadable (yet).
6805 // 2. a->b
6806 // Only one argument.
6807 // 3. a->*b
6808 case MEMBER_REF:
6809 // 7. a << b
6810 case LSHIFT_EXPR:
6811 // 8. a >> b
6812 case RSHIFT_EXPR:
6813 // a && b
6814 // Predates P0145R3.
6815 case TRUTH_ANDIF_EXPR:
6816 // a || b
6817 // Predates P0145R3.
6818 case TRUTH_ORIF_EXPR:
6819 // a , b
6820 // Predates P0145R3.
6821 case COMPOUND_EXPR:
6822 return (flag_strong_eval_order ? 1 : 0);
6824 default:
6825 return 0;
6829 /* Subroutine of build_new_op: Add to CANDIDATES all candidates for the
6830 operator indicated by CODE/CODE2. This function calls itself recursively to
6831 handle C++20 rewritten comparison operator candidates.
6833 LOOKUPS, if non-NULL, is the set of pertinent namespace-scope operator
6834 overloads to consider. This parameter is used when instantiating a
6835 dependent operator expression and has the same structure as
6836 DEPENDENT_OPERATOR_TYPE_SAVED_LOOKUPS. */
6838 static tree
6839 add_operator_candidates (z_candidate **candidates,
6840 tree_code code, tree_code code2,
6841 vec<tree, va_gc> *arglist, tree lookups,
6842 int flags, tsubst_flags_t complain)
6844 z_candidate *start_candidates = *candidates;
6845 bool ismodop = code2 != ERROR_MARK;
6846 tree fnname = ovl_op_identifier (ismodop, ismodop ? code2 : code);
6848 /* LOOKUP_REWRITTEN is set when we're looking for the == or <=> operator to
6849 rewrite from, and also when we're looking for the e.g. < operator to use
6850 on the result of <=>. In the latter case, we don't want the flag set in
6851 the candidate, we just want to suppress looking for rewrites. */
6852 bool rewritten = (flags & LOOKUP_REWRITTEN);
6853 if (rewritten && code != EQ_EXPR && code != SPACESHIP_EXPR)
6854 flags &= ~LOOKUP_REWRITTEN;
6856 bool memonly = false;
6857 switch (code)
6859 /* =, ->, [], () must be non-static member functions. */
6860 case MODIFY_EXPR:
6861 if (code2 != NOP_EXPR)
6862 break;
6863 /* FALLTHRU */
6864 case COMPONENT_REF:
6865 case ARRAY_REF:
6866 memonly = true;
6867 break;
6869 default:
6870 break;
6873 /* Add namespace-scope operators to the list of functions to
6874 consider. */
6875 if (!memonly)
6877 tree fns;
6878 if (!lookups)
6879 fns = lookup_name (fnname, LOOK_where::BLOCK_NAMESPACE);
6880 /* If LOOKUPS is non-NULL, then we're instantiating a dependent operator
6881 expression, and LOOKUPS is the result of stage 1 name lookup. */
6882 else if (tree found = purpose_member (fnname, lookups))
6883 fns = TREE_VALUE (found);
6884 else
6885 fns = NULL_TREE;
6886 fns = lookup_arg_dependent (fnname, fns, arglist);
6887 add_candidates (fns, NULL_TREE, arglist, NULL_TREE,
6888 NULL_TREE, false, NULL_TREE, NULL_TREE,
6889 flags, candidates, complain);
6892 /* Add class-member operators to the candidate set. */
6893 tree arg1_type = TREE_TYPE ((*arglist)[0]);
6894 unsigned nargs = arglist->length () > 1 ? 2 : 1;
6895 tree arg2_type = nargs > 1 ? TREE_TYPE ((*arglist)[1]) : NULL_TREE;
6896 if (CLASS_TYPE_P (arg1_type))
6898 tree fns = lookup_fnfields (arg1_type, fnname, 1, complain);
6899 if (fns == error_mark_node)
6900 return error_mark_node;
6901 if (fns)
6903 if (code == ARRAY_REF)
6905 vec<tree,va_gc> *restlist = make_tree_vector ();
6906 for (unsigned i = 1; i < nargs; ++i)
6907 vec_safe_push (restlist, (*arglist)[i]);
6908 z_candidate *save_cand = *candidates;
6909 add_candidates (BASELINK_FUNCTIONS (fns),
6910 (*arglist)[0], restlist, NULL_TREE,
6911 NULL_TREE, false,
6912 BASELINK_BINFO (fns),
6913 BASELINK_ACCESS_BINFO (fns),
6914 flags, candidates, complain);
6915 /* Release the vec if we didn't add a candidate that uses it. */
6916 for (z_candidate *c = *candidates; c != save_cand; c = c->next)
6917 if (c->args == restlist)
6919 restlist = NULL;
6920 break;
6922 release_tree_vector (restlist);
6924 else
6925 add_candidates (BASELINK_FUNCTIONS (fns),
6926 NULL_TREE, arglist, NULL_TREE,
6927 NULL_TREE, false,
6928 BASELINK_BINFO (fns),
6929 BASELINK_ACCESS_BINFO (fns),
6930 flags, candidates, complain);
6933 /* Per [over.match.oper]3.2, if no operand has a class type, then
6934 only non-member functions that have type T1 or reference to
6935 cv-qualified-opt T1 for the first argument, if the first argument
6936 has an enumeration type, or T2 or reference to cv-qualified-opt
6937 T2 for the second argument, if the second argument has an
6938 enumeration type. Filter out those that don't match. */
6939 else if (! arg2_type || ! CLASS_TYPE_P (arg2_type))
6941 struct z_candidate **candp, **next;
6943 for (candp = candidates; *candp != start_candidates; candp = next)
6945 unsigned i;
6946 z_candidate *cand = *candp;
6947 next = &cand->next;
6949 tree parmlist = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
6951 for (i = 0; i < nargs; ++i)
6953 tree parmtype = TREE_VALUE (parmlist);
6954 tree argtype = unlowered_expr_type ((*arglist)[i]);
6956 if (TYPE_REF_P (parmtype))
6957 parmtype = TREE_TYPE (parmtype);
6958 if (TREE_CODE (argtype) == ENUMERAL_TYPE
6959 && (same_type_ignoring_top_level_qualifiers_p
6960 (argtype, parmtype)))
6961 break;
6963 parmlist = TREE_CHAIN (parmlist);
6966 /* No argument has an appropriate type, so remove this
6967 candidate function from the list. */
6968 if (i == nargs)
6970 *candp = cand->next;
6971 next = candp;
6976 if (!rewritten)
6978 /* The standard says to rewrite built-in candidates, too,
6979 but there's no point. */
6980 add_builtin_candidates (candidates, code, code2, fnname, arglist,
6981 flags, complain);
6983 /* Maybe add C++20 rewritten comparison candidates. */
6984 tree_code rewrite_code = ERROR_MARK;
6985 if (cxx_dialect >= cxx20
6986 && nargs == 2
6987 && (OVERLOAD_TYPE_P (arg1_type) || OVERLOAD_TYPE_P (arg2_type)))
6988 switch (code)
6990 case LT_EXPR:
6991 case LE_EXPR:
6992 case GT_EXPR:
6993 case GE_EXPR:
6994 case SPACESHIP_EXPR:
6995 rewrite_code = SPACESHIP_EXPR;
6996 break;
6998 case NE_EXPR:
6999 case EQ_EXPR:
7000 rewrite_code = EQ_EXPR;
7001 break;
7003 default:;
7006 if (rewrite_code)
7008 flags |= LOOKUP_REWRITTEN;
7009 if (rewrite_code != code)
7010 /* Add rewritten candidates in same order. */
7011 add_operator_candidates (candidates, rewrite_code, ERROR_MARK,
7012 arglist, lookups, flags, complain);
7014 z_candidate *save_cand = *candidates;
7016 /* Add rewritten candidates in reverse order. */
7017 flags |= LOOKUP_REVERSED;
7018 vec<tree,va_gc> *revlist = make_tree_vector ();
7019 revlist->quick_push ((*arglist)[1]);
7020 revlist->quick_push ((*arglist)[0]);
7021 add_operator_candidates (candidates, rewrite_code, ERROR_MARK,
7022 revlist, lookups, flags, complain);
7024 /* Release the vec if we didn't add a candidate that uses it. */
7025 for (z_candidate *c = *candidates; c != save_cand; c = c->next)
7026 if (c->args == revlist)
7028 revlist = NULL;
7029 break;
7031 release_tree_vector (revlist);
7035 return NULL_TREE;
7038 tree
7039 build_new_op (const op_location_t &loc, enum tree_code code, int flags,
7040 tree arg1, tree arg2, tree arg3, tree lookups,
7041 tree *overload, tsubst_flags_t complain)
7043 struct z_candidate *candidates = 0, *cand;
7044 releasing_vec arglist;
7045 tree result = NULL_TREE;
7046 bool result_valid_p = false;
7047 enum tree_code code2 = ERROR_MARK;
7048 enum tree_code code_orig_arg1 = ERROR_MARK;
7049 enum tree_code code_orig_arg2 = ERROR_MARK;
7050 bool strict_p;
7051 bool any_viable_p;
7053 auto_cond_timevar tv (TV_OVERLOAD);
7055 if (error_operand_p (arg1)
7056 || error_operand_p (arg2)
7057 || error_operand_p (arg3))
7058 return error_mark_node;
7060 conversion_obstack_sentinel cos;
7062 bool ismodop = code == MODIFY_EXPR;
7063 if (ismodop)
7065 code2 = TREE_CODE (arg3);
7066 arg3 = NULL_TREE;
7069 tree arg1_type = unlowered_expr_type (arg1);
7070 tree arg2_type = arg2 ? unlowered_expr_type (arg2) : NULL_TREE;
7072 arg1 = prep_operand (arg1);
7074 switch (code)
7076 case NEW_EXPR:
7077 case VEC_NEW_EXPR:
7078 case VEC_DELETE_EXPR:
7079 case DELETE_EXPR:
7080 /* Use build_operator_new_call and build_op_delete_call instead. */
7081 gcc_unreachable ();
7083 case CALL_EXPR:
7084 /* Use build_op_call instead. */
7085 gcc_unreachable ();
7087 case TRUTH_ORIF_EXPR:
7088 case TRUTH_ANDIF_EXPR:
7089 case TRUTH_AND_EXPR:
7090 case TRUTH_OR_EXPR:
7091 /* These are saved for the sake of warn_logical_operator. */
7092 code_orig_arg1 = TREE_CODE (arg1);
7093 code_orig_arg2 = TREE_CODE (arg2);
7094 break;
7095 case GT_EXPR:
7096 case LT_EXPR:
7097 case GE_EXPR:
7098 case LE_EXPR:
7099 case EQ_EXPR:
7100 case NE_EXPR:
7101 /* These are saved for the sake of maybe_warn_bool_compare. */
7102 code_orig_arg1 = TREE_CODE (arg1_type);
7103 code_orig_arg2 = TREE_CODE (arg2_type);
7104 break;
7106 default:
7107 break;
7110 arg2 = prep_operand (arg2);
7111 arg3 = prep_operand (arg3);
7113 if (code == COND_EXPR)
7114 /* Use build_conditional_expr instead. */
7115 gcc_unreachable ();
7116 else if (! OVERLOAD_TYPE_P (arg1_type)
7117 && (! arg2 || ! OVERLOAD_TYPE_P (arg2_type)))
7118 goto builtin;
7120 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
7122 arg2 = integer_zero_node;
7123 arg2_type = integer_type_node;
7126 arglist->quick_push (arg1);
7127 if (arg2 != NULL_TREE)
7128 arglist->quick_push (arg2);
7129 if (arg3 != NULL_TREE)
7130 arglist->quick_push (arg3);
7132 result = add_operator_candidates (&candidates, code, code2, arglist,
7133 lookups, flags, complain);
7134 if (result == error_mark_node)
7135 return error_mark_node;
7137 switch (code)
7139 case COMPOUND_EXPR:
7140 case ADDR_EXPR:
7141 /* For these, the built-in candidates set is empty
7142 [over.match.oper]/3. We don't want non-strict matches
7143 because exact matches are always possible with built-in
7144 operators. The built-in candidate set for COMPONENT_REF
7145 would be empty too, but since there are no such built-in
7146 operators, we accept non-strict matches for them. */
7147 strict_p = true;
7148 break;
7150 default:
7151 strict_p = false;
7152 break;
7155 candidates = splice_viable (candidates, strict_p, &any_viable_p);
7156 if (!any_viable_p)
7158 switch (code)
7160 case POSTINCREMENT_EXPR:
7161 case POSTDECREMENT_EXPR:
7162 /* Don't try anything fancy if we're not allowed to produce
7163 errors. */
7164 if (!(complain & tf_error))
7165 return error_mark_node;
7167 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
7168 distinguish between prefix and postfix ++ and
7169 operator++() was used for both, so we allow this with
7170 -fpermissive. */
7171 else
7173 tree fnname = ovl_op_identifier (ismodop, ismodop ? code2 : code);
7174 const char *msg = (flag_permissive)
7175 ? G_("no %<%D(int)%> declared for postfix %qs,"
7176 " trying prefix operator instead")
7177 : G_("no %<%D(int)%> declared for postfix %qs");
7178 permerror (loc, msg, fnname, OVL_OP_INFO (false, code)->name);
7181 if (!flag_permissive)
7182 return error_mark_node;
7184 if (code == POSTINCREMENT_EXPR)
7185 code = PREINCREMENT_EXPR;
7186 else
7187 code = PREDECREMENT_EXPR;
7188 result = build_new_op (loc, code, flags, arg1, NULL_TREE,
7189 NULL_TREE, lookups, overload, complain);
7190 break;
7192 /* The caller will deal with these. */
7193 case ADDR_EXPR:
7194 case COMPOUND_EXPR:
7195 case COMPONENT_REF:
7196 case CO_AWAIT_EXPR:
7197 result = NULL_TREE;
7198 result_valid_p = true;
7199 break;
7201 default:
7202 if (complain & tf_error)
7204 /* If one of the arguments of the operator represents
7205 an invalid use of member function pointer, try to report
7206 a meaningful error ... */
7207 if (invalid_nonstatic_memfn_p (loc, arg1, tf_error)
7208 || invalid_nonstatic_memfn_p (loc, arg2, tf_error)
7209 || invalid_nonstatic_memfn_p (loc, arg3, tf_error))
7210 /* We displayed the error message. */;
7211 else
7213 /* ... Otherwise, report the more generic
7214 "no matching operator found" error */
7215 auto_diagnostic_group d;
7216 op_error (loc, code, code2, arg1, arg2, arg3, false);
7217 print_z_candidates (loc, candidates);
7220 result = error_mark_node;
7221 break;
7224 else
7226 cand = tourney (candidates, complain);
7227 if (cand == 0)
7229 if (complain & tf_error)
7231 auto_diagnostic_group d;
7232 op_error (loc, code, code2, arg1, arg2, arg3, true);
7233 print_z_candidates (loc, candidates);
7235 result = error_mark_node;
7236 if (overload)
7237 *overload = error_mark_node;
7239 else if (TREE_CODE (cand->fn) == FUNCTION_DECL)
7241 if (overload)
7242 *overload = cand->fn;
7244 if (resolve_args (arglist, complain) == NULL)
7245 result = error_mark_node;
7246 else
7248 tsubst_flags_t ocomplain = complain;
7249 if (cand->rewritten ())
7250 /* We'll wrap this call in another one. */
7251 ocomplain &= ~tf_decltype;
7252 if (cand->reversed ())
7254 /* We swapped these in add_candidate, swap them back now. */
7255 std::swap (cand->convs[0], cand->convs[1]);
7256 if (cand->fn == current_function_decl)
7257 warning_at (loc, 0, "in C++20 this comparison calls the "
7258 "current function recursively with reversed "
7259 "arguments");
7261 result = build_over_call (cand, LOOKUP_NORMAL, ocomplain);
7264 if (trivial_fn_p (cand->fn) || DECL_IMMEDIATE_FUNCTION_P (cand->fn))
7265 /* There won't be a CALL_EXPR. */;
7266 else if (result && result != error_mark_node)
7268 tree call = extract_call_expr (result);
7269 CALL_EXPR_OPERATOR_SYNTAX (call) = true;
7271 /* Specify evaluation order as per P0145R2. */
7272 CALL_EXPR_ORDERED_ARGS (call) = false;
7273 switch (op_is_ordered (code))
7275 case -1:
7276 CALL_EXPR_REVERSE_ARGS (call) = true;
7277 break;
7279 case 1:
7280 CALL_EXPR_ORDERED_ARGS (call) = true;
7281 break;
7283 default:
7284 break;
7288 /* If this was a C++20 rewritten comparison, adjust the result. */
7289 if (cand->rewritten ())
7291 /* FIXME build_min_non_dep_op_overload can't handle rewrites. */
7292 if (overload)
7293 *overload = NULL_TREE;
7294 switch (code)
7296 case EQ_EXPR:
7297 gcc_checking_assert (cand->reversed ());
7298 gcc_fallthrough ();
7299 case NE_EXPR:
7300 if (result == error_mark_node)
7302 /* If a rewritten operator== candidate is selected by
7303 overload resolution for an operator @, its return type
7304 shall be cv bool.... */
7305 else if (TREE_CODE (TREE_TYPE (result)) != BOOLEAN_TYPE)
7307 if (complain & tf_error)
7309 auto_diagnostic_group d;
7310 error_at (loc, "return type of %qD is not %qs",
7311 cand->fn, "bool");
7312 inform (loc, "used as rewritten candidate for "
7313 "comparison of %qT and %qT",
7314 arg1_type, arg2_type);
7316 result = error_mark_node;
7318 else if (code == NE_EXPR)
7319 /* !(y == x) or !(x == y) */
7320 result = build1_loc (loc, TRUTH_NOT_EXPR,
7321 boolean_type_node, result);
7322 break;
7324 /* If a rewritten operator<=> candidate is selected by
7325 overload resolution for an operator @, x @ y is
7326 interpreted as 0 @ (y <=> x) if the selected candidate is
7327 a synthesized candidate with reversed order of parameters,
7328 or (x <=> y) @ 0 otherwise, using the selected rewritten
7329 operator<=> candidate. */
7330 case SPACESHIP_EXPR:
7331 if (!cand->reversed ())
7332 /* We're in the build_new_op call below for an outer
7333 reversed call; we don't need to do anything more. */
7334 break;
7335 gcc_fallthrough ();
7336 case LT_EXPR:
7337 case LE_EXPR:
7338 case GT_EXPR:
7339 case GE_EXPR:
7341 tree lhs = result;
7342 tree rhs = integer_zero_node;
7343 if (cand->reversed ())
7344 std::swap (lhs, rhs);
7345 warning_sentinel ws (warn_zero_as_null_pointer_constant);
7346 result = build_new_op (loc, code,
7347 LOOKUP_NORMAL|LOOKUP_REWRITTEN,
7348 lhs, rhs, NULL_TREE, lookups,
7349 NULL, complain);
7351 break;
7353 default:
7354 gcc_unreachable ();
7358 /* In an expression of the form `a[]' where cand->fn
7359 which is operator[] turns out to be a static member function,
7360 `a' is none-the-less evaluated. */
7361 if (code == ARRAY_REF)
7362 result = keep_unused_object_arg (result, arg1, cand->fn);
7364 else
7366 /* Give any warnings we noticed during overload resolution. */
7367 if (cand->warnings && (complain & tf_warning))
7369 struct candidate_warning *w;
7370 for (w = cand->warnings; w; w = w->next)
7371 joust (cand, w->loser, 1, complain);
7374 /* Check for comparison of different enum types. */
7375 switch (code)
7377 case GT_EXPR:
7378 case LT_EXPR:
7379 case GE_EXPR:
7380 case LE_EXPR:
7381 case EQ_EXPR:
7382 case NE_EXPR:
7383 if (TREE_CODE (arg1_type) == ENUMERAL_TYPE
7384 && TREE_CODE (arg2_type) == ENUMERAL_TYPE
7385 && (TYPE_MAIN_VARIANT (arg1_type)
7386 != TYPE_MAIN_VARIANT (arg2_type)))
7388 if (cxx_dialect >= cxx26
7389 && (complain & tf_warning_or_error) == 0)
7390 result = error_mark_node;
7391 else if (cxx_dialect >= cxx26 || (complain & tf_warning))
7392 emit_diagnostic (cxx_dialect >= cxx26
7393 ? DK_PEDWARN : DK_WARNING,
7394 loc, OPT_Wenum_compare,
7395 "comparison between %q#T and %q#T",
7396 arg1_type, arg2_type);
7398 break;
7399 default:
7400 break;
7403 /* "If a built-in candidate is selected by overload resolution, the
7404 operands of class type are converted to the types of the
7405 corresponding parameters of the selected operation function,
7406 except that the second standard conversion sequence of a
7407 user-defined conversion sequence (12.3.3.1.2) is not applied." */
7408 conversion *conv = cand->convs[0];
7409 if (conv->user_conv_p)
7411 conv = strip_standard_conversion (conv);
7412 arg1 = convert_like (conv, arg1, complain);
7415 if (arg2)
7417 conv = cand->convs[1];
7418 if (conv->user_conv_p)
7420 conv = strip_standard_conversion (conv);
7421 arg2 = convert_like (conv, arg2, complain);
7425 if (arg3)
7427 conv = cand->convs[2];
7428 if (conv->user_conv_p)
7430 conv = strip_standard_conversion (conv);
7431 arg3 = convert_like (conv, arg3, complain);
7437 if (result || result_valid_p)
7438 return result;
7440 builtin:
7441 switch (code)
7443 case MODIFY_EXPR:
7444 return cp_build_modify_expr (loc, arg1, code2, arg2, complain);
7446 case INDIRECT_REF:
7447 return cp_build_indirect_ref (loc, arg1, RO_UNARY_STAR, complain);
7449 case TRUTH_ANDIF_EXPR:
7450 case TRUTH_ORIF_EXPR:
7451 case TRUTH_AND_EXPR:
7452 case TRUTH_OR_EXPR:
7453 if ((complain & tf_warning) && !processing_template_decl)
7454 warn_logical_operator (loc, code, boolean_type_node,
7455 code_orig_arg1, arg1,
7456 code_orig_arg2, arg2);
7457 /* Fall through. */
7458 case GT_EXPR:
7459 case LT_EXPR:
7460 case GE_EXPR:
7461 case LE_EXPR:
7462 case EQ_EXPR:
7463 case NE_EXPR:
7464 if ((complain & tf_warning)
7465 && ((code_orig_arg1 == BOOLEAN_TYPE)
7466 ^ (code_orig_arg2 == BOOLEAN_TYPE)))
7467 maybe_warn_bool_compare (loc, code, arg1, arg2);
7468 if (complain & tf_warning && warn_tautological_compare)
7469 warn_tautological_cmp (loc, code, arg1, arg2);
7470 /* Fall through. */
7471 case SPACESHIP_EXPR:
7472 case PLUS_EXPR:
7473 case MINUS_EXPR:
7474 case MULT_EXPR:
7475 case TRUNC_DIV_EXPR:
7476 case MAX_EXPR:
7477 case MIN_EXPR:
7478 case LSHIFT_EXPR:
7479 case RSHIFT_EXPR:
7480 case TRUNC_MOD_EXPR:
7481 case BIT_AND_EXPR:
7482 case BIT_IOR_EXPR:
7483 case BIT_XOR_EXPR:
7484 return cp_build_binary_op (loc, code, arg1, arg2, complain);
7486 case UNARY_PLUS_EXPR:
7487 case NEGATE_EXPR:
7488 case BIT_NOT_EXPR:
7489 case TRUTH_NOT_EXPR:
7490 case PREINCREMENT_EXPR:
7491 case POSTINCREMENT_EXPR:
7492 case PREDECREMENT_EXPR:
7493 case POSTDECREMENT_EXPR:
7494 case REALPART_EXPR:
7495 case IMAGPART_EXPR:
7496 case ABS_EXPR:
7497 case CO_AWAIT_EXPR:
7498 return cp_build_unary_op (code, arg1, false, complain);
7500 case ARRAY_REF:
7501 return cp_build_array_ref (input_location, arg1, arg2, complain);
7503 case MEMBER_REF:
7504 return build_m_component_ref (cp_build_indirect_ref (loc, arg1,
7505 RO_ARROW_STAR,
7506 complain),
7507 arg2, complain);
7509 /* The caller will deal with these. */
7510 case ADDR_EXPR:
7511 case COMPONENT_REF:
7512 case COMPOUND_EXPR:
7513 return NULL_TREE;
7515 default:
7516 gcc_unreachable ();
7518 return NULL_TREE;
7521 /* Build a new call to operator[]. This may change ARGS. */
7523 tree
7524 build_op_subscript (const op_location_t &loc, tree obj,
7525 vec<tree, va_gc> **args, tree *overload,
7526 tsubst_flags_t complain)
7528 struct z_candidate *candidates = 0, *cand;
7529 tree fns, first_mem_arg = NULL_TREE;
7530 bool any_viable_p;
7531 tree result = NULL_TREE;
7533 auto_cond_timevar tv (TV_OVERLOAD);
7535 obj = mark_lvalue_use (obj);
7537 if (error_operand_p (obj))
7538 return error_mark_node;
7540 tree type = TREE_TYPE (obj);
7542 obj = prep_operand (obj);
7544 if (TYPE_BINFO (type))
7546 fns = lookup_fnfields (TYPE_BINFO (type), ovl_op_identifier (ARRAY_REF),
7547 1, complain);
7548 if (fns == error_mark_node)
7549 return error_mark_node;
7551 else
7552 fns = NULL_TREE;
7554 if (args != NULL && *args != NULL)
7556 *args = resolve_args (*args, complain);
7557 if (*args == NULL)
7558 return error_mark_node;
7561 conversion_obstack_sentinel cos;
7563 if (fns)
7565 first_mem_arg = obj;
7567 add_candidates (BASELINK_FUNCTIONS (fns),
7568 first_mem_arg, *args, NULL_TREE,
7569 NULL_TREE, false,
7570 BASELINK_BINFO (fns), BASELINK_ACCESS_BINFO (fns),
7571 LOOKUP_NORMAL, &candidates, complain);
7574 /* Be strict here because if we choose a bad conversion candidate, the
7575 errors we get won't mention the call context. */
7576 candidates = splice_viable (candidates, true, &any_viable_p);
7577 if (!any_viable_p)
7579 if (complain & tf_error)
7581 auto_diagnostic_group d;
7582 error ("no match for call to %<%T::operator[] (%A)%>",
7583 TREE_TYPE (obj), build_tree_list_vec (*args));
7584 print_z_candidates (loc, candidates);
7586 result = error_mark_node;
7588 else
7590 cand = tourney (candidates, complain);
7591 if (cand == 0)
7593 if (complain & tf_error)
7595 auto_diagnostic_group d;
7596 error ("call of %<%T::operator[] (%A)%> is ambiguous",
7597 TREE_TYPE (obj), build_tree_list_vec (*args));
7598 print_z_candidates (loc, candidates);
7600 result = error_mark_node;
7602 else if (TREE_CODE (cand->fn) == FUNCTION_DECL
7603 && DECL_OVERLOADED_OPERATOR_P (cand->fn)
7604 && DECL_OVERLOADED_OPERATOR_IS (cand->fn, ARRAY_REF))
7606 if (overload)
7607 *overload = cand->fn;
7608 result = build_over_call (cand, LOOKUP_NORMAL, complain);
7609 if (trivial_fn_p (cand->fn) || DECL_IMMEDIATE_FUNCTION_P (cand->fn))
7610 /* There won't be a CALL_EXPR. */;
7611 else if (result && result != error_mark_node)
7613 tree call = extract_call_expr (result);
7614 CALL_EXPR_OPERATOR_SYNTAX (call) = true;
7616 /* Specify evaluation order as per P0145R2. */
7617 CALL_EXPR_ORDERED_ARGS (call) = op_is_ordered (ARRAY_REF) == 1;
7620 /* In an expression of the form `a[]' where cand->fn
7621 which is operator[] turns out to be a static member function,
7622 `a' is none-the-less evaluated. */
7623 result = keep_unused_object_arg (result, obj, cand->fn);
7625 else
7626 gcc_unreachable ();
7629 return result;
7632 /* CALL was returned by some call-building function; extract the actual
7633 CALL_EXPR from any bits that have been tacked on, e.g. by
7634 convert_from_reference. */
7636 tree
7637 extract_call_expr (tree call)
7639 while (TREE_CODE (call) == COMPOUND_EXPR)
7640 call = TREE_OPERAND (call, 1);
7641 if (REFERENCE_REF_P (call))
7642 call = TREE_OPERAND (call, 0);
7643 if (TREE_CODE (call) == TARGET_EXPR)
7644 call = TARGET_EXPR_INITIAL (call);
7645 if (cxx_dialect >= cxx20)
7646 switch (TREE_CODE (call))
7648 /* C++20 rewritten comparison operators. */
7649 case TRUTH_NOT_EXPR:
7650 call = TREE_OPERAND (call, 0);
7651 break;
7652 case LT_EXPR:
7653 case LE_EXPR:
7654 case GT_EXPR:
7655 case GE_EXPR:
7656 case SPACESHIP_EXPR:
7658 tree op0 = TREE_OPERAND (call, 0);
7659 if (integer_zerop (op0))
7660 call = TREE_OPERAND (call, 1);
7661 else
7662 call = op0;
7664 break;
7665 default:;
7668 if (TREE_CODE (call) != CALL_EXPR
7669 && TREE_CODE (call) != AGGR_INIT_EXPR
7670 && call != error_mark_node)
7671 return NULL_TREE;
7672 return call;
7675 /* Returns true if FN has two parameters, of which the second has type
7676 size_t. */
7678 static bool
7679 second_parm_is_size_t (tree fn)
7681 tree t = FUNCTION_ARG_CHAIN (fn);
7682 if (!t || !same_type_p (TREE_VALUE (t), size_type_node))
7683 return false;
7684 t = TREE_CHAIN (t);
7685 if (t == void_list_node)
7686 return true;
7687 return false;
7690 /* True if T, an allocation function, has std::align_val_t as its second
7691 argument. */
7693 bool
7694 aligned_allocation_fn_p (tree t)
7696 if (!aligned_new_threshold)
7697 return false;
7699 tree a = FUNCTION_ARG_CHAIN (t);
7700 return (a && same_type_p (TREE_VALUE (a), align_type_node));
7703 /* True if T is std::destroying_delete_t. */
7705 static bool
7706 std_destroying_delete_t_p (tree t)
7708 return (TYPE_CONTEXT (t) == std_node
7709 && id_equal (TYPE_IDENTIFIER (t), "destroying_delete_t"));
7712 /* A deallocation function with at least two parameters whose second parameter
7713 type is of type std::destroying_delete_t is a destroying operator delete. A
7714 destroying operator delete shall be a class member function named operator
7715 delete. [ Note: Array deletion cannot use a destroying operator
7716 delete. --end note ] */
7718 tree
7719 destroying_delete_p (tree t)
7721 tree a = TYPE_ARG_TYPES (TREE_TYPE (t));
7722 if (!a || !TREE_CHAIN (a))
7723 return NULL_TREE;
7724 tree type = TREE_VALUE (TREE_CHAIN (a));
7725 return std_destroying_delete_t_p (type) ? type : NULL_TREE;
7728 struct dealloc_info
7730 bool sized;
7731 bool aligned;
7732 tree destroying;
7735 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
7736 function (3.7.4.2 [basic.stc.dynamic.deallocation]). If so, and DI is
7737 non-null, also set *DI. */
7739 static bool
7740 usual_deallocation_fn_p (tree t, dealloc_info *di)
7742 if (di) *di = dealloc_info();
7744 /* A template instance is never a usual deallocation function,
7745 regardless of its signature. */
7746 if (TREE_CODE (t) == TEMPLATE_DECL
7747 || primary_template_specialization_p (t))
7748 return false;
7750 /* A usual deallocation function is a deallocation function whose parameters
7751 after the first are
7752 - optionally, a parameter of type std::destroying_delete_t, then
7753 - optionally, a parameter of type std::size_t, then
7754 - optionally, a parameter of type std::align_val_t. */
7755 bool global = DECL_NAMESPACE_SCOPE_P (t);
7756 tree chain = FUNCTION_ARG_CHAIN (t);
7757 if (chain && destroying_delete_p (t))
7759 if (di) di->destroying = TREE_VALUE (chain);
7760 chain = TREE_CHAIN (chain);
7762 if (chain
7763 && (!global || flag_sized_deallocation)
7764 && same_type_p (TREE_VALUE (chain), size_type_node))
7766 if (di) di->sized = true;
7767 chain = TREE_CHAIN (chain);
7769 if (chain && aligned_new_threshold
7770 && same_type_p (TREE_VALUE (chain), align_type_node))
7772 if (di) di->aligned = true;
7773 chain = TREE_CHAIN (chain);
7775 return (chain == void_list_node);
7778 /* Just return whether FN is a usual deallocation function. */
7780 bool
7781 usual_deallocation_fn_p (tree fn)
7783 return usual_deallocation_fn_p (fn, NULL);
7786 /* Build a call to operator delete. This has to be handled very specially,
7787 because the restrictions on what signatures match are different from all
7788 other call instances. For a normal delete, only a delete taking (void *)
7789 or (void *, size_t) is accepted. For a placement delete, only an exact
7790 match with the placement new is accepted.
7792 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
7793 ADDR is the pointer to be deleted.
7794 SIZE is the size of the memory block to be deleted.
7795 GLOBAL_P is true if the delete-expression should not consider
7796 class-specific delete operators.
7797 PLACEMENT is the corresponding placement new call, or NULL_TREE.
7799 If this call to "operator delete" is being generated as part to
7800 deallocate memory allocated via a new-expression (as per [expr.new]
7801 which requires that if the initialization throws an exception then
7802 we call a deallocation function), then ALLOC_FN is the allocation
7803 function. */
7805 tree
7806 build_op_delete_call (enum tree_code code, tree addr, tree size,
7807 bool global_p, tree placement,
7808 tree alloc_fn, tsubst_flags_t complain)
7810 tree fn = NULL_TREE;
7811 tree fns, fnname, type, t;
7812 dealloc_info di_fn = { };
7814 if (addr == error_mark_node)
7815 return error_mark_node;
7817 type = strip_array_types (TREE_TYPE (TREE_TYPE (addr)));
7819 fnname = ovl_op_identifier (false, code);
7821 if (CLASS_TYPE_P (type)
7822 && COMPLETE_TYPE_P (complete_type (type))
7823 && !global_p)
7824 /* In [class.free]
7826 If the result of the lookup is ambiguous or inaccessible, or if
7827 the lookup selects a placement deallocation function, the
7828 program is ill-formed.
7830 Therefore, we ask lookup_fnfields to complain about ambiguity. */
7832 fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1, complain);
7833 if (fns == error_mark_node)
7834 return error_mark_node;
7836 else
7837 fns = NULL_TREE;
7839 if (fns == NULL_TREE)
7840 fns = lookup_name (fnname, LOOK_where::BLOCK_NAMESPACE);
7842 /* Strip const and volatile from addr. */
7843 tree oaddr = addr;
7844 addr = cp_convert (ptr_type_node, addr, complain);
7846 tree excluded_destroying = NULL_TREE;
7848 if (placement)
7850 /* "A declaration of a placement deallocation function matches the
7851 declaration of a placement allocation function if it has the same
7852 number of parameters and, after parameter transformations (8.3.5),
7853 all parameter types except the first are identical."
7855 So we build up the function type we want and ask instantiate_type
7856 to get it for us. */
7857 t = FUNCTION_ARG_CHAIN (alloc_fn);
7858 t = tree_cons (NULL_TREE, ptr_type_node, t);
7859 t = build_function_type (void_type_node, t);
7861 fn = instantiate_type (t, fns, tf_none);
7862 if (fn == error_mark_node)
7863 return NULL_TREE;
7865 fn = MAYBE_BASELINK_FUNCTIONS (fn);
7867 /* "If the lookup finds the two-parameter form of a usual deallocation
7868 function (3.7.4.2) and that function, considered as a placement
7869 deallocation function, would have been selected as a match for the
7870 allocation function, the program is ill-formed." */
7871 if (second_parm_is_size_t (fn))
7873 const char *const msg1
7874 = G_("exception cleanup for this placement new selects "
7875 "non-placement %<operator delete%>");
7876 const char *const msg2
7877 = G_("%qD is a usual (non-placement) deallocation "
7878 "function in C++14 (or with %<-fsized-deallocation%>)");
7880 /* But if the class has an operator delete (void *), then that is
7881 the usual deallocation function, so we shouldn't complain
7882 about using the operator delete (void *, size_t). */
7883 if (DECL_CLASS_SCOPE_P (fn))
7884 for (tree elt : lkp_range (MAYBE_BASELINK_FUNCTIONS (fns)))
7886 if (usual_deallocation_fn_p (elt)
7887 && FUNCTION_ARG_CHAIN (elt) == void_list_node)
7888 goto ok;
7890 /* Before C++14 a two-parameter global deallocation function is
7891 always a placement deallocation function, but warn if
7892 -Wc++14-compat. */
7893 else if (!flag_sized_deallocation)
7895 if (complain & tf_warning)
7897 auto_diagnostic_group d;
7898 if (warning (OPT_Wc__14_compat, msg1))
7899 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
7901 goto ok;
7904 if (complain & tf_warning_or_error)
7906 auto_diagnostic_group d;
7907 if (permerror (input_location, msg1))
7909 /* Only mention C++14 for namespace-scope delete. */
7910 if (DECL_NAMESPACE_SCOPE_P (fn))
7911 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
7912 else
7913 inform (DECL_SOURCE_LOCATION (fn),
7914 "%qD is a usual (non-placement) deallocation "
7915 "function", fn);
7918 else
7919 return error_mark_node;
7920 ok:;
7923 else
7924 /* "Any non-placement deallocation function matches a non-placement
7925 allocation function. If the lookup finds a single matching
7926 deallocation function, that function will be called; otherwise, no
7927 deallocation function will be called." */
7928 for (tree elt : lkp_range (MAYBE_BASELINK_FUNCTIONS (fns)))
7930 dealloc_info di_elt;
7931 if (usual_deallocation_fn_p (elt, &di_elt))
7933 /* If we're called for an EH cleanup in a new-expression, we can't
7934 use a destroying delete; the exception was thrown before the
7935 object was constructed. */
7936 if (alloc_fn && di_elt.destroying)
7938 excluded_destroying = elt;
7939 continue;
7942 if (!fn)
7944 fn = elt;
7945 di_fn = di_elt;
7946 continue;
7949 /* -- If any of the deallocation functions is a destroying
7950 operator delete, all deallocation functions that are not
7951 destroying operator deletes are eliminated from further
7952 consideration. */
7953 if (di_elt.destroying != di_fn.destroying)
7955 if (di_elt.destroying)
7957 fn = elt;
7958 di_fn = di_elt;
7960 continue;
7963 /* -- If the type has new-extended alignment, a function with a
7964 parameter of type std::align_val_t is preferred; otherwise a
7965 function without such a parameter is preferred. If exactly one
7966 preferred function is found, that function is selected and the
7967 selection process terminates. If more than one preferred
7968 function is found, all non-preferred functions are eliminated
7969 from further consideration. */
7970 if (aligned_new_threshold)
7972 bool want_align = type_has_new_extended_alignment (type);
7973 if (di_elt.aligned != di_fn.aligned)
7975 if (want_align == di_elt.aligned)
7977 fn = elt;
7978 di_fn = di_elt;
7980 continue;
7984 /* -- If the deallocation functions have class scope, the one
7985 without a parameter of type std::size_t is selected. */
7986 bool want_size;
7987 if (DECL_CLASS_SCOPE_P (fn))
7988 want_size = false;
7990 /* -- If the type is complete and if, for the second alternative
7991 (delete array) only, the operand is a pointer to a class type
7992 with a non-trivial destructor or a (possibly multi-dimensional)
7993 array thereof, the function with a parameter of type std::size_t
7994 is selected.
7996 -- Otherwise, it is unspecified whether a deallocation function
7997 with a parameter of type std::size_t is selected. */
7998 else
8000 want_size = COMPLETE_TYPE_P (type);
8001 if (code == VEC_DELETE_EXPR
8002 && !TYPE_VEC_NEW_USES_COOKIE (type))
8003 /* We need a cookie to determine the array size. */
8004 want_size = false;
8006 gcc_assert (di_fn.sized != di_elt.sized);
8007 if (want_size == di_elt.sized)
8009 fn = elt;
8010 di_fn = di_elt;
8015 /* If we have a matching function, call it. */
8016 if (fn)
8018 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
8020 /* If the FN is a member function, make sure that it is
8021 accessible. */
8022 if (BASELINK_P (fns))
8023 perform_or_defer_access_check (BASELINK_BINFO (fns), fn, fn,
8024 complain);
8026 /* Core issue 901: It's ok to new a type with deleted delete. */
8027 if (DECL_DELETED_FN (fn) && alloc_fn)
8028 return NULL_TREE;
8030 tree ret;
8031 if (placement)
8033 /* The placement args might not be suitable for overload
8034 resolution at this point, so build the call directly. */
8035 int nargs = call_expr_nargs (placement);
8036 tree *argarray = XALLOCAVEC (tree, nargs);
8037 int i;
8038 argarray[0] = addr;
8039 for (i = 1; i < nargs; i++)
8040 argarray[i] = CALL_EXPR_ARG (placement, i);
8041 if (!mark_used (fn, complain) && !(complain & tf_error))
8042 return error_mark_node;
8043 ret = build_cxx_call (fn, nargs, argarray, complain);
8045 else
8047 tree destroying = di_fn.destroying;
8048 if (destroying)
8050 /* Strip const and volatile from addr but retain the type of the
8051 object. */
8052 tree rtype = TREE_TYPE (TREE_TYPE (oaddr));
8053 rtype = cv_unqualified (rtype);
8054 rtype = TYPE_POINTER_TO (rtype);
8055 addr = cp_convert (rtype, oaddr, complain);
8056 destroying = build_functional_cast (input_location,
8057 destroying, NULL_TREE,
8058 complain);
8061 releasing_vec args;
8062 args->quick_push (addr);
8063 if (destroying)
8064 args->quick_push (destroying);
8065 if (di_fn.sized)
8066 args->quick_push (size);
8067 if (di_fn.aligned)
8069 tree al = build_int_cst (align_type_node, TYPE_ALIGN_UNIT (type));
8070 args->quick_push (al);
8072 ret = cp_build_function_call_vec (fn, &args, complain);
8075 /* Set this flag for all callers of this function. In addition to
8076 delete-expressions, this is called for deallocating coroutine state;
8077 treat that as an implicit delete-expression. This is also called for
8078 the delete if the constructor throws in a new-expression, and for a
8079 deleting destructor (which implements a delete-expression). */
8080 /* But leave this flag off for destroying delete to avoid wrong
8081 assumptions in the optimizers. */
8082 tree call = extract_call_expr (ret);
8083 if (TREE_CODE (call) == CALL_EXPR && !destroying_delete_p (fn))
8084 CALL_FROM_NEW_OR_DELETE_P (call) = 1;
8086 return ret;
8089 /* If there's only a destroying delete that we can't use because the
8090 object isn't constructed yet, and we used global new, use global
8091 delete as well. */
8092 if (excluded_destroying
8093 && DECL_NAMESPACE_SCOPE_P (alloc_fn))
8094 return build_op_delete_call (code, addr, size, true, placement,
8095 alloc_fn, complain);
8097 /* [expr.new]
8099 If no unambiguous matching deallocation function can be found,
8100 propagating the exception does not cause the object's memory to
8101 be freed. */
8102 if (alloc_fn)
8104 if ((complain & tf_warning)
8105 && !placement)
8107 bool w = warning (0,
8108 "no corresponding deallocation function for %qD",
8109 alloc_fn);
8110 if (w && excluded_destroying)
8111 inform (DECL_SOURCE_LOCATION (excluded_destroying), "destroying "
8112 "delete %qD cannot be used to release the allocated memory"
8113 " if the initialization throws because the object is not "
8114 "constructed yet", excluded_destroying);
8116 return NULL_TREE;
8119 if (complain & tf_error)
8120 error ("no suitable %<operator %s%> for %qT",
8121 OVL_OP_INFO (false, code)->name, type);
8122 return error_mark_node;
8125 /* Issue diagnostics about a disallowed access of DECL, using DIAG_DECL
8126 in the diagnostics.
8128 If ISSUE_ERROR is true, then issue an error about the access, followed
8129 by a note showing the declaration. Otherwise, just show the note.
8131 DIAG_DECL and DIAG_LOCATION will almost always be the same.
8132 DIAG_LOCATION is just another DECL. NO_ACCESS_REASON is an optional
8133 parameter used to specify why DECL wasn't accessible (e.g. ak_private
8134 would be because DECL was private). If not using NO_ACCESS_REASON,
8135 then it must be ak_none, and the access failure reason will be
8136 figured out by looking at the protection of DECL. */
8138 void
8139 complain_about_access (tree decl, tree diag_decl, tree diag_location,
8140 bool issue_error, access_kind no_access_reason)
8142 /* If we have not already figured out why DECL is inaccessible... */
8143 if (no_access_reason == ak_none)
8145 /* Examine the access of DECL to find out why. */
8146 if (TREE_PRIVATE (decl))
8147 no_access_reason = ak_private;
8148 else if (TREE_PROTECTED (decl))
8149 no_access_reason = ak_protected;
8152 /* Now generate an error message depending on calculated access. */
8153 if (no_access_reason == ak_private)
8155 if (issue_error)
8156 error ("%q#D is private within this context", diag_decl);
8157 inform (DECL_SOURCE_LOCATION (diag_location), "declared private here");
8159 else if (no_access_reason == ak_protected)
8161 if (issue_error)
8162 error ("%q#D is protected within this context", diag_decl);
8163 inform (DECL_SOURCE_LOCATION (diag_location), "declared protected here");
8165 /* Couldn't figure out why DECL is inaccesible, so just say it's
8166 inaccessible. */
8167 else
8169 if (issue_error)
8170 error ("%q#D is inaccessible within this context", diag_decl);
8171 inform (DECL_SOURCE_LOCATION (diag_decl), "declared here");
8175 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
8176 bitwise or of LOOKUP_* values. If any errors are warnings are
8177 generated, set *DIAGNOSTIC_FN to "error" or "warning",
8178 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
8179 to NULL. */
8181 static tree
8182 build_temp (tree expr, tree type, int flags,
8183 diagnostic_t *diagnostic_kind, tsubst_flags_t complain)
8185 int savew, savee;
8187 *diagnostic_kind = DK_UNSPECIFIED;
8189 /* If the source is a packed field, calling the copy constructor will require
8190 binding the field to the reference parameter to the copy constructor, and
8191 we'll end up with an infinite loop. If we can use a bitwise copy, then
8192 do that now. */
8193 if ((lvalue_kind (expr) & clk_packed)
8194 && CLASS_TYPE_P (TREE_TYPE (expr))
8195 && !type_has_nontrivial_copy_init (TREE_TYPE (expr)))
8196 return get_target_expr (expr, complain);
8198 /* In decltype, we might have decided not to wrap this call in a TARGET_EXPR.
8199 But it turns out to be a subexpression, so perform temporary
8200 materialization now. */
8201 if (TREE_CODE (expr) == CALL_EXPR
8202 && CLASS_TYPE_P (type)
8203 && same_type_ignoring_top_level_qualifiers_p (type, TREE_TYPE (expr)))
8204 expr = build_cplus_new (type, expr, complain);
8206 savew = warningcount + werrorcount, savee = errorcount;
8207 releasing_vec args (make_tree_vector_single (expr));
8208 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
8209 &args, type, flags, complain);
8210 if (warningcount + werrorcount > savew)
8211 *diagnostic_kind = DK_WARNING;
8212 else if (errorcount > savee)
8213 *diagnostic_kind = DK_ERROR;
8214 return expr;
8217 /* Get any location for EXPR, falling back to input_location.
8219 If the result is in a system header and is the virtual location for
8220 a token coming from the expansion of a macro, unwind it to the
8221 location of the expansion point of the macro (e.g. to avoid the
8222 diagnostic being suppressed for expansions of NULL where "NULL" is
8223 in a system header). */
8225 static location_t
8226 get_location_for_expr_unwinding_for_system_header (tree expr)
8228 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
8229 loc = expansion_point_location_if_in_system_header (loc);
8230 return loc;
8233 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
8234 Also handle a subset of zero as null warnings.
8235 EXPR is implicitly converted to type TOTYPE.
8236 FN and ARGNUM are used for diagnostics. */
8238 static void
8239 conversion_null_warnings (tree totype, tree expr, tree fn, int argnum)
8241 /* Issue warnings about peculiar, but valid, uses of NULL. */
8242 if (TREE_CODE (totype) != BOOLEAN_TYPE
8243 && ARITHMETIC_TYPE_P (totype)
8244 && null_node_p (expr))
8246 location_t loc = get_location_for_expr_unwinding_for_system_header (expr);
8247 if (fn)
8249 auto_diagnostic_group d;
8250 if (warning_at (loc, OPT_Wconversion_null,
8251 "passing NULL to non-pointer argument %P of %qD",
8252 argnum, fn))
8253 inform (get_fndecl_argument_location (fn, argnum),
8254 " declared here");
8256 else
8257 warning_at (loc, OPT_Wconversion_null,
8258 "converting to non-pointer type %qT from NULL", totype);
8261 /* Issue warnings if "false" is converted to a NULL pointer */
8262 else if (TREE_CODE (TREE_TYPE (expr)) == BOOLEAN_TYPE
8263 && TYPE_PTR_P (totype))
8265 location_t loc = get_location_for_expr_unwinding_for_system_header (expr);
8266 if (fn)
8268 auto_diagnostic_group d;
8269 if (warning_at (loc, OPT_Wconversion_null,
8270 "converting %<false%> to pointer type for argument "
8271 "%P of %qD", argnum, fn))
8272 inform (get_fndecl_argument_location (fn, argnum),
8273 " declared here");
8275 else
8276 warning_at (loc, OPT_Wconversion_null,
8277 "converting %<false%> to pointer type %qT", totype);
8279 /* Handle zero as null pointer warnings for cases other
8280 than EQ_EXPR and NE_EXPR */
8281 else if ((TYPE_PTR_OR_PTRMEM_P (totype) || NULLPTR_TYPE_P (totype))
8282 && null_ptr_cst_p (expr))
8284 location_t loc = get_location_for_expr_unwinding_for_system_header (expr);
8285 maybe_warn_zero_as_null_pointer_constant (expr, loc);
8289 /* We gave a diagnostic during a conversion. If this was in the second
8290 standard conversion sequence of a user-defined conversion sequence, say
8291 which user-defined conversion. */
8293 static void
8294 maybe_print_user_conv_context (conversion *convs)
8296 if (convs->user_conv_p)
8297 for (conversion *t = convs; t; t = next_conversion (t))
8298 if (t->kind == ck_user)
8300 print_z_candidate (0, N_(" after user-defined conversion:"),
8301 t->cand);
8302 break;
8306 /* Locate the parameter with the given index within FNDECL.
8307 ARGNUM is zero based, -1 indicates the `this' argument of a method.
8308 Return the location of the FNDECL itself if there are problems. */
8310 location_t
8311 get_fndecl_argument_location (tree fndecl, int argnum)
8313 /* The locations of implicitly-declared functions are likely to be
8314 more meaningful than those of their parameters. */
8315 if (DECL_ARTIFICIAL (fndecl))
8316 return DECL_SOURCE_LOCATION (fndecl);
8318 int i;
8319 tree param;
8321 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
8322 for (i = 0, param = FUNCTION_FIRST_USER_PARM (fndecl);
8323 i < argnum && param;
8324 i++, param = TREE_CHAIN (param))
8327 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
8328 return the location of FNDECL. */
8329 if (param == NULL)
8330 return DECL_SOURCE_LOCATION (fndecl);
8332 return DECL_SOURCE_LOCATION (param);
8335 /* If FNDECL is non-NULL, issue a note highlighting ARGNUM
8336 within its declaration (or the fndecl itself if something went
8337 wrong). */
8339 void
8340 maybe_inform_about_fndecl_for_bogus_argument_init (tree fn, int argnum)
8342 if (fn)
8343 inform (get_fndecl_argument_location (fn, argnum),
8344 " initializing argument %P of %qD", argnum, fn);
8347 /* Maybe warn about C++20 Conversions to arrays of unknown bound. C is
8348 the conversion, EXPR is the expression we're converting. */
8350 static void
8351 maybe_warn_array_conv (location_t loc, conversion *c, tree expr)
8353 if (cxx_dialect >= cxx20)
8354 return;
8356 tree type = TREE_TYPE (expr);
8357 type = strip_pointer_operator (type);
8359 if (TREE_CODE (type) != ARRAY_TYPE
8360 || TYPE_DOMAIN (type) == NULL_TREE)
8361 return;
8363 if (pedantic && conv_binds_to_array_of_unknown_bound (c))
8364 pedwarn (loc, OPT_Wc__20_extensions,
8365 "conversions to arrays of unknown bound "
8366 "are only available with %<-std=c++20%> or %<-std=gnu++20%>");
8369 /* We call this recursively in convert_like_internal. */
8370 static tree convert_like (conversion *, tree, tree, int, bool, bool, bool,
8371 tsubst_flags_t);
8373 /* Perform the conversions in CONVS on the expression EXPR. FN and
8374 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
8375 indicates the `this' argument of a method. INNER is nonzero when
8376 being called to continue a conversion chain. It is negative when a
8377 reference binding will be applied, positive otherwise. If
8378 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
8379 conversions will be emitted if appropriate. If C_CAST_P is true,
8380 this conversion is coming from a C-style cast; in that case,
8381 conversions to inaccessible bases are permitted. */
8383 static tree
8384 convert_like_internal (conversion *convs, tree expr, tree fn, int argnum,
8385 bool issue_conversion_warnings, bool c_cast_p,
8386 bool nested_p, tsubst_flags_t complain)
8388 tree totype = convs->type;
8389 diagnostic_t diag_kind;
8390 int flags;
8391 location_t loc = cp_expr_loc_or_input_loc (expr);
8393 if (convs->bad_p && !(complain & tf_error))
8394 return error_mark_node;
8396 if (convs->bad_p
8397 && convs->kind != ck_user
8398 && convs->kind != ck_list
8399 && convs->kind != ck_ambig
8400 && (convs->kind != ck_ref_bind
8401 || (convs->user_conv_p && next_conversion (convs)->bad_p))
8402 && (convs->kind != ck_rvalue
8403 || SCALAR_TYPE_P (totype))
8404 && convs->kind != ck_base)
8406 int complained = 0;
8407 conversion *t = convs;
8409 /* Give a helpful error if this is bad because of excess braces. */
8410 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
8411 && SCALAR_TYPE_P (totype)
8412 && CONSTRUCTOR_NELTS (expr) > 0
8413 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr, 0)->value))
8415 complained = permerror (loc, "too many braces around initializer "
8416 "for %qT", totype);
8417 while (BRACE_ENCLOSED_INITIALIZER_P (expr)
8418 && CONSTRUCTOR_NELTS (expr) == 1)
8419 expr = CONSTRUCTOR_ELT (expr, 0)->value;
8422 /* Give a helpful error if this is bad because a conversion to bool
8423 from std::nullptr_t requires direct-initialization. */
8424 if (NULLPTR_TYPE_P (TREE_TYPE (expr))
8425 && TREE_CODE (totype) == BOOLEAN_TYPE)
8426 complained = permerror (loc, "converting to %qH from %qI requires "
8427 "direct-initialization",
8428 totype, TREE_TYPE (expr));
8430 if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (expr))
8431 && SCALAR_FLOAT_TYPE_P (totype)
8432 && (extended_float_type_p (TREE_TYPE (expr))
8433 || extended_float_type_p (totype)))
8434 switch (cp_compare_floating_point_conversion_ranks (TREE_TYPE (expr),
8435 totype))
8437 case 2:
8438 if (pedwarn (loc, OPT_Wnarrowing, "ISO C++ does not allow "
8439 "converting to %qH from %qI with greater "
8440 "conversion rank", totype, TREE_TYPE (expr)))
8441 complained = 1;
8442 else if (!complained)
8443 complained = -1;
8444 break;
8445 case 3:
8446 if (pedwarn (loc, OPT_Wnarrowing, "ISO C++ does not allow "
8447 "converting to %qH from %qI with unordered "
8448 "conversion rank", totype, TREE_TYPE (expr)))
8449 complained = 1;
8450 else if (!complained)
8451 complained = -1;
8452 break;
8453 default:
8454 break;
8457 for (; t ; t = next_conversion (t))
8459 if (t->kind == ck_user && t->cand->reason)
8461 auto_diagnostic_group d;
8462 complained = permerror (loc, "invalid user-defined conversion "
8463 "from %qH to %qI", TREE_TYPE (expr),
8464 totype);
8465 if (complained)
8466 print_z_candidate (loc, N_("candidate is:"), t->cand);
8467 expr = convert_like (t, expr, fn, argnum,
8468 /*issue_conversion_warnings=*/false,
8469 /*c_cast_p=*/false, /*nested_p=*/true,
8470 complain);
8472 else if (t->kind == ck_user || !t->bad_p)
8474 expr = convert_like (t, expr, fn, argnum,
8475 /*issue_conversion_warnings=*/false,
8476 /*c_cast_p=*/false, /*nested_p=*/true,
8477 complain);
8478 if (t->bad_p)
8479 complained = 1;
8480 break;
8482 else if (t->kind == ck_ambig)
8483 return convert_like (t, expr, fn, argnum,
8484 /*issue_conversion_warnings=*/false,
8485 /*c_cast_p=*/false, /*nested_p=*/true,
8486 complain);
8487 else if (t->kind == ck_identity)
8488 break;
8490 if (!complained && expr != error_mark_node)
8492 range_label_for_type_mismatch label (TREE_TYPE (expr), totype);
8493 gcc_rich_location richloc (loc, &label);
8494 complained = permerror (&richloc,
8495 "invalid conversion from %qH to %qI",
8496 TREE_TYPE (expr), totype);
8498 if (convs->kind == ck_ref_bind)
8499 expr = convert_to_reference (totype, expr, CONV_IMPLICIT,
8500 LOOKUP_NORMAL, NULL_TREE,
8501 complain);
8502 else
8503 expr = cp_convert (totype, expr, complain);
8504 if (complained == 1)
8505 maybe_inform_about_fndecl_for_bogus_argument_init (fn, argnum);
8506 return expr;
8509 if (issue_conversion_warnings && (complain & tf_warning))
8510 conversion_null_warnings (totype, expr, fn, argnum);
8512 switch (convs->kind)
8514 case ck_user:
8516 struct z_candidate *cand = convs->cand;
8518 if (cand == NULL)
8519 /* We chose the surrogate function from add_conv_candidate, now we
8520 actually need to build the conversion. */
8521 cand = build_user_type_conversion_1 (totype, expr,
8522 LOOKUP_NO_CONVERSION, complain);
8524 tree convfn = cand->fn;
8526 /* When converting from an init list we consider explicit
8527 constructors, but actually trying to call one is an error. */
8528 if (DECL_NONCONVERTING_P (convfn) && DECL_CONSTRUCTOR_P (convfn)
8529 && BRACE_ENCLOSED_INITIALIZER_P (expr)
8530 /* Unless this is for direct-list-initialization. */
8531 && (!CONSTRUCTOR_IS_DIRECT_INIT (expr) || convs->need_temporary_p)
8532 /* And in C++98 a default constructor can't be explicit. */
8533 && cxx_dialect >= cxx11)
8535 if (!(complain & tf_error))
8536 return error_mark_node;
8537 location_t loc = location_of (expr);
8538 if (CONSTRUCTOR_NELTS (expr) == 0
8539 && FUNCTION_FIRST_USER_PARMTYPE (convfn) != void_list_node)
8541 auto_diagnostic_group d;
8542 if (pedwarn (loc, 0, "converting to %qT from initializer list "
8543 "would use explicit constructor %qD",
8544 totype, convfn))
8546 inform (DECL_SOURCE_LOCATION (convfn), "%qD declared here",
8547 convfn);
8548 inform (loc, "in C++11 and above a default constructor "
8549 "can be explicit");
8552 else
8554 auto_diagnostic_group d;
8555 error ("converting to %qT from initializer list would use "
8556 "explicit constructor %qD", totype, convfn);
8557 inform (DECL_SOURCE_LOCATION (convfn), "%qD declared here",
8558 convfn);
8562 /* If we're initializing from {}, it's value-initialization. */
8563 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
8564 && CONSTRUCTOR_NELTS (expr) == 0
8565 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype)
8566 && !processing_template_decl)
8568 bool direct = CONSTRUCTOR_IS_DIRECT_INIT (expr);
8569 if (abstract_virtuals_error (NULL_TREE, totype, complain))
8570 return error_mark_node;
8571 expr = build_value_init (totype, complain);
8572 expr = get_target_expr (expr, complain);
8573 if (expr != error_mark_node)
8575 TARGET_EXPR_LIST_INIT_P (expr) = true;
8576 TARGET_EXPR_DIRECT_INIT_P (expr) = direct;
8578 return expr;
8581 /* We don't know here whether EXPR is being used as an lvalue or
8582 rvalue, but we know it's read. */
8583 mark_exp_read (expr);
8585 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
8586 any more UDCs. */
8587 expr = build_over_call (cand, LOOKUP_NORMAL|LOOKUP_NO_CONVERSION,
8588 complain);
8590 /* If this is a constructor or a function returning an aggr type,
8591 we need to build up a TARGET_EXPR. */
8592 if (DECL_CONSTRUCTOR_P (convfn))
8594 expr = build_cplus_new (totype, expr, complain);
8596 /* Remember that this was list-initialization. */
8597 if (convs->check_narrowing && expr != error_mark_node)
8598 TARGET_EXPR_LIST_INIT_P (expr) = true;
8601 return expr;
8603 case ck_identity:
8604 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
8606 int nelts = CONSTRUCTOR_NELTS (expr);
8607 if (nelts == 0)
8608 expr = build_value_init (totype, complain);
8609 else if (nelts == 1)
8610 expr = CONSTRUCTOR_ELT (expr, 0)->value;
8611 else
8612 gcc_unreachable ();
8614 expr = mark_use (expr, /*rvalue_p=*/!convs->rvaluedness_matches_p,
8615 /*read_p=*/true, UNKNOWN_LOCATION,
8616 /*reject_builtin=*/true);
8618 if (type_unknown_p (expr))
8619 expr = instantiate_type (totype, expr, complain);
8620 if (!nested_p && TREE_CODE (expr) == EXCESS_PRECISION_EXPR)
8621 expr = cp_convert (totype, TREE_OPERAND (expr, 0), complain);
8622 if (expr == null_node
8623 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype))
8624 /* If __null has been converted to an integer type, we do not want to
8625 continue to warn about uses of EXPR as an integer, rather than as a
8626 pointer. */
8627 expr = build_int_cst (totype, 0);
8628 return expr;
8629 case ck_ambig:
8630 /* We leave bad_p off ck_ambig because overload resolution considers
8631 it valid, it just fails when we try to perform it. So we need to
8632 check complain here, too. */
8633 if (complain & tf_error)
8635 /* Call build_user_type_conversion again for the error. */
8636 int flags = (convs->need_temporary_p
8637 ? LOOKUP_IMPLICIT : LOOKUP_NORMAL);
8638 build_user_type_conversion (totype, convs->u.expr, flags, complain);
8639 gcc_assert (seen_error ());
8640 maybe_inform_about_fndecl_for_bogus_argument_init (fn, argnum);
8642 return error_mark_node;
8644 case ck_list:
8646 /* Conversion to std::initializer_list<T>. */
8647 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype), 0);
8648 unsigned len = CONSTRUCTOR_NELTS (expr);
8649 tree array;
8651 if (tree init = maybe_init_list_as_array (elttype, expr))
8653 elttype = cp_build_qualified_type
8654 (elttype, cp_type_quals (elttype) | TYPE_QUAL_CONST);
8655 array = build_array_of_n_type (elttype, len);
8656 array = build_vec_init_expr (array, init, complain);
8657 array = get_target_expr (array);
8658 array = cp_build_addr_expr (array, complain);
8660 else if (len)
8662 tree val; unsigned ix;
8664 tree new_ctor = build_constructor (init_list_type_node, NULL);
8666 /* Convert all the elements. */
8667 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr), ix, val)
8669 tree sub = convert_like (convs->u.list[ix], val, fn,
8670 argnum, false, false,
8671 /*nested_p=*/true, complain);
8672 if (sub == error_mark_node)
8673 return sub;
8674 if (!BRACE_ENCLOSED_INITIALIZER_P (val)
8675 && !check_narrowing (TREE_TYPE (sub), val, complain))
8676 return error_mark_node;
8677 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor),
8678 NULL_TREE, sub);
8679 if (!TREE_CONSTANT (sub))
8680 TREE_CONSTANT (new_ctor) = false;
8682 /* Build up the array. */
8683 elttype = cp_build_qualified_type
8684 (elttype, cp_type_quals (elttype) | TYPE_QUAL_CONST);
8685 array = build_array_of_n_type (elttype, len);
8686 array = finish_compound_literal (array, new_ctor, complain);
8687 /* This is dubious now, should be blessed by P2752. */
8688 DECL_MERGEABLE (TARGET_EXPR_SLOT (array)) = true;
8689 array = cp_build_addr_expr (array, complain);
8691 else
8692 array = nullptr_node;
8694 array = cp_convert (build_pointer_type (elttype), array, complain);
8695 if (array == error_mark_node)
8696 return error_mark_node;
8698 /* Build up the initializer_list object. Note: fail gracefully
8699 if the object cannot be completed because, for example, no
8700 definition is provided (c++/80956). */
8701 totype = complete_type_or_maybe_complain (totype, NULL_TREE, complain);
8702 if (!totype)
8703 return error_mark_node;
8704 tree field = next_aggregate_field (TYPE_FIELDS (totype));
8705 vec<constructor_elt, va_gc> *vec = NULL;
8706 CONSTRUCTOR_APPEND_ELT (vec, field, array);
8707 field = next_aggregate_field (DECL_CHAIN (field));
8708 CONSTRUCTOR_APPEND_ELT (vec, field, size_int (len));
8709 tree new_ctor = build_constructor (totype, vec);
8710 return get_target_expr (new_ctor, complain);
8713 case ck_aggr:
8714 if (TREE_CODE (totype) == COMPLEX_TYPE)
8716 tree real = CONSTRUCTOR_ELT (expr, 0)->value;
8717 tree imag = CONSTRUCTOR_ELT (expr, 1)->value;
8718 real = perform_implicit_conversion (TREE_TYPE (totype),
8719 real, complain);
8720 imag = perform_implicit_conversion (TREE_TYPE (totype),
8721 imag, complain);
8722 expr = build2 (COMPLEX_EXPR, totype, real, imag);
8723 return expr;
8725 expr = reshape_init (totype, expr, complain);
8726 expr = get_target_expr (digest_init (totype, expr, complain),
8727 complain);
8728 if (expr != error_mark_node)
8729 TARGET_EXPR_LIST_INIT_P (expr) = true;
8730 return expr;
8732 default:
8733 break;
8736 expr = convert_like (next_conversion (convs), expr, fn, argnum,
8737 convs->kind == ck_ref_bind
8738 ? issue_conversion_warnings : false,
8739 c_cast_p, /*nested_p=*/true, complain & ~tf_no_cleanup);
8740 if (expr == error_mark_node)
8741 return error_mark_node;
8743 switch (convs->kind)
8745 case ck_rvalue:
8746 expr = decay_conversion (expr, complain);
8747 if (expr == error_mark_node)
8749 if (complain & tf_error)
8751 auto_diagnostic_group d;
8752 maybe_print_user_conv_context (convs);
8753 maybe_inform_about_fndecl_for_bogus_argument_init (fn, argnum);
8755 return error_mark_node;
8758 if (! MAYBE_CLASS_TYPE_P (totype))
8759 return expr;
8761 /* Don't introduce copies when passing arguments along to the inherited
8762 constructor. */
8763 if (current_function_decl
8764 && flag_new_inheriting_ctors
8765 && DECL_INHERITED_CTOR (current_function_decl))
8766 return expr;
8768 if (TREE_CODE (expr) == TARGET_EXPR
8769 && TARGET_EXPR_LIST_INIT_P (expr))
8770 /* Copy-list-initialization doesn't actually involve a copy. */
8771 return expr;
8773 /* Fall through. */
8774 case ck_base:
8775 if (convs->kind == ck_base && !convs->need_temporary_p)
8777 /* We are going to bind a reference directly to a base-class
8778 subobject of EXPR. */
8779 /* Build an expression for `*((base*) &expr)'. */
8780 expr = convert_to_base (expr, totype,
8781 !c_cast_p, /*nonnull=*/true, complain);
8782 return expr;
8785 /* Copy-initialization where the cv-unqualified version of the source
8786 type is the same class as, or a derived class of, the class of the
8787 destination [is treated as direct-initialization]. [dcl.init] */
8788 flags = LOOKUP_NORMAL;
8789 /* This conversion is being done in the context of a user-defined
8790 conversion (i.e. the second step of copy-initialization), so
8791 don't allow any more. */
8792 if (convs->user_conv_p)
8793 flags |= LOOKUP_NO_CONVERSION;
8794 /* We might be performing a conversion of the argument
8795 to the user-defined conversion, i.e., not a conversion of the
8796 result of the user-defined conversion. In which case we skip
8797 explicit constructors. */
8798 if (convs->copy_init_p)
8799 flags |= LOOKUP_ONLYCONVERTING;
8800 expr = build_temp (expr, totype, flags, &diag_kind, complain);
8801 if (diag_kind && complain)
8803 auto_diagnostic_group d;
8804 maybe_print_user_conv_context (convs);
8805 maybe_inform_about_fndecl_for_bogus_argument_init (fn, argnum);
8808 return build_cplus_new (totype, expr, complain);
8810 case ck_ref_bind:
8812 tree ref_type = totype;
8814 /* direct_reference_binding might have inserted a ck_qual under
8815 this ck_ref_bind for the benefit of conversion sequence ranking.
8816 Ignore the conversion; we'll create our own below. */
8817 if (next_conversion (convs)->kind == ck_qual
8818 && !convs->need_temporary_p)
8820 gcc_assert (same_type_p (TREE_TYPE (expr),
8821 next_conversion (convs)->type));
8822 /* Strip the cast created by the ck_qual; cp_build_addr_expr
8823 below expects an lvalue. */
8824 STRIP_NOPS (expr);
8827 if (convs->bad_p && !next_conversion (convs)->bad_p)
8829 tree extype = TREE_TYPE (expr);
8830 auto_diagnostic_group d;
8831 if (TYPE_REF_IS_RVALUE (ref_type)
8832 && lvalue_p (expr))
8833 error_at (loc, "cannot bind rvalue reference of type %qH to "
8834 "lvalue of type %qI", totype, extype);
8835 else if (!TYPE_REF_IS_RVALUE (ref_type) && !lvalue_p (expr)
8836 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type)))
8838 conversion *next = next_conversion (convs);
8839 if (next->kind == ck_std)
8841 next = next_conversion (next);
8842 error_at (loc, "cannot bind non-const lvalue reference of "
8843 "type %qH to a value of type %qI",
8844 totype, next->type);
8846 else if (!CP_TYPE_CONST_P (TREE_TYPE (ref_type)))
8847 error_at (loc, "cannot bind non-const lvalue reference of "
8848 "type %qH to an rvalue of type %qI", totype, extype);
8849 else // extype is volatile
8850 error_at (loc, "cannot bind lvalue reference of type "
8851 "%qH to an rvalue of type %qI", totype,
8852 extype);
8854 else if (!reference_compatible_p (TREE_TYPE (totype), extype))
8856 /* If we're converting from T[] to T[N], don't talk
8857 about discarding qualifiers. (Converting from T[N] to
8858 T[] is allowed by P0388R4.) */
8859 if (TREE_CODE (extype) == ARRAY_TYPE
8860 && TYPE_DOMAIN (extype) == NULL_TREE
8861 && TREE_CODE (TREE_TYPE (totype)) == ARRAY_TYPE
8862 && TYPE_DOMAIN (TREE_TYPE (totype)) != NULL_TREE)
8863 error_at (loc, "cannot bind reference of type %qH to %qI "
8864 "due to different array bounds", totype, extype);
8865 else
8866 error_at (loc, "binding reference of type %qH to %qI "
8867 "discards qualifiers", totype, extype);
8869 else
8870 gcc_unreachable ();
8871 maybe_print_user_conv_context (convs);
8872 maybe_inform_about_fndecl_for_bogus_argument_init (fn, argnum);
8874 return error_mark_node;
8876 else if (complain & tf_warning)
8877 maybe_warn_array_conv (loc, convs, expr);
8879 /* If necessary, create a temporary.
8881 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
8882 that need temporaries, even when their types are reference
8883 compatible with the type of reference being bound, so the
8884 upcoming call to cp_build_addr_expr doesn't fail. */
8885 if (convs->need_temporary_p
8886 || TREE_CODE (expr) == CONSTRUCTOR
8887 || TREE_CODE (expr) == VA_ARG_EXPR)
8889 /* Otherwise, a temporary of type "cv1 T1" is created and
8890 initialized from the initializer expression using the rules
8891 for a non-reference copy-initialization (8.5). */
8893 tree type = TREE_TYPE (ref_type);
8894 cp_lvalue_kind lvalue = lvalue_kind (expr);
8896 gcc_assert (similar_type_p (type, next_conversion (convs)->type));
8897 if (!CP_TYPE_CONST_NON_VOLATILE_P (type)
8898 && !TYPE_REF_IS_RVALUE (ref_type))
8900 /* If the reference is volatile or non-const, we
8901 cannot create a temporary. */
8902 if (complain & tf_error)
8904 if (lvalue & clk_bitfield)
8905 error_at (loc, "cannot bind bit-field %qE to %qT",
8906 expr, ref_type);
8907 else if (lvalue & clk_packed)
8908 error_at (loc, "cannot bind packed field %qE to %qT",
8909 expr, ref_type);
8910 else
8911 error_at (loc, "cannot bind rvalue %qE to %qT",
8912 expr, ref_type);
8914 return error_mark_node;
8916 /* If the source is a packed field, and we must use a copy
8917 constructor, then building the target expr will require
8918 binding the field to the reference parameter to the
8919 copy constructor, and we'll end up with an infinite
8920 loop. If we can use a bitwise copy, then we'll be
8921 OK. */
8922 if ((lvalue & clk_packed)
8923 && CLASS_TYPE_P (type)
8924 && type_has_nontrivial_copy_init (type))
8926 error_at (loc, "cannot bind packed field %qE to %qT",
8927 expr, ref_type);
8928 return error_mark_node;
8930 if (lvalue & clk_bitfield)
8932 expr = convert_bitfield_to_declared_type (expr);
8933 expr = fold_convert (type, expr);
8936 /* Creating &TARGET_EXPR<> in a template would break when
8937 tsubsting the expression, so use an IMPLICIT_CONV_EXPR
8938 instead. This can happen even when there's no class
8939 involved, e.g., when converting an integer to a reference
8940 type. */
8941 if (processing_template_decl)
8942 return build1 (IMPLICIT_CONV_EXPR, totype, expr);
8943 expr = build_target_expr_with_type (expr, type, complain);
8946 /* Take the address of the thing to which we will bind the
8947 reference. */
8948 expr = cp_build_addr_expr (expr, complain);
8949 if (expr == error_mark_node)
8950 return error_mark_node;
8952 /* Convert it to a pointer to the type referred to by the
8953 reference. This will adjust the pointer if a derived to
8954 base conversion is being performed. */
8955 expr = cp_convert (build_pointer_type (TREE_TYPE (ref_type)),
8956 expr, complain);
8957 /* Convert the pointer to the desired reference type. */
8958 return build_nop (ref_type, expr);
8961 case ck_lvalue:
8962 return decay_conversion (expr, complain);
8964 case ck_fnptr:
8965 /* ??? Should the address of a transaction-safe pointer point to the TM
8966 clone, and this conversion look up the primary function? */
8967 return build_nop (totype, expr);
8969 case ck_qual:
8970 /* Warn about deprecated conversion if appropriate. */
8971 if (complain & tf_warning)
8973 string_conv_p (totype, expr, 1);
8974 maybe_warn_array_conv (loc, convs, expr);
8976 break;
8978 case ck_ptr:
8979 if (convs->base_p)
8980 expr = convert_to_base (expr, totype, !c_cast_p,
8981 /*nonnull=*/false, complain);
8982 return build_nop (totype, expr);
8984 case ck_pmem:
8985 return convert_ptrmem (totype, expr, /*allow_inverse_p=*/false,
8986 c_cast_p, complain);
8988 default:
8989 break;
8992 if (convs->check_narrowing
8993 && !check_narrowing (totype, expr, complain,
8994 convs->check_narrowing_const_only))
8995 return error_mark_node;
8997 warning_sentinel w (warn_zero_as_null_pointer_constant);
8998 if (issue_conversion_warnings)
8999 expr = cp_convert_and_check (totype, expr, complain);
9000 else
9002 if (TREE_CODE (expr) == EXCESS_PRECISION_EXPR)
9003 expr = TREE_OPERAND (expr, 0);
9004 expr = cp_convert (totype, expr, complain);
9007 return expr;
9010 /* Return true if converting FROM to TO is unsafe in a template. */
9012 static bool
9013 conv_unsafe_in_template_p (tree to, tree from)
9015 /* Converting classes involves TARGET_EXPR. */
9016 if (CLASS_TYPE_P (to) || CLASS_TYPE_P (from))
9017 return true;
9019 /* Converting real to integer produces FIX_TRUNC_EXPR which tsubst
9020 doesn't handle. */
9021 if (SCALAR_FLOAT_TYPE_P (from) && INTEGRAL_OR_ENUMERATION_TYPE_P (to))
9022 return true;
9024 /* Converting integer to real isn't a trivial conversion, either. */
9025 if (INTEGRAL_OR_ENUMERATION_TYPE_P (from) && SCALAR_FLOAT_TYPE_P (to))
9026 return true;
9028 return false;
9031 /* Wrapper for convert_like_internal that handles creating
9032 IMPLICIT_CONV_EXPR. */
9034 static tree
9035 convert_like (conversion *convs, tree expr, tree fn, int argnum,
9036 bool issue_conversion_warnings, bool c_cast_p, bool nested_p,
9037 tsubst_flags_t complain)
9039 /* Creating &TARGET_EXPR<> in a template breaks when substituting,
9040 and creating a CALL_EXPR in a template breaks in finish_call_expr
9041 so use an IMPLICIT_CONV_EXPR for this conversion. We would have
9042 created such codes e.g. when calling a user-defined conversion
9043 function. */
9044 tree conv_expr = NULL_TREE;
9045 if (processing_template_decl
9046 && convs->kind != ck_identity
9047 && conv_unsafe_in_template_p (convs->type, TREE_TYPE (expr)))
9049 conv_expr = build1 (IMPLICIT_CONV_EXPR, convs->type, expr);
9050 if (convs->kind != ck_ref_bind)
9051 conv_expr = convert_from_reference (conv_expr);
9052 if (!convs->bad_p)
9053 return conv_expr;
9054 /* Do the normal processing to give the bad_p errors. But we still
9055 need to return the IMPLICIT_CONV_EXPR, unless we're returning
9056 error_mark_node. */
9058 expr = convert_like_internal (convs, expr, fn, argnum,
9059 issue_conversion_warnings, c_cast_p,
9060 nested_p, complain);
9061 if (expr == error_mark_node)
9062 return error_mark_node;
9063 return conv_expr ? conv_expr : expr;
9066 /* Convenience wrapper for convert_like. */
9068 static inline tree
9069 convert_like (conversion *convs, tree expr, tsubst_flags_t complain)
9071 return convert_like (convs, expr, NULL_TREE, 0,
9072 /*issue_conversion_warnings=*/true,
9073 /*c_cast_p=*/false, /*nested_p=*/false, complain);
9076 /* Convenience wrapper for convert_like. */
9078 static inline tree
9079 convert_like_with_context (conversion *convs, tree expr, tree fn, int argnum,
9080 tsubst_flags_t complain)
9082 return convert_like (convs, expr, fn, argnum,
9083 /*issue_conversion_warnings=*/true,
9084 /*c_cast_p=*/false, /*nested_p=*/false, complain);
9087 /* ARG is being passed to a varargs function. Perform any conversions
9088 required. Return the converted value. */
9090 tree
9091 convert_arg_to_ellipsis (tree arg, tsubst_flags_t complain)
9093 tree arg_type = TREE_TYPE (arg);
9094 location_t loc = cp_expr_loc_or_input_loc (arg);
9096 /* [expr.call]
9098 If the argument has integral or enumeration type that is subject
9099 to the integral promotions (_conv.prom_), or a floating-point
9100 type that is subject to the floating-point promotion
9101 (_conv.fpprom_), the value of the argument is converted to the
9102 promoted type before the call. */
9103 if (SCALAR_FLOAT_TYPE_P (arg_type)
9104 && (TYPE_PRECISION (arg_type)
9105 < TYPE_PRECISION (double_type_node))
9106 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type))
9107 && !extended_float_type_p (arg_type))
9109 if ((complain & tf_warning)
9110 && warn_double_promotion && !c_inhibit_evaluation_warnings)
9111 warning_at (loc, OPT_Wdouble_promotion,
9112 "implicit conversion from %qH to %qI when passing "
9113 "argument to function",
9114 arg_type, double_type_node);
9115 if (TREE_CODE (arg) == EXCESS_PRECISION_EXPR)
9116 arg = TREE_OPERAND (arg, 0);
9117 arg = mark_rvalue_use (arg);
9118 arg = convert_to_real_nofold (double_type_node, arg);
9120 else if (NULLPTR_TYPE_P (arg_type))
9122 arg = mark_rvalue_use (arg);
9123 if (TREE_SIDE_EFFECTS (arg))
9125 warning_sentinel w(warn_unused_result);
9126 arg = cp_build_compound_expr (arg, null_pointer_node, complain);
9128 else
9129 arg = null_pointer_node;
9131 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type))
9133 if (SCOPED_ENUM_P (arg_type))
9135 tree prom = cp_convert (ENUM_UNDERLYING_TYPE (arg_type), arg,
9136 complain);
9137 prom = cp_perform_integral_promotions (prom, complain);
9138 if (abi_version_crosses (6)
9139 && TYPE_MODE (TREE_TYPE (prom)) != TYPE_MODE (arg_type)
9140 && (complain & tf_warning))
9141 warning_at (loc, OPT_Wabi, "scoped enum %qT passed through %<...%>"
9142 " as %qT before %<-fabi-version=6%>, %qT after",
9143 arg_type,
9144 TREE_TYPE (prom), ENUM_UNDERLYING_TYPE (arg_type));
9145 if (!abi_version_at_least (6))
9146 arg = prom;
9148 else
9149 arg = cp_perform_integral_promotions (arg, complain);
9151 else
9152 /* [expr.call]
9154 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
9155 standard conversions are performed. */
9156 arg = decay_conversion (arg, complain);
9158 arg = require_complete_type (arg, complain);
9159 arg_type = TREE_TYPE (arg);
9161 if (arg != error_mark_node
9162 /* In a template (or ill-formed code), we can have an incomplete type
9163 even after require_complete_type, in which case we don't know
9164 whether it has trivial copy or not. */
9165 && COMPLETE_TYPE_P (arg_type)
9166 && !cp_unevaluated_operand)
9168 /* [expr.call] 5.2.2/7:
9169 Passing a potentially-evaluated argument of class type (Clause 9)
9170 with a non-trivial copy constructor or a non-trivial destructor
9171 with no corresponding parameter is conditionally-supported, with
9172 implementation-defined semantics.
9174 We support it as pass-by-invisible-reference, just like a normal
9175 value parameter.
9177 If the call appears in the context of a sizeof expression,
9178 it is not potentially-evaluated. */
9179 if (type_has_nontrivial_copy_init (arg_type)
9180 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type))
9182 arg = force_rvalue (arg, complain);
9183 if (complain & tf_warning)
9184 warning (OPT_Wconditionally_supported,
9185 "passing objects of non-trivially-copyable "
9186 "type %q#T through %<...%> is conditionally supported",
9187 arg_type);
9188 return build1 (ADDR_EXPR, build_reference_type (arg_type), arg);
9190 /* Build up a real lvalue-to-rvalue conversion in case the
9191 copy constructor is trivial but not callable. */
9192 else if (CLASS_TYPE_P (arg_type))
9193 force_rvalue (arg, complain);
9197 return arg;
9200 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
9202 tree
9203 build_x_va_arg (location_t loc, tree expr, tree type)
9205 if (processing_template_decl)
9207 tree r = build_min (VA_ARG_EXPR, type, expr);
9208 SET_EXPR_LOCATION (r, loc);
9209 return r;
9212 type = complete_type_or_else (type, NULL_TREE);
9214 if (expr == error_mark_node || !type)
9215 return error_mark_node;
9217 expr = mark_lvalue_use (expr);
9219 if (TYPE_REF_P (type))
9221 error ("cannot receive reference type %qT through %<...%>", type);
9222 return error_mark_node;
9225 if (type_has_nontrivial_copy_init (type)
9226 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
9228 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
9229 it as pass by invisible reference. */
9230 warning_at (loc, OPT_Wconditionally_supported,
9231 "receiving objects of non-trivially-copyable type %q#T "
9232 "through %<...%> is conditionally-supported", type);
9234 tree ref = cp_build_reference_type (type, false);
9235 expr = build_va_arg (loc, expr, ref);
9236 return convert_from_reference (expr);
9239 tree ret = build_va_arg (loc, expr, type);
9240 if (CLASS_TYPE_P (type))
9241 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
9242 know how to handle it. */
9243 ret = get_target_expr (ret);
9244 return ret;
9247 /* TYPE has been given to va_arg. Apply the default conversions which
9248 would have happened when passed via ellipsis. Return the promoted
9249 type, or the passed type if there is no change. */
9251 tree
9252 cxx_type_promotes_to (tree type)
9254 tree promote;
9256 /* Perform the array-to-pointer and function-to-pointer
9257 conversions. */
9258 type = type_decays_to (type);
9260 promote = type_promotes_to (type);
9261 if (same_type_p (type, promote))
9262 promote = type;
9264 return promote;
9267 /* ARG is a default argument expression being passed to a parameter of
9268 the indicated TYPE, which is a parameter to FN. PARMNUM is the
9269 zero-based argument number. Do any required conversions. Return
9270 the converted value. */
9272 static GTY(()) vec<tree, va_gc> *default_arg_context;
9273 void
9274 push_defarg_context (tree fn)
9275 { vec_safe_push (default_arg_context, fn); }
9277 void
9278 pop_defarg_context (void)
9279 { default_arg_context->pop (); }
9281 tree
9282 convert_default_arg (tree type, tree arg, tree fn, int parmnum,
9283 tsubst_flags_t complain)
9285 int i;
9286 tree t;
9288 /* See through clones. */
9289 fn = DECL_ORIGIN (fn);
9290 /* And inheriting ctors. */
9291 if (flag_new_inheriting_ctors)
9292 fn = strip_inheriting_ctors (fn);
9294 /* Detect recursion. */
9295 FOR_EACH_VEC_SAFE_ELT (default_arg_context, i, t)
9296 if (t == fn)
9298 if (complain & tf_error)
9299 error ("recursive evaluation of default argument for %q#D", fn);
9300 return error_mark_node;
9303 /* If the ARG is an unparsed default argument expression, the
9304 conversion cannot be performed. */
9305 if (TREE_CODE (arg) == DEFERRED_PARSE)
9307 if (complain & tf_error)
9308 error ("call to %qD uses the default argument for parameter %P, which "
9309 "is not yet defined", fn, parmnum);
9310 return error_mark_node;
9313 push_defarg_context (fn);
9315 if (fn && DECL_TEMPLATE_INFO (fn))
9316 arg = tsubst_default_argument (fn, parmnum, type, arg, complain);
9318 /* Due to:
9320 [dcl.fct.default]
9322 The names in the expression are bound, and the semantic
9323 constraints are checked, at the point where the default
9324 expressions appears.
9326 we must not perform access checks here. */
9327 push_deferring_access_checks (dk_no_check);
9328 /* We must make a copy of ARG, in case subsequent processing
9329 alters any part of it. */
9330 arg = break_out_target_exprs (arg, /*clear location*/true);
9332 arg = convert_for_initialization (0, type, arg, LOOKUP_IMPLICIT,
9333 ICR_DEFAULT_ARGUMENT, fn, parmnum,
9334 complain);
9335 arg = convert_for_arg_passing (type, arg, complain);
9336 pop_deferring_access_checks();
9338 pop_defarg_context ();
9340 return arg;
9343 /* Returns the type which will really be used for passing an argument of
9344 type TYPE. */
9346 tree
9347 type_passed_as (tree type)
9349 /* Pass classes with copy ctors by invisible reference. */
9350 if (TREE_ADDRESSABLE (type))
9351 type = build_reference_type (type);
9352 else if (targetm.calls.promote_prototypes (NULL_TREE)
9353 && INTEGRAL_TYPE_P (type)
9354 && COMPLETE_TYPE_P (type)
9355 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
9356 type = integer_type_node;
9358 return type;
9361 /* Actually perform the appropriate conversion. */
9363 tree
9364 convert_for_arg_passing (tree type, tree val, tsubst_flags_t complain)
9366 tree bitfield_type;
9368 /* If VAL is a bitfield, then -- since it has already been converted
9369 to TYPE -- it cannot have a precision greater than TYPE.
9371 If it has a smaller precision, we must widen it here. For
9372 example, passing "int f:3;" to a function expecting an "int" will
9373 not result in any conversion before this point.
9375 If the precision is the same we must not risk widening. For
9376 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
9377 often have type "int", even though the C++ type for the field is
9378 "long long". If the value is being passed to a function
9379 expecting an "int", then no conversions will be required. But,
9380 if we call convert_bitfield_to_declared_type, the bitfield will
9381 be converted to "long long". */
9382 bitfield_type = is_bitfield_expr_with_lowered_type (val);
9383 if (bitfield_type
9384 && TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type))
9385 val = convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type), val);
9387 if (val == error_mark_node)
9389 /* Pass classes with copy ctors by invisible reference. */
9390 else if (TREE_ADDRESSABLE (type))
9391 val = build1 (ADDR_EXPR, build_reference_type (type), val);
9392 else if (targetm.calls.promote_prototypes (NULL_TREE)
9393 && INTEGRAL_TYPE_P (type)
9394 && COMPLETE_TYPE_P (type)
9395 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
9396 val = cp_perform_integral_promotions (val, complain);
9397 if (complain & tf_warning)
9399 if (warn_suggest_attribute_format)
9401 tree rhstype = TREE_TYPE (val);
9402 const enum tree_code coder = TREE_CODE (rhstype);
9403 const enum tree_code codel = TREE_CODE (type);
9404 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
9405 && coder == codel
9406 && check_missing_format_attribute (type, rhstype))
9407 warning (OPT_Wsuggest_attribute_format,
9408 "argument of function call might be a candidate "
9409 "for a format attribute");
9411 maybe_warn_parm_abi (type, cp_expr_loc_or_input_loc (val));
9414 if (complain & tf_warning)
9415 warn_for_address_of_packed_member (type, val);
9417 return val;
9420 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
9421 which just decay_conversion or no conversions at all should be done.
9422 This is true for some builtins which don't act like normal functions.
9423 Return 2 if just decay_conversion and removal of excess precision should
9424 be done, 1 if just decay_conversion. Return 3 for special treatment of
9425 the 3rd argument for __builtin_*_overflow_p. Return 4 for special
9426 treatment of the 1st argument for
9427 __builtin_{clz,ctz,clrsb,ffs,parity,popcount}g. */
9430 magic_varargs_p (tree fn)
9432 if (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL)
9433 switch (DECL_FUNCTION_CODE (fn))
9435 case BUILT_IN_CLASSIFY_TYPE:
9436 case BUILT_IN_CONSTANT_P:
9437 case BUILT_IN_NEXT_ARG:
9438 case BUILT_IN_VA_START:
9439 return 1;
9441 case BUILT_IN_ADD_OVERFLOW_P:
9442 case BUILT_IN_SUB_OVERFLOW_P:
9443 case BUILT_IN_MUL_OVERFLOW_P:
9444 return 3;
9446 case BUILT_IN_ISFINITE:
9447 case BUILT_IN_ISINF:
9448 case BUILT_IN_ISINF_SIGN:
9449 case BUILT_IN_ISNAN:
9450 case BUILT_IN_ISNORMAL:
9451 case BUILT_IN_FPCLASSIFY:
9452 return 2;
9454 case BUILT_IN_CLZG:
9455 case BUILT_IN_CTZG:
9456 case BUILT_IN_CLRSBG:
9457 case BUILT_IN_FFSG:
9458 case BUILT_IN_PARITYG:
9459 case BUILT_IN_POPCOUNTG:
9460 return 4;
9462 default:
9463 return lookup_attribute ("type generic",
9464 TYPE_ATTRIBUTES (TREE_TYPE (fn))) != 0;
9467 return 0;
9470 /* Returns the decl of the dispatcher function if FN is a function version. */
9472 tree
9473 get_function_version_dispatcher (tree fn)
9475 tree dispatcher_decl = NULL;
9477 if (DECL_LOCAL_DECL_P (fn))
9478 fn = DECL_LOCAL_DECL_ALIAS (fn);
9480 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
9481 && DECL_FUNCTION_VERSIONED (fn));
9483 gcc_assert (targetm.get_function_versions_dispatcher);
9484 dispatcher_decl = targetm.get_function_versions_dispatcher (fn);
9486 if (dispatcher_decl == NULL)
9488 error_at (input_location, "use of multiversioned function "
9489 "without a default");
9490 return NULL;
9493 retrofit_lang_decl (dispatcher_decl);
9494 gcc_assert (dispatcher_decl != NULL);
9495 return dispatcher_decl;
9498 /* fn is a function version dispatcher that is marked used. Mark all the
9499 semantically identical function versions it will dispatch as used. */
9501 void
9502 mark_versions_used (tree fn)
9504 struct cgraph_node *node;
9505 struct cgraph_function_version_info *node_v;
9506 struct cgraph_function_version_info *it_v;
9508 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
9510 node = cgraph_node::get (fn);
9511 if (node == NULL)
9512 return;
9514 gcc_assert (node->dispatcher_function);
9516 node_v = node->function_version ();
9517 if (node_v == NULL)
9518 return;
9520 /* All semantically identical versions are chained. Traverse and mark each
9521 one of them as used. */
9522 it_v = node_v->next;
9523 while (it_v != NULL)
9525 mark_used (it_v->this_node->decl);
9526 it_v = it_v->next;
9530 /* Build a call to "the copy constructor" for the type of A, even if it
9531 wouldn't be selected by normal overload resolution. Used for
9532 diagnostics. */
9534 static tree
9535 call_copy_ctor (tree a, tsubst_flags_t complain)
9537 tree ctype = TYPE_MAIN_VARIANT (TREE_TYPE (a));
9538 tree binfo = TYPE_BINFO (ctype);
9539 tree copy = get_copy_ctor (ctype, complain);
9540 copy = build_baselink (binfo, binfo, copy, NULL_TREE);
9541 tree ob = build_dummy_object (ctype);
9542 releasing_vec args (make_tree_vector_single (a));
9543 tree r = build_new_method_call (ob, copy, &args, NULL_TREE,
9544 LOOKUP_NORMAL, NULL, complain);
9545 return r;
9548 /* Return the base constructor corresponding to COMPLETE_CTOR or NULL_TREE. */
9550 static tree
9551 base_ctor_for (tree complete_ctor)
9553 tree clone;
9554 FOR_EACH_CLONE (clone, DECL_CLONED_FUNCTION (complete_ctor))
9555 if (DECL_BASE_CONSTRUCTOR_P (clone))
9556 return clone;
9557 return NULL_TREE;
9560 /* Try to make EXP suitable to be used as the initializer for a base subobject,
9561 and return whether we were successful. EXP must have already been cleared
9562 by unsafe_copy_elision_p{,_opt}. */
9564 static bool
9565 make_base_init_ok (tree exp)
9567 if (TREE_CODE (exp) == TARGET_EXPR)
9568 exp = TARGET_EXPR_INITIAL (exp);
9569 while (TREE_CODE (exp) == COMPOUND_EXPR)
9570 exp = TREE_OPERAND (exp, 1);
9571 if (TREE_CODE (exp) == COND_EXPR)
9573 bool ret = make_base_init_ok (TREE_OPERAND (exp, 2));
9574 if (tree op1 = TREE_OPERAND (exp, 1))
9576 bool r1 = make_base_init_ok (op1);
9577 /* If unsafe_copy_elision_p was false, the arms should match. */
9578 gcc_assert (r1 == ret);
9580 return ret;
9582 if (TREE_CODE (exp) != AGGR_INIT_EXPR)
9583 /* A trivial copy is OK. */
9584 return true;
9585 if (!AGGR_INIT_VIA_CTOR_P (exp))
9586 /* unsafe_copy_elision_p_opt must have said this is OK. */
9587 return true;
9588 tree fn = cp_get_callee_fndecl_nofold (exp);
9589 if (DECL_BASE_CONSTRUCTOR_P (fn))
9590 return true;
9591 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (fn));
9592 fn = base_ctor_for (fn);
9593 if (!fn || DECL_HAS_VTT_PARM_P (fn))
9594 /* The base constructor has more parameters, so we can't just change the
9595 call target. It would be possible to splice in the appropriate
9596 arguments, but probably not worth the complexity. */
9597 return false;
9598 mark_used (fn);
9599 AGGR_INIT_EXPR_FN (exp) = build_address (fn);
9600 return true;
9603 /* Return 2 if T refers to a base, 1 if a potentially-overlapping field,
9604 neither of which can be used for return by invisible reference. We avoid
9605 doing C++17 mandatory copy elision for either of these cases.
9607 This returns non-zero even if the type of T has no tail padding that other
9608 data could be allocated into, because that depends on the particular ABI.
9609 unsafe_copy_elision_p_opt does consider whether there is padding. */
9612 unsafe_return_slot_p (tree t)
9614 /* Check empty bases separately, they don't have fields. */
9615 if (is_empty_base_ref (t))
9616 return 2;
9618 /* A delegating constructor might be used to initialize a base. */
9619 if (current_function_decl
9620 && DECL_CONSTRUCTOR_P (current_function_decl)
9621 && (t == current_class_ref
9622 || tree_strip_nop_conversions (t) == current_class_ptr))
9623 return 2;
9625 STRIP_NOPS (t);
9626 if (TREE_CODE (t) == ADDR_EXPR)
9627 t = TREE_OPERAND (t, 0);
9628 if (TREE_CODE (t) == COMPONENT_REF)
9629 t = TREE_OPERAND (t, 1);
9630 if (TREE_CODE (t) != FIELD_DECL)
9631 return false;
9632 if (!CLASS_TYPE_P (TREE_TYPE (t)))
9633 /* The middle-end will do the right thing for scalar types. */
9634 return false;
9635 if (DECL_FIELD_IS_BASE (t))
9636 return 2;
9637 if (lookup_attribute ("no_unique_address", DECL_ATTRIBUTES (t)))
9638 return 1;
9639 return 0;
9642 /* True IFF EXP is a prvalue that represents return by invisible reference. */
9644 static bool
9645 init_by_return_slot_p (tree exp)
9647 /* Copy elision only happens with a TARGET_EXPR. */
9648 if (TREE_CODE (exp) != TARGET_EXPR)
9649 return false;
9650 tree init = TARGET_EXPR_INITIAL (exp);
9651 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
9652 while (TREE_CODE (init) == COMPOUND_EXPR)
9653 init = TREE_OPERAND (init, 1);
9654 if (TREE_CODE (init) == COND_EXPR)
9656 /* We'll end up copying from each of the arms of the COND_EXPR directly
9657 into the target, so look at them. */
9658 if (tree op = TREE_OPERAND (init, 1))
9659 if (init_by_return_slot_p (op))
9660 return true;
9661 return init_by_return_slot_p (TREE_OPERAND (init, 2));
9663 return (TREE_CODE (init) == AGGR_INIT_EXPR
9664 && !AGGR_INIT_VIA_CTOR_P (init));
9667 /* We can't elide a copy from a function returning by value to a
9668 potentially-overlapping subobject, as the callee might clobber tail padding.
9669 Return true iff this could be that case.
9671 Places that use this function (or _opt) to decide to elide a copy should
9672 probably use make_safe_copy_elision instead. */
9674 bool
9675 unsafe_copy_elision_p (tree target, tree exp)
9677 return unsafe_return_slot_p (target) && init_by_return_slot_p (exp);
9680 /* As above, but for optimization allow more cases that are actually safe. */
9682 static bool
9683 unsafe_copy_elision_p_opt (tree target, tree exp)
9685 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
9686 /* It's safe to elide the copy for a class with no tail padding. */
9687 if (!is_empty_class (type)
9688 && tree_int_cst_equal (TYPE_SIZE (type), CLASSTYPE_SIZE (type)))
9689 return false;
9690 return unsafe_copy_elision_p (target, exp);
9693 /* Try to make EXP suitable to be used as the initializer for TARGET,
9694 and return whether we were successful. */
9696 bool
9697 make_safe_copy_elision (tree target, tree exp)
9699 int uns = unsafe_return_slot_p (target);
9700 if (!uns)
9701 return true;
9702 if (init_by_return_slot_p (exp))
9703 return false;
9704 if (uns == 1)
9705 return true;
9706 return make_base_init_ok (exp);
9709 /* True IFF the result of the conversion C is a prvalue. */
9711 static bool
9712 conv_is_prvalue (conversion *c)
9714 if (c->kind == ck_rvalue)
9715 return true;
9716 if (c->kind == ck_base && c->need_temporary_p)
9717 return true;
9718 if (c->kind == ck_user && !TYPE_REF_P (c->type))
9719 return true;
9720 if (c->kind == ck_identity && c->u.expr
9721 && TREE_CODE (c->u.expr) == TARGET_EXPR)
9722 return true;
9724 return false;
9727 /* True iff C is a conversion that binds a reference to a prvalue. */
9729 static bool
9730 conv_binds_ref_to_prvalue (conversion *c)
9732 if (c->kind != ck_ref_bind)
9733 return false;
9734 if (c->need_temporary_p)
9735 return true;
9737 return conv_is_prvalue (next_conversion (c));
9740 /* True iff EXPR represents a (subobject of a) temporary. */
9742 static bool
9743 expr_represents_temporary_p (tree expr)
9745 while (handled_component_p (expr))
9746 expr = TREE_OPERAND (expr, 0);
9747 return TREE_CODE (expr) == TARGET_EXPR;
9750 /* True iff C is a conversion that binds a reference to a temporary.
9751 This is a superset of conv_binds_ref_to_prvalue: here we're also
9752 interested in xvalues. */
9754 static bool
9755 conv_binds_ref_to_temporary (conversion *c)
9757 if (conv_binds_ref_to_prvalue (c))
9758 return true;
9759 if (c->kind != ck_ref_bind)
9760 return false;
9761 c = next_conversion (c);
9762 /* This is the case for
9763 struct Base {};
9764 struct Derived : Base {};
9765 const Base& b(Derived{});
9766 where we bind 'b' to the Base subobject of a temporary object of type
9767 Derived. The subobject is an xvalue; the whole object is a prvalue.
9769 The ck_base doesn't have to be present for cases like X{}.m. */
9770 if (c->kind == ck_base)
9771 c = next_conversion (c);
9772 if (c->kind == ck_identity && c->u.expr
9773 && expr_represents_temporary_p (c->u.expr))
9774 return true;
9775 return false;
9778 /* Return tristate::TS_TRUE if converting EXPR to a reference type TYPE binds
9779 the reference to a temporary. Return tristate::TS_FALSE if converting
9780 EXPR to a reference type TYPE doesn't bind the reference to a temporary. If
9781 the conversion is invalid or bad, return tristate::TS_UNKNOWN. DIRECT_INIT_P
9782 says whether the conversion should be done in direct- or copy-initialization
9783 context. */
9785 tristate
9786 ref_conv_binds_to_temporary (tree type, tree expr, bool direct_init_p/*=false*/)
9788 gcc_assert (TYPE_REF_P (type));
9790 conversion_obstack_sentinel cos;
9792 const int flags = direct_init_p ? LOOKUP_NORMAL : LOOKUP_IMPLICIT;
9793 conversion *conv = implicit_conversion (type, TREE_TYPE (expr), expr,
9794 /*c_cast_p=*/false, flags, tf_none);
9795 tristate ret (tristate::TS_UNKNOWN);
9796 if (conv && !conv->bad_p)
9797 ret = tristate (conv_binds_ref_to_temporary (conv));
9799 return ret;
9802 /* Call the trivial destructor for INSTANCE, which can be either an lvalue of
9803 class type or a pointer to class type. If NO_PTR_DEREF is true and
9804 INSTANCE has pointer type, clobber the pointer rather than what it points
9805 to. */
9807 tree
9808 build_trivial_dtor_call (tree instance, bool no_ptr_deref)
9810 gcc_assert (!is_dummy_object (instance));
9812 if (!flag_lifetime_dse)
9814 no_clobber:
9815 return fold_convert (void_type_node, instance);
9818 if (INDIRECT_TYPE_P (TREE_TYPE (instance))
9819 && (!no_ptr_deref || TYPE_REF_P (TREE_TYPE (instance))))
9821 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (instance))))
9822 goto no_clobber;
9823 instance = cp_build_fold_indirect_ref (instance);
9826 /* A trivial destructor should still clobber the object. */
9827 tree clobber = build_clobber (TREE_TYPE (instance), CLOBBER_OBJECT_END);
9828 return build2 (MODIFY_EXPR, void_type_node,
9829 instance, clobber);
9832 /* Return true if in an immediate function context, or an unevaluated operand,
9833 or a default argument/member initializer, or a subexpression of an immediate
9834 invocation. */
9836 bool
9837 in_immediate_context ()
9839 return (cp_unevaluated_operand != 0
9840 || (current_function_decl != NULL_TREE
9841 && DECL_IMMEDIATE_FUNCTION_P (current_function_decl))
9842 /* DR 2631: default args and DMI aren't immediately evaluated.
9843 Return true here so immediate_invocation_p returns false. */
9844 || current_binding_level->kind == sk_function_parms
9845 || current_binding_level->kind == sk_template_parms
9846 || parsing_nsdmi ()
9847 || in_consteval_if_p);
9850 /* Return true if a call to FN with number of arguments NARGS
9851 is an immediate invocation. */
9853 bool
9854 immediate_invocation_p (tree fn)
9856 return (TREE_CODE (fn) == FUNCTION_DECL
9857 && DECL_IMMEDIATE_FUNCTION_P (fn)
9858 && !in_immediate_context ());
9861 /* Subroutine of the various build_*_call functions. Overload resolution
9862 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
9863 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
9864 bitmask of various LOOKUP_* flags which apply to the call itself. */
9866 static tree
9867 build_over_call (struct z_candidate *cand, int flags, tsubst_flags_t complain)
9869 tree fn = cand->fn;
9870 const vec<tree, va_gc> *args = cand->args;
9871 tree first_arg = cand->first_arg;
9872 conversion **convs = cand->convs;
9873 tree parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
9874 int parmlen;
9875 tree val;
9876 int nargs;
9877 tree *argarray;
9878 bool already_used = false;
9880 /* In a template, there is no need to perform all of the work that
9881 is normally done. We are only interested in the type of the call
9882 expression, i.e., the return type of the function. Any semantic
9883 errors will be deferred until the template is instantiated. */
9884 if (processing_template_decl)
9886 if (undeduced_auto_decl (fn))
9887 mark_used (fn, complain);
9888 else
9889 /* Otherwise set TREE_USED for the benefit of -Wunused-function.
9890 See PR80598. */
9891 TREE_USED (fn) = 1;
9893 tree return_type = TREE_TYPE (TREE_TYPE (fn));
9894 tree callee;
9895 if (first_arg == NULL_TREE)
9897 callee = build_addr_func (fn, complain);
9898 if (callee == error_mark_node)
9899 return error_mark_node;
9901 else
9903 callee = build_baselink (cand->conversion_path, cand->access_path,
9904 fn, NULL_TREE);
9905 callee = build_min (COMPONENT_REF, TREE_TYPE (fn),
9906 first_arg, callee, NULL_TREE);
9909 tree expr = build_call_vec (return_type, callee, args);
9910 SET_EXPR_LOCATION (expr, input_location);
9911 if (TREE_THIS_VOLATILE (fn) && cfun)
9912 current_function_returns_abnormally = 1;
9913 if (immediate_invocation_p (fn))
9915 tree obj_arg = NULL_TREE, exprimm = expr;
9916 if (DECL_CONSTRUCTOR_P (fn))
9917 obj_arg = first_arg;
9918 if (obj_arg
9919 && is_dummy_object (obj_arg)
9920 && !type_dependent_expression_p (obj_arg))
9922 exprimm = build_cplus_new (DECL_CONTEXT (fn), expr, complain);
9923 obj_arg = NULL_TREE;
9925 /* Look through *(const T *)&obj. */
9926 else if (obj_arg && INDIRECT_REF_P (obj_arg))
9928 tree addr = TREE_OPERAND (obj_arg, 0);
9929 STRIP_NOPS (addr);
9930 if (TREE_CODE (addr) == ADDR_EXPR)
9932 tree typeo = TREE_TYPE (obj_arg);
9933 tree typei = TREE_TYPE (TREE_OPERAND (addr, 0));
9934 if (same_type_ignoring_top_level_qualifiers_p (typeo, typei))
9935 obj_arg = TREE_OPERAND (addr, 0);
9938 fold_non_dependent_expr (exprimm, complain,
9939 /*manifestly_const_eval=*/true,
9940 obj_arg);
9942 return convert_from_reference (expr);
9945 /* Give any warnings we noticed during overload resolution. */
9946 if (cand->warnings && (complain & tf_warning))
9948 struct candidate_warning *w;
9949 for (w = cand->warnings; w; w = w->next)
9950 joust (cand, w->loser, 1, complain);
9953 /* Core issue 2327: P0135 doesn't say how to handle the case where the
9954 argument to the copy constructor ends up being a prvalue after
9955 conversion. Let's do the normal processing, but pretend we aren't
9956 actually using the copy constructor. */
9957 bool force_elide = false;
9958 if (cxx_dialect >= cxx17
9959 && cand->num_convs == 1
9960 && DECL_COMPLETE_CONSTRUCTOR_P (fn)
9961 && (DECL_COPY_CONSTRUCTOR_P (fn)
9962 || DECL_MOVE_CONSTRUCTOR_P (fn))
9963 && !unsafe_return_slot_p (first_arg)
9964 && conv_binds_ref_to_prvalue (convs[0]))
9966 force_elide = true;
9967 goto not_really_used;
9970 /* OK, we're actually calling this inherited constructor; set its deletedness
9971 appropriately. We can get away with doing this here because calling is
9972 the only way to refer to a constructor. */
9973 if (DECL_INHERITED_CTOR (fn)
9974 && !deduce_inheriting_ctor (fn))
9976 if (complain & tf_error)
9977 mark_used (fn);
9978 return error_mark_node;
9981 /* Make =delete work with SFINAE. */
9982 if (DECL_DELETED_FN (fn))
9984 if (complain & tf_error)
9986 mark_used (fn);
9987 if (cand->next)
9989 if (flag_diagnostics_all_candidates)
9990 print_z_candidates (input_location, cand, /*only_viable_p=*/false);
9991 else
9992 inform (input_location,
9993 "use %<-fdiagnostics-all-candidates%> to display "
9994 "considered candidates");
9997 return error_mark_node;
10000 if (DECL_FUNCTION_MEMBER_P (fn))
10002 tree access_fn;
10003 /* If FN is a template function, two cases must be considered.
10004 For example:
10006 struct A {
10007 protected:
10008 template <class T> void f();
10010 template <class T> struct B {
10011 protected:
10012 void g();
10014 struct C : A, B<int> {
10015 using A::f; // #1
10016 using B<int>::g; // #2
10019 In case #1 where `A::f' is a member template, DECL_ACCESS is
10020 recorded in the primary template but not in its specialization.
10021 We check access of FN using its primary template.
10023 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
10024 because it is a member of class template B, DECL_ACCESS is
10025 recorded in the specialization `B<int>::g'. We cannot use its
10026 primary template because `B<T>::g' and `B<int>::g' may have
10027 different access. */
10028 if (DECL_TEMPLATE_INFO (fn)
10029 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
10030 access_fn = DECL_TI_TEMPLATE (fn);
10031 else
10032 access_fn = fn;
10033 if (!perform_or_defer_access_check (cand->access_path, access_fn,
10034 fn, complain))
10035 return error_mark_node;
10038 /* If we're checking for implicit delete, don't bother with argument
10039 conversions. */
10040 if (flags & LOOKUP_SPECULATIVE)
10042 if (cand->viable == 1)
10043 return fn;
10044 else if (!(complain & tf_error))
10045 /* Reject bad conversions now. */
10046 return error_mark_node;
10047 /* else continue to get conversion error. */
10050 not_really_used:
10052 /* N3276 magic doesn't apply to nested calls. */
10053 tsubst_flags_t decltype_flag = (complain & tf_decltype);
10054 complain &= ~tf_decltype;
10055 /* No-Cleanup doesn't apply to nested calls either. */
10056 tsubst_flags_t no_cleanup_complain = complain;
10057 complain &= ~tf_no_cleanup;
10059 /* Find maximum size of vector to hold converted arguments. */
10060 parmlen = list_length (parm);
10061 nargs = vec_safe_length (args) + (first_arg != NULL_TREE ? 1 : 0);
10062 if (parmlen > nargs)
10063 nargs = parmlen;
10064 argarray = XALLOCAVEC (tree, nargs);
10066 in_consteval_if_p_temp_override icip;
10067 /* If the call is immediate function invocation, make sure
10068 taking address of immediate functions is allowed in its arguments. */
10069 if (immediate_invocation_p (STRIP_TEMPLATE (fn)))
10070 in_consteval_if_p = true;
10072 int argarray_size = 0;
10073 unsigned int arg_index = 0;
10074 int conv_index = 0;
10075 int param_index = 0;
10077 auto consume_object_arg = [&arg_index, &first_arg, args]()
10079 if (!first_arg)
10080 return (*args)[arg_index++];
10081 tree object_arg = first_arg;
10082 first_arg = NULL_TREE;
10083 return object_arg;
10086 /* The implicit parameters to a constructor are not considered by overload
10087 resolution, and must be of the proper type. */
10088 if (DECL_CONSTRUCTOR_P (fn))
10090 tree object_arg = consume_object_arg ();
10091 argarray[argarray_size++] = build_this (object_arg);
10092 parm = TREE_CHAIN (parm);
10093 /* We should never try to call the abstract constructor. */
10094 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn));
10096 if (DECL_HAS_VTT_PARM_P (fn))
10098 argarray[argarray_size++] = (*args)[arg_index];
10099 ++arg_index;
10100 parm = TREE_CHAIN (parm);
10103 /* Bypass access control for 'this' parameter. */
10104 else if (DECL_IOBJ_MEMBER_FUNCTION_P (fn))
10106 tree arg = build_this (consume_object_arg ());
10107 tree argtype = TREE_TYPE (arg);
10109 if (arg == error_mark_node)
10110 return error_mark_node;
10111 if (convs[conv_index++]->bad_p)
10113 if (complain & tf_error)
10115 auto_diagnostic_group d;
10116 if (permerror (input_location, "passing %qT as %<this%> "
10117 "argument discards qualifiers",
10118 TREE_TYPE (argtype)))
10119 inform (DECL_SOURCE_LOCATION (fn), " in call to %qD", fn);
10121 else
10122 return error_mark_node;
10125 /* The class where FN is defined. */
10126 tree ctx = DECL_CONTEXT (fn);
10128 /* See if the function member or the whole class type is declared
10129 final and the call can be devirtualized. */
10130 if (DECL_FINAL_P (fn) || CLASSTYPE_FINAL (ctx))
10131 flags |= LOOKUP_NONVIRTUAL;
10133 /* [class.mfct.non-static]: If a non-static member function of a class
10134 X is called for an object that is not of type X, or of a type
10135 derived from X, the behavior is undefined.
10137 So we can assume that anything passed as 'this' is non-null, and
10138 optimize accordingly. */
10139 /* Check that the base class is accessible. */
10140 if (!accessible_base_p (TREE_TYPE (argtype),
10141 BINFO_TYPE (cand->conversion_path), true))
10143 if (complain & tf_error)
10144 error ("%qT is not an accessible base of %qT",
10145 BINFO_TYPE (cand->conversion_path),
10146 TREE_TYPE (argtype));
10147 else
10148 return error_mark_node;
10150 /* If fn was found by a using declaration, the conversion path
10151 will be to the derived class, not the base declaring fn. We
10152 must convert to the base. */
10153 tree base_binfo = cand->conversion_path;
10154 if (BINFO_TYPE (base_binfo) != ctx)
10156 base_binfo = lookup_base (base_binfo, ctx, ba_unique, NULL, complain);
10157 if (base_binfo == error_mark_node)
10158 return error_mark_node;
10161 /* If we know the dynamic type of the object, look up the final overrider
10162 in the BINFO. */
10163 if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0
10164 && resolves_to_fixed_type_p (arg))
10166 tree ov = lookup_vfn_in_binfo (DECL_VINDEX (fn), base_binfo);
10168 /* And unwind base_binfo to match. If we don't find the type we're
10169 looking for in BINFO_INHERITANCE_CHAIN, we're looking at diamond
10170 inheritance; for now do a normal virtual call in that case. */
10171 tree octx = DECL_CONTEXT (ov);
10172 tree obinfo = base_binfo;
10173 while (obinfo && !SAME_BINFO_TYPE_P (BINFO_TYPE (obinfo), octx))
10174 obinfo = BINFO_INHERITANCE_CHAIN (obinfo);
10175 if (obinfo)
10177 fn = ov;
10178 base_binfo = obinfo;
10179 flags |= LOOKUP_NONVIRTUAL;
10183 tree converted_arg = build_base_path (PLUS_EXPR, arg,
10184 base_binfo, 1, complain);
10186 argarray[argarray_size++] = converted_arg;
10187 parm = TREE_CHAIN (parm);
10190 auto handle_arg = [fn, flags, complain](tree type,
10191 tree arg,
10192 int const param_index,
10193 conversion *conv,
10194 bool const conversion_warning)
10196 /* Set user_conv_p on the argument conversions, so rvalue/base handling
10197 knows not to allow any more UDCs. This needs to happen after we
10198 process cand->warnings. */
10199 if (flags & LOOKUP_NO_CONVERSION)
10200 conv->user_conv_p = true;
10202 tsubst_flags_t const arg_complain
10203 = conversion_warning ? complain : complain & ~tf_warning;
10205 if (arg_complain & tf_warning)
10206 maybe_warn_pessimizing_move (arg, type, /*return_p=*/false);
10208 tree val = convert_like_with_context (conv, arg, fn,
10209 param_index, arg_complain);
10210 val = convert_for_arg_passing (type, val, arg_complain);
10211 return val;
10214 if (DECL_XOBJ_MEMBER_FUNCTION_P (fn))
10216 gcc_assert (cand->num_convs > 0);
10217 static constexpr bool conversion_warning = true;
10218 tree object_arg = consume_object_arg ();
10219 val = handle_arg (TREE_VALUE (parm),
10220 object_arg,
10221 param_index++,
10222 convs[conv_index++],
10223 conversion_warning);
10225 if (val == error_mark_node)
10226 return error_mark_node;
10227 else
10228 argarray[argarray_size++] = val;
10229 parm = TREE_CHAIN (parm);
10232 gcc_assert (first_arg == NULL_TREE);
10233 for (; arg_index < vec_safe_length (args) && parm;
10234 parm = TREE_CHAIN (parm), ++arg_index, ++param_index, ++conv_index)
10236 tree current_arg = (*args)[arg_index];
10238 /* If the argument is NULL and used to (implicitly) instantiate a
10239 template function (and bind one of the template arguments to
10240 the type of 'long int'), we don't want to warn about passing NULL
10241 to non-pointer argument.
10242 For example, if we have this template function:
10244 template<typename T> void func(T x) {}
10246 we want to warn (when -Wconversion is enabled) in this case:
10248 void foo() {
10249 func<int>(NULL);
10252 but not in this case:
10254 void foo() {
10255 func(NULL);
10258 bool const conversion_warning = !(null_node_p (current_arg)
10259 && DECL_TEMPLATE_INFO (fn)
10260 && cand->template_decl
10261 && !cand->explicit_targs);
10263 val = handle_arg (TREE_VALUE (parm),
10264 current_arg,
10265 param_index,
10266 convs[conv_index],
10267 conversion_warning);
10269 if (val == error_mark_node)
10270 return error_mark_node;
10271 else
10272 argarray[argarray_size++] = val;
10275 /* Default arguments */
10276 for (; parm && parm != void_list_node; parm = TREE_CHAIN (parm), param_index++)
10278 if (TREE_VALUE (parm) == error_mark_node)
10279 return error_mark_node;
10280 val = convert_default_arg (TREE_VALUE (parm),
10281 TREE_PURPOSE (parm),
10282 fn, param_index,
10283 complain);
10284 if (val == error_mark_node)
10285 return error_mark_node;
10286 argarray[argarray_size++] = val;
10289 /* Ellipsis */
10290 int magic = magic_varargs_p (fn);
10291 for (; arg_index < vec_safe_length (args); ++arg_index)
10293 tree a = (*args)[arg_index];
10294 if ((magic == 3 && arg_index == 2) || (magic == 4 && arg_index == 0))
10296 /* Do no conversions for certain magic varargs. */
10297 a = mark_type_use (a);
10298 if (TREE_CODE (a) == FUNCTION_DECL && reject_gcc_builtin (a))
10299 return error_mark_node;
10301 else if (magic != 0)
10303 /* Don't truncate excess precision to the semantic type. */
10304 if (magic == 1 && TREE_CODE (a) == EXCESS_PRECISION_EXPR)
10305 a = TREE_OPERAND (a, 0);
10306 /* For other magic varargs only do decay_conversion. */
10307 a = decay_conversion (a, complain);
10309 else if (DECL_CONSTRUCTOR_P (fn)
10310 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn),
10311 TREE_TYPE (a)))
10313 /* Avoid infinite recursion trying to call A(...). */
10314 if (complain & tf_error)
10315 /* Try to call the actual copy constructor for a good error. */
10316 call_copy_ctor (a, complain);
10317 return error_mark_node;
10319 else
10320 a = convert_arg_to_ellipsis (a, complain);
10321 if (a == error_mark_node)
10322 return error_mark_node;
10323 argarray[argarray_size++] = a;
10326 gcc_assert (argarray_size <= nargs);
10327 nargs = argarray_size;
10328 icip.reset ();
10330 /* Avoid performing argument transformation if warnings are disabled.
10331 When tf_warning is set and at least one of the warnings is active
10332 the check_function_arguments function might warn about something. */
10334 bool warned_p = false;
10335 if ((complain & tf_warning)
10336 && (warn_nonnull
10337 || warn_format
10338 || warn_suggest_attribute_format
10339 || warn_restrict))
10341 tree *fargs = (!nargs ? argarray
10342 : (tree *) alloca (nargs * sizeof (tree)));
10343 for (int j = 0; j < nargs; j++)
10345 /* For -Wformat undo the implicit passing by hidden reference
10346 done by convert_arg_to_ellipsis. */
10347 if (TREE_CODE (argarray[j]) == ADDR_EXPR
10348 && TYPE_REF_P (TREE_TYPE (argarray[j])))
10349 fargs[j] = TREE_OPERAND (argarray[j], 0);
10350 else
10351 fargs[j] = argarray[j];
10354 warned_p = check_function_arguments (input_location, fn, TREE_TYPE (fn),
10355 nargs, fargs, NULL);
10358 if (DECL_INHERITED_CTOR (fn))
10360 /* Check for passing ellipsis arguments to an inherited constructor. We
10361 could handle this by open-coding the inherited constructor rather than
10362 defining it, but let's not bother now. */
10363 if (!cp_unevaluated_operand
10364 && cand->num_convs
10365 && cand->convs[cand->num_convs-1]->ellipsis_p)
10367 if (complain & tf_error)
10369 sorry ("passing arguments to ellipsis of inherited constructor "
10370 "%qD", cand->fn);
10371 inform (DECL_SOURCE_LOCATION (cand->fn), "declared here");
10373 return error_mark_node;
10376 /* A base constructor inheriting from a virtual base doesn't get the
10377 inherited arguments, just this and __vtt. */
10378 if (ctor_omit_inherited_parms (fn))
10379 nargs = 2;
10382 /* Avoid actually calling copy constructors and copy assignment operators,
10383 if possible. */
10385 if (!force_elide
10386 && (!flag_elide_constructors
10387 /* It's unsafe to elide the operation when handling
10388 a noexcept-expression, it may evaluate to the wrong
10389 value (c++/53025, c++/96090). */
10390 || cp_noexcept_operand != 0))
10391 /* Do things the hard way. */;
10392 else if (cand->num_convs == 1
10393 && (DECL_COPY_CONSTRUCTOR_P (fn)
10394 || DECL_MOVE_CONSTRUCTOR_P (fn)))
10396 tree targ;
10397 tree arg = argarray[num_artificial_parms_for (fn)];
10398 tree fa = argarray[0];
10399 bool trivial = trivial_fn_p (fn);
10401 /* Pull out the real argument, disregarding const-correctness. */
10402 targ = arg;
10403 /* Strip the reference binding for the constructor parameter. */
10404 if (CONVERT_EXPR_P (targ)
10405 && TYPE_REF_P (TREE_TYPE (targ)))
10406 targ = TREE_OPERAND (targ, 0);
10407 /* But don't strip any other reference bindings; binding a temporary to a
10408 reference prevents copy elision. */
10409 while ((CONVERT_EXPR_P (targ)
10410 && !TYPE_REF_P (TREE_TYPE (targ)))
10411 || TREE_CODE (targ) == NON_LVALUE_EXPR)
10412 targ = TREE_OPERAND (targ, 0);
10413 if (TREE_CODE (targ) == ADDR_EXPR)
10415 targ = TREE_OPERAND (targ, 0);
10416 if (!same_type_ignoring_top_level_qualifiers_p
10417 (TREE_TYPE (TREE_TYPE (arg)), TREE_TYPE (targ)))
10418 targ = NULL_TREE;
10420 else
10421 targ = NULL_TREE;
10423 if (targ)
10424 arg = targ;
10425 else
10426 arg = cp_build_fold_indirect_ref (arg);
10428 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a
10429 potentially-overlapping subobject. */
10430 if (CHECKING_P && cxx_dialect >= cxx17)
10431 gcc_assert (TREE_CODE (arg) != TARGET_EXPR
10432 || force_elide
10433 /* It's from binding the ref parm to a packed field. */
10434 || convs[0]->need_temporary_p
10435 || seen_error ()
10436 /* See unsafe_copy_elision_p. */
10437 || unsafe_return_slot_p (fa));
10439 bool unsafe = unsafe_copy_elision_p_opt (fa, arg);
10440 bool eliding_temp = (TREE_CODE (arg) == TARGET_EXPR && !unsafe);
10442 /* [class.copy]: the copy constructor is implicitly defined even if the
10443 implementation elided its use. But don't warn about deprecation when
10444 eliding a temporary, as then no copy is actually performed. */
10445 warning_sentinel s (warn_deprecated_copy, eliding_temp);
10446 if (force_elide)
10447 /* The language says this isn't called. */;
10448 else if (!trivial)
10450 if (!mark_used (fn, complain) && !(complain & tf_error))
10451 return error_mark_node;
10452 already_used = true;
10454 else
10455 cp_handle_deprecated_or_unavailable (fn, complain);
10457 if (eliding_temp && DECL_BASE_CONSTRUCTOR_P (fn)
10458 && !make_base_init_ok (arg))
10459 unsafe = true;
10461 /* If we're creating a temp and we already have one, don't create a
10462 new one. If we're not creating a temp but we get one, use
10463 INIT_EXPR to collapse the temp into our target. Otherwise, if the
10464 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
10465 temp or an INIT_EXPR otherwise. */
10466 if (is_dummy_object (fa))
10468 if (TREE_CODE (arg) == TARGET_EXPR)
10469 return arg;
10470 else if (trivial)
10471 return force_target_expr (DECL_CONTEXT (fn), arg, complain);
10473 else if ((trivial || TREE_CODE (arg) == TARGET_EXPR)
10474 && !unsafe)
10476 tree to = cp_build_fold_indirect_ref (fa);
10477 val = cp_build_init_expr (to, arg);
10478 return val;
10481 else if (DECL_ASSIGNMENT_OPERATOR_P (fn)
10482 && DECL_OVERLOADED_OPERATOR_IS (fn, NOP_EXPR)
10483 && trivial_fn_p (fn))
10485 tree to = cp_build_fold_indirect_ref (argarray[0]);
10486 tree type = TREE_TYPE (to);
10487 tree as_base = CLASSTYPE_AS_BASE (type);
10488 tree arg = argarray[1];
10489 location_t loc = cp_expr_loc_or_input_loc (arg);
10491 if (is_really_empty_class (type, /*ignore_vptr*/true))
10493 /* Avoid copying empty classes, but ensure op= returns an lvalue even
10494 if the object argument isn't one. This isn't needed in other cases
10495 since MODIFY_EXPR is always considered an lvalue. */
10496 to = cp_build_addr_expr (to, tf_none);
10497 to = cp_build_indirect_ref (input_location, to, RO_ARROW, complain);
10498 val = build2 (COMPOUND_EXPR, type, arg, to);
10499 suppress_warning (val, OPT_Wunused);
10501 else if (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (as_base)))
10503 if (is_std_init_list (type)
10504 && conv_binds_ref_to_prvalue (convs[1]))
10505 warning_at (loc, OPT_Winit_list_lifetime,
10506 "assignment from temporary %<initializer_list%> does "
10507 "not extend the lifetime of the underlying array");
10508 arg = cp_build_fold_indirect_ref (arg);
10509 val = build2 (MODIFY_EXPR, TREE_TYPE (to), to, arg);
10511 else
10513 /* We must only copy the non-tail padding parts. */
10514 tree arg0, arg2, t;
10515 tree array_type, alias_set;
10517 arg2 = TYPE_SIZE_UNIT (as_base);
10518 to = cp_stabilize_reference (to);
10519 arg0 = cp_build_addr_expr (to, complain);
10521 array_type = build_array_type (unsigned_char_type_node,
10522 build_index_type
10523 (size_binop (MINUS_EXPR,
10524 arg2, size_int (1))));
10525 alias_set = build_int_cst (build_pointer_type (type), 0);
10526 t = build2 (MODIFY_EXPR, void_type_node,
10527 build2 (MEM_REF, array_type, arg0, alias_set),
10528 build2 (MEM_REF, array_type, arg, alias_set));
10529 val = build2 (COMPOUND_EXPR, TREE_TYPE (to), t, to);
10530 suppress_warning (val, OPT_Wunused);
10533 cp_handle_deprecated_or_unavailable (fn, complain);
10535 return val;
10537 else if (trivial_fn_p (fn))
10539 if (DECL_DESTRUCTOR_P (fn))
10540 return build_trivial_dtor_call (argarray[0]);
10541 else if (default_ctor_p (fn))
10543 if (is_dummy_object (argarray[0]))
10544 return force_target_expr (DECL_CONTEXT (fn), void_node,
10545 no_cleanup_complain);
10546 else
10547 return cp_build_fold_indirect_ref (argarray[0]);
10551 gcc_assert (!force_elide);
10553 if (!already_used
10554 && !mark_used (fn, complain))
10555 return error_mark_node;
10557 /* Warn if the built-in writes to an object of a non-trivial type. */
10558 if (warn_class_memaccess
10559 && vec_safe_length (args) >= 2
10560 && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL)
10561 maybe_warn_class_memaccess (input_location, fn, args);
10563 if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0)
10565 tree t;
10566 tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (argarray[0])),
10567 DECL_CONTEXT (fn),
10568 ba_any, NULL, complain);
10569 gcc_assert (binfo && binfo != error_mark_node);
10571 argarray[0] = build_base_path (PLUS_EXPR, argarray[0], binfo, 1,
10572 complain);
10573 if (TREE_SIDE_EFFECTS (argarray[0]))
10574 argarray[0] = save_expr (argarray[0]);
10575 t = build_pointer_type (TREE_TYPE (fn));
10576 fn = build_vfn_ref (argarray[0], DECL_VINDEX (fn));
10577 TREE_TYPE (fn) = t;
10579 else
10581 /* If FN is marked deprecated or unavailable, then we've already
10582 issued a diagnostic from mark_used above, so avoid redundantly
10583 issuing another one from build_addr_func. */
10584 auto w = make_temp_override (deprecated_state,
10585 UNAVAILABLE_DEPRECATED_SUPPRESS);
10587 fn = build_addr_func (fn, complain);
10588 if (fn == error_mark_node)
10589 return error_mark_node;
10591 /* We're actually invoking the function. (Immediate functions get an
10592 & when invoking it even though the user didn't use &.) */
10593 ADDR_EXPR_DENOTES_CALL_P (fn) = true;
10596 tree call = build_cxx_call (fn, nargs, argarray, complain|decltype_flag);
10597 if (call == error_mark_node)
10598 return call;
10599 if (cand->flags & LOOKUP_LIST_INIT_CTOR)
10601 tree c = extract_call_expr (call);
10602 /* build_new_op will clear this when appropriate. */
10603 CALL_EXPR_ORDERED_ARGS (c) = true;
10605 if (warned_p)
10607 tree c = extract_call_expr (call);
10608 if (TREE_CODE (c) == CALL_EXPR)
10609 suppress_warning (c /* Suppress all warnings. */);
10612 return call;
10615 namespace
10618 /* Return the DECL of the first non-static subobject of class TYPE
10619 that satisfies the predicate PRED or null if none can be found. */
10621 template <class Predicate>
10622 tree
10623 first_non_static_field (tree type, Predicate pred)
10625 if (!type || !CLASS_TYPE_P (type))
10626 return NULL_TREE;
10628 for (tree field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
10630 if (TREE_CODE (field) != FIELD_DECL)
10631 continue;
10632 if (TREE_STATIC (field))
10633 continue;
10634 if (pred (field))
10635 return field;
10638 int i = 0;
10640 for (tree base_binfo, binfo = TYPE_BINFO (type);
10641 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
10643 tree base = TREE_TYPE (base_binfo);
10644 if (pred (base))
10645 return base;
10646 if (tree field = first_non_static_field (base, pred))
10647 return field;
10650 return NULL_TREE;
10653 struct NonPublicField
10655 bool operator() (const_tree t) const
10657 return DECL_P (t) && (TREE_PRIVATE (t) || TREE_PROTECTED (t));
10661 /* Return the DECL of the first non-public subobject of class TYPE
10662 or null if none can be found. */
10664 static inline tree
10665 first_non_public_field (tree type)
10667 return first_non_static_field (type, NonPublicField ());
10670 struct NonTrivialField
10672 bool operator() (const_tree t) const
10674 return !trivial_type_p (DECL_P (t) ? TREE_TYPE (t) : t);
10678 /* Return the DECL of the first non-trivial subobject of class TYPE
10679 or null if none can be found. */
10681 static inline tree
10682 first_non_trivial_field (tree type)
10684 return first_non_static_field (type, NonTrivialField ());
10687 } /* unnamed namespace */
10689 /* Return true if all copy and move assignment operator overloads for
10690 class TYPE are trivial and at least one of them is not deleted and,
10691 when ACCESS is set, accessible. Return false otherwise. Set
10692 HASASSIGN to true when the TYPE has a (not necessarily trivial)
10693 copy or move assignment. */
10695 static bool
10696 has_trivial_copy_assign_p (tree type, bool access, bool *hasassign)
10698 tree fns = get_class_binding (type, assign_op_identifier);
10699 bool all_trivial = true;
10701 /* Iterate over overloads of the assignment operator, checking
10702 accessible copy assignments for triviality. */
10704 for (tree f : ovl_range (fns))
10706 /* Skip operators that aren't copy assignments. */
10707 if (!copy_fn_p (f))
10708 continue;
10710 bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f))
10711 || accessible_p (TYPE_BINFO (type), f, true));
10713 /* Skip template assignment operators and deleted functions. */
10714 if (TREE_CODE (f) != FUNCTION_DECL || DECL_DELETED_FN (f))
10715 continue;
10717 if (accessible)
10718 *hasassign = true;
10720 if (!accessible || !trivial_fn_p (f))
10721 all_trivial = false;
10723 /* Break early when both properties have been determined. */
10724 if (*hasassign && !all_trivial)
10725 break;
10728 /* Return true if they're all trivial and one of the expressions
10729 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
10730 tree ref = cp_build_reference_type (type, false);
10731 return (all_trivial
10732 && (is_trivially_xible (MODIFY_EXPR, type, type)
10733 || is_trivially_xible (MODIFY_EXPR, type, ref)));
10736 /* Return true if all copy and move ctor overloads for class TYPE are
10737 trivial and at least one of them is not deleted and, when ACCESS is
10738 set, accessible. Return false otherwise. Set each element of HASCTOR[]
10739 to true when the TYPE has a (not necessarily trivial) default and copy
10740 (or move) ctor, respectively. */
10742 static bool
10743 has_trivial_copy_p (tree type, bool access, bool hasctor[2])
10745 tree fns = get_class_binding (type, complete_ctor_identifier);
10746 bool all_trivial = true;
10748 for (tree f : ovl_range (fns))
10750 /* Skip template constructors. */
10751 if (TREE_CODE (f) != FUNCTION_DECL)
10752 continue;
10754 bool cpy_or_move_ctor_p = copy_fn_p (f);
10756 /* Skip ctors other than default, copy, and move. */
10757 if (!cpy_or_move_ctor_p && !default_ctor_p (f))
10758 continue;
10760 if (DECL_DELETED_FN (f))
10761 continue;
10763 bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f))
10764 || accessible_p (TYPE_BINFO (type), f, true));
10766 if (accessible)
10767 hasctor[cpy_or_move_ctor_p] = true;
10769 if (cpy_or_move_ctor_p && (!accessible || !trivial_fn_p (f)))
10770 all_trivial = false;
10772 /* Break early when both properties have been determined. */
10773 if (hasctor[0] && hasctor[1] && !all_trivial)
10774 break;
10777 return all_trivial;
10780 /* Issue a warning on a call to the built-in function FNDECL if it is
10781 a raw memory write whose destination is not an object of (something
10782 like) trivial or standard layout type with a non-deleted assignment
10783 and copy ctor. Detects const correctness violations, corrupting
10784 references, virtual table pointers, and bypassing non-trivial
10785 assignments. */
10787 static void
10788 maybe_warn_class_memaccess (location_t loc, tree fndecl,
10789 const vec<tree, va_gc> *args)
10791 /* Except for bcopy where it's second, the destination pointer is
10792 the first argument for all functions handled here. Compute
10793 the index of the destination and source arguments. */
10794 unsigned dstidx = DECL_FUNCTION_CODE (fndecl) == BUILT_IN_BCOPY;
10795 unsigned srcidx = !dstidx;
10797 tree dest = (*args)[dstidx];
10798 if (!TREE_TYPE (dest)
10799 || (TREE_CODE (TREE_TYPE (dest)) != ARRAY_TYPE
10800 && !INDIRECT_TYPE_P (TREE_TYPE (dest))))
10801 return;
10803 tree srctype = NULL_TREE;
10805 /* Determine the type of the pointed-to object and whether it's
10806 a complete class type. */
10807 tree desttype = TREE_TYPE (TREE_TYPE (dest));
10809 if (!desttype || !COMPLETE_TYPE_P (desttype) || !CLASS_TYPE_P (desttype))
10810 return;
10812 /* Check to see if the raw memory call is made by a non-static member
10813 function with THIS as the destination argument for the destination
10814 type. If so, and if the class has no non-trivial bases or members,
10815 be more permissive. */
10816 if (current_function_decl
10817 && DECL_OBJECT_MEMBER_FUNCTION_P (current_function_decl)
10818 /* ??? is_object_parameter? */
10819 && is_this_parameter (tree_strip_nop_conversions (dest)))
10821 tree ctx = DECL_CONTEXT (current_function_decl);
10822 bool special = same_type_ignoring_top_level_qualifiers_p (ctx, desttype);
10823 tree binfo = TYPE_BINFO (ctx);
10825 if (special
10826 && !BINFO_VTABLE (binfo)
10827 && !first_non_trivial_field (desttype))
10828 return;
10831 /* True if the class is trivial. */
10832 bool trivial = trivial_type_p (desttype);
10834 /* Set to true if DESTYPE has an accessible copy assignment. */
10835 bool hasassign = false;
10836 /* True if all of the class' overloaded copy assignment operators
10837 are all trivial (and not deleted) and at least one of them is
10838 accessible. */
10839 bool trivassign = has_trivial_copy_assign_p (desttype, true, &hasassign);
10841 /* Set to true if DESTTYPE has an accessible default and copy ctor,
10842 respectively. */
10843 bool hasctors[2] = { false, false };
10845 /* True if all of the class' overloaded copy constructors are all
10846 trivial (and not deleted) and at least one of them is accessible. */
10847 bool trivcopy = has_trivial_copy_p (desttype, true, hasctors);
10849 /* Set FLD to the first private/protected member of the class. */
10850 tree fld = trivial ? first_non_public_field (desttype) : NULL_TREE;
10852 /* The warning format string. */
10853 const char *warnfmt = NULL;
10854 /* A suggested alternative to offer instead of the raw memory call.
10855 Empty string when none can be come up with. */
10856 const char *suggest = "";
10857 bool warned = false;
10859 switch (DECL_FUNCTION_CODE (fndecl))
10861 case BUILT_IN_MEMSET:
10862 if (!integer_zerop (maybe_constant_value ((*args)[1])))
10864 /* Diagnose setting non-copy-assignable or non-trivial types,
10865 or types with a private member, to (potentially) non-zero
10866 bytes. Since the value of the bytes being written is unknown,
10867 suggest using assignment instead (if one exists). Also warn
10868 for writes into objects for which zero-initialization doesn't
10869 mean all bits clear (pointer-to-member data, where null is all
10870 bits set). Since the value being written is (most likely)
10871 non-zero, simply suggest assignment (but not copy assignment). */
10872 suggest = "; use assignment instead";
10873 if (!trivassign)
10874 warnfmt = G_("%qD writing to an object of type %#qT with "
10875 "no trivial copy-assignment");
10876 else if (!trivial)
10877 warnfmt = G_("%qD writing to an object of non-trivial type %#qT%s");
10878 else if (fld)
10880 const char *access = TREE_PRIVATE (fld) ? "private" : "protected";
10881 warned = warning_at (loc, OPT_Wclass_memaccess,
10882 "%qD writing to an object of type %#qT with "
10883 "%qs member %qD",
10884 fndecl, desttype, access, fld);
10886 else if (!zero_init_p (desttype))
10887 warnfmt = G_("%qD writing to an object of type %#qT containing "
10888 "a pointer to data member%s");
10890 break;
10892 /* Fall through. */
10894 case BUILT_IN_BZERO:
10895 /* Similarly to the above, diagnose clearing non-trivial or non-
10896 standard layout objects, or objects of types with no assignmenmt.
10897 Since the value being written is known to be zero, suggest either
10898 copy assignment, copy ctor, or default ctor as an alternative,
10899 depending on what's available. */
10901 if (hasassign && hasctors[0])
10902 suggest = G_("; use assignment or value-initialization instead");
10903 else if (hasassign)
10904 suggest = G_("; use assignment instead");
10905 else if (hasctors[0])
10906 suggest = G_("; use value-initialization instead");
10908 if (!trivassign)
10909 warnfmt = G_("%qD clearing an object of type %#qT with "
10910 "no trivial copy-assignment%s");
10911 else if (!trivial)
10912 warnfmt = G_("%qD clearing an object of non-trivial type %#qT%s");
10913 else if (!zero_init_p (desttype))
10914 warnfmt = G_("%qD clearing an object of type %#qT containing "
10915 "a pointer-to-member%s");
10916 break;
10918 case BUILT_IN_BCOPY:
10919 case BUILT_IN_MEMCPY:
10920 case BUILT_IN_MEMMOVE:
10921 case BUILT_IN_MEMPCPY:
10922 /* Determine the type of the source object. */
10923 srctype = TREE_TYPE ((*args)[srcidx]);
10924 if (!srctype || !INDIRECT_TYPE_P (srctype))
10925 srctype = void_type_node;
10926 else
10927 srctype = TREE_TYPE (srctype);
10929 /* Since it's impossible to determine wheter the byte copy is
10930 being used in place of assignment to an existing object or
10931 as a substitute for initialization, assume it's the former.
10932 Determine the best alternative to use instead depending on
10933 what's not deleted. */
10934 if (hasassign && hasctors[1])
10935 suggest = G_("; use copy-assignment or copy-initialization instead");
10936 else if (hasassign)
10937 suggest = G_("; use copy-assignment instead");
10938 else if (hasctors[1])
10939 suggest = G_("; use copy-initialization instead");
10941 if (!trivassign)
10942 warnfmt = G_("%qD writing to an object of type %#qT with no trivial "
10943 "copy-assignment%s");
10944 else if (!trivially_copyable_p (desttype))
10945 warnfmt = G_("%qD writing to an object of non-trivially copyable "
10946 "type %#qT%s");
10947 else if (!trivcopy)
10948 warnfmt = G_("%qD writing to an object with a deleted copy constructor");
10950 else if (!trivial
10951 && !VOID_TYPE_P (srctype)
10952 && !is_byte_access_type (srctype)
10953 && !same_type_ignoring_top_level_qualifiers_p (desttype,
10954 srctype))
10956 /* Warn when copying into a non-trivial object from an object
10957 of a different type other than void or char. */
10958 warned = warning_at (loc, OPT_Wclass_memaccess,
10959 "%qD copying an object of non-trivial type "
10960 "%#qT from an array of %#qT",
10961 fndecl, desttype, srctype);
10963 else if (fld
10964 && !VOID_TYPE_P (srctype)
10965 && !is_byte_access_type (srctype)
10966 && !same_type_ignoring_top_level_qualifiers_p (desttype,
10967 srctype))
10969 const char *access = TREE_PRIVATE (fld) ? "private" : "protected";
10970 warned = warning_at (loc, OPT_Wclass_memaccess,
10971 "%qD copying an object of type %#qT with "
10972 "%qs member %qD from an array of %#qT; use "
10973 "assignment or copy-initialization instead",
10974 fndecl, desttype, access, fld, srctype);
10976 else if (!trivial && vec_safe_length (args) > 2)
10978 tree sz = maybe_constant_value ((*args)[2]);
10979 if (!tree_fits_uhwi_p (sz))
10980 break;
10982 /* Finally, warn on partial copies. */
10983 unsigned HOST_WIDE_INT typesize
10984 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype));
10985 if (typesize == 0)
10986 break;
10987 if (unsigned HOST_WIDE_INT partial = tree_to_uhwi (sz) % typesize)
10988 warned = warning_at (loc, OPT_Wclass_memaccess,
10989 (typesize - partial > 1
10990 ? G_("%qD writing to an object of "
10991 "a non-trivial type %#qT leaves %wu "
10992 "bytes unchanged")
10993 : G_("%qD writing to an object of "
10994 "a non-trivial type %#qT leaves %wu "
10995 "byte unchanged")),
10996 fndecl, desttype, typesize - partial);
10998 break;
11000 case BUILT_IN_REALLOC:
11002 if (!trivially_copyable_p (desttype))
11003 warnfmt = G_("%qD moving an object of non-trivially copyable type "
11004 "%#qT; use %<new%> and %<delete%> instead");
11005 else if (!trivcopy)
11006 warnfmt = G_("%qD moving an object of type %#qT with deleted copy "
11007 "constructor; use %<new%> and %<delete%> instead");
11008 else if (!get_dtor (desttype, tf_none))
11009 warnfmt = G_("%qD moving an object of type %#qT with deleted "
11010 "destructor");
11011 else if (!trivial)
11013 tree sz = maybe_constant_value ((*args)[1]);
11014 if (TREE_CODE (sz) == INTEGER_CST
11015 && tree_int_cst_lt (sz, TYPE_SIZE_UNIT (desttype)))
11016 /* Finally, warn on reallocation into insufficient space. */
11017 warned = warning_at (loc, OPT_Wclass_memaccess,
11018 "%qD moving an object of non-trivial type "
11019 "%#qT and size %E into a region of size %E",
11020 fndecl, desttype, TYPE_SIZE_UNIT (desttype),
11021 sz);
11023 break;
11025 default:
11026 return;
11029 if (warnfmt)
11031 if (suggest)
11032 warned = warning_at (loc, OPT_Wclass_memaccess,
11033 warnfmt, fndecl, desttype, suggest);
11034 else
11035 warned = warning_at (loc, OPT_Wclass_memaccess,
11036 warnfmt, fndecl, desttype);
11039 if (warned)
11040 inform (location_of (desttype), "%#qT declared here", desttype);
11043 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
11044 If FN is the result of resolving an overloaded target built-in,
11045 ORIG_FNDECL is the original function decl, otherwise it is null.
11046 This function performs no overload resolution, conversion, or other
11047 high-level operations. */
11049 tree
11050 build_cxx_call (tree fn, int nargs, tree *argarray,
11051 tsubst_flags_t complain, tree orig_fndecl)
11053 tree fndecl;
11055 /* Remember roughly where this call is. */
11056 location_t loc = cp_expr_loc_or_input_loc (fn);
11057 fn = build_call_a (fn, nargs, argarray);
11058 SET_EXPR_LOCATION (fn, loc);
11060 fndecl = get_callee_fndecl (fn);
11061 if (!orig_fndecl)
11062 orig_fndecl = fndecl;
11064 /* Check that arguments to builtin functions match the expectations. */
11065 if (fndecl
11066 && !processing_template_decl
11067 && fndecl_built_in_p (fndecl))
11069 int i;
11071 /* We need to take care that values to BUILT_IN_NORMAL
11072 are reduced. */
11073 for (i = 0; i < nargs; i++)
11074 argarray[i] = maybe_constant_value (argarray[i]);
11076 if (!check_builtin_function_arguments (EXPR_LOCATION (fn), vNULL, fndecl,
11077 orig_fndecl, nargs, argarray))
11078 return error_mark_node;
11079 else if (fndecl_built_in_p (fndecl, BUILT_IN_CLEAR_PADDING))
11081 tree arg0 = argarray[0];
11082 STRIP_NOPS (arg0);
11083 if (TREE_CODE (arg0) == ADDR_EXPR
11084 && DECL_P (TREE_OPERAND (arg0, 0))
11085 && same_type_ignoring_top_level_qualifiers_p
11086 (TREE_TYPE (TREE_TYPE (argarray[0])),
11087 TREE_TYPE (TREE_TYPE (arg0))))
11088 /* For __builtin_clear_padding (&var) we know the type
11089 is for a complete object, so there is no risk in clearing
11090 padding that is reused in some derived class member. */;
11091 else if (!trivially_copyable_p (TREE_TYPE (TREE_TYPE (argarray[0]))))
11093 error_at (EXPR_LOC_OR_LOC (argarray[0], input_location),
11094 "argument %u in call to function %qE "
11095 "has pointer to a non-trivially-copyable type (%qT)",
11096 1, fndecl, TREE_TYPE (argarray[0]));
11097 return error_mark_node;
11102 if (VOID_TYPE_P (TREE_TYPE (fn)))
11103 return fn;
11105 /* 5.2.2/11: If a function call is a prvalue of object type: if the
11106 function call is either the operand of a decltype-specifier or the
11107 right operand of a comma operator that is the operand of a
11108 decltype-specifier, a temporary object is not introduced for the
11109 prvalue. The type of the prvalue may be incomplete. */
11110 if (!(complain & tf_decltype))
11112 fn = require_complete_type (fn, complain);
11113 if (fn == error_mark_node)
11114 return error_mark_node;
11116 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn)))
11118 fn = build_cplus_new (TREE_TYPE (fn), fn, complain);
11119 maybe_warn_parm_abi (TREE_TYPE (fn), loc);
11122 return convert_from_reference (fn);
11125 /* Returns the value to use for the in-charge parameter when making a
11126 call to a function with the indicated NAME.
11128 FIXME:Can't we find a neater way to do this mapping? */
11130 tree
11131 in_charge_arg_for_name (tree name)
11133 if (IDENTIFIER_CTOR_P (name))
11135 if (name == complete_ctor_identifier)
11136 return integer_one_node;
11137 gcc_checking_assert (name == base_ctor_identifier);
11139 else
11141 if (name == complete_dtor_identifier)
11142 return integer_two_node;
11143 else if (name == deleting_dtor_identifier)
11144 return integer_three_node;
11145 gcc_checking_assert (name == base_dtor_identifier);
11148 return integer_zero_node;
11151 /* We've built up a constructor call RET. Complain if it delegates to the
11152 constructor we're currently compiling. */
11154 static void
11155 check_self_delegation (tree ret)
11157 if (TREE_CODE (ret) == TARGET_EXPR)
11158 ret = TARGET_EXPR_INITIAL (ret);
11159 tree fn = cp_get_callee_fndecl_nofold (ret);
11160 if (fn && DECL_ABSTRACT_ORIGIN (fn) == current_function_decl)
11161 error ("constructor delegates to itself");
11164 /* Build a call to a constructor, destructor, or an assignment
11165 operator for INSTANCE, an expression with class type. NAME
11166 indicates the special member function to call; *ARGS are the
11167 arguments. ARGS may be NULL. This may change ARGS. BINFO
11168 indicates the base of INSTANCE that is to be passed as the `this'
11169 parameter to the member function called.
11171 FLAGS are the LOOKUP_* flags to use when processing the call.
11173 If NAME indicates a complete object constructor, INSTANCE may be
11174 NULL_TREE. In this case, the caller will call build_cplus_new to
11175 store the newly constructed object into a VAR_DECL. */
11177 tree
11178 build_special_member_call (tree instance, tree name, vec<tree, va_gc> **args,
11179 tree binfo, int flags, tsubst_flags_t complain)
11181 tree fns;
11182 /* The type of the subobject to be constructed or destroyed. */
11183 tree class_type;
11184 vec<tree, va_gc> *allocated = NULL;
11185 tree ret;
11187 gcc_assert (IDENTIFIER_CDTOR_P (name) || name == assign_op_identifier);
11189 if (error_operand_p (instance))
11190 return error_mark_node;
11192 if (IDENTIFIER_DTOR_P (name))
11194 gcc_assert (args == NULL || vec_safe_is_empty (*args));
11195 if (!type_build_dtor_call (TREE_TYPE (instance)))
11196 /* Shortcut to avoid lazy destructor declaration. */
11197 return build_trivial_dtor_call (instance);
11200 if (TYPE_P (binfo))
11202 /* Resolve the name. */
11203 if (!complete_type_or_maybe_complain (binfo, NULL_TREE, complain))
11204 return error_mark_node;
11206 binfo = TYPE_BINFO (binfo);
11209 gcc_assert (binfo != NULL_TREE);
11211 class_type = BINFO_TYPE (binfo);
11213 /* Handle the special case where INSTANCE is NULL_TREE. */
11214 if (name == complete_ctor_identifier && !instance)
11215 instance = build_dummy_object (class_type);
11216 else
11218 /* Convert to the base class, if necessary. */
11219 if (!same_type_ignoring_top_level_qualifiers_p
11220 (TREE_TYPE (instance), BINFO_TYPE (binfo)))
11222 if (IDENTIFIER_CDTOR_P (name))
11223 /* For constructors and destructors, either the base is
11224 non-virtual, or it is virtual but we are doing the
11225 conversion from a constructor or destructor for the
11226 complete object. In either case, we can convert
11227 statically. */
11228 instance = convert_to_base_statically (instance, binfo);
11229 else
11231 /* However, for assignment operators, we must convert
11232 dynamically if the base is virtual. */
11233 gcc_checking_assert (name == assign_op_identifier);
11234 instance = build_base_path (PLUS_EXPR, instance,
11235 binfo, /*nonnull=*/1, complain);
11240 gcc_assert (instance != NULL_TREE);
11242 /* In C++17, "If the initializer expression is a prvalue and the
11243 cv-unqualified version of the source type is the same class as the class
11244 of the destination, the initializer expression is used to initialize the
11245 destination object." Handle that here to avoid doing overload
11246 resolution. */
11247 if (cxx_dialect >= cxx17
11248 && args && vec_safe_length (*args) == 1
11249 && !unsafe_return_slot_p (instance))
11251 tree arg = (**args)[0];
11253 if (BRACE_ENCLOSED_INITIALIZER_P (arg)
11254 && !TYPE_HAS_LIST_CTOR (class_type)
11255 && !CONSTRUCTOR_IS_DESIGNATED_INIT (arg)
11256 && CONSTRUCTOR_NELTS (arg) == 1)
11257 arg = CONSTRUCTOR_ELT (arg, 0)->value;
11259 if ((TREE_CODE (arg) == TARGET_EXPR
11260 || TREE_CODE (arg) == CONSTRUCTOR)
11261 && (same_type_ignoring_top_level_qualifiers_p
11262 (class_type, TREE_TYPE (arg))))
11264 if (is_dummy_object (instance))
11265 return arg;
11266 else if (TREE_CODE (arg) == TARGET_EXPR)
11267 TARGET_EXPR_DIRECT_INIT_P (arg) = true;
11269 if ((complain & tf_error)
11270 && (flags & LOOKUP_DELEGATING_CONS))
11271 check_self_delegation (arg);
11272 /* Avoid change of behavior on Wunused-var-2.C. */
11273 instance = mark_lvalue_use (instance);
11274 return cp_build_init_expr (instance, arg);
11278 fns = lookup_fnfields (binfo, name, 1, complain);
11280 /* When making a call to a constructor or destructor for a subobject
11281 that uses virtual base classes, pass down a pointer to a VTT for
11282 the subobject. */
11283 if ((name == base_ctor_identifier
11284 || name == base_dtor_identifier)
11285 && CLASSTYPE_VBASECLASSES (class_type))
11287 tree vtt;
11288 tree sub_vtt;
11290 /* If the current function is a complete object constructor
11291 or destructor, then we fetch the VTT directly.
11292 Otherwise, we look it up using the VTT we were given. */
11293 vtt = DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type));
11294 vtt = decay_conversion (vtt, complain);
11295 if (vtt == error_mark_node)
11296 return error_mark_node;
11297 vtt = build_if_in_charge (vtt, current_vtt_parm);
11298 if (BINFO_SUBVTT_INDEX (binfo))
11299 sub_vtt = fold_build_pointer_plus (vtt, BINFO_SUBVTT_INDEX (binfo));
11300 else
11301 sub_vtt = vtt;
11303 if (args == NULL)
11305 allocated = make_tree_vector ();
11306 args = &allocated;
11309 vec_safe_insert (*args, 0, sub_vtt);
11312 ret = build_new_method_call (instance, fns, args,
11313 TYPE_BINFO (BINFO_TYPE (binfo)),
11314 flags, /*fn=*/NULL,
11315 complain);
11317 if (allocated != NULL)
11318 release_tree_vector (allocated);
11320 if ((complain & tf_error)
11321 && (flags & LOOKUP_DELEGATING_CONS)
11322 && name == complete_ctor_identifier)
11323 check_self_delegation (ret);
11325 return ret;
11328 /* Return the NAME, as a C string. The NAME indicates a function that
11329 is a member of TYPE. *FREE_P is set to true if the caller must
11330 free the memory returned.
11332 Rather than go through all of this, we should simply set the names
11333 of constructors and destructors appropriately, and dispense with
11334 ctor_identifier, dtor_identifier, etc. */
11336 static char *
11337 name_as_c_string (tree name, tree type, bool *free_p)
11339 const char *pretty_name;
11341 /* Assume that we will not allocate memory. */
11342 *free_p = false;
11343 /* Constructors and destructors are special. */
11344 if (IDENTIFIER_CDTOR_P (name))
11346 pretty_name
11347 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type)));
11348 /* For a destructor, add the '~'. */
11349 if (IDENTIFIER_DTOR_P (name))
11351 pretty_name = concat ("~", pretty_name, NULL);
11352 /* Remember that we need to free the memory allocated. */
11353 *free_p = true;
11356 else if (IDENTIFIER_CONV_OP_P (name))
11358 pretty_name = concat ("operator ",
11359 type_as_string_translate (TREE_TYPE (name),
11360 TFF_PLAIN_IDENTIFIER),
11361 NULL);
11362 /* Remember that we need to free the memory allocated. */
11363 *free_p = true;
11365 else
11366 pretty_name = identifier_to_locale (IDENTIFIER_POINTER (name));
11368 return CONST_CAST (char *, pretty_name);
11371 /* If CANDIDATES contains exactly one candidate, return it, otherwise
11372 return NULL. */
11374 static z_candidate *
11375 single_z_candidate (z_candidate *candidates)
11377 if (candidates == NULL)
11378 return NULL;
11380 if (candidates->next)
11381 return NULL;
11383 return candidates;
11386 /* If CANDIDATE is invalid due to a bad argument type, return the
11387 pertinent conversion_info.
11389 Otherwise, return NULL. */
11391 static const conversion_info *
11392 maybe_get_bad_conversion_for_unmatched_call (const z_candidate *candidate)
11394 /* Must be an rr_arg_conversion or rr_bad_arg_conversion. */
11395 rejection_reason *r = candidate->reason;
11397 if (r == NULL)
11398 return NULL;
11400 switch (r->code)
11402 default:
11403 return NULL;
11405 case rr_arg_conversion:
11406 return &r->u.conversion;
11408 case rr_bad_arg_conversion:
11409 return &r->u.bad_conversion;
11413 /* Issue an error and note complaining about a bad argument type at a
11414 callsite with a single candidate FNDECL.
11416 ARG_LOC is the location of the argument (or UNKNOWN_LOCATION, in which
11417 case input_location is used).
11418 FROM_TYPE is the type of the actual argument; TO_TYPE is the type of
11419 the formal parameter. */
11421 void
11422 complain_about_bad_argument (location_t arg_loc,
11423 tree from_type, tree to_type,
11424 tree fndecl, int parmnum)
11426 auto_diagnostic_group d;
11427 range_label_for_type_mismatch rhs_label (from_type, to_type);
11428 range_label *label = &rhs_label;
11429 if (arg_loc == UNKNOWN_LOCATION)
11431 arg_loc = input_location;
11432 label = NULL;
11434 gcc_rich_location richloc (arg_loc, label);
11435 error_at (&richloc,
11436 "cannot convert %qH to %qI",
11437 from_type, to_type);
11438 maybe_inform_about_fndecl_for_bogus_argument_init (fndecl,
11439 parmnum);
11442 /* Subroutine of build_new_method_call_1, for where there are no viable
11443 candidates for the call. */
11445 static void
11446 complain_about_no_candidates_for_method_call (tree instance,
11447 z_candidate *candidates,
11448 tree explicit_targs,
11449 tree basetype,
11450 tree optype, tree name,
11451 bool skip_first_for_error,
11452 vec<tree, va_gc> *user_args)
11454 auto_diagnostic_group d;
11455 if (!COMPLETE_OR_OPEN_TYPE_P (basetype))
11456 cxx_incomplete_type_error (instance, basetype);
11457 else if (optype)
11458 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
11459 basetype, optype, build_tree_list_vec (user_args),
11460 TREE_TYPE (instance));
11461 else
11463 /* Special-case for when there's a single candidate that's failing
11464 due to a bad argument type. */
11465 if (z_candidate *candidate = single_z_candidate (candidates))
11466 if (const conversion_info *conv
11467 = maybe_get_bad_conversion_for_unmatched_call (candidate))
11469 tree from_type = conv->from;
11470 if (!TYPE_P (conv->from))
11471 from_type = lvalue_type (conv->from);
11472 complain_about_bad_argument (conv->loc,
11473 from_type, conv->to_type,
11474 candidate->fn, conv->n_arg);
11475 return;
11478 tree arglist = build_tree_list_vec (user_args);
11479 tree errname = name;
11480 bool twiddle = false;
11481 if (IDENTIFIER_CDTOR_P (errname))
11483 twiddle = IDENTIFIER_DTOR_P (errname);
11484 errname = constructor_name (basetype);
11486 if (explicit_targs)
11487 errname = lookup_template_function (errname, explicit_targs);
11488 if (skip_first_for_error)
11489 arglist = TREE_CHAIN (arglist);
11490 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
11491 basetype, &"~"[!twiddle], errname, arglist,
11492 TREE_TYPE (instance));
11494 print_z_candidates (location_of (name), candidates);
11497 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
11498 be set, upon return, to the function called. ARGS may be NULL.
11499 This may change ARGS. */
11501 tree
11502 build_new_method_call (tree instance, tree fns, vec<tree, va_gc> **args,
11503 tree conversion_path, int flags,
11504 tree *fn_p, tsubst_flags_t complain)
11506 struct z_candidate *candidates = 0, *cand;
11507 tree explicit_targs = NULL_TREE;
11508 tree basetype = NULL_TREE;
11509 tree access_binfo;
11510 tree optype;
11511 tree first_mem_arg = NULL_TREE;
11512 tree name;
11513 bool skip_first_for_error;
11514 vec<tree, va_gc> *user_args;
11515 tree call;
11516 tree fn;
11517 int template_only = 0;
11518 bool any_viable_p;
11519 tree orig_instance;
11520 tree orig_fns;
11521 vec<tree, va_gc> *orig_args = NULL;
11523 auto_cond_timevar tv (TV_OVERLOAD);
11525 gcc_assert (instance != NULL_TREE);
11527 /* We don't know what function we're going to call, yet. */
11528 if (fn_p)
11529 *fn_p = NULL_TREE;
11531 if (error_operand_p (instance)
11532 || !fns || error_operand_p (fns))
11533 return error_mark_node;
11535 if (!BASELINK_P (fns))
11537 if (complain & tf_error)
11538 error ("call to non-function %qD", fns);
11539 return error_mark_node;
11542 orig_instance = instance;
11543 orig_fns = fns;
11545 /* Dismantle the baselink to collect all the information we need. */
11546 if (!conversion_path)
11547 conversion_path = BASELINK_BINFO (fns);
11548 access_binfo = BASELINK_ACCESS_BINFO (fns);
11549 optype = BASELINK_OPTYPE (fns);
11550 fns = BASELINK_FUNCTIONS (fns);
11551 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
11553 explicit_targs = TREE_OPERAND (fns, 1);
11554 fns = TREE_OPERAND (fns, 0);
11555 template_only = 1;
11557 gcc_assert (OVL_P (fns));
11558 fn = OVL_FIRST (fns);
11559 name = DECL_NAME (fn);
11561 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (instance));
11562 gcc_assert (CLASS_TYPE_P (basetype));
11564 user_args = args == NULL ? NULL : *args;
11565 /* Under DR 147 A::A() is an invalid constructor call,
11566 not a functional cast. */
11567 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
11569 if (! (complain & tf_error))
11570 return error_mark_node;
11572 basetype = DECL_CONTEXT (fn);
11573 name = constructor_name (basetype);
11574 auto_diagnostic_group d;
11575 if (permerror (input_location,
11576 "cannot call constructor %<%T::%D%> directly",
11577 basetype, name))
11578 inform (input_location, "for a function-style cast, remove the "
11579 "redundant %<::%D%>", name);
11580 call = build_functional_cast (input_location, basetype,
11581 build_tree_list_vec (user_args),
11582 complain);
11583 return call;
11586 if (processing_template_decl)
11587 orig_args = args == NULL ? NULL : make_tree_vector_copy (*args);
11589 /* Process the argument list. */
11590 if (args != NULL && *args != NULL)
11592 *args = resolve_args (*args, complain);
11593 if (*args == NULL)
11594 return error_mark_node;
11595 user_args = *args;
11598 /* Consider the object argument to be used even if we end up selecting a
11599 static member function. */
11600 instance = mark_type_use (instance);
11602 /* Figure out whether to skip the first argument for the error
11603 message we will display to users if an error occurs. We don't
11604 want to display any compiler-generated arguments. The "this"
11605 pointer hasn't been added yet. However, we must remove the VTT
11606 pointer if this is a call to a base-class constructor or
11607 destructor. */
11608 skip_first_for_error = false;
11609 if (IDENTIFIER_CDTOR_P (name))
11611 /* Callers should explicitly indicate whether they want to ctor
11612 the complete object or just the part without virtual bases. */
11613 gcc_assert (name != ctor_identifier);
11615 /* Remove the VTT pointer, if present. */
11616 if ((name == base_ctor_identifier || name == base_dtor_identifier)
11617 && CLASSTYPE_VBASECLASSES (basetype))
11618 skip_first_for_error = true;
11620 /* It's OK to call destructors and constructors on cv-qualified
11621 objects. Therefore, convert the INSTANCE to the unqualified
11622 type, if necessary. */
11623 if (!same_type_p (basetype, TREE_TYPE (instance)))
11625 instance = build_this (instance);
11626 instance = build_nop (build_pointer_type (basetype), instance);
11627 instance = build_fold_indirect_ref (instance);
11630 else
11631 gcc_assert (!DECL_DESTRUCTOR_P (fn) && !DECL_CONSTRUCTOR_P (fn));
11633 /* For the overload resolution we need to find the actual `this`
11634 that would be captured if the call turns out to be to a
11635 non-static member function. Do not actually capture it at this
11636 point. */
11637 if (DECL_CONSTRUCTOR_P (fn))
11638 /* Constructors don't use the enclosing 'this'. */
11639 first_mem_arg = instance;
11640 else
11641 first_mem_arg = maybe_resolve_dummy (instance, false);
11643 conversion_obstack_sentinel cos;
11645 /* The number of arguments artificial parms in ARGS; we subtract one because
11646 there's no 'this' in ARGS. */
11647 unsigned skip = num_artificial_parms_for (fn) - 1;
11649 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
11650 initializer, not T({ }). */
11651 if (DECL_CONSTRUCTOR_P (fn)
11652 && vec_safe_length (user_args) > skip
11653 && DIRECT_LIST_INIT_P ((*user_args)[skip]))
11655 tree init_list = (*user_args)[skip];
11656 tree init = NULL_TREE;
11658 gcc_assert (user_args->length () == skip + 1
11659 && !(flags & LOOKUP_ONLYCONVERTING));
11661 /* If the initializer list has no elements and T is a class type with
11662 a default constructor, the object is value-initialized. Handle
11663 this here so we don't need to handle it wherever we use
11664 build_special_member_call. */
11665 if (CONSTRUCTOR_NELTS (init_list) == 0
11666 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype)
11667 /* For a user-provided default constructor, use the normal
11668 mechanisms so that protected access works. */
11669 && type_has_non_user_provided_default_constructor (basetype)
11670 && !processing_template_decl)
11671 init = build_value_init (basetype, complain);
11673 /* If BASETYPE is an aggregate, we need to do aggregate
11674 initialization. */
11675 else if (CP_AGGREGATE_TYPE_P (basetype))
11677 init = reshape_init (basetype, init_list, complain);
11678 init = digest_init (basetype, init, complain);
11681 if (init)
11683 if (is_dummy_object (instance))
11684 return get_target_expr (init, complain);
11685 return cp_build_init_expr (instance, init);
11688 /* Otherwise go ahead with overload resolution. */
11689 add_list_candidates (fns, first_mem_arg, user_args,
11690 basetype, explicit_targs, template_only,
11691 conversion_path, access_binfo, flags,
11692 &candidates, complain);
11694 else
11695 add_candidates (fns, first_mem_arg, user_args, optype,
11696 explicit_targs, template_only, conversion_path,
11697 access_binfo, flags, &candidates, complain);
11699 any_viable_p = false;
11700 candidates = splice_viable (candidates, false, &any_viable_p);
11702 if (!any_viable_p)
11704 /* [dcl.init], 17.6.2.2:
11706 Otherwise, if no constructor is viable, the destination type is
11707 a (possibly cv-qualified) aggregate class A, and the initializer
11708 is a parenthesized expression-list, the object is initialized as
11709 follows...
11711 We achieve this by building up a CONSTRUCTOR, as for list-init,
11712 and setting CONSTRUCTOR_IS_PAREN_INIT to distinguish between
11713 the two. */
11714 if (DECL_CONSTRUCTOR_P (fn)
11715 && !(flags & LOOKUP_ONLYCONVERTING)
11716 && cxx_dialect >= cxx20
11717 && CP_AGGREGATE_TYPE_P (basetype)
11718 && !vec_safe_is_empty (user_args))
11720 /* Create a CONSTRUCTOR from ARGS, e.g. {1, 2} from <1, 2>. */
11721 tree ctor = build_constructor_from_vec (init_list_type_node,
11722 user_args);
11723 CONSTRUCTOR_IS_DIRECT_INIT (ctor) = true;
11724 CONSTRUCTOR_IS_PAREN_INIT (ctor) = true;
11725 if (is_dummy_object (instance))
11726 return ctor;
11727 else
11729 ctor = digest_init (basetype, ctor, complain);
11730 if (ctor == error_mark_node)
11731 return error_mark_node;
11732 return cp_build_init_expr (instance, ctor);
11735 if (complain & tf_error)
11736 complain_about_no_candidates_for_method_call (instance, candidates,
11737 explicit_targs, basetype,
11738 optype, name,
11739 skip_first_for_error,
11740 user_args);
11741 call = error_mark_node;
11743 else
11745 cand = tourney (candidates, complain);
11746 if (cand == 0)
11748 char *pretty_name;
11749 bool free_p;
11750 tree arglist;
11752 if (complain & tf_error)
11754 pretty_name = name_as_c_string (name, basetype, &free_p);
11755 arglist = build_tree_list_vec (user_args);
11756 if (skip_first_for_error)
11757 arglist = TREE_CHAIN (arglist);
11758 auto_diagnostic_group d;
11759 if (!any_strictly_viable (candidates))
11760 error ("no matching function for call to %<%s(%A)%>",
11761 pretty_name, arglist);
11762 else
11763 error ("call of overloaded %<%s(%A)%> is ambiguous",
11764 pretty_name, arglist);
11765 print_z_candidates (location_of (name), candidates);
11766 if (free_p)
11767 free (pretty_name);
11769 call = error_mark_node;
11770 if (fn_p)
11771 *fn_p = error_mark_node;
11773 else
11775 fn = cand->fn;
11776 call = NULL_TREE;
11778 if (!(flags & LOOKUP_NONVIRTUAL)
11779 && DECL_PURE_VIRTUAL_P (fn)
11780 && instance == current_class_ref
11781 && (complain & tf_warning))
11783 /* This is not an error, it is runtime undefined
11784 behavior. */
11785 if (!current_function_decl)
11786 warning (0, "pure virtual %q#D called from "
11787 "non-static data member initializer", fn);
11788 else if (DECL_CONSTRUCTOR_P (current_function_decl)
11789 || DECL_DESTRUCTOR_P (current_function_decl))
11790 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl)
11791 ? G_("pure virtual %q#D called from constructor")
11792 : G_("pure virtual %q#D called from destructor")),
11793 fn);
11796 if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE
11797 && !DECL_CONSTRUCTOR_P (fn)
11798 && is_dummy_object (instance))
11800 instance = maybe_resolve_dummy (instance, true);
11801 if (instance == error_mark_node)
11802 call = error_mark_node;
11803 else if (!is_dummy_object (instance))
11805 /* We captured 'this' in the current lambda now that
11806 we know we really need it. */
11807 cand->first_arg = instance;
11809 else if (current_class_ptr && any_dependent_bases_p ())
11810 /* We can't tell until instantiation time whether we can use
11811 *this as the implicit object argument. */;
11812 else
11814 if (complain & tf_error)
11815 error ("cannot call member function %qD without object",
11816 fn);
11817 call = error_mark_node;
11821 if (call != error_mark_node)
11823 /* Now we know what function is being called. */
11824 if (fn_p)
11825 *fn_p = fn;
11826 /* Build the actual CALL_EXPR. */
11827 call = build_over_call (cand, flags, complain);
11829 /* Suppress warnings for if (my_struct.operator= (x)) where
11830 my_struct is implicitly converted to bool. */
11831 if (TREE_CODE (call) == MODIFY_EXPR)
11832 suppress_warning (call, OPT_Wparentheses);
11834 /* In an expression of the form `a->f()' where `f' turns
11835 out to be a static member function, `a' is
11836 none-the-less evaluated. */
11837 if (!is_dummy_object (instance))
11838 call = keep_unused_object_arg (call, instance, fn);
11839 if (call != error_mark_node
11840 && DECL_DESTRUCTOR_P (cand->fn)
11841 && !VOID_TYPE_P (TREE_TYPE (call)))
11842 /* An explicit call of the form "x->~X()" has type
11843 "void". However, on platforms where destructors
11844 return "this" (i.e., those where
11845 targetm.cxx.cdtor_returns_this is true), such calls
11846 will appear to have a return value of pointer type
11847 to the low-level call machinery. We do not want to
11848 change the low-level machinery, since we want to be
11849 able to optimize "delete f()" on such platforms as
11850 "operator delete(~X(f()))" (rather than generating
11851 "t = f(), ~X(t), operator delete (t)"). */
11852 call = build_nop (void_type_node, call);
11857 if (processing_template_decl && call != error_mark_node)
11859 bool cast_to_void = false;
11861 if (TREE_CODE (call) == COMPOUND_EXPR)
11862 call = TREE_OPERAND (call, 1);
11863 else if (TREE_CODE (call) == NOP_EXPR)
11865 cast_to_void = true;
11866 call = TREE_OPERAND (call, 0);
11868 if (INDIRECT_REF_P (call))
11869 call = TREE_OPERAND (call, 0);
11871 /* Prune all but the selected function from the original overload
11872 set so that we can avoid some duplicate work at instantiation time. */
11873 if (really_overloaded_fn (fns))
11875 if (DECL_TEMPLATE_INFO (fn)
11876 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
11878 /* Use the selected template, not the specialization, so that
11879 this looks like an actual lookup result for sake of
11880 filter_memfn_lookup. */
11882 if (OVL_SINGLE_P (fns))
11883 /* If the original overload set consists of a single function
11884 template, this isn't beneficial. */
11885 goto skip_prune;
11887 fn = ovl_make (DECL_TI_TEMPLATE (fn));
11888 if (template_only)
11889 fn = lookup_template_function (fn, explicit_targs);
11891 orig_fns = copy_node (orig_fns);
11892 BASELINK_FUNCTIONS (orig_fns) = fn;
11893 BASELINK_FUNCTIONS_MAYBE_INCOMPLETE_P (orig_fns) = true;
11896 skip_prune:
11897 call = (build_min_non_dep_call_vec
11898 (call,
11899 build_min (COMPONENT_REF, TREE_TYPE (CALL_EXPR_FN (call)),
11900 orig_instance, orig_fns, NULL_TREE),
11901 orig_args));
11902 SET_EXPR_LOCATION (call, input_location);
11903 call = convert_from_reference (call);
11904 if (cast_to_void)
11905 call = build_nop (void_type_node, call);
11908 if (orig_args != NULL)
11909 release_tree_vector (orig_args);
11911 return call;
11914 /* Returns true iff standard conversion sequence ICS1 is a proper
11915 subsequence of ICS2. */
11917 static bool
11918 is_subseq (conversion *ics1, conversion *ics2)
11920 /* We can assume that a conversion of the same code
11921 between the same types indicates a subsequence since we only get
11922 here if the types we are converting from are the same. */
11924 while (ics1->kind == ck_rvalue
11925 || ics1->kind == ck_lvalue)
11926 ics1 = next_conversion (ics1);
11928 while (1)
11930 while (ics2->kind == ck_rvalue
11931 || ics2->kind == ck_lvalue)
11932 ics2 = next_conversion (ics2);
11934 if (ics2->kind == ck_user
11935 || !has_next (ics2->kind))
11936 /* At this point, ICS1 cannot be a proper subsequence of
11937 ICS2. We can get a USER_CONV when we are comparing the
11938 second standard conversion sequence of two user conversion
11939 sequences. */
11940 return false;
11942 ics2 = next_conversion (ics2);
11944 while (ics2->kind == ck_rvalue
11945 || ics2->kind == ck_lvalue)
11946 ics2 = next_conversion (ics2);
11948 if (ics2->kind == ics1->kind
11949 && same_type_p (ics2->type, ics1->type)
11950 && (ics1->kind == ck_identity
11951 || same_type_p (next_conversion (ics2)->type,
11952 next_conversion (ics1)->type)))
11953 return true;
11957 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
11958 be any _TYPE nodes. */
11960 bool
11961 is_properly_derived_from (tree derived, tree base)
11963 if (!CLASS_TYPE_P (derived) || !CLASS_TYPE_P (base))
11964 return false;
11966 /* We only allow proper derivation here. The DERIVED_FROM_P macro
11967 considers every class derived from itself. */
11968 return (!same_type_ignoring_top_level_qualifiers_p (derived, base)
11969 && DERIVED_FROM_P (base, derived));
11972 /* We build the ICS for an implicit object parameter as a pointer
11973 conversion sequence. However, such a sequence should be compared
11974 as if it were a reference conversion sequence. If ICS is the
11975 implicit conversion sequence for an implicit object parameter,
11976 modify it accordingly. */
11978 static void
11979 maybe_handle_implicit_object (conversion **ics)
11981 if ((*ics)->this_p)
11983 /* [over.match.funcs]
11985 For non-static member functions, the type of the
11986 implicit object parameter is "reference to cv X"
11987 where X is the class of which the function is a
11988 member and cv is the cv-qualification on the member
11989 function declaration. */
11990 conversion *t = *ics;
11991 tree reference_type;
11993 /* The `this' parameter is a pointer to a class type. Make the
11994 implicit conversion talk about a reference to that same class
11995 type. */
11996 reference_type = TREE_TYPE (t->type);
11997 reference_type = build_reference_type (reference_type);
11999 if (t->kind == ck_qual)
12000 t = next_conversion (t);
12001 if (t->kind == ck_ptr)
12002 t = next_conversion (t);
12003 t = build_identity_conv (TREE_TYPE (t->type), NULL_TREE);
12004 t = direct_reference_binding (reference_type, t);
12005 t->this_p = 1;
12006 t->rvaluedness_matches_p = 0;
12007 *ics = t;
12011 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
12012 and return the initial reference binding conversion. Otherwise,
12013 leave *ICS unchanged and return NULL. */
12015 static conversion *
12016 maybe_handle_ref_bind (conversion **ics)
12018 if ((*ics)->kind == ck_ref_bind)
12020 conversion *old_ics = *ics;
12021 *ics = next_conversion (old_ics);
12022 (*ics)->user_conv_p = old_ics->user_conv_p;
12023 return old_ics;
12026 return NULL;
12029 /* Get the expression at the beginning of the conversion chain C. */
12031 static tree
12032 conv_get_original_expr (conversion *c)
12034 for (; c; c = next_conversion (c))
12035 if (c->kind == ck_identity || c->kind == ck_ambig || c->kind == ck_aggr)
12036 return c->u.expr;
12037 return NULL_TREE;
12040 /* Return a tree representing the number of elements initialized by the
12041 list-initialization C. The caller must check that C converts to an
12042 array type. */
12044 static tree
12045 nelts_initialized_by_list_init (conversion *c)
12047 /* If the array we're converting to has a dimension, we'll use that. */
12048 if (TYPE_DOMAIN (c->type))
12049 return array_type_nelts_top (c->type);
12050 else
12052 /* Otherwise, we look at how many elements the constructor we're
12053 initializing from has. */
12054 tree ctor = conv_get_original_expr (c);
12055 return size_int (CONSTRUCTOR_NELTS (ctor));
12059 /* True iff C is a conversion that binds a reference or a pointer to
12060 an array of unknown bound. */
12062 static inline bool
12063 conv_binds_to_array_of_unknown_bound (conversion *c)
12065 /* ck_ref_bind won't have the reference stripped. */
12066 tree type = non_reference (c->type);
12067 /* ck_qual won't have the pointer stripped. */
12068 type = strip_pointer_operator (type);
12069 return (TREE_CODE (type) == ARRAY_TYPE
12070 && TYPE_DOMAIN (type) == NULL_TREE);
12073 /* Compare two implicit conversion sequences according to the rules set out in
12074 [over.ics.rank]. Return values:
12076 1: ics1 is better than ics2
12077 -1: ics2 is better than ics1
12078 0: ics1 and ics2 are indistinguishable */
12080 static int
12081 compare_ics (conversion *ics1, conversion *ics2)
12083 tree from_type1;
12084 tree from_type2;
12085 tree to_type1;
12086 tree to_type2;
12087 tree deref_from_type1 = NULL_TREE;
12088 tree deref_from_type2 = NULL_TREE;
12089 tree deref_to_type1 = NULL_TREE;
12090 tree deref_to_type2 = NULL_TREE;
12091 conversion_rank rank1, rank2;
12093 /* REF_BINDING is nonzero if the result of the conversion sequence
12094 is a reference type. In that case REF_CONV is the reference
12095 binding conversion. */
12096 conversion *ref_conv1;
12097 conversion *ref_conv2;
12099 /* Compare badness before stripping the reference conversion. */
12100 if (ics1->bad_p > ics2->bad_p)
12101 return -1;
12102 else if (ics1->bad_p < ics2->bad_p)
12103 return 1;
12105 /* Handle implicit object parameters. */
12106 maybe_handle_implicit_object (&ics1);
12107 maybe_handle_implicit_object (&ics2);
12109 /* Handle reference parameters. */
12110 ref_conv1 = maybe_handle_ref_bind (&ics1);
12111 ref_conv2 = maybe_handle_ref_bind (&ics2);
12113 /* List-initialization sequence L1 is a better conversion sequence than
12114 list-initialization sequence L2 if L1 converts to
12115 std::initializer_list<X> for some X and L2 does not. */
12116 if (ics1->kind == ck_list && ics2->kind != ck_list)
12117 return 1;
12118 if (ics2->kind == ck_list && ics1->kind != ck_list)
12119 return -1;
12121 /* [over.ics.rank]
12123 When comparing the basic forms of implicit conversion sequences (as
12124 defined in _over.best.ics_)
12126 --a standard conversion sequence (_over.ics.scs_) is a better
12127 conversion sequence than a user-defined conversion sequence
12128 or an ellipsis conversion sequence, and
12130 --a user-defined conversion sequence (_over.ics.user_) is a
12131 better conversion sequence than an ellipsis conversion sequence
12132 (_over.ics.ellipsis_). */
12133 /* Use BAD_CONVERSION_RANK because we already checked for a badness
12134 mismatch. If both ICS are bad, we try to make a decision based on
12135 what would have happened if they'd been good. This is not an
12136 extension, we'll still give an error when we build up the call; this
12137 just helps us give a more helpful error message. */
12138 rank1 = BAD_CONVERSION_RANK (ics1);
12139 rank2 = BAD_CONVERSION_RANK (ics2);
12141 if (rank1 > rank2)
12142 return -1;
12143 else if (rank1 < rank2)
12144 return 1;
12146 if (ics1->ellipsis_p)
12147 /* Both conversions are ellipsis conversions. */
12148 return 0;
12150 /* User-defined conversion sequence U1 is a better conversion sequence
12151 than another user-defined conversion sequence U2 if they contain the
12152 same user-defined conversion operator or constructor and if the sec-
12153 ond standard conversion sequence of U1 is better than the second
12154 standard conversion sequence of U2. */
12156 /* Handle list-conversion with the same code even though it isn't always
12157 ranked as a user-defined conversion and it doesn't have a second
12158 standard conversion sequence; it will still have the desired effect.
12159 Specifically, we need to do the reference binding comparison at the
12160 end of this function. */
12162 if (ics1->user_conv_p || ics1->kind == ck_list
12163 || ics1->kind == ck_aggr || ics2->kind == ck_aggr)
12165 conversion *t1 = strip_standard_conversion (ics1);
12166 conversion *t2 = strip_standard_conversion (ics2);
12168 if (!t1 || !t2 || t1->kind != t2->kind)
12169 return 0;
12170 else if (t1->kind == ck_user)
12172 tree f1 = t1->cand ? t1->cand->fn : t1->type;
12173 tree f2 = t2->cand ? t2->cand->fn : t2->type;
12174 if (f1 != f2)
12175 return 0;
12177 /* List-initialization sequence L1 is a better conversion sequence than
12178 list-initialization sequence L2 if
12180 -- L1 and L2 convert to arrays of the same element type, and either
12181 the number of elements n1 initialized by L1 is less than the number
12182 of elements n2 initialized by L2, or n1=n2 and L2 converts to an array
12183 of unknown bound and L1 does not. (Added in CWG 1307 and extended by
12184 P0388R4.) */
12185 else if (t1->kind == ck_aggr
12186 && TREE_CODE (t1->type) == ARRAY_TYPE
12187 && TREE_CODE (t2->type) == ARRAY_TYPE
12188 && same_type_p (TREE_TYPE (t1->type), TREE_TYPE (t2->type)))
12190 tree n1 = nelts_initialized_by_list_init (t1);
12191 tree n2 = nelts_initialized_by_list_init (t2);
12192 if (tree_int_cst_lt (n1, n2))
12193 return 1;
12194 else if (tree_int_cst_lt (n2, n1))
12195 return -1;
12196 /* The n1 == n2 case. */
12197 bool c1 = conv_binds_to_array_of_unknown_bound (t1);
12198 bool c2 = conv_binds_to_array_of_unknown_bound (t2);
12199 if (c1 && !c2)
12200 return -1;
12201 else if (!c1 && c2)
12202 return 1;
12203 else
12204 return 0;
12206 else
12208 /* For ambiguous or aggregate conversions, use the target type as
12209 a proxy for the conversion function. */
12210 if (!same_type_ignoring_top_level_qualifiers_p (t1->type, t2->type))
12211 return 0;
12214 /* We can just fall through here, after setting up
12215 FROM_TYPE1 and FROM_TYPE2. */
12216 from_type1 = t1->type;
12217 from_type2 = t2->type;
12219 else
12221 conversion *t1;
12222 conversion *t2;
12224 /* We're dealing with two standard conversion sequences.
12226 [over.ics.rank]
12228 Standard conversion sequence S1 is a better conversion
12229 sequence than standard conversion sequence S2 if
12231 --S1 is a proper subsequence of S2 (comparing the conversion
12232 sequences in the canonical form defined by _over.ics.scs_,
12233 excluding any Lvalue Transformation; the identity
12234 conversion sequence is considered to be a subsequence of
12235 any non-identity conversion sequence */
12237 t1 = ics1;
12238 while (t1->kind != ck_identity)
12239 t1 = next_conversion (t1);
12240 from_type1 = t1->type;
12242 t2 = ics2;
12243 while (t2->kind != ck_identity)
12244 t2 = next_conversion (t2);
12245 from_type2 = t2->type;
12248 /* One sequence can only be a subsequence of the other if they start with
12249 the same type. They can start with different types when comparing the
12250 second standard conversion sequence in two user-defined conversion
12251 sequences. */
12252 if (same_type_p (from_type1, from_type2))
12254 if (is_subseq (ics1, ics2))
12255 return 1;
12256 if (is_subseq (ics2, ics1))
12257 return -1;
12260 /* [over.ics.rank]
12262 Or, if not that,
12264 --the rank of S1 is better than the rank of S2 (by the rules
12265 defined below):
12267 Standard conversion sequences are ordered by their ranks: an Exact
12268 Match is a better conversion than a Promotion, which is a better
12269 conversion than a Conversion.
12271 Two conversion sequences with the same rank are indistinguishable
12272 unless one of the following rules applies:
12274 --A conversion that does not a convert a pointer, pointer to member,
12275 or std::nullptr_t to bool is better than one that does.
12277 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
12278 so that we do not have to check it explicitly. */
12279 if (ics1->rank < ics2->rank)
12280 return 1;
12281 else if (ics2->rank < ics1->rank)
12282 return -1;
12284 to_type1 = ics1->type;
12285 to_type2 = ics2->type;
12287 /* A conversion from scalar arithmetic type to complex is worse than a
12288 conversion between scalar arithmetic types. */
12289 if (same_type_p (from_type1, from_type2)
12290 && ARITHMETIC_TYPE_P (from_type1)
12291 && ARITHMETIC_TYPE_P (to_type1)
12292 && ARITHMETIC_TYPE_P (to_type2)
12293 && ((TREE_CODE (to_type1) == COMPLEX_TYPE)
12294 != (TREE_CODE (to_type2) == COMPLEX_TYPE)))
12296 if (TREE_CODE (to_type1) == COMPLEX_TYPE)
12297 return -1;
12298 else
12299 return 1;
12303 /* A conversion in either direction between floating-point type FP1 and
12304 floating-point type FP2 is better than a conversion in the same
12305 direction between FP1 and arithmetic type T3 if
12306 - the floating-point conversion rank of FP1 is equal to the rank of
12307 FP2, and
12308 - T3 is not a floating-point type, or T3 is a floating-point type
12309 whose rank is not equal to the rank of FP1, or the floating-point
12310 conversion subrank of FP2 is greater than the subrank of T3. */
12311 tree fp1 = from_type1;
12312 tree fp2 = to_type1;
12313 tree fp3 = from_type2;
12314 tree t3 = to_type2;
12315 int ret = 1;
12316 if (TYPE_MAIN_VARIANT (fp2) == TYPE_MAIN_VARIANT (t3))
12318 std::swap (fp1, fp2);
12319 std::swap (fp3, t3);
12321 if (TYPE_MAIN_VARIANT (fp1) == TYPE_MAIN_VARIANT (fp3)
12322 && SCALAR_FLOAT_TYPE_P (fp1)
12323 /* Only apply this rule if at least one of the 3 types is
12324 extended floating-point type, otherwise keep them as
12325 before for compatibility reasons with types like __float128.
12326 float, double and long double alone have different conversion
12327 ranks and so when just those 3 types are involved, this
12328 rule doesn't trigger. */
12329 && (extended_float_type_p (fp1)
12330 || (SCALAR_FLOAT_TYPE_P (fp2) && extended_float_type_p (fp2))
12331 || (SCALAR_FLOAT_TYPE_P (t3) && extended_float_type_p (t3))))
12333 if (TREE_CODE (fp2) != REAL_TYPE)
12335 ret = -ret;
12336 std::swap (fp2, t3);
12338 if (SCALAR_FLOAT_TYPE_P (fp2))
12340 /* cp_compare_floating_point_conversion_ranks returns -1, 0 or 1
12341 if the conversion rank is equal (-1 or 1 if the subrank is
12342 different). */
12343 if (IN_RANGE (cp_compare_floating_point_conversion_ranks (fp1,
12344 fp2),
12345 -1, 1))
12347 /* Conversion ranks of FP1 and FP2 are equal. */
12348 if (TREE_CODE (t3) != REAL_TYPE
12349 || !IN_RANGE (cp_compare_floating_point_conversion_ranks
12350 (fp1, t3),
12351 -1, 1))
12352 /* FP1 <-> FP2 conversion is better. */
12353 return ret;
12354 int c = cp_compare_floating_point_conversion_ranks (fp2, t3);
12355 gcc_assert (IN_RANGE (c, -1, 1));
12356 if (c == 1)
12357 /* Conversion subrank of FP2 is greater than subrank of T3.
12358 FP1 <-> FP2 conversion is better. */
12359 return ret;
12360 else if (c == -1)
12361 /* Conversion subrank of FP2 is less than subrank of T3.
12362 FP1 <-> T3 conversion is better. */
12363 return -ret;
12365 else if (SCALAR_FLOAT_TYPE_P (t3)
12366 && IN_RANGE (cp_compare_floating_point_conversion_ranks
12367 (fp1, t3),
12368 -1, 1))
12369 /* Conversion ranks of FP1 and FP2 are not equal, conversion
12370 ranks of FP1 and T3 are equal.
12371 FP1 <-> T3 conversion is better. */
12372 return -ret;
12377 if (TYPE_PTR_P (from_type1)
12378 && TYPE_PTR_P (from_type2)
12379 && TYPE_PTR_P (to_type1)
12380 && TYPE_PTR_P (to_type2))
12382 deref_from_type1 = TREE_TYPE (from_type1);
12383 deref_from_type2 = TREE_TYPE (from_type2);
12384 deref_to_type1 = TREE_TYPE (to_type1);
12385 deref_to_type2 = TREE_TYPE (to_type2);
12387 /* The rules for pointers to members A::* are just like the rules
12388 for pointers A*, except opposite: if B is derived from A then
12389 A::* converts to B::*, not vice versa. For that reason, we
12390 switch the from_ and to_ variables here. */
12391 else if ((TYPE_PTRDATAMEM_P (from_type1) && TYPE_PTRDATAMEM_P (from_type2)
12392 && TYPE_PTRDATAMEM_P (to_type1) && TYPE_PTRDATAMEM_P (to_type2))
12393 || (TYPE_PTRMEMFUNC_P (from_type1)
12394 && TYPE_PTRMEMFUNC_P (from_type2)
12395 && TYPE_PTRMEMFUNC_P (to_type1)
12396 && TYPE_PTRMEMFUNC_P (to_type2)))
12398 deref_to_type1 = TYPE_PTRMEM_CLASS_TYPE (from_type1);
12399 deref_to_type2 = TYPE_PTRMEM_CLASS_TYPE (from_type2);
12400 deref_from_type1 = TYPE_PTRMEM_CLASS_TYPE (to_type1);
12401 deref_from_type2 = TYPE_PTRMEM_CLASS_TYPE (to_type2);
12404 if (deref_from_type1 != NULL_TREE
12405 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1))
12406 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2)))
12408 /* This was one of the pointer or pointer-like conversions.
12410 [over.ics.rank]
12412 --If class B is derived directly or indirectly from class A,
12413 conversion of B* to A* is better than conversion of B* to
12414 void*, and conversion of A* to void* is better than
12415 conversion of B* to void*. */
12416 if (VOID_TYPE_P (deref_to_type1)
12417 && VOID_TYPE_P (deref_to_type2))
12419 if (is_properly_derived_from (deref_from_type1,
12420 deref_from_type2))
12421 return -1;
12422 else if (is_properly_derived_from (deref_from_type2,
12423 deref_from_type1))
12424 return 1;
12426 else if (VOID_TYPE_P (deref_to_type1)
12427 || VOID_TYPE_P (deref_to_type2))
12429 if (same_type_p (deref_from_type1, deref_from_type2))
12431 if (VOID_TYPE_P (deref_to_type2))
12433 if (is_properly_derived_from (deref_from_type1,
12434 deref_to_type1))
12435 return 1;
12437 /* We know that DEREF_TO_TYPE1 is `void' here. */
12438 else if (is_properly_derived_from (deref_from_type1,
12439 deref_to_type2))
12440 return -1;
12443 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1))
12444 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2)))
12446 /* [over.ics.rank]
12448 --If class B is derived directly or indirectly from class A
12449 and class C is derived directly or indirectly from B,
12451 --conversion of C* to B* is better than conversion of C* to
12454 --conversion of B* to A* is better than conversion of C* to
12455 A* */
12456 if (same_type_p (deref_from_type1, deref_from_type2))
12458 if (is_properly_derived_from (deref_to_type1,
12459 deref_to_type2))
12460 return 1;
12461 else if (is_properly_derived_from (deref_to_type2,
12462 deref_to_type1))
12463 return -1;
12465 else if (same_type_p (deref_to_type1, deref_to_type2))
12467 if (is_properly_derived_from (deref_from_type2,
12468 deref_from_type1))
12469 return 1;
12470 else if (is_properly_derived_from (deref_from_type1,
12471 deref_from_type2))
12472 return -1;
12476 else if (CLASS_TYPE_P (non_reference (from_type1))
12477 && same_type_p (from_type1, from_type2))
12479 tree from = non_reference (from_type1);
12481 /* [over.ics.rank]
12483 --binding of an expression of type C to a reference of type
12484 B& is better than binding an expression of type C to a
12485 reference of type A&
12487 --conversion of C to B is better than conversion of C to A, */
12488 if (is_properly_derived_from (from, to_type1)
12489 && is_properly_derived_from (from, to_type2))
12491 if (is_properly_derived_from (to_type1, to_type2))
12492 return 1;
12493 else if (is_properly_derived_from (to_type2, to_type1))
12494 return -1;
12497 else if (CLASS_TYPE_P (non_reference (to_type1))
12498 && same_type_p (to_type1, to_type2))
12500 tree to = non_reference (to_type1);
12502 /* [over.ics.rank]
12504 --binding of an expression of type B to a reference of type
12505 A& is better than binding an expression of type C to a
12506 reference of type A&,
12508 --conversion of B to A is better than conversion of C to A */
12509 if (is_properly_derived_from (from_type1, to)
12510 && is_properly_derived_from (from_type2, to))
12512 if (is_properly_derived_from (from_type2, from_type1))
12513 return 1;
12514 else if (is_properly_derived_from (from_type1, from_type2))
12515 return -1;
12519 /* [over.ics.rank]
12521 --S1 and S2 differ only in their qualification conversion and yield
12522 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
12523 qualification signature of type T1 is a proper subset of the cv-
12524 qualification signature of type T2 */
12525 if (ics1->kind == ck_qual
12526 && ics2->kind == ck_qual
12527 && same_type_p (from_type1, from_type2))
12529 int result = comp_cv_qual_signature (to_type1, to_type2);
12530 if (result != 0)
12531 return result;
12534 /* [over.ics.rank]
12536 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
12537 to an implicit object parameter of a non-static member function
12538 declared without a ref-qualifier, and either S1 binds an lvalue
12539 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
12540 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
12541 draft standard, 13.3.3.2)
12543 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
12544 types to which the references refer are the same type except for
12545 top-level cv-qualifiers, and the type to which the reference
12546 initialized by S2 refers is more cv-qualified than the type to
12547 which the reference initialized by S1 refers.
12549 DR 1328 [over.match.best]: the context is an initialization by
12550 conversion function for direct reference binding (13.3.1.6) of a
12551 reference to function type, the return type of F1 is the same kind of
12552 reference (i.e. lvalue or rvalue) as the reference being initialized,
12553 and the return type of F2 is not. */
12555 if (ref_conv1 && ref_conv2)
12557 if (!ref_conv1->this_p && !ref_conv2->this_p
12558 && (ref_conv1->rvaluedness_matches_p
12559 != ref_conv2->rvaluedness_matches_p)
12560 && (same_type_p (ref_conv1->type, ref_conv2->type)
12561 || (TYPE_REF_IS_RVALUE (ref_conv1->type)
12562 != TYPE_REF_IS_RVALUE (ref_conv2->type))))
12564 if (ref_conv1->bad_p
12565 && !same_type_p (TREE_TYPE (ref_conv1->type),
12566 TREE_TYPE (ref_conv2->type)))
12567 /* Don't prefer a bad conversion that drops cv-quals to a bad
12568 conversion with the wrong rvalueness. */
12569 return 0;
12570 return (ref_conv1->rvaluedness_matches_p
12571 - ref_conv2->rvaluedness_matches_p);
12574 if (same_type_ignoring_top_level_qualifiers_p (to_type1, to_type2))
12576 /* Per P0388R4:
12578 void f (int(&)[]), // (1)
12579 f (int(&)[1]), // (2)
12580 f (int*); // (3)
12582 (2) is better than (1), but (3) should be equal to (1) and to
12583 (2). For that reason we don't use ck_qual for (1) which would
12584 give it the cr_exact rank while (3) remains ck_identity.
12585 Therefore we compare (1) and (2) here. For (1) we'll have
12587 ck_ref_bind <- ck_identity
12588 int[] & int[1]
12590 so to handle this we must look at ref_conv. */
12591 bool c1 = conv_binds_to_array_of_unknown_bound (ref_conv1);
12592 bool c2 = conv_binds_to_array_of_unknown_bound (ref_conv2);
12593 if (c1 && !c2)
12594 return -1;
12595 else if (!c1 && c2)
12596 return 1;
12598 int q1 = cp_type_quals (TREE_TYPE (ref_conv1->type));
12599 int q2 = cp_type_quals (TREE_TYPE (ref_conv2->type));
12600 if (ref_conv1->bad_p)
12602 /* Prefer the one that drops fewer cv-quals. */
12603 tree ftype = next_conversion (ref_conv1)->type;
12604 int fquals = cp_type_quals (ftype);
12605 q1 ^= fquals;
12606 q2 ^= fquals;
12608 return comp_cv_qualification (q2, q1);
12612 /* [over.ics.rank]
12614 Per CWG 1601:
12615 -- A conversion that promotes an enumeration whose underlying type
12616 is fixed to its underlying type is better than one that promotes to
12617 the promoted underlying type, if the two are different. */
12618 if (ics1->rank == cr_promotion
12619 && ics2->rank == cr_promotion
12620 && UNSCOPED_ENUM_P (from_type1)
12621 && ENUM_FIXED_UNDERLYING_TYPE_P (from_type1)
12622 && same_type_p (from_type1, from_type2))
12624 tree utype = ENUM_UNDERLYING_TYPE (from_type1);
12625 tree prom = type_promotes_to (from_type1);
12626 if (!same_type_p (utype, prom))
12628 if (same_type_p (to_type1, utype)
12629 && same_type_p (to_type2, prom))
12630 return 1;
12631 else if (same_type_p (to_type2, utype)
12632 && same_type_p (to_type1, prom))
12633 return -1;
12637 /* Neither conversion sequence is better than the other. */
12638 return 0;
12641 /* The source type for this standard conversion sequence. */
12643 static tree
12644 source_type (conversion *t)
12646 return strip_standard_conversion (t)->type;
12649 /* Note a warning about preferring WINNER to LOSER. We do this by storing
12650 a pointer to LOSER and re-running joust to produce the warning if WINNER
12651 is actually used. */
12653 static void
12654 add_warning (struct z_candidate *winner, struct z_candidate *loser)
12656 candidate_warning *cw = (candidate_warning *)
12657 conversion_obstack_alloc (sizeof (candidate_warning));
12658 cw->loser = loser;
12659 cw->next = winner->warnings;
12660 winner->warnings = cw;
12663 /* CAND is a constructor candidate in joust in C++17 and up. If it copies a
12664 prvalue returned from a conversion function, return true. Otherwise, return
12665 false. */
12667 static bool
12668 joust_maybe_elide_copy (z_candidate *cand)
12670 tree fn = cand->fn;
12671 if (!DECL_COPY_CONSTRUCTOR_P (fn) && !DECL_MOVE_CONSTRUCTOR_P (fn))
12672 return false;
12673 conversion *conv = cand->convs[0];
12674 if (conv->kind == ck_ambig)
12675 return false;
12676 gcc_checking_assert (conv->kind == ck_ref_bind);
12677 conv = next_conversion (conv);
12678 if (conv->kind == ck_user && !TYPE_REF_P (conv->type))
12680 gcc_checking_assert (same_type_ignoring_top_level_qualifiers_p
12681 (conv->type, DECL_CONTEXT (fn)));
12682 z_candidate *uc = conv->cand;
12683 if (DECL_CONV_FN_P (uc->fn))
12684 return true;
12686 return false;
12689 /* True if the defining declarations of the two candidates have equivalent
12690 parameters. */
12692 static bool
12693 cand_parms_match (z_candidate *c1, z_candidate *c2)
12695 tree fn1 = c1->fn;
12696 tree fn2 = c2->fn;
12697 if (fn1 == fn2)
12698 return true;
12699 if (identifier_p (fn1) || identifier_p (fn2))
12700 return false;
12701 /* We don't look at c1->template_decl because that's only set for primary
12702 templates, not e.g. non-template member functions of class templates. */
12703 tree t1 = most_general_template (fn1);
12704 tree t2 = most_general_template (fn2);
12705 if (t1 || t2)
12707 if (!t1 || !t2)
12708 return false;
12709 if (t1 == t2)
12710 return true;
12711 fn1 = DECL_TEMPLATE_RESULT (t1);
12712 fn2 = DECL_TEMPLATE_RESULT (t2);
12714 tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (fn1));
12715 tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (fn2));
12716 auto skip_parms = [](tree fn, tree parms){
12717 if (DECL_XOBJ_MEMBER_FUNCTION_P (fn))
12718 return TREE_CHAIN (parms);
12719 else
12720 return skip_artificial_parms_for (fn, parms);
12722 if (!(DECL_FUNCTION_MEMBER_P (fn1)
12723 && DECL_FUNCTION_MEMBER_P (fn2)))
12724 /* Early escape. */;
12725 else if ((DECL_STATIC_FUNCTION_P (fn1)
12726 != DECL_STATIC_FUNCTION_P (fn2)))
12728 /* Ignore 'this' when comparing the parameters of a static member
12729 function with those of a non-static one. */
12730 parms1 = skip_parms (fn1, parms1);
12731 parms2 = skip_parms (fn2, parms2);
12733 else if ((DECL_XOBJ_MEMBER_FUNCTION_P (fn1)
12734 || DECL_XOBJ_MEMBER_FUNCTION_P (fn2))
12735 && (DECL_IOBJ_MEMBER_FUNCTION_P (fn1)
12736 || DECL_IOBJ_MEMBER_FUNCTION_P (fn2)))
12738 bool xobj_iobj_parameters_correspond (tree, tree);
12739 /* CWG2789 is not adequate, it should specify corresponding object
12740 parameters, not same typed object parameters. */
12741 if (!xobj_iobj_parameters_correspond (fn1, fn2))
12742 return false;
12743 /* We just compared the object parameters, if they don't correspond
12744 we already return false. */
12745 parms1 = skip_parms (fn1, parms1);
12746 parms2 = skip_parms (fn2, parms2);
12748 return compparms (parms1, parms2);
12751 /* True iff FN is a copy or move constructor or assignment operator. */
12753 static bool
12754 sfk_copy_or_move (tree fn)
12756 if (TREE_CODE (fn) != FUNCTION_DECL)
12757 return false;
12758 special_function_kind sfk = special_function_p (fn);
12759 return sfk >= sfk_copy_constructor && sfk <= sfk_move_assignment;
12762 /* Compare two candidates for overloading as described in
12763 [over.match.best]. Return values:
12765 1: cand1 is better than cand2
12766 -1: cand2 is better than cand1
12767 0: cand1 and cand2 are indistinguishable */
12769 static int
12770 joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn,
12771 tsubst_flags_t complain)
12773 int winner = 0;
12774 int off1 = 0, off2 = 0;
12775 size_t i;
12776 size_t len;
12778 /* Candidates that involve bad conversions are always worse than those
12779 that don't. */
12780 if (cand1->viable > cand2->viable)
12781 return 1;
12782 if (cand1->viable < cand2->viable)
12783 return -1;
12785 /* If we have two pseudo-candidates for conversions to the same type,
12786 or two candidates for the same function, arbitrarily pick one. */
12787 if (cand1->fn == cand2->fn
12788 && cand1->reversed () == cand2->reversed ()
12789 && (IS_TYPE_OR_DECL_P (cand1->fn)))
12790 return 1;
12792 /* Prefer a non-deleted function over an implicitly deleted move
12793 constructor or assignment operator. This differs slightly from the
12794 wording for issue 1402 (which says the move op is ignored by overload
12795 resolution), but this way produces better error messages. */
12796 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
12797 && TREE_CODE (cand2->fn) == FUNCTION_DECL
12798 && DECL_DELETED_FN (cand1->fn) != DECL_DELETED_FN (cand2->fn))
12800 if (DECL_DELETED_FN (cand1->fn) && DECL_DEFAULTED_FN (cand1->fn)
12801 && move_fn_p (cand1->fn))
12802 return -1;
12803 if (DECL_DELETED_FN (cand2->fn) && DECL_DEFAULTED_FN (cand2->fn)
12804 && move_fn_p (cand2->fn))
12805 return 1;
12808 /* a viable function F1
12809 is defined to be a better function than another viable function F2 if
12810 for all arguments i, ICSi(F1) is not a worse conversion sequence than
12811 ICSi(F2), and then */
12813 /* for some argument j, ICSj(F1) is a better conversion sequence than
12814 ICSj(F2) */
12816 /* For comparing static and non-static member functions, we ignore
12817 the implicit object parameter of the non-static function. The
12818 standard says to pretend that the static function has an object
12819 parm, but that won't work with operator overloading. */
12820 len = cand1->num_convs;
12821 if (len != cand2->num_convs)
12823 int static_1 = (TREE_CODE (cand1->fn) == FUNCTION_DECL
12824 && DECL_STATIC_FUNCTION_P (cand1->fn));
12825 int static_2 = (TREE_CODE (cand2->fn) == FUNCTION_DECL
12826 && DECL_STATIC_FUNCTION_P (cand2->fn));
12828 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
12829 && TREE_CODE (cand2->fn) == FUNCTION_DECL
12830 && DECL_CONSTRUCTOR_P (cand1->fn)
12831 && is_list_ctor (cand1->fn) != is_list_ctor (cand2->fn))
12832 /* We're comparing a near-match list constructor and a near-match
12833 non-list constructor. Just treat them as unordered. */
12834 return 0;
12836 gcc_assert (static_1 != static_2);
12838 if (static_1)
12840 /* C++23 [over.best.ics.general] says:
12841 When the parameter is the implicit object parameter of a static
12842 member function, the implicit conversion sequence is a standard
12843 conversion sequence that is neither better nor worse than any
12844 other standard conversion sequence. */
12845 if (CONVERSION_RANK (cand2->convs[0]) >= cr_user)
12846 winner = 1;
12847 off2 = 1;
12849 else
12851 if (CONVERSION_RANK (cand1->convs[0]) >= cr_user)
12852 winner = -1;
12853 off1 = 1;
12854 --len;
12858 for (i = 0; i < len; ++i)
12860 conversion *t1 = cand1->convs[i + off1];
12861 conversion *t2 = cand2->convs[i + off2];
12862 int comp = compare_ics (t1, t2);
12864 if (comp != 0)
12866 if ((complain & tf_warning)
12867 && warn_sign_promo
12868 && (CONVERSION_RANK (t1) + CONVERSION_RANK (t2)
12869 == cr_std + cr_promotion)
12870 && t1->kind == ck_std
12871 && t2->kind == ck_std
12872 && TREE_CODE (t1->type) == INTEGER_TYPE
12873 && TREE_CODE (t2->type) == INTEGER_TYPE
12874 && (TYPE_PRECISION (t1->type)
12875 == TYPE_PRECISION (t2->type))
12876 && (TYPE_UNSIGNED (next_conversion (t1)->type)
12877 || (TREE_CODE (next_conversion (t1)->type)
12878 == ENUMERAL_TYPE)))
12880 tree type = next_conversion (t1)->type;
12881 tree type1, type2;
12882 struct z_candidate *w, *l;
12883 if (comp > 0)
12884 type1 = t1->type, type2 = t2->type,
12885 w = cand1, l = cand2;
12886 else
12887 type1 = t2->type, type2 = t1->type,
12888 w = cand2, l = cand1;
12890 if (warn)
12892 warning (OPT_Wsign_promo, "passing %qT chooses %qT over %qT",
12893 type, type1, type2);
12894 warning (OPT_Wsign_promo, " in call to %qD", w->fn);
12896 else
12897 add_warning (w, l);
12900 if (winner && comp != winner)
12902 /* Ambiguity between normal and reversed comparison operators
12903 with the same parameter types. P2468 decided not to go with
12904 this approach to resolving the ambiguity, so pedwarn. */
12905 if ((complain & tf_warning_or_error)
12906 && (cand1->reversed () != cand2->reversed ())
12907 && cand_parms_match (cand1, cand2))
12909 struct z_candidate *w, *l;
12910 if (cand2->reversed ())
12911 winner = 1, w = cand1, l = cand2;
12912 else
12913 winner = -1, w = cand2, l = cand1;
12914 if (warn)
12916 auto_diagnostic_group d;
12917 if (pedwarn (input_location, 0,
12918 "C++20 says that these are ambiguous, "
12919 "even though the second is reversed:"))
12921 print_z_candidate (input_location,
12922 N_("candidate 1:"), w);
12923 print_z_candidate (input_location,
12924 N_("candidate 2:"), l);
12925 if (w->fn == l->fn
12926 && DECL_IOBJ_MEMBER_FUNCTION_P (w->fn)
12927 && (type_memfn_quals (TREE_TYPE (w->fn))
12928 & TYPE_QUAL_CONST) == 0)
12930 /* Suggest adding const to
12931 struct A { bool operator==(const A&); }; */
12932 tree parmtype
12933 = FUNCTION_FIRST_USER_PARMTYPE (w->fn);
12934 parmtype = TREE_VALUE (parmtype);
12935 if (TYPE_REF_P (parmtype)
12936 && TYPE_READONLY (TREE_TYPE (parmtype))
12937 && (same_type_ignoring_top_level_qualifiers_p
12938 (TREE_TYPE (parmtype),
12939 DECL_CONTEXT (w->fn))))
12940 inform (DECL_SOURCE_LOCATION (w->fn),
12941 "try making the operator a %<const%> "
12942 "member function");
12946 else
12947 add_warning (w, l);
12948 return winner;
12951 winner = 0;
12952 goto tweak;
12954 winner = comp;
12958 /* warn about confusing overload resolution for user-defined conversions,
12959 either between a constructor and a conversion op, or between two
12960 conversion ops. */
12961 if ((complain & tf_warning)
12962 /* In C++17, the constructor might have been elided, which means that
12963 an originally null ->second_conv could become non-null. */
12964 && winner && warn_conversion && cand1->second_conv && cand2->second_conv
12965 && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn))
12966 && winner != compare_ics (cand1->second_conv, cand2->second_conv))
12968 struct z_candidate *w, *l;
12969 bool give_warning = false;
12971 if (winner == 1)
12972 w = cand1, l = cand2;
12973 else
12974 w = cand2, l = cand1;
12976 /* We don't want to complain about `X::operator T1 ()'
12977 beating `X::operator T2 () const', when T2 is a no less
12978 cv-qualified version of T1. */
12979 if (DECL_CONTEXT (w->fn) == DECL_CONTEXT (l->fn)
12980 && !DECL_CONSTRUCTOR_P (w->fn) && !DECL_CONSTRUCTOR_P (l->fn))
12982 tree t = TREE_TYPE (TREE_TYPE (l->fn));
12983 tree f = TREE_TYPE (TREE_TYPE (w->fn));
12985 if (TREE_CODE (t) == TREE_CODE (f) && INDIRECT_TYPE_P (t))
12987 t = TREE_TYPE (t);
12988 f = TREE_TYPE (f);
12990 if (!comp_ptr_ttypes (t, f))
12991 give_warning = true;
12993 else
12994 give_warning = true;
12996 if (!give_warning)
12997 /*NOP*/;
12998 else if (warn)
13000 tree source = source_type (w->convs[0]);
13001 if (INDIRECT_TYPE_P (source))
13002 source = TREE_TYPE (source);
13003 auto_diagnostic_group d;
13004 if (warning (OPT_Wconversion, "choosing %qD over %qD", w->fn, l->fn)
13005 && warning (OPT_Wconversion, " for conversion from %qH to %qI",
13006 source, w->second_conv->type))
13008 inform (input_location, " because conversion sequence "
13009 "for the argument is better");
13012 else
13013 add_warning (w, l);
13016 if (winner)
13017 return winner;
13019 /* DR 495 moved this tiebreaker above the template ones. */
13020 /* or, if not that,
13021 the context is an initialization by user-defined conversion (see
13022 _dcl.init_ and _over.match.user_) and the standard conversion
13023 sequence from the return type of F1 to the destination type (i.e.,
13024 the type of the entity being initialized) is a better conversion
13025 sequence than the standard conversion sequence from the return type
13026 of F2 to the destination type. */
13028 if (cand1->second_conv)
13030 winner = compare_ics (cand1->second_conv, cand2->second_conv);
13031 if (winner)
13032 return winner;
13035 /* CWG2735 (PR109247): A copy/move ctor/op= for which its operand uses an
13036 explicit conversion (due to list-initialization) is worse. */
13038 z_candidate *sp = nullptr;
13039 if (sfk_copy_or_move (cand1->fn))
13040 sp = cand1;
13041 if (sfk_copy_or_move (cand2->fn))
13042 sp = sp ? nullptr : cand2;
13043 if (sp)
13045 conversion *conv = sp->convs[!DECL_CONSTRUCTOR_P (sp->fn)];
13046 if (conv->user_conv_p)
13047 for (; conv; conv = next_conversion (conv))
13048 if (conv->kind == ck_user
13049 && DECL_P (conv->cand->fn)
13050 && DECL_NONCONVERTING_P (conv->cand->fn))
13051 return (sp == cand1) ? -1 : 1;
13055 /* DR2327: C++17 copy elision in [over.match.ctor] (direct-init) context.
13056 The standard currently says that only constructors are candidates, but if
13057 one copies a prvalue returned by a conversion function we prefer that.
13059 Clang does something similar, as discussed at
13060 http://lists.isocpp.org/core/2017/10/3166.php
13061 http://lists.isocpp.org/core/2019/03/5721.php */
13062 if (len == 1 && cxx_dialect >= cxx17
13063 && DECL_P (cand1->fn)
13064 && DECL_COMPLETE_CONSTRUCTOR_P (cand1->fn)
13065 && !(cand1->flags & LOOKUP_ONLYCONVERTING))
13067 bool elided1 = joust_maybe_elide_copy (cand1);
13068 bool elided2 = joust_maybe_elide_copy (cand2);
13069 winner = elided1 - elided2;
13070 if (winner)
13071 return winner;
13074 /* or, if not that,
13075 F1 is a non-template function and F2 is a template function
13076 specialization. */
13078 if (!cand1->template_decl && cand2->template_decl)
13079 return 1;
13080 else if (cand1->template_decl && !cand2->template_decl)
13081 return -1;
13083 /* or, if not that,
13084 F1 and F2 are template functions and the function template for F1 is
13085 more specialized than the template for F2 according to the partial
13086 ordering rules. */
13088 if (cand1->template_decl && cand2->template_decl)
13090 winner = more_specialized_fn
13091 (TI_TEMPLATE (cand1->template_decl),
13092 TI_TEMPLATE (cand2->template_decl),
13093 /* [temp.func.order]: The presence of unused ellipsis and default
13094 arguments has no effect on the partial ordering of function
13095 templates. add_function_candidate() will not have
13096 counted the "this" argument for constructors. */
13097 cand1->num_convs + DECL_CONSTRUCTOR_P (cand1->fn));
13098 if (winner)
13099 return winner;
13102 /* Concepts: F1 and F2 are non-template functions with the same
13103 parameter-type-lists, and F1 is more constrained than F2 according to the
13104 partial ordering of constraints described in 13.5.4. */
13106 if (flag_concepts && DECL_P (cand1->fn) && DECL_P (cand2->fn)
13107 && !cand1->template_decl && !cand2->template_decl
13108 && cand_parms_match (cand1, cand2))
13110 winner = more_constrained (cand1->fn, cand2->fn);
13111 if (winner)
13112 return winner;
13115 /* F2 is a rewritten candidate (12.4.1.2) and F1 is not, or F1 and F2 are
13116 rewritten candidates, and F2 is a synthesized candidate with reversed
13117 order of parameters and F1 is not. */
13118 if (cand1->rewritten ())
13120 if (!cand2->rewritten ())
13121 return -1;
13122 if (!cand1->reversed () && cand2->reversed ())
13123 return 1;
13124 if (cand1->reversed () && !cand2->reversed ())
13125 return -1;
13127 else if (cand2->rewritten ())
13128 return 1;
13130 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
13131 if (deduction_guide_p (cand1->fn))
13133 gcc_assert (deduction_guide_p (cand2->fn));
13134 /* We distinguish between candidates from an explicit deduction guide and
13135 candidates built from a constructor based on DECL_ARTIFICIAL. */
13136 int art1 = DECL_ARTIFICIAL (cand1->fn);
13137 int art2 = DECL_ARTIFICIAL (cand2->fn);
13138 if (art1 != art2)
13139 return art2 - art1;
13141 if (art1)
13143 /* Prefer the special copy guide over a declared copy/move
13144 constructor. */
13145 if (copy_guide_p (cand1->fn))
13146 return 1;
13147 if (copy_guide_p (cand2->fn))
13148 return -1;
13150 /* Prefer a candidate generated from a non-template constructor. */
13151 int tg1 = template_guide_p (cand1->fn);
13152 int tg2 = template_guide_p (cand2->fn);
13153 if (tg1 != tg2)
13154 return tg2 - tg1;
13158 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
13159 for all arguments the corresponding parameters of F1 and F2 have the same
13160 type (CWG 2273/2277). */
13161 if (DECL_P (cand1->fn) && DECL_CLASS_SCOPE_P (cand1->fn)
13162 && !DECL_CONV_FN_P (cand1->fn)
13163 && DECL_P (cand2->fn) && DECL_CLASS_SCOPE_P (cand2->fn)
13164 && !DECL_CONV_FN_P (cand2->fn))
13166 tree base1 = DECL_CONTEXT (strip_inheriting_ctors (cand1->fn));
13167 tree base2 = DECL_CONTEXT (strip_inheriting_ctors (cand2->fn));
13169 bool used1 = false;
13170 bool used2 = false;
13171 if (base1 == base2)
13172 /* No difference. */;
13173 else if (DERIVED_FROM_P (base1, base2))
13174 used1 = true;
13175 else if (DERIVED_FROM_P (base2, base1))
13176 used2 = true;
13178 if (int diff = used2 - used1)
13180 for (i = 0; i < len; ++i)
13182 conversion *t1 = cand1->convs[i + off1];
13183 conversion *t2 = cand2->convs[i + off2];
13184 if (!same_type_p (t1->type, t2->type))
13185 break;
13187 if (i == len)
13188 return diff;
13192 /* Check whether we can discard a builtin candidate, either because we
13193 have two identical ones or matching builtin and non-builtin candidates.
13195 (Pedantically in the latter case the builtin which matched the user
13196 function should not be added to the overload set, but we spot it here.
13198 [over.match.oper]
13199 ... the builtin candidates include ...
13200 - do not have the same parameter type list as any non-template
13201 non-member candidate. */
13203 if (identifier_p (cand1->fn) || identifier_p (cand2->fn))
13205 for (i = 0; i < len; ++i)
13206 if (!same_type_p (cand1->convs[i]->type,
13207 cand2->convs[i]->type))
13208 break;
13209 if (i == cand1->num_convs)
13211 if (cand1->fn == cand2->fn)
13212 /* Two built-in candidates; arbitrarily pick one. */
13213 return 1;
13214 else if (identifier_p (cand1->fn))
13215 /* cand1 is built-in; prefer cand2. */
13216 return -1;
13217 else
13218 /* cand2 is built-in; prefer cand1. */
13219 return 1;
13223 /* For candidates of a multi-versioned function, make the version with
13224 the highest priority win. This version will be checked for dispatching
13225 first. If this version can be inlined into the caller, the front-end
13226 will simply make a direct call to this function. */
13228 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
13229 && DECL_FUNCTION_VERSIONED (cand1->fn)
13230 && TREE_CODE (cand2->fn) == FUNCTION_DECL
13231 && DECL_FUNCTION_VERSIONED (cand2->fn))
13233 tree f1 = TREE_TYPE (cand1->fn);
13234 tree f2 = TREE_TYPE (cand2->fn);
13235 tree p1 = TYPE_ARG_TYPES (f1);
13236 tree p2 = TYPE_ARG_TYPES (f2);
13238 /* Check if cand1->fn and cand2->fn are versions of the same function. It
13239 is possible that cand1->fn and cand2->fn are function versions but of
13240 different functions. Check types to see if they are versions of the same
13241 function. */
13242 if (compparms (p1, p2)
13243 && same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
13245 /* Always make the version with the higher priority, more
13246 specialized, win. */
13247 gcc_assert (targetm.compare_version_priority);
13248 if (targetm.compare_version_priority (cand1->fn, cand2->fn) >= 0)
13249 return 1;
13250 else
13251 return -1;
13255 /* If the two function declarations represent the same function (this can
13256 happen with declarations in multiple scopes and arg-dependent lookup),
13257 arbitrarily choose one. But first make sure the default args we're
13258 using match. */
13259 if (DECL_P (cand1->fn) && DECL_P (cand2->fn)
13260 && equal_functions (cand1->fn, cand2->fn))
13262 tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (cand1->fn));
13263 tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (cand2->fn));
13265 gcc_assert (!DECL_CONSTRUCTOR_P (cand1->fn));
13267 for (i = 0; i < len; ++i)
13269 /* Don't crash if the fn is variadic. */
13270 if (!parms1)
13271 break;
13272 parms1 = TREE_CHAIN (parms1);
13273 parms2 = TREE_CHAIN (parms2);
13276 if (off1)
13277 parms1 = TREE_CHAIN (parms1);
13278 else if (off2)
13279 parms2 = TREE_CHAIN (parms2);
13281 for (; parms1; ++i)
13283 if (!cp_tree_equal (TREE_PURPOSE (parms1),
13284 TREE_PURPOSE (parms2)))
13286 if (warn)
13288 if (complain & tf_error)
13290 auto_diagnostic_group d;
13291 if (permerror (input_location,
13292 "default argument mismatch in "
13293 "overload resolution"))
13295 inform (DECL_SOURCE_LOCATION (cand1->fn),
13296 " candidate 1: %q#F", cand1->fn);
13297 inform (DECL_SOURCE_LOCATION (cand2->fn),
13298 " candidate 2: %q#F", cand2->fn);
13301 else
13302 return 0;
13304 else
13305 add_warning (cand1, cand2);
13306 break;
13308 parms1 = TREE_CHAIN (parms1);
13309 parms2 = TREE_CHAIN (parms2);
13312 return 1;
13315 tweak:
13317 /* Extension: If the worst conversion for one candidate is better than the
13318 worst conversion for the other, take the first. */
13319 if (!pedantic && (complain & tf_warning_or_error))
13321 conversion_rank rank1 = cr_identity, rank2 = cr_identity;
13322 struct z_candidate *w = 0, *l = 0;
13324 for (i = 0; i < len; ++i)
13326 if (CONVERSION_RANK (cand1->convs[i+off1]) > rank1)
13327 rank1 = CONVERSION_RANK (cand1->convs[i+off1]);
13328 if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2)
13329 rank2 = CONVERSION_RANK (cand2->convs[i + off2]);
13331 if (rank1 < rank2)
13332 winner = 1, w = cand1, l = cand2;
13333 if (rank1 > rank2)
13334 winner = -1, w = cand2, l = cand1;
13335 if (winner)
13337 /* Don't choose a deleted function over ambiguity. */
13338 if (DECL_P (w->fn) && DECL_DELETED_FN (w->fn))
13339 return 0;
13340 if (warn)
13342 auto_diagnostic_group d;
13343 if (pedwarn (input_location, 0,
13344 "ISO C++ says that these are ambiguous, even "
13345 "though the worst conversion for the first is "
13346 "better than the worst conversion for the second:"))
13348 print_z_candidate (input_location, N_("candidate 1:"), w);
13349 print_z_candidate (input_location, N_("candidate 2:"), l);
13352 else
13353 add_warning (w, l);
13354 return winner;
13358 gcc_assert (!winner);
13359 return 0;
13362 /* Given a list of candidates for overloading, find the best one, if any.
13363 This algorithm has a worst case of O(2n) (winner is last), and a best
13364 case of O(n/2) (totally ambiguous); much better than a sorting
13365 algorithm. The candidates list is assumed to be sorted according
13366 to viability (via splice_viable). */
13368 static struct z_candidate *
13369 tourney (struct z_candidate *candidates, tsubst_flags_t complain)
13371 struct z_candidate **champ = &candidates, **challenger;
13372 int fate;
13373 struct z_candidate *previous_worse_champ = nullptr;
13375 /* Walk through the list once, comparing each current champ to the next
13376 candidate, knocking out a candidate or two with each comparison. */
13378 for (challenger = &candidates->next; *challenger && (*challenger)->viable; )
13380 fate = joust (*champ, *challenger, 0, complain);
13381 if (fate == 1)
13382 challenger = &(*challenger)->next;
13383 else if (fate == -1)
13385 previous_worse_champ = *champ;
13386 champ = challenger;
13387 challenger = &(*challenger)->next;
13389 else
13391 previous_worse_champ = nullptr;
13392 champ = &(*challenger)->next;
13393 if (!*champ || !(*champ)->viable)
13395 champ = nullptr;
13396 break;
13398 challenger = &(*champ)->next;
13402 /* Make sure the champ is better than all the candidates it hasn't yet
13403 been compared to. */
13405 if (champ)
13406 for (challenger = &candidates;
13407 challenger != champ;
13408 challenger = &(*challenger)->next)
13410 if (*challenger == previous_worse_champ)
13411 /* We already know this candidate is worse than the champ. */
13412 continue;
13413 fate = joust (*champ, *challenger, 0, complain);
13414 if (fate != 1)
13416 champ = nullptr;
13417 break;
13421 if (!champ)
13422 return nullptr;
13424 /* Move the champ to the front of the candidate list. */
13426 if (champ != &candidates)
13428 z_candidate *saved_champ = *champ;
13429 *champ = saved_champ->next;
13430 saved_champ->next = candidates;
13431 candidates = saved_champ;
13434 return candidates;
13437 /* Returns nonzero if things of type FROM can be converted to TO. */
13439 bool
13440 can_convert (tree to, tree from, tsubst_flags_t complain)
13442 tree arg = NULL_TREE;
13443 /* implicit_conversion only considers user-defined conversions
13444 if it has an expression for the call argument list. */
13445 if (CLASS_TYPE_P (from) || CLASS_TYPE_P (to))
13446 arg = build_stub_object (from);
13447 return can_convert_arg (to, from, arg, LOOKUP_IMPLICIT, complain);
13450 /* Returns nonzero if things of type FROM can be converted to TO with a
13451 standard conversion. */
13453 bool
13454 can_convert_standard (tree to, tree from, tsubst_flags_t complain)
13456 return can_convert_arg (to, from, NULL_TREE, LOOKUP_IMPLICIT, complain);
13459 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
13461 bool
13462 can_convert_arg (tree to, tree from, tree arg, int flags,
13463 tsubst_flags_t complain)
13465 conversion *t;
13466 bool ok_p;
13468 conversion_obstack_sentinel cos;
13469 /* We want to discard any access checks done for this test,
13470 as we might not be in the appropriate access context and
13471 we'll do the check again when we actually perform the
13472 conversion. */
13473 push_deferring_access_checks (dk_deferred);
13475 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
13476 flags, complain);
13477 ok_p = (t && !t->bad_p);
13479 /* Discard the access checks now. */
13480 pop_deferring_access_checks ();
13482 return ok_p;
13485 /* Like can_convert_arg, but allows dubious conversions as well. */
13487 bool
13488 can_convert_arg_bad (tree to, tree from, tree arg, int flags,
13489 tsubst_flags_t complain)
13491 conversion *t;
13493 conversion_obstack_sentinel cos;
13494 /* Try to perform the conversion. */
13495 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
13496 flags, complain);
13498 return t != NULL;
13501 /* Return an IMPLICIT_CONV_EXPR from EXPR to TYPE with bits set from overload
13502 resolution FLAGS. */
13504 tree
13505 build_implicit_conv_flags (tree type, tree expr, int flags)
13507 /* In a template, we are only concerned about determining the
13508 type of non-dependent expressions, so we do not have to
13509 perform the actual conversion. But for initializers, we
13510 need to be able to perform it at instantiation
13511 (or instantiate_non_dependent_expr) time. */
13512 expr = build1 (IMPLICIT_CONV_EXPR, type, expr);
13513 if (!(flags & LOOKUP_ONLYCONVERTING))
13514 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true;
13515 if (flags & LOOKUP_NO_NARROWING)
13516 IMPLICIT_CONV_EXPR_BRACED_INIT (expr) = true;
13517 return expr;
13520 /* Convert EXPR to TYPE. Return the converted expression.
13522 Note that we allow bad conversions here because by the time we get to
13523 this point we are committed to doing the conversion. If we end up
13524 doing a bad conversion, convert_like will complain. */
13526 tree
13527 perform_implicit_conversion_flags (tree type, tree expr,
13528 tsubst_flags_t complain, int flags)
13530 conversion *conv;
13531 location_t loc = cp_expr_loc_or_input_loc (expr);
13533 if (TYPE_REF_P (type))
13534 expr = mark_lvalue_use (expr);
13535 else
13536 expr = mark_rvalue_use (expr);
13538 if (error_operand_p (expr))
13539 return error_mark_node;
13541 conversion_obstack_sentinel cos;
13543 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
13544 /*c_cast_p=*/false,
13545 flags, complain);
13547 if (!conv)
13549 if (complain & tf_error)
13550 implicit_conversion_error (loc, type, expr);
13551 expr = error_mark_node;
13553 else if (processing_template_decl && conv->kind != ck_identity)
13554 expr = build_implicit_conv_flags (type, expr, flags);
13555 else
13557 /* Give a conversion call the same location as expr. */
13558 iloc_sentinel il (loc);
13559 expr = convert_like (conv, expr, complain);
13562 return expr;
13565 tree
13566 perform_implicit_conversion (tree type, tree expr, tsubst_flags_t complain)
13568 return perform_implicit_conversion_flags (type, expr, complain,
13569 LOOKUP_IMPLICIT);
13572 /* Convert EXPR to TYPE (as a direct-initialization) if that is
13573 permitted. If the conversion is valid, the converted expression is
13574 returned. Otherwise, NULL_TREE is returned, except in the case
13575 that TYPE is a class type; in that case, an error is issued. If
13576 C_CAST_P is true, then this direct-initialization is taking
13577 place as part of a static_cast being attempted as part of a C-style
13578 cast. */
13580 tree
13581 perform_direct_initialization_if_possible (tree type,
13582 tree expr,
13583 bool c_cast_p,
13584 tsubst_flags_t complain)
13586 conversion *conv;
13588 if (type == error_mark_node || error_operand_p (expr))
13589 return error_mark_node;
13590 /* [dcl.init]
13592 If the destination type is a (possibly cv-qualified) class type:
13594 -- If the initialization is direct-initialization ...,
13595 constructors are considered.
13597 -- If overload resolution is successful, the selected constructor
13598 is called to initialize the object, with the initializer expression
13599 or expression-list as its argument(s).
13601 -- Otherwise, if no constructor is viable, the destination type is
13602 a (possibly cv-qualified) aggregate class A, and the initializer is
13603 a parenthesized expression-list, the object is initialized as
13604 follows... */
13605 if (CLASS_TYPE_P (type))
13607 releasing_vec args (make_tree_vector_single (expr));
13608 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
13609 &args, type, LOOKUP_NORMAL, complain);
13610 return build_cplus_new (type, expr, complain);
13613 conversion_obstack_sentinel cos;
13615 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
13616 c_cast_p,
13617 LOOKUP_NORMAL, complain);
13618 if (!conv || conv->bad_p)
13619 expr = NULL_TREE;
13620 else if (processing_template_decl && conv->kind != ck_identity)
13622 /* In a template, we are only concerned about determining the
13623 type of non-dependent expressions, so we do not have to
13624 perform the actual conversion. But for initializers, we
13625 need to be able to perform it at instantiation
13626 (or instantiate_non_dependent_expr) time. */
13627 expr = build1 (IMPLICIT_CONV_EXPR, type, expr);
13628 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true;
13630 else
13631 expr = convert_like (conv, expr, NULL_TREE, 0,
13632 /*issue_conversion_warnings=*/false,
13633 c_cast_p, /*nested_p=*/false, complain);
13635 return expr;
13638 /* When initializing a reference that lasts longer than a full-expression,
13639 this special rule applies:
13641 [class.temporary]
13643 The temporary to which the reference is bound or the temporary
13644 that is the complete object to which the reference is bound
13645 persists for the lifetime of the reference.
13647 The temporaries created during the evaluation of the expression
13648 initializing the reference, except the temporary to which the
13649 reference is bound, are destroyed at the end of the
13650 full-expression in which they are created.
13652 In that case, we store the converted expression into a new
13653 VAR_DECL in a new scope.
13655 However, we want to be careful not to create temporaries when
13656 they are not required. For example, given:
13658 struct B {};
13659 struct D : public B {};
13660 D f();
13661 const B& b = f();
13663 there is no need to copy the return value from "f"; we can just
13664 extend its lifetime. Similarly, given:
13666 struct S {};
13667 struct T { operator S(); };
13668 T t;
13669 const S& s = t;
13671 we can extend the lifetime of the return value of the conversion
13672 operator.
13674 The next several functions are involved in this lifetime extension. */
13676 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
13677 reference is being bound to a temporary. Create and return a new
13678 VAR_DECL with the indicated TYPE; this variable will store the value to
13679 which the reference is bound. */
13681 tree
13682 make_temporary_var_for_ref_to_temp (tree decl, tree type)
13684 tree var = create_temporary_var (type);
13686 /* Register the variable. */
13687 if (VAR_P (decl)
13688 && (TREE_STATIC (decl) || CP_DECL_THREAD_LOCAL_P (decl)))
13690 /* Namespace-scope or local static; give it a mangled name. */
13692 /* If an initializer is visible to multiple translation units, those
13693 translation units must agree on the addresses of the
13694 temporaries. Therefore the temporaries must be given a consistent name
13695 and vague linkage. The mangled name of a temporary is the name of the
13696 non-temporary object in whose initializer they appear, prefixed with
13697 GR and suffixed with a sequence number mangled using the usual rules
13698 for a seq-id. Temporaries are numbered with a pre-order, depth-first,
13699 left-to-right walk of the complete initializer. */
13700 copy_linkage (var, decl);
13702 tree name = mangle_ref_init_variable (decl);
13703 DECL_NAME (var) = name;
13704 SET_DECL_ASSEMBLER_NAME (var, name);
13706 else
13707 /* Create a new cleanup level if necessary. */
13708 maybe_push_cleanup_level (type);
13710 return pushdecl (var);
13713 /* EXPR is the initializer for a variable DECL of reference or
13714 std::initializer_list type. Create, push and return a new VAR_DECL
13715 for the initializer so that it will live as long as DECL. Any
13716 cleanup for the new variable is returned through CLEANUP, and the
13717 code to initialize the new variable is returned through INITP. */
13719 static tree
13720 set_up_extended_ref_temp (tree decl, tree expr, vec<tree, va_gc> **cleanups,
13721 tree *initp, tree *cond_guard)
13723 tree init;
13724 tree type;
13725 tree var;
13727 /* Create the temporary variable. */
13728 type = TREE_TYPE (expr);
13729 var = make_temporary_var_for_ref_to_temp (decl, type);
13730 layout_decl (var, 0);
13731 /* If the rvalue is the result of a function call it will be
13732 a TARGET_EXPR. If it is some other construct (such as a
13733 member access expression where the underlying object is
13734 itself the result of a function call), turn it into a
13735 TARGET_EXPR here. It is important that EXPR be a
13736 TARGET_EXPR below since otherwise the INIT_EXPR will
13737 attempt to make a bitwise copy of EXPR to initialize
13738 VAR. */
13739 if (TREE_CODE (expr) != TARGET_EXPR)
13740 expr = get_target_expr (expr);
13741 else
13743 if (TREE_ADDRESSABLE (expr))
13744 TREE_ADDRESSABLE (var) = 1;
13745 if (DECL_MERGEABLE (TARGET_EXPR_SLOT (expr)))
13746 DECL_MERGEABLE (var) = true;
13749 if (TREE_CODE (decl) == FIELD_DECL
13750 && extra_warnings && !warning_suppressed_p (decl))
13752 warning (OPT_Wextra, "a temporary bound to %qD only persists "
13753 "until the constructor exits", decl);
13754 suppress_warning (decl);
13757 /* Recursively extend temps in this initializer. */
13758 TARGET_EXPR_INITIAL (expr)
13759 = extend_ref_init_temps (decl, TARGET_EXPR_INITIAL (expr), cleanups,
13760 cond_guard);
13762 /* Any reference temp has a non-trivial initializer. */
13763 DECL_NONTRIVIALLY_INITIALIZED_P (var) = true;
13765 /* If the initializer is constant, put it in DECL_INITIAL so we get
13766 static initialization and use in constant expressions. */
13767 init = maybe_constant_init (expr, var, /*manifestly_const_eval=*/true);
13768 /* As in store_init_value. */
13769 init = cp_fully_fold (init);
13770 if (TREE_CONSTANT (init))
13772 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
13774 /* 5.19 says that a constant expression can include an
13775 lvalue-rvalue conversion applied to "a glvalue of literal type
13776 that refers to a non-volatile temporary object initialized
13777 with a constant expression". Rather than try to communicate
13778 that this VAR_DECL is a temporary, just mark it constexpr. */
13779 DECL_DECLARED_CONSTEXPR_P (var) = true;
13780 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var) = true;
13781 TREE_CONSTANT (var) = true;
13782 TREE_READONLY (var) = true;
13784 DECL_INITIAL (var) = init;
13785 init = NULL_TREE;
13787 else
13788 /* Create the INIT_EXPR that will initialize the temporary
13789 variable. */
13790 init = split_nonconstant_init (var, expr);
13791 if (at_function_scope_p ())
13793 add_decl_expr (var);
13795 if (TREE_STATIC (var))
13796 init = add_stmt_to_compound (init, register_dtor_fn (var));
13797 else
13799 tree cleanup = cxx_maybe_build_cleanup (var, tf_warning_or_error);
13800 if (cleanup)
13802 if (cond_guard && cleanup != error_mark_node)
13804 if (*cond_guard == NULL_TREE)
13806 *cond_guard = build_local_temp (boolean_type_node);
13807 add_decl_expr (*cond_guard);
13808 tree set = cp_build_modify_expr (UNKNOWN_LOCATION,
13809 *cond_guard, NOP_EXPR,
13810 boolean_false_node,
13811 tf_warning_or_error);
13812 finish_expr_stmt (set);
13814 cleanup = build3 (COND_EXPR, void_type_node,
13815 *cond_guard, cleanup, NULL_TREE);
13817 vec_safe_push (*cleanups, cleanup);
13821 /* We must be careful to destroy the temporary only
13822 after its initialization has taken place. If the
13823 initialization throws an exception, then the
13824 destructor should not be run. We cannot simply
13825 transform INIT into something like:
13827 (INIT, ({ CLEANUP_STMT; }))
13829 because emit_local_var always treats the
13830 initializer as a full-expression. Thus, the
13831 destructor would run too early; it would run at the
13832 end of initializing the reference variable, rather
13833 than at the end of the block enclosing the
13834 reference variable.
13836 The solution is to pass back a cleanup expression
13837 which the caller is responsible for attaching to
13838 the statement tree. */
13840 else
13842 rest_of_decl_compilation (var, /*toplev=*/1, at_eof);
13843 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
13845 if (CP_DECL_THREAD_LOCAL_P (var))
13846 tls_aggregates = tree_cons (NULL_TREE, var,
13847 tls_aggregates);
13848 else
13849 static_aggregates = tree_cons (NULL_TREE, var,
13850 static_aggregates);
13852 else
13853 /* Check whether the dtor is callable. */
13854 cxx_maybe_build_cleanup (var, tf_warning_or_error);
13856 /* Avoid -Wunused-variable warning (c++/38958). */
13857 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
13858 && VAR_P (decl))
13859 TREE_USED (decl) = DECL_READ_P (decl) = true;
13861 *initp = init;
13862 return var;
13865 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
13866 initializing a variable of that TYPE. */
13868 tree
13869 initialize_reference (tree type, tree expr,
13870 int flags, tsubst_flags_t complain)
13872 conversion *conv;
13873 location_t loc = cp_expr_loc_or_input_loc (expr);
13875 if (type == error_mark_node || error_operand_p (expr))
13876 return error_mark_node;
13878 conversion_obstack_sentinel cos;
13880 conv = reference_binding (type, TREE_TYPE (expr), expr, /*c_cast_p=*/false,
13881 flags, complain);
13882 /* If this conversion failed, we're in C++20, and we have something like
13883 A& a(b) where A is an aggregate, try again, this time as A& a{b}. */
13884 if ((!conv || conv->bad_p)
13885 && (flags & LOOKUP_AGGREGATE_PAREN_INIT))
13887 tree e = build_constructor_single (init_list_type_node, NULL_TREE, expr);
13888 CONSTRUCTOR_IS_DIRECT_INIT (e) = true;
13889 CONSTRUCTOR_IS_PAREN_INIT (e) = true;
13890 conversion *c = reference_binding (type, TREE_TYPE (e), e,
13891 /*c_cast_p=*/false, flags, complain);
13892 /* If this worked, use it. */
13893 if (c && !c->bad_p)
13894 expr = e, conv = c;
13896 if (!conv || conv->bad_p)
13898 if (complain & tf_error)
13900 if (conv)
13901 convert_like (conv, expr, complain);
13902 else if (!CP_TYPE_CONST_P (TREE_TYPE (type))
13903 && !TYPE_REF_IS_RVALUE (type)
13904 && !lvalue_p (expr))
13905 error_at (loc, "invalid initialization of non-const reference of "
13906 "type %qH from an rvalue of type %qI",
13907 type, TREE_TYPE (expr));
13908 else
13909 error_at (loc, "invalid initialization of reference of type "
13910 "%qH from expression of type %qI", type,
13911 TREE_TYPE (expr));
13913 return error_mark_node;
13916 if (conv->kind == ck_ref_bind)
13917 /* Perform the conversion. */
13918 expr = convert_like (conv, expr, complain);
13919 else if (conv->kind == ck_ambig)
13920 /* We gave an error in build_user_type_conversion_1. */
13921 expr = error_mark_node;
13922 else
13923 gcc_unreachable ();
13925 return expr;
13928 /* Return true if T is std::pair<const T&, const T&>. */
13930 static bool
13931 std_pair_ref_ref_p (tree t)
13933 /* First, check if we have std::pair. */
13934 if (!NON_UNION_CLASS_TYPE_P (t)
13935 || !CLASSTYPE_TEMPLATE_INSTANTIATION (t))
13936 return false;
13937 tree tdecl = TYPE_NAME (TYPE_MAIN_VARIANT (t));
13938 if (!decl_in_std_namespace_p (tdecl))
13939 return false;
13940 tree name = DECL_NAME (tdecl);
13941 if (!name || !id_equal (name, "pair"))
13942 return false;
13944 /* Now see if the template arguments are both const T&. */
13945 tree args = CLASSTYPE_TI_ARGS (t);
13946 if (TREE_VEC_LENGTH (args) != 2)
13947 return false;
13948 for (int i = 0; i < 2; i++)
13949 if (!TYPE_REF_OBJ_P (TREE_VEC_ELT (args, i))
13950 || !CP_TYPE_CONST_P (TREE_TYPE (TREE_VEC_ELT (args, i))))
13951 return false;
13953 return true;
13956 /* Return true if a class CTYPE is either std::reference_wrapper or
13957 std::ref_view, or a reference wrapper class. We consider a class
13958 a reference wrapper class if it has a reference member. We no
13959 longer check that it has a constructor taking the same reference type
13960 since that approach still generated too many false positives. */
13962 static bool
13963 class_has_reference_member_p (tree t)
13965 for (tree fields = TYPE_FIELDS (t);
13966 fields;
13967 fields = DECL_CHAIN (fields))
13968 if (TREE_CODE (fields) == FIELD_DECL
13969 && !DECL_ARTIFICIAL (fields)
13970 && TYPE_REF_P (TREE_TYPE (fields)))
13971 return true;
13972 return false;
13975 /* A wrapper for the above suitable as a callback for dfs_walk_once. */
13977 static tree
13978 class_has_reference_member_p_r (tree binfo, void *)
13980 return (class_has_reference_member_p (BINFO_TYPE (binfo))
13981 ? integer_one_node : NULL_TREE);
13984 static bool
13985 reference_like_class_p (tree ctype)
13987 if (!CLASS_TYPE_P (ctype))
13988 return false;
13990 /* Also accept a std::pair<const T&, const T&>. */
13991 if (std_pair_ref_ref_p (ctype))
13992 return true;
13994 tree tdecl = TYPE_NAME (TYPE_MAIN_VARIANT (ctype));
13995 if (decl_in_std_namespace_p (tdecl))
13997 tree name = DECL_NAME (tdecl);
13998 if (name
13999 && (id_equal (name, "reference_wrapper")
14000 || id_equal (name, "span")
14001 || id_equal (name, "ref_view")))
14002 return true;
14005 /* Some classes, such as std::tuple, have the reference member in its
14006 (non-direct) base class. */
14007 if (dfs_walk_once (TYPE_BINFO (ctype), class_has_reference_member_p_r,
14008 nullptr, nullptr))
14009 return true;
14011 return false;
14014 /* Helper for maybe_warn_dangling_reference to find a problematic CALL_EXPR
14015 that initializes the LHS (and at least one of its arguments represents
14016 a temporary, as outlined in maybe_warn_dangling_reference), or NULL_TREE
14017 if none found. For instance:
14019 const S& s = S().self(); // S::self (&TARGET_EXPR <...>)
14020 const int& r = (42, f(1)); // f(1)
14021 const int& t = b ? f(1) : f(2); // f(1)
14022 const int& u = b ? f(1) : f(g); // f(1)
14023 const int& v = b ? f(g) : f(2); // f(2)
14024 const int& w = b ? f(g) : f(g); // NULL_TREE
14025 const int& y = (f(1), 42); // NULL_TREE
14026 const int& z = f(f(1)); // f(f(1))
14028 EXPR is the initializer. If ARG_P is true, we're processing an argument
14029 to a function; the point is to distinguish between, for example,
14031 Ref::inner (&TARGET_EXPR <D.2839, F::foo (fm)>)
14033 where we shouldn't warn, and
14035 Ref::inner (&TARGET_EXPR <D.2908, F::foo (&TARGET_EXPR <...>)>)
14037 where we should warn (Ref is a reference_like_class_p so we see through
14038 it. */
14040 static tree
14041 do_warn_dangling_reference (tree expr, bool arg_p)
14043 STRIP_NOPS (expr);
14045 if (arg_p && expr_represents_temporary_p (expr))
14047 /* An attempt to reduce the number of -Wdangling-reference
14048 false positives concerning reference wrappers (c++/107532).
14049 When we encounter a reference_like_class_p, we don't warn
14050 just yet; instead, we keep recursing to see if there were
14051 any temporaries behind the reference-wrapper class. */
14052 tree e = expr;
14053 while (handled_component_p (e))
14054 e = TREE_OPERAND (e, 0);
14055 if (!reference_like_class_p (TREE_TYPE (e)))
14056 return expr;
14059 switch (TREE_CODE (expr))
14061 case CALL_EXPR:
14063 tree fndecl = cp_get_callee_fndecl_nofold (expr);
14064 if (!fndecl
14065 || warning_suppressed_p (fndecl, OPT_Wdangling_reference)
14066 || !warning_enabled_at (DECL_SOURCE_LOCATION (fndecl),
14067 OPT_Wdangling_reference)
14068 /* Don't emit a false positive for:
14069 std::vector<int> v = ...;
14070 std::vector<int>::const_iterator it = v.begin();
14071 const int &r = *it++;
14072 because R refers to one of the int elements of V, not to
14073 a temporary object. Member operator* may return a reference
14074 but probably not to one of its arguments. */
14075 || (DECL_OBJECT_MEMBER_FUNCTION_P (fndecl)
14076 && DECL_OVERLOADED_OPERATOR_P (fndecl)
14077 && DECL_OVERLOADED_OPERATOR_IS (fndecl, INDIRECT_REF)))
14078 return NULL_TREE;
14080 tree rettype = TREE_TYPE (TREE_TYPE (fndecl));
14081 /* If the function doesn't return a reference, don't warn. This
14082 can be e.g.
14083 const int& z = std::min({1, 2, 3, 4, 5, 6, 7});
14084 which doesn't dangle: std::min here returns an int.
14086 If the function returns a std::pair<const T&, const T&>, we
14087 warn, to detect e.g.
14088 std::pair<const int&, const int&> v = std::minmax(1, 2);
14089 which also creates a dangling reference, because std::minmax
14090 returns std::pair<const T&, const T&>(b, a). */
14091 if (!(TYPE_REF_OBJ_P (rettype) || reference_like_class_p (rettype)))
14092 return NULL_TREE;
14094 /* Here we're looking to see if any of the arguments is a temporary
14095 initializing a reference parameter. */
14096 for (int i = 0; i < call_expr_nargs (expr); ++i)
14098 tree arg = CALL_EXPR_ARG (expr, i);
14099 /* Check that this argument initializes a reference, except for
14100 the argument initializing the object of a member function. */
14101 if (!DECL_IOBJ_MEMBER_FUNCTION_P (fndecl)
14102 && !TYPE_REF_P (TREE_TYPE (arg)))
14103 continue;
14104 STRIP_NOPS (arg);
14105 if (TREE_CODE (arg) == ADDR_EXPR)
14106 arg = TREE_OPERAND (arg, 0);
14107 /* Recurse to see if the argument is a temporary. It could also
14108 be another call taking a temporary and returning it and
14109 initializing this reference parameter. */
14110 if (do_warn_dangling_reference (arg, /*arg_p=*/true))
14111 return expr;
14112 /* Don't warn about member function like:
14113 std::any a(...);
14114 S& s = a.emplace<S>({0}, 0);
14115 which constructs a new object and returns a reference to it, but
14116 we still want to detect:
14117 struct S { const S& self () { return *this; } };
14118 const S& s = S().self();
14119 where 's' dangles. If we've gotten here, the object this function
14120 is invoked on is not a temporary. */
14121 if (DECL_OBJECT_MEMBER_FUNCTION_P (fndecl))
14122 break;
14124 return NULL_TREE;
14126 case COMPOUND_EXPR:
14127 return do_warn_dangling_reference (TREE_OPERAND (expr, 1), arg_p);
14128 case COND_EXPR:
14129 if (tree t = do_warn_dangling_reference (TREE_OPERAND (expr, 1), arg_p))
14130 return t;
14131 return do_warn_dangling_reference (TREE_OPERAND (expr, 2), arg_p);
14132 case PAREN_EXPR:
14133 return do_warn_dangling_reference (TREE_OPERAND (expr, 0), arg_p);
14134 case TARGET_EXPR:
14135 return do_warn_dangling_reference (TARGET_EXPR_INITIAL (expr), arg_p);
14136 default:
14137 return NULL_TREE;
14141 /* Implement -Wdangling-reference, to detect cases like
14143 int n = 1;
14144 const int& r = std::max(n - 1, n + 1); // r is dangling
14146 This creates temporaries from the arguments, returns a reference to
14147 one of the temporaries, but both temporaries are destroyed at the end
14148 of the full expression.
14150 This works by checking if a reference is initialized with a function
14151 that returns a reference, and at least one parameter of the function
14152 is a reference that is bound to a temporary. It assumes that such a
14153 function actually returns one of its arguments.
14155 DECL is the reference being initialized, INIT is the initializer. */
14157 static void
14158 maybe_warn_dangling_reference (const_tree decl, tree init)
14160 if (!warn_dangling_reference)
14161 return;
14162 tree type = TREE_TYPE (decl);
14163 /* Only warn if what we're initializing has type T&& or const T&, or
14164 std::pair<const T&, const T&>. (A non-const lvalue reference can't
14165 bind to a temporary.) */
14166 if (!((TYPE_REF_OBJ_P (type)
14167 && (TYPE_REF_IS_RVALUE (type)
14168 || CP_TYPE_CONST_P (TREE_TYPE (type))))
14169 || std_pair_ref_ref_p (type)))
14170 return;
14171 /* Don't suppress the diagnostic just because the call comes from
14172 a system header. If the DECL is not in a system header, or if
14173 -Wsystem-headers was provided, warn. */
14174 auto wsh
14175 = make_temp_override (global_dc->m_warn_system_headers,
14176 (!in_system_header_at (DECL_SOURCE_LOCATION (decl))
14177 || global_dc->m_warn_system_headers));
14178 if (tree call = do_warn_dangling_reference (init, /*arg_p=*/false))
14180 auto_diagnostic_group d;
14181 if (warning_at (DECL_SOURCE_LOCATION (decl), OPT_Wdangling_reference,
14182 "possibly dangling reference to a temporary"))
14183 inform (EXPR_LOCATION (call), "the temporary was destroyed at "
14184 "the end of the full expression %qE", call);
14188 /* If *P is an xvalue expression, prevent temporary lifetime extension if it
14189 gets used to initialize a reference. */
14191 static tree
14192 prevent_lifetime_extension (tree t)
14194 tree *p = &t;
14195 while (TREE_CODE (*p) == COMPOUND_EXPR)
14196 p = &TREE_OPERAND (*p, 1);
14197 while (handled_component_p (*p))
14198 p = &TREE_OPERAND (*p, 0);
14199 /* Change a TARGET_EXPR from prvalue to xvalue. */
14200 if (TREE_CODE (*p) == TARGET_EXPR)
14201 *p = build2 (COMPOUND_EXPR, TREE_TYPE (*p), *p,
14202 move (TARGET_EXPR_SLOT (*p)));
14203 return t;
14206 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
14207 which is bound either to a reference or a std::initializer_list. */
14209 static tree
14210 extend_ref_init_temps_1 (tree decl, tree init, vec<tree, va_gc> **cleanups,
14211 tree *cond_guard)
14213 /* CWG1299 (C++20): The temporary object to which the reference is bound or
14214 the temporary object that is the complete object of a subobject to which
14215 the reference is bound persists for the lifetime of the reference if the
14216 glvalue to which the reference is bound was obtained through one of the
14217 following:
14218 - a temporary materialization conversion ([conv.rval]),
14219 - ( expression ), where expression is one of these expressions,
14220 - subscripting ([expr.sub]) of an array operand, where that operand is one
14221 of these expressions,
14222 - a class member access ([expr.ref]) using the . operator where the left
14223 operand is one of these expressions and the right operand designates a
14224 non-static data member of non-reference type,
14225 - a pointer-to-member operation ([expr.mptr.oper]) using the .* operator
14226 where the left operand is one of these expressions and the right operand
14227 is a pointer to data member of non-reference type,
14228 - a const_cast ([expr.const.cast]), static_cast ([expr.static.cast]),
14229 dynamic_cast ([expr.dynamic.cast]), or reinterpret_cast
14230 ([expr.reinterpret.cast]) converting, without a user-defined conversion,
14231 a glvalue operand that is one of these expressions to a glvalue that
14232 refers to the object designated by the operand, or to its complete
14233 object or a subobject thereof,
14234 - a conditional expression ([expr.cond]) that is a glvalue where the
14235 second or third operand is one of these expressions, or
14236 - a comma expression ([expr.comma]) that is a glvalue where the right
14237 operand is one of these expressions. */
14239 /* FIXME several cases are still handled wrong (101572, 81420). */
14241 tree sub = init;
14242 tree *p;
14243 STRIP_NOPS (sub);
14244 if (TREE_CODE (sub) == COMPOUND_EXPR)
14246 TREE_OPERAND (sub, 1)
14247 = extend_ref_init_temps_1 (decl, TREE_OPERAND (sub, 1), cleanups,
14248 cond_guard);
14249 return init;
14251 if (TREE_CODE (sub) == POINTER_PLUS_EXPR
14252 && TYPE_PTRDATAMEM_P (TREE_TYPE (tree_strip_nop_conversions
14253 (TREE_OPERAND (sub, 1)))))
14255 /* A pointer-to-member operation. */
14256 TREE_OPERAND (sub, 0)
14257 = extend_ref_init_temps_1 (decl, TREE_OPERAND (sub, 0), cleanups,
14258 cond_guard);
14259 return init;
14261 if (TREE_CODE (sub) == COND_EXPR)
14263 tree cur_cond_guard = NULL_TREE;
14264 if (TREE_OPERAND (sub, 1))
14265 TREE_OPERAND (sub, 1)
14266 = extend_ref_init_temps_1 (decl, TREE_OPERAND (sub, 1), cleanups,
14267 &cur_cond_guard);
14268 if (cur_cond_guard)
14270 tree set = cp_build_modify_expr (UNKNOWN_LOCATION, cur_cond_guard,
14271 NOP_EXPR, boolean_true_node,
14272 tf_warning_or_error);
14273 TREE_OPERAND (sub, 1)
14274 = cp_build_compound_expr (set, TREE_OPERAND (sub, 1),
14275 tf_warning_or_error);
14277 cur_cond_guard = NULL_TREE;
14278 if (TREE_OPERAND (sub, 2))
14279 TREE_OPERAND (sub, 2)
14280 = extend_ref_init_temps_1 (decl, TREE_OPERAND (sub, 2), cleanups,
14281 &cur_cond_guard);
14282 if (cur_cond_guard)
14284 tree set = cp_build_modify_expr (UNKNOWN_LOCATION, cur_cond_guard,
14285 NOP_EXPR, boolean_true_node,
14286 tf_warning_or_error);
14287 TREE_OPERAND (sub, 2)
14288 = cp_build_compound_expr (set, TREE_OPERAND (sub, 2),
14289 tf_warning_or_error);
14291 return init;
14293 if (TREE_CODE (sub) != ADDR_EXPR)
14294 return init;
14295 /* Deal with binding to a subobject. */
14296 for (p = &TREE_OPERAND (sub, 0);
14297 TREE_CODE (*p) == COMPONENT_REF || TREE_CODE (*p) == ARRAY_REF; )
14298 p = &TREE_OPERAND (*p, 0);
14299 if (TREE_CODE (*p) == TARGET_EXPR)
14301 tree subinit = NULL_TREE;
14302 *p = set_up_extended_ref_temp (decl, *p, cleanups, &subinit, cond_guard);
14303 recompute_tree_invariant_for_addr_expr (sub);
14304 if (init != sub)
14305 init = fold_convert (TREE_TYPE (init), sub);
14306 if (subinit)
14307 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), subinit, init);
14309 return init;
14312 /* INIT is part of the initializer for DECL. If there are any
14313 reference or initializer lists being initialized, extend their
14314 lifetime to match that of DECL. */
14316 tree
14317 extend_ref_init_temps (tree decl, tree init, vec<tree, va_gc> **cleanups,
14318 tree *cond_guard)
14320 tree type = TREE_TYPE (init);
14321 if (processing_template_decl)
14322 return init;
14324 maybe_warn_dangling_reference (decl, init);
14326 if (TYPE_REF_P (type))
14327 init = extend_ref_init_temps_1 (decl, init, cleanups, cond_guard);
14328 else
14330 tree ctor = init;
14331 if (TREE_CODE (ctor) == TARGET_EXPR)
14332 ctor = TARGET_EXPR_INITIAL (ctor);
14333 if (TREE_CODE (ctor) == CONSTRUCTOR)
14335 /* [dcl.init] When initializing an aggregate from a parenthesized list
14336 of values... a temporary object bound to a reference does not have
14337 its lifetime extended. */
14338 if (CONSTRUCTOR_IS_PAREN_INIT (ctor))
14339 return init;
14341 if (is_std_init_list (type))
14343 /* The temporary array underlying a std::initializer_list
14344 is handled like a reference temporary. */
14345 tree array = CONSTRUCTOR_ELT (ctor, 0)->value;
14346 array = extend_ref_init_temps_1 (decl, array, cleanups,
14347 cond_guard);
14348 CONSTRUCTOR_ELT (ctor, 0)->value = array;
14350 else
14352 unsigned i;
14353 constructor_elt *p;
14354 vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (ctor);
14355 FOR_EACH_VEC_SAFE_ELT (elts, i, p)
14356 p->value = extend_ref_init_temps (decl, p->value, cleanups,
14357 cond_guard);
14359 recompute_constructor_flags (ctor);
14360 if (decl_maybe_constant_var_p (decl) && TREE_CONSTANT (ctor))
14361 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
14365 return init;
14368 /* Returns true iff an initializer for TYPE could contain temporaries that
14369 need to be extended because they are bound to references or
14370 std::initializer_list. */
14372 bool
14373 type_has_extended_temps (tree type)
14375 type = strip_array_types (type);
14376 if (TYPE_REF_P (type))
14377 return true;
14378 if (CLASS_TYPE_P (type))
14380 if (is_std_init_list (type))
14381 return true;
14382 for (tree f = next_aggregate_field (TYPE_FIELDS (type));
14383 f; f = next_aggregate_field (DECL_CHAIN (f)))
14384 if (type_has_extended_temps (TREE_TYPE (f)))
14385 return true;
14387 return false;
14390 /* Returns true iff TYPE is some variant of std::initializer_list. */
14392 bool
14393 is_std_init_list (tree type)
14395 if (!TYPE_P (type))
14396 return false;
14397 if (cxx_dialect == cxx98)
14398 return false;
14399 /* Look through typedefs. */
14400 type = TYPE_MAIN_VARIANT (type);
14401 return (CLASS_TYPE_P (type)
14402 && CP_TYPE_CONTEXT (type) == std_node
14403 && init_list_identifier == DECL_NAME (TYPE_NAME (type)));
14406 /* Returns true iff DECL is a list constructor: i.e. a constructor which
14407 will accept an argument list of a single std::initializer_list<T>. */
14409 bool
14410 is_list_ctor (tree decl)
14412 tree args = FUNCTION_FIRST_USER_PARMTYPE (decl);
14413 tree arg;
14415 if (!args || args == void_list_node)
14416 return false;
14418 arg = non_reference (TREE_VALUE (args));
14419 if (!is_std_init_list (arg))
14420 return false;
14422 args = TREE_CHAIN (args);
14424 if (args && args != void_list_node && !TREE_PURPOSE (args))
14425 /* There are more non-defaulted parms. */
14426 return false;
14428 return true;
14431 /* We know that can_convert_arg_bad already said "no" when trying to convert
14432 FROM to TO with ARG and FLAGS. Try to figure out if it was because
14433 an explicit conversion function was skipped when looking for a way to
14434 perform the conversion. At this point we've already printed an error. */
14436 void
14437 maybe_show_nonconverting_candidate (tree to, tree from, tree arg, int flags)
14439 if (!(flags & LOOKUP_ONLYCONVERTING))
14440 return;
14442 conversion_obstack_sentinel cos;
14443 conversion *c = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
14444 flags & ~LOOKUP_ONLYCONVERTING, tf_none);
14445 if (c && !c->bad_p && c->user_conv_p)
14446 /* Ay, the conversion would have worked in direct-init context. */
14447 for (; c; c = next_conversion (c))
14448 if (c->kind == ck_user
14449 && DECL_P (c->cand->fn)
14450 && DECL_NONCONVERTING_P (c->cand->fn))
14451 inform (DECL_SOURCE_LOCATION (c->cand->fn), "explicit conversion "
14452 "function was not considered");
14455 #include "gt-cp-call.h"