[AArch64] Avoid GET_MODE_NUNITS in v8.4 support
[official-gcc.git] / gcc / cp / call.c
blobc822a70a017668b3aedff2dfa50eba3962bfa02b
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. */
106 BOOL_BITFIELD rvaluedness_matches_p: 1;
107 BOOL_BITFIELD check_narrowing: 1;
108 /* The type of the expression resulting from the conversion. */
109 tree type;
110 union {
111 /* The next conversion in the chain. Since the conversions are
112 arranged from outermost to innermost, the NEXT conversion will
113 actually be performed before this conversion. This variant is
114 used only when KIND is neither ck_identity, ck_ambig nor
115 ck_list. Please use the next_conversion function instead
116 of using this field directly. */
117 conversion *next;
118 /* The expression at the beginning of the conversion chain. This
119 variant is used only if KIND is ck_identity or ck_ambig. */
120 tree expr;
121 /* The array of conversions for an initializer_list, so this
122 variant is used only when KIN D is ck_list. */
123 conversion **list;
124 } u;
125 /* The function candidate corresponding to this conversion
126 sequence. This field is only used if KIND is ck_user. */
127 struct z_candidate *cand;
130 #define CONVERSION_RANK(NODE) \
131 ((NODE)->bad_p ? cr_bad \
132 : (NODE)->ellipsis_p ? cr_ellipsis \
133 : (NODE)->user_conv_p ? cr_user \
134 : (NODE)->rank)
136 #define BAD_CONVERSION_RANK(NODE) \
137 ((NODE)->ellipsis_p ? cr_ellipsis \
138 : (NODE)->user_conv_p ? cr_user \
139 : (NODE)->rank)
141 static struct obstack conversion_obstack;
142 static bool conversion_obstack_initialized;
143 struct rejection_reason;
145 static struct z_candidate * tourney (struct z_candidate *, tsubst_flags_t);
146 static int equal_functions (tree, tree);
147 static int joust (struct z_candidate *, struct z_candidate *, bool,
148 tsubst_flags_t);
149 static int compare_ics (conversion *, conversion *);
150 static void maybe_warn_class_memaccess (location_t, tree,
151 const vec<tree, va_gc> *);
152 static tree build_over_call (struct z_candidate *, int, tsubst_flags_t);
153 #define convert_like(CONV, EXPR, COMPLAIN) \
154 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, \
155 /*issue_conversion_warnings=*/true, \
156 /*c_cast_p=*/false, (COMPLAIN))
157 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
158 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), \
159 /*issue_conversion_warnings=*/true, \
160 /*c_cast_p=*/false, (COMPLAIN))
161 static tree convert_like_real (conversion *, tree, tree, int, bool,
162 bool, tsubst_flags_t);
163 static void op_error (location_t, enum tree_code, enum tree_code, tree,
164 tree, tree, bool);
165 static struct z_candidate *build_user_type_conversion_1 (tree, tree, int,
166 tsubst_flags_t);
167 static void print_z_candidate (location_t, const char *, struct z_candidate *);
168 static void print_z_candidates (location_t, struct z_candidate *);
169 static tree build_this (tree);
170 static struct z_candidate *splice_viable (struct z_candidate *, bool, bool *);
171 static bool any_strictly_viable (struct z_candidate *);
172 static struct z_candidate *add_template_candidate
173 (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *,
174 tree, tree, tree, int, unification_kind_t, tsubst_flags_t);
175 static struct z_candidate *add_template_candidate_real
176 (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *,
177 tree, tree, tree, int, tree, unification_kind_t, tsubst_flags_t);
178 static void add_builtin_candidates
179 (struct z_candidate **, enum tree_code, enum tree_code,
180 tree, tree *, int, tsubst_flags_t);
181 static void add_builtin_candidate
182 (struct z_candidate **, enum tree_code, enum tree_code,
183 tree, tree, tree, tree *, tree *, int, tsubst_flags_t);
184 static bool is_complete (tree);
185 static void build_builtin_candidate
186 (struct z_candidate **, tree, tree, tree, tree *, tree *,
187 int, tsubst_flags_t);
188 static struct z_candidate *add_conv_candidate
189 (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, tree,
190 tree, tsubst_flags_t);
191 static struct z_candidate *add_function_candidate
192 (struct z_candidate **, tree, tree, tree, const vec<tree, va_gc> *, tree,
193 tree, int, tsubst_flags_t);
194 static conversion *implicit_conversion (tree, tree, tree, bool, int,
195 tsubst_flags_t);
196 static conversion *reference_binding (tree, tree, tree, bool, int,
197 tsubst_flags_t);
198 static conversion *build_conv (conversion_kind, tree, conversion *);
199 static conversion *build_list_conv (tree, tree, int, tsubst_flags_t);
200 static conversion *next_conversion (conversion *);
201 static bool is_subseq (conversion *, conversion *);
202 static conversion *maybe_handle_ref_bind (conversion **);
203 static void maybe_handle_implicit_object (conversion **);
204 static struct z_candidate *add_candidate
205 (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, size_t,
206 conversion **, tree, tree, int, struct rejection_reason *, int);
207 static tree source_type (conversion *);
208 static void add_warning (struct z_candidate *, struct z_candidate *);
209 static bool reference_compatible_p (tree, tree);
210 static conversion *direct_reference_binding (tree, conversion *);
211 static bool promoted_arithmetic_type_p (tree);
212 static conversion *conditional_conversion (tree, tree, tsubst_flags_t);
213 static char *name_as_c_string (tree, tree, bool *);
214 static tree prep_operand (tree);
215 static void add_candidates (tree, tree, const vec<tree, va_gc> *, tree, tree,
216 bool, tree, tree, int, struct z_candidate **,
217 tsubst_flags_t);
218 static conversion *merge_conversion_sequences (conversion *, conversion *);
219 static tree build_temp (tree, tree, int, diagnostic_t *, tsubst_flags_t);
221 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
222 NAME can take many forms... */
224 bool
225 check_dtor_name (tree basetype, tree name)
227 /* Just accept something we've already complained about. */
228 if (name == error_mark_node)
229 return true;
231 if (TREE_CODE (name) == TYPE_DECL)
232 name = TREE_TYPE (name);
233 else if (TYPE_P (name))
234 /* OK */;
235 else if (identifier_p (name))
237 if ((MAYBE_CLASS_TYPE_P (basetype)
238 || TREE_CODE (basetype) == ENUMERAL_TYPE)
239 && name == constructor_name (basetype))
240 return true;
241 else
242 name = get_type_value (name);
244 else
246 /* In the case of:
248 template <class T> struct S { ~S(); };
249 int i;
250 i.~S();
252 NAME will be a class template. */
253 gcc_assert (DECL_CLASS_TEMPLATE_P (name));
254 return false;
257 if (!name || name == error_mark_node)
258 return false;
259 return same_type_p (TYPE_MAIN_VARIANT (basetype), TYPE_MAIN_VARIANT (name));
262 /* We want the address of a function or method. We avoid creating a
263 pointer-to-member function. */
265 tree
266 build_addr_func (tree function, tsubst_flags_t complain)
268 tree type = TREE_TYPE (function);
270 /* We have to do these by hand to avoid real pointer to member
271 functions. */
272 if (TREE_CODE (type) == METHOD_TYPE)
274 if (TREE_CODE (function) == OFFSET_REF)
276 tree object = build_address (TREE_OPERAND (function, 0));
277 return get_member_function_from_ptrfunc (&object,
278 TREE_OPERAND (function, 1),
279 complain);
281 function = build_address (function);
283 else
284 function = decay_conversion (function, complain, /*reject_builtin=*/false);
286 return function;
289 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
290 POINTER_TYPE to those. Note, pointer to member function types
291 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
292 two variants. build_call_a is the primitive taking an array of
293 arguments, while build_call_n is a wrapper that handles varargs. */
295 tree
296 build_call_n (tree function, int n, ...)
298 if (n == 0)
299 return build_call_a (function, 0, NULL);
300 else
302 tree *argarray = XALLOCAVEC (tree, n);
303 va_list ap;
304 int i;
306 va_start (ap, n);
307 for (i = 0; i < n; i++)
308 argarray[i] = va_arg (ap, tree);
309 va_end (ap);
310 return build_call_a (function, n, argarray);
314 /* Update various flags in cfun and the call itself based on what is being
315 called. Split out of build_call_a so that bot_manip can use it too. */
317 void
318 set_flags_from_callee (tree call)
320 bool nothrow;
321 tree decl = get_callee_fndecl (call);
323 /* We check both the decl and the type; a function may be known not to
324 throw without being declared throw(). */
325 nothrow = decl && TREE_NOTHROW (decl);
326 if (CALL_EXPR_FN (call))
327 nothrow |= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call))));
328 else if (internal_fn_flags (CALL_EXPR_IFN (call)) & ECF_NOTHROW)
329 nothrow = true;
331 if (!nothrow && at_function_scope_p () && cfun && cp_function_chain)
332 cp_function_chain->can_throw = 1;
334 if (decl && TREE_THIS_VOLATILE (decl) && cfun && cp_function_chain)
335 current_function_returns_abnormally = 1;
337 TREE_NOTHROW (call) = nothrow;
340 tree
341 build_call_a (tree function, int n, tree *argarray)
343 tree decl;
344 tree result_type;
345 tree fntype;
346 int i;
348 function = build_addr_func (function, tf_warning_or_error);
350 gcc_assert (TYPE_PTR_P (TREE_TYPE (function)));
351 fntype = TREE_TYPE (TREE_TYPE (function));
352 gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE
353 || TREE_CODE (fntype) == METHOD_TYPE);
354 result_type = TREE_TYPE (fntype);
355 /* An rvalue has no cv-qualifiers. */
356 if (SCALAR_TYPE_P (result_type) || VOID_TYPE_P (result_type))
357 result_type = cv_unqualified (result_type);
359 function = build_call_array_loc (input_location,
360 result_type, function, n, argarray);
361 set_flags_from_callee (function);
363 decl = get_callee_fndecl (function);
365 if (decl && !TREE_USED (decl))
367 /* We invoke build_call directly for several library
368 functions. These may have been declared normally if
369 we're building libgcc, so we can't just check
370 DECL_ARTIFICIAL. */
371 gcc_assert (DECL_ARTIFICIAL (decl)
372 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl)),
373 "__", 2));
374 mark_used (decl);
377 require_complete_eh_spec_types (fntype, decl);
379 TREE_HAS_CONSTRUCTOR (function) = (decl && DECL_CONSTRUCTOR_P (decl));
381 /* Don't pass empty class objects by value. This is useful
382 for tags in STL, which are used to control overload resolution.
383 We don't need to handle other cases of copying empty classes. */
384 if (! decl || ! DECL_BUILT_IN (decl))
385 for (i = 0; i < n; i++)
387 tree arg = CALL_EXPR_ARG (function, i);
388 if (is_empty_class (TREE_TYPE (arg))
389 && ! TREE_ADDRESSABLE (TREE_TYPE (arg)))
391 tree t = build0 (EMPTY_CLASS_EXPR, TREE_TYPE (arg));
392 arg = build2 (COMPOUND_EXPR, TREE_TYPE (t), arg, t);
393 CALL_EXPR_ARG (function, i) = arg;
397 return function;
400 /* New overloading code. */
402 struct z_candidate;
404 struct candidate_warning {
405 z_candidate *loser;
406 candidate_warning *next;
409 /* Information for providing diagnostics about why overloading failed. */
411 enum rejection_reason_code {
412 rr_none,
413 rr_arity,
414 rr_explicit_conversion,
415 rr_template_conversion,
416 rr_arg_conversion,
417 rr_bad_arg_conversion,
418 rr_template_unification,
419 rr_invalid_copy,
420 rr_inherited_ctor,
421 rr_constraint_failure
424 struct conversion_info {
425 /* The index of the argument, 0-based. */
426 int n_arg;
427 /* The actual argument or its type. */
428 tree from;
429 /* The type of the parameter. */
430 tree to_type;
433 struct rejection_reason {
434 enum rejection_reason_code code;
435 union {
436 /* Information about an arity mismatch. */
437 struct {
438 /* The expected number of arguments. */
439 int expected;
440 /* The actual number of arguments in the call. */
441 int actual;
442 /* Whether the call was a varargs call. */
443 bool call_varargs_p;
444 } arity;
445 /* Information about an argument conversion mismatch. */
446 struct conversion_info conversion;
447 /* Same, but for bad argument conversions. */
448 struct conversion_info bad_conversion;
449 /* Information about template unification failures. These are the
450 parameters passed to fn_type_unification. */
451 struct {
452 tree tmpl;
453 tree explicit_targs;
454 int num_targs;
455 const tree *args;
456 unsigned int nargs;
457 tree return_type;
458 unification_kind_t strict;
459 int flags;
460 } template_unification;
461 /* Information about template instantiation failures. These are the
462 parameters passed to instantiate_template. */
463 struct {
464 tree tmpl;
465 tree targs;
466 } template_instantiation;
467 } u;
470 struct z_candidate {
471 /* The FUNCTION_DECL that will be called if this candidate is
472 selected by overload resolution. */
473 tree fn;
474 /* If not NULL_TREE, the first argument to use when calling this
475 function. */
476 tree first_arg;
477 /* The rest of the arguments to use when calling this function. If
478 there are no further arguments this may be NULL or it may be an
479 empty vector. */
480 const vec<tree, va_gc> *args;
481 /* The implicit conversion sequences for each of the arguments to
482 FN. */
483 conversion **convs;
484 /* The number of implicit conversion sequences. */
485 size_t num_convs;
486 /* If FN is a user-defined conversion, the standard conversion
487 sequence from the type returned by FN to the desired destination
488 type. */
489 conversion *second_conv;
490 struct rejection_reason *reason;
491 /* If FN is a member function, the binfo indicating the path used to
492 qualify the name of FN at the call site. This path is used to
493 determine whether or not FN is accessible if it is selected by
494 overload resolution. The DECL_CONTEXT of FN will always be a
495 (possibly improper) base of this binfo. */
496 tree access_path;
497 /* If FN is a non-static member function, the binfo indicating the
498 subobject to which the `this' pointer should be converted if FN
499 is selected by overload resolution. The type pointed to by
500 the `this' pointer must correspond to the most derived class
501 indicated by the CONVERSION_PATH. */
502 tree conversion_path;
503 tree template_decl;
504 tree explicit_targs;
505 candidate_warning *warnings;
506 z_candidate *next;
507 int viable;
509 /* The flags active in add_candidate. */
510 int flags;
513 /* Returns true iff T is a null pointer constant in the sense of
514 [conv.ptr]. */
516 bool
517 null_ptr_cst_p (tree t)
519 tree type = TREE_TYPE (t);
521 /* [conv.ptr]
523 A null pointer constant is an integral constant expression
524 (_expr.const_) rvalue of integer type that evaluates to zero or
525 an rvalue of type std::nullptr_t. */
526 if (NULLPTR_TYPE_P (type))
527 return true;
529 if (cxx_dialect >= cxx11)
531 STRIP_ANY_LOCATION_WRAPPER (t);
533 /* Core issue 903 says only literal 0 is a null pointer constant. */
534 if (TREE_CODE (type) == INTEGER_TYPE
535 && !char_type_p (type)
536 && TREE_CODE (t) == INTEGER_CST
537 && integer_zerop (t)
538 && !TREE_OVERFLOW (t))
539 return true;
541 else if (CP_INTEGRAL_TYPE_P (type))
543 t = fold_non_dependent_expr (t);
544 STRIP_NOPS (t);
545 if (integer_zerop (t) && !TREE_OVERFLOW (t))
546 return true;
549 return false;
552 /* Returns true iff T is a null member pointer value (4.11). */
554 bool
555 null_member_pointer_value_p (tree t)
557 tree type = TREE_TYPE (t);
558 if (!type)
559 return false;
560 else if (TYPE_PTRMEMFUNC_P (type))
561 return (TREE_CODE (t) == CONSTRUCTOR
562 && integer_zerop (CONSTRUCTOR_ELT (t, 0)->value));
563 else if (TYPE_PTRDATAMEM_P (type))
564 return integer_all_onesp (t);
565 else
566 return false;
569 /* Returns nonzero if PARMLIST consists of only default parms,
570 ellipsis, and/or undeduced parameter packs. */
572 bool
573 sufficient_parms_p (const_tree parmlist)
575 for (; parmlist && parmlist != void_list_node;
576 parmlist = TREE_CHAIN (parmlist))
577 if (!TREE_PURPOSE (parmlist)
578 && !PACK_EXPANSION_P (TREE_VALUE (parmlist)))
579 return false;
580 return true;
583 /* Allocate N bytes of memory from the conversion obstack. The memory
584 is zeroed before being returned. */
586 static void *
587 conversion_obstack_alloc (size_t n)
589 void *p;
590 if (!conversion_obstack_initialized)
592 gcc_obstack_init (&conversion_obstack);
593 conversion_obstack_initialized = true;
595 p = obstack_alloc (&conversion_obstack, n);
596 memset (p, 0, n);
597 return p;
600 /* Allocate rejection reasons. */
602 static struct rejection_reason *
603 alloc_rejection (enum rejection_reason_code code)
605 struct rejection_reason *p;
606 p = (struct rejection_reason *) conversion_obstack_alloc (sizeof *p);
607 p->code = code;
608 return p;
611 static struct rejection_reason *
612 arity_rejection (tree first_arg, int expected, int actual)
614 struct rejection_reason *r = alloc_rejection (rr_arity);
615 int adjust = first_arg != NULL_TREE;
616 r->u.arity.expected = expected - adjust;
617 r->u.arity.actual = actual - adjust;
618 return r;
621 static struct rejection_reason *
622 arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to)
624 struct rejection_reason *r = alloc_rejection (rr_arg_conversion);
625 int adjust = first_arg != NULL_TREE;
626 r->u.conversion.n_arg = n_arg - adjust;
627 r->u.conversion.from = from;
628 r->u.conversion.to_type = to;
629 return r;
632 static struct rejection_reason *
633 bad_arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to)
635 struct rejection_reason *r = alloc_rejection (rr_bad_arg_conversion);
636 int adjust = first_arg != NULL_TREE;
637 r->u.bad_conversion.n_arg = n_arg - adjust;
638 r->u.bad_conversion.from = from;
639 r->u.bad_conversion.to_type = to;
640 return r;
643 static struct rejection_reason *
644 explicit_conversion_rejection (tree from, tree to)
646 struct rejection_reason *r = alloc_rejection (rr_explicit_conversion);
647 r->u.conversion.n_arg = 0;
648 r->u.conversion.from = from;
649 r->u.conversion.to_type = to;
650 return r;
653 static struct rejection_reason *
654 template_conversion_rejection (tree from, tree to)
656 struct rejection_reason *r = alloc_rejection (rr_template_conversion);
657 r->u.conversion.n_arg = 0;
658 r->u.conversion.from = from;
659 r->u.conversion.to_type = to;
660 return r;
663 static struct rejection_reason *
664 template_unification_rejection (tree tmpl, tree explicit_targs, tree targs,
665 const tree *args, unsigned int nargs,
666 tree return_type, unification_kind_t strict,
667 int flags)
669 size_t args_n_bytes = sizeof (*args) * nargs;
670 tree *args1 = (tree *) conversion_obstack_alloc (args_n_bytes);
671 struct rejection_reason *r = alloc_rejection (rr_template_unification);
672 r->u.template_unification.tmpl = tmpl;
673 r->u.template_unification.explicit_targs = explicit_targs;
674 r->u.template_unification.num_targs = TREE_VEC_LENGTH (targs);
675 /* Copy args to our own storage. */
676 memcpy (args1, args, args_n_bytes);
677 r->u.template_unification.args = args1;
678 r->u.template_unification.nargs = nargs;
679 r->u.template_unification.return_type = return_type;
680 r->u.template_unification.strict = strict;
681 r->u.template_unification.flags = flags;
682 return r;
685 static struct rejection_reason *
686 template_unification_error_rejection (void)
688 return alloc_rejection (rr_template_unification);
691 static struct rejection_reason *
692 invalid_copy_with_fn_template_rejection (void)
694 struct rejection_reason *r = alloc_rejection (rr_invalid_copy);
695 return r;
698 static struct rejection_reason *
699 inherited_ctor_rejection (void)
701 struct rejection_reason *r = alloc_rejection (rr_inherited_ctor);
702 return r;
705 // Build a constraint failure record, saving information into the
706 // template_instantiation field of the rejection. If FN is not a template
707 // declaration, the TMPL member is the FN declaration and TARGS is empty.
709 static struct rejection_reason *
710 constraint_failure (tree fn)
712 struct rejection_reason *r = alloc_rejection (rr_constraint_failure);
713 if (tree ti = DECL_TEMPLATE_INFO (fn))
715 r->u.template_instantiation.tmpl = TI_TEMPLATE (ti);
716 r->u.template_instantiation.targs = TI_ARGS (ti);
718 else
720 r->u.template_instantiation.tmpl = fn;
721 r->u.template_instantiation.targs = NULL_TREE;
723 return r;
726 /* Dynamically allocate a conversion. */
728 static conversion *
729 alloc_conversion (conversion_kind kind)
731 conversion *c;
732 c = (conversion *) conversion_obstack_alloc (sizeof (conversion));
733 c->kind = kind;
734 return c;
737 /* Make sure that all memory on the conversion obstack has been
738 freed. */
740 void
741 validate_conversion_obstack (void)
743 if (conversion_obstack_initialized)
744 gcc_assert ((obstack_next_free (&conversion_obstack)
745 == obstack_base (&conversion_obstack)));
748 /* Dynamically allocate an array of N conversions. */
750 static conversion **
751 alloc_conversions (size_t n)
753 return (conversion **) conversion_obstack_alloc (n * sizeof (conversion *));
756 static conversion *
757 build_conv (conversion_kind code, tree type, conversion *from)
759 conversion *t;
760 conversion_rank rank = CONVERSION_RANK (from);
762 /* Note that the caller is responsible for filling in t->cand for
763 user-defined conversions. */
764 t = alloc_conversion (code);
765 t->type = type;
766 t->u.next = from;
768 switch (code)
770 case ck_ptr:
771 case ck_pmem:
772 case ck_base:
773 case ck_std:
774 if (rank < cr_std)
775 rank = cr_std;
776 break;
778 case ck_qual:
779 case ck_fnptr:
780 if (rank < cr_exact)
781 rank = cr_exact;
782 break;
784 default:
785 break;
787 t->rank = rank;
788 t->user_conv_p = (code == ck_user || from->user_conv_p);
789 t->bad_p = from->bad_p;
790 t->base_p = false;
791 return t;
794 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
795 specialization of std::initializer_list<T>, if such a conversion is
796 possible. */
798 static conversion *
799 build_list_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
801 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type), 0);
802 unsigned len = CONSTRUCTOR_NELTS (ctor);
803 conversion **subconvs = alloc_conversions (len);
804 conversion *t;
805 unsigned i;
806 tree val;
808 /* Within a list-initialization we can have more user-defined
809 conversions. */
810 flags &= ~LOOKUP_NO_CONVERSION;
811 /* But no narrowing conversions. */
812 flags |= LOOKUP_NO_NARROWING;
814 /* Can't make an array of these types. */
815 if (TREE_CODE (elttype) == REFERENCE_TYPE
816 || TREE_CODE (elttype) == FUNCTION_TYPE
817 || VOID_TYPE_P (elttype))
818 return NULL;
820 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
822 conversion *sub
823 = implicit_conversion (elttype, TREE_TYPE (val), val,
824 false, flags, complain);
825 if (sub == NULL)
826 return NULL;
828 subconvs[i] = sub;
831 t = alloc_conversion (ck_list);
832 t->type = type;
833 t->u.list = subconvs;
834 t->rank = cr_exact;
836 for (i = 0; i < len; ++i)
838 conversion *sub = subconvs[i];
839 if (sub->rank > t->rank)
840 t->rank = sub->rank;
841 if (sub->user_conv_p)
842 t->user_conv_p = true;
843 if (sub->bad_p)
844 t->bad_p = true;
847 return t;
850 /* Return the next conversion of the conversion chain (if applicable),
851 or NULL otherwise. Please use this function instead of directly
852 accessing fields of struct conversion. */
854 static conversion *
855 next_conversion (conversion *conv)
857 if (conv == NULL
858 || conv->kind == ck_identity
859 || conv->kind == ck_ambig
860 || conv->kind == ck_list)
861 return NULL;
862 return conv->u.next;
865 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
866 is a valid aggregate initializer for array type ATYPE. */
868 static bool
869 can_convert_array (tree atype, tree ctor, int flags, tsubst_flags_t complain)
871 unsigned i;
872 tree elttype = TREE_TYPE (atype);
873 for (i = 0; i < CONSTRUCTOR_NELTS (ctor); ++i)
875 tree val = CONSTRUCTOR_ELT (ctor, i)->value;
876 bool ok;
877 if (TREE_CODE (elttype) == ARRAY_TYPE
878 && TREE_CODE (val) == CONSTRUCTOR)
879 ok = can_convert_array (elttype, val, flags, complain);
880 else
881 ok = can_convert_arg (elttype, TREE_TYPE (val), val, flags,
882 complain);
883 if (!ok)
884 return false;
886 return true;
889 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
890 aggregate class, if such a conversion is possible. */
892 static conversion *
893 build_aggr_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
895 unsigned HOST_WIDE_INT i = 0;
896 conversion *c;
897 tree field = next_initializable_field (TYPE_FIELDS (type));
898 tree empty_ctor = NULL_TREE;
900 /* We already called reshape_init in implicit_conversion. */
902 /* The conversions within the init-list aren't affected by the enclosing
903 context; they're always simple copy-initialization. */
904 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
906 for (; field; field = next_initializable_field (DECL_CHAIN (field)))
908 tree ftype = TREE_TYPE (field);
909 tree val;
910 bool ok;
912 if (i < CONSTRUCTOR_NELTS (ctor))
913 val = CONSTRUCTOR_ELT (ctor, i)->value;
914 else if (DECL_INITIAL (field))
915 val = get_nsdmi (field, /*ctor*/false, complain);
916 else if (TREE_CODE (ftype) == REFERENCE_TYPE)
917 /* Value-initialization of reference is ill-formed. */
918 return NULL;
919 else
921 if (empty_ctor == NULL_TREE)
922 empty_ctor = build_constructor (init_list_type_node, NULL);
923 val = empty_ctor;
925 ++i;
927 if (TREE_CODE (ftype) == ARRAY_TYPE
928 && TREE_CODE (val) == CONSTRUCTOR)
929 ok = can_convert_array (ftype, val, flags, complain);
930 else
931 ok = can_convert_arg (ftype, TREE_TYPE (val), val, flags,
932 complain);
934 if (!ok)
935 return NULL;
937 if (TREE_CODE (type) == UNION_TYPE)
938 break;
941 if (i < CONSTRUCTOR_NELTS (ctor))
942 return NULL;
944 c = alloc_conversion (ck_aggr);
945 c->type = type;
946 c->rank = cr_exact;
947 c->user_conv_p = true;
948 c->check_narrowing = true;
949 c->u.next = NULL;
950 return c;
953 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
954 array type, if such a conversion is possible. */
956 static conversion *
957 build_array_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
959 conversion *c;
960 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
961 tree elttype = TREE_TYPE (type);
962 unsigned i;
963 tree val;
964 bool bad = false;
965 bool user = false;
966 enum conversion_rank rank = cr_exact;
968 /* We might need to propagate the size from the element to the array. */
969 complete_type (type);
971 if (TYPE_DOMAIN (type)
972 && !variably_modified_type_p (TYPE_DOMAIN (type), NULL_TREE))
974 unsigned HOST_WIDE_INT alen = tree_to_uhwi (array_type_nelts_top (type));
975 if (alen < len)
976 return NULL;
979 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
981 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
983 conversion *sub
984 = implicit_conversion (elttype, TREE_TYPE (val), val,
985 false, flags, complain);
986 if (sub == NULL)
987 return NULL;
989 if (sub->rank > rank)
990 rank = sub->rank;
991 if (sub->user_conv_p)
992 user = true;
993 if (sub->bad_p)
994 bad = true;
997 c = alloc_conversion (ck_aggr);
998 c->type = type;
999 c->rank = rank;
1000 c->user_conv_p = user;
1001 c->bad_p = bad;
1002 c->u.next = NULL;
1003 return c;
1006 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1007 complex type, if such a conversion is possible. */
1009 static conversion *
1010 build_complex_conv (tree type, tree ctor, int flags,
1011 tsubst_flags_t complain)
1013 conversion *c;
1014 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
1015 tree elttype = TREE_TYPE (type);
1016 unsigned i;
1017 tree val;
1018 bool bad = false;
1019 bool user = false;
1020 enum conversion_rank rank = cr_exact;
1022 if (len != 2)
1023 return NULL;
1025 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
1027 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
1029 conversion *sub
1030 = implicit_conversion (elttype, TREE_TYPE (val), val,
1031 false, flags, complain);
1032 if (sub == NULL)
1033 return NULL;
1035 if (sub->rank > rank)
1036 rank = sub->rank;
1037 if (sub->user_conv_p)
1038 user = true;
1039 if (sub->bad_p)
1040 bad = true;
1043 c = alloc_conversion (ck_aggr);
1044 c->type = type;
1045 c->rank = rank;
1046 c->user_conv_p = user;
1047 c->bad_p = bad;
1048 c->u.next = NULL;
1049 return c;
1052 /* Build a representation of the identity conversion from EXPR to
1053 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1055 static conversion *
1056 build_identity_conv (tree type, tree expr)
1058 conversion *c;
1060 c = alloc_conversion (ck_identity);
1061 c->type = type;
1062 c->u.expr = expr;
1064 return c;
1067 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1068 were multiple user-defined conversions to accomplish the job.
1069 Build a conversion that indicates that ambiguity. */
1071 static conversion *
1072 build_ambiguous_conv (tree type, tree expr)
1074 conversion *c;
1076 c = alloc_conversion (ck_ambig);
1077 c->type = type;
1078 c->u.expr = expr;
1080 return c;
1083 tree
1084 strip_top_quals (tree t)
1086 if (TREE_CODE (t) == ARRAY_TYPE)
1087 return t;
1088 return cp_build_qualified_type (t, 0);
1091 /* Returns the standard conversion path (see [conv]) from type FROM to type
1092 TO, if any. For proper handling of null pointer constants, you must
1093 also pass the expression EXPR to convert from. If C_CAST_P is true,
1094 this conversion is coming from a C-style cast. */
1096 static conversion *
1097 standard_conversion (tree to, tree from, tree expr, bool c_cast_p,
1098 int flags, tsubst_flags_t complain)
1100 enum tree_code fcode, tcode;
1101 conversion *conv;
1102 bool fromref = false;
1103 tree qualified_to;
1105 to = non_reference (to);
1106 if (TREE_CODE (from) == REFERENCE_TYPE)
1108 fromref = true;
1109 from = TREE_TYPE (from);
1111 qualified_to = to;
1112 to = strip_top_quals (to);
1113 from = strip_top_quals (from);
1115 if (expr && type_unknown_p (expr))
1117 if (TYPE_PTRFN_P (to) || TYPE_PTRMEMFUNC_P (to))
1119 tsubst_flags_t tflags = tf_conv;
1120 expr = instantiate_type (to, expr, tflags);
1121 if (expr == error_mark_node)
1122 return NULL;
1123 from = TREE_TYPE (expr);
1125 else if (TREE_CODE (to) == BOOLEAN_TYPE)
1127 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1128 expr = resolve_nondeduced_context (expr, complain);
1129 from = TREE_TYPE (expr);
1133 fcode = TREE_CODE (from);
1134 tcode = TREE_CODE (to);
1136 conv = build_identity_conv (from, expr);
1137 if (fcode == FUNCTION_TYPE || fcode == ARRAY_TYPE)
1139 from = type_decays_to (from);
1140 fcode = TREE_CODE (from);
1141 conv = build_conv (ck_lvalue, from, conv);
1143 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1144 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1145 express the copy constructor call required by copy-initialization. */
1146 else if (fromref || (expr && obvalue_p (expr)))
1148 if (expr)
1150 tree bitfield_type;
1151 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
1152 if (bitfield_type)
1154 from = strip_top_quals (bitfield_type);
1155 fcode = TREE_CODE (from);
1158 conv = build_conv (ck_rvalue, from, conv);
1159 if (flags & LOOKUP_PREFER_RVALUE)
1160 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1161 conv->rvaluedness_matches_p = true;
1164 /* Allow conversion between `__complex__' data types. */
1165 if (tcode == COMPLEX_TYPE && fcode == COMPLEX_TYPE)
1167 /* The standard conversion sequence to convert FROM to TO is
1168 the standard conversion sequence to perform componentwise
1169 conversion. */
1170 conversion *part_conv = standard_conversion
1171 (TREE_TYPE (to), TREE_TYPE (from), NULL_TREE, c_cast_p, flags,
1172 complain);
1174 if (part_conv)
1176 conv = build_conv (part_conv->kind, to, conv);
1177 conv->rank = part_conv->rank;
1179 else
1180 conv = NULL;
1182 return conv;
1185 if (same_type_p (from, to))
1187 if (CLASS_TYPE_P (to) && conv->kind == ck_rvalue)
1188 conv->type = qualified_to;
1189 return conv;
1192 /* [conv.ptr]
1193 A null pointer constant can be converted to a pointer type; ... A
1194 null pointer constant of integral type can be converted to an
1195 rvalue of type std::nullptr_t. */
1196 if ((tcode == POINTER_TYPE || TYPE_PTRMEM_P (to)
1197 || NULLPTR_TYPE_P (to))
1198 && ((expr && null_ptr_cst_p (expr))
1199 || NULLPTR_TYPE_P (from)))
1200 conv = build_conv (ck_std, to, conv);
1201 else if ((tcode == INTEGER_TYPE && fcode == POINTER_TYPE)
1202 || (tcode == POINTER_TYPE && fcode == INTEGER_TYPE))
1204 /* For backwards brain damage compatibility, allow interconversion of
1205 pointers and integers with a pedwarn. */
1206 conv = build_conv (ck_std, to, conv);
1207 conv->bad_p = true;
1209 else if (UNSCOPED_ENUM_P (to) && fcode == INTEGER_TYPE)
1211 /* For backwards brain damage compatibility, allow interconversion of
1212 enums and integers with a pedwarn. */
1213 conv = build_conv (ck_std, to, conv);
1214 conv->bad_p = true;
1216 else if ((tcode == POINTER_TYPE && fcode == POINTER_TYPE)
1217 || (TYPE_PTRDATAMEM_P (to) && TYPE_PTRDATAMEM_P (from)))
1219 tree to_pointee;
1220 tree from_pointee;
1222 if (tcode == POINTER_TYPE)
1224 to_pointee = TREE_TYPE (to);
1225 from_pointee = TREE_TYPE (from);
1227 /* Since this is the target of a pointer, it can't have function
1228 qualifiers, so any TYPE_QUALS must be for attributes const or
1229 noreturn. Strip them. */
1230 if (TREE_CODE (to_pointee) == FUNCTION_TYPE
1231 && TYPE_QUALS (to_pointee))
1232 to_pointee = build_qualified_type (to_pointee, TYPE_UNQUALIFIED);
1233 if (TREE_CODE (from_pointee) == FUNCTION_TYPE
1234 && TYPE_QUALS (from_pointee))
1235 from_pointee = build_qualified_type (from_pointee, TYPE_UNQUALIFIED);
1237 else
1239 to_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (to);
1240 from_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (from);
1243 if (tcode == POINTER_TYPE
1244 && same_type_ignoring_top_level_qualifiers_p (from_pointee,
1245 to_pointee))
1247 else if (VOID_TYPE_P (to_pointee)
1248 && !TYPE_PTRDATAMEM_P (from)
1249 && TREE_CODE (from_pointee) != FUNCTION_TYPE)
1251 tree nfrom = TREE_TYPE (from);
1252 /* Don't try to apply restrict to void. */
1253 int quals = cp_type_quals (nfrom) & ~TYPE_QUAL_RESTRICT;
1254 from_pointee = cp_build_qualified_type (void_type_node, quals);
1255 from = build_pointer_type (from_pointee);
1256 conv = build_conv (ck_ptr, from, conv);
1258 else if (TYPE_PTRDATAMEM_P (from))
1260 tree fbase = TYPE_PTRMEM_CLASS_TYPE (from);
1261 tree tbase = TYPE_PTRMEM_CLASS_TYPE (to);
1263 if (same_type_p (fbase, tbase))
1264 /* No base conversion needed. */;
1265 else if (DERIVED_FROM_P (fbase, tbase)
1266 && (same_type_ignoring_top_level_qualifiers_p
1267 (from_pointee, to_pointee)))
1269 from = build_ptrmem_type (tbase, from_pointee);
1270 conv = build_conv (ck_pmem, from, conv);
1272 else
1273 return NULL;
1275 else if (CLASS_TYPE_P (from_pointee)
1276 && CLASS_TYPE_P (to_pointee)
1277 /* [conv.ptr]
1279 An rvalue of type "pointer to cv D," where D is a
1280 class type, can be converted to an rvalue of type
1281 "pointer to cv B," where B is a base class (clause
1282 _class.derived_) of D. If B is an inaccessible
1283 (clause _class.access_) or ambiguous
1284 (_class.member.lookup_) base class of D, a program
1285 that necessitates this conversion is ill-formed.
1286 Therefore, we use DERIVED_FROM_P, and do not check
1287 access or uniqueness. */
1288 && DERIVED_FROM_P (to_pointee, from_pointee))
1290 from_pointee
1291 = cp_build_qualified_type (to_pointee,
1292 cp_type_quals (from_pointee));
1293 from = build_pointer_type (from_pointee);
1294 conv = build_conv (ck_ptr, from, conv);
1295 conv->base_p = true;
1298 if (same_type_p (from, to))
1299 /* OK */;
1300 else if (c_cast_p && comp_ptr_ttypes_const (to, from))
1301 /* In a C-style cast, we ignore CV-qualification because we
1302 are allowed to perform a static_cast followed by a
1303 const_cast. */
1304 conv = build_conv (ck_qual, to, conv);
1305 else if (!c_cast_p && comp_ptr_ttypes (to_pointee, from_pointee))
1306 conv = build_conv (ck_qual, to, conv);
1307 else if (expr && string_conv_p (to, expr, 0))
1308 /* converting from string constant to char *. */
1309 conv = build_conv (ck_qual, to, conv);
1310 else if (fnptr_conv_p (to, from))
1311 conv = build_conv (ck_fnptr, to, conv);
1312 /* Allow conversions among compatible ObjC pointer types (base
1313 conversions have been already handled above). */
1314 else if (c_dialect_objc ()
1315 && objc_compare_types (to, from, -4, NULL_TREE))
1316 conv = build_conv (ck_ptr, to, conv);
1317 else if (ptr_reasonably_similar (to_pointee, from_pointee))
1319 conv = build_conv (ck_ptr, to, conv);
1320 conv->bad_p = true;
1322 else
1323 return NULL;
1325 from = to;
1327 else if (TYPE_PTRMEMFUNC_P (to) && TYPE_PTRMEMFUNC_P (from))
1329 tree fromfn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from));
1330 tree tofn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to));
1331 tree fbase = class_of_this_parm (fromfn);
1332 tree tbase = class_of_this_parm (tofn);
1334 if (!DERIVED_FROM_P (fbase, tbase))
1335 return NULL;
1337 tree fstat = static_fn_type (fromfn);
1338 tree tstat = static_fn_type (tofn);
1339 if (same_type_p (tstat, fstat)
1340 || fnptr_conv_p (tstat, fstat))
1341 /* OK */;
1342 else
1343 return NULL;
1345 if (!same_type_p (fbase, tbase))
1347 from = build_memfn_type (fstat,
1348 tbase,
1349 cp_type_quals (tbase),
1350 type_memfn_rqual (tofn));
1351 from = build_ptrmemfunc_type (build_pointer_type (from));
1352 conv = build_conv (ck_pmem, from, conv);
1353 conv->base_p = true;
1355 if (fnptr_conv_p (tstat, fstat))
1356 conv = build_conv (ck_fnptr, to, conv);
1358 else if (tcode == BOOLEAN_TYPE)
1360 /* [conv.bool]
1362 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1363 to member type can be converted to a prvalue of type bool. ...
1364 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1365 std::nullptr_t can be converted to a prvalue of type bool; */
1366 if (ARITHMETIC_TYPE_P (from)
1367 || UNSCOPED_ENUM_P (from)
1368 || fcode == POINTER_TYPE
1369 || TYPE_PTRMEM_P (from)
1370 || NULLPTR_TYPE_P (from))
1372 conv = build_conv (ck_std, to, conv);
1373 if (fcode == POINTER_TYPE
1374 || TYPE_PTRDATAMEM_P (from)
1375 || (TYPE_PTRMEMFUNC_P (from)
1376 && conv->rank < cr_pbool)
1377 || NULLPTR_TYPE_P (from))
1378 conv->rank = cr_pbool;
1379 if (NULLPTR_TYPE_P (from) && (flags & LOOKUP_ONLYCONVERTING))
1380 conv->bad_p = true;
1381 return conv;
1384 return NULL;
1386 /* We don't check for ENUMERAL_TYPE here because there are no standard
1387 conversions to enum type. */
1388 /* As an extension, allow conversion to complex type. */
1389 else if (ARITHMETIC_TYPE_P (to))
1391 if (! (INTEGRAL_CODE_P (fcode)
1392 || (fcode == REAL_TYPE && !(flags & LOOKUP_NO_NON_INTEGRAL)))
1393 || SCOPED_ENUM_P (from))
1394 return NULL;
1395 conv = build_conv (ck_std, to, conv);
1397 /* Give this a better rank if it's a promotion. */
1398 if (same_type_p (to, type_promotes_to (from))
1399 && next_conversion (conv)->rank <= cr_promotion)
1400 conv->rank = cr_promotion;
1402 else if (fcode == VECTOR_TYPE && tcode == VECTOR_TYPE
1403 && vector_types_convertible_p (from, to, false))
1404 return build_conv (ck_std, to, conv);
1405 else if (MAYBE_CLASS_TYPE_P (to) && MAYBE_CLASS_TYPE_P (from)
1406 && is_properly_derived_from (from, to))
1408 if (conv->kind == ck_rvalue)
1409 conv = next_conversion (conv);
1410 conv = build_conv (ck_base, to, conv);
1411 /* The derived-to-base conversion indicates the initialization
1412 of a parameter with base type from an object of a derived
1413 type. A temporary object is created to hold the result of
1414 the conversion unless we're binding directly to a reference. */
1415 conv->need_temporary_p = !(flags & LOOKUP_NO_TEMP_BIND);
1417 else
1418 return NULL;
1420 if (flags & LOOKUP_NO_NARROWING)
1421 conv->check_narrowing = true;
1423 return conv;
1426 /* Returns nonzero if T1 is reference-related to T2. */
1428 bool
1429 reference_related_p (tree t1, tree t2)
1431 if (t1 == error_mark_node || t2 == error_mark_node)
1432 return false;
1434 t1 = TYPE_MAIN_VARIANT (t1);
1435 t2 = TYPE_MAIN_VARIANT (t2);
1437 /* [dcl.init.ref]
1439 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1440 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1441 of T2. */
1442 return (same_type_p (t1, t2)
1443 || (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
1444 && DERIVED_FROM_P (t1, t2)));
1447 /* Returns nonzero if T1 is reference-compatible with T2. */
1449 static bool
1450 reference_compatible_p (tree t1, tree t2)
1452 /* [dcl.init.ref]
1454 "cv1 T1" is reference compatible with "cv2 T2" if
1455 * T1 is reference-related to T2 or
1456 * T2 is "noexcept function" and T1 is "function", where the
1457 function types are otherwise the same,
1458 and cv1 is the same cv-qualification as, or greater cv-qualification
1459 than, cv2. */
1460 return ((reference_related_p (t1, t2)
1461 || fnptr_conv_p (t1, t2))
1462 && at_least_as_qualified_p (t1, t2));
1465 /* A reference of the indicated TYPE is being bound directly to the
1466 expression represented by the implicit conversion sequence CONV.
1467 Return a conversion sequence for this binding. */
1469 static conversion *
1470 direct_reference_binding (tree type, conversion *conv)
1472 tree t;
1474 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
1475 gcc_assert (TREE_CODE (conv->type) != REFERENCE_TYPE);
1477 t = TREE_TYPE (type);
1479 /* [over.ics.rank]
1481 When a parameter of reference type binds directly
1482 (_dcl.init.ref_) to an argument expression, the implicit
1483 conversion sequence is the identity conversion, unless the
1484 argument expression has a type that is a derived class of the
1485 parameter type, in which case the implicit conversion sequence is
1486 a derived-to-base Conversion.
1488 If the parameter binds directly to the result of applying a
1489 conversion function to the argument expression, the implicit
1490 conversion sequence is a user-defined conversion sequence
1491 (_over.ics.user_), with the second standard conversion sequence
1492 either an identity conversion or, if the conversion function
1493 returns an entity of a type that is a derived class of the
1494 parameter type, a derived-to-base conversion. */
1495 if (is_properly_derived_from (conv->type, t))
1497 /* Represent the derived-to-base conversion. */
1498 conv = build_conv (ck_base, t, conv);
1499 /* We will actually be binding to the base-class subobject in
1500 the derived class, so we mark this conversion appropriately.
1501 That way, convert_like knows not to generate a temporary. */
1502 conv->need_temporary_p = false;
1504 return build_conv (ck_ref_bind, type, conv);
1507 /* Returns the conversion path from type FROM to reference type TO for
1508 purposes of reference binding. For lvalue binding, either pass a
1509 reference type to FROM or an lvalue expression to EXPR. If the
1510 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1511 the conversion returned. If C_CAST_P is true, this
1512 conversion is coming from a C-style cast. */
1514 static conversion *
1515 reference_binding (tree rto, tree rfrom, tree expr, bool c_cast_p, int flags,
1516 tsubst_flags_t complain)
1518 conversion *conv = NULL;
1519 tree to = TREE_TYPE (rto);
1520 tree from = rfrom;
1521 tree tfrom;
1522 bool related_p;
1523 bool compatible_p;
1524 cp_lvalue_kind gl_kind;
1525 bool is_lvalue;
1527 if (TREE_CODE (to) == FUNCTION_TYPE && expr && type_unknown_p (expr))
1529 expr = instantiate_type (to, expr, tf_none);
1530 if (expr == error_mark_node)
1531 return NULL;
1532 from = TREE_TYPE (expr);
1535 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1537 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
1538 /* DR 1288: Otherwise, if the initializer list has a single element
1539 of type E and ... [T's] referenced type is reference-related to E,
1540 the object or reference is initialized from that element... */
1541 if (CONSTRUCTOR_NELTS (expr) == 1)
1543 tree elt = CONSTRUCTOR_ELT (expr, 0)->value;
1544 if (error_operand_p (elt))
1545 return NULL;
1546 tree etype = TREE_TYPE (elt);
1547 if (reference_related_p (to, etype))
1549 expr = elt;
1550 from = etype;
1551 goto skip;
1554 /* Otherwise, if T is a reference type, a prvalue temporary of the
1555 type referenced by T is copy-list-initialized or
1556 direct-list-initialized, depending on the kind of initialization
1557 for the reference, and the reference is bound to that temporary. */
1558 conv = implicit_conversion (to, from, expr, c_cast_p,
1559 flags|LOOKUP_NO_TEMP_BIND, complain);
1560 skip:;
1563 if (TREE_CODE (from) == REFERENCE_TYPE)
1565 from = TREE_TYPE (from);
1566 if (!TYPE_REF_IS_RVALUE (rfrom)
1567 || TREE_CODE (from) == FUNCTION_TYPE)
1568 gl_kind = clk_ordinary;
1569 else
1570 gl_kind = clk_rvalueref;
1572 else if (expr)
1573 gl_kind = lvalue_kind (expr);
1574 else if (CLASS_TYPE_P (from)
1575 || TREE_CODE (from) == ARRAY_TYPE)
1576 gl_kind = clk_class;
1577 else
1578 gl_kind = clk_none;
1580 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1581 if ((flags & LOOKUP_NO_TEMP_BIND)
1582 && (gl_kind & clk_class))
1583 gl_kind = clk_none;
1585 /* Same mask as real_lvalue_p. */
1586 is_lvalue = gl_kind && !(gl_kind & (clk_rvalueref|clk_class));
1588 tfrom = from;
1589 if ((gl_kind & clk_bitfield) != 0)
1590 tfrom = unlowered_expr_type (expr);
1592 /* Figure out whether or not the types are reference-related and
1593 reference compatible. We have to do this after stripping
1594 references from FROM. */
1595 related_p = reference_related_p (to, tfrom);
1596 /* If this is a C cast, first convert to an appropriately qualified
1597 type, so that we can later do a const_cast to the desired type. */
1598 if (related_p && c_cast_p
1599 && !at_least_as_qualified_p (to, tfrom))
1600 to = cp_build_qualified_type (to, cp_type_quals (tfrom));
1601 compatible_p = reference_compatible_p (to, tfrom);
1603 /* Directly bind reference when target expression's type is compatible with
1604 the reference and expression is an lvalue. In DR391, the wording in
1605 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1606 const and rvalue references to rvalues of compatible class type.
1607 We should also do direct bindings for non-class xvalues. */
1608 if ((related_p || compatible_p) && gl_kind)
1610 /* [dcl.init.ref]
1612 If the initializer expression
1614 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1615 is reference-compatible with "cv2 T2,"
1617 the reference is bound directly to the initializer expression
1618 lvalue.
1620 [...]
1621 If the initializer expression is an rvalue, with T2 a class type,
1622 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1623 is bound to the object represented by the rvalue or to a sub-object
1624 within that object. */
1626 conv = build_identity_conv (tfrom, expr);
1627 conv = direct_reference_binding (rto, conv);
1629 if (TREE_CODE (rfrom) == REFERENCE_TYPE)
1630 /* Handle rvalue reference to function properly. */
1631 conv->rvaluedness_matches_p
1632 = (TYPE_REF_IS_RVALUE (rto) == TYPE_REF_IS_RVALUE (rfrom));
1633 else
1634 conv->rvaluedness_matches_p
1635 = (TYPE_REF_IS_RVALUE (rto) == !is_lvalue);
1637 if ((gl_kind & clk_bitfield) != 0
1638 || ((gl_kind & clk_packed) != 0 && !TYPE_PACKED (to)))
1639 /* For the purposes of overload resolution, we ignore the fact
1640 this expression is a bitfield or packed field. (In particular,
1641 [over.ics.ref] says specifically that a function with a
1642 non-const reference parameter is viable even if the
1643 argument is a bitfield.)
1645 However, when we actually call the function we must create
1646 a temporary to which to bind the reference. If the
1647 reference is volatile, or isn't const, then we cannot make
1648 a temporary, so we just issue an error when the conversion
1649 actually occurs. */
1650 conv->need_temporary_p = true;
1652 /* Don't allow binding of lvalues (other than function lvalues) to
1653 rvalue references. */
1654 if (is_lvalue && TYPE_REF_IS_RVALUE (rto)
1655 && TREE_CODE (to) != FUNCTION_TYPE)
1656 conv->bad_p = true;
1658 /* Nor the reverse. */
1659 if (!is_lvalue && !TYPE_REF_IS_RVALUE (rto)
1660 && (!CP_TYPE_CONST_NON_VOLATILE_P (to)
1661 || (flags & LOOKUP_NO_RVAL_BIND))
1662 && TREE_CODE (to) != FUNCTION_TYPE)
1663 conv->bad_p = true;
1665 if (!compatible_p)
1666 conv->bad_p = true;
1668 return conv;
1670 /* [class.conv.fct] A conversion function is never used to convert a
1671 (possibly cv-qualified) object to the (possibly cv-qualified) same
1672 object type (or a reference to it), to a (possibly cv-qualified) base
1673 class of that type (or a reference to it).... */
1674 else if (CLASS_TYPE_P (from) && !related_p
1675 && !(flags & LOOKUP_NO_CONVERSION))
1677 /* [dcl.init.ref]
1679 If the initializer expression
1681 -- has a class type (i.e., T2 is a class type) can be
1682 implicitly converted to an lvalue of type "cv3 T3," where
1683 "cv1 T1" is reference-compatible with "cv3 T3". (this
1684 conversion is selected by enumerating the applicable
1685 conversion functions (_over.match.ref_) and choosing the
1686 best one through overload resolution. (_over.match_).
1688 the reference is bound to the lvalue result of the conversion
1689 in the second case. */
1690 z_candidate *cand = build_user_type_conversion_1 (rto, expr, flags,
1691 complain);
1692 if (cand)
1693 return cand->second_conv;
1696 /* From this point on, we conceptually need temporaries, even if we
1697 elide them. Only the cases above are "direct bindings". */
1698 if (flags & LOOKUP_NO_TEMP_BIND)
1699 return NULL;
1701 /* [over.ics.rank]
1703 When a parameter of reference type is not bound directly to an
1704 argument expression, the conversion sequence is the one required
1705 to convert the argument expression to the underlying type of the
1706 reference according to _over.best.ics_. Conceptually, this
1707 conversion sequence corresponds to copy-initializing a temporary
1708 of the underlying type with the argument expression. Any
1709 difference in top-level cv-qualification is subsumed by the
1710 initialization itself and does not constitute a conversion. */
1712 /* [dcl.init.ref]
1714 Otherwise, the reference shall be an lvalue reference to a
1715 non-volatile const type, or the reference shall be an rvalue
1716 reference.
1718 We try below to treat this as a bad conversion to improve diagnostics,
1719 but if TO is an incomplete class, we need to reject this conversion
1720 now to avoid unnecessary instantiation. */
1721 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto)
1722 && !COMPLETE_TYPE_P (to))
1723 return NULL;
1725 /* We're generating a temporary now, but don't bind any more in the
1726 conversion (specifically, don't slice the temporary returned by a
1727 conversion operator). */
1728 flags |= LOOKUP_NO_TEMP_BIND;
1730 /* Core issue 899: When [copy-]initializing a temporary to be bound
1731 to the first parameter of a copy constructor (12.8) called with
1732 a single argument in the context of direct-initialization,
1733 explicit conversion functions are also considered.
1735 So don't set LOOKUP_ONLYCONVERTING in that case. */
1736 if (!(flags & LOOKUP_COPY_PARM))
1737 flags |= LOOKUP_ONLYCONVERTING;
1739 if (!conv)
1740 conv = implicit_conversion (to, from, expr, c_cast_p,
1741 flags, complain);
1742 if (!conv)
1743 return NULL;
1745 if (conv->user_conv_p)
1747 /* If initializing the temporary used a conversion function,
1748 recalculate the second conversion sequence. */
1749 for (conversion *t = conv; t; t = next_conversion (t))
1750 if (t->kind == ck_user
1751 && DECL_CONV_FN_P (t->cand->fn))
1753 tree ftype = TREE_TYPE (TREE_TYPE (t->cand->fn));
1754 int sflags = (flags|LOOKUP_NO_CONVERSION)&~LOOKUP_NO_TEMP_BIND;
1755 conversion *new_second
1756 = reference_binding (rto, ftype, NULL_TREE, c_cast_p,
1757 sflags, complain);
1758 if (!new_second)
1759 return NULL;
1760 return merge_conversion_sequences (t, new_second);
1764 conv = build_conv (ck_ref_bind, rto, conv);
1765 /* This reference binding, unlike those above, requires the
1766 creation of a temporary. */
1767 conv->need_temporary_p = true;
1768 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
1770 /* [dcl.init.ref]
1772 Otherwise, the reference shall be an lvalue reference to a
1773 non-volatile const type, or the reference shall be an rvalue
1774 reference. */
1775 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto))
1776 conv->bad_p = true;
1778 /* [dcl.init.ref]
1780 Otherwise, a temporary of type "cv1 T1" is created and
1781 initialized from the initializer expression using the rules for a
1782 non-reference copy initialization. If T1 is reference-related to
1783 T2, cv1 must be the same cv-qualification as, or greater
1784 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1785 if (related_p && !at_least_as_qualified_p (to, from))
1786 conv->bad_p = true;
1788 return conv;
1791 /* Returns the implicit conversion sequence (see [over.ics]) from type
1792 FROM to type TO. The optional expression EXPR may affect the
1793 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1794 true, this conversion is coming from a C-style cast. */
1796 static conversion *
1797 implicit_conversion (tree to, tree from, tree expr, bool c_cast_p,
1798 int flags, tsubst_flags_t complain)
1800 conversion *conv;
1802 if (from == error_mark_node || to == error_mark_node
1803 || expr == error_mark_node)
1804 return NULL;
1806 /* Other flags only apply to the primary function in overload
1807 resolution, or after we've chosen one. */
1808 flags &= (LOOKUP_ONLYCONVERTING|LOOKUP_NO_CONVERSION|LOOKUP_COPY_PARM
1809 |LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND|LOOKUP_PREFER_RVALUE
1810 |LOOKUP_NO_NARROWING|LOOKUP_PROTECT|LOOKUP_NO_NON_INTEGRAL);
1812 /* FIXME: actually we don't want warnings either, but we can't just
1813 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1814 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1815 We really ought not to issue that warning until we've committed
1816 to that conversion. */
1817 complain &= ~tf_error;
1819 /* Call reshape_init early to remove redundant braces. */
1820 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr)
1821 && CLASS_TYPE_P (to)
1822 && COMPLETE_TYPE_P (complete_type (to))
1823 && !CLASSTYPE_NON_AGGREGATE (to))
1825 expr = reshape_init (to, expr, complain);
1826 if (expr == error_mark_node)
1827 return NULL;
1828 from = TREE_TYPE (expr);
1831 if (TREE_CODE (to) == REFERENCE_TYPE)
1832 conv = reference_binding (to, from, expr, c_cast_p, flags, complain);
1833 else
1834 conv = standard_conversion (to, from, expr, c_cast_p, flags, complain);
1836 if (conv)
1837 return conv;
1839 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1841 if (is_std_init_list (to))
1842 return build_list_conv (to, expr, flags, complain);
1844 /* As an extension, allow list-initialization of _Complex. */
1845 if (TREE_CODE (to) == COMPLEX_TYPE)
1847 conv = build_complex_conv (to, expr, flags, complain);
1848 if (conv)
1849 return conv;
1852 /* Allow conversion from an initializer-list with one element to a
1853 scalar type. */
1854 if (SCALAR_TYPE_P (to))
1856 int nelts = CONSTRUCTOR_NELTS (expr);
1857 tree elt;
1859 if (nelts == 0)
1860 elt = build_value_init (to, tf_none);
1861 else if (nelts == 1)
1862 elt = CONSTRUCTOR_ELT (expr, 0)->value;
1863 else
1864 elt = error_mark_node;
1866 conv = implicit_conversion (to, TREE_TYPE (elt), elt,
1867 c_cast_p, flags, complain);
1868 if (conv)
1870 conv->check_narrowing = true;
1871 if (BRACE_ENCLOSED_INITIALIZER_P (elt))
1872 /* Too many levels of braces, i.e. '{{1}}'. */
1873 conv->bad_p = true;
1874 return conv;
1877 else if (TREE_CODE (to) == ARRAY_TYPE)
1878 return build_array_conv (to, expr, flags, complain);
1881 if (expr != NULL_TREE
1882 && (MAYBE_CLASS_TYPE_P (from)
1883 || MAYBE_CLASS_TYPE_P (to))
1884 && (flags & LOOKUP_NO_CONVERSION) == 0)
1886 struct z_candidate *cand;
1888 if (CLASS_TYPE_P (to)
1889 && BRACE_ENCLOSED_INITIALIZER_P (expr)
1890 && !CLASSTYPE_NON_AGGREGATE (complete_type (to)))
1891 return build_aggr_conv (to, expr, flags, complain);
1893 cand = build_user_type_conversion_1 (to, expr, flags, complain);
1894 if (cand)
1896 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
1897 && CONSTRUCTOR_NELTS (expr) == 1
1898 && !is_list_ctor (cand->fn))
1900 /* "If C is not an initializer-list constructor and the
1901 initializer list has a single element of type cv U, where U is
1902 X or a class derived from X, the implicit conversion sequence
1903 has Exact Match rank if U is X, or Conversion rank if U is
1904 derived from X." */
1905 tree elt = CONSTRUCTOR_ELT (expr, 0)->value;
1906 tree elttype = TREE_TYPE (elt);
1907 if (reference_related_p (to, elttype))
1908 return implicit_conversion (to, elttype, elt,
1909 c_cast_p, flags, complain);
1911 conv = cand->second_conv;
1914 /* We used to try to bind a reference to a temporary here, but that
1915 is now handled after the recursive call to this function at the end
1916 of reference_binding. */
1917 return conv;
1920 return NULL;
1923 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1924 functions. ARGS will not be changed until a single candidate is
1925 selected. */
1927 static struct z_candidate *
1928 add_candidate (struct z_candidate **candidates,
1929 tree fn, tree first_arg, const vec<tree, va_gc> *args,
1930 size_t num_convs, conversion **convs,
1931 tree access_path, tree conversion_path,
1932 int viable, struct rejection_reason *reason,
1933 int flags)
1935 struct z_candidate *cand = (struct z_candidate *)
1936 conversion_obstack_alloc (sizeof (struct z_candidate));
1938 cand->fn = fn;
1939 cand->first_arg = first_arg;
1940 cand->args = args;
1941 cand->convs = convs;
1942 cand->num_convs = num_convs;
1943 cand->access_path = access_path;
1944 cand->conversion_path = conversion_path;
1945 cand->viable = viable;
1946 cand->reason = reason;
1947 cand->next = *candidates;
1948 cand->flags = flags;
1949 *candidates = cand;
1951 return cand;
1954 /* Return the number of remaining arguments in the parameter list
1955 beginning with ARG. */
1958 remaining_arguments (tree arg)
1960 int n;
1962 for (n = 0; arg != NULL_TREE && arg != void_list_node;
1963 arg = TREE_CHAIN (arg))
1964 n++;
1966 return n;
1969 /* Create an overload candidate for the function or method FN called
1970 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1971 FLAGS is passed on to implicit_conversion.
1973 This does not change ARGS.
1975 CTYPE, if non-NULL, is the type we want to pretend this function
1976 comes from for purposes of overload resolution. */
1978 static struct z_candidate *
1979 add_function_candidate (struct z_candidate **candidates,
1980 tree fn, tree ctype, tree first_arg,
1981 const vec<tree, va_gc> *args, tree access_path,
1982 tree conversion_path, int flags,
1983 tsubst_flags_t complain)
1985 tree parmlist = TYPE_ARG_TYPES (TREE_TYPE (fn));
1986 int i, len;
1987 conversion **convs;
1988 tree parmnode;
1989 tree orig_first_arg = first_arg;
1990 int skip;
1991 int viable = 1;
1992 struct rejection_reason *reason = NULL;
1994 /* At this point we should not see any functions which haven't been
1995 explicitly declared, except for friend functions which will have
1996 been found using argument dependent lookup. */
1997 gcc_assert (!DECL_ANTICIPATED (fn) || DECL_HIDDEN_FRIEND_P (fn));
1999 /* The `this', `in_chrg' and VTT arguments to constructors are not
2000 considered in overload resolution. */
2001 if (DECL_CONSTRUCTOR_P (fn))
2003 if (ctor_omit_inherited_parms (fn))
2004 /* Bring back parameters omitted from an inherited ctor. */
2005 parmlist = FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn));
2006 else
2007 parmlist = skip_artificial_parms_for (fn, parmlist);
2008 skip = num_artificial_parms_for (fn);
2009 if (skip > 0 && first_arg != NULL_TREE)
2011 --skip;
2012 first_arg = NULL_TREE;
2015 else
2016 skip = 0;
2018 len = vec_safe_length (args) - skip + (first_arg != NULL_TREE ? 1 : 0);
2019 convs = alloc_conversions (len);
2021 /* 13.3.2 - Viable functions [over.match.viable]
2022 First, to be a viable function, a candidate function shall have enough
2023 parameters to agree in number with the arguments in the list.
2025 We need to check this first; otherwise, checking the ICSes might cause
2026 us to produce an ill-formed template instantiation. */
2028 parmnode = parmlist;
2029 for (i = 0; i < len; ++i)
2031 if (parmnode == NULL_TREE || parmnode == void_list_node)
2032 break;
2033 parmnode = TREE_CHAIN (parmnode);
2036 if ((i < len && parmnode)
2037 || !sufficient_parms_p (parmnode))
2039 int remaining = remaining_arguments (parmnode);
2040 viable = 0;
2041 reason = arity_rejection (first_arg, i + remaining, len);
2044 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2045 parameter of type "reference to cv C" (including such a constructor
2046 instantiated from a template) is excluded from the set of candidate
2047 functions when used to construct an object of type D with an argument list
2048 containing a single argument if C is reference-related to D. */
2049 if (viable && len == 1 && parmlist && DECL_CONSTRUCTOR_P (fn)
2050 && flag_new_inheriting_ctors
2051 && DECL_INHERITED_CTOR (fn))
2053 tree ptype = non_reference (TREE_VALUE (parmlist));
2054 tree dtype = DECL_CONTEXT (fn);
2055 tree btype = DECL_INHERITED_CTOR_BASE (fn);
2056 if (reference_related_p (ptype, dtype)
2057 && reference_related_p (btype, ptype))
2059 viable = false;
2060 reason = inherited_ctor_rejection ();
2064 /* Second, for a function to be viable, its constraints must be
2065 satisfied. */
2066 if (flag_concepts && viable
2067 && !constraints_satisfied_p (fn))
2069 reason = constraint_failure (fn);
2070 viable = false;
2073 /* When looking for a function from a subobject from an implicit
2074 copy/move constructor/operator=, don't consider anything that takes (a
2075 reference to) an unrelated type. See c++/44909 and core 1092. */
2076 if (viable && parmlist && (flags & LOOKUP_DEFAULTED))
2078 if (DECL_CONSTRUCTOR_P (fn))
2079 i = 1;
2080 else if (DECL_ASSIGNMENT_OPERATOR_P (fn)
2081 && DECL_OVERLOADED_OPERATOR_IS (fn, NOP_EXPR))
2082 i = 2;
2083 else
2084 i = 0;
2085 if (i && len == i)
2087 parmnode = chain_index (i-1, parmlist);
2088 if (!reference_related_p (non_reference (TREE_VALUE (parmnode)),
2089 ctype))
2090 viable = 0;
2093 /* This only applies at the top level. */
2094 flags &= ~LOOKUP_DEFAULTED;
2097 if (! viable)
2098 goto out;
2100 /* Third, for F to be a viable function, there shall exist for each
2101 argument an implicit conversion sequence that converts that argument
2102 to the corresponding parameter of F. */
2104 parmnode = parmlist;
2106 for (i = 0; i < len; ++i)
2108 tree argtype, to_type;
2109 tree arg;
2110 conversion *t;
2111 int is_this;
2113 if (parmnode == void_list_node)
2114 break;
2116 if (i == 0 && first_arg != NULL_TREE)
2117 arg = first_arg;
2118 else
2119 arg = CONST_CAST_TREE (
2120 (*args)[i + skip - (first_arg != NULL_TREE ? 1 : 0)]);
2121 argtype = lvalue_type (arg);
2123 is_this = (i == 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
2124 && ! DECL_CONSTRUCTOR_P (fn));
2126 if (parmnode)
2128 tree parmtype = TREE_VALUE (parmnode);
2129 int lflags = flags;
2131 parmnode = TREE_CHAIN (parmnode);
2133 /* The type of the implicit object parameter ('this') for
2134 overload resolution is not always the same as for the
2135 function itself; conversion functions are considered to
2136 be members of the class being converted, and functions
2137 introduced by a using-declaration are considered to be
2138 members of the class that uses them.
2140 Since build_over_call ignores the ICS for the `this'
2141 parameter, we can just change the parm type. */
2142 if (ctype && is_this)
2144 parmtype = cp_build_qualified_type
2145 (ctype, cp_type_quals (TREE_TYPE (parmtype)));
2146 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn)))
2148 /* If the function has a ref-qualifier, the implicit
2149 object parameter has reference type. */
2150 bool rv = FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn));
2151 parmtype = cp_build_reference_type (parmtype, rv);
2152 /* The special handling of 'this' conversions in compare_ics
2153 does not apply if there is a ref-qualifier. */
2154 is_this = false;
2156 else
2158 parmtype = build_pointer_type (parmtype);
2159 /* We don't use build_this here because we don't want to
2160 capture the object argument until we've chosen a
2161 non-static member function. */
2162 arg = build_address (arg);
2163 argtype = lvalue_type (arg);
2167 /* Core issue 899: When [copy-]initializing a temporary to be bound
2168 to the first parameter of a copy constructor (12.8) called with
2169 a single argument in the context of direct-initialization,
2170 explicit conversion functions are also considered.
2172 So set LOOKUP_COPY_PARM to let reference_binding know that
2173 it's being called in that context. We generalize the above
2174 to handle move constructors and template constructors as well;
2175 the standardese should soon be updated similarly. */
2176 if (ctype && i == 0 && (len-skip == 1)
2177 && DECL_CONSTRUCTOR_P (fn)
2178 && parmtype != error_mark_node
2179 && (same_type_ignoring_top_level_qualifiers_p
2180 (non_reference (parmtype), ctype)))
2182 if (!(flags & LOOKUP_ONLYCONVERTING))
2183 lflags |= LOOKUP_COPY_PARM;
2184 /* We allow user-defined conversions within init-lists, but
2185 don't list-initialize the copy parm, as that would mean
2186 using two levels of braces for the same type. */
2187 if ((flags & LOOKUP_LIST_INIT_CTOR)
2188 && BRACE_ENCLOSED_INITIALIZER_P (arg))
2189 lflags |= LOOKUP_NO_CONVERSION;
2191 else
2192 lflags |= LOOKUP_ONLYCONVERTING;
2194 t = implicit_conversion (parmtype, argtype, arg,
2195 /*c_cast_p=*/false, lflags, complain);
2196 to_type = parmtype;
2198 else
2200 t = build_identity_conv (argtype, arg);
2201 t->ellipsis_p = true;
2202 to_type = argtype;
2205 if (t && is_this)
2206 t->this_p = true;
2208 convs[i] = t;
2209 if (! t)
2211 viable = 0;
2212 reason = arg_conversion_rejection (first_arg, i, argtype, to_type);
2213 break;
2216 if (t->bad_p)
2218 viable = -1;
2219 reason = bad_arg_conversion_rejection (first_arg, i, arg, to_type);
2223 out:
2224 return add_candidate (candidates, fn, orig_first_arg, args, len, convs,
2225 access_path, conversion_path, viable, reason, flags);
2228 /* Create an overload candidate for the conversion function FN which will
2229 be invoked for expression OBJ, producing a pointer-to-function which
2230 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2231 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2232 passed on to implicit_conversion.
2234 Actually, we don't really care about FN; we care about the type it
2235 converts to. There may be multiple conversion functions that will
2236 convert to that type, and we rely on build_user_type_conversion_1 to
2237 choose the best one; so when we create our candidate, we record the type
2238 instead of the function. */
2240 static struct z_candidate *
2241 add_conv_candidate (struct z_candidate **candidates, tree fn, tree obj,
2242 const vec<tree, va_gc> *arglist,
2243 tree access_path, tree conversion_path,
2244 tsubst_flags_t complain)
2246 tree totype = TREE_TYPE (TREE_TYPE (fn));
2247 int i, len, viable, flags;
2248 tree parmlist, parmnode;
2249 conversion **convs;
2250 struct rejection_reason *reason;
2252 for (parmlist = totype; TREE_CODE (parmlist) != FUNCTION_TYPE; )
2253 parmlist = TREE_TYPE (parmlist);
2254 parmlist = TYPE_ARG_TYPES (parmlist);
2256 len = vec_safe_length (arglist) + 1;
2257 convs = alloc_conversions (len);
2258 parmnode = parmlist;
2259 viable = 1;
2260 flags = LOOKUP_IMPLICIT;
2261 reason = NULL;
2263 /* Don't bother looking up the same type twice. */
2264 if (*candidates && (*candidates)->fn == totype)
2265 return NULL;
2267 for (i = 0; i < len; ++i)
2269 tree arg, argtype, convert_type = NULL_TREE;
2270 conversion *t;
2272 if (i == 0)
2273 arg = obj;
2274 else
2275 arg = (*arglist)[i - 1];
2276 argtype = lvalue_type (arg);
2278 if (i == 0)
2280 t = build_identity_conv (argtype, NULL_TREE);
2281 t = build_conv (ck_user, totype, t);
2282 /* Leave the 'cand' field null; we'll figure out the conversion in
2283 convert_like_real if this candidate is chosen. */
2284 convert_type = totype;
2286 else if (parmnode == void_list_node)
2287 break;
2288 else if (parmnode)
2290 t = implicit_conversion (TREE_VALUE (parmnode), argtype, arg,
2291 /*c_cast_p=*/false, flags, complain);
2292 convert_type = TREE_VALUE (parmnode);
2294 else
2296 t = build_identity_conv (argtype, arg);
2297 t->ellipsis_p = true;
2298 convert_type = argtype;
2301 convs[i] = t;
2302 if (! t)
2303 break;
2305 if (t->bad_p)
2307 viable = -1;
2308 reason = bad_arg_conversion_rejection (NULL_TREE, i, arg, convert_type);
2311 if (i == 0)
2312 continue;
2314 if (parmnode)
2315 parmnode = TREE_CHAIN (parmnode);
2318 if (i < len
2319 || ! sufficient_parms_p (parmnode))
2321 int remaining = remaining_arguments (parmnode);
2322 viable = 0;
2323 reason = arity_rejection (NULL_TREE, i + remaining, len);
2326 return add_candidate (candidates, totype, obj, arglist, len, convs,
2327 access_path, conversion_path, viable, reason, flags);
2330 static void
2331 build_builtin_candidate (struct z_candidate **candidates, tree fnname,
2332 tree type1, tree type2, tree *args, tree *argtypes,
2333 int flags, tsubst_flags_t complain)
2335 conversion *t;
2336 conversion **convs;
2337 size_t num_convs;
2338 int viable = 1, i;
2339 tree types[2];
2340 struct rejection_reason *reason = NULL;
2342 types[0] = type1;
2343 types[1] = type2;
2345 num_convs = args[2] ? 3 : (args[1] ? 2 : 1);
2346 convs = alloc_conversions (num_convs);
2348 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2349 conversion ops are allowed. We handle that here by just checking for
2350 boolean_type_node because other operators don't ask for it. COND_EXPR
2351 also does contextual conversion to bool for the first operand, but we
2352 handle that in build_conditional_expr, and type1 here is operand 2. */
2353 if (type1 != boolean_type_node)
2354 flags |= LOOKUP_ONLYCONVERTING;
2356 for (i = 0; i < 2; ++i)
2358 if (! args[i])
2359 break;
2361 t = implicit_conversion (types[i], argtypes[i], args[i],
2362 /*c_cast_p=*/false, flags, complain);
2363 if (! t)
2365 viable = 0;
2366 /* We need something for printing the candidate. */
2367 t = build_identity_conv (types[i], NULL_TREE);
2368 reason = arg_conversion_rejection (NULL_TREE, i, argtypes[i],
2369 types[i]);
2371 else if (t->bad_p)
2373 viable = 0;
2374 reason = bad_arg_conversion_rejection (NULL_TREE, i, args[i],
2375 types[i]);
2377 convs[i] = t;
2380 /* For COND_EXPR we rearranged the arguments; undo that now. */
2381 if (args[2])
2383 convs[2] = convs[1];
2384 convs[1] = convs[0];
2385 t = implicit_conversion (boolean_type_node, argtypes[2], args[2],
2386 /*c_cast_p=*/false, flags,
2387 complain);
2388 if (t)
2389 convs[0] = t;
2390 else
2392 viable = 0;
2393 reason = arg_conversion_rejection (NULL_TREE, 0, argtypes[2],
2394 boolean_type_node);
2398 add_candidate (candidates, fnname, /*first_arg=*/NULL_TREE, /*args=*/NULL,
2399 num_convs, convs,
2400 /*access_path=*/NULL_TREE,
2401 /*conversion_path=*/NULL_TREE,
2402 viable, reason, flags);
2405 static bool
2406 is_complete (tree t)
2408 return COMPLETE_TYPE_P (complete_type (t));
2411 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2413 static bool
2414 promoted_arithmetic_type_p (tree type)
2416 /* [over.built]
2418 In this section, the term promoted integral type is used to refer
2419 to those integral types which are preserved by integral promotion
2420 (including e.g. int and long but excluding e.g. char).
2421 Similarly, the term promoted arithmetic type refers to promoted
2422 integral types plus floating types. */
2423 return ((CP_INTEGRAL_TYPE_P (type)
2424 && same_type_p (type_promotes_to (type), type))
2425 || TREE_CODE (type) == REAL_TYPE);
2428 /* Create any builtin operator overload candidates for the operator in
2429 question given the converted operand types TYPE1 and TYPE2. The other
2430 args are passed through from add_builtin_candidates to
2431 build_builtin_candidate.
2433 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2434 If CODE is requires candidates operands of the same type of the kind
2435 of which TYPE1 and TYPE2 are, we add both candidates
2436 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2438 static void
2439 add_builtin_candidate (struct z_candidate **candidates, enum tree_code code,
2440 enum tree_code code2, tree fnname, tree type1,
2441 tree type2, tree *args, tree *argtypes, int flags,
2442 tsubst_flags_t complain)
2444 switch (code)
2446 case POSTINCREMENT_EXPR:
2447 case POSTDECREMENT_EXPR:
2448 args[1] = integer_zero_node;
2449 type2 = integer_type_node;
2450 break;
2451 default:
2452 break;
2455 switch (code)
2458 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2459 and VQ is either volatile or empty, there exist candidate operator
2460 functions of the form
2461 VQ T& operator++(VQ T&);
2462 T operator++(VQ T&, int);
2463 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2464 type other than bool, and VQ is either volatile or empty, there exist
2465 candidate operator functions of the form
2466 VQ T& operator--(VQ T&);
2467 T operator--(VQ T&, int);
2468 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2469 complete object type, and VQ is either volatile or empty, there exist
2470 candidate operator functions of the form
2471 T*VQ& operator++(T*VQ&);
2472 T*VQ& operator--(T*VQ&);
2473 T* operator++(T*VQ&, int);
2474 T* operator--(T*VQ&, int); */
2476 case POSTDECREMENT_EXPR:
2477 case PREDECREMENT_EXPR:
2478 if (TREE_CODE (type1) == BOOLEAN_TYPE)
2479 return;
2480 /* FALLTHRU */
2481 case POSTINCREMENT_EXPR:
2482 case PREINCREMENT_EXPR:
2483 if (ARITHMETIC_TYPE_P (type1) || TYPE_PTROB_P (type1))
2485 type1 = build_reference_type (type1);
2486 break;
2488 return;
2490 /* 7 For every cv-qualified or cv-unqualified object type T, there
2491 exist candidate operator functions of the form
2493 T& operator*(T*);
2495 8 For every function type T, there exist candidate operator functions of
2496 the form
2497 T& operator*(T*); */
2499 case INDIRECT_REF:
2500 if (TYPE_PTR_P (type1)
2501 && (TYPE_PTROB_P (type1)
2502 || TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE))
2503 break;
2504 return;
2506 /* 9 For every type T, there exist candidate operator functions of the form
2507 T* operator+(T*);
2509 10For every promoted arithmetic type T, there exist candidate operator
2510 functions of the form
2511 T operator+(T);
2512 T operator-(T); */
2514 case UNARY_PLUS_EXPR: /* unary + */
2515 if (TYPE_PTR_P (type1))
2516 break;
2517 /* FALLTHRU */
2518 case NEGATE_EXPR:
2519 if (ARITHMETIC_TYPE_P (type1))
2520 break;
2521 return;
2523 /* 11For every promoted integral type T, there exist candidate operator
2524 functions of the form
2525 T operator~(T); */
2527 case BIT_NOT_EXPR:
2528 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1))
2529 break;
2530 return;
2532 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2533 is the same type as C2 or is a derived class of C2, T is a complete
2534 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2535 there exist candidate operator functions of the form
2536 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2537 where CV12 is the union of CV1 and CV2. */
2539 case MEMBER_REF:
2540 if (TYPE_PTR_P (type1) && TYPE_PTRMEM_P (type2))
2542 tree c1 = TREE_TYPE (type1);
2543 tree c2 = TYPE_PTRMEM_CLASS_TYPE (type2);
2545 if (MAYBE_CLASS_TYPE_P (c1) && DERIVED_FROM_P (c2, c1)
2546 && (TYPE_PTRMEMFUNC_P (type2)
2547 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2))))
2548 break;
2550 return;
2552 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2553 didate operator functions of the form
2554 LR operator*(L, R);
2555 LR operator/(L, R);
2556 LR operator+(L, R);
2557 LR operator-(L, R);
2558 bool operator<(L, R);
2559 bool operator>(L, R);
2560 bool operator<=(L, R);
2561 bool operator>=(L, R);
2562 bool operator==(L, R);
2563 bool operator!=(L, R);
2564 where LR is the result of the usual arithmetic conversions between
2565 types L and R.
2567 14For every pair of types T and I, where T is a cv-qualified or cv-
2568 unqualified complete object type and I is a promoted integral type,
2569 there exist candidate operator functions of the form
2570 T* operator+(T*, I);
2571 T& operator[](T*, I);
2572 T* operator-(T*, I);
2573 T* operator+(I, T*);
2574 T& operator[](I, T*);
2576 15For every T, where T is a pointer to complete object type, there exist
2577 candidate operator functions of the form112)
2578 ptrdiff_t operator-(T, T);
2580 16For every pointer or enumeration type T, there exist candidate operator
2581 functions of the form
2582 bool operator<(T, T);
2583 bool operator>(T, T);
2584 bool operator<=(T, T);
2585 bool operator>=(T, T);
2586 bool operator==(T, T);
2587 bool operator!=(T, T);
2589 17For every pointer to member type T, there exist candidate operator
2590 functions of the form
2591 bool operator==(T, T);
2592 bool operator!=(T, T); */
2594 case MINUS_EXPR:
2595 if (TYPE_PTROB_P (type1) && TYPE_PTROB_P (type2))
2596 break;
2597 if (TYPE_PTROB_P (type1)
2598 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2600 type2 = ptrdiff_type_node;
2601 break;
2603 /* FALLTHRU */
2604 case MULT_EXPR:
2605 case TRUNC_DIV_EXPR:
2606 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2607 break;
2608 return;
2610 case EQ_EXPR:
2611 case NE_EXPR:
2612 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2613 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2)))
2614 break;
2615 if (TYPE_PTRMEM_P (type1) && null_ptr_cst_p (args[1]))
2617 type2 = type1;
2618 break;
2620 if (TYPE_PTRMEM_P (type2) && null_ptr_cst_p (args[0]))
2622 type1 = type2;
2623 break;
2625 /* Fall through. */
2626 case LT_EXPR:
2627 case GT_EXPR:
2628 case LE_EXPR:
2629 case GE_EXPR:
2630 case MAX_EXPR:
2631 case MIN_EXPR:
2632 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2633 break;
2634 if (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2635 break;
2636 if (TREE_CODE (type1) == ENUMERAL_TYPE
2637 && TREE_CODE (type2) == ENUMERAL_TYPE)
2638 break;
2639 if (TYPE_PTR_P (type1)
2640 && null_ptr_cst_p (args[1]))
2642 type2 = type1;
2643 break;
2645 if (null_ptr_cst_p (args[0])
2646 && TYPE_PTR_P (type2))
2648 type1 = type2;
2649 break;
2651 return;
2653 case PLUS_EXPR:
2654 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2655 break;
2656 /* FALLTHRU */
2657 case ARRAY_REF:
2658 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && TYPE_PTROB_P (type2))
2660 type1 = ptrdiff_type_node;
2661 break;
2663 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2665 type2 = ptrdiff_type_node;
2666 break;
2668 return;
2670 /* 18For every pair of promoted integral types L and R, there exist candi-
2671 date operator functions of the form
2672 LR operator%(L, R);
2673 LR operator&(L, R);
2674 LR operator^(L, R);
2675 LR operator|(L, R);
2676 L operator<<(L, R);
2677 L operator>>(L, R);
2678 where LR is the result of the usual arithmetic conversions between
2679 types L and R. */
2681 case TRUNC_MOD_EXPR:
2682 case BIT_AND_EXPR:
2683 case BIT_IOR_EXPR:
2684 case BIT_XOR_EXPR:
2685 case LSHIFT_EXPR:
2686 case RSHIFT_EXPR:
2687 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2688 break;
2689 return;
2691 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2692 type, VQ is either volatile or empty, and R is a promoted arithmetic
2693 type, there exist candidate operator functions of the form
2694 VQ L& operator=(VQ L&, R);
2695 VQ L& operator*=(VQ L&, R);
2696 VQ L& operator/=(VQ L&, R);
2697 VQ L& operator+=(VQ L&, R);
2698 VQ L& operator-=(VQ L&, R);
2700 20For every pair T, VQ), where T is any type and VQ is either volatile
2701 or empty, there exist candidate operator functions of the form
2702 T*VQ& operator=(T*VQ&, T*);
2704 21For every pair T, VQ), where T is a pointer to member type and VQ is
2705 either volatile or empty, there exist candidate operator functions of
2706 the form
2707 VQ T& operator=(VQ T&, T);
2709 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2710 unqualified complete object type, VQ is either volatile or empty, and
2711 I is a promoted integral type, there exist candidate operator func-
2712 tions of the form
2713 T*VQ& operator+=(T*VQ&, I);
2714 T*VQ& operator-=(T*VQ&, I);
2716 23For every triple L, VQ, R), where L is an integral or enumeration
2717 type, VQ is either volatile or empty, and R is a promoted integral
2718 type, there exist candidate operator functions of the form
2720 VQ L& operator%=(VQ L&, R);
2721 VQ L& operator<<=(VQ L&, R);
2722 VQ L& operator>>=(VQ L&, R);
2723 VQ L& operator&=(VQ L&, R);
2724 VQ L& operator^=(VQ L&, R);
2725 VQ L& operator|=(VQ L&, R); */
2727 case MODIFY_EXPR:
2728 switch (code2)
2730 case PLUS_EXPR:
2731 case MINUS_EXPR:
2732 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2734 type2 = ptrdiff_type_node;
2735 break;
2737 /* FALLTHRU */
2738 case MULT_EXPR:
2739 case TRUNC_DIV_EXPR:
2740 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2741 break;
2742 return;
2744 case TRUNC_MOD_EXPR:
2745 case BIT_AND_EXPR:
2746 case BIT_IOR_EXPR:
2747 case BIT_XOR_EXPR:
2748 case LSHIFT_EXPR:
2749 case RSHIFT_EXPR:
2750 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2751 break;
2752 return;
2754 case NOP_EXPR:
2755 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2756 break;
2757 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2758 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2759 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
2760 || ((TYPE_PTRMEMFUNC_P (type1)
2761 || TYPE_PTR_P (type1))
2762 && null_ptr_cst_p (args[1])))
2764 type2 = type1;
2765 break;
2767 return;
2769 default:
2770 gcc_unreachable ();
2772 type1 = build_reference_type (type1);
2773 break;
2775 case COND_EXPR:
2776 /* [over.built]
2778 For every pair of promoted arithmetic types L and R, there
2779 exist candidate operator functions of the form
2781 LR operator?(bool, L, R);
2783 where LR is the result of the usual arithmetic conversions
2784 between types L and R.
2786 For every type T, where T is a pointer or pointer-to-member
2787 type, there exist candidate operator functions of the form T
2788 operator?(bool, T, T); */
2790 if (promoted_arithmetic_type_p (type1)
2791 && promoted_arithmetic_type_p (type2))
2792 /* That's OK. */
2793 break;
2795 /* Otherwise, the types should be pointers. */
2796 if (!TYPE_PTR_OR_PTRMEM_P (type1) || !TYPE_PTR_OR_PTRMEM_P (type2))
2797 return;
2799 /* We don't check that the two types are the same; the logic
2800 below will actually create two candidates; one in which both
2801 parameter types are TYPE1, and one in which both parameter
2802 types are TYPE2. */
2803 break;
2805 case REALPART_EXPR:
2806 case IMAGPART_EXPR:
2807 if (ARITHMETIC_TYPE_P (type1))
2808 break;
2809 return;
2811 default:
2812 gcc_unreachable ();
2815 /* Make sure we don't create builtin candidates with dependent types. */
2816 bool u1 = uses_template_parms (type1);
2817 bool u2 = type2 ? uses_template_parms (type2) : false;
2818 if (u1 || u2)
2820 /* Try to recover if one of the types is non-dependent. But if
2821 there's only one type, there's nothing we can do. */
2822 if (!type2)
2823 return;
2824 /* And we lose if both are dependent. */
2825 if (u1 && u2)
2826 return;
2827 /* Or if they have different forms. */
2828 if (TREE_CODE (type1) != TREE_CODE (type2))
2829 return;
2831 if (u1 && !u2)
2832 type1 = type2;
2833 else if (u2 && !u1)
2834 type2 = type1;
2837 /* If we're dealing with two pointer types or two enumeral types,
2838 we need candidates for both of them. */
2839 if (type2 && !same_type_p (type1, type2)
2840 && TREE_CODE (type1) == TREE_CODE (type2)
2841 && (TREE_CODE (type1) == REFERENCE_TYPE
2842 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2843 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
2844 || TYPE_PTRMEMFUNC_P (type1)
2845 || MAYBE_CLASS_TYPE_P (type1)
2846 || TREE_CODE (type1) == ENUMERAL_TYPE))
2848 if (TYPE_PTR_OR_PTRMEM_P (type1))
2850 tree cptype = composite_pointer_type (type1, type2,
2851 error_mark_node,
2852 error_mark_node,
2853 CPO_CONVERSION,
2854 tf_none);
2855 if (cptype != error_mark_node)
2857 build_builtin_candidate
2858 (candidates, fnname, cptype, cptype, args, argtypes,
2859 flags, complain);
2860 return;
2864 build_builtin_candidate
2865 (candidates, fnname, type1, type1, args, argtypes, flags, complain);
2866 build_builtin_candidate
2867 (candidates, fnname, type2, type2, args, argtypes, flags, complain);
2868 return;
2871 build_builtin_candidate
2872 (candidates, fnname, type1, type2, args, argtypes, flags, complain);
2875 tree
2876 type_decays_to (tree type)
2878 if (TREE_CODE (type) == ARRAY_TYPE)
2879 return build_pointer_type (TREE_TYPE (type));
2880 if (TREE_CODE (type) == FUNCTION_TYPE)
2881 return build_pointer_type (type);
2882 return type;
2885 /* There are three conditions of builtin candidates:
2887 1) bool-taking candidates. These are the same regardless of the input.
2888 2) pointer-pair taking candidates. These are generated for each type
2889 one of the input types converts to.
2890 3) arithmetic candidates. According to the standard, we should generate
2891 all of these, but I'm trying not to...
2893 Here we generate a superset of the possible candidates for this particular
2894 case. That is a subset of the full set the standard defines, plus some
2895 other cases which the standard disallows. add_builtin_candidate will
2896 filter out the invalid set. */
2898 static void
2899 add_builtin_candidates (struct z_candidate **candidates, enum tree_code code,
2900 enum tree_code code2, tree fnname, tree *args,
2901 int flags, tsubst_flags_t complain)
2903 int ref1, i;
2904 int enum_p = 0;
2905 tree type, argtypes[3], t;
2906 /* TYPES[i] is the set of possible builtin-operator parameter types
2907 we will consider for the Ith argument. */
2908 vec<tree, va_gc> *types[2];
2909 unsigned ix;
2911 for (i = 0; i < 3; ++i)
2913 if (args[i])
2914 argtypes[i] = unlowered_expr_type (args[i]);
2915 else
2916 argtypes[i] = NULL_TREE;
2919 switch (code)
2921 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2922 and VQ is either volatile or empty, there exist candidate operator
2923 functions of the form
2924 VQ T& operator++(VQ T&); */
2926 case POSTINCREMENT_EXPR:
2927 case PREINCREMENT_EXPR:
2928 case POSTDECREMENT_EXPR:
2929 case PREDECREMENT_EXPR:
2930 case MODIFY_EXPR:
2931 ref1 = 1;
2932 break;
2934 /* 24There also exist candidate operator functions of the form
2935 bool operator!(bool);
2936 bool operator&&(bool, bool);
2937 bool operator||(bool, bool); */
2939 case TRUTH_NOT_EXPR:
2940 build_builtin_candidate
2941 (candidates, fnname, boolean_type_node,
2942 NULL_TREE, args, argtypes, flags, complain);
2943 return;
2945 case TRUTH_ORIF_EXPR:
2946 case TRUTH_ANDIF_EXPR:
2947 build_builtin_candidate
2948 (candidates, fnname, boolean_type_node,
2949 boolean_type_node, args, argtypes, flags, complain);
2950 return;
2952 case ADDR_EXPR:
2953 case COMPOUND_EXPR:
2954 case COMPONENT_REF:
2955 return;
2957 case COND_EXPR:
2958 case EQ_EXPR:
2959 case NE_EXPR:
2960 case LT_EXPR:
2961 case LE_EXPR:
2962 case GT_EXPR:
2963 case GE_EXPR:
2964 enum_p = 1;
2965 /* Fall through. */
2967 default:
2968 ref1 = 0;
2971 types[0] = make_tree_vector ();
2972 types[1] = make_tree_vector ();
2974 for (i = 0; i < 2; ++i)
2976 if (! args[i])
2978 else if (MAYBE_CLASS_TYPE_P (argtypes[i]))
2980 tree convs;
2982 if (i == 0 && code == MODIFY_EXPR && code2 == NOP_EXPR)
2983 return;
2985 convs = lookup_conversions (argtypes[i]);
2987 if (code == COND_EXPR)
2989 if (lvalue_p (args[i]))
2990 vec_safe_push (types[i], build_reference_type (argtypes[i]));
2992 vec_safe_push (types[i], TYPE_MAIN_VARIANT (argtypes[i]));
2995 else if (! convs)
2996 return;
2998 for (; convs; convs = TREE_CHAIN (convs))
3000 type = TREE_TYPE (convs);
3002 if (i == 0 && ref1
3003 && (TREE_CODE (type) != REFERENCE_TYPE
3004 || CP_TYPE_CONST_P (TREE_TYPE (type))))
3005 continue;
3007 if (code == COND_EXPR && TREE_CODE (type) == REFERENCE_TYPE)
3008 vec_safe_push (types[i], type);
3010 type = non_reference (type);
3011 if (i != 0 || ! ref1)
3013 type = cv_unqualified (type_decays_to (type));
3014 if (enum_p && TREE_CODE (type) == ENUMERAL_TYPE)
3015 vec_safe_push (types[i], type);
3016 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
3017 type = type_promotes_to (type);
3020 if (! vec_member (type, types[i]))
3021 vec_safe_push (types[i], type);
3024 else
3026 if (code == COND_EXPR && lvalue_p (args[i]))
3027 vec_safe_push (types[i], build_reference_type (argtypes[i]));
3028 type = non_reference (argtypes[i]);
3029 if (i != 0 || ! ref1)
3031 type = cv_unqualified (type_decays_to (type));
3032 if (enum_p && UNSCOPED_ENUM_P (type))
3033 vec_safe_push (types[i], type);
3034 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
3035 type = type_promotes_to (type);
3037 vec_safe_push (types[i], type);
3041 /* Run through the possible parameter types of both arguments,
3042 creating candidates with those parameter types. */
3043 FOR_EACH_VEC_ELT_REVERSE (*(types[0]), ix, t)
3045 unsigned jx;
3046 tree u;
3048 if (!types[1]->is_empty ())
3049 FOR_EACH_VEC_ELT_REVERSE (*(types[1]), jx, u)
3050 add_builtin_candidate
3051 (candidates, code, code2, fnname, t,
3052 u, args, argtypes, flags, complain);
3053 else
3054 add_builtin_candidate
3055 (candidates, code, code2, fnname, t,
3056 NULL_TREE, args, argtypes, flags, complain);
3059 release_tree_vector (types[0]);
3060 release_tree_vector (types[1]);
3064 /* If TMPL can be successfully instantiated as indicated by
3065 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3067 TMPL is the template. EXPLICIT_TARGS are any explicit template
3068 arguments. ARGLIST is the arguments provided at the call-site.
3069 This does not change ARGLIST. The RETURN_TYPE is the desired type
3070 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3071 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3072 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3074 static struct z_candidate*
3075 add_template_candidate_real (struct z_candidate **candidates, tree tmpl,
3076 tree ctype, tree explicit_targs, tree first_arg,
3077 const vec<tree, va_gc> *arglist, tree return_type,
3078 tree access_path, tree conversion_path,
3079 int flags, tree obj, unification_kind_t strict,
3080 tsubst_flags_t complain)
3082 int ntparms = DECL_NTPARMS (tmpl);
3083 tree targs = make_tree_vec (ntparms);
3084 unsigned int len = vec_safe_length (arglist);
3085 unsigned int nargs = (first_arg == NULL_TREE ? 0 : 1) + len;
3086 unsigned int skip_without_in_chrg = 0;
3087 tree first_arg_without_in_chrg = first_arg;
3088 tree *args_without_in_chrg;
3089 unsigned int nargs_without_in_chrg;
3090 unsigned int ia, ix;
3091 tree arg;
3092 struct z_candidate *cand;
3093 tree fn;
3094 struct rejection_reason *reason = NULL;
3095 int errs;
3097 /* We don't do deduction on the in-charge parameter, the VTT
3098 parameter or 'this'. */
3099 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl))
3101 if (first_arg_without_in_chrg != NULL_TREE)
3102 first_arg_without_in_chrg = NULL_TREE;
3103 else if (return_type && strict == DEDUCE_CALL)
3104 /* We're deducing for a call to the result of a template conversion
3105 function, so the args don't contain 'this'; leave them alone. */;
3106 else
3107 ++skip_without_in_chrg;
3110 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl)
3111 || DECL_BASE_CONSTRUCTOR_P (tmpl))
3112 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl)))
3114 if (first_arg_without_in_chrg != NULL_TREE)
3115 first_arg_without_in_chrg = NULL_TREE;
3116 else
3117 ++skip_without_in_chrg;
3120 if (len < skip_without_in_chrg)
3121 return NULL;
3123 if (DECL_CONSTRUCTOR_P (tmpl) && nargs == 2
3124 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg),
3125 TREE_TYPE ((*arglist)[0])))
3127 /* 12.8/6 says, "A declaration of a constructor for a class X is
3128 ill-formed if its first parameter is of type (optionally cv-qualified)
3129 X and either there are no other parameters or else all other
3130 parameters have default arguments. A member function template is never
3131 instantiated to produce such a constructor signature."
3133 So if we're trying to copy an object of the containing class, don't
3134 consider a template constructor that has a first parameter type that
3135 is just a template parameter, as we would deduce a signature that we
3136 would then reject in the code below. */
3137 if (tree firstparm = FUNCTION_FIRST_USER_PARMTYPE (tmpl))
3139 firstparm = TREE_VALUE (firstparm);
3140 if (PACK_EXPANSION_P (firstparm))
3141 firstparm = PACK_EXPANSION_PATTERN (firstparm);
3142 if (TREE_CODE (firstparm) == TEMPLATE_TYPE_PARM)
3144 gcc_assert (!explicit_targs);
3145 reason = invalid_copy_with_fn_template_rejection ();
3146 goto fail;
3151 nargs_without_in_chrg = ((first_arg_without_in_chrg != NULL_TREE ? 1 : 0)
3152 + (len - skip_without_in_chrg));
3153 args_without_in_chrg = XALLOCAVEC (tree, nargs_without_in_chrg);
3154 ia = 0;
3155 if (first_arg_without_in_chrg != NULL_TREE)
3157 args_without_in_chrg[ia] = first_arg_without_in_chrg;
3158 ++ia;
3160 for (ix = skip_without_in_chrg;
3161 vec_safe_iterate (arglist, ix, &arg);
3162 ++ix)
3164 args_without_in_chrg[ia] = arg;
3165 ++ia;
3167 gcc_assert (ia == nargs_without_in_chrg);
3169 errs = errorcount+sorrycount;
3170 fn = fn_type_unification (tmpl, explicit_targs, targs,
3171 args_without_in_chrg,
3172 nargs_without_in_chrg,
3173 return_type, strict, flags, false,
3174 complain & tf_decltype);
3176 if (fn == error_mark_node)
3178 /* Don't repeat unification later if it already resulted in errors. */
3179 if (errorcount+sorrycount == errs)
3180 reason = template_unification_rejection (tmpl, explicit_targs,
3181 targs, args_without_in_chrg,
3182 nargs_without_in_chrg,
3183 return_type, strict, flags);
3184 else
3185 reason = template_unification_error_rejection ();
3186 goto fail;
3189 if (DECL_CONSTRUCTOR_P (fn) && nargs == 2)
3191 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (fn);
3192 if (arg_types && same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types)),
3193 ctype))
3195 /* We're trying to produce a constructor with a prohibited signature,
3196 as discussed above; handle here any cases we didn't catch then,
3197 such as X(X<T>). */
3198 reason = invalid_copy_with_fn_template_rejection ();
3199 goto fail;
3203 if (obj != NULL_TREE)
3204 /* Aha, this is a conversion function. */
3205 cand = add_conv_candidate (candidates, fn, obj, arglist,
3206 access_path, conversion_path, complain);
3207 else
3208 cand = add_function_candidate (candidates, fn, ctype,
3209 first_arg, arglist, access_path,
3210 conversion_path, flags, complain);
3211 if (DECL_TI_TEMPLATE (fn) != tmpl)
3212 /* This situation can occur if a member template of a template
3213 class is specialized. Then, instantiate_template might return
3214 an instantiation of the specialization, in which case the
3215 DECL_TI_TEMPLATE field will point at the original
3216 specialization. For example:
3218 template <class T> struct S { template <class U> void f(U);
3219 template <> void f(int) {}; };
3220 S<double> sd;
3221 sd.f(3);
3223 Here, TMPL will be template <class U> S<double>::f(U).
3224 And, instantiate template will give us the specialization
3225 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3226 for this will point at template <class T> template <> S<T>::f(int),
3227 so that we can find the definition. For the purposes of
3228 overload resolution, however, we want the original TMPL. */
3229 cand->template_decl = build_template_info (tmpl, targs);
3230 else
3231 cand->template_decl = DECL_TEMPLATE_INFO (fn);
3232 cand->explicit_targs = explicit_targs;
3234 return cand;
3235 fail:
3236 return add_candidate (candidates, tmpl, first_arg, arglist, nargs, NULL,
3237 access_path, conversion_path, 0, reason, flags);
3241 static struct z_candidate *
3242 add_template_candidate (struct z_candidate **candidates, tree tmpl, tree ctype,
3243 tree explicit_targs, tree first_arg,
3244 const vec<tree, va_gc> *arglist, tree return_type,
3245 tree access_path, tree conversion_path, int flags,
3246 unification_kind_t strict, tsubst_flags_t complain)
3248 return
3249 add_template_candidate_real (candidates, tmpl, ctype,
3250 explicit_targs, first_arg, arglist,
3251 return_type, access_path, conversion_path,
3252 flags, NULL_TREE, strict, complain);
3255 /* Create an overload candidate for the conversion function template TMPL,
3256 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3257 pointer-to-function which will in turn be called with the argument list
3258 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3259 passed on to implicit_conversion. */
3261 static struct z_candidate *
3262 add_template_conv_candidate (struct z_candidate **candidates, tree tmpl,
3263 tree obj,
3264 const vec<tree, va_gc> *arglist,
3265 tree return_type, tree access_path,
3266 tree conversion_path, tsubst_flags_t complain)
3268 /* Making this work broke PR 71117, so until the committee resolves core
3269 issue 2189, let's disable this candidate if there are any viable call
3270 operators. */
3271 if (any_strictly_viable (*candidates))
3272 return NULL;
3274 return
3275 add_template_candidate_real (candidates, tmpl, NULL_TREE, NULL_TREE,
3276 NULL_TREE, arglist, return_type, access_path,
3277 conversion_path, 0, obj, DEDUCE_CALL,
3278 complain);
3281 /* The CANDS are the set of candidates that were considered for
3282 overload resolution. Return the set of viable candidates, or CANDS
3283 if none are viable. If any of the candidates were viable, set
3284 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3285 considered viable only if it is strictly viable. */
3287 static struct z_candidate*
3288 splice_viable (struct z_candidate *cands,
3289 bool strict_p,
3290 bool *any_viable_p)
3292 struct z_candidate *viable;
3293 struct z_candidate **last_viable;
3294 struct z_candidate **cand;
3295 bool found_strictly_viable = false;
3297 /* Be strict inside templates, since build_over_call won't actually
3298 do the conversions to get pedwarns. */
3299 if (processing_template_decl)
3300 strict_p = true;
3302 viable = NULL;
3303 last_viable = &viable;
3304 *any_viable_p = false;
3306 cand = &cands;
3307 while (*cand)
3309 struct z_candidate *c = *cand;
3310 if (!strict_p
3311 && (c->viable == 1 || TREE_CODE (c->fn) == TEMPLATE_DECL))
3313 /* Be strict in the presence of a viable candidate. Also if
3314 there are template candidates, so that we get deduction errors
3315 for them instead of silently preferring a bad conversion. */
3316 strict_p = true;
3317 if (viable && !found_strictly_viable)
3319 /* Put any spliced near matches back onto the main list so
3320 that we see them if there is no strict match. */
3321 *any_viable_p = false;
3322 *last_viable = cands;
3323 cands = viable;
3324 viable = NULL;
3325 last_viable = &viable;
3329 if (strict_p ? c->viable == 1 : c->viable)
3331 *last_viable = c;
3332 *cand = c->next;
3333 c->next = NULL;
3334 last_viable = &c->next;
3335 *any_viable_p = true;
3336 if (c->viable == 1)
3337 found_strictly_viable = true;
3339 else
3340 cand = &c->next;
3343 return viable ? viable : cands;
3346 static bool
3347 any_strictly_viable (struct z_candidate *cands)
3349 for (; cands; cands = cands->next)
3350 if (cands->viable == 1)
3351 return true;
3352 return false;
3355 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3356 words, it is about to become the "this" pointer for a member
3357 function call. Take the address of the object. */
3359 static tree
3360 build_this (tree obj)
3362 /* In a template, we are only concerned about the type of the
3363 expression, so we can take a shortcut. */
3364 if (processing_template_decl)
3365 return build_address (obj);
3367 return cp_build_addr_expr (obj, tf_warning_or_error);
3370 /* Returns true iff functions are equivalent. Equivalent functions are
3371 not '==' only if one is a function-local extern function or if
3372 both are extern "C". */
3374 static inline int
3375 equal_functions (tree fn1, tree fn2)
3377 if (TREE_CODE (fn1) != TREE_CODE (fn2))
3378 return 0;
3379 if (TREE_CODE (fn1) == TEMPLATE_DECL)
3380 return fn1 == fn2;
3381 if (DECL_LOCAL_FUNCTION_P (fn1) || DECL_LOCAL_FUNCTION_P (fn2)
3382 || DECL_EXTERN_C_FUNCTION_P (fn1))
3383 return decls_match (fn1, fn2);
3384 return fn1 == fn2;
3387 /* Print information about a candidate being rejected due to INFO. */
3389 static void
3390 print_conversion_rejection (location_t loc, struct conversion_info *info)
3392 tree from = info->from;
3393 if (!TYPE_P (from))
3394 from = lvalue_type (from);
3395 if (info->n_arg == -1)
3397 /* Conversion of implicit `this' argument failed. */
3398 if (!TYPE_P (info->from))
3399 /* A bad conversion for 'this' must be discarding cv-quals. */
3400 inform (loc, " passing %qT as %<this%> "
3401 "argument discards qualifiers",
3402 from);
3403 else
3404 inform (loc, " no known conversion for implicit "
3405 "%<this%> parameter from %qH to %qI",
3406 from, info->to_type);
3408 else if (!TYPE_P (info->from))
3410 if (info->n_arg >= 0)
3411 inform (loc, " conversion of argument %d would be ill-formed:",
3412 info->n_arg + 1);
3413 perform_implicit_conversion (info->to_type, info->from,
3414 tf_warning_or_error);
3416 else if (info->n_arg == -2)
3417 /* Conversion of conversion function return value failed. */
3418 inform (loc, " no known conversion from %qH to %qI",
3419 from, info->to_type);
3420 else
3421 inform (loc, " no known conversion for argument %d from %qH to %qI",
3422 info->n_arg + 1, from, info->to_type);
3425 /* Print information about a candidate with WANT parameters and we found
3426 HAVE. */
3428 static void
3429 print_arity_information (location_t loc, unsigned int have, unsigned int want)
3431 inform_n (loc, want,
3432 " candidate expects %d argument, %d provided",
3433 " candidate expects %d arguments, %d provided",
3434 want, have);
3437 /* Print information about one overload candidate CANDIDATE. MSGSTR
3438 is the text to print before the candidate itself.
3440 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3441 to have been run through gettext by the caller. This wart makes
3442 life simpler in print_z_candidates and for the translators. */
3444 static void
3445 print_z_candidate (location_t loc, const char *msgstr,
3446 struct z_candidate *candidate)
3448 const char *msg = (msgstr == NULL
3449 ? ""
3450 : ACONCAT ((msgstr, " ", NULL)));
3451 tree fn = candidate->fn;
3452 if (flag_new_inheriting_ctors)
3453 fn = strip_inheriting_ctors (fn);
3454 location_t cloc = location_of (fn);
3456 if (identifier_p (fn))
3458 cloc = loc;
3459 if (candidate->num_convs == 3)
3460 inform (cloc, "%s%<%D(%T, %T, %T)%> <built-in>", msg, fn,
3461 candidate->convs[0]->type,
3462 candidate->convs[1]->type,
3463 candidate->convs[2]->type);
3464 else if (candidate->num_convs == 2)
3465 inform (cloc, "%s%<%D(%T, %T)%> <built-in>", msg, fn,
3466 candidate->convs[0]->type,
3467 candidate->convs[1]->type);
3468 else
3469 inform (cloc, "%s%<%D(%T)%> <built-in>", msg, fn,
3470 candidate->convs[0]->type);
3472 else if (TYPE_P (fn))
3473 inform (cloc, "%s%qT <conversion>", msg, fn);
3474 else if (candidate->viable == -1)
3475 inform (cloc, "%s%#qD <near match>", msg, fn);
3476 else if (DECL_DELETED_FN (fn))
3477 inform (cloc, "%s%#qD <deleted>", msg, fn);
3478 else
3479 inform (cloc, "%s%#qD", msg, fn);
3480 if (fn != candidate->fn)
3482 cloc = location_of (candidate->fn);
3483 inform (cloc, " inherited here");
3485 /* Give the user some information about why this candidate failed. */
3486 if (candidate->reason != NULL)
3488 struct rejection_reason *r = candidate->reason;
3490 switch (r->code)
3492 case rr_arity:
3493 print_arity_information (cloc, r->u.arity.actual,
3494 r->u.arity.expected);
3495 break;
3496 case rr_arg_conversion:
3497 print_conversion_rejection (cloc, &r->u.conversion);
3498 break;
3499 case rr_bad_arg_conversion:
3500 print_conversion_rejection (cloc, &r->u.bad_conversion);
3501 break;
3502 case rr_explicit_conversion:
3503 inform (cloc, " return type %qT of explicit conversion function "
3504 "cannot be converted to %qT with a qualification "
3505 "conversion", r->u.conversion.from,
3506 r->u.conversion.to_type);
3507 break;
3508 case rr_template_conversion:
3509 inform (cloc, " conversion from return type %qT of template "
3510 "conversion function specialization to %qT is not an "
3511 "exact match", r->u.conversion.from,
3512 r->u.conversion.to_type);
3513 break;
3514 case rr_template_unification:
3515 /* We use template_unification_error_rejection if unification caused
3516 actual non-SFINAE errors, in which case we don't need to repeat
3517 them here. */
3518 if (r->u.template_unification.tmpl == NULL_TREE)
3520 inform (cloc, " substitution of deduced template arguments "
3521 "resulted in errors seen above");
3522 break;
3524 /* Re-run template unification with diagnostics. */
3525 inform (cloc, " template argument deduction/substitution failed:");
3526 fn_type_unification (r->u.template_unification.tmpl,
3527 r->u.template_unification.explicit_targs,
3528 (make_tree_vec
3529 (r->u.template_unification.num_targs)),
3530 r->u.template_unification.args,
3531 r->u.template_unification.nargs,
3532 r->u.template_unification.return_type,
3533 r->u.template_unification.strict,
3534 r->u.template_unification.flags,
3535 true, false);
3536 break;
3537 case rr_invalid_copy:
3538 inform (cloc,
3539 " a constructor taking a single argument of its own "
3540 "class type is invalid");
3541 break;
3542 case rr_constraint_failure:
3544 tree tmpl = r->u.template_instantiation.tmpl;
3545 tree args = r->u.template_instantiation.targs;
3546 diagnose_constraints (cloc, tmpl, args);
3548 break;
3549 case rr_inherited_ctor:
3550 inform (cloc, " an inherited constructor is not a candidate for "
3551 "initialization from an expression of the same or derived "
3552 "type");
3553 break;
3554 case rr_none:
3555 default:
3556 /* This candidate didn't have any issues or we failed to
3557 handle a particular code. Either way... */
3558 gcc_unreachable ();
3563 static void
3564 print_z_candidates (location_t loc, struct z_candidate *candidates)
3566 struct z_candidate *cand1;
3567 struct z_candidate **cand2;
3569 if (!candidates)
3570 return;
3572 /* Remove non-viable deleted candidates. */
3573 cand1 = candidates;
3574 for (cand2 = &cand1; *cand2; )
3576 if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL
3577 && !(*cand2)->viable
3578 && DECL_DELETED_FN ((*cand2)->fn))
3579 *cand2 = (*cand2)->next;
3580 else
3581 cand2 = &(*cand2)->next;
3583 /* ...if there are any non-deleted ones. */
3584 if (cand1)
3585 candidates = cand1;
3587 /* There may be duplicates in the set of candidates. We put off
3588 checking this condition as long as possible, since we have no way
3589 to eliminate duplicates from a set of functions in less than n^2
3590 time. Now we are about to emit an error message, so it is more
3591 permissible to go slowly. */
3592 for (cand1 = candidates; cand1; cand1 = cand1->next)
3594 tree fn = cand1->fn;
3595 /* Skip builtin candidates and conversion functions. */
3596 if (!DECL_P (fn))
3597 continue;
3598 cand2 = &cand1->next;
3599 while (*cand2)
3601 if (DECL_P ((*cand2)->fn)
3602 && equal_functions (fn, (*cand2)->fn))
3603 *cand2 = (*cand2)->next;
3604 else
3605 cand2 = &(*cand2)->next;
3609 for (; candidates; candidates = candidates->next)
3610 print_z_candidate (loc, "candidate:", candidates);
3613 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3614 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3615 the result of the conversion function to convert it to the final
3616 desired type. Merge the two sequences into a single sequence,
3617 and return the merged sequence. */
3619 static conversion *
3620 merge_conversion_sequences (conversion *user_seq, conversion *std_seq)
3622 conversion **t;
3623 bool bad = user_seq->bad_p;
3625 gcc_assert (user_seq->kind == ck_user);
3627 /* Find the end of the second conversion sequence. */
3628 for (t = &std_seq; (*t)->kind != ck_identity; t = &((*t)->u.next))
3630 /* The entire sequence is a user-conversion sequence. */
3631 (*t)->user_conv_p = true;
3632 if (bad)
3633 (*t)->bad_p = true;
3636 /* Replace the identity conversion with the user conversion
3637 sequence. */
3638 *t = user_seq;
3640 return std_seq;
3643 /* Handle overload resolution for initializing an object of class type from
3644 an initializer list. First we look for a suitable constructor that
3645 takes a std::initializer_list; if we don't find one, we then look for a
3646 non-list constructor.
3648 Parameters are as for add_candidates, except that the arguments are in
3649 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3650 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3652 static void
3653 add_list_candidates (tree fns, tree first_arg,
3654 const vec<tree, va_gc> *args, tree totype,
3655 tree explicit_targs, bool template_only,
3656 tree conversion_path, tree access_path,
3657 int flags,
3658 struct z_candidate **candidates,
3659 tsubst_flags_t complain)
3661 gcc_assert (*candidates == NULL);
3663 /* We're looking for a ctor for list-initialization. */
3664 flags |= LOOKUP_LIST_INIT_CTOR;
3665 /* And we don't allow narrowing conversions. We also use this flag to
3666 avoid the copy constructor call for copy-list-initialization. */
3667 flags |= LOOKUP_NO_NARROWING;
3669 unsigned nart = num_artificial_parms_for (OVL_FIRST (fns)) - 1;
3670 tree init_list = (*args)[nart];
3672 /* Always use the default constructor if the list is empty (DR 990). */
3673 if (CONSTRUCTOR_NELTS (init_list) == 0
3674 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
3676 /* If the class has a list ctor, try passing the list as a single
3677 argument first, but only consider list ctors. */
3678 else if (TYPE_HAS_LIST_CTOR (totype))
3680 flags |= LOOKUP_LIST_ONLY;
3681 add_candidates (fns, first_arg, args, NULL_TREE,
3682 explicit_targs, template_only, conversion_path,
3683 access_path, flags, candidates, complain);
3684 if (any_strictly_viable (*candidates))
3685 return;
3688 /* Expand the CONSTRUCTOR into a new argument vec. */
3689 vec<tree, va_gc> *new_args;
3690 vec_alloc (new_args, nart + CONSTRUCTOR_NELTS (init_list));
3691 for (unsigned i = 0; i < nart; ++i)
3692 new_args->quick_push ((*args)[i]);
3693 for (unsigned i = 0; i < CONSTRUCTOR_NELTS (init_list); ++i)
3694 new_args->quick_push (CONSTRUCTOR_ELT (init_list, i)->value);
3696 /* We aren't looking for list-ctors anymore. */
3697 flags &= ~LOOKUP_LIST_ONLY;
3698 /* We allow more user-defined conversions within an init-list. */
3699 flags &= ~LOOKUP_NO_CONVERSION;
3701 add_candidates (fns, first_arg, new_args, NULL_TREE,
3702 explicit_targs, template_only, conversion_path,
3703 access_path, flags, candidates, complain);
3706 /* Returns the best overload candidate to perform the requested
3707 conversion. This function is used for three the overloading situations
3708 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3709 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3710 per [dcl.init.ref], so we ignore temporary bindings. */
3712 static struct z_candidate *
3713 build_user_type_conversion_1 (tree totype, tree expr, int flags,
3714 tsubst_flags_t complain)
3716 struct z_candidate *candidates, *cand;
3717 tree fromtype;
3718 tree ctors = NULL_TREE;
3719 tree conv_fns = NULL_TREE;
3720 conversion *conv = NULL;
3721 tree first_arg = NULL_TREE;
3722 vec<tree, va_gc> *args = NULL;
3723 bool any_viable_p;
3724 int convflags;
3726 if (!expr)
3727 return NULL;
3729 fromtype = TREE_TYPE (expr);
3731 /* We represent conversion within a hierarchy using RVALUE_CONV and
3732 BASE_CONV, as specified by [over.best.ics]; these become plain
3733 constructor calls, as specified in [dcl.init]. */
3734 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype) || !MAYBE_CLASS_TYPE_P (totype)
3735 || !DERIVED_FROM_P (totype, fromtype));
3737 if (CLASS_TYPE_P (totype))
3738 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3739 creating a garbage BASELINK; constructors can't be inherited. */
3740 ctors = get_class_binding (totype, complete_ctor_identifier);
3742 /* FIXME P0135 doesn't say what to do in C++17 about list-initialization from
3743 a single element. For now, let's handle constructors as before and also
3744 consider conversion operators from the element. */
3745 if (cxx_dialect >= cxx17
3746 && BRACE_ENCLOSED_INITIALIZER_P (expr)
3747 && CONSTRUCTOR_NELTS (expr) == 1)
3748 fromtype = TREE_TYPE (CONSTRUCTOR_ELT (expr, 0)->value);
3750 if (MAYBE_CLASS_TYPE_P (fromtype))
3752 tree to_nonref = non_reference (totype);
3753 if (same_type_ignoring_top_level_qualifiers_p (to_nonref, fromtype) ||
3754 (CLASS_TYPE_P (to_nonref) && CLASS_TYPE_P (fromtype)
3755 && DERIVED_FROM_P (to_nonref, fromtype)))
3757 /* [class.conv.fct] A conversion function is never used to
3758 convert a (possibly cv-qualified) object to the (possibly
3759 cv-qualified) same object type (or a reference to it), to a
3760 (possibly cv-qualified) base class of that type (or a
3761 reference to it)... */
3763 else
3764 conv_fns = lookup_conversions (fromtype);
3767 candidates = 0;
3768 flags |= LOOKUP_NO_CONVERSION;
3769 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3770 flags |= LOOKUP_NO_NARROWING;
3772 /* It's OK to bind a temporary for converting constructor arguments, but
3773 not in converting the return value of a conversion operator. */
3774 convflags = ((flags & LOOKUP_NO_TEMP_BIND) | LOOKUP_NO_CONVERSION
3775 | (flags & LOOKUP_NO_NARROWING));
3776 flags &= ~LOOKUP_NO_TEMP_BIND;
3778 if (ctors)
3780 int ctorflags = flags;
3782 first_arg = build_dummy_object (totype);
3784 /* We should never try to call the abstract or base constructor
3785 from here. */
3786 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors))
3787 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors)));
3789 args = make_tree_vector_single (expr);
3790 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3792 /* List-initialization. */
3793 add_list_candidates (ctors, first_arg, args, totype, NULL_TREE,
3794 false, TYPE_BINFO (totype), TYPE_BINFO (totype),
3795 ctorflags, &candidates, complain);
3797 else
3799 add_candidates (ctors, first_arg, args, NULL_TREE, NULL_TREE, false,
3800 TYPE_BINFO (totype), TYPE_BINFO (totype),
3801 ctorflags, &candidates, complain);
3804 for (cand = candidates; cand; cand = cand->next)
3806 cand->second_conv = build_identity_conv (totype, NULL_TREE);
3808 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3809 set, then this is copy-initialization. In that case, "The
3810 result of the call is then used to direct-initialize the
3811 object that is the destination of the copy-initialization."
3812 [dcl.init]
3814 We represent this in the conversion sequence with an
3815 rvalue conversion, which means a constructor call. */
3816 if (TREE_CODE (totype) != REFERENCE_TYPE
3817 && !(convflags & LOOKUP_NO_TEMP_BIND))
3818 cand->second_conv
3819 = build_conv (ck_rvalue, totype, cand->second_conv);
3823 if (conv_fns)
3825 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3826 /* FIXME see above about C++17. */
3827 first_arg = CONSTRUCTOR_ELT (expr, 0)->value;
3828 else
3829 first_arg = expr;
3832 for (; conv_fns; conv_fns = TREE_CHAIN (conv_fns))
3834 tree conversion_path = TREE_PURPOSE (conv_fns);
3835 struct z_candidate *old_candidates;
3837 /* If we are called to convert to a reference type, we are trying to
3838 find a direct binding, so don't even consider temporaries. If
3839 we don't find a direct binding, the caller will try again to
3840 look for a temporary binding. */
3841 if (TREE_CODE (totype) == REFERENCE_TYPE)
3842 convflags |= LOOKUP_NO_TEMP_BIND;
3844 old_candidates = candidates;
3845 add_candidates (TREE_VALUE (conv_fns), first_arg, NULL, totype,
3846 NULL_TREE, false,
3847 conversion_path, TYPE_BINFO (fromtype),
3848 flags, &candidates, complain);
3850 for (cand = candidates; cand != old_candidates; cand = cand->next)
3852 tree rettype = TREE_TYPE (TREE_TYPE (cand->fn));
3853 conversion *ics
3854 = implicit_conversion (totype,
3855 rettype,
3857 /*c_cast_p=*/false, convflags,
3858 complain);
3860 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3861 copy-initialization. In that case, "The result of the
3862 call is then used to direct-initialize the object that is
3863 the destination of the copy-initialization." [dcl.init]
3865 We represent this in the conversion sequence with an
3866 rvalue conversion, which means a constructor call. But
3867 don't add a second rvalue conversion if there's already
3868 one there. Which there really shouldn't be, but it's
3869 harmless since we'd add it here anyway. */
3870 if (ics && MAYBE_CLASS_TYPE_P (totype) && ics->kind != ck_rvalue
3871 && !(convflags & LOOKUP_NO_TEMP_BIND))
3872 ics = build_conv (ck_rvalue, totype, ics);
3874 cand->second_conv = ics;
3876 if (!ics)
3878 cand->viable = 0;
3879 cand->reason = arg_conversion_rejection (NULL_TREE, -2,
3880 rettype, totype);
3882 else if (DECL_NONCONVERTING_P (cand->fn)
3883 && ics->rank > cr_exact)
3885 /* 13.3.1.5: For direct-initialization, those explicit
3886 conversion functions that are not hidden within S and
3887 yield type T or a type that can be converted to type T
3888 with a qualification conversion (4.4) are also candidate
3889 functions. */
3890 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3891 I've raised this issue with the committee. --jason 9/2011 */
3892 cand->viable = -1;
3893 cand->reason = explicit_conversion_rejection (rettype, totype);
3895 else if (cand->viable == 1 && ics->bad_p)
3897 cand->viable = -1;
3898 cand->reason
3899 = bad_arg_conversion_rejection (NULL_TREE, -2,
3900 rettype, totype);
3902 else if (primary_template_specialization_p (cand->fn)
3903 && ics->rank > cr_exact)
3905 /* 13.3.3.1.2: If the user-defined conversion is specified by
3906 a specialization of a conversion function template, the
3907 second standard conversion sequence shall have exact match
3908 rank. */
3909 cand->viable = -1;
3910 cand->reason = template_conversion_rejection (rettype, totype);
3915 candidates = splice_viable (candidates, false, &any_viable_p);
3916 if (!any_viable_p)
3918 if (args)
3919 release_tree_vector (args);
3920 return NULL;
3923 cand = tourney (candidates, complain);
3924 if (cand == 0)
3926 if (complain & tf_error)
3928 error ("conversion from %qH to %qI is ambiguous",
3929 fromtype, totype);
3930 print_z_candidates (location_of (expr), candidates);
3933 cand = candidates; /* any one will do */
3934 cand->second_conv = build_ambiguous_conv (totype, expr);
3935 cand->second_conv->user_conv_p = true;
3936 if (!any_strictly_viable (candidates))
3937 cand->second_conv->bad_p = true;
3938 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3939 ambiguous conversion is no worse than another user-defined
3940 conversion. */
3942 return cand;
3945 tree convtype;
3946 if (!DECL_CONSTRUCTOR_P (cand->fn))
3947 convtype = non_reference (TREE_TYPE (TREE_TYPE (cand->fn)));
3948 else if (cand->second_conv->kind == ck_rvalue)
3949 /* DR 5: [in the first step of copy-initialization]...if the function
3950 is a constructor, the call initializes a temporary of the
3951 cv-unqualified version of the destination type. */
3952 convtype = cv_unqualified (totype);
3953 else
3954 convtype = totype;
3955 /* Build the user conversion sequence. */
3956 conv = build_conv
3957 (ck_user,
3958 convtype,
3959 build_identity_conv (TREE_TYPE (expr), expr));
3960 conv->cand = cand;
3961 if (cand->viable == -1)
3962 conv->bad_p = true;
3964 /* Remember that this was a list-initialization. */
3965 if (flags & LOOKUP_NO_NARROWING)
3966 conv->check_narrowing = true;
3968 /* Combine it with the second conversion sequence. */
3969 cand->second_conv = merge_conversion_sequences (conv,
3970 cand->second_conv);
3972 return cand;
3975 /* Wrapper for above. */
3977 tree
3978 build_user_type_conversion (tree totype, tree expr, int flags,
3979 tsubst_flags_t complain)
3981 struct z_candidate *cand;
3982 tree ret;
3984 bool subtime = timevar_cond_start (TV_OVERLOAD);
3985 cand = build_user_type_conversion_1 (totype, expr, flags, complain);
3987 if (cand)
3989 if (cand->second_conv->kind == ck_ambig)
3990 ret = error_mark_node;
3991 else
3993 expr = convert_like (cand->second_conv, expr, complain);
3994 ret = convert_from_reference (expr);
3997 else
3998 ret = NULL_TREE;
4000 timevar_cond_stop (TV_OVERLOAD, subtime);
4001 return ret;
4004 /* Subroutine of convert_nontype_argument.
4006 EXPR is an expression used in a context that requires a converted
4007 constant-expression, such as a template non-type parameter. Do any
4008 necessary conversions (that are permitted for converted
4009 constant-expressions) to convert it to the desired type.
4011 If conversion is successful, returns the converted expression;
4012 otherwise, returns error_mark_node. */
4014 tree
4015 build_converted_constant_expr (tree type, tree expr, tsubst_flags_t complain)
4017 conversion *conv;
4018 void *p;
4019 tree t;
4020 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
4022 if (error_operand_p (expr))
4023 return error_mark_node;
4025 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4026 p = conversion_obstack_alloc (0);
4028 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
4029 /*c_cast_p=*/false,
4030 LOOKUP_IMPLICIT, complain);
4032 /* A converted constant expression of type T is an expression, implicitly
4033 converted to type T, where the converted expression is a constant
4034 expression and the implicit conversion sequence contains only
4036 * user-defined conversions,
4037 * lvalue-to-rvalue conversions (7.1),
4038 * array-to-pointer conversions (7.2),
4039 * function-to-pointer conversions (7.3),
4040 * qualification conversions (7.5),
4041 * integral promotions (7.6),
4042 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4043 * null pointer conversions (7.11) from std::nullptr_t,
4044 * null member pointer conversions (7.12) from std::nullptr_t, and
4045 * function pointer conversions (7.13),
4047 and where the reference binding (if any) binds directly. */
4049 for (conversion *c = conv;
4050 conv && c->kind != ck_identity;
4051 c = next_conversion (c))
4053 switch (c->kind)
4055 /* A conversion function is OK. If it isn't constexpr, we'll
4056 complain later that the argument isn't constant. */
4057 case ck_user:
4058 /* The lvalue-to-rvalue conversion is OK. */
4059 case ck_rvalue:
4060 /* Array-to-pointer and function-to-pointer. */
4061 case ck_lvalue:
4062 /* Function pointer conversions. */
4063 case ck_fnptr:
4064 /* Qualification conversions. */
4065 case ck_qual:
4066 break;
4068 case ck_ref_bind:
4069 if (c->need_temporary_p)
4071 if (complain & tf_error)
4072 error_at (loc, "initializing %qH with %qI in converted "
4073 "constant expression does not bind directly",
4074 type, next_conversion (c)->type);
4075 conv = NULL;
4077 break;
4079 case ck_base:
4080 case ck_pmem:
4081 case ck_ptr:
4082 case ck_std:
4083 t = next_conversion (c)->type;
4084 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t)
4085 && INTEGRAL_OR_ENUMERATION_TYPE_P (type))
4086 /* Integral promotion or conversion. */
4087 break;
4088 if (NULLPTR_TYPE_P (t))
4089 /* Conversion from nullptr to pointer or pointer-to-member. */
4090 break;
4092 if (complain & tf_error)
4093 error_at (loc, "conversion from %qH to %qI in a "
4094 "converted constant expression", t, type);
4095 /* fall through. */
4097 default:
4098 conv = NULL;
4099 break;
4103 /* Avoid confusing convert_nontype_argument by introducing
4104 a redundant conversion to the same reference type. */
4105 if (conv && conv->kind == ck_ref_bind
4106 && REFERENCE_REF_P (expr))
4108 tree ref = TREE_OPERAND (expr, 0);
4109 if (same_type_p (type, TREE_TYPE (ref)))
4110 return ref;
4113 if (conv)
4114 expr = convert_like (conv, expr, complain);
4115 else
4116 expr = error_mark_node;
4118 /* Free all the conversions we allocated. */
4119 obstack_free (&conversion_obstack, p);
4121 return expr;
4124 /* Do any initial processing on the arguments to a function call. */
4126 static vec<tree, va_gc> *
4127 resolve_args (vec<tree, va_gc> *args, tsubst_flags_t complain)
4129 unsigned int ix;
4130 tree arg;
4132 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
4134 if (error_operand_p (arg))
4135 return NULL;
4136 else if (VOID_TYPE_P (TREE_TYPE (arg)))
4138 if (complain & tf_error)
4139 error ("invalid use of void expression");
4140 return NULL;
4142 else if (invalid_nonstatic_memfn_p (input_location, arg, complain))
4143 return NULL;
4145 return args;
4148 /* Perform overload resolution on FN, which is called with the ARGS.
4150 Return the candidate function selected by overload resolution, or
4151 NULL if the event that overload resolution failed. In the case
4152 that overload resolution fails, *CANDIDATES will be the set of
4153 candidates considered, and ANY_VIABLE_P will be set to true or
4154 false to indicate whether or not any of the candidates were
4155 viable.
4157 The ARGS should already have gone through RESOLVE_ARGS before this
4158 function is called. */
4160 static struct z_candidate *
4161 perform_overload_resolution (tree fn,
4162 const vec<tree, va_gc> *args,
4163 struct z_candidate **candidates,
4164 bool *any_viable_p, tsubst_flags_t complain)
4166 struct z_candidate *cand;
4167 tree explicit_targs;
4168 int template_only;
4170 bool subtime = timevar_cond_start (TV_OVERLOAD);
4172 explicit_targs = NULL_TREE;
4173 template_only = 0;
4175 *candidates = NULL;
4176 *any_viable_p = true;
4178 /* Check FN. */
4179 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
4180 || TREE_CODE (fn) == TEMPLATE_DECL
4181 || TREE_CODE (fn) == OVERLOAD
4182 || TREE_CODE (fn) == TEMPLATE_ID_EXPR);
4184 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4186 explicit_targs = TREE_OPERAND (fn, 1);
4187 fn = TREE_OPERAND (fn, 0);
4188 template_only = 1;
4191 /* Add the various candidate functions. */
4192 add_candidates (fn, NULL_TREE, args, NULL_TREE,
4193 explicit_targs, template_only,
4194 /*conversion_path=*/NULL_TREE,
4195 /*access_path=*/NULL_TREE,
4196 LOOKUP_NORMAL,
4197 candidates, complain);
4199 *candidates = splice_viable (*candidates, false, any_viable_p);
4200 if (*any_viable_p)
4201 cand = tourney (*candidates, complain);
4202 else
4203 cand = NULL;
4205 timevar_cond_stop (TV_OVERLOAD, subtime);
4206 return cand;
4209 /* Print an error message about being unable to build a call to FN with
4210 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4211 be located; CANDIDATES is a possibly empty list of such
4212 functions. */
4214 static void
4215 print_error_for_call_failure (tree fn, vec<tree, va_gc> *args,
4216 struct z_candidate *candidates)
4218 tree targs = NULL_TREE;
4219 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4221 targs = TREE_OPERAND (fn, 1);
4222 fn = TREE_OPERAND (fn, 0);
4224 tree name = OVL_NAME (fn);
4225 location_t loc = location_of (name);
4226 if (targs)
4227 name = lookup_template_function (name, targs);
4229 if (!any_strictly_viable (candidates))
4230 error_at (loc, "no matching function for call to %<%D(%A)%>",
4231 name, build_tree_list_vec (args));
4232 else
4233 error_at (loc, "call of overloaded %<%D(%A)%> is ambiguous",
4234 name, build_tree_list_vec (args));
4235 if (candidates)
4236 print_z_candidates (loc, candidates);
4239 /* Return an expression for a call to FN (a namespace-scope function,
4240 or a static member function) with the ARGS. This may change
4241 ARGS. */
4243 tree
4244 build_new_function_call (tree fn, vec<tree, va_gc> **args,
4245 tsubst_flags_t complain)
4247 struct z_candidate *candidates, *cand;
4248 bool any_viable_p;
4249 void *p;
4250 tree result;
4252 if (args != NULL && *args != NULL)
4254 *args = resolve_args (*args, complain);
4255 if (*args == NULL)
4256 return error_mark_node;
4259 if (flag_tm)
4260 tm_malloc_replacement (fn);
4262 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4263 p = conversion_obstack_alloc (0);
4265 cand = perform_overload_resolution (fn, *args, &candidates, &any_viable_p,
4266 complain);
4268 if (!cand)
4270 if (complain & tf_error)
4272 // If there is a single (non-viable) function candidate,
4273 // let the error be diagnosed by cp_build_function_call_vec.
4274 if (!any_viable_p && candidates && ! candidates->next
4275 && (TREE_CODE (candidates->fn) == FUNCTION_DECL))
4276 return cp_build_function_call_vec (candidates->fn, args, complain);
4278 // Otherwise, emit notes for non-viable candidates.
4279 print_error_for_call_failure (fn, *args, candidates);
4281 result = error_mark_node;
4283 else
4285 int flags = LOOKUP_NORMAL;
4286 /* If fn is template_id_expr, the call has explicit template arguments
4287 (e.g. func<int>(5)), communicate this info to build_over_call
4288 through flags so that later we can use it to decide whether to warn
4289 about peculiar null pointer conversion. */
4290 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4292 /* If overload resolution selects a specialization of a
4293 function concept for non-dependent template arguments,
4294 the expression is true if the constraints are satisfied
4295 and false otherwise.
4297 NOTE: This is an extension of Concepts Lite TS that
4298 allows constraints to be used in expressions. */
4299 if (flag_concepts && !processing_template_decl)
4301 tree tmpl = DECL_TI_TEMPLATE (cand->fn);
4302 tree targs = DECL_TI_ARGS (cand->fn);
4303 tree decl = DECL_TEMPLATE_RESULT (tmpl);
4304 if (DECL_DECLARED_CONCEPT_P (decl))
4305 return evaluate_function_concept (decl, targs);
4308 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
4311 result = build_over_call (cand, flags, complain);
4314 /* Free all the conversions we allocated. */
4315 obstack_free (&conversion_obstack, p);
4317 return result;
4320 /* Build a call to a global operator new. FNNAME is the name of the
4321 operator (either "operator new" or "operator new[]") and ARGS are
4322 the arguments provided. This may change ARGS. *SIZE points to the
4323 total number of bytes required by the allocation, and is updated if
4324 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4325 be used. If this function determines that no cookie should be
4326 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4327 is not NULL_TREE, it is evaluated before calculating the final
4328 array size, and if it fails, the array size is replaced with
4329 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4330 is non-NULL, it will be set, upon return, to the allocation
4331 function called. */
4333 tree
4334 build_operator_new_call (tree fnname, vec<tree, va_gc> **args,
4335 tree *size, tree *cookie_size,
4336 tree align_arg, tree size_check,
4337 tree *fn, tsubst_flags_t complain)
4339 tree original_size = *size;
4340 tree fns;
4341 struct z_candidate *candidates;
4342 struct z_candidate *cand = NULL;
4343 bool any_viable_p;
4345 if (fn)
4346 *fn = NULL_TREE;
4347 /* Set to (size_t)-1 if the size check fails. */
4348 if (size_check != NULL_TREE)
4350 tree errval = TYPE_MAX_VALUE (sizetype);
4351 if (cxx_dialect >= cxx11 && flag_exceptions)
4352 errval = throw_bad_array_new_length ();
4353 *size = fold_build3 (COND_EXPR, sizetype, size_check,
4354 original_size, errval);
4356 vec_safe_insert (*args, 0, *size);
4357 *args = resolve_args (*args, complain);
4358 if (*args == NULL)
4359 return error_mark_node;
4361 /* Based on:
4363 [expr.new]
4365 If this lookup fails to find the name, or if the allocated type
4366 is not a class type, the allocation function's name is looked
4367 up in the global scope.
4369 we disregard block-scope declarations of "operator new". */
4370 fns = lookup_name_real (fnname, 0, 1, /*block_p=*/false, 0, 0);
4371 fns = lookup_arg_dependent (fnname, fns, *args);
4373 if (align_arg)
4375 vec<tree, va_gc>* align_args
4376 = vec_copy_and_insert (*args, align_arg, 1);
4377 cand = perform_overload_resolution (fns, align_args, &candidates,
4378 &any_viable_p, tf_none);
4379 if (cand)
4380 *args = align_args;
4381 /* If no aligned allocation function matches, try again without the
4382 alignment. */
4385 /* Figure out what function is being called. */
4386 if (!cand)
4387 cand = perform_overload_resolution (fns, *args, &candidates, &any_viable_p,
4388 complain);
4390 /* If no suitable function could be found, issue an error message
4391 and give up. */
4392 if (!cand)
4394 if (complain & tf_error)
4395 print_error_for_call_failure (fns, *args, candidates);
4396 return error_mark_node;
4399 /* If a cookie is required, add some extra space. Whether
4400 or not a cookie is required cannot be determined until
4401 after we know which function was called. */
4402 if (*cookie_size)
4404 bool use_cookie = true;
4405 tree arg_types;
4407 arg_types = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
4408 /* Skip the size_t parameter. */
4409 arg_types = TREE_CHAIN (arg_types);
4410 /* Check the remaining parameters (if any). */
4411 if (arg_types
4412 && TREE_CHAIN (arg_types) == void_list_node
4413 && same_type_p (TREE_VALUE (arg_types),
4414 ptr_type_node))
4415 use_cookie = false;
4416 /* If we need a cookie, adjust the number of bytes allocated. */
4417 if (use_cookie)
4419 /* Update the total size. */
4420 *size = size_binop (PLUS_EXPR, original_size, *cookie_size);
4421 if (size_check)
4423 /* Set to (size_t)-1 if the size check fails. */
4424 gcc_assert (size_check != NULL_TREE);
4425 *size = fold_build3 (COND_EXPR, sizetype, size_check,
4426 *size, TYPE_MAX_VALUE (sizetype));
4428 /* Update the argument list to reflect the adjusted size. */
4429 (**args)[0] = *size;
4431 else
4432 *cookie_size = NULL_TREE;
4435 /* Tell our caller which function we decided to call. */
4436 if (fn)
4437 *fn = cand->fn;
4439 /* Build the CALL_EXPR. */
4440 return build_over_call (cand, LOOKUP_NORMAL, complain);
4443 /* Build a new call to operator(). This may change ARGS. */
4445 static tree
4446 build_op_call_1 (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
4448 struct z_candidate *candidates = 0, *cand;
4449 tree fns, convs, first_mem_arg = NULL_TREE;
4450 bool any_viable_p;
4451 tree result = NULL_TREE;
4452 void *p;
4454 obj = mark_lvalue_use (obj);
4456 if (error_operand_p (obj))
4457 return error_mark_node;
4459 tree type = TREE_TYPE (obj);
4461 obj = prep_operand (obj);
4463 if (TYPE_PTRMEMFUNC_P (type))
4465 if (complain & tf_error)
4466 /* It's no good looking for an overloaded operator() on a
4467 pointer-to-member-function. */
4468 error ("pointer-to-member function %qE cannot be called without "
4469 "an object; consider using %<.*%> or %<->*%>", obj);
4470 return error_mark_node;
4473 if (TYPE_BINFO (type))
4475 fns = lookup_fnfields (TYPE_BINFO (type), call_op_identifier, 1);
4476 if (fns == error_mark_node)
4477 return error_mark_node;
4479 else
4480 fns = NULL_TREE;
4482 if (args != NULL && *args != NULL)
4484 *args = resolve_args (*args, complain);
4485 if (*args == NULL)
4486 return error_mark_node;
4489 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4490 p = conversion_obstack_alloc (0);
4492 if (fns)
4494 first_mem_arg = obj;
4496 add_candidates (BASELINK_FUNCTIONS (fns),
4497 first_mem_arg, *args, NULL_TREE,
4498 NULL_TREE, false,
4499 BASELINK_BINFO (fns), BASELINK_ACCESS_BINFO (fns),
4500 LOOKUP_NORMAL, &candidates, complain);
4503 convs = lookup_conversions (type);
4505 for (; convs; convs = TREE_CHAIN (convs))
4507 tree totype = TREE_TYPE (convs);
4509 if (TYPE_PTRFN_P (totype)
4510 || TYPE_REFFN_P (totype)
4511 || (TREE_CODE (totype) == REFERENCE_TYPE
4512 && TYPE_PTRFN_P (TREE_TYPE (totype))))
4513 for (ovl_iterator iter (TREE_VALUE (convs)); iter; ++iter)
4515 tree fn = *iter;
4517 if (DECL_NONCONVERTING_P (fn))
4518 continue;
4520 if (TREE_CODE (fn) == TEMPLATE_DECL)
4521 add_template_conv_candidate
4522 (&candidates, fn, obj, *args, totype,
4523 /*access_path=*/NULL_TREE,
4524 /*conversion_path=*/NULL_TREE, complain);
4525 else
4526 add_conv_candidate (&candidates, fn, obj,
4527 *args, /*conversion_path=*/NULL_TREE,
4528 /*access_path=*/NULL_TREE, complain);
4532 /* Be strict here because if we choose a bad conversion candidate, the
4533 errors we get won't mention the call context. */
4534 candidates = splice_viable (candidates, true, &any_viable_p);
4535 if (!any_viable_p)
4537 if (complain & tf_error)
4539 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj),
4540 build_tree_list_vec (*args));
4541 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4543 result = error_mark_node;
4545 else
4547 cand = tourney (candidates, complain);
4548 if (cand == 0)
4550 if (complain & tf_error)
4552 error ("call of %<(%T) (%A)%> is ambiguous",
4553 TREE_TYPE (obj), build_tree_list_vec (*args));
4554 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4556 result = error_mark_node;
4558 else if (TREE_CODE (cand->fn) == FUNCTION_DECL
4559 && DECL_OVERLOADED_OPERATOR_P (cand->fn)
4560 && DECL_OVERLOADED_OPERATOR_IS (cand->fn, CALL_EXPR))
4561 result = build_over_call (cand, LOOKUP_NORMAL, complain);
4562 else
4564 if (TREE_CODE (cand->fn) == FUNCTION_DECL)
4565 obj = convert_like_with_context (cand->convs[0], obj, cand->fn,
4566 -1, complain);
4567 else
4569 gcc_checking_assert (TYPE_P (cand->fn));
4570 obj = convert_like (cand->convs[0], obj, complain);
4572 obj = convert_from_reference (obj);
4573 result = cp_build_function_call_vec (obj, args, complain);
4577 /* Free all the conversions we allocated. */
4578 obstack_free (&conversion_obstack, p);
4580 return result;
4583 /* Wrapper for above. */
4585 tree
4586 build_op_call (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
4588 tree ret;
4589 bool subtime = timevar_cond_start (TV_OVERLOAD);
4590 ret = build_op_call_1 (obj, args, complain);
4591 timevar_cond_stop (TV_OVERLOAD, subtime);
4592 return ret;
4595 /* Called by op_error to prepare format strings suitable for the error
4596 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4597 and a suffix (controlled by NTYPES). */
4599 static const char *
4600 op_error_string (const char *errmsg, int ntypes, bool match)
4602 const char *msg;
4604 const char *msgp = concat (match ? G_("ambiguous overload for ")
4605 : G_("no match for "), errmsg, NULL);
4607 if (ntypes == 3)
4608 msg = concat (msgp, G_(" (operand types are %qT, %qT, and %qT)"), NULL);
4609 else if (ntypes == 2)
4610 msg = concat (msgp, G_(" (operand types are %qT and %qT)"), NULL);
4611 else
4612 msg = concat (msgp, G_(" (operand type is %qT)"), NULL);
4614 return msg;
4617 static void
4618 op_error (location_t loc, enum tree_code code, enum tree_code code2,
4619 tree arg1, tree arg2, tree arg3, bool match)
4621 bool assop = code == MODIFY_EXPR;
4622 const char *opname = OVL_OP_INFO (assop, assop ? code2 : code)->name;
4624 switch (code)
4626 case COND_EXPR:
4627 if (flag_diagnostics_show_caret)
4628 error_at (loc, op_error_string (G_("ternary %<operator?:%>"),
4629 3, match),
4630 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
4631 else
4632 error_at (loc, op_error_string (G_("ternary %<operator?:%> "
4633 "in %<%E ? %E : %E%>"), 3, match),
4634 arg1, arg2, arg3,
4635 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
4636 break;
4638 case POSTINCREMENT_EXPR:
4639 case POSTDECREMENT_EXPR:
4640 if (flag_diagnostics_show_caret)
4641 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
4642 opname, TREE_TYPE (arg1));
4643 else
4644 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4645 1, match),
4646 opname, arg1, opname, TREE_TYPE (arg1));
4647 break;
4649 case ARRAY_REF:
4650 if (flag_diagnostics_show_caret)
4651 error_at (loc, op_error_string (G_("%<operator[]%>"), 2, match),
4652 TREE_TYPE (arg1), TREE_TYPE (arg2));
4653 else
4654 error_at (loc, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4655 2, match),
4656 arg1, arg2, TREE_TYPE (arg1), TREE_TYPE (arg2));
4657 break;
4659 case REALPART_EXPR:
4660 case IMAGPART_EXPR:
4661 if (flag_diagnostics_show_caret)
4662 error_at (loc, op_error_string (G_("%qs"), 1, match),
4663 opname, TREE_TYPE (arg1));
4664 else
4665 error_at (loc, op_error_string (G_("%qs in %<%s %E%>"), 1, match),
4666 opname, opname, arg1, TREE_TYPE (arg1));
4667 break;
4669 default:
4670 if (arg2)
4671 if (flag_diagnostics_show_caret)
4672 error_at (loc, op_error_string (G_("%<operator%s%>"), 2, match),
4673 opname, TREE_TYPE (arg1), TREE_TYPE (arg2));
4674 else
4675 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4676 2, match),
4677 opname, arg1, opname, arg2,
4678 TREE_TYPE (arg1), TREE_TYPE (arg2));
4679 else
4680 if (flag_diagnostics_show_caret)
4681 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
4682 opname, TREE_TYPE (arg1));
4683 else
4684 error_at (loc, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4685 1, match),
4686 opname, opname, arg1, TREE_TYPE (arg1));
4687 break;
4691 /* Return the implicit conversion sequence that could be used to
4692 convert E1 to E2 in [expr.cond]. */
4694 static conversion *
4695 conditional_conversion (tree e1, tree e2, tsubst_flags_t complain)
4697 tree t1 = non_reference (TREE_TYPE (e1));
4698 tree t2 = non_reference (TREE_TYPE (e2));
4699 conversion *conv;
4700 bool good_base;
4702 /* [expr.cond]
4704 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4705 implicitly converted (clause _conv_) to the type "lvalue reference to
4706 T2", subject to the constraint that in the conversion the
4707 reference must bind directly (_dcl.init.ref_) to an lvalue.
4709 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4710 implicitly converted to the type "rvalue reference to T2", subject to
4711 the constraint that the reference must bind directly. */
4712 if (glvalue_p (e2))
4714 tree rtype = cp_build_reference_type (t2, !lvalue_p (e2));
4715 conv = implicit_conversion (rtype,
4718 /*c_cast_p=*/false,
4719 LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND
4720 |LOOKUP_ONLYCONVERTING,
4721 complain);
4722 if (conv && !conv->bad_p)
4723 return conv;
4726 /* If E2 is a prvalue or if neither of the conversions above can be done
4727 and at least one of the operands has (possibly cv-qualified) class
4728 type: */
4729 if (!CLASS_TYPE_P (t1) && !CLASS_TYPE_P (t2))
4730 return NULL;
4732 /* [expr.cond]
4734 If E1 and E2 have class type, and the underlying class types are
4735 the same or one is a base class of the other: E1 can be converted
4736 to match E2 if the class of T2 is the same type as, or a base
4737 class of, the class of T1, and the cv-qualification of T2 is the
4738 same cv-qualification as, or a greater cv-qualification than, the
4739 cv-qualification of T1. If the conversion is applied, E1 is
4740 changed to an rvalue of type T2 that still refers to the original
4741 source class object (or the appropriate subobject thereof). */
4742 if (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
4743 && ((good_base = DERIVED_FROM_P (t2, t1)) || DERIVED_FROM_P (t1, t2)))
4745 if (good_base && at_least_as_qualified_p (t2, t1))
4747 conv = build_identity_conv (t1, e1);
4748 if (!same_type_p (TYPE_MAIN_VARIANT (t1),
4749 TYPE_MAIN_VARIANT (t2)))
4750 conv = build_conv (ck_base, t2, conv);
4751 else
4752 conv = build_conv (ck_rvalue, t2, conv);
4753 return conv;
4755 else
4756 return NULL;
4758 else
4759 /* [expr.cond]
4761 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4762 converted to the type that expression E2 would have if E2 were
4763 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4764 return implicit_conversion (t2, t1, e1, /*c_cast_p=*/false,
4765 LOOKUP_IMPLICIT, complain);
4768 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4769 arguments to the conditional expression. */
4771 static tree
4772 build_conditional_expr_1 (location_t loc, tree arg1, tree arg2, tree arg3,
4773 tsubst_flags_t complain)
4775 tree arg2_type;
4776 tree arg3_type;
4777 tree result = NULL_TREE;
4778 tree result_type = NULL_TREE;
4779 bool is_lvalue = true;
4780 struct z_candidate *candidates = 0;
4781 struct z_candidate *cand;
4782 void *p;
4783 tree orig_arg2, orig_arg3;
4785 /* As a G++ extension, the second argument to the conditional can be
4786 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4787 c'.) If the second operand is omitted, make sure it is
4788 calculated only once. */
4789 if (!arg2)
4791 if (complain & tf_error)
4792 pedwarn (loc, OPT_Wpedantic,
4793 "ISO C++ forbids omitting the middle term of a ?: expression");
4795 if ((complain & tf_warning) && !truth_value_p (TREE_CODE (arg1)))
4796 warn_for_omitted_condop (loc, arg1);
4798 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4799 if (lvalue_p (arg1))
4800 arg2 = arg1 = cp_stabilize_reference (arg1);
4801 else
4802 arg2 = arg1 = save_expr (arg1);
4805 /* If something has already gone wrong, just pass that fact up the
4806 tree. */
4807 if (error_operand_p (arg1)
4808 || error_operand_p (arg2)
4809 || error_operand_p (arg3))
4810 return error_mark_node;
4812 orig_arg2 = arg2;
4813 orig_arg3 = arg3;
4815 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1)))
4817 tree arg1_type = TREE_TYPE (arg1);
4819 /* If arg1 is another cond_expr choosing between -1 and 0,
4820 then we can use its comparison. It may help to avoid
4821 additional comparison, produce more accurate diagnostics
4822 and enables folding. */
4823 if (TREE_CODE (arg1) == VEC_COND_EXPR
4824 && integer_minus_onep (TREE_OPERAND (arg1, 1))
4825 && integer_zerop (TREE_OPERAND (arg1, 2)))
4826 arg1 = TREE_OPERAND (arg1, 0);
4828 arg1 = force_rvalue (arg1, complain);
4829 arg2 = force_rvalue (arg2, complain);
4830 arg3 = force_rvalue (arg3, complain);
4832 /* force_rvalue can return error_mark on valid arguments. */
4833 if (error_operand_p (arg1)
4834 || error_operand_p (arg2)
4835 || error_operand_p (arg3))
4836 return error_mark_node;
4838 arg2_type = TREE_TYPE (arg2);
4839 arg3_type = TREE_TYPE (arg3);
4841 if (!VECTOR_TYPE_P (arg2_type)
4842 && !VECTOR_TYPE_P (arg3_type))
4844 /* Rely on the error messages of the scalar version. */
4845 tree scal = build_conditional_expr_1 (loc, integer_one_node,
4846 orig_arg2, orig_arg3, complain);
4847 if (scal == error_mark_node)
4848 return error_mark_node;
4849 tree stype = TREE_TYPE (scal);
4850 tree ctype = TREE_TYPE (arg1_type);
4851 if (TYPE_SIZE (stype) != TYPE_SIZE (ctype)
4852 || (!INTEGRAL_TYPE_P (stype) && !SCALAR_FLOAT_TYPE_P (stype)))
4854 if (complain & tf_error)
4855 error_at (loc, "inferred scalar type %qT is not an integer or "
4856 "floating point type of the same size as %qT", stype,
4857 COMPARISON_CLASS_P (arg1)
4858 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1, 0)))
4859 : ctype);
4860 return error_mark_node;
4863 tree vtype = build_opaque_vector_type (stype,
4864 TYPE_VECTOR_SUBPARTS (arg1_type));
4865 /* We could pass complain & tf_warning to unsafe_conversion_p,
4866 but the warnings (like Wsign-conversion) have already been
4867 given by the scalar build_conditional_expr_1. We still check
4868 unsafe_conversion_p to forbid truncating long long -> float. */
4869 if (unsafe_conversion_p (loc, stype, arg2, NULL_TREE, false))
4871 if (complain & tf_error)
4872 error_at (loc, "conversion of scalar %qH to vector %qI "
4873 "involves truncation", arg2_type, vtype);
4874 return error_mark_node;
4876 if (unsafe_conversion_p (loc, stype, arg3, NULL_TREE, false))
4878 if (complain & tf_error)
4879 error_at (loc, "conversion of scalar %qH to vector %qI "
4880 "involves truncation", arg3_type, vtype);
4881 return error_mark_node;
4884 arg2 = cp_convert (stype, arg2, complain);
4885 arg2 = save_expr (arg2);
4886 arg2 = build_vector_from_val (vtype, arg2);
4887 arg2_type = vtype;
4888 arg3 = cp_convert (stype, arg3, complain);
4889 arg3 = save_expr (arg3);
4890 arg3 = build_vector_from_val (vtype, arg3);
4891 arg3_type = vtype;
4894 if (VECTOR_TYPE_P (arg2_type) != VECTOR_TYPE_P (arg3_type))
4896 enum stv_conv convert_flag =
4897 scalar_to_vector (loc, VEC_COND_EXPR, arg2, arg3,
4898 complain & tf_error);
4900 switch (convert_flag)
4902 case stv_error:
4903 return error_mark_node;
4904 case stv_firstarg:
4906 arg2 = save_expr (arg2);
4907 arg2 = convert (TREE_TYPE (arg3_type), arg2);
4908 arg2 = build_vector_from_val (arg3_type, arg2);
4909 arg2_type = TREE_TYPE (arg2);
4910 break;
4912 case stv_secondarg:
4914 arg3 = save_expr (arg3);
4915 arg3 = convert (TREE_TYPE (arg2_type), arg3);
4916 arg3 = build_vector_from_val (arg2_type, arg3);
4917 arg3_type = TREE_TYPE (arg3);
4918 break;
4920 default:
4921 break;
4925 if (!same_type_p (arg2_type, arg3_type)
4926 || maybe_ne (TYPE_VECTOR_SUBPARTS (arg1_type),
4927 TYPE_VECTOR_SUBPARTS (arg2_type))
4928 || TYPE_SIZE (arg1_type) != TYPE_SIZE (arg2_type))
4930 if (complain & tf_error)
4931 error_at (loc,
4932 "incompatible vector types in conditional expression: "
4933 "%qT, %qT and %qT", TREE_TYPE (arg1),
4934 TREE_TYPE (orig_arg2), TREE_TYPE (orig_arg3));
4935 return error_mark_node;
4938 if (!COMPARISON_CLASS_P (arg1))
4940 tree cmp_type = build_same_sized_truth_vector_type (arg1_type);
4941 arg1 = build2 (NE_EXPR, cmp_type, arg1, build_zero_cst (arg1_type));
4943 return build3_loc (loc, VEC_COND_EXPR, arg2_type, arg1, arg2, arg3);
4946 /* [expr.cond]
4948 The first expression is implicitly converted to bool (clause
4949 _conv_). */
4950 arg1 = perform_implicit_conversion_flags (boolean_type_node, arg1, complain,
4951 LOOKUP_NORMAL);
4952 if (error_operand_p (arg1))
4953 return error_mark_node;
4955 /* [expr.cond]
4957 If either the second or the third operand has type (possibly
4958 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4959 array-to-pointer (_conv.array_), and function-to-pointer
4960 (_conv.func_) standard conversions are performed on the second
4961 and third operands. */
4962 arg2_type = unlowered_expr_type (arg2);
4963 arg3_type = unlowered_expr_type (arg3);
4964 if (VOID_TYPE_P (arg2_type) || VOID_TYPE_P (arg3_type))
4966 /* Do the conversions. We don't these for `void' type arguments
4967 since it can't have any effect and since decay_conversion
4968 does not handle that case gracefully. */
4969 if (!VOID_TYPE_P (arg2_type))
4970 arg2 = decay_conversion (arg2, complain);
4971 if (!VOID_TYPE_P (arg3_type))
4972 arg3 = decay_conversion (arg3, complain);
4973 arg2_type = TREE_TYPE (arg2);
4974 arg3_type = TREE_TYPE (arg3);
4976 /* [expr.cond]
4978 One of the following shall hold:
4980 --The second or the third operand (but not both) is a
4981 throw-expression (_except.throw_); the result is of the
4982 type of the other and is an rvalue.
4984 --Both the second and the third operands have type void; the
4985 result is of type void and is an rvalue.
4987 We must avoid calling force_rvalue for expressions of type
4988 "void" because it will complain that their value is being
4989 used. */
4990 if (TREE_CODE (arg2) == THROW_EXPR
4991 && TREE_CODE (arg3) != THROW_EXPR)
4993 if (!VOID_TYPE_P (arg3_type))
4995 arg3 = force_rvalue (arg3, complain);
4996 if (arg3 == error_mark_node)
4997 return error_mark_node;
4999 arg3_type = TREE_TYPE (arg3);
5000 result_type = arg3_type;
5002 else if (TREE_CODE (arg2) != THROW_EXPR
5003 && TREE_CODE (arg3) == THROW_EXPR)
5005 if (!VOID_TYPE_P (arg2_type))
5007 arg2 = force_rvalue (arg2, complain);
5008 if (arg2 == error_mark_node)
5009 return error_mark_node;
5011 arg2_type = TREE_TYPE (arg2);
5012 result_type = arg2_type;
5014 else if (VOID_TYPE_P (arg2_type) && VOID_TYPE_P (arg3_type))
5015 result_type = void_type_node;
5016 else
5018 if (complain & tf_error)
5020 if (VOID_TYPE_P (arg2_type))
5021 error_at (EXPR_LOC_OR_LOC (arg3, loc),
5022 "second operand to the conditional operator "
5023 "is of type %<void%>, but the third operand is "
5024 "neither a throw-expression nor of type %<void%>");
5025 else
5026 error_at (EXPR_LOC_OR_LOC (arg2, loc),
5027 "third operand to the conditional operator "
5028 "is of type %<void%>, but the second operand is "
5029 "neither a throw-expression nor of type %<void%>");
5031 return error_mark_node;
5034 is_lvalue = false;
5035 goto valid_operands;
5037 /* [expr.cond]
5039 Otherwise, if the second and third operand have different types,
5040 and either has (possibly cv-qualified) class type, or if both are
5041 glvalues of the same value category and the same type except for
5042 cv-qualification, an attempt is made to convert each of those operands
5043 to the type of the other. */
5044 else if (!same_type_p (arg2_type, arg3_type)
5045 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)
5046 || (same_type_ignoring_top_level_qualifiers_p (arg2_type,
5047 arg3_type)
5048 && glvalue_p (arg2) && glvalue_p (arg3)
5049 && lvalue_p (arg2) == lvalue_p (arg3))))
5051 conversion *conv2;
5052 conversion *conv3;
5053 bool converted = false;
5055 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5056 p = conversion_obstack_alloc (0);
5058 conv2 = conditional_conversion (arg2, arg3, complain);
5059 conv3 = conditional_conversion (arg3, arg2, complain);
5061 /* [expr.cond]
5063 If both can be converted, or one can be converted but the
5064 conversion is ambiguous, the program is ill-formed. If
5065 neither can be converted, the operands are left unchanged and
5066 further checking is performed as described below. If exactly
5067 one conversion is possible, that conversion is applied to the
5068 chosen operand and the converted operand is used in place of
5069 the original operand for the remainder of this section. */
5070 if ((conv2 && !conv2->bad_p
5071 && conv3 && !conv3->bad_p)
5072 || (conv2 && conv2->kind == ck_ambig)
5073 || (conv3 && conv3->kind == ck_ambig))
5075 if (complain & tf_error)
5077 error_at (loc, "operands to ?: have different types %qT and %qT",
5078 arg2_type, arg3_type);
5079 if (conv2 && !conv2->bad_p && conv3 && !conv3->bad_p)
5080 inform (loc, " and each type can be converted to the other");
5081 else if (conv2 && conv2->kind == ck_ambig)
5082 convert_like (conv2, arg2, complain);
5083 else
5084 convert_like (conv3, arg3, complain);
5086 result = error_mark_node;
5088 else if (conv2 && !conv2->bad_p)
5090 arg2 = convert_like (conv2, arg2, complain);
5091 arg2 = convert_from_reference (arg2);
5092 arg2_type = TREE_TYPE (arg2);
5093 /* Even if CONV2 is a valid conversion, the result of the
5094 conversion may be invalid. For example, if ARG3 has type
5095 "volatile X", and X does not have a copy constructor
5096 accepting a "volatile X&", then even if ARG2 can be
5097 converted to X, the conversion will fail. */
5098 if (error_operand_p (arg2))
5099 result = error_mark_node;
5100 converted = true;
5102 else if (conv3 && !conv3->bad_p)
5104 arg3 = convert_like (conv3, arg3, complain);
5105 arg3 = convert_from_reference (arg3);
5106 arg3_type = TREE_TYPE (arg3);
5107 if (error_operand_p (arg3))
5108 result = error_mark_node;
5109 converted = true;
5112 /* Free all the conversions we allocated. */
5113 obstack_free (&conversion_obstack, p);
5115 if (result)
5116 return result;
5118 /* If, after the conversion, both operands have class type,
5119 treat the cv-qualification of both operands as if it were the
5120 union of the cv-qualification of the operands.
5122 The standard is not clear about what to do in this
5123 circumstance. For example, if the first operand has type
5124 "const X" and the second operand has a user-defined
5125 conversion to "volatile X", what is the type of the second
5126 operand after this step? Making it be "const X" (matching
5127 the first operand) seems wrong, as that discards the
5128 qualification without actually performing a copy. Leaving it
5129 as "volatile X" seems wrong as that will result in the
5130 conditional expression failing altogether, even though,
5131 according to this step, the one operand could be converted to
5132 the type of the other. */
5133 if (converted
5134 && CLASS_TYPE_P (arg2_type)
5135 && cp_type_quals (arg2_type) != cp_type_quals (arg3_type))
5136 arg2_type = arg3_type =
5137 cp_build_qualified_type (arg2_type,
5138 cp_type_quals (arg2_type)
5139 | cp_type_quals (arg3_type));
5142 /* [expr.cond]
5144 If the second and third operands are glvalues of the same value
5145 category and have the same type, the result is of that type and
5146 value category. */
5147 if (((lvalue_p (arg2) && lvalue_p (arg3))
5148 || (xvalue_p (arg2) && xvalue_p (arg3)))
5149 && same_type_p (arg2_type, arg3_type))
5151 result_type = arg2_type;
5152 arg2 = mark_lvalue_use (arg2);
5153 arg3 = mark_lvalue_use (arg3);
5154 goto valid_operands;
5157 /* [expr.cond]
5159 Otherwise, the result is an rvalue. If the second and third
5160 operand do not have the same type, and either has (possibly
5161 cv-qualified) class type, overload resolution is used to
5162 determine the conversions (if any) to be applied to the operands
5163 (_over.match.oper_, _over.built_). */
5164 is_lvalue = false;
5165 if (!same_type_p (arg2_type, arg3_type)
5166 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
5168 tree args[3];
5169 conversion *conv;
5170 bool any_viable_p;
5172 /* Rearrange the arguments so that add_builtin_candidate only has
5173 to know about two args. In build_builtin_candidate, the
5174 arguments are unscrambled. */
5175 args[0] = arg2;
5176 args[1] = arg3;
5177 args[2] = arg1;
5178 add_builtin_candidates (&candidates,
5179 COND_EXPR,
5180 NOP_EXPR,
5181 ovl_op_identifier (false, COND_EXPR),
5182 args,
5183 LOOKUP_NORMAL, complain);
5185 /* [expr.cond]
5187 If the overload resolution fails, the program is
5188 ill-formed. */
5189 candidates = splice_viable (candidates, false, &any_viable_p);
5190 if (!any_viable_p)
5192 if (complain & tf_error)
5193 error_at (loc, "operands to ?: have different types %qT and %qT",
5194 arg2_type, arg3_type);
5195 return error_mark_node;
5197 cand = tourney (candidates, complain);
5198 if (!cand)
5200 if (complain & tf_error)
5202 op_error (loc, COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE);
5203 print_z_candidates (loc, candidates);
5205 return error_mark_node;
5208 /* [expr.cond]
5210 Otherwise, the conversions thus determined are applied, and
5211 the converted operands are used in place of the original
5212 operands for the remainder of this section. */
5213 conv = cand->convs[0];
5214 arg1 = convert_like (conv, arg1, complain);
5215 conv = cand->convs[1];
5216 arg2 = convert_like (conv, arg2, complain);
5217 arg2_type = TREE_TYPE (arg2);
5218 conv = cand->convs[2];
5219 arg3 = convert_like (conv, arg3, complain);
5220 arg3_type = TREE_TYPE (arg3);
5223 /* [expr.cond]
5225 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5226 and function-to-pointer (_conv.func_) standard conversions are
5227 performed on the second and third operands.
5229 We need to force the lvalue-to-rvalue conversion here for class types,
5230 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5231 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5232 regions. */
5234 arg2 = force_rvalue (arg2, complain);
5235 if (!CLASS_TYPE_P (arg2_type))
5236 arg2_type = TREE_TYPE (arg2);
5238 arg3 = force_rvalue (arg3, complain);
5239 if (!CLASS_TYPE_P (arg3_type))
5240 arg3_type = TREE_TYPE (arg3);
5242 if (arg2 == error_mark_node || arg3 == error_mark_node)
5243 return error_mark_node;
5245 /* [expr.cond]
5247 After those conversions, one of the following shall hold:
5249 --The second and third operands have the same type; the result is of
5250 that type. */
5251 if (same_type_p (arg2_type, arg3_type))
5252 result_type = arg2_type;
5253 /* [expr.cond]
5255 --The second and third operands have arithmetic or enumeration
5256 type; the usual arithmetic conversions are performed to bring
5257 them to a common type, and the result is of that type. */
5258 else if ((ARITHMETIC_TYPE_P (arg2_type)
5259 || UNSCOPED_ENUM_P (arg2_type))
5260 && (ARITHMETIC_TYPE_P (arg3_type)
5261 || UNSCOPED_ENUM_P (arg3_type)))
5263 /* In this case, there is always a common type. */
5264 result_type = type_after_usual_arithmetic_conversions (arg2_type,
5265 arg3_type);
5266 if (complain & tf_warning)
5267 do_warn_double_promotion (result_type, arg2_type, arg3_type,
5268 "implicit conversion from %qH to %qI to "
5269 "match other result of conditional",
5270 loc);
5272 if (TREE_CODE (arg2_type) == ENUMERAL_TYPE
5273 && TREE_CODE (arg3_type) == ENUMERAL_TYPE)
5275 if (TREE_CODE (orig_arg2) == CONST_DECL
5276 && TREE_CODE (orig_arg3) == CONST_DECL
5277 && DECL_CONTEXT (orig_arg2) == DECL_CONTEXT (orig_arg3))
5278 /* Two enumerators from the same enumeration can have different
5279 types when the enumeration is still being defined. */;
5280 else if (complain & tf_warning)
5281 warning_at (loc, OPT_Wenum_compare, "enumeral mismatch in "
5282 "conditional expression: %qT vs %qT",
5283 arg2_type, arg3_type);
5285 else if (extra_warnings
5286 && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE
5287 && !same_type_p (arg3_type, type_promotes_to (arg2_type)))
5288 || (TREE_CODE (arg3_type) == ENUMERAL_TYPE
5289 && !same_type_p (arg2_type,
5290 type_promotes_to (arg3_type)))))
5292 if (complain & tf_warning)
5293 warning_at (loc, OPT_Wextra, "enumeral and non-enumeral type in "
5294 "conditional expression");
5297 arg2 = perform_implicit_conversion (result_type, arg2, complain);
5298 arg3 = perform_implicit_conversion (result_type, arg3, complain);
5300 /* [expr.cond]
5302 --The second and third operands have pointer type, or one has
5303 pointer type and the other is a null pointer constant; pointer
5304 conversions (_conv.ptr_) and qualification conversions
5305 (_conv.qual_) are performed to bring them to their composite
5306 pointer type (_expr.rel_). The result is of the composite
5307 pointer type.
5309 --The second and third operands have pointer to member type, or
5310 one has pointer to member type and the other is a null pointer
5311 constant; pointer to member conversions (_conv.mem_) and
5312 qualification conversions (_conv.qual_) are performed to bring
5313 them to a common type, whose cv-qualification shall match the
5314 cv-qualification of either the second or the third operand.
5315 The result is of the common type. */
5316 else if ((null_ptr_cst_p (arg2)
5317 && TYPE_PTR_OR_PTRMEM_P (arg3_type))
5318 || (null_ptr_cst_p (arg3)
5319 && TYPE_PTR_OR_PTRMEM_P (arg2_type))
5320 || (TYPE_PTR_P (arg2_type) && TYPE_PTR_P (arg3_type))
5321 || (TYPE_PTRDATAMEM_P (arg2_type) && TYPE_PTRDATAMEM_P (arg3_type))
5322 || (TYPE_PTRMEMFUNC_P (arg2_type) && TYPE_PTRMEMFUNC_P (arg3_type)))
5324 result_type = composite_pointer_type (arg2_type, arg3_type, arg2,
5325 arg3, CPO_CONDITIONAL_EXPR,
5326 complain);
5327 if (result_type == error_mark_node)
5328 return error_mark_node;
5329 arg2 = perform_implicit_conversion (result_type, arg2, complain);
5330 arg3 = perform_implicit_conversion (result_type, arg3, complain);
5333 if (!result_type)
5335 if (complain & tf_error)
5336 error_at (loc, "operands to ?: have different types %qT and %qT",
5337 arg2_type, arg3_type);
5338 return error_mark_node;
5341 if (arg2 == error_mark_node || arg3 == error_mark_node)
5342 return error_mark_node;
5344 valid_operands:
5345 result = build3_loc (loc, COND_EXPR, result_type, arg1, arg2, arg3);
5347 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5348 warn here, because the COND_EXPR will be turned into ARG2. */
5349 if (warn_duplicated_branches
5350 && (complain & tf_warning)
5351 && (arg2 == arg3 || operand_equal_p (arg2, arg3, 0)))
5352 warning_at (EXPR_LOCATION (result), OPT_Wduplicated_branches,
5353 "this condition has identical branches");
5355 /* We can't use result_type below, as fold might have returned a
5356 throw_expr. */
5358 if (!is_lvalue)
5360 /* Expand both sides into the same slot, hopefully the target of
5361 the ?: expression. We used to check for TARGET_EXPRs here,
5362 but now we sometimes wrap them in NOP_EXPRs so the test would
5363 fail. */
5364 if (CLASS_TYPE_P (TREE_TYPE (result)))
5365 result = get_target_expr_sfinae (result, complain);
5366 /* If this expression is an rvalue, but might be mistaken for an
5367 lvalue, we must add a NON_LVALUE_EXPR. */
5368 result = rvalue (result);
5370 else
5371 result = force_paren_expr (result);
5373 return result;
5376 /* Wrapper for above. */
5378 tree
5379 build_conditional_expr (location_t loc, tree arg1, tree arg2, tree arg3,
5380 tsubst_flags_t complain)
5382 tree ret;
5383 bool subtime = timevar_cond_start (TV_OVERLOAD);
5384 ret = build_conditional_expr_1 (loc, arg1, arg2, arg3, complain);
5385 timevar_cond_stop (TV_OVERLOAD, subtime);
5386 return ret;
5389 /* OPERAND is an operand to an expression. Perform necessary steps
5390 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5391 returned. */
5393 static tree
5394 prep_operand (tree operand)
5396 if (operand)
5398 if (CLASS_TYPE_P (TREE_TYPE (operand))
5399 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand)))
5400 /* Make sure the template type is instantiated now. */
5401 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand)));
5404 return operand;
5407 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5408 OVERLOAD) to the CANDIDATES, returning an updated list of
5409 CANDIDATES. The ARGS are the arguments provided to the call;
5410 if FIRST_ARG is non-null it is the implicit object argument,
5411 otherwise the first element of ARGS is used if needed. The
5412 EXPLICIT_TARGS are explicit template arguments provided.
5413 TEMPLATE_ONLY is true if only template functions should be
5414 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5415 add_function_candidate. */
5417 static void
5418 add_candidates (tree fns, tree first_arg, const vec<tree, va_gc> *args,
5419 tree return_type,
5420 tree explicit_targs, bool template_only,
5421 tree conversion_path, tree access_path,
5422 int flags,
5423 struct z_candidate **candidates,
5424 tsubst_flags_t complain)
5426 tree ctype;
5427 const vec<tree, va_gc> *non_static_args;
5428 bool check_list_ctor = false;
5429 bool check_converting = false;
5430 unification_kind_t strict;
5432 if (!fns)
5433 return;
5435 /* Precalculate special handling of constructors and conversion ops. */
5436 tree fn = OVL_FIRST (fns);
5437 if (DECL_CONV_FN_P (fn))
5439 check_list_ctor = false;
5440 check_converting = (flags & LOOKUP_ONLYCONVERTING) != 0;
5441 if (flags & LOOKUP_NO_CONVERSION)
5442 /* We're doing return_type(x). */
5443 strict = DEDUCE_CONV;
5444 else
5445 /* We're doing x.operator return_type(). */
5446 strict = DEDUCE_EXACT;
5447 /* [over.match.funcs] For conversion functions, the function
5448 is considered to be a member of the class of the implicit
5449 object argument for the purpose of defining the type of
5450 the implicit object parameter. */
5451 ctype = TYPE_MAIN_VARIANT (TREE_TYPE (first_arg));
5453 else
5455 if (DECL_CONSTRUCTOR_P (fn))
5457 check_list_ctor = (flags & LOOKUP_LIST_ONLY) != 0;
5458 /* For list-initialization we consider explicit constructors
5459 and complain if one is chosen. */
5460 check_converting
5461 = ((flags & (LOOKUP_ONLYCONVERTING|LOOKUP_LIST_INIT_CTOR))
5462 == LOOKUP_ONLYCONVERTING);
5464 strict = DEDUCE_CALL;
5465 ctype = conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE;
5468 if (first_arg)
5469 non_static_args = args;
5470 else
5471 /* Delay creating the implicit this parameter until it is needed. */
5472 non_static_args = NULL;
5474 for (lkp_iterator iter (fns); iter; ++iter)
5476 fn = *iter;
5478 if (check_converting && DECL_NONCONVERTING_P (fn))
5479 continue;
5480 if (check_list_ctor && !is_list_ctor (fn))
5481 continue;
5483 tree fn_first_arg = NULL_TREE;
5484 const vec<tree, va_gc> *fn_args = args;
5486 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
5488 /* Figure out where the object arg comes from. If this
5489 function is a non-static member and we didn't get an
5490 implicit object argument, move it out of args. */
5491 if (first_arg == NULL_TREE)
5493 unsigned int ix;
5494 tree arg;
5495 vec<tree, va_gc> *tempvec;
5496 vec_alloc (tempvec, args->length () - 1);
5497 for (ix = 1; args->iterate (ix, &arg); ++ix)
5498 tempvec->quick_push (arg);
5499 non_static_args = tempvec;
5500 first_arg = (*args)[0];
5503 fn_first_arg = first_arg;
5504 fn_args = non_static_args;
5507 if (TREE_CODE (fn) == TEMPLATE_DECL)
5508 add_template_candidate (candidates,
5510 ctype,
5511 explicit_targs,
5512 fn_first_arg,
5513 fn_args,
5514 return_type,
5515 access_path,
5516 conversion_path,
5517 flags,
5518 strict,
5519 complain);
5520 else if (!template_only)
5521 add_function_candidate (candidates,
5523 ctype,
5524 fn_first_arg,
5525 fn_args,
5526 access_path,
5527 conversion_path,
5528 flags,
5529 complain);
5533 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5534 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5536 static int
5537 op_is_ordered (tree_code code)
5539 switch (code)
5541 // 5. b @= a
5542 case MODIFY_EXPR:
5543 return (flag_strong_eval_order > 1 ? -1 : 0);
5545 // 6. a[b]
5546 case ARRAY_REF:
5547 return (flag_strong_eval_order > 1 ? 1 : 0);
5549 // 1. a.b
5550 // Not overloadable (yet).
5551 // 2. a->b
5552 // Only one argument.
5553 // 3. a->*b
5554 case MEMBER_REF:
5555 // 7. a << b
5556 case LSHIFT_EXPR:
5557 // 8. a >> b
5558 case RSHIFT_EXPR:
5559 return (flag_strong_eval_order ? 1 : 0);
5561 default:
5562 return 0;
5566 static tree
5567 build_new_op_1 (location_t loc, enum tree_code code, int flags, tree arg1,
5568 tree arg2, tree arg3, tree *overload, tsubst_flags_t complain)
5570 struct z_candidate *candidates = 0, *cand;
5571 vec<tree, va_gc> *arglist;
5572 tree args[3];
5573 tree result = NULL_TREE;
5574 bool result_valid_p = false;
5575 enum tree_code code2 = NOP_EXPR;
5576 enum tree_code code_orig_arg1 = ERROR_MARK;
5577 enum tree_code code_orig_arg2 = ERROR_MARK;
5578 conversion *conv;
5579 void *p;
5580 bool strict_p;
5581 bool any_viable_p;
5583 if (error_operand_p (arg1)
5584 || error_operand_p (arg2)
5585 || error_operand_p (arg3))
5586 return error_mark_node;
5588 bool ismodop = code == MODIFY_EXPR;
5589 if (ismodop)
5591 code2 = TREE_CODE (arg3);
5592 arg3 = NULL_TREE;
5594 tree fnname = ovl_op_identifier (ismodop, ismodop ? code2 : code);
5596 arg1 = prep_operand (arg1);
5598 bool memonly = false;
5599 switch (code)
5601 case NEW_EXPR:
5602 case VEC_NEW_EXPR:
5603 case VEC_DELETE_EXPR:
5604 case DELETE_EXPR:
5605 /* Use build_op_new_call and build_op_delete_call instead. */
5606 gcc_unreachable ();
5608 case CALL_EXPR:
5609 /* Use build_op_call instead. */
5610 gcc_unreachable ();
5612 case TRUTH_ORIF_EXPR:
5613 case TRUTH_ANDIF_EXPR:
5614 case TRUTH_AND_EXPR:
5615 case TRUTH_OR_EXPR:
5616 /* These are saved for the sake of warn_logical_operator. */
5617 code_orig_arg1 = TREE_CODE (arg1);
5618 code_orig_arg2 = TREE_CODE (arg2);
5619 break;
5620 case GT_EXPR:
5621 case LT_EXPR:
5622 case GE_EXPR:
5623 case LE_EXPR:
5624 case EQ_EXPR:
5625 case NE_EXPR:
5626 /* These are saved for the sake of maybe_warn_bool_compare. */
5627 code_orig_arg1 = TREE_CODE (TREE_TYPE (arg1));
5628 code_orig_arg2 = TREE_CODE (TREE_TYPE (arg2));
5629 break;
5631 /* =, ->, [], () must be non-static member functions. */
5632 case MODIFY_EXPR:
5633 if (code2 != NOP_EXPR)
5634 break;
5635 /* FALLTHRU */
5636 case COMPONENT_REF:
5637 case ARRAY_REF:
5638 memonly = true;
5639 break;
5641 default:
5642 break;
5645 arg2 = prep_operand (arg2);
5646 arg3 = prep_operand (arg3);
5648 if (code == COND_EXPR)
5649 /* Use build_conditional_expr instead. */
5650 gcc_unreachable ();
5651 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1))
5652 && (! arg2 || ! OVERLOAD_TYPE_P (TREE_TYPE (arg2))))
5653 goto builtin;
5655 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
5656 arg2 = integer_zero_node;
5658 vec_alloc (arglist, 3);
5659 arglist->quick_push (arg1);
5660 if (arg2 != NULL_TREE)
5661 arglist->quick_push (arg2);
5662 if (arg3 != NULL_TREE)
5663 arglist->quick_push (arg3);
5665 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5666 p = conversion_obstack_alloc (0);
5668 /* Add namespace-scope operators to the list of functions to
5669 consider. */
5670 if (!memonly)
5672 tree fns = lookup_name_real (fnname, 0, 1, /*block_p=*/true, 0, 0);
5673 fns = lookup_arg_dependent (fnname, fns, arglist);
5674 add_candidates (fns, NULL_TREE, arglist, NULL_TREE,
5675 NULL_TREE, false, NULL_TREE, NULL_TREE,
5676 flags, &candidates, complain);
5679 args[0] = arg1;
5680 args[1] = arg2;
5681 args[2] = NULL_TREE;
5683 /* Add class-member operators to the candidate set. */
5684 if (CLASS_TYPE_P (TREE_TYPE (arg1)))
5686 tree fns;
5688 fns = lookup_fnfields (TREE_TYPE (arg1), fnname, 1);
5689 if (fns == error_mark_node)
5691 result = error_mark_node;
5692 goto user_defined_result_ready;
5694 if (fns)
5695 add_candidates (BASELINK_FUNCTIONS (fns),
5696 NULL_TREE, arglist, NULL_TREE,
5697 NULL_TREE, false,
5698 BASELINK_BINFO (fns),
5699 BASELINK_ACCESS_BINFO (fns),
5700 flags, &candidates, complain);
5702 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5703 only non-member functions that have type T1 or reference to
5704 cv-qualified-opt T1 for the first argument, if the first argument
5705 has an enumeration type, or T2 or reference to cv-qualified-opt
5706 T2 for the second argument, if the second argument has an
5707 enumeration type. Filter out those that don't match. */
5708 else if (! arg2 || ! CLASS_TYPE_P (TREE_TYPE (arg2)))
5710 struct z_candidate **candp, **next;
5712 for (candp = &candidates; *candp; candp = next)
5714 tree parmlist, parmtype;
5715 int i, nargs = (arg2 ? 2 : 1);
5717 cand = *candp;
5718 next = &cand->next;
5720 parmlist = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
5722 for (i = 0; i < nargs; ++i)
5724 parmtype = TREE_VALUE (parmlist);
5726 if (TREE_CODE (parmtype) == REFERENCE_TYPE)
5727 parmtype = TREE_TYPE (parmtype);
5728 if (TREE_CODE (TREE_TYPE (args[i])) == ENUMERAL_TYPE
5729 && (same_type_ignoring_top_level_qualifiers_p
5730 (TREE_TYPE (args[i]), parmtype)))
5731 break;
5733 parmlist = TREE_CHAIN (parmlist);
5736 /* No argument has an appropriate type, so remove this
5737 candidate function from the list. */
5738 if (i == nargs)
5740 *candp = cand->next;
5741 next = candp;
5746 add_builtin_candidates (&candidates, code, code2, fnname, args,
5747 flags, complain);
5749 switch (code)
5751 case COMPOUND_EXPR:
5752 case ADDR_EXPR:
5753 /* For these, the built-in candidates set is empty
5754 [over.match.oper]/3. We don't want non-strict matches
5755 because exact matches are always possible with built-in
5756 operators. The built-in candidate set for COMPONENT_REF
5757 would be empty too, but since there are no such built-in
5758 operators, we accept non-strict matches for them. */
5759 strict_p = true;
5760 break;
5762 default:
5763 strict_p = false;
5764 break;
5767 candidates = splice_viable (candidates, strict_p, &any_viable_p);
5768 if (!any_viable_p)
5770 switch (code)
5772 case POSTINCREMENT_EXPR:
5773 case POSTDECREMENT_EXPR:
5774 /* Don't try anything fancy if we're not allowed to produce
5775 errors. */
5776 if (!(complain & tf_error))
5777 return error_mark_node;
5779 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5780 distinguish between prefix and postfix ++ and
5781 operator++() was used for both, so we allow this with
5782 -fpermissive. */
5783 else
5785 const char *msg = (flag_permissive)
5786 ? G_("no %<%D(int)%> declared for postfix %qs,"
5787 " trying prefix operator instead")
5788 : G_("no %<%D(int)%> declared for postfix %qs");
5789 permerror (loc, msg, fnname, OVL_OP_INFO (false, code)->name);
5792 if (!flag_permissive)
5793 return error_mark_node;
5795 if (code == POSTINCREMENT_EXPR)
5796 code = PREINCREMENT_EXPR;
5797 else
5798 code = PREDECREMENT_EXPR;
5799 result = build_new_op_1 (loc, code, flags, arg1, NULL_TREE,
5800 NULL_TREE, overload, complain);
5801 break;
5803 /* The caller will deal with these. */
5804 case ADDR_EXPR:
5805 case COMPOUND_EXPR:
5806 case COMPONENT_REF:
5807 result = NULL_TREE;
5808 result_valid_p = true;
5809 break;
5811 default:
5812 if (complain & tf_error)
5814 /* If one of the arguments of the operator represents
5815 an invalid use of member function pointer, try to report
5816 a meaningful error ... */
5817 if (invalid_nonstatic_memfn_p (loc, arg1, tf_error)
5818 || invalid_nonstatic_memfn_p (loc, arg2, tf_error)
5819 || invalid_nonstatic_memfn_p (loc, arg3, tf_error))
5820 /* We displayed the error message. */;
5821 else
5823 /* ... Otherwise, report the more generic
5824 "no matching operator found" error */
5825 op_error (loc, code, code2, arg1, arg2, arg3, FALSE);
5826 print_z_candidates (loc, candidates);
5829 result = error_mark_node;
5830 break;
5833 else
5835 cand = tourney (candidates, complain);
5836 if (cand == 0)
5838 if (complain & tf_error)
5840 op_error (loc, code, code2, arg1, arg2, arg3, TRUE);
5841 print_z_candidates (loc, candidates);
5843 result = error_mark_node;
5845 else if (TREE_CODE (cand->fn) == FUNCTION_DECL)
5847 if (overload)
5848 *overload = cand->fn;
5850 if (resolve_args (arglist, complain) == NULL)
5851 result = error_mark_node;
5852 else
5853 result = build_over_call (cand, LOOKUP_NORMAL, complain);
5855 if (trivial_fn_p (cand->fn))
5856 /* There won't be a CALL_EXPR. */;
5857 else if (result && result != error_mark_node)
5859 tree call = extract_call_expr (result);
5860 CALL_EXPR_OPERATOR_SYNTAX (call) = true;
5862 if (processing_template_decl && DECL_HIDDEN_FRIEND_P (cand->fn))
5863 /* This prevents build_new_function_call from discarding this
5864 function during instantiation of the enclosing template. */
5865 KOENIG_LOOKUP_P (call) = 1;
5867 /* Specify evaluation order as per P0145R2. */
5868 CALL_EXPR_ORDERED_ARGS (call) = false;
5869 switch (op_is_ordered (code))
5871 case -1:
5872 CALL_EXPR_REVERSE_ARGS (call) = true;
5873 break;
5875 case 1:
5876 CALL_EXPR_ORDERED_ARGS (call) = true;
5877 break;
5879 default:
5880 break;
5884 else
5886 /* Give any warnings we noticed during overload resolution. */
5887 if (cand->warnings && (complain & tf_warning))
5889 struct candidate_warning *w;
5890 for (w = cand->warnings; w; w = w->next)
5891 joust (cand, w->loser, 1, complain);
5894 /* Check for comparison of different enum types. */
5895 switch (code)
5897 case GT_EXPR:
5898 case LT_EXPR:
5899 case GE_EXPR:
5900 case LE_EXPR:
5901 case EQ_EXPR:
5902 case NE_EXPR:
5903 if (TREE_CODE (TREE_TYPE (arg1)) == ENUMERAL_TYPE
5904 && TREE_CODE (TREE_TYPE (arg2)) == ENUMERAL_TYPE
5905 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1))
5906 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2)))
5907 && (complain & tf_warning))
5909 warning (OPT_Wenum_compare,
5910 "comparison between %q#T and %q#T",
5911 TREE_TYPE (arg1), TREE_TYPE (arg2));
5913 break;
5914 default:
5915 break;
5918 /* We need to strip any leading REF_BIND so that bitfields
5919 don't cause errors. This should not remove any important
5920 conversions, because builtins don't apply to class
5921 objects directly. */
5922 conv = cand->convs[0];
5923 if (conv->kind == ck_ref_bind)
5924 conv = next_conversion (conv);
5925 arg1 = convert_like (conv, arg1, complain);
5927 if (arg2)
5929 conv = cand->convs[1];
5930 if (conv->kind == ck_ref_bind)
5931 conv = next_conversion (conv);
5932 else
5933 arg2 = decay_conversion (arg2, complain);
5935 /* We need to call warn_logical_operator before
5936 converting arg2 to a boolean_type, but after
5937 decaying an enumerator to its value. */
5938 if (complain & tf_warning)
5939 warn_logical_operator (loc, code, boolean_type_node,
5940 code_orig_arg1, arg1,
5941 code_orig_arg2, arg2);
5943 arg2 = convert_like (conv, arg2, complain);
5945 if (arg3)
5947 conv = cand->convs[2];
5948 if (conv->kind == ck_ref_bind)
5949 conv = next_conversion (conv);
5950 arg3 = convert_like (conv, arg3, complain);
5956 user_defined_result_ready:
5958 /* Free all the conversions we allocated. */
5959 obstack_free (&conversion_obstack, p);
5961 if (result || result_valid_p)
5962 return result;
5964 builtin:
5965 switch (code)
5967 case MODIFY_EXPR:
5968 return cp_build_modify_expr (loc, arg1, code2, arg2, complain);
5970 case INDIRECT_REF:
5971 return cp_build_indirect_ref (arg1, RO_UNARY_STAR, complain);
5973 case TRUTH_ANDIF_EXPR:
5974 case TRUTH_ORIF_EXPR:
5975 case TRUTH_AND_EXPR:
5976 case TRUTH_OR_EXPR:
5977 if (complain & tf_warning)
5978 warn_logical_operator (loc, code, boolean_type_node,
5979 code_orig_arg1, arg1,
5980 code_orig_arg2, arg2);
5981 /* Fall through. */
5982 case GT_EXPR:
5983 case LT_EXPR:
5984 case GE_EXPR:
5985 case LE_EXPR:
5986 case EQ_EXPR:
5987 case NE_EXPR:
5988 if ((complain & tf_warning)
5989 && ((code_orig_arg1 == BOOLEAN_TYPE)
5990 ^ (code_orig_arg2 == BOOLEAN_TYPE)))
5991 maybe_warn_bool_compare (loc, code, arg1, arg2);
5992 if (complain & tf_warning && warn_tautological_compare)
5993 warn_tautological_cmp (loc, code, arg1, arg2);
5994 /* Fall through. */
5995 case PLUS_EXPR:
5996 case MINUS_EXPR:
5997 case MULT_EXPR:
5998 case TRUNC_DIV_EXPR:
5999 case MAX_EXPR:
6000 case MIN_EXPR:
6001 case LSHIFT_EXPR:
6002 case RSHIFT_EXPR:
6003 case TRUNC_MOD_EXPR:
6004 case BIT_AND_EXPR:
6005 case BIT_IOR_EXPR:
6006 case BIT_XOR_EXPR:
6007 return cp_build_binary_op (loc, code, arg1, arg2, complain);
6009 case UNARY_PLUS_EXPR:
6010 case NEGATE_EXPR:
6011 case BIT_NOT_EXPR:
6012 case TRUTH_NOT_EXPR:
6013 case PREINCREMENT_EXPR:
6014 case POSTINCREMENT_EXPR:
6015 case PREDECREMENT_EXPR:
6016 case POSTDECREMENT_EXPR:
6017 case REALPART_EXPR:
6018 case IMAGPART_EXPR:
6019 case ABS_EXPR:
6020 return cp_build_unary_op (code, arg1, candidates != 0, complain);
6022 case ARRAY_REF:
6023 return cp_build_array_ref (input_location, arg1, arg2, complain);
6025 case MEMBER_REF:
6026 return build_m_component_ref (cp_build_indirect_ref (arg1, RO_ARROW_STAR,
6027 complain),
6028 arg2, complain);
6030 /* The caller will deal with these. */
6031 case ADDR_EXPR:
6032 case COMPONENT_REF:
6033 case COMPOUND_EXPR:
6034 return NULL_TREE;
6036 default:
6037 gcc_unreachable ();
6039 return NULL_TREE;
6042 /* Wrapper for above. */
6044 tree
6045 build_new_op (location_t loc, enum tree_code code, int flags,
6046 tree arg1, tree arg2, tree arg3,
6047 tree *overload, tsubst_flags_t complain)
6049 tree ret;
6050 bool subtime = timevar_cond_start (TV_OVERLOAD);
6051 ret = build_new_op_1 (loc, code, flags, arg1, arg2, arg3,
6052 overload, complain);
6053 timevar_cond_stop (TV_OVERLOAD, subtime);
6054 return ret;
6057 /* CALL was returned by some call-building function; extract the actual
6058 CALL_EXPR from any bits that have been tacked on, e.g. by
6059 convert_from_reference. */
6061 tree
6062 extract_call_expr (tree call)
6064 while (TREE_CODE (call) == COMPOUND_EXPR)
6065 call = TREE_OPERAND (call, 1);
6066 if (REFERENCE_REF_P (call))
6067 call = TREE_OPERAND (call, 0);
6068 if (TREE_CODE (call) == TARGET_EXPR)
6069 call = TARGET_EXPR_INITIAL (call);
6070 gcc_assert (TREE_CODE (call) == CALL_EXPR
6071 || TREE_CODE (call) == AGGR_INIT_EXPR
6072 || call == error_mark_node);
6073 return call;
6076 /* Returns true if FN has two parameters, of which the second has type
6077 size_t. */
6079 static bool
6080 second_parm_is_size_t (tree fn)
6082 tree t = FUNCTION_ARG_CHAIN (fn);
6083 if (!t || !same_type_p (TREE_VALUE (t), size_type_node))
6084 return false;
6085 t = TREE_CHAIN (t);
6086 if (t == void_list_node)
6087 return true;
6088 if (aligned_new_threshold && t
6089 && same_type_p (TREE_VALUE (t), align_type_node)
6090 && TREE_CHAIN (t) == void_list_node)
6091 return true;
6092 return false;
6095 /* True if T, an allocation function, has std::align_val_t as its second
6096 argument. */
6098 bool
6099 aligned_allocation_fn_p (tree t)
6101 if (!aligned_new_threshold)
6102 return false;
6104 tree a = FUNCTION_ARG_CHAIN (t);
6105 return (a && same_type_p (TREE_VALUE (a), align_type_node));
6108 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6109 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6110 std::align_val_t. */
6112 static bool
6113 aligned_deallocation_fn_p (tree t)
6115 if (!aligned_new_threshold)
6116 return false;
6118 /* A template instance is never a usual deallocation function,
6119 regardless of its signature. */
6120 if (TREE_CODE (t) == TEMPLATE_DECL
6121 || primary_template_specialization_p (t))
6122 return false;
6124 tree a = FUNCTION_ARG_CHAIN (t);
6125 if (same_type_p (TREE_VALUE (a), align_type_node)
6126 && TREE_CHAIN (a) == void_list_node)
6127 return true;
6128 if (!same_type_p (TREE_VALUE (a), size_type_node))
6129 return false;
6130 a = TREE_CHAIN (a);
6131 if (a && same_type_p (TREE_VALUE (a), align_type_node)
6132 && TREE_CHAIN (a) == void_list_node)
6133 return true;
6134 return false;
6137 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6138 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6140 bool
6141 usual_deallocation_fn_p (tree t)
6143 /* A template instance is never a usual deallocation function,
6144 regardless of its signature. */
6145 if (TREE_CODE (t) == TEMPLATE_DECL
6146 || primary_template_specialization_p (t))
6147 return false;
6149 /* If a class T has a member deallocation function named operator delete
6150 with exactly one parameter, then that function is a usual
6151 (non-placement) deallocation function. If class T does not declare
6152 such an operator delete but does declare a member deallocation
6153 function named operator delete with exactly two parameters, the second
6154 of which has type std::size_t (18.2), then this function is a usual
6155 deallocation function. */
6156 bool global = DECL_NAMESPACE_SCOPE_P (t);
6157 tree chain = FUNCTION_ARG_CHAIN (t);
6158 if (!chain)
6159 return false;
6160 if (chain == void_list_node
6161 || ((!global || flag_sized_deallocation)
6162 && second_parm_is_size_t (t)))
6163 return true;
6164 if (aligned_deallocation_fn_p (t))
6165 return true;
6166 return false;
6169 /* Build a call to operator delete. This has to be handled very specially,
6170 because the restrictions on what signatures match are different from all
6171 other call instances. For a normal delete, only a delete taking (void *)
6172 or (void *, size_t) is accepted. For a placement delete, only an exact
6173 match with the placement new is accepted.
6175 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6176 ADDR is the pointer to be deleted.
6177 SIZE is the size of the memory block to be deleted.
6178 GLOBAL_P is true if the delete-expression should not consider
6179 class-specific delete operators.
6180 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6182 If this call to "operator delete" is being generated as part to
6183 deallocate memory allocated via a new-expression (as per [expr.new]
6184 which requires that if the initialization throws an exception then
6185 we call a deallocation function), then ALLOC_FN is the allocation
6186 function. */
6188 tree
6189 build_op_delete_call (enum tree_code code, tree addr, tree size,
6190 bool global_p, tree placement,
6191 tree alloc_fn, tsubst_flags_t complain)
6193 tree fn = NULL_TREE;
6194 tree fns, fnname, type, t;
6196 if (addr == error_mark_node)
6197 return error_mark_node;
6199 type = strip_array_types (TREE_TYPE (TREE_TYPE (addr)));
6201 fnname = ovl_op_identifier (false, code);
6203 if (CLASS_TYPE_P (type)
6204 && COMPLETE_TYPE_P (complete_type (type))
6205 && !global_p)
6206 /* In [class.free]
6208 If the result of the lookup is ambiguous or inaccessible, or if
6209 the lookup selects a placement deallocation function, the
6210 program is ill-formed.
6212 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6214 fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1);
6215 if (fns == error_mark_node)
6216 return error_mark_node;
6218 else
6219 fns = NULL_TREE;
6221 if (fns == NULL_TREE)
6222 fns = lookup_name_nonclass (fnname);
6224 /* Strip const and volatile from addr. */
6225 addr = cp_convert (ptr_type_node, addr, complain);
6227 if (placement)
6229 /* "A declaration of a placement deallocation function matches the
6230 declaration of a placement allocation function if it has the same
6231 number of parameters and, after parameter transformations (8.3.5),
6232 all parameter types except the first are identical."
6234 So we build up the function type we want and ask instantiate_type
6235 to get it for us. */
6236 t = FUNCTION_ARG_CHAIN (alloc_fn);
6237 t = tree_cons (NULL_TREE, ptr_type_node, t);
6238 t = build_function_type (void_type_node, t);
6240 fn = instantiate_type (t, fns, tf_none);
6241 if (fn == error_mark_node)
6242 return NULL_TREE;
6244 fn = MAYBE_BASELINK_FUNCTIONS (fn);
6246 /* "If the lookup finds the two-parameter form of a usual deallocation
6247 function (3.7.4.2) and that function, considered as a placement
6248 deallocation function, would have been selected as a match for the
6249 allocation function, the program is ill-formed." */
6250 if (second_parm_is_size_t (fn))
6252 const char *const msg1
6253 = G_("exception cleanup for this placement new selects "
6254 "non-placement operator delete");
6255 const char *const msg2
6256 = G_("%qD is a usual (non-placement) deallocation "
6257 "function in C++14 (or with -fsized-deallocation)");
6259 /* But if the class has an operator delete (void *), then that is
6260 the usual deallocation function, so we shouldn't complain
6261 about using the operator delete (void *, size_t). */
6262 if (DECL_CLASS_SCOPE_P (fn))
6263 for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (fns));
6264 iter; ++iter)
6266 tree elt = *iter;
6267 if (usual_deallocation_fn_p (elt)
6268 && FUNCTION_ARG_CHAIN (elt) == void_list_node)
6269 goto ok;
6271 /* Before C++14 a two-parameter global deallocation function is
6272 always a placement deallocation function, but warn if
6273 -Wc++14-compat. */
6274 else if (!flag_sized_deallocation)
6276 if ((complain & tf_warning)
6277 && warning (OPT_Wc__14_compat, msg1))
6278 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
6279 goto ok;
6282 if (complain & tf_warning_or_error)
6284 if (permerror (input_location, msg1))
6286 /* Only mention C++14 for namespace-scope delete. */
6287 if (DECL_NAMESPACE_SCOPE_P (fn))
6288 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
6289 else
6290 inform (DECL_SOURCE_LOCATION (fn),
6291 "%qD is a usual (non-placement) deallocation "
6292 "function", fn);
6295 else
6296 return error_mark_node;
6297 ok:;
6300 else
6301 /* "Any non-placement deallocation function matches a non-placement
6302 allocation function. If the lookup finds a single matching
6303 deallocation function, that function will be called; otherwise, no
6304 deallocation function will be called." */
6305 for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (fns)); iter; ++iter)
6307 tree elt = *iter;
6308 if (usual_deallocation_fn_p (elt))
6310 if (!fn)
6312 fn = elt;
6313 continue;
6316 /* -- If the type has new-extended alignment, a function with a
6317 parameter of type std::align_val_t is preferred; otherwise a
6318 function without such a parameter is preferred. If exactly one
6319 preferred function is found, that function is selected and the
6320 selection process terminates. If more than one preferred
6321 function is found, all non-preferred functions are eliminated
6322 from further consideration. */
6323 if (aligned_new_threshold)
6325 bool want_align = type_has_new_extended_alignment (type);
6326 bool fn_align = aligned_deallocation_fn_p (fn);
6327 bool elt_align = aligned_deallocation_fn_p (elt);
6329 if (elt_align != fn_align)
6331 if (want_align == elt_align)
6332 fn = elt;
6333 continue;
6337 /* -- If the deallocation functions have class scope, the one
6338 without a parameter of type std::size_t is selected. */
6339 bool want_size;
6340 if (DECL_CLASS_SCOPE_P (fn))
6341 want_size = false;
6343 /* -- If the type is complete and if, for the second alternative
6344 (delete array) only, the operand is a pointer to a class type
6345 with a non-trivial destructor or a (possibly multi-dimensional)
6346 array thereof, the function with a parameter of type std::size_t
6347 is selected.
6349 -- Otherwise, it is unspecified whether a deallocation function
6350 with a parameter of type std::size_t is selected. */
6351 else
6353 want_size = COMPLETE_TYPE_P (type);
6354 if (code == VEC_DELETE_EXPR
6355 && !TYPE_VEC_NEW_USES_COOKIE (type))
6356 /* We need a cookie to determine the array size. */
6357 want_size = false;
6359 bool fn_size = second_parm_is_size_t (fn);
6360 bool elt_size = second_parm_is_size_t (elt);
6361 gcc_assert (fn_size != elt_size);
6362 if (want_size == elt_size)
6363 fn = elt;
6367 /* If we have a matching function, call it. */
6368 if (fn)
6370 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
6372 /* If the FN is a member function, make sure that it is
6373 accessible. */
6374 if (BASELINK_P (fns))
6375 perform_or_defer_access_check (BASELINK_BINFO (fns), fn, fn,
6376 complain);
6378 /* Core issue 901: It's ok to new a type with deleted delete. */
6379 if (DECL_DELETED_FN (fn) && alloc_fn)
6380 return NULL_TREE;
6382 if (placement)
6384 /* The placement args might not be suitable for overload
6385 resolution at this point, so build the call directly. */
6386 int nargs = call_expr_nargs (placement);
6387 tree *argarray = XALLOCAVEC (tree, nargs);
6388 int i;
6389 argarray[0] = addr;
6390 for (i = 1; i < nargs; i++)
6391 argarray[i] = CALL_EXPR_ARG (placement, i);
6392 if (!mark_used (fn, complain) && !(complain & tf_error))
6393 return error_mark_node;
6394 return build_cxx_call (fn, nargs, argarray, complain);
6396 else
6398 tree ret;
6399 vec<tree, va_gc> *args = make_tree_vector ();
6400 args->quick_push (addr);
6401 if (second_parm_is_size_t (fn))
6402 args->quick_push (size);
6403 if (aligned_deallocation_fn_p (fn))
6405 tree al = build_int_cst (align_type_node, TYPE_ALIGN_UNIT (type));
6406 args->quick_push (al);
6408 ret = cp_build_function_call_vec (fn, &args, complain);
6409 release_tree_vector (args);
6410 return ret;
6414 /* [expr.new]
6416 If no unambiguous matching deallocation function can be found,
6417 propagating the exception does not cause the object's memory to
6418 be freed. */
6419 if (alloc_fn)
6421 if ((complain & tf_warning)
6422 && !placement)
6423 warning (0, "no corresponding deallocation function for %qD",
6424 alloc_fn);
6425 return NULL_TREE;
6428 if (complain & tf_error)
6429 error ("no suitable %<operator %s%> for %qT",
6430 OVL_OP_INFO (false, code)->name, type);
6431 return error_mark_node;
6434 /* If the current scope isn't allowed to access DECL along
6435 BASETYPE_PATH, give an error. The most derived class in
6436 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6437 the declaration to use in the error diagnostic. */
6439 bool
6440 enforce_access (tree basetype_path, tree decl, tree diag_decl,
6441 tsubst_flags_t complain, access_failure_info *afi)
6443 gcc_assert (TREE_CODE (basetype_path) == TREE_BINFO);
6445 if (flag_new_inheriting_ctors
6446 && DECL_INHERITED_CTOR (decl))
6448 /* 7.3.3/18: The additional constructors are accessible if they would be
6449 accessible when used to construct an object of the corresponding base
6450 class. */
6451 decl = strip_inheriting_ctors (decl);
6452 basetype_path = lookup_base (basetype_path, DECL_CONTEXT (decl),
6453 ba_any, NULL, complain);
6456 if (!accessible_p (basetype_path, decl, true))
6458 if (complain & tf_error)
6460 if (flag_new_inheriting_ctors)
6461 diag_decl = strip_inheriting_ctors (diag_decl);
6462 if (TREE_PRIVATE (decl))
6464 error ("%q#D is private within this context", diag_decl);
6465 inform (DECL_SOURCE_LOCATION (diag_decl),
6466 "declared private here");
6467 if (afi)
6468 afi->record_access_failure (basetype_path, diag_decl);
6470 else if (TREE_PROTECTED (decl))
6472 error ("%q#D is protected within this context", diag_decl);
6473 inform (DECL_SOURCE_LOCATION (diag_decl),
6474 "declared protected here");
6475 if (afi)
6476 afi->record_access_failure (basetype_path, diag_decl);
6478 else
6480 error ("%q#D is inaccessible within this context", diag_decl);
6481 inform (DECL_SOURCE_LOCATION (diag_decl), "declared here");
6482 if (afi)
6483 afi->record_access_failure (basetype_path, diag_decl);
6486 return false;
6489 return true;
6492 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6493 bitwise or of LOOKUP_* values. If any errors are warnings are
6494 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6495 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6496 to NULL. */
6498 static tree
6499 build_temp (tree expr, tree type, int flags,
6500 diagnostic_t *diagnostic_kind, tsubst_flags_t complain)
6502 int savew, savee;
6503 vec<tree, va_gc> *args;
6505 *diagnostic_kind = DK_UNSPECIFIED;
6507 /* If the source is a packed field, calling the copy constructor will require
6508 binding the field to the reference parameter to the copy constructor, and
6509 we'll end up with an infinite loop. If we can use a bitwise copy, then
6510 do that now. */
6511 if ((lvalue_kind (expr) & clk_packed)
6512 && CLASS_TYPE_P (TREE_TYPE (expr))
6513 && !type_has_nontrivial_copy_init (TREE_TYPE (expr)))
6514 return get_target_expr_sfinae (expr, complain);
6516 savew = warningcount + werrorcount, savee = errorcount;
6517 args = make_tree_vector_single (expr);
6518 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
6519 &args, type, flags, complain);
6520 release_tree_vector (args);
6521 if (warningcount + werrorcount > savew)
6522 *diagnostic_kind = DK_WARNING;
6523 else if (errorcount > savee)
6524 *diagnostic_kind = DK_ERROR;
6525 return expr;
6528 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6529 EXPR is implicitly converted to type TOTYPE.
6530 FN and ARGNUM are used for diagnostics. */
6532 static void
6533 conversion_null_warnings (tree totype, tree expr, tree fn, int argnum)
6535 /* Issue warnings about peculiar, but valid, uses of NULL. */
6536 if (null_node_p (expr) && TREE_CODE (totype) != BOOLEAN_TYPE
6537 && ARITHMETIC_TYPE_P (totype))
6539 source_location loc =
6540 expansion_point_location_if_in_system_header (input_location);
6542 if (fn)
6543 warning_at (loc, OPT_Wconversion_null,
6544 "passing NULL to non-pointer argument %P of %qD",
6545 argnum, fn);
6546 else
6547 warning_at (loc, OPT_Wconversion_null,
6548 "converting to non-pointer type %qT from NULL", totype);
6551 /* Issue warnings if "false" is converted to a NULL pointer */
6552 else if (TREE_CODE (TREE_TYPE (expr)) == BOOLEAN_TYPE
6553 && TYPE_PTR_P (totype))
6555 if (fn)
6556 warning_at (input_location, OPT_Wconversion_null,
6557 "converting %<false%> to pointer type for argument %P "
6558 "of %qD", argnum, fn);
6559 else
6560 warning_at (input_location, OPT_Wconversion_null,
6561 "converting %<false%> to pointer type %qT", totype);
6565 /* We gave a diagnostic during a conversion. If this was in the second
6566 standard conversion sequence of a user-defined conversion sequence, say
6567 which user-defined conversion. */
6569 static void
6570 maybe_print_user_conv_context (conversion *convs)
6572 if (convs->user_conv_p)
6573 for (conversion *t = convs; t; t = next_conversion (t))
6574 if (t->kind == ck_user)
6576 print_z_candidate (0, " after user-defined conversion:",
6577 t->cand);
6578 break;
6582 /* Locate the parameter with the given index within FNDECL.
6583 ARGNUM is zero based, -1 indicates the `this' argument of a method.
6584 Return the location of the FNDECL itself if there are problems. */
6586 static location_t
6587 get_fndecl_argument_location (tree fndecl, int argnum)
6589 int i;
6590 tree param;
6592 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6593 for (i = 0, param = FUNCTION_FIRST_USER_PARM (fndecl);
6594 i < argnum && param;
6595 i++, param = TREE_CHAIN (param))
6598 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6599 return the location of FNDECL. */
6600 if (param == NULL)
6601 return DECL_SOURCE_LOCATION (fndecl);
6603 return DECL_SOURCE_LOCATION (param);
6606 /* Perform the conversions in CONVS on the expression EXPR. FN and
6607 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6608 indicates the `this' argument of a method. INNER is nonzero when
6609 being called to continue a conversion chain. It is negative when a
6610 reference binding will be applied, positive otherwise. If
6611 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6612 conversions will be emitted if appropriate. If C_CAST_P is true,
6613 this conversion is coming from a C-style cast; in that case,
6614 conversions to inaccessible bases are permitted. */
6616 static tree
6617 convert_like_real (conversion *convs, tree expr, tree fn, int argnum,
6618 bool issue_conversion_warnings,
6619 bool c_cast_p, tsubst_flags_t complain)
6621 tree totype = convs->type;
6622 diagnostic_t diag_kind;
6623 int flags;
6624 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
6626 if (convs->bad_p && !(complain & tf_error))
6627 return error_mark_node;
6629 if (convs->bad_p
6630 && convs->kind != ck_user
6631 && convs->kind != ck_list
6632 && convs->kind != ck_ambig
6633 && (convs->kind != ck_ref_bind
6634 || (convs->user_conv_p && next_conversion (convs)->bad_p))
6635 && (convs->kind != ck_rvalue
6636 || SCALAR_TYPE_P (totype))
6637 && convs->kind != ck_base)
6639 bool complained = false;
6640 conversion *t = convs;
6642 /* Give a helpful error if this is bad because of excess braces. */
6643 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6644 && SCALAR_TYPE_P (totype)
6645 && CONSTRUCTOR_NELTS (expr) > 0
6646 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr, 0)->value))
6648 complained = permerror (loc, "too many braces around initializer "
6649 "for %qT", totype);
6650 while (BRACE_ENCLOSED_INITIALIZER_P (expr)
6651 && CONSTRUCTOR_NELTS (expr) == 1)
6652 expr = CONSTRUCTOR_ELT (expr, 0)->value;
6655 /* Give a helpful error if this is bad because a conversion to bool
6656 from std::nullptr_t requires direct-initialization. */
6657 if (NULLPTR_TYPE_P (TREE_TYPE (expr))
6658 && TREE_CODE (totype) == BOOLEAN_TYPE)
6659 complained = permerror (loc, "converting to %qH from %qI requires "
6660 "direct-initialization",
6661 totype, TREE_TYPE (expr));
6663 for (; t ; t = next_conversion (t))
6665 if (t->kind == ck_user && t->cand->reason)
6667 complained = permerror (loc, "invalid user-defined conversion "
6668 "from %qH to %qI", TREE_TYPE (expr),
6669 totype);
6670 if (complained)
6671 print_z_candidate (loc, "candidate is:", t->cand);
6672 expr = convert_like_real (t, expr, fn, argnum,
6673 /*issue_conversion_warnings=*/false,
6674 /*c_cast_p=*/false,
6675 complain);
6676 if (convs->kind == ck_ref_bind)
6677 expr = convert_to_reference (totype, expr, CONV_IMPLICIT,
6678 LOOKUP_NORMAL, NULL_TREE,
6679 complain);
6680 else
6681 expr = cp_convert (totype, expr, complain);
6682 if (complained && fn)
6683 inform (DECL_SOURCE_LOCATION (fn),
6684 " initializing argument %P of %qD", argnum, fn);
6685 return expr;
6687 else if (t->kind == ck_user || !t->bad_p)
6689 expr = convert_like_real (t, expr, fn, argnum,
6690 /*issue_conversion_warnings=*/false,
6691 /*c_cast_p=*/false,
6692 complain);
6693 break;
6695 else if (t->kind == ck_ambig)
6696 return convert_like_real (t, expr, fn, argnum,
6697 /*issue_conversion_warnings=*/false,
6698 /*c_cast_p=*/false,
6699 complain);
6700 else if (t->kind == ck_identity)
6701 break;
6703 if (!complained)
6704 complained = permerror (loc, "invalid conversion from %qH to %qI",
6705 TREE_TYPE (expr), totype);
6706 if (complained && fn)
6707 inform (get_fndecl_argument_location (fn, argnum),
6708 " initializing argument %P of %qD", argnum, fn);
6710 return cp_convert (totype, expr, complain);
6713 if (issue_conversion_warnings && (complain & tf_warning))
6714 conversion_null_warnings (totype, expr, fn, argnum);
6716 switch (convs->kind)
6718 case ck_user:
6720 struct z_candidate *cand = convs->cand;
6722 if (cand == NULL)
6723 /* We chose the surrogate function from add_conv_candidate, now we
6724 actually need to build the conversion. */
6725 cand = build_user_type_conversion_1 (totype, expr,
6726 LOOKUP_NO_CONVERSION, complain);
6728 tree convfn = cand->fn;
6730 /* When converting from an init list we consider explicit
6731 constructors, but actually trying to call one is an error. */
6732 if (DECL_NONCONVERTING_P (convfn) && DECL_CONSTRUCTOR_P (convfn)
6733 && BRACE_ENCLOSED_INITIALIZER_P (expr)
6734 /* Unless this is for direct-list-initialization. */
6735 && !CONSTRUCTOR_IS_DIRECT_INIT (expr)
6736 /* And in C++98 a default constructor can't be explicit. */
6737 && cxx_dialect >= cxx11)
6739 if (!(complain & tf_error))
6740 return error_mark_node;
6741 location_t loc = location_of (expr);
6742 if (CONSTRUCTOR_NELTS (expr) == 0
6743 && FUNCTION_FIRST_USER_PARMTYPE (convfn) != void_list_node)
6745 if (pedwarn (loc, 0, "converting to %qT from initializer list "
6746 "would use explicit constructor %qD",
6747 totype, convfn))
6748 inform (loc, "in C++11 and above a default constructor "
6749 "can be explicit");
6751 else
6752 error ("converting to %qT from initializer list would use "
6753 "explicit constructor %qD", totype, convfn);
6756 /* If we're initializing from {}, it's value-initialization. */
6757 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6758 && CONSTRUCTOR_NELTS (expr) == 0
6759 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
6761 bool direct = CONSTRUCTOR_IS_DIRECT_INIT (expr);
6762 expr = build_value_init (totype, complain);
6763 expr = get_target_expr_sfinae (expr, complain);
6764 if (expr != error_mark_node)
6766 TARGET_EXPR_LIST_INIT_P (expr) = true;
6767 TARGET_EXPR_DIRECT_INIT_P (expr) = direct;
6769 return expr;
6772 expr = mark_rvalue_use (expr);
6774 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
6775 any more UDCs. */
6776 expr = build_over_call (cand, LOOKUP_NORMAL|LOOKUP_NO_CONVERSION,
6777 complain);
6779 /* If this is a constructor or a function returning an aggr type,
6780 we need to build up a TARGET_EXPR. */
6781 if (DECL_CONSTRUCTOR_P (convfn))
6783 expr = build_cplus_new (totype, expr, complain);
6785 /* Remember that this was list-initialization. */
6786 if (convs->check_narrowing && expr != error_mark_node)
6787 TARGET_EXPR_LIST_INIT_P (expr) = true;
6790 return expr;
6792 case ck_identity:
6793 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
6795 int nelts = CONSTRUCTOR_NELTS (expr);
6796 if (nelts == 0)
6797 expr = build_value_init (totype, complain);
6798 else if (nelts == 1)
6799 expr = CONSTRUCTOR_ELT (expr, 0)->value;
6800 else
6801 gcc_unreachable ();
6803 expr = mark_rvalue_use (expr);
6805 if (type_unknown_p (expr))
6806 expr = instantiate_type (totype, expr, complain);
6807 return expr;
6808 case ck_ambig:
6809 /* We leave bad_p off ck_ambig because overload resolution considers
6810 it valid, it just fails when we try to perform it. So we need to
6811 check complain here, too. */
6812 if (complain & tf_error)
6814 /* Call build_user_type_conversion again for the error. */
6815 build_user_type_conversion (totype, convs->u.expr, LOOKUP_IMPLICIT,
6816 complain);
6817 if (fn)
6818 inform (DECL_SOURCE_LOCATION (fn),
6819 " initializing argument %P of %qD", argnum, fn);
6821 return error_mark_node;
6823 case ck_list:
6825 /* Conversion to std::initializer_list<T>. */
6826 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype), 0);
6827 tree new_ctor = build_constructor (init_list_type_node, NULL);
6828 unsigned len = CONSTRUCTOR_NELTS (expr);
6829 tree array, val, field;
6830 vec<constructor_elt, va_gc> *vec = NULL;
6831 unsigned ix;
6833 /* Convert all the elements. */
6834 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr), ix, val)
6836 tree sub = convert_like_real (convs->u.list[ix], val, fn, argnum,
6837 false, false, complain);
6838 if (sub == error_mark_node)
6839 return sub;
6840 if (!BRACE_ENCLOSED_INITIALIZER_P (val)
6841 && !check_narrowing (TREE_TYPE (sub), val, complain))
6842 return error_mark_node;
6843 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor), NULL_TREE, sub);
6844 if (!TREE_CONSTANT (sub))
6845 TREE_CONSTANT (new_ctor) = false;
6847 /* Build up the array. */
6848 elttype = cp_build_qualified_type
6849 (elttype, cp_type_quals (elttype) | TYPE_QUAL_CONST);
6850 array = build_array_of_n_type (elttype, len);
6851 array = finish_compound_literal (array, new_ctor, complain);
6852 /* Take the address explicitly rather than via decay_conversion
6853 to avoid the error about taking the address of a temporary. */
6854 array = cp_build_addr_expr (array, complain);
6855 array = cp_convert (build_pointer_type (elttype), array, complain);
6856 if (array == error_mark_node)
6857 return error_mark_node;
6859 /* Build up the initializer_list object. */
6860 totype = complete_type (totype);
6861 field = next_initializable_field (TYPE_FIELDS (totype));
6862 CONSTRUCTOR_APPEND_ELT (vec, field, array);
6863 field = next_initializable_field (DECL_CHAIN (field));
6864 CONSTRUCTOR_APPEND_ELT (vec, field, size_int (len));
6865 new_ctor = build_constructor (totype, vec);
6866 return get_target_expr_sfinae (new_ctor, complain);
6869 case ck_aggr:
6870 if (TREE_CODE (totype) == COMPLEX_TYPE)
6872 tree real = CONSTRUCTOR_ELT (expr, 0)->value;
6873 tree imag = CONSTRUCTOR_ELT (expr, 1)->value;
6874 real = perform_implicit_conversion (TREE_TYPE (totype),
6875 real, complain);
6876 imag = perform_implicit_conversion (TREE_TYPE (totype),
6877 imag, complain);
6878 expr = build2 (COMPLEX_EXPR, totype, real, imag);
6879 return expr;
6881 expr = reshape_init (totype, expr, complain);
6882 expr = get_target_expr_sfinae (digest_init (totype, expr, complain),
6883 complain);
6884 if (expr != error_mark_node)
6885 TARGET_EXPR_LIST_INIT_P (expr) = true;
6886 return expr;
6888 default:
6889 break;
6892 expr = convert_like_real (next_conversion (convs), expr, fn, argnum,
6893 convs->kind == ck_ref_bind ? issue_conversion_warnings : false,
6894 c_cast_p,
6895 complain);
6896 if (expr == error_mark_node)
6897 return error_mark_node;
6899 switch (convs->kind)
6901 case ck_rvalue:
6902 expr = decay_conversion (expr, complain);
6903 if (expr == error_mark_node)
6905 if (complain & tf_error)
6907 maybe_print_user_conv_context (convs);
6908 if (fn)
6909 inform (DECL_SOURCE_LOCATION (fn),
6910 " initializing argument %P of %qD", argnum, fn);
6912 return error_mark_node;
6915 if (! MAYBE_CLASS_TYPE_P (totype))
6916 return expr;
6918 /* Don't introduce copies when passing arguments along to the inherited
6919 constructor. */
6920 if (current_function_decl
6921 && flag_new_inheriting_ctors
6922 && DECL_INHERITED_CTOR (current_function_decl))
6923 return expr;
6925 /* Fall through. */
6926 case ck_base:
6927 if (convs->kind == ck_base && !convs->need_temporary_p)
6929 /* We are going to bind a reference directly to a base-class
6930 subobject of EXPR. */
6931 /* Build an expression for `*((base*) &expr)'. */
6932 expr = convert_to_base (expr, totype,
6933 !c_cast_p, /*nonnull=*/true, complain);
6934 return expr;
6937 /* Copy-initialization where the cv-unqualified version of the source
6938 type is the same class as, or a derived class of, the class of the
6939 destination [is treated as direct-initialization]. [dcl.init] */
6940 flags = LOOKUP_NORMAL;
6941 if (convs->user_conv_p)
6942 /* This conversion is being done in the context of a user-defined
6943 conversion (i.e. the second step of copy-initialization), so
6944 don't allow any more. */
6945 flags |= LOOKUP_NO_CONVERSION;
6946 else
6947 flags |= LOOKUP_ONLYCONVERTING;
6948 if (convs->rvaluedness_matches_p)
6949 /* standard_conversion got LOOKUP_PREFER_RVALUE. */
6950 flags |= LOOKUP_PREFER_RVALUE;
6951 if (TREE_CODE (expr) == TARGET_EXPR
6952 && TARGET_EXPR_LIST_INIT_P (expr))
6953 /* Copy-list-initialization doesn't actually involve a copy. */
6954 return expr;
6955 expr = build_temp (expr, totype, flags, &diag_kind, complain);
6956 if (diag_kind && complain)
6958 maybe_print_user_conv_context (convs);
6959 if (fn)
6960 inform (DECL_SOURCE_LOCATION (fn),
6961 " initializing argument %P of %qD", argnum, fn);
6964 return build_cplus_new (totype, expr, complain);
6966 case ck_ref_bind:
6968 tree ref_type = totype;
6970 if (convs->bad_p && !next_conversion (convs)->bad_p)
6972 tree extype = TREE_TYPE (expr);
6973 if (TYPE_REF_IS_RVALUE (ref_type)
6974 && lvalue_p (expr))
6975 error_at (loc, "cannot bind rvalue reference of type %qH to "
6976 "lvalue of type %qI", totype, extype);
6977 else if (!TYPE_REF_IS_RVALUE (ref_type) && !lvalue_p (expr)
6978 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type)))
6979 error_at (loc, "cannot bind non-const lvalue reference of "
6980 "type %qH to an rvalue of type %qI", totype, extype);
6981 else if (!reference_compatible_p (TREE_TYPE (totype), extype))
6982 error_at (loc, "binding reference of type %qH to %qI "
6983 "discards qualifiers", totype, extype);
6984 else
6985 gcc_unreachable ();
6986 maybe_print_user_conv_context (convs);
6987 if (fn)
6988 inform (DECL_SOURCE_LOCATION (fn),
6989 " initializing argument %P of %qD", argnum, fn);
6990 return error_mark_node;
6993 /* If necessary, create a temporary.
6995 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
6996 that need temporaries, even when their types are reference
6997 compatible with the type of reference being bound, so the
6998 upcoming call to cp_build_addr_expr doesn't fail. */
6999 if (convs->need_temporary_p
7000 || TREE_CODE (expr) == CONSTRUCTOR
7001 || TREE_CODE (expr) == VA_ARG_EXPR)
7003 /* Otherwise, a temporary of type "cv1 T1" is created and
7004 initialized from the initializer expression using the rules
7005 for a non-reference copy-initialization (8.5). */
7007 tree type = TREE_TYPE (ref_type);
7008 cp_lvalue_kind lvalue = lvalue_kind (expr);
7010 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7011 (type, next_conversion (convs)->type));
7012 if (!CP_TYPE_CONST_NON_VOLATILE_P (type)
7013 && !TYPE_REF_IS_RVALUE (ref_type))
7015 /* If the reference is volatile or non-const, we
7016 cannot create a temporary. */
7017 if (lvalue & clk_bitfield)
7018 error_at (loc, "cannot bind bitfield %qE to %qT",
7019 expr, ref_type);
7020 else if (lvalue & clk_packed)
7021 error_at (loc, "cannot bind packed field %qE to %qT",
7022 expr, ref_type);
7023 else
7024 error_at (loc, "cannot bind rvalue %qE to %qT",
7025 expr, ref_type);
7026 return error_mark_node;
7028 /* If the source is a packed field, and we must use a copy
7029 constructor, then building the target expr will require
7030 binding the field to the reference parameter to the
7031 copy constructor, and we'll end up with an infinite
7032 loop. If we can use a bitwise copy, then we'll be
7033 OK. */
7034 if ((lvalue & clk_packed)
7035 && CLASS_TYPE_P (type)
7036 && type_has_nontrivial_copy_init (type))
7038 error_at (loc, "cannot bind packed field %qE to %qT",
7039 expr, ref_type);
7040 return error_mark_node;
7042 if (lvalue & clk_bitfield)
7044 expr = convert_bitfield_to_declared_type (expr);
7045 expr = fold_convert (type, expr);
7047 expr = build_target_expr_with_type (expr, type, complain);
7050 /* Take the address of the thing to which we will bind the
7051 reference. */
7052 expr = cp_build_addr_expr (expr, complain);
7053 if (expr == error_mark_node)
7054 return error_mark_node;
7056 /* Convert it to a pointer to the type referred to by the
7057 reference. This will adjust the pointer if a derived to
7058 base conversion is being performed. */
7059 expr = cp_convert (build_pointer_type (TREE_TYPE (ref_type)),
7060 expr, complain);
7061 /* Convert the pointer to the desired reference type. */
7062 return build_nop (ref_type, expr);
7065 case ck_lvalue:
7066 return decay_conversion (expr, complain);
7068 case ck_fnptr:
7069 /* ??? Should the address of a transaction-safe pointer point to the TM
7070 clone, and this conversion look up the primary function? */
7071 return build_nop (totype, expr);
7073 case ck_qual:
7074 /* Warn about deprecated conversion if appropriate. */
7075 string_conv_p (totype, expr, 1);
7076 break;
7078 case ck_ptr:
7079 if (convs->base_p)
7080 expr = convert_to_base (expr, totype, !c_cast_p,
7081 /*nonnull=*/false, complain);
7082 return build_nop (totype, expr);
7084 case ck_pmem:
7085 return convert_ptrmem (totype, expr, /*allow_inverse_p=*/false,
7086 c_cast_p, complain);
7088 default:
7089 break;
7092 if (convs->check_narrowing
7093 && !check_narrowing (totype, expr, complain))
7094 return error_mark_node;
7096 if (issue_conversion_warnings)
7097 expr = cp_convert_and_check (totype, expr, complain);
7098 else
7099 expr = cp_convert (totype, expr, complain);
7101 return expr;
7104 /* ARG is being passed to a varargs function. Perform any conversions
7105 required. Return the converted value. */
7107 tree
7108 convert_arg_to_ellipsis (tree arg, tsubst_flags_t complain)
7110 tree arg_type;
7111 location_t loc = EXPR_LOC_OR_LOC (arg, input_location);
7113 /* [expr.call]
7115 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7116 standard conversions are performed. */
7117 arg = decay_conversion (arg, complain);
7118 arg_type = TREE_TYPE (arg);
7119 /* [expr.call]
7121 If the argument has integral or enumeration type that is subject
7122 to the integral promotions (_conv.prom_), or a floating point
7123 type that is subject to the floating point promotion
7124 (_conv.fpprom_), the value of the argument is converted to the
7125 promoted type before the call. */
7126 if (TREE_CODE (arg_type) == REAL_TYPE
7127 && (TYPE_PRECISION (arg_type)
7128 < TYPE_PRECISION (double_type_node))
7129 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type)))
7131 if ((complain & tf_warning)
7132 && warn_double_promotion && !c_inhibit_evaluation_warnings)
7133 warning_at (loc, OPT_Wdouble_promotion,
7134 "implicit conversion from %qH to %qI when passing "
7135 "argument to function",
7136 arg_type, double_type_node);
7137 arg = convert_to_real_nofold (double_type_node, arg);
7139 else if (NULLPTR_TYPE_P (arg_type))
7140 arg = null_pointer_node;
7141 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type))
7143 if (SCOPED_ENUM_P (arg_type))
7145 tree prom = cp_convert (ENUM_UNDERLYING_TYPE (arg_type), arg,
7146 complain);
7147 prom = cp_perform_integral_promotions (prom, complain);
7148 if (abi_version_crosses (6)
7149 && TYPE_MODE (TREE_TYPE (prom)) != TYPE_MODE (arg_type)
7150 && (complain & tf_warning))
7151 warning_at (loc, OPT_Wabi, "scoped enum %qT passed through ... as "
7152 "%qT before -fabi-version=6, %qT after", arg_type,
7153 TREE_TYPE (prom), ENUM_UNDERLYING_TYPE (arg_type));
7154 if (!abi_version_at_least (6))
7155 arg = prom;
7157 else
7158 arg = cp_perform_integral_promotions (arg, complain);
7161 arg = require_complete_type_sfinae (arg, complain);
7162 arg_type = TREE_TYPE (arg);
7164 if (arg != error_mark_node
7165 /* In a template (or ill-formed code), we can have an incomplete type
7166 even after require_complete_type_sfinae, in which case we don't know
7167 whether it has trivial copy or not. */
7168 && COMPLETE_TYPE_P (arg_type)
7169 && !cp_unevaluated_operand)
7171 /* [expr.call] 5.2.2/7:
7172 Passing a potentially-evaluated argument of class type (Clause 9)
7173 with a non-trivial copy constructor or a non-trivial destructor
7174 with no corresponding parameter is conditionally-supported, with
7175 implementation-defined semantics.
7177 We support it as pass-by-invisible-reference, just like a normal
7178 value parameter.
7180 If the call appears in the context of a sizeof expression,
7181 it is not potentially-evaluated. */
7182 if (type_has_nontrivial_copy_init (arg_type)
7183 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type))
7185 arg = force_rvalue (arg, complain);
7186 if (complain & tf_warning)
7187 warning (OPT_Wconditionally_supported,
7188 "passing objects of non-trivially-copyable "
7189 "type %q#T through %<...%> is conditionally supported",
7190 arg_type);
7191 return cp_build_addr_expr (arg, complain);
7193 /* Build up a real lvalue-to-rvalue conversion in case the
7194 copy constructor is trivial but not callable. */
7195 else if (CLASS_TYPE_P (arg_type))
7196 force_rvalue (arg, complain);
7200 return arg;
7203 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7205 tree
7206 build_x_va_arg (source_location loc, tree expr, tree type)
7208 if (processing_template_decl)
7210 tree r = build_min (VA_ARG_EXPR, type, expr);
7211 SET_EXPR_LOCATION (r, loc);
7212 return r;
7215 type = complete_type_or_else (type, NULL_TREE);
7217 if (expr == error_mark_node || !type)
7218 return error_mark_node;
7220 expr = mark_lvalue_use (expr);
7222 if (TREE_CODE (type) == REFERENCE_TYPE)
7224 error ("cannot receive reference type %qT through %<...%>", type);
7225 return error_mark_node;
7228 if (type_has_nontrivial_copy_init (type)
7229 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
7231 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7232 it as pass by invisible reference. */
7233 warning_at (loc, OPT_Wconditionally_supported,
7234 "receiving objects of non-trivially-copyable type %q#T "
7235 "through %<...%> is conditionally-supported", type);
7237 tree ref = cp_build_reference_type (type, false);
7238 expr = build_va_arg (loc, expr, ref);
7239 return convert_from_reference (expr);
7242 tree ret = build_va_arg (loc, expr, type);
7243 if (CLASS_TYPE_P (type))
7244 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7245 know how to handle it. */
7246 ret = get_target_expr (ret);
7247 return ret;
7250 /* TYPE has been given to va_arg. Apply the default conversions which
7251 would have happened when passed via ellipsis. Return the promoted
7252 type, or the passed type if there is no change. */
7254 tree
7255 cxx_type_promotes_to (tree type)
7257 tree promote;
7259 /* Perform the array-to-pointer and function-to-pointer
7260 conversions. */
7261 type = type_decays_to (type);
7263 promote = type_promotes_to (type);
7264 if (same_type_p (type, promote))
7265 promote = type;
7267 return promote;
7270 /* ARG is a default argument expression being passed to a parameter of
7271 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7272 zero-based argument number. Do any required conversions. Return
7273 the converted value. */
7275 static GTY(()) vec<tree, va_gc> *default_arg_context;
7276 void
7277 push_defarg_context (tree fn)
7278 { vec_safe_push (default_arg_context, fn); }
7280 void
7281 pop_defarg_context (void)
7282 { default_arg_context->pop (); }
7284 tree
7285 convert_default_arg (tree type, tree arg, tree fn, int parmnum,
7286 tsubst_flags_t complain)
7288 int i;
7289 tree t;
7291 /* See through clones. */
7292 fn = DECL_ORIGIN (fn);
7293 /* And inheriting ctors. */
7294 if (flag_new_inheriting_ctors)
7295 fn = strip_inheriting_ctors (fn);
7297 /* Detect recursion. */
7298 FOR_EACH_VEC_SAFE_ELT (default_arg_context, i, t)
7299 if (t == fn)
7301 if (complain & tf_error)
7302 error ("recursive evaluation of default argument for %q#D", fn);
7303 return error_mark_node;
7306 /* If the ARG is an unparsed default argument expression, the
7307 conversion cannot be performed. */
7308 if (TREE_CODE (arg) == DEFAULT_ARG)
7310 if (complain & tf_error)
7311 error ("call to %qD uses the default argument for parameter %P, which "
7312 "is not yet defined", fn, parmnum);
7313 return error_mark_node;
7316 push_defarg_context (fn);
7318 if (fn && DECL_TEMPLATE_INFO (fn))
7319 arg = tsubst_default_argument (fn, parmnum, type, arg, complain);
7321 /* Due to:
7323 [dcl.fct.default]
7325 The names in the expression are bound, and the semantic
7326 constraints are checked, at the point where the default
7327 expressions appears.
7329 we must not perform access checks here. */
7330 push_deferring_access_checks (dk_no_check);
7331 /* We must make a copy of ARG, in case subsequent processing
7332 alters any part of it. */
7333 arg = break_out_target_exprs (arg);
7334 arg = convert_for_initialization (0, type, arg, LOOKUP_IMPLICIT,
7335 ICR_DEFAULT_ARGUMENT, fn, parmnum,
7336 complain);
7337 arg = convert_for_arg_passing (type, arg, complain);
7338 pop_deferring_access_checks();
7340 pop_defarg_context ();
7342 return arg;
7345 /* Returns the type which will really be used for passing an argument of
7346 type TYPE. */
7348 tree
7349 type_passed_as (tree type)
7351 /* Pass classes with copy ctors by invisible reference. */
7352 if (TREE_ADDRESSABLE (type))
7354 type = build_reference_type (type);
7355 /* There are no other pointers to this temporary. */
7356 type = cp_build_qualified_type (type, TYPE_QUAL_RESTRICT);
7358 else if (targetm.calls.promote_prototypes (NULL_TREE)
7359 && INTEGRAL_TYPE_P (type)
7360 && COMPLETE_TYPE_P (type)
7361 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
7362 type = integer_type_node;
7364 return type;
7367 /* Actually perform the appropriate conversion. */
7369 tree
7370 convert_for_arg_passing (tree type, tree val, tsubst_flags_t complain)
7372 tree bitfield_type;
7374 /* If VAL is a bitfield, then -- since it has already been converted
7375 to TYPE -- it cannot have a precision greater than TYPE.
7377 If it has a smaller precision, we must widen it here. For
7378 example, passing "int f:3;" to a function expecting an "int" will
7379 not result in any conversion before this point.
7381 If the precision is the same we must not risk widening. For
7382 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7383 often have type "int", even though the C++ type for the field is
7384 "long long". If the value is being passed to a function
7385 expecting an "int", then no conversions will be required. But,
7386 if we call convert_bitfield_to_declared_type, the bitfield will
7387 be converted to "long long". */
7388 bitfield_type = is_bitfield_expr_with_lowered_type (val);
7389 if (bitfield_type
7390 && TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type))
7391 val = convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type), val);
7393 if (val == error_mark_node)
7395 /* Pass classes with copy ctors by invisible reference. */
7396 else if (TREE_ADDRESSABLE (type))
7397 val = build1 (ADDR_EXPR, build_reference_type (type), val);
7398 else if (targetm.calls.promote_prototypes (NULL_TREE)
7399 && INTEGRAL_TYPE_P (type)
7400 && COMPLETE_TYPE_P (type)
7401 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
7402 val = cp_perform_integral_promotions (val, complain);
7403 if (complain & tf_warning)
7405 if (warn_suggest_attribute_format)
7407 tree rhstype = TREE_TYPE (val);
7408 const enum tree_code coder = TREE_CODE (rhstype);
7409 const enum tree_code codel = TREE_CODE (type);
7410 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
7411 && coder == codel
7412 && check_missing_format_attribute (type, rhstype))
7413 warning (OPT_Wsuggest_attribute_format,
7414 "argument of function call might be a candidate "
7415 "for a format attribute");
7417 maybe_warn_parm_abi (type, EXPR_LOC_OR_LOC (val, input_location));
7419 return val;
7422 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7423 which just decay_conversion or no conversions at all should be done.
7424 This is true for some builtins which don't act like normal functions.
7425 Return 2 if no conversions at all should be done, 1 if just
7426 decay_conversion. Return 3 for special treatment of the 3rd argument
7427 for __builtin_*_overflow_p. */
7430 magic_varargs_p (tree fn)
7432 if (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL)
7433 switch (DECL_FUNCTION_CODE (fn))
7435 case BUILT_IN_CLASSIFY_TYPE:
7436 case BUILT_IN_CONSTANT_P:
7437 case BUILT_IN_NEXT_ARG:
7438 case BUILT_IN_VA_START:
7439 return 1;
7441 case BUILT_IN_ADD_OVERFLOW_P:
7442 case BUILT_IN_SUB_OVERFLOW_P:
7443 case BUILT_IN_MUL_OVERFLOW_P:
7444 return 3;
7446 default:;
7447 return lookup_attribute ("type generic",
7448 TYPE_ATTRIBUTES (TREE_TYPE (fn))) != 0;
7451 return 0;
7454 /* Returns the decl of the dispatcher function if FN is a function version. */
7456 tree
7457 get_function_version_dispatcher (tree fn)
7459 tree dispatcher_decl = NULL;
7461 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
7462 && DECL_FUNCTION_VERSIONED (fn));
7464 gcc_assert (targetm.get_function_versions_dispatcher);
7465 dispatcher_decl = targetm.get_function_versions_dispatcher (fn);
7467 if (dispatcher_decl == NULL)
7469 error_at (input_location, "use of multiversioned function "
7470 "without a default");
7471 return NULL;
7474 retrofit_lang_decl (dispatcher_decl);
7475 gcc_assert (dispatcher_decl != NULL);
7476 return dispatcher_decl;
7479 /* fn is a function version dispatcher that is marked used. Mark all the
7480 semantically identical function versions it will dispatch as used. */
7482 void
7483 mark_versions_used (tree fn)
7485 struct cgraph_node *node;
7486 struct cgraph_function_version_info *node_v;
7487 struct cgraph_function_version_info *it_v;
7489 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7491 node = cgraph_node::get (fn);
7492 if (node == NULL)
7493 return;
7495 gcc_assert (node->dispatcher_function);
7497 node_v = node->function_version ();
7498 if (node_v == NULL)
7499 return;
7501 /* All semantically identical versions are chained. Traverse and mark each
7502 one of them as used. */
7503 it_v = node_v->next;
7504 while (it_v != NULL)
7506 mark_used (it_v->this_node->decl);
7507 it_v = it_v->next;
7511 /* Build a call to "the copy constructor" for the type of A, even if it
7512 wouldn't be selected by normal overload resolution. Used for
7513 diagnostics. */
7515 static tree
7516 call_copy_ctor (tree a, tsubst_flags_t complain)
7518 tree ctype = TYPE_MAIN_VARIANT (TREE_TYPE (a));
7519 tree binfo = TYPE_BINFO (ctype);
7520 tree copy = get_copy_ctor (ctype, complain);
7521 copy = build_baselink (binfo, binfo, copy, NULL_TREE);
7522 tree ob = build_dummy_object (ctype);
7523 vec<tree, va_gc>* args = make_tree_vector_single (a);
7524 tree r = build_new_method_call (ob, copy, &args, NULL_TREE,
7525 LOOKUP_NORMAL, NULL, complain);
7526 release_tree_vector (args);
7527 return r;
7530 /* Return true iff T refers to a base field. */
7532 static bool
7533 is_base_field_ref (tree t)
7535 STRIP_NOPS (t);
7536 if (TREE_CODE (t) == ADDR_EXPR)
7537 t = TREE_OPERAND (t, 0);
7538 if (TREE_CODE (t) == COMPONENT_REF)
7539 t = TREE_OPERAND (t, 1);
7540 if (TREE_CODE (t) == FIELD_DECL)
7541 return DECL_FIELD_IS_BASE (t);
7542 return false;
7545 /* We can't elide a copy from a function returning by value to a base
7546 subobject, as the callee might clobber tail padding. Return true iff this
7547 could be that case. */
7549 static bool
7550 unsafe_copy_elision_p (tree target, tree exp)
7552 /* Copy elision only happens with a TARGET_EXPR. */
7553 if (TREE_CODE (exp) != TARGET_EXPR)
7554 return false;
7555 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
7556 /* It's safe to elide the copy for a class with no tail padding. */
7557 if (tree_int_cst_equal (TYPE_SIZE (type), CLASSTYPE_SIZE (type)))
7558 return false;
7559 /* It's safe to elide the copy if we aren't initializing a base object. */
7560 if (!is_base_field_ref (target))
7561 return false;
7562 tree init = TARGET_EXPR_INITIAL (exp);
7563 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7564 while (TREE_CODE (init) == COMPOUND_EXPR)
7565 init = TREE_OPERAND (init, 1);
7566 return (TREE_CODE (init) == AGGR_INIT_EXPR
7567 && !AGGR_INIT_VIA_CTOR_P (init));
7570 /* Subroutine of the various build_*_call functions. Overload resolution
7571 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7572 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7573 bitmask of various LOOKUP_* flags which apply to the call itself. */
7575 static tree
7576 build_over_call (struct z_candidate *cand, int flags, tsubst_flags_t complain)
7578 tree fn = cand->fn;
7579 const vec<tree, va_gc> *args = cand->args;
7580 tree first_arg = cand->first_arg;
7581 conversion **convs = cand->convs;
7582 conversion *conv;
7583 tree parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
7584 int parmlen;
7585 tree val;
7586 int i = 0;
7587 int j = 0;
7588 unsigned int arg_index = 0;
7589 int is_method = 0;
7590 int nargs;
7591 tree *argarray;
7592 bool already_used = false;
7594 /* In a template, there is no need to perform all of the work that
7595 is normally done. We are only interested in the type of the call
7596 expression, i.e., the return type of the function. Any semantic
7597 errors will be deferred until the template is instantiated. */
7598 if (processing_template_decl)
7600 tree expr, addr;
7601 tree return_type;
7602 const tree *argarray;
7603 unsigned int nargs;
7605 if (undeduced_auto_decl (fn))
7606 mark_used (fn, complain);
7608 return_type = TREE_TYPE (TREE_TYPE (fn));
7609 nargs = vec_safe_length (args);
7610 if (first_arg == NULL_TREE)
7611 argarray = args->address ();
7612 else
7614 tree *alcarray;
7615 unsigned int ix;
7616 tree arg;
7618 ++nargs;
7619 alcarray = XALLOCAVEC (tree, nargs);
7620 alcarray[0] = build_this (first_arg);
7621 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
7622 alcarray[ix + 1] = arg;
7623 argarray = alcarray;
7626 addr = build_addr_func (fn, complain);
7627 if (addr == error_mark_node)
7628 return error_mark_node;
7629 expr = build_call_array_loc (input_location, return_type,
7630 addr, nargs, argarray);
7631 if (TREE_THIS_VOLATILE (fn) && cfun)
7632 current_function_returns_abnormally = 1;
7633 return convert_from_reference (expr);
7636 /* Give any warnings we noticed during overload resolution. */
7637 if (cand->warnings && (complain & tf_warning))
7639 struct candidate_warning *w;
7640 for (w = cand->warnings; w; w = w->next)
7641 joust (cand, w->loser, 1, complain);
7644 /* OK, we're actually calling this inherited constructor; set its deletedness
7645 appropriately. We can get away with doing this here because calling is
7646 the only way to refer to a constructor. */
7647 if (DECL_INHERITED_CTOR (fn))
7648 deduce_inheriting_ctor (fn);
7650 /* Make =delete work with SFINAE. */
7651 if (DECL_DELETED_FN (fn) && !(complain & tf_error))
7652 return error_mark_node;
7654 if (DECL_FUNCTION_MEMBER_P (fn))
7656 tree access_fn;
7657 /* If FN is a template function, two cases must be considered.
7658 For example:
7660 struct A {
7661 protected:
7662 template <class T> void f();
7664 template <class T> struct B {
7665 protected:
7666 void g();
7668 struct C : A, B<int> {
7669 using A::f; // #1
7670 using B<int>::g; // #2
7673 In case #1 where `A::f' is a member template, DECL_ACCESS is
7674 recorded in the primary template but not in its specialization.
7675 We check access of FN using its primary template.
7677 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7678 because it is a member of class template B, DECL_ACCESS is
7679 recorded in the specialization `B<int>::g'. We cannot use its
7680 primary template because `B<T>::g' and `B<int>::g' may have
7681 different access. */
7682 if (DECL_TEMPLATE_INFO (fn)
7683 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
7684 access_fn = DECL_TI_TEMPLATE (fn);
7685 else
7686 access_fn = fn;
7687 if (!perform_or_defer_access_check (cand->access_path, access_fn,
7688 fn, complain))
7689 return error_mark_node;
7692 /* If we're checking for implicit delete, don't bother with argument
7693 conversions. */
7694 if (flags & LOOKUP_SPECULATIVE)
7696 if (DECL_DELETED_FN (fn))
7698 if (complain & tf_error)
7699 mark_used (fn);
7700 return error_mark_node;
7702 if (cand->viable == 1)
7703 return fn;
7704 else if (!(complain & tf_error))
7705 /* Reject bad conversions now. */
7706 return error_mark_node;
7707 /* else continue to get conversion error. */
7710 /* N3276 magic doesn't apply to nested calls. */
7711 tsubst_flags_t decltype_flag = (complain & tf_decltype);
7712 complain &= ~tf_decltype;
7713 /* No-Cleanup doesn't apply to nested calls either. */
7714 tsubst_flags_t no_cleanup_complain = complain;
7715 complain &= ~tf_no_cleanup;
7717 /* Find maximum size of vector to hold converted arguments. */
7718 parmlen = list_length (parm);
7719 nargs = vec_safe_length (args) + (first_arg != NULL_TREE ? 1 : 0);
7720 if (parmlen > nargs)
7721 nargs = parmlen;
7722 argarray = XALLOCAVEC (tree, nargs);
7724 /* The implicit parameters to a constructor are not considered by overload
7725 resolution, and must be of the proper type. */
7726 if (DECL_CONSTRUCTOR_P (fn))
7728 tree object_arg;
7729 if (first_arg != NULL_TREE)
7731 object_arg = first_arg;
7732 first_arg = NULL_TREE;
7734 else
7736 object_arg = (*args)[arg_index];
7737 ++arg_index;
7739 argarray[j++] = build_this (object_arg);
7740 parm = TREE_CHAIN (parm);
7741 /* We should never try to call the abstract constructor. */
7742 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn));
7744 if (DECL_HAS_VTT_PARM_P (fn))
7746 argarray[j++] = (*args)[arg_index];
7747 ++arg_index;
7748 parm = TREE_CHAIN (parm);
7751 if (flags & LOOKUP_PREFER_RVALUE)
7753 /* The implicit move specified in 15.8.3/3 fails "...if the type of
7754 the first parameter of the selected constructor is not an rvalue
7755 reference to the object’s type (possibly cv-qualified)...." */
7756 gcc_assert (!(complain & tf_error));
7757 tree ptype = convs[0]->type;
7758 if (TREE_CODE (ptype) != REFERENCE_TYPE
7759 || !TYPE_REF_IS_RVALUE (ptype)
7760 || CONVERSION_RANK (convs[0]) > cr_exact)
7761 return error_mark_node;
7764 /* Bypass access control for 'this' parameter. */
7765 else if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
7767 tree parmtype = TREE_VALUE (parm);
7768 tree arg = build_this (first_arg != NULL_TREE
7769 ? first_arg
7770 : (*args)[arg_index]);
7771 tree argtype = TREE_TYPE (arg);
7772 tree converted_arg;
7773 tree base_binfo;
7775 if (arg == error_mark_node)
7776 return error_mark_node;
7778 if (convs[i]->bad_p)
7780 if (complain & tf_error)
7782 if (permerror (input_location, "passing %qT as %<this%> "
7783 "argument discards qualifiers",
7784 TREE_TYPE (argtype)))
7785 inform (DECL_SOURCE_LOCATION (fn), " in call to %qD", fn);
7787 else
7788 return error_mark_node;
7791 /* See if the function member or the whole class type is declared
7792 final and the call can be devirtualized. */
7793 if (DECL_FINAL_P (fn)
7794 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn))))
7795 flags |= LOOKUP_NONVIRTUAL;
7797 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
7798 X is called for an object that is not of type X, or of a type
7799 derived from X, the behavior is undefined.
7801 So we can assume that anything passed as 'this' is non-null, and
7802 optimize accordingly. */
7803 gcc_assert (TYPE_PTR_P (parmtype));
7804 /* Convert to the base in which the function was declared. */
7805 gcc_assert (cand->conversion_path != NULL_TREE);
7806 converted_arg = build_base_path (PLUS_EXPR,
7807 arg,
7808 cand->conversion_path,
7809 1, complain);
7810 /* Check that the base class is accessible. */
7811 if (!accessible_base_p (TREE_TYPE (argtype),
7812 BINFO_TYPE (cand->conversion_path), true))
7814 if (complain & tf_error)
7815 error ("%qT is not an accessible base of %qT",
7816 BINFO_TYPE (cand->conversion_path),
7817 TREE_TYPE (argtype));
7818 else
7819 return error_mark_node;
7821 /* If fn was found by a using declaration, the conversion path
7822 will be to the derived class, not the base declaring fn. We
7823 must convert from derived to base. */
7824 base_binfo = lookup_base (TREE_TYPE (TREE_TYPE (converted_arg)),
7825 TREE_TYPE (parmtype), ba_unique,
7826 NULL, complain);
7827 converted_arg = build_base_path (PLUS_EXPR, converted_arg,
7828 base_binfo, 1, complain);
7830 argarray[j++] = converted_arg;
7831 parm = TREE_CHAIN (parm);
7832 if (first_arg != NULL_TREE)
7833 first_arg = NULL_TREE;
7834 else
7835 ++arg_index;
7836 ++i;
7837 is_method = 1;
7840 gcc_assert (first_arg == NULL_TREE);
7841 for (; arg_index < vec_safe_length (args) && parm;
7842 parm = TREE_CHAIN (parm), ++arg_index, ++i)
7844 tree type = TREE_VALUE (parm);
7845 tree arg = (*args)[arg_index];
7846 bool conversion_warning = true;
7848 conv = convs[i];
7850 /* If the argument is NULL and used to (implicitly) instantiate a
7851 template function (and bind one of the template arguments to
7852 the type of 'long int'), we don't want to warn about passing NULL
7853 to non-pointer argument.
7854 For example, if we have this template function:
7856 template<typename T> void func(T x) {}
7858 we want to warn (when -Wconversion is enabled) in this case:
7860 void foo() {
7861 func<int>(NULL);
7864 but not in this case:
7866 void foo() {
7867 func(NULL);
7870 if (null_node_p (arg)
7871 && DECL_TEMPLATE_INFO (fn)
7872 && cand->template_decl
7873 && !(flags & LOOKUP_EXPLICIT_TMPL_ARGS))
7874 conversion_warning = false;
7876 /* Warn about initializer_list deduction that isn't currently in the
7877 working draft. */
7878 if (cxx_dialect > cxx98
7879 && flag_deduce_init_list
7880 && cand->template_decl
7881 && is_std_init_list (non_reference (type))
7882 && BRACE_ENCLOSED_INITIALIZER_P (arg))
7884 tree tmpl = TI_TEMPLATE (cand->template_decl);
7885 tree realparm = chain_index (j, DECL_ARGUMENTS (cand->fn));
7886 tree patparm = get_pattern_parm (realparm, tmpl);
7887 tree pattype = TREE_TYPE (patparm);
7888 if (PACK_EXPANSION_P (pattype))
7889 pattype = PACK_EXPANSION_PATTERN (pattype);
7890 pattype = non_reference (pattype);
7892 if (TREE_CODE (pattype) == TEMPLATE_TYPE_PARM
7893 && (cand->explicit_targs == NULL_TREE
7894 || (TREE_VEC_LENGTH (cand->explicit_targs)
7895 <= TEMPLATE_TYPE_IDX (pattype))))
7897 pedwarn (input_location, 0, "deducing %qT as %qT",
7898 non_reference (TREE_TYPE (patparm)),
7899 non_reference (type));
7900 pedwarn (DECL_SOURCE_LOCATION (cand->fn), 0,
7901 " in call to %qD", cand->fn);
7902 pedwarn (input_location, 0,
7903 " (you can disable this with -fno-deduce-init-list)");
7907 /* Set user_conv_p on the argument conversions, so rvalue/base handling
7908 knows not to allow any more UDCs. This needs to happen after we
7909 process cand->warnings. */
7910 if (flags & LOOKUP_NO_CONVERSION)
7911 conv->user_conv_p = true;
7913 tsubst_flags_t arg_complain = complain;
7914 if (!conversion_warning)
7915 arg_complain &= ~tf_warning;
7917 val = convert_like_with_context (conv, arg, fn, i - is_method,
7918 arg_complain);
7919 val = convert_for_arg_passing (type, val, arg_complain);
7921 if (val == error_mark_node)
7922 return error_mark_node;
7923 else
7924 argarray[j++] = val;
7927 /* Default arguments */
7928 for (; parm && parm != void_list_node; parm = TREE_CHAIN (parm), i++)
7930 if (TREE_VALUE (parm) == error_mark_node)
7931 return error_mark_node;
7932 val = convert_default_arg (TREE_VALUE (parm),
7933 TREE_PURPOSE (parm),
7934 fn, i - is_method,
7935 complain);
7936 if (val == error_mark_node)
7937 return error_mark_node;
7938 argarray[j++] = val;
7941 /* Ellipsis */
7942 int magic = magic_varargs_p (fn);
7943 for (; arg_index < vec_safe_length (args); ++arg_index)
7945 tree a = (*args)[arg_index];
7946 if ((magic == 3 && arg_index == 2) || magic == 2)
7948 /* Do no conversions for certain magic varargs. */
7949 a = mark_type_use (a);
7950 if (TREE_CODE (a) == FUNCTION_DECL && reject_gcc_builtin (a))
7951 return error_mark_node;
7953 else if (magic != 0)
7954 /* For other magic varargs only do decay_conversion. */
7955 a = decay_conversion (a, complain);
7956 else if (DECL_CONSTRUCTOR_P (fn)
7957 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn),
7958 TREE_TYPE (a)))
7960 /* Avoid infinite recursion trying to call A(...). */
7961 if (complain & tf_error)
7962 /* Try to call the actual copy constructor for a good error. */
7963 call_copy_ctor (a, complain);
7964 return error_mark_node;
7966 else
7967 a = convert_arg_to_ellipsis (a, complain);
7968 if (a == error_mark_node)
7969 return error_mark_node;
7970 argarray[j++] = a;
7973 gcc_assert (j <= nargs);
7974 nargs = j;
7976 /* Avoid to do argument-transformation, if warnings for format, and for
7977 nonnull are disabled. Just in case that at least one of them is active
7978 the check_function_arguments function might warn about something. */
7980 bool warned_p = false;
7981 if (warn_nonnull
7982 || warn_format
7983 || warn_suggest_attribute_format
7984 || warn_restrict)
7986 tree *fargs = (!nargs ? argarray
7987 : (tree *) alloca (nargs * sizeof (tree)));
7988 for (j = 0; j < nargs; j++)
7989 fargs[j] = maybe_constant_value (argarray[j]);
7991 warned_p = check_function_arguments (input_location, fn, TREE_TYPE (fn),
7992 nargs, fargs, NULL);
7995 if (DECL_INHERITED_CTOR (fn))
7997 /* Check for passing ellipsis arguments to an inherited constructor. We
7998 could handle this by open-coding the inherited constructor rather than
7999 defining it, but let's not bother now. */
8000 if (!cp_unevaluated_operand
8001 && cand->num_convs
8002 && cand->convs[cand->num_convs-1]->ellipsis_p)
8004 if (complain & tf_error)
8006 sorry ("passing arguments to ellipsis of inherited constructor "
8007 "%qD", cand->fn);
8008 inform (DECL_SOURCE_LOCATION (cand->fn), "declared here");
8010 return error_mark_node;
8013 /* A base constructor inheriting from a virtual base doesn't get the
8014 inherited arguments, just this and __vtt. */
8015 if (ctor_omit_inherited_parms (fn))
8016 nargs = 2;
8019 /* Avoid actually calling copy constructors and copy assignment operators,
8020 if possible. */
8022 if (! flag_elide_constructors)
8023 /* Do things the hard way. */;
8024 else if (cand->num_convs == 1
8025 && (DECL_COPY_CONSTRUCTOR_P (fn)
8026 || DECL_MOVE_CONSTRUCTOR_P (fn))
8027 /* It's unsafe to elide the constructor when handling
8028 a noexcept-expression, it may evaluate to the wrong
8029 value (c++/53025). */
8030 && cp_noexcept_operand == 0)
8032 tree targ;
8033 tree arg = argarray[num_artificial_parms_for (fn)];
8034 tree fa;
8035 bool trivial = trivial_fn_p (fn);
8037 /* Pull out the real argument, disregarding const-correctness. */
8038 targ = arg;
8039 /* Strip the reference binding for the constructor parameter. */
8040 if (CONVERT_EXPR_P (targ)
8041 && TREE_CODE (TREE_TYPE (targ)) == REFERENCE_TYPE)
8042 targ = TREE_OPERAND (targ, 0);
8043 /* But don't strip any other reference bindings; binding a temporary to a
8044 reference prevents copy elision. */
8045 while ((CONVERT_EXPR_P (targ)
8046 && TREE_CODE (TREE_TYPE (targ)) != REFERENCE_TYPE)
8047 || TREE_CODE (targ) == NON_LVALUE_EXPR)
8048 targ = TREE_OPERAND (targ, 0);
8049 if (TREE_CODE (targ) == ADDR_EXPR)
8051 targ = TREE_OPERAND (targ, 0);
8052 if (!same_type_ignoring_top_level_qualifiers_p
8053 (TREE_TYPE (TREE_TYPE (arg)), TREE_TYPE (targ)))
8054 targ = NULL_TREE;
8056 else
8057 targ = NULL_TREE;
8059 if (targ)
8060 arg = targ;
8061 else
8062 arg = cp_build_fold_indirect_ref (arg);
8064 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8065 subobject. */
8066 if (CHECKING_P && cxx_dialect >= cxx17)
8067 gcc_assert (TREE_CODE (arg) != TARGET_EXPR
8068 /* It's from binding the ref parm to a packed field. */
8069 || convs[0]->need_temporary_p
8070 || seen_error ()
8071 /* See unsafe_copy_elision_p. */
8072 || DECL_BASE_CONSTRUCTOR_P (fn));
8074 /* [class.copy]: the copy constructor is implicitly defined even if
8075 the implementation elided its use. */
8076 if (!trivial || DECL_DELETED_FN (fn))
8078 if (!mark_used (fn, complain) && !(complain & tf_error))
8079 return error_mark_node;
8080 already_used = true;
8083 /* If we're creating a temp and we already have one, don't create a
8084 new one. If we're not creating a temp but we get one, use
8085 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8086 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8087 temp or an INIT_EXPR otherwise. */
8088 fa = argarray[0];
8089 if (is_dummy_object (fa))
8091 if (TREE_CODE (arg) == TARGET_EXPR)
8092 return arg;
8093 else if (trivial)
8094 return force_target_expr (DECL_CONTEXT (fn), arg, complain);
8096 else if ((trivial || TREE_CODE (arg) == TARGET_EXPR)
8097 && !unsafe_copy_elision_p (fa, arg))
8099 tree to = cp_stabilize_reference (cp_build_fold_indirect_ref (fa));
8101 val = build2 (INIT_EXPR, DECL_CONTEXT (fn), to, arg);
8102 return val;
8105 else if (DECL_ASSIGNMENT_OPERATOR_P (fn)
8106 && DECL_OVERLOADED_OPERATOR_IS (fn, NOP_EXPR)
8107 && trivial_fn_p (fn)
8108 && !DECL_DELETED_FN (fn))
8110 tree to = cp_stabilize_reference
8111 (cp_build_fold_indirect_ref (argarray[0]));
8112 tree type = TREE_TYPE (to);
8113 tree as_base = CLASSTYPE_AS_BASE (type);
8114 tree arg = argarray[1];
8116 if (is_really_empty_class (type))
8118 /* Avoid copying empty classes. */
8119 val = build2 (COMPOUND_EXPR, type, arg, to);
8120 TREE_NO_WARNING (val) = 1;
8122 else if (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (as_base)))
8124 arg = cp_build_fold_indirect_ref (arg);
8125 val = build2 (MODIFY_EXPR, TREE_TYPE (to), to, arg);
8126 /* Handle NSDMI that refer to the object being initialized. */
8127 replace_placeholders (arg, to);
8129 else
8131 /* We must only copy the non-tail padding parts. */
8132 tree arg0, arg2, t;
8133 tree array_type, alias_set;
8135 arg2 = TYPE_SIZE_UNIT (as_base);
8136 arg0 = cp_build_addr_expr (to, complain);
8138 array_type = build_array_type (unsigned_char_type_node,
8139 build_index_type
8140 (size_binop (MINUS_EXPR,
8141 arg2, size_int (1))));
8142 alias_set = build_int_cst (build_pointer_type (type), 0);
8143 t = build2 (MODIFY_EXPR, void_type_node,
8144 build2 (MEM_REF, array_type, arg0, alias_set),
8145 build2 (MEM_REF, array_type, arg, alias_set));
8146 val = build2 (COMPOUND_EXPR, TREE_TYPE (to), t, to);
8147 TREE_NO_WARNING (val) = 1;
8150 return val;
8152 else if (!DECL_DELETED_FN (fn)
8153 && trivial_fn_p (fn))
8155 if (DECL_DESTRUCTOR_P (fn))
8156 return fold_convert (void_type_node, argarray[0]);
8157 else if (default_ctor_p (fn))
8159 if (is_dummy_object (argarray[0]))
8160 return force_target_expr (DECL_CONTEXT (fn), void_node,
8161 no_cleanup_complain);
8162 else
8163 return cp_build_fold_indirect_ref (argarray[0]);
8167 /* For calls to a multi-versioned function, overload resolution
8168 returns the function with the highest target priority, that is,
8169 the version that will checked for dispatching first. If this
8170 version is inlinable, a direct call to this version can be made
8171 otherwise the call should go through the dispatcher. */
8173 if (DECL_FUNCTION_VERSIONED (fn)
8174 && (current_function_decl == NULL
8175 || !targetm.target_option.can_inline_p (current_function_decl, fn)))
8177 fn = get_function_version_dispatcher (fn);
8178 if (fn == NULL)
8179 return NULL;
8180 if (!already_used)
8181 mark_versions_used (fn);
8184 if (!already_used
8185 && !mark_used (fn, complain))
8186 return error_mark_node;
8188 /* Warn if the built-in writes to an object of a non-trivial type. */
8189 if (warn_class_memaccess
8190 && vec_safe_length (args) >= 2
8191 && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL)
8192 maybe_warn_class_memaccess (input_location, fn, args);
8194 if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0
8195 /* Don't mess with virtual lookup in instantiate_non_dependent_expr;
8196 virtual functions can't be constexpr. */
8197 && !in_template_function ())
8199 tree t;
8200 tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (argarray[0])),
8201 DECL_CONTEXT (fn),
8202 ba_any, NULL, complain);
8203 gcc_assert (binfo && binfo != error_mark_node);
8205 argarray[0] = build_base_path (PLUS_EXPR, argarray[0], binfo, 1,
8206 complain);
8207 if (TREE_SIDE_EFFECTS (argarray[0]))
8208 argarray[0] = save_expr (argarray[0]);
8209 t = build_pointer_type (TREE_TYPE (fn));
8210 fn = build_vfn_ref (argarray[0], DECL_VINDEX (fn));
8211 TREE_TYPE (fn) = t;
8213 else
8215 fn = build_addr_func (fn, complain);
8216 if (fn == error_mark_node)
8217 return error_mark_node;
8220 tree call = build_cxx_call (fn, nargs, argarray, complain|decltype_flag);
8221 if (call == error_mark_node)
8222 return call;
8223 if (cand->flags & LOOKUP_LIST_INIT_CTOR)
8225 tree c = extract_call_expr (call);
8226 /* build_new_op_1 will clear this when appropriate. */
8227 CALL_EXPR_ORDERED_ARGS (c) = true;
8229 if (warned_p)
8231 tree c = extract_call_expr (call);
8232 if (TREE_CODE (c) == CALL_EXPR)
8233 TREE_NO_WARNING (c) = 1;
8235 return call;
8238 /* Return the DECL of the first non-public data member of class TYPE
8239 or null if none can be found. */
8241 static tree
8242 first_non_public_field (tree type)
8244 if (!CLASS_TYPE_P (type))
8245 return NULL_TREE;
8247 for (tree field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
8249 if (TREE_CODE (field) != FIELD_DECL)
8250 continue;
8251 if (TREE_STATIC (field))
8252 continue;
8253 if (TREE_PRIVATE (field) || TREE_PROTECTED (field))
8254 return field;
8257 int i = 0;
8259 for (tree base_binfo, binfo = TYPE_BINFO (type);
8260 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
8262 tree base = TREE_TYPE (base_binfo);
8264 if (tree field = first_non_public_field (base))
8265 return field;
8268 return NULL_TREE;
8271 /* Return true if all copy and move assignment operator overloads for
8272 class TYPE are trivial and at least one of them is not deleted and,
8273 when ACCESS is set, accessible. Return false otherwise. Set
8274 HASASSIGN to true when the TYPE has a (not necessarily trivial)
8275 copy or move assignment. */
8277 static bool
8278 has_trivial_copy_assign_p (tree type, bool access, bool *hasassign)
8280 tree fns = get_class_binding (type, assign_op_identifier);
8281 bool all_trivial = true;
8283 /* Iterate over overloads of the assignment operator, checking
8284 accessible copy assignments for triviality. */
8286 for (ovl_iterator oi (fns); oi; ++oi)
8288 tree f = *oi;
8290 /* Skip operators that aren't copy assignments. */
8291 if (!copy_fn_p (f))
8292 continue;
8294 bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f))
8295 || accessible_p (TYPE_BINFO (type), f, true));
8297 /* Skip template assignment operators and deleted functions. */
8298 if (TREE_CODE (f) != FUNCTION_DECL || DECL_DELETED_FN (f))
8299 continue;
8301 if (accessible)
8302 *hasassign = true;
8304 if (!accessible || !trivial_fn_p (f))
8305 all_trivial = false;
8307 /* Break early when both properties have been determined. */
8308 if (*hasassign && !all_trivial)
8309 break;
8312 /* Return true if they're all trivial and one of the expressions
8313 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
8314 tree ref = cp_build_reference_type (type, false);
8315 return (all_trivial
8316 && (is_trivially_xible (MODIFY_EXPR, type, type)
8317 || is_trivially_xible (MODIFY_EXPR, type, ref)));
8320 /* Return true if all copy and move ctor overloads for class TYPE are
8321 trivial and at least one of them is not deleted and, when ACCESS is
8322 set, accessible. Return false otherwise. Set each element of HASCTOR[]
8323 to true when the TYPE has a (not necessarily trivial) default and copy
8324 (or move) ctor, respectively. */
8326 static bool
8327 has_trivial_copy_p (tree type, bool access, bool hasctor[2])
8329 tree fns = get_class_binding (type, complete_ctor_identifier);
8330 bool all_trivial = true;
8332 for (ovl_iterator oi (fns); oi; ++oi)
8334 tree f = *oi;
8336 /* Skip template constructors. */
8337 if (TREE_CODE (f) != FUNCTION_DECL)
8338 continue;
8340 bool cpy_or_move_ctor_p = copy_fn_p (f);
8342 /* Skip ctors other than default, copy, and move. */
8343 if (!cpy_or_move_ctor_p && !default_ctor_p (f))
8344 continue;
8346 if (DECL_DELETED_FN (f))
8347 continue;
8349 bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f))
8350 || accessible_p (TYPE_BINFO (type), f, true));
8352 if (accessible)
8353 hasctor[cpy_or_move_ctor_p] = true;
8355 if (cpy_or_move_ctor_p && (!accessible || !trivial_fn_p (f)))
8356 all_trivial = false;
8358 /* Break early when both properties have been determined. */
8359 if (hasctor[0] && hasctor[1] && !all_trivial)
8360 break;
8363 return all_trivial;
8366 /* Issue a warning on a call to the built-in function FNDECL if it is
8367 a raw memory write whose destination is not an object of (something
8368 like) trivial or standard layout type with a non-deleted assignment
8369 and copy ctor. Detects const correctness violations, corrupting
8370 references, virtual table pointers, and bypassing non-trivial
8371 assignments. */
8373 static void
8374 maybe_warn_class_memaccess (location_t loc, tree fndecl,
8375 const vec<tree, va_gc> *args)
8377 /* Except for bcopy where it's second, the destination pointer is
8378 the first argument for all functions handled here. Compute
8379 the index of the destination and source arguments. */
8380 unsigned dstidx = DECL_FUNCTION_CODE (fndecl) == BUILT_IN_BCOPY;
8381 unsigned srcidx = !dstidx;
8383 tree dest = (*args)[dstidx];
8384 if (!TREE_TYPE (dest) || !POINTER_TYPE_P (TREE_TYPE (dest)))
8385 return;
8387 tree srctype = NULL_TREE;
8389 /* Determine the type of the pointed-to object and whether it's
8390 a complete class type. */
8391 tree desttype = TREE_TYPE (TREE_TYPE (dest));
8393 if (!desttype || !COMPLETE_TYPE_P (desttype) || !CLASS_TYPE_P (desttype))
8394 return;
8396 /* Check to see if the raw memory call is made by a ctor or dtor
8397 with this as the destination argument for the destination type.
8398 If so, be more permissive. */
8399 if (current_function_decl
8400 && (DECL_CONSTRUCTOR_P (current_function_decl)
8401 || DECL_DESTRUCTOR_P (current_function_decl))
8402 && is_this_parameter (tree_strip_nop_conversions (dest)))
8404 tree ctx = DECL_CONTEXT (current_function_decl);
8405 bool special = same_type_ignoring_top_level_qualifiers_p (ctx, desttype);
8407 tree binfo = TYPE_BINFO (ctx);
8409 /* A ctor and dtor for a class with no bases and no virtual functions
8410 can do whatever they want. Bail early with no further checking. */
8411 if (special && !BINFO_VTABLE (binfo) && !BINFO_N_BASE_BINFOS (binfo))
8412 return;
8415 /* True if the class is trivial. */
8416 bool trivial = trivial_type_p (desttype);
8418 /* Set to true if DESTYPE has an accessible copy assignment. */
8419 bool hasassign = false;
8420 /* True if all of the class' overloaded copy assignment operators
8421 are all trivial (and not deleted) and at least one of them is
8422 accessible. */
8423 bool trivassign = has_trivial_copy_assign_p (desttype, true, &hasassign);
8425 /* Set to true if DESTTYPE has an accessible default and copy ctor,
8426 respectively. */
8427 bool hasctors[2] = { false, false };
8429 /* True if all of the class' overloaded copy constructors are all
8430 trivial (and not deleted) and at least one of them is accessible. */
8431 bool trivcopy = has_trivial_copy_p (desttype, true, hasctors);
8433 /* Set FLD to the first private/protected member of the class. */
8434 tree fld = trivial ? first_non_public_field (desttype) : NULL_TREE;
8436 /* The warning format string. */
8437 const char *warnfmt = NULL;
8438 /* A suggested alternative to offer instead of the raw memory call.
8439 Empty string when none can be come up with. */
8440 const char *suggest = "";
8441 bool warned = false;
8443 switch (DECL_FUNCTION_CODE (fndecl))
8445 case BUILT_IN_MEMSET:
8446 if (!integer_zerop (maybe_constant_value ((*args)[1])))
8448 /* Diagnose setting non-copy-assignable or non-trivial types,
8449 or types with a private member, to (potentially) non-zero
8450 bytes. Since the value of the bytes being written is unknown,
8451 suggest using assignment instead (if one exists). Also warn
8452 for writes into objects for which zero-initialization doesn't
8453 mean all bits clear (pointer-to-member data, where null is all
8454 bits set). Since the value being written is (most likely)
8455 non-zero, simply suggest assignment (but not copy assignment). */
8456 suggest = "; use assignment instead";
8457 if (!trivassign)
8458 warnfmt = G_("%qD writing to an object of type %#qT with "
8459 "no trivial copy-assignment");
8460 else if (!trivial)
8461 warnfmt = G_("%qD writing to an object of non-trivial type %#qT%s");
8462 else if (fld)
8464 const char *access = TREE_PRIVATE (fld) ? "private" : "protected";
8465 warned = warning_at (loc, OPT_Wclass_memaccess,
8466 "%qD writing to an object of type %#qT with "
8467 "%qs member %qD",
8468 fndecl, desttype, access, fld);
8470 else if (!zero_init_p (desttype))
8471 warnfmt = G_("%qD writing to an object of type %#qT containing "
8472 "a pointer to data member%s");
8474 break;
8476 /* Fall through. */
8478 case BUILT_IN_BZERO:
8479 /* Similarly to the above, diagnose clearing non-trivial or non-
8480 standard layout objects, or objects of types with no assignmenmt.
8481 Since the value being written is known to be zero, suggest either
8482 copy assignment, copy ctor, or default ctor as an alternative,
8483 depending on what's available. */
8485 if (hasassign && hasctors[0])
8486 suggest = G_("; use assignment or value-initialization instead");
8487 else if (hasassign)
8488 suggest = G_("; use assignment instead");
8489 else if (hasctors[0])
8490 suggest = G_("; use value-initialization instead");
8492 if (!trivassign)
8493 warnfmt = G_("%qD clearing an object of type %#qT with "
8494 "no trivial copy-assignment%s");
8495 else if (!trivial)
8496 warnfmt = G_("%qD clearing an object of non-trivial type %#qT%s");
8497 else if (!zero_init_p (desttype))
8498 warnfmt = G_("%qD clearing an object of type %#qT containing "
8499 "a pointer-to-member%s");
8500 break;
8502 case BUILT_IN_BCOPY:
8503 case BUILT_IN_MEMCPY:
8504 case BUILT_IN_MEMMOVE:
8505 case BUILT_IN_MEMPCPY:
8506 /* Determine the type of the source object. */
8507 srctype = TREE_TYPE ((*args)[srcidx]);
8508 if (!srctype || !POINTER_TYPE_P (srctype))
8509 srctype = void_type_node;
8510 else
8511 srctype = TREE_TYPE (srctype);
8513 /* Since it's impossible to determine wheter the byte copy is
8514 being used in place of assignment to an existing object or
8515 as a substitute for initialization, assume it's the former.
8516 Determine the best alternative to use instead depending on
8517 what's not deleted. */
8518 if (hasassign && hasctors[1])
8519 suggest = G_("; use copy-assignment or copy-initialization instead");
8520 else if (hasassign)
8521 suggest = G_("; use copy-assignment instead");
8522 else if (hasctors[1])
8523 suggest = G_("; use copy-initialization instead");
8525 if (!trivassign)
8526 warnfmt = G_("%qD writing to an object of type %#qT with no trivial "
8527 "copy-assignment%s");
8528 else if (!trivially_copyable_p (desttype))
8529 warnfmt = G_("%qD writing to an object of non-trivially copyable "
8530 "type %#qT%s");
8531 else if (!trivcopy)
8532 warnfmt = G_("%qD writing to an object with a deleted copy constructor");
8534 else if (!trivial
8535 && !VOID_TYPE_P (srctype)
8536 && !char_type_p (TYPE_MAIN_VARIANT (srctype))
8537 && !same_type_ignoring_top_level_qualifiers_p (desttype,
8538 srctype))
8540 /* Warn when copying into a non-trivial object from an object
8541 of a different type other than void or char. */
8542 warned = warning_at (loc, OPT_Wclass_memaccess,
8543 "%qD copying an object of non-trivial type "
8544 "%#qT from an array of %#qT",
8545 fndecl, desttype, srctype);
8547 else if (fld
8548 && !VOID_TYPE_P (srctype)
8549 && !char_type_p (TYPE_MAIN_VARIANT (srctype))
8550 && !same_type_ignoring_top_level_qualifiers_p (desttype,
8551 srctype))
8553 const char *access = TREE_PRIVATE (fld) ? "private" : "protected";
8554 warned = warning_at (loc, OPT_Wclass_memaccess,
8555 "%qD copying an object of type %#qT with "
8556 "%qs member %qD from an array of %#qT; use "
8557 "assignment or copy-initialization instead",
8558 fndecl, desttype, access, fld, srctype);
8560 else if (!trivial && vec_safe_length (args) > 2)
8562 tree sz = maybe_constant_value ((*args)[2]);
8563 if (!tree_fits_uhwi_p (sz))
8564 break;
8566 /* Finally, warn on partial copies. */
8567 unsigned HOST_WIDE_INT typesize
8568 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype));
8569 if (unsigned HOST_WIDE_INT partial = tree_to_uhwi (sz) % typesize)
8570 warned = warning_at (loc, OPT_Wclass_memaccess,
8571 (typesize - partial > 1
8572 ? G_("%qD writing to an object of "
8573 "a non-trivial type %#qT leaves %wu "
8574 "bytes unchanged")
8575 : G_("%qD writing to an object of "
8576 "a non-trivial type %#qT leaves %wu "
8577 "byte unchanged")),
8578 fndecl, desttype, typesize - partial);
8580 break;
8582 case BUILT_IN_REALLOC:
8584 if (!trivially_copyable_p (desttype))
8585 warnfmt = G_("%qD moving an object of non-trivially copyable type "
8586 "%#qT; use %<new%> and %<delete%> instead");
8587 else if (!trivcopy)
8588 warnfmt = G_("%qD moving an object of type %#qT with deleted copy "
8589 "constructor; use %<new%> and %<delete%> instead");
8590 else if (!get_dtor (desttype, tf_none))
8591 warnfmt = G_("%qD moving an object of type %#qT with deleted "
8592 "destructor");
8593 else if (!trivial)
8595 tree sz = maybe_constant_value ((*args)[1]);
8596 if (TREE_CODE (sz) == INTEGER_CST
8597 && tree_int_cst_lt (sz, TYPE_SIZE_UNIT (desttype)))
8598 /* Finally, warn on reallocation into insufficient space. */
8599 warned = warning_at (loc, OPT_Wclass_memaccess,
8600 "%qD moving an object of non-trivial type "
8601 "%#qT and size %E into a region of size %E",
8602 fndecl, desttype, TYPE_SIZE_UNIT (desttype),
8603 sz);
8605 break;
8607 default:
8608 return;
8611 if (warnfmt)
8613 if (suggest)
8614 warned = warning_at (loc, OPT_Wclass_memaccess,
8615 warnfmt, fndecl, desttype, suggest);
8616 else
8617 warned = warning_at (loc, OPT_Wclass_memaccess,
8618 warnfmt, fndecl, desttype);
8621 if (warned)
8622 inform (location_of (desttype), "%#qT declared here", desttype);
8625 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
8626 This function performs no overload resolution, conversion, or other
8627 high-level operations. */
8629 tree
8630 build_cxx_call (tree fn, int nargs, tree *argarray,
8631 tsubst_flags_t complain)
8633 tree fndecl;
8635 /* Remember roughly where this call is. */
8636 location_t loc = EXPR_LOC_OR_LOC (fn, input_location);
8637 fn = build_call_a (fn, nargs, argarray);
8638 SET_EXPR_LOCATION (fn, loc);
8640 fndecl = get_callee_fndecl (fn);
8642 /* Check that arguments to builtin functions match the expectations. */
8643 if (fndecl
8644 && DECL_BUILT_IN (fndecl)
8645 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
8647 int i;
8649 /* We need to take care that values to BUILT_IN_NORMAL
8650 are reduced. */
8651 for (i = 0; i < nargs; i++)
8652 argarray[i] = fold_non_dependent_expr (argarray[i]);
8654 if (!check_builtin_function_arguments (EXPR_LOCATION (fn), vNULL, fndecl,
8655 nargs, argarray))
8656 return error_mark_node;
8659 if (VOID_TYPE_P (TREE_TYPE (fn)))
8660 return fn;
8662 /* 5.2.2/11: If a function call is a prvalue of object type: if the
8663 function call is either the operand of a decltype-specifier or the
8664 right operand of a comma operator that is the operand of a
8665 decltype-specifier, a temporary object is not introduced for the
8666 prvalue. The type of the prvalue may be incomplete. */
8667 if (!(complain & tf_decltype))
8669 fn = require_complete_type_sfinae (fn, complain);
8670 if (fn == error_mark_node)
8671 return error_mark_node;
8673 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn)))
8675 fn = build_cplus_new (TREE_TYPE (fn), fn, complain);
8676 maybe_warn_parm_abi (TREE_TYPE (fn), loc);
8679 return convert_from_reference (fn);
8682 /* Returns the value to use for the in-charge parameter when making a
8683 call to a function with the indicated NAME.
8685 FIXME:Can't we find a neater way to do this mapping? */
8687 tree
8688 in_charge_arg_for_name (tree name)
8690 if (IDENTIFIER_CTOR_P (name))
8692 if (name == complete_ctor_identifier)
8693 return integer_one_node;
8694 gcc_checking_assert (name == base_ctor_identifier);
8696 else
8698 if (name == complete_dtor_identifier)
8699 return integer_two_node;
8700 else if (name == deleting_dtor_identifier)
8701 return integer_three_node;
8702 gcc_checking_assert (name == base_dtor_identifier);
8705 return integer_zero_node;
8708 /* We've built up a constructor call RET. Complain if it delegates to the
8709 constructor we're currently compiling. */
8711 static void
8712 check_self_delegation (tree ret)
8714 if (TREE_CODE (ret) == TARGET_EXPR)
8715 ret = TARGET_EXPR_INITIAL (ret);
8716 tree fn = cp_get_callee_fndecl (ret);
8717 if (fn && DECL_ABSTRACT_ORIGIN (fn) == current_function_decl)
8718 error ("constructor delegates to itself");
8721 /* Build a call to a constructor, destructor, or an assignment
8722 operator for INSTANCE, an expression with class type. NAME
8723 indicates the special member function to call; *ARGS are the
8724 arguments. ARGS may be NULL. This may change ARGS. BINFO
8725 indicates the base of INSTANCE that is to be passed as the `this'
8726 parameter to the member function called.
8728 FLAGS are the LOOKUP_* flags to use when processing the call.
8730 If NAME indicates a complete object constructor, INSTANCE may be
8731 NULL_TREE. In this case, the caller will call build_cplus_new to
8732 store the newly constructed object into a VAR_DECL. */
8734 tree
8735 build_special_member_call (tree instance, tree name, vec<tree, va_gc> **args,
8736 tree binfo, int flags, tsubst_flags_t complain)
8738 tree fns;
8739 /* The type of the subobject to be constructed or destroyed. */
8740 tree class_type;
8741 vec<tree, va_gc> *allocated = NULL;
8742 tree ret;
8744 gcc_assert (IDENTIFIER_CDTOR_P (name) || name == assign_op_identifier);
8745 if (TYPE_P (binfo))
8747 /* Resolve the name. */
8748 if (!complete_type_or_maybe_complain (binfo, NULL_TREE, complain))
8749 return error_mark_node;
8751 binfo = TYPE_BINFO (binfo);
8754 gcc_assert (binfo != NULL_TREE);
8756 class_type = BINFO_TYPE (binfo);
8758 /* Handle the special case where INSTANCE is NULL_TREE. */
8759 if (name == complete_ctor_identifier && !instance)
8760 instance = build_dummy_object (class_type);
8761 else
8763 if (IDENTIFIER_DTOR_P (name))
8764 gcc_assert (args == NULL || vec_safe_is_empty (*args));
8766 /* Convert to the base class, if necessary. */
8767 if (!same_type_ignoring_top_level_qualifiers_p
8768 (TREE_TYPE (instance), BINFO_TYPE (binfo)))
8770 if (IDENTIFIER_CDTOR_P (name))
8771 /* For constructors and destructors, either the base is
8772 non-virtual, or it is virtual but we are doing the
8773 conversion from a constructor or destructor for the
8774 complete object. In either case, we can convert
8775 statically. */
8776 instance = convert_to_base_statically (instance, binfo);
8777 else
8779 /* However, for assignment operators, we must convert
8780 dynamically if the base is virtual. */
8781 gcc_checking_assert (name == assign_op_identifier);
8782 instance = build_base_path (PLUS_EXPR, instance,
8783 binfo, /*nonnull=*/1, complain);
8788 gcc_assert (instance != NULL_TREE);
8790 /* In C++17, "If the initializer expression is a prvalue and the
8791 cv-unqualified version of the source type is the same class as the class
8792 of the destination, the initializer expression is used to initialize the
8793 destination object." Handle that here to avoid doing overload
8794 resolution. */
8795 if (cxx_dialect >= cxx17
8796 && args && vec_safe_length (*args) == 1
8797 && name == complete_ctor_identifier)
8799 tree arg = (**args)[0];
8801 /* FIXME P0135 doesn't say how to handle direct initialization from a
8802 type with a suitable conversion operator. Let's handle it like
8803 copy-initialization, but allowing explict conversions. */
8804 tsubst_flags_t sub_complain = tf_warning;
8805 if (!is_dummy_object (instance))
8806 /* If we're using this to initialize a non-temporary object, don't
8807 require the destructor to be accessible. */
8808 sub_complain |= tf_no_cleanup;
8809 if (!reference_related_p (class_type, TREE_TYPE (arg)))
8810 arg = perform_implicit_conversion_flags (class_type, arg,
8811 sub_complain,
8812 flags);
8813 if ((TREE_CODE (arg) == TARGET_EXPR
8814 || TREE_CODE (arg) == CONSTRUCTOR)
8815 && (same_type_ignoring_top_level_qualifiers_p
8816 (class_type, TREE_TYPE (arg))))
8818 if (is_dummy_object (instance))
8819 return arg;
8820 if ((complain & tf_error)
8821 && (flags & LOOKUP_DELEGATING_CONS))
8822 check_self_delegation (arg);
8823 /* Avoid change of behavior on Wunused-var-2.C. */
8824 instance = mark_lvalue_use (instance);
8825 return build2 (INIT_EXPR, class_type, instance, arg);
8829 fns = lookup_fnfields (binfo, name, 1);
8831 /* When making a call to a constructor or destructor for a subobject
8832 that uses virtual base classes, pass down a pointer to a VTT for
8833 the subobject. */
8834 if ((name == base_ctor_identifier
8835 || name == base_dtor_identifier)
8836 && CLASSTYPE_VBASECLASSES (class_type))
8838 tree vtt;
8839 tree sub_vtt;
8841 /* If the current function is a complete object constructor
8842 or destructor, then we fetch the VTT directly.
8843 Otherwise, we look it up using the VTT we were given. */
8844 vtt = DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type));
8845 vtt = decay_conversion (vtt, complain);
8846 if (vtt == error_mark_node)
8847 return error_mark_node;
8848 vtt = build_if_in_charge (vtt, current_vtt_parm);
8849 if (BINFO_SUBVTT_INDEX (binfo))
8850 sub_vtt = fold_build_pointer_plus (vtt, BINFO_SUBVTT_INDEX (binfo));
8851 else
8852 sub_vtt = vtt;
8854 if (args == NULL)
8856 allocated = make_tree_vector ();
8857 args = &allocated;
8860 vec_safe_insert (*args, 0, sub_vtt);
8863 ret = build_new_method_call (instance, fns, args,
8864 TYPE_BINFO (BINFO_TYPE (binfo)),
8865 flags, /*fn=*/NULL,
8866 complain);
8868 if (allocated != NULL)
8869 release_tree_vector (allocated);
8871 if ((complain & tf_error)
8872 && (flags & LOOKUP_DELEGATING_CONS)
8873 && name == complete_ctor_identifier)
8874 check_self_delegation (ret);
8876 return ret;
8879 /* Return the NAME, as a C string. The NAME indicates a function that
8880 is a member of TYPE. *FREE_P is set to true if the caller must
8881 free the memory returned.
8883 Rather than go through all of this, we should simply set the names
8884 of constructors and destructors appropriately, and dispense with
8885 ctor_identifier, dtor_identifier, etc. */
8887 static char *
8888 name_as_c_string (tree name, tree type, bool *free_p)
8890 const char *pretty_name;
8892 /* Assume that we will not allocate memory. */
8893 *free_p = false;
8894 /* Constructors and destructors are special. */
8895 if (IDENTIFIER_CDTOR_P (name))
8897 pretty_name
8898 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type)));
8899 /* For a destructor, add the '~'. */
8900 if (IDENTIFIER_DTOR_P (name))
8902 pretty_name = concat ("~", pretty_name, NULL);
8903 /* Remember that we need to free the memory allocated. */
8904 *free_p = true;
8907 else if (IDENTIFIER_CONV_OP_P (name))
8909 pretty_name = concat ("operator ",
8910 type_as_string_translate (TREE_TYPE (name),
8911 TFF_PLAIN_IDENTIFIER),
8912 NULL);
8913 /* Remember that we need to free the memory allocated. */
8914 *free_p = true;
8916 else
8917 pretty_name = identifier_to_locale (IDENTIFIER_POINTER (name));
8919 return CONST_CAST (char *, pretty_name);
8922 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
8923 be set, upon return, to the function called. ARGS may be NULL.
8924 This may change ARGS. */
8926 static tree
8927 build_new_method_call_1 (tree instance, tree fns, vec<tree, va_gc> **args,
8928 tree conversion_path, int flags,
8929 tree *fn_p, tsubst_flags_t complain)
8931 struct z_candidate *candidates = 0, *cand;
8932 tree explicit_targs = NULL_TREE;
8933 tree basetype = NULL_TREE;
8934 tree access_binfo, binfo;
8935 tree optype;
8936 tree first_mem_arg = NULL_TREE;
8937 tree name;
8938 bool skip_first_for_error;
8939 vec<tree, va_gc> *user_args;
8940 tree call;
8941 tree fn;
8942 int template_only = 0;
8943 bool any_viable_p;
8944 tree orig_instance;
8945 tree orig_fns;
8946 vec<tree, va_gc> *orig_args = NULL;
8947 void *p;
8949 gcc_assert (instance != NULL_TREE);
8951 /* We don't know what function we're going to call, yet. */
8952 if (fn_p)
8953 *fn_p = NULL_TREE;
8955 if (error_operand_p (instance)
8956 || !fns || error_operand_p (fns))
8957 return error_mark_node;
8959 if (!BASELINK_P (fns))
8961 if (complain & tf_error)
8962 error ("call to non-function %qD", fns);
8963 return error_mark_node;
8966 orig_instance = instance;
8967 orig_fns = fns;
8969 /* Dismantle the baselink to collect all the information we need. */
8970 if (!conversion_path)
8971 conversion_path = BASELINK_BINFO (fns);
8972 access_binfo = BASELINK_ACCESS_BINFO (fns);
8973 binfo = BASELINK_BINFO (fns);
8974 optype = BASELINK_OPTYPE (fns);
8975 fns = BASELINK_FUNCTIONS (fns);
8976 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
8978 explicit_targs = TREE_OPERAND (fns, 1);
8979 fns = TREE_OPERAND (fns, 0);
8980 template_only = 1;
8982 gcc_assert (TREE_CODE (fns) == FUNCTION_DECL
8983 || TREE_CODE (fns) == TEMPLATE_DECL
8984 || TREE_CODE (fns) == OVERLOAD);
8985 fn = OVL_FIRST (fns);
8986 name = DECL_NAME (fn);
8988 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (instance));
8989 gcc_assert (CLASS_TYPE_P (basetype));
8991 if (processing_template_decl)
8993 orig_args = args == NULL ? NULL : make_tree_vector_copy (*args);
8994 instance = build_non_dependent_expr (instance);
8995 if (args != NULL)
8996 make_args_non_dependent (*args);
8999 user_args = args == NULL ? NULL : *args;
9000 /* Under DR 147 A::A() is an invalid constructor call,
9001 not a functional cast. */
9002 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
9004 if (! (complain & tf_error))
9005 return error_mark_node;
9007 basetype = DECL_CONTEXT (fn);
9008 name = constructor_name (basetype);
9009 if (permerror (input_location,
9010 "cannot call constructor %<%T::%D%> directly",
9011 basetype, name))
9012 inform (input_location, "for a function-style cast, remove the "
9013 "redundant %<::%D%>", name);
9014 call = build_functional_cast (basetype, build_tree_list_vec (user_args),
9015 complain);
9016 return call;
9019 /* Process the argument list. */
9020 if (args != NULL && *args != NULL)
9022 *args = resolve_args (*args, complain);
9023 if (*args == NULL)
9024 return error_mark_node;
9027 /* Consider the object argument to be used even if we end up selecting a
9028 static member function. */
9029 instance = mark_type_use (instance);
9031 /* Figure out whether to skip the first argument for the error
9032 message we will display to users if an error occurs. We don't
9033 want to display any compiler-generated arguments. The "this"
9034 pointer hasn't been added yet. However, we must remove the VTT
9035 pointer if this is a call to a base-class constructor or
9036 destructor. */
9037 skip_first_for_error = false;
9038 if (IDENTIFIER_CDTOR_P (name))
9040 /* Callers should explicitly indicate whether they want to ctor
9041 the complete object or just the part without virtual bases. */
9042 gcc_assert (name != ctor_identifier);
9044 /* Remove the VTT pointer, if present. */
9045 if ((name == base_ctor_identifier || name == base_dtor_identifier)
9046 && CLASSTYPE_VBASECLASSES (basetype))
9047 skip_first_for_error = true;
9049 /* It's OK to call destructors and constructors on cv-qualified
9050 objects. Therefore, convert the INSTANCE to the unqualified
9051 type, if necessary. */
9052 if (!same_type_p (basetype, TREE_TYPE (instance)))
9054 instance = build_this (instance);
9055 instance = build_nop (build_pointer_type (basetype), instance);
9056 instance = build_fold_indirect_ref (instance);
9059 else
9060 gcc_assert (!DECL_DESTRUCTOR_P (fn) && !DECL_CONSTRUCTOR_P (fn));
9062 /* For the overload resolution we need to find the actual `this`
9063 that would be captured if the call turns out to be to a
9064 non-static member function. Do not actually capture it at this
9065 point. */
9066 if (DECL_CONSTRUCTOR_P (fn))
9067 /* Constructors don't use the enclosing 'this'. */
9068 first_mem_arg = instance;
9069 else
9070 first_mem_arg = maybe_resolve_dummy (instance, false);
9072 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9073 p = conversion_obstack_alloc (0);
9075 /* The number of arguments artificial parms in ARGS; we subtract one because
9076 there's no 'this' in ARGS. */
9077 unsigned skip = num_artificial_parms_for (fn) - 1;
9079 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
9080 initializer, not T({ }). */
9081 if (DECL_CONSTRUCTOR_P (fn)
9082 && vec_safe_length (user_args) > skip
9083 && DIRECT_LIST_INIT_P ((*user_args)[skip]))
9085 tree init_list = (*user_args)[skip];
9086 tree init = NULL_TREE;
9088 gcc_assert (user_args->length () == skip + 1
9089 && !(flags & LOOKUP_ONLYCONVERTING));
9091 /* If the initializer list has no elements and T is a class type with
9092 a default constructor, the object is value-initialized. Handle
9093 this here so we don't need to handle it wherever we use
9094 build_special_member_call. */
9095 if (CONSTRUCTOR_NELTS (init_list) == 0
9096 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype)
9097 /* For a user-provided default constructor, use the normal
9098 mechanisms so that protected access works. */
9099 && type_has_non_user_provided_default_constructor (basetype)
9100 && !processing_template_decl)
9101 init = build_value_init (basetype, complain);
9103 /* If BASETYPE is an aggregate, we need to do aggregate
9104 initialization. */
9105 else if (CP_AGGREGATE_TYPE_P (basetype))
9107 init = reshape_init (basetype, init_list, complain);
9108 init = digest_init (basetype, init, complain);
9111 if (init)
9113 if (is_dummy_object (instance))
9114 return get_target_expr_sfinae (init, complain);
9115 init = build2 (INIT_EXPR, TREE_TYPE (instance), instance, init);
9116 TREE_SIDE_EFFECTS (init) = true;
9117 return init;
9120 /* Otherwise go ahead with overload resolution. */
9121 add_list_candidates (fns, first_mem_arg, user_args,
9122 basetype, explicit_targs, template_only,
9123 conversion_path, access_binfo, flags,
9124 &candidates, complain);
9126 else
9127 add_candidates (fns, first_mem_arg, user_args, optype,
9128 explicit_targs, template_only, conversion_path,
9129 access_binfo, flags, &candidates, complain);
9131 any_viable_p = false;
9132 candidates = splice_viable (candidates, false, &any_viable_p);
9134 if (!any_viable_p)
9136 if (complain & tf_error)
9138 if (!COMPLETE_OR_OPEN_TYPE_P (basetype))
9139 cxx_incomplete_type_error (instance, basetype);
9140 else if (optype)
9141 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9142 basetype, optype, build_tree_list_vec (user_args),
9143 TREE_TYPE (instance));
9144 else
9146 tree arglist = build_tree_list_vec (user_args);
9147 tree errname = name;
9148 bool twiddle = false;
9149 if (IDENTIFIER_CDTOR_P (errname))
9151 twiddle = IDENTIFIER_DTOR_P (errname);
9152 errname = constructor_name (basetype);
9154 if (explicit_targs)
9155 errname = lookup_template_function (errname, explicit_targs);
9156 if (skip_first_for_error)
9157 arglist = TREE_CHAIN (arglist);
9158 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
9159 basetype, &"~"[!twiddle], errname, arglist,
9160 TREE_TYPE (instance));
9162 print_z_candidates (location_of (name), candidates);
9164 call = error_mark_node;
9166 else
9168 cand = tourney (candidates, complain);
9169 if (cand == 0)
9171 char *pretty_name;
9172 bool free_p;
9173 tree arglist;
9175 if (complain & tf_error)
9177 pretty_name = name_as_c_string (name, basetype, &free_p);
9178 arglist = build_tree_list_vec (user_args);
9179 if (skip_first_for_error)
9180 arglist = TREE_CHAIN (arglist);
9181 if (!any_strictly_viable (candidates))
9182 error ("no matching function for call to %<%s(%A)%>",
9183 pretty_name, arglist);
9184 else
9185 error ("call of overloaded %<%s(%A)%> is ambiguous",
9186 pretty_name, arglist);
9187 print_z_candidates (location_of (name), candidates);
9188 if (free_p)
9189 free (pretty_name);
9191 call = error_mark_node;
9193 else
9195 fn = cand->fn;
9196 call = NULL_TREE;
9198 if (!(flags & LOOKUP_NONVIRTUAL)
9199 && DECL_PURE_VIRTUAL_P (fn)
9200 && instance == current_class_ref
9201 && (complain & tf_warning))
9203 /* This is not an error, it is runtime undefined
9204 behavior. */
9205 if (!current_function_decl)
9206 warning (0, "pure virtual %q#D called from "
9207 "non-static data member initializer", fn);
9208 else if (DECL_CONSTRUCTOR_P (current_function_decl)
9209 || DECL_DESTRUCTOR_P (current_function_decl))
9210 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl)
9211 ? G_("pure virtual %q#D called from constructor")
9212 : G_("pure virtual %q#D called from destructor")),
9213 fn);
9216 if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE
9217 && !DECL_CONSTRUCTOR_P (fn)
9218 && is_dummy_object (instance))
9220 instance = maybe_resolve_dummy (instance, true);
9221 if (instance == error_mark_node)
9222 call = error_mark_node;
9223 else if (!is_dummy_object (instance))
9225 /* We captured 'this' in the current lambda now that
9226 we know we really need it. */
9227 cand->first_arg = instance;
9229 else if (any_dependent_bases_p ())
9230 /* We can't tell until instantiation time whether we can use
9231 *this as the implicit object argument. */;
9232 else
9234 if (complain & tf_error)
9235 error ("cannot call member function %qD without object",
9236 fn);
9237 call = error_mark_node;
9241 if (call != error_mark_node)
9243 /* Optimize away vtable lookup if we know that this
9244 function can't be overridden. We need to check if
9245 the context and the type where we found fn are the same,
9246 actually FN might be defined in a different class
9247 type because of a using-declaration. In this case, we
9248 do not want to perform a non-virtual call. */
9249 if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL)
9250 && same_type_ignoring_top_level_qualifiers_p
9251 (DECL_CONTEXT (fn), BINFO_TYPE (binfo))
9252 && resolves_to_fixed_type_p (instance, 0))
9253 flags |= LOOKUP_NONVIRTUAL;
9254 if (explicit_targs)
9255 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
9256 /* Now we know what function is being called. */
9257 if (fn_p)
9258 *fn_p = fn;
9259 /* Build the actual CALL_EXPR. */
9260 call = build_over_call (cand, flags, complain);
9261 /* In an expression of the form `a->f()' where `f' turns
9262 out to be a static member function, `a' is
9263 none-the-less evaluated. */
9264 if (TREE_CODE (TREE_TYPE (fn)) != METHOD_TYPE
9265 && !is_dummy_object (instance)
9266 && TREE_SIDE_EFFECTS (instance))
9267 call = build2 (COMPOUND_EXPR, TREE_TYPE (call),
9268 instance, call);
9269 else if (call != error_mark_node
9270 && DECL_DESTRUCTOR_P (cand->fn)
9271 && !VOID_TYPE_P (TREE_TYPE (call)))
9272 /* An explicit call of the form "x->~X()" has type
9273 "void". However, on platforms where destructors
9274 return "this" (i.e., those where
9275 targetm.cxx.cdtor_returns_this is true), such calls
9276 will appear to have a return value of pointer type
9277 to the low-level call machinery. We do not want to
9278 change the low-level machinery, since we want to be
9279 able to optimize "delete f()" on such platforms as
9280 "operator delete(~X(f()))" (rather than generating
9281 "t = f(), ~X(t), operator delete (t)"). */
9282 call = build_nop (void_type_node, call);
9287 if (processing_template_decl && call != error_mark_node)
9289 bool cast_to_void = false;
9291 if (TREE_CODE (call) == COMPOUND_EXPR)
9292 call = TREE_OPERAND (call, 1);
9293 else if (TREE_CODE (call) == NOP_EXPR)
9295 cast_to_void = true;
9296 call = TREE_OPERAND (call, 0);
9298 if (INDIRECT_REF_P (call))
9299 call = TREE_OPERAND (call, 0);
9300 call = (build_min_non_dep_call_vec
9301 (call,
9302 build_min (COMPONENT_REF, TREE_TYPE (CALL_EXPR_FN (call)),
9303 orig_instance, orig_fns, NULL_TREE),
9304 orig_args));
9305 SET_EXPR_LOCATION (call, input_location);
9306 call = convert_from_reference (call);
9307 if (cast_to_void)
9308 call = build_nop (void_type_node, call);
9311 /* Free all the conversions we allocated. */
9312 obstack_free (&conversion_obstack, p);
9314 if (orig_args != NULL)
9315 release_tree_vector (orig_args);
9317 return call;
9320 /* Wrapper for above. */
9322 tree
9323 build_new_method_call (tree instance, tree fns, vec<tree, va_gc> **args,
9324 tree conversion_path, int flags,
9325 tree *fn_p, tsubst_flags_t complain)
9327 tree ret;
9328 bool subtime = timevar_cond_start (TV_OVERLOAD);
9329 ret = build_new_method_call_1 (instance, fns, args, conversion_path, flags,
9330 fn_p, complain);
9331 timevar_cond_stop (TV_OVERLOAD, subtime);
9332 return ret;
9335 /* Returns true iff standard conversion sequence ICS1 is a proper
9336 subsequence of ICS2. */
9338 static bool
9339 is_subseq (conversion *ics1, conversion *ics2)
9341 /* We can assume that a conversion of the same code
9342 between the same types indicates a subsequence since we only get
9343 here if the types we are converting from are the same. */
9345 while (ics1->kind == ck_rvalue
9346 || ics1->kind == ck_lvalue)
9347 ics1 = next_conversion (ics1);
9349 while (1)
9351 while (ics2->kind == ck_rvalue
9352 || ics2->kind == ck_lvalue)
9353 ics2 = next_conversion (ics2);
9355 if (ics2->kind == ck_user
9356 || ics2->kind == ck_ambig
9357 || ics2->kind == ck_aggr
9358 || ics2->kind == ck_list
9359 || ics2->kind == ck_identity)
9360 /* At this point, ICS1 cannot be a proper subsequence of
9361 ICS2. We can get a USER_CONV when we are comparing the
9362 second standard conversion sequence of two user conversion
9363 sequences. */
9364 return false;
9366 ics2 = next_conversion (ics2);
9368 while (ics2->kind == ck_rvalue
9369 || ics2->kind == ck_lvalue)
9370 ics2 = next_conversion (ics2);
9372 if (ics2->kind == ics1->kind
9373 && same_type_p (ics2->type, ics1->type)
9374 && (ics1->kind == ck_identity
9375 || same_type_p (next_conversion (ics2)->type,
9376 next_conversion (ics1)->type)))
9377 return true;
9381 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
9382 be any _TYPE nodes. */
9384 bool
9385 is_properly_derived_from (tree derived, tree base)
9387 if (!CLASS_TYPE_P (derived) || !CLASS_TYPE_P (base))
9388 return false;
9390 /* We only allow proper derivation here. The DERIVED_FROM_P macro
9391 considers every class derived from itself. */
9392 return (!same_type_ignoring_top_level_qualifiers_p (derived, base)
9393 && DERIVED_FROM_P (base, derived));
9396 /* We build the ICS for an implicit object parameter as a pointer
9397 conversion sequence. However, such a sequence should be compared
9398 as if it were a reference conversion sequence. If ICS is the
9399 implicit conversion sequence for an implicit object parameter,
9400 modify it accordingly. */
9402 static void
9403 maybe_handle_implicit_object (conversion **ics)
9405 if ((*ics)->this_p)
9407 /* [over.match.funcs]
9409 For non-static member functions, the type of the
9410 implicit object parameter is "reference to cv X"
9411 where X is the class of which the function is a
9412 member and cv is the cv-qualification on the member
9413 function declaration. */
9414 conversion *t = *ics;
9415 tree reference_type;
9417 /* The `this' parameter is a pointer to a class type. Make the
9418 implicit conversion talk about a reference to that same class
9419 type. */
9420 reference_type = TREE_TYPE (t->type);
9421 reference_type = build_reference_type (reference_type);
9423 if (t->kind == ck_qual)
9424 t = next_conversion (t);
9425 if (t->kind == ck_ptr)
9426 t = next_conversion (t);
9427 t = build_identity_conv (TREE_TYPE (t->type), NULL_TREE);
9428 t = direct_reference_binding (reference_type, t);
9429 t->this_p = 1;
9430 t->rvaluedness_matches_p = 0;
9431 *ics = t;
9435 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
9436 and return the initial reference binding conversion. Otherwise,
9437 leave *ICS unchanged and return NULL. */
9439 static conversion *
9440 maybe_handle_ref_bind (conversion **ics)
9442 if ((*ics)->kind == ck_ref_bind)
9444 conversion *old_ics = *ics;
9445 *ics = next_conversion (old_ics);
9446 (*ics)->user_conv_p = old_ics->user_conv_p;
9447 return old_ics;
9450 return NULL;
9453 /* Compare two implicit conversion sequences according to the rules set out in
9454 [over.ics.rank]. Return values:
9456 1: ics1 is better than ics2
9457 -1: ics2 is better than ics1
9458 0: ics1 and ics2 are indistinguishable */
9460 static int
9461 compare_ics (conversion *ics1, conversion *ics2)
9463 tree from_type1;
9464 tree from_type2;
9465 tree to_type1;
9466 tree to_type2;
9467 tree deref_from_type1 = NULL_TREE;
9468 tree deref_from_type2 = NULL_TREE;
9469 tree deref_to_type1 = NULL_TREE;
9470 tree deref_to_type2 = NULL_TREE;
9471 conversion_rank rank1, rank2;
9473 /* REF_BINDING is nonzero if the result of the conversion sequence
9474 is a reference type. In that case REF_CONV is the reference
9475 binding conversion. */
9476 conversion *ref_conv1;
9477 conversion *ref_conv2;
9479 /* Compare badness before stripping the reference conversion. */
9480 if (ics1->bad_p > ics2->bad_p)
9481 return -1;
9482 else if (ics1->bad_p < ics2->bad_p)
9483 return 1;
9485 /* Handle implicit object parameters. */
9486 maybe_handle_implicit_object (&ics1);
9487 maybe_handle_implicit_object (&ics2);
9489 /* Handle reference parameters. */
9490 ref_conv1 = maybe_handle_ref_bind (&ics1);
9491 ref_conv2 = maybe_handle_ref_bind (&ics2);
9493 /* List-initialization sequence L1 is a better conversion sequence than
9494 list-initialization sequence L2 if L1 converts to
9495 std::initializer_list<X> for some X and L2 does not. */
9496 if (ics1->kind == ck_list && ics2->kind != ck_list)
9497 return 1;
9498 if (ics2->kind == ck_list && ics1->kind != ck_list)
9499 return -1;
9501 /* [over.ics.rank]
9503 When comparing the basic forms of implicit conversion sequences (as
9504 defined in _over.best.ics_)
9506 --a standard conversion sequence (_over.ics.scs_) is a better
9507 conversion sequence than a user-defined conversion sequence
9508 or an ellipsis conversion sequence, and
9510 --a user-defined conversion sequence (_over.ics.user_) is a
9511 better conversion sequence than an ellipsis conversion sequence
9512 (_over.ics.ellipsis_). */
9513 /* Use BAD_CONVERSION_RANK because we already checked for a badness
9514 mismatch. If both ICS are bad, we try to make a decision based on
9515 what would have happened if they'd been good. This is not an
9516 extension, we'll still give an error when we build up the call; this
9517 just helps us give a more helpful error message. */
9518 rank1 = BAD_CONVERSION_RANK (ics1);
9519 rank2 = BAD_CONVERSION_RANK (ics2);
9521 if (rank1 > rank2)
9522 return -1;
9523 else if (rank1 < rank2)
9524 return 1;
9526 if (ics1->ellipsis_p)
9527 /* Both conversions are ellipsis conversions. */
9528 return 0;
9530 /* User-defined conversion sequence U1 is a better conversion sequence
9531 than another user-defined conversion sequence U2 if they contain the
9532 same user-defined conversion operator or constructor and if the sec-
9533 ond standard conversion sequence of U1 is better than the second
9534 standard conversion sequence of U2. */
9536 /* Handle list-conversion with the same code even though it isn't always
9537 ranked as a user-defined conversion and it doesn't have a second
9538 standard conversion sequence; it will still have the desired effect.
9539 Specifically, we need to do the reference binding comparison at the
9540 end of this function. */
9542 if (ics1->user_conv_p || ics1->kind == ck_list || ics1->kind == ck_aggr)
9544 conversion *t1;
9545 conversion *t2;
9547 for (t1 = ics1; t1->kind != ck_user; t1 = next_conversion (t1))
9548 if (t1->kind == ck_ambig || t1->kind == ck_aggr
9549 || t1->kind == ck_list)
9550 break;
9551 for (t2 = ics2; t2->kind != ck_user; t2 = next_conversion (t2))
9552 if (t2->kind == ck_ambig || t2->kind == ck_aggr
9553 || t2->kind == ck_list)
9554 break;
9556 if (t1->kind != t2->kind)
9557 return 0;
9558 else if (t1->kind == ck_user)
9560 tree f1 = t1->cand ? t1->cand->fn : t1->type;
9561 tree f2 = t2->cand ? t2->cand->fn : t2->type;
9562 if (f1 != f2)
9563 return 0;
9565 else
9567 /* For ambiguous or aggregate conversions, use the target type as
9568 a proxy for the conversion function. */
9569 if (!same_type_ignoring_top_level_qualifiers_p (t1->type, t2->type))
9570 return 0;
9573 /* We can just fall through here, after setting up
9574 FROM_TYPE1 and FROM_TYPE2. */
9575 from_type1 = t1->type;
9576 from_type2 = t2->type;
9578 else
9580 conversion *t1;
9581 conversion *t2;
9583 /* We're dealing with two standard conversion sequences.
9585 [over.ics.rank]
9587 Standard conversion sequence S1 is a better conversion
9588 sequence than standard conversion sequence S2 if
9590 --S1 is a proper subsequence of S2 (comparing the conversion
9591 sequences in the canonical form defined by _over.ics.scs_,
9592 excluding any Lvalue Transformation; the identity
9593 conversion sequence is considered to be a subsequence of
9594 any non-identity conversion sequence */
9596 t1 = ics1;
9597 while (t1->kind != ck_identity)
9598 t1 = next_conversion (t1);
9599 from_type1 = t1->type;
9601 t2 = ics2;
9602 while (t2->kind != ck_identity)
9603 t2 = next_conversion (t2);
9604 from_type2 = t2->type;
9607 /* One sequence can only be a subsequence of the other if they start with
9608 the same type. They can start with different types when comparing the
9609 second standard conversion sequence in two user-defined conversion
9610 sequences. */
9611 if (same_type_p (from_type1, from_type2))
9613 if (is_subseq (ics1, ics2))
9614 return 1;
9615 if (is_subseq (ics2, ics1))
9616 return -1;
9619 /* [over.ics.rank]
9621 Or, if not that,
9623 --the rank of S1 is better than the rank of S2 (by the rules
9624 defined below):
9626 Standard conversion sequences are ordered by their ranks: an Exact
9627 Match is a better conversion than a Promotion, which is a better
9628 conversion than a Conversion.
9630 Two conversion sequences with the same rank are indistinguishable
9631 unless one of the following rules applies:
9633 --A conversion that does not a convert a pointer, pointer to member,
9634 or std::nullptr_t to bool is better than one that does.
9636 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
9637 so that we do not have to check it explicitly. */
9638 if (ics1->rank < ics2->rank)
9639 return 1;
9640 else if (ics2->rank < ics1->rank)
9641 return -1;
9643 to_type1 = ics1->type;
9644 to_type2 = ics2->type;
9646 /* A conversion from scalar arithmetic type to complex is worse than a
9647 conversion between scalar arithmetic types. */
9648 if (same_type_p (from_type1, from_type2)
9649 && ARITHMETIC_TYPE_P (from_type1)
9650 && ARITHMETIC_TYPE_P (to_type1)
9651 && ARITHMETIC_TYPE_P (to_type2)
9652 && ((TREE_CODE (to_type1) == COMPLEX_TYPE)
9653 != (TREE_CODE (to_type2) == COMPLEX_TYPE)))
9655 if (TREE_CODE (to_type1) == COMPLEX_TYPE)
9656 return -1;
9657 else
9658 return 1;
9661 if (TYPE_PTR_P (from_type1)
9662 && TYPE_PTR_P (from_type2)
9663 && TYPE_PTR_P (to_type1)
9664 && TYPE_PTR_P (to_type2))
9666 deref_from_type1 = TREE_TYPE (from_type1);
9667 deref_from_type2 = TREE_TYPE (from_type2);
9668 deref_to_type1 = TREE_TYPE (to_type1);
9669 deref_to_type2 = TREE_TYPE (to_type2);
9671 /* The rules for pointers to members A::* are just like the rules
9672 for pointers A*, except opposite: if B is derived from A then
9673 A::* converts to B::*, not vice versa. For that reason, we
9674 switch the from_ and to_ variables here. */
9675 else if ((TYPE_PTRDATAMEM_P (from_type1) && TYPE_PTRDATAMEM_P (from_type2)
9676 && TYPE_PTRDATAMEM_P (to_type1) && TYPE_PTRDATAMEM_P (to_type2))
9677 || (TYPE_PTRMEMFUNC_P (from_type1)
9678 && TYPE_PTRMEMFUNC_P (from_type2)
9679 && TYPE_PTRMEMFUNC_P (to_type1)
9680 && TYPE_PTRMEMFUNC_P (to_type2)))
9682 deref_to_type1 = TYPE_PTRMEM_CLASS_TYPE (from_type1);
9683 deref_to_type2 = TYPE_PTRMEM_CLASS_TYPE (from_type2);
9684 deref_from_type1 = TYPE_PTRMEM_CLASS_TYPE (to_type1);
9685 deref_from_type2 = TYPE_PTRMEM_CLASS_TYPE (to_type2);
9688 if (deref_from_type1 != NULL_TREE
9689 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1))
9690 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2)))
9692 /* This was one of the pointer or pointer-like conversions.
9694 [over.ics.rank]
9696 --If class B is derived directly or indirectly from class A,
9697 conversion of B* to A* is better than conversion of B* to
9698 void*, and conversion of A* to void* is better than
9699 conversion of B* to void*. */
9700 if (VOID_TYPE_P (deref_to_type1)
9701 && VOID_TYPE_P (deref_to_type2))
9703 if (is_properly_derived_from (deref_from_type1,
9704 deref_from_type2))
9705 return -1;
9706 else if (is_properly_derived_from (deref_from_type2,
9707 deref_from_type1))
9708 return 1;
9710 else if (VOID_TYPE_P (deref_to_type1)
9711 || VOID_TYPE_P (deref_to_type2))
9713 if (same_type_p (deref_from_type1, deref_from_type2))
9715 if (VOID_TYPE_P (deref_to_type2))
9717 if (is_properly_derived_from (deref_from_type1,
9718 deref_to_type1))
9719 return 1;
9721 /* We know that DEREF_TO_TYPE1 is `void' here. */
9722 else if (is_properly_derived_from (deref_from_type1,
9723 deref_to_type2))
9724 return -1;
9727 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1))
9728 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2)))
9730 /* [over.ics.rank]
9732 --If class B is derived directly or indirectly from class A
9733 and class C is derived directly or indirectly from B,
9735 --conversion of C* to B* is better than conversion of C* to
9738 --conversion of B* to A* is better than conversion of C* to
9739 A* */
9740 if (same_type_p (deref_from_type1, deref_from_type2))
9742 if (is_properly_derived_from (deref_to_type1,
9743 deref_to_type2))
9744 return 1;
9745 else if (is_properly_derived_from (deref_to_type2,
9746 deref_to_type1))
9747 return -1;
9749 else if (same_type_p (deref_to_type1, deref_to_type2))
9751 if (is_properly_derived_from (deref_from_type2,
9752 deref_from_type1))
9753 return 1;
9754 else if (is_properly_derived_from (deref_from_type1,
9755 deref_from_type2))
9756 return -1;
9760 else if (CLASS_TYPE_P (non_reference (from_type1))
9761 && same_type_p (from_type1, from_type2))
9763 tree from = non_reference (from_type1);
9765 /* [over.ics.rank]
9767 --binding of an expression of type C to a reference of type
9768 B& is better than binding an expression of type C to a
9769 reference of type A&
9771 --conversion of C to B is better than conversion of C to A, */
9772 if (is_properly_derived_from (from, to_type1)
9773 && is_properly_derived_from (from, to_type2))
9775 if (is_properly_derived_from (to_type1, to_type2))
9776 return 1;
9777 else if (is_properly_derived_from (to_type2, to_type1))
9778 return -1;
9781 else if (CLASS_TYPE_P (non_reference (to_type1))
9782 && same_type_p (to_type1, to_type2))
9784 tree to = non_reference (to_type1);
9786 /* [over.ics.rank]
9788 --binding of an expression of type B to a reference of type
9789 A& is better than binding an expression of type C to a
9790 reference of type A&,
9792 --conversion of B to A is better than conversion of C to A */
9793 if (is_properly_derived_from (from_type1, to)
9794 && is_properly_derived_from (from_type2, to))
9796 if (is_properly_derived_from (from_type2, from_type1))
9797 return 1;
9798 else if (is_properly_derived_from (from_type1, from_type2))
9799 return -1;
9803 /* [over.ics.rank]
9805 --S1 and S2 differ only in their qualification conversion and yield
9806 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
9807 qualification signature of type T1 is a proper subset of the cv-
9808 qualification signature of type T2 */
9809 if (ics1->kind == ck_qual
9810 && ics2->kind == ck_qual
9811 && same_type_p (from_type1, from_type2))
9813 int result = comp_cv_qual_signature (to_type1, to_type2);
9814 if (result != 0)
9815 return result;
9818 /* [over.ics.rank]
9820 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
9821 to an implicit object parameter of a non-static member function
9822 declared without a ref-qualifier, and either S1 binds an lvalue
9823 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
9824 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
9825 draft standard, 13.3.3.2)
9827 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
9828 types to which the references refer are the same type except for
9829 top-level cv-qualifiers, and the type to which the reference
9830 initialized by S2 refers is more cv-qualified than the type to
9831 which the reference initialized by S1 refers.
9833 DR 1328 [over.match.best]: the context is an initialization by
9834 conversion function for direct reference binding (13.3.1.6) of a
9835 reference to function type, the return type of F1 is the same kind of
9836 reference (i.e. lvalue or rvalue) as the reference being initialized,
9837 and the return type of F2 is not. */
9839 if (ref_conv1 && ref_conv2)
9841 if (!ref_conv1->this_p && !ref_conv2->this_p
9842 && (ref_conv1->rvaluedness_matches_p
9843 != ref_conv2->rvaluedness_matches_p)
9844 && (same_type_p (ref_conv1->type, ref_conv2->type)
9845 || (TYPE_REF_IS_RVALUE (ref_conv1->type)
9846 != TYPE_REF_IS_RVALUE (ref_conv2->type))))
9848 if (ref_conv1->bad_p
9849 && !same_type_p (TREE_TYPE (ref_conv1->type),
9850 TREE_TYPE (ref_conv2->type)))
9851 /* Don't prefer a bad conversion that drops cv-quals to a bad
9852 conversion with the wrong rvalueness. */
9853 return 0;
9854 return (ref_conv1->rvaluedness_matches_p
9855 - ref_conv2->rvaluedness_matches_p);
9858 if (same_type_ignoring_top_level_qualifiers_p (to_type1, to_type2))
9860 int q1 = cp_type_quals (TREE_TYPE (ref_conv1->type));
9861 int q2 = cp_type_quals (TREE_TYPE (ref_conv2->type));
9862 if (ref_conv1->bad_p)
9864 /* Prefer the one that drops fewer cv-quals. */
9865 tree ftype = next_conversion (ref_conv1)->type;
9866 int fquals = cp_type_quals (ftype);
9867 q1 ^= fquals;
9868 q2 ^= fquals;
9870 return comp_cv_qualification (q2, q1);
9874 /* Neither conversion sequence is better than the other. */
9875 return 0;
9878 /* The source type for this standard conversion sequence. */
9880 static tree
9881 source_type (conversion *t)
9883 for (;; t = next_conversion (t))
9885 if (t->kind == ck_user
9886 || t->kind == ck_ambig
9887 || t->kind == ck_identity)
9888 return t->type;
9890 gcc_unreachable ();
9893 /* Note a warning about preferring WINNER to LOSER. We do this by storing
9894 a pointer to LOSER and re-running joust to produce the warning if WINNER
9895 is actually used. */
9897 static void
9898 add_warning (struct z_candidate *winner, struct z_candidate *loser)
9900 candidate_warning *cw = (candidate_warning *)
9901 conversion_obstack_alloc (sizeof (candidate_warning));
9902 cw->loser = loser;
9903 cw->next = winner->warnings;
9904 winner->warnings = cw;
9907 /* Compare two candidates for overloading as described in
9908 [over.match.best]. Return values:
9910 1: cand1 is better than cand2
9911 -1: cand2 is better than cand1
9912 0: cand1 and cand2 are indistinguishable */
9914 static int
9915 joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn,
9916 tsubst_flags_t complain)
9918 int winner = 0;
9919 int off1 = 0, off2 = 0;
9920 size_t i;
9921 size_t len;
9923 /* Candidates that involve bad conversions are always worse than those
9924 that don't. */
9925 if (cand1->viable > cand2->viable)
9926 return 1;
9927 if (cand1->viable < cand2->viable)
9928 return -1;
9930 /* If we have two pseudo-candidates for conversions to the same type,
9931 or two candidates for the same function, arbitrarily pick one. */
9932 if (cand1->fn == cand2->fn
9933 && (IS_TYPE_OR_DECL_P (cand1->fn)))
9934 return 1;
9936 /* Prefer a non-deleted function over an implicitly deleted move
9937 constructor or assignment operator. This differs slightly from the
9938 wording for issue 1402 (which says the move op is ignored by overload
9939 resolution), but this way produces better error messages. */
9940 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
9941 && TREE_CODE (cand2->fn) == FUNCTION_DECL
9942 && DECL_DELETED_FN (cand1->fn) != DECL_DELETED_FN (cand2->fn))
9944 if (DECL_DELETED_FN (cand1->fn) && DECL_DEFAULTED_FN (cand1->fn)
9945 && move_fn_p (cand1->fn))
9946 return -1;
9947 if (DECL_DELETED_FN (cand2->fn) && DECL_DEFAULTED_FN (cand2->fn)
9948 && move_fn_p (cand2->fn))
9949 return 1;
9952 /* a viable function F1
9953 is defined to be a better function than another viable function F2 if
9954 for all arguments i, ICSi(F1) is not a worse conversion sequence than
9955 ICSi(F2), and then */
9957 /* for some argument j, ICSj(F1) is a better conversion sequence than
9958 ICSj(F2) */
9960 /* For comparing static and non-static member functions, we ignore
9961 the implicit object parameter of the non-static function. The
9962 standard says to pretend that the static function has an object
9963 parm, but that won't work with operator overloading. */
9964 len = cand1->num_convs;
9965 if (len != cand2->num_convs)
9967 int static_1 = DECL_STATIC_FUNCTION_P (cand1->fn);
9968 int static_2 = DECL_STATIC_FUNCTION_P (cand2->fn);
9970 if (DECL_CONSTRUCTOR_P (cand1->fn)
9971 && is_list_ctor (cand1->fn) != is_list_ctor (cand2->fn))
9972 /* We're comparing a near-match list constructor and a near-match
9973 non-list constructor. Just treat them as unordered. */
9974 return 0;
9976 gcc_assert (static_1 != static_2);
9978 if (static_1)
9979 off2 = 1;
9980 else
9982 off1 = 1;
9983 --len;
9987 for (i = 0; i < len; ++i)
9989 conversion *t1 = cand1->convs[i + off1];
9990 conversion *t2 = cand2->convs[i + off2];
9991 int comp = compare_ics (t1, t2);
9993 if (comp != 0)
9995 if ((complain & tf_warning)
9996 && warn_sign_promo
9997 && (CONVERSION_RANK (t1) + CONVERSION_RANK (t2)
9998 == cr_std + cr_promotion)
9999 && t1->kind == ck_std
10000 && t2->kind == ck_std
10001 && TREE_CODE (t1->type) == INTEGER_TYPE
10002 && TREE_CODE (t2->type) == INTEGER_TYPE
10003 && (TYPE_PRECISION (t1->type)
10004 == TYPE_PRECISION (t2->type))
10005 && (TYPE_UNSIGNED (next_conversion (t1)->type)
10006 || (TREE_CODE (next_conversion (t1)->type)
10007 == ENUMERAL_TYPE)))
10009 tree type = next_conversion (t1)->type;
10010 tree type1, type2;
10011 struct z_candidate *w, *l;
10012 if (comp > 0)
10013 type1 = t1->type, type2 = t2->type,
10014 w = cand1, l = cand2;
10015 else
10016 type1 = t2->type, type2 = t1->type,
10017 w = cand2, l = cand1;
10019 if (warn)
10021 warning (OPT_Wsign_promo, "passing %qT chooses %qT over %qT",
10022 type, type1, type2);
10023 warning (OPT_Wsign_promo, " in call to %qD", w->fn);
10025 else
10026 add_warning (w, l);
10029 if (winner && comp != winner)
10031 winner = 0;
10032 goto tweak;
10034 winner = comp;
10038 /* warn about confusing overload resolution for user-defined conversions,
10039 either between a constructor and a conversion op, or between two
10040 conversion ops. */
10041 if ((complain & tf_warning)
10042 && winner && warn_conversion && cand1->second_conv
10043 && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn))
10044 && winner != compare_ics (cand1->second_conv, cand2->second_conv))
10046 struct z_candidate *w, *l;
10047 bool give_warning = false;
10049 if (winner == 1)
10050 w = cand1, l = cand2;
10051 else
10052 w = cand2, l = cand1;
10054 /* We don't want to complain about `X::operator T1 ()'
10055 beating `X::operator T2 () const', when T2 is a no less
10056 cv-qualified version of T1. */
10057 if (DECL_CONTEXT (w->fn) == DECL_CONTEXT (l->fn)
10058 && !DECL_CONSTRUCTOR_P (w->fn) && !DECL_CONSTRUCTOR_P (l->fn))
10060 tree t = TREE_TYPE (TREE_TYPE (l->fn));
10061 tree f = TREE_TYPE (TREE_TYPE (w->fn));
10063 if (TREE_CODE (t) == TREE_CODE (f) && POINTER_TYPE_P (t))
10065 t = TREE_TYPE (t);
10066 f = TREE_TYPE (f);
10068 if (!comp_ptr_ttypes (t, f))
10069 give_warning = true;
10071 else
10072 give_warning = true;
10074 if (!give_warning)
10075 /*NOP*/;
10076 else if (warn)
10078 tree source = source_type (w->convs[0]);
10079 if (! DECL_CONSTRUCTOR_P (w->fn))
10080 source = TREE_TYPE (source);
10081 if (warning (OPT_Wconversion, "choosing %qD over %qD", w->fn, l->fn)
10082 && warning (OPT_Wconversion, " for conversion from %qH to %qI",
10083 source, w->second_conv->type))
10085 inform (input_location, " because conversion sequence for the argument is better");
10088 else
10089 add_warning (w, l);
10092 if (winner)
10093 return winner;
10095 /* DR 495 moved this tiebreaker above the template ones. */
10096 /* or, if not that,
10097 the context is an initialization by user-defined conversion (see
10098 _dcl.init_ and _over.match.user_) and the standard conversion
10099 sequence from the return type of F1 to the destination type (i.e.,
10100 the type of the entity being initialized) is a better conversion
10101 sequence than the standard conversion sequence from the return type
10102 of F2 to the destination type. */
10104 if (cand1->second_conv)
10106 winner = compare_ics (cand1->second_conv, cand2->second_conv);
10107 if (winner)
10108 return winner;
10111 /* or, if not that,
10112 F1 is a non-template function and F2 is a template function
10113 specialization. */
10115 if (!cand1->template_decl && cand2->template_decl)
10116 return 1;
10117 else if (cand1->template_decl && !cand2->template_decl)
10118 return -1;
10120 /* or, if not that,
10121 F1 and F2 are template functions and the function template for F1 is
10122 more specialized than the template for F2 according to the partial
10123 ordering rules. */
10125 if (cand1->template_decl && cand2->template_decl)
10127 winner = more_specialized_fn
10128 (TI_TEMPLATE (cand1->template_decl),
10129 TI_TEMPLATE (cand2->template_decl),
10130 /* [temp.func.order]: The presence of unused ellipsis and default
10131 arguments has no effect on the partial ordering of function
10132 templates. add_function_candidate() will not have
10133 counted the "this" argument for constructors. */
10134 cand1->num_convs + DECL_CONSTRUCTOR_P (cand1->fn));
10135 if (winner)
10136 return winner;
10139 // C++ Concepts
10140 // or, if not that, F1 is more constrained than F2.
10141 if (flag_concepts && DECL_P (cand1->fn) && DECL_P (cand2->fn))
10143 winner = more_constrained (cand1->fn, cand2->fn);
10144 if (winner)
10145 return winner;
10148 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
10149 if (deduction_guide_p (cand1->fn))
10151 gcc_assert (deduction_guide_p (cand2->fn));
10152 /* We distinguish between candidates from an explicit deduction guide and
10153 candidates built from a constructor based on DECL_ARTIFICIAL. */
10154 int art1 = DECL_ARTIFICIAL (cand1->fn);
10155 int art2 = DECL_ARTIFICIAL (cand2->fn);
10156 if (art1 != art2)
10157 return art2 - art1;
10159 if (art1)
10161 /* Prefer the special copy guide over a declared copy/move
10162 constructor. */
10163 if (copy_guide_p (cand1->fn))
10164 return 1;
10165 if (copy_guide_p (cand2->fn))
10166 return -1;
10168 /* Prefer a candidate generated from a non-template constructor. */
10169 int tg1 = template_guide_p (cand1->fn);
10170 int tg2 = template_guide_p (cand2->fn);
10171 if (tg1 != tg2)
10172 return tg2 - tg1;
10176 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
10177 for all arguments the corresponding parameters of F1 and F2 have the same
10178 type (CWG 2273/2277). */
10179 if (DECL_P (cand1->fn) && DECL_CLASS_SCOPE_P (cand1->fn)
10180 && !DECL_CONV_FN_P (cand1->fn)
10181 && DECL_P (cand2->fn) && DECL_CLASS_SCOPE_P (cand2->fn)
10182 && !DECL_CONV_FN_P (cand2->fn))
10184 tree base1 = DECL_CONTEXT (strip_inheriting_ctors (cand1->fn));
10185 tree base2 = DECL_CONTEXT (strip_inheriting_ctors (cand2->fn));
10187 bool used1 = false;
10188 bool used2 = false;
10189 if (base1 == base2)
10190 /* No difference. */;
10191 else if (DERIVED_FROM_P (base1, base2))
10192 used1 = true;
10193 else if (DERIVED_FROM_P (base2, base1))
10194 used2 = true;
10196 if (int diff = used2 - used1)
10198 for (i = 0; i < len; ++i)
10200 conversion *t1 = cand1->convs[i + off1];
10201 conversion *t2 = cand2->convs[i + off2];
10202 if (!same_type_p (t1->type, t2->type))
10203 break;
10205 if (i == len)
10206 return diff;
10210 /* Check whether we can discard a builtin candidate, either because we
10211 have two identical ones or matching builtin and non-builtin candidates.
10213 (Pedantically in the latter case the builtin which matched the user
10214 function should not be added to the overload set, but we spot it here.
10216 [over.match.oper]
10217 ... the builtin candidates include ...
10218 - do not have the same parameter type list as any non-template
10219 non-member candidate. */
10221 if (identifier_p (cand1->fn) || identifier_p (cand2->fn))
10223 for (i = 0; i < len; ++i)
10224 if (!same_type_p (cand1->convs[i]->type,
10225 cand2->convs[i]->type))
10226 break;
10227 if (i == cand1->num_convs)
10229 if (cand1->fn == cand2->fn)
10230 /* Two built-in candidates; arbitrarily pick one. */
10231 return 1;
10232 else if (identifier_p (cand1->fn))
10233 /* cand1 is built-in; prefer cand2. */
10234 return -1;
10235 else
10236 /* cand2 is built-in; prefer cand1. */
10237 return 1;
10241 /* For candidates of a multi-versioned function, make the version with
10242 the highest priority win. This version will be checked for dispatching
10243 first. If this version can be inlined into the caller, the front-end
10244 will simply make a direct call to this function. */
10246 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
10247 && DECL_FUNCTION_VERSIONED (cand1->fn)
10248 && TREE_CODE (cand2->fn) == FUNCTION_DECL
10249 && DECL_FUNCTION_VERSIONED (cand2->fn))
10251 tree f1 = TREE_TYPE (cand1->fn);
10252 tree f2 = TREE_TYPE (cand2->fn);
10253 tree p1 = TYPE_ARG_TYPES (f1);
10254 tree p2 = TYPE_ARG_TYPES (f2);
10256 /* Check if cand1->fn and cand2->fn are versions of the same function. It
10257 is possible that cand1->fn and cand2->fn are function versions but of
10258 different functions. Check types to see if they are versions of the same
10259 function. */
10260 if (compparms (p1, p2)
10261 && same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
10263 /* Always make the version with the higher priority, more
10264 specialized, win. */
10265 gcc_assert (targetm.compare_version_priority);
10266 if (targetm.compare_version_priority (cand1->fn, cand2->fn) >= 0)
10267 return 1;
10268 else
10269 return -1;
10273 /* If the two function declarations represent the same function (this can
10274 happen with declarations in multiple scopes and arg-dependent lookup),
10275 arbitrarily choose one. But first make sure the default args we're
10276 using match. */
10277 if (DECL_P (cand1->fn) && DECL_P (cand2->fn)
10278 && equal_functions (cand1->fn, cand2->fn))
10280 tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (cand1->fn));
10281 tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (cand2->fn));
10283 gcc_assert (!DECL_CONSTRUCTOR_P (cand1->fn));
10285 for (i = 0; i < len; ++i)
10287 /* Don't crash if the fn is variadic. */
10288 if (!parms1)
10289 break;
10290 parms1 = TREE_CHAIN (parms1);
10291 parms2 = TREE_CHAIN (parms2);
10294 if (off1)
10295 parms1 = TREE_CHAIN (parms1);
10296 else if (off2)
10297 parms2 = TREE_CHAIN (parms2);
10299 for (; parms1; ++i)
10301 if (!cp_tree_equal (TREE_PURPOSE (parms1),
10302 TREE_PURPOSE (parms2)))
10304 if (warn)
10306 if (complain & tf_error)
10308 if (permerror (input_location,
10309 "default argument mismatch in "
10310 "overload resolution"))
10312 inform (DECL_SOURCE_LOCATION (cand1->fn),
10313 " candidate 1: %q#F", cand1->fn);
10314 inform (DECL_SOURCE_LOCATION (cand2->fn),
10315 " candidate 2: %q#F", cand2->fn);
10318 else
10319 return 0;
10321 else
10322 add_warning (cand1, cand2);
10323 break;
10325 parms1 = TREE_CHAIN (parms1);
10326 parms2 = TREE_CHAIN (parms2);
10329 return 1;
10332 tweak:
10334 /* Extension: If the worst conversion for one candidate is worse than the
10335 worst conversion for the other, take the first. */
10336 if (!pedantic && (complain & tf_warning_or_error))
10338 conversion_rank rank1 = cr_identity, rank2 = cr_identity;
10339 struct z_candidate *w = 0, *l = 0;
10341 for (i = 0; i < len; ++i)
10343 if (CONVERSION_RANK (cand1->convs[i+off1]) > rank1)
10344 rank1 = CONVERSION_RANK (cand1->convs[i+off1]);
10345 if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2)
10346 rank2 = CONVERSION_RANK (cand2->convs[i + off2]);
10348 if (rank1 < rank2)
10349 winner = 1, w = cand1, l = cand2;
10350 if (rank1 > rank2)
10351 winner = -1, w = cand2, l = cand1;
10352 if (winner)
10354 /* Don't choose a deleted function over ambiguity. */
10355 if (DECL_P (w->fn) && DECL_DELETED_FN (w->fn))
10356 return 0;
10357 if (warn)
10359 pedwarn (input_location, 0,
10360 "ISO C++ says that these are ambiguous, even "
10361 "though the worst conversion for the first is better than "
10362 "the worst conversion for the second:");
10363 print_z_candidate (input_location, _("candidate 1:"), w);
10364 print_z_candidate (input_location, _("candidate 2:"), l);
10366 else
10367 add_warning (w, l);
10368 return winner;
10372 gcc_assert (!winner);
10373 return 0;
10376 /* Given a list of candidates for overloading, find the best one, if any.
10377 This algorithm has a worst case of O(2n) (winner is last), and a best
10378 case of O(n/2) (totally ambiguous); much better than a sorting
10379 algorithm. */
10381 static struct z_candidate *
10382 tourney (struct z_candidate *candidates, tsubst_flags_t complain)
10384 struct z_candidate *champ = candidates, *challenger;
10385 int fate;
10386 int champ_compared_to_predecessor = 0;
10388 /* Walk through the list once, comparing each current champ to the next
10389 candidate, knocking out a candidate or two with each comparison. */
10391 for (challenger = champ->next; challenger; )
10393 fate = joust (champ, challenger, 0, complain);
10394 if (fate == 1)
10395 challenger = challenger->next;
10396 else
10398 if (fate == 0)
10400 champ = challenger->next;
10401 if (champ == 0)
10402 return NULL;
10403 champ_compared_to_predecessor = 0;
10405 else
10407 champ = challenger;
10408 champ_compared_to_predecessor = 1;
10411 challenger = champ->next;
10415 /* Make sure the champ is better than all the candidates it hasn't yet
10416 been compared to. */
10418 for (challenger = candidates;
10419 challenger != champ
10420 && !(champ_compared_to_predecessor && challenger->next == champ);
10421 challenger = challenger->next)
10423 fate = joust (champ, challenger, 0, complain);
10424 if (fate != 1)
10425 return NULL;
10428 return champ;
10431 /* Returns nonzero if things of type FROM can be converted to TO. */
10433 bool
10434 can_convert (tree to, tree from, tsubst_flags_t complain)
10436 tree arg = NULL_TREE;
10437 /* implicit_conversion only considers user-defined conversions
10438 if it has an expression for the call argument list. */
10439 if (CLASS_TYPE_P (from) || CLASS_TYPE_P (to))
10440 arg = build1 (CAST_EXPR, from, NULL_TREE);
10441 return can_convert_arg (to, from, arg, LOOKUP_IMPLICIT, complain);
10444 /* Returns nonzero if things of type FROM can be converted to TO with a
10445 standard conversion. */
10447 bool
10448 can_convert_standard (tree to, tree from, tsubst_flags_t complain)
10450 return can_convert_arg (to, from, NULL_TREE, LOOKUP_IMPLICIT, complain);
10453 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
10455 bool
10456 can_convert_arg (tree to, tree from, tree arg, int flags,
10457 tsubst_flags_t complain)
10459 conversion *t;
10460 void *p;
10461 bool ok_p;
10463 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10464 p = conversion_obstack_alloc (0);
10465 /* We want to discard any access checks done for this test,
10466 as we might not be in the appropriate access context and
10467 we'll do the check again when we actually perform the
10468 conversion. */
10469 push_deferring_access_checks (dk_deferred);
10471 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
10472 flags, complain);
10473 ok_p = (t && !t->bad_p);
10475 /* Discard the access checks now. */
10476 pop_deferring_access_checks ();
10477 /* Free all the conversions we allocated. */
10478 obstack_free (&conversion_obstack, p);
10480 return ok_p;
10483 /* Like can_convert_arg, but allows dubious conversions as well. */
10485 bool
10486 can_convert_arg_bad (tree to, tree from, tree arg, int flags,
10487 tsubst_flags_t complain)
10489 conversion *t;
10490 void *p;
10492 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10493 p = conversion_obstack_alloc (0);
10494 /* Try to perform the conversion. */
10495 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
10496 flags, complain);
10497 /* Free all the conversions we allocated. */
10498 obstack_free (&conversion_obstack, p);
10500 return t != NULL;
10503 /* Convert EXPR to TYPE. Return the converted expression.
10505 Note that we allow bad conversions here because by the time we get to
10506 this point we are committed to doing the conversion. If we end up
10507 doing a bad conversion, convert_like will complain. */
10509 tree
10510 perform_implicit_conversion_flags (tree type, tree expr,
10511 tsubst_flags_t complain, int flags)
10513 conversion *conv;
10514 void *p;
10515 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
10517 if (error_operand_p (expr))
10518 return error_mark_node;
10520 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10521 p = conversion_obstack_alloc (0);
10523 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
10524 /*c_cast_p=*/false,
10525 flags, complain);
10527 if (!conv)
10529 if (complain & tf_error)
10531 /* If expr has unknown type, then it is an overloaded function.
10532 Call instantiate_type to get good error messages. */
10533 if (TREE_TYPE (expr) == unknown_type_node)
10534 instantiate_type (type, expr, complain);
10535 else if (invalid_nonstatic_memfn_p (loc, expr, complain))
10536 /* We gave an error. */;
10537 else
10538 error_at (loc, "could not convert %qE from %qH to %qI", expr,
10539 TREE_TYPE (expr), type);
10541 expr = error_mark_node;
10543 else if (processing_template_decl && conv->kind != ck_identity)
10545 /* In a template, we are only concerned about determining the
10546 type of non-dependent expressions, so we do not have to
10547 perform the actual conversion. But for initializers, we
10548 need to be able to perform it at instantiation
10549 (or instantiate_non_dependent_expr) time. */
10550 expr = build1 (IMPLICIT_CONV_EXPR, type, expr);
10551 if (!(flags & LOOKUP_ONLYCONVERTING))
10552 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true;
10554 else
10555 expr = convert_like (conv, expr, complain);
10557 /* Free all the conversions we allocated. */
10558 obstack_free (&conversion_obstack, p);
10560 return expr;
10563 tree
10564 perform_implicit_conversion (tree type, tree expr, tsubst_flags_t complain)
10566 return perform_implicit_conversion_flags (type, expr, complain,
10567 LOOKUP_IMPLICIT);
10570 /* Convert EXPR to TYPE (as a direct-initialization) if that is
10571 permitted. If the conversion is valid, the converted expression is
10572 returned. Otherwise, NULL_TREE is returned, except in the case
10573 that TYPE is a class type; in that case, an error is issued. If
10574 C_CAST_P is true, then this direct-initialization is taking
10575 place as part of a static_cast being attempted as part of a C-style
10576 cast. */
10578 tree
10579 perform_direct_initialization_if_possible (tree type,
10580 tree expr,
10581 bool c_cast_p,
10582 tsubst_flags_t complain)
10584 conversion *conv;
10585 void *p;
10587 if (type == error_mark_node || error_operand_p (expr))
10588 return error_mark_node;
10589 /* [dcl.init]
10591 If the destination type is a (possibly cv-qualified) class type:
10593 -- If the initialization is direct-initialization ...,
10594 constructors are considered. ... If no constructor applies, or
10595 the overload resolution is ambiguous, the initialization is
10596 ill-formed. */
10597 if (CLASS_TYPE_P (type))
10599 vec<tree, va_gc> *args = make_tree_vector_single (expr);
10600 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
10601 &args, type, LOOKUP_NORMAL, complain);
10602 release_tree_vector (args);
10603 return build_cplus_new (type, expr, complain);
10606 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10607 p = conversion_obstack_alloc (0);
10609 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
10610 c_cast_p,
10611 LOOKUP_NORMAL, complain);
10612 if (!conv || conv->bad_p)
10613 expr = NULL_TREE;
10614 else if (processing_template_decl && conv->kind != ck_identity)
10616 /* In a template, we are only concerned about determining the
10617 type of non-dependent expressions, so we do not have to
10618 perform the actual conversion. But for initializers, we
10619 need to be able to perform it at instantiation
10620 (or instantiate_non_dependent_expr) time. */
10621 expr = build1 (IMPLICIT_CONV_EXPR, type, expr);
10622 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true;
10624 else
10625 expr = convert_like_real (conv, expr, NULL_TREE, 0,
10626 /*issue_conversion_warnings=*/false,
10627 c_cast_p,
10628 complain);
10630 /* Free all the conversions we allocated. */
10631 obstack_free (&conversion_obstack, p);
10633 return expr;
10636 /* When initializing a reference that lasts longer than a full-expression,
10637 this special rule applies:
10639 [class.temporary]
10641 The temporary to which the reference is bound or the temporary
10642 that is the complete object to which the reference is bound
10643 persists for the lifetime of the reference.
10645 The temporaries created during the evaluation of the expression
10646 initializing the reference, except the temporary to which the
10647 reference is bound, are destroyed at the end of the
10648 full-expression in which they are created.
10650 In that case, we store the converted expression into a new
10651 VAR_DECL in a new scope.
10653 However, we want to be careful not to create temporaries when
10654 they are not required. For example, given:
10656 struct B {};
10657 struct D : public B {};
10658 D f();
10659 const B& b = f();
10661 there is no need to copy the return value from "f"; we can just
10662 extend its lifetime. Similarly, given:
10664 struct S {};
10665 struct T { operator S(); };
10666 T t;
10667 const S& s = t;
10669 we can extend the lifetime of the return value of the conversion
10670 operator.
10672 The next several functions are involved in this lifetime extension. */
10674 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
10675 reference is being bound to a temporary. Create and return a new
10676 VAR_DECL with the indicated TYPE; this variable will store the value to
10677 which the reference is bound. */
10679 tree
10680 make_temporary_var_for_ref_to_temp (tree decl, tree type)
10682 tree var = create_temporary_var (type);
10684 /* Register the variable. */
10685 if (VAR_P (decl)
10686 && (TREE_STATIC (decl) || CP_DECL_THREAD_LOCAL_P (decl)))
10688 /* Namespace-scope or local static; give it a mangled name. */
10689 /* FIXME share comdat with decl? */
10691 TREE_STATIC (var) = TREE_STATIC (decl);
10692 CP_DECL_THREAD_LOCAL_P (var) = CP_DECL_THREAD_LOCAL_P (decl);
10693 set_decl_tls_model (var, DECL_TLS_MODEL (decl));
10695 tree name = mangle_ref_init_variable (decl);
10696 DECL_NAME (var) = name;
10697 SET_DECL_ASSEMBLER_NAME (var, name);
10699 var = pushdecl (var);
10701 else
10702 /* Create a new cleanup level if necessary. */
10703 maybe_push_cleanup_level (type);
10705 return var;
10708 /* EXPR is the initializer for a variable DECL of reference or
10709 std::initializer_list type. Create, push and return a new VAR_DECL
10710 for the initializer so that it will live as long as DECL. Any
10711 cleanup for the new variable is returned through CLEANUP, and the
10712 code to initialize the new variable is returned through INITP. */
10714 static tree
10715 set_up_extended_ref_temp (tree decl, tree expr, vec<tree, va_gc> **cleanups,
10716 tree *initp)
10718 tree init;
10719 tree type;
10720 tree var;
10722 /* Create the temporary variable. */
10723 type = TREE_TYPE (expr);
10724 var = make_temporary_var_for_ref_to_temp (decl, type);
10725 layout_decl (var, 0);
10726 /* If the rvalue is the result of a function call it will be
10727 a TARGET_EXPR. If it is some other construct (such as a
10728 member access expression where the underlying object is
10729 itself the result of a function call), turn it into a
10730 TARGET_EXPR here. It is important that EXPR be a
10731 TARGET_EXPR below since otherwise the INIT_EXPR will
10732 attempt to make a bitwise copy of EXPR to initialize
10733 VAR. */
10734 if (TREE_CODE (expr) != TARGET_EXPR)
10735 expr = get_target_expr (expr);
10737 if (TREE_CODE (decl) == FIELD_DECL
10738 && extra_warnings && !TREE_NO_WARNING (decl))
10740 warning (OPT_Wextra, "a temporary bound to %qD only persists "
10741 "until the constructor exits", decl);
10742 TREE_NO_WARNING (decl) = true;
10745 /* Recursively extend temps in this initializer. */
10746 TARGET_EXPR_INITIAL (expr)
10747 = extend_ref_init_temps (decl, TARGET_EXPR_INITIAL (expr), cleanups);
10749 /* Any reference temp has a non-trivial initializer. */
10750 DECL_NONTRIVIALLY_INITIALIZED_P (var) = true;
10752 /* If the initializer is constant, put it in DECL_INITIAL so we get
10753 static initialization and use in constant expressions. */
10754 init = maybe_constant_init (expr);
10755 if (TREE_CONSTANT (init))
10757 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
10759 /* 5.19 says that a constant expression can include an
10760 lvalue-rvalue conversion applied to "a glvalue of literal type
10761 that refers to a non-volatile temporary object initialized
10762 with a constant expression". Rather than try to communicate
10763 that this VAR_DECL is a temporary, just mark it constexpr.
10765 Currently this is only useful for initializer_list temporaries,
10766 since reference vars can't appear in constant expressions. */
10767 DECL_DECLARED_CONSTEXPR_P (var) = true;
10768 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var) = true;
10769 TREE_CONSTANT (var) = true;
10771 DECL_INITIAL (var) = init;
10772 init = NULL_TREE;
10774 else
10775 /* Create the INIT_EXPR that will initialize the temporary
10776 variable. */
10777 init = split_nonconstant_init (var, expr);
10778 if (at_function_scope_p ())
10780 add_decl_expr (var);
10782 if (TREE_STATIC (var))
10783 init = add_stmt_to_compound (init, register_dtor_fn (var));
10784 else
10786 tree cleanup = cxx_maybe_build_cleanup (var, tf_warning_or_error);
10787 if (cleanup)
10788 vec_safe_push (*cleanups, cleanup);
10791 /* We must be careful to destroy the temporary only
10792 after its initialization has taken place. If the
10793 initialization throws an exception, then the
10794 destructor should not be run. We cannot simply
10795 transform INIT into something like:
10797 (INIT, ({ CLEANUP_STMT; }))
10799 because emit_local_var always treats the
10800 initializer as a full-expression. Thus, the
10801 destructor would run too early; it would run at the
10802 end of initializing the reference variable, rather
10803 than at the end of the block enclosing the
10804 reference variable.
10806 The solution is to pass back a cleanup expression
10807 which the caller is responsible for attaching to
10808 the statement tree. */
10810 else
10812 rest_of_decl_compilation (var, /*toplev=*/1, at_eof);
10813 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
10815 if (CP_DECL_THREAD_LOCAL_P (var))
10816 tls_aggregates = tree_cons (NULL_TREE, var,
10817 tls_aggregates);
10818 else
10819 static_aggregates = tree_cons (NULL_TREE, var,
10820 static_aggregates);
10822 else
10823 /* Check whether the dtor is callable. */
10824 cxx_maybe_build_cleanup (var, tf_warning_or_error);
10826 /* Avoid -Wunused-variable warning (c++/38958). */
10827 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
10828 && VAR_P (decl))
10829 TREE_USED (decl) = DECL_READ_P (decl) = true;
10831 *initp = init;
10832 return var;
10835 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
10836 initializing a variable of that TYPE. */
10838 tree
10839 initialize_reference (tree type, tree expr,
10840 int flags, tsubst_flags_t complain)
10842 conversion *conv;
10843 void *p;
10844 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
10846 if (type == error_mark_node || error_operand_p (expr))
10847 return error_mark_node;
10849 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10850 p = conversion_obstack_alloc (0);
10852 conv = reference_binding (type, TREE_TYPE (expr), expr, /*c_cast_p=*/false,
10853 flags, complain);
10854 if (!conv || conv->bad_p)
10856 if (complain & tf_error)
10858 if (conv)
10859 convert_like (conv, expr, complain);
10860 else if (!CP_TYPE_CONST_P (TREE_TYPE (type))
10861 && !TYPE_REF_IS_RVALUE (type)
10862 && !lvalue_p (expr))
10863 error_at (loc, "invalid initialization of non-const reference of "
10864 "type %qH from an rvalue of type %qI",
10865 type, TREE_TYPE (expr));
10866 else
10867 error_at (loc, "invalid initialization of reference of type "
10868 "%qH from expression of type %qI", type,
10869 TREE_TYPE (expr));
10871 return error_mark_node;
10874 if (conv->kind == ck_ref_bind)
10875 /* Perform the conversion. */
10876 expr = convert_like (conv, expr, complain);
10877 else if (conv->kind == ck_ambig)
10878 /* We gave an error in build_user_type_conversion_1. */
10879 expr = error_mark_node;
10880 else
10881 gcc_unreachable ();
10883 /* Free all the conversions we allocated. */
10884 obstack_free (&conversion_obstack, p);
10886 return expr;
10889 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
10890 which is bound either to a reference or a std::initializer_list. */
10892 static tree
10893 extend_ref_init_temps_1 (tree decl, tree init, vec<tree, va_gc> **cleanups)
10895 tree sub = init;
10896 tree *p;
10897 STRIP_NOPS (sub);
10898 if (TREE_CODE (sub) == COMPOUND_EXPR)
10900 TREE_OPERAND (sub, 1)
10901 = extend_ref_init_temps_1 (decl, TREE_OPERAND (sub, 1), cleanups);
10902 return init;
10904 if (TREE_CODE (sub) != ADDR_EXPR)
10905 return init;
10906 /* Deal with binding to a subobject. */
10907 for (p = &TREE_OPERAND (sub, 0); TREE_CODE (*p) == COMPONENT_REF; )
10908 p = &TREE_OPERAND (*p, 0);
10909 if (TREE_CODE (*p) == TARGET_EXPR)
10911 tree subinit = NULL_TREE;
10912 *p = set_up_extended_ref_temp (decl, *p, cleanups, &subinit);
10913 recompute_tree_invariant_for_addr_expr (sub);
10914 if (init != sub)
10915 init = fold_convert (TREE_TYPE (init), sub);
10916 if (subinit)
10917 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), subinit, init);
10919 return init;
10922 /* INIT is part of the initializer for DECL. If there are any
10923 reference or initializer lists being initialized, extend their
10924 lifetime to match that of DECL. */
10926 tree
10927 extend_ref_init_temps (tree decl, tree init, vec<tree, va_gc> **cleanups)
10929 tree type = TREE_TYPE (init);
10930 if (processing_template_decl)
10931 return init;
10932 if (TREE_CODE (type) == REFERENCE_TYPE)
10933 init = extend_ref_init_temps_1 (decl, init, cleanups);
10934 else
10936 tree ctor = init;
10937 if (TREE_CODE (ctor) == TARGET_EXPR)
10938 ctor = TARGET_EXPR_INITIAL (ctor);
10939 if (TREE_CODE (ctor) == CONSTRUCTOR)
10941 if (is_std_init_list (type))
10943 /* The temporary array underlying a std::initializer_list
10944 is handled like a reference temporary. */
10945 tree array = CONSTRUCTOR_ELT (ctor, 0)->value;
10946 array = extend_ref_init_temps_1 (decl, array, cleanups);
10947 CONSTRUCTOR_ELT (ctor, 0)->value = array;
10949 else
10951 unsigned i;
10952 constructor_elt *p;
10953 vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (ctor);
10954 FOR_EACH_VEC_SAFE_ELT (elts, i, p)
10955 p->value = extend_ref_init_temps (decl, p->value, cleanups);
10957 recompute_constructor_flags (ctor);
10958 if (decl_maybe_constant_var_p (decl) && TREE_CONSTANT (ctor))
10959 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
10963 return init;
10966 /* Returns true iff an initializer for TYPE could contain temporaries that
10967 need to be extended because they are bound to references or
10968 std::initializer_list. */
10970 bool
10971 type_has_extended_temps (tree type)
10973 type = strip_array_types (type);
10974 if (TREE_CODE (type) == REFERENCE_TYPE)
10975 return true;
10976 if (CLASS_TYPE_P (type))
10978 if (is_std_init_list (type))
10979 return true;
10980 for (tree f = next_initializable_field (TYPE_FIELDS (type));
10981 f; f = next_initializable_field (DECL_CHAIN (f)))
10982 if (type_has_extended_temps (TREE_TYPE (f)))
10983 return true;
10985 return false;
10988 /* Returns true iff TYPE is some variant of std::initializer_list. */
10990 bool
10991 is_std_init_list (tree type)
10993 if (!TYPE_P (type))
10994 return false;
10995 if (cxx_dialect == cxx98)
10996 return false;
10997 /* Look through typedefs. */
10998 type = TYPE_MAIN_VARIANT (type);
10999 return (CLASS_TYPE_P (type)
11000 && CP_TYPE_CONTEXT (type) == std_node
11001 && init_list_identifier == DECL_NAME (TYPE_NAME (type)));
11004 /* Returns true iff DECL is a list constructor: i.e. a constructor which
11005 will accept an argument list of a single std::initializer_list<T>. */
11007 bool
11008 is_list_ctor (tree decl)
11010 tree args = FUNCTION_FIRST_USER_PARMTYPE (decl);
11011 tree arg;
11013 if (!args || args == void_list_node)
11014 return false;
11016 arg = non_reference (TREE_VALUE (args));
11017 if (!is_std_init_list (arg))
11018 return false;
11020 args = TREE_CHAIN (args);
11022 if (args && args != void_list_node && !TREE_PURPOSE (args))
11023 /* There are more non-defaulted parms. */
11024 return false;
11026 return true;
11029 #include "gt-cp-call.h"