PR c++/84707
[official-gcc.git] / gcc / cp / call.c
blob11fe28292fb105c10e0937672d036efa60e8ec6d
1 /* Functions related to invoking -*- C++ -*- methods and overloaded functions.
2 Copyright (C) 1987-2018 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"
45 /* The various kinds of conversion. */
47 enum conversion_kind {
48 ck_identity,
49 ck_lvalue,
50 ck_fnptr,
51 ck_qual,
52 ck_std,
53 ck_ptr,
54 ck_pmem,
55 ck_base,
56 ck_ref_bind,
57 ck_user,
58 ck_ambig,
59 ck_list,
60 ck_aggr,
61 ck_rvalue
64 /* The rank of the conversion. Order of the enumerals matters; better
65 conversions should come earlier in the list. */
67 enum conversion_rank {
68 cr_identity,
69 cr_exact,
70 cr_promotion,
71 cr_std,
72 cr_pbool,
73 cr_user,
74 cr_ellipsis,
75 cr_bad
78 /* An implicit conversion sequence, in the sense of [over.best.ics].
79 The first conversion to be performed is at the end of the chain.
80 That conversion is always a cr_identity conversion. */
82 struct conversion {
83 /* The kind of conversion represented by this step. */
84 conversion_kind kind;
85 /* The rank of this conversion. */
86 conversion_rank rank;
87 BOOL_BITFIELD user_conv_p : 1;
88 BOOL_BITFIELD ellipsis_p : 1;
89 BOOL_BITFIELD this_p : 1;
90 /* True if this conversion would be permitted with a bending of
91 language standards, e.g. disregarding pointer qualifiers or
92 converting integers to pointers. */
93 BOOL_BITFIELD bad_p : 1;
94 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
95 temporary should be created to hold the result of the
96 conversion. */
97 BOOL_BITFIELD need_temporary_p : 1;
98 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
99 from a pointer-to-derived to pointer-to-base is being performed. */
100 BOOL_BITFIELD base_p : 1;
101 /* If KIND is ck_ref_bind, true when either an lvalue reference is
102 being bound to an lvalue expression or an rvalue reference is
103 being bound to an rvalue expression. If KIND is ck_rvalue,
104 true when we are treating an lvalue as an rvalue (12.8p33). If
105 KIND is ck_base, always false. If ck_identity, we will be
106 binding a reference directly. */
107 BOOL_BITFIELD rvaluedness_matches_p: 1;
108 BOOL_BITFIELD check_narrowing: 1;
109 /* The type of the expression resulting from the conversion. */
110 tree type;
111 union {
112 /* The next conversion in the chain. Since the conversions are
113 arranged from outermost to innermost, the NEXT conversion will
114 actually be performed before this conversion. This variant is
115 used only when KIND is neither ck_identity, ck_ambig nor
116 ck_list. Please use the next_conversion function instead
117 of using this field directly. */
118 conversion *next;
119 /* The expression at the beginning of the conversion chain. This
120 variant is used only if KIND is ck_identity or ck_ambig. */
121 tree expr;
122 /* The array of conversions for an initializer_list, so this
123 variant is used only when KIN D is ck_list. */
124 conversion **list;
125 } u;
126 /* The function candidate corresponding to this conversion
127 sequence. This field is only used if KIND is ck_user. */
128 struct z_candidate *cand;
131 #define CONVERSION_RANK(NODE) \
132 ((NODE)->bad_p ? cr_bad \
133 : (NODE)->ellipsis_p ? cr_ellipsis \
134 : (NODE)->user_conv_p ? cr_user \
135 : (NODE)->rank)
137 #define BAD_CONVERSION_RANK(NODE) \
138 ((NODE)->ellipsis_p ? cr_ellipsis \
139 : (NODE)->user_conv_p ? cr_user \
140 : (NODE)->rank)
142 static struct obstack conversion_obstack;
143 static bool conversion_obstack_initialized;
144 struct rejection_reason;
146 static struct z_candidate * tourney (struct z_candidate *, tsubst_flags_t);
147 static int equal_functions (tree, tree);
148 static int joust (struct z_candidate *, struct z_candidate *, bool,
149 tsubst_flags_t);
150 static int compare_ics (conversion *, conversion *);
151 static void maybe_warn_class_memaccess (location_t, tree,
152 const vec<tree, va_gc> *);
153 static tree build_over_call (struct z_candidate *, int, tsubst_flags_t);
154 #define convert_like(CONV, EXPR, COMPLAIN) \
155 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, \
156 /*issue_conversion_warnings=*/true, \
157 /*c_cast_p=*/false, (COMPLAIN))
158 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
159 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), \
160 /*issue_conversion_warnings=*/true, \
161 /*c_cast_p=*/false, (COMPLAIN))
162 static tree convert_like_real (conversion *, tree, tree, int, bool,
163 bool, tsubst_flags_t);
164 static void op_error (location_t, enum tree_code, enum tree_code, tree,
165 tree, tree, bool);
166 static struct z_candidate *build_user_type_conversion_1 (tree, tree, int,
167 tsubst_flags_t);
168 static void print_z_candidate (location_t, const char *, struct z_candidate *);
169 static void print_z_candidates (location_t, struct z_candidate *);
170 static tree build_this (tree);
171 static struct z_candidate *splice_viable (struct z_candidate *, bool, bool *);
172 static bool any_strictly_viable (struct z_candidate *);
173 static struct z_candidate *add_template_candidate
174 (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *,
175 tree, tree, tree, int, unification_kind_t, tsubst_flags_t);
176 static struct z_candidate *add_template_candidate_real
177 (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *,
178 tree, tree, tree, int, tree, unification_kind_t, tsubst_flags_t);
179 static void add_builtin_candidates
180 (struct z_candidate **, enum tree_code, enum tree_code,
181 tree, tree *, int, tsubst_flags_t);
182 static void add_builtin_candidate
183 (struct z_candidate **, enum tree_code, enum tree_code,
184 tree, tree, tree, tree *, tree *, int, tsubst_flags_t);
185 static bool is_complete (tree);
186 static void build_builtin_candidate
187 (struct z_candidate **, tree, tree, tree, tree *, tree *,
188 int, tsubst_flags_t);
189 static struct z_candidate *add_conv_candidate
190 (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, tree,
191 tree, tsubst_flags_t);
192 static struct z_candidate *add_function_candidate
193 (struct z_candidate **, tree, tree, tree, const vec<tree, va_gc> *, tree,
194 tree, int, tsubst_flags_t);
195 static conversion *implicit_conversion (tree, tree, tree, bool, int,
196 tsubst_flags_t);
197 static conversion *reference_binding (tree, tree, tree, bool, int,
198 tsubst_flags_t);
199 static conversion *build_conv (conversion_kind, tree, conversion *);
200 static conversion *build_list_conv (tree, tree, int, tsubst_flags_t);
201 static conversion *next_conversion (conversion *);
202 static bool is_subseq (conversion *, conversion *);
203 static conversion *maybe_handle_ref_bind (conversion **);
204 static void maybe_handle_implicit_object (conversion **);
205 static struct z_candidate *add_candidate
206 (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, size_t,
207 conversion **, tree, tree, int, struct rejection_reason *, int);
208 static tree source_type (conversion *);
209 static void add_warning (struct z_candidate *, struct z_candidate *);
210 static bool reference_compatible_p (tree, tree);
211 static conversion *direct_reference_binding (tree, conversion *);
212 static bool promoted_arithmetic_type_p (tree);
213 static conversion *conditional_conversion (tree, tree, tsubst_flags_t);
214 static char *name_as_c_string (tree, tree, bool *);
215 static tree prep_operand (tree);
216 static void add_candidates (tree, tree, const vec<tree, va_gc> *, tree, tree,
217 bool, tree, tree, int, struct z_candidate **,
218 tsubst_flags_t);
219 static conversion *merge_conversion_sequences (conversion *, conversion *);
220 static tree build_temp (tree, tree, int, diagnostic_t *, tsubst_flags_t);
222 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
223 NAME can take many forms... */
225 bool
226 check_dtor_name (tree basetype, tree name)
228 /* Just accept something we've already complained about. */
229 if (name == error_mark_node)
230 return true;
232 if (TREE_CODE (name) == TYPE_DECL)
233 name = TREE_TYPE (name);
234 else if (TYPE_P (name))
235 /* OK */;
236 else if (identifier_p (name))
238 if ((MAYBE_CLASS_TYPE_P (basetype)
239 || TREE_CODE (basetype) == ENUMERAL_TYPE)
240 && name == constructor_name (basetype))
241 return true;
242 else
243 name = get_type_value (name);
245 else
247 /* In the case of:
249 template <class T> struct S { ~S(); };
250 int i;
251 i.~S();
253 NAME will be a class template. */
254 gcc_assert (DECL_CLASS_TEMPLATE_P (name));
255 return false;
258 if (!name || name == error_mark_node)
259 return false;
260 return same_type_p (TYPE_MAIN_VARIANT (basetype), TYPE_MAIN_VARIANT (name));
263 /* We want the address of a function or method. We avoid creating a
264 pointer-to-member function. */
266 tree
267 build_addr_func (tree function, tsubst_flags_t complain)
269 tree type = TREE_TYPE (function);
271 /* We have to do these by hand to avoid real pointer to member
272 functions. */
273 if (TREE_CODE (type) == METHOD_TYPE)
275 if (TREE_CODE (function) == OFFSET_REF)
277 tree object = build_address (TREE_OPERAND (function, 0));
278 return get_member_function_from_ptrfunc (&object,
279 TREE_OPERAND (function, 1),
280 complain);
282 function = build_address (function);
284 else
285 function = decay_conversion (function, complain, /*reject_builtin=*/false);
287 return function;
290 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
291 POINTER_TYPE to those. Note, pointer to member function types
292 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
293 two variants. build_call_a is the primitive taking an array of
294 arguments, while build_call_n is a wrapper that handles varargs. */
296 tree
297 build_call_n (tree function, int n, ...)
299 if (n == 0)
300 return build_call_a (function, 0, NULL);
301 else
303 tree *argarray = XALLOCAVEC (tree, n);
304 va_list ap;
305 int i;
307 va_start (ap, n);
308 for (i = 0; i < n; i++)
309 argarray[i] = va_arg (ap, tree);
310 va_end (ap);
311 return build_call_a (function, n, argarray);
315 /* Update various flags in cfun and the call itself based on what is being
316 called. Split out of build_call_a so that bot_manip can use it too. */
318 void
319 set_flags_from_callee (tree call)
321 bool nothrow;
322 tree decl = get_callee_fndecl (call);
324 /* We check both the decl and the type; a function may be known not to
325 throw without being declared throw(). */
326 nothrow = decl && TREE_NOTHROW (decl);
327 if (CALL_EXPR_FN (call))
328 nothrow |= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call))));
329 else if (internal_fn_flags (CALL_EXPR_IFN (call)) & ECF_NOTHROW)
330 nothrow = true;
332 if (!nothrow && at_function_scope_p () && cfun && cp_function_chain)
333 cp_function_chain->can_throw = 1;
335 if (decl && TREE_THIS_VOLATILE (decl) && cfun && cp_function_chain)
336 current_function_returns_abnormally = 1;
338 TREE_NOTHROW (call) = nothrow;
341 tree
342 build_call_a (tree function, int n, tree *argarray)
344 tree decl;
345 tree result_type;
346 tree fntype;
347 int i;
349 function = build_addr_func (function, tf_warning_or_error);
351 gcc_assert (TYPE_PTR_P (TREE_TYPE (function)));
352 fntype = TREE_TYPE (TREE_TYPE (function));
353 gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE
354 || TREE_CODE (fntype) == METHOD_TYPE);
355 result_type = TREE_TYPE (fntype);
356 /* An rvalue has no cv-qualifiers. */
357 if (SCALAR_TYPE_P (result_type) || VOID_TYPE_P (result_type))
358 result_type = cv_unqualified (result_type);
360 function = build_call_array_loc (input_location,
361 result_type, function, n, argarray);
362 set_flags_from_callee (function);
364 decl = get_callee_fndecl (function);
366 if (decl && !TREE_USED (decl))
368 /* We invoke build_call directly for several library
369 functions. These may have been declared normally if
370 we're building libgcc, so we can't just check
371 DECL_ARTIFICIAL. */
372 gcc_assert (DECL_ARTIFICIAL (decl)
373 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl)),
374 "__", 2));
375 mark_used (decl);
378 require_complete_eh_spec_types (fntype, decl);
380 TREE_HAS_CONSTRUCTOR (function) = (decl && DECL_CONSTRUCTOR_P (decl));
382 /* Don't pass empty class objects by value. This is useful
383 for tags in STL, which are used to control overload resolution.
384 We don't need to handle other cases of copying empty classes. */
385 if (! decl || ! DECL_BUILT_IN (decl))
386 for (i = 0; i < n; i++)
388 tree arg = CALL_EXPR_ARG (function, i);
389 if (is_empty_class (TREE_TYPE (arg))
390 && ! TREE_ADDRESSABLE (TREE_TYPE (arg)))
392 tree t = build0 (EMPTY_CLASS_EXPR, TREE_TYPE (arg));
393 arg = build2 (COMPOUND_EXPR, TREE_TYPE (t), arg, t);
394 CALL_EXPR_ARG (function, i) = arg;
398 return function;
401 /* New overloading code. */
403 struct z_candidate;
405 struct candidate_warning {
406 z_candidate *loser;
407 candidate_warning *next;
410 /* Information for providing diagnostics about why overloading failed. */
412 enum rejection_reason_code {
413 rr_none,
414 rr_arity,
415 rr_explicit_conversion,
416 rr_template_conversion,
417 rr_arg_conversion,
418 rr_bad_arg_conversion,
419 rr_template_unification,
420 rr_invalid_copy,
421 rr_inherited_ctor,
422 rr_constraint_failure
425 struct conversion_info {
426 /* The index of the argument, 0-based. */
427 int n_arg;
428 /* The actual argument or its type. */
429 tree from;
430 /* The type of the parameter. */
431 tree to_type;
434 struct rejection_reason {
435 enum rejection_reason_code code;
436 union {
437 /* Information about an arity mismatch. */
438 struct {
439 /* The expected number of arguments. */
440 int expected;
441 /* The actual number of arguments in the call. */
442 int actual;
443 /* Whether the call was a varargs call. */
444 bool call_varargs_p;
445 } arity;
446 /* Information about an argument conversion mismatch. */
447 struct conversion_info conversion;
448 /* Same, but for bad argument conversions. */
449 struct conversion_info bad_conversion;
450 /* Information about template unification failures. These are the
451 parameters passed to fn_type_unification. */
452 struct {
453 tree tmpl;
454 tree explicit_targs;
455 int num_targs;
456 const tree *args;
457 unsigned int nargs;
458 tree return_type;
459 unification_kind_t strict;
460 int flags;
461 } template_unification;
462 /* Information about template instantiation failures. These are the
463 parameters passed to instantiate_template. */
464 struct {
465 tree tmpl;
466 tree targs;
467 } template_instantiation;
468 } u;
471 struct z_candidate {
472 /* The FUNCTION_DECL that will be called if this candidate is
473 selected by overload resolution. */
474 tree fn;
475 /* If not NULL_TREE, the first argument to use when calling this
476 function. */
477 tree first_arg;
478 /* The rest of the arguments to use when calling this function. If
479 there are no further arguments this may be NULL or it may be an
480 empty vector. */
481 const vec<tree, va_gc> *args;
482 /* The implicit conversion sequences for each of the arguments to
483 FN. */
484 conversion **convs;
485 /* The number of implicit conversion sequences. */
486 size_t num_convs;
487 /* If FN is a user-defined conversion, the standard conversion
488 sequence from the type returned by FN to the desired destination
489 type. */
490 conversion *second_conv;
491 struct rejection_reason *reason;
492 /* If FN is a member function, the binfo indicating the path used to
493 qualify the name of FN at the call site. This path is used to
494 determine whether or not FN is accessible if it is selected by
495 overload resolution. The DECL_CONTEXT of FN will always be a
496 (possibly improper) base of this binfo. */
497 tree access_path;
498 /* If FN is a non-static member function, the binfo indicating the
499 subobject to which the `this' pointer should be converted if FN
500 is selected by overload resolution. The type pointed to by
501 the `this' pointer must correspond to the most derived class
502 indicated by the CONVERSION_PATH. */
503 tree conversion_path;
504 tree template_decl;
505 tree explicit_targs;
506 candidate_warning *warnings;
507 z_candidate *next;
508 int viable;
510 /* The flags active in add_candidate. */
511 int flags;
514 /* Returns true iff T is a null pointer constant in the sense of
515 [conv.ptr]. */
517 bool
518 null_ptr_cst_p (tree t)
520 tree type = TREE_TYPE (t);
522 /* [conv.ptr]
524 A null pointer constant is an integral constant expression
525 (_expr.const_) rvalue of integer type that evaluates to zero or
526 an rvalue of type std::nullptr_t. */
527 if (NULLPTR_TYPE_P (type))
528 return true;
530 if (cxx_dialect >= cxx11)
532 STRIP_ANY_LOCATION_WRAPPER (t);
534 /* Core issue 903 says only literal 0 is a null pointer constant. */
535 if (TREE_CODE (type) == INTEGER_TYPE
536 && !char_type_p (type)
537 && TREE_CODE (t) == INTEGER_CST
538 && integer_zerop (t)
539 && !TREE_OVERFLOW (t))
540 return true;
542 else if (CP_INTEGRAL_TYPE_P (type))
544 t = fold_non_dependent_expr (t);
545 STRIP_NOPS (t);
546 if (integer_zerop (t) && !TREE_OVERFLOW (t))
547 return true;
550 return false;
553 /* Returns true iff T is a null member pointer value (4.11). */
555 bool
556 null_member_pointer_value_p (tree t)
558 tree type = TREE_TYPE (t);
559 if (!type)
560 return false;
561 else if (TYPE_PTRMEMFUNC_P (type))
562 return (TREE_CODE (t) == CONSTRUCTOR
563 && integer_zerop (CONSTRUCTOR_ELT (t, 0)->value));
564 else if (TYPE_PTRDATAMEM_P (type))
565 return integer_all_onesp (t);
566 else
567 return false;
570 /* Returns nonzero if PARMLIST consists of only default parms,
571 ellipsis, and/or undeduced parameter packs. */
573 bool
574 sufficient_parms_p (const_tree parmlist)
576 for (; parmlist && parmlist != void_list_node;
577 parmlist = TREE_CHAIN (parmlist))
578 if (!TREE_PURPOSE (parmlist)
579 && !PACK_EXPANSION_P (TREE_VALUE (parmlist)))
580 return false;
581 return true;
584 /* Allocate N bytes of memory from the conversion obstack. The memory
585 is zeroed before being returned. */
587 static void *
588 conversion_obstack_alloc (size_t n)
590 void *p;
591 if (!conversion_obstack_initialized)
593 gcc_obstack_init (&conversion_obstack);
594 conversion_obstack_initialized = true;
596 p = obstack_alloc (&conversion_obstack, n);
597 memset (p, 0, n);
598 return p;
601 /* Allocate rejection reasons. */
603 static struct rejection_reason *
604 alloc_rejection (enum rejection_reason_code code)
606 struct rejection_reason *p;
607 p = (struct rejection_reason *) conversion_obstack_alloc (sizeof *p);
608 p->code = code;
609 return p;
612 static struct rejection_reason *
613 arity_rejection (tree first_arg, int expected, int actual)
615 struct rejection_reason *r = alloc_rejection (rr_arity);
616 int adjust = first_arg != NULL_TREE;
617 r->u.arity.expected = expected - adjust;
618 r->u.arity.actual = actual - adjust;
619 return r;
622 static struct rejection_reason *
623 arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to)
625 struct rejection_reason *r = alloc_rejection (rr_arg_conversion);
626 int adjust = first_arg != NULL_TREE;
627 r->u.conversion.n_arg = n_arg - adjust;
628 r->u.conversion.from = from;
629 r->u.conversion.to_type = to;
630 return r;
633 static struct rejection_reason *
634 bad_arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to)
636 struct rejection_reason *r = alloc_rejection (rr_bad_arg_conversion);
637 int adjust = first_arg != NULL_TREE;
638 r->u.bad_conversion.n_arg = n_arg - adjust;
639 r->u.bad_conversion.from = from;
640 r->u.bad_conversion.to_type = to;
641 return r;
644 static struct rejection_reason *
645 explicit_conversion_rejection (tree from, tree to)
647 struct rejection_reason *r = alloc_rejection (rr_explicit_conversion);
648 r->u.conversion.n_arg = 0;
649 r->u.conversion.from = from;
650 r->u.conversion.to_type = to;
651 return r;
654 static struct rejection_reason *
655 template_conversion_rejection (tree from, tree to)
657 struct rejection_reason *r = alloc_rejection (rr_template_conversion);
658 r->u.conversion.n_arg = 0;
659 r->u.conversion.from = from;
660 r->u.conversion.to_type = to;
661 return r;
664 static struct rejection_reason *
665 template_unification_rejection (tree tmpl, tree explicit_targs, tree targs,
666 const tree *args, unsigned int nargs,
667 tree return_type, unification_kind_t strict,
668 int flags)
670 size_t args_n_bytes = sizeof (*args) * nargs;
671 tree *args1 = (tree *) conversion_obstack_alloc (args_n_bytes);
672 struct rejection_reason *r = alloc_rejection (rr_template_unification);
673 r->u.template_unification.tmpl = tmpl;
674 r->u.template_unification.explicit_targs = explicit_targs;
675 r->u.template_unification.num_targs = TREE_VEC_LENGTH (targs);
676 /* Copy args to our own storage. */
677 memcpy (args1, args, args_n_bytes);
678 r->u.template_unification.args = args1;
679 r->u.template_unification.nargs = nargs;
680 r->u.template_unification.return_type = return_type;
681 r->u.template_unification.strict = strict;
682 r->u.template_unification.flags = flags;
683 return r;
686 static struct rejection_reason *
687 template_unification_error_rejection (void)
689 return alloc_rejection (rr_template_unification);
692 static struct rejection_reason *
693 invalid_copy_with_fn_template_rejection (void)
695 struct rejection_reason *r = alloc_rejection (rr_invalid_copy);
696 return r;
699 static struct rejection_reason *
700 inherited_ctor_rejection (void)
702 struct rejection_reason *r = alloc_rejection (rr_inherited_ctor);
703 return r;
706 // Build a constraint failure record, saving information into the
707 // template_instantiation field of the rejection. If FN is not a template
708 // declaration, the TMPL member is the FN declaration and TARGS is empty.
710 static struct rejection_reason *
711 constraint_failure (tree fn)
713 struct rejection_reason *r = alloc_rejection (rr_constraint_failure);
714 if (tree ti = DECL_TEMPLATE_INFO (fn))
716 r->u.template_instantiation.tmpl = TI_TEMPLATE (ti);
717 r->u.template_instantiation.targs = TI_ARGS (ti);
719 else
721 r->u.template_instantiation.tmpl = fn;
722 r->u.template_instantiation.targs = NULL_TREE;
724 return r;
727 /* Dynamically allocate a conversion. */
729 static conversion *
730 alloc_conversion (conversion_kind kind)
732 conversion *c;
733 c = (conversion *) conversion_obstack_alloc (sizeof (conversion));
734 c->kind = kind;
735 return c;
738 /* Make sure that all memory on the conversion obstack has been
739 freed. */
741 void
742 validate_conversion_obstack (void)
744 if (conversion_obstack_initialized)
745 gcc_assert ((obstack_next_free (&conversion_obstack)
746 == obstack_base (&conversion_obstack)));
749 /* Dynamically allocate an array of N conversions. */
751 static conversion **
752 alloc_conversions (size_t n)
754 return (conversion **) conversion_obstack_alloc (n * sizeof (conversion *));
757 static conversion *
758 build_conv (conversion_kind code, tree type, conversion *from)
760 conversion *t;
761 conversion_rank rank = CONVERSION_RANK (from);
763 /* Note that the caller is responsible for filling in t->cand for
764 user-defined conversions. */
765 t = alloc_conversion (code);
766 t->type = type;
767 t->u.next = from;
769 switch (code)
771 case ck_ptr:
772 case ck_pmem:
773 case ck_base:
774 case ck_std:
775 if (rank < cr_std)
776 rank = cr_std;
777 break;
779 case ck_qual:
780 case ck_fnptr:
781 if (rank < cr_exact)
782 rank = cr_exact;
783 break;
785 default:
786 break;
788 t->rank = rank;
789 t->user_conv_p = (code == ck_user || from->user_conv_p);
790 t->bad_p = from->bad_p;
791 t->base_p = false;
792 return t;
795 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
796 specialization of std::initializer_list<T>, if such a conversion is
797 possible. */
799 static conversion *
800 build_list_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
802 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type), 0);
803 unsigned len = CONSTRUCTOR_NELTS (ctor);
804 conversion **subconvs = alloc_conversions (len);
805 conversion *t;
806 unsigned i;
807 tree val;
809 /* Within a list-initialization we can have more user-defined
810 conversions. */
811 flags &= ~LOOKUP_NO_CONVERSION;
812 /* But no narrowing conversions. */
813 flags |= LOOKUP_NO_NARROWING;
815 /* Can't make an array of these types. */
816 if (TREE_CODE (elttype) == REFERENCE_TYPE
817 || TREE_CODE (elttype) == FUNCTION_TYPE
818 || VOID_TYPE_P (elttype))
819 return NULL;
821 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
823 conversion *sub
824 = implicit_conversion (elttype, TREE_TYPE (val), val,
825 false, flags, complain);
826 if (sub == NULL)
827 return NULL;
829 subconvs[i] = sub;
832 t = alloc_conversion (ck_list);
833 t->type = type;
834 t->u.list = subconvs;
835 t->rank = cr_exact;
837 for (i = 0; i < len; ++i)
839 conversion *sub = subconvs[i];
840 if (sub->rank > t->rank)
841 t->rank = sub->rank;
842 if (sub->user_conv_p)
843 t->user_conv_p = true;
844 if (sub->bad_p)
845 t->bad_p = true;
848 return t;
851 /* Return the next conversion of the conversion chain (if applicable),
852 or NULL otherwise. Please use this function instead of directly
853 accessing fields of struct conversion. */
855 static conversion *
856 next_conversion (conversion *conv)
858 if (conv == NULL
859 || conv->kind == ck_identity
860 || conv->kind == ck_ambig
861 || conv->kind == ck_list)
862 return NULL;
863 return conv->u.next;
866 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
867 is a valid aggregate initializer for array type ATYPE. */
869 static bool
870 can_convert_array (tree atype, tree ctor, int flags, tsubst_flags_t complain)
872 unsigned i;
873 tree elttype = TREE_TYPE (atype);
874 for (i = 0; i < CONSTRUCTOR_NELTS (ctor); ++i)
876 tree val = CONSTRUCTOR_ELT (ctor, i)->value;
877 bool ok;
878 if (TREE_CODE (elttype) == ARRAY_TYPE
879 && TREE_CODE (val) == CONSTRUCTOR)
880 ok = can_convert_array (elttype, val, flags, complain);
881 else
882 ok = can_convert_arg (elttype, TREE_TYPE (val), val, flags,
883 complain);
884 if (!ok)
885 return false;
887 return true;
890 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
891 aggregate class, if such a conversion is possible. */
893 static conversion *
894 build_aggr_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
896 unsigned HOST_WIDE_INT i = 0;
897 conversion *c;
898 tree field = next_initializable_field (TYPE_FIELDS (type));
899 tree empty_ctor = NULL_TREE;
901 /* We already called reshape_init in implicit_conversion. */
903 /* The conversions within the init-list aren't affected by the enclosing
904 context; they're always simple copy-initialization. */
905 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
907 for (; field; field = next_initializable_field (DECL_CHAIN (field)))
909 tree ftype = TREE_TYPE (field);
910 tree val;
911 bool ok;
913 if (i < CONSTRUCTOR_NELTS (ctor))
914 val = CONSTRUCTOR_ELT (ctor, i)->value;
915 else if (DECL_INITIAL (field))
916 val = get_nsdmi (field, /*ctor*/false, complain);
917 else if (TREE_CODE (ftype) == REFERENCE_TYPE)
918 /* Value-initialization of reference is ill-formed. */
919 return NULL;
920 else
922 if (empty_ctor == NULL_TREE)
923 empty_ctor = build_constructor (init_list_type_node, NULL);
924 val = empty_ctor;
926 ++i;
928 if (TREE_CODE (ftype) == ARRAY_TYPE
929 && TREE_CODE (val) == CONSTRUCTOR)
930 ok = can_convert_array (ftype, val, flags, complain);
931 else
932 ok = can_convert_arg (ftype, TREE_TYPE (val), val, flags,
933 complain);
935 if (!ok)
936 return NULL;
938 if (TREE_CODE (type) == UNION_TYPE)
939 break;
942 if (i < CONSTRUCTOR_NELTS (ctor))
943 return NULL;
945 c = alloc_conversion (ck_aggr);
946 c->type = type;
947 c->rank = cr_exact;
948 c->user_conv_p = true;
949 c->check_narrowing = true;
950 c->u.next = NULL;
951 return c;
954 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
955 array type, if such a conversion is possible. */
957 static conversion *
958 build_array_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
960 conversion *c;
961 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
962 tree elttype = TREE_TYPE (type);
963 unsigned i;
964 tree val;
965 bool bad = false;
966 bool user = false;
967 enum conversion_rank rank = cr_exact;
969 /* We might need to propagate the size from the element to the array. */
970 complete_type (type);
972 if (TYPE_DOMAIN (type)
973 && !variably_modified_type_p (TYPE_DOMAIN (type), NULL_TREE))
975 unsigned HOST_WIDE_INT alen = tree_to_uhwi (array_type_nelts_top (type));
976 if (alen < len)
977 return NULL;
980 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
982 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
984 conversion *sub
985 = implicit_conversion (elttype, TREE_TYPE (val), val,
986 false, flags, complain);
987 if (sub == NULL)
988 return NULL;
990 if (sub->rank > rank)
991 rank = sub->rank;
992 if (sub->user_conv_p)
993 user = true;
994 if (sub->bad_p)
995 bad = true;
998 c = alloc_conversion (ck_aggr);
999 c->type = type;
1000 c->rank = rank;
1001 c->user_conv_p = user;
1002 c->bad_p = bad;
1003 c->u.next = NULL;
1004 return c;
1007 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1008 complex type, if such a conversion is possible. */
1010 static conversion *
1011 build_complex_conv (tree type, tree ctor, int flags,
1012 tsubst_flags_t complain)
1014 conversion *c;
1015 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
1016 tree elttype = TREE_TYPE (type);
1017 unsigned i;
1018 tree val;
1019 bool bad = false;
1020 bool user = false;
1021 enum conversion_rank rank = cr_exact;
1023 if (len != 2)
1024 return NULL;
1026 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
1028 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
1030 conversion *sub
1031 = implicit_conversion (elttype, TREE_TYPE (val), val,
1032 false, flags, complain);
1033 if (sub == NULL)
1034 return NULL;
1036 if (sub->rank > rank)
1037 rank = sub->rank;
1038 if (sub->user_conv_p)
1039 user = true;
1040 if (sub->bad_p)
1041 bad = true;
1044 c = alloc_conversion (ck_aggr);
1045 c->type = type;
1046 c->rank = rank;
1047 c->user_conv_p = user;
1048 c->bad_p = bad;
1049 c->u.next = NULL;
1050 return c;
1053 /* Build a representation of the identity conversion from EXPR to
1054 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1056 static conversion *
1057 build_identity_conv (tree type, tree expr)
1059 conversion *c;
1061 c = alloc_conversion (ck_identity);
1062 c->type = type;
1063 c->u.expr = expr;
1065 return c;
1068 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1069 were multiple user-defined conversions to accomplish the job.
1070 Build a conversion that indicates that ambiguity. */
1072 static conversion *
1073 build_ambiguous_conv (tree type, tree expr)
1075 conversion *c;
1077 c = alloc_conversion (ck_ambig);
1078 c->type = type;
1079 c->u.expr = expr;
1081 return c;
1084 tree
1085 strip_top_quals (tree t)
1087 if (TREE_CODE (t) == ARRAY_TYPE)
1088 return t;
1089 return cp_build_qualified_type (t, 0);
1092 /* Returns the standard conversion path (see [conv]) from type FROM to type
1093 TO, if any. For proper handling of null pointer constants, you must
1094 also pass the expression EXPR to convert from. If C_CAST_P is true,
1095 this conversion is coming from a C-style cast. */
1097 static conversion *
1098 standard_conversion (tree to, tree from, tree expr, bool c_cast_p,
1099 int flags, tsubst_flags_t complain)
1101 enum tree_code fcode, tcode;
1102 conversion *conv;
1103 bool fromref = false;
1104 tree qualified_to;
1106 to = non_reference (to);
1107 if (TREE_CODE (from) == REFERENCE_TYPE)
1109 fromref = true;
1110 from = TREE_TYPE (from);
1112 qualified_to = to;
1113 to = strip_top_quals (to);
1114 from = strip_top_quals (from);
1116 if (expr && type_unknown_p (expr))
1118 if (TYPE_PTRFN_P (to) || TYPE_PTRMEMFUNC_P (to))
1120 tsubst_flags_t tflags = tf_conv;
1121 expr = instantiate_type (to, expr, tflags);
1122 if (expr == error_mark_node)
1123 return NULL;
1124 from = TREE_TYPE (expr);
1126 else if (TREE_CODE (to) == BOOLEAN_TYPE)
1128 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1129 expr = resolve_nondeduced_context (expr, complain);
1130 from = TREE_TYPE (expr);
1134 fcode = TREE_CODE (from);
1135 tcode = TREE_CODE (to);
1137 conv = build_identity_conv (from, expr);
1138 if (fcode == FUNCTION_TYPE || fcode == ARRAY_TYPE)
1140 from = type_decays_to (from);
1141 fcode = TREE_CODE (from);
1142 conv = build_conv (ck_lvalue, from, conv);
1144 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1145 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1146 express the copy constructor call required by copy-initialization. */
1147 else if (fromref || (expr && obvalue_p (expr)))
1149 if (expr)
1151 tree bitfield_type;
1152 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
1153 if (bitfield_type)
1155 from = strip_top_quals (bitfield_type);
1156 fcode = TREE_CODE (from);
1159 conv = build_conv (ck_rvalue, from, conv);
1160 if (flags & LOOKUP_PREFER_RVALUE)
1161 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1162 conv->rvaluedness_matches_p = true;
1165 /* Allow conversion between `__complex__' data types. */
1166 if (tcode == COMPLEX_TYPE && fcode == COMPLEX_TYPE)
1168 /* The standard conversion sequence to convert FROM to TO is
1169 the standard conversion sequence to perform componentwise
1170 conversion. */
1171 conversion *part_conv = standard_conversion
1172 (TREE_TYPE (to), TREE_TYPE (from), NULL_TREE, c_cast_p, flags,
1173 complain);
1175 if (part_conv)
1177 conv = build_conv (part_conv->kind, to, conv);
1178 conv->rank = part_conv->rank;
1180 else
1181 conv = NULL;
1183 return conv;
1186 if (same_type_p (from, to))
1188 if (CLASS_TYPE_P (to) && conv->kind == ck_rvalue)
1189 conv->type = qualified_to;
1190 return conv;
1193 /* [conv.ptr]
1194 A null pointer constant can be converted to a pointer type; ... A
1195 null pointer constant of integral type can be converted to an
1196 rvalue of type std::nullptr_t. */
1197 if ((tcode == POINTER_TYPE || TYPE_PTRMEM_P (to)
1198 || NULLPTR_TYPE_P (to))
1199 && ((expr && null_ptr_cst_p (expr))
1200 || NULLPTR_TYPE_P (from)))
1201 conv = build_conv (ck_std, to, conv);
1202 else if ((tcode == INTEGER_TYPE && fcode == POINTER_TYPE)
1203 || (tcode == POINTER_TYPE && fcode == INTEGER_TYPE))
1205 /* For backwards brain damage compatibility, allow interconversion of
1206 pointers and integers with a pedwarn. */
1207 conv = build_conv (ck_std, to, conv);
1208 conv->bad_p = true;
1210 else if (UNSCOPED_ENUM_P (to) && fcode == INTEGER_TYPE)
1212 /* For backwards brain damage compatibility, allow interconversion of
1213 enums and integers with a pedwarn. */
1214 conv = build_conv (ck_std, to, conv);
1215 conv->bad_p = true;
1217 else if ((tcode == POINTER_TYPE && fcode == POINTER_TYPE)
1218 || (TYPE_PTRDATAMEM_P (to) && TYPE_PTRDATAMEM_P (from)))
1220 tree to_pointee;
1221 tree from_pointee;
1223 if (tcode == POINTER_TYPE)
1225 to_pointee = TREE_TYPE (to);
1226 from_pointee = TREE_TYPE (from);
1228 /* Since this is the target of a pointer, it can't have function
1229 qualifiers, so any TYPE_QUALS must be for attributes const or
1230 noreturn. Strip them. */
1231 if (TREE_CODE (to_pointee) == FUNCTION_TYPE
1232 && TYPE_QUALS (to_pointee))
1233 to_pointee = build_qualified_type (to_pointee, TYPE_UNQUALIFIED);
1234 if (TREE_CODE (from_pointee) == FUNCTION_TYPE
1235 && TYPE_QUALS (from_pointee))
1236 from_pointee = build_qualified_type (from_pointee, TYPE_UNQUALIFIED);
1238 else
1240 to_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (to);
1241 from_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (from);
1244 if (tcode == POINTER_TYPE
1245 && same_type_ignoring_top_level_qualifiers_p (from_pointee,
1246 to_pointee))
1248 else if (VOID_TYPE_P (to_pointee)
1249 && !TYPE_PTRDATAMEM_P (from)
1250 && TREE_CODE (from_pointee) != FUNCTION_TYPE)
1252 tree nfrom = TREE_TYPE (from);
1253 /* Don't try to apply restrict to void. */
1254 int quals = cp_type_quals (nfrom) & ~TYPE_QUAL_RESTRICT;
1255 from_pointee = cp_build_qualified_type (void_type_node, quals);
1256 from = build_pointer_type (from_pointee);
1257 conv = build_conv (ck_ptr, from, conv);
1259 else if (TYPE_PTRDATAMEM_P (from))
1261 tree fbase = TYPE_PTRMEM_CLASS_TYPE (from);
1262 tree tbase = TYPE_PTRMEM_CLASS_TYPE (to);
1264 if (same_type_p (fbase, tbase))
1265 /* No base conversion needed. */;
1266 else if (DERIVED_FROM_P (fbase, tbase)
1267 && (same_type_ignoring_top_level_qualifiers_p
1268 (from_pointee, to_pointee)))
1270 from = build_ptrmem_type (tbase, from_pointee);
1271 conv = build_conv (ck_pmem, from, conv);
1273 else
1274 return NULL;
1276 else if (CLASS_TYPE_P (from_pointee)
1277 && CLASS_TYPE_P (to_pointee)
1278 /* [conv.ptr]
1280 An rvalue of type "pointer to cv D," where D is a
1281 class type, can be converted to an rvalue of type
1282 "pointer to cv B," where B is a base class (clause
1283 _class.derived_) of D. If B is an inaccessible
1284 (clause _class.access_) or ambiguous
1285 (_class.member.lookup_) base class of D, a program
1286 that necessitates this conversion is ill-formed.
1287 Therefore, we use DERIVED_FROM_P, and do not check
1288 access or uniqueness. */
1289 && DERIVED_FROM_P (to_pointee, from_pointee))
1291 from_pointee
1292 = cp_build_qualified_type (to_pointee,
1293 cp_type_quals (from_pointee));
1294 from = build_pointer_type (from_pointee);
1295 conv = build_conv (ck_ptr, from, conv);
1296 conv->base_p = true;
1299 if (same_type_p (from, to))
1300 /* OK */;
1301 else if (c_cast_p && comp_ptr_ttypes_const (to, from))
1302 /* In a C-style cast, we ignore CV-qualification because we
1303 are allowed to perform a static_cast followed by a
1304 const_cast. */
1305 conv = build_conv (ck_qual, to, conv);
1306 else if (!c_cast_p && comp_ptr_ttypes (to_pointee, from_pointee))
1307 conv = build_conv (ck_qual, to, conv);
1308 else if (expr && string_conv_p (to, expr, 0))
1309 /* converting from string constant to char *. */
1310 conv = build_conv (ck_qual, to, conv);
1311 else if (fnptr_conv_p (to, from))
1312 conv = build_conv (ck_fnptr, to, conv);
1313 /* Allow conversions among compatible ObjC pointer types (base
1314 conversions have been already handled above). */
1315 else if (c_dialect_objc ()
1316 && objc_compare_types (to, from, -4, NULL_TREE))
1317 conv = build_conv (ck_ptr, to, conv);
1318 else if (ptr_reasonably_similar (to_pointee, from_pointee))
1320 conv = build_conv (ck_ptr, to, conv);
1321 conv->bad_p = true;
1323 else
1324 return NULL;
1326 from = to;
1328 else if (TYPE_PTRMEMFUNC_P (to) && TYPE_PTRMEMFUNC_P (from))
1330 tree fromfn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from));
1331 tree tofn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to));
1332 tree fbase = class_of_this_parm (fromfn);
1333 tree tbase = class_of_this_parm (tofn);
1335 if (!DERIVED_FROM_P (fbase, tbase))
1336 return NULL;
1338 tree fstat = static_fn_type (fromfn);
1339 tree tstat = static_fn_type (tofn);
1340 if (same_type_p (tstat, fstat)
1341 || fnptr_conv_p (tstat, fstat))
1342 /* OK */;
1343 else
1344 return NULL;
1346 if (!same_type_p (fbase, tbase))
1348 from = build_memfn_type (fstat,
1349 tbase,
1350 cp_type_quals (tbase),
1351 type_memfn_rqual (tofn));
1352 from = build_ptrmemfunc_type (build_pointer_type (from));
1353 conv = build_conv (ck_pmem, from, conv);
1354 conv->base_p = true;
1356 if (fnptr_conv_p (tstat, fstat))
1357 conv = build_conv (ck_fnptr, to, conv);
1359 else if (tcode == BOOLEAN_TYPE)
1361 /* [conv.bool]
1363 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1364 to member type can be converted to a prvalue of type bool. ...
1365 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1366 std::nullptr_t can be converted to a prvalue of type bool; */
1367 if (ARITHMETIC_TYPE_P (from)
1368 || UNSCOPED_ENUM_P (from)
1369 || fcode == POINTER_TYPE
1370 || TYPE_PTRMEM_P (from)
1371 || NULLPTR_TYPE_P (from))
1373 conv = build_conv (ck_std, to, conv);
1374 if (fcode == POINTER_TYPE
1375 || TYPE_PTRDATAMEM_P (from)
1376 || (TYPE_PTRMEMFUNC_P (from)
1377 && conv->rank < cr_pbool)
1378 || NULLPTR_TYPE_P (from))
1379 conv->rank = cr_pbool;
1380 if (NULLPTR_TYPE_P (from) && (flags & LOOKUP_ONLYCONVERTING))
1381 conv->bad_p = true;
1382 return conv;
1385 return NULL;
1387 /* We don't check for ENUMERAL_TYPE here because there are no standard
1388 conversions to enum type. */
1389 /* As an extension, allow conversion to complex type. */
1390 else if (ARITHMETIC_TYPE_P (to))
1392 if (! (INTEGRAL_CODE_P (fcode)
1393 || (fcode == REAL_TYPE && !(flags & LOOKUP_NO_NON_INTEGRAL)))
1394 || SCOPED_ENUM_P (from))
1395 return NULL;
1396 conv = build_conv (ck_std, to, conv);
1398 /* Give this a better rank if it's a promotion. */
1399 if (same_type_p (to, type_promotes_to (from))
1400 && next_conversion (conv)->rank <= cr_promotion)
1401 conv->rank = cr_promotion;
1403 else if (fcode == VECTOR_TYPE && tcode == VECTOR_TYPE
1404 && vector_types_convertible_p (from, to, false))
1405 return build_conv (ck_std, to, conv);
1406 else if (MAYBE_CLASS_TYPE_P (to) && MAYBE_CLASS_TYPE_P (from)
1407 && is_properly_derived_from (from, to))
1409 if (conv->kind == ck_rvalue)
1410 conv = next_conversion (conv);
1411 conv = build_conv (ck_base, to, conv);
1412 /* The derived-to-base conversion indicates the initialization
1413 of a parameter with base type from an object of a derived
1414 type. A temporary object is created to hold the result of
1415 the conversion unless we're binding directly to a reference. */
1416 conv->need_temporary_p = !(flags & LOOKUP_NO_TEMP_BIND);
1418 else
1419 return NULL;
1421 if (flags & LOOKUP_NO_NARROWING)
1422 conv->check_narrowing = true;
1424 return conv;
1427 /* Returns nonzero if T1 is reference-related to T2. */
1429 bool
1430 reference_related_p (tree t1, tree t2)
1432 if (t1 == error_mark_node || t2 == error_mark_node)
1433 return false;
1435 t1 = TYPE_MAIN_VARIANT (t1);
1436 t2 = TYPE_MAIN_VARIANT (t2);
1438 /* [dcl.init.ref]
1440 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1441 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1442 of T2. */
1443 return (same_type_p (t1, t2)
1444 || (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
1445 && DERIVED_FROM_P (t1, t2)));
1448 /* Returns nonzero if T1 is reference-compatible with T2. */
1450 static bool
1451 reference_compatible_p (tree t1, tree t2)
1453 /* [dcl.init.ref]
1455 "cv1 T1" is reference compatible with "cv2 T2" if
1456 * T1 is reference-related to T2 or
1457 * T2 is "noexcept function" and T1 is "function", where the
1458 function types are otherwise the same,
1459 and cv1 is the same cv-qualification as, or greater cv-qualification
1460 than, cv2. */
1461 return ((reference_related_p (t1, t2)
1462 || fnptr_conv_p (t1, t2))
1463 && at_least_as_qualified_p (t1, t2));
1466 /* A reference of the indicated TYPE is being bound directly to the
1467 expression represented by the implicit conversion sequence CONV.
1468 Return a conversion sequence for this binding. */
1470 static conversion *
1471 direct_reference_binding (tree type, conversion *conv)
1473 tree t;
1475 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
1476 gcc_assert (TREE_CODE (conv->type) != REFERENCE_TYPE);
1478 t = TREE_TYPE (type);
1480 if (conv->kind == ck_identity)
1481 /* Mark the identity conv as to not decay to rvalue. */
1482 conv->rvaluedness_matches_p = true;
1484 /* [over.ics.rank]
1486 When a parameter of reference type binds directly
1487 (_dcl.init.ref_) to an argument expression, the implicit
1488 conversion sequence is the identity conversion, unless the
1489 argument expression has a type that is a derived class of the
1490 parameter type, in which case the implicit conversion sequence is
1491 a derived-to-base Conversion.
1493 If the parameter binds directly to the result of applying a
1494 conversion function to the argument expression, the implicit
1495 conversion sequence is a user-defined conversion sequence
1496 (_over.ics.user_), with the second standard conversion sequence
1497 either an identity conversion or, if the conversion function
1498 returns an entity of a type that is a derived class of the
1499 parameter type, a derived-to-base conversion. */
1500 if (is_properly_derived_from (conv->type, t))
1502 /* Represent the derived-to-base conversion. */
1503 conv = build_conv (ck_base, t, conv);
1504 /* We will actually be binding to the base-class subobject in
1505 the derived class, so we mark this conversion appropriately.
1506 That way, convert_like knows not to generate a temporary. */
1507 conv->need_temporary_p = false;
1510 return build_conv (ck_ref_bind, type, conv);
1513 /* Returns the conversion path from type FROM to reference type TO for
1514 purposes of reference binding. For lvalue binding, either pass a
1515 reference type to FROM or an lvalue expression to EXPR. If the
1516 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1517 the conversion returned. If C_CAST_P is true, this
1518 conversion is coming from a C-style cast. */
1520 static conversion *
1521 reference_binding (tree rto, tree rfrom, tree expr, bool c_cast_p, int flags,
1522 tsubst_flags_t complain)
1524 conversion *conv = NULL;
1525 tree to = TREE_TYPE (rto);
1526 tree from = rfrom;
1527 tree tfrom;
1528 bool related_p;
1529 bool compatible_p;
1530 cp_lvalue_kind gl_kind;
1531 bool is_lvalue;
1533 if (TREE_CODE (to) == FUNCTION_TYPE && expr && type_unknown_p (expr))
1535 expr = instantiate_type (to, expr, tf_none);
1536 if (expr == error_mark_node)
1537 return NULL;
1538 from = TREE_TYPE (expr);
1541 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1543 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
1544 /* DR 1288: Otherwise, if the initializer list has a single element
1545 of type E and ... [T's] referenced type is reference-related to E,
1546 the object or reference is initialized from that element... */
1547 if (CONSTRUCTOR_NELTS (expr) == 1)
1549 tree elt = CONSTRUCTOR_ELT (expr, 0)->value;
1550 if (error_operand_p (elt))
1551 return NULL;
1552 tree etype = TREE_TYPE (elt);
1553 if (reference_related_p (to, etype))
1555 expr = elt;
1556 from = etype;
1557 goto skip;
1560 /* Otherwise, if T is a reference type, a prvalue temporary of the
1561 type referenced by T is copy-list-initialized or
1562 direct-list-initialized, depending on the kind of initialization
1563 for the reference, and the reference is bound to that temporary. */
1564 conv = implicit_conversion (to, from, expr, c_cast_p,
1565 flags|LOOKUP_NO_TEMP_BIND, complain);
1566 skip:;
1569 if (TREE_CODE (from) == REFERENCE_TYPE)
1571 from = TREE_TYPE (from);
1572 if (!TYPE_REF_IS_RVALUE (rfrom)
1573 || TREE_CODE (from) == FUNCTION_TYPE)
1574 gl_kind = clk_ordinary;
1575 else
1576 gl_kind = clk_rvalueref;
1578 else if (expr)
1579 gl_kind = lvalue_kind (expr);
1580 else if (CLASS_TYPE_P (from)
1581 || TREE_CODE (from) == ARRAY_TYPE)
1582 gl_kind = clk_class;
1583 else
1584 gl_kind = clk_none;
1586 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1587 if ((flags & LOOKUP_NO_TEMP_BIND)
1588 && (gl_kind & clk_class))
1589 gl_kind = clk_none;
1591 /* Same mask as real_lvalue_p. */
1592 is_lvalue = gl_kind && !(gl_kind & (clk_rvalueref|clk_class));
1594 tfrom = from;
1595 if ((gl_kind & clk_bitfield) != 0)
1596 tfrom = unlowered_expr_type (expr);
1598 /* Figure out whether or not the types are reference-related and
1599 reference compatible. We have to do this after stripping
1600 references from FROM. */
1601 related_p = reference_related_p (to, tfrom);
1602 /* If this is a C cast, first convert to an appropriately qualified
1603 type, so that we can later do a const_cast to the desired type. */
1604 if (related_p && c_cast_p
1605 && !at_least_as_qualified_p (to, tfrom))
1606 to = cp_build_qualified_type (to, cp_type_quals (tfrom));
1607 compatible_p = reference_compatible_p (to, tfrom);
1609 /* Directly bind reference when target expression's type is compatible with
1610 the reference and expression is an lvalue. In DR391, the wording in
1611 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1612 const and rvalue references to rvalues of compatible class type.
1613 We should also do direct bindings for non-class xvalues. */
1614 if ((related_p || compatible_p) && gl_kind)
1616 /* [dcl.init.ref]
1618 If the initializer expression
1620 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1621 is reference-compatible with "cv2 T2,"
1623 the reference is bound directly to the initializer expression
1624 lvalue.
1626 [...]
1627 If the initializer expression is an rvalue, with T2 a class type,
1628 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1629 is bound to the object represented by the rvalue or to a sub-object
1630 within that object. */
1632 conv = build_identity_conv (tfrom, expr);
1633 conv = direct_reference_binding (rto, conv);
1635 if (TREE_CODE (rfrom) == REFERENCE_TYPE)
1636 /* Handle rvalue reference to function properly. */
1637 conv->rvaluedness_matches_p
1638 = (TYPE_REF_IS_RVALUE (rto) == TYPE_REF_IS_RVALUE (rfrom));
1639 else
1640 conv->rvaluedness_matches_p
1641 = (TYPE_REF_IS_RVALUE (rto) == !is_lvalue);
1643 if ((gl_kind & clk_bitfield) != 0
1644 || ((gl_kind & clk_packed) != 0 && !TYPE_PACKED (to)))
1645 /* For the purposes of overload resolution, we ignore the fact
1646 this expression is a bitfield or packed field. (In particular,
1647 [over.ics.ref] says specifically that a function with a
1648 non-const reference parameter is viable even if the
1649 argument is a bitfield.)
1651 However, when we actually call the function we must create
1652 a temporary to which to bind the reference. If the
1653 reference is volatile, or isn't const, then we cannot make
1654 a temporary, so we just issue an error when the conversion
1655 actually occurs. */
1656 conv->need_temporary_p = true;
1658 /* Don't allow binding of lvalues (other than function lvalues) to
1659 rvalue references. */
1660 if (is_lvalue && TYPE_REF_IS_RVALUE (rto)
1661 && TREE_CODE (to) != FUNCTION_TYPE)
1662 conv->bad_p = true;
1664 /* Nor the reverse. */
1665 if (!is_lvalue && !TYPE_REF_IS_RVALUE (rto)
1666 && (!CP_TYPE_CONST_NON_VOLATILE_P (to)
1667 || (flags & LOOKUP_NO_RVAL_BIND))
1668 && TREE_CODE (to) != FUNCTION_TYPE)
1669 conv->bad_p = true;
1671 if (!compatible_p)
1672 conv->bad_p = true;
1674 return conv;
1676 /* [class.conv.fct] A conversion function is never used to convert a
1677 (possibly cv-qualified) object to the (possibly cv-qualified) same
1678 object type (or a reference to it), to a (possibly cv-qualified) base
1679 class of that type (or a reference to it).... */
1680 else if (CLASS_TYPE_P (from) && !related_p
1681 && !(flags & LOOKUP_NO_CONVERSION))
1683 /* [dcl.init.ref]
1685 If the initializer expression
1687 -- has a class type (i.e., T2 is a class type) can be
1688 implicitly converted to an lvalue of type "cv3 T3," where
1689 "cv1 T1" is reference-compatible with "cv3 T3". (this
1690 conversion is selected by enumerating the applicable
1691 conversion functions (_over.match.ref_) and choosing the
1692 best one through overload resolution. (_over.match_).
1694 the reference is bound to the lvalue result of the conversion
1695 in the second case. */
1696 z_candidate *cand = build_user_type_conversion_1 (rto, expr, flags,
1697 complain);
1698 if (cand)
1699 return cand->second_conv;
1702 /* From this point on, we conceptually need temporaries, even if we
1703 elide them. Only the cases above are "direct bindings". */
1704 if (flags & LOOKUP_NO_TEMP_BIND)
1705 return NULL;
1707 /* [over.ics.rank]
1709 When a parameter of reference type is not bound directly to an
1710 argument expression, the conversion sequence is the one required
1711 to convert the argument expression to the underlying type of the
1712 reference according to _over.best.ics_. Conceptually, this
1713 conversion sequence corresponds to copy-initializing a temporary
1714 of the underlying type with the argument expression. Any
1715 difference in top-level cv-qualification is subsumed by the
1716 initialization itself and does not constitute a conversion. */
1718 /* [dcl.init.ref]
1720 Otherwise, the reference shall be an lvalue reference to a
1721 non-volatile const type, or the reference shall be an rvalue
1722 reference.
1724 We try below to treat this as a bad conversion to improve diagnostics,
1725 but if TO is an incomplete class, we need to reject this conversion
1726 now to avoid unnecessary instantiation. */
1727 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto)
1728 && !COMPLETE_TYPE_P (to))
1729 return NULL;
1731 /* We're generating a temporary now, but don't bind any more in the
1732 conversion (specifically, don't slice the temporary returned by a
1733 conversion operator). */
1734 flags |= LOOKUP_NO_TEMP_BIND;
1736 /* Core issue 899: When [copy-]initializing a temporary to be bound
1737 to the first parameter of a copy constructor (12.8) called with
1738 a single argument in the context of direct-initialization,
1739 explicit conversion functions are also considered.
1741 So don't set LOOKUP_ONLYCONVERTING in that case. */
1742 if (!(flags & LOOKUP_COPY_PARM))
1743 flags |= LOOKUP_ONLYCONVERTING;
1745 if (!conv)
1746 conv = implicit_conversion (to, from, expr, c_cast_p,
1747 flags, complain);
1748 if (!conv)
1749 return NULL;
1751 if (conv->user_conv_p)
1753 /* If initializing the temporary used a conversion function,
1754 recalculate the second conversion sequence. */
1755 for (conversion *t = conv; t; t = next_conversion (t))
1756 if (t->kind == ck_user
1757 && DECL_CONV_FN_P (t->cand->fn))
1759 tree ftype = TREE_TYPE (TREE_TYPE (t->cand->fn));
1760 int sflags = (flags|LOOKUP_NO_CONVERSION)&~LOOKUP_NO_TEMP_BIND;
1761 conversion *new_second
1762 = reference_binding (rto, ftype, NULL_TREE, c_cast_p,
1763 sflags, complain);
1764 if (!new_second)
1765 return NULL;
1766 return merge_conversion_sequences (t, new_second);
1770 conv = build_conv (ck_ref_bind, rto, conv);
1771 /* This reference binding, unlike those above, requires the
1772 creation of a temporary. */
1773 conv->need_temporary_p = true;
1774 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
1776 /* [dcl.init.ref]
1778 Otherwise, the reference shall be an lvalue reference to a
1779 non-volatile const type, or the reference shall be an rvalue
1780 reference. */
1781 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto))
1782 conv->bad_p = true;
1784 /* [dcl.init.ref]
1786 Otherwise, a temporary of type "cv1 T1" is created and
1787 initialized from the initializer expression using the rules for a
1788 non-reference copy initialization. If T1 is reference-related to
1789 T2, cv1 must be the same cv-qualification as, or greater
1790 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1791 if (related_p && !at_least_as_qualified_p (to, from))
1792 conv->bad_p = true;
1794 return conv;
1797 /* Returns the implicit conversion sequence (see [over.ics]) from type
1798 FROM to type TO. The optional expression EXPR may affect the
1799 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1800 true, this conversion is coming from a C-style cast. */
1802 static conversion *
1803 implicit_conversion (tree to, tree from, tree expr, bool c_cast_p,
1804 int flags, tsubst_flags_t complain)
1806 conversion *conv;
1808 if (from == error_mark_node || to == error_mark_node
1809 || expr == error_mark_node)
1810 return NULL;
1812 /* Other flags only apply to the primary function in overload
1813 resolution, or after we've chosen one. */
1814 flags &= (LOOKUP_ONLYCONVERTING|LOOKUP_NO_CONVERSION|LOOKUP_COPY_PARM
1815 |LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND|LOOKUP_PREFER_RVALUE
1816 |LOOKUP_NO_NARROWING|LOOKUP_PROTECT|LOOKUP_NO_NON_INTEGRAL);
1818 /* FIXME: actually we don't want warnings either, but we can't just
1819 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1820 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1821 We really ought not to issue that warning until we've committed
1822 to that conversion. */
1823 complain &= ~tf_error;
1825 /* Call reshape_init early to remove redundant braces. */
1826 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr)
1827 && CLASS_TYPE_P (to)
1828 && COMPLETE_TYPE_P (complete_type (to))
1829 && !CLASSTYPE_NON_AGGREGATE (to))
1831 expr = reshape_init (to, expr, complain);
1832 if (expr == error_mark_node)
1833 return NULL;
1834 from = TREE_TYPE (expr);
1837 if (TREE_CODE (to) == REFERENCE_TYPE)
1838 conv = reference_binding (to, from, expr, c_cast_p, flags, complain);
1839 else
1840 conv = standard_conversion (to, from, expr, c_cast_p, flags, complain);
1842 if (conv)
1843 return conv;
1845 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1847 if (is_std_init_list (to))
1848 return build_list_conv (to, expr, flags, complain);
1850 /* As an extension, allow list-initialization of _Complex. */
1851 if (TREE_CODE (to) == COMPLEX_TYPE)
1853 conv = build_complex_conv (to, expr, flags, complain);
1854 if (conv)
1855 return conv;
1858 /* Allow conversion from an initializer-list with one element to a
1859 scalar type. */
1860 if (SCALAR_TYPE_P (to))
1862 int nelts = CONSTRUCTOR_NELTS (expr);
1863 tree elt;
1865 if (nelts == 0)
1866 elt = build_value_init (to, tf_none);
1867 else if (nelts == 1)
1868 elt = CONSTRUCTOR_ELT (expr, 0)->value;
1869 else
1870 elt = error_mark_node;
1872 conv = implicit_conversion (to, TREE_TYPE (elt), elt,
1873 c_cast_p, flags, complain);
1874 if (conv)
1876 conv->check_narrowing = true;
1877 if (BRACE_ENCLOSED_INITIALIZER_P (elt))
1878 /* Too many levels of braces, i.e. '{{1}}'. */
1879 conv->bad_p = true;
1880 return conv;
1883 else if (TREE_CODE (to) == ARRAY_TYPE)
1884 return build_array_conv (to, expr, flags, complain);
1887 if (expr != NULL_TREE
1888 && (MAYBE_CLASS_TYPE_P (from)
1889 || MAYBE_CLASS_TYPE_P (to))
1890 && (flags & LOOKUP_NO_CONVERSION) == 0)
1892 struct z_candidate *cand;
1894 if (CLASS_TYPE_P (to)
1895 && BRACE_ENCLOSED_INITIALIZER_P (expr)
1896 && !CLASSTYPE_NON_AGGREGATE (complete_type (to)))
1897 return build_aggr_conv (to, expr, flags, complain);
1899 cand = build_user_type_conversion_1 (to, expr, flags, complain);
1900 if (cand)
1902 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
1903 && CONSTRUCTOR_NELTS (expr) == 1
1904 && !is_list_ctor (cand->fn))
1906 /* "If C is not an initializer-list constructor and the
1907 initializer list has a single element of type cv U, where U is
1908 X or a class derived from X, the implicit conversion sequence
1909 has Exact Match rank if U is X, or Conversion rank if U is
1910 derived from X." */
1911 tree elt = CONSTRUCTOR_ELT (expr, 0)->value;
1912 tree elttype = TREE_TYPE (elt);
1913 if (reference_related_p (to, elttype))
1914 return implicit_conversion (to, elttype, elt,
1915 c_cast_p, flags, complain);
1917 conv = cand->second_conv;
1920 /* We used to try to bind a reference to a temporary here, but that
1921 is now handled after the recursive call to this function at the end
1922 of reference_binding. */
1923 return conv;
1926 return NULL;
1929 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1930 functions. ARGS will not be changed until a single candidate is
1931 selected. */
1933 static struct z_candidate *
1934 add_candidate (struct z_candidate **candidates,
1935 tree fn, tree first_arg, const vec<tree, va_gc> *args,
1936 size_t num_convs, conversion **convs,
1937 tree access_path, tree conversion_path,
1938 int viable, struct rejection_reason *reason,
1939 int flags)
1941 struct z_candidate *cand = (struct z_candidate *)
1942 conversion_obstack_alloc (sizeof (struct z_candidate));
1944 cand->fn = fn;
1945 cand->first_arg = first_arg;
1946 cand->args = args;
1947 cand->convs = convs;
1948 cand->num_convs = num_convs;
1949 cand->access_path = access_path;
1950 cand->conversion_path = conversion_path;
1951 cand->viable = viable;
1952 cand->reason = reason;
1953 cand->next = *candidates;
1954 cand->flags = flags;
1955 *candidates = cand;
1957 return cand;
1960 /* Return the number of remaining arguments in the parameter list
1961 beginning with ARG. */
1964 remaining_arguments (tree arg)
1966 int n;
1968 for (n = 0; arg != NULL_TREE && arg != void_list_node;
1969 arg = TREE_CHAIN (arg))
1970 n++;
1972 return n;
1975 /* Create an overload candidate for the function or method FN called
1976 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1977 FLAGS is passed on to implicit_conversion.
1979 This does not change ARGS.
1981 CTYPE, if non-NULL, is the type we want to pretend this function
1982 comes from for purposes of overload resolution. */
1984 static struct z_candidate *
1985 add_function_candidate (struct z_candidate **candidates,
1986 tree fn, tree ctype, tree first_arg,
1987 const vec<tree, va_gc> *args, tree access_path,
1988 tree conversion_path, int flags,
1989 tsubst_flags_t complain)
1991 tree parmlist = TYPE_ARG_TYPES (TREE_TYPE (fn));
1992 int i, len;
1993 conversion **convs;
1994 tree parmnode;
1995 tree orig_first_arg = first_arg;
1996 int skip;
1997 int viable = 1;
1998 struct rejection_reason *reason = NULL;
2000 /* At this point we should not see any functions which haven't been
2001 explicitly declared, except for friend functions which will have
2002 been found using argument dependent lookup. */
2003 gcc_assert (!DECL_ANTICIPATED (fn) || DECL_HIDDEN_FRIEND_P (fn));
2005 /* The `this', `in_chrg' and VTT arguments to constructors are not
2006 considered in overload resolution. */
2007 if (DECL_CONSTRUCTOR_P (fn))
2009 if (ctor_omit_inherited_parms (fn))
2010 /* Bring back parameters omitted from an inherited ctor. */
2011 parmlist = FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn));
2012 else
2013 parmlist = skip_artificial_parms_for (fn, parmlist);
2014 skip = num_artificial_parms_for (fn);
2015 if (skip > 0 && first_arg != NULL_TREE)
2017 --skip;
2018 first_arg = NULL_TREE;
2021 else
2022 skip = 0;
2024 len = vec_safe_length (args) - skip + (first_arg != NULL_TREE ? 1 : 0);
2025 convs = alloc_conversions (len);
2027 /* 13.3.2 - Viable functions [over.match.viable]
2028 First, to be a viable function, a candidate function shall have enough
2029 parameters to agree in number with the arguments in the list.
2031 We need to check this first; otherwise, checking the ICSes might cause
2032 us to produce an ill-formed template instantiation. */
2034 parmnode = parmlist;
2035 for (i = 0; i < len; ++i)
2037 if (parmnode == NULL_TREE || parmnode == void_list_node)
2038 break;
2039 parmnode = TREE_CHAIN (parmnode);
2042 if ((i < len && parmnode)
2043 || !sufficient_parms_p (parmnode))
2045 int remaining = remaining_arguments (parmnode);
2046 viable = 0;
2047 reason = arity_rejection (first_arg, i + remaining, len);
2050 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2051 parameter of type "reference to cv C" (including such a constructor
2052 instantiated from a template) is excluded from the set of candidate
2053 functions when used to construct an object of type D with an argument list
2054 containing a single argument if C is reference-related to D. */
2055 if (viable && len == 1 && parmlist && DECL_CONSTRUCTOR_P (fn)
2056 && flag_new_inheriting_ctors
2057 && DECL_INHERITED_CTOR (fn))
2059 tree ptype = non_reference (TREE_VALUE (parmlist));
2060 tree dtype = DECL_CONTEXT (fn);
2061 tree btype = DECL_INHERITED_CTOR_BASE (fn);
2062 if (reference_related_p (ptype, dtype)
2063 && reference_related_p (btype, ptype))
2065 viable = false;
2066 reason = inherited_ctor_rejection ();
2070 /* Second, for a function to be viable, its constraints must be
2071 satisfied. */
2072 if (flag_concepts && viable
2073 && !constraints_satisfied_p (fn))
2075 reason = constraint_failure (fn);
2076 viable = false;
2079 /* When looking for a function from a subobject from an implicit
2080 copy/move constructor/operator=, don't consider anything that takes (a
2081 reference to) an unrelated type. See c++/44909 and core 1092. */
2082 if (viable && parmlist && (flags & LOOKUP_DEFAULTED))
2084 if (DECL_CONSTRUCTOR_P (fn))
2085 i = 1;
2086 else if (DECL_ASSIGNMENT_OPERATOR_P (fn)
2087 && DECL_OVERLOADED_OPERATOR_IS (fn, NOP_EXPR))
2088 i = 2;
2089 else
2090 i = 0;
2091 if (i && len == i)
2093 parmnode = chain_index (i-1, parmlist);
2094 if (!reference_related_p (non_reference (TREE_VALUE (parmnode)),
2095 ctype))
2096 viable = 0;
2099 /* This only applies at the top level. */
2100 flags &= ~LOOKUP_DEFAULTED;
2103 if (! viable)
2104 goto out;
2106 /* Third, for F to be a viable function, there shall exist for each
2107 argument an implicit conversion sequence that converts that argument
2108 to the corresponding parameter of F. */
2110 parmnode = parmlist;
2112 for (i = 0; i < len; ++i)
2114 tree argtype, to_type;
2115 tree arg;
2116 conversion *t;
2117 int is_this;
2119 if (parmnode == void_list_node)
2120 break;
2122 if (i == 0 && first_arg != NULL_TREE)
2123 arg = first_arg;
2124 else
2125 arg = CONST_CAST_TREE (
2126 (*args)[i + skip - (first_arg != NULL_TREE ? 1 : 0)]);
2127 argtype = lvalue_type (arg);
2129 is_this = (i == 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
2130 && ! DECL_CONSTRUCTOR_P (fn));
2132 if (parmnode)
2134 tree parmtype = TREE_VALUE (parmnode);
2135 int lflags = flags;
2137 parmnode = TREE_CHAIN (parmnode);
2139 /* The type of the implicit object parameter ('this') for
2140 overload resolution is not always the same as for the
2141 function itself; conversion functions are considered to
2142 be members of the class being converted, and functions
2143 introduced by a using-declaration are considered to be
2144 members of the class that uses them.
2146 Since build_over_call ignores the ICS for the `this'
2147 parameter, we can just change the parm type. */
2148 if (ctype && is_this)
2150 parmtype = cp_build_qualified_type
2151 (ctype, cp_type_quals (TREE_TYPE (parmtype)));
2152 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn)))
2154 /* If the function has a ref-qualifier, the implicit
2155 object parameter has reference type. */
2156 bool rv = FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn));
2157 parmtype = cp_build_reference_type (parmtype, rv);
2158 /* The special handling of 'this' conversions in compare_ics
2159 does not apply if there is a ref-qualifier. */
2160 is_this = false;
2162 else
2164 parmtype = build_pointer_type (parmtype);
2165 /* We don't use build_this here because we don't want to
2166 capture the object argument until we've chosen a
2167 non-static member function. */
2168 arg = build_address (arg);
2169 argtype = lvalue_type (arg);
2173 /* Core issue 899: When [copy-]initializing a temporary to be bound
2174 to the first parameter of a copy constructor (12.8) called with
2175 a single argument in the context of direct-initialization,
2176 explicit conversion functions are also considered.
2178 So set LOOKUP_COPY_PARM to let reference_binding know that
2179 it's being called in that context. We generalize the above
2180 to handle move constructors and template constructors as well;
2181 the standardese should soon be updated similarly. */
2182 if (ctype && i == 0 && (len-skip == 1)
2183 && DECL_CONSTRUCTOR_P (fn)
2184 && parmtype != error_mark_node
2185 && (same_type_ignoring_top_level_qualifiers_p
2186 (non_reference (parmtype), ctype)))
2188 if (!(flags & LOOKUP_ONLYCONVERTING))
2189 lflags |= LOOKUP_COPY_PARM;
2190 /* We allow user-defined conversions within init-lists, but
2191 don't list-initialize the copy parm, as that would mean
2192 using two levels of braces for the same type. */
2193 if ((flags & LOOKUP_LIST_INIT_CTOR)
2194 && BRACE_ENCLOSED_INITIALIZER_P (arg))
2195 lflags |= LOOKUP_NO_CONVERSION;
2197 else
2198 lflags |= LOOKUP_ONLYCONVERTING;
2200 t = implicit_conversion (parmtype, argtype, arg,
2201 /*c_cast_p=*/false, lflags, complain);
2202 to_type = parmtype;
2204 else
2206 t = build_identity_conv (argtype, arg);
2207 t->ellipsis_p = true;
2208 to_type = argtype;
2211 if (t && is_this)
2212 t->this_p = true;
2214 convs[i] = t;
2215 if (! t)
2217 viable = 0;
2218 reason = arg_conversion_rejection (first_arg, i, argtype, to_type);
2219 break;
2222 if (t->bad_p)
2224 viable = -1;
2225 reason = bad_arg_conversion_rejection (first_arg, i, arg, to_type);
2229 out:
2230 return add_candidate (candidates, fn, orig_first_arg, args, len, convs,
2231 access_path, conversion_path, viable, reason, flags);
2234 /* Create an overload candidate for the conversion function FN which will
2235 be invoked for expression OBJ, producing a pointer-to-function which
2236 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2237 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2238 passed on to implicit_conversion.
2240 Actually, we don't really care about FN; we care about the type it
2241 converts to. There may be multiple conversion functions that will
2242 convert to that type, and we rely on build_user_type_conversion_1 to
2243 choose the best one; so when we create our candidate, we record the type
2244 instead of the function. */
2246 static struct z_candidate *
2247 add_conv_candidate (struct z_candidate **candidates, tree fn, tree obj,
2248 const vec<tree, va_gc> *arglist,
2249 tree access_path, tree conversion_path,
2250 tsubst_flags_t complain)
2252 tree totype = TREE_TYPE (TREE_TYPE (fn));
2253 int i, len, viable, flags;
2254 tree parmlist, parmnode;
2255 conversion **convs;
2256 struct rejection_reason *reason;
2258 for (parmlist = totype; TREE_CODE (parmlist) != FUNCTION_TYPE; )
2259 parmlist = TREE_TYPE (parmlist);
2260 parmlist = TYPE_ARG_TYPES (parmlist);
2262 len = vec_safe_length (arglist) + 1;
2263 convs = alloc_conversions (len);
2264 parmnode = parmlist;
2265 viable = 1;
2266 flags = LOOKUP_IMPLICIT;
2267 reason = NULL;
2269 /* Don't bother looking up the same type twice. */
2270 if (*candidates && (*candidates)->fn == totype)
2271 return NULL;
2273 for (i = 0; i < len; ++i)
2275 tree arg, argtype, convert_type = NULL_TREE;
2276 conversion *t;
2278 if (i == 0)
2279 arg = obj;
2280 else
2281 arg = (*arglist)[i - 1];
2282 argtype = lvalue_type (arg);
2284 if (i == 0)
2286 t = build_identity_conv (argtype, NULL_TREE);
2287 t = build_conv (ck_user, totype, t);
2288 /* Leave the 'cand' field null; we'll figure out the conversion in
2289 convert_like_real if this candidate is chosen. */
2290 convert_type = totype;
2292 else if (parmnode == void_list_node)
2293 break;
2294 else if (parmnode)
2296 t = implicit_conversion (TREE_VALUE (parmnode), argtype, arg,
2297 /*c_cast_p=*/false, flags, complain);
2298 convert_type = TREE_VALUE (parmnode);
2300 else
2302 t = build_identity_conv (argtype, arg);
2303 t->ellipsis_p = true;
2304 convert_type = argtype;
2307 convs[i] = t;
2308 if (! t)
2309 break;
2311 if (t->bad_p)
2313 viable = -1;
2314 reason = bad_arg_conversion_rejection (NULL_TREE, i, arg, convert_type);
2317 if (i == 0)
2318 continue;
2320 if (parmnode)
2321 parmnode = TREE_CHAIN (parmnode);
2324 if (i < len
2325 || ! sufficient_parms_p (parmnode))
2327 int remaining = remaining_arguments (parmnode);
2328 viable = 0;
2329 reason = arity_rejection (NULL_TREE, i + remaining, len);
2332 return add_candidate (candidates, totype, obj, arglist, len, convs,
2333 access_path, conversion_path, viable, reason, flags);
2336 static void
2337 build_builtin_candidate (struct z_candidate **candidates, tree fnname,
2338 tree type1, tree type2, tree *args, tree *argtypes,
2339 int flags, tsubst_flags_t complain)
2341 conversion *t;
2342 conversion **convs;
2343 size_t num_convs;
2344 int viable = 1, i;
2345 tree types[2];
2346 struct rejection_reason *reason = NULL;
2348 types[0] = type1;
2349 types[1] = type2;
2351 num_convs = args[2] ? 3 : (args[1] ? 2 : 1);
2352 convs = alloc_conversions (num_convs);
2354 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2355 conversion ops are allowed. We handle that here by just checking for
2356 boolean_type_node because other operators don't ask for it. COND_EXPR
2357 also does contextual conversion to bool for the first operand, but we
2358 handle that in build_conditional_expr, and type1 here is operand 2. */
2359 if (type1 != boolean_type_node)
2360 flags |= LOOKUP_ONLYCONVERTING;
2362 for (i = 0; i < 2; ++i)
2364 if (! args[i])
2365 break;
2367 t = implicit_conversion (types[i], argtypes[i], args[i],
2368 /*c_cast_p=*/false, flags, complain);
2369 if (! t)
2371 viable = 0;
2372 /* We need something for printing the candidate. */
2373 t = build_identity_conv (types[i], NULL_TREE);
2374 reason = arg_conversion_rejection (NULL_TREE, i, argtypes[i],
2375 types[i]);
2377 else if (t->bad_p)
2379 viable = 0;
2380 reason = bad_arg_conversion_rejection (NULL_TREE, i, args[i],
2381 types[i]);
2383 convs[i] = t;
2386 /* For COND_EXPR we rearranged the arguments; undo that now. */
2387 if (args[2])
2389 convs[2] = convs[1];
2390 convs[1] = convs[0];
2391 t = implicit_conversion (boolean_type_node, argtypes[2], args[2],
2392 /*c_cast_p=*/false, flags,
2393 complain);
2394 if (t)
2395 convs[0] = t;
2396 else
2398 viable = 0;
2399 reason = arg_conversion_rejection (NULL_TREE, 0, argtypes[2],
2400 boolean_type_node);
2404 add_candidate (candidates, fnname, /*first_arg=*/NULL_TREE, /*args=*/NULL,
2405 num_convs, convs,
2406 /*access_path=*/NULL_TREE,
2407 /*conversion_path=*/NULL_TREE,
2408 viable, reason, flags);
2411 static bool
2412 is_complete (tree t)
2414 return COMPLETE_TYPE_P (complete_type (t));
2417 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2419 static bool
2420 promoted_arithmetic_type_p (tree type)
2422 /* [over.built]
2424 In this section, the term promoted integral type is used to refer
2425 to those integral types which are preserved by integral promotion
2426 (including e.g. int and long but excluding e.g. char).
2427 Similarly, the term promoted arithmetic type refers to promoted
2428 integral types plus floating types. */
2429 return ((CP_INTEGRAL_TYPE_P (type)
2430 && same_type_p (type_promotes_to (type), type))
2431 || TREE_CODE (type) == REAL_TYPE);
2434 /* Create any builtin operator overload candidates for the operator in
2435 question given the converted operand types TYPE1 and TYPE2. The other
2436 args are passed through from add_builtin_candidates to
2437 build_builtin_candidate.
2439 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2440 If CODE is requires candidates operands of the same type of the kind
2441 of which TYPE1 and TYPE2 are, we add both candidates
2442 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2444 static void
2445 add_builtin_candidate (struct z_candidate **candidates, enum tree_code code,
2446 enum tree_code code2, tree fnname, tree type1,
2447 tree type2, tree *args, tree *argtypes, int flags,
2448 tsubst_flags_t complain)
2450 switch (code)
2452 case POSTINCREMENT_EXPR:
2453 case POSTDECREMENT_EXPR:
2454 args[1] = integer_zero_node;
2455 type2 = integer_type_node;
2456 break;
2457 default:
2458 break;
2461 switch (code)
2464 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2465 and VQ is either volatile or empty, there exist candidate operator
2466 functions of the form
2467 VQ T& operator++(VQ T&);
2468 T operator++(VQ T&, int);
2469 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2470 type other than bool, and VQ is either volatile or empty, there exist
2471 candidate operator functions of the form
2472 VQ T& operator--(VQ T&);
2473 T operator--(VQ T&, int);
2474 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2475 complete object type, and VQ is either volatile or empty, there exist
2476 candidate operator functions of the form
2477 T*VQ& operator++(T*VQ&);
2478 T*VQ& operator--(T*VQ&);
2479 T* operator++(T*VQ&, int);
2480 T* operator--(T*VQ&, int); */
2482 case POSTDECREMENT_EXPR:
2483 case PREDECREMENT_EXPR:
2484 if (TREE_CODE (type1) == BOOLEAN_TYPE)
2485 return;
2486 /* FALLTHRU */
2487 case POSTINCREMENT_EXPR:
2488 case PREINCREMENT_EXPR:
2489 if (ARITHMETIC_TYPE_P (type1) || TYPE_PTROB_P (type1))
2491 type1 = build_reference_type (type1);
2492 break;
2494 return;
2496 /* 7 For every cv-qualified or cv-unqualified object type T, there
2497 exist candidate operator functions of the form
2499 T& operator*(T*);
2501 8 For every function type T, there exist candidate operator functions of
2502 the form
2503 T& operator*(T*); */
2505 case INDIRECT_REF:
2506 if (TYPE_PTR_P (type1)
2507 && (TYPE_PTROB_P (type1)
2508 || TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE))
2509 break;
2510 return;
2512 /* 9 For every type T, there exist candidate operator functions of the form
2513 T* operator+(T*);
2515 10For every promoted arithmetic type T, there exist candidate operator
2516 functions of the form
2517 T operator+(T);
2518 T operator-(T); */
2520 case UNARY_PLUS_EXPR: /* unary + */
2521 if (TYPE_PTR_P (type1))
2522 break;
2523 /* FALLTHRU */
2524 case NEGATE_EXPR:
2525 if (ARITHMETIC_TYPE_P (type1))
2526 break;
2527 return;
2529 /* 11For every promoted integral type T, there exist candidate operator
2530 functions of the form
2531 T operator~(T); */
2533 case BIT_NOT_EXPR:
2534 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1))
2535 break;
2536 return;
2538 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2539 is the same type as C2 or is a derived class of C2, T is a complete
2540 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2541 there exist candidate operator functions of the form
2542 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2543 where CV12 is the union of CV1 and CV2. */
2545 case MEMBER_REF:
2546 if (TYPE_PTR_P (type1) && TYPE_PTRMEM_P (type2))
2548 tree c1 = TREE_TYPE (type1);
2549 tree c2 = TYPE_PTRMEM_CLASS_TYPE (type2);
2551 if (MAYBE_CLASS_TYPE_P (c1) && DERIVED_FROM_P (c2, c1)
2552 && (TYPE_PTRMEMFUNC_P (type2)
2553 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2))))
2554 break;
2556 return;
2558 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2559 didate operator functions of the form
2560 LR operator*(L, R);
2561 LR operator/(L, R);
2562 LR operator+(L, R);
2563 LR operator-(L, R);
2564 bool operator<(L, R);
2565 bool operator>(L, R);
2566 bool operator<=(L, R);
2567 bool operator>=(L, R);
2568 bool operator==(L, R);
2569 bool operator!=(L, R);
2570 where LR is the result of the usual arithmetic conversions between
2571 types L and R.
2573 14For every pair of types T and I, where T is a cv-qualified or cv-
2574 unqualified complete object type and I is a promoted integral type,
2575 there exist candidate operator functions of the form
2576 T* operator+(T*, I);
2577 T& operator[](T*, I);
2578 T* operator-(T*, I);
2579 T* operator+(I, T*);
2580 T& operator[](I, T*);
2582 15For every T, where T is a pointer to complete object type, there exist
2583 candidate operator functions of the form112)
2584 ptrdiff_t operator-(T, T);
2586 16For every pointer or enumeration type T, there exist candidate operator
2587 functions of the form
2588 bool operator<(T, T);
2589 bool operator>(T, T);
2590 bool operator<=(T, T);
2591 bool operator>=(T, T);
2592 bool operator==(T, T);
2593 bool operator!=(T, T);
2595 17For every pointer to member type T, there exist candidate operator
2596 functions of the form
2597 bool operator==(T, T);
2598 bool operator!=(T, T); */
2600 case MINUS_EXPR:
2601 if (TYPE_PTROB_P (type1) && TYPE_PTROB_P (type2))
2602 break;
2603 if (TYPE_PTROB_P (type1)
2604 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2606 type2 = ptrdiff_type_node;
2607 break;
2609 /* FALLTHRU */
2610 case MULT_EXPR:
2611 case TRUNC_DIV_EXPR:
2612 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2613 break;
2614 return;
2616 case EQ_EXPR:
2617 case NE_EXPR:
2618 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2619 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2)))
2620 break;
2621 if (TYPE_PTRMEM_P (type1) && null_ptr_cst_p (args[1]))
2623 type2 = type1;
2624 break;
2626 if (TYPE_PTRMEM_P (type2) && null_ptr_cst_p (args[0]))
2628 type1 = type2;
2629 break;
2631 /* Fall through. */
2632 case LT_EXPR:
2633 case GT_EXPR:
2634 case LE_EXPR:
2635 case GE_EXPR:
2636 case MAX_EXPR:
2637 case MIN_EXPR:
2638 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2639 break;
2640 if (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2641 break;
2642 if (TREE_CODE (type1) == ENUMERAL_TYPE
2643 && TREE_CODE (type2) == ENUMERAL_TYPE)
2644 break;
2645 if (TYPE_PTR_P (type1)
2646 && null_ptr_cst_p (args[1]))
2648 type2 = type1;
2649 break;
2651 if (null_ptr_cst_p (args[0])
2652 && TYPE_PTR_P (type2))
2654 type1 = type2;
2655 break;
2657 return;
2659 case PLUS_EXPR:
2660 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2661 break;
2662 /* FALLTHRU */
2663 case ARRAY_REF:
2664 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && TYPE_PTROB_P (type2))
2666 type1 = ptrdiff_type_node;
2667 break;
2669 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2671 type2 = ptrdiff_type_node;
2672 break;
2674 return;
2676 /* 18For every pair of promoted integral types L and R, there exist candi-
2677 date operator functions of the form
2678 LR operator%(L, R);
2679 LR operator&(L, R);
2680 LR operator^(L, R);
2681 LR operator|(L, R);
2682 L operator<<(L, R);
2683 L operator>>(L, R);
2684 where LR is the result of the usual arithmetic conversions between
2685 types L and R. */
2687 case TRUNC_MOD_EXPR:
2688 case BIT_AND_EXPR:
2689 case BIT_IOR_EXPR:
2690 case BIT_XOR_EXPR:
2691 case LSHIFT_EXPR:
2692 case RSHIFT_EXPR:
2693 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2694 break;
2695 return;
2697 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2698 type, VQ is either volatile or empty, and R is a promoted arithmetic
2699 type, there exist candidate operator functions of the form
2700 VQ L& operator=(VQ L&, R);
2701 VQ L& operator*=(VQ L&, R);
2702 VQ L& operator/=(VQ L&, R);
2703 VQ L& operator+=(VQ L&, R);
2704 VQ L& operator-=(VQ L&, R);
2706 20For every pair T, VQ), where T is any type and VQ is either volatile
2707 or empty, there exist candidate operator functions of the form
2708 T*VQ& operator=(T*VQ&, T*);
2710 21For every pair T, VQ), where T is a pointer to member type and VQ is
2711 either volatile or empty, there exist candidate operator functions of
2712 the form
2713 VQ T& operator=(VQ T&, T);
2715 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2716 unqualified complete object type, VQ is either volatile or empty, and
2717 I is a promoted integral type, there exist candidate operator func-
2718 tions of the form
2719 T*VQ& operator+=(T*VQ&, I);
2720 T*VQ& operator-=(T*VQ&, I);
2722 23For every triple L, VQ, R), where L is an integral or enumeration
2723 type, VQ is either volatile or empty, and R is a promoted integral
2724 type, there exist candidate operator functions of the form
2726 VQ L& operator%=(VQ L&, R);
2727 VQ L& operator<<=(VQ L&, R);
2728 VQ L& operator>>=(VQ L&, R);
2729 VQ L& operator&=(VQ L&, R);
2730 VQ L& operator^=(VQ L&, R);
2731 VQ L& operator|=(VQ L&, R); */
2733 case MODIFY_EXPR:
2734 switch (code2)
2736 case PLUS_EXPR:
2737 case MINUS_EXPR:
2738 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2740 type2 = ptrdiff_type_node;
2741 break;
2743 /* FALLTHRU */
2744 case MULT_EXPR:
2745 case TRUNC_DIV_EXPR:
2746 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2747 break;
2748 return;
2750 case TRUNC_MOD_EXPR:
2751 case BIT_AND_EXPR:
2752 case BIT_IOR_EXPR:
2753 case BIT_XOR_EXPR:
2754 case LSHIFT_EXPR:
2755 case RSHIFT_EXPR:
2756 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2757 break;
2758 return;
2760 case NOP_EXPR:
2761 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2762 break;
2763 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2764 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2765 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
2766 || ((TYPE_PTRMEMFUNC_P (type1)
2767 || TYPE_PTR_P (type1))
2768 && null_ptr_cst_p (args[1])))
2770 type2 = type1;
2771 break;
2773 return;
2775 default:
2776 gcc_unreachable ();
2778 type1 = build_reference_type (type1);
2779 break;
2781 case COND_EXPR:
2782 /* [over.built]
2784 For every pair of promoted arithmetic types L and R, there
2785 exist candidate operator functions of the form
2787 LR operator?(bool, L, R);
2789 where LR is the result of the usual arithmetic conversions
2790 between types L and R.
2792 For every type T, where T is a pointer or pointer-to-member
2793 type, there exist candidate operator functions of the form T
2794 operator?(bool, T, T); */
2796 if (promoted_arithmetic_type_p (type1)
2797 && promoted_arithmetic_type_p (type2))
2798 /* That's OK. */
2799 break;
2801 /* Otherwise, the types should be pointers. */
2802 if (!TYPE_PTR_OR_PTRMEM_P (type1) || !TYPE_PTR_OR_PTRMEM_P (type2))
2803 return;
2805 /* We don't check that the two types are the same; the logic
2806 below will actually create two candidates; one in which both
2807 parameter types are TYPE1, and one in which both parameter
2808 types are TYPE2. */
2809 break;
2811 case REALPART_EXPR:
2812 case IMAGPART_EXPR:
2813 if (ARITHMETIC_TYPE_P (type1))
2814 break;
2815 return;
2817 default:
2818 gcc_unreachable ();
2821 /* Make sure we don't create builtin candidates with dependent types. */
2822 bool u1 = uses_template_parms (type1);
2823 bool u2 = type2 ? uses_template_parms (type2) : false;
2824 if (u1 || u2)
2826 /* Try to recover if one of the types is non-dependent. But if
2827 there's only one type, there's nothing we can do. */
2828 if (!type2)
2829 return;
2830 /* And we lose if both are dependent. */
2831 if (u1 && u2)
2832 return;
2833 /* Or if they have different forms. */
2834 if (TREE_CODE (type1) != TREE_CODE (type2))
2835 return;
2837 if (u1 && !u2)
2838 type1 = type2;
2839 else if (u2 && !u1)
2840 type2 = type1;
2843 /* If we're dealing with two pointer types or two enumeral types,
2844 we need candidates for both of them. */
2845 if (type2 && !same_type_p (type1, type2)
2846 && TREE_CODE (type1) == TREE_CODE (type2)
2847 && (TREE_CODE (type1) == REFERENCE_TYPE
2848 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2849 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
2850 || TYPE_PTRMEMFUNC_P (type1)
2851 || MAYBE_CLASS_TYPE_P (type1)
2852 || TREE_CODE (type1) == ENUMERAL_TYPE))
2854 if (TYPE_PTR_OR_PTRMEM_P (type1))
2856 tree cptype = composite_pointer_type (type1, type2,
2857 error_mark_node,
2858 error_mark_node,
2859 CPO_CONVERSION,
2860 tf_none);
2861 if (cptype != error_mark_node)
2863 build_builtin_candidate
2864 (candidates, fnname, cptype, cptype, args, argtypes,
2865 flags, complain);
2866 return;
2870 build_builtin_candidate
2871 (candidates, fnname, type1, type1, args, argtypes, flags, complain);
2872 build_builtin_candidate
2873 (candidates, fnname, type2, type2, args, argtypes, flags, complain);
2874 return;
2877 build_builtin_candidate
2878 (candidates, fnname, type1, type2, args, argtypes, flags, complain);
2881 tree
2882 type_decays_to (tree type)
2884 if (TREE_CODE (type) == ARRAY_TYPE)
2885 return build_pointer_type (TREE_TYPE (type));
2886 if (TREE_CODE (type) == FUNCTION_TYPE)
2887 return build_pointer_type (type);
2888 return type;
2891 /* There are three conditions of builtin candidates:
2893 1) bool-taking candidates. These are the same regardless of the input.
2894 2) pointer-pair taking candidates. These are generated for each type
2895 one of the input types converts to.
2896 3) arithmetic candidates. According to the standard, we should generate
2897 all of these, but I'm trying not to...
2899 Here we generate a superset of the possible candidates for this particular
2900 case. That is a subset of the full set the standard defines, plus some
2901 other cases which the standard disallows. add_builtin_candidate will
2902 filter out the invalid set. */
2904 static void
2905 add_builtin_candidates (struct z_candidate **candidates, enum tree_code code,
2906 enum tree_code code2, tree fnname, tree *args,
2907 int flags, tsubst_flags_t complain)
2909 int ref1, i;
2910 int enum_p = 0;
2911 tree type, argtypes[3], t;
2912 /* TYPES[i] is the set of possible builtin-operator parameter types
2913 we will consider for the Ith argument. */
2914 vec<tree, va_gc> *types[2];
2915 unsigned ix;
2917 for (i = 0; i < 3; ++i)
2919 if (args[i])
2920 argtypes[i] = unlowered_expr_type (args[i]);
2921 else
2922 argtypes[i] = NULL_TREE;
2925 switch (code)
2927 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2928 and VQ is either volatile or empty, there exist candidate operator
2929 functions of the form
2930 VQ T& operator++(VQ T&); */
2932 case POSTINCREMENT_EXPR:
2933 case PREINCREMENT_EXPR:
2934 case POSTDECREMENT_EXPR:
2935 case PREDECREMENT_EXPR:
2936 case MODIFY_EXPR:
2937 ref1 = 1;
2938 break;
2940 /* 24There also exist candidate operator functions of the form
2941 bool operator!(bool);
2942 bool operator&&(bool, bool);
2943 bool operator||(bool, bool); */
2945 case TRUTH_NOT_EXPR:
2946 build_builtin_candidate
2947 (candidates, fnname, boolean_type_node,
2948 NULL_TREE, args, argtypes, flags, complain);
2949 return;
2951 case TRUTH_ORIF_EXPR:
2952 case TRUTH_ANDIF_EXPR:
2953 build_builtin_candidate
2954 (candidates, fnname, boolean_type_node,
2955 boolean_type_node, args, argtypes, flags, complain);
2956 return;
2958 case ADDR_EXPR:
2959 case COMPOUND_EXPR:
2960 case COMPONENT_REF:
2961 return;
2963 case COND_EXPR:
2964 case EQ_EXPR:
2965 case NE_EXPR:
2966 case LT_EXPR:
2967 case LE_EXPR:
2968 case GT_EXPR:
2969 case GE_EXPR:
2970 enum_p = 1;
2971 /* Fall through. */
2973 default:
2974 ref1 = 0;
2977 types[0] = make_tree_vector ();
2978 types[1] = make_tree_vector ();
2980 for (i = 0; i < 2; ++i)
2982 if (! args[i])
2984 else if (MAYBE_CLASS_TYPE_P (argtypes[i]))
2986 tree convs;
2988 if (i == 0 && code == MODIFY_EXPR && code2 == NOP_EXPR)
2989 return;
2991 convs = lookup_conversions (argtypes[i]);
2993 if (code == COND_EXPR)
2995 if (lvalue_p (args[i]))
2996 vec_safe_push (types[i], build_reference_type (argtypes[i]));
2998 vec_safe_push (types[i], TYPE_MAIN_VARIANT (argtypes[i]));
3001 else if (! convs)
3002 return;
3004 for (; convs; convs = TREE_CHAIN (convs))
3006 type = TREE_TYPE (convs);
3008 if (i == 0 && ref1
3009 && (TREE_CODE (type) != REFERENCE_TYPE
3010 || CP_TYPE_CONST_P (TREE_TYPE (type))))
3011 continue;
3013 if (code == COND_EXPR && TREE_CODE (type) == REFERENCE_TYPE)
3014 vec_safe_push (types[i], type);
3016 type = non_reference (type);
3017 if (i != 0 || ! ref1)
3019 type = cv_unqualified (type_decays_to (type));
3020 if (enum_p && TREE_CODE (type) == ENUMERAL_TYPE)
3021 vec_safe_push (types[i], type);
3022 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
3023 type = type_promotes_to (type);
3026 if (! vec_member (type, types[i]))
3027 vec_safe_push (types[i], type);
3030 else
3032 if (code == COND_EXPR && lvalue_p (args[i]))
3033 vec_safe_push (types[i], build_reference_type (argtypes[i]));
3034 type = non_reference (argtypes[i]);
3035 if (i != 0 || ! ref1)
3037 type = cv_unqualified (type_decays_to (type));
3038 if (enum_p && UNSCOPED_ENUM_P (type))
3039 vec_safe_push (types[i], type);
3040 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
3041 type = type_promotes_to (type);
3043 vec_safe_push (types[i], type);
3047 /* Run through the possible parameter types of both arguments,
3048 creating candidates with those parameter types. */
3049 FOR_EACH_VEC_ELT_REVERSE (*(types[0]), ix, t)
3051 unsigned jx;
3052 tree u;
3054 if (!types[1]->is_empty ())
3055 FOR_EACH_VEC_ELT_REVERSE (*(types[1]), jx, u)
3056 add_builtin_candidate
3057 (candidates, code, code2, fnname, t,
3058 u, args, argtypes, flags, complain);
3059 else
3060 add_builtin_candidate
3061 (candidates, code, code2, fnname, t,
3062 NULL_TREE, args, argtypes, flags, complain);
3065 release_tree_vector (types[0]);
3066 release_tree_vector (types[1]);
3070 /* If TMPL can be successfully instantiated as indicated by
3071 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3073 TMPL is the template. EXPLICIT_TARGS are any explicit template
3074 arguments. ARGLIST is the arguments provided at the call-site.
3075 This does not change ARGLIST. The RETURN_TYPE is the desired type
3076 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3077 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3078 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3080 static struct z_candidate*
3081 add_template_candidate_real (struct z_candidate **candidates, tree tmpl,
3082 tree ctype, tree explicit_targs, tree first_arg,
3083 const vec<tree, va_gc> *arglist, tree return_type,
3084 tree access_path, tree conversion_path,
3085 int flags, tree obj, unification_kind_t strict,
3086 tsubst_flags_t complain)
3088 int ntparms = DECL_NTPARMS (tmpl);
3089 tree targs = make_tree_vec (ntparms);
3090 unsigned int len = vec_safe_length (arglist);
3091 unsigned int nargs = (first_arg == NULL_TREE ? 0 : 1) + len;
3092 unsigned int skip_without_in_chrg = 0;
3093 tree first_arg_without_in_chrg = first_arg;
3094 tree *args_without_in_chrg;
3095 unsigned int nargs_without_in_chrg;
3096 unsigned int ia, ix;
3097 tree arg;
3098 struct z_candidate *cand;
3099 tree fn;
3100 struct rejection_reason *reason = NULL;
3101 int errs;
3103 /* We don't do deduction on the in-charge parameter, the VTT
3104 parameter or 'this'. */
3105 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl))
3107 if (first_arg_without_in_chrg != NULL_TREE)
3108 first_arg_without_in_chrg = NULL_TREE;
3109 else if (return_type && strict == DEDUCE_CALL)
3110 /* We're deducing for a call to the result of a template conversion
3111 function, so the args don't contain 'this'; leave them alone. */;
3112 else
3113 ++skip_without_in_chrg;
3116 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl)
3117 || DECL_BASE_CONSTRUCTOR_P (tmpl))
3118 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl)))
3120 if (first_arg_without_in_chrg != NULL_TREE)
3121 first_arg_without_in_chrg = NULL_TREE;
3122 else
3123 ++skip_without_in_chrg;
3126 if (len < skip_without_in_chrg)
3127 return NULL;
3129 if (DECL_CONSTRUCTOR_P (tmpl) && nargs == 2
3130 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg),
3131 TREE_TYPE ((*arglist)[0])))
3133 /* 12.8/6 says, "A declaration of a constructor for a class X is
3134 ill-formed if its first parameter is of type (optionally cv-qualified)
3135 X and either there are no other parameters or else all other
3136 parameters have default arguments. A member function template is never
3137 instantiated to produce such a constructor signature."
3139 So if we're trying to copy an object of the containing class, don't
3140 consider a template constructor that has a first parameter type that
3141 is just a template parameter, as we would deduce a signature that we
3142 would then reject in the code below. */
3143 if (tree firstparm = FUNCTION_FIRST_USER_PARMTYPE (tmpl))
3145 firstparm = TREE_VALUE (firstparm);
3146 if (PACK_EXPANSION_P (firstparm))
3147 firstparm = PACK_EXPANSION_PATTERN (firstparm);
3148 if (TREE_CODE (firstparm) == TEMPLATE_TYPE_PARM)
3150 gcc_assert (!explicit_targs);
3151 reason = invalid_copy_with_fn_template_rejection ();
3152 goto fail;
3157 nargs_without_in_chrg = ((first_arg_without_in_chrg != NULL_TREE ? 1 : 0)
3158 + (len - skip_without_in_chrg));
3159 args_without_in_chrg = XALLOCAVEC (tree, nargs_without_in_chrg);
3160 ia = 0;
3161 if (first_arg_without_in_chrg != NULL_TREE)
3163 args_without_in_chrg[ia] = first_arg_without_in_chrg;
3164 ++ia;
3166 for (ix = skip_without_in_chrg;
3167 vec_safe_iterate (arglist, ix, &arg);
3168 ++ix)
3170 args_without_in_chrg[ia] = arg;
3171 ++ia;
3173 gcc_assert (ia == nargs_without_in_chrg);
3175 errs = errorcount+sorrycount;
3176 fn = fn_type_unification (tmpl, explicit_targs, targs,
3177 args_without_in_chrg,
3178 nargs_without_in_chrg,
3179 return_type, strict, flags, false,
3180 complain & tf_decltype);
3182 if (fn == error_mark_node)
3184 /* Don't repeat unification later if it already resulted in errors. */
3185 if (errorcount+sorrycount == errs)
3186 reason = template_unification_rejection (tmpl, explicit_targs,
3187 targs, args_without_in_chrg,
3188 nargs_without_in_chrg,
3189 return_type, strict, flags);
3190 else
3191 reason = template_unification_error_rejection ();
3192 goto fail;
3195 if (DECL_CONSTRUCTOR_P (fn) && nargs == 2)
3197 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (fn);
3198 if (arg_types && same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types)),
3199 ctype))
3201 /* We're trying to produce a constructor with a prohibited signature,
3202 as discussed above; handle here any cases we didn't catch then,
3203 such as X(X<T>). */
3204 reason = invalid_copy_with_fn_template_rejection ();
3205 goto fail;
3209 if (obj != NULL_TREE)
3210 /* Aha, this is a conversion function. */
3211 cand = add_conv_candidate (candidates, fn, obj, arglist,
3212 access_path, conversion_path, complain);
3213 else
3214 cand = add_function_candidate (candidates, fn, ctype,
3215 first_arg, arglist, access_path,
3216 conversion_path, flags, complain);
3217 if (DECL_TI_TEMPLATE (fn) != tmpl)
3218 /* This situation can occur if a member template of a template
3219 class is specialized. Then, instantiate_template might return
3220 an instantiation of the specialization, in which case the
3221 DECL_TI_TEMPLATE field will point at the original
3222 specialization. For example:
3224 template <class T> struct S { template <class U> void f(U);
3225 template <> void f(int) {}; };
3226 S<double> sd;
3227 sd.f(3);
3229 Here, TMPL will be template <class U> S<double>::f(U).
3230 And, instantiate template will give us the specialization
3231 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3232 for this will point at template <class T> template <> S<T>::f(int),
3233 so that we can find the definition. For the purposes of
3234 overload resolution, however, we want the original TMPL. */
3235 cand->template_decl = build_template_info (tmpl, targs);
3236 else
3237 cand->template_decl = DECL_TEMPLATE_INFO (fn);
3238 cand->explicit_targs = explicit_targs;
3240 return cand;
3241 fail:
3242 return add_candidate (candidates, tmpl, first_arg, arglist, nargs, NULL,
3243 access_path, conversion_path, 0, reason, flags);
3247 static struct z_candidate *
3248 add_template_candidate (struct z_candidate **candidates, tree tmpl, tree ctype,
3249 tree explicit_targs, tree first_arg,
3250 const vec<tree, va_gc> *arglist, tree return_type,
3251 tree access_path, tree conversion_path, int flags,
3252 unification_kind_t strict, tsubst_flags_t complain)
3254 return
3255 add_template_candidate_real (candidates, tmpl, ctype,
3256 explicit_targs, first_arg, arglist,
3257 return_type, access_path, conversion_path,
3258 flags, NULL_TREE, strict, complain);
3261 /* Create an overload candidate for the conversion function template TMPL,
3262 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3263 pointer-to-function which will in turn be called with the argument list
3264 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3265 passed on to implicit_conversion. */
3267 static struct z_candidate *
3268 add_template_conv_candidate (struct z_candidate **candidates, tree tmpl,
3269 tree obj,
3270 const vec<tree, va_gc> *arglist,
3271 tree return_type, tree access_path,
3272 tree conversion_path, tsubst_flags_t complain)
3274 /* Making this work broke PR 71117, so until the committee resolves core
3275 issue 2189, let's disable this candidate if there are any viable call
3276 operators. */
3277 if (any_strictly_viable (*candidates))
3278 return NULL;
3280 return
3281 add_template_candidate_real (candidates, tmpl, NULL_TREE, NULL_TREE,
3282 NULL_TREE, arglist, return_type, access_path,
3283 conversion_path, 0, obj, DEDUCE_CALL,
3284 complain);
3287 /* The CANDS are the set of candidates that were considered for
3288 overload resolution. Return the set of viable candidates, or CANDS
3289 if none are viable. If any of the candidates were viable, set
3290 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3291 considered viable only if it is strictly viable. */
3293 static struct z_candidate*
3294 splice_viable (struct z_candidate *cands,
3295 bool strict_p,
3296 bool *any_viable_p)
3298 struct z_candidate *viable;
3299 struct z_candidate **last_viable;
3300 struct z_candidate **cand;
3301 bool found_strictly_viable = false;
3303 /* Be strict inside templates, since build_over_call won't actually
3304 do the conversions to get pedwarns. */
3305 if (processing_template_decl)
3306 strict_p = true;
3308 viable = NULL;
3309 last_viable = &viable;
3310 *any_viable_p = false;
3312 cand = &cands;
3313 while (*cand)
3315 struct z_candidate *c = *cand;
3316 if (!strict_p
3317 && (c->viable == 1 || TREE_CODE (c->fn) == TEMPLATE_DECL))
3319 /* Be strict in the presence of a viable candidate. Also if
3320 there are template candidates, so that we get deduction errors
3321 for them instead of silently preferring a bad conversion. */
3322 strict_p = true;
3323 if (viable && !found_strictly_viable)
3325 /* Put any spliced near matches back onto the main list so
3326 that we see them if there is no strict match. */
3327 *any_viable_p = false;
3328 *last_viable = cands;
3329 cands = viable;
3330 viable = NULL;
3331 last_viable = &viable;
3335 if (strict_p ? c->viable == 1 : c->viable)
3337 *last_viable = c;
3338 *cand = c->next;
3339 c->next = NULL;
3340 last_viable = &c->next;
3341 *any_viable_p = true;
3342 if (c->viable == 1)
3343 found_strictly_viable = true;
3345 else
3346 cand = &c->next;
3349 return viable ? viable : cands;
3352 static bool
3353 any_strictly_viable (struct z_candidate *cands)
3355 for (; cands; cands = cands->next)
3356 if (cands->viable == 1)
3357 return true;
3358 return false;
3361 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3362 words, it is about to become the "this" pointer for a member
3363 function call. Take the address of the object. */
3365 static tree
3366 build_this (tree obj)
3368 /* In a template, we are only concerned about the type of the
3369 expression, so we can take a shortcut. */
3370 if (processing_template_decl)
3371 return build_address (obj);
3373 return cp_build_addr_expr (obj, tf_warning_or_error);
3376 /* Returns true iff functions are equivalent. Equivalent functions are
3377 not '==' only if one is a function-local extern function or if
3378 both are extern "C". */
3380 static inline int
3381 equal_functions (tree fn1, tree fn2)
3383 if (TREE_CODE (fn1) != TREE_CODE (fn2))
3384 return 0;
3385 if (TREE_CODE (fn1) == TEMPLATE_DECL)
3386 return fn1 == fn2;
3387 if (DECL_LOCAL_FUNCTION_P (fn1) || DECL_LOCAL_FUNCTION_P (fn2)
3388 || DECL_EXTERN_C_FUNCTION_P (fn1))
3389 return decls_match (fn1, fn2);
3390 return fn1 == fn2;
3393 /* Print information about a candidate being rejected due to INFO. */
3395 static void
3396 print_conversion_rejection (location_t loc, struct conversion_info *info)
3398 tree from = info->from;
3399 if (!TYPE_P (from))
3400 from = lvalue_type (from);
3401 if (info->n_arg == -1)
3403 /* Conversion of implicit `this' argument failed. */
3404 if (!TYPE_P (info->from))
3405 /* A bad conversion for 'this' must be discarding cv-quals. */
3406 inform (loc, " passing %qT as %<this%> "
3407 "argument discards qualifiers",
3408 from);
3409 else
3410 inform (loc, " no known conversion for implicit "
3411 "%<this%> parameter from %qH to %qI",
3412 from, info->to_type);
3414 else if (!TYPE_P (info->from))
3416 if (info->n_arg >= 0)
3417 inform (loc, " conversion of argument %d would be ill-formed:",
3418 info->n_arg + 1);
3419 perform_implicit_conversion (info->to_type, info->from,
3420 tf_warning_or_error);
3422 else if (info->n_arg == -2)
3423 /* Conversion of conversion function return value failed. */
3424 inform (loc, " no known conversion from %qH to %qI",
3425 from, info->to_type);
3426 else
3427 inform (loc, " no known conversion for argument %d from %qH to %qI",
3428 info->n_arg + 1, from, info->to_type);
3431 /* Print information about a candidate with WANT parameters and we found
3432 HAVE. */
3434 static void
3435 print_arity_information (location_t loc, unsigned int have, unsigned int want)
3437 inform_n (loc, want,
3438 " candidate expects %d argument, %d provided",
3439 " candidate expects %d arguments, %d provided",
3440 want, have);
3443 /* Print information about one overload candidate CANDIDATE. MSGSTR
3444 is the text to print before the candidate itself.
3446 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3447 to have been run through gettext by the caller. This wart makes
3448 life simpler in print_z_candidates and for the translators. */
3450 static void
3451 print_z_candidate (location_t loc, const char *msgstr,
3452 struct z_candidate *candidate)
3454 const char *msg = (msgstr == NULL
3455 ? ""
3456 : ACONCAT ((msgstr, " ", NULL)));
3457 tree fn = candidate->fn;
3458 if (flag_new_inheriting_ctors)
3459 fn = strip_inheriting_ctors (fn);
3460 location_t cloc = location_of (fn);
3462 if (identifier_p (fn))
3464 cloc = loc;
3465 if (candidate->num_convs == 3)
3466 inform (cloc, "%s%<%D(%T, %T, %T)%> <built-in>", msg, fn,
3467 candidate->convs[0]->type,
3468 candidate->convs[1]->type,
3469 candidate->convs[2]->type);
3470 else if (candidate->num_convs == 2)
3471 inform (cloc, "%s%<%D(%T, %T)%> <built-in>", msg, fn,
3472 candidate->convs[0]->type,
3473 candidate->convs[1]->type);
3474 else
3475 inform (cloc, "%s%<%D(%T)%> <built-in>", msg, fn,
3476 candidate->convs[0]->type);
3478 else if (TYPE_P (fn))
3479 inform (cloc, "%s%qT <conversion>", msg, fn);
3480 else if (candidate->viable == -1)
3481 inform (cloc, "%s%#qD <near match>", msg, fn);
3482 else if (DECL_DELETED_FN (fn))
3483 inform (cloc, "%s%#qD <deleted>", msg, fn);
3484 else
3485 inform (cloc, "%s%#qD", msg, fn);
3486 if (fn != candidate->fn)
3488 cloc = location_of (candidate->fn);
3489 inform (cloc, " inherited here");
3491 /* Give the user some information about why this candidate failed. */
3492 if (candidate->reason != NULL)
3494 struct rejection_reason *r = candidate->reason;
3496 switch (r->code)
3498 case rr_arity:
3499 print_arity_information (cloc, r->u.arity.actual,
3500 r->u.arity.expected);
3501 break;
3502 case rr_arg_conversion:
3503 print_conversion_rejection (cloc, &r->u.conversion);
3504 break;
3505 case rr_bad_arg_conversion:
3506 print_conversion_rejection (cloc, &r->u.bad_conversion);
3507 break;
3508 case rr_explicit_conversion:
3509 inform (cloc, " return type %qT of explicit conversion function "
3510 "cannot be converted to %qT with a qualification "
3511 "conversion", r->u.conversion.from,
3512 r->u.conversion.to_type);
3513 break;
3514 case rr_template_conversion:
3515 inform (cloc, " conversion from return type %qT of template "
3516 "conversion function specialization to %qT is not an "
3517 "exact match", r->u.conversion.from,
3518 r->u.conversion.to_type);
3519 break;
3520 case rr_template_unification:
3521 /* We use template_unification_error_rejection if unification caused
3522 actual non-SFINAE errors, in which case we don't need to repeat
3523 them here. */
3524 if (r->u.template_unification.tmpl == NULL_TREE)
3526 inform (cloc, " substitution of deduced template arguments "
3527 "resulted in errors seen above");
3528 break;
3530 /* Re-run template unification with diagnostics. */
3531 inform (cloc, " template argument deduction/substitution failed:");
3532 fn_type_unification (r->u.template_unification.tmpl,
3533 r->u.template_unification.explicit_targs,
3534 (make_tree_vec
3535 (r->u.template_unification.num_targs)),
3536 r->u.template_unification.args,
3537 r->u.template_unification.nargs,
3538 r->u.template_unification.return_type,
3539 r->u.template_unification.strict,
3540 r->u.template_unification.flags,
3541 true, false);
3542 break;
3543 case rr_invalid_copy:
3544 inform (cloc,
3545 " a constructor taking a single argument of its own "
3546 "class type is invalid");
3547 break;
3548 case rr_constraint_failure:
3550 tree tmpl = r->u.template_instantiation.tmpl;
3551 tree args = r->u.template_instantiation.targs;
3552 diagnose_constraints (cloc, tmpl, args);
3554 break;
3555 case rr_inherited_ctor:
3556 inform (cloc, " an inherited constructor is not a candidate for "
3557 "initialization from an expression of the same or derived "
3558 "type");
3559 break;
3560 case rr_none:
3561 default:
3562 /* This candidate didn't have any issues or we failed to
3563 handle a particular code. Either way... */
3564 gcc_unreachable ();
3569 static void
3570 print_z_candidates (location_t loc, struct z_candidate *candidates)
3572 struct z_candidate *cand1;
3573 struct z_candidate **cand2;
3575 if (!candidates)
3576 return;
3578 /* Remove non-viable deleted candidates. */
3579 cand1 = candidates;
3580 for (cand2 = &cand1; *cand2; )
3582 if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL
3583 && !(*cand2)->viable
3584 && DECL_DELETED_FN ((*cand2)->fn))
3585 *cand2 = (*cand2)->next;
3586 else
3587 cand2 = &(*cand2)->next;
3589 /* ...if there are any non-deleted ones. */
3590 if (cand1)
3591 candidates = cand1;
3593 /* There may be duplicates in the set of candidates. We put off
3594 checking this condition as long as possible, since we have no way
3595 to eliminate duplicates from a set of functions in less than n^2
3596 time. Now we are about to emit an error message, so it is more
3597 permissible to go slowly. */
3598 for (cand1 = candidates; cand1; cand1 = cand1->next)
3600 tree fn = cand1->fn;
3601 /* Skip builtin candidates and conversion functions. */
3602 if (!DECL_P (fn))
3603 continue;
3604 cand2 = &cand1->next;
3605 while (*cand2)
3607 if (DECL_P ((*cand2)->fn)
3608 && equal_functions (fn, (*cand2)->fn))
3609 *cand2 = (*cand2)->next;
3610 else
3611 cand2 = &(*cand2)->next;
3615 for (; candidates; candidates = candidates->next)
3616 print_z_candidate (loc, "candidate:", candidates);
3619 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3620 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3621 the result of the conversion function to convert it to the final
3622 desired type. Merge the two sequences into a single sequence,
3623 and return the merged sequence. */
3625 static conversion *
3626 merge_conversion_sequences (conversion *user_seq, conversion *std_seq)
3628 conversion **t;
3629 bool bad = user_seq->bad_p;
3631 gcc_assert (user_seq->kind == ck_user);
3633 /* Find the end of the second conversion sequence. */
3634 for (t = &std_seq; (*t)->kind != ck_identity; t = &((*t)->u.next))
3636 /* The entire sequence is a user-conversion sequence. */
3637 (*t)->user_conv_p = true;
3638 if (bad)
3639 (*t)->bad_p = true;
3642 /* Replace the identity conversion with the user conversion
3643 sequence. */
3644 *t = user_seq;
3646 return std_seq;
3649 /* Handle overload resolution for initializing an object of class type from
3650 an initializer list. First we look for a suitable constructor that
3651 takes a std::initializer_list; if we don't find one, we then look for a
3652 non-list constructor.
3654 Parameters are as for add_candidates, except that the arguments are in
3655 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3656 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3658 static void
3659 add_list_candidates (tree fns, tree first_arg,
3660 const vec<tree, va_gc> *args, tree totype,
3661 tree explicit_targs, bool template_only,
3662 tree conversion_path, tree access_path,
3663 int flags,
3664 struct z_candidate **candidates,
3665 tsubst_flags_t complain)
3667 gcc_assert (*candidates == NULL);
3669 /* We're looking for a ctor for list-initialization. */
3670 flags |= LOOKUP_LIST_INIT_CTOR;
3671 /* And we don't allow narrowing conversions. We also use this flag to
3672 avoid the copy constructor call for copy-list-initialization. */
3673 flags |= LOOKUP_NO_NARROWING;
3675 unsigned nart = num_artificial_parms_for (OVL_FIRST (fns)) - 1;
3676 tree init_list = (*args)[nart];
3678 /* Always use the default constructor if the list is empty (DR 990). */
3679 if (CONSTRUCTOR_NELTS (init_list) == 0
3680 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
3682 /* If the class has a list ctor, try passing the list as a single
3683 argument first, but only consider list ctors. */
3684 else if (TYPE_HAS_LIST_CTOR (totype))
3686 flags |= LOOKUP_LIST_ONLY;
3687 add_candidates (fns, first_arg, args, NULL_TREE,
3688 explicit_targs, template_only, conversion_path,
3689 access_path, flags, candidates, complain);
3690 if (any_strictly_viable (*candidates))
3691 return;
3694 /* Expand the CONSTRUCTOR into a new argument vec. */
3695 vec<tree, va_gc> *new_args;
3696 vec_alloc (new_args, nart + CONSTRUCTOR_NELTS (init_list));
3697 for (unsigned i = 0; i < nart; ++i)
3698 new_args->quick_push ((*args)[i]);
3699 for (unsigned i = 0; i < CONSTRUCTOR_NELTS (init_list); ++i)
3700 new_args->quick_push (CONSTRUCTOR_ELT (init_list, i)->value);
3702 /* We aren't looking for list-ctors anymore. */
3703 flags &= ~LOOKUP_LIST_ONLY;
3704 /* We allow more user-defined conversions within an init-list. */
3705 flags &= ~LOOKUP_NO_CONVERSION;
3707 add_candidates (fns, first_arg, new_args, NULL_TREE,
3708 explicit_targs, template_only, conversion_path,
3709 access_path, flags, candidates, complain);
3712 /* Returns the best overload candidate to perform the requested
3713 conversion. This function is used for three the overloading situations
3714 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3715 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3716 per [dcl.init.ref], so we ignore temporary bindings. */
3718 static struct z_candidate *
3719 build_user_type_conversion_1 (tree totype, tree expr, int flags,
3720 tsubst_flags_t complain)
3722 struct z_candidate *candidates, *cand;
3723 tree fromtype;
3724 tree ctors = NULL_TREE;
3725 tree conv_fns = NULL_TREE;
3726 conversion *conv = NULL;
3727 tree first_arg = NULL_TREE;
3728 vec<tree, va_gc> *args = NULL;
3729 bool any_viable_p;
3730 int convflags;
3732 if (!expr)
3733 return NULL;
3735 fromtype = TREE_TYPE (expr);
3737 /* We represent conversion within a hierarchy using RVALUE_CONV and
3738 BASE_CONV, as specified by [over.best.ics]; these become plain
3739 constructor calls, as specified in [dcl.init]. */
3740 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype) || !MAYBE_CLASS_TYPE_P (totype)
3741 || !DERIVED_FROM_P (totype, fromtype));
3743 if (CLASS_TYPE_P (totype))
3744 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3745 creating a garbage BASELINK; constructors can't be inherited. */
3746 ctors = get_class_binding (totype, complete_ctor_identifier);
3748 /* FIXME P0135 doesn't say what to do in C++17 about list-initialization from
3749 a single element. For now, let's handle constructors as before and also
3750 consider conversion operators from the element. */
3751 if (cxx_dialect >= cxx17
3752 && BRACE_ENCLOSED_INITIALIZER_P (expr)
3753 && CONSTRUCTOR_NELTS (expr) == 1)
3754 fromtype = TREE_TYPE (CONSTRUCTOR_ELT (expr, 0)->value);
3756 if (MAYBE_CLASS_TYPE_P (fromtype))
3758 tree to_nonref = non_reference (totype);
3759 if (same_type_ignoring_top_level_qualifiers_p (to_nonref, fromtype) ||
3760 (CLASS_TYPE_P (to_nonref) && CLASS_TYPE_P (fromtype)
3761 && DERIVED_FROM_P (to_nonref, fromtype)))
3763 /* [class.conv.fct] A conversion function is never used to
3764 convert a (possibly cv-qualified) object to the (possibly
3765 cv-qualified) same object type (or a reference to it), to a
3766 (possibly cv-qualified) base class of that type (or a
3767 reference to it)... */
3769 else
3770 conv_fns = lookup_conversions (fromtype);
3773 candidates = 0;
3774 flags |= LOOKUP_NO_CONVERSION;
3775 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3776 flags |= LOOKUP_NO_NARROWING;
3778 /* It's OK to bind a temporary for converting constructor arguments, but
3779 not in converting the return value of a conversion operator. */
3780 convflags = ((flags & LOOKUP_NO_TEMP_BIND) | LOOKUP_NO_CONVERSION
3781 | (flags & LOOKUP_NO_NARROWING));
3782 flags &= ~LOOKUP_NO_TEMP_BIND;
3784 if (ctors)
3786 int ctorflags = flags;
3788 first_arg = build_dummy_object (totype);
3790 /* We should never try to call the abstract or base constructor
3791 from here. */
3792 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors))
3793 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors)));
3795 args = make_tree_vector_single (expr);
3796 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3798 /* List-initialization. */
3799 add_list_candidates (ctors, first_arg, args, totype, NULL_TREE,
3800 false, TYPE_BINFO (totype), TYPE_BINFO (totype),
3801 ctorflags, &candidates, complain);
3803 else
3805 add_candidates (ctors, first_arg, args, NULL_TREE, NULL_TREE, false,
3806 TYPE_BINFO (totype), TYPE_BINFO (totype),
3807 ctorflags, &candidates, complain);
3810 for (cand = candidates; cand; cand = cand->next)
3812 cand->second_conv = build_identity_conv (totype, NULL_TREE);
3814 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3815 set, then this is copy-initialization. In that case, "The
3816 result of the call is then used to direct-initialize the
3817 object that is the destination of the copy-initialization."
3818 [dcl.init]
3820 We represent this in the conversion sequence with an
3821 rvalue conversion, which means a constructor call. */
3822 if (TREE_CODE (totype) != REFERENCE_TYPE
3823 && !(convflags & LOOKUP_NO_TEMP_BIND))
3824 cand->second_conv
3825 = build_conv (ck_rvalue, totype, cand->second_conv);
3829 if (conv_fns)
3831 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3832 /* FIXME see above about C++17. */
3833 first_arg = CONSTRUCTOR_ELT (expr, 0)->value;
3834 else
3835 first_arg = expr;
3838 for (; conv_fns; conv_fns = TREE_CHAIN (conv_fns))
3840 tree conversion_path = TREE_PURPOSE (conv_fns);
3841 struct z_candidate *old_candidates;
3843 /* If we are called to convert to a reference type, we are trying to
3844 find a direct binding, so don't even consider temporaries. If
3845 we don't find a direct binding, the caller will try again to
3846 look for a temporary binding. */
3847 if (TREE_CODE (totype) == REFERENCE_TYPE)
3848 convflags |= LOOKUP_NO_TEMP_BIND;
3850 old_candidates = candidates;
3851 add_candidates (TREE_VALUE (conv_fns), first_arg, NULL, totype,
3852 NULL_TREE, false,
3853 conversion_path, TYPE_BINFO (fromtype),
3854 flags, &candidates, complain);
3856 for (cand = candidates; cand != old_candidates; cand = cand->next)
3858 tree rettype = TREE_TYPE (TREE_TYPE (cand->fn));
3859 conversion *ics
3860 = implicit_conversion (totype,
3861 rettype,
3863 /*c_cast_p=*/false, convflags,
3864 complain);
3866 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3867 copy-initialization. In that case, "The result of the
3868 call is then used to direct-initialize the object that is
3869 the destination of the copy-initialization." [dcl.init]
3871 We represent this in the conversion sequence with an
3872 rvalue conversion, which means a constructor call. But
3873 don't add a second rvalue conversion if there's already
3874 one there. Which there really shouldn't be, but it's
3875 harmless since we'd add it here anyway. */
3876 if (ics && MAYBE_CLASS_TYPE_P (totype) && ics->kind != ck_rvalue
3877 && !(convflags & LOOKUP_NO_TEMP_BIND))
3878 ics = build_conv (ck_rvalue, totype, ics);
3880 cand->second_conv = ics;
3882 if (!ics)
3884 cand->viable = 0;
3885 cand->reason = arg_conversion_rejection (NULL_TREE, -2,
3886 rettype, totype);
3888 else if (DECL_NONCONVERTING_P (cand->fn)
3889 && ics->rank > cr_exact)
3891 /* 13.3.1.5: For direct-initialization, those explicit
3892 conversion functions that are not hidden within S and
3893 yield type T or a type that can be converted to type T
3894 with a qualification conversion (4.4) are also candidate
3895 functions. */
3896 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3897 I've raised this issue with the committee. --jason 9/2011 */
3898 cand->viable = -1;
3899 cand->reason = explicit_conversion_rejection (rettype, totype);
3901 else if (cand->viable == 1 && ics->bad_p)
3903 cand->viable = -1;
3904 cand->reason
3905 = bad_arg_conversion_rejection (NULL_TREE, -2,
3906 rettype, totype);
3908 else if (primary_template_specialization_p (cand->fn)
3909 && ics->rank > cr_exact)
3911 /* 13.3.3.1.2: If the user-defined conversion is specified by
3912 a specialization of a conversion function template, the
3913 second standard conversion sequence shall have exact match
3914 rank. */
3915 cand->viable = -1;
3916 cand->reason = template_conversion_rejection (rettype, totype);
3921 candidates = splice_viable (candidates, false, &any_viable_p);
3922 if (!any_viable_p)
3924 if (args)
3925 release_tree_vector (args);
3926 return NULL;
3929 cand = tourney (candidates, complain);
3930 if (cand == 0)
3932 if (complain & tf_error)
3934 error ("conversion from %qH to %qI is ambiguous",
3935 fromtype, totype);
3936 print_z_candidates (location_of (expr), candidates);
3939 cand = candidates; /* any one will do */
3940 cand->second_conv = build_ambiguous_conv (totype, expr);
3941 cand->second_conv->user_conv_p = true;
3942 if (!any_strictly_viable (candidates))
3943 cand->second_conv->bad_p = true;
3944 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3945 ambiguous conversion is no worse than another user-defined
3946 conversion. */
3948 return cand;
3951 tree convtype;
3952 if (!DECL_CONSTRUCTOR_P (cand->fn))
3953 convtype = non_reference (TREE_TYPE (TREE_TYPE (cand->fn)));
3954 else if (cand->second_conv->kind == ck_rvalue)
3955 /* DR 5: [in the first step of copy-initialization]...if the function
3956 is a constructor, the call initializes a temporary of the
3957 cv-unqualified version of the destination type. */
3958 convtype = cv_unqualified (totype);
3959 else
3960 convtype = totype;
3961 /* Build the user conversion sequence. */
3962 conv = build_conv
3963 (ck_user,
3964 convtype,
3965 build_identity_conv (TREE_TYPE (expr), expr));
3966 conv->cand = cand;
3967 if (cand->viable == -1)
3968 conv->bad_p = true;
3970 /* Remember that this was a list-initialization. */
3971 if (flags & LOOKUP_NO_NARROWING)
3972 conv->check_narrowing = true;
3974 /* Combine it with the second conversion sequence. */
3975 cand->second_conv = merge_conversion_sequences (conv,
3976 cand->second_conv);
3978 return cand;
3981 /* Wrapper for above. */
3983 tree
3984 build_user_type_conversion (tree totype, tree expr, int flags,
3985 tsubst_flags_t complain)
3987 struct z_candidate *cand;
3988 tree ret;
3990 bool subtime = timevar_cond_start (TV_OVERLOAD);
3991 cand = build_user_type_conversion_1 (totype, expr, flags, complain);
3993 if (cand)
3995 if (cand->second_conv->kind == ck_ambig)
3996 ret = error_mark_node;
3997 else
3999 expr = convert_like (cand->second_conv, expr, complain);
4000 ret = convert_from_reference (expr);
4003 else
4004 ret = NULL_TREE;
4006 timevar_cond_stop (TV_OVERLOAD, subtime);
4007 return ret;
4010 /* Subroutine of convert_nontype_argument.
4012 EXPR is an expression used in a context that requires a converted
4013 constant-expression, such as a template non-type parameter. Do any
4014 necessary conversions (that are permitted for converted
4015 constant-expressions) to convert it to the desired type.
4017 If conversion is successful, returns the converted expression;
4018 otherwise, returns error_mark_node. */
4020 tree
4021 build_converted_constant_expr (tree type, tree expr, tsubst_flags_t complain)
4023 conversion *conv;
4024 void *p;
4025 tree t;
4026 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
4028 if (error_operand_p (expr))
4029 return error_mark_node;
4031 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4032 p = conversion_obstack_alloc (0);
4034 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
4035 /*c_cast_p=*/false,
4036 LOOKUP_IMPLICIT, complain);
4038 /* A converted constant expression of type T is an expression, implicitly
4039 converted to type T, where the converted expression is a constant
4040 expression and the implicit conversion sequence contains only
4042 * user-defined conversions,
4043 * lvalue-to-rvalue conversions (7.1),
4044 * array-to-pointer conversions (7.2),
4045 * function-to-pointer conversions (7.3),
4046 * qualification conversions (7.5),
4047 * integral promotions (7.6),
4048 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4049 * null pointer conversions (7.11) from std::nullptr_t,
4050 * null member pointer conversions (7.12) from std::nullptr_t, and
4051 * function pointer conversions (7.13),
4053 and where the reference binding (if any) binds directly. */
4055 for (conversion *c = conv;
4056 conv && c->kind != ck_identity;
4057 c = next_conversion (c))
4059 switch (c->kind)
4061 /* A conversion function is OK. If it isn't constexpr, we'll
4062 complain later that the argument isn't constant. */
4063 case ck_user:
4064 /* The lvalue-to-rvalue conversion is OK. */
4065 case ck_rvalue:
4066 /* Array-to-pointer and function-to-pointer. */
4067 case ck_lvalue:
4068 /* Function pointer conversions. */
4069 case ck_fnptr:
4070 /* Qualification conversions. */
4071 case ck_qual:
4072 break;
4074 case ck_ref_bind:
4075 if (c->need_temporary_p)
4077 if (complain & tf_error)
4078 error_at (loc, "initializing %qH with %qI in converted "
4079 "constant expression does not bind directly",
4080 type, next_conversion (c)->type);
4081 conv = NULL;
4083 break;
4085 case ck_base:
4086 case ck_pmem:
4087 case ck_ptr:
4088 case ck_std:
4089 t = next_conversion (c)->type;
4090 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t)
4091 && INTEGRAL_OR_ENUMERATION_TYPE_P (type))
4092 /* Integral promotion or conversion. */
4093 break;
4094 if (NULLPTR_TYPE_P (t))
4095 /* Conversion from nullptr to pointer or pointer-to-member. */
4096 break;
4098 if (complain & tf_error)
4099 error_at (loc, "conversion from %qH to %qI in a "
4100 "converted constant expression", t, type);
4101 /* fall through. */
4103 default:
4104 conv = NULL;
4105 break;
4109 /* Avoid confusing convert_nontype_argument by introducing
4110 a redundant conversion to the same reference type. */
4111 if (conv && conv->kind == ck_ref_bind
4112 && REFERENCE_REF_P (expr))
4114 tree ref = TREE_OPERAND (expr, 0);
4115 if (same_type_p (type, TREE_TYPE (ref)))
4116 return ref;
4119 if (conv)
4120 expr = convert_like (conv, expr, complain);
4121 else
4122 expr = error_mark_node;
4124 /* Free all the conversions we allocated. */
4125 obstack_free (&conversion_obstack, p);
4127 return expr;
4130 /* Do any initial processing on the arguments to a function call. */
4132 static vec<tree, va_gc> *
4133 resolve_args (vec<tree, va_gc> *args, tsubst_flags_t complain)
4135 unsigned int ix;
4136 tree arg;
4138 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
4140 if (error_operand_p (arg))
4141 return NULL;
4142 else if (VOID_TYPE_P (TREE_TYPE (arg)))
4144 if (complain & tf_error)
4145 error ("invalid use of void expression");
4146 return NULL;
4148 else if (invalid_nonstatic_memfn_p (input_location, arg, complain))
4149 return NULL;
4151 return args;
4154 /* Perform overload resolution on FN, which is called with the ARGS.
4156 Return the candidate function selected by overload resolution, or
4157 NULL if the event that overload resolution failed. In the case
4158 that overload resolution fails, *CANDIDATES will be the set of
4159 candidates considered, and ANY_VIABLE_P will be set to true or
4160 false to indicate whether or not any of the candidates were
4161 viable.
4163 The ARGS should already have gone through RESOLVE_ARGS before this
4164 function is called. */
4166 static struct z_candidate *
4167 perform_overload_resolution (tree fn,
4168 const vec<tree, va_gc> *args,
4169 struct z_candidate **candidates,
4170 bool *any_viable_p, tsubst_flags_t complain)
4172 struct z_candidate *cand;
4173 tree explicit_targs;
4174 int template_only;
4176 bool subtime = timevar_cond_start (TV_OVERLOAD);
4178 explicit_targs = NULL_TREE;
4179 template_only = 0;
4181 *candidates = NULL;
4182 *any_viable_p = true;
4184 /* Check FN. */
4185 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
4186 || TREE_CODE (fn) == TEMPLATE_DECL
4187 || TREE_CODE (fn) == OVERLOAD
4188 || TREE_CODE (fn) == TEMPLATE_ID_EXPR);
4190 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4192 explicit_targs = TREE_OPERAND (fn, 1);
4193 fn = TREE_OPERAND (fn, 0);
4194 template_only = 1;
4197 /* Add the various candidate functions. */
4198 add_candidates (fn, NULL_TREE, args, NULL_TREE,
4199 explicit_targs, template_only,
4200 /*conversion_path=*/NULL_TREE,
4201 /*access_path=*/NULL_TREE,
4202 LOOKUP_NORMAL,
4203 candidates, complain);
4205 *candidates = splice_viable (*candidates, false, any_viable_p);
4206 if (*any_viable_p)
4207 cand = tourney (*candidates, complain);
4208 else
4209 cand = NULL;
4211 timevar_cond_stop (TV_OVERLOAD, subtime);
4212 return cand;
4215 /* Print an error message about being unable to build a call to FN with
4216 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4217 be located; CANDIDATES is a possibly empty list of such
4218 functions. */
4220 static void
4221 print_error_for_call_failure (tree fn, vec<tree, va_gc> *args,
4222 struct z_candidate *candidates)
4224 tree targs = NULL_TREE;
4225 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4227 targs = TREE_OPERAND (fn, 1);
4228 fn = TREE_OPERAND (fn, 0);
4230 tree name = OVL_NAME (fn);
4231 location_t loc = location_of (name);
4232 if (targs)
4233 name = lookup_template_function (name, targs);
4235 if (!any_strictly_viable (candidates))
4236 error_at (loc, "no matching function for call to %<%D(%A)%>",
4237 name, build_tree_list_vec (args));
4238 else
4239 error_at (loc, "call of overloaded %<%D(%A)%> is ambiguous",
4240 name, build_tree_list_vec (args));
4241 if (candidates)
4242 print_z_candidates (loc, candidates);
4245 /* Return an expression for a call to FN (a namespace-scope function,
4246 or a static member function) with the ARGS. This may change
4247 ARGS. */
4249 tree
4250 build_new_function_call (tree fn, vec<tree, va_gc> **args,
4251 tsubst_flags_t complain)
4253 struct z_candidate *candidates, *cand;
4254 bool any_viable_p;
4255 void *p;
4256 tree result;
4258 if (args != NULL && *args != NULL)
4260 *args = resolve_args (*args, complain);
4261 if (*args == NULL)
4262 return error_mark_node;
4265 if (flag_tm)
4266 tm_malloc_replacement (fn);
4268 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4269 p = conversion_obstack_alloc (0);
4271 cand = perform_overload_resolution (fn, *args, &candidates, &any_viable_p,
4272 complain);
4274 if (!cand)
4276 if (complain & tf_error)
4278 // If there is a single (non-viable) function candidate,
4279 // let the error be diagnosed by cp_build_function_call_vec.
4280 if (!any_viable_p && candidates && ! candidates->next
4281 && (TREE_CODE (candidates->fn) == FUNCTION_DECL))
4282 return cp_build_function_call_vec (candidates->fn, args, complain);
4284 // Otherwise, emit notes for non-viable candidates.
4285 print_error_for_call_failure (fn, *args, candidates);
4287 result = error_mark_node;
4289 else
4291 int flags = LOOKUP_NORMAL;
4292 /* If fn is template_id_expr, the call has explicit template arguments
4293 (e.g. func<int>(5)), communicate this info to build_over_call
4294 through flags so that later we can use it to decide whether to warn
4295 about peculiar null pointer conversion. */
4296 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4298 /* If overload resolution selects a specialization of a
4299 function concept for non-dependent template arguments,
4300 the expression is true if the constraints are satisfied
4301 and false otherwise.
4303 NOTE: This is an extension of Concepts Lite TS that
4304 allows constraints to be used in expressions. */
4305 if (flag_concepts && !processing_template_decl)
4307 tree tmpl = DECL_TI_TEMPLATE (cand->fn);
4308 tree targs = DECL_TI_ARGS (cand->fn);
4309 tree decl = DECL_TEMPLATE_RESULT (tmpl);
4310 if (DECL_DECLARED_CONCEPT_P (decl))
4311 return evaluate_function_concept (decl, targs);
4314 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
4317 result = build_over_call (cand, flags, complain);
4320 /* Free all the conversions we allocated. */
4321 obstack_free (&conversion_obstack, p);
4323 return result;
4326 /* Build a call to a global operator new. FNNAME is the name of the
4327 operator (either "operator new" or "operator new[]") and ARGS are
4328 the arguments provided. This may change ARGS. *SIZE points to the
4329 total number of bytes required by the allocation, and is updated if
4330 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4331 be used. If this function determines that no cookie should be
4332 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4333 is not NULL_TREE, it is evaluated before calculating the final
4334 array size, and if it fails, the array size is replaced with
4335 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4336 is non-NULL, it will be set, upon return, to the allocation
4337 function called. */
4339 tree
4340 build_operator_new_call (tree fnname, vec<tree, va_gc> **args,
4341 tree *size, tree *cookie_size,
4342 tree align_arg, tree size_check,
4343 tree *fn, tsubst_flags_t complain)
4345 tree original_size = *size;
4346 tree fns;
4347 struct z_candidate *candidates;
4348 struct z_candidate *cand = NULL;
4349 bool any_viable_p;
4351 if (fn)
4352 *fn = NULL_TREE;
4353 /* Set to (size_t)-1 if the size check fails. */
4354 if (size_check != NULL_TREE)
4356 tree errval = TYPE_MAX_VALUE (sizetype);
4357 if (cxx_dialect >= cxx11 && flag_exceptions)
4358 errval = throw_bad_array_new_length ();
4359 *size = fold_build3 (COND_EXPR, sizetype, size_check,
4360 original_size, errval);
4362 vec_safe_insert (*args, 0, *size);
4363 *args = resolve_args (*args, complain);
4364 if (*args == NULL)
4365 return error_mark_node;
4367 /* Based on:
4369 [expr.new]
4371 If this lookup fails to find the name, or if the allocated type
4372 is not a class type, the allocation function's name is looked
4373 up in the global scope.
4375 we disregard block-scope declarations of "operator new". */
4376 fns = lookup_name_real (fnname, 0, 1, /*block_p=*/false, 0, 0);
4377 fns = lookup_arg_dependent (fnname, fns, *args);
4379 if (align_arg)
4381 vec<tree, va_gc>* align_args
4382 = vec_copy_and_insert (*args, align_arg, 1);
4383 cand = perform_overload_resolution (fns, align_args, &candidates,
4384 &any_viable_p, tf_none);
4385 if (cand)
4386 *args = align_args;
4387 /* If no aligned allocation function matches, try again without the
4388 alignment. */
4391 /* Figure out what function is being called. */
4392 if (!cand)
4393 cand = perform_overload_resolution (fns, *args, &candidates, &any_viable_p,
4394 complain);
4396 /* If no suitable function could be found, issue an error message
4397 and give up. */
4398 if (!cand)
4400 if (complain & tf_error)
4401 print_error_for_call_failure (fns, *args, candidates);
4402 return error_mark_node;
4405 /* If a cookie is required, add some extra space. Whether
4406 or not a cookie is required cannot be determined until
4407 after we know which function was called. */
4408 if (*cookie_size)
4410 bool use_cookie = true;
4411 tree arg_types;
4413 arg_types = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
4414 /* Skip the size_t parameter. */
4415 arg_types = TREE_CHAIN (arg_types);
4416 /* Check the remaining parameters (if any). */
4417 if (arg_types
4418 && TREE_CHAIN (arg_types) == void_list_node
4419 && same_type_p (TREE_VALUE (arg_types),
4420 ptr_type_node))
4421 use_cookie = false;
4422 /* If we need a cookie, adjust the number of bytes allocated. */
4423 if (use_cookie)
4425 /* Update the total size. */
4426 *size = size_binop (PLUS_EXPR, original_size, *cookie_size);
4427 if (size_check)
4429 /* Set to (size_t)-1 if the size check fails. */
4430 gcc_assert (size_check != NULL_TREE);
4431 *size = fold_build3 (COND_EXPR, sizetype, size_check,
4432 *size, TYPE_MAX_VALUE (sizetype));
4434 /* Update the argument list to reflect the adjusted size. */
4435 (**args)[0] = *size;
4437 else
4438 *cookie_size = NULL_TREE;
4441 /* Tell our caller which function we decided to call. */
4442 if (fn)
4443 *fn = cand->fn;
4445 /* Build the CALL_EXPR. */
4446 return build_over_call (cand, LOOKUP_NORMAL, complain);
4449 /* Build a new call to operator(). This may change ARGS. */
4451 static tree
4452 build_op_call_1 (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
4454 struct z_candidate *candidates = 0, *cand;
4455 tree fns, convs, first_mem_arg = NULL_TREE;
4456 bool any_viable_p;
4457 tree result = NULL_TREE;
4458 void *p;
4460 obj = mark_lvalue_use (obj);
4462 if (error_operand_p (obj))
4463 return error_mark_node;
4465 tree type = TREE_TYPE (obj);
4467 obj = prep_operand (obj);
4469 if (TYPE_PTRMEMFUNC_P (type))
4471 if (complain & tf_error)
4472 /* It's no good looking for an overloaded operator() on a
4473 pointer-to-member-function. */
4474 error ("pointer-to-member function %qE cannot be called without "
4475 "an object; consider using %<.*%> or %<->*%>", obj);
4476 return error_mark_node;
4479 if (TYPE_BINFO (type))
4481 fns = lookup_fnfields (TYPE_BINFO (type), call_op_identifier, 1);
4482 if (fns == error_mark_node)
4483 return error_mark_node;
4485 else
4486 fns = NULL_TREE;
4488 if (args != NULL && *args != NULL)
4490 *args = resolve_args (*args, complain);
4491 if (*args == NULL)
4492 return error_mark_node;
4495 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4496 p = conversion_obstack_alloc (0);
4498 if (fns)
4500 first_mem_arg = obj;
4502 add_candidates (BASELINK_FUNCTIONS (fns),
4503 first_mem_arg, *args, NULL_TREE,
4504 NULL_TREE, false,
4505 BASELINK_BINFO (fns), BASELINK_ACCESS_BINFO (fns),
4506 LOOKUP_NORMAL, &candidates, complain);
4509 convs = lookup_conversions (type);
4511 for (; convs; convs = TREE_CHAIN (convs))
4513 tree totype = TREE_TYPE (convs);
4515 if (TYPE_PTRFN_P (totype)
4516 || TYPE_REFFN_P (totype)
4517 || (TREE_CODE (totype) == REFERENCE_TYPE
4518 && TYPE_PTRFN_P (TREE_TYPE (totype))))
4519 for (ovl_iterator iter (TREE_VALUE (convs)); iter; ++iter)
4521 tree fn = *iter;
4523 if (DECL_NONCONVERTING_P (fn))
4524 continue;
4526 if (TREE_CODE (fn) == TEMPLATE_DECL)
4527 add_template_conv_candidate
4528 (&candidates, fn, obj, *args, totype,
4529 /*access_path=*/NULL_TREE,
4530 /*conversion_path=*/NULL_TREE, complain);
4531 else
4532 add_conv_candidate (&candidates, fn, obj,
4533 *args, /*conversion_path=*/NULL_TREE,
4534 /*access_path=*/NULL_TREE, complain);
4538 /* Be strict here because if we choose a bad conversion candidate, the
4539 errors we get won't mention the call context. */
4540 candidates = splice_viable (candidates, true, &any_viable_p);
4541 if (!any_viable_p)
4543 if (complain & tf_error)
4545 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj),
4546 build_tree_list_vec (*args));
4547 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4549 result = error_mark_node;
4551 else
4553 cand = tourney (candidates, complain);
4554 if (cand == 0)
4556 if (complain & tf_error)
4558 error ("call of %<(%T) (%A)%> is ambiguous",
4559 TREE_TYPE (obj), build_tree_list_vec (*args));
4560 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4562 result = error_mark_node;
4564 else if (TREE_CODE (cand->fn) == FUNCTION_DECL
4565 && DECL_OVERLOADED_OPERATOR_P (cand->fn)
4566 && DECL_OVERLOADED_OPERATOR_IS (cand->fn, CALL_EXPR))
4567 result = build_over_call (cand, LOOKUP_NORMAL, complain);
4568 else
4570 if (TREE_CODE (cand->fn) == FUNCTION_DECL)
4571 obj = convert_like_with_context (cand->convs[0], obj, cand->fn,
4572 -1, complain);
4573 else
4575 gcc_checking_assert (TYPE_P (cand->fn));
4576 obj = convert_like (cand->convs[0], obj, complain);
4578 obj = convert_from_reference (obj);
4579 result = cp_build_function_call_vec (obj, args, complain);
4583 /* Free all the conversions we allocated. */
4584 obstack_free (&conversion_obstack, p);
4586 return result;
4589 /* Wrapper for above. */
4591 tree
4592 build_op_call (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
4594 tree ret;
4595 bool subtime = timevar_cond_start (TV_OVERLOAD);
4596 ret = build_op_call_1 (obj, args, complain);
4597 timevar_cond_stop (TV_OVERLOAD, subtime);
4598 return ret;
4601 /* Called by op_error to prepare format strings suitable for the error
4602 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4603 and a suffix (controlled by NTYPES). */
4605 static const char *
4606 op_error_string (const char *errmsg, int ntypes, bool match)
4608 const char *msg;
4610 const char *msgp = concat (match ? G_("ambiguous overload for ")
4611 : G_("no match for "), errmsg, NULL);
4613 if (ntypes == 3)
4614 msg = concat (msgp, G_(" (operand types are %qT, %qT, and %qT)"), NULL);
4615 else if (ntypes == 2)
4616 msg = concat (msgp, G_(" (operand types are %qT and %qT)"), NULL);
4617 else
4618 msg = concat (msgp, G_(" (operand type is %qT)"), NULL);
4620 return msg;
4623 static void
4624 op_error (location_t loc, enum tree_code code, enum tree_code code2,
4625 tree arg1, tree arg2, tree arg3, bool match)
4627 bool assop = code == MODIFY_EXPR;
4628 const char *opname = OVL_OP_INFO (assop, assop ? code2 : code)->name;
4630 switch (code)
4632 case COND_EXPR:
4633 if (flag_diagnostics_show_caret)
4634 error_at (loc, op_error_string (G_("ternary %<operator?:%>"),
4635 3, match),
4636 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
4637 else
4638 error_at (loc, op_error_string (G_("ternary %<operator?:%> "
4639 "in %<%E ? %E : %E%>"), 3, match),
4640 arg1, arg2, arg3,
4641 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
4642 break;
4644 case POSTINCREMENT_EXPR:
4645 case POSTDECREMENT_EXPR:
4646 if (flag_diagnostics_show_caret)
4647 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
4648 opname, TREE_TYPE (arg1));
4649 else
4650 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4651 1, match),
4652 opname, arg1, opname, TREE_TYPE (arg1));
4653 break;
4655 case ARRAY_REF:
4656 if (flag_diagnostics_show_caret)
4657 error_at (loc, op_error_string (G_("%<operator[]%>"), 2, match),
4658 TREE_TYPE (arg1), TREE_TYPE (arg2));
4659 else
4660 error_at (loc, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4661 2, match),
4662 arg1, arg2, TREE_TYPE (arg1), TREE_TYPE (arg2));
4663 break;
4665 case REALPART_EXPR:
4666 case IMAGPART_EXPR:
4667 if (flag_diagnostics_show_caret)
4668 error_at (loc, op_error_string (G_("%qs"), 1, match),
4669 opname, TREE_TYPE (arg1));
4670 else
4671 error_at (loc, op_error_string (G_("%qs in %<%s %E%>"), 1, match),
4672 opname, opname, arg1, TREE_TYPE (arg1));
4673 break;
4675 default:
4676 if (arg2)
4677 if (flag_diagnostics_show_caret)
4678 error_at (loc, op_error_string (G_("%<operator%s%>"), 2, match),
4679 opname, TREE_TYPE (arg1), TREE_TYPE (arg2));
4680 else
4681 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4682 2, match),
4683 opname, arg1, opname, arg2,
4684 TREE_TYPE (arg1), TREE_TYPE (arg2));
4685 else
4686 if (flag_diagnostics_show_caret)
4687 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
4688 opname, TREE_TYPE (arg1));
4689 else
4690 error_at (loc, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4691 1, match),
4692 opname, opname, arg1, TREE_TYPE (arg1));
4693 break;
4697 /* Return the implicit conversion sequence that could be used to
4698 convert E1 to E2 in [expr.cond]. */
4700 static conversion *
4701 conditional_conversion (tree e1, tree e2, tsubst_flags_t complain)
4703 tree t1 = non_reference (TREE_TYPE (e1));
4704 tree t2 = non_reference (TREE_TYPE (e2));
4705 conversion *conv;
4706 bool good_base;
4708 /* [expr.cond]
4710 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4711 implicitly converted (clause _conv_) to the type "lvalue reference to
4712 T2", subject to the constraint that in the conversion the
4713 reference must bind directly (_dcl.init.ref_) to an lvalue.
4715 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4716 implicitly converted to the type "rvalue reference to T2", subject to
4717 the constraint that the reference must bind directly. */
4718 if (glvalue_p (e2))
4720 tree rtype = cp_build_reference_type (t2, !lvalue_p (e2));
4721 conv = implicit_conversion (rtype,
4724 /*c_cast_p=*/false,
4725 LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND
4726 |LOOKUP_ONLYCONVERTING,
4727 complain);
4728 if (conv && !conv->bad_p)
4729 return conv;
4732 /* If E2 is a prvalue or if neither of the conversions above can be done
4733 and at least one of the operands has (possibly cv-qualified) class
4734 type: */
4735 if (!CLASS_TYPE_P (t1) && !CLASS_TYPE_P (t2))
4736 return NULL;
4738 /* [expr.cond]
4740 If E1 and E2 have class type, and the underlying class types are
4741 the same or one is a base class of the other: E1 can be converted
4742 to match E2 if the class of T2 is the same type as, or a base
4743 class of, the class of T1, and the cv-qualification of T2 is the
4744 same cv-qualification as, or a greater cv-qualification than, the
4745 cv-qualification of T1. If the conversion is applied, E1 is
4746 changed to an rvalue of type T2 that still refers to the original
4747 source class object (or the appropriate subobject thereof). */
4748 if (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
4749 && ((good_base = DERIVED_FROM_P (t2, t1)) || DERIVED_FROM_P (t1, t2)))
4751 if (good_base && at_least_as_qualified_p (t2, t1))
4753 conv = build_identity_conv (t1, e1);
4754 if (!same_type_p (TYPE_MAIN_VARIANT (t1),
4755 TYPE_MAIN_VARIANT (t2)))
4756 conv = build_conv (ck_base, t2, conv);
4757 else
4758 conv = build_conv (ck_rvalue, t2, conv);
4759 return conv;
4761 else
4762 return NULL;
4764 else
4765 /* [expr.cond]
4767 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4768 converted to the type that expression E2 would have if E2 were
4769 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4770 return implicit_conversion (t2, t1, e1, /*c_cast_p=*/false,
4771 LOOKUP_IMPLICIT, complain);
4774 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4775 arguments to the conditional expression. */
4777 static tree
4778 build_conditional_expr_1 (location_t loc, tree arg1, tree arg2, tree arg3,
4779 tsubst_flags_t complain)
4781 tree arg2_type;
4782 tree arg3_type;
4783 tree result = NULL_TREE;
4784 tree result_type = NULL_TREE;
4785 bool is_lvalue = true;
4786 struct z_candidate *candidates = 0;
4787 struct z_candidate *cand;
4788 void *p;
4789 tree orig_arg2, orig_arg3;
4791 /* As a G++ extension, the second argument to the conditional can be
4792 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4793 c'.) If the second operand is omitted, make sure it is
4794 calculated only once. */
4795 if (!arg2)
4797 if (complain & tf_error)
4798 pedwarn (loc, OPT_Wpedantic,
4799 "ISO C++ forbids omitting the middle term of a ?: expression");
4801 if ((complain & tf_warning) && !truth_value_p (TREE_CODE (arg1)))
4802 warn_for_omitted_condop (loc, arg1);
4804 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4805 if (lvalue_p (arg1))
4806 arg2 = arg1 = cp_stabilize_reference (arg1);
4807 else
4808 arg2 = arg1 = cp_save_expr (arg1);
4811 /* If something has already gone wrong, just pass that fact up the
4812 tree. */
4813 if (error_operand_p (arg1)
4814 || error_operand_p (arg2)
4815 || error_operand_p (arg3))
4816 return error_mark_node;
4818 orig_arg2 = arg2;
4819 orig_arg3 = arg3;
4821 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1)))
4823 tree arg1_type = TREE_TYPE (arg1);
4825 /* If arg1 is another cond_expr choosing between -1 and 0,
4826 then we can use its comparison. It may help to avoid
4827 additional comparison, produce more accurate diagnostics
4828 and enables folding. */
4829 if (TREE_CODE (arg1) == VEC_COND_EXPR
4830 && integer_minus_onep (TREE_OPERAND (arg1, 1))
4831 && integer_zerop (TREE_OPERAND (arg1, 2)))
4832 arg1 = TREE_OPERAND (arg1, 0);
4834 arg1 = force_rvalue (arg1, complain);
4835 arg2 = force_rvalue (arg2, complain);
4836 arg3 = force_rvalue (arg3, complain);
4838 /* force_rvalue can return error_mark on valid arguments. */
4839 if (error_operand_p (arg1)
4840 || error_operand_p (arg2)
4841 || error_operand_p (arg3))
4842 return error_mark_node;
4844 arg2_type = TREE_TYPE (arg2);
4845 arg3_type = TREE_TYPE (arg3);
4847 if (!VECTOR_TYPE_P (arg2_type)
4848 && !VECTOR_TYPE_P (arg3_type))
4850 /* Rely on the error messages of the scalar version. */
4851 tree scal = build_conditional_expr_1 (loc, integer_one_node,
4852 orig_arg2, orig_arg3, complain);
4853 if (scal == error_mark_node)
4854 return error_mark_node;
4855 tree stype = TREE_TYPE (scal);
4856 tree ctype = TREE_TYPE (arg1_type);
4857 if (TYPE_SIZE (stype) != TYPE_SIZE (ctype)
4858 || (!INTEGRAL_TYPE_P (stype) && !SCALAR_FLOAT_TYPE_P (stype)))
4860 if (complain & tf_error)
4861 error_at (loc, "inferred scalar type %qT is not an integer or "
4862 "floating point type of the same size as %qT", stype,
4863 COMPARISON_CLASS_P (arg1)
4864 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1, 0)))
4865 : ctype);
4866 return error_mark_node;
4869 tree vtype = build_opaque_vector_type (stype,
4870 TYPE_VECTOR_SUBPARTS (arg1_type));
4871 /* We could pass complain & tf_warning to unsafe_conversion_p,
4872 but the warnings (like Wsign-conversion) have already been
4873 given by the scalar build_conditional_expr_1. We still check
4874 unsafe_conversion_p to forbid truncating long long -> float. */
4875 if (unsafe_conversion_p (loc, stype, arg2, NULL_TREE, false))
4877 if (complain & tf_error)
4878 error_at (loc, "conversion of scalar %qH to vector %qI "
4879 "involves truncation", arg2_type, vtype);
4880 return error_mark_node;
4882 if (unsafe_conversion_p (loc, stype, arg3, NULL_TREE, false))
4884 if (complain & tf_error)
4885 error_at (loc, "conversion of scalar %qH to vector %qI "
4886 "involves truncation", arg3_type, vtype);
4887 return error_mark_node;
4890 arg2 = cp_convert (stype, arg2, complain);
4891 arg2 = save_expr (arg2);
4892 arg2 = build_vector_from_val (vtype, arg2);
4893 arg2_type = vtype;
4894 arg3 = cp_convert (stype, arg3, complain);
4895 arg3 = save_expr (arg3);
4896 arg3 = build_vector_from_val (vtype, arg3);
4897 arg3_type = vtype;
4900 if (VECTOR_TYPE_P (arg2_type) != VECTOR_TYPE_P (arg3_type))
4902 enum stv_conv convert_flag =
4903 scalar_to_vector (loc, VEC_COND_EXPR, arg2, arg3,
4904 complain & tf_error);
4906 switch (convert_flag)
4908 case stv_error:
4909 return error_mark_node;
4910 case stv_firstarg:
4912 arg2 = save_expr (arg2);
4913 arg2 = convert (TREE_TYPE (arg3_type), arg2);
4914 arg2 = build_vector_from_val (arg3_type, arg2);
4915 arg2_type = TREE_TYPE (arg2);
4916 break;
4918 case stv_secondarg:
4920 arg3 = save_expr (arg3);
4921 arg3 = convert (TREE_TYPE (arg2_type), arg3);
4922 arg3 = build_vector_from_val (arg2_type, arg3);
4923 arg3_type = TREE_TYPE (arg3);
4924 break;
4926 default:
4927 break;
4931 if (!same_type_p (arg2_type, arg3_type)
4932 || maybe_ne (TYPE_VECTOR_SUBPARTS (arg1_type),
4933 TYPE_VECTOR_SUBPARTS (arg2_type))
4934 || TYPE_SIZE (arg1_type) != TYPE_SIZE (arg2_type))
4936 if (complain & tf_error)
4937 error_at (loc,
4938 "incompatible vector types in conditional expression: "
4939 "%qT, %qT and %qT", TREE_TYPE (arg1),
4940 TREE_TYPE (orig_arg2), TREE_TYPE (orig_arg3));
4941 return error_mark_node;
4944 if (!COMPARISON_CLASS_P (arg1))
4946 tree cmp_type = build_same_sized_truth_vector_type (arg1_type);
4947 arg1 = build2 (NE_EXPR, cmp_type, arg1, build_zero_cst (arg1_type));
4949 return build3_loc (loc, VEC_COND_EXPR, arg2_type, arg1, arg2, arg3);
4952 /* [expr.cond]
4954 The first expression is implicitly converted to bool (clause
4955 _conv_). */
4956 arg1 = perform_implicit_conversion_flags (boolean_type_node, arg1, complain,
4957 LOOKUP_NORMAL);
4958 if (error_operand_p (arg1))
4959 return error_mark_node;
4961 /* [expr.cond]
4963 If either the second or the third operand has type (possibly
4964 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4965 array-to-pointer (_conv.array_), and function-to-pointer
4966 (_conv.func_) standard conversions are performed on the second
4967 and third operands. */
4968 arg2_type = unlowered_expr_type (arg2);
4969 arg3_type = unlowered_expr_type (arg3);
4970 if (VOID_TYPE_P (arg2_type) || VOID_TYPE_P (arg3_type))
4972 /* Do the conversions. We don't these for `void' type arguments
4973 since it can't have any effect and since decay_conversion
4974 does not handle that case gracefully. */
4975 if (!VOID_TYPE_P (arg2_type))
4976 arg2 = decay_conversion (arg2, complain);
4977 if (!VOID_TYPE_P (arg3_type))
4978 arg3 = decay_conversion (arg3, complain);
4979 arg2_type = TREE_TYPE (arg2);
4980 arg3_type = TREE_TYPE (arg3);
4982 /* [expr.cond]
4984 One of the following shall hold:
4986 --The second or the third operand (but not both) is a
4987 throw-expression (_except.throw_); the result is of the
4988 type of the other and is an rvalue.
4990 --Both the second and the third operands have type void; the
4991 result is of type void and is an rvalue.
4993 We must avoid calling force_rvalue for expressions of type
4994 "void" because it will complain that their value is being
4995 used. */
4996 if (TREE_CODE (arg2) == THROW_EXPR
4997 && TREE_CODE (arg3) != THROW_EXPR)
4999 if (!VOID_TYPE_P (arg3_type))
5001 arg3 = force_rvalue (arg3, complain);
5002 if (arg3 == error_mark_node)
5003 return error_mark_node;
5005 arg3_type = TREE_TYPE (arg3);
5006 result_type = arg3_type;
5008 else if (TREE_CODE (arg2) != THROW_EXPR
5009 && TREE_CODE (arg3) == THROW_EXPR)
5011 if (!VOID_TYPE_P (arg2_type))
5013 arg2 = force_rvalue (arg2, complain);
5014 if (arg2 == error_mark_node)
5015 return error_mark_node;
5017 arg2_type = TREE_TYPE (arg2);
5018 result_type = arg2_type;
5020 else if (VOID_TYPE_P (arg2_type) && VOID_TYPE_P (arg3_type))
5021 result_type = void_type_node;
5022 else
5024 if (complain & tf_error)
5026 if (VOID_TYPE_P (arg2_type))
5027 error_at (EXPR_LOC_OR_LOC (arg3, loc),
5028 "second operand to the conditional operator "
5029 "is of type %<void%>, but the third operand is "
5030 "neither a throw-expression nor of type %<void%>");
5031 else
5032 error_at (EXPR_LOC_OR_LOC (arg2, loc),
5033 "third operand to the conditional operator "
5034 "is of type %<void%>, but the second operand is "
5035 "neither a throw-expression nor of type %<void%>");
5037 return error_mark_node;
5040 is_lvalue = false;
5041 goto valid_operands;
5043 /* [expr.cond]
5045 Otherwise, if the second and third operand have different types,
5046 and either has (possibly cv-qualified) class type, or if both are
5047 glvalues of the same value category and the same type except for
5048 cv-qualification, an attempt is made to convert each of those operands
5049 to the type of the other. */
5050 else if (!same_type_p (arg2_type, arg3_type)
5051 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)
5052 || (same_type_ignoring_top_level_qualifiers_p (arg2_type,
5053 arg3_type)
5054 && glvalue_p (arg2) && glvalue_p (arg3)
5055 && lvalue_p (arg2) == lvalue_p (arg3))))
5057 conversion *conv2;
5058 conversion *conv3;
5059 bool converted = false;
5061 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5062 p = conversion_obstack_alloc (0);
5064 conv2 = conditional_conversion (arg2, arg3, complain);
5065 conv3 = conditional_conversion (arg3, arg2, complain);
5067 /* [expr.cond]
5069 If both can be converted, or one can be converted but the
5070 conversion is ambiguous, the program is ill-formed. If
5071 neither can be converted, the operands are left unchanged and
5072 further checking is performed as described below. If exactly
5073 one conversion is possible, that conversion is applied to the
5074 chosen operand and the converted operand is used in place of
5075 the original operand for the remainder of this section. */
5076 if ((conv2 && !conv2->bad_p
5077 && conv3 && !conv3->bad_p)
5078 || (conv2 && conv2->kind == ck_ambig)
5079 || (conv3 && conv3->kind == ck_ambig))
5081 if (complain & tf_error)
5083 error_at (loc, "operands to ?: have different types %qT and %qT",
5084 arg2_type, arg3_type);
5085 if (conv2 && !conv2->bad_p && conv3 && !conv3->bad_p)
5086 inform (loc, " and each type can be converted to the other");
5087 else if (conv2 && conv2->kind == ck_ambig)
5088 convert_like (conv2, arg2, complain);
5089 else
5090 convert_like (conv3, arg3, complain);
5092 result = error_mark_node;
5094 else if (conv2 && !conv2->bad_p)
5096 arg2 = convert_like (conv2, arg2, complain);
5097 arg2 = convert_from_reference (arg2);
5098 arg2_type = TREE_TYPE (arg2);
5099 /* Even if CONV2 is a valid conversion, the result of the
5100 conversion may be invalid. For example, if ARG3 has type
5101 "volatile X", and X does not have a copy constructor
5102 accepting a "volatile X&", then even if ARG2 can be
5103 converted to X, the conversion will fail. */
5104 if (error_operand_p (arg2))
5105 result = error_mark_node;
5106 converted = true;
5108 else if (conv3 && !conv3->bad_p)
5110 arg3 = convert_like (conv3, arg3, complain);
5111 arg3 = convert_from_reference (arg3);
5112 arg3_type = TREE_TYPE (arg3);
5113 if (error_operand_p (arg3))
5114 result = error_mark_node;
5115 converted = true;
5118 /* Free all the conversions we allocated. */
5119 obstack_free (&conversion_obstack, p);
5121 if (result)
5122 return result;
5124 /* If, after the conversion, both operands have class type,
5125 treat the cv-qualification of both operands as if it were the
5126 union of the cv-qualification of the operands.
5128 The standard is not clear about what to do in this
5129 circumstance. For example, if the first operand has type
5130 "const X" and the second operand has a user-defined
5131 conversion to "volatile X", what is the type of the second
5132 operand after this step? Making it be "const X" (matching
5133 the first operand) seems wrong, as that discards the
5134 qualification without actually performing a copy. Leaving it
5135 as "volatile X" seems wrong as that will result in the
5136 conditional expression failing altogether, even though,
5137 according to this step, the one operand could be converted to
5138 the type of the other. */
5139 if (converted
5140 && CLASS_TYPE_P (arg2_type)
5141 && cp_type_quals (arg2_type) != cp_type_quals (arg3_type))
5142 arg2_type = arg3_type =
5143 cp_build_qualified_type (arg2_type,
5144 cp_type_quals (arg2_type)
5145 | cp_type_quals (arg3_type));
5148 /* [expr.cond]
5150 If the second and third operands are glvalues of the same value
5151 category and have the same type, the result is of that type and
5152 value category. */
5153 if (((lvalue_p (arg2) && lvalue_p (arg3))
5154 || (xvalue_p (arg2) && xvalue_p (arg3)))
5155 && same_type_p (arg2_type, arg3_type))
5157 result_type = arg2_type;
5158 arg2 = mark_lvalue_use (arg2);
5159 arg3 = mark_lvalue_use (arg3);
5160 goto valid_operands;
5163 /* [expr.cond]
5165 Otherwise, the result is an rvalue. If the second and third
5166 operand do not have the same type, and either has (possibly
5167 cv-qualified) class type, overload resolution is used to
5168 determine the conversions (if any) to be applied to the operands
5169 (_over.match.oper_, _over.built_). */
5170 is_lvalue = false;
5171 if (!same_type_p (arg2_type, arg3_type)
5172 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
5174 tree args[3];
5175 conversion *conv;
5176 bool any_viable_p;
5178 /* Rearrange the arguments so that add_builtin_candidate only has
5179 to know about two args. In build_builtin_candidate, the
5180 arguments are unscrambled. */
5181 args[0] = arg2;
5182 args[1] = arg3;
5183 args[2] = arg1;
5184 add_builtin_candidates (&candidates,
5185 COND_EXPR,
5186 NOP_EXPR,
5187 ovl_op_identifier (false, COND_EXPR),
5188 args,
5189 LOOKUP_NORMAL, complain);
5191 /* [expr.cond]
5193 If the overload resolution fails, the program is
5194 ill-formed. */
5195 candidates = splice_viable (candidates, false, &any_viable_p);
5196 if (!any_viable_p)
5198 if (complain & tf_error)
5199 error_at (loc, "operands to ?: have different types %qT and %qT",
5200 arg2_type, arg3_type);
5201 return error_mark_node;
5203 cand = tourney (candidates, complain);
5204 if (!cand)
5206 if (complain & tf_error)
5208 op_error (loc, COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE);
5209 print_z_candidates (loc, candidates);
5211 return error_mark_node;
5214 /* [expr.cond]
5216 Otherwise, the conversions thus determined are applied, and
5217 the converted operands are used in place of the original
5218 operands for the remainder of this section. */
5219 conv = cand->convs[0];
5220 arg1 = convert_like (conv, arg1, complain);
5221 conv = cand->convs[1];
5222 arg2 = convert_like (conv, arg2, complain);
5223 arg2_type = TREE_TYPE (arg2);
5224 conv = cand->convs[2];
5225 arg3 = convert_like (conv, arg3, complain);
5226 arg3_type = TREE_TYPE (arg3);
5229 /* [expr.cond]
5231 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5232 and function-to-pointer (_conv.func_) standard conversions are
5233 performed on the second and third operands.
5235 We need to force the lvalue-to-rvalue conversion here for class types,
5236 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5237 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5238 regions. */
5240 arg2 = force_rvalue (arg2, complain);
5241 if (!CLASS_TYPE_P (arg2_type))
5242 arg2_type = TREE_TYPE (arg2);
5244 arg3 = force_rvalue (arg3, complain);
5245 if (!CLASS_TYPE_P (arg3_type))
5246 arg3_type = TREE_TYPE (arg3);
5248 if (arg2 == error_mark_node || arg3 == error_mark_node)
5249 return error_mark_node;
5251 /* [expr.cond]
5253 After those conversions, one of the following shall hold:
5255 --The second and third operands have the same type; the result is of
5256 that type. */
5257 if (same_type_p (arg2_type, arg3_type))
5258 result_type = arg2_type;
5259 /* [expr.cond]
5261 --The second and third operands have arithmetic or enumeration
5262 type; the usual arithmetic conversions are performed to bring
5263 them to a common type, and the result is of that type. */
5264 else if ((ARITHMETIC_TYPE_P (arg2_type)
5265 || UNSCOPED_ENUM_P (arg2_type))
5266 && (ARITHMETIC_TYPE_P (arg3_type)
5267 || UNSCOPED_ENUM_P (arg3_type)))
5269 /* In this case, there is always a common type. */
5270 result_type = type_after_usual_arithmetic_conversions (arg2_type,
5271 arg3_type);
5272 if (complain & tf_warning)
5273 do_warn_double_promotion (result_type, arg2_type, arg3_type,
5274 "implicit conversion from %qH to %qI to "
5275 "match other result of conditional",
5276 loc);
5278 if (TREE_CODE (arg2_type) == ENUMERAL_TYPE
5279 && TREE_CODE (arg3_type) == ENUMERAL_TYPE)
5281 if (TREE_CODE (orig_arg2) == CONST_DECL
5282 && TREE_CODE (orig_arg3) == CONST_DECL
5283 && DECL_CONTEXT (orig_arg2) == DECL_CONTEXT (orig_arg3))
5284 /* Two enumerators from the same enumeration can have different
5285 types when the enumeration is still being defined. */;
5286 else if (complain & tf_warning)
5287 warning_at (loc, OPT_Wenum_compare, "enumeral mismatch in "
5288 "conditional expression: %qT vs %qT",
5289 arg2_type, arg3_type);
5291 else if (extra_warnings
5292 && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE
5293 && !same_type_p (arg3_type, type_promotes_to (arg2_type)))
5294 || (TREE_CODE (arg3_type) == ENUMERAL_TYPE
5295 && !same_type_p (arg2_type,
5296 type_promotes_to (arg3_type)))))
5298 if (complain & tf_warning)
5299 warning_at (loc, OPT_Wextra, "enumeral and non-enumeral type in "
5300 "conditional expression");
5303 arg2 = perform_implicit_conversion (result_type, arg2, complain);
5304 arg3 = perform_implicit_conversion (result_type, arg3, complain);
5306 /* [expr.cond]
5308 --The second and third operands have pointer type, or one has
5309 pointer type and the other is a null pointer constant; pointer
5310 conversions (_conv.ptr_) and qualification conversions
5311 (_conv.qual_) are performed to bring them to their composite
5312 pointer type (_expr.rel_). The result is of the composite
5313 pointer type.
5315 --The second and third operands have pointer to member type, or
5316 one has pointer to member type and the other is a null pointer
5317 constant; pointer to member conversions (_conv.mem_) and
5318 qualification conversions (_conv.qual_) are performed to bring
5319 them to a common type, whose cv-qualification shall match the
5320 cv-qualification of either the second or the third operand.
5321 The result is of the common type. */
5322 else if ((null_ptr_cst_p (arg2)
5323 && TYPE_PTR_OR_PTRMEM_P (arg3_type))
5324 || (null_ptr_cst_p (arg3)
5325 && TYPE_PTR_OR_PTRMEM_P (arg2_type))
5326 || (TYPE_PTR_P (arg2_type) && TYPE_PTR_P (arg3_type))
5327 || (TYPE_PTRDATAMEM_P (arg2_type) && TYPE_PTRDATAMEM_P (arg3_type))
5328 || (TYPE_PTRMEMFUNC_P (arg2_type) && TYPE_PTRMEMFUNC_P (arg3_type)))
5330 result_type = composite_pointer_type (arg2_type, arg3_type, arg2,
5331 arg3, CPO_CONDITIONAL_EXPR,
5332 complain);
5333 if (result_type == error_mark_node)
5334 return error_mark_node;
5335 arg2 = perform_implicit_conversion (result_type, arg2, complain);
5336 arg3 = perform_implicit_conversion (result_type, arg3, complain);
5339 if (!result_type)
5341 if (complain & tf_error)
5342 error_at (loc, "operands to ?: have different types %qT and %qT",
5343 arg2_type, arg3_type);
5344 return error_mark_node;
5347 if (arg2 == error_mark_node || arg3 == error_mark_node)
5348 return error_mark_node;
5350 valid_operands:
5351 result = build3_loc (loc, COND_EXPR, result_type, arg1, arg2, arg3);
5353 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5354 warn here, because the COND_EXPR will be turned into ARG2. */
5355 if (warn_duplicated_branches
5356 && (complain & tf_warning)
5357 && (arg2 == arg3 || operand_equal_p (arg2, arg3, 0)))
5358 warning_at (EXPR_LOCATION (result), OPT_Wduplicated_branches,
5359 "this condition has identical branches");
5361 /* We can't use result_type below, as fold might have returned a
5362 throw_expr. */
5364 if (!is_lvalue)
5366 /* Expand both sides into the same slot, hopefully the target of
5367 the ?: expression. We used to check for TARGET_EXPRs here,
5368 but now we sometimes wrap them in NOP_EXPRs so the test would
5369 fail. */
5370 if (CLASS_TYPE_P (TREE_TYPE (result)))
5371 result = get_target_expr_sfinae (result, complain);
5372 /* If this expression is an rvalue, but might be mistaken for an
5373 lvalue, we must add a NON_LVALUE_EXPR. */
5374 result = rvalue (result);
5376 else
5377 result = force_paren_expr (result);
5379 return result;
5382 /* Wrapper for above. */
5384 tree
5385 build_conditional_expr (location_t loc, tree arg1, tree arg2, tree arg3,
5386 tsubst_flags_t complain)
5388 tree ret;
5389 bool subtime = timevar_cond_start (TV_OVERLOAD);
5390 ret = build_conditional_expr_1 (loc, arg1, arg2, arg3, complain);
5391 timevar_cond_stop (TV_OVERLOAD, subtime);
5392 return ret;
5395 /* OPERAND is an operand to an expression. Perform necessary steps
5396 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5397 returned. */
5399 static tree
5400 prep_operand (tree operand)
5402 if (operand)
5404 if (CLASS_TYPE_P (TREE_TYPE (operand))
5405 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand)))
5406 /* Make sure the template type is instantiated now. */
5407 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand)));
5410 return operand;
5413 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5414 OVERLOAD) to the CANDIDATES, returning an updated list of
5415 CANDIDATES. The ARGS are the arguments provided to the call;
5416 if FIRST_ARG is non-null it is the implicit object argument,
5417 otherwise the first element of ARGS is used if needed. The
5418 EXPLICIT_TARGS are explicit template arguments provided.
5419 TEMPLATE_ONLY is true if only template functions should be
5420 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5421 add_function_candidate. */
5423 static void
5424 add_candidates (tree fns, tree first_arg, const vec<tree, va_gc> *args,
5425 tree return_type,
5426 tree explicit_targs, bool template_only,
5427 tree conversion_path, tree access_path,
5428 int flags,
5429 struct z_candidate **candidates,
5430 tsubst_flags_t complain)
5432 tree ctype;
5433 const vec<tree, va_gc> *non_static_args;
5434 bool check_list_ctor = false;
5435 bool check_converting = false;
5436 unification_kind_t strict;
5438 if (!fns)
5439 return;
5441 /* Precalculate special handling of constructors and conversion ops. */
5442 tree fn = OVL_FIRST (fns);
5443 if (DECL_CONV_FN_P (fn))
5445 check_list_ctor = false;
5446 check_converting = (flags & LOOKUP_ONLYCONVERTING) != 0;
5447 if (flags & LOOKUP_NO_CONVERSION)
5448 /* We're doing return_type(x). */
5449 strict = DEDUCE_CONV;
5450 else
5451 /* We're doing x.operator return_type(). */
5452 strict = DEDUCE_EXACT;
5453 /* [over.match.funcs] For conversion functions, the function
5454 is considered to be a member of the class of the implicit
5455 object argument for the purpose of defining the type of
5456 the implicit object parameter. */
5457 ctype = TYPE_MAIN_VARIANT (TREE_TYPE (first_arg));
5459 else
5461 if (DECL_CONSTRUCTOR_P (fn))
5463 check_list_ctor = (flags & LOOKUP_LIST_ONLY) != 0;
5464 /* For list-initialization we consider explicit constructors
5465 and complain if one is chosen. */
5466 check_converting
5467 = ((flags & (LOOKUP_ONLYCONVERTING|LOOKUP_LIST_INIT_CTOR))
5468 == LOOKUP_ONLYCONVERTING);
5470 strict = DEDUCE_CALL;
5471 ctype = conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE;
5474 if (first_arg)
5475 non_static_args = args;
5476 else
5477 /* Delay creating the implicit this parameter until it is needed. */
5478 non_static_args = NULL;
5480 for (lkp_iterator iter (fns); iter; ++iter)
5482 fn = *iter;
5484 if (check_converting && DECL_NONCONVERTING_P (fn))
5485 continue;
5486 if (check_list_ctor && !is_list_ctor (fn))
5487 continue;
5489 tree fn_first_arg = NULL_TREE;
5490 const vec<tree, va_gc> *fn_args = args;
5492 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
5494 /* Figure out where the object arg comes from. If this
5495 function is a non-static member and we didn't get an
5496 implicit object argument, move it out of args. */
5497 if (first_arg == NULL_TREE)
5499 unsigned int ix;
5500 tree arg;
5501 vec<tree, va_gc> *tempvec;
5502 vec_alloc (tempvec, args->length () - 1);
5503 for (ix = 1; args->iterate (ix, &arg); ++ix)
5504 tempvec->quick_push (arg);
5505 non_static_args = tempvec;
5506 first_arg = (*args)[0];
5509 fn_first_arg = first_arg;
5510 fn_args = non_static_args;
5513 if (TREE_CODE (fn) == TEMPLATE_DECL)
5514 add_template_candidate (candidates,
5516 ctype,
5517 explicit_targs,
5518 fn_first_arg,
5519 fn_args,
5520 return_type,
5521 access_path,
5522 conversion_path,
5523 flags,
5524 strict,
5525 complain);
5526 else if (!template_only)
5527 add_function_candidate (candidates,
5529 ctype,
5530 fn_first_arg,
5531 fn_args,
5532 access_path,
5533 conversion_path,
5534 flags,
5535 complain);
5539 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5540 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5542 static int
5543 op_is_ordered (tree_code code)
5545 switch (code)
5547 // 5. b @= a
5548 case MODIFY_EXPR:
5549 return (flag_strong_eval_order > 1 ? -1 : 0);
5551 // 6. a[b]
5552 case ARRAY_REF:
5553 return (flag_strong_eval_order > 1 ? 1 : 0);
5555 // 1. a.b
5556 // Not overloadable (yet).
5557 // 2. a->b
5558 // Only one argument.
5559 // 3. a->*b
5560 case MEMBER_REF:
5561 // 7. a << b
5562 case LSHIFT_EXPR:
5563 // 8. a >> b
5564 case RSHIFT_EXPR:
5565 return (flag_strong_eval_order ? 1 : 0);
5567 default:
5568 return 0;
5572 static tree
5573 build_new_op_1 (location_t loc, enum tree_code code, int flags, tree arg1,
5574 tree arg2, tree arg3, tree *overload, tsubst_flags_t complain)
5576 struct z_candidate *candidates = 0, *cand;
5577 vec<tree, va_gc> *arglist;
5578 tree args[3];
5579 tree result = NULL_TREE;
5580 bool result_valid_p = false;
5581 enum tree_code code2 = NOP_EXPR;
5582 enum tree_code code_orig_arg1 = ERROR_MARK;
5583 enum tree_code code_orig_arg2 = ERROR_MARK;
5584 conversion *conv;
5585 void *p;
5586 bool strict_p;
5587 bool any_viable_p;
5589 if (error_operand_p (arg1)
5590 || error_operand_p (arg2)
5591 || error_operand_p (arg3))
5592 return error_mark_node;
5594 bool ismodop = code == MODIFY_EXPR;
5595 if (ismodop)
5597 code2 = TREE_CODE (arg3);
5598 arg3 = NULL_TREE;
5600 tree fnname = ovl_op_identifier (ismodop, ismodop ? code2 : code);
5602 arg1 = prep_operand (arg1);
5604 bool memonly = false;
5605 switch (code)
5607 case NEW_EXPR:
5608 case VEC_NEW_EXPR:
5609 case VEC_DELETE_EXPR:
5610 case DELETE_EXPR:
5611 /* Use build_op_new_call and build_op_delete_call instead. */
5612 gcc_unreachable ();
5614 case CALL_EXPR:
5615 /* Use build_op_call instead. */
5616 gcc_unreachable ();
5618 case TRUTH_ORIF_EXPR:
5619 case TRUTH_ANDIF_EXPR:
5620 case TRUTH_AND_EXPR:
5621 case TRUTH_OR_EXPR:
5622 /* These are saved for the sake of warn_logical_operator. */
5623 code_orig_arg1 = TREE_CODE (arg1);
5624 code_orig_arg2 = TREE_CODE (arg2);
5625 break;
5626 case GT_EXPR:
5627 case LT_EXPR:
5628 case GE_EXPR:
5629 case LE_EXPR:
5630 case EQ_EXPR:
5631 case NE_EXPR:
5632 /* These are saved for the sake of maybe_warn_bool_compare. */
5633 code_orig_arg1 = TREE_CODE (TREE_TYPE (arg1));
5634 code_orig_arg2 = TREE_CODE (TREE_TYPE (arg2));
5635 break;
5637 /* =, ->, [], () must be non-static member functions. */
5638 case MODIFY_EXPR:
5639 if (code2 != NOP_EXPR)
5640 break;
5641 /* FALLTHRU */
5642 case COMPONENT_REF:
5643 case ARRAY_REF:
5644 memonly = true;
5645 break;
5647 default:
5648 break;
5651 arg2 = prep_operand (arg2);
5652 arg3 = prep_operand (arg3);
5654 if (code == COND_EXPR)
5655 /* Use build_conditional_expr instead. */
5656 gcc_unreachable ();
5657 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1))
5658 && (! arg2 || ! OVERLOAD_TYPE_P (TREE_TYPE (arg2))))
5659 goto builtin;
5661 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
5662 arg2 = integer_zero_node;
5664 vec_alloc (arglist, 3);
5665 arglist->quick_push (arg1);
5666 if (arg2 != NULL_TREE)
5667 arglist->quick_push (arg2);
5668 if (arg3 != NULL_TREE)
5669 arglist->quick_push (arg3);
5671 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5672 p = conversion_obstack_alloc (0);
5674 /* Add namespace-scope operators to the list of functions to
5675 consider. */
5676 if (!memonly)
5678 tree fns = lookup_name_real (fnname, 0, 1, /*block_p=*/true, 0, 0);
5679 fns = lookup_arg_dependent (fnname, fns, arglist);
5680 add_candidates (fns, NULL_TREE, arglist, NULL_TREE,
5681 NULL_TREE, false, NULL_TREE, NULL_TREE,
5682 flags, &candidates, complain);
5685 args[0] = arg1;
5686 args[1] = arg2;
5687 args[2] = NULL_TREE;
5689 /* Add class-member operators to the candidate set. */
5690 if (CLASS_TYPE_P (TREE_TYPE (arg1)))
5692 tree fns;
5694 fns = lookup_fnfields (TREE_TYPE (arg1), fnname, 1);
5695 if (fns == error_mark_node)
5697 result = error_mark_node;
5698 goto user_defined_result_ready;
5700 if (fns)
5701 add_candidates (BASELINK_FUNCTIONS (fns),
5702 NULL_TREE, arglist, NULL_TREE,
5703 NULL_TREE, false,
5704 BASELINK_BINFO (fns),
5705 BASELINK_ACCESS_BINFO (fns),
5706 flags, &candidates, complain);
5708 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5709 only non-member functions that have type T1 or reference to
5710 cv-qualified-opt T1 for the first argument, if the first argument
5711 has an enumeration type, or T2 or reference to cv-qualified-opt
5712 T2 for the second argument, if the second argument has an
5713 enumeration type. Filter out those that don't match. */
5714 else if (! arg2 || ! CLASS_TYPE_P (TREE_TYPE (arg2)))
5716 struct z_candidate **candp, **next;
5718 for (candp = &candidates; *candp; candp = next)
5720 tree parmlist, parmtype;
5721 int i, nargs = (arg2 ? 2 : 1);
5723 cand = *candp;
5724 next = &cand->next;
5726 parmlist = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
5728 for (i = 0; i < nargs; ++i)
5730 parmtype = TREE_VALUE (parmlist);
5732 if (TREE_CODE (parmtype) == REFERENCE_TYPE)
5733 parmtype = TREE_TYPE (parmtype);
5734 if (TREE_CODE (TREE_TYPE (args[i])) == ENUMERAL_TYPE
5735 && (same_type_ignoring_top_level_qualifiers_p
5736 (TREE_TYPE (args[i]), parmtype)))
5737 break;
5739 parmlist = TREE_CHAIN (parmlist);
5742 /* No argument has an appropriate type, so remove this
5743 candidate function from the list. */
5744 if (i == nargs)
5746 *candp = cand->next;
5747 next = candp;
5752 add_builtin_candidates (&candidates, code, code2, fnname, args,
5753 flags, complain);
5755 switch (code)
5757 case COMPOUND_EXPR:
5758 case ADDR_EXPR:
5759 /* For these, the built-in candidates set is empty
5760 [over.match.oper]/3. We don't want non-strict matches
5761 because exact matches are always possible with built-in
5762 operators. The built-in candidate set for COMPONENT_REF
5763 would be empty too, but since there are no such built-in
5764 operators, we accept non-strict matches for them. */
5765 strict_p = true;
5766 break;
5768 default:
5769 strict_p = false;
5770 break;
5773 candidates = splice_viable (candidates, strict_p, &any_viable_p);
5774 if (!any_viable_p)
5776 switch (code)
5778 case POSTINCREMENT_EXPR:
5779 case POSTDECREMENT_EXPR:
5780 /* Don't try anything fancy if we're not allowed to produce
5781 errors. */
5782 if (!(complain & tf_error))
5783 return error_mark_node;
5785 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5786 distinguish between prefix and postfix ++ and
5787 operator++() was used for both, so we allow this with
5788 -fpermissive. */
5789 else
5791 const char *msg = (flag_permissive)
5792 ? G_("no %<%D(int)%> declared for postfix %qs,"
5793 " trying prefix operator instead")
5794 : G_("no %<%D(int)%> declared for postfix %qs");
5795 permerror (loc, msg, fnname, OVL_OP_INFO (false, code)->name);
5798 if (!flag_permissive)
5799 return error_mark_node;
5801 if (code == POSTINCREMENT_EXPR)
5802 code = PREINCREMENT_EXPR;
5803 else
5804 code = PREDECREMENT_EXPR;
5805 result = build_new_op_1 (loc, code, flags, arg1, NULL_TREE,
5806 NULL_TREE, overload, complain);
5807 break;
5809 /* The caller will deal with these. */
5810 case ADDR_EXPR:
5811 case COMPOUND_EXPR:
5812 case COMPONENT_REF:
5813 result = NULL_TREE;
5814 result_valid_p = true;
5815 break;
5817 default:
5818 if (complain & tf_error)
5820 /* If one of the arguments of the operator represents
5821 an invalid use of member function pointer, try to report
5822 a meaningful error ... */
5823 if (invalid_nonstatic_memfn_p (loc, arg1, tf_error)
5824 || invalid_nonstatic_memfn_p (loc, arg2, tf_error)
5825 || invalid_nonstatic_memfn_p (loc, arg3, tf_error))
5826 /* We displayed the error message. */;
5827 else
5829 /* ... Otherwise, report the more generic
5830 "no matching operator found" error */
5831 op_error (loc, code, code2, arg1, arg2, arg3, FALSE);
5832 print_z_candidates (loc, candidates);
5835 result = error_mark_node;
5836 break;
5839 else
5841 cand = tourney (candidates, complain);
5842 if (cand == 0)
5844 if (complain & tf_error)
5846 op_error (loc, code, code2, arg1, arg2, arg3, TRUE);
5847 print_z_candidates (loc, candidates);
5849 result = error_mark_node;
5851 else if (TREE_CODE (cand->fn) == FUNCTION_DECL)
5853 if (overload)
5854 *overload = cand->fn;
5856 if (resolve_args (arglist, complain) == NULL)
5857 result = error_mark_node;
5858 else
5859 result = build_over_call (cand, LOOKUP_NORMAL, complain);
5861 if (trivial_fn_p (cand->fn))
5862 /* There won't be a CALL_EXPR. */;
5863 else if (result && result != error_mark_node)
5865 tree call = extract_call_expr (result);
5866 CALL_EXPR_OPERATOR_SYNTAX (call) = true;
5868 if (processing_template_decl && DECL_HIDDEN_FRIEND_P (cand->fn))
5869 /* This prevents build_new_function_call from discarding this
5870 function during instantiation of the enclosing template. */
5871 KOENIG_LOOKUP_P (call) = 1;
5873 /* Specify evaluation order as per P0145R2. */
5874 CALL_EXPR_ORDERED_ARGS (call) = false;
5875 switch (op_is_ordered (code))
5877 case -1:
5878 CALL_EXPR_REVERSE_ARGS (call) = true;
5879 break;
5881 case 1:
5882 CALL_EXPR_ORDERED_ARGS (call) = true;
5883 break;
5885 default:
5886 break;
5890 else
5892 /* Give any warnings we noticed during overload resolution. */
5893 if (cand->warnings && (complain & tf_warning))
5895 struct candidate_warning *w;
5896 for (w = cand->warnings; w; w = w->next)
5897 joust (cand, w->loser, 1, complain);
5900 /* Check for comparison of different enum types. */
5901 switch (code)
5903 case GT_EXPR:
5904 case LT_EXPR:
5905 case GE_EXPR:
5906 case LE_EXPR:
5907 case EQ_EXPR:
5908 case NE_EXPR:
5909 if (TREE_CODE (TREE_TYPE (arg1)) == ENUMERAL_TYPE
5910 && TREE_CODE (TREE_TYPE (arg2)) == ENUMERAL_TYPE
5911 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1))
5912 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2)))
5913 && (complain & tf_warning))
5915 warning (OPT_Wenum_compare,
5916 "comparison between %q#T and %q#T",
5917 TREE_TYPE (arg1), TREE_TYPE (arg2));
5919 break;
5920 default:
5921 break;
5924 /* We need to strip any leading REF_BIND so that bitfields
5925 don't cause errors. This should not remove any important
5926 conversions, because builtins don't apply to class
5927 objects directly. */
5928 conv = cand->convs[0];
5929 if (conv->kind == ck_ref_bind)
5930 conv = next_conversion (conv);
5931 arg1 = convert_like (conv, arg1, complain);
5933 if (arg2)
5935 conv = cand->convs[1];
5936 if (conv->kind == ck_ref_bind)
5937 conv = next_conversion (conv);
5938 else
5939 arg2 = decay_conversion (arg2, complain);
5941 /* We need to call warn_logical_operator before
5942 converting arg2 to a boolean_type, but after
5943 decaying an enumerator to its value. */
5944 if (complain & tf_warning)
5945 warn_logical_operator (loc, code, boolean_type_node,
5946 code_orig_arg1, arg1,
5947 code_orig_arg2, arg2);
5949 arg2 = convert_like (conv, arg2, complain);
5951 if (arg3)
5953 conv = cand->convs[2];
5954 if (conv->kind == ck_ref_bind)
5955 conv = next_conversion (conv);
5956 arg3 = convert_like (conv, arg3, complain);
5962 user_defined_result_ready:
5964 /* Free all the conversions we allocated. */
5965 obstack_free (&conversion_obstack, p);
5967 if (result || result_valid_p)
5968 return result;
5970 builtin:
5971 switch (code)
5973 case MODIFY_EXPR:
5974 return cp_build_modify_expr (loc, arg1, code2, arg2, complain);
5976 case INDIRECT_REF:
5977 return cp_build_indirect_ref (arg1, RO_UNARY_STAR, complain);
5979 case TRUTH_ANDIF_EXPR:
5980 case TRUTH_ORIF_EXPR:
5981 case TRUTH_AND_EXPR:
5982 case TRUTH_OR_EXPR:
5983 if (complain & tf_warning)
5984 warn_logical_operator (loc, code, boolean_type_node,
5985 code_orig_arg1, arg1,
5986 code_orig_arg2, arg2);
5987 /* Fall through. */
5988 case GT_EXPR:
5989 case LT_EXPR:
5990 case GE_EXPR:
5991 case LE_EXPR:
5992 case EQ_EXPR:
5993 case NE_EXPR:
5994 if ((complain & tf_warning)
5995 && ((code_orig_arg1 == BOOLEAN_TYPE)
5996 ^ (code_orig_arg2 == BOOLEAN_TYPE)))
5997 maybe_warn_bool_compare (loc, code, arg1, arg2);
5998 if (complain & tf_warning && warn_tautological_compare)
5999 warn_tautological_cmp (loc, code, arg1, arg2);
6000 /* Fall through. */
6001 case PLUS_EXPR:
6002 case MINUS_EXPR:
6003 case MULT_EXPR:
6004 case TRUNC_DIV_EXPR:
6005 case MAX_EXPR:
6006 case MIN_EXPR:
6007 case LSHIFT_EXPR:
6008 case RSHIFT_EXPR:
6009 case TRUNC_MOD_EXPR:
6010 case BIT_AND_EXPR:
6011 case BIT_IOR_EXPR:
6012 case BIT_XOR_EXPR:
6013 return cp_build_binary_op (loc, code, arg1, arg2, complain);
6015 case UNARY_PLUS_EXPR:
6016 case NEGATE_EXPR:
6017 case BIT_NOT_EXPR:
6018 case TRUTH_NOT_EXPR:
6019 case PREINCREMENT_EXPR:
6020 case POSTINCREMENT_EXPR:
6021 case PREDECREMENT_EXPR:
6022 case POSTDECREMENT_EXPR:
6023 case REALPART_EXPR:
6024 case IMAGPART_EXPR:
6025 case ABS_EXPR:
6026 return cp_build_unary_op (code, arg1, candidates != 0, complain);
6028 case ARRAY_REF:
6029 return cp_build_array_ref (input_location, arg1, arg2, complain);
6031 case MEMBER_REF:
6032 return build_m_component_ref (cp_build_indirect_ref (arg1, RO_ARROW_STAR,
6033 complain),
6034 arg2, complain);
6036 /* The caller will deal with these. */
6037 case ADDR_EXPR:
6038 case COMPONENT_REF:
6039 case COMPOUND_EXPR:
6040 return NULL_TREE;
6042 default:
6043 gcc_unreachable ();
6045 return NULL_TREE;
6048 /* Wrapper for above. */
6050 tree
6051 build_new_op (location_t loc, enum tree_code code, int flags,
6052 tree arg1, tree arg2, tree arg3,
6053 tree *overload, tsubst_flags_t complain)
6055 tree ret;
6056 bool subtime = timevar_cond_start (TV_OVERLOAD);
6057 ret = build_new_op_1 (loc, code, flags, arg1, arg2, arg3,
6058 overload, complain);
6059 timevar_cond_stop (TV_OVERLOAD, subtime);
6060 return ret;
6063 /* CALL was returned by some call-building function; extract the actual
6064 CALL_EXPR from any bits that have been tacked on, e.g. by
6065 convert_from_reference. */
6067 tree
6068 extract_call_expr (tree call)
6070 while (TREE_CODE (call) == COMPOUND_EXPR)
6071 call = TREE_OPERAND (call, 1);
6072 if (REFERENCE_REF_P (call))
6073 call = TREE_OPERAND (call, 0);
6074 if (TREE_CODE (call) == TARGET_EXPR)
6075 call = TARGET_EXPR_INITIAL (call);
6076 gcc_assert (TREE_CODE (call) == CALL_EXPR
6077 || TREE_CODE (call) == AGGR_INIT_EXPR
6078 || call == error_mark_node);
6079 return call;
6082 /* Returns true if FN has two parameters, of which the second has type
6083 size_t. */
6085 static bool
6086 second_parm_is_size_t (tree fn)
6088 tree t = FUNCTION_ARG_CHAIN (fn);
6089 if (!t || !same_type_p (TREE_VALUE (t), size_type_node))
6090 return false;
6091 t = TREE_CHAIN (t);
6092 if (t == void_list_node)
6093 return true;
6094 if (aligned_new_threshold && t
6095 && same_type_p (TREE_VALUE (t), align_type_node)
6096 && TREE_CHAIN (t) == void_list_node)
6097 return true;
6098 return false;
6101 /* True if T, an allocation function, has std::align_val_t as its second
6102 argument. */
6104 bool
6105 aligned_allocation_fn_p (tree t)
6107 if (!aligned_new_threshold)
6108 return false;
6110 tree a = FUNCTION_ARG_CHAIN (t);
6111 return (a && same_type_p (TREE_VALUE (a), align_type_node));
6114 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6115 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6116 std::align_val_t. */
6118 static bool
6119 aligned_deallocation_fn_p (tree t)
6121 if (!aligned_new_threshold)
6122 return false;
6124 /* A template instance is never a usual deallocation function,
6125 regardless of its signature. */
6126 if (TREE_CODE (t) == TEMPLATE_DECL
6127 || primary_template_specialization_p (t))
6128 return false;
6130 tree a = FUNCTION_ARG_CHAIN (t);
6131 if (same_type_p (TREE_VALUE (a), align_type_node)
6132 && TREE_CHAIN (a) == void_list_node)
6133 return true;
6134 if (!same_type_p (TREE_VALUE (a), size_type_node))
6135 return false;
6136 a = TREE_CHAIN (a);
6137 if (a && same_type_p (TREE_VALUE (a), align_type_node)
6138 && TREE_CHAIN (a) == void_list_node)
6139 return true;
6140 return false;
6143 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6144 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6146 bool
6147 usual_deallocation_fn_p (tree t)
6149 /* A template instance is never a usual deallocation function,
6150 regardless of its signature. */
6151 if (TREE_CODE (t) == TEMPLATE_DECL
6152 || primary_template_specialization_p (t))
6153 return false;
6155 /* If a class T has a member deallocation function named operator delete
6156 with exactly one parameter, then that function is a usual
6157 (non-placement) deallocation function. If class T does not declare
6158 such an operator delete but does declare a member deallocation
6159 function named operator delete with exactly two parameters, the second
6160 of which has type std::size_t (18.2), then this function is a usual
6161 deallocation function. */
6162 bool global = DECL_NAMESPACE_SCOPE_P (t);
6163 tree chain = FUNCTION_ARG_CHAIN (t);
6164 if (!chain)
6165 return false;
6166 if (chain == void_list_node
6167 || ((!global || flag_sized_deallocation)
6168 && second_parm_is_size_t (t)))
6169 return true;
6170 if (aligned_deallocation_fn_p (t))
6171 return true;
6172 return false;
6175 /* Build a call to operator delete. This has to be handled very specially,
6176 because the restrictions on what signatures match are different from all
6177 other call instances. For a normal delete, only a delete taking (void *)
6178 or (void *, size_t) is accepted. For a placement delete, only an exact
6179 match with the placement new is accepted.
6181 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6182 ADDR is the pointer to be deleted.
6183 SIZE is the size of the memory block to be deleted.
6184 GLOBAL_P is true if the delete-expression should not consider
6185 class-specific delete operators.
6186 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6188 If this call to "operator delete" is being generated as part to
6189 deallocate memory allocated via a new-expression (as per [expr.new]
6190 which requires that if the initialization throws an exception then
6191 we call a deallocation function), then ALLOC_FN is the allocation
6192 function. */
6194 tree
6195 build_op_delete_call (enum tree_code code, tree addr, tree size,
6196 bool global_p, tree placement,
6197 tree alloc_fn, tsubst_flags_t complain)
6199 tree fn = NULL_TREE;
6200 tree fns, fnname, type, t;
6202 if (addr == error_mark_node)
6203 return error_mark_node;
6205 type = strip_array_types (TREE_TYPE (TREE_TYPE (addr)));
6207 fnname = ovl_op_identifier (false, code);
6209 if (CLASS_TYPE_P (type)
6210 && COMPLETE_TYPE_P (complete_type (type))
6211 && !global_p)
6212 /* In [class.free]
6214 If the result of the lookup is ambiguous or inaccessible, or if
6215 the lookup selects a placement deallocation function, the
6216 program is ill-formed.
6218 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6220 fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1);
6221 if (fns == error_mark_node)
6222 return error_mark_node;
6224 else
6225 fns = NULL_TREE;
6227 if (fns == NULL_TREE)
6228 fns = lookup_name_nonclass (fnname);
6230 /* Strip const and volatile from addr. */
6231 addr = cp_convert (ptr_type_node, addr, complain);
6233 if (placement)
6235 /* "A declaration of a placement deallocation function matches the
6236 declaration of a placement allocation function if it has the same
6237 number of parameters and, after parameter transformations (8.3.5),
6238 all parameter types except the first are identical."
6240 So we build up the function type we want and ask instantiate_type
6241 to get it for us. */
6242 t = FUNCTION_ARG_CHAIN (alloc_fn);
6243 t = tree_cons (NULL_TREE, ptr_type_node, t);
6244 t = build_function_type (void_type_node, t);
6246 fn = instantiate_type (t, fns, tf_none);
6247 if (fn == error_mark_node)
6248 return NULL_TREE;
6250 fn = MAYBE_BASELINK_FUNCTIONS (fn);
6252 /* "If the lookup finds the two-parameter form of a usual deallocation
6253 function (3.7.4.2) and that function, considered as a placement
6254 deallocation function, would have been selected as a match for the
6255 allocation function, the program is ill-formed." */
6256 if (second_parm_is_size_t (fn))
6258 const char *const msg1
6259 = G_("exception cleanup for this placement new selects "
6260 "non-placement operator delete");
6261 const char *const msg2
6262 = G_("%qD is a usual (non-placement) deallocation "
6263 "function in C++14 (or with -fsized-deallocation)");
6265 /* But if the class has an operator delete (void *), then that is
6266 the usual deallocation function, so we shouldn't complain
6267 about using the operator delete (void *, size_t). */
6268 if (DECL_CLASS_SCOPE_P (fn))
6269 for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (fns));
6270 iter; ++iter)
6272 tree elt = *iter;
6273 if (usual_deallocation_fn_p (elt)
6274 && FUNCTION_ARG_CHAIN (elt) == void_list_node)
6275 goto ok;
6277 /* Before C++14 a two-parameter global deallocation function is
6278 always a placement deallocation function, but warn if
6279 -Wc++14-compat. */
6280 else if (!flag_sized_deallocation)
6282 if ((complain & tf_warning)
6283 && warning (OPT_Wc__14_compat, msg1))
6284 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
6285 goto ok;
6288 if (complain & tf_warning_or_error)
6290 if (permerror (input_location, msg1))
6292 /* Only mention C++14 for namespace-scope delete. */
6293 if (DECL_NAMESPACE_SCOPE_P (fn))
6294 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
6295 else
6296 inform (DECL_SOURCE_LOCATION (fn),
6297 "%qD is a usual (non-placement) deallocation "
6298 "function", fn);
6301 else
6302 return error_mark_node;
6303 ok:;
6306 else
6307 /* "Any non-placement deallocation function matches a non-placement
6308 allocation function. If the lookup finds a single matching
6309 deallocation function, that function will be called; otherwise, no
6310 deallocation function will be called." */
6311 for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (fns)); iter; ++iter)
6313 tree elt = *iter;
6314 if (usual_deallocation_fn_p (elt))
6316 if (!fn)
6318 fn = elt;
6319 continue;
6322 /* -- If the type has new-extended alignment, a function with a
6323 parameter of type std::align_val_t is preferred; otherwise a
6324 function without such a parameter is preferred. If exactly one
6325 preferred function is found, that function is selected and the
6326 selection process terminates. If more than one preferred
6327 function is found, all non-preferred functions are eliminated
6328 from further consideration. */
6329 if (aligned_new_threshold)
6331 bool want_align = type_has_new_extended_alignment (type);
6332 bool fn_align = aligned_deallocation_fn_p (fn);
6333 bool elt_align = aligned_deallocation_fn_p (elt);
6335 if (elt_align != fn_align)
6337 if (want_align == elt_align)
6338 fn = elt;
6339 continue;
6343 /* -- If the deallocation functions have class scope, the one
6344 without a parameter of type std::size_t is selected. */
6345 bool want_size;
6346 if (DECL_CLASS_SCOPE_P (fn))
6347 want_size = false;
6349 /* -- If the type is complete and if, for the second alternative
6350 (delete array) only, the operand is a pointer to a class type
6351 with a non-trivial destructor or a (possibly multi-dimensional)
6352 array thereof, the function with a parameter of type std::size_t
6353 is selected.
6355 -- Otherwise, it is unspecified whether a deallocation function
6356 with a parameter of type std::size_t is selected. */
6357 else
6359 want_size = COMPLETE_TYPE_P (type);
6360 if (code == VEC_DELETE_EXPR
6361 && !TYPE_VEC_NEW_USES_COOKIE (type))
6362 /* We need a cookie to determine the array size. */
6363 want_size = false;
6365 bool fn_size = second_parm_is_size_t (fn);
6366 bool elt_size = second_parm_is_size_t (elt);
6367 gcc_assert (fn_size != elt_size);
6368 if (want_size == elt_size)
6369 fn = elt;
6373 /* If we have a matching function, call it. */
6374 if (fn)
6376 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
6378 /* If the FN is a member function, make sure that it is
6379 accessible. */
6380 if (BASELINK_P (fns))
6381 perform_or_defer_access_check (BASELINK_BINFO (fns), fn, fn,
6382 complain);
6384 /* Core issue 901: It's ok to new a type with deleted delete. */
6385 if (DECL_DELETED_FN (fn) && alloc_fn)
6386 return NULL_TREE;
6388 if (placement)
6390 /* The placement args might not be suitable for overload
6391 resolution at this point, so build the call directly. */
6392 int nargs = call_expr_nargs (placement);
6393 tree *argarray = XALLOCAVEC (tree, nargs);
6394 int i;
6395 argarray[0] = addr;
6396 for (i = 1; i < nargs; i++)
6397 argarray[i] = CALL_EXPR_ARG (placement, i);
6398 if (!mark_used (fn, complain) && !(complain & tf_error))
6399 return error_mark_node;
6400 return build_cxx_call (fn, nargs, argarray, complain);
6402 else
6404 tree ret;
6405 vec<tree, va_gc> *args = make_tree_vector ();
6406 args->quick_push (addr);
6407 if (second_parm_is_size_t (fn))
6408 args->quick_push (size);
6409 if (aligned_deallocation_fn_p (fn))
6411 tree al = build_int_cst (align_type_node, TYPE_ALIGN_UNIT (type));
6412 args->quick_push (al);
6414 ret = cp_build_function_call_vec (fn, &args, complain);
6415 release_tree_vector (args);
6416 return ret;
6420 /* [expr.new]
6422 If no unambiguous matching deallocation function can be found,
6423 propagating the exception does not cause the object's memory to
6424 be freed. */
6425 if (alloc_fn)
6427 if ((complain & tf_warning)
6428 && !placement)
6429 warning (0, "no corresponding deallocation function for %qD",
6430 alloc_fn);
6431 return NULL_TREE;
6434 if (complain & tf_error)
6435 error ("no suitable %<operator %s%> for %qT",
6436 OVL_OP_INFO (false, code)->name, type);
6437 return error_mark_node;
6440 /* If the current scope isn't allowed to access DECL along
6441 BASETYPE_PATH, give an error. The most derived class in
6442 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6443 the declaration to use in the error diagnostic. */
6445 bool
6446 enforce_access (tree basetype_path, tree decl, tree diag_decl,
6447 tsubst_flags_t complain, access_failure_info *afi)
6449 gcc_assert (TREE_CODE (basetype_path) == TREE_BINFO);
6451 if (flag_new_inheriting_ctors
6452 && DECL_INHERITED_CTOR (decl))
6454 /* 7.3.3/18: The additional constructors are accessible if they would be
6455 accessible when used to construct an object of the corresponding base
6456 class. */
6457 decl = strip_inheriting_ctors (decl);
6458 basetype_path = lookup_base (basetype_path, DECL_CONTEXT (decl),
6459 ba_any, NULL, complain);
6462 if (!accessible_p (basetype_path, decl, true))
6464 if (complain & tf_error)
6466 if (flag_new_inheriting_ctors)
6467 diag_decl = strip_inheriting_ctors (diag_decl);
6468 if (TREE_PRIVATE (decl))
6470 error ("%q#D is private within this context", diag_decl);
6471 inform (DECL_SOURCE_LOCATION (diag_decl),
6472 "declared private here");
6473 if (afi)
6474 afi->record_access_failure (basetype_path, diag_decl);
6476 else if (TREE_PROTECTED (decl))
6478 error ("%q#D is protected within this context", diag_decl);
6479 inform (DECL_SOURCE_LOCATION (diag_decl),
6480 "declared protected here");
6481 if (afi)
6482 afi->record_access_failure (basetype_path, diag_decl);
6484 else
6486 error ("%q#D is inaccessible within this context", diag_decl);
6487 inform (DECL_SOURCE_LOCATION (diag_decl), "declared here");
6488 if (afi)
6489 afi->record_access_failure (basetype_path, diag_decl);
6492 return false;
6495 return true;
6498 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6499 bitwise or of LOOKUP_* values. If any errors are warnings are
6500 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6501 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6502 to NULL. */
6504 static tree
6505 build_temp (tree expr, tree type, int flags,
6506 diagnostic_t *diagnostic_kind, tsubst_flags_t complain)
6508 int savew, savee;
6509 vec<tree, va_gc> *args;
6511 *diagnostic_kind = DK_UNSPECIFIED;
6513 /* If the source is a packed field, calling the copy constructor will require
6514 binding the field to the reference parameter to the copy constructor, and
6515 we'll end up with an infinite loop. If we can use a bitwise copy, then
6516 do that now. */
6517 if ((lvalue_kind (expr) & clk_packed)
6518 && CLASS_TYPE_P (TREE_TYPE (expr))
6519 && !type_has_nontrivial_copy_init (TREE_TYPE (expr)))
6520 return get_target_expr_sfinae (expr, complain);
6522 savew = warningcount + werrorcount, savee = errorcount;
6523 args = make_tree_vector_single (expr);
6524 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
6525 &args, type, flags, complain);
6526 release_tree_vector (args);
6527 if (warningcount + werrorcount > savew)
6528 *diagnostic_kind = DK_WARNING;
6529 else if (errorcount > savee)
6530 *diagnostic_kind = DK_ERROR;
6531 return expr;
6534 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6535 EXPR is implicitly converted to type TOTYPE.
6536 FN and ARGNUM are used for diagnostics. */
6538 static void
6539 conversion_null_warnings (tree totype, tree expr, tree fn, int argnum)
6541 /* Issue warnings about peculiar, but valid, uses of NULL. */
6542 if (null_node_p (expr) && TREE_CODE (totype) != BOOLEAN_TYPE
6543 && ARITHMETIC_TYPE_P (totype))
6545 source_location loc =
6546 expansion_point_location_if_in_system_header (input_location);
6548 if (fn)
6549 warning_at (loc, OPT_Wconversion_null,
6550 "passing NULL to non-pointer argument %P of %qD",
6551 argnum, fn);
6552 else
6553 warning_at (loc, OPT_Wconversion_null,
6554 "converting to non-pointer type %qT from NULL", totype);
6557 /* Issue warnings if "false" is converted to a NULL pointer */
6558 else if (TREE_CODE (TREE_TYPE (expr)) == BOOLEAN_TYPE
6559 && TYPE_PTR_P (totype))
6561 if (fn)
6562 warning_at (input_location, OPT_Wconversion_null,
6563 "converting %<false%> to pointer type for argument %P "
6564 "of %qD", argnum, fn);
6565 else
6566 warning_at (input_location, OPT_Wconversion_null,
6567 "converting %<false%> to pointer type %qT", totype);
6571 /* We gave a diagnostic during a conversion. If this was in the second
6572 standard conversion sequence of a user-defined conversion sequence, say
6573 which user-defined conversion. */
6575 static void
6576 maybe_print_user_conv_context (conversion *convs)
6578 if (convs->user_conv_p)
6579 for (conversion *t = convs; t; t = next_conversion (t))
6580 if (t->kind == ck_user)
6582 print_z_candidate (0, " after user-defined conversion:",
6583 t->cand);
6584 break;
6588 /* Locate the parameter with the given index within FNDECL.
6589 ARGNUM is zero based, -1 indicates the `this' argument of a method.
6590 Return the location of the FNDECL itself if there are problems. */
6592 static location_t
6593 get_fndecl_argument_location (tree fndecl, int argnum)
6595 int i;
6596 tree param;
6598 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6599 for (i = 0, param = FUNCTION_FIRST_USER_PARM (fndecl);
6600 i < argnum && param;
6601 i++, param = TREE_CHAIN (param))
6604 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6605 return the location of FNDECL. */
6606 if (param == NULL)
6607 return DECL_SOURCE_LOCATION (fndecl);
6609 return DECL_SOURCE_LOCATION (param);
6612 /* Perform the conversions in CONVS on the expression EXPR. FN and
6613 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6614 indicates the `this' argument of a method. INNER is nonzero when
6615 being called to continue a conversion chain. It is negative when a
6616 reference binding will be applied, positive otherwise. If
6617 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6618 conversions will be emitted if appropriate. If C_CAST_P is true,
6619 this conversion is coming from a C-style cast; in that case,
6620 conversions to inaccessible bases are permitted. */
6622 static tree
6623 convert_like_real (conversion *convs, tree expr, tree fn, int argnum,
6624 bool issue_conversion_warnings,
6625 bool c_cast_p, tsubst_flags_t complain)
6627 tree totype = convs->type;
6628 diagnostic_t diag_kind;
6629 int flags;
6630 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
6632 if (convs->bad_p && !(complain & tf_error))
6633 return error_mark_node;
6635 if (convs->bad_p
6636 && convs->kind != ck_user
6637 && convs->kind != ck_list
6638 && convs->kind != ck_ambig
6639 && (convs->kind != ck_ref_bind
6640 || (convs->user_conv_p && next_conversion (convs)->bad_p))
6641 && (convs->kind != ck_rvalue
6642 || SCALAR_TYPE_P (totype))
6643 && convs->kind != ck_base)
6645 bool complained = false;
6646 conversion *t = convs;
6648 /* Give a helpful error if this is bad because of excess braces. */
6649 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6650 && SCALAR_TYPE_P (totype)
6651 && CONSTRUCTOR_NELTS (expr) > 0
6652 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr, 0)->value))
6654 complained = permerror (loc, "too many braces around initializer "
6655 "for %qT", totype);
6656 while (BRACE_ENCLOSED_INITIALIZER_P (expr)
6657 && CONSTRUCTOR_NELTS (expr) == 1)
6658 expr = CONSTRUCTOR_ELT (expr, 0)->value;
6661 /* Give a helpful error if this is bad because a conversion to bool
6662 from std::nullptr_t requires direct-initialization. */
6663 if (NULLPTR_TYPE_P (TREE_TYPE (expr))
6664 && TREE_CODE (totype) == BOOLEAN_TYPE)
6665 complained = permerror (loc, "converting to %qH from %qI requires "
6666 "direct-initialization",
6667 totype, TREE_TYPE (expr));
6669 for (; t ; t = next_conversion (t))
6671 if (t->kind == ck_user && t->cand->reason)
6673 complained = permerror (loc, "invalid user-defined conversion "
6674 "from %qH to %qI", TREE_TYPE (expr),
6675 totype);
6676 if (complained)
6677 print_z_candidate (loc, "candidate is:", t->cand);
6678 expr = convert_like_real (t, expr, fn, argnum,
6679 /*issue_conversion_warnings=*/false,
6680 /*c_cast_p=*/false,
6681 complain);
6682 if (convs->kind == ck_ref_bind)
6683 expr = convert_to_reference (totype, expr, CONV_IMPLICIT,
6684 LOOKUP_NORMAL, NULL_TREE,
6685 complain);
6686 else
6687 expr = cp_convert (totype, expr, complain);
6688 if (complained && fn)
6689 inform (DECL_SOURCE_LOCATION (fn),
6690 " initializing argument %P of %qD", argnum, fn);
6691 return expr;
6693 else if (t->kind == ck_user || !t->bad_p)
6695 expr = convert_like_real (t, expr, fn, argnum,
6696 /*issue_conversion_warnings=*/false,
6697 /*c_cast_p=*/false,
6698 complain);
6699 break;
6701 else if (t->kind == ck_ambig)
6702 return convert_like_real (t, expr, fn, argnum,
6703 /*issue_conversion_warnings=*/false,
6704 /*c_cast_p=*/false,
6705 complain);
6706 else if (t->kind == ck_identity)
6707 break;
6709 if (!complained)
6710 complained = permerror (loc, "invalid conversion from %qH to %qI",
6711 TREE_TYPE (expr), totype);
6712 if (complained && fn)
6713 inform (get_fndecl_argument_location (fn, argnum),
6714 " initializing argument %P of %qD", argnum, fn);
6716 return cp_convert (totype, expr, complain);
6719 if (issue_conversion_warnings && (complain & tf_warning))
6720 conversion_null_warnings (totype, expr, fn, argnum);
6722 switch (convs->kind)
6724 case ck_user:
6726 struct z_candidate *cand = convs->cand;
6728 if (cand == NULL)
6729 /* We chose the surrogate function from add_conv_candidate, now we
6730 actually need to build the conversion. */
6731 cand = build_user_type_conversion_1 (totype, expr,
6732 LOOKUP_NO_CONVERSION, complain);
6734 tree convfn = cand->fn;
6736 /* When converting from an init list we consider explicit
6737 constructors, but actually trying to call one is an error. */
6738 if (DECL_NONCONVERTING_P (convfn) && DECL_CONSTRUCTOR_P (convfn)
6739 && BRACE_ENCLOSED_INITIALIZER_P (expr)
6740 /* Unless this is for direct-list-initialization. */
6741 && !CONSTRUCTOR_IS_DIRECT_INIT (expr)
6742 /* And in C++98 a default constructor can't be explicit. */
6743 && cxx_dialect >= cxx11)
6745 if (!(complain & tf_error))
6746 return error_mark_node;
6747 location_t loc = location_of (expr);
6748 if (CONSTRUCTOR_NELTS (expr) == 0
6749 && FUNCTION_FIRST_USER_PARMTYPE (convfn) != void_list_node)
6751 if (pedwarn (loc, 0, "converting to %qT from initializer list "
6752 "would use explicit constructor %qD",
6753 totype, convfn))
6754 inform (loc, "in C++11 and above a default constructor "
6755 "can be explicit");
6757 else
6758 error ("converting to %qT from initializer list would use "
6759 "explicit constructor %qD", totype, convfn);
6762 /* If we're initializing from {}, it's value-initialization. */
6763 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6764 && CONSTRUCTOR_NELTS (expr) == 0
6765 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
6767 bool direct = CONSTRUCTOR_IS_DIRECT_INIT (expr);
6768 if (abstract_virtuals_error_sfinae (NULL_TREE, totype, complain))
6769 return error_mark_node;
6770 expr = build_value_init (totype, complain);
6771 expr = get_target_expr_sfinae (expr, complain);
6772 if (expr != error_mark_node)
6774 TARGET_EXPR_LIST_INIT_P (expr) = true;
6775 TARGET_EXPR_DIRECT_INIT_P (expr) = direct;
6777 return expr;
6780 expr = mark_rvalue_use (expr);
6782 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
6783 any more UDCs. */
6784 expr = build_over_call (cand, LOOKUP_NORMAL|LOOKUP_NO_CONVERSION,
6785 complain);
6787 /* If this is a constructor or a function returning an aggr type,
6788 we need to build up a TARGET_EXPR. */
6789 if (DECL_CONSTRUCTOR_P (convfn))
6791 expr = build_cplus_new (totype, expr, complain);
6793 /* Remember that this was list-initialization. */
6794 if (convs->check_narrowing && expr != error_mark_node)
6795 TARGET_EXPR_LIST_INIT_P (expr) = true;
6798 return expr;
6800 case ck_identity:
6801 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
6803 int nelts = CONSTRUCTOR_NELTS (expr);
6804 if (nelts == 0)
6805 expr = build_value_init (totype, complain);
6806 else if (nelts == 1)
6807 expr = CONSTRUCTOR_ELT (expr, 0)->value;
6808 else
6809 gcc_unreachable ();
6811 expr = mark_use (expr, /*rvalue_p=*/!convs->rvaluedness_matches_p,
6812 /*read_p=*/true, UNKNOWN_LOCATION,
6813 /*reject_builtin=*/true);
6815 if (type_unknown_p (expr))
6816 expr = instantiate_type (totype, expr, complain);
6817 if (expr == null_node
6818 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype))
6819 /* If __null has been converted to an integer type, we do not want to
6820 continue to warn about uses of EXPR as an integer, rather than as a
6821 pointer. */
6822 expr = build_int_cst (totype, 0);
6823 return expr;
6824 case ck_ambig:
6825 /* We leave bad_p off ck_ambig because overload resolution considers
6826 it valid, it just fails when we try to perform it. So we need to
6827 check complain here, too. */
6828 if (complain & tf_error)
6830 /* Call build_user_type_conversion again for the error. */
6831 build_user_type_conversion (totype, convs->u.expr, LOOKUP_IMPLICIT,
6832 complain);
6833 if (fn)
6834 inform (DECL_SOURCE_LOCATION (fn),
6835 " initializing argument %P of %qD", argnum, fn);
6837 return error_mark_node;
6839 case ck_list:
6841 /* Conversion to std::initializer_list<T>. */
6842 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype), 0);
6843 tree new_ctor = build_constructor (init_list_type_node, NULL);
6844 unsigned len = CONSTRUCTOR_NELTS (expr);
6845 tree array, val, field;
6846 vec<constructor_elt, va_gc> *vec = NULL;
6847 unsigned ix;
6849 /* Convert all the elements. */
6850 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr), ix, val)
6852 tree sub = convert_like_real (convs->u.list[ix], val, fn, argnum,
6853 false, false, complain);
6854 if (sub == error_mark_node)
6855 return sub;
6856 if (!BRACE_ENCLOSED_INITIALIZER_P (val)
6857 && !check_narrowing (TREE_TYPE (sub), val, complain))
6858 return error_mark_node;
6859 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor), NULL_TREE, sub);
6860 if (!TREE_CONSTANT (sub))
6861 TREE_CONSTANT (new_ctor) = false;
6863 /* Build up the array. */
6864 elttype = cp_build_qualified_type
6865 (elttype, cp_type_quals (elttype) | TYPE_QUAL_CONST);
6866 array = build_array_of_n_type (elttype, len);
6867 array = finish_compound_literal (array, new_ctor, complain);
6868 /* Take the address explicitly rather than via decay_conversion
6869 to avoid the error about taking the address of a temporary. */
6870 array = cp_build_addr_expr (array, complain);
6871 array = cp_convert (build_pointer_type (elttype), array, complain);
6872 if (array == error_mark_node)
6873 return error_mark_node;
6875 /* Build up the initializer_list object. */
6876 totype = complete_type (totype);
6877 field = next_initializable_field (TYPE_FIELDS (totype));
6878 CONSTRUCTOR_APPEND_ELT (vec, field, array);
6879 field = next_initializable_field (DECL_CHAIN (field));
6880 CONSTRUCTOR_APPEND_ELT (vec, field, size_int (len));
6881 new_ctor = build_constructor (totype, vec);
6882 return get_target_expr_sfinae (new_ctor, complain);
6885 case ck_aggr:
6886 if (TREE_CODE (totype) == COMPLEX_TYPE)
6888 tree real = CONSTRUCTOR_ELT (expr, 0)->value;
6889 tree imag = CONSTRUCTOR_ELT (expr, 1)->value;
6890 real = perform_implicit_conversion (TREE_TYPE (totype),
6891 real, complain);
6892 imag = perform_implicit_conversion (TREE_TYPE (totype),
6893 imag, complain);
6894 expr = build2 (COMPLEX_EXPR, totype, real, imag);
6895 return expr;
6897 expr = reshape_init (totype, expr, complain);
6898 expr = get_target_expr_sfinae (digest_init (totype, expr, complain),
6899 complain);
6900 if (expr != error_mark_node)
6901 TARGET_EXPR_LIST_INIT_P (expr) = true;
6902 return expr;
6904 default:
6905 break;
6908 expr = convert_like_real (next_conversion (convs), expr, fn, argnum,
6909 convs->kind == ck_ref_bind
6910 ? issue_conversion_warnings : false,
6911 c_cast_p, complain);
6912 if (expr == error_mark_node)
6913 return error_mark_node;
6915 switch (convs->kind)
6917 case ck_rvalue:
6918 expr = decay_conversion (expr, complain);
6919 if (expr == error_mark_node)
6921 if (complain & tf_error)
6923 maybe_print_user_conv_context (convs);
6924 if (fn)
6925 inform (DECL_SOURCE_LOCATION (fn),
6926 " initializing argument %P of %qD", argnum, fn);
6928 return error_mark_node;
6931 if (! MAYBE_CLASS_TYPE_P (totype))
6932 return expr;
6934 /* Don't introduce copies when passing arguments along to the inherited
6935 constructor. */
6936 if (current_function_decl
6937 && flag_new_inheriting_ctors
6938 && DECL_INHERITED_CTOR (current_function_decl))
6939 return expr;
6941 if (TREE_CODE (expr) == TARGET_EXPR
6942 && TARGET_EXPR_LIST_INIT_P (expr))
6943 /* Copy-list-initialization doesn't actually involve a copy. */
6944 return expr;
6946 /* Fall through. */
6947 case ck_base:
6948 if (convs->kind == ck_base && !convs->need_temporary_p)
6950 /* We are going to bind a reference directly to a base-class
6951 subobject of EXPR. */
6952 /* Build an expression for `*((base*) &expr)'. */
6953 expr = convert_to_base (expr, totype,
6954 !c_cast_p, /*nonnull=*/true, complain);
6955 return expr;
6958 /* Copy-initialization where the cv-unqualified version of the source
6959 type is the same class as, or a derived class of, the class of the
6960 destination [is treated as direct-initialization]. [dcl.init] */
6961 flags = LOOKUP_NORMAL;
6962 if (convs->user_conv_p)
6963 /* This conversion is being done in the context of a user-defined
6964 conversion (i.e. the second step of copy-initialization), so
6965 don't allow any more. */
6966 flags |= LOOKUP_NO_CONVERSION;
6967 else
6968 flags |= LOOKUP_ONLYCONVERTING;
6969 if (convs->rvaluedness_matches_p)
6970 /* standard_conversion got LOOKUP_PREFER_RVALUE. */
6971 flags |= LOOKUP_PREFER_RVALUE;
6972 expr = build_temp (expr, totype, flags, &diag_kind, complain);
6973 if (diag_kind && complain)
6975 maybe_print_user_conv_context (convs);
6976 if (fn)
6977 inform (DECL_SOURCE_LOCATION (fn),
6978 " initializing argument %P of %qD", argnum, fn);
6981 return build_cplus_new (totype, expr, complain);
6983 case ck_ref_bind:
6985 tree ref_type = totype;
6987 if (convs->bad_p && !next_conversion (convs)->bad_p)
6989 tree extype = TREE_TYPE (expr);
6990 if (TYPE_REF_IS_RVALUE (ref_type)
6991 && lvalue_p (expr))
6992 error_at (loc, "cannot bind rvalue reference of type %qH to "
6993 "lvalue of type %qI", totype, extype);
6994 else if (!TYPE_REF_IS_RVALUE (ref_type) && !lvalue_p (expr)
6995 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type)))
6996 error_at (loc, "cannot bind non-const lvalue reference of "
6997 "type %qH to an rvalue of type %qI", totype, extype);
6998 else if (!reference_compatible_p (TREE_TYPE (totype), extype))
6999 error_at (loc, "binding reference of type %qH to %qI "
7000 "discards qualifiers", totype, extype);
7001 else
7002 gcc_unreachable ();
7003 maybe_print_user_conv_context (convs);
7004 if (fn)
7005 inform (DECL_SOURCE_LOCATION (fn),
7006 " initializing argument %P of %qD", argnum, fn);
7007 return error_mark_node;
7010 /* If necessary, create a temporary.
7012 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
7013 that need temporaries, even when their types are reference
7014 compatible with the type of reference being bound, so the
7015 upcoming call to cp_build_addr_expr doesn't fail. */
7016 if (convs->need_temporary_p
7017 || TREE_CODE (expr) == CONSTRUCTOR
7018 || TREE_CODE (expr) == VA_ARG_EXPR)
7020 /* Otherwise, a temporary of type "cv1 T1" is created and
7021 initialized from the initializer expression using the rules
7022 for a non-reference copy-initialization (8.5). */
7024 tree type = TREE_TYPE (ref_type);
7025 cp_lvalue_kind lvalue = lvalue_kind (expr);
7027 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7028 (type, next_conversion (convs)->type));
7029 if (!CP_TYPE_CONST_NON_VOLATILE_P (type)
7030 && !TYPE_REF_IS_RVALUE (ref_type))
7032 /* If the reference is volatile or non-const, we
7033 cannot create a temporary. */
7034 if (lvalue & clk_bitfield)
7035 error_at (loc, "cannot bind bitfield %qE to %qT",
7036 expr, ref_type);
7037 else if (lvalue & clk_packed)
7038 error_at (loc, "cannot bind packed field %qE to %qT",
7039 expr, ref_type);
7040 else
7041 error_at (loc, "cannot bind rvalue %qE to %qT",
7042 expr, ref_type);
7043 return error_mark_node;
7045 /* If the source is a packed field, and we must use a copy
7046 constructor, then building the target expr will require
7047 binding the field to the reference parameter to the
7048 copy constructor, and we'll end up with an infinite
7049 loop. If we can use a bitwise copy, then we'll be
7050 OK. */
7051 if ((lvalue & clk_packed)
7052 && CLASS_TYPE_P (type)
7053 && type_has_nontrivial_copy_init (type))
7055 error_at (loc, "cannot bind packed field %qE to %qT",
7056 expr, ref_type);
7057 return error_mark_node;
7059 if (lvalue & clk_bitfield)
7061 expr = convert_bitfield_to_declared_type (expr);
7062 expr = fold_convert (type, expr);
7064 expr = build_target_expr_with_type (expr, type, complain);
7067 /* Take the address of the thing to which we will bind the
7068 reference. */
7069 expr = cp_build_addr_expr (expr, complain);
7070 if (expr == error_mark_node)
7071 return error_mark_node;
7073 /* Convert it to a pointer to the type referred to by the
7074 reference. This will adjust the pointer if a derived to
7075 base conversion is being performed. */
7076 expr = cp_convert (build_pointer_type (TREE_TYPE (ref_type)),
7077 expr, complain);
7078 /* Convert the pointer to the desired reference type. */
7079 return build_nop (ref_type, expr);
7082 case ck_lvalue:
7083 return decay_conversion (expr, complain);
7085 case ck_fnptr:
7086 /* ??? Should the address of a transaction-safe pointer point to the TM
7087 clone, and this conversion look up the primary function? */
7088 return build_nop (totype, expr);
7090 case ck_qual:
7091 /* Warn about deprecated conversion if appropriate. */
7092 string_conv_p (totype, expr, 1);
7093 break;
7095 case ck_ptr:
7096 if (convs->base_p)
7097 expr = convert_to_base (expr, totype, !c_cast_p,
7098 /*nonnull=*/false, complain);
7099 return build_nop (totype, expr);
7101 case ck_pmem:
7102 return convert_ptrmem (totype, expr, /*allow_inverse_p=*/false,
7103 c_cast_p, complain);
7105 default:
7106 break;
7109 if (convs->check_narrowing
7110 && !check_narrowing (totype, expr, complain))
7111 return error_mark_node;
7113 if (issue_conversion_warnings)
7114 expr = cp_convert_and_check (totype, expr, complain);
7115 else
7116 expr = cp_convert (totype, expr, complain);
7118 return expr;
7121 /* ARG is being passed to a varargs function. Perform any conversions
7122 required. Return the converted value. */
7124 tree
7125 convert_arg_to_ellipsis (tree arg, tsubst_flags_t complain)
7127 tree arg_type;
7128 location_t loc = EXPR_LOC_OR_LOC (arg, input_location);
7130 /* [expr.call]
7132 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7133 standard conversions are performed. */
7134 arg = decay_conversion (arg, complain);
7135 arg_type = TREE_TYPE (arg);
7136 /* [expr.call]
7138 If the argument has integral or enumeration type that is subject
7139 to the integral promotions (_conv.prom_), or a floating point
7140 type that is subject to the floating point promotion
7141 (_conv.fpprom_), the value of the argument is converted to the
7142 promoted type before the call. */
7143 if (TREE_CODE (arg_type) == REAL_TYPE
7144 && (TYPE_PRECISION (arg_type)
7145 < TYPE_PRECISION (double_type_node))
7146 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type)))
7148 if ((complain & tf_warning)
7149 && warn_double_promotion && !c_inhibit_evaluation_warnings)
7150 warning_at (loc, OPT_Wdouble_promotion,
7151 "implicit conversion from %qH to %qI when passing "
7152 "argument to function",
7153 arg_type, double_type_node);
7154 arg = convert_to_real_nofold (double_type_node, arg);
7156 else if (NULLPTR_TYPE_P (arg_type))
7157 arg = null_pointer_node;
7158 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type))
7160 if (SCOPED_ENUM_P (arg_type))
7162 tree prom = cp_convert (ENUM_UNDERLYING_TYPE (arg_type), arg,
7163 complain);
7164 prom = cp_perform_integral_promotions (prom, complain);
7165 if (abi_version_crosses (6)
7166 && TYPE_MODE (TREE_TYPE (prom)) != TYPE_MODE (arg_type)
7167 && (complain & tf_warning))
7168 warning_at (loc, OPT_Wabi, "scoped enum %qT passed through ... as "
7169 "%qT before -fabi-version=6, %qT after", arg_type,
7170 TREE_TYPE (prom), ENUM_UNDERLYING_TYPE (arg_type));
7171 if (!abi_version_at_least (6))
7172 arg = prom;
7174 else
7175 arg = cp_perform_integral_promotions (arg, complain);
7178 arg = require_complete_type_sfinae (arg, complain);
7179 arg_type = TREE_TYPE (arg);
7181 if (arg != error_mark_node
7182 /* In a template (or ill-formed code), we can have an incomplete type
7183 even after require_complete_type_sfinae, in which case we don't know
7184 whether it has trivial copy or not. */
7185 && COMPLETE_TYPE_P (arg_type)
7186 && !cp_unevaluated_operand)
7188 /* [expr.call] 5.2.2/7:
7189 Passing a potentially-evaluated argument of class type (Clause 9)
7190 with a non-trivial copy constructor or a non-trivial destructor
7191 with no corresponding parameter is conditionally-supported, with
7192 implementation-defined semantics.
7194 We support it as pass-by-invisible-reference, just like a normal
7195 value parameter.
7197 If the call appears in the context of a sizeof expression,
7198 it is not potentially-evaluated. */
7199 if (type_has_nontrivial_copy_init (arg_type)
7200 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type))
7202 arg = force_rvalue (arg, complain);
7203 if (complain & tf_warning)
7204 warning (OPT_Wconditionally_supported,
7205 "passing objects of non-trivially-copyable "
7206 "type %q#T through %<...%> is conditionally supported",
7207 arg_type);
7208 return cp_build_addr_expr (arg, complain);
7210 /* Build up a real lvalue-to-rvalue conversion in case the
7211 copy constructor is trivial but not callable. */
7212 else if (CLASS_TYPE_P (arg_type))
7213 force_rvalue (arg, complain);
7217 return arg;
7220 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7222 tree
7223 build_x_va_arg (source_location loc, tree expr, tree type)
7225 if (processing_template_decl)
7227 tree r = build_min (VA_ARG_EXPR, type, expr);
7228 SET_EXPR_LOCATION (r, loc);
7229 return r;
7232 type = complete_type_or_else (type, NULL_TREE);
7234 if (expr == error_mark_node || !type)
7235 return error_mark_node;
7237 expr = mark_lvalue_use (expr);
7239 if (TREE_CODE (type) == REFERENCE_TYPE)
7241 error ("cannot receive reference type %qT through %<...%>", type);
7242 return error_mark_node;
7245 if (type_has_nontrivial_copy_init (type)
7246 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
7248 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7249 it as pass by invisible reference. */
7250 warning_at (loc, OPT_Wconditionally_supported,
7251 "receiving objects of non-trivially-copyable type %q#T "
7252 "through %<...%> is conditionally-supported", type);
7254 tree ref = cp_build_reference_type (type, false);
7255 expr = build_va_arg (loc, expr, ref);
7256 return convert_from_reference (expr);
7259 tree ret = build_va_arg (loc, expr, type);
7260 if (CLASS_TYPE_P (type))
7261 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7262 know how to handle it. */
7263 ret = get_target_expr (ret);
7264 return ret;
7267 /* TYPE has been given to va_arg. Apply the default conversions which
7268 would have happened when passed via ellipsis. Return the promoted
7269 type, or the passed type if there is no change. */
7271 tree
7272 cxx_type_promotes_to (tree type)
7274 tree promote;
7276 /* Perform the array-to-pointer and function-to-pointer
7277 conversions. */
7278 type = type_decays_to (type);
7280 promote = type_promotes_to (type);
7281 if (same_type_p (type, promote))
7282 promote = type;
7284 return promote;
7287 /* ARG is a default argument expression being passed to a parameter of
7288 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7289 zero-based argument number. Do any required conversions. Return
7290 the converted value. */
7292 static GTY(()) vec<tree, va_gc> *default_arg_context;
7293 void
7294 push_defarg_context (tree fn)
7295 { vec_safe_push (default_arg_context, fn); }
7297 void
7298 pop_defarg_context (void)
7299 { default_arg_context->pop (); }
7301 tree
7302 convert_default_arg (tree type, tree arg, tree fn, int parmnum,
7303 tsubst_flags_t complain)
7305 int i;
7306 tree t;
7308 /* See through clones. */
7309 fn = DECL_ORIGIN (fn);
7310 /* And inheriting ctors. */
7311 if (flag_new_inheriting_ctors)
7312 fn = strip_inheriting_ctors (fn);
7314 /* Detect recursion. */
7315 FOR_EACH_VEC_SAFE_ELT (default_arg_context, i, t)
7316 if (t == fn)
7318 if (complain & tf_error)
7319 error ("recursive evaluation of default argument for %q#D", fn);
7320 return error_mark_node;
7323 /* If the ARG is an unparsed default argument expression, the
7324 conversion cannot be performed. */
7325 if (TREE_CODE (arg) == DEFAULT_ARG)
7327 if (complain & tf_error)
7328 error ("call to %qD uses the default argument for parameter %P, which "
7329 "is not yet defined", fn, parmnum);
7330 return error_mark_node;
7333 push_defarg_context (fn);
7335 if (fn && DECL_TEMPLATE_INFO (fn))
7336 arg = tsubst_default_argument (fn, parmnum, type, arg, complain);
7338 /* Due to:
7340 [dcl.fct.default]
7342 The names in the expression are bound, and the semantic
7343 constraints are checked, at the point where the default
7344 expressions appears.
7346 we must not perform access checks here. */
7347 push_deferring_access_checks (dk_no_check);
7348 /* We must make a copy of ARG, in case subsequent processing
7349 alters any part of it. */
7350 arg = break_out_target_exprs (arg);
7351 arg = convert_for_initialization (0, type, arg, LOOKUP_IMPLICIT,
7352 ICR_DEFAULT_ARGUMENT, fn, parmnum,
7353 complain);
7354 arg = convert_for_arg_passing (type, arg, complain);
7355 pop_deferring_access_checks();
7357 pop_defarg_context ();
7359 return arg;
7362 /* Returns the type which will really be used for passing an argument of
7363 type TYPE. */
7365 tree
7366 type_passed_as (tree type)
7368 /* Pass classes with copy ctors by invisible reference. */
7369 if (TREE_ADDRESSABLE (type))
7371 type = build_reference_type (type);
7372 /* There are no other pointers to this temporary. */
7373 type = cp_build_qualified_type (type, TYPE_QUAL_RESTRICT);
7375 else if (targetm.calls.promote_prototypes (NULL_TREE)
7376 && INTEGRAL_TYPE_P (type)
7377 && COMPLETE_TYPE_P (type)
7378 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
7379 type = integer_type_node;
7381 return type;
7384 /* Actually perform the appropriate conversion. */
7386 tree
7387 convert_for_arg_passing (tree type, tree val, tsubst_flags_t complain)
7389 tree bitfield_type;
7391 /* If VAL is a bitfield, then -- since it has already been converted
7392 to TYPE -- it cannot have a precision greater than TYPE.
7394 If it has a smaller precision, we must widen it here. For
7395 example, passing "int f:3;" to a function expecting an "int" will
7396 not result in any conversion before this point.
7398 If the precision is the same we must not risk widening. For
7399 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7400 often have type "int", even though the C++ type for the field is
7401 "long long". If the value is being passed to a function
7402 expecting an "int", then no conversions will be required. But,
7403 if we call convert_bitfield_to_declared_type, the bitfield will
7404 be converted to "long long". */
7405 bitfield_type = is_bitfield_expr_with_lowered_type (val);
7406 if (bitfield_type
7407 && TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type))
7408 val = convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type), val);
7410 if (val == error_mark_node)
7412 /* Pass classes with copy ctors by invisible reference. */
7413 else if (TREE_ADDRESSABLE (type))
7414 val = build1 (ADDR_EXPR, build_reference_type (type), val);
7415 else if (targetm.calls.promote_prototypes (NULL_TREE)
7416 && INTEGRAL_TYPE_P (type)
7417 && COMPLETE_TYPE_P (type)
7418 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
7419 val = cp_perform_integral_promotions (val, complain);
7420 if (complain & tf_warning)
7422 if (warn_suggest_attribute_format)
7424 tree rhstype = TREE_TYPE (val);
7425 const enum tree_code coder = TREE_CODE (rhstype);
7426 const enum tree_code codel = TREE_CODE (type);
7427 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
7428 && coder == codel
7429 && check_missing_format_attribute (type, rhstype))
7430 warning (OPT_Wsuggest_attribute_format,
7431 "argument of function call might be a candidate "
7432 "for a format attribute");
7434 maybe_warn_parm_abi (type, EXPR_LOC_OR_LOC (val, input_location));
7436 return val;
7439 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7440 which just decay_conversion or no conversions at all should be done.
7441 This is true for some builtins which don't act like normal functions.
7442 Return 2 if no conversions at all should be done, 1 if just
7443 decay_conversion. Return 3 for special treatment of the 3rd argument
7444 for __builtin_*_overflow_p. */
7447 magic_varargs_p (tree fn)
7449 if (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL)
7450 switch (DECL_FUNCTION_CODE (fn))
7452 case BUILT_IN_CLASSIFY_TYPE:
7453 case BUILT_IN_CONSTANT_P:
7454 case BUILT_IN_NEXT_ARG:
7455 case BUILT_IN_VA_START:
7456 return 1;
7458 case BUILT_IN_ADD_OVERFLOW_P:
7459 case BUILT_IN_SUB_OVERFLOW_P:
7460 case BUILT_IN_MUL_OVERFLOW_P:
7461 return 3;
7463 default:;
7464 return lookup_attribute ("type generic",
7465 TYPE_ATTRIBUTES (TREE_TYPE (fn))) != 0;
7468 return 0;
7471 /* Returns the decl of the dispatcher function if FN is a function version. */
7473 tree
7474 get_function_version_dispatcher (tree fn)
7476 tree dispatcher_decl = NULL;
7478 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
7479 && DECL_FUNCTION_VERSIONED (fn));
7481 gcc_assert (targetm.get_function_versions_dispatcher);
7482 dispatcher_decl = targetm.get_function_versions_dispatcher (fn);
7484 if (dispatcher_decl == NULL)
7486 error_at (input_location, "use of multiversioned function "
7487 "without a default");
7488 return NULL;
7491 retrofit_lang_decl (dispatcher_decl);
7492 gcc_assert (dispatcher_decl != NULL);
7493 return dispatcher_decl;
7496 /* fn is a function version dispatcher that is marked used. Mark all the
7497 semantically identical function versions it will dispatch as used. */
7499 void
7500 mark_versions_used (tree fn)
7502 struct cgraph_node *node;
7503 struct cgraph_function_version_info *node_v;
7504 struct cgraph_function_version_info *it_v;
7506 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7508 node = cgraph_node::get (fn);
7509 if (node == NULL)
7510 return;
7512 gcc_assert (node->dispatcher_function);
7514 node_v = node->function_version ();
7515 if (node_v == NULL)
7516 return;
7518 /* All semantically identical versions are chained. Traverse and mark each
7519 one of them as used. */
7520 it_v = node_v->next;
7521 while (it_v != NULL)
7523 mark_used (it_v->this_node->decl);
7524 it_v = it_v->next;
7528 /* Build a call to "the copy constructor" for the type of A, even if it
7529 wouldn't be selected by normal overload resolution. Used for
7530 diagnostics. */
7532 static tree
7533 call_copy_ctor (tree a, tsubst_flags_t complain)
7535 tree ctype = TYPE_MAIN_VARIANT (TREE_TYPE (a));
7536 tree binfo = TYPE_BINFO (ctype);
7537 tree copy = get_copy_ctor (ctype, complain);
7538 copy = build_baselink (binfo, binfo, copy, NULL_TREE);
7539 tree ob = build_dummy_object (ctype);
7540 vec<tree, va_gc>* args = make_tree_vector_single (a);
7541 tree r = build_new_method_call (ob, copy, &args, NULL_TREE,
7542 LOOKUP_NORMAL, NULL, complain);
7543 release_tree_vector (args);
7544 return r;
7547 /* Return true iff T refers to a base field. */
7549 static bool
7550 is_base_field_ref (tree t)
7552 STRIP_NOPS (t);
7553 if (TREE_CODE (t) == ADDR_EXPR)
7554 t = TREE_OPERAND (t, 0);
7555 if (TREE_CODE (t) == COMPONENT_REF)
7556 t = TREE_OPERAND (t, 1);
7557 if (TREE_CODE (t) == FIELD_DECL)
7558 return DECL_FIELD_IS_BASE (t);
7559 return false;
7562 /* We can't elide a copy from a function returning by value to a base
7563 subobject, as the callee might clobber tail padding. Return true iff this
7564 could be that case. */
7566 static bool
7567 unsafe_copy_elision_p (tree target, tree exp)
7569 /* Copy elision only happens with a TARGET_EXPR. */
7570 if (TREE_CODE (exp) != TARGET_EXPR)
7571 return false;
7572 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
7573 /* It's safe to elide the copy for a class with no tail padding. */
7574 if (tree_int_cst_equal (TYPE_SIZE (type), CLASSTYPE_SIZE (type)))
7575 return false;
7576 /* It's safe to elide the copy if we aren't initializing a base object. */
7577 if (!is_base_field_ref (target))
7578 return false;
7579 tree init = TARGET_EXPR_INITIAL (exp);
7580 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7581 while (TREE_CODE (init) == COMPOUND_EXPR)
7582 init = TREE_OPERAND (init, 1);
7583 if (TREE_CODE (init) == COND_EXPR)
7585 /* We'll end up copying from each of the arms of the COND_EXPR directly
7586 into the target, so look at them. */
7587 if (tree op = TREE_OPERAND (init, 1))
7588 if (unsafe_copy_elision_p (target, op))
7589 return true;
7590 return unsafe_copy_elision_p (target, TREE_OPERAND (init, 2));
7592 return (TREE_CODE (init) == AGGR_INIT_EXPR
7593 && !AGGR_INIT_VIA_CTOR_P (init));
7596 /* Subroutine of the various build_*_call functions. Overload resolution
7597 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7598 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7599 bitmask of various LOOKUP_* flags which apply to the call itself. */
7601 static tree
7602 build_over_call (struct z_candidate *cand, int flags, tsubst_flags_t complain)
7604 tree fn = cand->fn;
7605 const vec<tree, va_gc> *args = cand->args;
7606 tree first_arg = cand->first_arg;
7607 conversion **convs = cand->convs;
7608 conversion *conv;
7609 tree parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
7610 int parmlen;
7611 tree val;
7612 int i = 0;
7613 int j = 0;
7614 unsigned int arg_index = 0;
7615 int is_method = 0;
7616 int nargs;
7617 tree *argarray;
7618 bool already_used = false;
7620 /* In a template, there is no need to perform all of the work that
7621 is normally done. We are only interested in the type of the call
7622 expression, i.e., the return type of the function. Any semantic
7623 errors will be deferred until the template is instantiated. */
7624 if (processing_template_decl)
7626 tree expr, addr;
7627 tree return_type;
7628 const tree *argarray;
7629 unsigned int nargs;
7631 if (undeduced_auto_decl (fn))
7632 mark_used (fn, complain);
7634 return_type = TREE_TYPE (TREE_TYPE (fn));
7635 nargs = vec_safe_length (args);
7636 if (first_arg == NULL_TREE)
7637 argarray = args->address ();
7638 else
7640 tree *alcarray;
7641 unsigned int ix;
7642 tree arg;
7644 ++nargs;
7645 alcarray = XALLOCAVEC (tree, nargs);
7646 alcarray[0] = build_this (first_arg);
7647 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
7648 alcarray[ix + 1] = arg;
7649 argarray = alcarray;
7652 addr = build_addr_func (fn, complain);
7653 if (addr == error_mark_node)
7654 return error_mark_node;
7655 expr = build_call_array_loc (input_location, return_type,
7656 addr, nargs, argarray);
7657 if (TREE_THIS_VOLATILE (fn) && cfun)
7658 current_function_returns_abnormally = 1;
7659 return convert_from_reference (expr);
7662 /* Give any warnings we noticed during overload resolution. */
7663 if (cand->warnings && (complain & tf_warning))
7665 struct candidate_warning *w;
7666 for (w = cand->warnings; w; w = w->next)
7667 joust (cand, w->loser, 1, complain);
7670 /* OK, we're actually calling this inherited constructor; set its deletedness
7671 appropriately. We can get away with doing this here because calling is
7672 the only way to refer to a constructor. */
7673 if (DECL_INHERITED_CTOR (fn))
7674 deduce_inheriting_ctor (fn);
7676 /* Make =delete work with SFINAE. */
7677 if (DECL_DELETED_FN (fn))
7679 if (complain & tf_error)
7680 mark_used (fn);
7681 return error_mark_node;
7684 if (DECL_FUNCTION_MEMBER_P (fn))
7686 tree access_fn;
7687 /* If FN is a template function, two cases must be considered.
7688 For example:
7690 struct A {
7691 protected:
7692 template <class T> void f();
7694 template <class T> struct B {
7695 protected:
7696 void g();
7698 struct C : A, B<int> {
7699 using A::f; // #1
7700 using B<int>::g; // #2
7703 In case #1 where `A::f' is a member template, DECL_ACCESS is
7704 recorded in the primary template but not in its specialization.
7705 We check access of FN using its primary template.
7707 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7708 because it is a member of class template B, DECL_ACCESS is
7709 recorded in the specialization `B<int>::g'. We cannot use its
7710 primary template because `B<T>::g' and `B<int>::g' may have
7711 different access. */
7712 if (DECL_TEMPLATE_INFO (fn)
7713 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
7714 access_fn = DECL_TI_TEMPLATE (fn);
7715 else
7716 access_fn = fn;
7717 if (!perform_or_defer_access_check (cand->access_path, access_fn,
7718 fn, complain))
7719 return error_mark_node;
7722 /* If we're checking for implicit delete, don't bother with argument
7723 conversions. */
7724 if (flags & LOOKUP_SPECULATIVE)
7726 if (cand->viable == 1)
7727 return fn;
7728 else if (!(complain & tf_error))
7729 /* Reject bad conversions now. */
7730 return error_mark_node;
7731 /* else continue to get conversion error. */
7734 /* N3276 magic doesn't apply to nested calls. */
7735 tsubst_flags_t decltype_flag = (complain & tf_decltype);
7736 complain &= ~tf_decltype;
7737 /* No-Cleanup doesn't apply to nested calls either. */
7738 tsubst_flags_t no_cleanup_complain = complain;
7739 complain &= ~tf_no_cleanup;
7741 /* Find maximum size of vector to hold converted arguments. */
7742 parmlen = list_length (parm);
7743 nargs = vec_safe_length (args) + (first_arg != NULL_TREE ? 1 : 0);
7744 if (parmlen > nargs)
7745 nargs = parmlen;
7746 argarray = XALLOCAVEC (tree, nargs);
7748 /* The implicit parameters to a constructor are not considered by overload
7749 resolution, and must be of the proper type. */
7750 if (DECL_CONSTRUCTOR_P (fn))
7752 tree object_arg;
7753 if (first_arg != NULL_TREE)
7755 object_arg = first_arg;
7756 first_arg = NULL_TREE;
7758 else
7760 object_arg = (*args)[arg_index];
7761 ++arg_index;
7763 argarray[j++] = build_this (object_arg);
7764 parm = TREE_CHAIN (parm);
7765 /* We should never try to call the abstract constructor. */
7766 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn));
7768 if (DECL_HAS_VTT_PARM_P (fn))
7770 argarray[j++] = (*args)[arg_index];
7771 ++arg_index;
7772 parm = TREE_CHAIN (parm);
7775 if (flags & LOOKUP_PREFER_RVALUE)
7777 /* The implicit move specified in 15.8.3/3 fails "...if the type of
7778 the first parameter of the selected constructor is not an rvalue
7779 reference to the object’s type (possibly cv-qualified)...." */
7780 gcc_assert (!(complain & tf_error));
7781 tree ptype = convs[0]->type;
7782 if (TREE_CODE (ptype) != REFERENCE_TYPE
7783 || !TYPE_REF_IS_RVALUE (ptype)
7784 || CONVERSION_RANK (convs[0]) > cr_exact)
7785 return error_mark_node;
7788 /* Bypass access control for 'this' parameter. */
7789 else if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
7791 tree parmtype = TREE_VALUE (parm);
7792 tree arg = build_this (first_arg != NULL_TREE
7793 ? first_arg
7794 : (*args)[arg_index]);
7795 tree argtype = TREE_TYPE (arg);
7796 tree converted_arg;
7797 tree base_binfo;
7799 if (arg == error_mark_node)
7800 return error_mark_node;
7802 if (convs[i]->bad_p)
7804 if (complain & tf_error)
7806 if (permerror (input_location, "passing %qT as %<this%> "
7807 "argument discards qualifiers",
7808 TREE_TYPE (argtype)))
7809 inform (DECL_SOURCE_LOCATION (fn), " in call to %qD", fn);
7811 else
7812 return error_mark_node;
7815 /* See if the function member or the whole class type is declared
7816 final and the call can be devirtualized. */
7817 if (DECL_FINAL_P (fn)
7818 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn))))
7819 flags |= LOOKUP_NONVIRTUAL;
7821 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
7822 X is called for an object that is not of type X, or of a type
7823 derived from X, the behavior is undefined.
7825 So we can assume that anything passed as 'this' is non-null, and
7826 optimize accordingly. */
7827 gcc_assert (TYPE_PTR_P (parmtype));
7828 /* Convert to the base in which the function was declared. */
7829 gcc_assert (cand->conversion_path != NULL_TREE);
7830 converted_arg = build_base_path (PLUS_EXPR,
7831 arg,
7832 cand->conversion_path,
7833 1, complain);
7834 /* Check that the base class is accessible. */
7835 if (!accessible_base_p (TREE_TYPE (argtype),
7836 BINFO_TYPE (cand->conversion_path), true))
7838 if (complain & tf_error)
7839 error ("%qT is not an accessible base of %qT",
7840 BINFO_TYPE (cand->conversion_path),
7841 TREE_TYPE (argtype));
7842 else
7843 return error_mark_node;
7845 /* If fn was found by a using declaration, the conversion path
7846 will be to the derived class, not the base declaring fn. We
7847 must convert from derived to base. */
7848 base_binfo = lookup_base (TREE_TYPE (TREE_TYPE (converted_arg)),
7849 TREE_TYPE (parmtype), ba_unique,
7850 NULL, complain);
7851 converted_arg = build_base_path (PLUS_EXPR, converted_arg,
7852 base_binfo, 1, complain);
7854 argarray[j++] = converted_arg;
7855 parm = TREE_CHAIN (parm);
7856 if (first_arg != NULL_TREE)
7857 first_arg = NULL_TREE;
7858 else
7859 ++arg_index;
7860 ++i;
7861 is_method = 1;
7864 gcc_assert (first_arg == NULL_TREE);
7865 for (; arg_index < vec_safe_length (args) && parm;
7866 parm = TREE_CHAIN (parm), ++arg_index, ++i)
7868 tree type = TREE_VALUE (parm);
7869 tree arg = (*args)[arg_index];
7870 bool conversion_warning = true;
7872 conv = convs[i];
7874 /* If the argument is NULL and used to (implicitly) instantiate a
7875 template function (and bind one of the template arguments to
7876 the type of 'long int'), we don't want to warn about passing NULL
7877 to non-pointer argument.
7878 For example, if we have this template function:
7880 template<typename T> void func(T x) {}
7882 we want to warn (when -Wconversion is enabled) in this case:
7884 void foo() {
7885 func<int>(NULL);
7888 but not in this case:
7890 void foo() {
7891 func(NULL);
7894 if (null_node_p (arg)
7895 && DECL_TEMPLATE_INFO (fn)
7896 && cand->template_decl
7897 && !(flags & LOOKUP_EXPLICIT_TMPL_ARGS))
7898 conversion_warning = false;
7900 /* Warn about initializer_list deduction that isn't currently in the
7901 working draft. */
7902 if (cxx_dialect > cxx98
7903 && flag_deduce_init_list
7904 && cand->template_decl
7905 && is_std_init_list (non_reference (type))
7906 && BRACE_ENCLOSED_INITIALIZER_P (arg))
7908 tree tmpl = TI_TEMPLATE (cand->template_decl);
7909 tree realparm = chain_index (j, DECL_ARGUMENTS (cand->fn));
7910 tree patparm = get_pattern_parm (realparm, tmpl);
7911 tree pattype = TREE_TYPE (patparm);
7912 if (PACK_EXPANSION_P (pattype))
7913 pattype = PACK_EXPANSION_PATTERN (pattype);
7914 pattype = non_reference (pattype);
7916 if (TREE_CODE (pattype) == TEMPLATE_TYPE_PARM
7917 && (cand->explicit_targs == NULL_TREE
7918 || (TREE_VEC_LENGTH (cand->explicit_targs)
7919 <= TEMPLATE_TYPE_IDX (pattype))))
7921 pedwarn (input_location, 0, "deducing %qT as %qT",
7922 non_reference (TREE_TYPE (patparm)),
7923 non_reference (type));
7924 pedwarn (DECL_SOURCE_LOCATION (cand->fn), 0,
7925 " in call to %qD", cand->fn);
7926 pedwarn (input_location, 0,
7927 " (you can disable this with -fno-deduce-init-list)");
7931 /* Set user_conv_p on the argument conversions, so rvalue/base handling
7932 knows not to allow any more UDCs. This needs to happen after we
7933 process cand->warnings. */
7934 if (flags & LOOKUP_NO_CONVERSION)
7935 conv->user_conv_p = true;
7937 tsubst_flags_t arg_complain = complain;
7938 if (!conversion_warning)
7939 arg_complain &= ~tf_warning;
7941 val = convert_like_with_context (conv, arg, fn, i - is_method,
7942 arg_complain);
7943 val = convert_for_arg_passing (type, val, arg_complain);
7945 if (val == error_mark_node)
7946 return error_mark_node;
7947 else
7948 argarray[j++] = val;
7951 /* Default arguments */
7952 for (; parm && parm != void_list_node; parm = TREE_CHAIN (parm), i++)
7954 if (TREE_VALUE (parm) == error_mark_node)
7955 return error_mark_node;
7956 val = convert_default_arg (TREE_VALUE (parm),
7957 TREE_PURPOSE (parm),
7958 fn, i - is_method,
7959 complain);
7960 if (val == error_mark_node)
7961 return error_mark_node;
7962 argarray[j++] = val;
7965 /* Ellipsis */
7966 int magic = magic_varargs_p (fn);
7967 for (; arg_index < vec_safe_length (args); ++arg_index)
7969 tree a = (*args)[arg_index];
7970 if ((magic == 3 && arg_index == 2) || magic == 2)
7972 /* Do no conversions for certain magic varargs. */
7973 a = mark_type_use (a);
7974 if (TREE_CODE (a) == FUNCTION_DECL && reject_gcc_builtin (a))
7975 return error_mark_node;
7977 else if (magic != 0)
7978 /* For other magic varargs only do decay_conversion. */
7979 a = decay_conversion (a, complain);
7980 else if (DECL_CONSTRUCTOR_P (fn)
7981 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn),
7982 TREE_TYPE (a)))
7984 /* Avoid infinite recursion trying to call A(...). */
7985 if (complain & tf_error)
7986 /* Try to call the actual copy constructor for a good error. */
7987 call_copy_ctor (a, complain);
7988 return error_mark_node;
7990 else
7991 a = convert_arg_to_ellipsis (a, complain);
7992 if (a == error_mark_node)
7993 return error_mark_node;
7994 argarray[j++] = a;
7997 gcc_assert (j <= nargs);
7998 nargs = j;
8000 /* Avoid to do argument-transformation, if warnings for format, and for
8001 nonnull are disabled. Just in case that at least one of them is active
8002 the check_function_arguments function might warn about something. */
8004 bool warned_p = false;
8005 if (warn_nonnull
8006 || warn_format
8007 || warn_suggest_attribute_format
8008 || warn_restrict)
8010 tree *fargs = (!nargs ? argarray
8011 : (tree *) alloca (nargs * sizeof (tree)));
8012 for (j = 0; j < nargs; j++)
8013 fargs[j] = maybe_constant_value (argarray[j]);
8015 warned_p = check_function_arguments (input_location, fn, TREE_TYPE (fn),
8016 nargs, fargs, NULL);
8019 if (DECL_INHERITED_CTOR (fn))
8021 /* Check for passing ellipsis arguments to an inherited constructor. We
8022 could handle this by open-coding the inherited constructor rather than
8023 defining it, but let's not bother now. */
8024 if (!cp_unevaluated_operand
8025 && cand->num_convs
8026 && cand->convs[cand->num_convs-1]->ellipsis_p)
8028 if (complain & tf_error)
8030 sorry ("passing arguments to ellipsis of inherited constructor "
8031 "%qD", cand->fn);
8032 inform (DECL_SOURCE_LOCATION (cand->fn), "declared here");
8034 return error_mark_node;
8037 /* A base constructor inheriting from a virtual base doesn't get the
8038 inherited arguments, just this and __vtt. */
8039 if (ctor_omit_inherited_parms (fn))
8040 nargs = 2;
8043 /* Avoid actually calling copy constructors and copy assignment operators,
8044 if possible. */
8046 if (! flag_elide_constructors)
8047 /* Do things the hard way. */;
8048 else if (cand->num_convs == 1
8049 && (DECL_COPY_CONSTRUCTOR_P (fn)
8050 || DECL_MOVE_CONSTRUCTOR_P (fn))
8051 /* It's unsafe to elide the constructor when handling
8052 a noexcept-expression, it may evaluate to the wrong
8053 value (c++/53025). */
8054 && cp_noexcept_operand == 0)
8056 tree targ;
8057 tree arg = argarray[num_artificial_parms_for (fn)];
8058 tree fa;
8059 bool trivial = trivial_fn_p (fn);
8061 /* Pull out the real argument, disregarding const-correctness. */
8062 targ = arg;
8063 /* Strip the reference binding for the constructor parameter. */
8064 if (CONVERT_EXPR_P (targ)
8065 && TREE_CODE (TREE_TYPE (targ)) == REFERENCE_TYPE)
8066 targ = TREE_OPERAND (targ, 0);
8067 /* But don't strip any other reference bindings; binding a temporary to a
8068 reference prevents copy elision. */
8069 while ((CONVERT_EXPR_P (targ)
8070 && TREE_CODE (TREE_TYPE (targ)) != REFERENCE_TYPE)
8071 || TREE_CODE (targ) == NON_LVALUE_EXPR)
8072 targ = TREE_OPERAND (targ, 0);
8073 if (TREE_CODE (targ) == ADDR_EXPR)
8075 targ = TREE_OPERAND (targ, 0);
8076 if (!same_type_ignoring_top_level_qualifiers_p
8077 (TREE_TYPE (TREE_TYPE (arg)), TREE_TYPE (targ)))
8078 targ = NULL_TREE;
8080 else
8081 targ = NULL_TREE;
8083 if (targ)
8084 arg = targ;
8085 else
8086 arg = cp_build_fold_indirect_ref (arg);
8088 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8089 subobject. */
8090 if (CHECKING_P && cxx_dialect >= cxx17)
8091 gcc_assert (TREE_CODE (arg) != TARGET_EXPR
8092 /* It's from binding the ref parm to a packed field. */
8093 || convs[0]->need_temporary_p
8094 || seen_error ()
8095 /* See unsafe_copy_elision_p. */
8096 || DECL_BASE_CONSTRUCTOR_P (fn));
8098 /* [class.copy]: the copy constructor is implicitly defined even if
8099 the implementation elided its use. */
8100 if (!trivial)
8102 if (!mark_used (fn, complain) && !(complain & tf_error))
8103 return error_mark_node;
8104 already_used = true;
8107 /* If we're creating a temp and we already have one, don't create a
8108 new one. If we're not creating a temp but we get one, use
8109 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8110 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8111 temp or an INIT_EXPR otherwise. */
8112 fa = argarray[0];
8113 if (is_dummy_object (fa))
8115 if (TREE_CODE (arg) == TARGET_EXPR)
8116 return arg;
8117 else if (trivial)
8118 return force_target_expr (DECL_CONTEXT (fn), arg, complain);
8120 else if ((trivial || TREE_CODE (arg) == TARGET_EXPR)
8121 && !unsafe_copy_elision_p (fa, arg))
8123 tree to = cp_stabilize_reference (cp_build_fold_indirect_ref (fa));
8125 val = build2 (INIT_EXPR, DECL_CONTEXT (fn), to, arg);
8126 return val;
8129 else if (DECL_ASSIGNMENT_OPERATOR_P (fn)
8130 && DECL_OVERLOADED_OPERATOR_IS (fn, NOP_EXPR)
8131 && trivial_fn_p (fn))
8133 tree to = cp_stabilize_reference
8134 (cp_build_fold_indirect_ref (argarray[0]));
8135 tree type = TREE_TYPE (to);
8136 tree as_base = CLASSTYPE_AS_BASE (type);
8137 tree arg = argarray[1];
8139 if (is_really_empty_class (type))
8141 /* Avoid copying empty classes. */
8142 val = build2 (COMPOUND_EXPR, type, arg, to);
8143 TREE_NO_WARNING (val) = 1;
8145 else if (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (as_base)))
8147 arg = cp_build_fold_indirect_ref (arg);
8148 val = build2 (MODIFY_EXPR, TREE_TYPE (to), to, arg);
8149 /* Handle NSDMI that refer to the object being initialized. */
8150 replace_placeholders (arg, to);
8152 else
8154 /* We must only copy the non-tail padding parts. */
8155 tree arg0, arg2, t;
8156 tree array_type, alias_set;
8158 arg2 = TYPE_SIZE_UNIT (as_base);
8159 arg0 = cp_build_addr_expr (to, complain);
8161 array_type = build_array_type (unsigned_char_type_node,
8162 build_index_type
8163 (size_binop (MINUS_EXPR,
8164 arg2, size_int (1))));
8165 alias_set = build_int_cst (build_pointer_type (type), 0);
8166 t = build2 (MODIFY_EXPR, void_type_node,
8167 build2 (MEM_REF, array_type, arg0, alias_set),
8168 build2 (MEM_REF, array_type, arg, alias_set));
8169 val = build2 (COMPOUND_EXPR, TREE_TYPE (to), t, to);
8170 TREE_NO_WARNING (val) = 1;
8173 return val;
8175 else if (trivial_fn_p (fn))
8177 if (DECL_DESTRUCTOR_P (fn))
8178 return fold_convert (void_type_node, argarray[0]);
8179 else if (default_ctor_p (fn))
8181 if (is_dummy_object (argarray[0]))
8182 return force_target_expr (DECL_CONTEXT (fn), void_node,
8183 no_cleanup_complain);
8184 else
8185 return cp_build_fold_indirect_ref (argarray[0]);
8189 /* For calls to a multi-versioned function, overload resolution
8190 returns the function with the highest target priority, that is,
8191 the version that will checked for dispatching first. If this
8192 version is inlinable, a direct call to this version can be made
8193 otherwise the call should go through the dispatcher. */
8195 if (DECL_FUNCTION_VERSIONED (fn)
8196 && (current_function_decl == NULL
8197 || !targetm.target_option.can_inline_p (current_function_decl, fn)))
8199 fn = get_function_version_dispatcher (fn);
8200 if (fn == NULL)
8201 return NULL;
8202 if (!already_used)
8203 mark_versions_used (fn);
8206 if (!already_used
8207 && !mark_used (fn, complain))
8208 return error_mark_node;
8210 /* Warn if the built-in writes to an object of a non-trivial type. */
8211 if (warn_class_memaccess
8212 && vec_safe_length (args) >= 2
8213 && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL)
8214 maybe_warn_class_memaccess (input_location, fn, args);
8216 if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0
8217 /* Don't mess with virtual lookup in instantiate_non_dependent_expr;
8218 virtual functions can't be constexpr. */
8219 && !in_template_function ())
8221 tree t;
8222 tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (argarray[0])),
8223 DECL_CONTEXT (fn),
8224 ba_any, NULL, complain);
8225 gcc_assert (binfo && binfo != error_mark_node);
8227 argarray[0] = build_base_path (PLUS_EXPR, argarray[0], binfo, 1,
8228 complain);
8229 if (TREE_SIDE_EFFECTS (argarray[0]))
8230 argarray[0] = save_expr (argarray[0]);
8231 t = build_pointer_type (TREE_TYPE (fn));
8232 fn = build_vfn_ref (argarray[0], DECL_VINDEX (fn));
8233 TREE_TYPE (fn) = t;
8235 else
8237 fn = build_addr_func (fn, complain);
8238 if (fn == error_mark_node)
8239 return error_mark_node;
8242 tree call = build_cxx_call (fn, nargs, argarray, complain|decltype_flag);
8243 if (call == error_mark_node)
8244 return call;
8245 if (cand->flags & LOOKUP_LIST_INIT_CTOR)
8247 tree c = extract_call_expr (call);
8248 /* build_new_op_1 will clear this when appropriate. */
8249 CALL_EXPR_ORDERED_ARGS (c) = true;
8251 if (warned_p)
8253 tree c = extract_call_expr (call);
8254 if (TREE_CODE (c) == CALL_EXPR)
8255 TREE_NO_WARNING (c) = 1;
8257 return call;
8260 /* Return the DECL of the first non-public data member of class TYPE
8261 or null if none can be found. */
8263 static tree
8264 first_non_public_field (tree type)
8266 if (!CLASS_TYPE_P (type))
8267 return NULL_TREE;
8269 for (tree field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
8271 if (TREE_CODE (field) != FIELD_DECL)
8272 continue;
8273 if (TREE_STATIC (field))
8274 continue;
8275 if (TREE_PRIVATE (field) || TREE_PROTECTED (field))
8276 return field;
8279 int i = 0;
8281 for (tree base_binfo, binfo = TYPE_BINFO (type);
8282 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
8284 tree base = TREE_TYPE (base_binfo);
8286 if (tree field = first_non_public_field (base))
8287 return field;
8290 return NULL_TREE;
8293 /* Return true if all copy and move assignment operator overloads for
8294 class TYPE are trivial and at least one of them is not deleted and,
8295 when ACCESS is set, accessible. Return false otherwise. Set
8296 HASASSIGN to true when the TYPE has a (not necessarily trivial)
8297 copy or move assignment. */
8299 static bool
8300 has_trivial_copy_assign_p (tree type, bool access, bool *hasassign)
8302 tree fns = get_class_binding (type, assign_op_identifier);
8303 bool all_trivial = true;
8305 /* Iterate over overloads of the assignment operator, checking
8306 accessible copy assignments for triviality. */
8308 for (ovl_iterator oi (fns); oi; ++oi)
8310 tree f = *oi;
8312 /* Skip operators that aren't copy assignments. */
8313 if (!copy_fn_p (f))
8314 continue;
8316 bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f))
8317 || accessible_p (TYPE_BINFO (type), f, true));
8319 /* Skip template assignment operators and deleted functions. */
8320 if (TREE_CODE (f) != FUNCTION_DECL || DECL_DELETED_FN (f))
8321 continue;
8323 if (accessible)
8324 *hasassign = true;
8326 if (!accessible || !trivial_fn_p (f))
8327 all_trivial = false;
8329 /* Break early when both properties have been determined. */
8330 if (*hasassign && !all_trivial)
8331 break;
8334 /* Return true if they're all trivial and one of the expressions
8335 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
8336 tree ref = cp_build_reference_type (type, false);
8337 return (all_trivial
8338 && (is_trivially_xible (MODIFY_EXPR, type, type)
8339 || is_trivially_xible (MODIFY_EXPR, type, ref)));
8342 /* Return true if all copy and move ctor overloads for class TYPE are
8343 trivial and at least one of them is not deleted and, when ACCESS is
8344 set, accessible. Return false otherwise. Set each element of HASCTOR[]
8345 to true when the TYPE has a (not necessarily trivial) default and copy
8346 (or move) ctor, respectively. */
8348 static bool
8349 has_trivial_copy_p (tree type, bool access, bool hasctor[2])
8351 tree fns = get_class_binding (type, complete_ctor_identifier);
8352 bool all_trivial = true;
8354 for (ovl_iterator oi (fns); oi; ++oi)
8356 tree f = *oi;
8358 /* Skip template constructors. */
8359 if (TREE_CODE (f) != FUNCTION_DECL)
8360 continue;
8362 bool cpy_or_move_ctor_p = copy_fn_p (f);
8364 /* Skip ctors other than default, copy, and move. */
8365 if (!cpy_or_move_ctor_p && !default_ctor_p (f))
8366 continue;
8368 if (DECL_DELETED_FN (f))
8369 continue;
8371 bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f))
8372 || accessible_p (TYPE_BINFO (type), f, true));
8374 if (accessible)
8375 hasctor[cpy_or_move_ctor_p] = true;
8377 if (cpy_or_move_ctor_p && (!accessible || !trivial_fn_p (f)))
8378 all_trivial = false;
8380 /* Break early when both properties have been determined. */
8381 if (hasctor[0] && hasctor[1] && !all_trivial)
8382 break;
8385 return all_trivial;
8388 /* Issue a warning on a call to the built-in function FNDECL if it is
8389 a raw memory write whose destination is not an object of (something
8390 like) trivial or standard layout type with a non-deleted assignment
8391 and copy ctor. Detects const correctness violations, corrupting
8392 references, virtual table pointers, and bypassing non-trivial
8393 assignments. */
8395 static void
8396 maybe_warn_class_memaccess (location_t loc, tree fndecl,
8397 const vec<tree, va_gc> *args)
8399 /* Except for bcopy where it's second, the destination pointer is
8400 the first argument for all functions handled here. Compute
8401 the index of the destination and source arguments. */
8402 unsigned dstidx = DECL_FUNCTION_CODE (fndecl) == BUILT_IN_BCOPY;
8403 unsigned srcidx = !dstidx;
8405 tree dest = (*args)[dstidx];
8406 if (!TREE_TYPE (dest) || !POINTER_TYPE_P (TREE_TYPE (dest)))
8407 return;
8409 tree srctype = NULL_TREE;
8411 /* Determine the type of the pointed-to object and whether it's
8412 a complete class type. */
8413 tree desttype = TREE_TYPE (TREE_TYPE (dest));
8415 if (!desttype || !COMPLETE_TYPE_P (desttype) || !CLASS_TYPE_P (desttype))
8416 return;
8418 /* Check to see if the raw memory call is made by a ctor or dtor
8419 with this as the destination argument for the destination type.
8420 If so, be more permissive. */
8421 if (current_function_decl
8422 && (DECL_CONSTRUCTOR_P (current_function_decl)
8423 || DECL_DESTRUCTOR_P (current_function_decl))
8424 && is_this_parameter (tree_strip_nop_conversions (dest)))
8426 tree ctx = DECL_CONTEXT (current_function_decl);
8427 bool special = same_type_ignoring_top_level_qualifiers_p (ctx, desttype);
8429 tree binfo = TYPE_BINFO (ctx);
8431 /* A ctor and dtor for a class with no bases and no virtual functions
8432 can do whatever they want. Bail early with no further checking. */
8433 if (special && !BINFO_VTABLE (binfo) && !BINFO_N_BASE_BINFOS (binfo))
8434 return;
8437 /* True if the class is trivial. */
8438 bool trivial = trivial_type_p (desttype);
8440 /* Set to true if DESTYPE has an accessible copy assignment. */
8441 bool hasassign = false;
8442 /* True if all of the class' overloaded copy assignment operators
8443 are all trivial (and not deleted) and at least one of them is
8444 accessible. */
8445 bool trivassign = has_trivial_copy_assign_p (desttype, true, &hasassign);
8447 /* Set to true if DESTTYPE has an accessible default and copy ctor,
8448 respectively. */
8449 bool hasctors[2] = { false, false };
8451 /* True if all of the class' overloaded copy constructors are all
8452 trivial (and not deleted) and at least one of them is accessible. */
8453 bool trivcopy = has_trivial_copy_p (desttype, true, hasctors);
8455 /* Set FLD to the first private/protected member of the class. */
8456 tree fld = trivial ? first_non_public_field (desttype) : NULL_TREE;
8458 /* The warning format string. */
8459 const char *warnfmt = NULL;
8460 /* A suggested alternative to offer instead of the raw memory call.
8461 Empty string when none can be come up with. */
8462 const char *suggest = "";
8463 bool warned = false;
8465 switch (DECL_FUNCTION_CODE (fndecl))
8467 case BUILT_IN_MEMSET:
8468 if (!integer_zerop (maybe_constant_value ((*args)[1])))
8470 /* Diagnose setting non-copy-assignable or non-trivial types,
8471 or types with a private member, to (potentially) non-zero
8472 bytes. Since the value of the bytes being written is unknown,
8473 suggest using assignment instead (if one exists). Also warn
8474 for writes into objects for which zero-initialization doesn't
8475 mean all bits clear (pointer-to-member data, where null is all
8476 bits set). Since the value being written is (most likely)
8477 non-zero, simply suggest assignment (but not copy assignment). */
8478 suggest = "; use assignment instead";
8479 if (!trivassign)
8480 warnfmt = G_("%qD writing to an object of type %#qT with "
8481 "no trivial copy-assignment");
8482 else if (!trivial)
8483 warnfmt = G_("%qD writing to an object of non-trivial type %#qT%s");
8484 else if (fld)
8486 const char *access = TREE_PRIVATE (fld) ? "private" : "protected";
8487 warned = warning_at (loc, OPT_Wclass_memaccess,
8488 "%qD writing to an object of type %#qT with "
8489 "%qs member %qD",
8490 fndecl, desttype, access, fld);
8492 else if (!zero_init_p (desttype))
8493 warnfmt = G_("%qD writing to an object of type %#qT containing "
8494 "a pointer to data member%s");
8496 break;
8498 /* Fall through. */
8500 case BUILT_IN_BZERO:
8501 /* Similarly to the above, diagnose clearing non-trivial or non-
8502 standard layout objects, or objects of types with no assignmenmt.
8503 Since the value being written is known to be zero, suggest either
8504 copy assignment, copy ctor, or default ctor as an alternative,
8505 depending on what's available. */
8507 if (hasassign && hasctors[0])
8508 suggest = G_("; use assignment or value-initialization instead");
8509 else if (hasassign)
8510 suggest = G_("; use assignment instead");
8511 else if (hasctors[0])
8512 suggest = G_("; use value-initialization instead");
8514 if (!trivassign)
8515 warnfmt = G_("%qD clearing an object of type %#qT with "
8516 "no trivial copy-assignment%s");
8517 else if (!trivial)
8518 warnfmt = G_("%qD clearing an object of non-trivial type %#qT%s");
8519 else if (!zero_init_p (desttype))
8520 warnfmt = G_("%qD clearing an object of type %#qT containing "
8521 "a pointer-to-member%s");
8522 break;
8524 case BUILT_IN_BCOPY:
8525 case BUILT_IN_MEMCPY:
8526 case BUILT_IN_MEMMOVE:
8527 case BUILT_IN_MEMPCPY:
8528 /* Determine the type of the source object. */
8529 srctype = TREE_TYPE ((*args)[srcidx]);
8530 if (!srctype || !POINTER_TYPE_P (srctype))
8531 srctype = void_type_node;
8532 else
8533 srctype = TREE_TYPE (srctype);
8535 /* Since it's impossible to determine wheter the byte copy is
8536 being used in place of assignment to an existing object or
8537 as a substitute for initialization, assume it's the former.
8538 Determine the best alternative to use instead depending on
8539 what's not deleted. */
8540 if (hasassign && hasctors[1])
8541 suggest = G_("; use copy-assignment or copy-initialization instead");
8542 else if (hasassign)
8543 suggest = G_("; use copy-assignment instead");
8544 else if (hasctors[1])
8545 suggest = G_("; use copy-initialization instead");
8547 if (!trivassign)
8548 warnfmt = G_("%qD writing to an object of type %#qT with no trivial "
8549 "copy-assignment%s");
8550 else if (!trivially_copyable_p (desttype))
8551 warnfmt = G_("%qD writing to an object of non-trivially copyable "
8552 "type %#qT%s");
8553 else if (!trivcopy)
8554 warnfmt = G_("%qD writing to an object with a deleted copy constructor");
8556 else if (!trivial
8557 && !VOID_TYPE_P (srctype)
8558 && !char_type_p (TYPE_MAIN_VARIANT (srctype))
8559 && !same_type_ignoring_top_level_qualifiers_p (desttype,
8560 srctype))
8562 /* Warn when copying into a non-trivial object from an object
8563 of a different type other than void or char. */
8564 warned = warning_at (loc, OPT_Wclass_memaccess,
8565 "%qD copying an object of non-trivial type "
8566 "%#qT from an array of %#qT",
8567 fndecl, desttype, srctype);
8569 else if (fld
8570 && !VOID_TYPE_P (srctype)
8571 && !char_type_p (TYPE_MAIN_VARIANT (srctype))
8572 && !same_type_ignoring_top_level_qualifiers_p (desttype,
8573 srctype))
8575 const char *access = TREE_PRIVATE (fld) ? "private" : "protected";
8576 warned = warning_at (loc, OPT_Wclass_memaccess,
8577 "%qD copying an object of type %#qT with "
8578 "%qs member %qD from an array of %#qT; use "
8579 "assignment or copy-initialization instead",
8580 fndecl, desttype, access, fld, srctype);
8582 else if (!trivial && vec_safe_length (args) > 2)
8584 tree sz = maybe_constant_value ((*args)[2]);
8585 if (!tree_fits_uhwi_p (sz))
8586 break;
8588 /* Finally, warn on partial copies. */
8589 unsigned HOST_WIDE_INT typesize
8590 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype));
8591 if (unsigned HOST_WIDE_INT partial = tree_to_uhwi (sz) % typesize)
8592 warned = warning_at (loc, OPT_Wclass_memaccess,
8593 (typesize - partial > 1
8594 ? G_("%qD writing to an object of "
8595 "a non-trivial type %#qT leaves %wu "
8596 "bytes unchanged")
8597 : G_("%qD writing to an object of "
8598 "a non-trivial type %#qT leaves %wu "
8599 "byte unchanged")),
8600 fndecl, desttype, typesize - partial);
8602 break;
8604 case BUILT_IN_REALLOC:
8606 if (!trivially_copyable_p (desttype))
8607 warnfmt = G_("%qD moving an object of non-trivially copyable type "
8608 "%#qT; use %<new%> and %<delete%> instead");
8609 else if (!trivcopy)
8610 warnfmt = G_("%qD moving an object of type %#qT with deleted copy "
8611 "constructor; use %<new%> and %<delete%> instead");
8612 else if (!get_dtor (desttype, tf_none))
8613 warnfmt = G_("%qD moving an object of type %#qT with deleted "
8614 "destructor");
8615 else if (!trivial)
8617 tree sz = maybe_constant_value ((*args)[1]);
8618 if (TREE_CODE (sz) == INTEGER_CST
8619 && tree_int_cst_lt (sz, TYPE_SIZE_UNIT (desttype)))
8620 /* Finally, warn on reallocation into insufficient space. */
8621 warned = warning_at (loc, OPT_Wclass_memaccess,
8622 "%qD moving an object of non-trivial type "
8623 "%#qT and size %E into a region of size %E",
8624 fndecl, desttype, TYPE_SIZE_UNIT (desttype),
8625 sz);
8627 break;
8629 default:
8630 return;
8633 if (warnfmt)
8635 if (suggest)
8636 warned = warning_at (loc, OPT_Wclass_memaccess,
8637 warnfmt, fndecl, desttype, suggest);
8638 else
8639 warned = warning_at (loc, OPT_Wclass_memaccess,
8640 warnfmt, fndecl, desttype);
8643 if (warned)
8644 inform (location_of (desttype), "%#qT declared here", desttype);
8647 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
8648 This function performs no overload resolution, conversion, or other
8649 high-level operations. */
8651 tree
8652 build_cxx_call (tree fn, int nargs, tree *argarray,
8653 tsubst_flags_t complain)
8655 tree fndecl;
8657 /* Remember roughly where this call is. */
8658 location_t loc = EXPR_LOC_OR_LOC (fn, input_location);
8659 fn = build_call_a (fn, nargs, argarray);
8660 SET_EXPR_LOCATION (fn, loc);
8662 fndecl = get_callee_fndecl (fn);
8664 /* Check that arguments to builtin functions match the expectations. */
8665 if (fndecl
8666 && DECL_BUILT_IN (fndecl)
8667 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
8669 int i;
8671 /* We need to take care that values to BUILT_IN_NORMAL
8672 are reduced. */
8673 for (i = 0; i < nargs; i++)
8674 argarray[i] = fold_non_dependent_expr (argarray[i]);
8676 if (!check_builtin_function_arguments (EXPR_LOCATION (fn), vNULL, fndecl,
8677 nargs, argarray))
8678 return error_mark_node;
8681 if (VOID_TYPE_P (TREE_TYPE (fn)))
8682 return fn;
8684 /* 5.2.2/11: If a function call is a prvalue of object type: if the
8685 function call is either the operand of a decltype-specifier or the
8686 right operand of a comma operator that is the operand of a
8687 decltype-specifier, a temporary object is not introduced for the
8688 prvalue. The type of the prvalue may be incomplete. */
8689 if (!(complain & tf_decltype))
8691 fn = require_complete_type_sfinae (fn, complain);
8692 if (fn == error_mark_node)
8693 return error_mark_node;
8695 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn)))
8697 fn = build_cplus_new (TREE_TYPE (fn), fn, complain);
8698 maybe_warn_parm_abi (TREE_TYPE (fn), loc);
8701 return convert_from_reference (fn);
8704 /* Returns the value to use for the in-charge parameter when making a
8705 call to a function with the indicated NAME.
8707 FIXME:Can't we find a neater way to do this mapping? */
8709 tree
8710 in_charge_arg_for_name (tree name)
8712 if (IDENTIFIER_CTOR_P (name))
8714 if (name == complete_ctor_identifier)
8715 return integer_one_node;
8716 gcc_checking_assert (name == base_ctor_identifier);
8718 else
8720 if (name == complete_dtor_identifier)
8721 return integer_two_node;
8722 else if (name == deleting_dtor_identifier)
8723 return integer_three_node;
8724 gcc_checking_assert (name == base_dtor_identifier);
8727 return integer_zero_node;
8730 /* We've built up a constructor call RET. Complain if it delegates to the
8731 constructor we're currently compiling. */
8733 static void
8734 check_self_delegation (tree ret)
8736 if (TREE_CODE (ret) == TARGET_EXPR)
8737 ret = TARGET_EXPR_INITIAL (ret);
8738 tree fn = cp_get_callee_fndecl (ret);
8739 if (fn && DECL_ABSTRACT_ORIGIN (fn) == current_function_decl)
8740 error ("constructor delegates to itself");
8743 /* Build a call to a constructor, destructor, or an assignment
8744 operator for INSTANCE, an expression with class type. NAME
8745 indicates the special member function to call; *ARGS are the
8746 arguments. ARGS may be NULL. This may change ARGS. BINFO
8747 indicates the base of INSTANCE that is to be passed as the `this'
8748 parameter to the member function called.
8750 FLAGS are the LOOKUP_* flags to use when processing the call.
8752 If NAME indicates a complete object constructor, INSTANCE may be
8753 NULL_TREE. In this case, the caller will call build_cplus_new to
8754 store the newly constructed object into a VAR_DECL. */
8756 tree
8757 build_special_member_call (tree instance, tree name, vec<tree, va_gc> **args,
8758 tree binfo, int flags, tsubst_flags_t complain)
8760 tree fns;
8761 /* The type of the subobject to be constructed or destroyed. */
8762 tree class_type;
8763 vec<tree, va_gc> *allocated = NULL;
8764 tree ret;
8766 gcc_assert (IDENTIFIER_CDTOR_P (name) || name == assign_op_identifier);
8767 if (TYPE_P (binfo))
8769 /* Resolve the name. */
8770 if (!complete_type_or_maybe_complain (binfo, NULL_TREE, complain))
8771 return error_mark_node;
8773 binfo = TYPE_BINFO (binfo);
8776 gcc_assert (binfo != NULL_TREE);
8778 class_type = BINFO_TYPE (binfo);
8780 /* Handle the special case where INSTANCE is NULL_TREE. */
8781 if (name == complete_ctor_identifier && !instance)
8782 instance = build_dummy_object (class_type);
8783 else
8785 if (IDENTIFIER_DTOR_P (name))
8786 gcc_assert (args == NULL || vec_safe_is_empty (*args));
8788 /* Convert to the base class, if necessary. */
8789 if (!same_type_ignoring_top_level_qualifiers_p
8790 (TREE_TYPE (instance), BINFO_TYPE (binfo)))
8792 if (IDENTIFIER_CDTOR_P (name))
8793 /* For constructors and destructors, either the base is
8794 non-virtual, or it is virtual but we are doing the
8795 conversion from a constructor or destructor for the
8796 complete object. In either case, we can convert
8797 statically. */
8798 instance = convert_to_base_statically (instance, binfo);
8799 else
8801 /* However, for assignment operators, we must convert
8802 dynamically if the base is virtual. */
8803 gcc_checking_assert (name == assign_op_identifier);
8804 instance = build_base_path (PLUS_EXPR, instance,
8805 binfo, /*nonnull=*/1, complain);
8810 gcc_assert (instance != NULL_TREE);
8812 /* In C++17, "If the initializer expression is a prvalue and the
8813 cv-unqualified version of the source type is the same class as the class
8814 of the destination, the initializer expression is used to initialize the
8815 destination object." Handle that here to avoid doing overload
8816 resolution. */
8817 if (cxx_dialect >= cxx17
8818 && args && vec_safe_length (*args) == 1
8819 && name == complete_ctor_identifier)
8821 tree arg = (**args)[0];
8823 /* FIXME P0135 doesn't say how to handle direct initialization from a
8824 type with a suitable conversion operator. Let's handle it like
8825 copy-initialization, but allowing explict conversions. */
8826 tsubst_flags_t sub_complain = tf_warning;
8827 if (!is_dummy_object (instance))
8828 /* If we're using this to initialize a non-temporary object, don't
8829 require the destructor to be accessible. */
8830 sub_complain |= tf_no_cleanup;
8831 if (!reference_related_p (class_type, TREE_TYPE (arg)))
8832 arg = perform_implicit_conversion_flags (class_type, arg,
8833 sub_complain,
8834 flags);
8835 if ((TREE_CODE (arg) == TARGET_EXPR
8836 || TREE_CODE (arg) == CONSTRUCTOR)
8837 && (same_type_ignoring_top_level_qualifiers_p
8838 (class_type, TREE_TYPE (arg))))
8840 if (is_dummy_object (instance))
8841 return arg;
8842 else if (TREE_CODE (arg) == TARGET_EXPR)
8843 TARGET_EXPR_DIRECT_INIT_P (arg) = true;
8845 if ((complain & tf_error)
8846 && (flags & LOOKUP_DELEGATING_CONS))
8847 check_self_delegation (arg);
8848 /* Avoid change of behavior on Wunused-var-2.C. */
8849 instance = mark_lvalue_use (instance);
8850 return build2 (INIT_EXPR, class_type, instance, arg);
8854 fns = lookup_fnfields (binfo, name, 1);
8856 /* When making a call to a constructor or destructor for a subobject
8857 that uses virtual base classes, pass down a pointer to a VTT for
8858 the subobject. */
8859 if ((name == base_ctor_identifier
8860 || name == base_dtor_identifier)
8861 && CLASSTYPE_VBASECLASSES (class_type))
8863 tree vtt;
8864 tree sub_vtt;
8866 /* If the current function is a complete object constructor
8867 or destructor, then we fetch the VTT directly.
8868 Otherwise, we look it up using the VTT we were given. */
8869 vtt = DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type));
8870 vtt = decay_conversion (vtt, complain);
8871 if (vtt == error_mark_node)
8872 return error_mark_node;
8873 vtt = build_if_in_charge (vtt, current_vtt_parm);
8874 if (BINFO_SUBVTT_INDEX (binfo))
8875 sub_vtt = fold_build_pointer_plus (vtt, BINFO_SUBVTT_INDEX (binfo));
8876 else
8877 sub_vtt = vtt;
8879 if (args == NULL)
8881 allocated = make_tree_vector ();
8882 args = &allocated;
8885 vec_safe_insert (*args, 0, sub_vtt);
8888 ret = build_new_method_call (instance, fns, args,
8889 TYPE_BINFO (BINFO_TYPE (binfo)),
8890 flags, /*fn=*/NULL,
8891 complain);
8893 if (allocated != NULL)
8894 release_tree_vector (allocated);
8896 if ((complain & tf_error)
8897 && (flags & LOOKUP_DELEGATING_CONS)
8898 && name == complete_ctor_identifier)
8899 check_self_delegation (ret);
8901 return ret;
8904 /* Return the NAME, as a C string. The NAME indicates a function that
8905 is a member of TYPE. *FREE_P is set to true if the caller must
8906 free the memory returned.
8908 Rather than go through all of this, we should simply set the names
8909 of constructors and destructors appropriately, and dispense with
8910 ctor_identifier, dtor_identifier, etc. */
8912 static char *
8913 name_as_c_string (tree name, tree type, bool *free_p)
8915 const char *pretty_name;
8917 /* Assume that we will not allocate memory. */
8918 *free_p = false;
8919 /* Constructors and destructors are special. */
8920 if (IDENTIFIER_CDTOR_P (name))
8922 pretty_name
8923 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type)));
8924 /* For a destructor, add the '~'. */
8925 if (IDENTIFIER_DTOR_P (name))
8927 pretty_name = concat ("~", pretty_name, NULL);
8928 /* Remember that we need to free the memory allocated. */
8929 *free_p = true;
8932 else if (IDENTIFIER_CONV_OP_P (name))
8934 pretty_name = concat ("operator ",
8935 type_as_string_translate (TREE_TYPE (name),
8936 TFF_PLAIN_IDENTIFIER),
8937 NULL);
8938 /* Remember that we need to free the memory allocated. */
8939 *free_p = true;
8941 else
8942 pretty_name = identifier_to_locale (IDENTIFIER_POINTER (name));
8944 return CONST_CAST (char *, pretty_name);
8947 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
8948 be set, upon return, to the function called. ARGS may be NULL.
8949 This may change ARGS. */
8951 static tree
8952 build_new_method_call_1 (tree instance, tree fns, vec<tree, va_gc> **args,
8953 tree conversion_path, int flags,
8954 tree *fn_p, tsubst_flags_t complain)
8956 struct z_candidate *candidates = 0, *cand;
8957 tree explicit_targs = NULL_TREE;
8958 tree basetype = NULL_TREE;
8959 tree access_binfo, binfo;
8960 tree optype;
8961 tree first_mem_arg = NULL_TREE;
8962 tree name;
8963 bool skip_first_for_error;
8964 vec<tree, va_gc> *user_args;
8965 tree call;
8966 tree fn;
8967 int template_only = 0;
8968 bool any_viable_p;
8969 tree orig_instance;
8970 tree orig_fns;
8971 vec<tree, va_gc> *orig_args = NULL;
8972 void *p;
8974 gcc_assert (instance != NULL_TREE);
8976 /* We don't know what function we're going to call, yet. */
8977 if (fn_p)
8978 *fn_p = NULL_TREE;
8980 if (error_operand_p (instance)
8981 || !fns || error_operand_p (fns))
8982 return error_mark_node;
8984 if (!BASELINK_P (fns))
8986 if (complain & tf_error)
8987 error ("call to non-function %qD", fns);
8988 return error_mark_node;
8991 orig_instance = instance;
8992 orig_fns = fns;
8994 /* Dismantle the baselink to collect all the information we need. */
8995 if (!conversion_path)
8996 conversion_path = BASELINK_BINFO (fns);
8997 access_binfo = BASELINK_ACCESS_BINFO (fns);
8998 binfo = BASELINK_BINFO (fns);
8999 optype = BASELINK_OPTYPE (fns);
9000 fns = BASELINK_FUNCTIONS (fns);
9001 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
9003 explicit_targs = TREE_OPERAND (fns, 1);
9004 fns = TREE_OPERAND (fns, 0);
9005 template_only = 1;
9007 gcc_assert (TREE_CODE (fns) == FUNCTION_DECL
9008 || TREE_CODE (fns) == TEMPLATE_DECL
9009 || TREE_CODE (fns) == OVERLOAD);
9010 fn = OVL_FIRST (fns);
9011 name = DECL_NAME (fn);
9013 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (instance));
9014 gcc_assert (CLASS_TYPE_P (basetype));
9016 if (processing_template_decl)
9018 orig_args = args == NULL ? NULL : make_tree_vector_copy (*args);
9019 instance = build_non_dependent_expr (instance);
9020 if (args != NULL)
9021 make_args_non_dependent (*args);
9024 user_args = args == NULL ? NULL : *args;
9025 /* Under DR 147 A::A() is an invalid constructor call,
9026 not a functional cast. */
9027 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
9029 if (! (complain & tf_error))
9030 return error_mark_node;
9032 basetype = DECL_CONTEXT (fn);
9033 name = constructor_name (basetype);
9034 if (permerror (input_location,
9035 "cannot call constructor %<%T::%D%> directly",
9036 basetype, name))
9037 inform (input_location, "for a function-style cast, remove the "
9038 "redundant %<::%D%>", name);
9039 call = build_functional_cast (basetype, build_tree_list_vec (user_args),
9040 complain);
9041 return call;
9044 /* Process the argument list. */
9045 if (args != NULL && *args != NULL)
9047 *args = resolve_args (*args, complain);
9048 if (*args == NULL)
9049 return error_mark_node;
9052 /* Consider the object argument to be used even if we end up selecting a
9053 static member function. */
9054 instance = mark_type_use (instance);
9056 /* Figure out whether to skip the first argument for the error
9057 message we will display to users if an error occurs. We don't
9058 want to display any compiler-generated arguments. The "this"
9059 pointer hasn't been added yet. However, we must remove the VTT
9060 pointer if this is a call to a base-class constructor or
9061 destructor. */
9062 skip_first_for_error = false;
9063 if (IDENTIFIER_CDTOR_P (name))
9065 /* Callers should explicitly indicate whether they want to ctor
9066 the complete object or just the part without virtual bases. */
9067 gcc_assert (name != ctor_identifier);
9069 /* Remove the VTT pointer, if present. */
9070 if ((name == base_ctor_identifier || name == base_dtor_identifier)
9071 && CLASSTYPE_VBASECLASSES (basetype))
9072 skip_first_for_error = true;
9074 /* It's OK to call destructors and constructors on cv-qualified
9075 objects. Therefore, convert the INSTANCE to the unqualified
9076 type, if necessary. */
9077 if (!same_type_p (basetype, TREE_TYPE (instance)))
9079 instance = build_this (instance);
9080 instance = build_nop (build_pointer_type (basetype), instance);
9081 instance = build_fold_indirect_ref (instance);
9084 else
9085 gcc_assert (!DECL_DESTRUCTOR_P (fn) && !DECL_CONSTRUCTOR_P (fn));
9087 /* For the overload resolution we need to find the actual `this`
9088 that would be captured if the call turns out to be to a
9089 non-static member function. Do not actually capture it at this
9090 point. */
9091 if (DECL_CONSTRUCTOR_P (fn))
9092 /* Constructors don't use the enclosing 'this'. */
9093 first_mem_arg = instance;
9094 else
9095 first_mem_arg = maybe_resolve_dummy (instance, false);
9097 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9098 p = conversion_obstack_alloc (0);
9100 /* The number of arguments artificial parms in ARGS; we subtract one because
9101 there's no 'this' in ARGS. */
9102 unsigned skip = num_artificial_parms_for (fn) - 1;
9104 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
9105 initializer, not T({ }). */
9106 if (DECL_CONSTRUCTOR_P (fn)
9107 && vec_safe_length (user_args) > skip
9108 && DIRECT_LIST_INIT_P ((*user_args)[skip]))
9110 tree init_list = (*user_args)[skip];
9111 tree init = NULL_TREE;
9113 gcc_assert (user_args->length () == skip + 1
9114 && !(flags & LOOKUP_ONLYCONVERTING));
9116 /* If the initializer list has no elements and T is a class type with
9117 a default constructor, the object is value-initialized. Handle
9118 this here so we don't need to handle it wherever we use
9119 build_special_member_call. */
9120 if (CONSTRUCTOR_NELTS (init_list) == 0
9121 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype)
9122 /* For a user-provided default constructor, use the normal
9123 mechanisms so that protected access works. */
9124 && type_has_non_user_provided_default_constructor (basetype)
9125 && !processing_template_decl)
9126 init = build_value_init (basetype, complain);
9128 /* If BASETYPE is an aggregate, we need to do aggregate
9129 initialization. */
9130 else if (CP_AGGREGATE_TYPE_P (basetype))
9132 init = reshape_init (basetype, init_list, complain);
9133 init = digest_init (basetype, init, complain);
9136 if (init)
9138 if (is_dummy_object (instance))
9139 return get_target_expr_sfinae (init, complain);
9140 init = build2 (INIT_EXPR, TREE_TYPE (instance), instance, init);
9141 TREE_SIDE_EFFECTS (init) = true;
9142 return init;
9145 /* Otherwise go ahead with overload resolution. */
9146 add_list_candidates (fns, first_mem_arg, user_args,
9147 basetype, explicit_targs, template_only,
9148 conversion_path, access_binfo, flags,
9149 &candidates, complain);
9151 else
9152 add_candidates (fns, first_mem_arg, user_args, optype,
9153 explicit_targs, template_only, conversion_path,
9154 access_binfo, flags, &candidates, complain);
9156 any_viable_p = false;
9157 candidates = splice_viable (candidates, false, &any_viable_p);
9159 if (!any_viable_p)
9161 if (complain & tf_error)
9163 if (!COMPLETE_OR_OPEN_TYPE_P (basetype))
9164 cxx_incomplete_type_error (instance, basetype);
9165 else if (optype)
9166 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9167 basetype, optype, build_tree_list_vec (user_args),
9168 TREE_TYPE (instance));
9169 else
9171 tree arglist = build_tree_list_vec (user_args);
9172 tree errname = name;
9173 bool twiddle = false;
9174 if (IDENTIFIER_CDTOR_P (errname))
9176 twiddle = IDENTIFIER_DTOR_P (errname);
9177 errname = constructor_name (basetype);
9179 if (explicit_targs)
9180 errname = lookup_template_function (errname, explicit_targs);
9181 if (skip_first_for_error)
9182 arglist = TREE_CHAIN (arglist);
9183 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
9184 basetype, &"~"[!twiddle], errname, arglist,
9185 TREE_TYPE (instance));
9187 print_z_candidates (location_of (name), candidates);
9189 call = error_mark_node;
9191 else
9193 cand = tourney (candidates, complain);
9194 if (cand == 0)
9196 char *pretty_name;
9197 bool free_p;
9198 tree arglist;
9200 if (complain & tf_error)
9202 pretty_name = name_as_c_string (name, basetype, &free_p);
9203 arglist = build_tree_list_vec (user_args);
9204 if (skip_first_for_error)
9205 arglist = TREE_CHAIN (arglist);
9206 if (!any_strictly_viable (candidates))
9207 error ("no matching function for call to %<%s(%A)%>",
9208 pretty_name, arglist);
9209 else
9210 error ("call of overloaded %<%s(%A)%> is ambiguous",
9211 pretty_name, arglist);
9212 print_z_candidates (location_of (name), candidates);
9213 if (free_p)
9214 free (pretty_name);
9216 call = error_mark_node;
9218 else
9220 fn = cand->fn;
9221 call = NULL_TREE;
9223 if (!(flags & LOOKUP_NONVIRTUAL)
9224 && DECL_PURE_VIRTUAL_P (fn)
9225 && instance == current_class_ref
9226 && (complain & tf_warning))
9228 /* This is not an error, it is runtime undefined
9229 behavior. */
9230 if (!current_function_decl)
9231 warning (0, "pure virtual %q#D called from "
9232 "non-static data member initializer", fn);
9233 else if (DECL_CONSTRUCTOR_P (current_function_decl)
9234 || DECL_DESTRUCTOR_P (current_function_decl))
9235 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl)
9236 ? G_("pure virtual %q#D called from constructor")
9237 : G_("pure virtual %q#D called from destructor")),
9238 fn);
9241 if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE
9242 && !DECL_CONSTRUCTOR_P (fn)
9243 && is_dummy_object (instance))
9245 instance = maybe_resolve_dummy (instance, true);
9246 if (instance == error_mark_node)
9247 call = error_mark_node;
9248 else if (!is_dummy_object (instance))
9250 /* We captured 'this' in the current lambda now that
9251 we know we really need it. */
9252 cand->first_arg = instance;
9254 else if (any_dependent_bases_p ())
9255 /* We can't tell until instantiation time whether we can use
9256 *this as the implicit object argument. */;
9257 else
9259 if (complain & tf_error)
9260 error ("cannot call member function %qD without object",
9261 fn);
9262 call = error_mark_node;
9266 if (call != error_mark_node)
9268 /* Optimize away vtable lookup if we know that this
9269 function can't be overridden. We need to check if
9270 the context and the type where we found fn are the same,
9271 actually FN might be defined in a different class
9272 type because of a using-declaration. In this case, we
9273 do not want to perform a non-virtual call. */
9274 if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL)
9275 && same_type_ignoring_top_level_qualifiers_p
9276 (DECL_CONTEXT (fn), BINFO_TYPE (binfo))
9277 && resolves_to_fixed_type_p (instance, 0))
9278 flags |= LOOKUP_NONVIRTUAL;
9279 if (explicit_targs)
9280 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
9281 /* Now we know what function is being called. */
9282 if (fn_p)
9283 *fn_p = fn;
9284 /* Build the actual CALL_EXPR. */
9285 call = build_over_call (cand, flags, complain);
9286 /* In an expression of the form `a->f()' where `f' turns
9287 out to be a static member function, `a' is
9288 none-the-less evaluated. */
9289 if (TREE_CODE (TREE_TYPE (fn)) != METHOD_TYPE
9290 && !is_dummy_object (instance)
9291 && TREE_SIDE_EFFECTS (instance))
9293 /* But avoid the implicit lvalue-rvalue conversion when 'a'
9294 is volatile. */
9295 tree a = instance;
9296 if (TREE_THIS_VOLATILE (a))
9297 a = build_this (a);
9298 call = build2 (COMPOUND_EXPR, TREE_TYPE (call), a, call);
9300 else if (call != error_mark_node
9301 && DECL_DESTRUCTOR_P (cand->fn)
9302 && !VOID_TYPE_P (TREE_TYPE (call)))
9303 /* An explicit call of the form "x->~X()" has type
9304 "void". However, on platforms where destructors
9305 return "this" (i.e., those where
9306 targetm.cxx.cdtor_returns_this is true), such calls
9307 will appear to have a return value of pointer type
9308 to the low-level call machinery. We do not want to
9309 change the low-level machinery, since we want to be
9310 able to optimize "delete f()" on such platforms as
9311 "operator delete(~X(f()))" (rather than generating
9312 "t = f(), ~X(t), operator delete (t)"). */
9313 call = build_nop (void_type_node, call);
9318 if (processing_template_decl && call != error_mark_node)
9320 bool cast_to_void = false;
9322 if (TREE_CODE (call) == COMPOUND_EXPR)
9323 call = TREE_OPERAND (call, 1);
9324 else if (TREE_CODE (call) == NOP_EXPR)
9326 cast_to_void = true;
9327 call = TREE_OPERAND (call, 0);
9329 if (INDIRECT_REF_P (call))
9330 call = TREE_OPERAND (call, 0);
9331 call = (build_min_non_dep_call_vec
9332 (call,
9333 build_min (COMPONENT_REF, TREE_TYPE (CALL_EXPR_FN (call)),
9334 orig_instance, orig_fns, NULL_TREE),
9335 orig_args));
9336 SET_EXPR_LOCATION (call, input_location);
9337 call = convert_from_reference (call);
9338 if (cast_to_void)
9339 call = build_nop (void_type_node, call);
9342 /* Free all the conversions we allocated. */
9343 obstack_free (&conversion_obstack, p);
9345 if (orig_args != NULL)
9346 release_tree_vector (orig_args);
9348 return call;
9351 /* Wrapper for above. */
9353 tree
9354 build_new_method_call (tree instance, tree fns, vec<tree, va_gc> **args,
9355 tree conversion_path, int flags,
9356 tree *fn_p, tsubst_flags_t complain)
9358 tree ret;
9359 bool subtime = timevar_cond_start (TV_OVERLOAD);
9360 ret = build_new_method_call_1 (instance, fns, args, conversion_path, flags,
9361 fn_p, complain);
9362 timevar_cond_stop (TV_OVERLOAD, subtime);
9363 return ret;
9366 /* Returns true iff standard conversion sequence ICS1 is a proper
9367 subsequence of ICS2. */
9369 static bool
9370 is_subseq (conversion *ics1, conversion *ics2)
9372 /* We can assume that a conversion of the same code
9373 between the same types indicates a subsequence since we only get
9374 here if the types we are converting from are the same. */
9376 while (ics1->kind == ck_rvalue
9377 || ics1->kind == ck_lvalue)
9378 ics1 = next_conversion (ics1);
9380 while (1)
9382 while (ics2->kind == ck_rvalue
9383 || ics2->kind == ck_lvalue)
9384 ics2 = next_conversion (ics2);
9386 if (ics2->kind == ck_user
9387 || ics2->kind == ck_ambig
9388 || ics2->kind == ck_aggr
9389 || ics2->kind == ck_list
9390 || ics2->kind == ck_identity)
9391 /* At this point, ICS1 cannot be a proper subsequence of
9392 ICS2. We can get a USER_CONV when we are comparing the
9393 second standard conversion sequence of two user conversion
9394 sequences. */
9395 return false;
9397 ics2 = next_conversion (ics2);
9399 while (ics2->kind == ck_rvalue
9400 || ics2->kind == ck_lvalue)
9401 ics2 = next_conversion (ics2);
9403 if (ics2->kind == ics1->kind
9404 && same_type_p (ics2->type, ics1->type)
9405 && (ics1->kind == ck_identity
9406 || same_type_p (next_conversion (ics2)->type,
9407 next_conversion (ics1)->type)))
9408 return true;
9412 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
9413 be any _TYPE nodes. */
9415 bool
9416 is_properly_derived_from (tree derived, tree base)
9418 if (!CLASS_TYPE_P (derived) || !CLASS_TYPE_P (base))
9419 return false;
9421 /* We only allow proper derivation here. The DERIVED_FROM_P macro
9422 considers every class derived from itself. */
9423 return (!same_type_ignoring_top_level_qualifiers_p (derived, base)
9424 && DERIVED_FROM_P (base, derived));
9427 /* We build the ICS for an implicit object parameter as a pointer
9428 conversion sequence. However, such a sequence should be compared
9429 as if it were a reference conversion sequence. If ICS is the
9430 implicit conversion sequence for an implicit object parameter,
9431 modify it accordingly. */
9433 static void
9434 maybe_handle_implicit_object (conversion **ics)
9436 if ((*ics)->this_p)
9438 /* [over.match.funcs]
9440 For non-static member functions, the type of the
9441 implicit object parameter is "reference to cv X"
9442 where X is the class of which the function is a
9443 member and cv is the cv-qualification on the member
9444 function declaration. */
9445 conversion *t = *ics;
9446 tree reference_type;
9448 /* The `this' parameter is a pointer to a class type. Make the
9449 implicit conversion talk about a reference to that same class
9450 type. */
9451 reference_type = TREE_TYPE (t->type);
9452 reference_type = build_reference_type (reference_type);
9454 if (t->kind == ck_qual)
9455 t = next_conversion (t);
9456 if (t->kind == ck_ptr)
9457 t = next_conversion (t);
9458 t = build_identity_conv (TREE_TYPE (t->type), NULL_TREE);
9459 t = direct_reference_binding (reference_type, t);
9460 t->this_p = 1;
9461 t->rvaluedness_matches_p = 0;
9462 *ics = t;
9466 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
9467 and return the initial reference binding conversion. Otherwise,
9468 leave *ICS unchanged and return NULL. */
9470 static conversion *
9471 maybe_handle_ref_bind (conversion **ics)
9473 if ((*ics)->kind == ck_ref_bind)
9475 conversion *old_ics = *ics;
9476 *ics = next_conversion (old_ics);
9477 (*ics)->user_conv_p = old_ics->user_conv_p;
9478 return old_ics;
9481 return NULL;
9484 /* Compare two implicit conversion sequences according to the rules set out in
9485 [over.ics.rank]. Return values:
9487 1: ics1 is better than ics2
9488 -1: ics2 is better than ics1
9489 0: ics1 and ics2 are indistinguishable */
9491 static int
9492 compare_ics (conversion *ics1, conversion *ics2)
9494 tree from_type1;
9495 tree from_type2;
9496 tree to_type1;
9497 tree to_type2;
9498 tree deref_from_type1 = NULL_TREE;
9499 tree deref_from_type2 = NULL_TREE;
9500 tree deref_to_type1 = NULL_TREE;
9501 tree deref_to_type2 = NULL_TREE;
9502 conversion_rank rank1, rank2;
9504 /* REF_BINDING is nonzero if the result of the conversion sequence
9505 is a reference type. In that case REF_CONV is the reference
9506 binding conversion. */
9507 conversion *ref_conv1;
9508 conversion *ref_conv2;
9510 /* Compare badness before stripping the reference conversion. */
9511 if (ics1->bad_p > ics2->bad_p)
9512 return -1;
9513 else if (ics1->bad_p < ics2->bad_p)
9514 return 1;
9516 /* Handle implicit object parameters. */
9517 maybe_handle_implicit_object (&ics1);
9518 maybe_handle_implicit_object (&ics2);
9520 /* Handle reference parameters. */
9521 ref_conv1 = maybe_handle_ref_bind (&ics1);
9522 ref_conv2 = maybe_handle_ref_bind (&ics2);
9524 /* List-initialization sequence L1 is a better conversion sequence than
9525 list-initialization sequence L2 if L1 converts to
9526 std::initializer_list<X> for some X and L2 does not. */
9527 if (ics1->kind == ck_list && ics2->kind != ck_list)
9528 return 1;
9529 if (ics2->kind == ck_list && ics1->kind != ck_list)
9530 return -1;
9532 /* [over.ics.rank]
9534 When comparing the basic forms of implicit conversion sequences (as
9535 defined in _over.best.ics_)
9537 --a standard conversion sequence (_over.ics.scs_) is a better
9538 conversion sequence than a user-defined conversion sequence
9539 or an ellipsis conversion sequence, and
9541 --a user-defined conversion sequence (_over.ics.user_) is a
9542 better conversion sequence than an ellipsis conversion sequence
9543 (_over.ics.ellipsis_). */
9544 /* Use BAD_CONVERSION_RANK because we already checked for a badness
9545 mismatch. If both ICS are bad, we try to make a decision based on
9546 what would have happened if they'd been good. This is not an
9547 extension, we'll still give an error when we build up the call; this
9548 just helps us give a more helpful error message. */
9549 rank1 = BAD_CONVERSION_RANK (ics1);
9550 rank2 = BAD_CONVERSION_RANK (ics2);
9552 if (rank1 > rank2)
9553 return -1;
9554 else if (rank1 < rank2)
9555 return 1;
9557 if (ics1->ellipsis_p)
9558 /* Both conversions are ellipsis conversions. */
9559 return 0;
9561 /* User-defined conversion sequence U1 is a better conversion sequence
9562 than another user-defined conversion sequence U2 if they contain the
9563 same user-defined conversion operator or constructor and if the sec-
9564 ond standard conversion sequence of U1 is better than the second
9565 standard conversion sequence of U2. */
9567 /* Handle list-conversion with the same code even though it isn't always
9568 ranked as a user-defined conversion and it doesn't have a second
9569 standard conversion sequence; it will still have the desired effect.
9570 Specifically, we need to do the reference binding comparison at the
9571 end of this function. */
9573 if (ics1->user_conv_p || ics1->kind == ck_list || ics1->kind == ck_aggr)
9575 conversion *t1;
9576 conversion *t2;
9578 for (t1 = ics1; t1->kind != ck_user; t1 = next_conversion (t1))
9579 if (t1->kind == ck_ambig || t1->kind == ck_aggr
9580 || t1->kind == ck_list)
9581 break;
9582 for (t2 = ics2; t2->kind != ck_user; t2 = next_conversion (t2))
9583 if (t2->kind == ck_ambig || t2->kind == ck_aggr
9584 || t2->kind == ck_list)
9585 break;
9587 if (t1->kind != t2->kind)
9588 return 0;
9589 else if (t1->kind == ck_user)
9591 tree f1 = t1->cand ? t1->cand->fn : t1->type;
9592 tree f2 = t2->cand ? t2->cand->fn : t2->type;
9593 if (f1 != f2)
9594 return 0;
9596 else
9598 /* For ambiguous or aggregate conversions, use the target type as
9599 a proxy for the conversion function. */
9600 if (!same_type_ignoring_top_level_qualifiers_p (t1->type, t2->type))
9601 return 0;
9604 /* We can just fall through here, after setting up
9605 FROM_TYPE1 and FROM_TYPE2. */
9606 from_type1 = t1->type;
9607 from_type2 = t2->type;
9609 else
9611 conversion *t1;
9612 conversion *t2;
9614 /* We're dealing with two standard conversion sequences.
9616 [over.ics.rank]
9618 Standard conversion sequence S1 is a better conversion
9619 sequence than standard conversion sequence S2 if
9621 --S1 is a proper subsequence of S2 (comparing the conversion
9622 sequences in the canonical form defined by _over.ics.scs_,
9623 excluding any Lvalue Transformation; the identity
9624 conversion sequence is considered to be a subsequence of
9625 any non-identity conversion sequence */
9627 t1 = ics1;
9628 while (t1->kind != ck_identity)
9629 t1 = next_conversion (t1);
9630 from_type1 = t1->type;
9632 t2 = ics2;
9633 while (t2->kind != ck_identity)
9634 t2 = next_conversion (t2);
9635 from_type2 = t2->type;
9638 /* One sequence can only be a subsequence of the other if they start with
9639 the same type. They can start with different types when comparing the
9640 second standard conversion sequence in two user-defined conversion
9641 sequences. */
9642 if (same_type_p (from_type1, from_type2))
9644 if (is_subseq (ics1, ics2))
9645 return 1;
9646 if (is_subseq (ics2, ics1))
9647 return -1;
9650 /* [over.ics.rank]
9652 Or, if not that,
9654 --the rank of S1 is better than the rank of S2 (by the rules
9655 defined below):
9657 Standard conversion sequences are ordered by their ranks: an Exact
9658 Match is a better conversion than a Promotion, which is a better
9659 conversion than a Conversion.
9661 Two conversion sequences with the same rank are indistinguishable
9662 unless one of the following rules applies:
9664 --A conversion that does not a convert a pointer, pointer to member,
9665 or std::nullptr_t to bool is better than one that does.
9667 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
9668 so that we do not have to check it explicitly. */
9669 if (ics1->rank < ics2->rank)
9670 return 1;
9671 else if (ics2->rank < ics1->rank)
9672 return -1;
9674 to_type1 = ics1->type;
9675 to_type2 = ics2->type;
9677 /* A conversion from scalar arithmetic type to complex is worse than a
9678 conversion between scalar arithmetic types. */
9679 if (same_type_p (from_type1, from_type2)
9680 && ARITHMETIC_TYPE_P (from_type1)
9681 && ARITHMETIC_TYPE_P (to_type1)
9682 && ARITHMETIC_TYPE_P (to_type2)
9683 && ((TREE_CODE (to_type1) == COMPLEX_TYPE)
9684 != (TREE_CODE (to_type2) == COMPLEX_TYPE)))
9686 if (TREE_CODE (to_type1) == COMPLEX_TYPE)
9687 return -1;
9688 else
9689 return 1;
9692 if (TYPE_PTR_P (from_type1)
9693 && TYPE_PTR_P (from_type2)
9694 && TYPE_PTR_P (to_type1)
9695 && TYPE_PTR_P (to_type2))
9697 deref_from_type1 = TREE_TYPE (from_type1);
9698 deref_from_type2 = TREE_TYPE (from_type2);
9699 deref_to_type1 = TREE_TYPE (to_type1);
9700 deref_to_type2 = TREE_TYPE (to_type2);
9702 /* The rules for pointers to members A::* are just like the rules
9703 for pointers A*, except opposite: if B is derived from A then
9704 A::* converts to B::*, not vice versa. For that reason, we
9705 switch the from_ and to_ variables here. */
9706 else if ((TYPE_PTRDATAMEM_P (from_type1) && TYPE_PTRDATAMEM_P (from_type2)
9707 && TYPE_PTRDATAMEM_P (to_type1) && TYPE_PTRDATAMEM_P (to_type2))
9708 || (TYPE_PTRMEMFUNC_P (from_type1)
9709 && TYPE_PTRMEMFUNC_P (from_type2)
9710 && TYPE_PTRMEMFUNC_P (to_type1)
9711 && TYPE_PTRMEMFUNC_P (to_type2)))
9713 deref_to_type1 = TYPE_PTRMEM_CLASS_TYPE (from_type1);
9714 deref_to_type2 = TYPE_PTRMEM_CLASS_TYPE (from_type2);
9715 deref_from_type1 = TYPE_PTRMEM_CLASS_TYPE (to_type1);
9716 deref_from_type2 = TYPE_PTRMEM_CLASS_TYPE (to_type2);
9719 if (deref_from_type1 != NULL_TREE
9720 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1))
9721 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2)))
9723 /* This was one of the pointer or pointer-like conversions.
9725 [over.ics.rank]
9727 --If class B is derived directly or indirectly from class A,
9728 conversion of B* to A* is better than conversion of B* to
9729 void*, and conversion of A* to void* is better than
9730 conversion of B* to void*. */
9731 if (VOID_TYPE_P (deref_to_type1)
9732 && VOID_TYPE_P (deref_to_type2))
9734 if (is_properly_derived_from (deref_from_type1,
9735 deref_from_type2))
9736 return -1;
9737 else if (is_properly_derived_from (deref_from_type2,
9738 deref_from_type1))
9739 return 1;
9741 else if (VOID_TYPE_P (deref_to_type1)
9742 || VOID_TYPE_P (deref_to_type2))
9744 if (same_type_p (deref_from_type1, deref_from_type2))
9746 if (VOID_TYPE_P (deref_to_type2))
9748 if (is_properly_derived_from (deref_from_type1,
9749 deref_to_type1))
9750 return 1;
9752 /* We know that DEREF_TO_TYPE1 is `void' here. */
9753 else if (is_properly_derived_from (deref_from_type1,
9754 deref_to_type2))
9755 return -1;
9758 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1))
9759 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2)))
9761 /* [over.ics.rank]
9763 --If class B is derived directly or indirectly from class A
9764 and class C is derived directly or indirectly from B,
9766 --conversion of C* to B* is better than conversion of C* to
9769 --conversion of B* to A* is better than conversion of C* to
9770 A* */
9771 if (same_type_p (deref_from_type1, deref_from_type2))
9773 if (is_properly_derived_from (deref_to_type1,
9774 deref_to_type2))
9775 return 1;
9776 else if (is_properly_derived_from (deref_to_type2,
9777 deref_to_type1))
9778 return -1;
9780 else if (same_type_p (deref_to_type1, deref_to_type2))
9782 if (is_properly_derived_from (deref_from_type2,
9783 deref_from_type1))
9784 return 1;
9785 else if (is_properly_derived_from (deref_from_type1,
9786 deref_from_type2))
9787 return -1;
9791 else if (CLASS_TYPE_P (non_reference (from_type1))
9792 && same_type_p (from_type1, from_type2))
9794 tree from = non_reference (from_type1);
9796 /* [over.ics.rank]
9798 --binding of an expression of type C to a reference of type
9799 B& is better than binding an expression of type C to a
9800 reference of type A&
9802 --conversion of C to B is better than conversion of C to A, */
9803 if (is_properly_derived_from (from, to_type1)
9804 && is_properly_derived_from (from, to_type2))
9806 if (is_properly_derived_from (to_type1, to_type2))
9807 return 1;
9808 else if (is_properly_derived_from (to_type2, to_type1))
9809 return -1;
9812 else if (CLASS_TYPE_P (non_reference (to_type1))
9813 && same_type_p (to_type1, to_type2))
9815 tree to = non_reference (to_type1);
9817 /* [over.ics.rank]
9819 --binding of an expression of type B to a reference of type
9820 A& is better than binding an expression of type C to a
9821 reference of type A&,
9823 --conversion of B to A is better than conversion of C to A */
9824 if (is_properly_derived_from (from_type1, to)
9825 && is_properly_derived_from (from_type2, to))
9827 if (is_properly_derived_from (from_type2, from_type1))
9828 return 1;
9829 else if (is_properly_derived_from (from_type1, from_type2))
9830 return -1;
9834 /* [over.ics.rank]
9836 --S1 and S2 differ only in their qualification conversion and yield
9837 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
9838 qualification signature of type T1 is a proper subset of the cv-
9839 qualification signature of type T2 */
9840 if (ics1->kind == ck_qual
9841 && ics2->kind == ck_qual
9842 && same_type_p (from_type1, from_type2))
9844 int result = comp_cv_qual_signature (to_type1, to_type2);
9845 if (result != 0)
9846 return result;
9849 /* [over.ics.rank]
9851 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
9852 to an implicit object parameter of a non-static member function
9853 declared without a ref-qualifier, and either S1 binds an lvalue
9854 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
9855 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
9856 draft standard, 13.3.3.2)
9858 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
9859 types to which the references refer are the same type except for
9860 top-level cv-qualifiers, and the type to which the reference
9861 initialized by S2 refers is more cv-qualified than the type to
9862 which the reference initialized by S1 refers.
9864 DR 1328 [over.match.best]: the context is an initialization by
9865 conversion function for direct reference binding (13.3.1.6) of a
9866 reference to function type, the return type of F1 is the same kind of
9867 reference (i.e. lvalue or rvalue) as the reference being initialized,
9868 and the return type of F2 is not. */
9870 if (ref_conv1 && ref_conv2)
9872 if (!ref_conv1->this_p && !ref_conv2->this_p
9873 && (ref_conv1->rvaluedness_matches_p
9874 != ref_conv2->rvaluedness_matches_p)
9875 && (same_type_p (ref_conv1->type, ref_conv2->type)
9876 || (TYPE_REF_IS_RVALUE (ref_conv1->type)
9877 != TYPE_REF_IS_RVALUE (ref_conv2->type))))
9879 if (ref_conv1->bad_p
9880 && !same_type_p (TREE_TYPE (ref_conv1->type),
9881 TREE_TYPE (ref_conv2->type)))
9882 /* Don't prefer a bad conversion that drops cv-quals to a bad
9883 conversion with the wrong rvalueness. */
9884 return 0;
9885 return (ref_conv1->rvaluedness_matches_p
9886 - ref_conv2->rvaluedness_matches_p);
9889 if (same_type_ignoring_top_level_qualifiers_p (to_type1, to_type2))
9891 int q1 = cp_type_quals (TREE_TYPE (ref_conv1->type));
9892 int q2 = cp_type_quals (TREE_TYPE (ref_conv2->type));
9893 if (ref_conv1->bad_p)
9895 /* Prefer the one that drops fewer cv-quals. */
9896 tree ftype = next_conversion (ref_conv1)->type;
9897 int fquals = cp_type_quals (ftype);
9898 q1 ^= fquals;
9899 q2 ^= fquals;
9901 return comp_cv_qualification (q2, q1);
9905 /* Neither conversion sequence is better than the other. */
9906 return 0;
9909 /* The source type for this standard conversion sequence. */
9911 static tree
9912 source_type (conversion *t)
9914 for (;; t = next_conversion (t))
9916 if (t->kind == ck_user
9917 || t->kind == ck_ambig
9918 || t->kind == ck_identity)
9919 return t->type;
9921 gcc_unreachable ();
9924 /* Note a warning about preferring WINNER to LOSER. We do this by storing
9925 a pointer to LOSER and re-running joust to produce the warning if WINNER
9926 is actually used. */
9928 static void
9929 add_warning (struct z_candidate *winner, struct z_candidate *loser)
9931 candidate_warning *cw = (candidate_warning *)
9932 conversion_obstack_alloc (sizeof (candidate_warning));
9933 cw->loser = loser;
9934 cw->next = winner->warnings;
9935 winner->warnings = cw;
9938 /* Compare two candidates for overloading as described in
9939 [over.match.best]. Return values:
9941 1: cand1 is better than cand2
9942 -1: cand2 is better than cand1
9943 0: cand1 and cand2 are indistinguishable */
9945 static int
9946 joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn,
9947 tsubst_flags_t complain)
9949 int winner = 0;
9950 int off1 = 0, off2 = 0;
9951 size_t i;
9952 size_t len;
9954 /* Candidates that involve bad conversions are always worse than those
9955 that don't. */
9956 if (cand1->viable > cand2->viable)
9957 return 1;
9958 if (cand1->viable < cand2->viable)
9959 return -1;
9961 /* If we have two pseudo-candidates for conversions to the same type,
9962 or two candidates for the same function, arbitrarily pick one. */
9963 if (cand1->fn == cand2->fn
9964 && (IS_TYPE_OR_DECL_P (cand1->fn)))
9965 return 1;
9967 /* Prefer a non-deleted function over an implicitly deleted move
9968 constructor or assignment operator. This differs slightly from the
9969 wording for issue 1402 (which says the move op is ignored by overload
9970 resolution), but this way produces better error messages. */
9971 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
9972 && TREE_CODE (cand2->fn) == FUNCTION_DECL
9973 && DECL_DELETED_FN (cand1->fn) != DECL_DELETED_FN (cand2->fn))
9975 if (DECL_DELETED_FN (cand1->fn) && DECL_DEFAULTED_FN (cand1->fn)
9976 && move_fn_p (cand1->fn))
9977 return -1;
9978 if (DECL_DELETED_FN (cand2->fn) && DECL_DEFAULTED_FN (cand2->fn)
9979 && move_fn_p (cand2->fn))
9980 return 1;
9983 /* a viable function F1
9984 is defined to be a better function than another viable function F2 if
9985 for all arguments i, ICSi(F1) is not a worse conversion sequence than
9986 ICSi(F2), and then */
9988 /* for some argument j, ICSj(F1) is a better conversion sequence than
9989 ICSj(F2) */
9991 /* For comparing static and non-static member functions, we ignore
9992 the implicit object parameter of the non-static function. The
9993 standard says to pretend that the static function has an object
9994 parm, but that won't work with operator overloading. */
9995 len = cand1->num_convs;
9996 if (len != cand2->num_convs)
9998 int static_1 = DECL_STATIC_FUNCTION_P (cand1->fn);
9999 int static_2 = DECL_STATIC_FUNCTION_P (cand2->fn);
10001 if (DECL_CONSTRUCTOR_P (cand1->fn)
10002 && is_list_ctor (cand1->fn) != is_list_ctor (cand2->fn))
10003 /* We're comparing a near-match list constructor and a near-match
10004 non-list constructor. Just treat them as unordered. */
10005 return 0;
10007 gcc_assert (static_1 != static_2);
10009 if (static_1)
10010 off2 = 1;
10011 else
10013 off1 = 1;
10014 --len;
10018 for (i = 0; i < len; ++i)
10020 conversion *t1 = cand1->convs[i + off1];
10021 conversion *t2 = cand2->convs[i + off2];
10022 int comp = compare_ics (t1, t2);
10024 if (comp != 0)
10026 if ((complain & tf_warning)
10027 && warn_sign_promo
10028 && (CONVERSION_RANK (t1) + CONVERSION_RANK (t2)
10029 == cr_std + cr_promotion)
10030 && t1->kind == ck_std
10031 && t2->kind == ck_std
10032 && TREE_CODE (t1->type) == INTEGER_TYPE
10033 && TREE_CODE (t2->type) == INTEGER_TYPE
10034 && (TYPE_PRECISION (t1->type)
10035 == TYPE_PRECISION (t2->type))
10036 && (TYPE_UNSIGNED (next_conversion (t1)->type)
10037 || (TREE_CODE (next_conversion (t1)->type)
10038 == ENUMERAL_TYPE)))
10040 tree type = next_conversion (t1)->type;
10041 tree type1, type2;
10042 struct z_candidate *w, *l;
10043 if (comp > 0)
10044 type1 = t1->type, type2 = t2->type,
10045 w = cand1, l = cand2;
10046 else
10047 type1 = t2->type, type2 = t1->type,
10048 w = cand2, l = cand1;
10050 if (warn)
10052 warning (OPT_Wsign_promo, "passing %qT chooses %qT over %qT",
10053 type, type1, type2);
10054 warning (OPT_Wsign_promo, " in call to %qD", w->fn);
10056 else
10057 add_warning (w, l);
10060 if (winner && comp != winner)
10062 winner = 0;
10063 goto tweak;
10065 winner = comp;
10069 /* warn about confusing overload resolution for user-defined conversions,
10070 either between a constructor and a conversion op, or between two
10071 conversion ops. */
10072 if ((complain & tf_warning)
10073 && winner && warn_conversion && cand1->second_conv
10074 && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn))
10075 && winner != compare_ics (cand1->second_conv, cand2->second_conv))
10077 struct z_candidate *w, *l;
10078 bool give_warning = false;
10080 if (winner == 1)
10081 w = cand1, l = cand2;
10082 else
10083 w = cand2, l = cand1;
10085 /* We don't want to complain about `X::operator T1 ()'
10086 beating `X::operator T2 () const', when T2 is a no less
10087 cv-qualified version of T1. */
10088 if (DECL_CONTEXT (w->fn) == DECL_CONTEXT (l->fn)
10089 && !DECL_CONSTRUCTOR_P (w->fn) && !DECL_CONSTRUCTOR_P (l->fn))
10091 tree t = TREE_TYPE (TREE_TYPE (l->fn));
10092 tree f = TREE_TYPE (TREE_TYPE (w->fn));
10094 if (TREE_CODE (t) == TREE_CODE (f) && POINTER_TYPE_P (t))
10096 t = TREE_TYPE (t);
10097 f = TREE_TYPE (f);
10099 if (!comp_ptr_ttypes (t, f))
10100 give_warning = true;
10102 else
10103 give_warning = true;
10105 if (!give_warning)
10106 /*NOP*/;
10107 else if (warn)
10109 tree source = source_type (w->convs[0]);
10110 if (POINTER_TYPE_P (source))
10111 source = TREE_TYPE (source);
10112 if (warning (OPT_Wconversion, "choosing %qD over %qD", w->fn, l->fn)
10113 && warning (OPT_Wconversion, " for conversion from %qH to %qI",
10114 source, w->second_conv->type))
10116 inform (input_location, " because conversion sequence for the argument is better");
10119 else
10120 add_warning (w, l);
10123 if (winner)
10124 return winner;
10126 /* DR 495 moved this tiebreaker above the template ones. */
10127 /* or, if not that,
10128 the context is an initialization by user-defined conversion (see
10129 _dcl.init_ and _over.match.user_) and the standard conversion
10130 sequence from the return type of F1 to the destination type (i.e.,
10131 the type of the entity being initialized) is a better conversion
10132 sequence than the standard conversion sequence from the return type
10133 of F2 to the destination type. */
10135 if (cand1->second_conv)
10137 winner = compare_ics (cand1->second_conv, cand2->second_conv);
10138 if (winner)
10139 return winner;
10142 /* or, if not that,
10143 F1 is a non-template function and F2 is a template function
10144 specialization. */
10146 if (!cand1->template_decl && cand2->template_decl)
10147 return 1;
10148 else if (cand1->template_decl && !cand2->template_decl)
10149 return -1;
10151 /* or, if not that,
10152 F1 and F2 are template functions and the function template for F1 is
10153 more specialized than the template for F2 according to the partial
10154 ordering rules. */
10156 if (cand1->template_decl && cand2->template_decl)
10158 winner = more_specialized_fn
10159 (TI_TEMPLATE (cand1->template_decl),
10160 TI_TEMPLATE (cand2->template_decl),
10161 /* [temp.func.order]: The presence of unused ellipsis and default
10162 arguments has no effect on the partial ordering of function
10163 templates. add_function_candidate() will not have
10164 counted the "this" argument for constructors. */
10165 cand1->num_convs + DECL_CONSTRUCTOR_P (cand1->fn));
10166 if (winner)
10167 return winner;
10170 // C++ Concepts
10171 // or, if not that, F1 is more constrained than F2.
10172 if (flag_concepts && DECL_P (cand1->fn) && DECL_P (cand2->fn))
10174 winner = more_constrained (cand1->fn, cand2->fn);
10175 if (winner)
10176 return winner;
10179 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
10180 if (deduction_guide_p (cand1->fn))
10182 gcc_assert (deduction_guide_p (cand2->fn));
10183 /* We distinguish between candidates from an explicit deduction guide and
10184 candidates built from a constructor based on DECL_ARTIFICIAL. */
10185 int art1 = DECL_ARTIFICIAL (cand1->fn);
10186 int art2 = DECL_ARTIFICIAL (cand2->fn);
10187 if (art1 != art2)
10188 return art2 - art1;
10190 if (art1)
10192 /* Prefer the special copy guide over a declared copy/move
10193 constructor. */
10194 if (copy_guide_p (cand1->fn))
10195 return 1;
10196 if (copy_guide_p (cand2->fn))
10197 return -1;
10199 /* Prefer a candidate generated from a non-template constructor. */
10200 int tg1 = template_guide_p (cand1->fn);
10201 int tg2 = template_guide_p (cand2->fn);
10202 if (tg1 != tg2)
10203 return tg2 - tg1;
10207 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
10208 for all arguments the corresponding parameters of F1 and F2 have the same
10209 type (CWG 2273/2277). */
10210 if (DECL_P (cand1->fn) && DECL_CLASS_SCOPE_P (cand1->fn)
10211 && !DECL_CONV_FN_P (cand1->fn)
10212 && DECL_P (cand2->fn) && DECL_CLASS_SCOPE_P (cand2->fn)
10213 && !DECL_CONV_FN_P (cand2->fn))
10215 tree base1 = DECL_CONTEXT (strip_inheriting_ctors (cand1->fn));
10216 tree base2 = DECL_CONTEXT (strip_inheriting_ctors (cand2->fn));
10218 bool used1 = false;
10219 bool used2 = false;
10220 if (base1 == base2)
10221 /* No difference. */;
10222 else if (DERIVED_FROM_P (base1, base2))
10223 used1 = true;
10224 else if (DERIVED_FROM_P (base2, base1))
10225 used2 = true;
10227 if (int diff = used2 - used1)
10229 for (i = 0; i < len; ++i)
10231 conversion *t1 = cand1->convs[i + off1];
10232 conversion *t2 = cand2->convs[i + off2];
10233 if (!same_type_p (t1->type, t2->type))
10234 break;
10236 if (i == len)
10237 return diff;
10241 /* Check whether we can discard a builtin candidate, either because we
10242 have two identical ones or matching builtin and non-builtin candidates.
10244 (Pedantically in the latter case the builtin which matched the user
10245 function should not be added to the overload set, but we spot it here.
10247 [over.match.oper]
10248 ... the builtin candidates include ...
10249 - do not have the same parameter type list as any non-template
10250 non-member candidate. */
10252 if (identifier_p (cand1->fn) || identifier_p (cand2->fn))
10254 for (i = 0; i < len; ++i)
10255 if (!same_type_p (cand1->convs[i]->type,
10256 cand2->convs[i]->type))
10257 break;
10258 if (i == cand1->num_convs)
10260 if (cand1->fn == cand2->fn)
10261 /* Two built-in candidates; arbitrarily pick one. */
10262 return 1;
10263 else if (identifier_p (cand1->fn))
10264 /* cand1 is built-in; prefer cand2. */
10265 return -1;
10266 else
10267 /* cand2 is built-in; prefer cand1. */
10268 return 1;
10272 /* For candidates of a multi-versioned function, make the version with
10273 the highest priority win. This version will be checked for dispatching
10274 first. If this version can be inlined into the caller, the front-end
10275 will simply make a direct call to this function. */
10277 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
10278 && DECL_FUNCTION_VERSIONED (cand1->fn)
10279 && TREE_CODE (cand2->fn) == FUNCTION_DECL
10280 && DECL_FUNCTION_VERSIONED (cand2->fn))
10282 tree f1 = TREE_TYPE (cand1->fn);
10283 tree f2 = TREE_TYPE (cand2->fn);
10284 tree p1 = TYPE_ARG_TYPES (f1);
10285 tree p2 = TYPE_ARG_TYPES (f2);
10287 /* Check if cand1->fn and cand2->fn are versions of the same function. It
10288 is possible that cand1->fn and cand2->fn are function versions but of
10289 different functions. Check types to see if they are versions of the same
10290 function. */
10291 if (compparms (p1, p2)
10292 && same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
10294 /* Always make the version with the higher priority, more
10295 specialized, win. */
10296 gcc_assert (targetm.compare_version_priority);
10297 if (targetm.compare_version_priority (cand1->fn, cand2->fn) >= 0)
10298 return 1;
10299 else
10300 return -1;
10304 /* If the two function declarations represent the same function (this can
10305 happen with declarations in multiple scopes and arg-dependent lookup),
10306 arbitrarily choose one. But first make sure the default args we're
10307 using match. */
10308 if (DECL_P (cand1->fn) && DECL_P (cand2->fn)
10309 && equal_functions (cand1->fn, cand2->fn))
10311 tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (cand1->fn));
10312 tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (cand2->fn));
10314 gcc_assert (!DECL_CONSTRUCTOR_P (cand1->fn));
10316 for (i = 0; i < len; ++i)
10318 /* Don't crash if the fn is variadic. */
10319 if (!parms1)
10320 break;
10321 parms1 = TREE_CHAIN (parms1);
10322 parms2 = TREE_CHAIN (parms2);
10325 if (off1)
10326 parms1 = TREE_CHAIN (parms1);
10327 else if (off2)
10328 parms2 = TREE_CHAIN (parms2);
10330 for (; parms1; ++i)
10332 if (!cp_tree_equal (TREE_PURPOSE (parms1),
10333 TREE_PURPOSE (parms2)))
10335 if (warn)
10337 if (complain & tf_error)
10339 if (permerror (input_location,
10340 "default argument mismatch in "
10341 "overload resolution"))
10343 inform (DECL_SOURCE_LOCATION (cand1->fn),
10344 " candidate 1: %q#F", cand1->fn);
10345 inform (DECL_SOURCE_LOCATION (cand2->fn),
10346 " candidate 2: %q#F", cand2->fn);
10349 else
10350 return 0;
10352 else
10353 add_warning (cand1, cand2);
10354 break;
10356 parms1 = TREE_CHAIN (parms1);
10357 parms2 = TREE_CHAIN (parms2);
10360 return 1;
10363 tweak:
10365 /* Extension: If the worst conversion for one candidate is worse than the
10366 worst conversion for the other, take the first. */
10367 if (!pedantic && (complain & tf_warning_or_error))
10369 conversion_rank rank1 = cr_identity, rank2 = cr_identity;
10370 struct z_candidate *w = 0, *l = 0;
10372 for (i = 0; i < len; ++i)
10374 if (CONVERSION_RANK (cand1->convs[i+off1]) > rank1)
10375 rank1 = CONVERSION_RANK (cand1->convs[i+off1]);
10376 if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2)
10377 rank2 = CONVERSION_RANK (cand2->convs[i + off2]);
10379 if (rank1 < rank2)
10380 winner = 1, w = cand1, l = cand2;
10381 if (rank1 > rank2)
10382 winner = -1, w = cand2, l = cand1;
10383 if (winner)
10385 /* Don't choose a deleted function over ambiguity. */
10386 if (DECL_P (w->fn) && DECL_DELETED_FN (w->fn))
10387 return 0;
10388 if (warn)
10390 pedwarn (input_location, 0,
10391 "ISO C++ says that these are ambiguous, even "
10392 "though the worst conversion for the first is better than "
10393 "the worst conversion for the second:");
10394 print_z_candidate (input_location, _("candidate 1:"), w);
10395 print_z_candidate (input_location, _("candidate 2:"), l);
10397 else
10398 add_warning (w, l);
10399 return winner;
10403 gcc_assert (!winner);
10404 return 0;
10407 /* Given a list of candidates for overloading, find the best one, if any.
10408 This algorithm has a worst case of O(2n) (winner is last), and a best
10409 case of O(n/2) (totally ambiguous); much better than a sorting
10410 algorithm. */
10412 static struct z_candidate *
10413 tourney (struct z_candidate *candidates, tsubst_flags_t complain)
10415 struct z_candidate *champ = candidates, *challenger;
10416 int fate;
10417 int champ_compared_to_predecessor = 0;
10419 /* Walk through the list once, comparing each current champ to the next
10420 candidate, knocking out a candidate or two with each comparison. */
10422 for (challenger = champ->next; challenger; )
10424 fate = joust (champ, challenger, 0, complain);
10425 if (fate == 1)
10426 challenger = challenger->next;
10427 else
10429 if (fate == 0)
10431 champ = challenger->next;
10432 if (champ == 0)
10433 return NULL;
10434 champ_compared_to_predecessor = 0;
10436 else
10438 champ = challenger;
10439 champ_compared_to_predecessor = 1;
10442 challenger = champ->next;
10446 /* Make sure the champ is better than all the candidates it hasn't yet
10447 been compared to. */
10449 for (challenger = candidates;
10450 challenger != champ
10451 && !(champ_compared_to_predecessor && challenger->next == champ);
10452 challenger = challenger->next)
10454 fate = joust (champ, challenger, 0, complain);
10455 if (fate != 1)
10456 return NULL;
10459 return champ;
10462 /* Returns nonzero if things of type FROM can be converted to TO. */
10464 bool
10465 can_convert (tree to, tree from, tsubst_flags_t complain)
10467 tree arg = NULL_TREE;
10468 /* implicit_conversion only considers user-defined conversions
10469 if it has an expression for the call argument list. */
10470 if (CLASS_TYPE_P (from) || CLASS_TYPE_P (to))
10471 arg = build1 (CAST_EXPR, from, NULL_TREE);
10472 return can_convert_arg (to, from, arg, LOOKUP_IMPLICIT, complain);
10475 /* Returns nonzero if things of type FROM can be converted to TO with a
10476 standard conversion. */
10478 bool
10479 can_convert_standard (tree to, tree from, tsubst_flags_t complain)
10481 return can_convert_arg (to, from, NULL_TREE, LOOKUP_IMPLICIT, complain);
10484 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
10486 bool
10487 can_convert_arg (tree to, tree from, tree arg, int flags,
10488 tsubst_flags_t complain)
10490 conversion *t;
10491 void *p;
10492 bool ok_p;
10494 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10495 p = conversion_obstack_alloc (0);
10496 /* We want to discard any access checks done for this test,
10497 as we might not be in the appropriate access context and
10498 we'll do the check again when we actually perform the
10499 conversion. */
10500 push_deferring_access_checks (dk_deferred);
10502 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
10503 flags, complain);
10504 ok_p = (t && !t->bad_p);
10506 /* Discard the access checks now. */
10507 pop_deferring_access_checks ();
10508 /* Free all the conversions we allocated. */
10509 obstack_free (&conversion_obstack, p);
10511 return ok_p;
10514 /* Like can_convert_arg, but allows dubious conversions as well. */
10516 bool
10517 can_convert_arg_bad (tree to, tree from, tree arg, int flags,
10518 tsubst_flags_t complain)
10520 conversion *t;
10521 void *p;
10523 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10524 p = conversion_obstack_alloc (0);
10525 /* Try to perform the conversion. */
10526 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
10527 flags, complain);
10528 /* Free all the conversions we allocated. */
10529 obstack_free (&conversion_obstack, p);
10531 return t != NULL;
10534 /* Convert EXPR to TYPE. Return the converted expression.
10536 Note that we allow bad conversions here because by the time we get to
10537 this point we are committed to doing the conversion. If we end up
10538 doing a bad conversion, convert_like will complain. */
10540 tree
10541 perform_implicit_conversion_flags (tree type, tree expr,
10542 tsubst_flags_t complain, int flags)
10544 conversion *conv;
10545 void *p;
10546 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
10548 if (TREE_CODE (type) == REFERENCE_TYPE)
10549 expr = mark_lvalue_use (expr);
10550 else
10551 expr = mark_rvalue_use (expr);
10553 if (error_operand_p (expr))
10554 return error_mark_node;
10556 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10557 p = conversion_obstack_alloc (0);
10559 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
10560 /*c_cast_p=*/false,
10561 flags, complain);
10563 if (!conv)
10565 if (complain & tf_error)
10567 /* If expr has unknown type, then it is an overloaded function.
10568 Call instantiate_type to get good error messages. */
10569 if (TREE_TYPE (expr) == unknown_type_node)
10570 instantiate_type (type, expr, complain);
10571 else if (invalid_nonstatic_memfn_p (loc, expr, complain))
10572 /* We gave an error. */;
10573 else
10574 error_at (loc, "could not convert %qE from %qH to %qI", expr,
10575 TREE_TYPE (expr), type);
10577 expr = error_mark_node;
10579 else if (processing_template_decl && conv->kind != ck_identity)
10581 /* In a template, we are only concerned about determining the
10582 type of non-dependent expressions, so we do not have to
10583 perform the actual conversion. But for initializers, we
10584 need to be able to perform it at instantiation
10585 (or instantiate_non_dependent_expr) time. */
10586 expr = build1 (IMPLICIT_CONV_EXPR, type, expr);
10587 if (!(flags & LOOKUP_ONLYCONVERTING))
10588 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true;
10590 else
10591 expr = convert_like (conv, expr, complain);
10593 /* Free all the conversions we allocated. */
10594 obstack_free (&conversion_obstack, p);
10596 return expr;
10599 tree
10600 perform_implicit_conversion (tree type, tree expr, tsubst_flags_t complain)
10602 return perform_implicit_conversion_flags (type, expr, complain,
10603 LOOKUP_IMPLICIT);
10606 /* Convert EXPR to TYPE (as a direct-initialization) if that is
10607 permitted. If the conversion is valid, the converted expression is
10608 returned. Otherwise, NULL_TREE is returned, except in the case
10609 that TYPE is a class type; in that case, an error is issued. If
10610 C_CAST_P is true, then this direct-initialization is taking
10611 place as part of a static_cast being attempted as part of a C-style
10612 cast. */
10614 tree
10615 perform_direct_initialization_if_possible (tree type,
10616 tree expr,
10617 bool c_cast_p,
10618 tsubst_flags_t complain)
10620 conversion *conv;
10621 void *p;
10623 if (type == error_mark_node || error_operand_p (expr))
10624 return error_mark_node;
10625 /* [dcl.init]
10627 If the destination type is a (possibly cv-qualified) class type:
10629 -- If the initialization is direct-initialization ...,
10630 constructors are considered. ... If no constructor applies, or
10631 the overload resolution is ambiguous, the initialization is
10632 ill-formed. */
10633 if (CLASS_TYPE_P (type))
10635 vec<tree, va_gc> *args = make_tree_vector_single (expr);
10636 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
10637 &args, type, LOOKUP_NORMAL, complain);
10638 release_tree_vector (args);
10639 return build_cplus_new (type, expr, complain);
10642 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10643 p = conversion_obstack_alloc (0);
10645 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
10646 c_cast_p,
10647 LOOKUP_NORMAL, complain);
10648 if (!conv || conv->bad_p)
10649 expr = NULL_TREE;
10650 else if (processing_template_decl && conv->kind != ck_identity)
10652 /* In a template, we are only concerned about determining the
10653 type of non-dependent expressions, so we do not have to
10654 perform the actual conversion. But for initializers, we
10655 need to be able to perform it at instantiation
10656 (or instantiate_non_dependent_expr) time. */
10657 expr = build1 (IMPLICIT_CONV_EXPR, type, expr);
10658 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true;
10660 else
10661 expr = convert_like_real (conv, expr, NULL_TREE, 0,
10662 /*issue_conversion_warnings=*/false,
10663 c_cast_p,
10664 complain);
10666 /* Free all the conversions we allocated. */
10667 obstack_free (&conversion_obstack, p);
10669 return expr;
10672 /* When initializing a reference that lasts longer than a full-expression,
10673 this special rule applies:
10675 [class.temporary]
10677 The temporary to which the reference is bound or the temporary
10678 that is the complete object to which the reference is bound
10679 persists for the lifetime of the reference.
10681 The temporaries created during the evaluation of the expression
10682 initializing the reference, except the temporary to which the
10683 reference is bound, are destroyed at the end of the
10684 full-expression in which they are created.
10686 In that case, we store the converted expression into a new
10687 VAR_DECL in a new scope.
10689 However, we want to be careful not to create temporaries when
10690 they are not required. For example, given:
10692 struct B {};
10693 struct D : public B {};
10694 D f();
10695 const B& b = f();
10697 there is no need to copy the return value from "f"; we can just
10698 extend its lifetime. Similarly, given:
10700 struct S {};
10701 struct T { operator S(); };
10702 T t;
10703 const S& s = t;
10705 we can extend the lifetime of the return value of the conversion
10706 operator.
10708 The next several functions are involved in this lifetime extension. */
10710 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
10711 reference is being bound to a temporary. Create and return a new
10712 VAR_DECL with the indicated TYPE; this variable will store the value to
10713 which the reference is bound. */
10715 tree
10716 make_temporary_var_for_ref_to_temp (tree decl, tree type)
10718 tree var = create_temporary_var (type);
10720 /* Register the variable. */
10721 if (VAR_P (decl)
10722 && (TREE_STATIC (decl) || CP_DECL_THREAD_LOCAL_P (decl)))
10724 /* Namespace-scope or local static; give it a mangled name. */
10725 /* FIXME share comdat with decl? */
10727 TREE_STATIC (var) = TREE_STATIC (decl);
10728 CP_DECL_THREAD_LOCAL_P (var) = CP_DECL_THREAD_LOCAL_P (decl);
10729 set_decl_tls_model (var, DECL_TLS_MODEL (decl));
10731 tree name = mangle_ref_init_variable (decl);
10732 DECL_NAME (var) = name;
10733 SET_DECL_ASSEMBLER_NAME (var, name);
10735 var = pushdecl (var);
10737 else
10738 /* Create a new cleanup level if necessary. */
10739 maybe_push_cleanup_level (type);
10741 return var;
10744 /* EXPR is the initializer for a variable DECL of reference or
10745 std::initializer_list type. Create, push and return a new VAR_DECL
10746 for the initializer so that it will live as long as DECL. Any
10747 cleanup for the new variable is returned through CLEANUP, and the
10748 code to initialize the new variable is returned through INITP. */
10750 static tree
10751 set_up_extended_ref_temp (tree decl, tree expr, vec<tree, va_gc> **cleanups,
10752 tree *initp)
10754 tree init;
10755 tree type;
10756 tree var;
10758 /* Create the temporary variable. */
10759 type = TREE_TYPE (expr);
10760 var = make_temporary_var_for_ref_to_temp (decl, type);
10761 layout_decl (var, 0);
10762 /* If the rvalue is the result of a function call it will be
10763 a TARGET_EXPR. If it is some other construct (such as a
10764 member access expression where the underlying object is
10765 itself the result of a function call), turn it into a
10766 TARGET_EXPR here. It is important that EXPR be a
10767 TARGET_EXPR below since otherwise the INIT_EXPR will
10768 attempt to make a bitwise copy of EXPR to initialize
10769 VAR. */
10770 if (TREE_CODE (expr) != TARGET_EXPR)
10771 expr = get_target_expr (expr);
10773 if (TREE_CODE (decl) == FIELD_DECL
10774 && extra_warnings && !TREE_NO_WARNING (decl))
10776 warning (OPT_Wextra, "a temporary bound to %qD only persists "
10777 "until the constructor exits", decl);
10778 TREE_NO_WARNING (decl) = true;
10781 /* Recursively extend temps in this initializer. */
10782 TARGET_EXPR_INITIAL (expr)
10783 = extend_ref_init_temps (decl, TARGET_EXPR_INITIAL (expr), cleanups);
10785 /* Any reference temp has a non-trivial initializer. */
10786 DECL_NONTRIVIALLY_INITIALIZED_P (var) = true;
10788 /* If the initializer is constant, put it in DECL_INITIAL so we get
10789 static initialization and use in constant expressions. */
10790 init = maybe_constant_init (expr);
10791 if (TREE_CONSTANT (init))
10793 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
10795 /* 5.19 says that a constant expression can include an
10796 lvalue-rvalue conversion applied to "a glvalue of literal type
10797 that refers to a non-volatile temporary object initialized
10798 with a constant expression". Rather than try to communicate
10799 that this VAR_DECL is a temporary, just mark it constexpr.
10801 Currently this is only useful for initializer_list temporaries,
10802 since reference vars can't appear in constant expressions. */
10803 DECL_DECLARED_CONSTEXPR_P (var) = true;
10804 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var) = true;
10805 TREE_CONSTANT (var) = true;
10807 DECL_INITIAL (var) = init;
10808 init = NULL_TREE;
10810 else
10811 /* Create the INIT_EXPR that will initialize the temporary
10812 variable. */
10813 init = split_nonconstant_init (var, expr);
10814 if (at_function_scope_p ())
10816 add_decl_expr (var);
10818 if (TREE_STATIC (var))
10819 init = add_stmt_to_compound (init, register_dtor_fn (var));
10820 else
10822 tree cleanup = cxx_maybe_build_cleanup (var, tf_warning_or_error);
10823 if (cleanup)
10824 vec_safe_push (*cleanups, cleanup);
10827 /* We must be careful to destroy the temporary only
10828 after its initialization has taken place. If the
10829 initialization throws an exception, then the
10830 destructor should not be run. We cannot simply
10831 transform INIT into something like:
10833 (INIT, ({ CLEANUP_STMT; }))
10835 because emit_local_var always treats the
10836 initializer as a full-expression. Thus, the
10837 destructor would run too early; it would run at the
10838 end of initializing the reference variable, rather
10839 than at the end of the block enclosing the
10840 reference variable.
10842 The solution is to pass back a cleanup expression
10843 which the caller is responsible for attaching to
10844 the statement tree. */
10846 else
10848 rest_of_decl_compilation (var, /*toplev=*/1, at_eof);
10849 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
10851 if (CP_DECL_THREAD_LOCAL_P (var))
10852 tls_aggregates = tree_cons (NULL_TREE, var,
10853 tls_aggregates);
10854 else
10855 static_aggregates = tree_cons (NULL_TREE, var,
10856 static_aggregates);
10858 else
10859 /* Check whether the dtor is callable. */
10860 cxx_maybe_build_cleanup (var, tf_warning_or_error);
10862 /* Avoid -Wunused-variable warning (c++/38958). */
10863 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
10864 && VAR_P (decl))
10865 TREE_USED (decl) = DECL_READ_P (decl) = true;
10867 *initp = init;
10868 return var;
10871 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
10872 initializing a variable of that TYPE. */
10874 tree
10875 initialize_reference (tree type, tree expr,
10876 int flags, tsubst_flags_t complain)
10878 conversion *conv;
10879 void *p;
10880 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
10882 if (type == error_mark_node || error_operand_p (expr))
10883 return error_mark_node;
10885 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10886 p = conversion_obstack_alloc (0);
10888 conv = reference_binding (type, TREE_TYPE (expr), expr, /*c_cast_p=*/false,
10889 flags, complain);
10890 if (!conv || conv->bad_p)
10892 if (complain & tf_error)
10894 if (conv)
10895 convert_like (conv, expr, complain);
10896 else if (!CP_TYPE_CONST_P (TREE_TYPE (type))
10897 && !TYPE_REF_IS_RVALUE (type)
10898 && !lvalue_p (expr))
10899 error_at (loc, "invalid initialization of non-const reference of "
10900 "type %qH from an rvalue of type %qI",
10901 type, TREE_TYPE (expr));
10902 else
10903 error_at (loc, "invalid initialization of reference of type "
10904 "%qH from expression of type %qI", type,
10905 TREE_TYPE (expr));
10907 return error_mark_node;
10910 if (conv->kind == ck_ref_bind)
10911 /* Perform the conversion. */
10912 expr = convert_like (conv, expr, complain);
10913 else if (conv->kind == ck_ambig)
10914 /* We gave an error in build_user_type_conversion_1. */
10915 expr = error_mark_node;
10916 else
10917 gcc_unreachable ();
10919 /* Free all the conversions we allocated. */
10920 obstack_free (&conversion_obstack, p);
10922 return expr;
10925 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
10926 which is bound either to a reference or a std::initializer_list. */
10928 static tree
10929 extend_ref_init_temps_1 (tree decl, tree init, vec<tree, va_gc> **cleanups)
10931 tree sub = init;
10932 tree *p;
10933 STRIP_NOPS (sub);
10934 if (TREE_CODE (sub) == COMPOUND_EXPR)
10936 TREE_OPERAND (sub, 1)
10937 = extend_ref_init_temps_1 (decl, TREE_OPERAND (sub, 1), cleanups);
10938 return init;
10940 if (TREE_CODE (sub) != ADDR_EXPR)
10941 return init;
10942 /* Deal with binding to a subobject. */
10943 for (p = &TREE_OPERAND (sub, 0); TREE_CODE (*p) == COMPONENT_REF; )
10944 p = &TREE_OPERAND (*p, 0);
10945 if (TREE_CODE (*p) == TARGET_EXPR)
10947 tree subinit = NULL_TREE;
10948 *p = set_up_extended_ref_temp (decl, *p, cleanups, &subinit);
10949 recompute_tree_invariant_for_addr_expr (sub);
10950 if (init != sub)
10951 init = fold_convert (TREE_TYPE (init), sub);
10952 if (subinit)
10953 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), subinit, init);
10955 return init;
10958 /* INIT is part of the initializer for DECL. If there are any
10959 reference or initializer lists being initialized, extend their
10960 lifetime to match that of DECL. */
10962 tree
10963 extend_ref_init_temps (tree decl, tree init, vec<tree, va_gc> **cleanups)
10965 tree type = TREE_TYPE (init);
10966 if (processing_template_decl)
10967 return init;
10968 if (TREE_CODE (type) == REFERENCE_TYPE)
10969 init = extend_ref_init_temps_1 (decl, init, cleanups);
10970 else
10972 tree ctor = init;
10973 if (TREE_CODE (ctor) == TARGET_EXPR)
10974 ctor = TARGET_EXPR_INITIAL (ctor);
10975 if (TREE_CODE (ctor) == CONSTRUCTOR)
10977 if (is_std_init_list (type))
10979 /* The temporary array underlying a std::initializer_list
10980 is handled like a reference temporary. */
10981 tree array = CONSTRUCTOR_ELT (ctor, 0)->value;
10982 array = extend_ref_init_temps_1 (decl, array, cleanups);
10983 CONSTRUCTOR_ELT (ctor, 0)->value = array;
10985 else
10987 unsigned i;
10988 constructor_elt *p;
10989 vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (ctor);
10990 FOR_EACH_VEC_SAFE_ELT (elts, i, p)
10991 p->value = extend_ref_init_temps (decl, p->value, cleanups);
10993 recompute_constructor_flags (ctor);
10994 if (decl_maybe_constant_var_p (decl) && TREE_CONSTANT (ctor))
10995 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
10999 return init;
11002 /* Returns true iff an initializer for TYPE could contain temporaries that
11003 need to be extended because they are bound to references or
11004 std::initializer_list. */
11006 bool
11007 type_has_extended_temps (tree type)
11009 type = strip_array_types (type);
11010 if (TREE_CODE (type) == REFERENCE_TYPE)
11011 return true;
11012 if (CLASS_TYPE_P (type))
11014 if (is_std_init_list (type))
11015 return true;
11016 for (tree f = next_initializable_field (TYPE_FIELDS (type));
11017 f; f = next_initializable_field (DECL_CHAIN (f)))
11018 if (type_has_extended_temps (TREE_TYPE (f)))
11019 return true;
11021 return false;
11024 /* Returns true iff TYPE is some variant of std::initializer_list. */
11026 bool
11027 is_std_init_list (tree type)
11029 if (!TYPE_P (type))
11030 return false;
11031 if (cxx_dialect == cxx98)
11032 return false;
11033 /* Look through typedefs. */
11034 type = TYPE_MAIN_VARIANT (type);
11035 return (CLASS_TYPE_P (type)
11036 && CP_TYPE_CONTEXT (type) == std_node
11037 && init_list_identifier == DECL_NAME (TYPE_NAME (type)));
11040 /* Returns true iff DECL is a list constructor: i.e. a constructor which
11041 will accept an argument list of a single std::initializer_list<T>. */
11043 bool
11044 is_list_ctor (tree decl)
11046 tree args = FUNCTION_FIRST_USER_PARMTYPE (decl);
11047 tree arg;
11049 if (!args || args == void_list_node)
11050 return false;
11052 arg = non_reference (TREE_VALUE (args));
11053 if (!is_std_init_list (arg))
11054 return false;
11056 args = TREE_CHAIN (args);
11058 if (args && args != void_list_node && !TREE_PURPOSE (args))
11059 /* There are more non-defaulted parms. */
11060 return false;
11062 return true;
11065 #include "gt-cp-call.h"