Instantiate default arguments/member initializers once.
[official-gcc.git] / gcc / cp / call.c
blobcfedd30cea35a18f58297ae6db23c1c81a1ee04d
1 /* Functions related to invoking -*- C++ -*- methods and overloaded functions.
2 Copyright (C) 1987-2017 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 tree build_over_call (struct z_candidate *, int, tsubst_flags_t);
151 #define convert_like(CONV, EXPR, COMPLAIN) \
152 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, \
153 /*issue_conversion_warnings=*/true, \
154 /*c_cast_p=*/false, (COMPLAIN))
155 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
156 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), \
157 /*issue_conversion_warnings=*/true, \
158 /*c_cast_p=*/false, (COMPLAIN))
159 static tree convert_like_real (conversion *, tree, tree, int, bool,
160 bool, tsubst_flags_t);
161 static void op_error (location_t, enum tree_code, enum tree_code, tree,
162 tree, tree, bool);
163 static struct z_candidate *build_user_type_conversion_1 (tree, tree, int,
164 tsubst_flags_t);
165 static void print_z_candidate (location_t, const char *, struct z_candidate *);
166 static void print_z_candidates (location_t, struct z_candidate *);
167 static tree build_this (tree);
168 static struct z_candidate *splice_viable (struct z_candidate *, bool, bool *);
169 static bool any_strictly_viable (struct z_candidate *);
170 static struct z_candidate *add_template_candidate
171 (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *,
172 tree, tree, tree, int, unification_kind_t, tsubst_flags_t);
173 static struct z_candidate *add_template_candidate_real
174 (struct z_candidate **, tree, tree, tree, tree, const vec<tree, va_gc> *,
175 tree, tree, tree, int, tree, unification_kind_t, tsubst_flags_t);
176 static void add_builtin_candidates
177 (struct z_candidate **, enum tree_code, enum tree_code,
178 tree, tree *, int, tsubst_flags_t);
179 static void add_builtin_candidate
180 (struct z_candidate **, enum tree_code, enum tree_code,
181 tree, tree, tree, tree *, tree *, int, tsubst_flags_t);
182 static bool is_complete (tree);
183 static void build_builtin_candidate
184 (struct z_candidate **, tree, tree, tree, tree *, tree *,
185 int, tsubst_flags_t);
186 static struct z_candidate *add_conv_candidate
187 (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, tree,
188 tree, tsubst_flags_t);
189 static struct z_candidate *add_function_candidate
190 (struct z_candidate **, tree, tree, tree, const vec<tree, va_gc> *, tree,
191 tree, int, tsubst_flags_t);
192 static conversion *implicit_conversion (tree, tree, tree, bool, int,
193 tsubst_flags_t);
194 static conversion *reference_binding (tree, tree, tree, bool, int,
195 tsubst_flags_t);
196 static conversion *build_conv (conversion_kind, tree, conversion *);
197 static conversion *build_list_conv (tree, tree, int, tsubst_flags_t);
198 static conversion *next_conversion (conversion *);
199 static bool is_subseq (conversion *, conversion *);
200 static conversion *maybe_handle_ref_bind (conversion **);
201 static void maybe_handle_implicit_object (conversion **);
202 static struct z_candidate *add_candidate
203 (struct z_candidate **, tree, tree, const vec<tree, va_gc> *, size_t,
204 conversion **, tree, tree, int, struct rejection_reason *, int);
205 static tree source_type (conversion *);
206 static void add_warning (struct z_candidate *, struct z_candidate *);
207 static bool reference_compatible_p (tree, tree);
208 static conversion *direct_reference_binding (tree, conversion *);
209 static bool promoted_arithmetic_type_p (tree);
210 static conversion *conditional_conversion (tree, tree, tsubst_flags_t);
211 static char *name_as_c_string (tree, tree, bool *);
212 static tree prep_operand (tree);
213 static void add_candidates (tree, tree, const vec<tree, va_gc> *, tree, tree,
214 bool, tree, tree, int, struct z_candidate **,
215 tsubst_flags_t);
216 static conversion *merge_conversion_sequences (conversion *, conversion *);
217 static tree build_temp (tree, tree, int, diagnostic_t *, tsubst_flags_t);
219 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
220 NAME can take many forms... */
222 bool
223 check_dtor_name (tree basetype, tree name)
225 /* Just accept something we've already complained about. */
226 if (name == error_mark_node)
227 return true;
229 if (TREE_CODE (name) == TYPE_DECL)
230 name = TREE_TYPE (name);
231 else if (TYPE_P (name))
232 /* OK */;
233 else if (identifier_p (name))
235 if ((MAYBE_CLASS_TYPE_P (basetype)
236 || TREE_CODE (basetype) == ENUMERAL_TYPE)
237 && name == constructor_name (basetype))
238 return true;
239 else
240 name = get_type_value (name);
242 else
244 /* In the case of:
246 template <class T> struct S { ~S(); };
247 int i;
248 i.~S();
250 NAME will be a class template. */
251 gcc_assert (DECL_CLASS_TEMPLATE_P (name));
252 return false;
255 if (!name || name == error_mark_node)
256 return false;
257 return same_type_p (TYPE_MAIN_VARIANT (basetype), TYPE_MAIN_VARIANT (name));
260 /* We want the address of a function or method. We avoid creating a
261 pointer-to-member function. */
263 tree
264 build_addr_func (tree function, tsubst_flags_t complain)
266 tree type = TREE_TYPE (function);
268 /* We have to do these by hand to avoid real pointer to member
269 functions. */
270 if (TREE_CODE (type) == METHOD_TYPE)
272 if (TREE_CODE (function) == OFFSET_REF)
274 tree object = build_address (TREE_OPERAND (function, 0));
275 return get_member_function_from_ptrfunc (&object,
276 TREE_OPERAND (function, 1),
277 complain);
279 function = build_address (function);
281 else
282 function = decay_conversion (function, complain, /*reject_builtin=*/false);
284 return function;
287 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
288 POINTER_TYPE to those. Note, pointer to member function types
289 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
290 two variants. build_call_a is the primitive taking an array of
291 arguments, while build_call_n is a wrapper that handles varargs. */
293 tree
294 build_call_n (tree function, int n, ...)
296 if (n == 0)
297 return build_call_a (function, 0, NULL);
298 else
300 tree *argarray = XALLOCAVEC (tree, n);
301 va_list ap;
302 int i;
304 va_start (ap, n);
305 for (i = 0; i < n; i++)
306 argarray[i] = va_arg (ap, tree);
307 va_end (ap);
308 return build_call_a (function, n, argarray);
312 /* Update various flags in cfun and the call itself based on what is being
313 called. Split out of build_call_a so that bot_manip can use it too. */
315 void
316 set_flags_from_callee (tree call)
318 bool nothrow;
319 tree decl = get_callee_fndecl (call);
321 /* We check both the decl and the type; a function may be known not to
322 throw without being declared throw(). */
323 nothrow = decl && TREE_NOTHROW (decl);
324 if (CALL_EXPR_FN (call))
325 nothrow |= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call))));
326 else if (internal_fn_flags (CALL_EXPR_IFN (call)) & ECF_NOTHROW)
327 nothrow = true;
329 if (!nothrow && at_function_scope_p () && cfun && cp_function_chain)
330 cp_function_chain->can_throw = 1;
332 if (decl && TREE_THIS_VOLATILE (decl) && cfun && cp_function_chain)
333 current_function_returns_abnormally = 1;
335 TREE_NOTHROW (call) = nothrow;
338 tree
339 build_call_a (tree function, int n, tree *argarray)
341 tree decl;
342 tree result_type;
343 tree fntype;
344 int i;
346 function = build_addr_func (function, tf_warning_or_error);
348 gcc_assert (TYPE_PTR_P (TREE_TYPE (function)));
349 fntype = TREE_TYPE (TREE_TYPE (function));
350 gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE
351 || TREE_CODE (fntype) == METHOD_TYPE);
352 result_type = TREE_TYPE (fntype);
353 /* An rvalue has no cv-qualifiers. */
354 if (SCALAR_TYPE_P (result_type) || VOID_TYPE_P (result_type))
355 result_type = cv_unqualified (result_type);
357 function = build_call_array_loc (input_location,
358 result_type, function, n, argarray);
359 set_flags_from_callee (function);
361 decl = get_callee_fndecl (function);
363 if (decl && !TREE_USED (decl))
365 /* We invoke build_call directly for several library
366 functions. These may have been declared normally if
367 we're building libgcc, so we can't just check
368 DECL_ARTIFICIAL. */
369 gcc_assert (DECL_ARTIFICIAL (decl)
370 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl)),
371 "__", 2));
372 mark_used (decl);
375 require_complete_eh_spec_types (fntype, decl);
377 TREE_HAS_CONSTRUCTOR (function) = (decl && DECL_CONSTRUCTOR_P (decl));
379 if (current_function_decl && decl
380 && flag_new_inheriting_ctors
381 && DECL_INHERITED_CTOR (current_function_decl)
382 && (DECL_INHERITED_CTOR (current_function_decl)
383 == DECL_CLONED_FUNCTION (decl)))
384 /* Pass arguments directly to the inherited constructor. */
385 CALL_FROM_THUNK_P (function) = true;
387 /* Don't pass empty class objects by value. This is useful
388 for tags in STL, which are used to control overload resolution.
389 We don't need to handle other cases of copying empty classes. */
390 else if (! decl || ! DECL_BUILT_IN (decl))
391 for (i = 0; i < n; i++)
393 tree arg = CALL_EXPR_ARG (function, i);
394 if (is_empty_class (TREE_TYPE (arg))
395 && ! TREE_ADDRESSABLE (TREE_TYPE (arg)))
397 tree t = build0 (EMPTY_CLASS_EXPR, TREE_TYPE (arg));
398 arg = build2 (COMPOUND_EXPR, TREE_TYPE (t), arg, t);
399 CALL_EXPR_ARG (function, i) = arg;
403 return function;
406 /* New overloading code. */
408 struct z_candidate;
410 struct candidate_warning {
411 z_candidate *loser;
412 candidate_warning *next;
415 /* Information for providing diagnostics about why overloading failed. */
417 enum rejection_reason_code {
418 rr_none,
419 rr_arity,
420 rr_explicit_conversion,
421 rr_template_conversion,
422 rr_arg_conversion,
423 rr_bad_arg_conversion,
424 rr_template_unification,
425 rr_invalid_copy,
426 rr_inherited_ctor,
427 rr_constraint_failure
430 struct conversion_info {
431 /* The index of the argument, 0-based. */
432 int n_arg;
433 /* The actual argument or its type. */
434 tree from;
435 /* The type of the parameter. */
436 tree to_type;
439 struct rejection_reason {
440 enum rejection_reason_code code;
441 union {
442 /* Information about an arity mismatch. */
443 struct {
444 /* The expected number of arguments. */
445 int expected;
446 /* The actual number of arguments in the call. */
447 int actual;
448 /* Whether the call was a varargs call. */
449 bool call_varargs_p;
450 } arity;
451 /* Information about an argument conversion mismatch. */
452 struct conversion_info conversion;
453 /* Same, but for bad argument conversions. */
454 struct conversion_info bad_conversion;
455 /* Information about template unification failures. These are the
456 parameters passed to fn_type_unification. */
457 struct {
458 tree tmpl;
459 tree explicit_targs;
460 int num_targs;
461 const tree *args;
462 unsigned int nargs;
463 tree return_type;
464 unification_kind_t strict;
465 int flags;
466 } template_unification;
467 /* Information about template instantiation failures. These are the
468 parameters passed to instantiate_template. */
469 struct {
470 tree tmpl;
471 tree targs;
472 } template_instantiation;
473 } u;
476 struct z_candidate {
477 /* The FUNCTION_DECL that will be called if this candidate is
478 selected by overload resolution. */
479 tree fn;
480 /* If not NULL_TREE, the first argument to use when calling this
481 function. */
482 tree first_arg;
483 /* The rest of the arguments to use when calling this function. If
484 there are no further arguments this may be NULL or it may be an
485 empty vector. */
486 const vec<tree, va_gc> *args;
487 /* The implicit conversion sequences for each of the arguments to
488 FN. */
489 conversion **convs;
490 /* The number of implicit conversion sequences. */
491 size_t num_convs;
492 /* If FN is a user-defined conversion, the standard conversion
493 sequence from the type returned by FN to the desired destination
494 type. */
495 conversion *second_conv;
496 struct rejection_reason *reason;
497 /* If FN is a member function, the binfo indicating the path used to
498 qualify the name of FN at the call site. This path is used to
499 determine whether or not FN is accessible if it is selected by
500 overload resolution. The DECL_CONTEXT of FN will always be a
501 (possibly improper) base of this binfo. */
502 tree access_path;
503 /* If FN is a non-static member function, the binfo indicating the
504 subobject to which the `this' pointer should be converted if FN
505 is selected by overload resolution. The type pointed to by
506 the `this' pointer must correspond to the most derived class
507 indicated by the CONVERSION_PATH. */
508 tree conversion_path;
509 tree template_decl;
510 tree explicit_targs;
511 candidate_warning *warnings;
512 z_candidate *next;
513 int viable;
515 /* The flags active in add_candidate. */
516 int flags;
519 /* Returns true iff T is a null pointer constant in the sense of
520 [conv.ptr]. */
522 bool
523 null_ptr_cst_p (tree t)
525 tree type = TREE_TYPE (t);
527 /* [conv.ptr]
529 A null pointer constant is an integral constant expression
530 (_expr.const_) rvalue of integer type that evaluates to zero or
531 an rvalue of type std::nullptr_t. */
532 if (NULLPTR_TYPE_P (type))
533 return true;
535 if (cxx_dialect >= cxx11)
537 /* Core issue 903 says only literal 0 is a null pointer constant. */
538 if (TREE_CODE (type) == INTEGER_TYPE
539 && !char_type_p (type)
540 && TREE_CODE (t) == INTEGER_CST
541 && integer_zerop (t)
542 && !TREE_OVERFLOW (t))
543 return true;
545 else if (CP_INTEGRAL_TYPE_P (type))
547 t = fold_non_dependent_expr (t);
548 STRIP_NOPS (t);
549 if (integer_zerop (t) && !TREE_OVERFLOW (t))
550 return true;
553 return false;
556 /* Returns true iff T is a null member pointer value (4.11). */
558 bool
559 null_member_pointer_value_p (tree t)
561 tree type = TREE_TYPE (t);
562 if (!type)
563 return false;
564 else if (TYPE_PTRMEMFUNC_P (type))
565 return (TREE_CODE (t) == CONSTRUCTOR
566 && integer_zerop (CONSTRUCTOR_ELT (t, 0)->value));
567 else if (TYPE_PTRDATAMEM_P (type))
568 return integer_all_onesp (t);
569 else
570 return false;
573 /* Returns nonzero if PARMLIST consists of only default parms,
574 ellipsis, and/or undeduced parameter packs. */
576 bool
577 sufficient_parms_p (const_tree parmlist)
579 for (; parmlist && parmlist != void_list_node;
580 parmlist = TREE_CHAIN (parmlist))
581 if (!TREE_PURPOSE (parmlist)
582 && !PACK_EXPANSION_P (TREE_VALUE (parmlist)))
583 return false;
584 return true;
587 /* Allocate N bytes of memory from the conversion obstack. The memory
588 is zeroed before being returned. */
590 static void *
591 conversion_obstack_alloc (size_t n)
593 void *p;
594 if (!conversion_obstack_initialized)
596 gcc_obstack_init (&conversion_obstack);
597 conversion_obstack_initialized = true;
599 p = obstack_alloc (&conversion_obstack, n);
600 memset (p, 0, n);
601 return p;
604 /* Allocate rejection reasons. */
606 static struct rejection_reason *
607 alloc_rejection (enum rejection_reason_code code)
609 struct rejection_reason *p;
610 p = (struct rejection_reason *) conversion_obstack_alloc (sizeof *p);
611 p->code = code;
612 return p;
615 static struct rejection_reason *
616 arity_rejection (tree first_arg, int expected, int actual)
618 struct rejection_reason *r = alloc_rejection (rr_arity);
619 int adjust = first_arg != NULL_TREE;
620 r->u.arity.expected = expected - adjust;
621 r->u.arity.actual = actual - adjust;
622 return r;
625 static struct rejection_reason *
626 arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to)
628 struct rejection_reason *r = alloc_rejection (rr_arg_conversion);
629 int adjust = first_arg != NULL_TREE;
630 r->u.conversion.n_arg = n_arg - adjust;
631 r->u.conversion.from = from;
632 r->u.conversion.to_type = to;
633 return r;
636 static struct rejection_reason *
637 bad_arg_conversion_rejection (tree first_arg, int n_arg, tree from, tree to)
639 struct rejection_reason *r = alloc_rejection (rr_bad_arg_conversion);
640 int adjust = first_arg != NULL_TREE;
641 r->u.bad_conversion.n_arg = n_arg - adjust;
642 r->u.bad_conversion.from = from;
643 r->u.bad_conversion.to_type = to;
644 return r;
647 static struct rejection_reason *
648 explicit_conversion_rejection (tree from, tree to)
650 struct rejection_reason *r = alloc_rejection (rr_explicit_conversion);
651 r->u.conversion.n_arg = 0;
652 r->u.conversion.from = from;
653 r->u.conversion.to_type = to;
654 return r;
657 static struct rejection_reason *
658 template_conversion_rejection (tree from, tree to)
660 struct rejection_reason *r = alloc_rejection (rr_template_conversion);
661 r->u.conversion.n_arg = 0;
662 r->u.conversion.from = from;
663 r->u.conversion.to_type = to;
664 return r;
667 static struct rejection_reason *
668 template_unification_rejection (tree tmpl, tree explicit_targs, tree targs,
669 const tree *args, unsigned int nargs,
670 tree return_type, unification_kind_t strict,
671 int flags)
673 size_t args_n_bytes = sizeof (*args) * nargs;
674 tree *args1 = (tree *) conversion_obstack_alloc (args_n_bytes);
675 struct rejection_reason *r = alloc_rejection (rr_template_unification);
676 r->u.template_unification.tmpl = tmpl;
677 r->u.template_unification.explicit_targs = explicit_targs;
678 r->u.template_unification.num_targs = TREE_VEC_LENGTH (targs);
679 /* Copy args to our own storage. */
680 memcpy (args1, args, args_n_bytes);
681 r->u.template_unification.args = args1;
682 r->u.template_unification.nargs = nargs;
683 r->u.template_unification.return_type = return_type;
684 r->u.template_unification.strict = strict;
685 r->u.template_unification.flags = flags;
686 return r;
689 static struct rejection_reason *
690 template_unification_error_rejection (void)
692 return alloc_rejection (rr_template_unification);
695 static struct rejection_reason *
696 invalid_copy_with_fn_template_rejection (void)
698 struct rejection_reason *r = alloc_rejection (rr_invalid_copy);
699 return r;
702 static struct rejection_reason *
703 inherited_ctor_rejection (void)
705 struct rejection_reason *r = alloc_rejection (rr_inherited_ctor);
706 return r;
709 // Build a constraint failure record, saving information into the
710 // template_instantiation field of the rejection. If FN is not a template
711 // declaration, the TMPL member is the FN declaration and TARGS is empty.
713 static struct rejection_reason *
714 constraint_failure (tree fn)
716 struct rejection_reason *r = alloc_rejection (rr_constraint_failure);
717 if (tree ti = DECL_TEMPLATE_INFO (fn))
719 r->u.template_instantiation.tmpl = TI_TEMPLATE (ti);
720 r->u.template_instantiation.targs = TI_ARGS (ti);
722 else
724 r->u.template_instantiation.tmpl = fn;
725 r->u.template_instantiation.targs = NULL_TREE;
727 return r;
730 /* Dynamically allocate a conversion. */
732 static conversion *
733 alloc_conversion (conversion_kind kind)
735 conversion *c;
736 c = (conversion *) conversion_obstack_alloc (sizeof (conversion));
737 c->kind = kind;
738 return c;
741 /* Make sure that all memory on the conversion obstack has been
742 freed. */
744 void
745 validate_conversion_obstack (void)
747 if (conversion_obstack_initialized)
748 gcc_assert ((obstack_next_free (&conversion_obstack)
749 == obstack_base (&conversion_obstack)));
752 /* Dynamically allocate an array of N conversions. */
754 static conversion **
755 alloc_conversions (size_t n)
757 return (conversion **) conversion_obstack_alloc (n * sizeof (conversion *));
760 static conversion *
761 build_conv (conversion_kind code, tree type, conversion *from)
763 conversion *t;
764 conversion_rank rank = CONVERSION_RANK (from);
766 /* Note that the caller is responsible for filling in t->cand for
767 user-defined conversions. */
768 t = alloc_conversion (code);
769 t->type = type;
770 t->u.next = from;
772 switch (code)
774 case ck_ptr:
775 case ck_pmem:
776 case ck_base:
777 case ck_std:
778 if (rank < cr_std)
779 rank = cr_std;
780 break;
782 case ck_qual:
783 case ck_fnptr:
784 if (rank < cr_exact)
785 rank = cr_exact;
786 break;
788 default:
789 break;
791 t->rank = rank;
792 t->user_conv_p = (code == ck_user || from->user_conv_p);
793 t->bad_p = from->bad_p;
794 t->base_p = false;
795 return t;
798 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
799 specialization of std::initializer_list<T>, if such a conversion is
800 possible. */
802 static conversion *
803 build_list_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
805 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type), 0);
806 unsigned len = CONSTRUCTOR_NELTS (ctor);
807 conversion **subconvs = alloc_conversions (len);
808 conversion *t;
809 unsigned i;
810 tree val;
812 /* Within a list-initialization we can have more user-defined
813 conversions. */
814 flags &= ~LOOKUP_NO_CONVERSION;
815 /* But no narrowing conversions. */
816 flags |= LOOKUP_NO_NARROWING;
818 /* Can't make an array of these types. */
819 if (TREE_CODE (elttype) == REFERENCE_TYPE
820 || TREE_CODE (elttype) == FUNCTION_TYPE
821 || VOID_TYPE_P (elttype))
822 return NULL;
824 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
826 conversion *sub
827 = implicit_conversion (elttype, TREE_TYPE (val), val,
828 false, flags, complain);
829 if (sub == NULL)
830 return NULL;
832 subconvs[i] = sub;
835 t = alloc_conversion (ck_list);
836 t->type = type;
837 t->u.list = subconvs;
838 t->rank = cr_exact;
840 for (i = 0; i < len; ++i)
842 conversion *sub = subconvs[i];
843 if (sub->rank > t->rank)
844 t->rank = sub->rank;
845 if (sub->user_conv_p)
846 t->user_conv_p = true;
847 if (sub->bad_p)
848 t->bad_p = true;
851 return t;
854 /* Return the next conversion of the conversion chain (if applicable),
855 or NULL otherwise. Please use this function instead of directly
856 accessing fields of struct conversion. */
858 static conversion *
859 next_conversion (conversion *conv)
861 if (conv == NULL
862 || conv->kind == ck_identity
863 || conv->kind == ck_ambig
864 || conv->kind == ck_list)
865 return NULL;
866 return conv->u.next;
869 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
870 is a valid aggregate initializer for array type ATYPE. */
872 static bool
873 can_convert_array (tree atype, tree ctor, int flags, tsubst_flags_t complain)
875 unsigned i;
876 tree elttype = TREE_TYPE (atype);
877 for (i = 0; i < CONSTRUCTOR_NELTS (ctor); ++i)
879 tree val = CONSTRUCTOR_ELT (ctor, i)->value;
880 bool ok;
881 if (TREE_CODE (elttype) == ARRAY_TYPE
882 && TREE_CODE (val) == CONSTRUCTOR)
883 ok = can_convert_array (elttype, val, flags, complain);
884 else
885 ok = can_convert_arg (elttype, TREE_TYPE (val), val, flags,
886 complain);
887 if (!ok)
888 return false;
890 return true;
893 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
894 aggregate class, if such a conversion is possible. */
896 static conversion *
897 build_aggr_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
899 unsigned HOST_WIDE_INT i = 0;
900 conversion *c;
901 tree field = next_initializable_field (TYPE_FIELDS (type));
902 tree empty_ctor = NULL_TREE;
904 /* We already called reshape_init in implicit_conversion. */
906 /* The conversions within the init-list aren't affected by the enclosing
907 context; they're always simple copy-initialization. */
908 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
910 for (; field; field = next_initializable_field (DECL_CHAIN (field)))
912 tree ftype = TREE_TYPE (field);
913 tree val;
914 bool ok;
916 if (i < CONSTRUCTOR_NELTS (ctor))
917 val = CONSTRUCTOR_ELT (ctor, i)->value;
918 else if (DECL_INITIAL (field))
919 val = get_nsdmi (field, /*ctor*/false, complain);
920 else if (TREE_CODE (ftype) == REFERENCE_TYPE)
921 /* Value-initialization of reference is ill-formed. */
922 return NULL;
923 else
925 if (empty_ctor == NULL_TREE)
926 empty_ctor = build_constructor (init_list_type_node, NULL);
927 val = empty_ctor;
929 ++i;
931 if (TREE_CODE (ftype) == ARRAY_TYPE
932 && TREE_CODE (val) == CONSTRUCTOR)
933 ok = can_convert_array (ftype, val, flags, complain);
934 else
935 ok = can_convert_arg (ftype, TREE_TYPE (val), val, flags,
936 complain);
938 if (!ok)
939 return NULL;
941 if (TREE_CODE (type) == UNION_TYPE)
942 break;
945 if (i < CONSTRUCTOR_NELTS (ctor))
946 return NULL;
948 c = alloc_conversion (ck_aggr);
949 c->type = type;
950 c->rank = cr_exact;
951 c->user_conv_p = true;
952 c->check_narrowing = true;
953 c->u.next = NULL;
954 return c;
957 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
958 array type, if such a conversion is possible. */
960 static conversion *
961 build_array_conv (tree type, tree ctor, int flags, tsubst_flags_t complain)
963 conversion *c;
964 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
965 tree elttype = TREE_TYPE (type);
966 unsigned i;
967 tree val;
968 bool bad = false;
969 bool user = false;
970 enum conversion_rank rank = cr_exact;
972 /* We might need to propagate the size from the element to the array. */
973 complete_type (type);
975 if (TYPE_DOMAIN (type)
976 && !variably_modified_type_p (TYPE_DOMAIN (type), NULL_TREE))
978 unsigned HOST_WIDE_INT alen = tree_to_uhwi (array_type_nelts_top (type));
979 if (alen < len)
980 return NULL;
983 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
985 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
987 conversion *sub
988 = implicit_conversion (elttype, TREE_TYPE (val), val,
989 false, flags, complain);
990 if (sub == NULL)
991 return NULL;
993 if (sub->rank > rank)
994 rank = sub->rank;
995 if (sub->user_conv_p)
996 user = true;
997 if (sub->bad_p)
998 bad = true;
1001 c = alloc_conversion (ck_aggr);
1002 c->type = type;
1003 c->rank = rank;
1004 c->user_conv_p = user;
1005 c->bad_p = bad;
1006 c->u.next = NULL;
1007 return c;
1010 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1011 complex type, if such a conversion is possible. */
1013 static conversion *
1014 build_complex_conv (tree type, tree ctor, int flags,
1015 tsubst_flags_t complain)
1017 conversion *c;
1018 unsigned HOST_WIDE_INT len = CONSTRUCTOR_NELTS (ctor);
1019 tree elttype = TREE_TYPE (type);
1020 unsigned i;
1021 tree val;
1022 bool bad = false;
1023 bool user = false;
1024 enum conversion_rank rank = cr_exact;
1026 if (len != 2)
1027 return NULL;
1029 flags = LOOKUP_IMPLICIT|LOOKUP_NO_NARROWING;
1031 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), i, val)
1033 conversion *sub
1034 = implicit_conversion (elttype, TREE_TYPE (val), val,
1035 false, flags, complain);
1036 if (sub == NULL)
1037 return NULL;
1039 if (sub->rank > rank)
1040 rank = sub->rank;
1041 if (sub->user_conv_p)
1042 user = true;
1043 if (sub->bad_p)
1044 bad = true;
1047 c = alloc_conversion (ck_aggr);
1048 c->type = type;
1049 c->rank = rank;
1050 c->user_conv_p = user;
1051 c->bad_p = bad;
1052 c->u.next = NULL;
1053 return c;
1056 /* Build a representation of the identity conversion from EXPR to
1057 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1059 static conversion *
1060 build_identity_conv (tree type, tree expr)
1062 conversion *c;
1064 c = alloc_conversion (ck_identity);
1065 c->type = type;
1066 c->u.expr = expr;
1068 return c;
1071 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1072 were multiple user-defined conversions to accomplish the job.
1073 Build a conversion that indicates that ambiguity. */
1075 static conversion *
1076 build_ambiguous_conv (tree type, tree expr)
1078 conversion *c;
1080 c = alloc_conversion (ck_ambig);
1081 c->type = type;
1082 c->u.expr = expr;
1084 return c;
1087 tree
1088 strip_top_quals (tree t)
1090 if (TREE_CODE (t) == ARRAY_TYPE)
1091 return t;
1092 return cp_build_qualified_type (t, 0);
1095 /* Returns the standard conversion path (see [conv]) from type FROM to type
1096 TO, if any. For proper handling of null pointer constants, you must
1097 also pass the expression EXPR to convert from. If C_CAST_P is true,
1098 this conversion is coming from a C-style cast. */
1100 static conversion *
1101 standard_conversion (tree to, tree from, tree expr, bool c_cast_p,
1102 int flags, tsubst_flags_t complain)
1104 enum tree_code fcode, tcode;
1105 conversion *conv;
1106 bool fromref = false;
1107 tree qualified_to;
1109 to = non_reference (to);
1110 if (TREE_CODE (from) == REFERENCE_TYPE)
1112 fromref = true;
1113 from = TREE_TYPE (from);
1115 qualified_to = to;
1116 to = strip_top_quals (to);
1117 from = strip_top_quals (from);
1119 if (expr && type_unknown_p (expr))
1121 if (TYPE_PTRFN_P (to) || TYPE_PTRMEMFUNC_P (to))
1123 tsubst_flags_t tflags = tf_conv;
1124 expr = instantiate_type (to, expr, tflags);
1125 if (expr == error_mark_node)
1126 return NULL;
1127 from = TREE_TYPE (expr);
1129 else if (TREE_CODE (to) == BOOLEAN_TYPE)
1131 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1132 expr = resolve_nondeduced_context (expr, complain);
1133 from = TREE_TYPE (expr);
1137 fcode = TREE_CODE (from);
1138 tcode = TREE_CODE (to);
1140 conv = build_identity_conv (from, expr);
1141 if (fcode == FUNCTION_TYPE || fcode == ARRAY_TYPE)
1143 from = type_decays_to (from);
1144 fcode = TREE_CODE (from);
1145 conv = build_conv (ck_lvalue, from, conv);
1147 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1148 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1149 express the copy constructor call required by copy-initialization. */
1150 else if (fromref || (expr && obvalue_p (expr)))
1152 if (expr)
1154 tree bitfield_type;
1155 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
1156 if (bitfield_type)
1158 from = strip_top_quals (bitfield_type);
1159 fcode = TREE_CODE (from);
1162 conv = build_conv (ck_rvalue, from, conv);
1163 if (flags & LOOKUP_PREFER_RVALUE)
1164 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1165 conv->rvaluedness_matches_p = true;
1168 /* Allow conversion between `__complex__' data types. */
1169 if (tcode == COMPLEX_TYPE && fcode == COMPLEX_TYPE)
1171 /* The standard conversion sequence to convert FROM to TO is
1172 the standard conversion sequence to perform componentwise
1173 conversion. */
1174 conversion *part_conv = standard_conversion
1175 (TREE_TYPE (to), TREE_TYPE (from), NULL_TREE, c_cast_p, flags,
1176 complain);
1178 if (part_conv)
1180 conv = build_conv (part_conv->kind, to, conv);
1181 conv->rank = part_conv->rank;
1183 else
1184 conv = NULL;
1186 return conv;
1189 if (same_type_p (from, to))
1191 if (CLASS_TYPE_P (to) && conv->kind == ck_rvalue)
1192 conv->type = qualified_to;
1193 return conv;
1196 /* [conv.ptr]
1197 A null pointer constant can be converted to a pointer type; ... A
1198 null pointer constant of integral type can be converted to an
1199 rvalue of type std::nullptr_t. */
1200 if ((tcode == POINTER_TYPE || TYPE_PTRMEM_P (to)
1201 || NULLPTR_TYPE_P (to))
1202 && ((expr && null_ptr_cst_p (expr))
1203 || NULLPTR_TYPE_P (from)))
1204 conv = build_conv (ck_std, to, conv);
1205 else if ((tcode == INTEGER_TYPE && fcode == POINTER_TYPE)
1206 || (tcode == POINTER_TYPE && fcode == INTEGER_TYPE))
1208 /* For backwards brain damage compatibility, allow interconversion of
1209 pointers and integers with a pedwarn. */
1210 conv = build_conv (ck_std, to, conv);
1211 conv->bad_p = true;
1213 else if (UNSCOPED_ENUM_P (to) && fcode == INTEGER_TYPE)
1215 /* For backwards brain damage compatibility, allow interconversion of
1216 enums and integers with a pedwarn. */
1217 conv = build_conv (ck_std, to, conv);
1218 conv->bad_p = true;
1220 else if ((tcode == POINTER_TYPE && fcode == POINTER_TYPE)
1221 || (TYPE_PTRDATAMEM_P (to) && TYPE_PTRDATAMEM_P (from)))
1223 tree to_pointee;
1224 tree from_pointee;
1226 if (tcode == POINTER_TYPE)
1228 to_pointee = TREE_TYPE (to);
1229 from_pointee = TREE_TYPE (from);
1231 /* Since this is the target of a pointer, it can't have function
1232 qualifiers, so any TYPE_QUALS must be for attributes const or
1233 noreturn. Strip them. */
1234 if (TREE_CODE (to_pointee) == FUNCTION_TYPE
1235 && TYPE_QUALS (to_pointee))
1236 to_pointee = build_qualified_type (to_pointee, TYPE_UNQUALIFIED);
1237 if (TREE_CODE (from_pointee) == FUNCTION_TYPE
1238 && TYPE_QUALS (from_pointee))
1239 from_pointee = build_qualified_type (from_pointee, TYPE_UNQUALIFIED);
1241 else
1243 to_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (to);
1244 from_pointee = TYPE_PTRMEM_POINTED_TO_TYPE (from);
1247 if (tcode == POINTER_TYPE
1248 && same_type_ignoring_top_level_qualifiers_p (from_pointee,
1249 to_pointee))
1251 else if (VOID_TYPE_P (to_pointee)
1252 && !TYPE_PTRDATAMEM_P (from)
1253 && TREE_CODE (from_pointee) != FUNCTION_TYPE)
1255 tree nfrom = TREE_TYPE (from);
1256 /* Don't try to apply restrict to void. */
1257 int quals = cp_type_quals (nfrom) & ~TYPE_QUAL_RESTRICT;
1258 from_pointee = cp_build_qualified_type (void_type_node, quals);
1259 from = build_pointer_type (from_pointee);
1260 conv = build_conv (ck_ptr, from, conv);
1262 else if (TYPE_PTRDATAMEM_P (from))
1264 tree fbase = TYPE_PTRMEM_CLASS_TYPE (from);
1265 tree tbase = TYPE_PTRMEM_CLASS_TYPE (to);
1267 if (same_type_p (fbase, tbase))
1268 /* No base conversion needed. */;
1269 else if (DERIVED_FROM_P (fbase, tbase)
1270 && (same_type_ignoring_top_level_qualifiers_p
1271 (from_pointee, to_pointee)))
1273 from = build_ptrmem_type (tbase, from_pointee);
1274 conv = build_conv (ck_pmem, from, conv);
1276 else
1277 return NULL;
1279 else if (CLASS_TYPE_P (from_pointee)
1280 && CLASS_TYPE_P (to_pointee)
1281 /* [conv.ptr]
1283 An rvalue of type "pointer to cv D," where D is a
1284 class type, can be converted to an rvalue of type
1285 "pointer to cv B," where B is a base class (clause
1286 _class.derived_) of D. If B is an inaccessible
1287 (clause _class.access_) or ambiguous
1288 (_class.member.lookup_) base class of D, a program
1289 that necessitates this conversion is ill-formed.
1290 Therefore, we use DERIVED_FROM_P, and do not check
1291 access or uniqueness. */
1292 && DERIVED_FROM_P (to_pointee, from_pointee))
1294 from_pointee
1295 = cp_build_qualified_type (to_pointee,
1296 cp_type_quals (from_pointee));
1297 from = build_pointer_type (from_pointee);
1298 conv = build_conv (ck_ptr, from, conv);
1299 conv->base_p = true;
1302 if (same_type_p (from, to))
1303 /* OK */;
1304 else if (c_cast_p && comp_ptr_ttypes_const (to, from))
1305 /* In a C-style cast, we ignore CV-qualification because we
1306 are allowed to perform a static_cast followed by a
1307 const_cast. */
1308 conv = build_conv (ck_qual, to, conv);
1309 else if (!c_cast_p && comp_ptr_ttypes (to_pointee, from_pointee))
1310 conv = build_conv (ck_qual, to, conv);
1311 else if (expr && string_conv_p (to, expr, 0))
1312 /* converting from string constant to char *. */
1313 conv = build_conv (ck_qual, to, conv);
1314 else if (fnptr_conv_p (to, from))
1315 conv = build_conv (ck_fnptr, to, conv);
1316 /* Allow conversions among compatible ObjC pointer types (base
1317 conversions have been already handled above). */
1318 else if (c_dialect_objc ()
1319 && objc_compare_types (to, from, -4, NULL_TREE))
1320 conv = build_conv (ck_ptr, to, conv);
1321 else if (ptr_reasonably_similar (to_pointee, from_pointee))
1323 conv = build_conv (ck_ptr, to, conv);
1324 conv->bad_p = true;
1326 else
1327 return NULL;
1329 from = to;
1331 else if (TYPE_PTRMEMFUNC_P (to) && TYPE_PTRMEMFUNC_P (from))
1333 tree fromfn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from));
1334 tree tofn = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to));
1335 tree fbase = class_of_this_parm (fromfn);
1336 tree tbase = class_of_this_parm (tofn);
1338 if (!DERIVED_FROM_P (fbase, tbase))
1339 return NULL;
1341 tree fstat = static_fn_type (fromfn);
1342 tree tstat = static_fn_type (tofn);
1343 if (same_type_p (tstat, fstat)
1344 || fnptr_conv_p (tstat, fstat))
1345 /* OK */;
1346 else
1347 return NULL;
1349 if (!same_type_p (fbase, tbase))
1351 from = build_memfn_type (fstat,
1352 tbase,
1353 cp_type_quals (tbase),
1354 type_memfn_rqual (tofn));
1355 from = build_ptrmemfunc_type (build_pointer_type (from));
1356 conv = build_conv (ck_pmem, from, conv);
1357 conv->base_p = true;
1359 if (fnptr_conv_p (tstat, fstat))
1360 conv = build_conv (ck_fnptr, to, conv);
1362 else if (tcode == BOOLEAN_TYPE)
1364 /* [conv.bool]
1366 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1367 to member type can be converted to a prvalue of type bool. ...
1368 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1369 std::nullptr_t can be converted to a prvalue of type bool; */
1370 if (ARITHMETIC_TYPE_P (from)
1371 || UNSCOPED_ENUM_P (from)
1372 || fcode == POINTER_TYPE
1373 || TYPE_PTRMEM_P (from)
1374 || NULLPTR_TYPE_P (from))
1376 conv = build_conv (ck_std, to, conv);
1377 if (fcode == POINTER_TYPE
1378 || TYPE_PTRDATAMEM_P (from)
1379 || (TYPE_PTRMEMFUNC_P (from)
1380 && conv->rank < cr_pbool)
1381 || NULLPTR_TYPE_P (from))
1382 conv->rank = cr_pbool;
1383 if (NULLPTR_TYPE_P (from) && (flags & LOOKUP_ONLYCONVERTING))
1384 conv->bad_p = true;
1385 return conv;
1388 return NULL;
1390 /* We don't check for ENUMERAL_TYPE here because there are no standard
1391 conversions to enum type. */
1392 /* As an extension, allow conversion to complex type. */
1393 else if (ARITHMETIC_TYPE_P (to))
1395 if (! (INTEGRAL_CODE_P (fcode)
1396 || (fcode == REAL_TYPE && !(flags & LOOKUP_NO_NON_INTEGRAL)))
1397 || SCOPED_ENUM_P (from))
1398 return NULL;
1399 conv = build_conv (ck_std, to, conv);
1401 /* Give this a better rank if it's a promotion. */
1402 if (same_type_p (to, type_promotes_to (from))
1403 && next_conversion (conv)->rank <= cr_promotion)
1404 conv->rank = cr_promotion;
1406 else if (fcode == VECTOR_TYPE && tcode == VECTOR_TYPE
1407 && vector_types_convertible_p (from, to, false))
1408 return build_conv (ck_std, to, conv);
1409 else if (MAYBE_CLASS_TYPE_P (to) && MAYBE_CLASS_TYPE_P (from)
1410 && is_properly_derived_from (from, to))
1412 if (conv->kind == ck_rvalue)
1413 conv = next_conversion (conv);
1414 conv = build_conv (ck_base, to, conv);
1415 /* The derived-to-base conversion indicates the initialization
1416 of a parameter with base type from an object of a derived
1417 type. A temporary object is created to hold the result of
1418 the conversion unless we're binding directly to a reference. */
1419 conv->need_temporary_p = !(flags & LOOKUP_NO_TEMP_BIND);
1421 else
1422 return NULL;
1424 if (flags & LOOKUP_NO_NARROWING)
1425 conv->check_narrowing = true;
1427 return conv;
1430 /* Returns nonzero if T1 is reference-related to T2. */
1432 bool
1433 reference_related_p (tree t1, tree t2)
1435 if (t1 == error_mark_node || t2 == error_mark_node)
1436 return false;
1438 t1 = TYPE_MAIN_VARIANT (t1);
1439 t2 = TYPE_MAIN_VARIANT (t2);
1441 /* [dcl.init.ref]
1443 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1444 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1445 of T2. */
1446 return (same_type_p (t1, t2)
1447 || (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
1448 && DERIVED_FROM_P (t1, t2)));
1451 /* Returns nonzero if T1 is reference-compatible with T2. */
1453 static bool
1454 reference_compatible_p (tree t1, tree t2)
1456 /* [dcl.init.ref]
1458 "cv1 T1" is reference compatible with "cv2 T2" if
1459 * T1 is reference-related to T2 or
1460 * T2 is "noexcept function" and T1 is "function", where the
1461 function types are otherwise the same,
1462 and cv1 is the same cv-qualification as, or greater cv-qualification
1463 than, cv2. */
1464 return ((reference_related_p (t1, t2)
1465 || fnptr_conv_p (t1, t2))
1466 && at_least_as_qualified_p (t1, t2));
1469 /* A reference of the indicated TYPE is being bound directly to the
1470 expression represented by the implicit conversion sequence CONV.
1471 Return a conversion sequence for this binding. */
1473 static conversion *
1474 direct_reference_binding (tree type, conversion *conv)
1476 tree t;
1478 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
1479 gcc_assert (TREE_CODE (conv->type) != REFERENCE_TYPE);
1481 t = TREE_TYPE (type);
1483 /* [over.ics.rank]
1485 When a parameter of reference type binds directly
1486 (_dcl.init.ref_) to an argument expression, the implicit
1487 conversion sequence is the identity conversion, unless the
1488 argument expression has a type that is a derived class of the
1489 parameter type, in which case the implicit conversion sequence is
1490 a derived-to-base Conversion.
1492 If the parameter binds directly to the result of applying a
1493 conversion function to the argument expression, the implicit
1494 conversion sequence is a user-defined conversion sequence
1495 (_over.ics.user_), with the second standard conversion sequence
1496 either an identity conversion or, if the conversion function
1497 returns an entity of a type that is a derived class of the
1498 parameter type, a derived-to-base conversion. */
1499 if (is_properly_derived_from (conv->type, t))
1501 /* Represent the derived-to-base conversion. */
1502 conv = build_conv (ck_base, t, conv);
1503 /* We will actually be binding to the base-class subobject in
1504 the derived class, so we mark this conversion appropriately.
1505 That way, convert_like knows not to generate a temporary. */
1506 conv->need_temporary_p = false;
1508 return build_conv (ck_ref_bind, type, conv);
1511 /* Returns the conversion path from type FROM to reference type TO for
1512 purposes of reference binding. For lvalue binding, either pass a
1513 reference type to FROM or an lvalue expression to EXPR. If the
1514 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1515 the conversion returned. If C_CAST_P is true, this
1516 conversion is coming from a C-style cast. */
1518 static conversion *
1519 reference_binding (tree rto, tree rfrom, tree expr, bool c_cast_p, int flags,
1520 tsubst_flags_t complain)
1522 conversion *conv = NULL;
1523 tree to = TREE_TYPE (rto);
1524 tree from = rfrom;
1525 tree tfrom;
1526 bool related_p;
1527 bool compatible_p;
1528 cp_lvalue_kind gl_kind;
1529 bool is_lvalue;
1531 if (TREE_CODE (to) == FUNCTION_TYPE && expr && type_unknown_p (expr))
1533 expr = instantiate_type (to, expr, tf_none);
1534 if (expr == error_mark_node)
1535 return NULL;
1536 from = TREE_TYPE (expr);
1539 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1541 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
1542 /* DR 1288: Otherwise, if the initializer list has a single element
1543 of type E and ... [T's] referenced type is reference-related to E,
1544 the object or reference is initialized from that element... */
1545 if (CONSTRUCTOR_NELTS (expr) == 1)
1547 tree elt = CONSTRUCTOR_ELT (expr, 0)->value;
1548 if (error_operand_p (elt))
1549 return NULL;
1550 tree etype = TREE_TYPE (elt);
1551 if (reference_related_p (to, etype))
1553 expr = elt;
1554 from = etype;
1555 goto skip;
1558 /* Otherwise, if T is a reference type, a prvalue temporary of the
1559 type referenced by T is copy-list-initialized or
1560 direct-list-initialized, depending on the kind of initialization
1561 for the reference, and the reference is bound to that temporary. */
1562 conv = implicit_conversion (to, from, expr, c_cast_p,
1563 flags|LOOKUP_NO_TEMP_BIND, complain);
1564 skip:;
1567 if (TREE_CODE (from) == REFERENCE_TYPE)
1569 from = TREE_TYPE (from);
1570 if (!TYPE_REF_IS_RVALUE (rfrom)
1571 || TREE_CODE (from) == FUNCTION_TYPE)
1572 gl_kind = clk_ordinary;
1573 else
1574 gl_kind = clk_rvalueref;
1576 else if (expr)
1577 gl_kind = lvalue_kind (expr);
1578 else if (CLASS_TYPE_P (from)
1579 || TREE_CODE (from) == ARRAY_TYPE)
1580 gl_kind = clk_class;
1581 else
1582 gl_kind = clk_none;
1584 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1585 if ((flags & LOOKUP_NO_TEMP_BIND)
1586 && (gl_kind & clk_class))
1587 gl_kind = clk_none;
1589 /* Same mask as real_lvalue_p. */
1590 is_lvalue = gl_kind && !(gl_kind & (clk_rvalueref|clk_class));
1592 tfrom = from;
1593 if ((gl_kind & clk_bitfield) != 0)
1594 tfrom = unlowered_expr_type (expr);
1596 /* Figure out whether or not the types are reference-related and
1597 reference compatible. We have to do this after stripping
1598 references from FROM. */
1599 related_p = reference_related_p (to, tfrom);
1600 /* If this is a C cast, first convert to an appropriately qualified
1601 type, so that we can later do a const_cast to the desired type. */
1602 if (related_p && c_cast_p
1603 && !at_least_as_qualified_p (to, tfrom))
1604 to = cp_build_qualified_type (to, cp_type_quals (tfrom));
1605 compatible_p = reference_compatible_p (to, tfrom);
1607 /* Directly bind reference when target expression's type is compatible with
1608 the reference and expression is an lvalue. In DR391, the wording in
1609 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1610 const and rvalue references to rvalues of compatible class type.
1611 We should also do direct bindings for non-class xvalues. */
1612 if ((related_p || compatible_p) && gl_kind)
1614 /* [dcl.init.ref]
1616 If the initializer expression
1618 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1619 is reference-compatible with "cv2 T2,"
1621 the reference is bound directly to the initializer expression
1622 lvalue.
1624 [...]
1625 If the initializer expression is an rvalue, with T2 a class type,
1626 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1627 is bound to the object represented by the rvalue or to a sub-object
1628 within that object. */
1630 conv = build_identity_conv (tfrom, expr);
1631 conv = direct_reference_binding (rto, conv);
1633 if (TREE_CODE (rfrom) == REFERENCE_TYPE)
1634 /* Handle rvalue reference to function properly. */
1635 conv->rvaluedness_matches_p
1636 = (TYPE_REF_IS_RVALUE (rto) == TYPE_REF_IS_RVALUE (rfrom));
1637 else
1638 conv->rvaluedness_matches_p
1639 = (TYPE_REF_IS_RVALUE (rto) == !is_lvalue);
1641 if ((gl_kind & clk_bitfield) != 0
1642 || ((gl_kind & clk_packed) != 0 && !TYPE_PACKED (to)))
1643 /* For the purposes of overload resolution, we ignore the fact
1644 this expression is a bitfield or packed field. (In particular,
1645 [over.ics.ref] says specifically that a function with a
1646 non-const reference parameter is viable even if the
1647 argument is a bitfield.)
1649 However, when we actually call the function we must create
1650 a temporary to which to bind the reference. If the
1651 reference is volatile, or isn't const, then we cannot make
1652 a temporary, so we just issue an error when the conversion
1653 actually occurs. */
1654 conv->need_temporary_p = true;
1656 /* Don't allow binding of lvalues (other than function lvalues) to
1657 rvalue references. */
1658 if (is_lvalue && TYPE_REF_IS_RVALUE (rto)
1659 && TREE_CODE (to) != FUNCTION_TYPE)
1660 conv->bad_p = true;
1662 /* Nor the reverse. */
1663 if (!is_lvalue && !TYPE_REF_IS_RVALUE (rto)
1664 && (!CP_TYPE_CONST_NON_VOLATILE_P (to)
1665 || (flags & LOOKUP_NO_RVAL_BIND))
1666 && TREE_CODE (to) != FUNCTION_TYPE)
1667 conv->bad_p = true;
1669 if (!compatible_p)
1670 conv->bad_p = true;
1672 return conv;
1674 /* [class.conv.fct] A conversion function is never used to convert a
1675 (possibly cv-qualified) object to the (possibly cv-qualified) same
1676 object type (or a reference to it), to a (possibly cv-qualified) base
1677 class of that type (or a reference to it).... */
1678 else if (CLASS_TYPE_P (from) && !related_p
1679 && !(flags & LOOKUP_NO_CONVERSION))
1681 /* [dcl.init.ref]
1683 If the initializer expression
1685 -- has a class type (i.e., T2 is a class type) can be
1686 implicitly converted to an lvalue of type "cv3 T3," where
1687 "cv1 T1" is reference-compatible with "cv3 T3". (this
1688 conversion is selected by enumerating the applicable
1689 conversion functions (_over.match.ref_) and choosing the
1690 best one through overload resolution. (_over.match_).
1692 the reference is bound to the lvalue result of the conversion
1693 in the second case. */
1694 z_candidate *cand = build_user_type_conversion_1 (rto, expr, flags,
1695 complain);
1696 if (cand)
1697 return cand->second_conv;
1700 /* From this point on, we conceptually need temporaries, even if we
1701 elide them. Only the cases above are "direct bindings". */
1702 if (flags & LOOKUP_NO_TEMP_BIND)
1703 return NULL;
1705 /* [over.ics.rank]
1707 When a parameter of reference type is not bound directly to an
1708 argument expression, the conversion sequence is the one required
1709 to convert the argument expression to the underlying type of the
1710 reference according to _over.best.ics_. Conceptually, this
1711 conversion sequence corresponds to copy-initializing a temporary
1712 of the underlying type with the argument expression. Any
1713 difference in top-level cv-qualification is subsumed by the
1714 initialization itself and does not constitute a conversion. */
1716 /* [dcl.init.ref]
1718 Otherwise, the reference shall be an lvalue reference to a
1719 non-volatile const type, or the reference shall be an rvalue
1720 reference.
1722 We try below to treat this as a bad conversion to improve diagnostics,
1723 but if TO is an incomplete class, we need to reject this conversion
1724 now to avoid unnecessary instantiation. */
1725 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto)
1726 && !COMPLETE_TYPE_P (to))
1727 return NULL;
1729 /* We're generating a temporary now, but don't bind any more in the
1730 conversion (specifically, don't slice the temporary returned by a
1731 conversion operator). */
1732 flags |= LOOKUP_NO_TEMP_BIND;
1734 /* Core issue 899: When [copy-]initializing a temporary to be bound
1735 to the first parameter of a copy constructor (12.8) called with
1736 a single argument in the context of direct-initialization,
1737 explicit conversion functions are also considered.
1739 So don't set LOOKUP_ONLYCONVERTING in that case. */
1740 if (!(flags & LOOKUP_COPY_PARM))
1741 flags |= LOOKUP_ONLYCONVERTING;
1743 if (!conv)
1744 conv = implicit_conversion (to, from, expr, c_cast_p,
1745 flags, complain);
1746 if (!conv)
1747 return NULL;
1749 if (conv->user_conv_p)
1751 /* If initializing the temporary used a conversion function,
1752 recalculate the second conversion sequence. */
1753 for (conversion *t = conv; t; t = next_conversion (t))
1754 if (t->kind == ck_user
1755 && DECL_CONV_FN_P (t->cand->fn))
1757 tree ftype = TREE_TYPE (TREE_TYPE (t->cand->fn));
1758 int sflags = (flags|LOOKUP_NO_CONVERSION)&~LOOKUP_NO_TEMP_BIND;
1759 conversion *new_second
1760 = reference_binding (rto, ftype, NULL_TREE, c_cast_p,
1761 sflags, complain);
1762 if (!new_second)
1763 return NULL;
1764 return merge_conversion_sequences (t, new_second);
1768 conv = build_conv (ck_ref_bind, rto, conv);
1769 /* This reference binding, unlike those above, requires the
1770 creation of a temporary. */
1771 conv->need_temporary_p = true;
1772 conv->rvaluedness_matches_p = TYPE_REF_IS_RVALUE (rto);
1774 /* [dcl.init.ref]
1776 Otherwise, the reference shall be an lvalue reference to a
1777 non-volatile const type, or the reference shall be an rvalue
1778 reference. */
1779 if (!CP_TYPE_CONST_NON_VOLATILE_P (to) && !TYPE_REF_IS_RVALUE (rto))
1780 conv->bad_p = true;
1782 /* [dcl.init.ref]
1784 Otherwise, a temporary of type "cv1 T1" is created and
1785 initialized from the initializer expression using the rules for a
1786 non-reference copy initialization. If T1 is reference-related to
1787 T2, cv1 must be the same cv-qualification as, or greater
1788 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1789 if (related_p && !at_least_as_qualified_p (to, from))
1790 conv->bad_p = true;
1792 return conv;
1795 /* Returns the implicit conversion sequence (see [over.ics]) from type
1796 FROM to type TO. The optional expression EXPR may affect the
1797 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1798 true, this conversion is coming from a C-style cast. */
1800 static conversion *
1801 implicit_conversion (tree to, tree from, tree expr, bool c_cast_p,
1802 int flags, tsubst_flags_t complain)
1804 conversion *conv;
1806 if (from == error_mark_node || to == error_mark_node
1807 || expr == error_mark_node)
1808 return NULL;
1810 /* Other flags only apply to the primary function in overload
1811 resolution, or after we've chosen one. */
1812 flags &= (LOOKUP_ONLYCONVERTING|LOOKUP_NO_CONVERSION|LOOKUP_COPY_PARM
1813 |LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND|LOOKUP_PREFER_RVALUE
1814 |LOOKUP_NO_NARROWING|LOOKUP_PROTECT|LOOKUP_NO_NON_INTEGRAL);
1816 /* FIXME: actually we don't want warnings either, but we can't just
1817 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1818 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1819 We really ought not to issue that warning until we've committed
1820 to that conversion. */
1821 complain &= ~tf_error;
1823 /* Call reshape_init early to remove redundant braces. */
1824 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr)
1825 && CLASS_TYPE_P (to)
1826 && COMPLETE_TYPE_P (complete_type (to))
1827 && !CLASSTYPE_NON_AGGREGATE (to))
1829 expr = reshape_init (to, expr, complain);
1830 if (expr == error_mark_node)
1831 return NULL;
1832 from = TREE_TYPE (expr);
1835 if (TREE_CODE (to) == REFERENCE_TYPE)
1836 conv = reference_binding (to, from, expr, c_cast_p, flags, complain);
1837 else
1838 conv = standard_conversion (to, from, expr, c_cast_p, flags, complain);
1840 if (conv)
1841 return conv;
1843 if (expr && BRACE_ENCLOSED_INITIALIZER_P (expr))
1845 if (is_std_init_list (to))
1846 return build_list_conv (to, expr, flags, complain);
1848 /* As an extension, allow list-initialization of _Complex. */
1849 if (TREE_CODE (to) == COMPLEX_TYPE)
1851 conv = build_complex_conv (to, expr, flags, complain);
1852 if (conv)
1853 return conv;
1856 /* Allow conversion from an initializer-list with one element to a
1857 scalar type. */
1858 if (SCALAR_TYPE_P (to))
1860 int nelts = CONSTRUCTOR_NELTS (expr);
1861 tree elt;
1863 if (nelts == 0)
1864 elt = build_value_init (to, tf_none);
1865 else if (nelts == 1)
1866 elt = CONSTRUCTOR_ELT (expr, 0)->value;
1867 else
1868 elt = error_mark_node;
1870 conv = implicit_conversion (to, TREE_TYPE (elt), elt,
1871 c_cast_p, flags, complain);
1872 if (conv)
1874 conv->check_narrowing = true;
1875 if (BRACE_ENCLOSED_INITIALIZER_P (elt))
1876 /* Too many levels of braces, i.e. '{{1}}'. */
1877 conv->bad_p = true;
1878 return conv;
1881 else if (TREE_CODE (to) == ARRAY_TYPE)
1882 return build_array_conv (to, expr, flags, complain);
1885 if (expr != NULL_TREE
1886 && (MAYBE_CLASS_TYPE_P (from)
1887 || MAYBE_CLASS_TYPE_P (to))
1888 && (flags & LOOKUP_NO_CONVERSION) == 0)
1890 struct z_candidate *cand;
1892 if (CLASS_TYPE_P (to)
1893 && BRACE_ENCLOSED_INITIALIZER_P (expr)
1894 && !CLASSTYPE_NON_AGGREGATE (complete_type (to)))
1895 return build_aggr_conv (to, expr, flags, complain);
1897 cand = build_user_type_conversion_1 (to, expr, flags, complain);
1898 if (cand)
1900 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
1901 && CONSTRUCTOR_NELTS (expr) == 1
1902 && !is_list_ctor (cand->fn))
1904 /* "If C is not an initializer-list constructor and the
1905 initializer list has a single element of type cv U, where U is
1906 X or a class derived from X, the implicit conversion sequence
1907 has Exact Match rank if U is X, or Conversion rank if U is
1908 derived from X." */
1909 tree elt = CONSTRUCTOR_ELT (expr, 0)->value;
1910 tree elttype = TREE_TYPE (elt);
1911 if (reference_related_p (to, elttype))
1912 return implicit_conversion (to, elttype, elt,
1913 c_cast_p, flags, complain);
1915 conv = cand->second_conv;
1918 /* We used to try to bind a reference to a temporary here, but that
1919 is now handled after the recursive call to this function at the end
1920 of reference_binding. */
1921 return conv;
1924 return NULL;
1927 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1928 functions. ARGS will not be changed until a single candidate is
1929 selected. */
1931 static struct z_candidate *
1932 add_candidate (struct z_candidate **candidates,
1933 tree fn, tree first_arg, const vec<tree, va_gc> *args,
1934 size_t num_convs, conversion **convs,
1935 tree access_path, tree conversion_path,
1936 int viable, struct rejection_reason *reason,
1937 int flags)
1939 struct z_candidate *cand = (struct z_candidate *)
1940 conversion_obstack_alloc (sizeof (struct z_candidate));
1942 cand->fn = fn;
1943 cand->first_arg = first_arg;
1944 cand->args = args;
1945 cand->convs = convs;
1946 cand->num_convs = num_convs;
1947 cand->access_path = access_path;
1948 cand->conversion_path = conversion_path;
1949 cand->viable = viable;
1950 cand->reason = reason;
1951 cand->next = *candidates;
1952 cand->flags = flags;
1953 *candidates = cand;
1955 return cand;
1958 /* Return the number of remaining arguments in the parameter list
1959 beginning with ARG. */
1962 remaining_arguments (tree arg)
1964 int n;
1966 for (n = 0; arg != NULL_TREE && arg != void_list_node;
1967 arg = TREE_CHAIN (arg))
1968 n++;
1970 return n;
1973 /* Create an overload candidate for the function or method FN called
1974 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1975 FLAGS is passed on to implicit_conversion.
1977 This does not change ARGS.
1979 CTYPE, if non-NULL, is the type we want to pretend this function
1980 comes from for purposes of overload resolution. */
1982 static struct z_candidate *
1983 add_function_candidate (struct z_candidate **candidates,
1984 tree fn, tree ctype, tree first_arg,
1985 const vec<tree, va_gc> *args, tree access_path,
1986 tree conversion_path, int flags,
1987 tsubst_flags_t complain)
1989 tree parmlist = TYPE_ARG_TYPES (TREE_TYPE (fn));
1990 int i, len;
1991 conversion **convs;
1992 tree parmnode;
1993 tree orig_first_arg = first_arg;
1994 int skip;
1995 int viable = 1;
1996 struct rejection_reason *reason = NULL;
1998 /* At this point we should not see any functions which haven't been
1999 explicitly declared, except for friend functions which will have
2000 been found using argument dependent lookup. */
2001 gcc_assert (!DECL_ANTICIPATED (fn) || DECL_HIDDEN_FRIEND_P (fn));
2003 /* The `this', `in_chrg' and VTT arguments to constructors are not
2004 considered in overload resolution. */
2005 if (DECL_CONSTRUCTOR_P (fn))
2007 if (ctor_omit_inherited_parms (fn))
2008 /* Bring back parameters omitted from an inherited ctor. */
2009 parmlist = FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn));
2010 else
2011 parmlist = skip_artificial_parms_for (fn, parmlist);
2012 skip = num_artificial_parms_for (fn);
2013 if (skip > 0 && first_arg != NULL_TREE)
2015 --skip;
2016 first_arg = NULL_TREE;
2019 else
2020 skip = 0;
2022 len = vec_safe_length (args) - skip + (first_arg != NULL_TREE ? 1 : 0);
2023 convs = alloc_conversions (len);
2025 /* 13.3.2 - Viable functions [over.match.viable]
2026 First, to be a viable function, a candidate function shall have enough
2027 parameters to agree in number with the arguments in the list.
2029 We need to check this first; otherwise, checking the ICSes might cause
2030 us to produce an ill-formed template instantiation. */
2032 parmnode = parmlist;
2033 for (i = 0; i < len; ++i)
2035 if (parmnode == NULL_TREE || parmnode == void_list_node)
2036 break;
2037 parmnode = TREE_CHAIN (parmnode);
2040 if ((i < len && parmnode)
2041 || !sufficient_parms_p (parmnode))
2043 int remaining = remaining_arguments (parmnode);
2044 viable = 0;
2045 reason = arity_rejection (first_arg, i + remaining, len);
2048 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2049 parameter of type "reference to cv C" (including such a constructor
2050 instantiated from a template) is excluded from the set of candidate
2051 functions when used to construct an object of type D with an argument list
2052 containing a single argument if C is reference-related to D. */
2053 if (viable && len == 1 && parmlist && DECL_CONSTRUCTOR_P (fn)
2054 && flag_new_inheriting_ctors
2055 && DECL_INHERITED_CTOR (fn))
2057 tree ptype = non_reference (TREE_VALUE (parmlist));
2058 tree dtype = DECL_CONTEXT (fn);
2059 tree btype = DECL_INHERITED_CTOR_BASE (fn);
2060 if (reference_related_p (ptype, dtype)
2061 && reference_related_p (btype, ptype))
2063 viable = false;
2064 reason = inherited_ctor_rejection ();
2068 /* Second, for a function to be viable, its constraints must be
2069 satisfied. */
2070 if (flag_concepts && viable
2071 && !constraints_satisfied_p (fn))
2073 reason = constraint_failure (fn);
2074 viable = false;
2077 /* When looking for a function from a subobject from an implicit
2078 copy/move constructor/operator=, don't consider anything that takes (a
2079 reference to) an unrelated type. See c++/44909 and core 1092. */
2080 if (viable && parmlist && (flags & LOOKUP_DEFAULTED))
2082 if (DECL_CONSTRUCTOR_P (fn))
2083 i = 1;
2084 else if (DECL_ASSIGNMENT_OPERATOR_P (fn)
2085 && DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR)
2086 i = 2;
2087 else
2088 i = 0;
2089 if (i && len == i)
2091 parmnode = chain_index (i-1, parmlist);
2092 if (!reference_related_p (non_reference (TREE_VALUE (parmnode)),
2093 ctype))
2094 viable = 0;
2097 /* This only applies at the top level. */
2098 flags &= ~LOOKUP_DEFAULTED;
2101 if (! viable)
2102 goto out;
2104 /* Third, for F to be a viable function, there shall exist for each
2105 argument an implicit conversion sequence that converts that argument
2106 to the corresponding parameter of F. */
2108 parmnode = parmlist;
2110 for (i = 0; i < len; ++i)
2112 tree argtype, to_type;
2113 tree arg;
2114 conversion *t;
2115 int is_this;
2117 if (parmnode == void_list_node)
2118 break;
2120 if (i == 0 && first_arg != NULL_TREE)
2121 arg = first_arg;
2122 else
2123 arg = CONST_CAST_TREE (
2124 (*args)[i + skip - (first_arg != NULL_TREE ? 1 : 0)]);
2125 argtype = lvalue_type (arg);
2127 is_this = (i == 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
2128 && ! DECL_CONSTRUCTOR_P (fn));
2130 if (parmnode)
2132 tree parmtype = TREE_VALUE (parmnode);
2133 int lflags = flags;
2135 parmnode = TREE_CHAIN (parmnode);
2137 /* The type of the implicit object parameter ('this') for
2138 overload resolution is not always the same as for the
2139 function itself; conversion functions are considered to
2140 be members of the class being converted, and functions
2141 introduced by a using-declaration are considered to be
2142 members of the class that uses them.
2144 Since build_over_call ignores the ICS for the `this'
2145 parameter, we can just change the parm type. */
2146 if (ctype && is_this)
2148 parmtype = cp_build_qualified_type
2149 (ctype, cp_type_quals (TREE_TYPE (parmtype)));
2150 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn)))
2152 /* If the function has a ref-qualifier, the implicit
2153 object parameter has reference type. */
2154 bool rv = FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn));
2155 parmtype = cp_build_reference_type (parmtype, rv);
2156 /* The special handling of 'this' conversions in compare_ics
2157 does not apply if there is a ref-qualifier. */
2158 is_this = false;
2160 else
2162 parmtype = build_pointer_type (parmtype);
2163 arg = build_this (arg);
2164 argtype = lvalue_type (arg);
2168 /* Core issue 899: When [copy-]initializing a temporary to be bound
2169 to the first parameter of a copy constructor (12.8) called with
2170 a single argument in the context of direct-initialization,
2171 explicit conversion functions are also considered.
2173 So set LOOKUP_COPY_PARM to let reference_binding know that
2174 it's being called in that context. We generalize the above
2175 to handle move constructors and template constructors as well;
2176 the standardese should soon be updated similarly. */
2177 if (ctype && i == 0 && (len-skip == 1)
2178 && DECL_CONSTRUCTOR_P (fn)
2179 && parmtype != error_mark_node
2180 && (same_type_ignoring_top_level_qualifiers_p
2181 (non_reference (parmtype), ctype)))
2183 if (!(flags & LOOKUP_ONLYCONVERTING))
2184 lflags |= LOOKUP_COPY_PARM;
2185 /* We allow user-defined conversions within init-lists, but
2186 don't list-initialize the copy parm, as that would mean
2187 using two levels of braces for the same type. */
2188 if ((flags & LOOKUP_LIST_INIT_CTOR)
2189 && BRACE_ENCLOSED_INITIALIZER_P (arg))
2190 lflags |= LOOKUP_NO_CONVERSION;
2192 else
2193 lflags |= LOOKUP_ONLYCONVERTING;
2195 t = implicit_conversion (parmtype, argtype, arg,
2196 /*c_cast_p=*/false, lflags, complain);
2197 to_type = parmtype;
2199 else
2201 t = build_identity_conv (argtype, arg);
2202 t->ellipsis_p = true;
2203 to_type = argtype;
2206 if (t && is_this)
2207 t->this_p = true;
2209 convs[i] = t;
2210 if (! t)
2212 viable = 0;
2213 reason = arg_conversion_rejection (first_arg, i, argtype, to_type);
2214 break;
2217 if (t->bad_p)
2219 viable = -1;
2220 reason = bad_arg_conversion_rejection (first_arg, i, arg, to_type);
2224 out:
2225 return add_candidate (candidates, fn, orig_first_arg, args, len, convs,
2226 access_path, conversion_path, viable, reason, flags);
2229 /* Create an overload candidate for the conversion function FN which will
2230 be invoked for expression OBJ, producing a pointer-to-function which
2231 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2232 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2233 passed on to implicit_conversion.
2235 Actually, we don't really care about FN; we care about the type it
2236 converts to. There may be multiple conversion functions that will
2237 convert to that type, and we rely on build_user_type_conversion_1 to
2238 choose the best one; so when we create our candidate, we record the type
2239 instead of the function. */
2241 static struct z_candidate *
2242 add_conv_candidate (struct z_candidate **candidates, tree fn, tree obj,
2243 const vec<tree, va_gc> *arglist,
2244 tree access_path, tree conversion_path,
2245 tsubst_flags_t complain)
2247 tree totype = TREE_TYPE (TREE_TYPE (fn));
2248 int i, len, viable, flags;
2249 tree parmlist, parmnode;
2250 conversion **convs;
2251 struct rejection_reason *reason;
2253 for (parmlist = totype; TREE_CODE (parmlist) != FUNCTION_TYPE; )
2254 parmlist = TREE_TYPE (parmlist);
2255 parmlist = TYPE_ARG_TYPES (parmlist);
2257 len = vec_safe_length (arglist) + 1;
2258 convs = alloc_conversions (len);
2259 parmnode = parmlist;
2260 viable = 1;
2261 flags = LOOKUP_IMPLICIT;
2262 reason = NULL;
2264 /* Don't bother looking up the same type twice. */
2265 if (*candidates && (*candidates)->fn == totype)
2266 return NULL;
2268 for (i = 0; i < len; ++i)
2270 tree arg, argtype, convert_type = NULL_TREE;
2271 conversion *t;
2273 if (i == 0)
2274 arg = obj;
2275 else
2276 arg = (*arglist)[i - 1];
2277 argtype = lvalue_type (arg);
2279 if (i == 0)
2281 t = implicit_conversion (totype, argtype, arg, /*c_cast_p=*/false,
2282 flags, complain);
2283 convert_type = totype;
2285 else if (parmnode == void_list_node)
2286 break;
2287 else if (parmnode)
2289 t = implicit_conversion (TREE_VALUE (parmnode), argtype, arg,
2290 /*c_cast_p=*/false, flags, complain);
2291 convert_type = TREE_VALUE (parmnode);
2293 else
2295 t = build_identity_conv (argtype, arg);
2296 t->ellipsis_p = true;
2297 convert_type = argtype;
2300 convs[i] = t;
2301 if (! t)
2302 break;
2304 if (t->bad_p)
2306 viable = -1;
2307 reason = bad_arg_conversion_rejection (NULL_TREE, i, arg, convert_type);
2310 if (i == 0)
2311 continue;
2313 if (parmnode)
2314 parmnode = TREE_CHAIN (parmnode);
2317 if (i < len
2318 || ! sufficient_parms_p (parmnode))
2320 int remaining = remaining_arguments (parmnode);
2321 viable = 0;
2322 reason = arity_rejection (NULL_TREE, i + remaining, len);
2325 return add_candidate (candidates, totype, obj, arglist, len, convs,
2326 access_path, conversion_path, viable, reason, flags);
2329 static void
2330 build_builtin_candidate (struct z_candidate **candidates, tree fnname,
2331 tree type1, tree type2, tree *args, tree *argtypes,
2332 int flags, tsubst_flags_t complain)
2334 conversion *t;
2335 conversion **convs;
2336 size_t num_convs;
2337 int viable = 1, i;
2338 tree types[2];
2339 struct rejection_reason *reason = NULL;
2341 types[0] = type1;
2342 types[1] = type2;
2344 num_convs = args[2] ? 3 : (args[1] ? 2 : 1);
2345 convs = alloc_conversions (num_convs);
2347 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2348 conversion ops are allowed. We handle that here by just checking for
2349 boolean_type_node because other operators don't ask for it. COND_EXPR
2350 also does contextual conversion to bool for the first operand, but we
2351 handle that in build_conditional_expr, and type1 here is operand 2. */
2352 if (type1 != boolean_type_node)
2353 flags |= LOOKUP_ONLYCONVERTING;
2355 for (i = 0; i < 2; ++i)
2357 if (! args[i])
2358 break;
2360 t = implicit_conversion (types[i], argtypes[i], args[i],
2361 /*c_cast_p=*/false, flags, complain);
2362 if (! t)
2364 viable = 0;
2365 /* We need something for printing the candidate. */
2366 t = build_identity_conv (types[i], NULL_TREE);
2367 reason = arg_conversion_rejection (NULL_TREE, i, argtypes[i],
2368 types[i]);
2370 else if (t->bad_p)
2372 viable = 0;
2373 reason = bad_arg_conversion_rejection (NULL_TREE, i, args[i],
2374 types[i]);
2376 convs[i] = t;
2379 /* For COND_EXPR we rearranged the arguments; undo that now. */
2380 if (args[2])
2382 convs[2] = convs[1];
2383 convs[1] = convs[0];
2384 t = implicit_conversion (boolean_type_node, argtypes[2], args[2],
2385 /*c_cast_p=*/false, flags,
2386 complain);
2387 if (t)
2388 convs[0] = t;
2389 else
2391 viable = 0;
2392 reason = arg_conversion_rejection (NULL_TREE, 0, argtypes[2],
2393 boolean_type_node);
2397 add_candidate (candidates, fnname, /*first_arg=*/NULL_TREE, /*args=*/NULL,
2398 num_convs, convs,
2399 /*access_path=*/NULL_TREE,
2400 /*conversion_path=*/NULL_TREE,
2401 viable, reason, flags);
2404 static bool
2405 is_complete (tree t)
2407 return COMPLETE_TYPE_P (complete_type (t));
2410 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2412 static bool
2413 promoted_arithmetic_type_p (tree type)
2415 /* [over.built]
2417 In this section, the term promoted integral type is used to refer
2418 to those integral types which are preserved by integral promotion
2419 (including e.g. int and long but excluding e.g. char).
2420 Similarly, the term promoted arithmetic type refers to promoted
2421 integral types plus floating types. */
2422 return ((CP_INTEGRAL_TYPE_P (type)
2423 && same_type_p (type_promotes_to (type), type))
2424 || TREE_CODE (type) == REAL_TYPE);
2427 /* Create any builtin operator overload candidates for the operator in
2428 question given the converted operand types TYPE1 and TYPE2. The other
2429 args are passed through from add_builtin_candidates to
2430 build_builtin_candidate.
2432 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2433 If CODE is requires candidates operands of the same type of the kind
2434 of which TYPE1 and TYPE2 are, we add both candidates
2435 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2437 static void
2438 add_builtin_candidate (struct z_candidate **candidates, enum tree_code code,
2439 enum tree_code code2, tree fnname, tree type1,
2440 tree type2, tree *args, tree *argtypes, int flags,
2441 tsubst_flags_t complain)
2443 switch (code)
2445 case POSTINCREMENT_EXPR:
2446 case POSTDECREMENT_EXPR:
2447 args[1] = integer_zero_node;
2448 type2 = integer_type_node;
2449 break;
2450 default:
2451 break;
2454 switch (code)
2457 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2458 and VQ is either volatile or empty, there exist candidate operator
2459 functions of the form
2460 VQ T& operator++(VQ T&);
2461 T operator++(VQ T&, int);
2462 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2463 type other than bool, and VQ is either volatile or empty, there exist
2464 candidate operator functions of the form
2465 VQ T& operator--(VQ T&);
2466 T operator--(VQ T&, int);
2467 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2468 complete object type, and VQ is either volatile or empty, there exist
2469 candidate operator functions of the form
2470 T*VQ& operator++(T*VQ&);
2471 T*VQ& operator--(T*VQ&);
2472 T* operator++(T*VQ&, int);
2473 T* operator--(T*VQ&, int); */
2475 case POSTDECREMENT_EXPR:
2476 case PREDECREMENT_EXPR:
2477 if (TREE_CODE (type1) == BOOLEAN_TYPE)
2478 return;
2479 /* FALLTHRU */
2480 case POSTINCREMENT_EXPR:
2481 case PREINCREMENT_EXPR:
2482 if (ARITHMETIC_TYPE_P (type1) || TYPE_PTROB_P (type1))
2484 type1 = build_reference_type (type1);
2485 break;
2487 return;
2489 /* 7 For every cv-qualified or cv-unqualified object type T, there
2490 exist candidate operator functions of the form
2492 T& operator*(T*);
2494 8 For every function type T, there exist candidate operator functions of
2495 the form
2496 T& operator*(T*); */
2498 case INDIRECT_REF:
2499 if (TYPE_PTR_P (type1)
2500 && (TYPE_PTROB_P (type1)
2501 || TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE))
2502 break;
2503 return;
2505 /* 9 For every type T, there exist candidate operator functions of the form
2506 T* operator+(T*);
2508 10For every promoted arithmetic type T, there exist candidate operator
2509 functions of the form
2510 T operator+(T);
2511 T operator-(T); */
2513 case UNARY_PLUS_EXPR: /* unary + */
2514 if (TYPE_PTR_P (type1))
2515 break;
2516 /* FALLTHRU */
2517 case NEGATE_EXPR:
2518 if (ARITHMETIC_TYPE_P (type1))
2519 break;
2520 return;
2522 /* 11For every promoted integral type T, there exist candidate operator
2523 functions of the form
2524 T operator~(T); */
2526 case BIT_NOT_EXPR:
2527 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1))
2528 break;
2529 return;
2531 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2532 is the same type as C2 or is a derived class of C2, T is a complete
2533 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2534 there exist candidate operator functions of the form
2535 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2536 where CV12 is the union of CV1 and CV2. */
2538 case MEMBER_REF:
2539 if (TYPE_PTR_P (type1) && TYPE_PTRMEM_P (type2))
2541 tree c1 = TREE_TYPE (type1);
2542 tree c2 = TYPE_PTRMEM_CLASS_TYPE (type2);
2544 if (MAYBE_CLASS_TYPE_P (c1) && DERIVED_FROM_P (c2, c1)
2545 && (TYPE_PTRMEMFUNC_P (type2)
2546 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2))))
2547 break;
2549 return;
2551 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2552 didate operator functions of the form
2553 LR operator*(L, R);
2554 LR operator/(L, R);
2555 LR operator+(L, R);
2556 LR operator-(L, R);
2557 bool 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 where LR is the result of the usual arithmetic conversions between
2564 types L and R.
2566 14For every pair of types T and I, where T is a cv-qualified or cv-
2567 unqualified complete object type and I is a promoted integral type,
2568 there exist candidate operator functions of the form
2569 T* operator+(T*, I);
2570 T& operator[](T*, I);
2571 T* operator-(T*, I);
2572 T* operator+(I, T*);
2573 T& operator[](I, T*);
2575 15For every T, where T is a pointer to complete object type, there exist
2576 candidate operator functions of the form112)
2577 ptrdiff_t operator-(T, T);
2579 16For every pointer or enumeration type T, there exist candidate operator
2580 functions of the form
2581 bool operator<(T, T);
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);
2588 17For every pointer to member type T, there exist candidate operator
2589 functions of the form
2590 bool operator==(T, T);
2591 bool operator!=(T, T); */
2593 case MINUS_EXPR:
2594 if (TYPE_PTROB_P (type1) && TYPE_PTROB_P (type2))
2595 break;
2596 if (TYPE_PTROB_P (type1)
2597 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2599 type2 = ptrdiff_type_node;
2600 break;
2602 /* FALLTHRU */
2603 case MULT_EXPR:
2604 case TRUNC_DIV_EXPR:
2605 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2606 break;
2607 return;
2609 case EQ_EXPR:
2610 case NE_EXPR:
2611 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2612 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2)))
2613 break;
2614 if (TYPE_PTRMEM_P (type1) && null_ptr_cst_p (args[1]))
2616 type2 = type1;
2617 break;
2619 if (TYPE_PTRMEM_P (type2) && null_ptr_cst_p (args[0]))
2621 type1 = type2;
2622 break;
2624 /* Fall through. */
2625 case LT_EXPR:
2626 case GT_EXPR:
2627 case LE_EXPR:
2628 case GE_EXPR:
2629 case MAX_EXPR:
2630 case MIN_EXPR:
2631 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2632 break;
2633 if (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2634 break;
2635 if (TREE_CODE (type1) == ENUMERAL_TYPE
2636 && TREE_CODE (type2) == ENUMERAL_TYPE)
2637 break;
2638 if (TYPE_PTR_P (type1)
2639 && null_ptr_cst_p (args[1]))
2641 type2 = type1;
2642 break;
2644 if (null_ptr_cst_p (args[0])
2645 && TYPE_PTR_P (type2))
2647 type1 = type2;
2648 break;
2650 return;
2652 case PLUS_EXPR:
2653 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2654 break;
2655 /* FALLTHRU */
2656 case ARRAY_REF:
2657 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && TYPE_PTROB_P (type2))
2659 type1 = ptrdiff_type_node;
2660 break;
2662 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2664 type2 = ptrdiff_type_node;
2665 break;
2667 return;
2669 /* 18For every pair of promoted integral types L and R, there exist candi-
2670 date operator functions of the form
2671 LR operator%(L, R);
2672 LR operator&(L, R);
2673 LR operator^(L, R);
2674 LR operator|(L, R);
2675 L operator<<(L, R);
2676 L operator>>(L, R);
2677 where LR is the result of the usual arithmetic conversions between
2678 types L and R. */
2680 case TRUNC_MOD_EXPR:
2681 case BIT_AND_EXPR:
2682 case BIT_IOR_EXPR:
2683 case BIT_XOR_EXPR:
2684 case LSHIFT_EXPR:
2685 case RSHIFT_EXPR:
2686 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2687 break;
2688 return;
2690 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2691 type, VQ is either volatile or empty, and R is a promoted arithmetic
2692 type, there exist candidate operator functions of the form
2693 VQ L& operator=(VQ L&, R);
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);
2699 20For every pair T, VQ), where T is any type and VQ is either volatile
2700 or empty, there exist candidate operator functions of the form
2701 T*VQ& operator=(T*VQ&, T*);
2703 21For every pair T, VQ), where T is a pointer to member type and VQ is
2704 either volatile or empty, there exist candidate operator functions of
2705 the form
2706 VQ T& operator=(VQ T&, T);
2708 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2709 unqualified complete object type, VQ is either volatile or empty, and
2710 I is a promoted integral type, there exist candidate operator func-
2711 tions of the form
2712 T*VQ& operator+=(T*VQ&, I);
2713 T*VQ& operator-=(T*VQ&, I);
2715 23For every triple L, VQ, R), where L is an integral or enumeration
2716 type, VQ is either volatile or empty, and R is a promoted integral
2717 type, there exist candidate operator functions of the form
2719 VQ L& operator%=(VQ L&, R);
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); */
2726 case MODIFY_EXPR:
2727 switch (code2)
2729 case PLUS_EXPR:
2730 case MINUS_EXPR:
2731 if (TYPE_PTROB_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2733 type2 = ptrdiff_type_node;
2734 break;
2736 /* FALLTHRU */
2737 case MULT_EXPR:
2738 case TRUNC_DIV_EXPR:
2739 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2740 break;
2741 return;
2743 case TRUNC_MOD_EXPR:
2744 case BIT_AND_EXPR:
2745 case BIT_IOR_EXPR:
2746 case BIT_XOR_EXPR:
2747 case LSHIFT_EXPR:
2748 case RSHIFT_EXPR:
2749 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2750 break;
2751 return;
2753 case NOP_EXPR:
2754 if (ARITHMETIC_TYPE_P (type1) && ARITHMETIC_TYPE_P (type2))
2755 break;
2756 if ((TYPE_PTRMEMFUNC_P (type1) && TYPE_PTRMEMFUNC_P (type2))
2757 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2758 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
2759 || ((TYPE_PTRMEMFUNC_P (type1)
2760 || TYPE_PTR_P (type1))
2761 && null_ptr_cst_p (args[1])))
2763 type2 = type1;
2764 break;
2766 return;
2768 default:
2769 gcc_unreachable ();
2771 type1 = build_reference_type (type1);
2772 break;
2774 case COND_EXPR:
2775 /* [over.built]
2777 For every pair of promoted arithmetic types L and R, there
2778 exist candidate operator functions of the form
2780 LR operator?(bool, L, R);
2782 where LR is the result of the usual arithmetic conversions
2783 between types L and R.
2785 For every type T, where T is a pointer or pointer-to-member
2786 type, there exist candidate operator functions of the form T
2787 operator?(bool, T, T); */
2789 if (promoted_arithmetic_type_p (type1)
2790 && promoted_arithmetic_type_p (type2))
2791 /* That's OK. */
2792 break;
2794 /* Otherwise, the types should be pointers. */
2795 if (!TYPE_PTR_OR_PTRMEM_P (type1) || !TYPE_PTR_OR_PTRMEM_P (type2))
2796 return;
2798 /* We don't check that the two types are the same; the logic
2799 below will actually create two candidates; one in which both
2800 parameter types are TYPE1, and one in which both parameter
2801 types are TYPE2. */
2802 break;
2804 case REALPART_EXPR:
2805 case IMAGPART_EXPR:
2806 if (ARITHMETIC_TYPE_P (type1))
2807 break;
2808 return;
2810 default:
2811 gcc_unreachable ();
2814 /* Make sure we don't create builtin candidates with dependent types. */
2815 bool u1 = uses_template_parms (type1);
2816 bool u2 = type2 ? uses_template_parms (type2) : false;
2817 if (u1 || u2)
2819 /* Try to recover if one of the types is non-dependent. But if
2820 there's only one type, there's nothing we can do. */
2821 if (!type2)
2822 return;
2823 /* And we lose if both are dependent. */
2824 if (u1 && u2)
2825 return;
2826 /* Or if they have different forms. */
2827 if (TREE_CODE (type1) != TREE_CODE (type2))
2828 return;
2830 if (u1 && !u2)
2831 type1 = type2;
2832 else if (u2 && !u1)
2833 type2 = type1;
2836 /* If we're dealing with two pointer types or two enumeral types,
2837 we need candidates for both of them. */
2838 if (type2 && !same_type_p (type1, type2)
2839 && TREE_CODE (type1) == TREE_CODE (type2)
2840 && (TREE_CODE (type1) == REFERENCE_TYPE
2841 || (TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
2842 || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
2843 || TYPE_PTRMEMFUNC_P (type1)
2844 || MAYBE_CLASS_TYPE_P (type1)
2845 || TREE_CODE (type1) == ENUMERAL_TYPE))
2847 if (TYPE_PTR_OR_PTRMEM_P (type1))
2849 tree cptype = composite_pointer_type (type1, type2,
2850 error_mark_node,
2851 error_mark_node,
2852 CPO_CONVERSION,
2853 tf_none);
2854 if (cptype != error_mark_node)
2856 build_builtin_candidate
2857 (candidates, fnname, cptype, cptype, args, argtypes,
2858 flags, complain);
2859 return;
2863 build_builtin_candidate
2864 (candidates, fnname, type1, type1, args, argtypes, flags, complain);
2865 build_builtin_candidate
2866 (candidates, fnname, type2, type2, args, argtypes, flags, complain);
2867 return;
2870 build_builtin_candidate
2871 (candidates, fnname, type1, type2, args, argtypes, flags, complain);
2874 tree
2875 type_decays_to (tree type)
2877 if (TREE_CODE (type) == ARRAY_TYPE)
2878 return build_pointer_type (TREE_TYPE (type));
2879 if (TREE_CODE (type) == FUNCTION_TYPE)
2880 return build_pointer_type (type);
2881 return type;
2884 /* There are three conditions of builtin candidates:
2886 1) bool-taking candidates. These are the same regardless of the input.
2887 2) pointer-pair taking candidates. These are generated for each type
2888 one of the input types converts to.
2889 3) arithmetic candidates. According to the standard, we should generate
2890 all of these, but I'm trying not to...
2892 Here we generate a superset of the possible candidates for this particular
2893 case. That is a subset of the full set the standard defines, plus some
2894 other cases which the standard disallows. add_builtin_candidate will
2895 filter out the invalid set. */
2897 static void
2898 add_builtin_candidates (struct z_candidate **candidates, enum tree_code code,
2899 enum tree_code code2, tree fnname, tree *args,
2900 int flags, tsubst_flags_t complain)
2902 int ref1, i;
2903 int enum_p = 0;
2904 tree type, argtypes[3], t;
2905 /* TYPES[i] is the set of possible builtin-operator parameter types
2906 we will consider for the Ith argument. */
2907 vec<tree, va_gc> *types[2];
2908 unsigned ix;
2910 for (i = 0; i < 3; ++i)
2912 if (args[i])
2913 argtypes[i] = unlowered_expr_type (args[i]);
2914 else
2915 argtypes[i] = NULL_TREE;
2918 switch (code)
2920 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2921 and VQ is either volatile or empty, there exist candidate operator
2922 functions of the form
2923 VQ T& operator++(VQ T&); */
2925 case POSTINCREMENT_EXPR:
2926 case PREINCREMENT_EXPR:
2927 case POSTDECREMENT_EXPR:
2928 case PREDECREMENT_EXPR:
2929 case MODIFY_EXPR:
2930 ref1 = 1;
2931 break;
2933 /* 24There also exist candidate operator functions of the form
2934 bool operator!(bool);
2935 bool operator&&(bool, bool);
2936 bool operator||(bool, bool); */
2938 case TRUTH_NOT_EXPR:
2939 build_builtin_candidate
2940 (candidates, fnname, boolean_type_node,
2941 NULL_TREE, args, argtypes, flags, complain);
2942 return;
2944 case TRUTH_ORIF_EXPR:
2945 case TRUTH_ANDIF_EXPR:
2946 build_builtin_candidate
2947 (candidates, fnname, boolean_type_node,
2948 boolean_type_node, args, argtypes, flags, complain);
2949 return;
2951 case ADDR_EXPR:
2952 case COMPOUND_EXPR:
2953 case COMPONENT_REF:
2954 return;
2956 case COND_EXPR:
2957 case EQ_EXPR:
2958 case NE_EXPR:
2959 case LT_EXPR:
2960 case LE_EXPR:
2961 case GT_EXPR:
2962 case GE_EXPR:
2963 enum_p = 1;
2964 /* Fall through. */
2966 default:
2967 ref1 = 0;
2970 types[0] = make_tree_vector ();
2971 types[1] = make_tree_vector ();
2973 for (i = 0; i < 2; ++i)
2975 if (! args[i])
2977 else if (MAYBE_CLASS_TYPE_P (argtypes[i]))
2979 tree convs;
2981 if (i == 0 && code == MODIFY_EXPR && code2 == NOP_EXPR)
2982 return;
2984 convs = lookup_conversions (argtypes[i]);
2986 if (code == COND_EXPR)
2988 if (lvalue_p (args[i]))
2989 vec_safe_push (types[i], build_reference_type (argtypes[i]));
2991 vec_safe_push (types[i], TYPE_MAIN_VARIANT (argtypes[i]));
2994 else if (! convs)
2995 return;
2997 for (; convs; convs = TREE_CHAIN (convs))
2999 type = TREE_TYPE (convs);
3001 if (i == 0 && ref1
3002 && (TREE_CODE (type) != REFERENCE_TYPE
3003 || CP_TYPE_CONST_P (TREE_TYPE (type))))
3004 continue;
3006 if (code == COND_EXPR && TREE_CODE (type) == REFERENCE_TYPE)
3007 vec_safe_push (types[i], type);
3009 type = non_reference (type);
3010 if (i != 0 || ! ref1)
3012 type = cv_unqualified (type_decays_to (type));
3013 if (enum_p && TREE_CODE (type) == ENUMERAL_TYPE)
3014 vec_safe_push (types[i], type);
3015 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
3016 type = type_promotes_to (type);
3019 if (! vec_member (type, types[i]))
3020 vec_safe_push (types[i], type);
3023 else
3025 if (code == COND_EXPR && lvalue_p (args[i]))
3026 vec_safe_push (types[i], build_reference_type (argtypes[i]));
3027 type = non_reference (argtypes[i]);
3028 if (i != 0 || ! ref1)
3030 type = cv_unqualified (type_decays_to (type));
3031 if (enum_p && UNSCOPED_ENUM_P (type))
3032 vec_safe_push (types[i], type);
3033 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type))
3034 type = type_promotes_to (type);
3036 vec_safe_push (types[i], type);
3040 /* Run through the possible parameter types of both arguments,
3041 creating candidates with those parameter types. */
3042 FOR_EACH_VEC_ELT_REVERSE (*(types[0]), ix, t)
3044 unsigned jx;
3045 tree u;
3047 if (!types[1]->is_empty ())
3048 FOR_EACH_VEC_ELT_REVERSE (*(types[1]), jx, u)
3049 add_builtin_candidate
3050 (candidates, code, code2, fnname, t,
3051 u, args, argtypes, flags, complain);
3052 else
3053 add_builtin_candidate
3054 (candidates, code, code2, fnname, t,
3055 NULL_TREE, args, argtypes, flags, complain);
3058 release_tree_vector (types[0]);
3059 release_tree_vector (types[1]);
3063 /* If TMPL can be successfully instantiated as indicated by
3064 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3066 TMPL is the template. EXPLICIT_TARGS are any explicit template
3067 arguments. ARGLIST is the arguments provided at the call-site.
3068 This does not change ARGLIST. The RETURN_TYPE is the desired type
3069 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3070 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3071 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3073 static struct z_candidate*
3074 add_template_candidate_real (struct z_candidate **candidates, tree tmpl,
3075 tree ctype, tree explicit_targs, tree first_arg,
3076 const vec<tree, va_gc> *arglist, tree return_type,
3077 tree access_path, tree conversion_path,
3078 int flags, tree obj, unification_kind_t strict,
3079 tsubst_flags_t complain)
3081 int ntparms = DECL_NTPARMS (tmpl);
3082 tree targs = make_tree_vec (ntparms);
3083 unsigned int len = vec_safe_length (arglist);
3084 unsigned int nargs = (first_arg == NULL_TREE ? 0 : 1) + len;
3085 unsigned int skip_without_in_chrg = 0;
3086 tree first_arg_without_in_chrg = first_arg;
3087 tree *args_without_in_chrg;
3088 unsigned int nargs_without_in_chrg;
3089 unsigned int ia, ix;
3090 tree arg;
3091 struct z_candidate *cand;
3092 tree fn;
3093 struct rejection_reason *reason = NULL;
3094 int errs;
3096 /* We don't do deduction on the in-charge parameter, the VTT
3097 parameter or 'this'. */
3098 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl))
3100 if (first_arg_without_in_chrg != NULL_TREE)
3101 first_arg_without_in_chrg = NULL_TREE;
3102 else if (return_type && strict == DEDUCE_CALL)
3103 /* We're deducing for a call to the result of a template conversion
3104 function, so the args don't contain 'this'; leave them alone. */;
3105 else
3106 ++skip_without_in_chrg;
3109 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl)
3110 || DECL_BASE_CONSTRUCTOR_P (tmpl))
3111 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl)))
3113 if (first_arg_without_in_chrg != NULL_TREE)
3114 first_arg_without_in_chrg = NULL_TREE;
3115 else
3116 ++skip_without_in_chrg;
3119 if (len < skip_without_in_chrg)
3120 return NULL;
3122 if (DECL_CONSTRUCTOR_P (tmpl) && nargs == 2
3123 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg),
3124 TREE_TYPE ((*arglist)[0])))
3126 /* 12.8/6 says, "A declaration of a constructor for a class X is
3127 ill-formed if its first parameter is of type (optionally cv-qualified)
3128 X and either there are no other parameters or else all other
3129 parameters have default arguments. A member function template is never
3130 instantiated to produce such a constructor signature."
3132 So if we're trying to copy an object of the containing class, don't
3133 consider a template constructor that has a first parameter type that
3134 is just a template parameter, as we would deduce a signature that we
3135 would then reject in the code below. */
3136 if (tree firstparm = FUNCTION_FIRST_USER_PARMTYPE (tmpl))
3138 firstparm = TREE_VALUE (firstparm);
3139 if (PACK_EXPANSION_P (firstparm))
3140 firstparm = PACK_EXPANSION_PATTERN (firstparm);
3141 if (TREE_CODE (firstparm) == TEMPLATE_TYPE_PARM)
3143 gcc_assert (!explicit_targs);
3144 reason = invalid_copy_with_fn_template_rejection ();
3145 goto fail;
3150 nargs_without_in_chrg = ((first_arg_without_in_chrg != NULL_TREE ? 1 : 0)
3151 + (len - skip_without_in_chrg));
3152 args_without_in_chrg = XALLOCAVEC (tree, nargs_without_in_chrg);
3153 ia = 0;
3154 if (first_arg_without_in_chrg != NULL_TREE)
3156 args_without_in_chrg[ia] = first_arg_without_in_chrg;
3157 ++ia;
3159 for (ix = skip_without_in_chrg;
3160 vec_safe_iterate (arglist, ix, &arg);
3161 ++ix)
3163 args_without_in_chrg[ia] = arg;
3164 ++ia;
3166 gcc_assert (ia == nargs_without_in_chrg);
3168 errs = errorcount+sorrycount;
3169 fn = fn_type_unification (tmpl, explicit_targs, targs,
3170 args_without_in_chrg,
3171 nargs_without_in_chrg,
3172 return_type, strict, flags, false,
3173 complain & tf_decltype);
3175 if (fn == error_mark_node)
3177 /* Don't repeat unification later if it already resulted in errors. */
3178 if (errorcount+sorrycount == errs)
3179 reason = template_unification_rejection (tmpl, explicit_targs,
3180 targs, args_without_in_chrg,
3181 nargs_without_in_chrg,
3182 return_type, strict, flags);
3183 else
3184 reason = template_unification_error_rejection ();
3185 goto fail;
3188 if (DECL_CONSTRUCTOR_P (fn) && nargs == 2)
3190 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (fn);
3191 if (arg_types && same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types)),
3192 ctype))
3194 /* We're trying to produce a constructor with a prohibited signature,
3195 as discussed above; handle here any cases we didn't catch then,
3196 such as X(X<T>). */
3197 reason = invalid_copy_with_fn_template_rejection ();
3198 goto fail;
3202 if (obj != NULL_TREE)
3203 /* Aha, this is a conversion function. */
3204 cand = add_conv_candidate (candidates, fn, obj, arglist,
3205 access_path, conversion_path, complain);
3206 else
3207 cand = add_function_candidate (candidates, fn, ctype,
3208 first_arg, arglist, access_path,
3209 conversion_path, flags, complain);
3210 if (DECL_TI_TEMPLATE (fn) != tmpl)
3211 /* This situation can occur if a member template of a template
3212 class is specialized. Then, instantiate_template might return
3213 an instantiation of the specialization, in which case the
3214 DECL_TI_TEMPLATE field will point at the original
3215 specialization. For example:
3217 template <class T> struct S { template <class U> void f(U);
3218 template <> void f(int) {}; };
3219 S<double> sd;
3220 sd.f(3);
3222 Here, TMPL will be template <class U> S<double>::f(U).
3223 And, instantiate template will give us the specialization
3224 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3225 for this will point at template <class T> template <> S<T>::f(int),
3226 so that we can find the definition. For the purposes of
3227 overload resolution, however, we want the original TMPL. */
3228 cand->template_decl = build_template_info (tmpl, targs);
3229 else
3230 cand->template_decl = DECL_TEMPLATE_INFO (fn);
3231 cand->explicit_targs = explicit_targs;
3233 return cand;
3234 fail:
3235 return add_candidate (candidates, tmpl, first_arg, arglist, nargs, NULL,
3236 access_path, conversion_path, 0, reason, flags);
3240 static struct z_candidate *
3241 add_template_candidate (struct z_candidate **candidates, tree tmpl, tree ctype,
3242 tree explicit_targs, tree first_arg,
3243 const vec<tree, va_gc> *arglist, tree return_type,
3244 tree access_path, tree conversion_path, int flags,
3245 unification_kind_t strict, tsubst_flags_t complain)
3247 return
3248 add_template_candidate_real (candidates, tmpl, ctype,
3249 explicit_targs, first_arg, arglist,
3250 return_type, access_path, conversion_path,
3251 flags, NULL_TREE, strict, complain);
3254 /* Create an overload candidate for the conversion function template TMPL,
3255 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3256 pointer-to-function which will in turn be called with the argument list
3257 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3258 passed on to implicit_conversion. */
3260 static struct z_candidate *
3261 add_template_conv_candidate (struct z_candidate **candidates, tree tmpl,
3262 tree obj,
3263 const vec<tree, va_gc> *arglist,
3264 tree return_type, tree access_path,
3265 tree conversion_path, tsubst_flags_t complain)
3267 /* Making this work broke PR 71117, so until the committee resolves core
3268 issue 2189, let's disable this candidate if there are any viable call
3269 operators. */
3270 if (any_strictly_viable (*candidates))
3271 return NULL;
3273 return
3274 add_template_candidate_real (candidates, tmpl, NULL_TREE, NULL_TREE,
3275 NULL_TREE, arglist, return_type, access_path,
3276 conversion_path, 0, obj, DEDUCE_CALL,
3277 complain);
3280 /* The CANDS are the set of candidates that were considered for
3281 overload resolution. Return the set of viable candidates, or CANDS
3282 if none are viable. If any of the candidates were viable, set
3283 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3284 considered viable only if it is strictly viable. */
3286 static struct z_candidate*
3287 splice_viable (struct z_candidate *cands,
3288 bool strict_p,
3289 bool *any_viable_p)
3291 struct z_candidate *viable;
3292 struct z_candidate **last_viable;
3293 struct z_candidate **cand;
3294 bool found_strictly_viable = false;
3296 /* Be strict inside templates, since build_over_call won't actually
3297 do the conversions to get pedwarns. */
3298 if (processing_template_decl)
3299 strict_p = true;
3301 viable = NULL;
3302 last_viable = &viable;
3303 *any_viable_p = false;
3305 cand = &cands;
3306 while (*cand)
3308 struct z_candidate *c = *cand;
3309 if (!strict_p
3310 && (c->viable == 1 || TREE_CODE (c->fn) == TEMPLATE_DECL))
3312 /* Be strict in the presence of a viable candidate. Also if
3313 there are template candidates, so that we get deduction errors
3314 for them instead of silently preferring a bad conversion. */
3315 strict_p = true;
3316 if (viable && !found_strictly_viable)
3318 /* Put any spliced near matches back onto the main list so
3319 that we see them if there is no strict match. */
3320 *any_viable_p = false;
3321 *last_viable = cands;
3322 cands = viable;
3323 viable = NULL;
3324 last_viable = &viable;
3328 if (strict_p ? c->viable == 1 : c->viable)
3330 *last_viable = c;
3331 *cand = c->next;
3332 c->next = NULL;
3333 last_viable = &c->next;
3334 *any_viable_p = true;
3335 if (c->viable == 1)
3336 found_strictly_viable = true;
3338 else
3339 cand = &c->next;
3342 return viable ? viable : cands;
3345 static bool
3346 any_strictly_viable (struct z_candidate *cands)
3348 for (; cands; cands = cands->next)
3349 if (cands->viable == 1)
3350 return true;
3351 return false;
3354 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3355 words, it is about to become the "this" pointer for a member
3356 function call. Take the address of the object. */
3358 static tree
3359 build_this (tree obj)
3361 /* In a template, we are only concerned about the type of the
3362 expression, so we can take a shortcut. */
3363 if (processing_template_decl)
3364 return build_address (obj);
3366 return cp_build_addr_expr (obj, tf_warning_or_error);
3369 /* Returns true iff functions are equivalent. Equivalent functions are
3370 not '==' only if one is a function-local extern function or if
3371 both are extern "C". */
3373 static inline int
3374 equal_functions (tree fn1, tree fn2)
3376 if (TREE_CODE (fn1) != TREE_CODE (fn2))
3377 return 0;
3378 if (TREE_CODE (fn1) == TEMPLATE_DECL)
3379 return fn1 == fn2;
3380 if (DECL_LOCAL_FUNCTION_P (fn1) || DECL_LOCAL_FUNCTION_P (fn2)
3381 || DECL_EXTERN_C_FUNCTION_P (fn1))
3382 return decls_match (fn1, fn2);
3383 return fn1 == fn2;
3386 /* Print information about a candidate being rejected due to INFO. */
3388 static void
3389 print_conversion_rejection (location_t loc, struct conversion_info *info)
3391 tree from = info->from;
3392 if (!TYPE_P (from))
3393 from = lvalue_type (from);
3394 if (info->n_arg == -1)
3396 /* Conversion of implicit `this' argument failed. */
3397 if (!TYPE_P (info->from))
3398 /* A bad conversion for 'this' must be discarding cv-quals. */
3399 inform (loc, " passing %qT as %<this%> "
3400 "argument discards qualifiers",
3401 from);
3402 else
3403 inform (loc, " no known conversion for implicit "
3404 "%<this%> parameter from %qH to %qI",
3405 from, info->to_type);
3407 else if (!TYPE_P (info->from))
3409 if (info->n_arg >= 0)
3410 inform (loc, " conversion of argument %d would be ill-formed:",
3411 info->n_arg + 1);
3412 perform_implicit_conversion (info->to_type, info->from,
3413 tf_warning_or_error);
3415 else if (info->n_arg == -2)
3416 /* Conversion of conversion function return value failed. */
3417 inform (loc, " no known conversion from %qH to %qI",
3418 from, info->to_type);
3419 else
3420 inform (loc, " no known conversion for argument %d from %qH to %qI",
3421 info->n_arg + 1, from, info->to_type);
3424 /* Print information about a candidate with WANT parameters and we found
3425 HAVE. */
3427 static void
3428 print_arity_information (location_t loc, unsigned int have, unsigned int want)
3430 inform_n (loc, want,
3431 " candidate expects %d argument, %d provided",
3432 " candidate expects %d arguments, %d provided",
3433 want, have);
3436 /* Print information about one overload candidate CANDIDATE. MSGSTR
3437 is the text to print before the candidate itself.
3439 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3440 to have been run through gettext by the caller. This wart makes
3441 life simpler in print_z_candidates and for the translators. */
3443 static void
3444 print_z_candidate (location_t loc, const char *msgstr,
3445 struct z_candidate *candidate)
3447 const char *msg = (msgstr == NULL
3448 ? ""
3449 : ACONCAT ((msgstr, " ", NULL)));
3450 tree fn = candidate->fn;
3451 if (flag_new_inheriting_ctors)
3452 fn = strip_inheriting_ctors (fn);
3453 location_t cloc = location_of (fn);
3455 if (identifier_p (fn))
3457 cloc = loc;
3458 if (candidate->num_convs == 3)
3459 inform (cloc, "%s%<%D(%T, %T, %T)%> <built-in>", msg, fn,
3460 candidate->convs[0]->type,
3461 candidate->convs[1]->type,
3462 candidate->convs[2]->type);
3463 else if (candidate->num_convs == 2)
3464 inform (cloc, "%s%<%D(%T, %T)%> <built-in>", msg, fn,
3465 candidate->convs[0]->type,
3466 candidate->convs[1]->type);
3467 else
3468 inform (cloc, "%s%<%D(%T)%> <built-in>", msg, fn,
3469 candidate->convs[0]->type);
3471 else if (TYPE_P (fn))
3472 inform (cloc, "%s%qT <conversion>", msg, fn);
3473 else if (candidate->viable == -1)
3474 inform (cloc, "%s%#qD <near match>", msg, fn);
3475 else if (DECL_DELETED_FN (fn))
3476 inform (cloc, "%s%#qD <deleted>", msg, fn);
3477 else
3478 inform (cloc, "%s%#qD", msg, fn);
3479 if (fn != candidate->fn)
3481 cloc = location_of (candidate->fn);
3482 inform (cloc, " inherited here");
3484 /* Give the user some information about why this candidate failed. */
3485 if (candidate->reason != NULL)
3487 struct rejection_reason *r = candidate->reason;
3489 switch (r->code)
3491 case rr_arity:
3492 print_arity_information (cloc, r->u.arity.actual,
3493 r->u.arity.expected);
3494 break;
3495 case rr_arg_conversion:
3496 print_conversion_rejection (cloc, &r->u.conversion);
3497 break;
3498 case rr_bad_arg_conversion:
3499 print_conversion_rejection (cloc, &r->u.bad_conversion);
3500 break;
3501 case rr_explicit_conversion:
3502 inform (cloc, " return type %qT of explicit conversion function "
3503 "cannot be converted to %qT with a qualification "
3504 "conversion", r->u.conversion.from,
3505 r->u.conversion.to_type);
3506 break;
3507 case rr_template_conversion:
3508 inform (cloc, " conversion from return type %qT of template "
3509 "conversion function specialization to %qT is not an "
3510 "exact match", r->u.conversion.from,
3511 r->u.conversion.to_type);
3512 break;
3513 case rr_template_unification:
3514 /* We use template_unification_error_rejection if unification caused
3515 actual non-SFINAE errors, in which case we don't need to repeat
3516 them here. */
3517 if (r->u.template_unification.tmpl == NULL_TREE)
3519 inform (cloc, " substitution of deduced template arguments "
3520 "resulted in errors seen above");
3521 break;
3523 /* Re-run template unification with diagnostics. */
3524 inform (cloc, " template argument deduction/substitution failed:");
3525 fn_type_unification (r->u.template_unification.tmpl,
3526 r->u.template_unification.explicit_targs,
3527 (make_tree_vec
3528 (r->u.template_unification.num_targs)),
3529 r->u.template_unification.args,
3530 r->u.template_unification.nargs,
3531 r->u.template_unification.return_type,
3532 r->u.template_unification.strict,
3533 r->u.template_unification.flags,
3534 true, false);
3535 break;
3536 case rr_invalid_copy:
3537 inform (cloc,
3538 " a constructor taking a single argument of its own "
3539 "class type is invalid");
3540 break;
3541 case rr_constraint_failure:
3543 tree tmpl = r->u.template_instantiation.tmpl;
3544 tree args = r->u.template_instantiation.targs;
3545 diagnose_constraints (cloc, tmpl, args);
3547 break;
3548 case rr_inherited_ctor:
3549 inform (cloc, " an inherited constructor is not a candidate for "
3550 "initialization from an expression of the same or derived "
3551 "type");
3552 break;
3553 case rr_none:
3554 default:
3555 /* This candidate didn't have any issues or we failed to
3556 handle a particular code. Either way... */
3557 gcc_unreachable ();
3562 static void
3563 print_z_candidates (location_t loc, struct z_candidate *candidates)
3565 struct z_candidate *cand1;
3566 struct z_candidate **cand2;
3568 if (!candidates)
3569 return;
3571 /* Remove non-viable deleted candidates. */
3572 cand1 = candidates;
3573 for (cand2 = &cand1; *cand2; )
3575 if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL
3576 && !(*cand2)->viable
3577 && DECL_DELETED_FN ((*cand2)->fn))
3578 *cand2 = (*cand2)->next;
3579 else
3580 cand2 = &(*cand2)->next;
3582 /* ...if there are any non-deleted ones. */
3583 if (cand1)
3584 candidates = cand1;
3586 /* There may be duplicates in the set of candidates. We put off
3587 checking this condition as long as possible, since we have no way
3588 to eliminate duplicates from a set of functions in less than n^2
3589 time. Now we are about to emit an error message, so it is more
3590 permissible to go slowly. */
3591 for (cand1 = candidates; cand1; cand1 = cand1->next)
3593 tree fn = cand1->fn;
3594 /* Skip builtin candidates and conversion functions. */
3595 if (!DECL_P (fn))
3596 continue;
3597 cand2 = &cand1->next;
3598 while (*cand2)
3600 if (DECL_P ((*cand2)->fn)
3601 && equal_functions (fn, (*cand2)->fn))
3602 *cand2 = (*cand2)->next;
3603 else
3604 cand2 = &(*cand2)->next;
3608 for (; candidates; candidates = candidates->next)
3609 print_z_candidate (loc, "candidate:", candidates);
3612 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3613 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3614 the result of the conversion function to convert it to the final
3615 desired type. Merge the two sequences into a single sequence,
3616 and return the merged sequence. */
3618 static conversion *
3619 merge_conversion_sequences (conversion *user_seq, conversion *std_seq)
3621 conversion **t;
3622 bool bad = user_seq->bad_p;
3624 gcc_assert (user_seq->kind == ck_user);
3626 /* Find the end of the second conversion sequence. */
3627 for (t = &std_seq; (*t)->kind != ck_identity; t = &((*t)->u.next))
3629 /* The entire sequence is a user-conversion sequence. */
3630 (*t)->user_conv_p = true;
3631 if (bad)
3632 (*t)->bad_p = true;
3635 /* Replace the identity conversion with the user conversion
3636 sequence. */
3637 *t = user_seq;
3639 return std_seq;
3642 /* Handle overload resolution for initializing an object of class type from
3643 an initializer list. First we look for a suitable constructor that
3644 takes a std::initializer_list; if we don't find one, we then look for a
3645 non-list constructor.
3647 Parameters are as for add_candidates, except that the arguments are in
3648 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3649 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3651 static void
3652 add_list_candidates (tree fns, tree first_arg,
3653 const vec<tree, va_gc> *args, tree totype,
3654 tree explicit_targs, bool template_only,
3655 tree conversion_path, tree access_path,
3656 int flags,
3657 struct z_candidate **candidates,
3658 tsubst_flags_t complain)
3660 gcc_assert (*candidates == NULL);
3662 /* We're looking for a ctor for list-initialization. */
3663 flags |= LOOKUP_LIST_INIT_CTOR;
3664 /* And we don't allow narrowing conversions. We also use this flag to
3665 avoid the copy constructor call for copy-list-initialization. */
3666 flags |= LOOKUP_NO_NARROWING;
3668 unsigned nart = num_artificial_parms_for (OVL_FIRST (fns)) - 1;
3669 tree init_list = (*args)[nart];
3671 /* Always use the default constructor if the list is empty (DR 990). */
3672 if (CONSTRUCTOR_NELTS (init_list) == 0
3673 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
3675 /* If the class has a list ctor, try passing the list as a single
3676 argument first, but only consider list ctors. */
3677 else if (TYPE_HAS_LIST_CTOR (totype))
3679 flags |= LOOKUP_LIST_ONLY;
3680 add_candidates (fns, first_arg, args, NULL_TREE,
3681 explicit_targs, template_only, conversion_path,
3682 access_path, flags, candidates, complain);
3683 if (any_strictly_viable (*candidates))
3684 return;
3687 /* Expand the CONSTRUCTOR into a new argument vec. */
3688 vec<tree, va_gc> *new_args;
3689 vec_alloc (new_args, nart + CONSTRUCTOR_NELTS (init_list));
3690 for (unsigned i = 0; i < nart; ++i)
3691 new_args->quick_push ((*args)[i]);
3692 for (unsigned i = 0; i < CONSTRUCTOR_NELTS (init_list); ++i)
3693 new_args->quick_push (CONSTRUCTOR_ELT (init_list, i)->value);
3695 /* We aren't looking for list-ctors anymore. */
3696 flags &= ~LOOKUP_LIST_ONLY;
3697 /* We allow more user-defined conversions within an init-list. */
3698 flags &= ~LOOKUP_NO_CONVERSION;
3700 add_candidates (fns, first_arg, new_args, NULL_TREE,
3701 explicit_targs, template_only, conversion_path,
3702 access_path, flags, candidates, complain);
3705 /* Returns the best overload candidate to perform the requested
3706 conversion. This function is used for three the overloading situations
3707 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3708 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3709 per [dcl.init.ref], so we ignore temporary bindings. */
3711 static struct z_candidate *
3712 build_user_type_conversion_1 (tree totype, tree expr, int flags,
3713 tsubst_flags_t complain)
3715 struct z_candidate *candidates, *cand;
3716 tree fromtype;
3717 tree ctors = NULL_TREE;
3718 tree conv_fns = NULL_TREE;
3719 conversion *conv = NULL;
3720 tree first_arg = NULL_TREE;
3721 vec<tree, va_gc> *args = NULL;
3722 bool any_viable_p;
3723 int convflags;
3725 if (!expr)
3726 return NULL;
3728 fromtype = TREE_TYPE (expr);
3730 /* We represent conversion within a hierarchy using RVALUE_CONV and
3731 BASE_CONV, as specified by [over.best.ics]; these become plain
3732 constructor calls, as specified in [dcl.init]. */
3733 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype) || !MAYBE_CLASS_TYPE_P (totype)
3734 || !DERIVED_FROM_P (totype, fromtype));
3736 if (CLASS_TYPE_P (totype))
3737 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3738 creating a garbage BASELINK; constructors can't be inherited. */
3739 ctors = lookup_fnfields_slot (totype, complete_ctor_identifier);
3741 /* FIXME P0135 doesn't say what to do in C++17 about list-initialization from
3742 a single element. For now, let's handle constructors as before and also
3743 consider conversion operators from the element. */
3744 if (cxx_dialect >= cxx1z
3745 && BRACE_ENCLOSED_INITIALIZER_P (expr)
3746 && CONSTRUCTOR_NELTS (expr) == 1)
3747 fromtype = TREE_TYPE (CONSTRUCTOR_ELT (expr, 0)->value);
3749 if (MAYBE_CLASS_TYPE_P (fromtype))
3751 tree to_nonref = non_reference (totype);
3752 if (same_type_ignoring_top_level_qualifiers_p (to_nonref, fromtype) ||
3753 (CLASS_TYPE_P (to_nonref) && CLASS_TYPE_P (fromtype)
3754 && DERIVED_FROM_P (to_nonref, fromtype)))
3756 /* [class.conv.fct] A conversion function is never used to
3757 convert a (possibly cv-qualified) object to the (possibly
3758 cv-qualified) same object type (or a reference to it), to a
3759 (possibly cv-qualified) base class of that type (or a
3760 reference to it)... */
3762 else
3763 conv_fns = lookup_conversions (fromtype);
3766 candidates = 0;
3767 flags |= LOOKUP_NO_CONVERSION;
3768 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3769 flags |= LOOKUP_NO_NARROWING;
3771 /* It's OK to bind a temporary for converting constructor arguments, but
3772 not in converting the return value of a conversion operator. */
3773 convflags = ((flags & LOOKUP_NO_TEMP_BIND) | LOOKUP_NO_CONVERSION
3774 | (flags & LOOKUP_NO_NARROWING));
3775 flags &= ~LOOKUP_NO_TEMP_BIND;
3777 if (ctors)
3779 int ctorflags = flags;
3781 first_arg = build_dummy_object (totype);
3783 /* We should never try to call the abstract or base constructor
3784 from here. */
3785 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors))
3786 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors)));
3788 args = make_tree_vector_single (expr);
3789 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3791 /* List-initialization. */
3792 add_list_candidates (ctors, first_arg, args, totype, NULL_TREE,
3793 false, TYPE_BINFO (totype), TYPE_BINFO (totype),
3794 ctorflags, &candidates, complain);
3796 else
3798 add_candidates (ctors, first_arg, args, NULL_TREE, NULL_TREE, false,
3799 TYPE_BINFO (totype), TYPE_BINFO (totype),
3800 ctorflags, &candidates, complain);
3803 for (cand = candidates; cand; cand = cand->next)
3805 cand->second_conv = build_identity_conv (totype, NULL_TREE);
3807 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3808 set, then this is copy-initialization. In that case, "The
3809 result of the call is then used to direct-initialize the
3810 object that is the destination of the copy-initialization."
3811 [dcl.init]
3813 We represent this in the conversion sequence with an
3814 rvalue conversion, which means a constructor call. */
3815 if (TREE_CODE (totype) != REFERENCE_TYPE
3816 && !(convflags & LOOKUP_NO_TEMP_BIND))
3817 cand->second_conv
3818 = build_conv (ck_rvalue, totype, cand->second_conv);
3822 if (conv_fns)
3824 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
3825 /* FIXME see above about C++17. */
3826 first_arg = CONSTRUCTOR_ELT (expr, 0)->value;
3827 else
3828 first_arg = expr;
3831 for (; conv_fns; conv_fns = TREE_CHAIN (conv_fns))
3833 tree conversion_path = TREE_PURPOSE (conv_fns);
3834 struct z_candidate *old_candidates;
3836 /* If we are called to convert to a reference type, we are trying to
3837 find a direct binding, so don't even consider temporaries. If
3838 we don't find a direct binding, the caller will try again to
3839 look for a temporary binding. */
3840 if (TREE_CODE (totype) == REFERENCE_TYPE)
3841 convflags |= LOOKUP_NO_TEMP_BIND;
3843 old_candidates = candidates;
3844 add_candidates (TREE_VALUE (conv_fns), first_arg, NULL, totype,
3845 NULL_TREE, false,
3846 conversion_path, TYPE_BINFO (fromtype),
3847 flags, &candidates, complain);
3849 for (cand = candidates; cand != old_candidates; cand = cand->next)
3851 tree rettype = TREE_TYPE (TREE_TYPE (cand->fn));
3852 conversion *ics
3853 = implicit_conversion (totype,
3854 rettype,
3856 /*c_cast_p=*/false, convflags,
3857 complain);
3859 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3860 copy-initialization. In that case, "The result of the
3861 call is then used to direct-initialize the object that is
3862 the destination of the copy-initialization." [dcl.init]
3864 We represent this in the conversion sequence with an
3865 rvalue conversion, which means a constructor call. But
3866 don't add a second rvalue conversion if there's already
3867 one there. Which there really shouldn't be, but it's
3868 harmless since we'd add it here anyway. */
3869 if (ics && MAYBE_CLASS_TYPE_P (totype) && ics->kind != ck_rvalue
3870 && !(convflags & LOOKUP_NO_TEMP_BIND))
3871 ics = build_conv (ck_rvalue, totype, ics);
3873 cand->second_conv = ics;
3875 if (!ics)
3877 cand->viable = 0;
3878 cand->reason = arg_conversion_rejection (NULL_TREE, -2,
3879 rettype, totype);
3881 else if (DECL_NONCONVERTING_P (cand->fn)
3882 && ics->rank > cr_exact)
3884 /* 13.3.1.5: For direct-initialization, those explicit
3885 conversion functions that are not hidden within S and
3886 yield type T or a type that can be converted to type T
3887 with a qualification conversion (4.4) are also candidate
3888 functions. */
3889 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3890 I've raised this issue with the committee. --jason 9/2011 */
3891 cand->viable = -1;
3892 cand->reason = explicit_conversion_rejection (rettype, totype);
3894 else if (cand->viable == 1 && ics->bad_p)
3896 cand->viable = -1;
3897 cand->reason
3898 = bad_arg_conversion_rejection (NULL_TREE, -2,
3899 rettype, totype);
3901 else if (primary_template_instantiation_p (cand->fn)
3902 && ics->rank > cr_exact)
3904 /* 13.3.3.1.2: If the user-defined conversion is specified by
3905 a specialization of a conversion function template, the
3906 second standard conversion sequence shall have exact match
3907 rank. */
3908 cand->viable = -1;
3909 cand->reason = template_conversion_rejection (rettype, totype);
3914 candidates = splice_viable (candidates, false, &any_viable_p);
3915 if (!any_viable_p)
3917 if (args)
3918 release_tree_vector (args);
3919 return NULL;
3922 cand = tourney (candidates, complain);
3923 if (cand == 0)
3925 if (complain & tf_error)
3927 error ("conversion from %qH to %qI is ambiguous",
3928 fromtype, totype);
3929 print_z_candidates (location_of (expr), candidates);
3932 cand = candidates; /* any one will do */
3933 cand->second_conv = build_ambiguous_conv (totype, expr);
3934 cand->second_conv->user_conv_p = true;
3935 if (!any_strictly_viable (candidates))
3936 cand->second_conv->bad_p = true;
3937 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3938 ambiguous conversion is no worse than another user-defined
3939 conversion. */
3941 return cand;
3944 tree convtype;
3945 if (!DECL_CONSTRUCTOR_P (cand->fn))
3946 convtype = non_reference (TREE_TYPE (TREE_TYPE (cand->fn)));
3947 else if (cand->second_conv->kind == ck_rvalue)
3948 /* DR 5: [in the first step of copy-initialization]...if the function
3949 is a constructor, the call initializes a temporary of the
3950 cv-unqualified version of the destination type. */
3951 convtype = cv_unqualified (totype);
3952 else
3953 convtype = totype;
3954 /* Build the user conversion sequence. */
3955 conv = build_conv
3956 (ck_user,
3957 convtype,
3958 build_identity_conv (TREE_TYPE (expr), expr));
3959 conv->cand = cand;
3960 if (cand->viable == -1)
3961 conv->bad_p = true;
3963 /* Remember that this was a list-initialization. */
3964 if (flags & LOOKUP_NO_NARROWING)
3965 conv->check_narrowing = true;
3967 /* Combine it with the second conversion sequence. */
3968 cand->second_conv = merge_conversion_sequences (conv,
3969 cand->second_conv);
3971 return cand;
3974 /* Wrapper for above. */
3976 tree
3977 build_user_type_conversion (tree totype, tree expr, int flags,
3978 tsubst_flags_t complain)
3980 struct z_candidate *cand;
3981 tree ret;
3983 bool subtime = timevar_cond_start (TV_OVERLOAD);
3984 cand = build_user_type_conversion_1 (totype, expr, flags, complain);
3986 if (cand)
3988 if (cand->second_conv->kind == ck_ambig)
3989 ret = error_mark_node;
3990 else
3992 expr = convert_like (cand->second_conv, expr, complain);
3993 ret = convert_from_reference (expr);
3996 else
3997 ret = NULL_TREE;
3999 timevar_cond_stop (TV_OVERLOAD, subtime);
4000 return ret;
4003 /* Subroutine of convert_nontype_argument.
4005 EXPR is an expression used in a context that requires a converted
4006 constant-expression, such as a template non-type parameter. Do any
4007 necessary conversions (that are permitted for converted
4008 constant-expressions) to convert it to the desired type.
4010 If conversion is successful, returns the converted expression;
4011 otherwise, returns error_mark_node. */
4013 tree
4014 build_converted_constant_expr (tree type, tree expr, tsubst_flags_t complain)
4016 conversion *conv;
4017 void *p;
4018 tree t;
4019 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
4021 if (error_operand_p (expr))
4022 return error_mark_node;
4024 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4025 p = conversion_obstack_alloc (0);
4027 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
4028 /*c_cast_p=*/false,
4029 LOOKUP_IMPLICIT, complain);
4031 /* A converted constant expression of type T is an expression, implicitly
4032 converted to type T, where the converted expression is a constant
4033 expression and the implicit conversion sequence contains only
4035 * user-defined conversions,
4036 * lvalue-to-rvalue conversions (7.1),
4037 * array-to-pointer conversions (7.2),
4038 * function-to-pointer conversions (7.3),
4039 * qualification conversions (7.5),
4040 * integral promotions (7.6),
4041 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4042 * null pointer conversions (7.11) from std::nullptr_t,
4043 * null member pointer conversions (7.12) from std::nullptr_t, and
4044 * function pointer conversions (7.13),
4046 and where the reference binding (if any) binds directly. */
4048 for (conversion *c = conv;
4049 conv && c->kind != ck_identity;
4050 c = next_conversion (c))
4052 switch (c->kind)
4054 /* A conversion function is OK. If it isn't constexpr, we'll
4055 complain later that the argument isn't constant. */
4056 case ck_user:
4057 /* The lvalue-to-rvalue conversion is OK. */
4058 case ck_rvalue:
4059 /* Array-to-pointer and function-to-pointer. */
4060 case ck_lvalue:
4061 /* Function pointer conversions. */
4062 case ck_fnptr:
4063 /* Qualification conversions. */
4064 case ck_qual:
4065 break;
4067 case ck_ref_bind:
4068 if (c->need_temporary_p)
4070 if (complain & tf_error)
4071 error_at (loc, "initializing %qH with %qI in converted "
4072 "constant expression does not bind directly",
4073 type, next_conversion (c)->type);
4074 conv = NULL;
4076 break;
4078 case ck_base:
4079 case ck_pmem:
4080 case ck_ptr:
4081 case ck_std:
4082 t = next_conversion (c)->type;
4083 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t)
4084 && INTEGRAL_OR_ENUMERATION_TYPE_P (type))
4085 /* Integral promotion or conversion. */
4086 break;
4087 if (NULLPTR_TYPE_P (t))
4088 /* Conversion from nullptr to pointer or pointer-to-member. */
4089 break;
4091 if (complain & tf_error)
4092 error_at (loc, "conversion from %qH to %qI in a "
4093 "converted constant expression", t, type);
4094 /* fall through. */
4096 default:
4097 conv = NULL;
4098 break;
4102 /* Avoid confusing convert_nontype_argument by introducing
4103 a redundant conversion to the same reference type. */
4104 if (conv && conv->kind == ck_ref_bind
4105 && REFERENCE_REF_P (expr))
4107 tree ref = TREE_OPERAND (expr, 0);
4108 if (same_type_p (type, TREE_TYPE (ref)))
4109 return ref;
4112 if (conv)
4113 expr = convert_like (conv, expr, complain);
4114 else
4115 expr = error_mark_node;
4117 /* Free all the conversions we allocated. */
4118 obstack_free (&conversion_obstack, p);
4120 return expr;
4123 /* Do any initial processing on the arguments to a function call. */
4125 static vec<tree, va_gc> *
4126 resolve_args (vec<tree, va_gc> *args, tsubst_flags_t complain)
4128 unsigned int ix;
4129 tree arg;
4131 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
4133 if (error_operand_p (arg))
4134 return NULL;
4135 else if (VOID_TYPE_P (TREE_TYPE (arg)))
4137 if (complain & tf_error)
4138 error ("invalid use of void expression");
4139 return NULL;
4141 else if (invalid_nonstatic_memfn_p (input_location, arg, complain))
4142 return NULL;
4144 return args;
4147 /* Perform overload resolution on FN, which is called with the ARGS.
4149 Return the candidate function selected by overload resolution, or
4150 NULL if the event that overload resolution failed. In the case
4151 that overload resolution fails, *CANDIDATES will be the set of
4152 candidates considered, and ANY_VIABLE_P will be set to true or
4153 false to indicate whether or not any of the candidates were
4154 viable.
4156 The ARGS should already have gone through RESOLVE_ARGS before this
4157 function is called. */
4159 static struct z_candidate *
4160 perform_overload_resolution (tree fn,
4161 const vec<tree, va_gc> *args,
4162 struct z_candidate **candidates,
4163 bool *any_viable_p, tsubst_flags_t complain)
4165 struct z_candidate *cand;
4166 tree explicit_targs;
4167 int template_only;
4169 bool subtime = timevar_cond_start (TV_OVERLOAD);
4171 explicit_targs = NULL_TREE;
4172 template_only = 0;
4174 *candidates = NULL;
4175 *any_viable_p = true;
4177 /* Check FN. */
4178 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
4179 || TREE_CODE (fn) == TEMPLATE_DECL
4180 || TREE_CODE (fn) == OVERLOAD
4181 || TREE_CODE (fn) == TEMPLATE_ID_EXPR);
4183 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4185 explicit_targs = TREE_OPERAND (fn, 1);
4186 fn = TREE_OPERAND (fn, 0);
4187 template_only = 1;
4190 /* Add the various candidate functions. */
4191 add_candidates (fn, NULL_TREE, args, NULL_TREE,
4192 explicit_targs, template_only,
4193 /*conversion_path=*/NULL_TREE,
4194 /*access_path=*/NULL_TREE,
4195 LOOKUP_NORMAL,
4196 candidates, complain);
4198 *candidates = splice_viable (*candidates, false, any_viable_p);
4199 if (*any_viable_p)
4200 cand = tourney (*candidates, complain);
4201 else
4202 cand = NULL;
4204 timevar_cond_stop (TV_OVERLOAD, subtime);
4205 return cand;
4208 /* Print an error message about being unable to build a call to FN with
4209 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4210 be located; CANDIDATES is a possibly empty list of such
4211 functions. */
4213 static void
4214 print_error_for_call_failure (tree fn, vec<tree, va_gc> *args,
4215 struct z_candidate *candidates)
4217 tree targs = NULL_TREE;
4218 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4220 targs = TREE_OPERAND (fn, 1);
4221 fn = TREE_OPERAND (fn, 0);
4223 tree name = OVL_NAME (fn);
4224 location_t loc = location_of (name);
4225 if (targs)
4226 name = lookup_template_function (name, targs);
4228 if (!any_strictly_viable (candidates))
4229 error_at (loc, "no matching function for call to %<%D(%A)%>",
4230 name, build_tree_list_vec (args));
4231 else
4232 error_at (loc, "call of overloaded %<%D(%A)%> is ambiguous",
4233 name, build_tree_list_vec (args));
4234 if (candidates)
4235 print_z_candidates (loc, candidates);
4238 /* Return an expression for a call to FN (a namespace-scope function,
4239 or a static member function) with the ARGS. This may change
4240 ARGS. */
4242 tree
4243 build_new_function_call (tree fn, vec<tree, va_gc> **args,
4244 tsubst_flags_t complain)
4246 struct z_candidate *candidates, *cand;
4247 bool any_viable_p;
4248 void *p;
4249 tree result;
4251 if (args != NULL && *args != NULL)
4253 *args = resolve_args (*args, complain);
4254 if (*args == NULL)
4255 return error_mark_node;
4258 if (flag_tm)
4259 tm_malloc_replacement (fn);
4261 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4262 p = conversion_obstack_alloc (0);
4264 cand = perform_overload_resolution (fn, *args, &candidates, &any_viable_p,
4265 complain);
4267 if (!cand)
4269 if (complain & tf_error)
4271 // If there is a single (non-viable) function candidate,
4272 // let the error be diagnosed by cp_build_function_call_vec.
4273 if (!any_viable_p && candidates && ! candidates->next
4274 && (TREE_CODE (candidates->fn) == FUNCTION_DECL))
4275 return cp_build_function_call_vec (candidates->fn, args, complain);
4277 // Otherwise, emit notes for non-viable candidates.
4278 print_error_for_call_failure (fn, *args, candidates);
4280 result = error_mark_node;
4282 else
4284 int flags = LOOKUP_NORMAL;
4285 /* If fn is template_id_expr, the call has explicit template arguments
4286 (e.g. func<int>(5)), communicate this info to build_over_call
4287 through flags so that later we can use it to decide whether to warn
4288 about peculiar null pointer conversion. */
4289 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4291 /* If overload resolution selects a specialization of a
4292 function concept for non-dependent template arguments,
4293 the expression is true if the constraints are satisfied
4294 and false otherwise.
4296 NOTE: This is an extension of Concepts Lite TS that
4297 allows constraints to be used in expressions. */
4298 if (flag_concepts && !processing_template_decl)
4300 tree tmpl = DECL_TI_TEMPLATE (cand->fn);
4301 tree targs = DECL_TI_ARGS (cand->fn);
4302 tree decl = DECL_TEMPLATE_RESULT (tmpl);
4303 if (DECL_DECLARED_CONCEPT_P (decl))
4304 return evaluate_function_concept (decl, targs);
4307 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
4310 result = build_over_call (cand, flags, complain);
4313 /* Free all the conversions we allocated. */
4314 obstack_free (&conversion_obstack, p);
4316 return result;
4319 /* Build a call to a global operator new. FNNAME is the name of the
4320 operator (either "operator new" or "operator new[]") and ARGS are
4321 the arguments provided. This may change ARGS. *SIZE points to the
4322 total number of bytes required by the allocation, and is updated if
4323 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4324 be used. If this function determines that no cookie should be
4325 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4326 is not NULL_TREE, it is evaluated before calculating the final
4327 array size, and if it fails, the array size is replaced with
4328 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4329 is non-NULL, it will be set, upon return, to the allocation
4330 function called. */
4332 tree
4333 build_operator_new_call (tree fnname, vec<tree, va_gc> **args,
4334 tree *size, tree *cookie_size,
4335 tree align_arg, tree size_check,
4336 tree *fn, tsubst_flags_t complain)
4338 tree original_size = *size;
4339 tree fns;
4340 struct z_candidate *candidates;
4341 struct z_candidate *cand = NULL;
4342 bool any_viable_p;
4344 if (fn)
4345 *fn = NULL_TREE;
4346 /* Set to (size_t)-1 if the size check fails. */
4347 if (size_check != NULL_TREE)
4349 tree errval = TYPE_MAX_VALUE (sizetype);
4350 if (cxx_dialect >= cxx11 && flag_exceptions)
4351 errval = throw_bad_array_new_length ();
4352 *size = fold_build3 (COND_EXPR, sizetype, size_check,
4353 original_size, errval);
4355 vec_safe_insert (*args, 0, *size);
4356 *args = resolve_args (*args, complain);
4357 if (*args == NULL)
4358 return error_mark_node;
4360 /* Based on:
4362 [expr.new]
4364 If this lookup fails to find the name, or if the allocated type
4365 is not a class type, the allocation function's name is looked
4366 up in the global scope.
4368 we disregard block-scope declarations of "operator new". */
4369 fns = lookup_name_real (fnname, 0, 1, /*block_p=*/false, 0, 0);
4370 fns = lookup_arg_dependent (fnname, fns, *args);
4372 if (align_arg)
4374 vec<tree, va_gc>* align_args
4375 = vec_copy_and_insert (*args, align_arg, 1);
4376 cand = perform_overload_resolution (fns, align_args, &candidates,
4377 &any_viable_p, tf_none);
4378 /* If no aligned allocation function matches, try again without the
4379 alignment. */
4382 /* Figure out what function is being called. */
4383 if (!cand)
4384 cand = perform_overload_resolution (fns, *args, &candidates, &any_viable_p,
4385 complain);
4387 /* If no suitable function could be found, issue an error message
4388 and give up. */
4389 if (!cand)
4391 if (complain & tf_error)
4392 print_error_for_call_failure (fns, *args, candidates);
4393 return error_mark_node;
4396 /* If a cookie is required, add some extra space. Whether
4397 or not a cookie is required cannot be determined until
4398 after we know which function was called. */
4399 if (*cookie_size)
4401 bool use_cookie = true;
4402 tree arg_types;
4404 arg_types = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
4405 /* Skip the size_t parameter. */
4406 arg_types = TREE_CHAIN (arg_types);
4407 /* Check the remaining parameters (if any). */
4408 if (arg_types
4409 && TREE_CHAIN (arg_types) == void_list_node
4410 && same_type_p (TREE_VALUE (arg_types),
4411 ptr_type_node))
4412 use_cookie = false;
4413 /* If we need a cookie, adjust the number of bytes allocated. */
4414 if (use_cookie)
4416 /* Update the total size. */
4417 *size = size_binop (PLUS_EXPR, original_size, *cookie_size);
4418 if (size_check)
4420 /* Set to (size_t)-1 if the size check fails. */
4421 gcc_assert (size_check != NULL_TREE);
4422 *size = fold_build3 (COND_EXPR, sizetype, size_check,
4423 *size, TYPE_MAX_VALUE (sizetype));
4425 /* Update the argument list to reflect the adjusted size. */
4426 (**args)[0] = *size;
4428 else
4429 *cookie_size = NULL_TREE;
4432 /* Tell our caller which function we decided to call. */
4433 if (fn)
4434 *fn = cand->fn;
4436 /* Build the CALL_EXPR. */
4437 return build_over_call (cand, LOOKUP_NORMAL, complain);
4440 /* Build a new call to operator(). This may change ARGS. */
4442 static tree
4443 build_op_call_1 (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
4445 struct z_candidate *candidates = 0, *cand;
4446 tree fns, convs, first_mem_arg = NULL_TREE;
4447 tree type = TREE_TYPE (obj);
4448 bool any_viable_p;
4449 tree result = NULL_TREE;
4450 void *p;
4452 if (error_operand_p (obj))
4453 return error_mark_node;
4455 obj = prep_operand (obj);
4457 if (TYPE_PTRMEMFUNC_P (type))
4459 if (complain & tf_error)
4460 /* It's no good looking for an overloaded operator() on a
4461 pointer-to-member-function. */
4462 error ("pointer-to-member function %qE cannot be called without "
4463 "an object; consider using %<.*%> or %<->*%>", obj);
4464 return error_mark_node;
4467 if (TYPE_BINFO (type))
4469 fns = lookup_fnfields (TYPE_BINFO (type), cp_operator_id (CALL_EXPR), 1);
4470 if (fns == error_mark_node)
4471 return error_mark_node;
4473 else
4474 fns = NULL_TREE;
4476 if (args != NULL && *args != NULL)
4478 *args = resolve_args (*args, complain);
4479 if (*args == NULL)
4480 return error_mark_node;
4483 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4484 p = conversion_obstack_alloc (0);
4486 if (fns)
4488 first_mem_arg = obj;
4490 add_candidates (BASELINK_FUNCTIONS (fns),
4491 first_mem_arg, *args, NULL_TREE,
4492 NULL_TREE, false,
4493 BASELINK_BINFO (fns), BASELINK_ACCESS_BINFO (fns),
4494 LOOKUP_NORMAL, &candidates, complain);
4497 convs = lookup_conversions (type);
4499 for (; convs; convs = TREE_CHAIN (convs))
4501 tree totype = TREE_TYPE (convs);
4503 if (TYPE_PTRFN_P (totype)
4504 || TYPE_REFFN_P (totype)
4505 || (TREE_CODE (totype) == REFERENCE_TYPE
4506 && TYPE_PTRFN_P (TREE_TYPE (totype))))
4507 for (ovl_iterator iter (TREE_VALUE (convs)); iter; ++iter)
4509 tree fn = *iter;
4511 if (DECL_NONCONVERTING_P (fn))
4512 continue;
4514 if (TREE_CODE (fn) == TEMPLATE_DECL)
4515 add_template_conv_candidate
4516 (&candidates, fn, obj, *args, totype,
4517 /*access_path=*/NULL_TREE,
4518 /*conversion_path=*/NULL_TREE, complain);
4519 else
4520 add_conv_candidate (&candidates, fn, obj,
4521 *args, /*conversion_path=*/NULL_TREE,
4522 /*access_path=*/NULL_TREE, complain);
4526 /* Be strict here because if we choose a bad conversion candidate, the
4527 errors we get won't mention the call context. */
4528 candidates = splice_viable (candidates, true, &any_viable_p);
4529 if (!any_viable_p)
4531 if (complain & tf_error)
4533 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj),
4534 build_tree_list_vec (*args));
4535 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4537 result = error_mark_node;
4539 else
4541 cand = tourney (candidates, complain);
4542 if (cand == 0)
4544 if (complain & tf_error)
4546 error ("call of %<(%T) (%A)%> is ambiguous",
4547 TREE_TYPE (obj), build_tree_list_vec (*args));
4548 print_z_candidates (location_of (TREE_TYPE (obj)), candidates);
4550 result = error_mark_node;
4552 /* Since cand->fn will be a type, not a function, for a conversion
4553 function, we must be careful not to unconditionally look at
4554 DECL_NAME here. */
4555 else if (TREE_CODE (cand->fn) == FUNCTION_DECL
4556 && DECL_OVERLOADED_OPERATOR_P (cand->fn) == CALL_EXPR)
4557 result = build_over_call (cand, LOOKUP_NORMAL, complain);
4558 else
4560 if (DECL_P (cand->fn))
4561 obj = convert_like_with_context (cand->convs[0], obj, cand->fn,
4562 -1, complain);
4563 else
4564 obj = convert_like (cand->convs[0], obj, complain);
4565 obj = convert_from_reference (obj);
4566 result = cp_build_function_call_vec (obj, args, complain);
4570 /* Free all the conversions we allocated. */
4571 obstack_free (&conversion_obstack, p);
4573 return result;
4576 /* Wrapper for above. */
4578 tree
4579 build_op_call (tree obj, vec<tree, va_gc> **args, tsubst_flags_t complain)
4581 tree ret;
4582 bool subtime = timevar_cond_start (TV_OVERLOAD);
4583 ret = build_op_call_1 (obj, args, complain);
4584 timevar_cond_stop (TV_OVERLOAD, subtime);
4585 return ret;
4588 /* Called by op_error to prepare format strings suitable for the error
4589 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4590 and a suffix (controlled by NTYPES). */
4592 static const char *
4593 op_error_string (const char *errmsg, int ntypes, bool match)
4595 const char *msg;
4597 const char *msgp = concat (match ? G_("ambiguous overload for ")
4598 : G_("no match for "), errmsg, NULL);
4600 if (ntypes == 3)
4601 msg = concat (msgp, G_(" (operand types are %qT, %qT, and %qT)"), NULL);
4602 else if (ntypes == 2)
4603 msg = concat (msgp, G_(" (operand types are %qT and %qT)"), NULL);
4604 else
4605 msg = concat (msgp, G_(" (operand type is %qT)"), NULL);
4607 return msg;
4610 static void
4611 op_error (location_t loc, enum tree_code code, enum tree_code code2,
4612 tree arg1, tree arg2, tree arg3, bool match)
4614 const char *opname;
4616 if (code == MODIFY_EXPR)
4617 opname = assignment_operator_name_info[code2].name;
4618 else
4619 opname = operator_name_info[code].name;
4621 switch (code)
4623 case COND_EXPR:
4624 if (flag_diagnostics_show_caret)
4625 error_at (loc, op_error_string (G_("ternary %<operator?:%>"),
4626 3, match),
4627 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
4628 else
4629 error_at (loc, op_error_string (G_("ternary %<operator?:%> "
4630 "in %<%E ? %E : %E%>"), 3, match),
4631 arg1, arg2, arg3,
4632 TREE_TYPE (arg1), TREE_TYPE (arg2), TREE_TYPE (arg3));
4633 break;
4635 case POSTINCREMENT_EXPR:
4636 case POSTDECREMENT_EXPR:
4637 if (flag_diagnostics_show_caret)
4638 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
4639 opname, TREE_TYPE (arg1));
4640 else
4641 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4642 1, match),
4643 opname, arg1, opname, TREE_TYPE (arg1));
4644 break;
4646 case ARRAY_REF:
4647 if (flag_diagnostics_show_caret)
4648 error_at (loc, op_error_string (G_("%<operator[]%>"), 2, match),
4649 TREE_TYPE (arg1), TREE_TYPE (arg2));
4650 else
4651 error_at (loc, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4652 2, match),
4653 arg1, arg2, TREE_TYPE (arg1), TREE_TYPE (arg2));
4654 break;
4656 case REALPART_EXPR:
4657 case IMAGPART_EXPR:
4658 if (flag_diagnostics_show_caret)
4659 error_at (loc, op_error_string (G_("%qs"), 1, match),
4660 opname, TREE_TYPE (arg1));
4661 else
4662 error_at (loc, op_error_string (G_("%qs in %<%s %E%>"), 1, match),
4663 opname, opname, arg1, TREE_TYPE (arg1));
4664 break;
4666 default:
4667 if (arg2)
4668 if (flag_diagnostics_show_caret)
4669 error_at (loc, op_error_string (G_("%<operator%s%>"), 2, match),
4670 opname, TREE_TYPE (arg1), TREE_TYPE (arg2));
4671 else
4672 error_at (loc, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4673 2, match),
4674 opname, arg1, opname, arg2,
4675 TREE_TYPE (arg1), TREE_TYPE (arg2));
4676 else
4677 if (flag_diagnostics_show_caret)
4678 error_at (loc, op_error_string (G_("%<operator%s%>"), 1, match),
4679 opname, TREE_TYPE (arg1));
4680 else
4681 error_at (loc, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4682 1, match),
4683 opname, opname, arg1, TREE_TYPE (arg1));
4684 break;
4688 /* Return the implicit conversion sequence that could be used to
4689 convert E1 to E2 in [expr.cond]. */
4691 static conversion *
4692 conditional_conversion (tree e1, tree e2, tsubst_flags_t complain)
4694 tree t1 = non_reference (TREE_TYPE (e1));
4695 tree t2 = non_reference (TREE_TYPE (e2));
4696 conversion *conv;
4697 bool good_base;
4699 /* [expr.cond]
4701 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4702 implicitly converted (clause _conv_) to the type "lvalue reference to
4703 T2", subject to the constraint that in the conversion the
4704 reference must bind directly (_dcl.init.ref_) to an lvalue.
4706 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4707 implicitly converted to the type "rvalue reference to T2", subject to
4708 the constraint that the reference must bind directly. */
4709 if (glvalue_p (e2))
4711 tree rtype = cp_build_reference_type (t2, !lvalue_p (e2));
4712 conv = implicit_conversion (rtype,
4715 /*c_cast_p=*/false,
4716 LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND
4717 |LOOKUP_ONLYCONVERTING,
4718 complain);
4719 if (conv && !conv->bad_p)
4720 return conv;
4723 /* If E2 is a prvalue or if neither of the conversions above can be done
4724 and at least one of the operands has (possibly cv-qualified) class
4725 type: */
4726 if (!CLASS_TYPE_P (t1) && !CLASS_TYPE_P (t2))
4727 return NULL;
4729 /* [expr.cond]
4731 If E1 and E2 have class type, and the underlying class types are
4732 the same or one is a base class of the other: E1 can be converted
4733 to match E2 if the class of T2 is the same type as, or a base
4734 class of, the class of T1, and the cv-qualification of T2 is the
4735 same cv-qualification as, or a greater cv-qualification than, the
4736 cv-qualification of T1. If the conversion is applied, E1 is
4737 changed to an rvalue of type T2 that still refers to the original
4738 source class object (or the appropriate subobject thereof). */
4739 if (CLASS_TYPE_P (t1) && CLASS_TYPE_P (t2)
4740 && ((good_base = DERIVED_FROM_P (t2, t1)) || DERIVED_FROM_P (t1, t2)))
4742 if (good_base && at_least_as_qualified_p (t2, t1))
4744 conv = build_identity_conv (t1, e1);
4745 if (!same_type_p (TYPE_MAIN_VARIANT (t1),
4746 TYPE_MAIN_VARIANT (t2)))
4747 conv = build_conv (ck_base, t2, conv);
4748 else
4749 conv = build_conv (ck_rvalue, t2, conv);
4750 return conv;
4752 else
4753 return NULL;
4755 else
4756 /* [expr.cond]
4758 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4759 converted to the type that expression E2 would have if E2 were
4760 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4761 return implicit_conversion (t2, t1, e1, /*c_cast_p=*/false,
4762 LOOKUP_IMPLICIT, complain);
4765 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4766 arguments to the conditional expression. */
4768 static tree
4769 build_conditional_expr_1 (location_t loc, tree arg1, tree arg2, tree arg3,
4770 tsubst_flags_t complain)
4772 tree arg2_type;
4773 tree arg3_type;
4774 tree result = NULL_TREE;
4775 tree result_type = NULL_TREE;
4776 bool is_lvalue = true;
4777 struct z_candidate *candidates = 0;
4778 struct z_candidate *cand;
4779 void *p;
4780 tree orig_arg2, orig_arg3;
4782 /* As a G++ extension, the second argument to the conditional can be
4783 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4784 c'.) If the second operand is omitted, make sure it is
4785 calculated only once. */
4786 if (!arg2)
4788 if (complain & tf_error)
4789 pedwarn (loc, OPT_Wpedantic,
4790 "ISO C++ forbids omitting the middle term of a ?: expression");
4792 if ((complain & tf_warning) && !truth_value_p (TREE_CODE (arg1)))
4793 warn_for_omitted_condop (loc, arg1);
4795 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4796 if (lvalue_p (arg1))
4797 arg2 = arg1 = cp_stabilize_reference (arg1);
4798 else
4799 arg2 = arg1 = save_expr (arg1);
4802 /* If something has already gone wrong, just pass that fact up the
4803 tree. */
4804 if (error_operand_p (arg1)
4805 || error_operand_p (arg2)
4806 || error_operand_p (arg3))
4807 return error_mark_node;
4809 orig_arg2 = arg2;
4810 orig_arg3 = arg3;
4812 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1)))
4814 tree arg1_type = TREE_TYPE (arg1);
4816 /* If arg1 is another cond_expr choosing between -1 and 0,
4817 then we can use its comparison. It may help to avoid
4818 additional comparison, produce more accurate diagnostics
4819 and enables folding. */
4820 if (TREE_CODE (arg1) == VEC_COND_EXPR
4821 && integer_minus_onep (TREE_OPERAND (arg1, 1))
4822 && integer_zerop (TREE_OPERAND (arg1, 2)))
4823 arg1 = TREE_OPERAND (arg1, 0);
4825 arg1 = force_rvalue (arg1, complain);
4826 arg2 = force_rvalue (arg2, complain);
4827 arg3 = force_rvalue (arg3, complain);
4829 /* force_rvalue can return error_mark on valid arguments. */
4830 if (error_operand_p (arg1)
4831 || error_operand_p (arg2)
4832 || error_operand_p (arg3))
4833 return error_mark_node;
4835 arg2_type = TREE_TYPE (arg2);
4836 arg3_type = TREE_TYPE (arg3);
4838 if (!VECTOR_TYPE_P (arg2_type)
4839 && !VECTOR_TYPE_P (arg3_type))
4841 /* Rely on the error messages of the scalar version. */
4842 tree scal = build_conditional_expr_1 (loc, integer_one_node,
4843 orig_arg2, orig_arg3, complain);
4844 if (scal == error_mark_node)
4845 return error_mark_node;
4846 tree stype = TREE_TYPE (scal);
4847 tree ctype = TREE_TYPE (arg1_type);
4848 if (TYPE_SIZE (stype) != TYPE_SIZE (ctype)
4849 || (!INTEGRAL_TYPE_P (stype) && !SCALAR_FLOAT_TYPE_P (stype)))
4851 if (complain & tf_error)
4852 error_at (loc, "inferred scalar type %qT is not an integer or "
4853 "floating point type of the same size as %qT", stype,
4854 COMPARISON_CLASS_P (arg1)
4855 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1, 0)))
4856 : ctype);
4857 return error_mark_node;
4860 tree vtype = build_opaque_vector_type (stype,
4861 TYPE_VECTOR_SUBPARTS (arg1_type));
4862 /* We could pass complain & tf_warning to unsafe_conversion_p,
4863 but the warnings (like Wsign-conversion) have already been
4864 given by the scalar build_conditional_expr_1. We still check
4865 unsafe_conversion_p to forbid truncating long long -> float. */
4866 if (unsafe_conversion_p (loc, stype, arg2, NULL_TREE, false))
4868 if (complain & tf_error)
4869 error_at (loc, "conversion of scalar %qH to vector %qI "
4870 "involves truncation", arg2_type, vtype);
4871 return error_mark_node;
4873 if (unsafe_conversion_p (loc, stype, arg3, NULL_TREE, false))
4875 if (complain & tf_error)
4876 error_at (loc, "conversion of scalar %qH to vector %qI "
4877 "involves truncation", arg3_type, vtype);
4878 return error_mark_node;
4881 arg2 = cp_convert (stype, arg2, complain);
4882 arg2 = save_expr (arg2);
4883 arg2 = build_vector_from_val (vtype, arg2);
4884 arg2_type = vtype;
4885 arg3 = cp_convert (stype, arg3, complain);
4886 arg3 = save_expr (arg3);
4887 arg3 = build_vector_from_val (vtype, arg3);
4888 arg3_type = vtype;
4891 if (VECTOR_TYPE_P (arg2_type) != VECTOR_TYPE_P (arg3_type))
4893 enum stv_conv convert_flag =
4894 scalar_to_vector (loc, VEC_COND_EXPR, arg2, arg3,
4895 complain & tf_error);
4897 switch (convert_flag)
4899 case stv_error:
4900 return error_mark_node;
4901 case stv_firstarg:
4903 arg2 = save_expr (arg2);
4904 arg2 = convert (TREE_TYPE (arg3_type), arg2);
4905 arg2 = build_vector_from_val (arg3_type, arg2);
4906 arg2_type = TREE_TYPE (arg2);
4907 break;
4909 case stv_secondarg:
4911 arg3 = save_expr (arg3);
4912 arg3 = convert (TREE_TYPE (arg2_type), arg3);
4913 arg3 = build_vector_from_val (arg2_type, arg3);
4914 arg3_type = TREE_TYPE (arg3);
4915 break;
4917 default:
4918 break;
4922 if (!same_type_p (arg2_type, arg3_type)
4923 || TYPE_VECTOR_SUBPARTS (arg1_type)
4924 != TYPE_VECTOR_SUBPARTS (arg2_type)
4925 || TYPE_SIZE (arg1_type) != TYPE_SIZE (arg2_type))
4927 if (complain & tf_error)
4928 error_at (loc,
4929 "incompatible vector types in conditional expression: "
4930 "%qT, %qT and %qT", TREE_TYPE (arg1),
4931 TREE_TYPE (orig_arg2), TREE_TYPE (orig_arg3));
4932 return error_mark_node;
4935 if (!COMPARISON_CLASS_P (arg1))
4937 tree cmp_type = build_same_sized_truth_vector_type (arg1_type);
4938 arg1 = build2 (NE_EXPR, cmp_type, arg1, build_zero_cst (arg1_type));
4940 return build3_loc (loc, VEC_COND_EXPR, arg2_type, arg1, arg2, arg3);
4943 /* [expr.cond]
4945 The first expression is implicitly converted to bool (clause
4946 _conv_). */
4947 arg1 = perform_implicit_conversion_flags (boolean_type_node, arg1, complain,
4948 LOOKUP_NORMAL);
4949 if (error_operand_p (arg1))
4950 return error_mark_node;
4952 /* [expr.cond]
4954 If either the second or the third operand has type (possibly
4955 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4956 array-to-pointer (_conv.array_), and function-to-pointer
4957 (_conv.func_) standard conversions are performed on the second
4958 and third operands. */
4959 arg2_type = unlowered_expr_type (arg2);
4960 arg3_type = unlowered_expr_type (arg3);
4961 if (VOID_TYPE_P (arg2_type) || VOID_TYPE_P (arg3_type))
4963 /* Do the conversions. We don't these for `void' type arguments
4964 since it can't have any effect and since decay_conversion
4965 does not handle that case gracefully. */
4966 if (!VOID_TYPE_P (arg2_type))
4967 arg2 = decay_conversion (arg2, complain);
4968 if (!VOID_TYPE_P (arg3_type))
4969 arg3 = decay_conversion (arg3, complain);
4970 arg2_type = TREE_TYPE (arg2);
4971 arg3_type = TREE_TYPE (arg3);
4973 /* [expr.cond]
4975 One of the following shall hold:
4977 --The second or the third operand (but not both) is a
4978 throw-expression (_except.throw_); the result is of the
4979 type of the other and is an rvalue.
4981 --Both the second and the third operands have type void; the
4982 result is of type void and is an rvalue.
4984 We must avoid calling force_rvalue for expressions of type
4985 "void" because it will complain that their value is being
4986 used. */
4987 if (TREE_CODE (arg2) == THROW_EXPR
4988 && TREE_CODE (arg3) != THROW_EXPR)
4990 if (!VOID_TYPE_P (arg3_type))
4992 arg3 = force_rvalue (arg3, complain);
4993 if (arg3 == error_mark_node)
4994 return error_mark_node;
4996 arg3_type = TREE_TYPE (arg3);
4997 result_type = arg3_type;
4999 else if (TREE_CODE (arg2) != THROW_EXPR
5000 && TREE_CODE (arg3) == THROW_EXPR)
5002 if (!VOID_TYPE_P (arg2_type))
5004 arg2 = force_rvalue (arg2, complain);
5005 if (arg2 == error_mark_node)
5006 return error_mark_node;
5008 arg2_type = TREE_TYPE (arg2);
5009 result_type = arg2_type;
5011 else if (VOID_TYPE_P (arg2_type) && VOID_TYPE_P (arg3_type))
5012 result_type = void_type_node;
5013 else
5015 if (complain & tf_error)
5017 if (VOID_TYPE_P (arg2_type))
5018 error_at (EXPR_LOC_OR_LOC (arg3, loc),
5019 "second operand to the conditional operator "
5020 "is of type %<void%>, but the third operand is "
5021 "neither a throw-expression nor of type %<void%>");
5022 else
5023 error_at (EXPR_LOC_OR_LOC (arg2, loc),
5024 "third operand to the conditional operator "
5025 "is of type %<void%>, but the second operand is "
5026 "neither a throw-expression nor of type %<void%>");
5028 return error_mark_node;
5031 is_lvalue = false;
5032 goto valid_operands;
5034 /* [expr.cond]
5036 Otherwise, if the second and third operand have different types,
5037 and either has (possibly cv-qualified) class type, or if both are
5038 glvalues of the same value category and the same type except for
5039 cv-qualification, an attempt is made to convert each of those operands
5040 to the type of the other. */
5041 else if (!same_type_p (arg2_type, arg3_type)
5042 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)
5043 || (same_type_ignoring_top_level_qualifiers_p (arg2_type,
5044 arg3_type)
5045 && glvalue_p (arg2) && glvalue_p (arg3)
5046 && lvalue_p (arg2) == lvalue_p (arg3))))
5048 conversion *conv2;
5049 conversion *conv3;
5050 bool converted = false;
5052 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5053 p = conversion_obstack_alloc (0);
5055 conv2 = conditional_conversion (arg2, arg3, complain);
5056 conv3 = conditional_conversion (arg3, arg2, complain);
5058 /* [expr.cond]
5060 If both can be converted, or one can be converted but the
5061 conversion is ambiguous, the program is ill-formed. If
5062 neither can be converted, the operands are left unchanged and
5063 further checking is performed as described below. If exactly
5064 one conversion is possible, that conversion is applied to the
5065 chosen operand and the converted operand is used in place of
5066 the original operand for the remainder of this section. */
5067 if ((conv2 && !conv2->bad_p
5068 && conv3 && !conv3->bad_p)
5069 || (conv2 && conv2->kind == ck_ambig)
5070 || (conv3 && conv3->kind == ck_ambig))
5072 if (complain & tf_error)
5074 error_at (loc, "operands to ?: have different types %qT and %qT",
5075 arg2_type, arg3_type);
5076 if (conv2 && !conv2->bad_p && conv3 && !conv3->bad_p)
5077 inform (loc, " and each type can be converted to the other");
5078 else if (conv2 && conv2->kind == ck_ambig)
5079 convert_like (conv2, arg2, complain);
5080 else
5081 convert_like (conv3, arg3, complain);
5083 result = error_mark_node;
5085 else if (conv2 && !conv2->bad_p)
5087 arg2 = convert_like (conv2, arg2, complain);
5088 arg2 = convert_from_reference (arg2);
5089 arg2_type = TREE_TYPE (arg2);
5090 /* Even if CONV2 is a valid conversion, the result of the
5091 conversion may be invalid. For example, if ARG3 has type
5092 "volatile X", and X does not have a copy constructor
5093 accepting a "volatile X&", then even if ARG2 can be
5094 converted to X, the conversion will fail. */
5095 if (error_operand_p (arg2))
5096 result = error_mark_node;
5097 converted = true;
5099 else if (conv3 && !conv3->bad_p)
5101 arg3 = convert_like (conv3, arg3, complain);
5102 arg3 = convert_from_reference (arg3);
5103 arg3_type = TREE_TYPE (arg3);
5104 if (error_operand_p (arg3))
5105 result = error_mark_node;
5106 converted = true;
5109 /* Free all the conversions we allocated. */
5110 obstack_free (&conversion_obstack, p);
5112 if (result)
5113 return result;
5115 /* If, after the conversion, both operands have class type,
5116 treat the cv-qualification of both operands as if it were the
5117 union of the cv-qualification of the operands.
5119 The standard is not clear about what to do in this
5120 circumstance. For example, if the first operand has type
5121 "const X" and the second operand has a user-defined
5122 conversion to "volatile X", what is the type of the second
5123 operand after this step? Making it be "const X" (matching
5124 the first operand) seems wrong, as that discards the
5125 qualification without actually performing a copy. Leaving it
5126 as "volatile X" seems wrong as that will result in the
5127 conditional expression failing altogether, even though,
5128 according to this step, the one operand could be converted to
5129 the type of the other. */
5130 if (converted
5131 && CLASS_TYPE_P (arg2_type)
5132 && cp_type_quals (arg2_type) != cp_type_quals (arg3_type))
5133 arg2_type = arg3_type =
5134 cp_build_qualified_type (arg2_type,
5135 cp_type_quals (arg2_type)
5136 | cp_type_quals (arg3_type));
5139 /* [expr.cond]
5141 If the second and third operands are glvalues of the same value
5142 category and have the same type, the result is of that type and
5143 value category. */
5144 if (((lvalue_p (arg2) && lvalue_p (arg3))
5145 || (xvalue_p (arg2) && xvalue_p (arg3)))
5146 && same_type_p (arg2_type, arg3_type))
5148 result_type = arg2_type;
5149 arg2 = mark_lvalue_use (arg2);
5150 arg3 = mark_lvalue_use (arg3);
5151 goto valid_operands;
5154 /* [expr.cond]
5156 Otherwise, the result is an rvalue. If the second and third
5157 operand do not have the same type, and either has (possibly
5158 cv-qualified) class type, overload resolution is used to
5159 determine the conversions (if any) to be applied to the operands
5160 (_over.match.oper_, _over.built_). */
5161 is_lvalue = false;
5162 if (!same_type_p (arg2_type, arg3_type)
5163 && (CLASS_TYPE_P (arg2_type) || CLASS_TYPE_P (arg3_type)))
5165 tree args[3];
5166 conversion *conv;
5167 bool any_viable_p;
5169 /* Rearrange the arguments so that add_builtin_candidate only has
5170 to know about two args. In build_builtin_candidate, the
5171 arguments are unscrambled. */
5172 args[0] = arg2;
5173 args[1] = arg3;
5174 args[2] = arg1;
5175 add_builtin_candidates (&candidates,
5176 COND_EXPR,
5177 NOP_EXPR,
5178 cp_operator_id (COND_EXPR),
5179 args,
5180 LOOKUP_NORMAL, complain);
5182 /* [expr.cond]
5184 If the overload resolution fails, the program is
5185 ill-formed. */
5186 candidates = splice_viable (candidates, false, &any_viable_p);
5187 if (!any_viable_p)
5189 if (complain & tf_error)
5190 error_at (loc, "operands to ?: have different types %qT and %qT",
5191 arg2_type, arg3_type);
5192 return error_mark_node;
5194 cand = tourney (candidates, complain);
5195 if (!cand)
5197 if (complain & tf_error)
5199 op_error (loc, COND_EXPR, NOP_EXPR, arg1, arg2, arg3, FALSE);
5200 print_z_candidates (loc, candidates);
5202 return error_mark_node;
5205 /* [expr.cond]
5207 Otherwise, the conversions thus determined are applied, and
5208 the converted operands are used in place of the original
5209 operands for the remainder of this section. */
5210 conv = cand->convs[0];
5211 arg1 = convert_like (conv, arg1, complain);
5212 conv = cand->convs[1];
5213 arg2 = convert_like (conv, arg2, complain);
5214 arg2_type = TREE_TYPE (arg2);
5215 conv = cand->convs[2];
5216 arg3 = convert_like (conv, arg3, complain);
5217 arg3_type = TREE_TYPE (arg3);
5220 /* [expr.cond]
5222 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5223 and function-to-pointer (_conv.func_) standard conversions are
5224 performed on the second and third operands.
5226 We need to force the lvalue-to-rvalue conversion here for class types,
5227 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5228 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5229 regions. */
5231 arg2 = force_rvalue (arg2, complain);
5232 if (!CLASS_TYPE_P (arg2_type))
5233 arg2_type = TREE_TYPE (arg2);
5235 arg3 = force_rvalue (arg3, complain);
5236 if (!CLASS_TYPE_P (arg3_type))
5237 arg3_type = TREE_TYPE (arg3);
5239 if (arg2 == error_mark_node || arg3 == error_mark_node)
5240 return error_mark_node;
5242 /* [expr.cond]
5244 After those conversions, one of the following shall hold:
5246 --The second and third operands have the same type; the result is of
5247 that type. */
5248 if (same_type_p (arg2_type, arg3_type))
5249 result_type = arg2_type;
5250 /* [expr.cond]
5252 --The second and third operands have arithmetic or enumeration
5253 type; the usual arithmetic conversions are performed to bring
5254 them to a common type, and the result is of that type. */
5255 else if ((ARITHMETIC_TYPE_P (arg2_type)
5256 || UNSCOPED_ENUM_P (arg2_type))
5257 && (ARITHMETIC_TYPE_P (arg3_type)
5258 || UNSCOPED_ENUM_P (arg3_type)))
5260 /* In this case, there is always a common type. */
5261 result_type = type_after_usual_arithmetic_conversions (arg2_type,
5262 arg3_type);
5263 if (complain & tf_warning)
5264 do_warn_double_promotion (result_type, arg2_type, arg3_type,
5265 "implicit conversion from %qH to %qI to "
5266 "match other result of conditional",
5267 loc);
5269 if (TREE_CODE (arg2_type) == ENUMERAL_TYPE
5270 && TREE_CODE (arg3_type) == ENUMERAL_TYPE)
5272 if (TREE_CODE (orig_arg2) == CONST_DECL
5273 && TREE_CODE (orig_arg3) == CONST_DECL
5274 && DECL_CONTEXT (orig_arg2) == DECL_CONTEXT (orig_arg3))
5275 /* Two enumerators from the same enumeration can have different
5276 types when the enumeration is still being defined. */;
5277 else if (complain & tf_warning)
5278 warning_at (loc, OPT_Wenum_compare, "enumeral mismatch in "
5279 "conditional expression: %qT vs %qT",
5280 arg2_type, arg3_type);
5282 else if (extra_warnings
5283 && ((TREE_CODE (arg2_type) == ENUMERAL_TYPE
5284 && !same_type_p (arg3_type, type_promotes_to (arg2_type)))
5285 || (TREE_CODE (arg3_type) == ENUMERAL_TYPE
5286 && !same_type_p (arg2_type,
5287 type_promotes_to (arg3_type)))))
5289 if (complain & tf_warning)
5290 warning_at (loc, OPT_Wextra, "enumeral and non-enumeral type in "
5291 "conditional expression");
5294 arg2 = perform_implicit_conversion (result_type, arg2, complain);
5295 arg3 = perform_implicit_conversion (result_type, arg3, complain);
5297 /* [expr.cond]
5299 --The second and third operands have pointer type, or one has
5300 pointer type and the other is a null pointer constant; pointer
5301 conversions (_conv.ptr_) and qualification conversions
5302 (_conv.qual_) are performed to bring them to their composite
5303 pointer type (_expr.rel_). The result is of the composite
5304 pointer type.
5306 --The second and third operands have pointer to member type, or
5307 one has pointer to member type and the other is a null pointer
5308 constant; pointer to member conversions (_conv.mem_) and
5309 qualification conversions (_conv.qual_) are performed to bring
5310 them to a common type, whose cv-qualification shall match the
5311 cv-qualification of either the second or the third operand.
5312 The result is of the common type. */
5313 else if ((null_ptr_cst_p (arg2)
5314 && TYPE_PTR_OR_PTRMEM_P (arg3_type))
5315 || (null_ptr_cst_p (arg3)
5316 && TYPE_PTR_OR_PTRMEM_P (arg2_type))
5317 || (TYPE_PTR_P (arg2_type) && TYPE_PTR_P (arg3_type))
5318 || (TYPE_PTRDATAMEM_P (arg2_type) && TYPE_PTRDATAMEM_P (arg3_type))
5319 || (TYPE_PTRMEMFUNC_P (arg2_type) && TYPE_PTRMEMFUNC_P (arg3_type)))
5321 result_type = composite_pointer_type (arg2_type, arg3_type, arg2,
5322 arg3, CPO_CONDITIONAL_EXPR,
5323 complain);
5324 if (result_type == error_mark_node)
5325 return error_mark_node;
5326 arg2 = perform_implicit_conversion (result_type, arg2, complain);
5327 arg3 = perform_implicit_conversion (result_type, arg3, complain);
5330 if (!result_type)
5332 if (complain & tf_error)
5333 error_at (loc, "operands to ?: have different types %qT and %qT",
5334 arg2_type, arg3_type);
5335 return error_mark_node;
5338 if (arg2 == error_mark_node || arg3 == error_mark_node)
5339 return error_mark_node;
5341 valid_operands:
5342 result = build3_loc (loc, COND_EXPR, result_type, arg1, arg2, arg3);
5344 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5345 warn here, because the COND_EXPR will be turned into ARG2. */
5346 if (warn_duplicated_branches
5347 && (arg2 == arg3 || operand_equal_p (arg2, arg3, 0)))
5348 warning_at (EXPR_LOCATION (result), OPT_Wduplicated_branches,
5349 "this condition has identical branches");
5351 /* We can't use result_type below, as fold might have returned a
5352 throw_expr. */
5354 if (!is_lvalue)
5356 /* Expand both sides into the same slot, hopefully the target of
5357 the ?: expression. We used to check for TARGET_EXPRs here,
5358 but now we sometimes wrap them in NOP_EXPRs so the test would
5359 fail. */
5360 if (CLASS_TYPE_P (TREE_TYPE (result)))
5361 result = get_target_expr_sfinae (result, complain);
5362 /* If this expression is an rvalue, but might be mistaken for an
5363 lvalue, we must add a NON_LVALUE_EXPR. */
5364 result = rvalue (result);
5366 else
5367 result = force_paren_expr (result);
5369 return result;
5372 /* Wrapper for above. */
5374 tree
5375 build_conditional_expr (location_t loc, tree arg1, tree arg2, tree arg3,
5376 tsubst_flags_t complain)
5378 tree ret;
5379 bool subtime = timevar_cond_start (TV_OVERLOAD);
5380 ret = build_conditional_expr_1 (loc, arg1, arg2, arg3, complain);
5381 timevar_cond_stop (TV_OVERLOAD, subtime);
5382 return ret;
5385 /* OPERAND is an operand to an expression. Perform necessary steps
5386 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5387 returned. */
5389 static tree
5390 prep_operand (tree operand)
5392 if (operand)
5394 if (CLASS_TYPE_P (TREE_TYPE (operand))
5395 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand)))
5396 /* Make sure the template type is instantiated now. */
5397 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand)));
5400 return operand;
5403 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5404 OVERLOAD) to the CANDIDATES, returning an updated list of
5405 CANDIDATES. The ARGS are the arguments provided to the call;
5406 if FIRST_ARG is non-null it is the implicit object argument,
5407 otherwise the first element of ARGS is used if needed. The
5408 EXPLICIT_TARGS are explicit template arguments provided.
5409 TEMPLATE_ONLY is true if only template functions should be
5410 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5411 add_function_candidate. */
5413 static void
5414 add_candidates (tree fns, tree first_arg, const vec<tree, va_gc> *args,
5415 tree return_type,
5416 tree explicit_targs, bool template_only,
5417 tree conversion_path, tree access_path,
5418 int flags,
5419 struct z_candidate **candidates,
5420 tsubst_flags_t complain)
5422 tree ctype;
5423 const vec<tree, va_gc> *non_static_args;
5424 bool check_list_ctor = false;
5425 bool check_converting = false;
5426 unification_kind_t strict;
5428 if (!fns)
5429 return;
5431 /* Precalculate special handling of constructors and conversion ops. */
5432 tree fn = OVL_FIRST (fns);
5433 if (DECL_CONV_FN_P (fn))
5435 check_list_ctor = false;
5436 check_converting = (flags & LOOKUP_ONLYCONVERTING) != 0;
5437 if (flags & LOOKUP_NO_CONVERSION)
5438 /* We're doing return_type(x). */
5439 strict = DEDUCE_CONV;
5440 else
5441 /* We're doing x.operator return_type(). */
5442 strict = DEDUCE_EXACT;
5443 /* [over.match.funcs] For conversion functions, the function
5444 is considered to be a member of the class of the implicit
5445 object argument for the purpose of defining the type of
5446 the implicit object parameter. */
5447 ctype = TYPE_MAIN_VARIANT (TREE_TYPE (first_arg));
5449 else
5451 if (DECL_CONSTRUCTOR_P (fn))
5453 check_list_ctor = (flags & LOOKUP_LIST_ONLY) != 0;
5454 /* For list-initialization we consider explicit constructors
5455 and complain if one is chosen. */
5456 check_converting
5457 = ((flags & (LOOKUP_ONLYCONVERTING|LOOKUP_LIST_INIT_CTOR))
5458 == LOOKUP_ONLYCONVERTING);
5460 strict = DEDUCE_CALL;
5461 ctype = conversion_path ? BINFO_TYPE (conversion_path) : NULL_TREE;
5464 if (first_arg)
5465 non_static_args = args;
5466 else
5467 /* Delay creating the implicit this parameter until it is needed. */
5468 non_static_args = NULL;
5470 for (lkp_iterator iter (fns); iter; ++iter)
5472 fn = *iter;
5474 if (check_converting && DECL_NONCONVERTING_P (fn))
5475 continue;
5476 if (check_list_ctor && !is_list_ctor (fn))
5477 continue;
5479 tree fn_first_arg = NULL_TREE;
5480 const vec<tree, va_gc> *fn_args = args;
5482 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
5484 /* Figure out where the object arg comes from. If this
5485 function is a non-static member and we didn't get an
5486 implicit object argument, move it out of args. */
5487 if (first_arg == NULL_TREE)
5489 unsigned int ix;
5490 tree arg;
5491 vec<tree, va_gc> *tempvec;
5492 vec_alloc (tempvec, args->length () - 1);
5493 for (ix = 1; args->iterate (ix, &arg); ++ix)
5494 tempvec->quick_push (arg);
5495 non_static_args = tempvec;
5496 first_arg = (*args)[0];
5499 fn_first_arg = first_arg;
5500 fn_args = non_static_args;
5503 if (TREE_CODE (fn) == TEMPLATE_DECL)
5504 add_template_candidate (candidates,
5506 ctype,
5507 explicit_targs,
5508 fn_first_arg,
5509 fn_args,
5510 return_type,
5511 access_path,
5512 conversion_path,
5513 flags,
5514 strict,
5515 complain);
5516 else if (!template_only)
5517 add_function_candidate (candidates,
5519 ctype,
5520 fn_first_arg,
5521 fn_args,
5522 access_path,
5523 conversion_path,
5524 flags,
5525 complain);
5529 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5530 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5532 static int
5533 op_is_ordered (tree_code code)
5535 switch (code)
5537 // 5. b @= a
5538 case MODIFY_EXPR:
5539 return (flag_strong_eval_order > 1 ? -1 : 0);
5541 // 6. a[b]
5542 case ARRAY_REF:
5543 return (flag_strong_eval_order > 1 ? 1 : 0);
5545 // 1. a.b
5546 // Not overloadable (yet).
5547 // 2. a->b
5548 // Only one argument.
5549 // 3. a->*b
5550 case MEMBER_REF:
5551 // 7. a << b
5552 case LSHIFT_EXPR:
5553 // 8. a >> b
5554 case RSHIFT_EXPR:
5555 return (flag_strong_eval_order ? 1 : 0);
5557 default:
5558 return 0;
5562 static tree
5563 build_new_op_1 (location_t loc, enum tree_code code, int flags, tree arg1,
5564 tree arg2, tree arg3, tree *overload, tsubst_flags_t complain)
5566 struct z_candidate *candidates = 0, *cand;
5567 vec<tree, va_gc> *arglist;
5568 tree fnname;
5569 tree args[3];
5570 tree result = NULL_TREE;
5571 bool result_valid_p = false;
5572 enum tree_code code2 = NOP_EXPR;
5573 enum tree_code code_orig_arg1 = ERROR_MARK;
5574 enum tree_code code_orig_arg2 = ERROR_MARK;
5575 conversion *conv;
5576 void *p;
5577 bool strict_p;
5578 bool any_viable_p;
5580 if (error_operand_p (arg1)
5581 || error_operand_p (arg2)
5582 || error_operand_p (arg3))
5583 return error_mark_node;
5585 if (code == MODIFY_EXPR)
5587 code2 = TREE_CODE (arg3);
5588 arg3 = NULL_TREE;
5589 fnname = cp_assignment_operator_id (code2);
5591 else
5592 fnname = cp_operator_id (code);
5594 arg1 = prep_operand (arg1);
5596 bool memonly = false;
5597 switch (code)
5599 case NEW_EXPR:
5600 case VEC_NEW_EXPR:
5601 case VEC_DELETE_EXPR:
5602 case DELETE_EXPR:
5603 /* Use build_op_new_call and build_op_delete_call instead. */
5604 gcc_unreachable ();
5606 case CALL_EXPR:
5607 /* Use build_op_call instead. */
5608 gcc_unreachable ();
5610 case TRUTH_ORIF_EXPR:
5611 case TRUTH_ANDIF_EXPR:
5612 case TRUTH_AND_EXPR:
5613 case TRUTH_OR_EXPR:
5614 /* These are saved for the sake of warn_logical_operator. */
5615 code_orig_arg1 = TREE_CODE (arg1);
5616 code_orig_arg2 = TREE_CODE (arg2);
5617 break;
5618 case GT_EXPR:
5619 case LT_EXPR:
5620 case GE_EXPR:
5621 case LE_EXPR:
5622 case EQ_EXPR:
5623 case NE_EXPR:
5624 /* These are saved for the sake of maybe_warn_bool_compare. */
5625 code_orig_arg1 = TREE_CODE (TREE_TYPE (arg1));
5626 code_orig_arg2 = TREE_CODE (TREE_TYPE (arg2));
5627 break;
5629 /* =, ->, [], () must be non-static member functions. */
5630 case MODIFY_EXPR:
5631 if (code2 != NOP_EXPR)
5632 break;
5633 /* FALLTHRU */
5634 case COMPONENT_REF:
5635 case ARRAY_REF:
5636 memonly = true;
5637 break;
5639 default:
5640 break;
5643 arg2 = prep_operand (arg2);
5644 arg3 = prep_operand (arg3);
5646 if (code == COND_EXPR)
5647 /* Use build_conditional_expr instead. */
5648 gcc_unreachable ();
5649 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1))
5650 && (! arg2 || ! OVERLOAD_TYPE_P (TREE_TYPE (arg2))))
5651 goto builtin;
5653 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
5654 arg2 = integer_zero_node;
5656 vec_alloc (arglist, 3);
5657 arglist->quick_push (arg1);
5658 if (arg2 != NULL_TREE)
5659 arglist->quick_push (arg2);
5660 if (arg3 != NULL_TREE)
5661 arglist->quick_push (arg3);
5663 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5664 p = conversion_obstack_alloc (0);
5666 /* Add namespace-scope operators to the list of functions to
5667 consider. */
5668 if (!memonly)
5670 tree fns = lookup_name_real (fnname, 0, 1, /*block_p=*/true, 0, 0);
5671 fns = lookup_arg_dependent (fnname, fns, arglist);
5672 add_candidates (fns, NULL_TREE, arglist, NULL_TREE,
5673 NULL_TREE, false, NULL_TREE, NULL_TREE,
5674 flags, &candidates, complain);
5677 args[0] = arg1;
5678 args[1] = arg2;
5679 args[2] = NULL_TREE;
5681 /* Add class-member operators to the candidate set. */
5682 if (CLASS_TYPE_P (TREE_TYPE (arg1)))
5684 tree fns;
5686 fns = lookup_fnfields (TREE_TYPE (arg1), fnname, 1);
5687 if (fns == error_mark_node)
5689 result = error_mark_node;
5690 goto user_defined_result_ready;
5692 if (fns)
5693 add_candidates (BASELINK_FUNCTIONS (fns),
5694 NULL_TREE, arglist, NULL_TREE,
5695 NULL_TREE, false,
5696 BASELINK_BINFO (fns),
5697 BASELINK_ACCESS_BINFO (fns),
5698 flags, &candidates, complain);
5700 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5701 only non-member functions that have type T1 or reference to
5702 cv-qualified-opt T1 for the first argument, if the first argument
5703 has an enumeration type, or T2 or reference to cv-qualified-opt
5704 T2 for the second argument, if the second argument has an
5705 enumeration type. Filter out those that don't match. */
5706 else if (! arg2 || ! CLASS_TYPE_P (TREE_TYPE (arg2)))
5708 struct z_candidate **candp, **next;
5710 for (candp = &candidates; *candp; candp = next)
5712 tree parmlist, parmtype;
5713 int i, nargs = (arg2 ? 2 : 1);
5715 cand = *candp;
5716 next = &cand->next;
5718 parmlist = TYPE_ARG_TYPES (TREE_TYPE (cand->fn));
5720 for (i = 0; i < nargs; ++i)
5722 parmtype = TREE_VALUE (parmlist);
5724 if (TREE_CODE (parmtype) == REFERENCE_TYPE)
5725 parmtype = TREE_TYPE (parmtype);
5726 if (TREE_CODE (TREE_TYPE (args[i])) == ENUMERAL_TYPE
5727 && (same_type_ignoring_top_level_qualifiers_p
5728 (TREE_TYPE (args[i]), parmtype)))
5729 break;
5731 parmlist = TREE_CHAIN (parmlist);
5734 /* No argument has an appropriate type, so remove this
5735 candidate function from the list. */
5736 if (i == nargs)
5738 *candp = cand->next;
5739 next = candp;
5744 add_builtin_candidates (&candidates, code, code2, fnname, args,
5745 flags, complain);
5747 switch (code)
5749 case COMPOUND_EXPR:
5750 case ADDR_EXPR:
5751 /* For these, the built-in candidates set is empty
5752 [over.match.oper]/3. We don't want non-strict matches
5753 because exact matches are always possible with built-in
5754 operators. The built-in candidate set for COMPONENT_REF
5755 would be empty too, but since there are no such built-in
5756 operators, we accept non-strict matches for them. */
5757 strict_p = true;
5758 break;
5760 default:
5761 strict_p = false;
5762 break;
5765 candidates = splice_viable (candidates, strict_p, &any_viable_p);
5766 if (!any_viable_p)
5768 switch (code)
5770 case POSTINCREMENT_EXPR:
5771 case POSTDECREMENT_EXPR:
5772 /* Don't try anything fancy if we're not allowed to produce
5773 errors. */
5774 if (!(complain & tf_error))
5775 return error_mark_node;
5777 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5778 distinguish between prefix and postfix ++ and
5779 operator++() was used for both, so we allow this with
5780 -fpermissive. */
5781 else
5783 const char *msg = (flag_permissive)
5784 ? G_("no %<%D(int)%> declared for postfix %qs,"
5785 " trying prefix operator instead")
5786 : G_("no %<%D(int)%> declared for postfix %qs");
5787 permerror (loc, msg, fnname, operator_name_info[code].name);
5790 if (!flag_permissive)
5791 return error_mark_node;
5793 if (code == POSTINCREMENT_EXPR)
5794 code = PREINCREMENT_EXPR;
5795 else
5796 code = PREDECREMENT_EXPR;
5797 result = build_new_op_1 (loc, code, flags, arg1, NULL_TREE,
5798 NULL_TREE, overload, complain);
5799 break;
5801 /* The caller will deal with these. */
5802 case ADDR_EXPR:
5803 case COMPOUND_EXPR:
5804 case COMPONENT_REF:
5805 result = NULL_TREE;
5806 result_valid_p = true;
5807 break;
5809 default:
5810 if (complain & tf_error)
5812 /* If one of the arguments of the operator represents
5813 an invalid use of member function pointer, try to report
5814 a meaningful error ... */
5815 if (invalid_nonstatic_memfn_p (loc, arg1, tf_error)
5816 || invalid_nonstatic_memfn_p (loc, arg2, tf_error)
5817 || invalid_nonstatic_memfn_p (loc, arg3, tf_error))
5818 /* We displayed the error message. */;
5819 else
5821 /* ... Otherwise, report the more generic
5822 "no matching operator found" error */
5823 op_error (loc, code, code2, arg1, arg2, arg3, FALSE);
5824 print_z_candidates (loc, candidates);
5827 result = error_mark_node;
5828 break;
5831 else
5833 cand = tourney (candidates, complain);
5834 if (cand == 0)
5836 if (complain & tf_error)
5838 op_error (loc, code, code2, arg1, arg2, arg3, TRUE);
5839 print_z_candidates (loc, candidates);
5841 result = error_mark_node;
5843 else if (TREE_CODE (cand->fn) == FUNCTION_DECL)
5845 if (overload)
5846 *overload = cand->fn;
5848 if (resolve_args (arglist, complain) == NULL)
5849 result = error_mark_node;
5850 else
5851 result = build_over_call (cand, LOOKUP_NORMAL, complain);
5853 if (trivial_fn_p (cand->fn))
5854 /* There won't be a CALL_EXPR. */;
5855 else if (result && result != error_mark_node)
5857 tree call = extract_call_expr (result);
5858 CALL_EXPR_OPERATOR_SYNTAX (call) = true;
5860 if (processing_template_decl && DECL_HIDDEN_FRIEND_P (cand->fn))
5861 /* This prevents build_new_function_call from discarding this
5862 function during instantiation of the enclosing template. */
5863 KOENIG_LOOKUP_P (call) = 1;
5865 /* Specify evaluation order as per P0145R2. */
5866 CALL_EXPR_ORDERED_ARGS (call) = false;
5867 switch (op_is_ordered (code))
5869 case -1:
5870 CALL_EXPR_REVERSE_ARGS (call) = true;
5871 break;
5873 case 1:
5874 CALL_EXPR_ORDERED_ARGS (call) = true;
5875 break;
5877 default:
5878 break;
5882 else
5884 /* Give any warnings we noticed during overload resolution. */
5885 if (cand->warnings && (complain & tf_warning))
5887 struct candidate_warning *w;
5888 for (w = cand->warnings; w; w = w->next)
5889 joust (cand, w->loser, 1, complain);
5892 /* Check for comparison of different enum types. */
5893 switch (code)
5895 case GT_EXPR:
5896 case LT_EXPR:
5897 case GE_EXPR:
5898 case LE_EXPR:
5899 case EQ_EXPR:
5900 case NE_EXPR:
5901 if (TREE_CODE (TREE_TYPE (arg1)) == ENUMERAL_TYPE
5902 && TREE_CODE (TREE_TYPE (arg2)) == ENUMERAL_TYPE
5903 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1))
5904 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2)))
5905 && (complain & tf_warning))
5907 warning (OPT_Wenum_compare,
5908 "comparison between %q#T and %q#T",
5909 TREE_TYPE (arg1), TREE_TYPE (arg2));
5911 break;
5912 default:
5913 break;
5916 /* We need to strip any leading REF_BIND so that bitfields
5917 don't cause errors. This should not remove any important
5918 conversions, because builtins don't apply to class
5919 objects directly. */
5920 conv = cand->convs[0];
5921 if (conv->kind == ck_ref_bind)
5922 conv = next_conversion (conv);
5923 arg1 = convert_like (conv, arg1, complain);
5925 if (arg2)
5927 conv = cand->convs[1];
5928 if (conv->kind == ck_ref_bind)
5929 conv = next_conversion (conv);
5930 else
5931 arg2 = decay_conversion (arg2, complain);
5933 /* We need to call warn_logical_operator before
5934 converting arg2 to a boolean_type, but after
5935 decaying an enumerator to its value. */
5936 if (complain & tf_warning)
5937 warn_logical_operator (loc, code, boolean_type_node,
5938 code_orig_arg1, arg1,
5939 code_orig_arg2, arg2);
5941 arg2 = convert_like (conv, arg2, complain);
5943 if (arg3)
5945 conv = cand->convs[2];
5946 if (conv->kind == ck_ref_bind)
5947 conv = next_conversion (conv);
5948 arg3 = convert_like (conv, arg3, complain);
5954 user_defined_result_ready:
5956 /* Free all the conversions we allocated. */
5957 obstack_free (&conversion_obstack, p);
5959 if (result || result_valid_p)
5960 return result;
5962 builtin:
5963 switch (code)
5965 case MODIFY_EXPR:
5966 return cp_build_modify_expr (loc, arg1, code2, arg2, complain);
5968 case INDIRECT_REF:
5969 return cp_build_indirect_ref (arg1, RO_UNARY_STAR, complain);
5971 case TRUTH_ANDIF_EXPR:
5972 case TRUTH_ORIF_EXPR:
5973 case TRUTH_AND_EXPR:
5974 case TRUTH_OR_EXPR:
5975 if (complain & tf_warning)
5976 warn_logical_operator (loc, code, boolean_type_node,
5977 code_orig_arg1, arg1,
5978 code_orig_arg2, arg2);
5979 /* Fall through. */
5980 case GT_EXPR:
5981 case LT_EXPR:
5982 case GE_EXPR:
5983 case LE_EXPR:
5984 case EQ_EXPR:
5985 case NE_EXPR:
5986 if ((complain & tf_warning)
5987 && ((code_orig_arg1 == BOOLEAN_TYPE)
5988 ^ (code_orig_arg2 == BOOLEAN_TYPE)))
5989 maybe_warn_bool_compare (loc, code, arg1, arg2);
5990 if (complain & tf_warning && warn_tautological_compare)
5991 warn_tautological_cmp (loc, code, arg1, arg2);
5992 /* Fall through. */
5993 case PLUS_EXPR:
5994 case MINUS_EXPR:
5995 case MULT_EXPR:
5996 case TRUNC_DIV_EXPR:
5997 case MAX_EXPR:
5998 case MIN_EXPR:
5999 case LSHIFT_EXPR:
6000 case RSHIFT_EXPR:
6001 case TRUNC_MOD_EXPR:
6002 case BIT_AND_EXPR:
6003 case BIT_IOR_EXPR:
6004 case BIT_XOR_EXPR:
6005 return cp_build_binary_op (loc, code, arg1, arg2, complain);
6007 case UNARY_PLUS_EXPR:
6008 case NEGATE_EXPR:
6009 case BIT_NOT_EXPR:
6010 case TRUTH_NOT_EXPR:
6011 case PREINCREMENT_EXPR:
6012 case POSTINCREMENT_EXPR:
6013 case PREDECREMENT_EXPR:
6014 case POSTDECREMENT_EXPR:
6015 case REALPART_EXPR:
6016 case IMAGPART_EXPR:
6017 case ABS_EXPR:
6018 return cp_build_unary_op (code, arg1, candidates != 0, complain);
6020 case ARRAY_REF:
6021 return cp_build_array_ref (input_location, arg1, arg2, complain);
6023 case MEMBER_REF:
6024 return build_m_component_ref (cp_build_indirect_ref (arg1, RO_ARROW_STAR,
6025 complain),
6026 arg2, complain);
6028 /* The caller will deal with these. */
6029 case ADDR_EXPR:
6030 case COMPONENT_REF:
6031 case COMPOUND_EXPR:
6032 return NULL_TREE;
6034 default:
6035 gcc_unreachable ();
6037 return NULL_TREE;
6040 /* Wrapper for above. */
6042 tree
6043 build_new_op (location_t loc, enum tree_code code, int flags,
6044 tree arg1, tree arg2, tree arg3,
6045 tree *overload, tsubst_flags_t complain)
6047 tree ret;
6048 bool subtime = timevar_cond_start (TV_OVERLOAD);
6049 ret = build_new_op_1 (loc, code, flags, arg1, arg2, arg3,
6050 overload, complain);
6051 timevar_cond_stop (TV_OVERLOAD, subtime);
6052 return ret;
6055 /* CALL was returned by some call-building function; extract the actual
6056 CALL_EXPR from any bits that have been tacked on, e.g. by
6057 convert_from_reference. */
6059 tree
6060 extract_call_expr (tree call)
6062 while (TREE_CODE (call) == COMPOUND_EXPR)
6063 call = TREE_OPERAND (call, 1);
6064 if (REFERENCE_REF_P (call))
6065 call = TREE_OPERAND (call, 0);
6066 if (TREE_CODE (call) == TARGET_EXPR)
6067 call = TARGET_EXPR_INITIAL (call);
6068 gcc_assert (TREE_CODE (call) == CALL_EXPR
6069 || TREE_CODE (call) == AGGR_INIT_EXPR
6070 || call == error_mark_node);
6071 return call;
6074 /* Returns true if FN has two parameters, of which the second has type
6075 size_t. */
6077 static bool
6078 second_parm_is_size_t (tree fn)
6080 tree t = FUNCTION_ARG_CHAIN (fn);
6081 if (!t || !same_type_p (TREE_VALUE (t), size_type_node))
6082 return false;
6083 t = TREE_CHAIN (t);
6084 if (t == void_list_node)
6085 return true;
6086 if (aligned_new_threshold && t
6087 && same_type_p (TREE_VALUE (t), align_type_node)
6088 && TREE_CHAIN (t) == void_list_node)
6089 return true;
6090 return false;
6093 /* True if T, an allocation function, has std::align_val_t as its second
6094 argument. */
6096 bool
6097 aligned_allocation_fn_p (tree t)
6099 if (!aligned_new_threshold)
6100 return false;
6102 tree a = FUNCTION_ARG_CHAIN (t);
6103 return (a && same_type_p (TREE_VALUE (a), align_type_node));
6106 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6107 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6108 std::align_val_t. */
6110 static bool
6111 aligned_deallocation_fn_p (tree t)
6113 if (!aligned_new_threshold)
6114 return false;
6116 /* A template instance is never a usual deallocation function,
6117 regardless of its signature. */
6118 if (TREE_CODE (t) == TEMPLATE_DECL
6119 || primary_template_instantiation_p (t))
6120 return false;
6122 tree a = FUNCTION_ARG_CHAIN (t);
6123 if (same_type_p (TREE_VALUE (a), align_type_node)
6124 && TREE_CHAIN (a) == void_list_node)
6125 return true;
6126 if (!same_type_p (TREE_VALUE (a), size_type_node))
6127 return false;
6128 a = TREE_CHAIN (a);
6129 if (a && same_type_p (TREE_VALUE (a), align_type_node)
6130 && TREE_CHAIN (a) == void_list_node)
6131 return true;
6132 return false;
6135 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6136 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6138 bool
6139 usual_deallocation_fn_p (tree t)
6141 /* A template instance is never a usual deallocation function,
6142 regardless of its signature. */
6143 if (TREE_CODE (t) == TEMPLATE_DECL
6144 || primary_template_instantiation_p (t))
6145 return false;
6147 /* If a class T has a member deallocation function named operator delete
6148 with exactly one parameter, then that function is a usual
6149 (non-placement) deallocation function. If class T does not declare
6150 such an operator delete but does declare a member deallocation
6151 function named operator delete with exactly two parameters, the second
6152 of which has type std::size_t (18.2), then this function is a usual
6153 deallocation function. */
6154 bool global = DECL_NAMESPACE_SCOPE_P (t);
6155 tree chain = FUNCTION_ARG_CHAIN (t);
6156 if (!chain)
6157 return false;
6158 if (chain == void_list_node
6159 || ((!global || flag_sized_deallocation)
6160 && second_parm_is_size_t (t)))
6161 return true;
6162 if (aligned_deallocation_fn_p (t))
6163 return true;
6164 return false;
6167 /* Build a call to operator delete. This has to be handled very specially,
6168 because the restrictions on what signatures match are different from all
6169 other call instances. For a normal delete, only a delete taking (void *)
6170 or (void *, size_t) is accepted. For a placement delete, only an exact
6171 match with the placement new is accepted.
6173 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6174 ADDR is the pointer to be deleted.
6175 SIZE is the size of the memory block to be deleted.
6176 GLOBAL_P is true if the delete-expression should not consider
6177 class-specific delete operators.
6178 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6180 If this call to "operator delete" is being generated as part to
6181 deallocate memory allocated via a new-expression (as per [expr.new]
6182 which requires that if the initialization throws an exception then
6183 we call a deallocation function), then ALLOC_FN is the allocation
6184 function. */
6186 tree
6187 build_op_delete_call (enum tree_code code, tree addr, tree size,
6188 bool global_p, tree placement,
6189 tree alloc_fn, tsubst_flags_t complain)
6191 tree fn = NULL_TREE;
6192 tree fns, fnname, type, t;
6194 if (addr == error_mark_node)
6195 return error_mark_node;
6197 type = strip_array_types (TREE_TYPE (TREE_TYPE (addr)));
6199 fnname = cp_operator_id (code);
6201 if (CLASS_TYPE_P (type)
6202 && COMPLETE_TYPE_P (complete_type (type))
6203 && !global_p)
6204 /* In [class.free]
6206 If the result of the lookup is ambiguous or inaccessible, or if
6207 the lookup selects a placement deallocation function, the
6208 program is ill-formed.
6210 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6212 fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1);
6213 if (fns == error_mark_node)
6214 return error_mark_node;
6216 else
6217 fns = NULL_TREE;
6219 if (fns == NULL_TREE)
6220 fns = lookup_name_nonclass (fnname);
6222 /* Strip const and volatile from addr. */
6223 addr = cp_convert (ptr_type_node, addr, complain);
6225 if (placement)
6227 /* "A declaration of a placement deallocation function matches the
6228 declaration of a placement allocation function if it has the same
6229 number of parameters and, after parameter transformations (8.3.5),
6230 all parameter types except the first are identical."
6232 So we build up the function type we want and ask instantiate_type
6233 to get it for us. */
6234 t = FUNCTION_ARG_CHAIN (alloc_fn);
6235 t = tree_cons (NULL_TREE, ptr_type_node, t);
6236 t = build_function_type (void_type_node, t);
6238 fn = instantiate_type (t, fns, tf_none);
6239 if (fn == error_mark_node)
6240 return NULL_TREE;
6242 fn = MAYBE_BASELINK_FUNCTIONS (fn);
6244 /* "If the lookup finds the two-parameter form of a usual deallocation
6245 function (3.7.4.2) and that function, considered as a placement
6246 deallocation function, would have been selected as a match for the
6247 allocation function, the program is ill-formed." */
6248 if (second_parm_is_size_t (fn))
6250 const char *const msg1
6251 = G_("exception cleanup for this placement new selects "
6252 "non-placement operator delete");
6253 const char *const msg2
6254 = G_("%qD is a usual (non-placement) deallocation "
6255 "function in C++14 (or with -fsized-deallocation)");
6257 /* But if the class has an operator delete (void *), then that is
6258 the usual deallocation function, so we shouldn't complain
6259 about using the operator delete (void *, size_t). */
6260 if (DECL_CLASS_SCOPE_P (fn))
6261 for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (fns));
6262 iter; ++iter)
6264 tree elt = *iter;
6265 if (usual_deallocation_fn_p (elt)
6266 && FUNCTION_ARG_CHAIN (elt) == void_list_node)
6267 goto ok;
6269 /* Before C++14 a two-parameter global deallocation function is
6270 always a placement deallocation function, but warn if
6271 -Wc++14-compat. */
6272 else if (!flag_sized_deallocation)
6274 if ((complain & tf_warning)
6275 && warning (OPT_Wc__14_compat, msg1))
6276 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
6277 goto ok;
6280 if (complain & tf_warning_or_error)
6282 if (permerror (input_location, msg1))
6284 /* Only mention C++14 for namespace-scope delete. */
6285 if (DECL_NAMESPACE_SCOPE_P (fn))
6286 inform (DECL_SOURCE_LOCATION (fn), msg2, fn);
6287 else
6288 inform (DECL_SOURCE_LOCATION (fn),
6289 "%qD is a usual (non-placement) deallocation "
6290 "function", fn);
6293 else
6294 return error_mark_node;
6295 ok:;
6298 else
6299 /* "Any non-placement deallocation function matches a non-placement
6300 allocation function. If the lookup finds a single matching
6301 deallocation function, that function will be called; otherwise, no
6302 deallocation function will be called." */
6303 for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (fns)); iter; ++iter)
6305 tree elt = *iter;
6306 if (usual_deallocation_fn_p (elt))
6308 if (!fn)
6310 fn = elt;
6311 continue;
6314 /* -- If the type has new-extended alignment, a function with a
6315 parameter of type std::align_val_t is preferred; otherwise a
6316 function without such a parameter is preferred. If exactly one
6317 preferred function is found, that function is selected and the
6318 selection process terminates. If more than one preferred
6319 function is found, all non-preferred functions are eliminated
6320 from further consideration. */
6321 if (aligned_new_threshold)
6323 bool want_align = type_has_new_extended_alignment (type);
6324 bool fn_align = aligned_deallocation_fn_p (fn);
6325 bool elt_align = aligned_deallocation_fn_p (elt);
6327 if (elt_align != fn_align)
6329 if (want_align == elt_align)
6330 fn = elt;
6331 continue;
6335 /* -- If the deallocation functions have class scope, the one
6336 without a parameter of type std::size_t is selected. */
6337 bool want_size;
6338 if (DECL_CLASS_SCOPE_P (fn))
6339 want_size = false;
6341 /* -- If the type is complete and if, for the second alternative
6342 (delete array) only, the operand is a pointer to a class type
6343 with a non-trivial destructor or a (possibly multi-dimensional)
6344 array thereof, the function with a parameter of type std::size_t
6345 is selected.
6347 -- Otherwise, it is unspecified whether a deallocation function
6348 with a parameter of type std::size_t is selected. */
6349 else
6351 want_size = COMPLETE_TYPE_P (type);
6352 if (code == VEC_DELETE_EXPR
6353 && !TYPE_VEC_NEW_USES_COOKIE (type))
6354 /* We need a cookie to determine the array size. */
6355 want_size = false;
6357 bool fn_size = second_parm_is_size_t (fn);
6358 bool elt_size = second_parm_is_size_t (elt);
6359 gcc_assert (fn_size != elt_size);
6360 if (want_size == elt_size)
6361 fn = elt;
6365 /* If we have a matching function, call it. */
6366 if (fn)
6368 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
6370 /* If the FN is a member function, make sure that it is
6371 accessible. */
6372 if (BASELINK_P (fns))
6373 perform_or_defer_access_check (BASELINK_BINFO (fns), fn, fn,
6374 complain);
6376 /* Core issue 901: It's ok to new a type with deleted delete. */
6377 if (DECL_DELETED_FN (fn) && alloc_fn)
6378 return NULL_TREE;
6380 if (placement)
6382 /* The placement args might not be suitable for overload
6383 resolution at this point, so build the call directly. */
6384 int nargs = call_expr_nargs (placement);
6385 tree *argarray = XALLOCAVEC (tree, nargs);
6386 int i;
6387 argarray[0] = addr;
6388 for (i = 1; i < nargs; i++)
6389 argarray[i] = CALL_EXPR_ARG (placement, i);
6390 if (!mark_used (fn, complain) && !(complain & tf_error))
6391 return error_mark_node;
6392 return build_cxx_call (fn, nargs, argarray, complain);
6394 else
6396 tree ret;
6397 vec<tree, va_gc> *args = make_tree_vector ();
6398 args->quick_push (addr);
6399 if (second_parm_is_size_t (fn))
6400 args->quick_push (size);
6401 if (aligned_deallocation_fn_p (fn))
6403 tree al = build_int_cst (align_type_node, TYPE_ALIGN_UNIT (type));
6404 args->quick_push (al);
6406 ret = cp_build_function_call_vec (fn, &args, complain);
6407 release_tree_vector (args);
6408 return ret;
6412 /* [expr.new]
6414 If no unambiguous matching deallocation function can be found,
6415 propagating the exception does not cause the object's memory to
6416 be freed. */
6417 if (alloc_fn)
6419 if ((complain & tf_warning)
6420 && !placement)
6421 warning (0, "no corresponding deallocation function for %qD",
6422 alloc_fn);
6423 return NULL_TREE;
6426 if (complain & tf_error)
6427 error ("no suitable %<operator %s%> for %qT",
6428 operator_name_info[(int)code].name, type);
6429 return error_mark_node;
6432 /* If the current scope isn't allowed to access DECL along
6433 BASETYPE_PATH, give an error. The most derived class in
6434 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6435 the declaration to use in the error diagnostic. */
6437 bool
6438 enforce_access (tree basetype_path, tree decl, tree diag_decl,
6439 tsubst_flags_t complain, access_failure_info *afi)
6441 gcc_assert (TREE_CODE (basetype_path) == TREE_BINFO);
6443 if (flag_new_inheriting_ctors
6444 && DECL_INHERITED_CTOR (decl))
6446 /* 7.3.3/18: The additional constructors are accessible if they would be
6447 accessible when used to construct an object of the corresponding base
6448 class. */
6449 decl = strip_inheriting_ctors (decl);
6450 basetype_path = lookup_base (basetype_path, DECL_CONTEXT (decl),
6451 ba_any, NULL, complain);
6454 if (!accessible_p (basetype_path, decl, true))
6456 if (complain & tf_error)
6458 if (flag_new_inheriting_ctors)
6459 diag_decl = strip_inheriting_ctors (diag_decl);
6460 if (TREE_PRIVATE (decl))
6462 error ("%q#D is private within this context", diag_decl);
6463 inform (DECL_SOURCE_LOCATION (diag_decl),
6464 "declared private here");
6465 if (afi)
6466 afi->record_access_failure (basetype_path, diag_decl);
6468 else if (TREE_PROTECTED (decl))
6470 error ("%q#D is protected within this context", diag_decl);
6471 inform (DECL_SOURCE_LOCATION (diag_decl),
6472 "declared protected here");
6473 if (afi)
6474 afi->record_access_failure (basetype_path, diag_decl);
6476 else
6478 error ("%q#D is inaccessible within this context", diag_decl);
6479 inform (DECL_SOURCE_LOCATION (diag_decl), "declared here");
6480 if (afi)
6481 afi->record_access_failure (basetype_path, diag_decl);
6484 return false;
6487 return true;
6490 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6491 bitwise or of LOOKUP_* values. If any errors are warnings are
6492 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6493 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6494 to NULL. */
6496 static tree
6497 build_temp (tree expr, tree type, int flags,
6498 diagnostic_t *diagnostic_kind, tsubst_flags_t complain)
6500 int savew, savee;
6501 vec<tree, va_gc> *args;
6503 *diagnostic_kind = DK_UNSPECIFIED;
6505 /* If the source is a packed field, calling the copy constructor will require
6506 binding the field to the reference parameter to the copy constructor, and
6507 we'll end up with an infinite loop. If we can use a bitwise copy, then
6508 do that now. */
6509 if ((lvalue_kind (expr) & clk_packed)
6510 && CLASS_TYPE_P (TREE_TYPE (expr))
6511 && !type_has_nontrivial_copy_init (TREE_TYPE (expr)))
6512 return get_target_expr_sfinae (expr, complain);
6514 savew = warningcount + werrorcount, savee = errorcount;
6515 args = make_tree_vector_single (expr);
6516 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
6517 &args, type, flags, complain);
6518 release_tree_vector (args);
6519 if (warningcount + werrorcount > savew)
6520 *diagnostic_kind = DK_WARNING;
6521 else if (errorcount > savee)
6522 *diagnostic_kind = DK_ERROR;
6523 return expr;
6526 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6527 EXPR is implicitly converted to type TOTYPE.
6528 FN and ARGNUM are used for diagnostics. */
6530 static void
6531 conversion_null_warnings (tree totype, tree expr, tree fn, int argnum)
6533 /* Issue warnings about peculiar, but valid, uses of NULL. */
6534 if (expr == null_node && TREE_CODE (totype) != BOOLEAN_TYPE
6535 && ARITHMETIC_TYPE_P (totype))
6537 source_location loc =
6538 expansion_point_location_if_in_system_header (input_location);
6540 if (fn)
6541 warning_at (loc, OPT_Wconversion_null,
6542 "passing NULL to non-pointer argument %P of %qD",
6543 argnum, fn);
6544 else
6545 warning_at (loc, OPT_Wconversion_null,
6546 "converting to non-pointer type %qT from NULL", totype);
6549 /* Issue warnings if "false" is converted to a NULL pointer */
6550 else if (TREE_CODE (TREE_TYPE (expr)) == BOOLEAN_TYPE
6551 && TYPE_PTR_P (totype))
6553 if (fn)
6554 warning_at (input_location, OPT_Wconversion_null,
6555 "converting %<false%> to pointer type for argument %P "
6556 "of %qD", argnum, fn);
6557 else
6558 warning_at (input_location, OPT_Wconversion_null,
6559 "converting %<false%> to pointer type %qT", totype);
6563 /* We gave a diagnostic during a conversion. If this was in the second
6564 standard conversion sequence of a user-defined conversion sequence, say
6565 which user-defined conversion. */
6567 static void
6568 maybe_print_user_conv_context (conversion *convs)
6570 if (convs->user_conv_p)
6571 for (conversion *t = convs; t; t = next_conversion (t))
6572 if (t->kind == ck_user)
6574 print_z_candidate (0, " after user-defined conversion:",
6575 t->cand);
6576 break;
6580 /* Perform the conversions in CONVS on the expression EXPR. FN and
6581 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6582 indicates the `this' argument of a method. INNER is nonzero when
6583 being called to continue a conversion chain. It is negative when a
6584 reference binding will be applied, positive otherwise. If
6585 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6586 conversions will be emitted if appropriate. If C_CAST_P is true,
6587 this conversion is coming from a C-style cast; in that case,
6588 conversions to inaccessible bases are permitted. */
6590 static tree
6591 convert_like_real (conversion *convs, tree expr, tree fn, int argnum,
6592 bool issue_conversion_warnings,
6593 bool c_cast_p, tsubst_flags_t complain)
6595 tree totype = convs->type;
6596 diagnostic_t diag_kind;
6597 int flags;
6598 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
6600 if (convs->bad_p && !(complain & tf_error))
6601 return error_mark_node;
6603 if (convs->bad_p
6604 && convs->kind != ck_user
6605 && convs->kind != ck_list
6606 && convs->kind != ck_ambig
6607 && (convs->kind != ck_ref_bind
6608 || (convs->user_conv_p && next_conversion (convs)->bad_p))
6609 && (convs->kind != ck_rvalue
6610 || SCALAR_TYPE_P (totype))
6611 && convs->kind != ck_base)
6613 bool complained = false;
6614 conversion *t = convs;
6616 /* Give a helpful error if this is bad because of excess braces. */
6617 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6618 && SCALAR_TYPE_P (totype)
6619 && CONSTRUCTOR_NELTS (expr) > 0
6620 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr, 0)->value))
6622 complained = permerror (loc, "too many braces around initializer "
6623 "for %qT", totype);
6624 while (BRACE_ENCLOSED_INITIALIZER_P (expr)
6625 && CONSTRUCTOR_NELTS (expr) == 1)
6626 expr = CONSTRUCTOR_ELT (expr, 0)->value;
6629 /* Give a helpful error if this is bad because a conversion to bool
6630 from std::nullptr_t requires direct-initialization. */
6631 if (NULLPTR_TYPE_P (TREE_TYPE (expr))
6632 && TREE_CODE (totype) == BOOLEAN_TYPE)
6633 complained = permerror (loc, "converting to %qH from %qI requires "
6634 "direct-initialization",
6635 totype, TREE_TYPE (expr));
6637 for (; t ; t = next_conversion (t))
6639 if (t->kind == ck_user && t->cand->reason)
6641 complained = permerror (loc, "invalid user-defined conversion "
6642 "from %qH to %qI", TREE_TYPE (expr),
6643 totype);
6644 if (complained)
6645 print_z_candidate (loc, "candidate is:", t->cand);
6646 expr = convert_like_real (t, expr, fn, argnum,
6647 /*issue_conversion_warnings=*/false,
6648 /*c_cast_p=*/false,
6649 complain);
6650 if (convs->kind == ck_ref_bind)
6651 expr = convert_to_reference (totype, expr, CONV_IMPLICIT,
6652 LOOKUP_NORMAL, NULL_TREE,
6653 complain);
6654 else
6655 expr = cp_convert (totype, expr, complain);
6656 if (complained && fn)
6657 inform (DECL_SOURCE_LOCATION (fn),
6658 " initializing argument %P of %qD", argnum, fn);
6659 return expr;
6661 else if (t->kind == ck_user || !t->bad_p)
6663 expr = convert_like_real (t, expr, fn, argnum,
6664 /*issue_conversion_warnings=*/false,
6665 /*c_cast_p=*/false,
6666 complain);
6667 break;
6669 else if (t->kind == ck_ambig)
6670 return convert_like_real (t, expr, fn, argnum,
6671 /*issue_conversion_warnings=*/false,
6672 /*c_cast_p=*/false,
6673 complain);
6674 else if (t->kind == ck_identity)
6675 break;
6677 if (!complained)
6678 complained = permerror (loc, "invalid conversion from %qH to %qI",
6679 TREE_TYPE (expr), totype);
6680 if (complained && fn)
6681 inform (DECL_SOURCE_LOCATION (fn),
6682 " initializing argument %P of %qD", argnum, fn);
6684 return cp_convert (totype, expr, complain);
6687 if (issue_conversion_warnings && (complain & tf_warning))
6688 conversion_null_warnings (totype, expr, fn, argnum);
6690 switch (convs->kind)
6692 case ck_user:
6694 struct z_candidate *cand = convs->cand;
6695 tree convfn = cand->fn;
6697 /* When converting from an init list we consider explicit
6698 constructors, but actually trying to call one is an error. */
6699 if (DECL_NONCONVERTING_P (convfn) && DECL_CONSTRUCTOR_P (convfn)
6700 && BRACE_ENCLOSED_INITIALIZER_P (expr)
6701 /* Unless this is for direct-list-initialization. */
6702 && !CONSTRUCTOR_IS_DIRECT_INIT (expr)
6703 /* And in C++98 a default constructor can't be explicit. */
6704 && cxx_dialect >= cxx11)
6706 if (!(complain & tf_error))
6707 return error_mark_node;
6708 location_t loc = location_of (expr);
6709 if (CONSTRUCTOR_NELTS (expr) == 0
6710 && FUNCTION_FIRST_USER_PARMTYPE (convfn) != void_list_node)
6712 if (pedwarn (loc, 0, "converting to %qT from initializer list "
6713 "would use explicit constructor %qD",
6714 totype, convfn))
6715 inform (loc, "in C++11 and above a default constructor "
6716 "can be explicit");
6718 else
6719 error ("converting to %qT from initializer list would use "
6720 "explicit constructor %qD", totype, convfn);
6723 /* If we're initializing from {}, it's value-initialization. */
6724 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6725 && CONSTRUCTOR_NELTS (expr) == 0
6726 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype))
6728 bool direct = CONSTRUCTOR_IS_DIRECT_INIT (expr);
6729 expr = build_value_init (totype, complain);
6730 expr = get_target_expr_sfinae (expr, complain);
6731 if (expr != error_mark_node)
6733 TARGET_EXPR_LIST_INIT_P (expr) = true;
6734 TARGET_EXPR_DIRECT_INIT_P (expr) = direct;
6736 return expr;
6739 expr = mark_rvalue_use (expr);
6741 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
6742 any more UDCs. */
6743 expr = build_over_call (cand, LOOKUP_NORMAL|LOOKUP_NO_CONVERSION,
6744 complain);
6746 /* If this is a constructor or a function returning an aggr type,
6747 we need to build up a TARGET_EXPR. */
6748 if (DECL_CONSTRUCTOR_P (convfn))
6750 expr = build_cplus_new (totype, expr, complain);
6752 /* Remember that this was list-initialization. */
6753 if (convs->check_narrowing && expr != error_mark_node)
6754 TARGET_EXPR_LIST_INIT_P (expr) = true;
6757 return expr;
6759 case ck_identity:
6760 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
6762 int nelts = CONSTRUCTOR_NELTS (expr);
6763 if (nelts == 0)
6764 expr = build_value_init (totype, complain);
6765 else if (nelts == 1)
6766 expr = CONSTRUCTOR_ELT (expr, 0)->value;
6767 else
6768 gcc_unreachable ();
6770 expr = mark_rvalue_use (expr);
6772 if (type_unknown_p (expr))
6773 expr = instantiate_type (totype, expr, complain);
6774 return expr;
6775 case ck_ambig:
6776 /* We leave bad_p off ck_ambig because overload resolution considers
6777 it valid, it just fails when we try to perform it. So we need to
6778 check complain here, too. */
6779 if (complain & tf_error)
6781 /* Call build_user_type_conversion again for the error. */
6782 build_user_type_conversion (totype, convs->u.expr, LOOKUP_IMPLICIT,
6783 complain);
6784 if (fn)
6785 inform (DECL_SOURCE_LOCATION (fn),
6786 " initializing argument %P of %qD", argnum, fn);
6788 return error_mark_node;
6790 case ck_list:
6792 /* Conversion to std::initializer_list<T>. */
6793 tree elttype = TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype), 0);
6794 tree new_ctor = build_constructor (init_list_type_node, NULL);
6795 unsigned len = CONSTRUCTOR_NELTS (expr);
6796 tree array, val, field;
6797 vec<constructor_elt, va_gc> *vec = NULL;
6798 unsigned ix;
6800 /* Convert all the elements. */
6801 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr), ix, val)
6803 tree sub = convert_like_real (convs->u.list[ix], val, fn, argnum,
6804 false, false, complain);
6805 if (sub == error_mark_node)
6806 return sub;
6807 if (!BRACE_ENCLOSED_INITIALIZER_P (val)
6808 && !check_narrowing (TREE_TYPE (sub), val, complain))
6809 return error_mark_node;
6810 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor), NULL_TREE, sub);
6811 if (!TREE_CONSTANT (sub))
6812 TREE_CONSTANT (new_ctor) = false;
6814 /* Build up the array. */
6815 elttype = cp_build_qualified_type
6816 (elttype, cp_type_quals (elttype) | TYPE_QUAL_CONST);
6817 array = build_array_of_n_type (elttype, len);
6818 array = finish_compound_literal (array, new_ctor, complain);
6819 /* Take the address explicitly rather than via decay_conversion
6820 to avoid the error about taking the address of a temporary. */
6821 array = cp_build_addr_expr (array, complain);
6822 array = cp_convert (build_pointer_type (elttype), array, complain);
6823 if (array == error_mark_node)
6824 return error_mark_node;
6826 /* Build up the initializer_list object. */
6827 totype = complete_type (totype);
6828 field = next_initializable_field (TYPE_FIELDS (totype));
6829 CONSTRUCTOR_APPEND_ELT (vec, field, array);
6830 field = next_initializable_field (DECL_CHAIN (field));
6831 CONSTRUCTOR_APPEND_ELT (vec, field, size_int (len));
6832 new_ctor = build_constructor (totype, vec);
6833 return get_target_expr_sfinae (new_ctor, complain);
6836 case ck_aggr:
6837 if (TREE_CODE (totype) == COMPLEX_TYPE)
6839 tree real = CONSTRUCTOR_ELT (expr, 0)->value;
6840 tree imag = CONSTRUCTOR_ELT (expr, 1)->value;
6841 real = perform_implicit_conversion (TREE_TYPE (totype),
6842 real, complain);
6843 imag = perform_implicit_conversion (TREE_TYPE (totype),
6844 imag, complain);
6845 expr = build2 (COMPLEX_EXPR, totype, real, imag);
6846 return expr;
6848 expr = reshape_init (totype, expr, complain);
6849 expr = get_target_expr_sfinae (digest_init (totype, expr, complain),
6850 complain);
6851 if (expr != error_mark_node)
6852 TARGET_EXPR_LIST_INIT_P (expr) = true;
6853 return expr;
6855 default:
6856 break;
6859 expr = convert_like_real (next_conversion (convs), expr, fn, argnum,
6860 convs->kind == ck_ref_bind ? issue_conversion_warnings : false,
6861 c_cast_p,
6862 complain);
6863 if (expr == error_mark_node)
6864 return error_mark_node;
6866 switch (convs->kind)
6868 case ck_rvalue:
6869 expr = decay_conversion (expr, complain);
6870 if (expr == error_mark_node)
6872 if (complain & tf_error)
6874 maybe_print_user_conv_context (convs);
6875 if (fn)
6876 inform (DECL_SOURCE_LOCATION (fn),
6877 " initializing argument %P of %qD", argnum, fn);
6879 return error_mark_node;
6882 if (! MAYBE_CLASS_TYPE_P (totype))
6883 return expr;
6885 /* Don't introduce copies when passing arguments along to the inherited
6886 constructor. */
6887 if (current_function_decl
6888 && flag_new_inheriting_ctors
6889 && DECL_INHERITED_CTOR (current_function_decl))
6890 return expr;
6892 /* Fall through. */
6893 case ck_base:
6894 if (convs->kind == ck_base && !convs->need_temporary_p)
6896 /* We are going to bind a reference directly to a base-class
6897 subobject of EXPR. */
6898 /* Build an expression for `*((base*) &expr)'. */
6899 expr = convert_to_base (expr, totype,
6900 !c_cast_p, /*nonnull=*/true, complain);
6901 return expr;
6904 /* Copy-initialization where the cv-unqualified version of the source
6905 type is the same class as, or a derived class of, the class of the
6906 destination [is treated as direct-initialization]. [dcl.init] */
6907 flags = LOOKUP_NORMAL;
6908 if (convs->user_conv_p)
6909 /* This conversion is being done in the context of a user-defined
6910 conversion (i.e. the second step of copy-initialization), so
6911 don't allow any more. */
6912 flags |= LOOKUP_NO_CONVERSION;
6913 else
6914 flags |= LOOKUP_ONLYCONVERTING;
6915 if (convs->rvaluedness_matches_p)
6916 /* standard_conversion got LOOKUP_PREFER_RVALUE. */
6917 flags |= LOOKUP_PREFER_RVALUE;
6918 if (TREE_CODE (expr) == TARGET_EXPR
6919 && TARGET_EXPR_LIST_INIT_P (expr))
6920 /* Copy-list-initialization doesn't actually involve a copy. */
6921 return expr;
6922 expr = build_temp (expr, totype, flags, &diag_kind, complain);
6923 if (diag_kind && complain)
6925 maybe_print_user_conv_context (convs);
6926 if (fn)
6927 inform (DECL_SOURCE_LOCATION (fn),
6928 " initializing argument %P of %qD", argnum, fn);
6931 return build_cplus_new (totype, expr, complain);
6933 case ck_ref_bind:
6935 tree ref_type = totype;
6937 if (convs->bad_p && !next_conversion (convs)->bad_p)
6939 tree extype = TREE_TYPE (expr);
6940 if (TYPE_REF_IS_RVALUE (ref_type)
6941 && lvalue_p (expr))
6942 error_at (loc, "cannot bind rvalue reference of type %qH to "
6943 "lvalue of type %qI", totype, extype);
6944 else if (!TYPE_REF_IS_RVALUE (ref_type) && !lvalue_p (expr)
6945 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type)))
6946 error_at (loc, "cannot bind non-const lvalue reference of "
6947 "type %qH to an rvalue of type %qI", totype, extype);
6948 else if (!reference_compatible_p (TREE_TYPE (totype), extype))
6949 error_at (loc, "binding reference of type %qH to %qI "
6950 "discards qualifiers", totype, extype);
6951 else
6952 gcc_unreachable ();
6953 maybe_print_user_conv_context (convs);
6954 if (fn)
6955 inform (DECL_SOURCE_LOCATION (fn),
6956 " initializing argument %P of %qD", argnum, fn);
6957 return error_mark_node;
6960 /* If necessary, create a temporary.
6962 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
6963 that need temporaries, even when their types are reference
6964 compatible with the type of reference being bound, so the
6965 upcoming call to cp_build_addr_expr doesn't fail. */
6966 if (convs->need_temporary_p
6967 || TREE_CODE (expr) == CONSTRUCTOR
6968 || TREE_CODE (expr) == VA_ARG_EXPR)
6970 /* Otherwise, a temporary of type "cv1 T1" is created and
6971 initialized from the initializer expression using the rules
6972 for a non-reference copy-initialization (8.5). */
6974 tree type = TREE_TYPE (ref_type);
6975 cp_lvalue_kind lvalue = lvalue_kind (expr);
6977 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6978 (type, next_conversion (convs)->type));
6979 if (!CP_TYPE_CONST_NON_VOLATILE_P (type)
6980 && !TYPE_REF_IS_RVALUE (ref_type))
6982 /* If the reference is volatile or non-const, we
6983 cannot create a temporary. */
6984 if (lvalue & clk_bitfield)
6985 error_at (loc, "cannot bind bitfield %qE to %qT",
6986 expr, ref_type);
6987 else if (lvalue & clk_packed)
6988 error_at (loc, "cannot bind packed field %qE to %qT",
6989 expr, ref_type);
6990 else
6991 error_at (loc, "cannot bind rvalue %qE to %qT",
6992 expr, ref_type);
6993 return error_mark_node;
6995 /* If the source is a packed field, and we must use a copy
6996 constructor, then building the target expr will require
6997 binding the field to the reference parameter to the
6998 copy constructor, and we'll end up with an infinite
6999 loop. If we can use a bitwise copy, then we'll be
7000 OK. */
7001 if ((lvalue & clk_packed)
7002 && CLASS_TYPE_P (type)
7003 && type_has_nontrivial_copy_init (type))
7005 error_at (loc, "cannot bind packed field %qE to %qT",
7006 expr, ref_type);
7007 return error_mark_node;
7009 if (lvalue & clk_bitfield)
7011 expr = convert_bitfield_to_declared_type (expr);
7012 expr = fold_convert (type, expr);
7014 expr = build_target_expr_with_type (expr, type, complain);
7017 /* Take the address of the thing to which we will bind the
7018 reference. */
7019 expr = cp_build_addr_expr (expr, complain);
7020 if (expr == error_mark_node)
7021 return error_mark_node;
7023 /* Convert it to a pointer to the type referred to by the
7024 reference. This will adjust the pointer if a derived to
7025 base conversion is being performed. */
7026 expr = cp_convert (build_pointer_type (TREE_TYPE (ref_type)),
7027 expr, complain);
7028 /* Convert the pointer to the desired reference type. */
7029 return build_nop (ref_type, expr);
7032 case ck_lvalue:
7033 return decay_conversion (expr, complain);
7035 case ck_fnptr:
7036 /* ??? Should the address of a transaction-safe pointer point to the TM
7037 clone, and this conversion look up the primary function? */
7038 return build_nop (totype, expr);
7040 case ck_qual:
7041 /* Warn about deprecated conversion if appropriate. */
7042 string_conv_p (totype, expr, 1);
7043 break;
7045 case ck_ptr:
7046 if (convs->base_p)
7047 expr = convert_to_base (expr, totype, !c_cast_p,
7048 /*nonnull=*/false, complain);
7049 return build_nop (totype, expr);
7051 case ck_pmem:
7052 return convert_ptrmem (totype, expr, /*allow_inverse_p=*/false,
7053 c_cast_p, complain);
7055 default:
7056 break;
7059 if (convs->check_narrowing
7060 && !check_narrowing (totype, expr, complain))
7061 return error_mark_node;
7063 if (issue_conversion_warnings)
7064 expr = cp_convert_and_check (totype, expr, complain);
7065 else
7066 expr = cp_convert (totype, expr, complain);
7068 return expr;
7071 /* ARG is being passed to a varargs function. Perform any conversions
7072 required. Return the converted value. */
7074 tree
7075 convert_arg_to_ellipsis (tree arg, tsubst_flags_t complain)
7077 tree arg_type;
7078 location_t loc = EXPR_LOC_OR_LOC (arg, input_location);
7080 /* [expr.call]
7082 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7083 standard conversions are performed. */
7084 arg = decay_conversion (arg, complain);
7085 arg_type = TREE_TYPE (arg);
7086 /* [expr.call]
7088 If the argument has integral or enumeration type that is subject
7089 to the integral promotions (_conv.prom_), or a floating point
7090 type that is subject to the floating point promotion
7091 (_conv.fpprom_), the value of the argument is converted to the
7092 promoted type before the call. */
7093 if (TREE_CODE (arg_type) == REAL_TYPE
7094 && (TYPE_PRECISION (arg_type)
7095 < TYPE_PRECISION (double_type_node))
7096 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type)))
7098 if ((complain & tf_warning)
7099 && warn_double_promotion && !c_inhibit_evaluation_warnings)
7100 warning_at (loc, OPT_Wdouble_promotion,
7101 "implicit conversion from %qH to %qI when passing "
7102 "argument to function",
7103 arg_type, double_type_node);
7104 arg = convert_to_real_nofold (double_type_node, arg);
7106 else if (NULLPTR_TYPE_P (arg_type))
7107 arg = null_pointer_node;
7108 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type))
7110 if (SCOPED_ENUM_P (arg_type))
7112 tree prom = cp_convert (ENUM_UNDERLYING_TYPE (arg_type), arg,
7113 complain);
7114 prom = cp_perform_integral_promotions (prom, complain);
7115 if (abi_version_crosses (6)
7116 && TYPE_MODE (TREE_TYPE (prom)) != TYPE_MODE (arg_type)
7117 && (complain & tf_warning))
7118 warning_at (loc, OPT_Wabi, "scoped enum %qT passed through ... as "
7119 "%qT before -fabi-version=6, %qT after", arg_type,
7120 TREE_TYPE (prom), ENUM_UNDERLYING_TYPE (arg_type));
7121 if (!abi_version_at_least (6))
7122 arg = prom;
7124 else
7125 arg = cp_perform_integral_promotions (arg, complain);
7128 arg = require_complete_type_sfinae (arg, complain);
7129 arg_type = TREE_TYPE (arg);
7131 if (arg != error_mark_node
7132 /* In a template (or ill-formed code), we can have an incomplete type
7133 even after require_complete_type_sfinae, in which case we don't know
7134 whether it has trivial copy or not. */
7135 && COMPLETE_TYPE_P (arg_type))
7137 /* Build up a real lvalue-to-rvalue conversion in case the
7138 copy constructor is trivial but not callable. */
7139 if (!cp_unevaluated_operand && CLASS_TYPE_P (arg_type))
7140 force_rvalue (arg, complain);
7142 /* [expr.call] 5.2.2/7:
7143 Passing a potentially-evaluated argument of class type (Clause 9)
7144 with a non-trivial copy constructor or a non-trivial destructor
7145 with no corresponding parameter is conditionally-supported, with
7146 implementation-defined semantics.
7148 We support it as pass-by-invisible-reference, just like a normal
7149 value parameter.
7151 If the call appears in the context of a sizeof expression,
7152 it is not potentially-evaluated. */
7153 if (cp_unevaluated_operand == 0
7154 && (type_has_nontrivial_copy_init (arg_type)
7155 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type)))
7157 if (complain & tf_warning)
7158 warning (OPT_Wconditionally_supported,
7159 "passing objects of non-trivially-copyable "
7160 "type %q#T through %<...%> is conditionally supported",
7161 arg_type);
7162 return cp_build_addr_expr (arg, complain);
7166 return arg;
7169 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7171 tree
7172 build_x_va_arg (source_location loc, tree expr, tree type)
7174 if (processing_template_decl)
7176 tree r = build_min (VA_ARG_EXPR, type, expr);
7177 SET_EXPR_LOCATION (r, loc);
7178 return r;
7181 type = complete_type_or_else (type, NULL_TREE);
7183 if (expr == error_mark_node || !type)
7184 return error_mark_node;
7186 expr = mark_lvalue_use (expr);
7188 if (TREE_CODE (type) == REFERENCE_TYPE)
7190 error ("cannot receive reference type %qT through %<...%>", type);
7191 return error_mark_node;
7194 if (type_has_nontrivial_copy_init (type)
7195 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
7197 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7198 it as pass by invisible reference. */
7199 warning_at (loc, OPT_Wconditionally_supported,
7200 "receiving objects of non-trivially-copyable type %q#T "
7201 "through %<...%> is conditionally-supported", type);
7203 tree ref = cp_build_reference_type (type, false);
7204 expr = build_va_arg (loc, expr, ref);
7205 return convert_from_reference (expr);
7208 tree ret = build_va_arg (loc, expr, type);
7209 if (CLASS_TYPE_P (type))
7210 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7211 know how to handle it. */
7212 ret = get_target_expr (ret);
7213 return ret;
7216 /* TYPE has been given to va_arg. Apply the default conversions which
7217 would have happened when passed via ellipsis. Return the promoted
7218 type, or the passed type if there is no change. */
7220 tree
7221 cxx_type_promotes_to (tree type)
7223 tree promote;
7225 /* Perform the array-to-pointer and function-to-pointer
7226 conversions. */
7227 type = type_decays_to (type);
7229 promote = type_promotes_to (type);
7230 if (same_type_p (type, promote))
7231 promote = type;
7233 return promote;
7236 /* ARG is a default argument expression being passed to a parameter of
7237 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7238 zero-based argument number. Do any required conversions. Return
7239 the converted value. */
7241 static GTY(()) vec<tree, va_gc> *default_arg_context;
7242 void
7243 push_defarg_context (tree fn)
7244 { vec_safe_push (default_arg_context, fn); }
7246 void
7247 pop_defarg_context (void)
7248 { default_arg_context->pop (); }
7250 tree
7251 convert_default_arg (tree type, tree arg, tree fn, int parmnum,
7252 tsubst_flags_t complain)
7254 int i;
7255 tree t;
7257 /* See through clones. */
7258 fn = DECL_ORIGIN (fn);
7259 /* And inheriting ctors. */
7260 if (flag_new_inheriting_ctors)
7261 fn = strip_inheriting_ctors (fn);
7263 /* Detect recursion. */
7264 FOR_EACH_VEC_SAFE_ELT (default_arg_context, i, t)
7265 if (t == fn)
7267 if (complain & tf_error)
7268 error ("recursive evaluation of default argument for %q#D", fn);
7269 return error_mark_node;
7272 /* If the ARG is an unparsed default argument expression, the
7273 conversion cannot be performed. */
7274 if (TREE_CODE (arg) == DEFAULT_ARG)
7276 if (complain & tf_error)
7277 error ("call to %qD uses the default argument for parameter %P, which "
7278 "is not yet defined", fn, parmnum);
7279 return error_mark_node;
7282 push_defarg_context (fn);
7284 if (fn && DECL_TEMPLATE_INFO (fn))
7285 arg = tsubst_default_argument (fn, parmnum, type, arg, complain);
7287 /* Due to:
7289 [dcl.fct.default]
7291 The names in the expression are bound, and the semantic
7292 constraints are checked, at the point where the default
7293 expressions appears.
7295 we must not perform access checks here. */
7296 push_deferring_access_checks (dk_no_check);
7297 /* We must make a copy of ARG, in case subsequent processing
7298 alters any part of it. */
7299 arg = break_out_target_exprs (arg);
7300 arg = convert_for_initialization (0, type, arg, LOOKUP_IMPLICIT,
7301 ICR_DEFAULT_ARGUMENT, fn, parmnum,
7302 complain);
7303 arg = convert_for_arg_passing (type, arg, complain);
7304 pop_deferring_access_checks();
7306 pop_defarg_context ();
7308 return arg;
7311 /* Returns the type which will really be used for passing an argument of
7312 type TYPE. */
7314 tree
7315 type_passed_as (tree type)
7317 /* Pass classes with copy ctors by invisible reference. */
7318 if (TREE_ADDRESSABLE (type))
7320 type = build_reference_type (type);
7321 /* There are no other pointers to this temporary. */
7322 type = cp_build_qualified_type (type, TYPE_QUAL_RESTRICT);
7324 else if (targetm.calls.promote_prototypes (type)
7325 && INTEGRAL_TYPE_P (type)
7326 && COMPLETE_TYPE_P (type)
7327 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
7328 type = integer_type_node;
7330 return type;
7333 /* Actually perform the appropriate conversion. */
7335 tree
7336 convert_for_arg_passing (tree type, tree val, tsubst_flags_t complain)
7338 tree bitfield_type;
7340 /* If VAL is a bitfield, then -- since it has already been converted
7341 to TYPE -- it cannot have a precision greater than TYPE.
7343 If it has a smaller precision, we must widen it here. For
7344 example, passing "int f:3;" to a function expecting an "int" will
7345 not result in any conversion before this point.
7347 If the precision is the same we must not risk widening. For
7348 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7349 often have type "int", even though the C++ type for the field is
7350 "long long". If the value is being passed to a function
7351 expecting an "int", then no conversions will be required. But,
7352 if we call convert_bitfield_to_declared_type, the bitfield will
7353 be converted to "long long". */
7354 bitfield_type = is_bitfield_expr_with_lowered_type (val);
7355 if (bitfield_type
7356 && TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type))
7357 val = convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type), val);
7359 if (val == error_mark_node)
7361 /* Pass classes with copy ctors by invisible reference. */
7362 else if (TREE_ADDRESSABLE (type))
7363 val = build1 (ADDR_EXPR, build_reference_type (type), val);
7364 else if (targetm.calls.promote_prototypes (type)
7365 && INTEGRAL_TYPE_P (type)
7366 && COMPLETE_TYPE_P (type)
7367 && tree_int_cst_lt (TYPE_SIZE (type), TYPE_SIZE (integer_type_node)))
7368 val = cp_perform_integral_promotions (val, complain);
7369 if (complain & tf_warning)
7371 if (warn_suggest_attribute_format)
7373 tree rhstype = TREE_TYPE (val);
7374 const enum tree_code coder = TREE_CODE (rhstype);
7375 const enum tree_code codel = TREE_CODE (type);
7376 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
7377 && coder == codel
7378 && check_missing_format_attribute (type, rhstype))
7379 warning (OPT_Wsuggest_attribute_format,
7380 "argument of function call might be a candidate "
7381 "for a format attribute");
7383 maybe_warn_parm_abi (type, EXPR_LOC_OR_LOC (val, input_location));
7385 return val;
7388 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7389 which just decay_conversion or no conversions at all should be done.
7390 This is true for some builtins which don't act like normal functions.
7391 Return 2 if no conversions at all should be done, 1 if just
7392 decay_conversion. Return 3 for special treatment of the 3rd argument
7393 for __builtin_*_overflow_p. */
7396 magic_varargs_p (tree fn)
7398 if (flag_cilkplus && is_cilkplus_reduce_builtin (fn) != BUILT_IN_NONE)
7399 return 2;
7401 if (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL)
7402 switch (DECL_FUNCTION_CODE (fn))
7404 case BUILT_IN_CLASSIFY_TYPE:
7405 case BUILT_IN_CONSTANT_P:
7406 case BUILT_IN_NEXT_ARG:
7407 case BUILT_IN_VA_START:
7408 return 1;
7410 case BUILT_IN_ADD_OVERFLOW_P:
7411 case BUILT_IN_SUB_OVERFLOW_P:
7412 case BUILT_IN_MUL_OVERFLOW_P:
7413 return 3;
7415 default:;
7416 return lookup_attribute ("type generic",
7417 TYPE_ATTRIBUTES (TREE_TYPE (fn))) != 0;
7420 return 0;
7423 /* Returns the decl of the dispatcher function if FN is a function version. */
7425 tree
7426 get_function_version_dispatcher (tree fn)
7428 tree dispatcher_decl = NULL;
7430 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
7431 && DECL_FUNCTION_VERSIONED (fn));
7433 gcc_assert (targetm.get_function_versions_dispatcher);
7434 dispatcher_decl = targetm.get_function_versions_dispatcher (fn);
7436 if (dispatcher_decl == NULL)
7438 error_at (input_location, "use of multiversioned function "
7439 "without a default");
7440 return NULL;
7443 retrofit_lang_decl (dispatcher_decl);
7444 gcc_assert (dispatcher_decl != NULL);
7445 return dispatcher_decl;
7448 /* fn is a function version dispatcher that is marked used. Mark all the
7449 semantically identical function versions it will dispatch as used. */
7451 void
7452 mark_versions_used (tree fn)
7454 struct cgraph_node *node;
7455 struct cgraph_function_version_info *node_v;
7456 struct cgraph_function_version_info *it_v;
7458 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7460 node = cgraph_node::get (fn);
7461 if (node == NULL)
7462 return;
7464 gcc_assert (node->dispatcher_function);
7466 node_v = node->function_version ();
7467 if (node_v == NULL)
7468 return;
7470 /* All semantically identical versions are chained. Traverse and mark each
7471 one of them as used. */
7472 it_v = node_v->next;
7473 while (it_v != NULL)
7475 mark_used (it_v->this_node->decl);
7476 it_v = it_v->next;
7480 /* Build a call to "the copy constructor" for the type of A, even if it
7481 wouldn't be selected by normal overload resolution. Used for
7482 diagnostics. */
7484 static tree
7485 call_copy_ctor (tree a, tsubst_flags_t complain)
7487 tree ctype = TYPE_MAIN_VARIANT (TREE_TYPE (a));
7488 tree binfo = TYPE_BINFO (ctype);
7489 tree copy = get_copy_ctor (ctype, complain);
7490 copy = build_baselink (binfo, binfo, copy, NULL_TREE);
7491 tree ob = build_dummy_object (ctype);
7492 vec<tree, va_gc>* args = make_tree_vector_single (a);
7493 tree r = build_new_method_call (ob, copy, &args, NULL_TREE,
7494 LOOKUP_NORMAL, NULL, complain);
7495 release_tree_vector (args);
7496 return r;
7499 /* Return true iff T refers to a base field. */
7501 static bool
7502 is_base_field_ref (tree t)
7504 STRIP_NOPS (t);
7505 if (TREE_CODE (t) == ADDR_EXPR)
7506 t = TREE_OPERAND (t, 0);
7507 if (TREE_CODE (t) == COMPONENT_REF)
7508 t = TREE_OPERAND (t, 1);
7509 if (TREE_CODE (t) == FIELD_DECL)
7510 return DECL_FIELD_IS_BASE (t);
7511 return false;
7514 /* We can't elide a copy from a function returning by value to a base
7515 subobject, as the callee might clobber tail padding. Return true iff this
7516 could be that case. */
7518 static bool
7519 unsafe_copy_elision_p (tree target, tree exp)
7521 /* Copy elision only happens with a TARGET_EXPR. */
7522 if (TREE_CODE (exp) != TARGET_EXPR)
7523 return false;
7524 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
7525 /* It's safe to elide the copy for a class with no tail padding. */
7526 if (tree_int_cst_equal (TYPE_SIZE (type), CLASSTYPE_SIZE (type)))
7527 return false;
7528 /* It's safe to elide the copy if we aren't initializing a base object. */
7529 if (!is_base_field_ref (target))
7530 return false;
7531 tree init = TARGET_EXPR_INITIAL (exp);
7532 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7533 while (TREE_CODE (init) == COMPOUND_EXPR)
7534 init = TREE_OPERAND (init, 1);
7535 return (TREE_CODE (init) == AGGR_INIT_EXPR
7536 && !AGGR_INIT_VIA_CTOR_P (init));
7539 /* Subroutine of the various build_*_call functions. Overload resolution
7540 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7541 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7542 bitmask of various LOOKUP_* flags which apply to the call itself. */
7544 static tree
7545 build_over_call (struct z_candidate *cand, int flags, tsubst_flags_t complain)
7547 tree fn = cand->fn;
7548 const vec<tree, va_gc> *args = cand->args;
7549 tree first_arg = cand->first_arg;
7550 conversion **convs = cand->convs;
7551 conversion *conv;
7552 tree parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
7553 int parmlen;
7554 tree val;
7555 int i = 0;
7556 int j = 0;
7557 unsigned int arg_index = 0;
7558 int is_method = 0;
7559 int nargs;
7560 tree *argarray;
7561 bool already_used = false;
7563 /* In a template, there is no need to perform all of the work that
7564 is normally done. We are only interested in the type of the call
7565 expression, i.e., the return type of the function. Any semantic
7566 errors will be deferred until the template is instantiated. */
7567 if (processing_template_decl)
7569 tree expr, addr;
7570 tree return_type;
7571 const tree *argarray;
7572 unsigned int nargs;
7574 if (undeduced_auto_decl (fn))
7575 mark_used (fn, complain);
7577 return_type = TREE_TYPE (TREE_TYPE (fn));
7578 nargs = vec_safe_length (args);
7579 if (first_arg == NULL_TREE)
7580 argarray = args->address ();
7581 else
7583 tree *alcarray;
7584 unsigned int ix;
7585 tree arg;
7587 ++nargs;
7588 alcarray = XALLOCAVEC (tree, nargs);
7589 alcarray[0] = build_this (first_arg);
7590 FOR_EACH_VEC_SAFE_ELT (args, ix, arg)
7591 alcarray[ix + 1] = arg;
7592 argarray = alcarray;
7595 addr = build_addr_func (fn, complain);
7596 if (addr == error_mark_node)
7597 return error_mark_node;
7598 expr = build_call_array_loc (input_location, return_type,
7599 addr, nargs, argarray);
7600 if (TREE_THIS_VOLATILE (fn) && cfun)
7601 current_function_returns_abnormally = 1;
7602 return convert_from_reference (expr);
7605 /* Give any warnings we noticed during overload resolution. */
7606 if (cand->warnings && (complain & tf_warning))
7608 struct candidate_warning *w;
7609 for (w = cand->warnings; w; w = w->next)
7610 joust (cand, w->loser, 1, complain);
7613 /* OK, we're actually calling this inherited constructor; set its deletedness
7614 appropriately. We can get away with doing this here because calling is
7615 the only way to refer to a constructor. */
7616 if (DECL_INHERITED_CTOR (fn))
7617 deduce_inheriting_ctor (fn);
7619 /* Make =delete work with SFINAE. */
7620 if (DECL_DELETED_FN (fn) && !(complain & tf_error))
7621 return error_mark_node;
7623 if (DECL_FUNCTION_MEMBER_P (fn))
7625 tree access_fn;
7626 /* If FN is a template function, two cases must be considered.
7627 For example:
7629 struct A {
7630 protected:
7631 template <class T> void f();
7633 template <class T> struct B {
7634 protected:
7635 void g();
7637 struct C : A, B<int> {
7638 using A::f; // #1
7639 using B<int>::g; // #2
7642 In case #1 where `A::f' is a member template, DECL_ACCESS is
7643 recorded in the primary template but not in its specialization.
7644 We check access of FN using its primary template.
7646 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7647 because it is a member of class template B, DECL_ACCESS is
7648 recorded in the specialization `B<int>::g'. We cannot use its
7649 primary template because `B<T>::g' and `B<int>::g' may have
7650 different access. */
7651 if (DECL_TEMPLATE_INFO (fn)
7652 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
7653 access_fn = DECL_TI_TEMPLATE (fn);
7654 else
7655 access_fn = fn;
7656 if (!perform_or_defer_access_check (cand->access_path, access_fn,
7657 fn, complain))
7658 return error_mark_node;
7661 /* If we're checking for implicit delete, don't bother with argument
7662 conversions. */
7663 if (flags & LOOKUP_SPECULATIVE)
7665 if (DECL_DELETED_FN (fn))
7667 if (complain & tf_error)
7668 mark_used (fn);
7669 return error_mark_node;
7671 if (cand->viable == 1)
7672 return fn;
7673 else if (!(complain & tf_error))
7674 /* Reject bad conversions now. */
7675 return error_mark_node;
7676 /* else continue to get conversion error. */
7679 /* N3276 magic doesn't apply to nested calls. */
7680 int decltype_flag = (complain & tf_decltype);
7681 complain &= ~tf_decltype;
7683 /* Find maximum size of vector to hold converted arguments. */
7684 parmlen = list_length (parm);
7685 nargs = vec_safe_length (args) + (first_arg != NULL_TREE ? 1 : 0);
7686 if (parmlen > nargs)
7687 nargs = parmlen;
7688 argarray = XALLOCAVEC (tree, nargs);
7690 /* The implicit parameters to a constructor are not considered by overload
7691 resolution, and must be of the proper type. */
7692 if (DECL_CONSTRUCTOR_P (fn))
7694 tree object_arg;
7695 if (first_arg != NULL_TREE)
7697 object_arg = first_arg;
7698 first_arg = NULL_TREE;
7700 else
7702 object_arg = (*args)[arg_index];
7703 ++arg_index;
7705 argarray[j++] = build_this (object_arg);
7706 parm = TREE_CHAIN (parm);
7707 /* We should never try to call the abstract constructor. */
7708 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn));
7710 if (DECL_HAS_VTT_PARM_P (fn))
7712 argarray[j++] = (*args)[arg_index];
7713 ++arg_index;
7714 parm = TREE_CHAIN (parm);
7717 if (flags & LOOKUP_PREFER_RVALUE)
7719 /* The implicit move specified in 15.8.3/3 fails "...if the type of
7720 the first parameter of the selected constructor is not an rvalue
7721 reference to the object’s type (possibly cv-qualified)...." */
7722 gcc_assert (!(complain & tf_error));
7723 tree ptype = convs[0]->type;
7724 if (TREE_CODE (ptype) != REFERENCE_TYPE
7725 || !TYPE_REF_IS_RVALUE (ptype)
7726 || CONVERSION_RANK (convs[0]) > cr_exact)
7727 return error_mark_node;
7730 /* Bypass access control for 'this' parameter. */
7731 else if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
7733 tree parmtype = TREE_VALUE (parm);
7734 tree arg = build_this (first_arg != NULL_TREE
7735 ? first_arg
7736 : (*args)[arg_index]);
7737 tree argtype = TREE_TYPE (arg);
7738 tree converted_arg;
7739 tree base_binfo;
7741 if (convs[i]->bad_p)
7743 if (complain & tf_error)
7745 if (permerror (input_location, "passing %qT as %<this%> "
7746 "argument discards qualifiers",
7747 TREE_TYPE (argtype)))
7748 inform (DECL_SOURCE_LOCATION (fn), " in call to %qD", fn);
7750 else
7751 return error_mark_node;
7754 /* See if the function member or the whole class type is declared
7755 final and the call can be devirtualized. */
7756 if (DECL_FINAL_P (fn)
7757 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn))))
7758 flags |= LOOKUP_NONVIRTUAL;
7760 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
7761 X is called for an object that is not of type X, or of a type
7762 derived from X, the behavior is undefined.
7764 So we can assume that anything passed as 'this' is non-null, and
7765 optimize accordingly. */
7766 gcc_assert (TYPE_PTR_P (parmtype));
7767 /* Convert to the base in which the function was declared. */
7768 gcc_assert (cand->conversion_path != NULL_TREE);
7769 converted_arg = build_base_path (PLUS_EXPR,
7770 arg,
7771 cand->conversion_path,
7772 1, complain);
7773 /* Check that the base class is accessible. */
7774 if (!accessible_base_p (TREE_TYPE (argtype),
7775 BINFO_TYPE (cand->conversion_path), true))
7777 if (complain & tf_error)
7778 error ("%qT is not an accessible base of %qT",
7779 BINFO_TYPE (cand->conversion_path),
7780 TREE_TYPE (argtype));
7781 else
7782 return error_mark_node;
7784 /* If fn was found by a using declaration, the conversion path
7785 will be to the derived class, not the base declaring fn. We
7786 must convert from derived to base. */
7787 base_binfo = lookup_base (TREE_TYPE (TREE_TYPE (converted_arg)),
7788 TREE_TYPE (parmtype), ba_unique,
7789 NULL, complain);
7790 converted_arg = build_base_path (PLUS_EXPR, converted_arg,
7791 base_binfo, 1, complain);
7793 argarray[j++] = converted_arg;
7794 parm = TREE_CHAIN (parm);
7795 if (first_arg != NULL_TREE)
7796 first_arg = NULL_TREE;
7797 else
7798 ++arg_index;
7799 ++i;
7800 is_method = 1;
7803 gcc_assert (first_arg == NULL_TREE);
7804 for (; arg_index < vec_safe_length (args) && parm;
7805 parm = TREE_CHAIN (parm), ++arg_index, ++i)
7807 tree type = TREE_VALUE (parm);
7808 tree arg = (*args)[arg_index];
7809 bool conversion_warning = true;
7811 conv = convs[i];
7813 /* If the argument is NULL and used to (implicitly) instantiate a
7814 template function (and bind one of the template arguments to
7815 the type of 'long int'), we don't want to warn about passing NULL
7816 to non-pointer argument.
7817 For example, if we have this template function:
7819 template<typename T> void func(T x) {}
7821 we want to warn (when -Wconversion is enabled) in this case:
7823 void foo() {
7824 func<int>(NULL);
7827 but not in this case:
7829 void foo() {
7830 func(NULL);
7833 if (arg == null_node
7834 && DECL_TEMPLATE_INFO (fn)
7835 && cand->template_decl
7836 && !(flags & LOOKUP_EXPLICIT_TMPL_ARGS))
7837 conversion_warning = false;
7839 /* Warn about initializer_list deduction that isn't currently in the
7840 working draft. */
7841 if (cxx_dialect > cxx98
7842 && flag_deduce_init_list
7843 && cand->template_decl
7844 && is_std_init_list (non_reference (type))
7845 && BRACE_ENCLOSED_INITIALIZER_P (arg))
7847 tree tmpl = TI_TEMPLATE (cand->template_decl);
7848 tree realparm = chain_index (j, DECL_ARGUMENTS (cand->fn));
7849 tree patparm = get_pattern_parm (realparm, tmpl);
7850 tree pattype = TREE_TYPE (patparm);
7851 if (PACK_EXPANSION_P (pattype))
7852 pattype = PACK_EXPANSION_PATTERN (pattype);
7853 pattype = non_reference (pattype);
7855 if (TREE_CODE (pattype) == TEMPLATE_TYPE_PARM
7856 && (cand->explicit_targs == NULL_TREE
7857 || (TREE_VEC_LENGTH (cand->explicit_targs)
7858 <= TEMPLATE_TYPE_IDX (pattype))))
7860 pedwarn (input_location, 0, "deducing %qT as %qT",
7861 non_reference (TREE_TYPE (patparm)),
7862 non_reference (type));
7863 pedwarn (DECL_SOURCE_LOCATION (cand->fn), 0,
7864 " in call to %qD", cand->fn);
7865 pedwarn (input_location, 0,
7866 " (you can disable this with -fno-deduce-init-list)");
7870 /* Set user_conv_p on the argument conversions, so rvalue/base handling
7871 knows not to allow any more UDCs. This needs to happen after we
7872 process cand->warnings. */
7873 if (flags & LOOKUP_NO_CONVERSION)
7874 conv->user_conv_p = true;
7876 tsubst_flags_t arg_complain = complain & (~tf_no_cleanup);
7877 if (!conversion_warning)
7878 arg_complain &= ~tf_warning;
7880 val = convert_like_with_context (conv, arg, fn, i - is_method,
7881 arg_complain);
7882 val = convert_for_arg_passing (type, val, arg_complain);
7884 if (val == error_mark_node)
7885 return error_mark_node;
7886 else
7887 argarray[j++] = val;
7890 /* Default arguments */
7891 for (; parm && parm != void_list_node; parm = TREE_CHAIN (parm), i++)
7893 if (TREE_VALUE (parm) == error_mark_node)
7894 return error_mark_node;
7895 val = convert_default_arg (TREE_VALUE (parm),
7896 TREE_PURPOSE (parm),
7897 fn, i - is_method,
7898 complain);
7899 if (val == error_mark_node)
7900 return error_mark_node;
7901 argarray[j++] = val;
7904 /* Ellipsis */
7905 int magic = magic_varargs_p (fn);
7906 for (; arg_index < vec_safe_length (args); ++arg_index)
7908 tree a = (*args)[arg_index];
7909 if ((magic == 3 && arg_index == 2) || magic == 2)
7911 /* Do no conversions for certain magic varargs. */
7912 a = mark_type_use (a);
7913 if (TREE_CODE (a) == FUNCTION_DECL && reject_gcc_builtin (a))
7914 return error_mark_node;
7916 else if (magic != 0)
7917 /* For other magic varargs only do decay_conversion. */
7918 a = decay_conversion (a, complain);
7919 else if (DECL_CONSTRUCTOR_P (fn)
7920 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn),
7921 TREE_TYPE (a)))
7923 /* Avoid infinite recursion trying to call A(...). */
7924 if (complain & tf_error)
7925 /* Try to call the actual copy constructor for a good error. */
7926 call_copy_ctor (a, complain);
7927 return error_mark_node;
7929 else
7930 a = convert_arg_to_ellipsis (a, complain);
7931 if (a == error_mark_node)
7932 return error_mark_node;
7933 argarray[j++] = a;
7936 gcc_assert (j <= nargs);
7937 nargs = j;
7939 /* Avoid to do argument-transformation, if warnings for format, and for
7940 nonnull are disabled. Just in case that at least one of them is active
7941 the check_function_arguments function might warn about something. */
7943 bool warned_p = false;
7944 if (warn_nonnull
7945 || warn_format
7946 || warn_suggest_attribute_format
7947 || warn_restrict)
7949 tree *fargs = (!nargs ? argarray
7950 : (tree *) alloca (nargs * sizeof (tree)));
7951 for (j = 0; j < nargs; j++)
7952 fargs[j] = maybe_constant_value (argarray[j]);
7954 warned_p = check_function_arguments (input_location, fn, TREE_TYPE (fn),
7955 nargs, fargs, NULL);
7958 if (DECL_INHERITED_CTOR (fn))
7960 /* Check for passing ellipsis arguments to an inherited constructor. We
7961 could handle this by open-coding the inherited constructor rather than
7962 defining it, but let's not bother now. */
7963 if (!cp_unevaluated_operand
7964 && cand->num_convs
7965 && cand->convs[cand->num_convs-1]->ellipsis_p)
7967 if (complain & tf_error)
7969 sorry ("passing arguments to ellipsis of inherited constructor "
7970 "%qD", cand->fn);
7971 inform (DECL_SOURCE_LOCATION (cand->fn), "declared here");
7973 return error_mark_node;
7976 /* A base constructor inheriting from a virtual base doesn't get the
7977 inherited arguments, just this and __vtt. */
7978 if (ctor_omit_inherited_parms (fn))
7979 nargs = 2;
7982 /* Avoid actually calling copy constructors and copy assignment operators,
7983 if possible. */
7985 if (! flag_elide_constructors)
7986 /* Do things the hard way. */;
7987 else if (cand->num_convs == 1
7988 && (DECL_COPY_CONSTRUCTOR_P (fn)
7989 || DECL_MOVE_CONSTRUCTOR_P (fn))
7990 /* It's unsafe to elide the constructor when handling
7991 a noexcept-expression, it may evaluate to the wrong
7992 value (c++/53025). */
7993 && cp_noexcept_operand == 0)
7995 tree targ;
7996 tree arg = argarray[num_artificial_parms_for (fn)];
7997 tree fa;
7998 bool trivial = trivial_fn_p (fn);
8000 /* Pull out the real argument, disregarding const-correctness. */
8001 targ = arg;
8002 /* Strip the reference binding for the constructor parameter. */
8003 if (CONVERT_EXPR_P (targ)
8004 && TREE_CODE (TREE_TYPE (targ)) == REFERENCE_TYPE)
8005 targ = TREE_OPERAND (targ, 0);
8006 /* But don't strip any other reference bindings; binding a temporary to a
8007 reference prevents copy elision. */
8008 while ((CONVERT_EXPR_P (targ)
8009 && TREE_CODE (TREE_TYPE (targ)) != REFERENCE_TYPE)
8010 || TREE_CODE (targ) == NON_LVALUE_EXPR)
8011 targ = TREE_OPERAND (targ, 0);
8012 if (TREE_CODE (targ) == ADDR_EXPR)
8014 targ = TREE_OPERAND (targ, 0);
8015 if (!same_type_ignoring_top_level_qualifiers_p
8016 (TREE_TYPE (TREE_TYPE (arg)), TREE_TYPE (targ)))
8017 targ = NULL_TREE;
8019 else
8020 targ = NULL_TREE;
8022 if (targ)
8023 arg = targ;
8024 else
8025 arg = cp_build_indirect_ref (arg, RO_NULL, complain);
8027 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8028 subobject. */
8029 if (CHECKING_P && cxx_dialect >= cxx1z)
8030 gcc_assert (TREE_CODE (arg) != TARGET_EXPR
8031 /* It's from binding the ref parm to a packed field. */
8032 || convs[0]->need_temporary_p
8033 || seen_error ()
8034 /* See unsafe_copy_elision_p. */
8035 || DECL_BASE_CONSTRUCTOR_P (fn));
8037 /* [class.copy]: the copy constructor is implicitly defined even if
8038 the implementation elided its use. */
8039 if (!trivial || DECL_DELETED_FN (fn))
8041 if (!mark_used (fn, complain) && !(complain & tf_error))
8042 return error_mark_node;
8043 already_used = true;
8046 /* If we're creating a temp and we already have one, don't create a
8047 new one. If we're not creating a temp but we get one, use
8048 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8049 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8050 temp or an INIT_EXPR otherwise. */
8051 fa = argarray[0];
8052 if (is_dummy_object (fa))
8054 if (TREE_CODE (arg) == TARGET_EXPR)
8055 return arg;
8056 else if (trivial)
8057 return force_target_expr (DECL_CONTEXT (fn), arg, complain);
8059 else if ((trivial || TREE_CODE (arg) == TARGET_EXPR)
8060 && !unsafe_copy_elision_p (fa, arg))
8062 tree to = cp_stabilize_reference (cp_build_indirect_ref (fa,
8063 RO_NULL,
8064 complain));
8066 val = build2 (INIT_EXPR, DECL_CONTEXT (fn), to, arg);
8067 return val;
8070 else if (DECL_OVERLOADED_OPERATOR_P (fn) == NOP_EXPR
8071 && trivial_fn_p (fn)
8072 && !DECL_DELETED_FN (fn))
8074 tree to = cp_stabilize_reference
8075 (cp_build_indirect_ref (argarray[0], RO_NULL, complain));
8076 tree type = TREE_TYPE (to);
8077 tree as_base = CLASSTYPE_AS_BASE (type);
8078 tree arg = argarray[1];
8080 if (is_really_empty_class (type))
8082 /* Avoid copying empty classes. */
8083 val = build2 (COMPOUND_EXPR, type, arg, to);
8084 TREE_NO_WARNING (val) = 1;
8086 else if (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (as_base)))
8088 arg = cp_build_indirect_ref (arg, RO_NULL, complain);
8089 val = build2 (MODIFY_EXPR, TREE_TYPE (to), to, arg);
8090 /* Handle NSDMI that refer to the object being initialized. */
8091 replace_placeholders (arg, to);
8093 else
8095 /* We must only copy the non-tail padding parts. */
8096 tree arg0, arg2, t;
8097 tree array_type, alias_set;
8099 arg2 = TYPE_SIZE_UNIT (as_base);
8100 arg0 = cp_build_addr_expr (to, complain);
8102 array_type = build_array_type (unsigned_char_type_node,
8103 build_index_type
8104 (size_binop (MINUS_EXPR,
8105 arg2, size_int (1))));
8106 alias_set = build_int_cst (build_pointer_type (type), 0);
8107 t = build2 (MODIFY_EXPR, void_type_node,
8108 build2 (MEM_REF, array_type, arg0, alias_set),
8109 build2 (MEM_REF, array_type, arg, alias_set));
8110 val = build2 (COMPOUND_EXPR, TREE_TYPE (to), t, to);
8111 TREE_NO_WARNING (val) = 1;
8114 return val;
8116 else if (!DECL_DELETED_FN (fn)
8117 && trivial_fn_p (fn))
8119 if (DECL_DESTRUCTOR_P (fn))
8120 return fold_convert (void_type_node, argarray[0]);
8121 else if (default_ctor_p (fn))
8123 if (is_dummy_object (argarray[0]))
8124 return force_target_expr (DECL_CONTEXT (fn), void_node, complain);
8125 else
8126 return cp_build_indirect_ref (argarray[0], RO_NULL, complain);
8130 /* For calls to a multi-versioned function, overload resolution
8131 returns the function with the highest target priority, that is,
8132 the version that will checked for dispatching first. If this
8133 version is inlinable, a direct call to this version can be made
8134 otherwise the call should go through the dispatcher. */
8136 if (DECL_FUNCTION_VERSIONED (fn)
8137 && (current_function_decl == NULL
8138 || !targetm.target_option.can_inline_p (current_function_decl, fn)))
8140 fn = get_function_version_dispatcher (fn);
8141 if (fn == NULL)
8142 return NULL;
8143 if (!already_used)
8144 mark_versions_used (fn);
8147 if (!already_used
8148 && !mark_used (fn, complain))
8149 return error_mark_node;
8151 if (DECL_VINDEX (fn) && (flags & LOOKUP_NONVIRTUAL) == 0
8152 /* Don't mess with virtual lookup in instantiate_non_dependent_expr;
8153 virtual functions can't be constexpr. */
8154 && !in_template_function ())
8156 tree t;
8157 tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (argarray[0])),
8158 DECL_CONTEXT (fn),
8159 ba_any, NULL, complain);
8160 gcc_assert (binfo && binfo != error_mark_node);
8162 argarray[0] = build_base_path (PLUS_EXPR, argarray[0], binfo, 1,
8163 complain);
8164 if (TREE_SIDE_EFFECTS (argarray[0]))
8165 argarray[0] = save_expr (argarray[0]);
8166 t = build_pointer_type (TREE_TYPE (fn));
8167 fn = build_vfn_ref (argarray[0], DECL_VINDEX (fn));
8168 TREE_TYPE (fn) = t;
8170 else
8172 fn = build_addr_func (fn, complain);
8173 if (fn == error_mark_node)
8174 return error_mark_node;
8177 tree call = build_cxx_call (fn, nargs, argarray, complain|decltype_flag);
8178 if (call == error_mark_node)
8179 return call;
8180 if (cand->flags & LOOKUP_LIST_INIT_CTOR)
8182 tree c = extract_call_expr (call);
8183 /* build_new_op_1 will clear this when appropriate. */
8184 CALL_EXPR_ORDERED_ARGS (c) = true;
8186 if (warned_p)
8188 tree c = extract_call_expr (call);
8189 if (TREE_CODE (c) == CALL_EXPR)
8190 TREE_NO_WARNING (c) = 1;
8192 return call;
8195 /* Return the DECL of the first non-public data member of class TYPE
8196 or null if none can be found. */
8198 static tree
8199 first_non_public_field (tree type)
8201 if (!CLASS_TYPE_P (type))
8202 return NULL_TREE;
8204 for (tree field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
8206 if (TREE_CODE (field) != FIELD_DECL)
8207 continue;
8208 if (TREE_STATIC (field))
8209 continue;
8210 if (TREE_PRIVATE (field) || TREE_PROTECTED (field))
8211 return field;
8214 int i = 0;
8216 for (tree base_binfo, binfo = TYPE_BINFO (type);
8217 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
8219 tree base = TREE_TYPE (base_binfo);
8221 if (tree field = first_non_public_field (base))
8222 return field;
8225 return NULL_TREE;
8228 /* Return true if all copy and move assignment operator overloads for
8229 class TYPE are trivial and at least one of them is not deleted and,
8230 when ACCESS is set, accessible. Return false otherwise. Set
8231 HASASSIGN to true when the TYPE has a (not necessarily trivial)
8232 copy or move assignment. */
8234 static bool
8235 has_trivial_copy_assign_p (tree type, bool access, bool *hasassign)
8237 tree fns = cp_assignment_operator_id (NOP_EXPR);
8238 fns = lookup_fnfields_slot (type, fns);
8240 bool all_trivial = true;
8242 /* Iterate over overloads of the assignment operator, checking
8243 accessible copy assignments for triviality. */
8245 for (ovl_iterator oi (fns); oi; ++oi)
8247 tree f = *oi;
8249 /* Skip operators that aren't copy assignments. */
8250 if (!copy_fn_p (f))
8251 continue;
8253 bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f))
8254 || accessible_p (TYPE_BINFO (type), f, true));
8256 /* Skip template assignment operators and deleted functions. */
8257 if (TREE_CODE (f) != FUNCTION_DECL || DECL_DELETED_FN (f))
8258 continue;
8260 if (accessible)
8261 *hasassign = true;
8263 if (!accessible || !trivial_fn_p (f))
8264 all_trivial = false;
8266 /* Break early when both properties have been determined. */
8267 if (*hasassign && !all_trivial)
8268 break;
8271 /* Return true if they're all trivial and one of the expressions
8272 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
8273 tree ref = cp_build_reference_type (type, false);
8274 return (all_trivial
8275 && (is_trivially_xible (MODIFY_EXPR, type, type)
8276 || is_trivially_xible (MODIFY_EXPR, type, ref)));
8279 /* Return true if all copy and move ctor overloads for class TYPE are
8280 trivial and at least one of them is not deleted and, when ACCESS is
8281 set, accessible. Return false otherwise. Set each element of HASCTOR[]
8282 to true when the TYPE has a (not necessarily trivial) default and copy
8283 (or move) ctor, respectively. */
8285 static bool
8286 has_trivial_copy_p (tree type, bool access, bool hasctor[2])
8288 tree fns = lookup_fnfields_slot (type, complete_ctor_identifier);
8290 bool all_trivial = true;
8292 for (ovl_iterator oi (fns); oi; ++oi)
8294 tree f = *oi;
8296 /* Skip template constructors. */
8297 if (TREE_CODE (f) != FUNCTION_DECL)
8298 continue;
8300 bool cpy_or_move_ctor_p = copy_fn_p (f);
8302 /* Skip ctors other than default, copy, and move. */
8303 if (!cpy_or_move_ctor_p && !default_ctor_p (f))
8304 continue;
8306 if (DECL_DELETED_FN (f))
8307 continue;
8309 bool accessible = (!access || !(TREE_PRIVATE (f) || TREE_PROTECTED (f))
8310 || accessible_p (TYPE_BINFO (type), f, true));
8312 if (accessible)
8313 hasctor[cpy_or_move_ctor_p] = true;
8315 if (cpy_or_move_ctor_p && (!accessible || !trivial_fn_p (f)))
8316 all_trivial = false;
8318 /* Break early when both properties have been determined. */
8319 if (hasctor[0] && hasctor[1] && !all_trivial)
8320 break;
8323 return all_trivial;
8326 /* Issue a warning on a call to the built-in function FNDECL if it is
8327 a raw memory write whose destination is not an object of (something
8328 like) trivial or standard layout type with a non-deleted assignment
8329 and copy ctor. Detects const correctness violations, corrupting
8330 references, virtual table pointers, and bypassing non-trivial
8331 assignments. */
8333 static void
8334 maybe_warn_class_memaccess (location_t loc, tree fndecl, tree *args)
8336 /* Except for bcopy where it's second, the destination pointer is
8337 the first argument for all functions handled here. Compute
8338 the index of the destination and source arguments. */
8339 unsigned dstidx = DECL_FUNCTION_CODE (fndecl) == BUILT_IN_BCOPY;
8340 unsigned srcidx = !dstidx;
8342 tree dest = args[dstidx];
8343 if (!dest || !TREE_TYPE (dest) || !POINTER_TYPE_P (TREE_TYPE (dest)))
8344 return;
8346 /* Remove the outermost (usually implicit) conversion to the void*
8347 argument type. */
8348 if (TREE_CODE (dest) == NOP_EXPR)
8349 dest = TREE_OPERAND (dest, 0);
8351 tree srctype = NULL_TREE;
8353 /* Determine the type of the pointed-to object and whether it's
8354 a complete class type. */
8355 tree desttype = TREE_TYPE (TREE_TYPE (dest));
8357 if (!desttype || !COMPLETE_TYPE_P (desttype) || !CLASS_TYPE_P (desttype))
8358 return;
8360 /* Check to see if the raw memory call is made by a ctor or dtor
8361 with this as the destination argument for the destination type.
8362 If so, be more permissive. */
8363 if (current_function_decl
8364 && (DECL_CONSTRUCTOR_P (current_function_decl)
8365 || DECL_DESTRUCTOR_P (current_function_decl))
8366 && is_this_parameter (tree_strip_nop_conversions (dest)))
8368 tree ctx = DECL_CONTEXT (current_function_decl);
8369 bool special = same_type_ignoring_top_level_qualifiers_p (ctx, desttype);
8371 tree binfo = TYPE_BINFO (ctx);
8373 /* A ctor and dtor for a class with no bases and no virtual functions
8374 can do whatever they want. Bail early with no further checking. */
8375 if (special && !BINFO_VTABLE (binfo) && !BINFO_N_BASE_BINFOS (binfo))
8376 return;
8379 /* True if the class is trivial. */
8380 bool trivial = trivial_type_p (desttype);
8382 /* Set to true if DESTYPE has an accessible copy assignment. */
8383 bool hasassign = false;
8384 /* True if all of the class' overloaded copy assignment operators
8385 are all trivial (and not deleted) and at least one of them is
8386 accessible. */
8387 bool trivassign = has_trivial_copy_assign_p (desttype, true, &hasassign);
8389 /* Set to true if DESTTYPE has an accessible default and copy ctor,
8390 respectively. */
8391 bool hasctors[2] = { false, false };
8393 /* True if all of the class' overloaded copy constructors are all
8394 trivial (and not deleted) and at least one of them is accessible. */
8395 bool trivcopy = has_trivial_copy_p (desttype, true, hasctors);
8397 /* Set FLD to the first private/protected member of the class. */
8398 tree fld = trivial ? first_non_public_field (desttype) : NULL_TREE;
8400 /* The warning format string. */
8401 const char *warnfmt = NULL;
8402 /* A suggested alternative to offer instead of the raw memory call.
8403 Empty string when none can be come up with. */
8404 const char *suggest = "";
8405 bool warned = false;
8407 switch (DECL_FUNCTION_CODE (fndecl))
8409 case BUILT_IN_MEMSET:
8410 if (!integer_zerop (args[1]))
8412 /* Diagnose setting non-copy-assignable or non-trivial types,
8413 or types with a private member, to (potentially) non-zero
8414 bytes. Since the value of the bytes being written is unknown,
8415 suggest using assignment instead (if one exists). Also warn
8416 for writes into objects for which zero-initialization doesn't
8417 mean all bits clear (pointer-to-member data, where null is all
8418 bits set). Since the value being written is (most likely)
8419 non-zero, simply suggest assignment (but not copy assignment). */
8420 suggest = "; use assignment instead";
8421 if (!trivassign)
8422 warnfmt = G_("%qD writing to an object of type %#qT with "
8423 "no trivial copy-assignment");
8424 else if (!trivial)
8425 warnfmt = G_("%qD writing to an object of non-trivial type %#qT%s");
8426 else if (fld)
8428 const char *access = TREE_PRIVATE (fld) ? "private" : "protected";
8429 warned = warning_at (loc, OPT_Wclass_memaccess,
8430 "%qD writing to an object of type %#qT with "
8431 "%qs member %qD",
8432 fndecl, desttype, access, fld);
8434 else if (!zero_init_p (desttype))
8435 warnfmt = G_("%qD writing to an object of type %#qT containing "
8436 "a pointer to data member%s");
8438 break;
8440 /* Fall through. */
8442 case BUILT_IN_BZERO:
8443 /* Similarly to the above, diagnose clearing non-trivial or non-
8444 standard layout objects, or objects of types with no assignmenmt.
8445 Since the value being written is known to be zero, suggest either
8446 copy assignment, copy ctor, or default ctor as an alternative,
8447 depending on what's available. */
8449 if (hasassign && hasctors[0])
8450 suggest = G_("; use assignment or value-initialization instead");
8451 else if (hasassign)
8452 suggest = G_("; use assignment instead");
8453 else if (hasctors[0])
8454 suggest = G_("; use value-initialization instead");
8456 if (!trivassign)
8457 warnfmt = G_("%qD clearing an object of type %#qT with "
8458 "no trivial copy-assignment%s");
8459 else if (!trivial)
8460 warnfmt = G_("%qD clearing an object of non-trivial type %#qT%s");
8461 else if (!zero_init_p (desttype))
8462 warnfmt = G_("%qD clearing an object of type %#qT containing "
8463 "a pointer-to-member%s");
8464 break;
8466 case BUILT_IN_BCOPY:
8467 case BUILT_IN_MEMCPY:
8468 case BUILT_IN_MEMMOVE:
8469 case BUILT_IN_MEMPCPY:
8470 /* Determine the type of the source object. */
8471 srctype = STRIP_NOPS (args[srcidx]);
8472 srctype = TREE_TYPE (TREE_TYPE (srctype));
8474 /* Since it's impossible to determine wheter the byte copy is
8475 being used in place of assignment to an existing object or
8476 as a substitute for initialization, assume it's the former.
8477 Determine the best alternative to use instead depending on
8478 what's not deleted. */
8479 if (hasassign && hasctors[1])
8480 suggest = G_("; use copy-assignment or copy-initialization instead");
8481 else if (hasassign)
8482 suggest = G_("; use copy-assignment instead");
8483 else if (hasctors[1])
8484 suggest = G_("; use copy-initialization instead");
8486 if (!trivassign)
8487 warnfmt = G_("%qD writing to an object of type %#qT with no trivial "
8488 "copy-assignment%s");
8489 else if (!trivially_copyable_p (desttype))
8490 warnfmt = G_("%qD writing to an object of non-trivially copyable "
8491 "type %#qT%s");
8492 else if (!trivcopy)
8493 warnfmt = G_("%qD writing to an object with a deleted copy constructor");
8495 else if (!trivial
8496 && !VOID_TYPE_P (srctype)
8497 && !char_type_p (TYPE_MAIN_VARIANT (srctype))
8498 && !same_type_ignoring_top_level_qualifiers_p (desttype,
8499 srctype))
8501 /* Warn when copying into a non-trivial object from an object
8502 of a different type other than void or char. */
8503 warned = warning_at (loc, OPT_Wclass_memaccess,
8504 "%qD copying an object of non-trivial type "
8505 "%#qT from an array of %#qT",
8506 fndecl, desttype, srctype);
8508 else if (fld
8509 && !VOID_TYPE_P (srctype)
8510 && !char_type_p (TYPE_MAIN_VARIANT (srctype))
8511 && !same_type_ignoring_top_level_qualifiers_p (desttype,
8512 srctype))
8514 const char *access = TREE_PRIVATE (fld) ? "private" : "protected";
8515 warned = warning_at (loc, OPT_Wclass_memaccess,
8516 "%qD copying an object of type %#qT with "
8517 "%qs member %qD from an array of %#qT; use "
8518 "assignment or copy-initialization instead",
8519 fndecl, desttype, access, fld, srctype);
8521 else if (!trivial && TREE_CODE (args[2]) == INTEGER_CST)
8523 /* Finally, warn on partial copies. */
8524 unsigned HOST_WIDE_INT typesize
8525 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype));
8526 if (unsigned HOST_WIDE_INT partial
8527 = tree_to_uhwi (args[2]) % typesize)
8528 warned = warning_at (loc, OPT_Wclass_memaccess,
8529 (typesize - partial > 1
8530 ? G_("%qD writing to an object of "
8531 "a non-trivial type %#qT leaves %wu "
8532 "bytes unchanged")
8533 : G_("%qD writing to an object of "
8534 "a non-trivial type %#qT leaves %wu "
8535 "byte unchanged")),
8536 fndecl, desttype, typesize - partial);
8538 break;
8540 case BUILT_IN_REALLOC:
8542 if (!trivially_copyable_p (desttype))
8543 warnfmt = G_("%qD moving an object of non-trivially copyable type "
8544 "%#qT; use %<new%> and %<delete%> instead");
8545 else if (!trivcopy)
8546 warnfmt = G_("%qD moving an object of type %#qT with deleted copy "
8547 "constructor; use %<new%> and %<delete%> instead");
8548 else if (!get_dtor (desttype, tf_none))
8549 warnfmt = G_("%qD moving an object of type %#qT with deleted "
8550 "destructor");
8551 else if (!trivial
8552 && TREE_CODE (args[1]) == INTEGER_CST
8553 && tree_int_cst_lt (args[1], TYPE_SIZE_UNIT (desttype)))
8555 /* Finally, warn on reallocation into insufficient space. */
8556 warned = warning_at (loc, OPT_Wclass_memaccess,
8557 "%qD moving an object of non-trivial type "
8558 "%#qT and size %E into a region of size %E",
8559 fndecl, desttype, TYPE_SIZE_UNIT (desttype),
8560 args[1]);
8562 break;
8564 default:
8565 return;
8568 if (!warned && !warnfmt)
8569 return;
8571 if (warnfmt)
8573 if (suggest)
8574 warned = warning_at (loc, OPT_Wclass_memaccess,
8575 warnfmt, fndecl, desttype, suggest);
8576 else
8577 warned = warning_at (loc, OPT_Wclass_memaccess,
8578 warnfmt, fndecl, desttype);
8581 if (warned)
8582 inform (location_of (desttype), "%#qT declared here", desttype);
8585 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
8586 This function performs no overload resolution, conversion, or other
8587 high-level operations. */
8589 tree
8590 build_cxx_call (tree fn, int nargs, tree *argarray,
8591 tsubst_flags_t complain)
8593 tree fndecl;
8595 /* Remember roughly where this call is. */
8596 location_t loc = EXPR_LOC_OR_LOC (fn, input_location);
8597 fn = build_call_a (fn, nargs, argarray);
8598 SET_EXPR_LOCATION (fn, loc);
8600 fndecl = get_callee_fndecl (fn);
8602 /* Check that arguments to builtin functions match the expectations. */
8603 if (fndecl
8604 && DECL_BUILT_IN (fndecl)
8605 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
8607 int i;
8609 /* We need to take care that values to BUILT_IN_NORMAL
8610 are reduced. */
8611 for (i = 0; i < nargs; i++)
8612 argarray[i] = fold_non_dependent_expr (argarray[i]);
8614 if (!check_builtin_function_arguments (EXPR_LOCATION (fn), vNULL, fndecl,
8615 nargs, argarray))
8616 return error_mark_node;
8618 /* Warn if the built-in writes to an object of a non-trivial type. */
8619 if (nargs)
8620 maybe_warn_class_memaccess (loc, fndecl, argarray);
8623 /* If it is a built-in array notation function, then the return type of
8624 the function is the element type of the array passed in as array
8625 notation (i.e. the first parameter of the function). */
8626 if (flag_cilkplus && TREE_CODE (fn) == CALL_EXPR)
8628 enum built_in_function bif =
8629 is_cilkplus_reduce_builtin (CALL_EXPR_FN (fn));
8630 if (bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ADD
8631 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MUL
8632 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MAX
8633 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MIN
8634 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE
8635 || bif == BUILT_IN_CILKPLUS_SEC_REDUCE_MUTATING)
8637 if (call_expr_nargs (fn) == 0)
8639 error_at (EXPR_LOCATION (fn), "Invalid builtin arguments");
8640 return error_mark_node;
8642 /* for bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_ZERO or
8643 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_ZERO or
8644 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_NONZERO or
8645 BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_NONZERO or
8646 BUILT_IN_CILKPLUS_SEC_REDUCE_MIN_IND or
8647 BUILT_IN_CILKPLUS_SEC_REDUCE_MAX_IND
8648 The pre-defined return-type is the correct one. */
8649 tree array_ntn = CALL_EXPR_ARG (fn, 0);
8650 TREE_TYPE (fn) = TREE_TYPE (array_ntn);
8651 return fn;
8655 if (VOID_TYPE_P (TREE_TYPE (fn)))
8656 return fn;
8658 /* 5.2.2/11: If a function call is a prvalue of object type: if the
8659 function call is either the operand of a decltype-specifier or the
8660 right operand of a comma operator that is the operand of a
8661 decltype-specifier, a temporary object is not introduced for the
8662 prvalue. The type of the prvalue may be incomplete. */
8663 if (!(complain & tf_decltype))
8665 fn = require_complete_type_sfinae (fn, complain);
8666 if (fn == error_mark_node)
8667 return error_mark_node;
8669 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn)))
8671 fn = build_cplus_new (TREE_TYPE (fn), fn, complain);
8672 maybe_warn_parm_abi (TREE_TYPE (fn), loc);
8675 return convert_from_reference (fn);
8678 /* Returns the value to use for the in-charge parameter when making a
8679 call to a function with the indicated NAME.
8681 FIXME:Can't we find a neater way to do this mapping? */
8683 tree
8684 in_charge_arg_for_name (tree name)
8686 if (IDENTIFIER_CTOR_P (name))
8688 if (name == complete_ctor_identifier)
8689 return integer_one_node;
8690 gcc_checking_assert (name == base_ctor_identifier);
8692 else
8694 if (name == complete_dtor_identifier)
8695 return integer_two_node;
8696 else if (name == deleting_dtor_identifier)
8697 return integer_three_node;
8698 gcc_checking_assert (name == base_dtor_identifier);
8701 return integer_zero_node;
8704 /* We've built up a constructor call RET. Complain if it delegates to the
8705 constructor we're currently compiling. */
8707 static void
8708 check_self_delegation (tree ret)
8710 if (TREE_CODE (ret) == TARGET_EXPR)
8711 ret = TARGET_EXPR_INITIAL (ret);
8712 tree fn = cp_get_callee_fndecl (ret);
8713 if (fn && DECL_ABSTRACT_ORIGIN (fn) == current_function_decl)
8714 error ("constructor delegates to itself");
8717 /* Build a call to a constructor, destructor, or an assignment
8718 operator for INSTANCE, an expression with class type. NAME
8719 indicates the special member function to call; *ARGS are the
8720 arguments. ARGS may be NULL. This may change ARGS. BINFO
8721 indicates the base of INSTANCE that is to be passed as the `this'
8722 parameter to the member function called.
8724 FLAGS are the LOOKUP_* flags to use when processing the call.
8726 If NAME indicates a complete object constructor, INSTANCE may be
8727 NULL_TREE. In this case, the caller will call build_cplus_new to
8728 store the newly constructed object into a VAR_DECL. */
8730 tree
8731 build_special_member_call (tree instance, tree name, vec<tree, va_gc> **args,
8732 tree binfo, int flags, tsubst_flags_t complain)
8734 tree fns;
8735 /* The type of the subobject to be constructed or destroyed. */
8736 tree class_type;
8737 vec<tree, va_gc> *allocated = NULL;
8738 tree ret;
8740 gcc_assert (IDENTIFIER_CDTOR_P (name)
8741 || name == cp_assignment_operator_id (NOP_EXPR));
8742 if (TYPE_P (binfo))
8744 /* Resolve the name. */
8745 if (!complete_type_or_maybe_complain (binfo, NULL_TREE, complain))
8746 return error_mark_node;
8748 binfo = TYPE_BINFO (binfo);
8751 gcc_assert (binfo != NULL_TREE);
8753 class_type = BINFO_TYPE (binfo);
8755 /* Handle the special case where INSTANCE is NULL_TREE. */
8756 if (name == complete_ctor_identifier && !instance)
8757 instance = build_dummy_object (class_type);
8758 else
8760 if (IDENTIFIER_DTOR_P (name))
8761 gcc_assert (args == NULL || vec_safe_is_empty (*args));
8763 /* Convert to the base class, if necessary. */
8764 if (!same_type_ignoring_top_level_qualifiers_p
8765 (TREE_TYPE (instance), BINFO_TYPE (binfo)))
8767 if (name != cp_assignment_operator_id (NOP_EXPR))
8768 /* For constructors and destructors, either the base is
8769 non-virtual, or it is virtual but we are doing the
8770 conversion from a constructor or destructor for the
8771 complete object. In either case, we can convert
8772 statically. */
8773 instance = convert_to_base_statically (instance, binfo);
8774 else
8775 /* However, for assignment operators, we must convert
8776 dynamically if the base is virtual. */
8777 instance = build_base_path (PLUS_EXPR, instance,
8778 binfo, /*nonnull=*/1, complain);
8782 gcc_assert (instance != NULL_TREE);
8784 /* In C++17, "If the initializer expression is a prvalue and the
8785 cv-unqualified version of the source type is the same class as the class
8786 of the destination, the initializer expression is used to initialize the
8787 destination object." Handle that here to avoid doing overload
8788 resolution. */
8789 if (cxx_dialect >= cxx1z
8790 && args && vec_safe_length (*args) == 1
8791 && name == complete_ctor_identifier)
8793 tree arg = (**args)[0];
8795 /* FIXME P0135 doesn't say how to handle direct initialization from a
8796 type with a suitable conversion operator. Let's handle it like
8797 copy-initialization, but allowing explict conversions. */
8798 tsubst_flags_t sub_complain = tf_warning;
8799 if (!is_dummy_object (instance))
8800 /* If we're using this to initialize a non-temporary object, don't
8801 require the destructor to be accessible. */
8802 sub_complain |= tf_no_cleanup;
8803 if (!reference_related_p (class_type, TREE_TYPE (arg)))
8804 arg = perform_implicit_conversion_flags (class_type, arg,
8805 sub_complain,
8806 flags);
8807 if ((TREE_CODE (arg) == TARGET_EXPR
8808 || TREE_CODE (arg) == CONSTRUCTOR)
8809 && (same_type_ignoring_top_level_qualifiers_p
8810 (class_type, TREE_TYPE (arg))))
8812 if (is_dummy_object (instance))
8813 return arg;
8814 if ((complain & tf_error)
8815 && (flags & LOOKUP_DELEGATING_CONS))
8816 check_self_delegation (arg);
8817 /* Avoid change of behavior on Wunused-var-2.C. */
8818 mark_lvalue_use (instance);
8819 return build2 (INIT_EXPR, class_type, instance, arg);
8823 fns = lookup_fnfields (binfo, name, 1);
8825 /* When making a call to a constructor or destructor for a subobject
8826 that uses virtual base classes, pass down a pointer to a VTT for
8827 the subobject. */
8828 if ((name == base_ctor_identifier
8829 || name == base_dtor_identifier)
8830 && CLASSTYPE_VBASECLASSES (class_type))
8832 tree vtt;
8833 tree sub_vtt;
8835 /* If the current function is a complete object constructor
8836 or destructor, then we fetch the VTT directly.
8837 Otherwise, we look it up using the VTT we were given. */
8838 vtt = DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type));
8839 vtt = decay_conversion (vtt, complain);
8840 if (vtt == error_mark_node)
8841 return error_mark_node;
8842 vtt = build_if_in_charge (vtt, current_vtt_parm);
8843 if (BINFO_SUBVTT_INDEX (binfo))
8844 sub_vtt = fold_build_pointer_plus (vtt, BINFO_SUBVTT_INDEX (binfo));
8845 else
8846 sub_vtt = vtt;
8848 if (args == NULL)
8850 allocated = make_tree_vector ();
8851 args = &allocated;
8854 vec_safe_insert (*args, 0, sub_vtt);
8857 ret = build_new_method_call (instance, fns, args,
8858 TYPE_BINFO (BINFO_TYPE (binfo)),
8859 flags, /*fn=*/NULL,
8860 complain);
8862 if (allocated != NULL)
8863 release_tree_vector (allocated);
8865 if ((complain & tf_error)
8866 && (flags & LOOKUP_DELEGATING_CONS)
8867 && name == complete_ctor_identifier)
8868 check_self_delegation (ret);
8870 return ret;
8873 /* Return the NAME, as a C string. The NAME indicates a function that
8874 is a member of TYPE. *FREE_P is set to true if the caller must
8875 free the memory returned.
8877 Rather than go through all of this, we should simply set the names
8878 of constructors and destructors appropriately, and dispense with
8879 ctor_identifier, dtor_identifier, etc. */
8881 static char *
8882 name_as_c_string (tree name, tree type, bool *free_p)
8884 const char *pretty_name;
8886 /* Assume that we will not allocate memory. */
8887 *free_p = false;
8888 /* Constructors and destructors are special. */
8889 if (IDENTIFIER_CDTOR_P (name))
8891 pretty_name
8892 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type)));
8893 /* For a destructor, add the '~'. */
8894 if (IDENTIFIER_DTOR_P (name))
8896 pretty_name = concat ("~", pretty_name, NULL);
8897 /* Remember that we need to free the memory allocated. */
8898 *free_p = true;
8901 else if (IDENTIFIER_CONV_OP_P (name))
8903 pretty_name = concat ("operator ",
8904 type_as_string_translate (TREE_TYPE (name),
8905 TFF_PLAIN_IDENTIFIER),
8906 NULL);
8907 /* Remember that we need to free the memory allocated. */
8908 *free_p = true;
8910 else
8911 pretty_name = identifier_to_locale (IDENTIFIER_POINTER (name));
8913 return CONST_CAST (char *, pretty_name);
8916 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
8917 be set, upon return, to the function called. ARGS may be NULL.
8918 This may change ARGS. */
8920 static tree
8921 build_new_method_call_1 (tree instance, tree fns, vec<tree, va_gc> **args,
8922 tree conversion_path, int flags,
8923 tree *fn_p, tsubst_flags_t complain)
8925 struct z_candidate *candidates = 0, *cand;
8926 tree explicit_targs = NULL_TREE;
8927 tree basetype = NULL_TREE;
8928 tree access_binfo, binfo;
8929 tree optype;
8930 tree first_mem_arg = NULL_TREE;
8931 tree name;
8932 bool skip_first_for_error;
8933 vec<tree, va_gc> *user_args;
8934 tree call;
8935 tree fn;
8936 int template_only = 0;
8937 bool any_viable_p;
8938 tree orig_instance;
8939 tree orig_fns;
8940 vec<tree, va_gc> *orig_args = NULL;
8941 void *p;
8943 gcc_assert (instance != NULL_TREE);
8945 /* We don't know what function we're going to call, yet. */
8946 if (fn_p)
8947 *fn_p = NULL_TREE;
8949 if (error_operand_p (instance)
8950 || !fns || error_operand_p (fns))
8951 return error_mark_node;
8953 if (!BASELINK_P (fns))
8955 if (complain & tf_error)
8956 error ("call to non-function %qD", fns);
8957 return error_mark_node;
8960 orig_instance = instance;
8961 orig_fns = fns;
8963 /* Dismantle the baselink to collect all the information we need. */
8964 if (!conversion_path)
8965 conversion_path = BASELINK_BINFO (fns);
8966 access_binfo = BASELINK_ACCESS_BINFO (fns);
8967 binfo = BASELINK_BINFO (fns);
8968 optype = BASELINK_OPTYPE (fns);
8969 fns = BASELINK_FUNCTIONS (fns);
8970 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
8972 explicit_targs = TREE_OPERAND (fns, 1);
8973 fns = TREE_OPERAND (fns, 0);
8974 template_only = 1;
8976 gcc_assert (TREE_CODE (fns) == FUNCTION_DECL
8977 || TREE_CODE (fns) == TEMPLATE_DECL
8978 || TREE_CODE (fns) == OVERLOAD);
8979 fn = OVL_FIRST (fns);
8980 name = DECL_NAME (fn);
8982 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (instance));
8983 gcc_assert (CLASS_TYPE_P (basetype));
8985 if (processing_template_decl)
8987 orig_args = args == NULL ? NULL : make_tree_vector_copy (*args);
8988 instance = build_non_dependent_expr (instance);
8989 if (args != NULL)
8990 make_args_non_dependent (*args);
8993 user_args = args == NULL ? NULL : *args;
8994 /* Under DR 147 A::A() is an invalid constructor call,
8995 not a functional cast. */
8996 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
8998 if (! (complain & tf_error))
8999 return error_mark_node;
9001 name = constructor_name (basetype);
9002 if (permerror (input_location,
9003 "cannot call constructor %<%T::%D%> directly",
9004 basetype, name))
9005 inform (input_location, "for a function-style cast, remove the "
9006 "redundant %<::%D%>", name);
9007 call = build_functional_cast (basetype, build_tree_list_vec (user_args),
9008 complain);
9009 return call;
9012 /* Process the argument list. */
9013 if (args != NULL && *args != NULL)
9015 *args = resolve_args (*args, complain);
9016 if (*args == NULL)
9017 return error_mark_node;
9020 /* Consider the object argument to be used even if we end up selecting a
9021 static member function. */
9022 instance = mark_type_use (instance);
9025 /* Figure out whether to skip the first argument for the error
9026 message we will display to users if an error occurs. We don't
9027 want to display any compiler-generated arguments. The "this"
9028 pointer hasn't been added yet. However, we must remove the VTT
9029 pointer if this is a call to a base-class constructor or
9030 destructor. */
9031 skip_first_for_error = false;
9032 if (IDENTIFIER_CDTOR_P (name))
9034 /* Callers should explicitly indicate whether they want to ctor
9035 the complete object or just the part without virtual bases. */
9036 gcc_assert (name != ctor_identifier);
9038 /* Remove the VTT pointer, if present. */
9039 if ((name == base_ctor_identifier || name == base_dtor_identifier)
9040 && CLASSTYPE_VBASECLASSES (basetype))
9041 skip_first_for_error = true;
9043 /* It's OK to call destructors and constructors on cv-qualified
9044 objects. Therefore, convert the INSTANCE to the unqualified
9045 type, if necessary. */
9046 if (!same_type_p (basetype, TREE_TYPE (instance)))
9048 instance = build_this (instance);
9049 instance = build_nop (build_pointer_type (basetype), instance);
9050 instance = build_fold_indirect_ref (instance);
9053 else
9054 gcc_assert (!DECL_DESTRUCTOR_P (fn) && !DECL_CONSTRUCTOR_P (fn));
9056 /* For the overload resolution we need to find the actual `this`
9057 that would be captured if the call turns out to be to a
9058 non-static member function. Do not actually capture it at this
9059 point. */
9060 if (DECL_CONSTRUCTOR_P (fn))
9061 /* Constructors don't use the enclosing 'this'. */
9062 first_mem_arg = instance;
9063 else
9064 first_mem_arg = maybe_resolve_dummy (instance, false);
9066 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9067 p = conversion_obstack_alloc (0);
9069 /* The number of arguments artificial parms in ARGS; we subtract one because
9070 there's no 'this' in ARGS. */
9071 unsigned skip = num_artificial_parms_for (fn) - 1;
9073 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
9074 initializer, not T({ }). */
9075 if (DECL_CONSTRUCTOR_P (fn)
9076 && vec_safe_length (user_args) > skip
9077 && DIRECT_LIST_INIT_P ((*user_args)[skip]))
9079 tree init_list = (*user_args)[skip];
9080 tree init = NULL_TREE;
9082 gcc_assert (user_args->length () == skip + 1
9083 && !(flags & LOOKUP_ONLYCONVERTING));
9085 /* If the initializer list has no elements and T is a class type with
9086 a default constructor, the object is value-initialized. Handle
9087 this here so we don't need to handle it wherever we use
9088 build_special_member_call. */
9089 if (CONSTRUCTOR_NELTS (init_list) == 0
9090 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype)
9091 /* For a user-provided default constructor, use the normal
9092 mechanisms so that protected access works. */
9093 && type_has_non_user_provided_default_constructor (basetype)
9094 && !processing_template_decl)
9095 init = build_value_init (basetype, complain);
9097 /* If BASETYPE is an aggregate, we need to do aggregate
9098 initialization. */
9099 else if (CP_AGGREGATE_TYPE_P (basetype))
9101 init = reshape_init (basetype, init_list, complain);
9102 init = digest_init (basetype, init, complain);
9105 if (init)
9107 if (is_dummy_object (instance))
9108 return get_target_expr_sfinae (init, complain);
9109 init = build2 (INIT_EXPR, TREE_TYPE (instance), instance, init);
9110 TREE_SIDE_EFFECTS (init) = true;
9111 return init;
9114 /* Otherwise go ahead with overload resolution. */
9115 add_list_candidates (fns, first_mem_arg, user_args,
9116 basetype, explicit_targs, template_only,
9117 conversion_path, access_binfo, flags,
9118 &candidates, complain);
9120 else
9121 add_candidates (fns, first_mem_arg, user_args, optype,
9122 explicit_targs, template_only, conversion_path,
9123 access_binfo, flags, &candidates, complain);
9125 any_viable_p = false;
9126 candidates = splice_viable (candidates, false, &any_viable_p);
9128 if (!any_viable_p)
9130 if (complain & tf_error)
9132 if (!COMPLETE_OR_OPEN_TYPE_P (basetype))
9133 cxx_incomplete_type_error (instance, basetype);
9134 else if (optype)
9135 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9136 basetype, optype, build_tree_list_vec (user_args),
9137 TREE_TYPE (instance));
9138 else
9140 tree arglist = build_tree_list_vec (user_args);
9141 tree errname = name;
9142 bool twiddle = false;
9143 if (IDENTIFIER_CDTOR_P (errname))
9145 twiddle = IDENTIFIER_DTOR_P (errname);
9146 errname = constructor_name (basetype);
9148 if (explicit_targs)
9149 errname = lookup_template_function (errname, explicit_targs);
9150 if (skip_first_for_error)
9151 arglist = TREE_CHAIN (arglist);
9152 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
9153 basetype, &"~"[!twiddle], errname, arglist,
9154 TREE_TYPE (instance));
9156 print_z_candidates (location_of (name), candidates);
9158 call = error_mark_node;
9160 else
9162 cand = tourney (candidates, complain);
9163 if (cand == 0)
9165 char *pretty_name;
9166 bool free_p;
9167 tree arglist;
9169 if (complain & tf_error)
9171 pretty_name = name_as_c_string (name, basetype, &free_p);
9172 arglist = build_tree_list_vec (user_args);
9173 if (skip_first_for_error)
9174 arglist = TREE_CHAIN (arglist);
9175 if (!any_strictly_viable (candidates))
9176 error ("no matching function for call to %<%s(%A)%>",
9177 pretty_name, arglist);
9178 else
9179 error ("call of overloaded %<%s(%A)%> is ambiguous",
9180 pretty_name, arglist);
9181 print_z_candidates (location_of (name), candidates);
9182 if (free_p)
9183 free (pretty_name);
9185 call = error_mark_node;
9187 else
9189 fn = cand->fn;
9190 call = NULL_TREE;
9192 if (!(flags & LOOKUP_NONVIRTUAL)
9193 && DECL_PURE_VIRTUAL_P (fn)
9194 && instance == current_class_ref
9195 && (complain & tf_warning))
9197 /* This is not an error, it is runtime undefined
9198 behavior. */
9199 if (!current_function_decl)
9200 warning (0, "pure virtual %q#D called from "
9201 "non-static data member initializer", fn);
9202 else if (DECL_CONSTRUCTOR_P (current_function_decl)
9203 || DECL_DESTRUCTOR_P (current_function_decl))
9204 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl)
9205 ? G_("pure virtual %q#D called from constructor")
9206 : G_("pure virtual %q#D called from destructor")),
9207 fn);
9210 if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE
9211 && !DECL_CONSTRUCTOR_P (fn)
9212 && is_dummy_object (instance))
9214 instance = maybe_resolve_dummy (instance, true);
9215 if (instance == error_mark_node)
9216 call = error_mark_node;
9217 else if (!is_dummy_object (instance))
9219 /* We captured 'this' in the current lambda now that
9220 we know we really need it. */
9221 cand->first_arg = instance;
9223 else if (any_dependent_bases_p ())
9224 /* We can't tell until instantiation time whether we can use
9225 *this as the implicit object argument. */;
9226 else
9228 if (complain & tf_error)
9229 error ("cannot call member function %qD without object",
9230 fn);
9231 call = error_mark_node;
9235 if (call != error_mark_node)
9237 /* Optimize away vtable lookup if we know that this
9238 function can't be overridden. We need to check if
9239 the context and the type where we found fn are the same,
9240 actually FN might be defined in a different class
9241 type because of a using-declaration. In this case, we
9242 do not want to perform a non-virtual call. */
9243 if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL)
9244 && same_type_ignoring_top_level_qualifiers_p
9245 (DECL_CONTEXT (fn), BINFO_TYPE (binfo))
9246 && resolves_to_fixed_type_p (instance, 0))
9247 flags |= LOOKUP_NONVIRTUAL;
9248 if (explicit_targs)
9249 flags |= LOOKUP_EXPLICIT_TMPL_ARGS;
9250 /* Now we know what function is being called. */
9251 if (fn_p)
9252 *fn_p = fn;
9253 /* Build the actual CALL_EXPR. */
9254 call = build_over_call (cand, flags, complain);
9255 /* In an expression of the form `a->f()' where `f' turns
9256 out to be a static member function, `a' is
9257 none-the-less evaluated. */
9258 if (TREE_CODE (TREE_TYPE (fn)) != METHOD_TYPE
9259 && !is_dummy_object (instance)
9260 && TREE_SIDE_EFFECTS (instance))
9261 call = build2 (COMPOUND_EXPR, TREE_TYPE (call),
9262 instance, call);
9263 else if (call != error_mark_node
9264 && DECL_DESTRUCTOR_P (cand->fn)
9265 && !VOID_TYPE_P (TREE_TYPE (call)))
9266 /* An explicit call of the form "x->~X()" has type
9267 "void". However, on platforms where destructors
9268 return "this" (i.e., those where
9269 targetm.cxx.cdtor_returns_this is true), such calls
9270 will appear to have a return value of pointer type
9271 to the low-level call machinery. We do not want to
9272 change the low-level machinery, since we want to be
9273 able to optimize "delete f()" on such platforms as
9274 "operator delete(~X(f()))" (rather than generating
9275 "t = f(), ~X(t), operator delete (t)"). */
9276 call = build_nop (void_type_node, call);
9281 if (processing_template_decl && call != error_mark_node)
9283 bool cast_to_void = false;
9285 if (TREE_CODE (call) == COMPOUND_EXPR)
9286 call = TREE_OPERAND (call, 1);
9287 else if (TREE_CODE (call) == NOP_EXPR)
9289 cast_to_void = true;
9290 call = TREE_OPERAND (call, 0);
9292 if (INDIRECT_REF_P (call))
9293 call = TREE_OPERAND (call, 0);
9294 call = (build_min_non_dep_call_vec
9295 (call,
9296 build_min (COMPONENT_REF, TREE_TYPE (CALL_EXPR_FN (call)),
9297 orig_instance, orig_fns, NULL_TREE),
9298 orig_args));
9299 SET_EXPR_LOCATION (call, input_location);
9300 call = convert_from_reference (call);
9301 if (cast_to_void)
9302 call = build_nop (void_type_node, call);
9305 /* Free all the conversions we allocated. */
9306 obstack_free (&conversion_obstack, p);
9308 if (orig_args != NULL)
9309 release_tree_vector (orig_args);
9311 return call;
9314 /* Wrapper for above. */
9316 tree
9317 build_new_method_call (tree instance, tree fns, vec<tree, va_gc> **args,
9318 tree conversion_path, int flags,
9319 tree *fn_p, tsubst_flags_t complain)
9321 tree ret;
9322 bool subtime = timevar_cond_start (TV_OVERLOAD);
9323 ret = build_new_method_call_1 (instance, fns, args, conversion_path, flags,
9324 fn_p, complain);
9325 timevar_cond_stop (TV_OVERLOAD, subtime);
9326 return ret;
9329 /* Returns true iff standard conversion sequence ICS1 is a proper
9330 subsequence of ICS2. */
9332 static bool
9333 is_subseq (conversion *ics1, conversion *ics2)
9335 /* We can assume that a conversion of the same code
9336 between the same types indicates a subsequence since we only get
9337 here if the types we are converting from are the same. */
9339 while (ics1->kind == ck_rvalue
9340 || ics1->kind == ck_lvalue)
9341 ics1 = next_conversion (ics1);
9343 while (1)
9345 while (ics2->kind == ck_rvalue
9346 || ics2->kind == ck_lvalue)
9347 ics2 = next_conversion (ics2);
9349 if (ics2->kind == ck_user
9350 || ics2->kind == ck_ambig
9351 || ics2->kind == ck_aggr
9352 || ics2->kind == ck_list
9353 || ics2->kind == ck_identity)
9354 /* At this point, ICS1 cannot be a proper subsequence of
9355 ICS2. We can get a USER_CONV when we are comparing the
9356 second standard conversion sequence of two user conversion
9357 sequences. */
9358 return false;
9360 ics2 = next_conversion (ics2);
9362 while (ics2->kind == ck_rvalue
9363 || ics2->kind == ck_lvalue)
9364 ics2 = next_conversion (ics2);
9366 if (ics2->kind == ics1->kind
9367 && same_type_p (ics2->type, ics1->type)
9368 && (ics1->kind == ck_identity
9369 || same_type_p (next_conversion (ics2)->type,
9370 next_conversion (ics1)->type)))
9371 return true;
9375 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
9376 be any _TYPE nodes. */
9378 bool
9379 is_properly_derived_from (tree derived, tree base)
9381 if (!CLASS_TYPE_P (derived) || !CLASS_TYPE_P (base))
9382 return false;
9384 /* We only allow proper derivation here. The DERIVED_FROM_P macro
9385 considers every class derived from itself. */
9386 return (!same_type_ignoring_top_level_qualifiers_p (derived, base)
9387 && DERIVED_FROM_P (base, derived));
9390 /* We build the ICS for an implicit object parameter as a pointer
9391 conversion sequence. However, such a sequence should be compared
9392 as if it were a reference conversion sequence. If ICS is the
9393 implicit conversion sequence for an implicit object parameter,
9394 modify it accordingly. */
9396 static void
9397 maybe_handle_implicit_object (conversion **ics)
9399 if ((*ics)->this_p)
9401 /* [over.match.funcs]
9403 For non-static member functions, the type of the
9404 implicit object parameter is "reference to cv X"
9405 where X is the class of which the function is a
9406 member and cv is the cv-qualification on the member
9407 function declaration. */
9408 conversion *t = *ics;
9409 tree reference_type;
9411 /* The `this' parameter is a pointer to a class type. Make the
9412 implicit conversion talk about a reference to that same class
9413 type. */
9414 reference_type = TREE_TYPE (t->type);
9415 reference_type = build_reference_type (reference_type);
9417 if (t->kind == ck_qual)
9418 t = next_conversion (t);
9419 if (t->kind == ck_ptr)
9420 t = next_conversion (t);
9421 t = build_identity_conv (TREE_TYPE (t->type), NULL_TREE);
9422 t = direct_reference_binding (reference_type, t);
9423 t->this_p = 1;
9424 t->rvaluedness_matches_p = 0;
9425 *ics = t;
9429 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
9430 and return the initial reference binding conversion. Otherwise,
9431 leave *ICS unchanged and return NULL. */
9433 static conversion *
9434 maybe_handle_ref_bind (conversion **ics)
9436 if ((*ics)->kind == ck_ref_bind)
9438 conversion *old_ics = *ics;
9439 *ics = next_conversion (old_ics);
9440 (*ics)->user_conv_p = old_ics->user_conv_p;
9441 return old_ics;
9444 return NULL;
9447 /* Compare two implicit conversion sequences according to the rules set out in
9448 [over.ics.rank]. Return values:
9450 1: ics1 is better than ics2
9451 -1: ics2 is better than ics1
9452 0: ics1 and ics2 are indistinguishable */
9454 static int
9455 compare_ics (conversion *ics1, conversion *ics2)
9457 tree from_type1;
9458 tree from_type2;
9459 tree to_type1;
9460 tree to_type2;
9461 tree deref_from_type1 = NULL_TREE;
9462 tree deref_from_type2 = NULL_TREE;
9463 tree deref_to_type1 = NULL_TREE;
9464 tree deref_to_type2 = NULL_TREE;
9465 conversion_rank rank1, rank2;
9467 /* REF_BINDING is nonzero if the result of the conversion sequence
9468 is a reference type. In that case REF_CONV is the reference
9469 binding conversion. */
9470 conversion *ref_conv1;
9471 conversion *ref_conv2;
9473 /* Compare badness before stripping the reference conversion. */
9474 if (ics1->bad_p > ics2->bad_p)
9475 return -1;
9476 else if (ics1->bad_p < ics2->bad_p)
9477 return 1;
9479 /* Handle implicit object parameters. */
9480 maybe_handle_implicit_object (&ics1);
9481 maybe_handle_implicit_object (&ics2);
9483 /* Handle reference parameters. */
9484 ref_conv1 = maybe_handle_ref_bind (&ics1);
9485 ref_conv2 = maybe_handle_ref_bind (&ics2);
9487 /* List-initialization sequence L1 is a better conversion sequence than
9488 list-initialization sequence L2 if L1 converts to
9489 std::initializer_list<X> for some X and L2 does not. */
9490 if (ics1->kind == ck_list && ics2->kind != ck_list)
9491 return 1;
9492 if (ics2->kind == ck_list && ics1->kind != ck_list)
9493 return -1;
9495 /* [over.ics.rank]
9497 When comparing the basic forms of implicit conversion sequences (as
9498 defined in _over.best.ics_)
9500 --a standard conversion sequence (_over.ics.scs_) is a better
9501 conversion sequence than a user-defined conversion sequence
9502 or an ellipsis conversion sequence, and
9504 --a user-defined conversion sequence (_over.ics.user_) is a
9505 better conversion sequence than an ellipsis conversion sequence
9506 (_over.ics.ellipsis_). */
9507 /* Use BAD_CONVERSION_RANK because we already checked for a badness
9508 mismatch. If both ICS are bad, we try to make a decision based on
9509 what would have happened if they'd been good. This is not an
9510 extension, we'll still give an error when we build up the call; this
9511 just helps us give a more helpful error message. */
9512 rank1 = BAD_CONVERSION_RANK (ics1);
9513 rank2 = BAD_CONVERSION_RANK (ics2);
9515 if (rank1 > rank2)
9516 return -1;
9517 else if (rank1 < rank2)
9518 return 1;
9520 if (ics1->ellipsis_p)
9521 /* Both conversions are ellipsis conversions. */
9522 return 0;
9524 /* User-defined conversion sequence U1 is a better conversion sequence
9525 than another user-defined conversion sequence U2 if they contain the
9526 same user-defined conversion operator or constructor and if the sec-
9527 ond standard conversion sequence of U1 is better than the second
9528 standard conversion sequence of U2. */
9530 /* Handle list-conversion with the same code even though it isn't always
9531 ranked as a user-defined conversion and it doesn't have a second
9532 standard conversion sequence; it will still have the desired effect.
9533 Specifically, we need to do the reference binding comparison at the
9534 end of this function. */
9536 if (ics1->user_conv_p || ics1->kind == ck_list || ics1->kind == ck_aggr)
9538 conversion *t1;
9539 conversion *t2;
9541 for (t1 = ics1; t1->kind != ck_user; t1 = next_conversion (t1))
9542 if (t1->kind == ck_ambig || t1->kind == ck_aggr
9543 || t1->kind == ck_list)
9544 break;
9545 for (t2 = ics2; t2->kind != ck_user; t2 = next_conversion (t2))
9546 if (t2->kind == ck_ambig || t2->kind == ck_aggr
9547 || t2->kind == ck_list)
9548 break;
9550 if (t1->kind != t2->kind)
9551 return 0;
9552 else if (t1->kind == ck_user)
9554 if (t1->cand->fn != t2->cand->fn)
9555 return 0;
9557 else
9559 /* For ambiguous or aggregate conversions, use the target type as
9560 a proxy for the conversion function. */
9561 if (!same_type_ignoring_top_level_qualifiers_p (t1->type, t2->type))
9562 return 0;
9565 /* We can just fall through here, after setting up
9566 FROM_TYPE1 and FROM_TYPE2. */
9567 from_type1 = t1->type;
9568 from_type2 = t2->type;
9570 else
9572 conversion *t1;
9573 conversion *t2;
9575 /* We're dealing with two standard conversion sequences.
9577 [over.ics.rank]
9579 Standard conversion sequence S1 is a better conversion
9580 sequence than standard conversion sequence S2 if
9582 --S1 is a proper subsequence of S2 (comparing the conversion
9583 sequences in the canonical form defined by _over.ics.scs_,
9584 excluding any Lvalue Transformation; the identity
9585 conversion sequence is considered to be a subsequence of
9586 any non-identity conversion sequence */
9588 t1 = ics1;
9589 while (t1->kind != ck_identity)
9590 t1 = next_conversion (t1);
9591 from_type1 = t1->type;
9593 t2 = ics2;
9594 while (t2->kind != ck_identity)
9595 t2 = next_conversion (t2);
9596 from_type2 = t2->type;
9599 /* One sequence can only be a subsequence of the other if they start with
9600 the same type. They can start with different types when comparing the
9601 second standard conversion sequence in two user-defined conversion
9602 sequences. */
9603 if (same_type_p (from_type1, from_type2))
9605 if (is_subseq (ics1, ics2))
9606 return 1;
9607 if (is_subseq (ics2, ics1))
9608 return -1;
9611 /* [over.ics.rank]
9613 Or, if not that,
9615 --the rank of S1 is better than the rank of S2 (by the rules
9616 defined below):
9618 Standard conversion sequences are ordered by their ranks: an Exact
9619 Match is a better conversion than a Promotion, which is a better
9620 conversion than a Conversion.
9622 Two conversion sequences with the same rank are indistinguishable
9623 unless one of the following rules applies:
9625 --A conversion that does not a convert a pointer, pointer to member,
9626 or std::nullptr_t to bool is better than one that does.
9628 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
9629 so that we do not have to check it explicitly. */
9630 if (ics1->rank < ics2->rank)
9631 return 1;
9632 else if (ics2->rank < ics1->rank)
9633 return -1;
9635 to_type1 = ics1->type;
9636 to_type2 = ics2->type;
9638 /* A conversion from scalar arithmetic type to complex is worse than a
9639 conversion between scalar arithmetic types. */
9640 if (same_type_p (from_type1, from_type2)
9641 && ARITHMETIC_TYPE_P (from_type1)
9642 && ARITHMETIC_TYPE_P (to_type1)
9643 && ARITHMETIC_TYPE_P (to_type2)
9644 && ((TREE_CODE (to_type1) == COMPLEX_TYPE)
9645 != (TREE_CODE (to_type2) == COMPLEX_TYPE)))
9647 if (TREE_CODE (to_type1) == COMPLEX_TYPE)
9648 return -1;
9649 else
9650 return 1;
9653 if (TYPE_PTR_P (from_type1)
9654 && TYPE_PTR_P (from_type2)
9655 && TYPE_PTR_P (to_type1)
9656 && TYPE_PTR_P (to_type2))
9658 deref_from_type1 = TREE_TYPE (from_type1);
9659 deref_from_type2 = TREE_TYPE (from_type2);
9660 deref_to_type1 = TREE_TYPE (to_type1);
9661 deref_to_type2 = TREE_TYPE (to_type2);
9663 /* The rules for pointers to members A::* are just like the rules
9664 for pointers A*, except opposite: if B is derived from A then
9665 A::* converts to B::*, not vice versa. For that reason, we
9666 switch the from_ and to_ variables here. */
9667 else if ((TYPE_PTRDATAMEM_P (from_type1) && TYPE_PTRDATAMEM_P (from_type2)
9668 && TYPE_PTRDATAMEM_P (to_type1) && TYPE_PTRDATAMEM_P (to_type2))
9669 || (TYPE_PTRMEMFUNC_P (from_type1)
9670 && TYPE_PTRMEMFUNC_P (from_type2)
9671 && TYPE_PTRMEMFUNC_P (to_type1)
9672 && TYPE_PTRMEMFUNC_P (to_type2)))
9674 deref_to_type1 = TYPE_PTRMEM_CLASS_TYPE (from_type1);
9675 deref_to_type2 = TYPE_PTRMEM_CLASS_TYPE (from_type2);
9676 deref_from_type1 = TYPE_PTRMEM_CLASS_TYPE (to_type1);
9677 deref_from_type2 = TYPE_PTRMEM_CLASS_TYPE (to_type2);
9680 if (deref_from_type1 != NULL_TREE
9681 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1))
9682 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2)))
9684 /* This was one of the pointer or pointer-like conversions.
9686 [over.ics.rank]
9688 --If class B is derived directly or indirectly from class A,
9689 conversion of B* to A* is better than conversion of B* to
9690 void*, and conversion of A* to void* is better than
9691 conversion of B* to void*. */
9692 if (VOID_TYPE_P (deref_to_type1)
9693 && VOID_TYPE_P (deref_to_type2))
9695 if (is_properly_derived_from (deref_from_type1,
9696 deref_from_type2))
9697 return -1;
9698 else if (is_properly_derived_from (deref_from_type2,
9699 deref_from_type1))
9700 return 1;
9702 else if (VOID_TYPE_P (deref_to_type1)
9703 || VOID_TYPE_P (deref_to_type2))
9705 if (same_type_p (deref_from_type1, deref_from_type2))
9707 if (VOID_TYPE_P (deref_to_type2))
9709 if (is_properly_derived_from (deref_from_type1,
9710 deref_to_type1))
9711 return 1;
9713 /* We know that DEREF_TO_TYPE1 is `void' here. */
9714 else if (is_properly_derived_from (deref_from_type1,
9715 deref_to_type2))
9716 return -1;
9719 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1))
9720 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2)))
9722 /* [over.ics.rank]
9724 --If class B is derived directly or indirectly from class A
9725 and class C is derived directly or indirectly from B,
9727 --conversion of C* to B* is better than conversion of C* to
9730 --conversion of B* to A* is better than conversion of C* to
9731 A* */
9732 if (same_type_p (deref_from_type1, deref_from_type2))
9734 if (is_properly_derived_from (deref_to_type1,
9735 deref_to_type2))
9736 return 1;
9737 else if (is_properly_derived_from (deref_to_type2,
9738 deref_to_type1))
9739 return -1;
9741 else if (same_type_p (deref_to_type1, deref_to_type2))
9743 if (is_properly_derived_from (deref_from_type2,
9744 deref_from_type1))
9745 return 1;
9746 else if (is_properly_derived_from (deref_from_type1,
9747 deref_from_type2))
9748 return -1;
9752 else if (CLASS_TYPE_P (non_reference (from_type1))
9753 && same_type_p (from_type1, from_type2))
9755 tree from = non_reference (from_type1);
9757 /* [over.ics.rank]
9759 --binding of an expression of type C to a reference of type
9760 B& is better than binding an expression of type C to a
9761 reference of type A&
9763 --conversion of C to B is better than conversion of C to A, */
9764 if (is_properly_derived_from (from, to_type1)
9765 && is_properly_derived_from (from, to_type2))
9767 if (is_properly_derived_from (to_type1, to_type2))
9768 return 1;
9769 else if (is_properly_derived_from (to_type2, to_type1))
9770 return -1;
9773 else if (CLASS_TYPE_P (non_reference (to_type1))
9774 && same_type_p (to_type1, to_type2))
9776 tree to = non_reference (to_type1);
9778 /* [over.ics.rank]
9780 --binding of an expression of type B to a reference of type
9781 A& is better than binding an expression of type C to a
9782 reference of type A&,
9784 --conversion of B to A is better than conversion of C to A */
9785 if (is_properly_derived_from (from_type1, to)
9786 && is_properly_derived_from (from_type2, to))
9788 if (is_properly_derived_from (from_type2, from_type1))
9789 return 1;
9790 else if (is_properly_derived_from (from_type1, from_type2))
9791 return -1;
9795 /* [over.ics.rank]
9797 --S1 and S2 differ only in their qualification conversion and yield
9798 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
9799 qualification signature of type T1 is a proper subset of the cv-
9800 qualification signature of type T2 */
9801 if (ics1->kind == ck_qual
9802 && ics2->kind == ck_qual
9803 && same_type_p (from_type1, from_type2))
9805 int result = comp_cv_qual_signature (to_type1, to_type2);
9806 if (result != 0)
9807 return result;
9810 /* [over.ics.rank]
9812 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
9813 to an implicit object parameter of a non-static member function
9814 declared without a ref-qualifier, and either S1 binds an lvalue
9815 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
9816 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
9817 draft standard, 13.3.3.2)
9819 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
9820 types to which the references refer are the same type except for
9821 top-level cv-qualifiers, and the type to which the reference
9822 initialized by S2 refers is more cv-qualified than the type to
9823 which the reference initialized by S1 refers.
9825 DR 1328 [over.match.best]: the context is an initialization by
9826 conversion function for direct reference binding (13.3.1.6) of a
9827 reference to function type, the return type of F1 is the same kind of
9828 reference (i.e. lvalue or rvalue) as the reference being initialized,
9829 and the return type of F2 is not. */
9831 if (ref_conv1 && ref_conv2)
9833 if (!ref_conv1->this_p && !ref_conv2->this_p
9834 && (ref_conv1->rvaluedness_matches_p
9835 != ref_conv2->rvaluedness_matches_p)
9836 && (same_type_p (ref_conv1->type, ref_conv2->type)
9837 || (TYPE_REF_IS_RVALUE (ref_conv1->type)
9838 != TYPE_REF_IS_RVALUE (ref_conv2->type))))
9840 if (ref_conv1->bad_p
9841 && !same_type_p (TREE_TYPE (ref_conv1->type),
9842 TREE_TYPE (ref_conv2->type)))
9843 /* Don't prefer a bad conversion that drops cv-quals to a bad
9844 conversion with the wrong rvalueness. */
9845 return 0;
9846 return (ref_conv1->rvaluedness_matches_p
9847 - ref_conv2->rvaluedness_matches_p);
9850 if (same_type_ignoring_top_level_qualifiers_p (to_type1, to_type2))
9852 int q1 = cp_type_quals (TREE_TYPE (ref_conv1->type));
9853 int q2 = cp_type_quals (TREE_TYPE (ref_conv2->type));
9854 if (ref_conv1->bad_p)
9856 /* Prefer the one that drops fewer cv-quals. */
9857 tree ftype = next_conversion (ref_conv1)->type;
9858 int fquals = cp_type_quals (ftype);
9859 q1 ^= fquals;
9860 q2 ^= fquals;
9862 return comp_cv_qualification (q2, q1);
9866 /* Neither conversion sequence is better than the other. */
9867 return 0;
9870 /* The source type for this standard conversion sequence. */
9872 static tree
9873 source_type (conversion *t)
9875 for (;; t = next_conversion (t))
9877 if (t->kind == ck_user
9878 || t->kind == ck_ambig
9879 || t->kind == ck_identity)
9880 return t->type;
9882 gcc_unreachable ();
9885 /* Note a warning about preferring WINNER to LOSER. We do this by storing
9886 a pointer to LOSER and re-running joust to produce the warning if WINNER
9887 is actually used. */
9889 static void
9890 add_warning (struct z_candidate *winner, struct z_candidate *loser)
9892 candidate_warning *cw = (candidate_warning *)
9893 conversion_obstack_alloc (sizeof (candidate_warning));
9894 cw->loser = loser;
9895 cw->next = winner->warnings;
9896 winner->warnings = cw;
9899 /* Compare two candidates for overloading as described in
9900 [over.match.best]. Return values:
9902 1: cand1 is better than cand2
9903 -1: cand2 is better than cand1
9904 0: cand1 and cand2 are indistinguishable */
9906 static int
9907 joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn,
9908 tsubst_flags_t complain)
9910 int winner = 0;
9911 int off1 = 0, off2 = 0;
9912 size_t i;
9913 size_t len;
9915 /* Candidates that involve bad conversions are always worse than those
9916 that don't. */
9917 if (cand1->viable > cand2->viable)
9918 return 1;
9919 if (cand1->viable < cand2->viable)
9920 return -1;
9922 /* If we have two pseudo-candidates for conversions to the same type,
9923 or two candidates for the same function, arbitrarily pick one. */
9924 if (cand1->fn == cand2->fn
9925 && (IS_TYPE_OR_DECL_P (cand1->fn)))
9926 return 1;
9928 /* Prefer a non-deleted function over an implicitly deleted move
9929 constructor or assignment operator. This differs slightly from the
9930 wording for issue 1402 (which says the move op is ignored by overload
9931 resolution), but this way produces better error messages. */
9932 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
9933 && TREE_CODE (cand2->fn) == FUNCTION_DECL
9934 && DECL_DELETED_FN (cand1->fn) != DECL_DELETED_FN (cand2->fn))
9936 if (DECL_DELETED_FN (cand1->fn) && DECL_DEFAULTED_FN (cand1->fn)
9937 && move_fn_p (cand1->fn))
9938 return -1;
9939 if (DECL_DELETED_FN (cand2->fn) && DECL_DEFAULTED_FN (cand2->fn)
9940 && move_fn_p (cand2->fn))
9941 return 1;
9944 /* a viable function F1
9945 is defined to be a better function than another viable function F2 if
9946 for all arguments i, ICSi(F1) is not a worse conversion sequence than
9947 ICSi(F2), and then */
9949 /* for some argument j, ICSj(F1) is a better conversion sequence than
9950 ICSj(F2) */
9952 /* For comparing static and non-static member functions, we ignore
9953 the implicit object parameter of the non-static function. The
9954 standard says to pretend that the static function has an object
9955 parm, but that won't work with operator overloading. */
9956 len = cand1->num_convs;
9957 if (len != cand2->num_convs)
9959 int static_1 = DECL_STATIC_FUNCTION_P (cand1->fn);
9960 int static_2 = DECL_STATIC_FUNCTION_P (cand2->fn);
9962 if (DECL_CONSTRUCTOR_P (cand1->fn)
9963 && is_list_ctor (cand1->fn) != is_list_ctor (cand2->fn))
9964 /* We're comparing a near-match list constructor and a near-match
9965 non-list constructor. Just treat them as unordered. */
9966 return 0;
9968 gcc_assert (static_1 != static_2);
9970 if (static_1)
9971 off2 = 1;
9972 else
9974 off1 = 1;
9975 --len;
9979 for (i = 0; i < len; ++i)
9981 conversion *t1 = cand1->convs[i + off1];
9982 conversion *t2 = cand2->convs[i + off2];
9983 int comp = compare_ics (t1, t2);
9985 if (comp != 0)
9987 if ((complain & tf_warning)
9988 && warn_sign_promo
9989 && (CONVERSION_RANK (t1) + CONVERSION_RANK (t2)
9990 == cr_std + cr_promotion)
9991 && t1->kind == ck_std
9992 && t2->kind == ck_std
9993 && TREE_CODE (t1->type) == INTEGER_TYPE
9994 && TREE_CODE (t2->type) == INTEGER_TYPE
9995 && (TYPE_PRECISION (t1->type)
9996 == TYPE_PRECISION (t2->type))
9997 && (TYPE_UNSIGNED (next_conversion (t1)->type)
9998 || (TREE_CODE (next_conversion (t1)->type)
9999 == ENUMERAL_TYPE)))
10001 tree type = next_conversion (t1)->type;
10002 tree type1, type2;
10003 struct z_candidate *w, *l;
10004 if (comp > 0)
10005 type1 = t1->type, type2 = t2->type,
10006 w = cand1, l = cand2;
10007 else
10008 type1 = t2->type, type2 = t1->type,
10009 w = cand2, l = cand1;
10011 if (warn)
10013 warning (OPT_Wsign_promo, "passing %qT chooses %qT over %qT",
10014 type, type1, type2);
10015 warning (OPT_Wsign_promo, " in call to %qD", w->fn);
10017 else
10018 add_warning (w, l);
10021 if (winner && comp != winner)
10023 winner = 0;
10024 goto tweak;
10026 winner = comp;
10030 /* warn about confusing overload resolution for user-defined conversions,
10031 either between a constructor and a conversion op, or between two
10032 conversion ops. */
10033 if ((complain & tf_warning)
10034 && winner && warn_conversion && cand1->second_conv
10035 && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn))
10036 && winner != compare_ics (cand1->second_conv, cand2->second_conv))
10038 struct z_candidate *w, *l;
10039 bool give_warning = false;
10041 if (winner == 1)
10042 w = cand1, l = cand2;
10043 else
10044 w = cand2, l = cand1;
10046 /* We don't want to complain about `X::operator T1 ()'
10047 beating `X::operator T2 () const', when T2 is a no less
10048 cv-qualified version of T1. */
10049 if (DECL_CONTEXT (w->fn) == DECL_CONTEXT (l->fn)
10050 && !DECL_CONSTRUCTOR_P (w->fn) && !DECL_CONSTRUCTOR_P (l->fn))
10052 tree t = TREE_TYPE (TREE_TYPE (l->fn));
10053 tree f = TREE_TYPE (TREE_TYPE (w->fn));
10055 if (TREE_CODE (t) == TREE_CODE (f) && POINTER_TYPE_P (t))
10057 t = TREE_TYPE (t);
10058 f = TREE_TYPE (f);
10060 if (!comp_ptr_ttypes (t, f))
10061 give_warning = true;
10063 else
10064 give_warning = true;
10066 if (!give_warning)
10067 /*NOP*/;
10068 else if (warn)
10070 tree source = source_type (w->convs[0]);
10071 if (! DECL_CONSTRUCTOR_P (w->fn))
10072 source = TREE_TYPE (source);
10073 if (warning (OPT_Wconversion, "choosing %qD over %qD", w->fn, l->fn)
10074 && warning (OPT_Wconversion, " for conversion from %qH to %qI",
10075 source, w->second_conv->type))
10077 inform (input_location, " because conversion sequence for the argument is better");
10080 else
10081 add_warning (w, l);
10084 if (winner)
10085 return winner;
10087 /* DR 495 moved this tiebreaker above the template ones. */
10088 /* or, if not that,
10089 the context is an initialization by user-defined conversion (see
10090 _dcl.init_ and _over.match.user_) and the standard conversion
10091 sequence from the return type of F1 to the destination type (i.e.,
10092 the type of the entity being initialized) is a better conversion
10093 sequence than the standard conversion sequence from the return type
10094 of F2 to the destination type. */
10096 if (cand1->second_conv)
10098 winner = compare_ics (cand1->second_conv, cand2->second_conv);
10099 if (winner)
10100 return winner;
10103 /* or, if not that,
10104 F1 is a non-template function and F2 is a template function
10105 specialization. */
10107 if (!cand1->template_decl && cand2->template_decl)
10108 return 1;
10109 else if (cand1->template_decl && !cand2->template_decl)
10110 return -1;
10112 /* or, if not that,
10113 F1 and F2 are template functions and the function template for F1 is
10114 more specialized than the template for F2 according to the partial
10115 ordering rules. */
10117 if (cand1->template_decl && cand2->template_decl)
10119 winner = more_specialized_fn
10120 (TI_TEMPLATE (cand1->template_decl),
10121 TI_TEMPLATE (cand2->template_decl),
10122 /* [temp.func.order]: The presence of unused ellipsis and default
10123 arguments has no effect on the partial ordering of function
10124 templates. add_function_candidate() will not have
10125 counted the "this" argument for constructors. */
10126 cand1->num_convs + DECL_CONSTRUCTOR_P (cand1->fn));
10127 if (winner)
10128 return winner;
10131 // C++ Concepts
10132 // or, if not that, F1 is more constrained than F2.
10133 if (flag_concepts && DECL_P (cand1->fn) && DECL_P (cand2->fn))
10135 winner = more_constrained (cand1->fn, cand2->fn);
10136 if (winner)
10137 return winner;
10140 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
10141 if (deduction_guide_p (cand1->fn))
10143 gcc_assert (deduction_guide_p (cand2->fn));
10144 /* We distinguish between candidates from an explicit deduction guide and
10145 candidates built from a constructor based on DECL_ARTIFICIAL. */
10146 int art1 = DECL_ARTIFICIAL (cand1->fn);
10147 int art2 = DECL_ARTIFICIAL (cand2->fn);
10148 if (art1 != art2)
10149 return art2 - art1;
10151 if (art1)
10153 /* Prefer the special copy guide over a declared copy/move
10154 constructor. */
10155 if (copy_guide_p (cand1->fn))
10156 return 1;
10157 if (copy_guide_p (cand2->fn))
10158 return -1;
10160 /* Prefer a candidate generated from a non-template constructor. */
10161 int tg1 = template_guide_p (cand1->fn);
10162 int tg2 = template_guide_p (cand2->fn);
10163 if (tg1 != tg2)
10164 return tg2 - tg1;
10168 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
10169 for all arguments the corresponding parameters of F1 and F2 have the same
10170 type (CWG 2273/2277). */
10171 if (DECL_P (cand1->fn) && DECL_CLASS_SCOPE_P (cand1->fn)
10172 && !DECL_CONV_FN_P (cand1->fn)
10173 && DECL_P (cand2->fn) && DECL_CLASS_SCOPE_P (cand2->fn)
10174 && !DECL_CONV_FN_P (cand2->fn))
10176 tree base1 = DECL_CONTEXT (strip_inheriting_ctors (cand1->fn));
10177 tree base2 = DECL_CONTEXT (strip_inheriting_ctors (cand2->fn));
10179 bool used1 = false;
10180 bool used2 = false;
10181 if (base1 == base2)
10182 /* No difference. */;
10183 else if (DERIVED_FROM_P (base1, base2))
10184 used1 = true;
10185 else if (DERIVED_FROM_P (base2, base1))
10186 used2 = true;
10188 if (int diff = used2 - used1)
10190 for (i = 0; i < len; ++i)
10192 conversion *t1 = cand1->convs[i + off1];
10193 conversion *t2 = cand2->convs[i + off2];
10194 if (!same_type_p (t1->type, t2->type))
10195 break;
10197 if (i == len)
10198 return diff;
10202 /* Check whether we can discard a builtin candidate, either because we
10203 have two identical ones or matching builtin and non-builtin candidates.
10205 (Pedantically in the latter case the builtin which matched the user
10206 function should not be added to the overload set, but we spot it here.
10208 [over.match.oper]
10209 ... the builtin candidates include ...
10210 - do not have the same parameter type list as any non-template
10211 non-member candidate. */
10213 if (identifier_p (cand1->fn) || identifier_p (cand2->fn))
10215 for (i = 0; i < len; ++i)
10216 if (!same_type_p (cand1->convs[i]->type,
10217 cand2->convs[i]->type))
10218 break;
10219 if (i == cand1->num_convs)
10221 if (cand1->fn == cand2->fn)
10222 /* Two built-in candidates; arbitrarily pick one. */
10223 return 1;
10224 else if (identifier_p (cand1->fn))
10225 /* cand1 is built-in; prefer cand2. */
10226 return -1;
10227 else
10228 /* cand2 is built-in; prefer cand1. */
10229 return 1;
10233 /* For candidates of a multi-versioned function, make the version with
10234 the highest priority win. This version will be checked for dispatching
10235 first. If this version can be inlined into the caller, the front-end
10236 will simply make a direct call to this function. */
10238 if (TREE_CODE (cand1->fn) == FUNCTION_DECL
10239 && DECL_FUNCTION_VERSIONED (cand1->fn)
10240 && TREE_CODE (cand2->fn) == FUNCTION_DECL
10241 && DECL_FUNCTION_VERSIONED (cand2->fn))
10243 tree f1 = TREE_TYPE (cand1->fn);
10244 tree f2 = TREE_TYPE (cand2->fn);
10245 tree p1 = TYPE_ARG_TYPES (f1);
10246 tree p2 = TYPE_ARG_TYPES (f2);
10248 /* Check if cand1->fn and cand2->fn are versions of the same function. It
10249 is possible that cand1->fn and cand2->fn are function versions but of
10250 different functions. Check types to see if they are versions of the same
10251 function. */
10252 if (compparms (p1, p2)
10253 && same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
10255 /* Always make the version with the higher priority, more
10256 specialized, win. */
10257 gcc_assert (targetm.compare_version_priority);
10258 if (targetm.compare_version_priority (cand1->fn, cand2->fn) >= 0)
10259 return 1;
10260 else
10261 return -1;
10265 /* If the two function declarations represent the same function (this can
10266 happen with declarations in multiple scopes and arg-dependent lookup),
10267 arbitrarily choose one. But first make sure the default args we're
10268 using match. */
10269 if (DECL_P (cand1->fn) && DECL_P (cand2->fn)
10270 && equal_functions (cand1->fn, cand2->fn))
10272 tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (cand1->fn));
10273 tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (cand2->fn));
10275 gcc_assert (!DECL_CONSTRUCTOR_P (cand1->fn));
10277 for (i = 0; i < len; ++i)
10279 /* Don't crash if the fn is variadic. */
10280 if (!parms1)
10281 break;
10282 parms1 = TREE_CHAIN (parms1);
10283 parms2 = TREE_CHAIN (parms2);
10286 if (off1)
10287 parms1 = TREE_CHAIN (parms1);
10288 else if (off2)
10289 parms2 = TREE_CHAIN (parms2);
10291 for (; parms1; ++i)
10293 if (!cp_tree_equal (TREE_PURPOSE (parms1),
10294 TREE_PURPOSE (parms2)))
10296 if (warn)
10298 if (complain & tf_error)
10300 if (permerror (input_location,
10301 "default argument mismatch in "
10302 "overload resolution"))
10304 inform (DECL_SOURCE_LOCATION (cand1->fn),
10305 " candidate 1: %q#F", cand1->fn);
10306 inform (DECL_SOURCE_LOCATION (cand2->fn),
10307 " candidate 2: %q#F", cand2->fn);
10310 else
10311 return 0;
10313 else
10314 add_warning (cand1, cand2);
10315 break;
10317 parms1 = TREE_CHAIN (parms1);
10318 parms2 = TREE_CHAIN (parms2);
10321 return 1;
10324 tweak:
10326 /* Extension: If the worst conversion for one candidate is worse than the
10327 worst conversion for the other, take the first. */
10328 if (!pedantic && (complain & tf_warning_or_error))
10330 conversion_rank rank1 = cr_identity, rank2 = cr_identity;
10331 struct z_candidate *w = 0, *l = 0;
10333 for (i = 0; i < len; ++i)
10335 if (CONVERSION_RANK (cand1->convs[i+off1]) > rank1)
10336 rank1 = CONVERSION_RANK (cand1->convs[i+off1]);
10337 if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2)
10338 rank2 = CONVERSION_RANK (cand2->convs[i + off2]);
10340 if (rank1 < rank2)
10341 winner = 1, w = cand1, l = cand2;
10342 if (rank1 > rank2)
10343 winner = -1, w = cand2, l = cand1;
10344 if (winner)
10346 /* Don't choose a deleted function over ambiguity. */
10347 if (DECL_P (w->fn) && DECL_DELETED_FN (w->fn))
10348 return 0;
10349 if (warn)
10351 pedwarn (input_location, 0,
10352 "ISO C++ says that these are ambiguous, even "
10353 "though the worst conversion for the first is better than "
10354 "the worst conversion for the second:");
10355 print_z_candidate (input_location, _("candidate 1:"), w);
10356 print_z_candidate (input_location, _("candidate 2:"), l);
10358 else
10359 add_warning (w, l);
10360 return winner;
10364 gcc_assert (!winner);
10365 return 0;
10368 /* Given a list of candidates for overloading, find the best one, if any.
10369 This algorithm has a worst case of O(2n) (winner is last), and a best
10370 case of O(n/2) (totally ambiguous); much better than a sorting
10371 algorithm. */
10373 static struct z_candidate *
10374 tourney (struct z_candidate *candidates, tsubst_flags_t complain)
10376 struct z_candidate *champ = candidates, *challenger;
10377 int fate;
10378 int champ_compared_to_predecessor = 0;
10380 /* Walk through the list once, comparing each current champ to the next
10381 candidate, knocking out a candidate or two with each comparison. */
10383 for (challenger = champ->next; challenger; )
10385 fate = joust (champ, challenger, 0, complain);
10386 if (fate == 1)
10387 challenger = challenger->next;
10388 else
10390 if (fate == 0)
10392 champ = challenger->next;
10393 if (champ == 0)
10394 return NULL;
10395 champ_compared_to_predecessor = 0;
10397 else
10399 champ = challenger;
10400 champ_compared_to_predecessor = 1;
10403 challenger = champ->next;
10407 /* Make sure the champ is better than all the candidates it hasn't yet
10408 been compared to. */
10410 for (challenger = candidates;
10411 challenger != champ
10412 && !(champ_compared_to_predecessor && challenger->next == champ);
10413 challenger = challenger->next)
10415 fate = joust (champ, challenger, 0, complain);
10416 if (fate != 1)
10417 return NULL;
10420 return champ;
10423 /* Returns nonzero if things of type FROM can be converted to TO. */
10425 bool
10426 can_convert (tree to, tree from, tsubst_flags_t complain)
10428 tree arg = NULL_TREE;
10429 /* implicit_conversion only considers user-defined conversions
10430 if it has an expression for the call argument list. */
10431 if (CLASS_TYPE_P (from) || CLASS_TYPE_P (to))
10432 arg = build1 (CAST_EXPR, from, NULL_TREE);
10433 return can_convert_arg (to, from, arg, LOOKUP_IMPLICIT, complain);
10436 /* Returns nonzero if things of type FROM can be converted to TO with a
10437 standard conversion. */
10439 bool
10440 can_convert_standard (tree to, tree from, tsubst_flags_t complain)
10442 return can_convert_arg (to, from, NULL_TREE, LOOKUP_IMPLICIT, complain);
10445 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
10447 bool
10448 can_convert_arg (tree to, tree from, tree arg, int flags,
10449 tsubst_flags_t complain)
10451 conversion *t;
10452 void *p;
10453 bool ok_p;
10455 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10456 p = conversion_obstack_alloc (0);
10457 /* We want to discard any access checks done for this test,
10458 as we might not be in the appropriate access context and
10459 we'll do the check again when we actually perform the
10460 conversion. */
10461 push_deferring_access_checks (dk_deferred);
10463 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
10464 flags, complain);
10465 ok_p = (t && !t->bad_p);
10467 /* Discard the access checks now. */
10468 pop_deferring_access_checks ();
10469 /* Free all the conversions we allocated. */
10470 obstack_free (&conversion_obstack, p);
10472 return ok_p;
10475 /* Like can_convert_arg, but allows dubious conversions as well. */
10477 bool
10478 can_convert_arg_bad (tree to, tree from, tree arg, int flags,
10479 tsubst_flags_t complain)
10481 conversion *t;
10482 void *p;
10484 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10485 p = conversion_obstack_alloc (0);
10486 /* Try to perform the conversion. */
10487 t = implicit_conversion (to, from, arg, /*c_cast_p=*/false,
10488 flags, complain);
10489 /* Free all the conversions we allocated. */
10490 obstack_free (&conversion_obstack, p);
10492 return t != NULL;
10495 /* Convert EXPR to TYPE. Return the converted expression.
10497 Note that we allow bad conversions here because by the time we get to
10498 this point we are committed to doing the conversion. If we end up
10499 doing a bad conversion, convert_like will complain. */
10501 tree
10502 perform_implicit_conversion_flags (tree type, tree expr,
10503 tsubst_flags_t complain, int flags)
10505 conversion *conv;
10506 void *p;
10507 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
10509 if (error_operand_p (expr))
10510 return error_mark_node;
10512 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10513 p = conversion_obstack_alloc (0);
10515 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
10516 /*c_cast_p=*/false,
10517 flags, complain);
10519 if (!conv)
10521 if (complain & tf_error)
10523 /* If expr has unknown type, then it is an overloaded function.
10524 Call instantiate_type to get good error messages. */
10525 if (TREE_TYPE (expr) == unknown_type_node)
10526 instantiate_type (type, expr, complain);
10527 else if (invalid_nonstatic_memfn_p (loc, expr, complain))
10528 /* We gave an error. */;
10529 else
10530 error_at (loc, "could not convert %qE from %qH to %qI", expr,
10531 TREE_TYPE (expr), type);
10533 expr = error_mark_node;
10535 else if (processing_template_decl && conv->kind != ck_identity)
10537 /* In a template, we are only concerned about determining the
10538 type of non-dependent expressions, so we do not have to
10539 perform the actual conversion. But for initializers, we
10540 need to be able to perform it at instantiation
10541 (or instantiate_non_dependent_expr) time. */
10542 expr = build1 (IMPLICIT_CONV_EXPR, type, expr);
10543 if (!(flags & LOOKUP_ONLYCONVERTING))
10544 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr) = true;
10546 else
10547 expr = convert_like (conv, expr, complain);
10549 /* Free all the conversions we allocated. */
10550 obstack_free (&conversion_obstack, p);
10552 return expr;
10555 tree
10556 perform_implicit_conversion (tree type, tree expr, tsubst_flags_t complain)
10558 return perform_implicit_conversion_flags (type, expr, complain,
10559 LOOKUP_IMPLICIT);
10562 /* Convert EXPR to TYPE (as a direct-initialization) if that is
10563 permitted. If the conversion is valid, the converted expression is
10564 returned. Otherwise, NULL_TREE is returned, except in the case
10565 that TYPE is a class type; in that case, an error is issued. If
10566 C_CAST_P is true, then this direct-initialization is taking
10567 place as part of a static_cast being attempted as part of a C-style
10568 cast. */
10570 tree
10571 perform_direct_initialization_if_possible (tree type,
10572 tree expr,
10573 bool c_cast_p,
10574 tsubst_flags_t complain)
10576 conversion *conv;
10577 void *p;
10579 if (type == error_mark_node || error_operand_p (expr))
10580 return error_mark_node;
10581 /* [dcl.init]
10583 If the destination type is a (possibly cv-qualified) class type:
10585 -- If the initialization is direct-initialization ...,
10586 constructors are considered. ... If no constructor applies, or
10587 the overload resolution is ambiguous, the initialization is
10588 ill-formed. */
10589 if (CLASS_TYPE_P (type))
10591 vec<tree, va_gc> *args = make_tree_vector_single (expr);
10592 expr = build_special_member_call (NULL_TREE, complete_ctor_identifier,
10593 &args, type, LOOKUP_NORMAL, complain);
10594 release_tree_vector (args);
10595 return build_cplus_new (type, expr, complain);
10598 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10599 p = conversion_obstack_alloc (0);
10601 conv = implicit_conversion (type, TREE_TYPE (expr), expr,
10602 c_cast_p,
10603 LOOKUP_NORMAL, complain);
10604 if (!conv || conv->bad_p)
10605 expr = NULL_TREE;
10606 else
10607 expr = convert_like_real (conv, expr, NULL_TREE, 0,
10608 /*issue_conversion_warnings=*/false,
10609 c_cast_p,
10610 complain);
10612 /* Free all the conversions we allocated. */
10613 obstack_free (&conversion_obstack, p);
10615 return expr;
10618 /* When initializing a reference that lasts longer than a full-expression,
10619 this special rule applies:
10621 [class.temporary]
10623 The temporary to which the reference is bound or the temporary
10624 that is the complete object to which the reference is bound
10625 persists for the lifetime of the reference.
10627 The temporaries created during the evaluation of the expression
10628 initializing the reference, except the temporary to which the
10629 reference is bound, are destroyed at the end of the
10630 full-expression in which they are created.
10632 In that case, we store the converted expression into a new
10633 VAR_DECL in a new scope.
10635 However, we want to be careful not to create temporaries when
10636 they are not required. For example, given:
10638 struct B {};
10639 struct D : public B {};
10640 D f();
10641 const B& b = f();
10643 there is no need to copy the return value from "f"; we can just
10644 extend its lifetime. Similarly, given:
10646 struct S {};
10647 struct T { operator S(); };
10648 T t;
10649 const S& s = t;
10651 we can extend the lifetime of the return value of the conversion
10652 operator.
10654 The next several functions are involved in this lifetime extension. */
10656 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
10657 reference is being bound to a temporary. Create and return a new
10658 VAR_DECL with the indicated TYPE; this variable will store the value to
10659 which the reference is bound. */
10661 tree
10662 make_temporary_var_for_ref_to_temp (tree decl, tree type)
10664 tree var = create_temporary_var (type);
10666 /* Register the variable. */
10667 if (VAR_P (decl)
10668 && (TREE_STATIC (decl) || CP_DECL_THREAD_LOCAL_P (decl)))
10670 /* Namespace-scope or local static; give it a mangled name. */
10671 /* FIXME share comdat with decl? */
10673 TREE_STATIC (var) = TREE_STATIC (decl);
10674 CP_DECL_THREAD_LOCAL_P (var) = CP_DECL_THREAD_LOCAL_P (decl);
10675 set_decl_tls_model (var, DECL_TLS_MODEL (decl));
10677 tree name = mangle_ref_init_variable (decl);
10678 DECL_NAME (var) = name;
10679 SET_DECL_ASSEMBLER_NAME (var, name);
10681 var = pushdecl (var);
10683 else
10684 /* Create a new cleanup level if necessary. */
10685 maybe_push_cleanup_level (type);
10687 return var;
10690 /* EXPR is the initializer for a variable DECL of reference or
10691 std::initializer_list type. Create, push and return a new VAR_DECL
10692 for the initializer so that it will live as long as DECL. Any
10693 cleanup for the new variable is returned through CLEANUP, and the
10694 code to initialize the new variable is returned through INITP. */
10696 static tree
10697 set_up_extended_ref_temp (tree decl, tree expr, vec<tree, va_gc> **cleanups,
10698 tree *initp)
10700 tree init;
10701 tree type;
10702 tree var;
10704 /* Create the temporary variable. */
10705 type = TREE_TYPE (expr);
10706 var = make_temporary_var_for_ref_to_temp (decl, type);
10707 layout_decl (var, 0);
10708 /* If the rvalue is the result of a function call it will be
10709 a TARGET_EXPR. If it is some other construct (such as a
10710 member access expression where the underlying object is
10711 itself the result of a function call), turn it into a
10712 TARGET_EXPR here. It is important that EXPR be a
10713 TARGET_EXPR below since otherwise the INIT_EXPR will
10714 attempt to make a bitwise copy of EXPR to initialize
10715 VAR. */
10716 if (TREE_CODE (expr) != TARGET_EXPR)
10717 expr = get_target_expr (expr);
10719 if (TREE_CODE (decl) == FIELD_DECL
10720 && extra_warnings && !TREE_NO_WARNING (decl))
10722 warning (OPT_Wextra, "a temporary bound to %qD only persists "
10723 "until the constructor exits", decl);
10724 TREE_NO_WARNING (decl) = true;
10727 /* Recursively extend temps in this initializer. */
10728 TARGET_EXPR_INITIAL (expr)
10729 = extend_ref_init_temps (decl, TARGET_EXPR_INITIAL (expr), cleanups);
10731 /* Any reference temp has a non-trivial initializer. */
10732 DECL_NONTRIVIALLY_INITIALIZED_P (var) = true;
10734 /* If the initializer is constant, put it in DECL_INITIAL so we get
10735 static initialization and use in constant expressions. */
10736 init = maybe_constant_init (expr);
10737 if (TREE_CONSTANT (init))
10739 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
10741 /* 5.19 says that a constant expression can include an
10742 lvalue-rvalue conversion applied to "a glvalue of literal type
10743 that refers to a non-volatile temporary object initialized
10744 with a constant expression". Rather than try to communicate
10745 that this VAR_DECL is a temporary, just mark it constexpr.
10747 Currently this is only useful for initializer_list temporaries,
10748 since reference vars can't appear in constant expressions. */
10749 DECL_DECLARED_CONSTEXPR_P (var) = true;
10750 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var) = true;
10751 TREE_CONSTANT (var) = true;
10753 DECL_INITIAL (var) = init;
10754 init = NULL_TREE;
10756 else
10757 /* Create the INIT_EXPR that will initialize the temporary
10758 variable. */
10759 init = split_nonconstant_init (var, expr);
10760 if (at_function_scope_p ())
10762 add_decl_expr (var);
10764 if (TREE_STATIC (var))
10765 init = add_stmt_to_compound (init, register_dtor_fn (var));
10766 else
10768 tree cleanup = cxx_maybe_build_cleanup (var, tf_warning_or_error);
10769 if (cleanup)
10770 vec_safe_push (*cleanups, cleanup);
10773 /* We must be careful to destroy the temporary only
10774 after its initialization has taken place. If the
10775 initialization throws an exception, then the
10776 destructor should not be run. We cannot simply
10777 transform INIT into something like:
10779 (INIT, ({ CLEANUP_STMT; }))
10781 because emit_local_var always treats the
10782 initializer as a full-expression. Thus, the
10783 destructor would run too early; it would run at the
10784 end of initializing the reference variable, rather
10785 than at the end of the block enclosing the
10786 reference variable.
10788 The solution is to pass back a cleanup expression
10789 which the caller is responsible for attaching to
10790 the statement tree. */
10792 else
10794 rest_of_decl_compilation (var, /*toplev=*/1, at_eof);
10795 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
10797 if (CP_DECL_THREAD_LOCAL_P (var))
10798 tls_aggregates = tree_cons (NULL_TREE, var,
10799 tls_aggregates);
10800 else
10801 static_aggregates = tree_cons (NULL_TREE, var,
10802 static_aggregates);
10804 else
10805 /* Check whether the dtor is callable. */
10806 cxx_maybe_build_cleanup (var, tf_warning_or_error);
10808 /* Avoid -Wunused-variable warning (c++/38958). */
10809 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
10810 && VAR_P (decl))
10811 TREE_USED (decl) = DECL_READ_P (decl) = true;
10813 *initp = init;
10814 return var;
10817 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
10818 initializing a variable of that TYPE. */
10820 tree
10821 initialize_reference (tree type, tree expr,
10822 int flags, tsubst_flags_t complain)
10824 conversion *conv;
10825 void *p;
10826 location_t loc = EXPR_LOC_OR_LOC (expr, input_location);
10828 if (type == error_mark_node || error_operand_p (expr))
10829 return error_mark_node;
10831 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10832 p = conversion_obstack_alloc (0);
10834 conv = reference_binding (type, TREE_TYPE (expr), expr, /*c_cast_p=*/false,
10835 flags, complain);
10836 if (!conv || conv->bad_p)
10838 if (complain & tf_error)
10840 if (conv)
10841 convert_like (conv, expr, complain);
10842 else if (!CP_TYPE_CONST_P (TREE_TYPE (type))
10843 && !TYPE_REF_IS_RVALUE (type)
10844 && !lvalue_p (expr))
10845 error_at (loc, "invalid initialization of non-const reference of "
10846 "type %qH from an rvalue of type %qI",
10847 type, TREE_TYPE (expr));
10848 else
10849 error_at (loc, "invalid initialization of reference of type "
10850 "%qH from expression of type %qI", type,
10851 TREE_TYPE (expr));
10853 return error_mark_node;
10856 if (conv->kind == ck_ref_bind)
10857 /* Perform the conversion. */
10858 expr = convert_like (conv, expr, complain);
10859 else if (conv->kind == ck_ambig)
10860 /* We gave an error in build_user_type_conversion_1. */
10861 expr = error_mark_node;
10862 else
10863 gcc_unreachable ();
10865 /* Free all the conversions we allocated. */
10866 obstack_free (&conversion_obstack, p);
10868 return expr;
10871 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
10872 which is bound either to a reference or a std::initializer_list. */
10874 static tree
10875 extend_ref_init_temps_1 (tree decl, tree init, vec<tree, va_gc> **cleanups)
10877 tree sub = init;
10878 tree *p;
10879 STRIP_NOPS (sub);
10880 if (TREE_CODE (sub) == COMPOUND_EXPR)
10882 TREE_OPERAND (sub, 1)
10883 = extend_ref_init_temps_1 (decl, TREE_OPERAND (sub, 1), cleanups);
10884 return init;
10886 if (TREE_CODE (sub) != ADDR_EXPR)
10887 return init;
10888 /* Deal with binding to a subobject. */
10889 for (p = &TREE_OPERAND (sub, 0); TREE_CODE (*p) == COMPONENT_REF; )
10890 p = &TREE_OPERAND (*p, 0);
10891 if (TREE_CODE (*p) == TARGET_EXPR)
10893 tree subinit = NULL_TREE;
10894 *p = set_up_extended_ref_temp (decl, *p, cleanups, &subinit);
10895 recompute_tree_invariant_for_addr_expr (sub);
10896 if (init != sub)
10897 init = fold_convert (TREE_TYPE (init), sub);
10898 if (subinit)
10899 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), subinit, init);
10901 return init;
10904 /* INIT is part of the initializer for DECL. If there are any
10905 reference or initializer lists being initialized, extend their
10906 lifetime to match that of DECL. */
10908 tree
10909 extend_ref_init_temps (tree decl, tree init, vec<tree, va_gc> **cleanups)
10911 tree type = TREE_TYPE (init);
10912 if (processing_template_decl)
10913 return init;
10914 if (TREE_CODE (type) == REFERENCE_TYPE)
10915 init = extend_ref_init_temps_1 (decl, init, cleanups);
10916 else
10918 tree ctor = init;
10919 if (TREE_CODE (ctor) == TARGET_EXPR)
10920 ctor = TARGET_EXPR_INITIAL (ctor);
10921 if (TREE_CODE (ctor) == CONSTRUCTOR)
10923 if (is_std_init_list (type))
10925 /* The temporary array underlying a std::initializer_list
10926 is handled like a reference temporary. */
10927 tree array = CONSTRUCTOR_ELT (ctor, 0)->value;
10928 array = extend_ref_init_temps_1 (decl, array, cleanups);
10929 CONSTRUCTOR_ELT (ctor, 0)->value = array;
10931 else
10933 unsigned i;
10934 constructor_elt *p;
10935 vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (ctor);
10936 FOR_EACH_VEC_SAFE_ELT (elts, i, p)
10937 p->value = extend_ref_init_temps (decl, p->value, cleanups);
10939 recompute_constructor_flags (ctor);
10940 if (decl_maybe_constant_var_p (decl) && TREE_CONSTANT (ctor))
10941 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
10945 return init;
10948 /* Returns true iff an initializer for TYPE could contain temporaries that
10949 need to be extended because they are bound to references or
10950 std::initializer_list. */
10952 bool
10953 type_has_extended_temps (tree type)
10955 type = strip_array_types (type);
10956 if (TREE_CODE (type) == REFERENCE_TYPE)
10957 return true;
10958 if (CLASS_TYPE_P (type))
10960 if (is_std_init_list (type))
10961 return true;
10962 for (tree f = next_initializable_field (TYPE_FIELDS (type));
10963 f; f = next_initializable_field (DECL_CHAIN (f)))
10964 if (type_has_extended_temps (TREE_TYPE (f)))
10965 return true;
10967 return false;
10970 /* Returns true iff TYPE is some variant of std::initializer_list. */
10972 bool
10973 is_std_init_list (tree type)
10975 if (!TYPE_P (type))
10976 return false;
10977 if (cxx_dialect == cxx98)
10978 return false;
10979 /* Look through typedefs. */
10980 type = TYPE_MAIN_VARIANT (type);
10981 return (CLASS_TYPE_P (type)
10982 && CP_TYPE_CONTEXT (type) == std_node
10983 && init_list_identifier == DECL_NAME (TYPE_NAME (type)));
10986 /* Returns true iff DECL is a list constructor: i.e. a constructor which
10987 will accept an argument list of a single std::initializer_list<T>. */
10989 bool
10990 is_list_ctor (tree decl)
10992 tree args = FUNCTION_FIRST_USER_PARMTYPE (decl);
10993 tree arg;
10995 if (!args || args == void_list_node)
10996 return false;
10998 arg = non_reference (TREE_VALUE (args));
10999 if (!is_std_init_list (arg))
11000 return false;
11002 args = TREE_CHAIN (args);
11004 if (args && args != void_list_node && !TREE_PURPOSE (args))
11005 /* There are more non-defaulted parms. */
11006 return false;
11008 return true;
11011 #include "gt-cp-call.h"